1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92, 93, 94, 1995 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This file contains the low level primitives for operating on tree nodes,
22 including allocation, list operations, interning of identifiers,
23 construction of data type nodes and statement nodes,
24 and construction of type conversion nodes. It also contains
25 tables index by tree code that describe how to take apart
28 It is intended to be language-independent, but occasionally
29 calls language-dependent routines defined (for C) in typecheck.c.
31 The low-level allocation routines oballoc and permalloc
32 are used also for allocating many other kinds of objects
33 by all passes of the compiler. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
51 /* Tree nodes of permanent duration are allocated in this obstack.
52 They are the identifier nodes, and everything outside of
53 the bodies and parameters of function definitions. */
55 struct obstack permanent_obstack;
57 /* The initial RTL, and all ..._TYPE nodes, in a function
58 are allocated in this obstack. Usually they are freed at the
59 end of the function, but if the function is inline they are saved.
60 For top-level functions, this is maybepermanent_obstack.
61 Separate obstacks are made for nested functions. */
63 struct obstack *function_maybepermanent_obstack;
65 /* This is the function_maybepermanent_obstack for top-level functions. */
67 struct obstack maybepermanent_obstack;
69 /* This is a list of function_maybepermanent_obstacks for top-level inline
70 functions that are compiled in the middle of compiling other functions. */
72 struct simple_obstack_stack *toplev_inline_obstacks;
74 /* This is a list of function_maybepermanent_obstacks for inline functions
75 nested in the current function that were compiled in the middle of
76 compiling other functions. */
78 struct simple_obstack_stack *inline_obstacks;
80 /* The contents of the current function definition are allocated
81 in this obstack, and all are freed at the end of the function.
82 For top-level functions, this is temporary_obstack.
83 Separate obstacks are made for nested functions. */
85 struct obstack *function_obstack;
87 /* This is used for reading initializers of global variables. */
89 struct obstack temporary_obstack;
91 /* The tree nodes of an expression are allocated
92 in this obstack, and all are freed at the end of the expression. */
94 struct obstack momentary_obstack;
96 /* The tree nodes of a declarator are allocated
97 in this obstack, and all are freed when the declarator
100 static struct obstack temp_decl_obstack;
102 /* This points at either permanent_obstack
103 or the current function_maybepermanent_obstack. */
105 struct obstack *saveable_obstack;
107 /* This is same as saveable_obstack during parse and expansion phase;
108 it points to the current function's obstack during optimization.
109 This is the obstack to be used for creating rtl objects. */
111 struct obstack *rtl_obstack;
113 /* This points at either permanent_obstack or the current function_obstack. */
115 struct obstack *current_obstack;
117 /* This points at either permanent_obstack or the current function_obstack
118 or momentary_obstack. */
120 struct obstack *expression_obstack;
122 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
126 struct obstack_stack *next;
127 struct obstack *current;
128 struct obstack *saveable;
129 struct obstack *expression;
133 struct obstack_stack *obstack_stack;
135 /* Obstack for allocating struct obstack_stack entries. */
137 static struct obstack obstack_stack_obstack;
139 /* Addresses of first objects in some obstacks.
140 This is for freeing their entire contents. */
141 char *maybepermanent_firstobj;
142 char *temporary_firstobj;
143 char *momentary_firstobj;
144 char *temp_decl_firstobj;
146 /* This is used to preserve objects (mainly array initializers) that need to
147 live until the end of the current function, but no further. */
148 char *momentary_function_firstobj;
150 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
152 int all_types_permanent;
154 /* Stack of places to restore the momentary obstack back to. */
156 struct momentary_level
158 /* Pointer back to previous such level. */
159 struct momentary_level *prev;
160 /* First object allocated within this level. */
162 /* Value of expression_obstack saved at entry to this level. */
163 struct obstack *obstack;
166 struct momentary_level *momentary_stack;
168 /* Table indexed by tree code giving a string containing a character
169 classifying the tree code. Possibilities are
170 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
172 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
174 char *standard_tree_code_type[] = {
179 /* Table indexed by tree code giving number of expression
180 operands beyond the fixed part of the node structure.
181 Not used for types or decls. */
183 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
185 int standard_tree_code_length[] = {
190 /* Names of tree components.
191 Used for printing out the tree and error messages. */
192 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
194 char *standard_tree_code_name[] = {
199 /* Table indexed by tree code giving a string containing a character
200 classifying the tree code. Possibilities are
201 t, d, s, c, r, e, <, 1 and 2. See tree.def for details. */
203 char **tree_code_type;
205 /* Table indexed by tree code giving number of expression
206 operands beyond the fixed part of the node structure.
207 Not used for types or decls. */
209 int *tree_code_length;
211 /* Table indexed by tree code giving name of tree code, as a string. */
213 char **tree_code_name;
215 /* Statistics-gathering stuff. */
236 int tree_node_counts[(int)all_kinds];
237 int tree_node_sizes[(int)all_kinds];
238 int id_string_size = 0;
240 char *tree_node_kind_names[] = {
258 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
260 #define MAX_HASH_TABLE 1009
261 static tree hash_table[MAX_HASH_TABLE]; /* id hash buckets */
263 /* 0 while creating built-in identifiers. */
264 static int do_identifier_warnings;
266 /* Unique id for next decl created. */
267 static int next_decl_uid;
268 /* Unique id for next type created. */
269 static int next_type_uid = 1;
271 /* Here is how primitive or already-canonicalized types' hash
273 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
275 extern char *mode_name[];
277 void gcc_obstack_init ();
279 /* Init the principal obstacks. */
284 gcc_obstack_init (&obstack_stack_obstack);
285 gcc_obstack_init (&permanent_obstack);
287 gcc_obstack_init (&temporary_obstack);
288 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
289 gcc_obstack_init (&momentary_obstack);
290 momentary_firstobj = (char *) obstack_alloc (&momentary_obstack, 0);
291 momentary_function_firstobj = momentary_firstobj;
292 gcc_obstack_init (&maybepermanent_obstack);
293 maybepermanent_firstobj
294 = (char *) obstack_alloc (&maybepermanent_obstack, 0);
295 gcc_obstack_init (&temp_decl_obstack);
296 temp_decl_firstobj = (char *) obstack_alloc (&temp_decl_obstack, 0);
298 function_obstack = &temporary_obstack;
299 function_maybepermanent_obstack = &maybepermanent_obstack;
300 current_obstack = &permanent_obstack;
301 expression_obstack = &permanent_obstack;
302 rtl_obstack = saveable_obstack = &permanent_obstack;
304 /* Init the hash table of identifiers. */
305 bzero ((char *) hash_table, sizeof hash_table);
309 gcc_obstack_init (obstack)
310 struct obstack *obstack;
312 /* Let particular systems override the size of a chunk. */
313 #ifndef OBSTACK_CHUNK_SIZE
314 #define OBSTACK_CHUNK_SIZE 0
316 /* Let them override the alloc and free routines too. */
317 #ifndef OBSTACK_CHUNK_ALLOC
318 #define OBSTACK_CHUNK_ALLOC xmalloc
320 #ifndef OBSTACK_CHUNK_FREE
321 #define OBSTACK_CHUNK_FREE free
323 _obstack_begin (obstack, OBSTACK_CHUNK_SIZE, 0,
324 (void *(*) ()) OBSTACK_CHUNK_ALLOC,
325 (void (*) ()) OBSTACK_CHUNK_FREE);
328 /* Save all variables describing the current status into the structure *P.
329 This is used before starting a nested function.
331 CONTEXT is the decl_function_context for the function we're about to
332 compile; if it isn't current_function_decl, we have to play some games. */
335 save_tree_status (p, context)
339 p->all_types_permanent = all_types_permanent;
340 p->momentary_stack = momentary_stack;
341 p->maybepermanent_firstobj = maybepermanent_firstobj;
342 p->momentary_firstobj = momentary_firstobj;
343 p->momentary_function_firstobj = momentary_function_firstobj;
344 p->function_obstack = function_obstack;
345 p->function_maybepermanent_obstack = function_maybepermanent_obstack;
346 p->current_obstack = current_obstack;
347 p->expression_obstack = expression_obstack;
348 p->saveable_obstack = saveable_obstack;
349 p->rtl_obstack = rtl_obstack;
350 p->inline_obstacks = inline_obstacks;
352 if (context == current_function_decl)
353 /* Objects that need to be saved in this function can be in the nonsaved
354 obstack of the enclosing function since they can't possibly be needed
355 once it has returned. */
356 function_maybepermanent_obstack = function_obstack;
359 /* We're compiling a function which isn't nested in the current
360 function. We need to create a new maybepermanent_obstack for this
361 function, since it can't go onto any of the existing obstacks. */
362 struct simple_obstack_stack **head;
363 struct simple_obstack_stack *current;
365 if (context == NULL_TREE)
366 head = &toplev_inline_obstacks;
369 struct function *f = find_function_data (context);
370 head = &f->inline_obstacks;
373 current = ((struct simple_obstack_stack *)
374 xmalloc (sizeof (struct simple_obstack_stack)));
376 current->obstack = (struct obstack *) xmalloc (sizeof (struct obstack));
377 function_maybepermanent_obstack = current->obstack;
378 gcc_obstack_init (function_maybepermanent_obstack);
380 current->next = *head;
384 maybepermanent_firstobj
385 = (char *) obstack_finish (function_maybepermanent_obstack);
387 function_obstack = (struct obstack *) xmalloc (sizeof (struct obstack));
388 gcc_obstack_init (function_obstack);
390 current_obstack = &permanent_obstack;
391 expression_obstack = &permanent_obstack;
392 rtl_obstack = saveable_obstack = &permanent_obstack;
394 momentary_firstobj = (char *) obstack_finish (&momentary_obstack);
395 momentary_function_firstobj = momentary_firstobj;
398 /* Restore all variables describing the current status from the structure *P.
399 This is used after a nested function. */
402 restore_tree_status (p)
405 all_types_permanent = p->all_types_permanent;
406 momentary_stack = p->momentary_stack;
408 obstack_free (&momentary_obstack, momentary_function_firstobj);
410 /* Free saveable storage used by the function just compiled and not
413 CAUTION: This is in function_obstack of the containing function.
414 So we must be sure that we never allocate from that obstack during
415 the compilation of a nested function if we expect it to survive
416 past the nested function's end. */
417 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
419 obstack_free (function_obstack, 0);
420 free (function_obstack);
422 momentary_firstobj = p->momentary_firstobj;
423 momentary_function_firstobj = p->momentary_function_firstobj;
424 maybepermanent_firstobj = p->maybepermanent_firstobj;
425 function_obstack = p->function_obstack;
426 function_maybepermanent_obstack = p->function_maybepermanent_obstack;
427 current_obstack = p->current_obstack;
428 expression_obstack = p->expression_obstack;
429 saveable_obstack = p->saveable_obstack;
430 rtl_obstack = p->rtl_obstack;
431 inline_obstacks = p->inline_obstacks;
434 /* Start allocating on the temporary (per function) obstack.
435 This is done in start_function before parsing the function body,
436 and before each initialization at top level, and to go back
437 to temporary allocation after doing permanent_allocation. */
440 temporary_allocation ()
442 /* Note that function_obstack at top level points to temporary_obstack.
443 But within a nested function context, it is a separate obstack. */
444 current_obstack = function_obstack;
445 expression_obstack = function_obstack;
446 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
451 /* Start allocating on the permanent obstack but don't
452 free the temporary data. After calling this, call
453 `permanent_allocation' to fully resume permanent allocation status. */
456 end_temporary_allocation ()
458 current_obstack = &permanent_obstack;
459 expression_obstack = &permanent_obstack;
460 rtl_obstack = saveable_obstack = &permanent_obstack;
463 /* Resume allocating on the temporary obstack, undoing
464 effects of `end_temporary_allocation'. */
467 resume_temporary_allocation ()
469 current_obstack = function_obstack;
470 expression_obstack = function_obstack;
471 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
474 /* While doing temporary allocation, switch to allocating in such a
475 way as to save all nodes if the function is inlined. Call
476 resume_temporary_allocation to go back to ordinary temporary
480 saveable_allocation ()
482 /* Note that function_obstack at top level points to temporary_obstack.
483 But within a nested function context, it is a separate obstack. */
484 expression_obstack = current_obstack = saveable_obstack;
487 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
488 recording the previously current obstacks on a stack.
489 This does not free any storage in any obstack. */
492 push_obstacks (current, saveable)
493 struct obstack *current, *saveable;
495 struct obstack_stack *p
496 = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
497 (sizeof (struct obstack_stack)));
499 p->current = current_obstack;
500 p->saveable = saveable_obstack;
501 p->expression = expression_obstack;
502 p->rtl = rtl_obstack;
503 p->next = obstack_stack;
506 current_obstack = current;
507 expression_obstack = current;
508 rtl_obstack = saveable_obstack = saveable;
511 /* Save the current set of obstacks, but don't change them. */
514 push_obstacks_nochange ()
516 struct obstack_stack *p
517 = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
518 (sizeof (struct obstack_stack)));
520 p->current = current_obstack;
521 p->saveable = saveable_obstack;
522 p->expression = expression_obstack;
523 p->rtl = rtl_obstack;
524 p->next = obstack_stack;
528 /* Pop the obstack selection stack. */
533 struct obstack_stack *p = obstack_stack;
534 obstack_stack = p->next;
536 current_obstack = p->current;
537 saveable_obstack = p->saveable;
538 expression_obstack = p->expression;
539 rtl_obstack = p->rtl;
541 obstack_free (&obstack_stack_obstack, p);
544 /* Nonzero if temporary allocation is currently in effect.
545 Zero if currently doing permanent allocation. */
548 allocation_temporary_p ()
550 return current_obstack != &permanent_obstack;
553 /* Go back to allocating on the permanent obstack
554 and free everything in the temporary obstack.
556 FUNCTION_END is true only if we have just finished compiling a function.
557 In that case, we also free preserved initial values on the momentary
561 permanent_allocation (function_end)
564 /* Free up previous temporary obstack data */
565 obstack_free (&temporary_obstack, temporary_firstobj);
568 obstack_free (&momentary_obstack, momentary_function_firstobj);
569 momentary_firstobj = momentary_function_firstobj;
572 obstack_free (&momentary_obstack, momentary_firstobj);
573 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
574 obstack_free (&temp_decl_obstack, temp_decl_firstobj);
576 /* Free up the maybepermanent_obstacks for any of our nested functions
577 which were compiled at a lower level. */
578 while (inline_obstacks)
580 struct simple_obstack_stack *current = inline_obstacks;
581 inline_obstacks = current->next;
582 obstack_free (current->obstack, 0);
583 free (current->obstack);
587 current_obstack = &permanent_obstack;
588 expression_obstack = &permanent_obstack;
589 rtl_obstack = saveable_obstack = &permanent_obstack;
592 /* Save permanently everything on the maybepermanent_obstack. */
597 maybepermanent_firstobj
598 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
602 preserve_initializer ()
604 struct momentary_level *tem;
608 = (char *) obstack_alloc (&temporary_obstack, 0);
609 maybepermanent_firstobj
610 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
612 old_momentary = momentary_firstobj;
614 = (char *) obstack_alloc (&momentary_obstack, 0);
615 if (momentary_firstobj != old_momentary)
616 for (tem = momentary_stack; tem; tem = tem->prev)
617 tem->base = momentary_firstobj;
620 /* Start allocating new rtl in current_obstack.
621 Use resume_temporary_allocation
622 to go back to allocating rtl in saveable_obstack. */
625 rtl_in_current_obstack ()
627 rtl_obstack = current_obstack;
630 /* Start allocating rtl from saveable_obstack. Intended to be used after
631 a call to push_obstacks_nochange. */
634 rtl_in_saveable_obstack ()
636 rtl_obstack = saveable_obstack;
639 /* Allocate SIZE bytes in the current obstack
640 and return a pointer to them.
641 In practice the current obstack is always the temporary one. */
647 return (char *) obstack_alloc (current_obstack, size);
650 /* Free the object PTR in the current obstack
651 as well as everything allocated since PTR.
652 In practice the current obstack is always the temporary one. */
658 obstack_free (current_obstack, ptr);
661 /* Allocate SIZE bytes in the permanent obstack
662 and return a pointer to them. */
668 return (char *) obstack_alloc (&permanent_obstack, size);
671 /* Allocate NELEM items of SIZE bytes in the permanent obstack
672 and return a pointer to them. The storage is cleared before
673 returning the value. */
676 perm_calloc (nelem, size)
680 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
681 bzero (rval, nelem * size);
685 /* Allocate SIZE bytes in the saveable obstack
686 and return a pointer to them. */
692 return (char *) obstack_alloc (saveable_obstack, size);
695 /* Print out which obstack an object is in. */
698 print_obstack_name (object, file, prefix)
703 struct obstack *obstack = NULL;
704 char *obstack_name = NULL;
707 for (p = outer_function_chain; p; p = p->next)
709 if (_obstack_allocated_p (p->function_obstack, object))
711 obstack = p->function_obstack;
712 obstack_name = "containing function obstack";
714 if (_obstack_allocated_p (p->function_maybepermanent_obstack, object))
716 obstack = p->function_maybepermanent_obstack;
717 obstack_name = "containing function maybepermanent obstack";
721 if (_obstack_allocated_p (&obstack_stack_obstack, object))
723 obstack = &obstack_stack_obstack;
724 obstack_name = "obstack_stack_obstack";
726 else if (_obstack_allocated_p (function_obstack, object))
728 obstack = function_obstack;
729 obstack_name = "function obstack";
731 else if (_obstack_allocated_p (&permanent_obstack, object))
733 obstack = &permanent_obstack;
734 obstack_name = "permanent_obstack";
736 else if (_obstack_allocated_p (&momentary_obstack, object))
738 obstack = &momentary_obstack;
739 obstack_name = "momentary_obstack";
741 else if (_obstack_allocated_p (function_maybepermanent_obstack, object))
743 obstack = function_maybepermanent_obstack;
744 obstack_name = "function maybepermanent obstack";
746 else if (_obstack_allocated_p (&temp_decl_obstack, object))
748 obstack = &temp_decl_obstack;
749 obstack_name = "temp_decl_obstack";
752 /* Check to see if the object is in the free area of the obstack. */
755 if (object >= obstack->next_free
756 && object < obstack->chunk_limit)
757 fprintf (file, "%s in free portion of obstack %s",
758 prefix, obstack_name);
760 fprintf (file, "%s allocated from %s", prefix, obstack_name);
763 fprintf (file, "%s not allocated from any obstack", prefix);
767 debug_obstack (object)
770 print_obstack_name (object, stderr, "object");
771 fprintf (stderr, ".\n");
774 /* Return 1 if OBJ is in the permanent obstack.
775 This is slow, and should be used only for debugging.
776 Use TREE_PERMANENT for other purposes. */
779 object_permanent_p (obj)
782 return _obstack_allocated_p (&permanent_obstack, obj);
785 /* Start a level of momentary allocation.
786 In C, each compound statement has its own level
787 and that level is freed at the end of each statement.
788 All expression nodes are allocated in the momentary allocation level. */
793 struct momentary_level *tem
794 = (struct momentary_level *) obstack_alloc (&momentary_obstack,
795 sizeof (struct momentary_level));
796 tem->prev = momentary_stack;
797 tem->base = (char *) obstack_base (&momentary_obstack);
798 tem->obstack = expression_obstack;
799 momentary_stack = tem;
800 expression_obstack = &momentary_obstack;
803 /* Set things up so the next clear_momentary will only clear memory
804 past our present position in momentary_obstack. */
807 preserve_momentary ()
809 momentary_stack->base = (char *) obstack_base (&momentary_obstack);
812 /* Free all the storage in the current momentary-allocation level.
813 In C, this happens at the end of each statement. */
818 obstack_free (&momentary_obstack, momentary_stack->base);
821 /* Discard a level of momentary allocation.
822 In C, this happens at the end of each compound statement.
823 Restore the status of expression node allocation
824 that was in effect before this level was created. */
829 struct momentary_level *tem = momentary_stack;
830 momentary_stack = tem->prev;
831 expression_obstack = tem->obstack;
832 /* We can't free TEM from the momentary_obstack, because there might
833 be objects above it which have been saved. We can free back to the
834 stack of the level we are popping off though. */
835 obstack_free (&momentary_obstack, tem->base);
838 /* Pop back to the previous level of momentary allocation,
839 but don't free any momentary data just yet. */
842 pop_momentary_nofree ()
844 struct momentary_level *tem = momentary_stack;
845 momentary_stack = tem->prev;
846 expression_obstack = tem->obstack;
849 /* Call when starting to parse a declaration:
850 make expressions in the declaration last the length of the function.
851 Returns an argument that should be passed to resume_momentary later. */
856 register int tem = expression_obstack == &momentary_obstack;
857 expression_obstack = saveable_obstack;
861 /* Call when finished parsing a declaration:
862 restore the treatment of node-allocation that was
863 in effect before the suspension.
864 YES should be the value previously returned by suspend_momentary. */
867 resume_momentary (yes)
871 expression_obstack = &momentary_obstack;
874 /* Init the tables indexed by tree code.
875 Note that languages can add to these tables to define their own codes. */
880 tree_code_type = (char **) xmalloc (sizeof (standard_tree_code_type));
881 tree_code_length = (int *) xmalloc (sizeof (standard_tree_code_length));
882 tree_code_name = (char **) xmalloc (sizeof (standard_tree_code_name));
883 bcopy ((char *) standard_tree_code_type, (char *) tree_code_type,
884 sizeof (standard_tree_code_type));
885 bcopy ((char *) standard_tree_code_length, (char *) tree_code_length,
886 sizeof (standard_tree_code_length));
887 bcopy ((char *) standard_tree_code_name, (char *) tree_code_name,
888 sizeof (standard_tree_code_name));
891 /* Return a newly allocated node of code CODE.
892 Initialize the node's unique id and its TREE_PERMANENT flag.
893 For decl and type nodes, some other fields are initialized.
894 The rest of the node is initialized to zero.
896 Achoo! I got a code in the node. */
903 register int type = TREE_CODE_CLASS (code);
905 register struct obstack *obstack = current_obstack;
907 register tree_node_kind kind;
911 case 'd': /* A decl node */
912 #ifdef GATHER_STATISTICS
915 length = sizeof (struct tree_decl);
916 /* All decls in an inline function need to be saved. */
917 if (obstack != &permanent_obstack)
918 obstack = saveable_obstack;
920 /* PARM_DECLs go on the context of the parent. If this is a nested
921 function, then we must allocate the PARM_DECL on the parent's
922 obstack, so that they will live to the end of the parent's
923 closing brace. This is neccesary in case we try to inline the
924 function into its parent.
926 PARM_DECLs of top-level functions do not have this problem. However,
927 we allocate them where we put the FUNCTION_DECL for languauges such as
928 Ada that need to consult some flags in the PARM_DECLs of the function
931 See comment in restore_tree_status for why we can't put this
932 in function_obstack. */
933 if (code == PARM_DECL && obstack != &permanent_obstack)
936 if (current_function_decl)
937 context = decl_function_context (current_function_decl);
941 = find_function_data (context)->function_maybepermanent_obstack;
945 case 't': /* a type node */
946 #ifdef GATHER_STATISTICS
949 length = sizeof (struct tree_type);
950 /* All data types are put where we can preserve them if nec. */
951 if (obstack != &permanent_obstack)
952 obstack = all_types_permanent ? &permanent_obstack : saveable_obstack;
955 case 'b': /* a lexical block */
956 #ifdef GATHER_STATISTICS
959 length = sizeof (struct tree_block);
960 /* All BLOCK nodes are put where we can preserve them if nec. */
961 if (obstack != &permanent_obstack)
962 obstack = saveable_obstack;
965 case 's': /* an expression with side effects */
966 #ifdef GATHER_STATISTICS
970 case 'r': /* a reference */
971 #ifdef GATHER_STATISTICS
975 case 'e': /* an expression */
976 case '<': /* a comparison expression */
977 case '1': /* a unary arithmetic expression */
978 case '2': /* a binary arithmetic expression */
979 #ifdef GATHER_STATISTICS
983 obstack = expression_obstack;
984 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
985 if (code == BIND_EXPR && obstack != &permanent_obstack)
986 obstack = saveable_obstack;
987 length = sizeof (struct tree_exp)
988 + (tree_code_length[(int) code] - 1) * sizeof (char *);
991 case 'c': /* a constant */
992 #ifdef GATHER_STATISTICS
995 obstack = expression_obstack;
997 /* We can't use tree_code_length for INTEGER_CST, since the number of
998 words is machine-dependent due to varying length of HOST_WIDE_INT,
999 which might be wider than a pointer (e.g., long long). Similarly
1000 for REAL_CST, since the number of words is machine-dependent due
1001 to varying size and alignment of `double'. */
1003 if (code == INTEGER_CST)
1004 length = sizeof (struct tree_int_cst);
1005 else if (code == REAL_CST)
1006 length = sizeof (struct tree_real_cst);
1008 length = sizeof (struct tree_common)
1009 + tree_code_length[(int) code] * sizeof (char *);
1012 case 'x': /* something random, like an identifier. */
1013 #ifdef GATHER_STATISTICS
1014 if (code == IDENTIFIER_NODE)
1016 else if (code == OP_IDENTIFIER)
1018 else if (code == TREE_VEC)
1023 length = sizeof (struct tree_common)
1024 + tree_code_length[(int) code] * sizeof (char *);
1025 /* Identifier nodes are always permanent since they are
1026 unique in a compiler run. */
1027 if (code == IDENTIFIER_NODE) obstack = &permanent_obstack;
1034 t = (tree) obstack_alloc (obstack, length);
1036 #ifdef GATHER_STATISTICS
1037 tree_node_counts[(int)kind]++;
1038 tree_node_sizes[(int)kind] += length;
1041 /* Clear a word at a time. */
1042 for (i = (length / sizeof (int)) - 1; i >= 0; i--)
1044 /* Clear any extra bytes. */
1045 for (i = length / sizeof (int) * sizeof (int); i < length; i++)
1046 ((char *) t)[i] = 0;
1048 TREE_SET_CODE (t, code);
1049 if (obstack == &permanent_obstack)
1050 TREE_PERMANENT (t) = 1;
1055 TREE_SIDE_EFFECTS (t) = 1;
1056 TREE_TYPE (t) = void_type_node;
1060 if (code != FUNCTION_DECL)
1062 DECL_IN_SYSTEM_HEADER (t)
1063 = in_system_header && (obstack == &permanent_obstack);
1064 DECL_SOURCE_LINE (t) = lineno;
1065 DECL_SOURCE_FILE (t) = (input_filename) ? input_filename : "<built-in>";
1066 DECL_UID (t) = next_decl_uid++;
1070 TYPE_UID (t) = next_type_uid++;
1072 TYPE_MAIN_VARIANT (t) = t;
1073 TYPE_OBSTACK (t) = obstack;
1074 TYPE_ATTRIBUTES (t) = NULL_TREE;
1075 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1076 SET_DEFAULT_TYPE_ATTRIBUTES (t);
1081 TREE_CONSTANT (t) = 1;
1088 /* Return a new node with the same contents as NODE
1089 except that its TREE_CHAIN is zero and it has a fresh uid. */
1096 register enum tree_code code = TREE_CODE (node);
1097 register int length;
1100 switch (TREE_CODE_CLASS (code))
1102 case 'd': /* A decl node */
1103 length = sizeof (struct tree_decl);
1106 case 't': /* a type node */
1107 length = sizeof (struct tree_type);
1110 case 'b': /* a lexical block node */
1111 length = sizeof (struct tree_block);
1114 case 'r': /* a reference */
1115 case 'e': /* an expression */
1116 case 's': /* an expression with side effects */
1117 case '<': /* a comparison expression */
1118 case '1': /* a unary arithmetic expression */
1119 case '2': /* a binary arithmetic expression */
1120 length = sizeof (struct tree_exp)
1121 + (tree_code_length[(int) code] - 1) * sizeof (char *);
1124 case 'c': /* a constant */
1125 /* We can't use tree_code_length for INTEGER_CST, since the number of
1126 words is machine-dependent due to varying length of HOST_WIDE_INT,
1127 which might be wider than a pointer (e.g., long long). Similarly
1128 for REAL_CST, since the number of words is machine-dependent due
1129 to varying size and alignment of `double'. */
1130 if (code == INTEGER_CST)
1132 length = sizeof (struct tree_int_cst);
1135 else if (code == REAL_CST)
1137 length = sizeof (struct tree_real_cst);
1141 case 'x': /* something random, like an identifier. */
1142 length = sizeof (struct tree_common)
1143 + tree_code_length[(int) code] * sizeof (char *);
1144 if (code == TREE_VEC)
1145 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
1148 t = (tree) obstack_alloc (current_obstack, length);
1150 for (i = (length / sizeof (int)) - 1; i >= 0; i--)
1151 ((int *) t)[i] = ((int *) node)[i];
1152 /* Clear any extra bytes. */
1153 for (i = length / sizeof (int) * sizeof (int); i < length; i++)
1154 ((char *) t)[i] = ((char *) node)[i];
1158 if (TREE_CODE_CLASS (code) == 'd')
1159 DECL_UID (t) = next_decl_uid++;
1160 else if (TREE_CODE_CLASS (code) == 't')
1162 TYPE_UID (t) = next_type_uid++;
1163 TYPE_OBSTACK (t) = current_obstack;
1166 TREE_PERMANENT (t) = (current_obstack == &permanent_obstack);
1171 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1172 For example, this can copy a list made of TREE_LIST nodes. */
1179 register tree prev, next;
1184 head = prev = copy_node (list);
1185 next = TREE_CHAIN (list);
1188 TREE_CHAIN (prev) = copy_node (next);
1189 prev = TREE_CHAIN (prev);
1190 next = TREE_CHAIN (next);
1197 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1198 If an identifier with that name has previously been referred to,
1199 the same node is returned this time. */
1202 get_identifier (text)
1203 register char *text;
1208 register int len, hash_len;
1210 /* Compute length of text in len. */
1211 for (len = 0; text[len]; len++);
1213 /* Decide how much of that length to hash on */
1215 if (warn_id_clash && len > id_clash_len)
1216 hash_len = id_clash_len;
1218 /* Compute hash code */
1219 hi = hash_len * 613 + (unsigned)text[0];
1220 for (i = 1; i < hash_len; i += 2)
1221 hi = ((hi * 613) + (unsigned)(text[i]));
1223 hi &= (1 << HASHBITS) - 1;
1224 hi %= MAX_HASH_TABLE;
1226 /* Search table for identifier */
1227 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1228 if (IDENTIFIER_LENGTH (idp) == len
1229 && IDENTIFIER_POINTER (idp)[0] == text[0]
1230 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1231 return idp; /* <-- return if found */
1233 /* Not found; optionally warn about a similar identifier */
1234 if (warn_id_clash && do_identifier_warnings && len >= id_clash_len)
1235 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1236 if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len))
1238 warning ("`%s' and `%s' identical in first %d characters",
1239 IDENTIFIER_POINTER (idp), text, id_clash_len);
1243 if (tree_code_length[(int) IDENTIFIER_NODE] < 0)
1244 abort (); /* set_identifier_size hasn't been called. */
1246 /* Not found, create one, add to chain */
1247 idp = make_node (IDENTIFIER_NODE);
1248 IDENTIFIER_LENGTH (idp) = len;
1249 #ifdef GATHER_STATISTICS
1250 id_string_size += len;
1253 IDENTIFIER_POINTER (idp) = obstack_copy0 (&permanent_obstack, text, len);
1255 TREE_CHAIN (idp) = hash_table[hi];
1256 hash_table[hi] = idp;
1257 return idp; /* <-- return if created */
1260 /* Enable warnings on similar identifiers (if requested).
1261 Done after the built-in identifiers are created. */
1264 start_identifier_warnings ()
1266 do_identifier_warnings = 1;
1269 /* Record the size of an identifier node for the language in use.
1270 SIZE is the total size in bytes.
1271 This is called by the language-specific files. This must be
1272 called before allocating any identifiers. */
1275 set_identifier_size (size)
1278 tree_code_length[(int) IDENTIFIER_NODE]
1279 = (size - sizeof (struct tree_common)) / sizeof (tree);
1282 /* Return a newly constructed INTEGER_CST node whose constant value
1283 is specified by the two ints LOW and HI.
1284 The TREE_TYPE is set to `int'.
1286 This function should be used via the `build_int_2' macro. */
1289 build_int_2_wide (low, hi)
1290 HOST_WIDE_INT low, hi;
1292 register tree t = make_node (INTEGER_CST);
1293 TREE_INT_CST_LOW (t) = low;
1294 TREE_INT_CST_HIGH (t) = hi;
1295 TREE_TYPE (t) = integer_type_node;
1299 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1302 build_real (type, d)
1309 /* Check for valid float value for this type on this target machine;
1310 if not, can print error message and store a valid value in D. */
1311 #ifdef CHECK_FLOAT_VALUE
1312 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1315 v = make_node (REAL_CST);
1316 TREE_TYPE (v) = type;
1317 TREE_REAL_CST (v) = d;
1318 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1322 /* Return a new REAL_CST node whose type is TYPE
1323 and whose value is the integer value of the INTEGER_CST node I. */
1325 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1328 real_value_from_int_cst (i)
1333 /* Some 386 compilers mishandle unsigned int to float conversions,
1334 so introduce a temporary variable E to avoid those bugs. */
1336 #ifdef REAL_ARITHMETIC
1337 if (! TREE_UNSIGNED (TREE_TYPE (i)))
1338 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i));
1340 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i));
1341 #else /* not REAL_ARITHMETIC */
1342 if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i)))
1344 d = (double) (~ TREE_INT_CST_HIGH (i));
1345 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1346 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1348 e = (double) (unsigned HOST_WIDE_INT) (~ TREE_INT_CST_LOW (i));
1354 d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i);
1355 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1356 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1358 e = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (i);
1361 #endif /* not REAL_ARITHMETIC */
1365 /* This function can't be implemented if we can't do arithmetic
1366 on the float representation. */
1369 build_real_from_int_cst (type, i)
1374 int overflow = TREE_OVERFLOW (i);
1376 jmp_buf float_error;
1378 v = make_node (REAL_CST);
1379 TREE_TYPE (v) = type;
1381 if (setjmp (float_error))
1388 set_float_handler (float_error);
1390 d = REAL_VALUE_TRUNCATE (TYPE_MODE (type), real_value_from_int_cst (i));
1392 /* Check for valid float value for this type on this target machine. */
1395 set_float_handler (NULL_PTR);
1397 #ifdef CHECK_FLOAT_VALUE
1398 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1401 TREE_REAL_CST (v) = d;
1402 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1406 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1408 /* Return a newly constructed STRING_CST node whose value is
1409 the LEN characters at STR.
1410 The TREE_TYPE is not initialized. */
1413 build_string (len, str)
1417 /* Put the string in saveable_obstack since it will be placed in the RTL
1418 for an "asm" statement and will also be kept around a while if
1419 deferring constant output in varasm.c. */
1421 register tree s = make_node (STRING_CST);
1422 TREE_STRING_LENGTH (s) = len;
1423 TREE_STRING_POINTER (s) = obstack_copy0 (saveable_obstack, str, len);
1427 /* Return a newly constructed COMPLEX_CST node whose value is
1428 specified by the real and imaginary parts REAL and IMAG.
1429 Both REAL and IMAG should be constant nodes.
1430 The TREE_TYPE is not initialized. */
1433 build_complex (real, imag)
1436 register tree t = make_node (COMPLEX_CST);
1438 TREE_REALPART (t) = real;
1439 TREE_IMAGPART (t) = imag;
1440 TREE_TYPE (t) = build_complex_type (TREE_TYPE (real));
1441 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1442 TREE_CONSTANT_OVERFLOW (t)
1443 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1447 /* Build a newly constructed TREE_VEC node of length LEN. */
1453 register int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
1454 register struct obstack *obstack = current_obstack;
1457 #ifdef GATHER_STATISTICS
1458 tree_node_counts[(int)vec_kind]++;
1459 tree_node_sizes[(int)vec_kind] += length;
1462 t = (tree) obstack_alloc (obstack, length);
1464 for (i = (length / sizeof (int)) - 1; i >= 0; i--)
1467 TREE_SET_CODE (t, TREE_VEC);
1468 TREE_VEC_LENGTH (t) = len;
1469 if (obstack == &permanent_obstack)
1470 TREE_PERMANENT (t) = 1;
1475 /* Return 1 if EXPR is the integer constant zero or a complex constant
1479 integer_zerop (expr)
1484 return ((TREE_CODE (expr) == INTEGER_CST
1485 && TREE_INT_CST_LOW (expr) == 0
1486 && TREE_INT_CST_HIGH (expr) == 0)
1487 || (TREE_CODE (expr) == COMPLEX_CST
1488 && integer_zerop (TREE_REALPART (expr))
1489 && integer_zerop (TREE_IMAGPART (expr))));
1492 /* Return 1 if EXPR is the integer constant one or the corresponding
1493 complex constant. */
1501 return ((TREE_CODE (expr) == INTEGER_CST
1502 && TREE_INT_CST_LOW (expr) == 1
1503 && TREE_INT_CST_HIGH (expr) == 0)
1504 || (TREE_CODE (expr) == COMPLEX_CST
1505 && integer_onep (TREE_REALPART (expr))
1506 && integer_zerop (TREE_IMAGPART (expr))));
1509 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1510 it contains. Likewise for the corresponding complex constant. */
1513 integer_all_onesp (expr)
1521 if (TREE_CODE (expr) == COMPLEX_CST
1522 && integer_all_onesp (TREE_REALPART (expr))
1523 && integer_zerop (TREE_IMAGPART (expr)))
1526 else if (TREE_CODE (expr) != INTEGER_CST)
1529 uns = TREE_UNSIGNED (TREE_TYPE (expr));
1531 return TREE_INT_CST_LOW (expr) == -1 && TREE_INT_CST_HIGH (expr) == -1;
1533 prec = TYPE_PRECISION (TREE_TYPE (expr));
1534 if (prec >= HOST_BITS_PER_WIDE_INT)
1536 int high_value, shift_amount;
1538 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1540 if (shift_amount > HOST_BITS_PER_WIDE_INT)
1541 /* Can not handle precisions greater than twice the host int size. */
1543 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
1544 /* Shifting by the host word size is undefined according to the ANSI
1545 standard, so we must handle this as a special case. */
1548 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1550 return TREE_INT_CST_LOW (expr) == -1
1551 && TREE_INT_CST_HIGH (expr) == high_value;
1554 return TREE_INT_CST_LOW (expr) == ((HOST_WIDE_INT) 1 << prec) - 1;
1557 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1561 integer_pow2p (expr)
1564 HOST_WIDE_INT high, low;
1568 if (TREE_CODE (expr) == COMPLEX_CST
1569 && integer_pow2p (TREE_REALPART (expr))
1570 && integer_zerop (TREE_IMAGPART (expr)))
1573 if (TREE_CODE (expr) != INTEGER_CST)
1576 high = TREE_INT_CST_HIGH (expr);
1577 low = TREE_INT_CST_LOW (expr);
1579 if (high == 0 && low == 0)
1582 return ((high == 0 && (low & (low - 1)) == 0)
1583 || (low == 0 && (high & (high - 1)) == 0));
1586 /* Return 1 if EXPR is the real constant zero. */
1594 return ((TREE_CODE (expr) == REAL_CST
1595 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1596 || (TREE_CODE (expr) == COMPLEX_CST
1597 && real_zerop (TREE_REALPART (expr))
1598 && real_zerop (TREE_IMAGPART (expr))));
1601 /* Return 1 if EXPR is the real constant one in real or complex form. */
1609 return ((TREE_CODE (expr) == REAL_CST
1610 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1611 || (TREE_CODE (expr) == COMPLEX_CST
1612 && real_onep (TREE_REALPART (expr))
1613 && real_zerop (TREE_IMAGPART (expr))));
1616 /* Return 1 if EXPR is the real constant two. */
1624 return ((TREE_CODE (expr) == REAL_CST
1625 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1626 || (TREE_CODE (expr) == COMPLEX_CST
1627 && real_twop (TREE_REALPART (expr))
1628 && real_zerop (TREE_IMAGPART (expr))));
1631 /* Nonzero if EXP is a constant or a cast of a constant. */
1634 really_constant_p (exp)
1637 /* This is not quite the same as STRIP_NOPS. It does more. */
1638 while (TREE_CODE (exp) == NOP_EXPR
1639 || TREE_CODE (exp) == CONVERT_EXPR
1640 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1641 exp = TREE_OPERAND (exp, 0);
1642 return TREE_CONSTANT (exp);
1645 /* Return first list element whose TREE_VALUE is ELEM.
1646 Return 0 if ELEM is not it LIST. */
1649 value_member (elem, list)
1654 if (elem == TREE_VALUE (list))
1656 list = TREE_CHAIN (list);
1661 /* Return first list element whose TREE_PURPOSE is ELEM.
1662 Return 0 if ELEM is not it LIST. */
1665 purpose_member (elem, list)
1670 if (elem == TREE_PURPOSE (list))
1672 list = TREE_CHAIN (list);
1677 /* Return first list element whose BINFO_TYPE is ELEM.
1678 Return 0 if ELEM is not it LIST. */
1681 binfo_member (elem, list)
1686 if (elem == BINFO_TYPE (list))
1688 list = TREE_CHAIN (list);
1693 /* Return nonzero if ELEM is part of the chain CHAIN. */
1696 chain_member (elem, chain)
1703 chain = TREE_CHAIN (chain);
1709 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1713 chain_member_value (elem, chain)
1718 if (elem == TREE_VALUE (chain))
1720 chain = TREE_CHAIN (chain);
1726 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1727 We expect a null pointer to mark the end of the chain.
1728 This is the Lisp primitive `length'. */
1735 register int len = 0;
1737 for (tail = t; tail; tail = TREE_CHAIN (tail))
1743 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1744 by modifying the last node in chain 1 to point to chain 2.
1745 This is the Lisp primitive `nconc'. */
1757 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1759 TREE_CHAIN (t1) = op2;
1760 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1762 abort (); /* Circularity created. */
1768 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1772 register tree chain;
1776 while (next = TREE_CHAIN (chain))
1781 /* Reverse the order of elements in the chain T,
1782 and return the new head of the chain (old last element). */
1788 register tree prev = 0, decl, next;
1789 for (decl = t; decl; decl = next)
1791 next = TREE_CHAIN (decl);
1792 TREE_CHAIN (decl) = prev;
1798 /* Given a chain CHAIN of tree nodes,
1799 construct and return a list of those nodes. */
1805 tree result = NULL_TREE;
1806 tree in_tail = chain;
1807 tree out_tail = NULL_TREE;
1811 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
1813 TREE_CHAIN (out_tail) = next;
1817 in_tail = TREE_CHAIN (in_tail);
1823 /* Return a newly created TREE_LIST node whose
1824 purpose and value fields are PARM and VALUE. */
1827 build_tree_list (parm, value)
1830 register tree t = make_node (TREE_LIST);
1831 TREE_PURPOSE (t) = parm;
1832 TREE_VALUE (t) = value;
1836 /* Similar, but build on the temp_decl_obstack. */
1839 build_decl_list (parm, value)
1843 register struct obstack *ambient_obstack = current_obstack;
1844 current_obstack = &temp_decl_obstack;
1845 node = build_tree_list (parm, value);
1846 current_obstack = ambient_obstack;
1850 /* Return a newly created TREE_LIST node whose
1851 purpose and value fields are PARM and VALUE
1852 and whose TREE_CHAIN is CHAIN. */
1855 tree_cons (purpose, value, chain)
1856 tree purpose, value, chain;
1859 register tree node = make_node (TREE_LIST);
1862 register tree node = (tree) obstack_alloc (current_obstack, sizeof (struct tree_list));
1863 #ifdef GATHER_STATISTICS
1864 tree_node_counts[(int)x_kind]++;
1865 tree_node_sizes[(int)x_kind] += sizeof (struct tree_list);
1868 for (i = (sizeof (struct tree_common) / sizeof (int)) - 1; i >= 0; i--)
1869 ((int *) node)[i] = 0;
1871 TREE_SET_CODE (node, TREE_LIST);
1872 if (current_obstack == &permanent_obstack)
1873 TREE_PERMANENT (node) = 1;
1876 TREE_CHAIN (node) = chain;
1877 TREE_PURPOSE (node) = purpose;
1878 TREE_VALUE (node) = value;
1882 /* Similar, but build on the temp_decl_obstack. */
1885 decl_tree_cons (purpose, value, chain)
1886 tree purpose, value, chain;
1889 register struct obstack *ambient_obstack = current_obstack;
1890 current_obstack = &temp_decl_obstack;
1891 node = tree_cons (purpose, value, chain);
1892 current_obstack = ambient_obstack;
1896 /* Same as `tree_cons' but make a permanent object. */
1899 perm_tree_cons (purpose, value, chain)
1900 tree purpose, value, chain;
1903 register struct obstack *ambient_obstack = current_obstack;
1904 current_obstack = &permanent_obstack;
1906 node = tree_cons (purpose, value, chain);
1907 current_obstack = ambient_obstack;
1911 /* Same as `tree_cons', but make this node temporary, regardless. */
1914 temp_tree_cons (purpose, value, chain)
1915 tree purpose, value, chain;
1918 register struct obstack *ambient_obstack = current_obstack;
1919 current_obstack = &temporary_obstack;
1921 node = tree_cons (purpose, value, chain);
1922 current_obstack = ambient_obstack;
1926 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
1929 saveable_tree_cons (purpose, value, chain)
1930 tree purpose, value, chain;
1933 register struct obstack *ambient_obstack = current_obstack;
1934 current_obstack = saveable_obstack;
1936 node = tree_cons (purpose, value, chain);
1937 current_obstack = ambient_obstack;
1941 /* Return the size nominally occupied by an object of type TYPE
1942 when it resides in memory. The value is measured in units of bytes,
1943 and its data type is that normally used for type sizes
1944 (which is the first type created by make_signed_type or
1945 make_unsigned_type). */
1948 size_in_bytes (type)
1953 if (type == error_mark_node)
1954 return integer_zero_node;
1955 type = TYPE_MAIN_VARIANT (type);
1956 if (TYPE_SIZE (type) == 0)
1958 incomplete_type_error (NULL_TREE, type);
1959 return integer_zero_node;
1961 t = size_binop (CEIL_DIV_EXPR, TYPE_SIZE (type),
1962 size_int (BITS_PER_UNIT));
1963 if (TREE_CODE (t) == INTEGER_CST)
1964 force_fit_type (t, 0);
1968 /* Return the size of TYPE (in bytes) as an integer,
1969 or return -1 if the size can vary. */
1972 int_size_in_bytes (type)
1976 if (type == error_mark_node)
1978 type = TYPE_MAIN_VARIANT (type);
1979 if (TYPE_SIZE (type) == 0)
1981 if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
1983 if (TREE_INT_CST_HIGH (TYPE_SIZE (type)) != 0)
1985 tree t = size_binop (CEIL_DIV_EXPR, TYPE_SIZE (type),
1986 size_int (BITS_PER_UNIT));
1987 return TREE_INT_CST_LOW (t);
1989 size = TREE_INT_CST_LOW (TYPE_SIZE (type));
1990 return (size + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
1993 /* Return, as a tree node, the number of elements for TYPE (which is an
1994 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1997 array_type_nelts (type)
2000 tree index_type = TYPE_DOMAIN (type);
2002 return (integer_zerop (TYPE_MIN_VALUE (index_type))
2003 ? TYPE_MAX_VALUE (index_type)
2004 : fold (build (MINUS_EXPR, TREE_TYPE (TYPE_MAX_VALUE (index_type)),
2005 TYPE_MAX_VALUE (index_type),
2006 TYPE_MIN_VALUE (index_type))));
2009 /* Return nonzero if arg is static -- a reference to an object in
2010 static storage. This is not the same as the C meaning of `static'. */
2016 switch (TREE_CODE (arg))
2019 /* Nested functions aren't static, since taking their address
2020 involves a trampoline. */
2021 return decl_function_context (arg) == 0;
2023 return TREE_STATIC (arg) || DECL_EXTERNAL (arg);
2026 return TREE_STATIC (arg);
2033 return staticp (TREE_OPERAND (arg, 0));
2036 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
2039 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2040 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2041 return staticp (TREE_OPERAND (arg, 0));
2047 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2048 Do this to any expression which may be used in more than one place,
2049 but must be evaluated only once.
2051 Normally, expand_expr would reevaluate the expression each time.
2052 Calling save_expr produces something that is evaluated and recorded
2053 the first time expand_expr is called on it. Subsequent calls to
2054 expand_expr just reuse the recorded value.
2056 The call to expand_expr that generates code that actually computes
2057 the value is the first call *at compile time*. Subsequent calls
2058 *at compile time* generate code to use the saved value.
2059 This produces correct result provided that *at run time* control
2060 always flows through the insns made by the first expand_expr
2061 before reaching the other places where the save_expr was evaluated.
2062 You, the caller of save_expr, must make sure this is so.
2064 Constants, and certain read-only nodes, are returned with no
2065 SAVE_EXPR because that is safe. Expressions containing placeholders
2066 are not touched; see tree.def for an explanation of what these
2073 register tree t = fold (expr);
2075 /* We don't care about whether this can be used as an lvalue in this
2077 while (TREE_CODE (t) == NON_LVALUE_EXPR)
2078 t = TREE_OPERAND (t, 0);
2080 /* If the tree evaluates to a constant, then we don't want to hide that
2081 fact (i.e. this allows further folding, and direct checks for constants).
2082 However, a read-only object that has side effects cannot be bypassed.
2083 Since it is no problem to reevaluate literals, we just return the
2086 if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t))
2087 || TREE_CODE (t) == SAVE_EXPR)
2090 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2091 it means that the size or offset of some field of an object depends on
2092 the value within another field.
2094 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2095 and some variable since it would then need to be both evaluated once and
2096 evaluated more than once. Front-ends must assure this case cannot
2097 happen by surrounding any such subexpressions in their own SAVE_EXPR
2098 and forcing evaluation at the proper time. */
2099 if (contains_placeholder_p (t))
2102 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
2104 /* This expression might be placed ahead of a jump to ensure that the
2105 value was computed on both sides of the jump. So make sure it isn't
2106 eliminated as dead. */
2107 TREE_SIDE_EFFECTS (t) = 1;
2111 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2112 or offset that depends on a field within a record.
2114 Note that we only allow such expressions within simple arithmetic
2118 contains_placeholder_p (exp)
2121 register enum tree_code code = TREE_CODE (exp);
2124 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2125 in it since it is supplying a value for it. */
2126 if (code == WITH_RECORD_EXPR)
2129 switch (TREE_CODE_CLASS (code))
2132 for (inner = TREE_OPERAND (exp, 0);
2133 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2134 inner = TREE_OPERAND (inner, 0))
2136 return TREE_CODE (inner) == PLACEHOLDER_EXPR;
2141 switch (tree_code_length[(int) code])
2144 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2146 return (code != RTL_EXPR
2147 && code != CONSTRUCTOR
2148 && ! (code == SAVE_EXPR && SAVE_EXPR_RTL (exp) != 0)
2149 && code != WITH_RECORD_EXPR
2150 && (contains_placeholder_p (TREE_OPERAND (exp, 0))
2151 || contains_placeholder_p (TREE_OPERAND (exp, 1))));
2153 return (code == COND_EXPR
2154 && (contains_placeholder_p (TREE_OPERAND (exp, 0))
2155 || contains_placeholder_p (TREE_OPERAND (exp, 1))
2156 || contains_placeholder_p (TREE_OPERAND (exp, 2))));
2163 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2164 return a tree with all occurrences of references to F in a
2165 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2166 contains only arithmetic expressions. */
2169 substitute_in_expr (exp, f, r)
2174 enum tree_code code = TREE_CODE (exp);
2177 switch (TREE_CODE_CLASS (code))
2184 if (code == PLACEHOLDER_EXPR)
2192 switch (tree_code_length[(int) code])
2195 return fold (build1 (code, TREE_TYPE (exp),
2196 substitute_in_expr (TREE_OPERAND (exp, 0),
2200 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2201 could, but we don't support it. */
2202 if (code == RTL_EXPR)
2204 else if (code == CONSTRUCTOR)
2207 return fold (build (code, TREE_TYPE (exp),
2208 substitute_in_expr (TREE_OPERAND (exp, 0), f, r),
2209 substitute_in_expr (TREE_OPERAND (exp, 1),
2213 /* It cannot be that anything inside a SAVE_EXPR contains a
2214 PLACEHOLDER_EXPR. */
2215 if (code == SAVE_EXPR)
2218 if (code != COND_EXPR)
2221 return fold (build (code, TREE_TYPE (exp),
2222 substitute_in_expr (TREE_OPERAND (exp, 0), f, r),
2223 substitute_in_expr (TREE_OPERAND (exp, 1), f, r),
2224 substitute_in_expr (TREE_OPERAND (exp, 2),
2234 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2235 and it is the right field, replace it with R. */
2236 for (inner = TREE_OPERAND (exp, 0);
2237 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2238 inner = TREE_OPERAND (inner, 0))
2240 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2241 && TREE_OPERAND (exp, 1) == f)
2244 return fold (build (code, TREE_TYPE (exp),
2245 substitute_in_expr (TREE_OPERAND (exp, 0), f, r),
2246 TREE_OPERAND (exp, 1)));
2248 return fold (build (code, TREE_TYPE (exp),
2249 substitute_in_expr (TREE_OPERAND (exp, 0), f, r),
2250 substitute_in_expr (TREE_OPERAND (exp, 1), f, r),
2251 substitute_in_expr (TREE_OPERAND (exp, 2), f, r)));
2254 return fold (build1 (code, TREE_TYPE (exp),
2255 substitute_in_expr (TREE_OPERAND (exp, 0),
2258 return fold (build (code, TREE_TYPE (exp),
2259 substitute_in_expr (TREE_OPERAND (exp, 0), f, r),
2260 substitute_in_expr (TREE_OPERAND (exp, 1), f, r)));
2264 /* If it wasn't one of the cases we handle, give up. */
2269 /* Given a type T, a FIELD_DECL F, and a replacement value R,
2270 return a new type with all size expressions that contain F
2271 updated by replacing F with R. */
2274 substitute_in_type (t, f, r)
2277 switch (TREE_CODE (t))
2286 if ((TREE_CODE (TYPE_MIN_VALUE (t)) != INTEGER_CST
2287 && contains_placeholder_p (TYPE_MIN_VALUE (t)))
2288 || (TREE_CODE (TYPE_MAX_VALUE (t)) != INTEGER_CST
2289 && contains_placeholder_p (TYPE_MAX_VALUE (t))))
2290 return build_range_type (t,
2291 substitute_in_expr (TYPE_MIN_VALUE (t), f, r),
2292 substitute_in_expr (TYPE_MAX_VALUE (t), f, r));
2296 if ((TYPE_MIN_VALUE (t) != 0
2297 && TREE_CODE (TYPE_MIN_VALUE (t)) != REAL_CST
2298 && contains_placeholder_p (TYPE_MIN_VALUE (t)))
2299 || (TYPE_MAX_VALUE (t) != 0
2300 && TREE_CODE (TYPE_MAX_VALUE (t)) != REAL_CST
2301 && contains_placeholder_p (TYPE_MAX_VALUE (t))))
2303 t = build_type_copy (t);
2305 if (TYPE_MIN_VALUE (t))
2306 TYPE_MIN_VALUE (t) = substitute_in_expr (TYPE_MIN_VALUE (t), f, r);
2307 if (TYPE_MAX_VALUE (t))
2308 TYPE_MAX_VALUE (t) = substitute_in_expr (TYPE_MAX_VALUE (t), f, r);
2313 return build_complex_type (substitute_in_type (TREE_TYPE (t), f, r));
2317 case REFERENCE_TYPE:
2322 /* Don't know how to do these yet. */
2326 t = build_array_type (substitute_in_type (TREE_TYPE (t), f, r),
2327 substitute_in_type (TYPE_DOMAIN (t), f, r));
2334 case QUAL_UNION_TYPE:
2336 tree new = copy_node (t);
2338 tree last_field = 0;
2340 /* Start out with no fields, make new fields, and chain them
2343 TYPE_FIELDS (new) = 0;
2344 TYPE_SIZE (new) = 0;
2346 for (field = TYPE_FIELDS (t); field;
2347 field = TREE_CHAIN (field))
2349 tree new_field = copy_node (field);
2351 TREE_TYPE (new_field)
2352 = substitute_in_type (TREE_TYPE (new_field), f, r);
2354 /* If this is an anonymous field and the type of this field is
2355 a UNION_TYPE or RECORD_TYPE with no elements, ignore it. If
2356 the type just has one element, treat that as the field.
2357 But don't do this if we are processing a QUAL_UNION_TYPE. */
2358 if (TREE_CODE (t) != QUAL_UNION_TYPE && DECL_NAME (new_field) == 0
2359 && (TREE_CODE (TREE_TYPE (new_field)) == UNION_TYPE
2360 || TREE_CODE (TREE_TYPE (new_field)) == RECORD_TYPE))
2362 if (TYPE_FIELDS (TREE_TYPE (new_field)) == 0)
2365 if (TREE_CHAIN (TYPE_FIELDS (TREE_TYPE (new_field))) == 0)
2366 new_field = TYPE_FIELDS (TREE_TYPE (new_field));
2369 DECL_CONTEXT (new_field) = new;
2370 DECL_SIZE (new_field) = 0;
2372 if (TREE_CODE (t) == QUAL_UNION_TYPE)
2374 /* Do the substitution inside the qualifier and if we find
2375 that this field will not be present, omit it. */
2376 DECL_QUALIFIER (new_field)
2377 = substitute_in_expr (DECL_QUALIFIER (field), f, r);
2378 if (integer_zerop (DECL_QUALIFIER (new_field)))
2382 if (last_field == 0)
2383 TYPE_FIELDS (new) = new_field;
2385 TREE_CHAIN (last_field) = new_field;
2387 last_field = new_field;
2389 /* If this is a qualified type and this field will always be
2390 present, we are done. */
2391 if (TREE_CODE (t) == QUAL_UNION_TYPE
2392 && integer_onep (DECL_QUALIFIER (new_field)))
2396 /* If this used to be a qualified union type, but we now know what
2397 field will be present, make this a normal union. */
2398 if (TREE_CODE (new) == QUAL_UNION_TYPE
2399 && (TYPE_FIELDS (new) == 0
2400 || integer_onep (DECL_QUALIFIER (TYPE_FIELDS (new)))))
2401 TREE_SET_CODE (new, UNION_TYPE);
2409 /* Stabilize a reference so that we can use it any number of times
2410 without causing its operands to be evaluated more than once.
2411 Returns the stabilized reference. This works by means of save_expr,
2412 so see the caveats in the comments about save_expr.
2414 Also allows conversion expressions whose operands are references.
2415 Any other kind of expression is returned unchanged. */
2418 stabilize_reference (ref)
2421 register tree result;
2422 register enum tree_code code = TREE_CODE (ref);
2429 /* No action is needed in this case. */
2435 case FIX_TRUNC_EXPR:
2436 case FIX_FLOOR_EXPR:
2437 case FIX_ROUND_EXPR:
2439 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2443 result = build_nt (INDIRECT_REF,
2444 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2448 result = build_nt (COMPONENT_REF,
2449 stabilize_reference (TREE_OPERAND (ref, 0)),
2450 TREE_OPERAND (ref, 1));
2454 result = build_nt (BIT_FIELD_REF,
2455 stabilize_reference (TREE_OPERAND (ref, 0)),
2456 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2457 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2461 result = build_nt (ARRAY_REF,
2462 stabilize_reference (TREE_OPERAND (ref, 0)),
2463 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2467 result = build_nt (COMPOUND_EXPR,
2468 stabilize_reference_1 (TREE_OPERAND (ref, 0)),
2469 stabilize_reference (TREE_OPERAND (ref, 1)));
2473 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2474 save_expr (build1 (ADDR_EXPR,
2475 build_pointer_type (TREE_TYPE (ref)),
2480 /* If arg isn't a kind of lvalue we recognize, make no change.
2481 Caller should recognize the error for an invalid lvalue. */
2486 return error_mark_node;
2489 TREE_TYPE (result) = TREE_TYPE (ref);
2490 TREE_READONLY (result) = TREE_READONLY (ref);
2491 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2492 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2493 TREE_RAISES (result) = TREE_RAISES (ref);
2498 /* Subroutine of stabilize_reference; this is called for subtrees of
2499 references. Any expression with side-effects must be put in a SAVE_EXPR
2500 to ensure that it is only evaluated once.
2502 We don't put SAVE_EXPR nodes around everything, because assigning very
2503 simple expressions to temporaries causes us to miss good opportunities
2504 for optimizations. Among other things, the opportunity to fold in the
2505 addition of a constant into an addressing mode often gets lost, e.g.
2506 "y[i+1] += x;". In general, we take the approach that we should not make
2507 an assignment unless we are forced into it - i.e., that any non-side effect
2508 operator should be allowed, and that cse should take care of coalescing
2509 multiple utterances of the same expression should that prove fruitful. */
2512 stabilize_reference_1 (e)
2515 register tree result;
2516 register enum tree_code code = TREE_CODE (e);
2518 /* We cannot ignore const expressions because it might be a reference
2519 to a const array but whose index contains side-effects. But we can
2520 ignore things that are actual constant or that already have been
2521 handled by this function. */
2523 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2526 switch (TREE_CODE_CLASS (code))
2536 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2537 so that it will only be evaluated once. */
2538 /* The reference (r) and comparison (<) classes could be handled as
2539 below, but it is generally faster to only evaluate them once. */
2540 if (TREE_SIDE_EFFECTS (e))
2541 return save_expr (e);
2545 /* Constants need no processing. In fact, we should never reach
2550 /* Division is slow and tends to be compiled with jumps,
2551 especially the division by powers of 2 that is often
2552 found inside of an array reference. So do it just once. */
2553 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2554 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2555 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2556 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2557 return save_expr (e);
2558 /* Recursively stabilize each operand. */
2559 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2560 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2564 /* Recursively stabilize each operand. */
2565 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2572 TREE_TYPE (result) = TREE_TYPE (e);
2573 TREE_READONLY (result) = TREE_READONLY (e);
2574 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2575 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2576 TREE_RAISES (result) = TREE_RAISES (e);
2581 /* Low-level constructors for expressions. */
2583 /* Build an expression of code CODE, data type TYPE,
2584 and operands as specified by the arguments ARG1 and following arguments.
2585 Expressions and reference nodes can be created this way.
2586 Constants, decls, types and misc nodes cannot be. */
2589 build VPROTO((enum tree_code code, tree tt, ...))
2592 enum tree_code code;
2597 register int length;
2603 code = va_arg (p, enum tree_code);
2604 tt = va_arg (p, tree);
2607 t = make_node (code);
2608 length = tree_code_length[(int) code];
2613 /* This is equivalent to the loop below, but faster. */
2614 register tree arg0 = va_arg (p, tree);
2615 register tree arg1 = va_arg (p, tree);
2616 TREE_OPERAND (t, 0) = arg0;
2617 TREE_OPERAND (t, 1) = arg1;
2618 if ((arg0 && TREE_SIDE_EFFECTS (arg0))
2619 || (arg1 && TREE_SIDE_EFFECTS (arg1)))
2620 TREE_SIDE_EFFECTS (t) = 1;
2622 = (arg0 && TREE_RAISES (arg0)) || (arg1 && TREE_RAISES (arg1));
2624 else if (length == 1)
2626 register tree arg0 = va_arg (p, tree);
2628 /* Call build1 for this! */
2629 if (TREE_CODE_CLASS (code) != 's')
2631 TREE_OPERAND (t, 0) = arg0;
2632 if (arg0 && TREE_SIDE_EFFECTS (arg0))
2633 TREE_SIDE_EFFECTS (t) = 1;
2634 TREE_RAISES (t) = (arg0 && TREE_RAISES (arg0));
2638 for (i = 0; i < length; i++)
2640 register tree operand = va_arg (p, tree);
2641 TREE_OPERAND (t, i) = operand;
2644 if (TREE_SIDE_EFFECTS (operand))
2645 TREE_SIDE_EFFECTS (t) = 1;
2646 if (TREE_RAISES (operand))
2647 TREE_RAISES (t) = 1;
2655 /* Same as above, but only builds for unary operators.
2656 Saves lions share of calls to `build'; cuts down use
2657 of varargs, which is expensive for RISC machines. */
2659 build1 (code, type, node)
2660 enum tree_code code;
2664 register struct obstack *obstack = current_obstack;
2665 register int i, length;
2666 register tree_node_kind kind;
2669 #ifdef GATHER_STATISTICS
2670 if (TREE_CODE_CLASS (code) == 'r')
2676 obstack = expression_obstack;
2677 length = sizeof (struct tree_exp);
2679 t = (tree) obstack_alloc (obstack, length);
2681 #ifdef GATHER_STATISTICS
2682 tree_node_counts[(int)kind]++;
2683 tree_node_sizes[(int)kind] += length;
2686 for (i = (length / sizeof (int)) - 1; i >= 0; i--)
2689 TREE_TYPE (t) = type;
2690 TREE_SET_CODE (t, code);
2692 if (obstack == &permanent_obstack)
2693 TREE_PERMANENT (t) = 1;
2695 TREE_OPERAND (t, 0) = node;
2698 if (TREE_SIDE_EFFECTS (node))
2699 TREE_SIDE_EFFECTS (t) = 1;
2700 if (TREE_RAISES (node))
2701 TREE_RAISES (t) = 1;
2707 /* Similar except don't specify the TREE_TYPE
2708 and leave the TREE_SIDE_EFFECTS as 0.
2709 It is permissible for arguments to be null,
2710 or even garbage if their values do not matter. */
2713 build_nt VPROTO((enum tree_code code, ...))
2716 enum tree_code code;
2720 register int length;
2726 code = va_arg (p, enum tree_code);
2729 t = make_node (code);
2730 length = tree_code_length[(int) code];
2732 for (i = 0; i < length; i++)
2733 TREE_OPERAND (t, i) = va_arg (p, tree);
2739 /* Similar to `build_nt', except we build
2740 on the temp_decl_obstack, regardless. */
2743 build_parse_node VPROTO((enum tree_code code, ...))
2746 enum tree_code code;
2748 register struct obstack *ambient_obstack = expression_obstack;
2751 register int length;
2757 code = va_arg (p, enum tree_code);
2760 expression_obstack = &temp_decl_obstack;
2762 t = make_node (code);
2763 length = tree_code_length[(int) code];
2765 for (i = 0; i < length; i++)
2766 TREE_OPERAND (t, i) = va_arg (p, tree);
2769 expression_obstack = ambient_obstack;
2774 /* Commented out because this wants to be done very
2775 differently. See cp-lex.c. */
2777 build_op_identifier (op1, op2)
2780 register tree t = make_node (OP_IDENTIFIER);
2781 TREE_PURPOSE (t) = op1;
2782 TREE_VALUE (t) = op2;
2787 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2788 We do NOT enter this node in any sort of symbol table.
2790 layout_decl is used to set up the decl's storage layout.
2791 Other slots are initialized to 0 or null pointers. */
2794 build_decl (code, name, type)
2795 enum tree_code code;
2800 t = make_node (code);
2802 /* if (type == error_mark_node)
2803 type = integer_type_node; */
2804 /* That is not done, deliberately, so that having error_mark_node
2805 as the type can suppress useless errors in the use of this variable. */
2807 DECL_NAME (t) = name;
2808 DECL_ASSEMBLER_NAME (t) = name;
2809 TREE_TYPE (t) = type;
2811 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2813 else if (code == FUNCTION_DECL)
2814 DECL_MODE (t) = FUNCTION_MODE;
2819 /* BLOCK nodes are used to represent the structure of binding contours
2820 and declarations, once those contours have been exited and their contents
2821 compiled. This information is used for outputting debugging info. */
2824 build_block (vars, tags, subblocks, supercontext, chain)
2825 tree vars, tags, subblocks, supercontext, chain;
2827 register tree block = make_node (BLOCK);
2828 BLOCK_VARS (block) = vars;
2829 BLOCK_TYPE_TAGS (block) = tags;
2830 BLOCK_SUBBLOCKS (block) = subblocks;
2831 BLOCK_SUPERCONTEXT (block) = supercontext;
2832 BLOCK_CHAIN (block) = chain;
2836 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
2840 build_decl_attribute_variant (ddecl, attribute)
2841 tree ddecl, attribute;
2843 DECL_MACHINE_ATTRIBUTES (ddecl) = attribute;
2847 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2850 Record such modified types already made so we don't make duplicates. */
2853 build_type_attribute_variant (ttype, attribute)
2854 tree ttype, attribute;
2856 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2858 register int hashcode;
2859 register struct obstack *ambient_obstack = current_obstack;
2862 if (ambient_obstack != &permanent_obstack)
2863 current_obstack = TYPE_OBSTACK (ttype);
2865 ntype = copy_node (ttype);
2866 current_obstack = ambient_obstack;
2868 TYPE_POINTER_TO (ntype) = 0;
2869 TYPE_REFERENCE_TO (ntype) = 0;
2870 TYPE_ATTRIBUTES (ntype) = attribute;
2872 /* Create a new main variant of TYPE. */
2873 TYPE_MAIN_VARIANT (ntype) = ntype;
2874 TYPE_NEXT_VARIANT (ntype) = 0;
2875 TYPE_READONLY (ntype) = TYPE_VOLATILE (ntype) = 0;
2877 hashcode = TYPE_HASH (TREE_CODE (ntype))
2878 + TYPE_HASH (TREE_TYPE (ntype))
2879 + type_hash_list (attribute);
2881 switch (TREE_CODE (ntype))
2884 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2887 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2890 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2893 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2897 ntype = type_hash_canon (hashcode, ntype);
2898 ttype = build_type_variant (ntype, TYPE_READONLY (ttype),
2899 TYPE_VOLATILE (ttype));
2905 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
2906 or type TYPE and 0 otherwise. Validity is determined the configuration
2907 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
2910 valid_machine_attribute (attr_name, attr_args, decl, type)
2911 tree attr_name, attr_args;
2916 tree decl_attr_list = decl != 0 ? DECL_MACHINE_ATTRIBUTES (decl) : 0;
2917 tree type_attr_list = TYPE_ATTRIBUTES (type);
2919 /* For now, we don't support args. */
2923 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
2925 && VALID_MACHINE_DECL_ATTRIBUTE (decl, decl_attr_list, attr_name))
2930 for (attr_list = decl_attr_list;
2932 attr_list = TREE_CHAIN (attr_list))
2933 if (TREE_VALUE (attr_list) == attr_name)
2937 decl_attr_list = tree_cons (NULL_TREE, attr_name, decl_attr_list);
2939 decl = build_decl_attribute_variant (decl, decl_attr_list);
2944 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2945 if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name))
2950 for (attr_list = type_attr_list;
2952 attr_list = TREE_CHAIN (attr_list))
2953 if (TREE_VALUE (attr_list) == attr_name)
2957 type_attr_list = tree_cons (NULL_TREE, attr_name, type_attr_list);
2959 type = build_type_attribute_variant (type, type_attr_list);
2961 TREE_TYPE (decl) = type;
2969 /* Return a type like TYPE except that its TYPE_READONLY is CONSTP
2970 and its TYPE_VOLATILE is VOLATILEP.
2972 Such variant types already made are recorded so that duplicates
2975 A variant types should never be used as the type of an expression.
2976 Always copy the variant information into the TREE_READONLY
2977 and TREE_THIS_VOLATILE of the expression, and then give the expression
2978 as its type the "main variant", the variant whose TYPE_READONLY
2979 and TYPE_VOLATILE are zero. Use TYPE_MAIN_VARIANT to find the
2983 build_type_variant (type, constp, volatilep)
2985 int constp, volatilep;
2989 /* Treat any nonzero argument as 1. */
2991 volatilep = !!volatilep;
2993 /* Search the chain of variants to see if there is already one there just
2994 like the one we need to have. If so, use that existing one. We must
2995 preserve the TYPE_NAME, since there is code that depends on this. */
2997 for (t = TYPE_MAIN_VARIANT(type); t; t = TYPE_NEXT_VARIANT (t))
2998 if (constp == TYPE_READONLY (t) && volatilep == TYPE_VOLATILE (t)
2999 && TYPE_NAME (t) == TYPE_NAME (type))
3002 /* We need a new one. */
3004 t = build_type_copy (type);
3005 TYPE_READONLY (t) = constp;
3006 TYPE_VOLATILE (t) = volatilep;
3011 /* Give TYPE a new main variant: NEW_MAIN.
3012 This is the right thing to do only when something else
3013 about TYPE is modified in place. */
3016 change_main_variant (type, new_main)
3017 tree type, new_main;
3020 tree omain = TYPE_MAIN_VARIANT (type);
3022 /* Remove TYPE from the TYPE_NEXT_VARIANT chain of its main variant. */
3023 if (TYPE_NEXT_VARIANT (omain) == type)
3024 TYPE_NEXT_VARIANT (omain) = TYPE_NEXT_VARIANT (type);
3026 for (t = TYPE_NEXT_VARIANT (omain); t && TYPE_NEXT_VARIANT (t);
3027 t = TYPE_NEXT_VARIANT (t))
3028 if (TYPE_NEXT_VARIANT (t) == type)
3030 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (type);
3034 TYPE_MAIN_VARIANT (type) = new_main;
3035 TYPE_NEXT_VARIANT (type) = TYPE_NEXT_VARIANT (new_main);
3036 TYPE_NEXT_VARIANT (new_main) = type;
3039 /* Create a new variant of TYPE, equivalent but distinct.
3040 This is so the caller can modify it. */
3043 build_type_copy (type)
3046 register tree t, m = TYPE_MAIN_VARIANT (type);
3047 register struct obstack *ambient_obstack = current_obstack;
3049 current_obstack = TYPE_OBSTACK (type);
3050 t = copy_node (type);
3051 current_obstack = ambient_obstack;
3053 TYPE_POINTER_TO (t) = 0;
3054 TYPE_REFERENCE_TO (t) = 0;
3056 /* Add this type to the chain of variants of TYPE. */
3057 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3058 TYPE_NEXT_VARIANT (m) = t;
3063 /* Hashing of types so that we don't make duplicates.
3064 The entry point is `type_hash_canon'. */
3066 /* Each hash table slot is a bucket containing a chain
3067 of these structures. */
3071 struct type_hash *next; /* Next structure in the bucket. */
3072 int hashcode; /* Hash code of this type. */
3073 tree type; /* The type recorded here. */
3076 /* Now here is the hash table. When recording a type, it is added
3077 to the slot whose index is the hash code mod the table size.
3078 Note that the hash table is used for several kinds of types
3079 (function types, array types and array index range types, for now).
3080 While all these live in the same table, they are completely independent,
3081 and the hash code is computed differently for each of these. */
3083 #define TYPE_HASH_SIZE 59
3084 struct type_hash *type_hash_table[TYPE_HASH_SIZE];
3086 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3087 with types in the TREE_VALUE slots), by adding the hash codes
3088 of the individual types. */
3091 type_hash_list (list)
3094 register int hashcode;
3096 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3097 hashcode += TYPE_HASH (TREE_VALUE (tail));
3101 /* Look in the type hash table for a type isomorphic to TYPE.
3102 If one is found, return it. Otherwise return 0. */
3105 type_hash_lookup (hashcode, type)
3109 register struct type_hash *h;
3110 for (h = type_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next)
3111 if (h->hashcode == hashcode
3112 && TREE_CODE (h->type) == TREE_CODE (type)
3113 && TREE_TYPE (h->type) == TREE_TYPE (type)
3114 && attribute_list_equal (TYPE_ATTRIBUTES (h->type),
3115 TYPE_ATTRIBUTES (type))
3116 && (TYPE_MAX_VALUE (h->type) == TYPE_MAX_VALUE (type)
3117 || tree_int_cst_equal (TYPE_MAX_VALUE (h->type),
3118 TYPE_MAX_VALUE (type)))
3119 && (TYPE_MIN_VALUE (h->type) == TYPE_MIN_VALUE (type)
3120 || tree_int_cst_equal (TYPE_MIN_VALUE (h->type),
3121 TYPE_MIN_VALUE (type)))
3122 && (TYPE_DOMAIN (h->type) == TYPE_DOMAIN (type)
3123 || (TYPE_DOMAIN (h->type)
3124 && TREE_CODE (TYPE_DOMAIN (h->type)) == TREE_LIST
3125 && TYPE_DOMAIN (type)
3126 && TREE_CODE (TYPE_DOMAIN (type)) == TREE_LIST
3127 && type_list_equal (TYPE_DOMAIN (h->type), TYPE_DOMAIN (type)))))
3132 /* Add an entry to the type-hash-table
3133 for a type TYPE whose hash code is HASHCODE. */
3136 type_hash_add (hashcode, type)
3140 register struct type_hash *h;
3142 h = (struct type_hash *) oballoc (sizeof (struct type_hash));
3143 h->hashcode = hashcode;
3145 h->next = type_hash_table[hashcode % TYPE_HASH_SIZE];
3146 type_hash_table[hashcode % TYPE_HASH_SIZE] = h;
3149 /* Given TYPE, and HASHCODE its hash code, return the canonical
3150 object for an identical type if one already exists.
3151 Otherwise, return TYPE, and record it as the canonical object
3152 if it is a permanent object.
3154 To use this function, first create a type of the sort you want.
3155 Then compute its hash code from the fields of the type that
3156 make it different from other similar types.
3157 Then call this function and use the value.
3158 This function frees the type you pass in if it is a duplicate. */
3160 /* Set to 1 to debug without canonicalization. Never set by program. */
3161 int debug_no_type_hash = 0;
3164 type_hash_canon (hashcode, type)
3170 if (debug_no_type_hash)
3173 t1 = type_hash_lookup (hashcode, type);
3176 obstack_free (TYPE_OBSTACK (type), type);
3177 #ifdef GATHER_STATISTICS
3178 tree_node_counts[(int)t_kind]--;
3179 tree_node_sizes[(int)t_kind] -= sizeof (struct tree_type);
3184 /* If this is a permanent type, record it for later reuse. */
3185 if (TREE_PERMANENT (type))
3186 type_hash_add (hashcode, type);
3191 /* Given two lists of attributes, return true if list l2 is
3192 equivalent to l1. */
3195 attribute_list_equal (l1, l2)
3198 return attribute_list_contained (l1, l2)
3199 && attribute_list_contained (l2, l1);
3202 /* Given two lists of attributes, return true if list l2 is
3203 completely contained within l1. */
3206 attribute_list_contained (l1, l2)
3209 register tree t1, t2;
3211 /* First check the obvious, maybe the lists are identical. */
3215 /* Then check the obvious, maybe the lists are similar. */
3216 for (t1 = l1, t2 = l2;
3218 && TREE_VALUE (t1) == TREE_VALUE (t2);
3219 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3221 /* Maybe the lists are equal. */
3222 if (t1 == 0 && t2 == 0)
3225 for (; t2; t2 = TREE_CHAIN (t2))
3226 if (!value_member (l1, t2))
3231 /* Given two lists of types
3232 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3233 return 1 if the lists contain the same types in the same order.
3234 Also, the TREE_PURPOSEs must match. */
3237 type_list_equal (l1, l2)
3240 register tree t1, t2;
3241 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3243 if (TREE_VALUE (t1) != TREE_VALUE (t2))
3245 if (TREE_PURPOSE (t1) != TREE_PURPOSE (t2))
3247 int cmp = simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2));
3251 || TREE_TYPE (TREE_PURPOSE (t1))
3252 != TREE_TYPE (TREE_PURPOSE (t2)))
3260 /* Nonzero if integer constants T1 and T2
3261 represent the same constant value. */
3264 tree_int_cst_equal (t1, t2)
3269 if (t1 == 0 || t2 == 0)
3271 if (TREE_CODE (t1) == INTEGER_CST
3272 && TREE_CODE (t2) == INTEGER_CST
3273 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3274 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3279 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3280 The precise way of comparison depends on their data type. */
3283 tree_int_cst_lt (t1, t2)
3289 if (!TREE_UNSIGNED (TREE_TYPE (t1)))
3290 return INT_CST_LT (t1, t2);
3291 return INT_CST_LT_UNSIGNED (t1, t2);
3294 /* Return an indication of the sign of the integer constant T.
3295 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3296 Note that -1 will never be returned it T's type is unsigned. */
3299 tree_int_cst_sgn (t)
3302 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3304 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3306 else if (TREE_INT_CST_HIGH (t) < 0)
3312 /* Compare two constructor-element-type constants. */
3314 simple_cst_list_equal (l1, l2)
3317 while (l1 != NULL_TREE && l2 != NULL_TREE)
3319 int cmp = simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2));
3324 l1 = TREE_CHAIN (l1);
3325 l2 = TREE_CHAIN (l2);
3330 /* Return truthvalue of whether T1 is the same tree structure as T2.
3331 Return 1 if they are the same.
3332 Return 0 if they are understandably different.
3333 Return -1 if either contains tree structure not understood by
3337 simple_cst_equal (t1, t2)
3340 register enum tree_code code1, code2;
3345 if (t1 == 0 || t2 == 0)
3348 code1 = TREE_CODE (t1);
3349 code2 = TREE_CODE (t2);
3351 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3352 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR || code2 == NON_LVALUE_EXPR)
3353 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3355 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3356 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3357 || code2 == NON_LVALUE_EXPR)
3358 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3366 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3367 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
3370 return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3373 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3374 && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3375 TREE_STRING_LENGTH (t1));
3381 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3384 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3387 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3390 /* Special case: if either target is an unallocated VAR_DECL,
3391 it means that it's going to be unified with whatever the
3392 TARGET_EXPR is really supposed to initialize, so treat it
3393 as being equivalent to anything. */
3394 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3395 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3396 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
3397 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3398 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3399 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
3402 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3405 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3407 case WITH_CLEANUP_EXPR:
3408 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3411 return simple_cst_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
3414 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3415 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3425 /* This general rule works for most tree codes.
3426 All exceptions should be handled above. */
3428 switch (TREE_CODE_CLASS (code1))
3438 for (i=0; i<tree_code_length[(int) code1]; ++i)
3440 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3450 /* Constructors for pointer, array and function types.
3451 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3452 constructed by language-dependent code, not here.) */
3454 /* Construct, lay out and return the type of pointers to TO_TYPE.
3455 If such a type has already been constructed, reuse it. */
3458 build_pointer_type (to_type)
3461 register tree t = TYPE_POINTER_TO (to_type);
3463 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3468 /* We need a new one. Put this in the same obstack as TO_TYPE. */
3469 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
3470 t = make_node (POINTER_TYPE);
3473 TREE_TYPE (t) = to_type;
3475 /* Record this type as the pointer to TO_TYPE. */
3476 TYPE_POINTER_TO (to_type) = t;
3478 /* Lay out the type. This function has many callers that are concerned
3479 with expression-construction, and this simplifies them all.
3480 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3486 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3487 MAXVAL should be the maximum value in the domain
3488 (one less than the length of the array). */
3491 build_index_type (maxval)
3494 register tree itype = make_node (INTEGER_TYPE);
3495 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3496 TYPE_MIN_VALUE (itype) = build_int_2 (0, 0);
3497 TREE_TYPE (TYPE_MIN_VALUE (itype)) = sizetype;
3498 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3499 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3500 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3501 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3502 if (TREE_CODE (maxval) == INTEGER_CST)
3504 int maxint = (int) TREE_INT_CST_LOW (maxval);
3505 /* If the domain should be empty, make sure the maxval
3506 remains -1 and is not spoiled by truncation. */
3507 if (INT_CST_LT (maxval, integer_zero_node))
3509 TYPE_MAX_VALUE (itype) = build_int_2 (-1, -1);
3510 TREE_TYPE (TYPE_MAX_VALUE (itype)) = sizetype;
3512 return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype);
3518 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3519 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3520 low bound LOWVAL and high bound HIGHVAL.
3521 if TYPE==NULL_TREE, sizetype is used. */
3524 build_range_type (type, lowval, highval)
3525 tree type, lowval, highval;
3527 register tree itype = make_node (INTEGER_TYPE);
3528 TREE_TYPE (itype) = type;
3529 if (type == NULL_TREE)
3531 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3532 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3533 TYPE_MAX_VALUE (itype) = convert (type, highval);
3534 TYPE_MODE (itype) = TYPE_MODE (type);
3535 TYPE_SIZE (itype) = TYPE_SIZE (type);
3536 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3537 if ((TREE_CODE (lowval) == INTEGER_CST)
3538 && (TREE_CODE (highval) == INTEGER_CST))
3540 HOST_WIDE_INT highint = TREE_INT_CST_LOW (highval);
3541 HOST_WIDE_INT lowint = TREE_INT_CST_LOW (lowval);
3542 int maxint = (int) (highint - lowint);
3543 return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype);
3549 /* Just like build_index_type, but takes lowval and highval instead
3550 of just highval (maxval). */
3553 build_index_2_type (lowval,highval)
3554 tree lowval, highval;
3556 return build_range_type (NULL_TREE, lowval, highval);
3559 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3560 Needed because when index types are not hashed, equal index types
3561 built at different times appear distinct, even though structurally,
3565 index_type_equal (itype1, itype2)
3566 tree itype1, itype2;
3568 if (TREE_CODE (itype1) != TREE_CODE (itype2))
3570 if (TREE_CODE (itype1) == INTEGER_TYPE)
3572 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
3573 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
3574 || ! simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2))
3575 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
3577 if (simple_cst_equal (TYPE_MIN_VALUE (itype1), TYPE_MIN_VALUE (itype2))
3578 && simple_cst_equal (TYPE_MAX_VALUE (itype1), TYPE_MAX_VALUE (itype2)))
3584 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3585 and number of elements specified by the range of values of INDEX_TYPE.
3586 If such a type has already been constructed, reuse it. */
3589 build_array_type (elt_type, index_type)
3590 tree elt_type, index_type;
3595 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3597 error ("arrays of functions are not meaningful");
3598 elt_type = integer_type_node;
3601 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3602 build_pointer_type (elt_type);
3604 /* Allocate the array after the pointer type,
3605 in case we free it in type_hash_canon. */
3606 t = make_node (ARRAY_TYPE);
3607 TREE_TYPE (t) = elt_type;
3608 TYPE_DOMAIN (t) = index_type;
3610 if (index_type == 0)
3615 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3616 t = type_hash_canon (hashcode, t);
3618 #if 0 /* This led to crashes, because it could put a temporary node
3619 on the TYPE_NEXT_VARIANT chain of a permanent one. */
3620 /* The main variant of an array type should always
3621 be an array whose element type is the main variant. */
3622 if (elt_type != TYPE_MAIN_VARIANT (elt_type))
3623 change_main_variant (t, build_array_type (TYPE_MAIN_VARIANT (elt_type),
3627 if (TYPE_SIZE (t) == 0)
3632 /* Construct, lay out and return
3633 the type of functions returning type VALUE_TYPE
3634 given arguments of types ARG_TYPES.
3635 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3636 are data type nodes for the arguments of the function.
3637 If such a type has already been constructed, reuse it. */
3640 build_function_type (value_type, arg_types)
3641 tree value_type, arg_types;
3646 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3648 error ("function return type cannot be function");
3649 value_type = integer_type_node;
3652 /* Make a node of the sort we want. */
3653 t = make_node (FUNCTION_TYPE);
3654 TREE_TYPE (t) = value_type;
3655 TYPE_ARG_TYPES (t) = arg_types;
3657 /* If we already have such a type, use the old one and free this one. */
3658 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3659 t = type_hash_canon (hashcode, t);
3661 if (TYPE_SIZE (t) == 0)
3666 /* Build the node for the type of references-to-TO_TYPE. */
3669 build_reference_type (to_type)
3672 register tree t = TYPE_REFERENCE_TO (to_type);
3673 register struct obstack *ambient_obstack = current_obstack;
3674 register struct obstack *ambient_saveable_obstack = saveable_obstack;
3676 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3681 /* We need a new one. If TO_TYPE is permanent, make this permanent too. */
3682 if (TREE_PERMANENT (to_type))
3684 current_obstack = &permanent_obstack;
3685 saveable_obstack = &permanent_obstack;
3688 t = make_node (REFERENCE_TYPE);
3689 TREE_TYPE (t) = to_type;
3691 /* Record this type as the pointer to TO_TYPE. */
3692 TYPE_REFERENCE_TO (to_type) = t;
3696 current_obstack = ambient_obstack;
3697 saveable_obstack = ambient_saveable_obstack;
3701 /* Construct, lay out and return the type of methods belonging to class
3702 BASETYPE and whose arguments and values are described by TYPE.
3703 If that type exists already, reuse it.
3704 TYPE must be a FUNCTION_TYPE node. */
3707 build_method_type (basetype, type)
3708 tree basetype, type;
3713 /* Make a node of the sort we want. */
3714 t = make_node (METHOD_TYPE);
3716 if (TREE_CODE (type) != FUNCTION_TYPE)
3719 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3720 TREE_TYPE (t) = TREE_TYPE (type);
3722 /* The actual arglist for this function includes a "hidden" argument
3723 which is "this". Put it into the list of argument types. */
3726 = tree_cons (NULL_TREE,
3727 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
3729 /* If we already have such a type, use the old one and free this one. */
3730 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3731 t = type_hash_canon (hashcode, t);
3733 if (TYPE_SIZE (t) == 0)
3739 /* Construct, lay out and return the type of offsets to a value
3740 of type TYPE, within an object of type BASETYPE.
3741 If a suitable offset type exists already, reuse it. */
3744 build_offset_type (basetype, type)
3745 tree basetype, type;
3750 /* Make a node of the sort we want. */
3751 t = make_node (OFFSET_TYPE);
3753 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3754 TREE_TYPE (t) = type;
3756 /* If we already have such a type, use the old one and free this one. */
3757 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3758 t = type_hash_canon (hashcode, t);
3760 if (TYPE_SIZE (t) == 0)
3766 /* Create a complex type whose components are COMPONENT_TYPE. */
3769 build_complex_type (component_type)
3770 tree component_type;
3775 /* Make a node of the sort we want. */
3776 t = make_node (COMPLEX_TYPE);
3778 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
3779 TYPE_VOLATILE (t) = TYPE_VOLATILE (component_type);
3780 TYPE_READONLY (t) = TYPE_READONLY (component_type);
3782 /* If we already have such a type, use the old one and free this one. */
3783 hashcode = TYPE_HASH (component_type);
3784 t = type_hash_canon (hashcode, t);
3786 if (TYPE_SIZE (t) == 0)
3792 /* Return OP, stripped of any conversions to wider types as much as is safe.
3793 Converting the value back to OP's type makes a value equivalent to OP.
3795 If FOR_TYPE is nonzero, we return a value which, if converted to
3796 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
3798 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
3799 narrowest type that can hold the value, even if they don't exactly fit.
3800 Otherwise, bit-field references are changed to a narrower type
3801 only if they can be fetched directly from memory in that type.
3803 OP must have integer, real or enumeral type. Pointers are not allowed!
3805 There are some cases where the obvious value we could return
3806 would regenerate to OP if converted to OP's type,
3807 but would not extend like OP to wider types.
3808 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
3809 For example, if OP is (unsigned short)(signed char)-1,
3810 we avoid returning (signed char)-1 if FOR_TYPE is int,
3811 even though extending that to an unsigned short would regenerate OP,
3812 since the result of extending (signed char)-1 to (int)
3813 is different from (int) OP. */
3816 get_unwidened (op, for_type)
3820 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
3821 /* TYPE_PRECISION is safe in place of type_precision since
3822 pointer types are not allowed. */
3823 register tree type = TREE_TYPE (op);
3824 register unsigned final_prec
3825 = TYPE_PRECISION (for_type != 0 ? for_type : type);
3827 = (for_type != 0 && for_type != type
3828 && final_prec > TYPE_PRECISION (type)
3829 && TREE_UNSIGNED (type));
3830 register tree win = op;
3832 while (TREE_CODE (op) == NOP_EXPR)
3834 register int bitschange
3835 = TYPE_PRECISION (TREE_TYPE (op))
3836 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
3838 /* Truncations are many-one so cannot be removed.
3839 Unless we are later going to truncate down even farther. */
3841 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
3844 /* See what's inside this conversion. If we decide to strip it,
3846 op = TREE_OPERAND (op, 0);
3848 /* If we have not stripped any zero-extensions (uns is 0),
3849 we can strip any kind of extension.
3850 If we have previously stripped a zero-extension,
3851 only zero-extensions can safely be stripped.
3852 Any extension can be stripped if the bits it would produce
3853 are all going to be discarded later by truncating to FOR_TYPE. */
3857 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
3859 /* TREE_UNSIGNED says whether this is a zero-extension.
3860 Let's avoid computing it if it does not affect WIN
3861 and if UNS will not be needed again. */
3862 if ((uns || TREE_CODE (op) == NOP_EXPR)
3863 && TREE_UNSIGNED (TREE_TYPE (op)))
3871 if (TREE_CODE (op) == COMPONENT_REF
3872 /* Since type_for_size always gives an integer type. */
3873 && TREE_CODE (type) != REAL_TYPE)
3875 unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
3876 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
3878 /* We can get this structure field in the narrowest type it fits in.
3879 If FOR_TYPE is 0, do this only for a field that matches the
3880 narrower type exactly and is aligned for it
3881 The resulting extension to its nominal type (a fullword type)
3882 must fit the same conditions as for other extensions. */
3884 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
3885 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
3886 && (! uns || final_prec <= innerprec
3887 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
3890 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
3891 TREE_OPERAND (op, 1));
3892 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
3893 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
3894 TREE_RAISES (win) = TREE_RAISES (op);
3900 /* Return OP or a simpler expression for a narrower value
3901 which can be sign-extended or zero-extended to give back OP.
3902 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3903 or 0 if the value should be sign-extended. */
3906 get_narrower (op, unsignedp_ptr)
3910 register int uns = 0;
3912 register tree win = op;
3914 while (TREE_CODE (op) == NOP_EXPR)
3916 register int bitschange
3917 = TYPE_PRECISION (TREE_TYPE (op))
3918 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
3920 /* Truncations are many-one so cannot be removed. */
3924 /* See what's inside this conversion. If we decide to strip it,
3926 op = TREE_OPERAND (op, 0);
3930 /* An extension: the outermost one can be stripped,
3931 but remember whether it is zero or sign extension. */
3933 uns = TREE_UNSIGNED (TREE_TYPE (op));
3934 /* Otherwise, if a sign extension has been stripped,
3935 only sign extensions can now be stripped;
3936 if a zero extension has been stripped, only zero-extensions. */
3937 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
3941 else /* bitschange == 0 */
3943 /* A change in nominal type can always be stripped, but we must
3944 preserve the unsignedness. */
3946 uns = TREE_UNSIGNED (TREE_TYPE (op));
3953 if (TREE_CODE (op) == COMPONENT_REF
3954 /* Since type_for_size always gives an integer type. */
3955 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE)
3957 unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
3958 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
3960 /* We can get this structure field in a narrower type that fits it,
3961 but the resulting extension to its nominal type (a fullword type)
3962 must satisfy the same conditions as for other extensions.
3964 Do this only for fields that are aligned (not bit-fields),
3965 because when bit-field insns will be used there is no
3966 advantage in doing this. */
3968 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
3969 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
3970 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
3974 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
3975 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
3976 TREE_OPERAND (op, 1));
3977 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
3978 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
3979 TREE_RAISES (win) = TREE_RAISES (op);
3982 *unsignedp_ptr = uns;
3986 /* Return the precision of a type, for arithmetic purposes.
3987 Supports all types on which arithmetic is possible
3988 (including pointer types).
3989 It's not clear yet what will be right for complex types. */
3992 type_precision (type)
3995 return ((TREE_CODE (type) == INTEGER_TYPE
3996 || TREE_CODE (type) == ENUMERAL_TYPE
3997 || TREE_CODE (type) == REAL_TYPE)
3998 ? TYPE_PRECISION (type) : POINTER_SIZE);
4001 /* Nonzero if integer constant C has a value that is permissible
4002 for type TYPE (an INTEGER_TYPE). */
4005 int_fits_type_p (c, type)
4008 if (TREE_UNSIGNED (type))
4009 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4010 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c))
4011 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
4012 && INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type))));
4014 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4015 && INT_CST_LT (TYPE_MAX_VALUE (type), c))
4016 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
4017 && INT_CST_LT (c, TYPE_MIN_VALUE (type))));
4020 /* Return the innermost context enclosing DECL that is
4021 a FUNCTION_DECL, or zero if none. */
4024 decl_function_context (decl)
4029 if (TREE_CODE (decl) == ERROR_MARK)
4032 if (TREE_CODE (decl) == SAVE_EXPR)
4033 context = SAVE_EXPR_CONTEXT (decl);
4035 context = DECL_CONTEXT (decl);
4037 while (context && TREE_CODE (context) != FUNCTION_DECL)
4039 if (TREE_CODE (context) == RECORD_TYPE
4040 || TREE_CODE (context) == UNION_TYPE)
4041 context = NULL_TREE;
4042 else if (TREE_CODE (context) == TYPE_DECL)
4043 context = DECL_CONTEXT (context);
4044 else if (TREE_CODE (context) == BLOCK)
4045 context = BLOCK_SUPERCONTEXT (context);
4047 /* Unhandled CONTEXT !? */
4054 /* Return the innermost context enclosing DECL that is
4055 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4056 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4059 decl_type_context (decl)
4062 tree context = DECL_CONTEXT (decl);
4066 if (TREE_CODE (context) == RECORD_TYPE
4067 || TREE_CODE (context) == UNION_TYPE
4068 || TREE_CODE (context) == QUAL_UNION_TYPE)
4070 if (TREE_CODE (context) == TYPE_DECL
4071 || TREE_CODE (context) == FUNCTION_DECL)
4072 context = DECL_CONTEXT (context);
4073 else if (TREE_CODE (context) == BLOCK)
4074 context = BLOCK_SUPERCONTEXT (context);
4076 /* Unhandled CONTEXT!? */
4083 print_obstack_statistics (str, o)
4087 struct _obstack_chunk *chunk = o->chunk;
4094 n_alloc += chunk->limit - &chunk->contents[0];
4095 chunk = chunk->prev;
4097 fprintf (stderr, "obstack %s: %d bytes, %d chunks\n",
4098 str, n_alloc, n_chunks);
4101 dump_tree_statistics ()
4104 int total_nodes, total_bytes;
4106 fprintf (stderr, "\n??? tree nodes created\n\n");
4107 #ifdef GATHER_STATISTICS
4108 fprintf (stderr, "Kind Nodes Bytes\n");
4109 fprintf (stderr, "-------------------------------------\n");
4110 total_nodes = total_bytes = 0;
4111 for (i = 0; i < (int) all_kinds; i++)
4113 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4114 tree_node_counts[i], tree_node_sizes[i]);
4115 total_nodes += tree_node_counts[i];
4116 total_bytes += tree_node_sizes[i];
4118 fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size);
4119 fprintf (stderr, "-------------------------------------\n");
4120 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4121 fprintf (stderr, "-------------------------------------\n");
4123 fprintf (stderr, "(No per-node statistics)\n");
4125 print_lang_statistics ();
4128 #define FILE_FUNCTION_PREFIX_LEN 9
4130 #ifndef NO_DOLLAR_IN_LABEL
4131 #define FILE_FUNCTION_FORMAT "_GLOBAL_$D$%s"
4132 #else /* NO_DOLLAR_IN_LABEL */
4133 #ifndef NO_DOT_IN_LABEL
4134 #define FILE_FUNCTION_FORMAT "_GLOBAL_.D.%s"
4135 #else /* NO_DOT_IN_LABEL */
4136 #define FILE_FUNCTION_FORMAT "_GLOBAL__D_%s"
4137 #endif /* NO_DOT_IN_LABEL */
4138 #endif /* NO_DOLLAR_IN_LABEL */
4140 extern char * first_global_object_name;
4142 /* If KIND=='I', return a suitable global initializer (constructor) name.
4143 If KIND=='D', return a suitable global clean-up (destructor) name. */
4146 get_file_function_name (kind)
4152 if (first_global_object_name)
4153 p = first_global_object_name;
4154 else if (main_input_filename)
4155 p = main_input_filename;
4159 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p));
4161 /* Set up the name of the file-level functions we may need. */
4162 /* Use a global object (which is already required to be unique over
4163 the program) rather than the file name (which imposes extra
4164 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
4165 sprintf (buf, FILE_FUNCTION_FORMAT, p);
4167 /* Don't need to pull wierd characters out of global names. */
4168 if (p != first_global_object_name)
4170 for (p = buf+11; *p; p++)
4171 if (! ((*p >= '0' && *p <= '9')
4172 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
4173 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
4177 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4180 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4183 || (*p >= 'A' && *p <= 'Z')
4184 || (*p >= 'a' && *p <= 'z')))
4188 buf[FILE_FUNCTION_PREFIX_LEN] = kind;
4190 return get_identifier (buf);
4193 /* Expand (the constant part of) a SET_TYPE CONTRUCTOR node.
4194 The result is placed in BUFFER (which has length BIT_SIZE),
4195 with one bit in each char ('\000' or '\001').
4197 If the constructor is constant, NULL_TREE is returned.
4198 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4201 get_set_constructor_bits (init, buffer, bit_size)
4208 HOST_WIDE_INT domain_min
4209 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))));
4210 tree non_const_bits = NULL_TREE;
4211 for (i = 0; i < bit_size; i++)
4214 for (vals = TREE_OPERAND (init, 1);
4215 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4217 if (TREE_CODE (TREE_VALUE (vals)) != INTEGER_CST
4218 || (TREE_PURPOSE (vals) != NULL_TREE
4219 && TREE_CODE (TREE_PURPOSE (vals)) != INTEGER_CST))
4221 tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4222 else if (TREE_PURPOSE (vals) != NULL_TREE)
4224 /* Set a range of bits to ones. */
4225 HOST_WIDE_INT lo_index
4226 = TREE_INT_CST_LOW (TREE_PURPOSE (vals)) - domain_min;
4227 HOST_WIDE_INT hi_index
4228 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
4229 if (lo_index < 0 || lo_index >= bit_size
4230 || hi_index < 0 || hi_index >= bit_size)
4232 for ( ; lo_index <= hi_index; lo_index++)
4233 buffer[lo_index] = 1;
4237 /* Set a single bit to one. */
4239 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
4240 if (index < 0 || index >= bit_size)
4242 error ("invalid initializer for bit string");
4248 return non_const_bits;
4251 /* Expand (the constant part of) a SET_TYPE CONTRUCTOR node.
4252 The result is placed in BUFFER (which is an array of bytes).
4253 If the constructor is constant, NULL_TREE is returned.
4254 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4257 get_set_constructor_bytes (init, buffer, wd_size)
4259 unsigned char *buffer;
4263 tree vals = TREE_OPERAND (init, 1);
4264 int set_word_size = BITS_PER_UNIT;
4265 int bit_size = wd_size * set_word_size;
4267 unsigned char *bytep = buffer;
4268 char *bit_buffer = (char*)alloca(bit_size);
4269 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4271 for (i = 0; i < wd_size; i++)
4274 for (i = 0; i < bit_size; i++)
4278 if (BITS_BIG_ENDIAN)
4279 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4281 *bytep |= 1 << bit_pos;
4284 if (bit_pos >= set_word_size)
4285 bit_pos = 0, bytep++;
4287 return non_const_bits;