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. */
51 #define obstack_chunk_alloc xmalloc
52 #define obstack_chunk_free free
53 /* obstack.[ch] explicitly declined to prototype this. */
54 extern int _obstack_allocated_p
PROTO ((struct obstack
*h
, GENERIC_PTR obj
));
56 /* Tree nodes of permanent duration are allocated in this obstack.
57 They are the identifier nodes, and everything outside of
58 the bodies and parameters of function definitions. */
60 struct obstack permanent_obstack
;
62 /* The initial RTL, and all ..._TYPE nodes, in a function
63 are allocated in this obstack. Usually they are freed at the
64 end of the function, but if the function is inline they are saved.
65 For top-level functions, this is maybepermanent_obstack.
66 Separate obstacks are made for nested functions. */
68 struct obstack
*function_maybepermanent_obstack
;
70 /* This is the function_maybepermanent_obstack for top-level functions. */
72 struct obstack maybepermanent_obstack
;
74 /* This is a list of function_maybepermanent_obstacks for top-level inline
75 functions that are compiled in the middle of compiling other functions. */
77 struct simple_obstack_stack
*toplev_inline_obstacks
;
79 /* Former elements of toplev_inline_obstacks that have been recycled. */
81 struct simple_obstack_stack
*extra_inline_obstacks
;
83 /* This is a list of function_maybepermanent_obstacks for inline functions
84 nested in the current function that were compiled in the middle of
85 compiling other functions. */
87 struct simple_obstack_stack
*inline_obstacks
;
89 /* The contents of the current function definition are allocated
90 in this obstack, and all are freed at the end of the function.
91 For top-level functions, this is temporary_obstack.
92 Separate obstacks are made for nested functions. */
94 struct obstack
*function_obstack
;
96 /* This is used for reading initializers of global variables. */
98 struct obstack temporary_obstack
;
100 /* The tree nodes of an expression are allocated
101 in this obstack, and all are freed at the end of the expression. */
103 struct obstack momentary_obstack
;
105 /* The tree nodes of a declarator are allocated
106 in this obstack, and all are freed when the declarator
109 static struct obstack temp_decl_obstack
;
111 /* This points at either permanent_obstack
112 or the current function_maybepermanent_obstack. */
114 struct obstack
*saveable_obstack
;
116 /* This is same as saveable_obstack during parse and expansion phase;
117 it points to the current function's obstack during optimization.
118 This is the obstack to be used for creating rtl objects. */
120 struct obstack
*rtl_obstack
;
122 /* This points at either permanent_obstack or the current function_obstack. */
124 struct obstack
*current_obstack
;
126 /* This points at either permanent_obstack or the current function_obstack
127 or momentary_obstack. */
129 struct obstack
*expression_obstack
;
131 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
135 struct obstack_stack
*next
;
136 struct obstack
*current
;
137 struct obstack
*saveable
;
138 struct obstack
*expression
;
142 struct obstack_stack
*obstack_stack
;
144 /* Obstack for allocating struct obstack_stack entries. */
146 static struct obstack obstack_stack_obstack
;
148 /* Addresses of first objects in some obstacks.
149 This is for freeing their entire contents. */
150 char *maybepermanent_firstobj
;
151 char *temporary_firstobj
;
152 char *momentary_firstobj
;
153 char *temp_decl_firstobj
;
155 /* This is used to preserve objects (mainly array initializers) that need to
156 live until the end of the current function, but no further. */
157 char *momentary_function_firstobj
;
159 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
161 int all_types_permanent
;
163 /* Stack of places to restore the momentary obstack back to. */
165 struct momentary_level
167 /* Pointer back to previous such level. */
168 struct momentary_level
*prev
;
169 /* First object allocated within this level. */
171 /* Value of expression_obstack saved at entry to this level. */
172 struct obstack
*obstack
;
175 struct momentary_level
*momentary_stack
;
177 /* Table indexed by tree code giving a string containing a character
178 classifying the tree code. Possibilities are
179 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
181 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
183 char tree_code_type
[MAX_TREE_CODES
] = {
188 /* Table indexed by tree code giving number of expression
189 operands beyond the fixed part of the node structure.
190 Not used for types or decls. */
192 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
194 int tree_code_length
[MAX_TREE_CODES
] = {
199 /* Names of tree components.
200 Used for printing out the tree and error messages. */
201 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
203 char *tree_code_name
[MAX_TREE_CODES
] = {
208 /* Statistics-gathering stuff. */
229 int tree_node_counts
[(int)all_kinds
];
230 int tree_node_sizes
[(int)all_kinds
];
231 int id_string_size
= 0;
233 char *tree_node_kind_names
[] = {
251 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
253 #define MAX_HASH_TABLE 1009
254 static tree hash_table
[MAX_HASH_TABLE
]; /* id hash buckets */
256 /* 0 while creating built-in identifiers. */
257 static int do_identifier_warnings
;
259 /* Unique id for next decl created. */
260 static int next_decl_uid
;
261 /* Unique id for next type created. */
262 static int next_type_uid
= 1;
264 /* Here is how primitive or already-canonicalized types' hash
266 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
268 extern char *mode_name
[];
270 void gcc_obstack_init ();
272 /* Init the principal obstacks. */
277 gcc_obstack_init (&obstack_stack_obstack
);
278 gcc_obstack_init (&permanent_obstack
);
280 gcc_obstack_init (&temporary_obstack
);
281 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
282 gcc_obstack_init (&momentary_obstack
);
283 momentary_firstobj
= (char *) obstack_alloc (&momentary_obstack
, 0);
284 momentary_function_firstobj
= momentary_firstobj
;
285 gcc_obstack_init (&maybepermanent_obstack
);
286 maybepermanent_firstobj
287 = (char *) obstack_alloc (&maybepermanent_obstack
, 0);
288 gcc_obstack_init (&temp_decl_obstack
);
289 temp_decl_firstobj
= (char *) obstack_alloc (&temp_decl_obstack
, 0);
291 function_obstack
= &temporary_obstack
;
292 function_maybepermanent_obstack
= &maybepermanent_obstack
;
293 current_obstack
= &permanent_obstack
;
294 expression_obstack
= &permanent_obstack
;
295 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
297 /* Init the hash table of identifiers. */
298 bzero ((char *) hash_table
, sizeof hash_table
);
302 gcc_obstack_init (obstack
)
303 struct obstack
*obstack
;
305 /* Let particular systems override the size of a chunk. */
306 #ifndef OBSTACK_CHUNK_SIZE
307 #define OBSTACK_CHUNK_SIZE 0
309 /* Let them override the alloc and free routines too. */
310 #ifndef OBSTACK_CHUNK_ALLOC
311 #define OBSTACK_CHUNK_ALLOC xmalloc
313 #ifndef OBSTACK_CHUNK_FREE
314 #define OBSTACK_CHUNK_FREE free
316 _obstack_begin (obstack
, OBSTACK_CHUNK_SIZE
, 0,
317 (void *(*) ()) OBSTACK_CHUNK_ALLOC
,
318 (void (*) ()) OBSTACK_CHUNK_FREE
);
321 /* Save all variables describing the current status into the structure *P.
322 This is used before starting a nested function.
324 CONTEXT is the decl_function_context for the function we're about to
325 compile; if it isn't current_function_decl, we have to play some games. */
328 save_tree_status (p
, context
)
332 p
->all_types_permanent
= all_types_permanent
;
333 p
->momentary_stack
= momentary_stack
;
334 p
->maybepermanent_firstobj
= maybepermanent_firstobj
;
335 p
->temporary_firstobj
= temporary_firstobj
;
336 p
->momentary_firstobj
= momentary_firstobj
;
337 p
->momentary_function_firstobj
= momentary_function_firstobj
;
338 p
->function_obstack
= function_obstack
;
339 p
->function_maybepermanent_obstack
= function_maybepermanent_obstack
;
340 p
->current_obstack
= current_obstack
;
341 p
->expression_obstack
= expression_obstack
;
342 p
->saveable_obstack
= saveable_obstack
;
343 p
->rtl_obstack
= rtl_obstack
;
344 p
->inline_obstacks
= inline_obstacks
;
346 if (context
== current_function_decl
)
347 /* Objects that need to be saved in this function can be in the nonsaved
348 obstack of the enclosing function since they can't possibly be needed
349 once it has returned. */
350 function_maybepermanent_obstack
= function_obstack
;
353 /* We're compiling a function which isn't nested in the current
354 function. We need to create a new maybepermanent_obstack for this
355 function, since it can't go onto any of the existing obstacks. */
356 struct simple_obstack_stack
**head
;
357 struct simple_obstack_stack
*current
;
359 if (context
== NULL_TREE
)
360 head
= &toplev_inline_obstacks
;
363 struct function
*f
= find_function_data (context
);
364 head
= &f
->inline_obstacks
;
367 if (context
== NULL_TREE
&& extra_inline_obstacks
)
369 current
= extra_inline_obstacks
;
370 extra_inline_obstacks
= current
->next
;
374 current
= ((struct simple_obstack_stack
*)
375 xmalloc (sizeof (struct simple_obstack_stack
)));
378 = (struct obstack
*) xmalloc (sizeof (struct obstack
));
379 gcc_obstack_init (current
->obstack
);
382 function_maybepermanent_obstack
= current
->obstack
;
384 current
->next
= *head
;
388 maybepermanent_firstobj
389 = (char *) obstack_finish (function_maybepermanent_obstack
);
391 function_obstack
= (struct obstack
*) xmalloc (sizeof (struct obstack
));
392 gcc_obstack_init (function_obstack
);
394 current_obstack
= &permanent_obstack
;
395 expression_obstack
= &permanent_obstack
;
396 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
398 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
399 momentary_firstobj
= (char *) obstack_finish (&momentary_obstack
);
400 momentary_function_firstobj
= momentary_firstobj
;
403 /* Restore all variables describing the current status from the structure *P.
404 This is used after a nested function. */
407 restore_tree_status (p
, context
)
411 all_types_permanent
= p
->all_types_permanent
;
412 momentary_stack
= p
->momentary_stack
;
414 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
416 /* Free saveable storage used by the function just compiled and not
419 CAUTION: This is in function_obstack of the containing function.
420 So we must be sure that we never allocate from that obstack during
421 the compilation of a nested function if we expect it to survive
422 past the nested function's end. */
423 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
425 /* If we were compiling a toplevel function, we can free this space now. */
426 if (context
== NULL_TREE
)
428 obstack_free (&temporary_obstack
, temporary_firstobj
);
429 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
432 /* If we were compiling a toplevel function that we don't actually want
433 to save anything from, return the obstack to the pool. */
434 if (context
== NULL_TREE
435 && obstack_empty_p (function_maybepermanent_obstack
))
437 struct simple_obstack_stack
*current
, **p
= &toplev_inline_obstacks
;
441 while ((*p
)->obstack
!= function_maybepermanent_obstack
)
446 current
->next
= extra_inline_obstacks
;
447 extra_inline_obstacks
= current
;
451 obstack_free (function_obstack
, 0);
452 free (function_obstack
);
454 temporary_firstobj
= p
->temporary_firstobj
;
455 momentary_firstobj
= p
->momentary_firstobj
;
456 momentary_function_firstobj
= p
->momentary_function_firstobj
;
457 maybepermanent_firstobj
= p
->maybepermanent_firstobj
;
458 function_obstack
= p
->function_obstack
;
459 function_maybepermanent_obstack
= p
->function_maybepermanent_obstack
;
460 current_obstack
= p
->current_obstack
;
461 expression_obstack
= p
->expression_obstack
;
462 saveable_obstack
= p
->saveable_obstack
;
463 rtl_obstack
= p
->rtl_obstack
;
464 inline_obstacks
= p
->inline_obstacks
;
467 /* Start allocating on the temporary (per function) obstack.
468 This is done in start_function before parsing the function body,
469 and before each initialization at top level, and to go back
470 to temporary allocation after doing permanent_allocation. */
473 temporary_allocation ()
475 /* Note that function_obstack at top level points to temporary_obstack.
476 But within a nested function context, it is a separate obstack. */
477 current_obstack
= function_obstack
;
478 expression_obstack
= function_obstack
;
479 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
484 /* Start allocating on the permanent obstack but don't
485 free the temporary data. After calling this, call
486 `permanent_allocation' to fully resume permanent allocation status. */
489 end_temporary_allocation ()
491 current_obstack
= &permanent_obstack
;
492 expression_obstack
= &permanent_obstack
;
493 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
496 /* Resume allocating on the temporary obstack, undoing
497 effects of `end_temporary_allocation'. */
500 resume_temporary_allocation ()
502 current_obstack
= function_obstack
;
503 expression_obstack
= function_obstack
;
504 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
507 /* While doing temporary allocation, switch to allocating in such a
508 way as to save all nodes if the function is inlined. Call
509 resume_temporary_allocation to go back to ordinary temporary
513 saveable_allocation ()
515 /* Note that function_obstack at top level points to temporary_obstack.
516 But within a nested function context, it is a separate obstack. */
517 expression_obstack
= current_obstack
= saveable_obstack
;
520 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
521 recording the previously current obstacks on a stack.
522 This does not free any storage in any obstack. */
525 push_obstacks (current
, saveable
)
526 struct obstack
*current
, *saveable
;
528 struct obstack_stack
*p
529 = (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
530 (sizeof (struct obstack_stack
)));
532 p
->current
= current_obstack
;
533 p
->saveable
= saveable_obstack
;
534 p
->expression
= expression_obstack
;
535 p
->rtl
= rtl_obstack
;
536 p
->next
= obstack_stack
;
539 current_obstack
= current
;
540 expression_obstack
= current
;
541 rtl_obstack
= saveable_obstack
= saveable
;
544 /* Save the current set of obstacks, but don't change them. */
547 push_obstacks_nochange ()
549 struct obstack_stack
*p
550 = (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
551 (sizeof (struct obstack_stack
)));
553 p
->current
= current_obstack
;
554 p
->saveable
= saveable_obstack
;
555 p
->expression
= expression_obstack
;
556 p
->rtl
= rtl_obstack
;
557 p
->next
= obstack_stack
;
561 /* Pop the obstack selection stack. */
566 struct obstack_stack
*p
= obstack_stack
;
567 obstack_stack
= p
->next
;
569 current_obstack
= p
->current
;
570 saveable_obstack
= p
->saveable
;
571 expression_obstack
= p
->expression
;
572 rtl_obstack
= p
->rtl
;
574 obstack_free (&obstack_stack_obstack
, p
);
577 /* Nonzero if temporary allocation is currently in effect.
578 Zero if currently doing permanent allocation. */
581 allocation_temporary_p ()
583 return current_obstack
!= &permanent_obstack
;
586 /* Go back to allocating on the permanent obstack
587 and free everything in the temporary obstack.
589 FUNCTION_END is true only if we have just finished compiling a function.
590 In that case, we also free preserved initial values on the momentary
594 permanent_allocation (function_end
)
597 /* Free up previous temporary obstack data */
598 obstack_free (&temporary_obstack
, temporary_firstobj
);
601 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
602 momentary_firstobj
= momentary_function_firstobj
;
605 obstack_free (&momentary_obstack
, momentary_firstobj
);
606 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
607 obstack_free (&temp_decl_obstack
, temp_decl_firstobj
);
609 /* Free up the maybepermanent_obstacks for any of our nested functions
610 which were compiled at a lower level. */
611 while (inline_obstacks
)
613 struct simple_obstack_stack
*current
= inline_obstacks
;
614 inline_obstacks
= current
->next
;
615 obstack_free (current
->obstack
, 0);
616 free (current
->obstack
);
620 current_obstack
= &permanent_obstack
;
621 expression_obstack
= &permanent_obstack
;
622 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
625 /* Save permanently everything on the maybepermanent_obstack. */
630 maybepermanent_firstobj
631 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
635 preserve_initializer ()
637 struct momentary_level
*tem
;
641 = (char *) obstack_alloc (&temporary_obstack
, 0);
642 maybepermanent_firstobj
643 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
645 old_momentary
= momentary_firstobj
;
647 = (char *) obstack_alloc (&momentary_obstack
, 0);
648 if (momentary_firstobj
!= old_momentary
)
649 for (tem
= momentary_stack
; tem
; tem
= tem
->prev
)
650 tem
->base
= momentary_firstobj
;
653 /* Start allocating new rtl in current_obstack.
654 Use resume_temporary_allocation
655 to go back to allocating rtl in saveable_obstack. */
658 rtl_in_current_obstack ()
660 rtl_obstack
= current_obstack
;
663 /* Start allocating rtl from saveable_obstack. Intended to be used after
664 a call to push_obstacks_nochange. */
667 rtl_in_saveable_obstack ()
669 rtl_obstack
= saveable_obstack
;
672 /* Allocate SIZE bytes in the current obstack
673 and return a pointer to them.
674 In practice the current obstack is always the temporary one. */
680 return (char *) obstack_alloc (current_obstack
, size
);
683 /* Free the object PTR in the current obstack
684 as well as everything allocated since PTR.
685 In practice the current obstack is always the temporary one. */
691 obstack_free (current_obstack
, ptr
);
694 /* Allocate SIZE bytes in the permanent obstack
695 and return a pointer to them. */
701 return (char *) obstack_alloc (&permanent_obstack
, size
);
704 /* Allocate NELEM items of SIZE bytes in the permanent obstack
705 and return a pointer to them. The storage is cleared before
706 returning the value. */
709 perm_calloc (nelem
, size
)
713 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
714 bzero (rval
, nelem
* size
);
718 /* Allocate SIZE bytes in the saveable obstack
719 and return a pointer to them. */
725 return (char *) obstack_alloc (saveable_obstack
, size
);
728 /* Allocate SIZE bytes in the expression obstack
729 and return a pointer to them. */
735 return (char *) obstack_alloc (expression_obstack
, size
);
738 /* Print out which obstack an object is in. */
741 print_obstack_name (object
, file
, prefix
)
746 struct obstack
*obstack
= NULL
;
747 char *obstack_name
= NULL
;
750 for (p
= outer_function_chain
; p
; p
= p
->next
)
752 if (_obstack_allocated_p (p
->function_obstack
, object
))
754 obstack
= p
->function_obstack
;
755 obstack_name
= "containing function obstack";
757 if (_obstack_allocated_p (p
->function_maybepermanent_obstack
, object
))
759 obstack
= p
->function_maybepermanent_obstack
;
760 obstack_name
= "containing function maybepermanent obstack";
764 if (_obstack_allocated_p (&obstack_stack_obstack
, object
))
766 obstack
= &obstack_stack_obstack
;
767 obstack_name
= "obstack_stack_obstack";
769 else if (_obstack_allocated_p (function_obstack
, object
))
771 obstack
= function_obstack
;
772 obstack_name
= "function obstack";
774 else if (_obstack_allocated_p (&permanent_obstack
, object
))
776 obstack
= &permanent_obstack
;
777 obstack_name
= "permanent_obstack";
779 else if (_obstack_allocated_p (&momentary_obstack
, object
))
781 obstack
= &momentary_obstack
;
782 obstack_name
= "momentary_obstack";
784 else if (_obstack_allocated_p (function_maybepermanent_obstack
, object
))
786 obstack
= function_maybepermanent_obstack
;
787 obstack_name
= "function maybepermanent obstack";
789 else if (_obstack_allocated_p (&temp_decl_obstack
, object
))
791 obstack
= &temp_decl_obstack
;
792 obstack_name
= "temp_decl_obstack";
795 /* Check to see if the object is in the free area of the obstack. */
798 if (object
>= obstack
->next_free
799 && object
< obstack
->chunk_limit
)
800 fprintf (file
, "%s in free portion of obstack %s",
801 prefix
, obstack_name
);
803 fprintf (file
, "%s allocated from %s", prefix
, obstack_name
);
806 fprintf (file
, "%s not allocated from any obstack", prefix
);
810 debug_obstack (object
)
813 print_obstack_name (object
, stderr
, "object");
814 fprintf (stderr
, ".\n");
817 /* Return 1 if OBJ is in the permanent obstack.
818 This is slow, and should be used only for debugging.
819 Use TREE_PERMANENT for other purposes. */
822 object_permanent_p (obj
)
825 return _obstack_allocated_p (&permanent_obstack
, obj
);
828 /* Start a level of momentary allocation.
829 In C, each compound statement has its own level
830 and that level is freed at the end of each statement.
831 All expression nodes are allocated in the momentary allocation level. */
836 struct momentary_level
*tem
837 = (struct momentary_level
*) obstack_alloc (&momentary_obstack
,
838 sizeof (struct momentary_level
));
839 tem
->prev
= momentary_stack
;
840 tem
->base
= (char *) obstack_base (&momentary_obstack
);
841 tem
->obstack
= expression_obstack
;
842 momentary_stack
= tem
;
843 expression_obstack
= &momentary_obstack
;
846 /* Set things up so the next clear_momentary will only clear memory
847 past our present position in momentary_obstack. */
850 preserve_momentary ()
852 momentary_stack
->base
= (char *) obstack_base (&momentary_obstack
);
855 /* Free all the storage in the current momentary-allocation level.
856 In C, this happens at the end of each statement. */
861 obstack_free (&momentary_obstack
, momentary_stack
->base
);
864 /* Discard a level of momentary allocation.
865 In C, this happens at the end of each compound statement.
866 Restore the status of expression node allocation
867 that was in effect before this level was created. */
872 struct momentary_level
*tem
= momentary_stack
;
873 momentary_stack
= tem
->prev
;
874 expression_obstack
= tem
->obstack
;
875 /* We can't free TEM from the momentary_obstack, because there might
876 be objects above it which have been saved. We can free back to the
877 stack of the level we are popping off though. */
878 obstack_free (&momentary_obstack
, tem
->base
);
881 /* Pop back to the previous level of momentary allocation,
882 but don't free any momentary data just yet. */
885 pop_momentary_nofree ()
887 struct momentary_level
*tem
= momentary_stack
;
888 momentary_stack
= tem
->prev
;
889 expression_obstack
= tem
->obstack
;
892 /* Call when starting to parse a declaration:
893 make expressions in the declaration last the length of the function.
894 Returns an argument that should be passed to resume_momentary later. */
899 register int tem
= expression_obstack
== &momentary_obstack
;
900 expression_obstack
= saveable_obstack
;
904 /* Call when finished parsing a declaration:
905 restore the treatment of node-allocation that was
906 in effect before the suspension.
907 YES should be the value previously returned by suspend_momentary. */
910 resume_momentary (yes
)
914 expression_obstack
= &momentary_obstack
;
917 /* Init the tables indexed by tree code.
918 Note that languages can add to these tables to define their own codes. */
926 /* Return a newly allocated node of code CODE.
927 Initialize the node's unique id and its TREE_PERMANENT flag.
928 For decl and type nodes, some other fields are initialized.
929 The rest of the node is initialized to zero.
931 Achoo! I got a code in the node. */
938 register int type
= TREE_CODE_CLASS (code
);
940 register struct obstack
*obstack
= current_obstack
;
942 #ifdef GATHER_STATISTICS
943 register tree_node_kind kind
;
948 case 'd': /* A decl node */
949 #ifdef GATHER_STATISTICS
952 length
= sizeof (struct tree_decl
);
953 /* All decls in an inline function need to be saved. */
954 if (obstack
!= &permanent_obstack
)
955 obstack
= saveable_obstack
;
957 /* PARM_DECLs go on the context of the parent. If this is a nested
958 function, then we must allocate the PARM_DECL on the parent's
959 obstack, so that they will live to the end of the parent's
960 closing brace. This is necessary in case we try to inline the
961 function into its parent.
963 PARM_DECLs of top-level functions do not have this problem. However,
964 we allocate them where we put the FUNCTION_DECL for languages such as
965 Ada that need to consult some flags in the PARM_DECLs of the function
968 See comment in restore_tree_status for why we can't put this
969 in function_obstack. */
970 if (code
== PARM_DECL
&& obstack
!= &permanent_obstack
)
973 if (current_function_decl
)
974 context
= decl_function_context (current_function_decl
);
978 = find_function_data (context
)->function_maybepermanent_obstack
;
982 case 't': /* a type node */
983 #ifdef GATHER_STATISTICS
986 length
= sizeof (struct tree_type
);
987 /* All data types are put where we can preserve them if nec. */
988 if (obstack
!= &permanent_obstack
)
989 obstack
= all_types_permanent
? &permanent_obstack
: saveable_obstack
;
992 case 'b': /* a lexical block */
993 #ifdef GATHER_STATISTICS
996 length
= sizeof (struct tree_block
);
997 /* All BLOCK nodes are put where we can preserve them if nec. */
998 if (obstack
!= &permanent_obstack
)
999 obstack
= saveable_obstack
;
1002 case 's': /* an expression with side effects */
1003 #ifdef GATHER_STATISTICS
1007 case 'r': /* a reference */
1008 #ifdef GATHER_STATISTICS
1012 case 'e': /* an expression */
1013 case '<': /* a comparison expression */
1014 case '1': /* a unary arithmetic expression */
1015 case '2': /* a binary arithmetic expression */
1016 #ifdef GATHER_STATISTICS
1020 obstack
= expression_obstack
;
1021 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
1022 if (code
== BIND_EXPR
&& obstack
!= &permanent_obstack
)
1023 obstack
= saveable_obstack
;
1024 length
= sizeof (struct tree_exp
)
1025 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
1028 case 'c': /* a constant */
1029 #ifdef GATHER_STATISTICS
1032 obstack
= expression_obstack
;
1034 /* We can't use tree_code_length for INTEGER_CST, since the number of
1035 words is machine-dependent due to varying length of HOST_WIDE_INT,
1036 which might be wider than a pointer (e.g., long long). Similarly
1037 for REAL_CST, since the number of words is machine-dependent due
1038 to varying size and alignment of `double'. */
1040 if (code
== INTEGER_CST
)
1041 length
= sizeof (struct tree_int_cst
);
1042 else if (code
== REAL_CST
)
1043 length
= sizeof (struct tree_real_cst
);
1045 length
= sizeof (struct tree_common
)
1046 + tree_code_length
[(int) code
] * sizeof (char *);
1049 case 'x': /* something random, like an identifier. */
1050 #ifdef GATHER_STATISTICS
1051 if (code
== IDENTIFIER_NODE
)
1053 else if (code
== OP_IDENTIFIER
)
1055 else if (code
== TREE_VEC
)
1060 length
= sizeof (struct tree_common
)
1061 + tree_code_length
[(int) code
] * sizeof (char *);
1062 /* Identifier nodes are always permanent since they are
1063 unique in a compiler run. */
1064 if (code
== IDENTIFIER_NODE
) obstack
= &permanent_obstack
;
1071 t
= (tree
) obstack_alloc (obstack
, length
);
1073 #ifdef GATHER_STATISTICS
1074 tree_node_counts
[(int)kind
]++;
1075 tree_node_sizes
[(int)kind
] += length
;
1078 /* Clear a word at a time. */
1079 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
1081 /* Clear any extra bytes. */
1082 for (i
= length
/ sizeof (int) * sizeof (int); i
< length
; i
++)
1083 ((char *) t
)[i
] = 0;
1085 TREE_SET_CODE (t
, code
);
1086 if (obstack
== &permanent_obstack
)
1087 TREE_PERMANENT (t
) = 1;
1092 TREE_SIDE_EFFECTS (t
) = 1;
1093 TREE_TYPE (t
) = void_type_node
;
1097 if (code
!= FUNCTION_DECL
)
1099 DECL_IN_SYSTEM_HEADER (t
)
1100 = in_system_header
&& (obstack
== &permanent_obstack
);
1101 DECL_SOURCE_LINE (t
) = lineno
;
1102 DECL_SOURCE_FILE (t
) = (input_filename
) ? input_filename
: "<built-in>";
1103 DECL_UID (t
) = next_decl_uid
++;
1107 TYPE_UID (t
) = next_type_uid
++;
1109 TYPE_MAIN_VARIANT (t
) = t
;
1110 TYPE_OBSTACK (t
) = obstack
;
1111 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1112 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1113 SET_DEFAULT_TYPE_ATTRIBUTES (t
);
1118 TREE_CONSTANT (t
) = 1;
1125 /* Return a new node with the same contents as NODE
1126 except that its TREE_CHAIN is zero and it has a fresh uid. */
1133 register enum tree_code code
= TREE_CODE (node
);
1134 register int length
= 0;
1137 switch (TREE_CODE_CLASS (code
))
1139 case 'd': /* A decl node */
1140 length
= sizeof (struct tree_decl
);
1143 case 't': /* a type node */
1144 length
= sizeof (struct tree_type
);
1147 case 'b': /* a lexical block node */
1148 length
= sizeof (struct tree_block
);
1151 case 'r': /* a reference */
1152 case 'e': /* an expression */
1153 case 's': /* an expression with side effects */
1154 case '<': /* a comparison expression */
1155 case '1': /* a unary arithmetic expression */
1156 case '2': /* a binary arithmetic expression */
1157 length
= sizeof (struct tree_exp
)
1158 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
1161 case 'c': /* a constant */
1162 /* We can't use tree_code_length for INTEGER_CST, since the number of
1163 words is machine-dependent due to varying length of HOST_WIDE_INT,
1164 which might be wider than a pointer (e.g., long long). Similarly
1165 for REAL_CST, since the number of words is machine-dependent due
1166 to varying size and alignment of `double'. */
1167 if (code
== INTEGER_CST
)
1168 length
= sizeof (struct tree_int_cst
);
1169 else if (code
== REAL_CST
)
1170 length
= sizeof (struct tree_real_cst
);
1172 length
= (sizeof (struct tree_common
)
1173 + tree_code_length
[(int) code
] * sizeof (char *));
1176 case 'x': /* something random, like an identifier. */
1177 length
= sizeof (struct tree_common
)
1178 + tree_code_length
[(int) code
] * sizeof (char *);
1179 if (code
== TREE_VEC
)
1180 length
+= (TREE_VEC_LENGTH (node
) - 1) * sizeof (char *);
1183 t
= (tree
) obstack_alloc (current_obstack
, length
);
1185 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
1186 ((int *) t
)[i
] = ((int *) node
)[i
];
1187 /* Clear any extra bytes. */
1188 for (i
= length
/ sizeof (int) * sizeof (int); i
< length
; i
++)
1189 ((char *) t
)[i
] = ((char *) node
)[i
];
1191 /* EXPR_WITH_FILE_LOCATION must keep filename info stored in TREE_CHAIN */
1192 if (TREE_CODE (node
) != EXPR_WITH_FILE_LOCATION
)
1194 TREE_ASM_WRITTEN (t
) = 0;
1196 if (TREE_CODE_CLASS (code
) == 'd')
1197 DECL_UID (t
) = next_decl_uid
++;
1198 else if (TREE_CODE_CLASS (code
) == 't')
1200 TYPE_UID (t
) = next_type_uid
++;
1201 TYPE_OBSTACK (t
) = current_obstack
;
1203 /* The following is so that the debug code for
1204 the copy is different from the original type.
1205 The two statements usually duplicate each other
1206 (because they clear fields of the same union),
1207 but the optimizer should catch that. */
1208 TYPE_SYMTAB_POINTER (t
) = 0;
1209 TYPE_SYMTAB_ADDRESS (t
) = 0;
1212 TREE_PERMANENT (t
) = (current_obstack
== &permanent_obstack
);
1217 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1218 For example, this can copy a list made of TREE_LIST nodes. */
1225 register tree prev
, next
;
1230 head
= prev
= copy_node (list
);
1231 next
= TREE_CHAIN (list
);
1234 TREE_CHAIN (prev
) = copy_node (next
);
1235 prev
= TREE_CHAIN (prev
);
1236 next
= TREE_CHAIN (next
);
1243 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1244 If an identifier with that name has previously been referred to,
1245 the same node is returned this time. */
1248 get_identifier (text
)
1249 register char *text
;
1254 register int len
, hash_len
;
1256 /* Compute length of text in len. */
1257 for (len
= 0; text
[len
]; len
++);
1259 /* Decide how much of that length to hash on */
1261 if (warn_id_clash
&& len
> id_clash_len
)
1262 hash_len
= id_clash_len
;
1264 /* Compute hash code */
1265 hi
= hash_len
* 613 + (unsigned) text
[0];
1266 for (i
= 1; i
< hash_len
; i
+= 2)
1267 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1269 hi
&= (1 << HASHBITS
) - 1;
1270 hi
%= MAX_HASH_TABLE
;
1272 /* Search table for identifier */
1273 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1274 if (IDENTIFIER_LENGTH (idp
) == len
1275 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1276 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1277 return idp
; /* <-- return if found */
1279 /* Not found; optionally warn about a similar identifier */
1280 if (warn_id_clash
&& do_identifier_warnings
&& len
>= id_clash_len
)
1281 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1282 if (!strncmp (IDENTIFIER_POINTER (idp
), text
, id_clash_len
))
1284 warning ("`%s' and `%s' identical in first %d characters",
1285 IDENTIFIER_POINTER (idp
), text
, id_clash_len
);
1289 if (tree_code_length
[(int) IDENTIFIER_NODE
] < 0)
1290 abort (); /* set_identifier_size hasn't been called. */
1292 /* Not found, create one, add to chain */
1293 idp
= make_node (IDENTIFIER_NODE
);
1294 IDENTIFIER_LENGTH (idp
) = len
;
1295 #ifdef GATHER_STATISTICS
1296 id_string_size
+= len
;
1299 IDENTIFIER_POINTER (idp
) = obstack_copy0 (&permanent_obstack
, text
, len
);
1301 TREE_CHAIN (idp
) = hash_table
[hi
];
1302 hash_table
[hi
] = idp
;
1303 return idp
; /* <-- return if created */
1306 /* If an identifier with the name TEXT (a null-terminated string) has
1307 previously been referred to, return that node; otherwise return
1311 maybe_get_identifier (text
)
1312 register char *text
;
1317 register int len
, hash_len
;
1319 /* Compute length of text in len. */
1320 for (len
= 0; text
[len
]; len
++);
1322 /* Decide how much of that length to hash on */
1324 if (warn_id_clash
&& len
> id_clash_len
)
1325 hash_len
= id_clash_len
;
1327 /* Compute hash code */
1328 hi
= hash_len
* 613 + (unsigned) text
[0];
1329 for (i
= 1; i
< hash_len
; i
+= 2)
1330 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1332 hi
&= (1 << HASHBITS
) - 1;
1333 hi
%= MAX_HASH_TABLE
;
1335 /* Search table for identifier */
1336 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1337 if (IDENTIFIER_LENGTH (idp
) == len
1338 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1339 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1340 return idp
; /* <-- return if found */
1345 /* Enable warnings on similar identifiers (if requested).
1346 Done after the built-in identifiers are created. */
1349 start_identifier_warnings ()
1351 do_identifier_warnings
= 1;
1354 /* Record the size of an identifier node for the language in use.
1355 SIZE is the total size in bytes.
1356 This is called by the language-specific files. This must be
1357 called before allocating any identifiers. */
1360 set_identifier_size (size
)
1363 tree_code_length
[(int) IDENTIFIER_NODE
]
1364 = (size
- sizeof (struct tree_common
)) / sizeof (tree
);
1367 /* Return a newly constructed INTEGER_CST node whose constant value
1368 is specified by the two ints LOW and HI.
1369 The TREE_TYPE is set to `int'.
1371 This function should be used via the `build_int_2' macro. */
1374 build_int_2_wide (low
, hi
)
1375 HOST_WIDE_INT low
, hi
;
1377 register tree t
= make_node (INTEGER_CST
);
1378 TREE_INT_CST_LOW (t
) = low
;
1379 TREE_INT_CST_HIGH (t
) = hi
;
1380 TREE_TYPE (t
) = integer_type_node
;
1384 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1387 build_real (type
, d
)
1394 /* Check for valid float value for this type on this target machine;
1395 if not, can print error message and store a valid value in D. */
1396 #ifdef CHECK_FLOAT_VALUE
1397 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1400 v
= make_node (REAL_CST
);
1401 TREE_TYPE (v
) = type
;
1402 TREE_REAL_CST (v
) = d
;
1403 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1407 /* Return a new REAL_CST node whose type is TYPE
1408 and whose value is the integer value of the INTEGER_CST node I. */
1410 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1413 real_value_from_int_cst (type
, i
)
1418 #ifdef REAL_ARITHMETIC
1419 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
1420 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1423 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
1424 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
1425 #else /* not REAL_ARITHMETIC */
1426 /* Some 386 compilers mishandle unsigned int to float conversions,
1427 so introduce a temporary variable E to avoid those bugs. */
1428 if (TREE_INT_CST_HIGH (i
) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i
)))
1432 d
= (double) (~ TREE_INT_CST_HIGH (i
));
1433 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1434 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1436 e
= (double) (unsigned HOST_WIDE_INT
) (~ TREE_INT_CST_LOW (i
));
1444 d
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (i
);
1445 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1446 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1448 e
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (i
);
1451 #endif /* not REAL_ARITHMETIC */
1455 /* This function can't be implemented if we can't do arithmetic
1456 on the float representation. */
1459 build_real_from_int_cst (type
, i
)
1464 int overflow
= TREE_OVERFLOW (i
);
1466 jmp_buf float_error
;
1468 v
= make_node (REAL_CST
);
1469 TREE_TYPE (v
) = type
;
1471 if (setjmp (float_error
))
1478 set_float_handler (float_error
);
1480 #ifdef REAL_ARITHMETIC
1481 d
= real_value_from_int_cst (type
, i
);
1483 d
= REAL_VALUE_TRUNCATE (TYPE_MODE (type
),
1484 real_value_from_int_cst (type
, i
));
1487 /* Check for valid float value for this type on this target machine. */
1490 set_float_handler (NULL_PTR
);
1492 #ifdef CHECK_FLOAT_VALUE
1493 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1496 TREE_REAL_CST (v
) = d
;
1497 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1501 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1503 /* Return a newly constructed STRING_CST node whose value is
1504 the LEN characters at STR.
1505 The TREE_TYPE is not initialized. */
1508 build_string (len
, str
)
1512 /* Put the string in saveable_obstack since it will be placed in the RTL
1513 for an "asm" statement and will also be kept around a while if
1514 deferring constant output in varasm.c. */
1516 register tree s
= make_node (STRING_CST
);
1517 TREE_STRING_LENGTH (s
) = len
;
1518 TREE_STRING_POINTER (s
) = obstack_copy0 (saveable_obstack
, str
, len
);
1522 /* Return a newly constructed COMPLEX_CST node whose value is
1523 specified by the real and imaginary parts REAL and IMAG.
1524 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1525 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1528 build_complex (type
, real
, imag
)
1532 register tree t
= make_node (COMPLEX_CST
);
1534 TREE_REALPART (t
) = real
;
1535 TREE_IMAGPART (t
) = imag
;
1536 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1537 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1538 TREE_CONSTANT_OVERFLOW (t
)
1539 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1543 /* Build a newly constructed TREE_VEC node of length LEN. */
1550 register int length
= (len
-1) * sizeof (tree
) + sizeof (struct tree_vec
);
1551 register struct obstack
*obstack
= current_obstack
;
1554 #ifdef GATHER_STATISTICS
1555 tree_node_counts
[(int)vec_kind
]++;
1556 tree_node_sizes
[(int)vec_kind
] += length
;
1559 t
= (tree
) obstack_alloc (obstack
, length
);
1561 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
1564 TREE_SET_CODE (t
, TREE_VEC
);
1565 TREE_VEC_LENGTH (t
) = len
;
1566 if (obstack
== &permanent_obstack
)
1567 TREE_PERMANENT (t
) = 1;
1572 /* Return 1 if EXPR is the integer constant zero or a complex constant
1576 integer_zerop (expr
)
1581 return ((TREE_CODE (expr
) == INTEGER_CST
1582 && ! TREE_CONSTANT_OVERFLOW (expr
)
1583 && TREE_INT_CST_LOW (expr
) == 0
1584 && TREE_INT_CST_HIGH (expr
) == 0)
1585 || (TREE_CODE (expr
) == COMPLEX_CST
1586 && integer_zerop (TREE_REALPART (expr
))
1587 && integer_zerop (TREE_IMAGPART (expr
))));
1590 /* Return 1 if EXPR is the integer constant one or the corresponding
1591 complex constant. */
1599 return ((TREE_CODE (expr
) == INTEGER_CST
1600 && ! TREE_CONSTANT_OVERFLOW (expr
)
1601 && TREE_INT_CST_LOW (expr
) == 1
1602 && TREE_INT_CST_HIGH (expr
) == 0)
1603 || (TREE_CODE (expr
) == COMPLEX_CST
1604 && integer_onep (TREE_REALPART (expr
))
1605 && integer_zerop (TREE_IMAGPART (expr
))));
1608 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1609 it contains. Likewise for the corresponding complex constant. */
1612 integer_all_onesp (expr
)
1620 if (TREE_CODE (expr
) == COMPLEX_CST
1621 && integer_all_onesp (TREE_REALPART (expr
))
1622 && integer_zerop (TREE_IMAGPART (expr
)))
1625 else if (TREE_CODE (expr
) != INTEGER_CST
1626 || TREE_CONSTANT_OVERFLOW (expr
))
1629 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
1631 return TREE_INT_CST_LOW (expr
) == -1 && TREE_INT_CST_HIGH (expr
) == -1;
1633 /* Note that using TYPE_PRECISION here is wrong. We care about the
1634 actual bits, not the (arbitrary) range of the type. */
1635 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1636 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1638 int high_value
, shift_amount
;
1640 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1642 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
1643 /* Can not handle precisions greater than twice the host int size. */
1645 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1646 /* Shifting by the host word size is undefined according to the ANSI
1647 standard, so we must handle this as a special case. */
1650 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1652 return TREE_INT_CST_LOW (expr
) == -1
1653 && TREE_INT_CST_HIGH (expr
) == high_value
;
1656 return TREE_INT_CST_LOW (expr
) == ((HOST_WIDE_INT
) 1 << prec
) - 1;
1659 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1663 integer_pow2p (expr
)
1667 HOST_WIDE_INT high
, low
;
1671 if (TREE_CODE (expr
) == COMPLEX_CST
1672 && integer_pow2p (TREE_REALPART (expr
))
1673 && integer_zerop (TREE_IMAGPART (expr
)))
1676 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1679 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1680 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1681 high
= TREE_INT_CST_HIGH (expr
);
1682 low
= TREE_INT_CST_LOW (expr
);
1684 /* First clear all bits that are beyond the type's precision in case
1685 we've been sign extended. */
1687 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1689 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1690 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1694 if (prec
< HOST_BITS_PER_WIDE_INT
)
1695 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1698 if (high
== 0 && low
== 0)
1701 return ((high
== 0 && (low
& (low
- 1)) == 0)
1702 || (low
== 0 && (high
& (high
- 1)) == 0));
1705 /* Return the power of two represented by a tree node known to be a
1713 HOST_WIDE_INT high
, low
;
1717 if (TREE_CODE (expr
) == COMPLEX_CST
)
1718 return tree_log2 (TREE_REALPART (expr
));
1720 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1721 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1723 high
= TREE_INT_CST_HIGH (expr
);
1724 low
= TREE_INT_CST_LOW (expr
);
1726 /* First clear all bits that are beyond the type's precision in case
1727 we've been sign extended. */
1729 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1731 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1732 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1736 if (prec
< HOST_BITS_PER_WIDE_INT
)
1737 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1740 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1741 : exact_log2 (low
));
1744 /* Return 1 if EXPR is the real constant zero. */
1752 return ((TREE_CODE (expr
) == REAL_CST
1753 && ! TREE_CONSTANT_OVERFLOW (expr
)
1754 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1755 || (TREE_CODE (expr
) == COMPLEX_CST
1756 && real_zerop (TREE_REALPART (expr
))
1757 && real_zerop (TREE_IMAGPART (expr
))));
1760 /* Return 1 if EXPR is the real constant one in real or complex form. */
1768 return ((TREE_CODE (expr
) == REAL_CST
1769 && ! TREE_CONSTANT_OVERFLOW (expr
)
1770 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1771 || (TREE_CODE (expr
) == COMPLEX_CST
1772 && real_onep (TREE_REALPART (expr
))
1773 && real_zerop (TREE_IMAGPART (expr
))));
1776 /* Return 1 if EXPR is the real constant two. */
1784 return ((TREE_CODE (expr
) == REAL_CST
1785 && ! TREE_CONSTANT_OVERFLOW (expr
)
1786 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1787 || (TREE_CODE (expr
) == COMPLEX_CST
1788 && real_twop (TREE_REALPART (expr
))
1789 && real_zerop (TREE_IMAGPART (expr
))));
1792 /* Nonzero if EXP is a constant or a cast of a constant. */
1795 really_constant_p (exp
)
1798 /* This is not quite the same as STRIP_NOPS. It does more. */
1799 while (TREE_CODE (exp
) == NOP_EXPR
1800 || TREE_CODE (exp
) == CONVERT_EXPR
1801 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1802 exp
= TREE_OPERAND (exp
, 0);
1803 return TREE_CONSTANT (exp
);
1806 /* Return first list element whose TREE_VALUE is ELEM.
1807 Return 0 if ELEM is not in LIST. */
1810 value_member (elem
, list
)
1815 if (elem
== TREE_VALUE (list
))
1817 list
= TREE_CHAIN (list
);
1822 /* Return first list element whose TREE_PURPOSE is ELEM.
1823 Return 0 if ELEM is not in LIST. */
1826 purpose_member (elem
, list
)
1831 if (elem
== TREE_PURPOSE (list
))
1833 list
= TREE_CHAIN (list
);
1838 /* Return first list element whose BINFO_TYPE is ELEM.
1839 Return 0 if ELEM is not in LIST. */
1842 binfo_member (elem
, list
)
1847 if (elem
== BINFO_TYPE (list
))
1849 list
= TREE_CHAIN (list
);
1854 /* Return nonzero if ELEM is part of the chain CHAIN. */
1857 chain_member (elem
, chain
)
1864 chain
= TREE_CHAIN (chain
);
1870 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1872 /* ??? This function was added for machine specific attributes but is no
1873 longer used. It could be deleted if we could confirm all front ends
1877 chain_member_value (elem
, chain
)
1882 if (elem
== TREE_VALUE (chain
))
1884 chain
= TREE_CHAIN (chain
);
1890 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1891 for any piece of chain CHAIN. */
1892 /* ??? This function was added for machine specific attributes but is no
1893 longer used. It could be deleted if we could confirm all front ends
1897 chain_member_purpose (elem
, chain
)
1902 if (elem
== TREE_PURPOSE (chain
))
1904 chain
= TREE_CHAIN (chain
);
1910 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1911 We expect a null pointer to mark the end of the chain.
1912 This is the Lisp primitive `length'. */
1919 register int len
= 0;
1921 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1927 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1928 by modifying the last node in chain 1 to point to chain 2.
1929 This is the Lisp primitive `nconc'. */
1941 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1943 TREE_CHAIN (t1
) = op2
;
1944 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1946 abort (); /* Circularity created. */
1952 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1956 register tree chain
;
1960 while ((next
= TREE_CHAIN (chain
)))
1965 /* Reverse the order of elements in the chain T,
1966 and return the new head of the chain (old last element). */
1972 register tree prev
= 0, decl
, next
;
1973 for (decl
= t
; decl
; decl
= next
)
1975 next
= TREE_CHAIN (decl
);
1976 TREE_CHAIN (decl
) = prev
;
1982 /* Given a chain CHAIN of tree nodes,
1983 construct and return a list of those nodes. */
1989 tree result
= NULL_TREE
;
1990 tree in_tail
= chain
;
1991 tree out_tail
= NULL_TREE
;
1995 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
1997 TREE_CHAIN (out_tail
) = next
;
2001 in_tail
= TREE_CHAIN (in_tail
);
2007 /* Return a newly created TREE_LIST node whose
2008 purpose and value fields are PARM and VALUE. */
2011 build_tree_list (parm
, value
)
2014 register tree t
= make_node (TREE_LIST
);
2015 TREE_PURPOSE (t
) = parm
;
2016 TREE_VALUE (t
) = value
;
2020 /* Similar, but build on the temp_decl_obstack. */
2023 build_decl_list (parm
, value
)
2027 register struct obstack
*ambient_obstack
= current_obstack
;
2028 current_obstack
= &temp_decl_obstack
;
2029 node
= build_tree_list (parm
, value
);
2030 current_obstack
= ambient_obstack
;
2034 /* Similar, but build on the expression_obstack. */
2037 build_expr_list (parm
, value
)
2041 register struct obstack
*ambient_obstack
= current_obstack
;
2042 current_obstack
= expression_obstack
;
2043 node
= build_tree_list (parm
, value
);
2044 current_obstack
= ambient_obstack
;
2048 /* Return a newly created TREE_LIST node whose
2049 purpose and value fields are PARM and VALUE
2050 and whose TREE_CHAIN is CHAIN. */
2053 tree_cons (purpose
, value
, chain
)
2054 tree purpose
, value
, chain
;
2057 register tree node
= make_node (TREE_LIST
);
2060 register tree node
= (tree
) obstack_alloc (current_obstack
, sizeof (struct tree_list
));
2061 #ifdef GATHER_STATISTICS
2062 tree_node_counts
[(int)x_kind
]++;
2063 tree_node_sizes
[(int)x_kind
] += sizeof (struct tree_list
);
2066 for (i
= (sizeof (struct tree_common
) / sizeof (int)) - 1; i
>= 0; i
--)
2067 ((int *) node
)[i
] = 0;
2069 TREE_SET_CODE (node
, TREE_LIST
);
2070 if (current_obstack
== &permanent_obstack
)
2071 TREE_PERMANENT (node
) = 1;
2074 TREE_CHAIN (node
) = chain
;
2075 TREE_PURPOSE (node
) = purpose
;
2076 TREE_VALUE (node
) = value
;
2080 /* Similar, but build on the temp_decl_obstack. */
2083 decl_tree_cons (purpose
, value
, chain
)
2084 tree purpose
, value
, chain
;
2087 register struct obstack
*ambient_obstack
= current_obstack
;
2088 current_obstack
= &temp_decl_obstack
;
2089 node
= tree_cons (purpose
, value
, chain
);
2090 current_obstack
= ambient_obstack
;
2094 /* Similar, but build on the expression_obstack. */
2097 expr_tree_cons (purpose
, value
, chain
)
2098 tree purpose
, value
, chain
;
2101 register struct obstack
*ambient_obstack
= current_obstack
;
2102 current_obstack
= expression_obstack
;
2103 node
= tree_cons (purpose
, value
, chain
);
2104 current_obstack
= ambient_obstack
;
2108 /* Same as `tree_cons' but make a permanent object. */
2111 perm_tree_cons (purpose
, value
, chain
)
2112 tree purpose
, value
, chain
;
2115 register struct obstack
*ambient_obstack
= current_obstack
;
2116 current_obstack
= &permanent_obstack
;
2118 node
= tree_cons (purpose
, value
, chain
);
2119 current_obstack
= ambient_obstack
;
2123 /* Same as `tree_cons', but make this node temporary, regardless. */
2126 temp_tree_cons (purpose
, value
, chain
)
2127 tree purpose
, value
, chain
;
2130 register struct obstack
*ambient_obstack
= current_obstack
;
2131 current_obstack
= &temporary_obstack
;
2133 node
= tree_cons (purpose
, value
, chain
);
2134 current_obstack
= ambient_obstack
;
2138 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2141 saveable_tree_cons (purpose
, value
, chain
)
2142 tree purpose
, value
, chain
;
2145 register struct obstack
*ambient_obstack
= current_obstack
;
2146 current_obstack
= saveable_obstack
;
2148 node
= tree_cons (purpose
, value
, chain
);
2149 current_obstack
= ambient_obstack
;
2153 /* Return the size nominally occupied by an object of type TYPE
2154 when it resides in memory. The value is measured in units of bytes,
2155 and its data type is that normally used for type sizes
2156 (which is the first type created by make_signed_type or
2157 make_unsigned_type). */
2160 size_in_bytes (type
)
2165 if (type
== error_mark_node
)
2166 return integer_zero_node
;
2168 type
= TYPE_MAIN_VARIANT (type
);
2169 t
= TYPE_SIZE_UNIT (type
);
2172 incomplete_type_error (NULL_TREE
, type
);
2173 return integer_zero_node
;
2175 if (TREE_CODE (t
) == INTEGER_CST
)
2176 force_fit_type (t
, 0);
2181 /* Return the size of TYPE (in bytes) as a wide integer
2182 or return -1 if the size can vary or is larger than an integer. */
2185 int_size_in_bytes (type
)
2190 if (type
== error_mark_node
)
2193 type
= TYPE_MAIN_VARIANT (type
);
2194 t
= TYPE_SIZE_UNIT (type
);
2196 || TREE_CODE (t
) != INTEGER_CST
2197 || TREE_INT_CST_HIGH (t
) != 0)
2200 return TREE_INT_CST_LOW (t
);
2203 /* Return, as a tree node, the number of elements for TYPE (which is an
2204 ARRAY_TYPE) minus one. This counts only elements of the top array.
2206 Don't let any SAVE_EXPRs escape; if we are called as part of a cleanup
2207 action, they would get unsaved. */
2210 array_type_nelts (type
)
2213 tree index_type
, min
, max
;
2215 /* If they did it with unspecified bounds, then we should have already
2216 given an error about it before we got here. */
2217 if (! TYPE_DOMAIN (type
))
2218 return error_mark_node
;
2220 index_type
= TYPE_DOMAIN (type
);
2221 min
= TYPE_MIN_VALUE (index_type
);
2222 max
= TYPE_MAX_VALUE (index_type
);
2224 if (! TREE_CONSTANT (min
))
2227 if (TREE_CODE (min
) == SAVE_EXPR
)
2228 min
= build (RTL_EXPR
, TREE_TYPE (TYPE_MIN_VALUE (index_type
)), 0,
2229 SAVE_EXPR_RTL (min
));
2231 min
= TYPE_MIN_VALUE (index_type
);
2234 if (! TREE_CONSTANT (max
))
2237 if (TREE_CODE (max
) == SAVE_EXPR
)
2238 max
= build (RTL_EXPR
, TREE_TYPE (TYPE_MAX_VALUE (index_type
)), 0,
2239 SAVE_EXPR_RTL (max
));
2241 max
= TYPE_MAX_VALUE (index_type
);
2244 return (integer_zerop (min
)
2246 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
2249 /* Return nonzero if arg is static -- a reference to an object in
2250 static storage. This is not the same as the C meaning of `static'. */
2256 switch (TREE_CODE (arg
))
2259 /* Nested functions aren't static, since taking their address
2260 involves a trampoline. */
2261 return decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
);
2263 return TREE_STATIC (arg
) || DECL_EXTERNAL (arg
);
2266 return TREE_STATIC (arg
);
2271 /* If we are referencing a bitfield, we can't evaluate an
2272 ADDR_EXPR at compile time and so it isn't a constant. */
2274 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
2275 && staticp (TREE_OPERAND (arg
, 0)));
2281 /* This case is technically correct, but results in setting
2282 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2285 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
2289 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2290 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2291 return staticp (TREE_OPERAND (arg
, 0));
2298 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2299 Do this to any expression which may be used in more than one place,
2300 but must be evaluated only once.
2302 Normally, expand_expr would reevaluate the expression each time.
2303 Calling save_expr produces something that is evaluated and recorded
2304 the first time expand_expr is called on it. Subsequent calls to
2305 expand_expr just reuse the recorded value.
2307 The call to expand_expr that generates code that actually computes
2308 the value is the first call *at compile time*. Subsequent calls
2309 *at compile time* generate code to use the saved value.
2310 This produces correct result provided that *at run time* control
2311 always flows through the insns made by the first expand_expr
2312 before reaching the other places where the save_expr was evaluated.
2313 You, the caller of save_expr, must make sure this is so.
2315 Constants, and certain read-only nodes, are returned with no
2316 SAVE_EXPR because that is safe. Expressions containing placeholders
2317 are not touched; see tree.def for an explanation of what these
2324 register tree t
= fold (expr
);
2326 /* We don't care about whether this can be used as an lvalue in this
2328 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
2329 t
= TREE_OPERAND (t
, 0);
2331 /* If the tree evaluates to a constant, then we don't want to hide that
2332 fact (i.e. this allows further folding, and direct checks for constants).
2333 However, a read-only object that has side effects cannot be bypassed.
2334 Since it is no problem to reevaluate literals, we just return the
2337 if (TREE_CONSTANT (t
) || (TREE_READONLY (t
) && ! TREE_SIDE_EFFECTS (t
))
2338 || TREE_CODE (t
) == SAVE_EXPR
|| TREE_CODE (t
) == ERROR_MARK
)
2341 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2342 it means that the size or offset of some field of an object depends on
2343 the value within another field.
2345 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2346 and some variable since it would then need to be both evaluated once and
2347 evaluated more than once. Front-ends must assure this case cannot
2348 happen by surrounding any such subexpressions in their own SAVE_EXPR
2349 and forcing evaluation at the proper time. */
2350 if (contains_placeholder_p (t
))
2353 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
2355 /* This expression might be placed ahead of a jump to ensure that the
2356 value was computed on both sides of the jump. So make sure it isn't
2357 eliminated as dead. */
2358 TREE_SIDE_EFFECTS (t
) = 1;
2362 /* Arrange for an expression to be expanded multiple independent
2363 times. This is useful for cleanup actions, as the backend can
2364 expand them multiple times in different places. */
2372 /* If this is already protected, no sense in protecting it again. */
2373 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
2376 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
2377 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
2381 /* Returns the index of the first non-tree operand for CODE, or the number
2382 of operands if all are trees. */
2386 enum tree_code code
;
2396 case WITH_CLEANUP_EXPR
:
2397 /* Should be defined to be 2. */
2399 case METHOD_CALL_EXPR
:
2402 return tree_code_length
[(int) code
];
2406 /* Modify a tree in place so that all the evaluate only once things
2407 are cleared out. Return the EXPR given. */
2410 unsave_expr_now (expr
)
2413 enum tree_code code
;
2417 if (expr
== NULL_TREE
)
2420 code
= TREE_CODE (expr
);
2421 first_rtl
= first_rtl_op (code
);
2425 SAVE_EXPR_RTL (expr
) = 0;
2429 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2430 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2434 /* I don't yet know how to emit a sequence multiple times. */
2435 if (RTL_EXPR_SEQUENCE (expr
) != 0)
2440 CALL_EXPR_RTL (expr
) = 0;
2441 if (TREE_OPERAND (expr
, 1)
2442 && TREE_CODE (TREE_OPERAND (expr
, 1)) == TREE_LIST
)
2444 tree exp
= TREE_OPERAND (expr
, 1);
2447 unsave_expr_now (TREE_VALUE (exp
));
2448 exp
= TREE_CHAIN (exp
);
2457 switch (TREE_CODE_CLASS (code
))
2459 case 'c': /* a constant */
2460 case 't': /* a type node */
2461 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2462 case 'd': /* A decl node */
2463 case 'b': /* A block node */
2466 case 'e': /* an expression */
2467 case 'r': /* a reference */
2468 case 's': /* an expression with side effects */
2469 case '<': /* a comparison expression */
2470 case '2': /* a binary arithmetic expression */
2471 case '1': /* a unary arithmetic expression */
2472 for (i
= first_rtl
- 1; i
>= 0; i
--)
2473 unsave_expr_now (TREE_OPERAND (expr
, i
));
2481 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2482 or offset that depends on a field within a record. */
2485 contains_placeholder_p (exp
)
2488 register enum tree_code code
= TREE_CODE (exp
);
2491 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2492 in it since it is supplying a value for it. */
2493 if (code
== WITH_RECORD_EXPR
)
2495 else if (code
== PLACEHOLDER_EXPR
)
2498 switch (TREE_CODE_CLASS (code
))
2501 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2502 position computations since they will be converted into a
2503 WITH_RECORD_EXPR involving the reference, which will assume
2504 here will be valid. */
2505 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2508 if (code
== TREE_LIST
)
2509 return (contains_placeholder_p (TREE_VALUE (exp
))
2510 || (TREE_CHAIN (exp
) != 0
2511 && contains_placeholder_p (TREE_CHAIN (exp
))));
2520 /* Ignoring the first operand isn't quite right, but works best. */
2521 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
2528 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2529 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
2530 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
2533 /* If we already know this doesn't have a placeholder, don't
2535 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
2538 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
2539 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
2541 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
2546 return (TREE_OPERAND (exp
, 1) != 0
2547 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2553 switch (tree_code_length
[(int) code
])
2556 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2558 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2559 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2570 /* Return 1 if EXP contains any expressions that produce cleanups for an
2571 outer scope to deal with. Used by fold. */
2579 if (! TREE_SIDE_EFFECTS (exp
))
2582 switch (TREE_CODE (exp
))
2585 case WITH_CLEANUP_EXPR
:
2588 case CLEANUP_POINT_EXPR
:
2592 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
2594 cmp
= has_cleanups (TREE_VALUE (exp
));
2604 /* This general rule works for most tree codes. All exceptions should be
2605 handled above. If this is a language-specific tree code, we can't
2606 trust what might be in the operand, so say we don't know
2608 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
2611 nops
= first_rtl_op (TREE_CODE (exp
));
2612 for (i
= 0; i
< nops
; i
++)
2613 if (TREE_OPERAND (exp
, i
) != 0)
2615 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
2616 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
2617 || type
== 'r' || type
== 's')
2619 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
2628 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2629 return a tree with all occurrences of references to F in a
2630 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2631 contains only arithmetic expressions or a CALL_EXPR with a
2632 PLACEHOLDER_EXPR occurring only in its arglist. */
2635 substitute_in_expr (exp
, f
, r
)
2640 enum tree_code code
= TREE_CODE (exp
);
2645 switch (TREE_CODE_CLASS (code
))
2652 if (code
== PLACEHOLDER_EXPR
)
2654 else if (code
== TREE_LIST
)
2656 op0
= (TREE_CHAIN (exp
) == 0
2657 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2658 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2659 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2662 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2671 switch (tree_code_length
[(int) code
])
2674 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2675 if (op0
== TREE_OPERAND (exp
, 0))
2678 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2682 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2683 could, but we don't support it. */
2684 if (code
== RTL_EXPR
)
2686 else if (code
== CONSTRUCTOR
)
2689 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2690 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2691 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2694 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2698 /* It cannot be that anything inside a SAVE_EXPR contains a
2699 PLACEHOLDER_EXPR. */
2700 if (code
== SAVE_EXPR
)
2703 else if (code
== CALL_EXPR
)
2705 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2706 if (op1
== TREE_OPERAND (exp
, 1))
2709 return build (code
, TREE_TYPE (exp
),
2710 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2713 else if (code
!= COND_EXPR
)
2716 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2717 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2718 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2719 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2720 && op2
== TREE_OPERAND (exp
, 2))
2723 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2736 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2737 and it is the right field, replace it with R. */
2738 for (inner
= TREE_OPERAND (exp
, 0);
2739 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2740 inner
= TREE_OPERAND (inner
, 0))
2742 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2743 && TREE_OPERAND (exp
, 1) == f
)
2746 /* If this expression hasn't been completed let, leave it
2748 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2749 && TREE_TYPE (inner
) == 0)
2752 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2753 if (op0
== TREE_OPERAND (exp
, 0))
2756 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2757 TREE_OPERAND (exp
, 1)));
2761 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2762 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2763 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2764 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2765 && op2
== TREE_OPERAND (exp
, 2))
2768 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2773 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2774 if (op0
== TREE_OPERAND (exp
, 0))
2777 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2789 TREE_READONLY (new) = TREE_READONLY (exp
);
2793 /* Stabilize a reference so that we can use it any number of times
2794 without causing its operands to be evaluated more than once.
2795 Returns the stabilized reference. This works by means of save_expr,
2796 so see the caveats in the comments about save_expr.
2798 Also allows conversion expressions whose operands are references.
2799 Any other kind of expression is returned unchanged. */
2802 stabilize_reference (ref
)
2805 register tree result
;
2806 register enum tree_code code
= TREE_CODE (ref
);
2813 /* No action is needed in this case. */
2819 case FIX_TRUNC_EXPR
:
2820 case FIX_FLOOR_EXPR
:
2821 case FIX_ROUND_EXPR
:
2823 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2827 result
= build_nt (INDIRECT_REF
,
2828 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2832 result
= build_nt (COMPONENT_REF
,
2833 stabilize_reference (TREE_OPERAND (ref
, 0)),
2834 TREE_OPERAND (ref
, 1));
2838 result
= build_nt (BIT_FIELD_REF
,
2839 stabilize_reference (TREE_OPERAND (ref
, 0)),
2840 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2841 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2845 result
= build_nt (ARRAY_REF
,
2846 stabilize_reference (TREE_OPERAND (ref
, 0)),
2847 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2851 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2852 it wouldn't be ignored. This matters when dealing with
2854 return stabilize_reference_1 (ref
);
2857 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2858 save_expr (build1 (ADDR_EXPR
,
2859 build_pointer_type (TREE_TYPE (ref
)),
2864 /* If arg isn't a kind of lvalue we recognize, make no change.
2865 Caller should recognize the error for an invalid lvalue. */
2870 return error_mark_node
;
2873 TREE_TYPE (result
) = TREE_TYPE (ref
);
2874 TREE_READONLY (result
) = TREE_READONLY (ref
);
2875 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2876 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2877 TREE_RAISES (result
) = TREE_RAISES (ref
);
2882 /* Subroutine of stabilize_reference; this is called for subtrees of
2883 references. Any expression with side-effects must be put in a SAVE_EXPR
2884 to ensure that it is only evaluated once.
2886 We don't put SAVE_EXPR nodes around everything, because assigning very
2887 simple expressions to temporaries causes us to miss good opportunities
2888 for optimizations. Among other things, the opportunity to fold in the
2889 addition of a constant into an addressing mode often gets lost, e.g.
2890 "y[i+1] += x;". In general, we take the approach that we should not make
2891 an assignment unless we are forced into it - i.e., that any non-side effect
2892 operator should be allowed, and that cse should take care of coalescing
2893 multiple utterances of the same expression should that prove fruitful. */
2896 stabilize_reference_1 (e
)
2899 register tree result
;
2900 register enum tree_code code
= TREE_CODE (e
);
2902 /* We cannot ignore const expressions because it might be a reference
2903 to a const array but whose index contains side-effects. But we can
2904 ignore things that are actual constant or that already have been
2905 handled by this function. */
2907 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2910 switch (TREE_CODE_CLASS (code
))
2920 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2921 so that it will only be evaluated once. */
2922 /* The reference (r) and comparison (<) classes could be handled as
2923 below, but it is generally faster to only evaluate them once. */
2924 if (TREE_SIDE_EFFECTS (e
))
2925 return save_expr (e
);
2929 /* Constants need no processing. In fact, we should never reach
2934 /* Division is slow and tends to be compiled with jumps,
2935 especially the division by powers of 2 that is often
2936 found inside of an array reference. So do it just once. */
2937 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2938 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2939 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2940 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2941 return save_expr (e
);
2942 /* Recursively stabilize each operand. */
2943 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2944 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2948 /* Recursively stabilize each operand. */
2949 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2956 TREE_TYPE (result
) = TREE_TYPE (e
);
2957 TREE_READONLY (result
) = TREE_READONLY (e
);
2958 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2959 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2960 TREE_RAISES (result
) = TREE_RAISES (e
);
2965 /* Low-level constructors for expressions. */
2967 /* Build an expression of code CODE, data type TYPE,
2968 and operands as specified by the arguments ARG1 and following arguments.
2969 Expressions and reference nodes can be created this way.
2970 Constants, decls, types and misc nodes cannot be. */
2973 build
VPROTO((enum tree_code code
, tree tt
, ...))
2976 enum tree_code code
;
2981 register int length
;
2987 code
= va_arg (p
, enum tree_code
);
2988 tt
= va_arg (p
, tree
);
2991 t
= make_node (code
);
2992 length
= tree_code_length
[(int) code
];
2997 /* This is equivalent to the loop below, but faster. */
2998 register tree arg0
= va_arg (p
, tree
);
2999 register tree arg1
= va_arg (p
, tree
);
3000 TREE_OPERAND (t
, 0) = arg0
;
3001 TREE_OPERAND (t
, 1) = arg1
;
3002 if ((arg0
&& TREE_SIDE_EFFECTS (arg0
))
3003 || (arg1
&& TREE_SIDE_EFFECTS (arg1
)))
3004 TREE_SIDE_EFFECTS (t
) = 1;
3006 = (arg0
&& TREE_RAISES (arg0
)) || (arg1
&& TREE_RAISES (arg1
));
3008 else if (length
== 1)
3010 register tree arg0
= va_arg (p
, tree
);
3012 /* Call build1 for this! */
3013 if (TREE_CODE_CLASS (code
) != 's')
3015 TREE_OPERAND (t
, 0) = arg0
;
3016 if (arg0
&& TREE_SIDE_EFFECTS (arg0
))
3017 TREE_SIDE_EFFECTS (t
) = 1;
3018 TREE_RAISES (t
) = (arg0
&& TREE_RAISES (arg0
));
3022 for (i
= 0; i
< length
; i
++)
3024 register tree operand
= va_arg (p
, tree
);
3025 TREE_OPERAND (t
, i
) = operand
;
3028 if (TREE_SIDE_EFFECTS (operand
))
3029 TREE_SIDE_EFFECTS (t
) = 1;
3030 if (TREE_RAISES (operand
))
3031 TREE_RAISES (t
) = 1;
3039 /* Same as above, but only builds for unary operators.
3040 Saves lions share of calls to `build'; cuts down use
3041 of varargs, which is expensive for RISC machines. */
3044 build1 (code
, type
, node
)
3045 enum tree_code code
;
3049 register struct obstack
*obstack
= expression_obstack
;
3050 register int i
, length
;
3051 #ifdef GATHER_STATISTICS
3052 register tree_node_kind kind
;
3056 #ifdef GATHER_STATISTICS
3057 if (TREE_CODE_CLASS (code
) == 'r')
3063 length
= sizeof (struct tree_exp
);
3065 t
= (tree
) obstack_alloc (obstack
, length
);
3067 #ifdef GATHER_STATISTICS
3068 tree_node_counts
[(int)kind
]++;
3069 tree_node_sizes
[(int)kind
] += length
;
3072 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
3075 TREE_TYPE (t
) = type
;
3076 TREE_SET_CODE (t
, code
);
3078 if (obstack
== &permanent_obstack
)
3079 TREE_PERMANENT (t
) = 1;
3081 TREE_OPERAND (t
, 0) = node
;
3084 if (TREE_SIDE_EFFECTS (node
))
3085 TREE_SIDE_EFFECTS (t
) = 1;
3086 if (TREE_RAISES (node
))
3087 TREE_RAISES (t
) = 1;
3093 /* Similar except don't specify the TREE_TYPE
3094 and leave the TREE_SIDE_EFFECTS as 0.
3095 It is permissible for arguments to be null,
3096 or even garbage if their values do not matter. */
3099 build_nt
VPROTO((enum tree_code code
, ...))
3102 enum tree_code code
;
3106 register int length
;
3112 code
= va_arg (p
, enum tree_code
);
3115 t
= make_node (code
);
3116 length
= tree_code_length
[(int) code
];
3118 for (i
= 0; i
< length
; i
++)
3119 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3125 /* Similar to `build_nt', except we build
3126 on the temp_decl_obstack, regardless. */
3129 build_parse_node
VPROTO((enum tree_code code
, ...))
3132 enum tree_code code
;
3134 register struct obstack
*ambient_obstack
= expression_obstack
;
3137 register int length
;
3143 code
= va_arg (p
, enum tree_code
);
3146 expression_obstack
= &temp_decl_obstack
;
3148 t
= make_node (code
);
3149 length
= tree_code_length
[(int) code
];
3151 for (i
= 0; i
< length
; i
++)
3152 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3155 expression_obstack
= ambient_obstack
;
3160 /* Commented out because this wants to be done very
3161 differently. See cp-lex.c. */
3163 build_op_identifier (op1
, op2
)
3166 register tree t
= make_node (OP_IDENTIFIER
);
3167 TREE_PURPOSE (t
) = op1
;
3168 TREE_VALUE (t
) = op2
;
3173 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3174 We do NOT enter this node in any sort of symbol table.
3176 layout_decl is used to set up the decl's storage layout.
3177 Other slots are initialized to 0 or null pointers. */
3180 build_decl (code
, name
, type
)
3181 enum tree_code code
;
3186 t
= make_node (code
);
3188 /* if (type == error_mark_node)
3189 type = integer_type_node; */
3190 /* That is not done, deliberately, so that having error_mark_node
3191 as the type can suppress useless errors in the use of this variable. */
3193 DECL_NAME (t
) = name
;
3194 DECL_ASSEMBLER_NAME (t
) = name
;
3195 TREE_TYPE (t
) = type
;
3197 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3199 else if (code
== FUNCTION_DECL
)
3200 DECL_MODE (t
) = FUNCTION_MODE
;
3205 /* BLOCK nodes are used to represent the structure of binding contours
3206 and declarations, once those contours have been exited and their contents
3207 compiled. This information is used for outputting debugging info. */
3210 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
3211 tree vars
, tags
, subblocks
, supercontext
, chain
;
3213 register tree block
= make_node (BLOCK
);
3214 BLOCK_VARS (block
) = vars
;
3215 BLOCK_TYPE_TAGS (block
) = tags
;
3216 BLOCK_SUBBLOCKS (block
) = subblocks
;
3217 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3218 BLOCK_CHAIN (block
) = chain
;
3222 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3223 location where an expression or an identifier were encountered. It
3224 is necessary for languages where the frontend parser will handle
3225 recursively more than one file (Java is one of them). */
3228 build_expr_wfl (node
, file
, line
, col
)
3233 static char *last_file
= 0;
3234 static tree last_filenode
= NULL_TREE
;
3235 register tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
3237 EXPR_WFL_NODE (wfl
) = node
;
3238 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
3239 if (file
!= last_file
)
3242 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
3244 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
3247 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
3248 TREE_TYPE (wfl
) = TREE_TYPE (node
);
3253 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3257 build_decl_attribute_variant (ddecl
, attribute
)
3258 tree ddecl
, attribute
;
3260 DECL_MACHINE_ATTRIBUTES (ddecl
) = attribute
;
3264 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3267 Record such modified types already made so we don't make duplicates. */
3270 build_type_attribute_variant (ttype
, attribute
)
3271 tree ttype
, attribute
;
3273 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3275 register int hashcode
;
3276 register struct obstack
*ambient_obstack
= current_obstack
;
3279 if (ambient_obstack
!= &permanent_obstack
)
3280 current_obstack
= TYPE_OBSTACK (ttype
);
3282 ntype
= copy_node (ttype
);
3283 current_obstack
= ambient_obstack
;
3285 TYPE_POINTER_TO (ntype
) = 0;
3286 TYPE_REFERENCE_TO (ntype
) = 0;
3287 TYPE_ATTRIBUTES (ntype
) = attribute
;
3289 /* Create a new main variant of TYPE. */
3290 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3291 TYPE_NEXT_VARIANT (ntype
) = 0;
3292 TYPE_READONLY (ntype
) = TYPE_VOLATILE (ntype
) = 0;
3294 hashcode
= TYPE_HASH (TREE_CODE (ntype
))
3295 + TYPE_HASH (TREE_TYPE (ntype
))
3296 + attribute_hash_list (attribute
);
3298 switch (TREE_CODE (ntype
))
3301 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
3304 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
3307 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
3310 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
3316 ntype
= type_hash_canon (hashcode
, ntype
);
3317 ttype
= build_type_variant (ntype
, TYPE_READONLY (ttype
),
3318 TYPE_VOLATILE (ttype
));
3324 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3325 or type TYPE and 0 otherwise. Validity is determined the configuration
3326 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3329 valid_machine_attribute (attr_name
, attr_args
, decl
, type
)
3330 tree attr_name
, attr_args
;
3335 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3336 tree decl_attr_list
= decl
!= 0 ? DECL_MACHINE_ATTRIBUTES (decl
) : 0;
3338 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3339 tree type_attr_list
= TYPE_ATTRIBUTES (type
);
3342 if (TREE_CODE (attr_name
) != IDENTIFIER_NODE
)
3345 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3347 && VALID_MACHINE_DECL_ATTRIBUTE (decl
, decl_attr_list
, attr_name
, attr_args
))
3349 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3352 if (attr
!= NULL_TREE
)
3354 /* Override existing arguments. Declarations are unique so we can
3355 modify this in place. */
3356 TREE_VALUE (attr
) = attr_args
;
3360 decl_attr_list
= tree_cons (attr_name
, attr_args
, decl_attr_list
);
3361 decl
= build_decl_attribute_variant (decl
, decl_attr_list
);
3368 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3369 if (VALID_MACHINE_TYPE_ATTRIBUTE (type
, type_attr_list
, attr_name
, attr_args
))
3371 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3374 if (attr
!= NULL_TREE
)
3376 /* Override existing arguments.
3377 ??? This currently works since attribute arguments are not
3378 included in `attribute_hash_list'. Something more complicated
3379 may be needed in the future. */
3380 TREE_VALUE (attr
) = attr_args
;
3384 type_attr_list
= tree_cons (attr_name
, attr_args
, type_attr_list
);
3385 type
= build_type_attribute_variant (type
, type_attr_list
);
3388 TREE_TYPE (decl
) = type
;
3392 /* Handle putting a type attribute on pointer-to-function-type by putting
3393 the attribute on the function type. */
3394 else if (POINTER_TYPE_P (type
)
3395 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3396 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type
), type_attr_list
,
3397 attr_name
, attr_args
))
3399 tree inner_type
= TREE_TYPE (type
);
3400 tree inner_attr_list
= TYPE_ATTRIBUTES (inner_type
);
3401 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3404 if (attr
!= NULL_TREE
)
3405 TREE_VALUE (attr
) = attr_args
;
3408 inner_attr_list
= tree_cons (attr_name
, attr_args
, inner_attr_list
);
3409 inner_type
= build_type_attribute_variant (inner_type
,
3414 TREE_TYPE (decl
) = build_pointer_type (inner_type
);
3423 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3426 We try both `text' and `__text__', ATTR may be either one. */
3427 /* ??? It might be a reasonable simplification to require ATTR to be only
3428 `text'. One might then also require attribute lists to be stored in
3429 their canonicalized form. */
3432 is_attribute_p (attr
, ident
)
3436 int ident_len
, attr_len
;
3439 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3442 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
3445 p
= IDENTIFIER_POINTER (ident
);
3446 ident_len
= strlen (p
);
3447 attr_len
= strlen (attr
);
3449 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3453 || attr
[attr_len
- 2] != '_'
3454 || attr
[attr_len
- 1] != '_')
3456 if (ident_len
== attr_len
- 4
3457 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3462 if (ident_len
== attr_len
+ 4
3463 && p
[0] == '_' && p
[1] == '_'
3464 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3465 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3472 /* Given an attribute name and a list of attributes, return a pointer to the
3473 attribute's list element if the attribute is part of the list, or NULL_TREE
3477 lookup_attribute (attr_name
, list
)
3483 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3485 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
3487 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
3494 /* Return an attribute list that is the union of a1 and a2. */
3497 merge_attributes (a1
, a2
)
3498 register tree a1
, a2
;
3502 /* Either one unset? Take the set one. */
3504 if (! (attributes
= a1
))
3507 /* One that completely contains the other? Take it. */
3509 else if (a2
&& ! attribute_list_contained (a1
, a2
))
3511 if (attribute_list_contained (a2
, a1
))
3515 /* Pick the longest list, and hang on the other list. */
3516 /* ??? For the moment we punt on the issue of attrs with args. */
3518 if (list_length (a1
) < list_length (a2
))
3519 attributes
= a2
, a2
= a1
;
3521 for (; a2
; a2
= TREE_CHAIN (a2
))
3522 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3523 attributes
) == NULL_TREE
)
3525 a1
= copy_node (a2
);
3526 TREE_CHAIN (a1
) = attributes
;
3534 /* Given types T1 and T2, merge their attributes and return
3538 merge_machine_type_attributes (t1
, t2
)
3541 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3542 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1
, t2
);
3544 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3545 TYPE_ATTRIBUTES (t2
));
3549 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3553 merge_machine_decl_attributes (olddecl
, newdecl
)
3554 tree olddecl
, newdecl
;
3556 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3557 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl
, newdecl
);
3559 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl
),
3560 DECL_MACHINE_ATTRIBUTES (newdecl
));
3564 /* Return a type like TYPE except that its TYPE_READONLY is CONSTP
3565 and its TYPE_VOLATILE is VOLATILEP.
3567 Such variant types already made are recorded so that duplicates
3570 A variant types should never be used as the type of an expression.
3571 Always copy the variant information into the TREE_READONLY
3572 and TREE_THIS_VOLATILE of the expression, and then give the expression
3573 as its type the "main variant", the variant whose TYPE_READONLY
3574 and TYPE_VOLATILE are zero. Use TYPE_MAIN_VARIANT to find the
3578 build_type_variant (type
, constp
, volatilep
)
3580 int constp
, volatilep
;
3584 /* Treat any nonzero argument as 1. */
3586 volatilep
= !!volatilep
;
3588 /* Search the chain of variants to see if there is already one there just
3589 like the one we need to have. If so, use that existing one. We must
3590 preserve the TYPE_NAME, since there is code that depends on this. */
3592 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3593 if (constp
== TYPE_READONLY (t
) && volatilep
== TYPE_VOLATILE (t
)
3594 && TYPE_NAME (t
) == TYPE_NAME (type
))
3597 /* We need a new one. */
3599 t
= build_type_copy (type
);
3600 TYPE_READONLY (t
) = constp
;
3601 TYPE_VOLATILE (t
) = volatilep
;
3606 /* Create a new variant of TYPE, equivalent but distinct.
3607 This is so the caller can modify it. */
3610 build_type_copy (type
)
3613 register tree t
, m
= TYPE_MAIN_VARIANT (type
);
3614 register struct obstack
*ambient_obstack
= current_obstack
;
3616 current_obstack
= TYPE_OBSTACK (type
);
3617 t
= copy_node (type
);
3618 current_obstack
= ambient_obstack
;
3620 TYPE_POINTER_TO (t
) = 0;
3621 TYPE_REFERENCE_TO (t
) = 0;
3623 /* Add this type to the chain of variants of TYPE. */
3624 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3625 TYPE_NEXT_VARIANT (m
) = t
;
3630 /* Hashing of types so that we don't make duplicates.
3631 The entry point is `type_hash_canon'. */
3633 /* Each hash table slot is a bucket containing a chain
3634 of these structures. */
3638 struct type_hash
*next
; /* Next structure in the bucket. */
3639 int hashcode
; /* Hash code of this type. */
3640 tree type
; /* The type recorded here. */
3643 /* Now here is the hash table. When recording a type, it is added
3644 to the slot whose index is the hash code mod the table size.
3645 Note that the hash table is used for several kinds of types
3646 (function types, array types and array index range types, for now).
3647 While all these live in the same table, they are completely independent,
3648 and the hash code is computed differently for each of these. */
3650 #define TYPE_HASH_SIZE 59
3651 struct type_hash
*type_hash_table
[TYPE_HASH_SIZE
];
3653 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3654 with types in the TREE_VALUE slots), by adding the hash codes
3655 of the individual types. */
3658 type_hash_list (list
)
3661 register int hashcode
;
3663 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3664 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3668 /* Look in the type hash table for a type isomorphic to TYPE.
3669 If one is found, return it. Otherwise return 0. */
3672 type_hash_lookup (hashcode
, type
)
3676 register struct type_hash
*h
;
3677 for (h
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
]; h
; h
= h
->next
)
3678 if (h
->hashcode
== hashcode
3679 && TREE_CODE (h
->type
) == TREE_CODE (type
)
3680 && TREE_TYPE (h
->type
) == TREE_TYPE (type
)
3681 && attribute_list_equal (TYPE_ATTRIBUTES (h
->type
),
3682 TYPE_ATTRIBUTES (type
))
3683 && (TYPE_MAX_VALUE (h
->type
) == TYPE_MAX_VALUE (type
)
3684 || tree_int_cst_equal (TYPE_MAX_VALUE (h
->type
),
3685 TYPE_MAX_VALUE (type
)))
3686 && (TYPE_MIN_VALUE (h
->type
) == TYPE_MIN_VALUE (type
)
3687 || tree_int_cst_equal (TYPE_MIN_VALUE (h
->type
),
3688 TYPE_MIN_VALUE (type
)))
3689 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3690 && (TYPE_DOMAIN (h
->type
) == TYPE_DOMAIN (type
)
3691 || (TYPE_DOMAIN (h
->type
)
3692 && TREE_CODE (TYPE_DOMAIN (h
->type
)) == TREE_LIST
3693 && TYPE_DOMAIN (type
)
3694 && TREE_CODE (TYPE_DOMAIN (type
)) == TREE_LIST
3695 && type_list_equal (TYPE_DOMAIN (h
->type
),
3696 TYPE_DOMAIN (type
)))))
3701 /* Add an entry to the type-hash-table
3702 for a type TYPE whose hash code is HASHCODE. */
3705 type_hash_add (hashcode
, type
)
3709 register struct type_hash
*h
;
3711 h
= (struct type_hash
*) oballoc (sizeof (struct type_hash
));
3712 h
->hashcode
= hashcode
;
3714 h
->next
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
];
3715 type_hash_table
[hashcode
% TYPE_HASH_SIZE
] = h
;
3718 /* Given TYPE, and HASHCODE its hash code, return the canonical
3719 object for an identical type if one already exists.
3720 Otherwise, return TYPE, and record it as the canonical object
3721 if it is a permanent object.
3723 To use this function, first create a type of the sort you want.
3724 Then compute its hash code from the fields of the type that
3725 make it different from other similar types.
3726 Then call this function and use the value.
3727 This function frees the type you pass in if it is a duplicate. */
3729 /* Set to 1 to debug without canonicalization. Never set by program. */
3730 int debug_no_type_hash
= 0;
3733 type_hash_canon (hashcode
, type
)
3739 if (debug_no_type_hash
)
3742 t1
= type_hash_lookup (hashcode
, type
);
3745 obstack_free (TYPE_OBSTACK (type
), type
);
3746 #ifdef GATHER_STATISTICS
3747 tree_node_counts
[(int)t_kind
]--;
3748 tree_node_sizes
[(int)t_kind
] -= sizeof (struct tree_type
);
3753 /* If this is a permanent type, record it for later reuse. */
3754 if (TREE_PERMANENT (type
))
3755 type_hash_add (hashcode
, type
);
3760 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3761 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3762 by adding the hash codes of the individual attributes. */
3765 attribute_hash_list (list
)
3768 register int hashcode
;
3770 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3771 /* ??? Do we want to add in TREE_VALUE too? */
3772 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3776 /* Given two lists of attributes, return true if list l2 is
3777 equivalent to l1. */
3780 attribute_list_equal (l1
, l2
)
3783 return attribute_list_contained (l1
, l2
)
3784 && attribute_list_contained (l2
, l1
);
3787 /* Given two lists of attributes, return true if list L2 is
3788 completely contained within L1. */
3789 /* ??? This would be faster if attribute names were stored in a canonicalized
3790 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3791 must be used to show these elements are equivalent (which they are). */
3792 /* ??? It's not clear that attributes with arguments will always be handled
3796 attribute_list_contained (l1
, l2
)
3799 register tree t1
, t2
;
3801 /* First check the obvious, maybe the lists are identical. */
3805 /* Maybe the lists are similar. */
3806 for (t1
= l1
, t2
= l2
;
3808 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3809 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3810 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3812 /* Maybe the lists are equal. */
3813 if (t1
== 0 && t2
== 0)
3816 for (; t2
; t2
= TREE_CHAIN (t2
))
3819 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3821 if (attr
== NULL_TREE
)
3823 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3830 /* Given two lists of types
3831 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3832 return 1 if the lists contain the same types in the same order.
3833 Also, the TREE_PURPOSEs must match. */
3836 type_list_equal (l1
, l2
)
3839 register tree t1
, t2
;
3841 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3842 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3843 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3844 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3845 && (TREE_TYPE (TREE_PURPOSE (t1
))
3846 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3852 /* Nonzero if integer constants T1 and T2
3853 represent the same constant value. */
3856 tree_int_cst_equal (t1
, t2
)
3861 if (t1
== 0 || t2
== 0)
3863 if (TREE_CODE (t1
) == INTEGER_CST
3864 && TREE_CODE (t2
) == INTEGER_CST
3865 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3866 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3871 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3872 The precise way of comparison depends on their data type. */
3875 tree_int_cst_lt (t1
, t2
)
3881 if (!TREE_UNSIGNED (TREE_TYPE (t1
)))
3882 return INT_CST_LT (t1
, t2
);
3883 return INT_CST_LT_UNSIGNED (t1
, t2
);
3886 /* Return an indication of the sign of the integer constant T.
3887 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3888 Note that -1 will never be returned it T's type is unsigned. */
3891 tree_int_cst_sgn (t
)
3894 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3896 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3898 else if (TREE_INT_CST_HIGH (t
) < 0)
3904 /* Compare two constructor-element-type constants. Return 1 if the lists
3905 are known to be equal; otherwise return 0. */
3908 simple_cst_list_equal (l1
, l2
)
3911 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3913 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3916 l1
= TREE_CHAIN (l1
);
3917 l2
= TREE_CHAIN (l2
);
3923 /* Return truthvalue of whether T1 is the same tree structure as T2.
3924 Return 1 if they are the same.
3925 Return 0 if they are understandably different.
3926 Return -1 if either contains tree structure not understood by
3930 simple_cst_equal (t1
, t2
)
3933 register enum tree_code code1
, code2
;
3938 if (t1
== 0 || t2
== 0)
3941 code1
= TREE_CODE (t1
);
3942 code2
= TREE_CODE (t2
);
3944 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3945 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
|| code2
== NON_LVALUE_EXPR
)
3946 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3948 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3949 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3950 || code2
== NON_LVALUE_EXPR
)
3951 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3959 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3960 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
3963 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3966 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3967 && !bcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3968 TREE_STRING_LENGTH (t1
));
3974 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3977 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3980 return simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3983 /* Special case: if either target is an unallocated VAR_DECL,
3984 it means that it's going to be unified with whatever the
3985 TARGET_EXPR is really supposed to initialize, so treat it
3986 as being equivalent to anything. */
3987 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3988 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3989 && DECL_RTL (TREE_OPERAND (t1
, 0)) == 0)
3990 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3991 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3992 && DECL_RTL (TREE_OPERAND (t2
, 0)) == 0))
3995 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3998 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4000 case WITH_CLEANUP_EXPR
:
4001 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4004 return simple_cst_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
4007 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4008 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4021 /* This general rule works for most tree codes. All exceptions should be
4022 handled above. If this is a language-specific tree code, we can't
4023 trust what might be in the operand, so say we don't know
4025 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4028 switch (TREE_CODE_CLASS (code1
))
4038 for (i
=0; i
<tree_code_length
[(int) code1
]; ++i
)
4040 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4051 /* Constructors for pointer, array and function types.
4052 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4053 constructed by language-dependent code, not here.) */
4055 /* Construct, lay out and return the type of pointers to TO_TYPE.
4056 If such a type has already been constructed, reuse it. */
4059 build_pointer_type (to_type
)
4062 register tree t
= TYPE_POINTER_TO (to_type
);
4064 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4069 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4070 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4071 t
= make_node (POINTER_TYPE
);
4074 TREE_TYPE (t
) = to_type
;
4076 /* Record this type as the pointer to TO_TYPE. */
4077 TYPE_POINTER_TO (to_type
) = t
;
4079 /* Lay out the type. This function has many callers that are concerned
4080 with expression-construction, and this simplifies them all.
4081 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4087 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4088 MAXVAL should be the maximum value in the domain
4089 (one less than the length of the array).
4091 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4092 We don't enforce this limit, that is up to caller (e.g. language front end).
4093 The limit exists because the result is a signed type and we don't handle
4094 sizes that use more than one HOST_WIDE_INT. */
4097 build_index_type (maxval
)
4100 register tree itype
= make_node (INTEGER_TYPE
);
4102 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4103 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4105 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4106 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
4109 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4110 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4111 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4112 if (TREE_CODE (maxval
) == INTEGER_CST
)
4114 int maxint
= (int) TREE_INT_CST_LOW (maxval
);
4115 /* If the domain should be empty, make sure the maxval
4116 remains -1 and is not spoiled by truncation. */
4117 if (INT_CST_LT (maxval
, integer_zero_node
))
4119 TYPE_MAX_VALUE (itype
) = build_int_2 (-1, -1);
4120 TREE_TYPE (TYPE_MAX_VALUE (itype
)) = sizetype
;
4122 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4128 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4129 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4130 low bound LOWVAL and high bound HIGHVAL.
4131 if TYPE==NULL_TREE, sizetype is used. */
4134 build_range_type (type
, lowval
, highval
)
4135 tree type
, lowval
, highval
;
4137 register tree itype
= make_node (INTEGER_TYPE
);
4139 TREE_TYPE (itype
) = type
;
4140 if (type
== NULL_TREE
)
4143 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4144 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4145 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4148 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4149 TYPE_MODE (itype
) = TYPE_MODE (type
);
4150 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4151 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4152 if (TREE_CODE (lowval
) == INTEGER_CST
)
4154 HOST_WIDE_INT lowint
, highint
;
4157 lowint
= TREE_INT_CST_LOW (lowval
);
4158 if (highval
&& TREE_CODE (highval
) == INTEGER_CST
)
4159 highint
= TREE_INT_CST_LOW (highval
);
4161 highint
= (~(unsigned HOST_WIDE_INT
)0) >> 1;
4163 maxint
= (int) (highint
- lowint
);
4164 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4170 /* Just like build_index_type, but takes lowval and highval instead
4171 of just highval (maxval). */
4174 build_index_2_type (lowval
,highval
)
4175 tree lowval
, highval
;
4177 return build_range_type (NULL_TREE
, lowval
, highval
);
4180 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4181 Needed because when index types are not hashed, equal index types
4182 built at different times appear distinct, even though structurally,
4186 index_type_equal (itype1
, itype2
)
4187 tree itype1
, itype2
;
4189 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
4191 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
4193 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
4194 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
4195 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
4196 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
4198 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
4199 TYPE_MIN_VALUE (itype2
))
4200 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
4201 TYPE_MAX_VALUE (itype2
)))
4208 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4209 and number of elements specified by the range of values of INDEX_TYPE.
4210 If such a type has already been constructed, reuse it. */
4213 build_array_type (elt_type
, index_type
)
4214 tree elt_type
, index_type
;
4219 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4221 error ("arrays of functions are not meaningful");
4222 elt_type
= integer_type_node
;
4225 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4226 build_pointer_type (elt_type
);
4228 /* Allocate the array after the pointer type,
4229 in case we free it in type_hash_canon. */
4230 t
= make_node (ARRAY_TYPE
);
4231 TREE_TYPE (t
) = elt_type
;
4232 TYPE_DOMAIN (t
) = index_type
;
4234 if (index_type
== 0)
4239 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
4240 t
= type_hash_canon (hashcode
, t
);
4242 if (TYPE_SIZE (t
) == 0)
4247 /* Return the TYPE of the elements comprising
4248 the innermost dimension of ARRAY. */
4251 get_inner_array_type (array
)
4254 tree type
= TREE_TYPE (array
);
4256 while (TREE_CODE (type
) == ARRAY_TYPE
)
4257 type
= TREE_TYPE (type
);
4262 /* Construct, lay out and return
4263 the type of functions returning type VALUE_TYPE
4264 given arguments of types ARG_TYPES.
4265 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4266 are data type nodes for the arguments of the function.
4267 If such a type has already been constructed, reuse it. */
4270 build_function_type (value_type
, arg_types
)
4271 tree value_type
, arg_types
;
4276 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4278 error ("function return type cannot be function");
4279 value_type
= integer_type_node
;
4282 /* Make a node of the sort we want. */
4283 t
= make_node (FUNCTION_TYPE
);
4284 TREE_TYPE (t
) = value_type
;
4285 TYPE_ARG_TYPES (t
) = arg_types
;
4287 /* If we already have such a type, use the old one and free this one. */
4288 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
4289 t
= type_hash_canon (hashcode
, t
);
4291 if (TYPE_SIZE (t
) == 0)
4296 /* Build the node for the type of references-to-TO_TYPE. */
4299 build_reference_type (to_type
)
4302 register tree t
= TYPE_REFERENCE_TO (to_type
);
4304 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4309 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4310 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4311 t
= make_node (REFERENCE_TYPE
);
4314 TREE_TYPE (t
) = to_type
;
4316 /* Record this type as the pointer to TO_TYPE. */
4317 TYPE_REFERENCE_TO (to_type
) = t
;
4324 /* Construct, lay out and return the type of methods belonging to class
4325 BASETYPE and whose arguments and values are described by TYPE.
4326 If that type exists already, reuse it.
4327 TYPE must be a FUNCTION_TYPE node. */
4330 build_method_type (basetype
, type
)
4331 tree basetype
, type
;
4336 /* Make a node of the sort we want. */
4337 t
= make_node (METHOD_TYPE
);
4339 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4342 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4343 TREE_TYPE (t
) = TREE_TYPE (type
);
4345 /* The actual arglist for this function includes a "hidden" argument
4346 which is "this". Put it into the list of argument types. */
4349 = tree_cons (NULL_TREE
,
4350 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4352 /* If we already have such a type, use the old one and free this one. */
4353 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4354 t
= type_hash_canon (hashcode
, t
);
4356 if (TYPE_SIZE (t
) == 0)
4362 /* Construct, lay out and return the type of offsets to a value
4363 of type TYPE, within an object of type BASETYPE.
4364 If a suitable offset type exists already, reuse it. */
4367 build_offset_type (basetype
, type
)
4368 tree basetype
, type
;
4373 /* Make a node of the sort we want. */
4374 t
= make_node (OFFSET_TYPE
);
4376 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4377 TREE_TYPE (t
) = type
;
4379 /* If we already have such a type, use the old one and free this one. */
4380 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4381 t
= type_hash_canon (hashcode
, t
);
4383 if (TYPE_SIZE (t
) == 0)
4389 /* Create a complex type whose components are COMPONENT_TYPE. */
4392 build_complex_type (component_type
)
4393 tree component_type
;
4398 /* Make a node of the sort we want. */
4399 t
= make_node (COMPLEX_TYPE
);
4401 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4402 TYPE_VOLATILE (t
) = TYPE_VOLATILE (component_type
);
4403 TYPE_READONLY (t
) = TYPE_READONLY (component_type
);
4405 /* If we already have such a type, use the old one and free this one. */
4406 hashcode
= TYPE_HASH (component_type
);
4407 t
= type_hash_canon (hashcode
, t
);
4409 if (TYPE_SIZE (t
) == 0)
4415 /* Return OP, stripped of any conversions to wider types as much as is safe.
4416 Converting the value back to OP's type makes a value equivalent to OP.
4418 If FOR_TYPE is nonzero, we return a value which, if converted to
4419 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4421 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4422 narrowest type that can hold the value, even if they don't exactly fit.
4423 Otherwise, bit-field references are changed to a narrower type
4424 only if they can be fetched directly from memory in that type.
4426 OP must have integer, real or enumeral type. Pointers are not allowed!
4428 There are some cases where the obvious value we could return
4429 would regenerate to OP if converted to OP's type,
4430 but would not extend like OP to wider types.
4431 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4432 For example, if OP is (unsigned short)(signed char)-1,
4433 we avoid returning (signed char)-1 if FOR_TYPE is int,
4434 even though extending that to an unsigned short would regenerate OP,
4435 since the result of extending (signed char)-1 to (int)
4436 is different from (int) OP. */
4439 get_unwidened (op
, for_type
)
4443 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4444 register tree type
= TREE_TYPE (op
);
4445 register unsigned final_prec
4446 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4448 = (for_type
!= 0 && for_type
!= type
4449 && final_prec
> TYPE_PRECISION (type
)
4450 && TREE_UNSIGNED (type
));
4451 register tree win
= op
;
4453 while (TREE_CODE (op
) == NOP_EXPR
)
4455 register int bitschange
4456 = TYPE_PRECISION (TREE_TYPE (op
))
4457 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4459 /* Truncations are many-one so cannot be removed.
4460 Unless we are later going to truncate down even farther. */
4462 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4465 /* See what's inside this conversion. If we decide to strip it,
4467 op
= TREE_OPERAND (op
, 0);
4469 /* If we have not stripped any zero-extensions (uns is 0),
4470 we can strip any kind of extension.
4471 If we have previously stripped a zero-extension,
4472 only zero-extensions can safely be stripped.
4473 Any extension can be stripped if the bits it would produce
4474 are all going to be discarded later by truncating to FOR_TYPE. */
4478 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4480 /* TREE_UNSIGNED says whether this is a zero-extension.
4481 Let's avoid computing it if it does not affect WIN
4482 and if UNS will not be needed again. */
4483 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4484 && TREE_UNSIGNED (TREE_TYPE (op
)))
4492 if (TREE_CODE (op
) == COMPONENT_REF
4493 /* Since type_for_size always gives an integer type. */
4494 && TREE_CODE (type
) != REAL_TYPE
4495 /* Don't crash if field not laid out yet. */
4496 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4498 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4499 type
= type_for_size (innerprec
, TREE_UNSIGNED (TREE_OPERAND (op
, 1)));
4501 /* We can get this structure field in the narrowest type it fits in.
4502 If FOR_TYPE is 0, do this only for a field that matches the
4503 narrower type exactly and is aligned for it
4504 The resulting extension to its nominal type (a fullword type)
4505 must fit the same conditions as for other extensions. */
4507 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4508 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4509 && (! uns
|| final_prec
<= innerprec
4510 || TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4513 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4514 TREE_OPERAND (op
, 1));
4515 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4516 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4517 TREE_RAISES (win
) = TREE_RAISES (op
);
4523 /* Return OP or a simpler expression for a narrower value
4524 which can be sign-extended or zero-extended to give back OP.
4525 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4526 or 0 if the value should be sign-extended. */
4529 get_narrower (op
, unsignedp_ptr
)
4533 register int uns
= 0;
4535 register tree win
= op
;
4537 while (TREE_CODE (op
) == NOP_EXPR
)
4539 register int bitschange
4540 = TYPE_PRECISION (TREE_TYPE (op
))
4541 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4543 /* Truncations are many-one so cannot be removed. */
4547 /* See what's inside this conversion. If we decide to strip it,
4549 op
= TREE_OPERAND (op
, 0);
4553 /* An extension: the outermost one can be stripped,
4554 but remember whether it is zero or sign extension. */
4556 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4557 /* Otherwise, if a sign extension has been stripped,
4558 only sign extensions can now be stripped;
4559 if a zero extension has been stripped, only zero-extensions. */
4560 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4564 else /* bitschange == 0 */
4566 /* A change in nominal type can always be stripped, but we must
4567 preserve the unsignedness. */
4569 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4576 if (TREE_CODE (op
) == COMPONENT_REF
4577 /* Since type_for_size always gives an integer type. */
4578 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
)
4580 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4581 tree type
= type_for_size (innerprec
, TREE_UNSIGNED (op
));
4583 /* We can get this structure field in a narrower type that fits it,
4584 but the resulting extension to its nominal type (a fullword type)
4585 must satisfy the same conditions as for other extensions.
4587 Do this only for fields that are aligned (not bit-fields),
4588 because when bit-field insns will be used there is no
4589 advantage in doing this. */
4591 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4592 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4593 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4597 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4598 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4599 TREE_OPERAND (op
, 1));
4600 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4601 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4602 TREE_RAISES (win
) = TREE_RAISES (op
);
4605 *unsignedp_ptr
= uns
;
4609 /* Nonzero if integer constant C has a value that is permissible
4610 for type TYPE (an INTEGER_TYPE). */
4613 int_fits_type_p (c
, type
)
4616 if (TREE_UNSIGNED (type
))
4617 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4618 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
))
4619 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4620 && INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
)))
4621 /* Negative ints never fit unsigned types. */
4622 && ! (TREE_INT_CST_HIGH (c
) < 0
4623 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4625 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4626 && INT_CST_LT (TYPE_MAX_VALUE (type
), c
))
4627 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4628 && INT_CST_LT (c
, TYPE_MIN_VALUE (type
)))
4629 /* Unsigned ints with top bit set never fit signed types. */
4630 && ! (TREE_INT_CST_HIGH (c
) < 0
4631 && TREE_UNSIGNED (TREE_TYPE (c
))));
4634 /* Return the innermost context enclosing DECL that is
4635 a FUNCTION_DECL, or zero if none. */
4638 decl_function_context (decl
)
4643 if (TREE_CODE (decl
) == ERROR_MARK
)
4646 if (TREE_CODE (decl
) == SAVE_EXPR
)
4647 context
= SAVE_EXPR_CONTEXT (decl
);
4649 context
= DECL_CONTEXT (decl
);
4651 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4653 if (TREE_CODE_CLASS (TREE_CODE (context
)) == 't')
4654 context
= TYPE_CONTEXT (context
);
4655 else if (TREE_CODE_CLASS (TREE_CODE (context
)) == 'd')
4656 context
= DECL_CONTEXT (context
);
4657 else if (TREE_CODE (context
) == BLOCK
)
4658 context
= BLOCK_SUPERCONTEXT (context
);
4660 /* Unhandled CONTEXT !? */
4667 /* Return the innermost context enclosing DECL that is
4668 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4669 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4672 decl_type_context (decl
)
4675 tree context
= DECL_CONTEXT (decl
);
4679 if (TREE_CODE (context
) == RECORD_TYPE
4680 || TREE_CODE (context
) == UNION_TYPE
4681 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4683 if (TREE_CODE (context
) == TYPE_DECL
4684 || TREE_CODE (context
) == FUNCTION_DECL
)
4685 context
= DECL_CONTEXT (context
);
4686 else if (TREE_CODE (context
) == BLOCK
)
4687 context
= BLOCK_SUPERCONTEXT (context
);
4689 /* Unhandled CONTEXT!? */
4695 /* Print debugging information about the size of the
4696 toplev_inline_obstacks. */
4699 print_inline_obstack_statistics ()
4701 struct simple_obstack_stack
*current
= toplev_inline_obstacks
;
4706 for (; current
; current
= current
->next
, ++n_obstacks
)
4708 struct obstack
*o
= current
->obstack
;
4709 struct _obstack_chunk
*chunk
= o
->chunk
;
4711 n_alloc
+= o
->next_free
- chunk
->contents
;
4712 chunk
= chunk
->prev
;
4714 for (; chunk
; chunk
= chunk
->prev
, ++n_chunks
)
4715 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4717 fprintf (stderr
, "inline obstacks: %d obstacks, %d bytes, %d chunks\n",
4718 n_obstacks
, n_alloc
, n_chunks
);
4721 /* Print debugging information about the obstack O, named STR. */
4724 print_obstack_statistics (str
, o
)
4728 struct _obstack_chunk
*chunk
= o
->chunk
;
4732 n_alloc
+= o
->next_free
- chunk
->contents
;
4733 chunk
= chunk
->prev
;
4737 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4738 chunk
= chunk
->prev
;
4740 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4741 str
, n_alloc
, n_chunks
);
4744 /* Print debugging information about tree nodes generated during the compile,
4745 and any language-specific information. */
4748 dump_tree_statistics ()
4750 #ifdef GATHER_STATISTICS
4752 int total_nodes
, total_bytes
;
4755 fprintf (stderr
, "\n??? tree nodes created\n\n");
4756 #ifdef GATHER_STATISTICS
4757 fprintf (stderr
, "Kind Nodes Bytes\n");
4758 fprintf (stderr
, "-------------------------------------\n");
4759 total_nodes
= total_bytes
= 0;
4760 for (i
= 0; i
< (int) all_kinds
; i
++)
4762 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4763 tree_node_counts
[i
], tree_node_sizes
[i
]);
4764 total_nodes
+= tree_node_counts
[i
];
4765 total_bytes
+= tree_node_sizes
[i
];
4767 fprintf (stderr
, "%-20s %9d\n", "identifier names", id_string_size
);
4768 fprintf (stderr
, "-------------------------------------\n");
4769 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4770 fprintf (stderr
, "-------------------------------------\n");
4772 fprintf (stderr
, "(No per-node statistics)\n");
4774 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
4775 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack
);
4776 print_obstack_statistics ("temporary_obstack", &temporary_obstack
);
4777 print_obstack_statistics ("momentary_obstack", &momentary_obstack
);
4778 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack
);
4779 print_inline_obstack_statistics ();
4780 print_lang_statistics ();
4783 #define FILE_FUNCTION_PREFIX_LEN 9
4785 #ifndef NO_DOLLAR_IN_LABEL
4786 #define FILE_FUNCTION_FORMAT "_GLOBAL_$D$%s"
4787 #else /* NO_DOLLAR_IN_LABEL */
4788 #ifndef NO_DOT_IN_LABEL
4789 #define FILE_FUNCTION_FORMAT "_GLOBAL_.D.%s"
4790 #else /* NO_DOT_IN_LABEL */
4791 #define FILE_FUNCTION_FORMAT "_GLOBAL__D_%s"
4792 #endif /* NO_DOT_IN_LABEL */
4793 #endif /* NO_DOLLAR_IN_LABEL */
4795 extern char * first_global_object_name
;
4796 extern char * weak_global_object_name
;
4798 /* If KIND=='I', return a suitable global initializer (constructor) name.
4799 If KIND=='D', return a suitable global clean-up (destructor) name. */
4802 get_file_function_name (kind
)
4808 if (first_global_object_name
)
4809 p
= first_global_object_name
;
4810 else if (weak_global_object_name
)
4811 p
= weak_global_object_name
;
4812 else if (main_input_filename
)
4813 p
= main_input_filename
;
4817 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
));
4819 /* Set up the name of the file-level functions we may need. */
4820 /* Use a global object (which is already required to be unique over
4821 the program) rather than the file name (which imposes extra
4822 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
4823 sprintf (buf
, FILE_FUNCTION_FORMAT
, p
);
4825 /* Don't need to pull weird characters out of global names. */
4826 if (p
!= first_global_object_name
)
4828 for (p
= buf
+11; *p
; p
++)
4829 if (! ((*p
>= '0' && *p
<= '9')
4830 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
4831 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
4835 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4838 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4841 || (*p
>= 'A' && *p
<= 'Z')
4842 || (*p
>= 'a' && *p
<= 'z')))
4846 buf
[FILE_FUNCTION_PREFIX_LEN
] = kind
;
4848 return get_identifier (buf
);
4851 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4852 The result is placed in BUFFER (which has length BIT_SIZE),
4853 with one bit in each char ('\000' or '\001').
4855 If the constructor is constant, NULL_TREE is returned.
4856 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4859 get_set_constructor_bits (init
, buffer
, bit_size
)
4866 HOST_WIDE_INT domain_min
4867 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))));
4868 tree non_const_bits
= NULL_TREE
;
4869 for (i
= 0; i
< bit_size
; i
++)
4872 for (vals
= TREE_OPERAND (init
, 1);
4873 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4875 if (TREE_CODE (TREE_VALUE (vals
)) != INTEGER_CST
4876 || (TREE_PURPOSE (vals
) != NULL_TREE
4877 && TREE_CODE (TREE_PURPOSE (vals
)) != INTEGER_CST
))
4879 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4880 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4882 /* Set a range of bits to ones. */
4883 HOST_WIDE_INT lo_index
4884 = TREE_INT_CST_LOW (TREE_PURPOSE (vals
)) - domain_min
;
4885 HOST_WIDE_INT hi_index
4886 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
4887 if (lo_index
< 0 || lo_index
>= bit_size
4888 || hi_index
< 0 || hi_index
>= bit_size
)
4890 for ( ; lo_index
<= hi_index
; lo_index
++)
4891 buffer
[lo_index
] = 1;
4895 /* Set a single bit to one. */
4897 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
4898 if (index
< 0 || index
>= bit_size
)
4900 error ("invalid initializer for bit string");
4906 return non_const_bits
;
4909 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4910 The result is placed in BUFFER (which is an array of bytes).
4911 If the constructor is constant, NULL_TREE is returned.
4912 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4915 get_set_constructor_bytes (init
, buffer
, wd_size
)
4917 unsigned char *buffer
;
4921 int set_word_size
= BITS_PER_UNIT
;
4922 int bit_size
= wd_size
* set_word_size
;
4924 unsigned char *bytep
= buffer
;
4925 char *bit_buffer
= (char *) alloca(bit_size
);
4926 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4928 for (i
= 0; i
< wd_size
; i
++)
4931 for (i
= 0; i
< bit_size
; i
++)
4935 if (BYTES_BIG_ENDIAN
)
4936 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4938 *bytep
|= 1 << bit_pos
;
4941 if (bit_pos
>= set_word_size
)
4942 bit_pos
= 0, bytep
++;
4944 return non_const_bits
;
4947 #ifdef ENABLE_CHECKING
4948 /* Complain if the tree code does not match the expected one. */
4951 tree_check (node
, code
, file
, line
, nofatal
)
4953 enum tree_code code
;
4958 if (TREE_CODE (node
) != code
)
4963 fatal ("%s:%d: Expect %s, have %s\n", file
, line
,
4964 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)]);
4970 /* Complain if the class of the tree node does not match. */
4973 tree_class_check (node
, cl
, file
, line
, nofatal
)
4980 if (TREE_CODE_CLASS (TREE_CODE (node
)) != cl
)
4985 fatal ("%s:%d: Expect '%c', have '%s'\n", file
, line
,
4986 cl
, tree_code_name
[TREE_CODE (node
)]);
4991 /* Complain if the node is not an expression. */
4994 expr_check (node
, ignored
, file
, line
, nofatal
)
5001 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
5015 fatal ("%s:%d: Expect expression, have '%s'\n", file
, line
,
5016 tree_code_name
[TREE_CODE (node
)]);