1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
45 #define obstack_chunk_alloc xmalloc
46 #define obstack_chunk_free free
47 /* obstack.[ch] explicitly declined to prototype this. */
48 extern int _obstack_allocated_p PROTO ((struct obstack *h, PTR obj));
50 /* Tree nodes of permanent duration are allocated in this obstack.
51 They are the identifier nodes, and everything outside of
52 the bodies and parameters of function definitions. */
54 struct obstack permanent_obstack;
56 /* The initial RTL, and all ..._TYPE nodes, in a function
57 are allocated in this obstack. Usually they are freed at the
58 end of the function, but if the function is inline they are saved.
59 For top-level functions, this is maybepermanent_obstack.
60 Separate obstacks are made for nested functions. */
62 struct obstack *function_maybepermanent_obstack;
64 /* This is the function_maybepermanent_obstack for top-level functions. */
66 struct obstack maybepermanent_obstack;
68 /* The contents of the current function definition are allocated
69 in this obstack, and all are freed at the end of the function.
70 For top-level functions, this is temporary_obstack.
71 Separate obstacks are made for nested functions. */
73 struct obstack *function_obstack;
75 /* This is used for reading initializers of global variables. */
77 struct obstack temporary_obstack;
79 /* The tree nodes of an expression are allocated
80 in this obstack, and all are freed at the end of the expression. */
82 struct obstack momentary_obstack;
84 /* The tree nodes of a declarator are allocated
85 in this obstack, and all are freed when the declarator
88 static struct obstack temp_decl_obstack;
90 /* This points at either permanent_obstack
91 or the current function_maybepermanent_obstack. */
93 struct obstack *saveable_obstack;
95 /* This is same as saveable_obstack during parse and expansion phase;
96 it points to the current function's obstack during optimization.
97 This is the obstack to be used for creating rtl objects. */
99 struct obstack *rtl_obstack;
101 /* This points at either permanent_obstack or the current function_obstack. */
103 struct obstack *current_obstack;
105 /* This points at either permanent_obstack or the current function_obstack
106 or momentary_obstack. */
108 struct obstack *expression_obstack;
110 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
114 struct obstack_stack *next;
115 struct obstack *current;
116 struct obstack *saveable;
117 struct obstack *expression;
121 struct obstack_stack *obstack_stack;
123 /* Obstack for allocating struct obstack_stack entries. */
125 static struct obstack obstack_stack_obstack;
127 /* Addresses of first objects in some obstacks.
128 This is for freeing their entire contents. */
129 char *maybepermanent_firstobj;
130 char *temporary_firstobj;
131 char *momentary_firstobj;
132 char *temp_decl_firstobj;
134 /* This is used to preserve objects (mainly array initializers) that need to
135 live until the end of the current function, but no further. */
136 char *momentary_function_firstobj;
138 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
140 int all_types_permanent;
142 /* Stack of places to restore the momentary obstack back to. */
144 struct momentary_level
146 /* Pointer back to previous such level. */
147 struct momentary_level *prev;
148 /* First object allocated within this level. */
150 /* Value of expression_obstack saved at entry to this level. */
151 struct obstack *obstack;
154 struct momentary_level *momentary_stack;
156 /* Table indexed by tree code giving a string containing a character
157 classifying the tree code. Possibilities are
158 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
160 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
162 char tree_code_type[MAX_TREE_CODES] = {
167 /* Table indexed by tree code giving number of expression
168 operands beyond the fixed part of the node structure.
169 Not used for types or decls. */
171 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
173 int tree_code_length[MAX_TREE_CODES] = {
178 /* Names of tree components.
179 Used for printing out the tree and error messages. */
180 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
182 const char *tree_code_name[MAX_TREE_CODES] = {
187 /* Statistics-gathering stuff. */
208 int tree_node_counts[(int)all_kinds];
209 int tree_node_sizes[(int)all_kinds];
210 int id_string_size = 0;
212 const char *tree_node_kind_names[] = {
230 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
232 #define MAX_HASH_TABLE 1009
233 static tree hash_table[MAX_HASH_TABLE]; /* id hash buckets */
235 /* 0 while creating built-in identifiers. */
236 static int do_identifier_warnings;
238 /* Unique id for next decl created. */
239 static int next_decl_uid;
240 /* Unique id for next type created. */
241 static int next_type_uid = 1;
243 /* The language-specific function for alias analysis. If NULL, the
244 language does not do any special alias analysis. */
245 int (*lang_get_alias_set) PROTO((tree));
247 /* Here is how primitive or already-canonicalized types' hash
249 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
251 /* Each hash table slot is a bucket containing a chain
252 of these structures. */
256 struct type_hash *next; /* Next structure in the bucket. */
257 int hashcode; /* Hash code of this type. */
258 tree type; /* The type recorded here. */
261 /* Now here is the hash table. When recording a type, it is added
262 to the slot whose index is the hash code mod the table size.
263 Note that the hash table is used for several kinds of types
264 (function types, array types and array index range types, for now).
265 While all these live in the same table, they are completely independent,
266 and the hash code is computed differently for each of these. */
268 #define TYPE_HASH_SIZE 59
269 struct type_hash *type_hash_table[TYPE_HASH_SIZE];
271 static void set_type_quals PROTO((tree, int));
272 static void append_random_chars PROTO((char *));
273 static void build_real_from_int_cst_1 PROTO((PTR));
274 static void mark_type_hash PROTO ((void *));
276 void gcc_obstack_init ();
278 /* If non-null, a language specific helper for unsave_expr_now. */
280 void (*lang_unsave_expr_now) PROTO((tree));
282 tree global_trees[TI_MAX];
284 /* Init the principal obstacks. */
289 gcc_obstack_init (&obstack_stack_obstack);
290 gcc_obstack_init (&permanent_obstack);
292 gcc_obstack_init (&temporary_obstack);
293 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
294 gcc_obstack_init (&momentary_obstack);
295 momentary_firstobj = (char *) obstack_alloc (&momentary_obstack, 0);
296 momentary_function_firstobj = momentary_firstobj;
297 gcc_obstack_init (&maybepermanent_obstack);
298 maybepermanent_firstobj
299 = (char *) obstack_alloc (&maybepermanent_obstack, 0);
300 gcc_obstack_init (&temp_decl_obstack);
301 temp_decl_firstobj = (char *) obstack_alloc (&temp_decl_obstack, 0);
303 function_obstack = &temporary_obstack;
304 function_maybepermanent_obstack = &maybepermanent_obstack;
305 current_obstack = &permanent_obstack;
306 expression_obstack = &permanent_obstack;
307 rtl_obstack = saveable_obstack = &permanent_obstack;
309 /* Init the hash table of identifiers. */
310 bzero ((char *) hash_table, sizeof hash_table);
312 ggc_add_tree_root (hash_table, MAX_HASH_TABLE);
313 ggc_add_root (type_hash_table, TYPE_HASH_SIZE,
314 sizeof(struct type_hash *),
316 ggc_add_tree_root (global_trees, TI_MAX);
320 gcc_obstack_init (obstack)
321 struct obstack *obstack;
323 /* Let particular systems override the size of a chunk. */
324 #ifndef OBSTACK_CHUNK_SIZE
325 #define OBSTACK_CHUNK_SIZE 0
327 /* Let them override the alloc and free routines too. */
328 #ifndef OBSTACK_CHUNK_ALLOC
329 #define OBSTACK_CHUNK_ALLOC xmalloc
331 #ifndef OBSTACK_CHUNK_FREE
332 #define OBSTACK_CHUNK_FREE free
334 _obstack_begin (obstack, OBSTACK_CHUNK_SIZE, 0,
335 (void *(*) ()) OBSTACK_CHUNK_ALLOC,
336 (void (*) ()) OBSTACK_CHUNK_FREE);
339 /* Save all variables describing the current status into the structure
340 *P. This function is called whenever we start compiling one
341 function in the midst of compiling another. For example, when
342 compiling a nested function, or, in C++, a template instantiation
343 that is required by the function we are currently compiling.
345 CONTEXT is the decl_function_context for the function we're about to
346 compile; if it isn't current_function_decl, we have to play some games. */
352 p->all_types_permanent = all_types_permanent;
353 p->momentary_stack = momentary_stack;
354 p->maybepermanent_firstobj = maybepermanent_firstobj;
355 p->temporary_firstobj = temporary_firstobj;
356 p->momentary_firstobj = momentary_firstobj;
357 p->momentary_function_firstobj = momentary_function_firstobj;
358 p->function_obstack = function_obstack;
359 p->function_maybepermanent_obstack = function_maybepermanent_obstack;
360 p->current_obstack = current_obstack;
361 p->expression_obstack = expression_obstack;
362 p->saveable_obstack = saveable_obstack;
363 p->rtl_obstack = rtl_obstack;
365 function_maybepermanent_obstack
366 = (struct obstack *) xmalloc (sizeof (struct obstack));
367 gcc_obstack_init (function_maybepermanent_obstack);
368 maybepermanent_firstobj = NULL;
370 function_obstack = (struct obstack *) xmalloc (sizeof (struct obstack));
371 gcc_obstack_init (function_obstack);
373 current_obstack = &permanent_obstack;
374 expression_obstack = &permanent_obstack;
375 rtl_obstack = saveable_obstack = &permanent_obstack;
377 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
378 momentary_firstobj = (char *) obstack_finish (&momentary_obstack);
379 momentary_function_firstobj = momentary_firstobj;
382 /* Restore all variables describing the current status from the structure *P.
383 This is used after a nested function. */
386 restore_tree_status (p)
389 all_types_permanent = p->all_types_permanent;
390 momentary_stack = p->momentary_stack;
392 obstack_free (&momentary_obstack, momentary_function_firstobj);
394 /* Free saveable storage used by the function just compiled and not
396 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
398 obstack_free (&temporary_obstack, temporary_firstobj);
399 obstack_free (&momentary_obstack, momentary_function_firstobj);
401 obstack_free (function_obstack, NULL);
403 if (maybepermanent_firstobj == NULL)
404 free (function_maybepermanent_obstack);
405 free (function_obstack);
407 temporary_firstobj = p->temporary_firstobj;
408 momentary_firstobj = p->momentary_firstobj;
409 momentary_function_firstobj = p->momentary_function_firstobj;
410 maybepermanent_firstobj = p->maybepermanent_firstobj;
411 function_obstack = p->function_obstack;
412 function_maybepermanent_obstack = p->function_maybepermanent_obstack;
413 current_obstack = p->current_obstack;
414 expression_obstack = p->expression_obstack;
415 saveable_obstack = p->saveable_obstack;
416 rtl_obstack = p->rtl_obstack;
419 /* Start allocating on the temporary (per function) obstack.
420 This is done in start_function before parsing the function body,
421 and before each initialization at top level, and to go back
422 to temporary allocation after doing permanent_allocation. */
425 temporary_allocation ()
427 /* Note that function_obstack at top level points to temporary_obstack.
428 But within a nested function context, it is a separate obstack. */
429 current_obstack = function_obstack;
430 expression_obstack = function_obstack;
431 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
435 /* Start allocating on the permanent obstack but don't
436 free the temporary data. After calling this, call
437 `permanent_allocation' to fully resume permanent allocation status. */
440 end_temporary_allocation ()
442 current_obstack = &permanent_obstack;
443 expression_obstack = &permanent_obstack;
444 rtl_obstack = saveable_obstack = &permanent_obstack;
447 /* Resume allocating on the temporary obstack, undoing
448 effects of `end_temporary_allocation'. */
451 resume_temporary_allocation ()
453 current_obstack = function_obstack;
454 expression_obstack = function_obstack;
455 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
458 /* While doing temporary allocation, switch to allocating in such a
459 way as to save all nodes if the function is inlined. Call
460 resume_temporary_allocation to go back to ordinary temporary
464 saveable_allocation ()
466 /* Note that function_obstack at top level points to temporary_obstack.
467 But within a nested function context, it is a separate obstack. */
468 expression_obstack = current_obstack = saveable_obstack;
471 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
472 recording the previously current obstacks on a stack.
473 This does not free any storage in any obstack. */
476 push_obstacks (current, saveable)
477 struct obstack *current, *saveable;
479 struct obstack_stack *p;
481 p = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
482 (sizeof (struct obstack_stack)));
484 p->current = current_obstack;
485 p->saveable = saveable_obstack;
486 p->expression = expression_obstack;
487 p->rtl = rtl_obstack;
488 p->next = obstack_stack;
491 current_obstack = current;
492 expression_obstack = current;
493 rtl_obstack = saveable_obstack = saveable;
496 /* Save the current set of obstacks, but don't change them. */
499 push_obstacks_nochange ()
501 struct obstack_stack *p;
503 p = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
504 (sizeof (struct obstack_stack)));
506 p->current = current_obstack;
507 p->saveable = saveable_obstack;
508 p->expression = expression_obstack;
509 p->rtl = rtl_obstack;
510 p->next = obstack_stack;
514 /* Pop the obstack selection stack. */
519 struct obstack_stack *p;
522 obstack_stack = p->next;
524 current_obstack = p->current;
525 saveable_obstack = p->saveable;
526 expression_obstack = p->expression;
527 rtl_obstack = p->rtl;
529 obstack_free (&obstack_stack_obstack, p);
532 /* Nonzero if temporary allocation is currently in effect.
533 Zero if currently doing permanent allocation. */
536 allocation_temporary_p ()
538 return current_obstack != &permanent_obstack;
541 /* Go back to allocating on the permanent obstack
542 and free everything in the temporary obstack.
544 FUNCTION_END is true only if we have just finished compiling a function.
545 In that case, we also free preserved initial values on the momentary
549 permanent_allocation (function_end)
552 /* Free up previous temporary obstack data */
553 obstack_free (&temporary_obstack, temporary_firstobj);
556 obstack_free (&momentary_obstack, momentary_function_firstobj);
557 momentary_firstobj = momentary_function_firstobj;
560 obstack_free (&momentary_obstack, momentary_firstobj);
561 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
562 obstack_free (&temp_decl_obstack, temp_decl_firstobj);
564 current_obstack = &permanent_obstack;
565 expression_obstack = &permanent_obstack;
566 rtl_obstack = saveable_obstack = &permanent_obstack;
569 /* Save permanently everything on the maybepermanent_obstack. */
574 maybepermanent_firstobj
575 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
579 preserve_initializer ()
581 struct momentary_level *tem;
585 = (char *) obstack_alloc (&temporary_obstack, 0);
586 maybepermanent_firstobj
587 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
589 old_momentary = momentary_firstobj;
591 = (char *) obstack_alloc (&momentary_obstack, 0);
592 if (momentary_firstobj != old_momentary)
593 for (tem = momentary_stack; tem; tem = tem->prev)
594 tem->base = momentary_firstobj;
597 /* Start allocating new rtl in current_obstack.
598 Use resume_temporary_allocation
599 to go back to allocating rtl in saveable_obstack. */
602 rtl_in_current_obstack ()
604 rtl_obstack = current_obstack;
607 /* Start allocating rtl from saveable_obstack. Intended to be used after
608 a call to push_obstacks_nochange. */
611 rtl_in_saveable_obstack ()
613 rtl_obstack = saveable_obstack;
616 /* Allocate SIZE bytes in the current obstack
617 and return a pointer to them.
618 In practice the current obstack is always the temporary one. */
624 return (char *) obstack_alloc (current_obstack, size);
627 /* Free the object PTR in the current obstack
628 as well as everything allocated since PTR.
629 In practice the current obstack is always the temporary one. */
635 obstack_free (current_obstack, ptr);
638 /* Allocate SIZE bytes in the permanent obstack
639 and return a pointer to them. */
645 return (char *) obstack_alloc (&permanent_obstack, size);
648 /* Allocate NELEM items of SIZE bytes in the permanent obstack
649 and return a pointer to them. The storage is cleared before
650 returning the value. */
653 perm_calloc (nelem, size)
657 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
658 bzero (rval, nelem * size);
662 /* Allocate SIZE bytes in the saveable obstack
663 and return a pointer to them. */
669 return (char *) obstack_alloc (saveable_obstack, size);
672 /* Allocate SIZE bytes in the expression obstack
673 and return a pointer to them. */
679 return (char *) obstack_alloc (expression_obstack, size);
682 /* Print out which obstack an object is in. */
685 print_obstack_name (object, file, prefix)
690 struct obstack *obstack = NULL;
691 const char *obstack_name = NULL;
694 for (p = outer_function_chain; p; p = p->next)
696 if (_obstack_allocated_p (p->function_obstack, object))
698 obstack = p->function_obstack;
699 obstack_name = "containing function obstack";
701 if (_obstack_allocated_p (p->function_maybepermanent_obstack, object))
703 obstack = p->function_maybepermanent_obstack;
704 obstack_name = "containing function maybepermanent obstack";
708 if (_obstack_allocated_p (&obstack_stack_obstack, object))
710 obstack = &obstack_stack_obstack;
711 obstack_name = "obstack_stack_obstack";
713 else if (_obstack_allocated_p (function_obstack, object))
715 obstack = function_obstack;
716 obstack_name = "function obstack";
718 else if (_obstack_allocated_p (&permanent_obstack, object))
720 obstack = &permanent_obstack;
721 obstack_name = "permanent_obstack";
723 else if (_obstack_allocated_p (&momentary_obstack, object))
725 obstack = &momentary_obstack;
726 obstack_name = "momentary_obstack";
728 else if (_obstack_allocated_p (function_maybepermanent_obstack, object))
730 obstack = function_maybepermanent_obstack;
731 obstack_name = "function maybepermanent obstack";
733 else if (_obstack_allocated_p (&temp_decl_obstack, object))
735 obstack = &temp_decl_obstack;
736 obstack_name = "temp_decl_obstack";
739 /* Check to see if the object is in the free area of the obstack. */
742 if (object >= obstack->next_free
743 && object < obstack->chunk_limit)
744 fprintf (file, "%s in free portion of obstack %s",
745 prefix, obstack_name);
747 fprintf (file, "%s allocated from %s", prefix, obstack_name);
750 fprintf (file, "%s not allocated from any obstack", prefix);
754 debug_obstack (object)
757 print_obstack_name (object, stderr, "object");
758 fprintf (stderr, ".\n");
761 /* Return 1 if OBJ is in the permanent obstack.
762 This is slow, and should be used only for debugging.
763 Use TREE_PERMANENT for other purposes. */
766 object_permanent_p (obj)
769 return _obstack_allocated_p (&permanent_obstack, obj);
772 /* Start a level of momentary allocation.
773 In C, each compound statement has its own level
774 and that level is freed at the end of each statement.
775 All expression nodes are allocated in the momentary allocation level. */
780 struct momentary_level *tem
781 = (struct momentary_level *) obstack_alloc (&momentary_obstack,
782 sizeof (struct momentary_level));
783 tem->prev = momentary_stack;
784 tem->base = (char *) obstack_base (&momentary_obstack);
785 tem->obstack = expression_obstack;
786 momentary_stack = tem;
787 expression_obstack = &momentary_obstack;
790 /* Set things up so the next clear_momentary will only clear memory
791 past our present position in momentary_obstack. */
794 preserve_momentary ()
796 momentary_stack->base = (char *) obstack_base (&momentary_obstack);
799 /* Free all the storage in the current momentary-allocation level.
800 In C, this happens at the end of each statement. */
805 obstack_free (&momentary_obstack, momentary_stack->base);
808 /* Discard a level of momentary allocation.
809 In C, this happens at the end of each compound statement.
810 Restore the status of expression node allocation
811 that was in effect before this level was created. */
816 struct momentary_level *tem = momentary_stack;
817 momentary_stack = tem->prev;
818 expression_obstack = tem->obstack;
819 /* We can't free TEM from the momentary_obstack, because there might
820 be objects above it which have been saved. We can free back to the
821 stack of the level we are popping off though. */
822 obstack_free (&momentary_obstack, tem->base);
825 /* Pop back to the previous level of momentary allocation,
826 but don't free any momentary data just yet. */
829 pop_momentary_nofree ()
831 struct momentary_level *tem = momentary_stack;
832 momentary_stack = tem->prev;
833 expression_obstack = tem->obstack;
836 /* Call when starting to parse a declaration:
837 make expressions in the declaration last the length of the function.
838 Returns an argument that should be passed to resume_momentary later. */
843 register int tem = expression_obstack == &momentary_obstack;
844 expression_obstack = saveable_obstack;
848 /* Call when finished parsing a declaration:
849 restore the treatment of node-allocation that was
850 in effect before the suspension.
851 YES should be the value previously returned by suspend_momentary. */
854 resume_momentary (yes)
858 expression_obstack = &momentary_obstack;
861 /* Init the tables indexed by tree code.
862 Note that languages can add to these tables to define their own codes. */
870 /* Return a newly allocated node of code CODE.
871 Initialize the node's unique id and its TREE_PERMANENT flag.
872 For decl and type nodes, some other fields are initialized.
873 The rest of the node is initialized to zero.
875 Achoo! I got a code in the node. */
882 register int type = TREE_CODE_CLASS (code);
883 register int length = 0;
884 register struct obstack *obstack = current_obstack;
885 #ifdef GATHER_STATISTICS
886 register tree_node_kind kind;
891 case 'd': /* A decl node */
892 #ifdef GATHER_STATISTICS
895 length = sizeof (struct tree_decl);
896 /* All decls in an inline function need to be saved. */
897 if (obstack != &permanent_obstack)
898 obstack = saveable_obstack;
900 /* PARM_DECLs go on the context of the parent. If this is a nested
901 function, then we must allocate the PARM_DECL on the parent's
902 obstack, so that they will live to the end of the parent's
903 closing brace. This is necessary in case we try to inline the
904 function into its parent.
906 PARM_DECLs of top-level functions do not have this problem. However,
907 we allocate them where we put the FUNCTION_DECL for languages such as
908 Ada that need to consult some flags in the PARM_DECLs of the function
911 See comment in restore_tree_status for why we can't put this
912 in function_obstack. */
913 if (code == PARM_DECL && obstack != &permanent_obstack)
916 if (current_function_decl)
917 context = decl_function_context (current_function_decl);
921 = find_function_data (context)->function_maybepermanent_obstack;
925 case 't': /* a type node */
926 #ifdef GATHER_STATISTICS
929 length = sizeof (struct tree_type);
930 /* All data types are put where we can preserve them if nec. */
931 if (obstack != &permanent_obstack)
932 obstack = all_types_permanent ? &permanent_obstack : saveable_obstack;
935 case 'b': /* a lexical block */
936 #ifdef GATHER_STATISTICS
939 length = sizeof (struct tree_block);
940 /* All BLOCK nodes are put where we can preserve them if nec. */
941 if (obstack != &permanent_obstack)
942 obstack = saveable_obstack;
945 case 's': /* an expression with side effects */
946 #ifdef GATHER_STATISTICS
950 case 'r': /* a reference */
951 #ifdef GATHER_STATISTICS
955 case 'e': /* an expression */
956 case '<': /* a comparison expression */
957 case '1': /* a unary arithmetic expression */
958 case '2': /* a binary arithmetic expression */
959 #ifdef GATHER_STATISTICS
963 obstack = expression_obstack;
964 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
965 if (code == BIND_EXPR && obstack != &permanent_obstack)
966 obstack = saveable_obstack;
967 length = sizeof (struct tree_exp)
968 + (tree_code_length[(int) code] - 1) * sizeof (char *);
971 case 'c': /* a constant */
972 #ifdef GATHER_STATISTICS
975 obstack = expression_obstack;
977 /* We can't use tree_code_length for INTEGER_CST, since the number of
978 words is machine-dependent due to varying length of HOST_WIDE_INT,
979 which might be wider than a pointer (e.g., long long). Similarly
980 for REAL_CST, since the number of words is machine-dependent due
981 to varying size and alignment of `double'. */
983 if (code == INTEGER_CST)
984 length = sizeof (struct tree_int_cst);
985 else if (code == REAL_CST)
986 length = sizeof (struct tree_real_cst);
988 length = sizeof (struct tree_common)
989 + tree_code_length[(int) code] * sizeof (char *);
992 case 'x': /* something random, like an identifier. */
993 #ifdef GATHER_STATISTICS
994 if (code == IDENTIFIER_NODE)
996 else if (code == OP_IDENTIFIER)
998 else if (code == TREE_VEC)
1003 length = sizeof (struct tree_common)
1004 + tree_code_length[(int) code] * sizeof (char *);
1005 /* Identifier nodes are always permanent since they are
1006 unique in a compiler run. */
1007 if (code == IDENTIFIER_NODE) obstack = &permanent_obstack;
1015 t = ggc_alloc_tree (length);
1018 t = (tree) obstack_alloc (obstack, length);
1019 bzero ((PTR) t, length);
1022 #ifdef GATHER_STATISTICS
1023 tree_node_counts[(int)kind]++;
1024 tree_node_sizes[(int)kind] += length;
1027 TREE_SET_CODE (t, code);
1028 if (obstack == &permanent_obstack)
1029 TREE_PERMANENT (t) = 1;
1034 TREE_SIDE_EFFECTS (t) = 1;
1035 TREE_TYPE (t) = void_type_node;
1039 if (code != FUNCTION_DECL)
1041 DECL_IN_SYSTEM_HEADER (t)
1042 = in_system_header && (obstack == &permanent_obstack);
1043 DECL_SOURCE_LINE (t) = lineno;
1044 DECL_SOURCE_FILE (t) = (input_filename) ? input_filename : "<built-in>";
1045 DECL_UID (t) = next_decl_uid++;
1046 /* Note that we have not yet computed the alias set for this
1048 DECL_POINTER_ALIAS_SET (t) = -1;
1052 TYPE_UID (t) = next_type_uid++;
1054 TYPE_MAIN_VARIANT (t) = t;
1055 TYPE_OBSTACK (t) = obstack;
1056 TYPE_ATTRIBUTES (t) = NULL_TREE;
1057 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1058 SET_DEFAULT_TYPE_ATTRIBUTES (t);
1060 /* Note that we have not yet computed the alias set for this
1062 TYPE_ALIAS_SET (t) = -1;
1066 TREE_CONSTANT (t) = 1;
1073 /* Return a new node with the same contents as NODE except that its
1074 TREE_CHAIN is zero and it has a fresh uid. Unlike make_node, this
1075 function always performs the allocation on the CURRENT_OBSTACK;
1076 it's up to the caller to pick the right obstack before calling this
1084 register enum tree_code code = TREE_CODE (node);
1085 register int length = 0;
1087 switch (TREE_CODE_CLASS (code))
1089 case 'd': /* A decl node */
1090 length = sizeof (struct tree_decl);
1093 case 't': /* a type node */
1094 length = sizeof (struct tree_type);
1097 case 'b': /* a lexical block node */
1098 length = sizeof (struct tree_block);
1101 case 'r': /* a reference */
1102 case 'e': /* an expression */
1103 case 's': /* an expression with side effects */
1104 case '<': /* a comparison expression */
1105 case '1': /* a unary arithmetic expression */
1106 case '2': /* a binary arithmetic expression */
1107 length = sizeof (struct tree_exp)
1108 + (tree_code_length[(int) code] - 1) * sizeof (char *);
1111 case 'c': /* a constant */
1112 /* We can't use tree_code_length for INTEGER_CST, since the number of
1113 words is machine-dependent due to varying length of HOST_WIDE_INT,
1114 which might be wider than a pointer (e.g., long long). Similarly
1115 for REAL_CST, since the number of words is machine-dependent due
1116 to varying size and alignment of `double'. */
1117 if (code == INTEGER_CST)
1118 length = sizeof (struct tree_int_cst);
1119 else if (code == REAL_CST)
1120 length = sizeof (struct tree_real_cst);
1122 length = (sizeof (struct tree_common)
1123 + tree_code_length[(int) code] * sizeof (char *));
1126 case 'x': /* something random, like an identifier. */
1127 length = sizeof (struct tree_common)
1128 + tree_code_length[(int) code] * sizeof (char *);
1129 if (code == TREE_VEC)
1130 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
1134 t = ggc_alloc_tree (length);
1136 t = (tree) obstack_alloc (current_obstack, length);
1137 memcpy (t, node, length);
1139 /* EXPR_WITH_FILE_LOCATION must keep filename info stored in TREE_CHAIN */
1140 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
1142 TREE_ASM_WRITTEN (t) = 0;
1144 if (TREE_CODE_CLASS (code) == 'd')
1145 DECL_UID (t) = next_decl_uid++;
1146 else if (TREE_CODE_CLASS (code) == 't')
1148 TYPE_UID (t) = next_type_uid++;
1149 TYPE_OBSTACK (t) = current_obstack;
1151 /* The following is so that the debug code for
1152 the copy is different from the original type.
1153 The two statements usually duplicate each other
1154 (because they clear fields of the same union),
1155 but the optimizer should catch that. */
1156 TYPE_SYMTAB_POINTER (t) = 0;
1157 TYPE_SYMTAB_ADDRESS (t) = 0;
1160 TREE_PERMANENT (t) = (current_obstack == &permanent_obstack);
1165 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1166 For example, this can copy a list made of TREE_LIST nodes. */
1173 register tree prev, next;
1178 head = prev = copy_node (list);
1179 next = TREE_CHAIN (list);
1182 TREE_CHAIN (prev) = copy_node (next);
1183 prev = TREE_CHAIN (prev);
1184 next = TREE_CHAIN (next);
1191 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1192 If an identifier with that name has previously been referred to,
1193 the same node is returned this time. */
1196 get_identifier (text)
1197 register const char *text;
1202 register int len, hash_len;
1204 /* Compute length of text in len. */
1205 len = strlen (text);
1207 /* Decide how much of that length to hash on */
1209 if (warn_id_clash && (unsigned)len > id_clash_len)
1210 hash_len = id_clash_len;
1212 /* Compute hash code */
1213 hi = hash_len * 613 + (unsigned) text[0];
1214 for (i = 1; i < hash_len; i += 2)
1215 hi = ((hi * 613) + (unsigned) (text[i]));
1217 hi &= (1 << HASHBITS) - 1;
1218 hi %= MAX_HASH_TABLE;
1220 /* Search table for identifier */
1221 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1222 if (IDENTIFIER_LENGTH (idp) == len
1223 && IDENTIFIER_POINTER (idp)[0] == text[0]
1224 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1225 return idp; /* <-- return if found */
1227 /* Not found; optionally warn about a similar identifier */
1228 if (warn_id_clash && do_identifier_warnings && (unsigned)len >= id_clash_len)
1229 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1230 if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len))
1232 warning ("`%s' and `%s' identical in first %d characters",
1233 IDENTIFIER_POINTER (idp), text, id_clash_len);
1237 if (tree_code_length[(int) IDENTIFIER_NODE] < 0)
1238 abort (); /* set_identifier_size hasn't been called. */
1240 /* Not found, create one, add to chain */
1241 idp = make_node (IDENTIFIER_NODE);
1242 IDENTIFIER_LENGTH (idp) = len;
1243 #ifdef GATHER_STATISTICS
1244 id_string_size += len;
1248 IDENTIFIER_POINTER (idp) = ggc_alloc_string (text, len);
1250 IDENTIFIER_POINTER (idp) = obstack_copy0 (&permanent_obstack, text, len);
1252 TREE_CHAIN (idp) = hash_table[hi];
1253 hash_table[hi] = idp;
1254 return idp; /* <-- return if created */
1257 /* If an identifier with the name TEXT (a null-terminated string) has
1258 previously been referred to, return that node; otherwise return
1262 maybe_get_identifier (text)
1263 register const char *text;
1268 register int len, hash_len;
1270 /* Compute length of text in len. */
1271 len = strlen (text);
1273 /* Decide how much of that length to hash on */
1275 if (warn_id_clash && (unsigned)len > id_clash_len)
1276 hash_len = id_clash_len;
1278 /* Compute hash code */
1279 hi = hash_len * 613 + (unsigned) text[0];
1280 for (i = 1; i < hash_len; i += 2)
1281 hi = ((hi * 613) + (unsigned) (text[i]));
1283 hi &= (1 << HASHBITS) - 1;
1284 hi %= MAX_HASH_TABLE;
1286 /* Search table for identifier */
1287 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1288 if (IDENTIFIER_LENGTH (idp) == len
1289 && IDENTIFIER_POINTER (idp)[0] == text[0]
1290 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1291 return idp; /* <-- return if found */
1296 /* Enable warnings on similar identifiers (if requested).
1297 Done after the built-in identifiers are created. */
1300 start_identifier_warnings ()
1302 do_identifier_warnings = 1;
1305 /* Record the size of an identifier node for the language in use.
1306 SIZE is the total size in bytes.
1307 This is called by the language-specific files. This must be
1308 called before allocating any identifiers. */
1311 set_identifier_size (size)
1314 tree_code_length[(int) IDENTIFIER_NODE]
1315 = (size - sizeof (struct tree_common)) / sizeof (tree);
1318 /* Return a newly constructed INTEGER_CST node whose constant value
1319 is specified by the two ints LOW and HI.
1320 The TREE_TYPE is set to `int'.
1322 This function should be used via the `build_int_2' macro. */
1325 build_int_2_wide (low, hi)
1326 HOST_WIDE_INT low, hi;
1328 register tree t = make_node (INTEGER_CST);
1329 TREE_INT_CST_LOW (t) = low;
1330 TREE_INT_CST_HIGH (t) = hi;
1331 TREE_TYPE (t) = integer_type_node;
1335 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1338 build_real (type, d)
1345 /* Check for valid float value for this type on this target machine;
1346 if not, can print error message and store a valid value in D. */
1347 #ifdef CHECK_FLOAT_VALUE
1348 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1351 v = make_node (REAL_CST);
1352 TREE_TYPE (v) = type;
1353 TREE_REAL_CST (v) = d;
1354 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1358 /* Return a new REAL_CST node whose type is TYPE
1359 and whose value is the integer value of the INTEGER_CST node I. */
1361 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1364 real_value_from_int_cst (type, i)
1369 #ifdef REAL_ARITHMETIC
1370 if (! TREE_UNSIGNED (TREE_TYPE (i)))
1371 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1374 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
1375 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
1376 #else /* not REAL_ARITHMETIC */
1377 /* Some 386 compilers mishandle unsigned int to float conversions,
1378 so introduce a temporary variable E to avoid those bugs. */
1379 if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i)))
1383 d = (double) (~ TREE_INT_CST_HIGH (i));
1384 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1385 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1387 e = (double) (unsigned HOST_WIDE_INT) (~ TREE_INT_CST_LOW (i));
1395 d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i);
1396 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1397 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1399 e = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (i);
1402 #endif /* not REAL_ARITHMETIC */
1415 build_real_from_int_cst_1 (data)
1418 struct brfic_args * args = (struct brfic_args *) data;
1420 #ifdef REAL_ARITHMETIC
1421 args->d = real_value_from_int_cst (args->type, args->i);
1424 REAL_VALUE_TRUNCATE (TYPE_MODE (args->type),
1425 real_value_from_int_cst (args->type, args->i));
1429 /* This function can't be implemented if we can't do arithmetic
1430 on the float representation. */
1433 build_real_from_int_cst (type, i)
1438 int overflow = TREE_OVERFLOW (i);
1440 struct brfic_args args;
1442 v = make_node (REAL_CST);
1443 TREE_TYPE (v) = type;
1445 /* Setup input for build_real_from_int_cst_1() */
1449 if (do_float_handler (build_real_from_int_cst_1, (PTR) &args))
1451 /* Receive output from build_real_from_int_cst_1() */
1456 /* We got an exception from build_real_from_int_cst_1() */
1461 /* Check for valid float value for this type on this target machine. */
1463 #ifdef CHECK_FLOAT_VALUE
1464 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1467 TREE_REAL_CST (v) = d;
1468 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1472 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1474 /* Return a newly constructed STRING_CST node whose value is
1475 the LEN characters at STR.
1476 The TREE_TYPE is not initialized. */
1479 build_string (len, str)
1483 /* Put the string in saveable_obstack since it will be placed in the RTL
1484 for an "asm" statement and will also be kept around a while if
1485 deferring constant output in varasm.c. */
1487 register tree s = make_node (STRING_CST);
1488 TREE_STRING_LENGTH (s) = len;
1490 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
1492 TREE_STRING_POINTER (s) = obstack_copy0 (saveable_obstack, str, len);
1496 /* Return a newly constructed COMPLEX_CST node whose value is
1497 specified by the real and imaginary parts REAL and IMAG.
1498 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1499 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1502 build_complex (type, real, imag)
1506 register tree t = make_node (COMPLEX_CST);
1508 TREE_REALPART (t) = real;
1509 TREE_IMAGPART (t) = imag;
1510 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1511 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1512 TREE_CONSTANT_OVERFLOW (t)
1513 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1517 /* Build a newly constructed TREE_VEC node of length LEN. */
1524 register int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
1525 register struct obstack *obstack = current_obstack;
1527 #ifdef GATHER_STATISTICS
1528 tree_node_counts[(int)vec_kind]++;
1529 tree_node_sizes[(int)vec_kind] += length;
1533 t = ggc_alloc_tree (length);
1536 t = (tree) obstack_alloc (obstack, length);
1537 bzero ((PTR) t, length);
1540 TREE_SET_CODE (t, TREE_VEC);
1541 TREE_VEC_LENGTH (t) = len;
1542 if (obstack == &permanent_obstack)
1543 TREE_PERMANENT (t) = 1;
1548 /* Return 1 if EXPR is the integer constant zero or a complex constant
1552 integer_zerop (expr)
1557 return ((TREE_CODE (expr) == INTEGER_CST
1558 && ! TREE_CONSTANT_OVERFLOW (expr)
1559 && TREE_INT_CST_LOW (expr) == 0
1560 && TREE_INT_CST_HIGH (expr) == 0)
1561 || (TREE_CODE (expr) == COMPLEX_CST
1562 && integer_zerop (TREE_REALPART (expr))
1563 && integer_zerop (TREE_IMAGPART (expr))));
1566 /* Return 1 if EXPR is the integer constant one or the corresponding
1567 complex constant. */
1575 return ((TREE_CODE (expr) == INTEGER_CST
1576 && ! TREE_CONSTANT_OVERFLOW (expr)
1577 && TREE_INT_CST_LOW (expr) == 1
1578 && TREE_INT_CST_HIGH (expr) == 0)
1579 || (TREE_CODE (expr) == COMPLEX_CST
1580 && integer_onep (TREE_REALPART (expr))
1581 && integer_zerop (TREE_IMAGPART (expr))));
1584 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1585 it contains. Likewise for the corresponding complex constant. */
1588 integer_all_onesp (expr)
1596 if (TREE_CODE (expr) == COMPLEX_CST
1597 && integer_all_onesp (TREE_REALPART (expr))
1598 && integer_zerop (TREE_IMAGPART (expr)))
1601 else if (TREE_CODE (expr) != INTEGER_CST
1602 || TREE_CONSTANT_OVERFLOW (expr))
1605 uns = TREE_UNSIGNED (TREE_TYPE (expr));
1607 return TREE_INT_CST_LOW (expr) == -1 && TREE_INT_CST_HIGH (expr) == -1;
1609 /* Note that using TYPE_PRECISION here is wrong. We care about the
1610 actual bits, not the (arbitrary) range of the type. */
1611 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1612 if (prec >= HOST_BITS_PER_WIDE_INT)
1614 int high_value, shift_amount;
1616 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1618 if (shift_amount > HOST_BITS_PER_WIDE_INT)
1619 /* Can not handle precisions greater than twice the host int size. */
1621 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
1622 /* Shifting by the host word size is undefined according to the ANSI
1623 standard, so we must handle this as a special case. */
1626 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1628 return TREE_INT_CST_LOW (expr) == -1
1629 && TREE_INT_CST_HIGH (expr) == high_value;
1632 return TREE_INT_CST_LOW (expr) == ((HOST_WIDE_INT) 1 << prec) - 1;
1635 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1639 integer_pow2p (expr)
1643 HOST_WIDE_INT high, low;
1647 if (TREE_CODE (expr) == COMPLEX_CST
1648 && integer_pow2p (TREE_REALPART (expr))
1649 && integer_zerop (TREE_IMAGPART (expr)))
1652 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
1655 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1656 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1657 high = TREE_INT_CST_HIGH (expr);
1658 low = TREE_INT_CST_LOW (expr);
1660 /* First clear all bits that are beyond the type's precision in case
1661 we've been sign extended. */
1663 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1665 else if (prec > HOST_BITS_PER_WIDE_INT)
1666 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1670 if (prec < HOST_BITS_PER_WIDE_INT)
1671 low &= ~((HOST_WIDE_INT) (-1) << prec);
1674 if (high == 0 && low == 0)
1677 return ((high == 0 && (low & (low - 1)) == 0)
1678 || (low == 0 && (high & (high - 1)) == 0));
1681 /* Return the power of two represented by a tree node known to be a
1689 HOST_WIDE_INT high, low;
1693 if (TREE_CODE (expr) == COMPLEX_CST)
1694 return tree_log2 (TREE_REALPART (expr));
1696 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1697 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1699 high = TREE_INT_CST_HIGH (expr);
1700 low = TREE_INT_CST_LOW (expr);
1702 /* First clear all bits that are beyond the type's precision in case
1703 we've been sign extended. */
1705 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1707 else if (prec > HOST_BITS_PER_WIDE_INT)
1708 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1712 if (prec < HOST_BITS_PER_WIDE_INT)
1713 low &= ~((HOST_WIDE_INT) (-1) << prec);
1716 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1717 : exact_log2 (low));
1720 /* Return 1 if EXPR is the real constant zero. */
1728 return ((TREE_CODE (expr) == REAL_CST
1729 && ! TREE_CONSTANT_OVERFLOW (expr)
1730 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1731 || (TREE_CODE (expr) == COMPLEX_CST
1732 && real_zerop (TREE_REALPART (expr))
1733 && real_zerop (TREE_IMAGPART (expr))));
1736 /* Return 1 if EXPR is the real constant one in real or complex form. */
1744 return ((TREE_CODE (expr) == REAL_CST
1745 && ! TREE_CONSTANT_OVERFLOW (expr)
1746 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1747 || (TREE_CODE (expr) == COMPLEX_CST
1748 && real_onep (TREE_REALPART (expr))
1749 && real_zerop (TREE_IMAGPART (expr))));
1752 /* Return 1 if EXPR is the real constant two. */
1760 return ((TREE_CODE (expr) == REAL_CST
1761 && ! TREE_CONSTANT_OVERFLOW (expr)
1762 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1763 || (TREE_CODE (expr) == COMPLEX_CST
1764 && real_twop (TREE_REALPART (expr))
1765 && real_zerop (TREE_IMAGPART (expr))));
1768 /* Nonzero if EXP is a constant or a cast of a constant. */
1771 really_constant_p (exp)
1774 /* This is not quite the same as STRIP_NOPS. It does more. */
1775 while (TREE_CODE (exp) == NOP_EXPR
1776 || TREE_CODE (exp) == CONVERT_EXPR
1777 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1778 exp = TREE_OPERAND (exp, 0);
1779 return TREE_CONSTANT (exp);
1782 /* Return first list element whose TREE_VALUE is ELEM.
1783 Return 0 if ELEM is not in LIST. */
1786 value_member (elem, list)
1791 if (elem == TREE_VALUE (list))
1793 list = TREE_CHAIN (list);
1798 /* Return first list element whose TREE_PURPOSE is ELEM.
1799 Return 0 if ELEM is not in LIST. */
1802 purpose_member (elem, list)
1807 if (elem == TREE_PURPOSE (list))
1809 list = TREE_CHAIN (list);
1814 /* Return first list element whose BINFO_TYPE is ELEM.
1815 Return 0 if ELEM is not in LIST. */
1818 binfo_member (elem, list)
1823 if (elem == BINFO_TYPE (list))
1825 list = TREE_CHAIN (list);
1830 /* Return nonzero if ELEM is part of the chain CHAIN. */
1833 chain_member (elem, chain)
1840 chain = TREE_CHAIN (chain);
1846 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1848 /* ??? This function was added for machine specific attributes but is no
1849 longer used. It could be deleted if we could confirm all front ends
1853 chain_member_value (elem, chain)
1858 if (elem == TREE_VALUE (chain))
1860 chain = TREE_CHAIN (chain);
1866 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1867 for any piece of chain CHAIN. */
1868 /* ??? This function was added for machine specific attributes but is no
1869 longer used. It could be deleted if we could confirm all front ends
1873 chain_member_purpose (elem, chain)
1878 if (elem == TREE_PURPOSE (chain))
1880 chain = TREE_CHAIN (chain);
1886 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1887 We expect a null pointer to mark the end of the chain.
1888 This is the Lisp primitive `length'. */
1895 register int len = 0;
1897 for (tail = t; tail; tail = TREE_CHAIN (tail))
1903 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1904 by modifying the last node in chain 1 to point to chain 2.
1905 This is the Lisp primitive `nconc'. */
1915 #ifdef ENABLE_CHECKING
1919 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1921 TREE_CHAIN (t1) = op2;
1922 #ifdef ENABLE_CHECKING
1923 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1925 abort (); /* Circularity created. */
1932 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1936 register tree chain;
1940 while ((next = TREE_CHAIN (chain)))
1945 /* Reverse the order of elements in the chain T,
1946 and return the new head of the chain (old last element). */
1952 register tree prev = 0, decl, next;
1953 for (decl = t; decl; decl = next)
1955 next = TREE_CHAIN (decl);
1956 TREE_CHAIN (decl) = prev;
1962 /* Given a chain CHAIN of tree nodes,
1963 construct and return a list of those nodes. */
1969 tree result = NULL_TREE;
1970 tree in_tail = chain;
1971 tree out_tail = NULL_TREE;
1975 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
1977 TREE_CHAIN (out_tail) = next;
1981 in_tail = TREE_CHAIN (in_tail);
1987 /* Return a newly created TREE_LIST node whose
1988 purpose and value fields are PARM and VALUE. */
1991 build_tree_list (parm, value)
1994 register tree t = make_node (TREE_LIST);
1995 TREE_PURPOSE (t) = parm;
1996 TREE_VALUE (t) = value;
2000 /* Similar, but build on the temp_decl_obstack. */
2003 build_decl_list (parm, value)
2007 register struct obstack *ambient_obstack = current_obstack;
2008 current_obstack = &temp_decl_obstack;
2009 node = build_tree_list (parm, value);
2010 current_obstack = ambient_obstack;
2014 /* Similar, but build on the expression_obstack. */
2017 build_expr_list (parm, value)
2021 register struct obstack *ambient_obstack = current_obstack;
2022 current_obstack = expression_obstack;
2023 node = build_tree_list (parm, value);
2024 current_obstack = ambient_obstack;
2028 /* Return a newly created TREE_LIST node whose
2029 purpose and value fields are PARM and VALUE
2030 and whose TREE_CHAIN is CHAIN. */
2033 tree_cons (purpose, value, chain)
2034 tree purpose, value, chain;
2037 register tree node = make_node (TREE_LIST);
2042 node = ggc_alloc_tree (sizeof (struct tree_list));
2045 node = (tree) obstack_alloc (current_obstack, sizeof (struct tree_list));
2046 bzero (node, sizeof (struct tree_common));
2049 #ifdef GATHER_STATISTICS
2050 tree_node_counts[(int)x_kind]++;
2051 tree_node_sizes[(int)x_kind] += sizeof (struct tree_list);
2055 TREE_SET_CODE (node, TREE_LIST);
2056 if (current_obstack == &permanent_obstack)
2057 TREE_PERMANENT (node) = 1;
2060 TREE_CHAIN (node) = chain;
2061 TREE_PURPOSE (node) = purpose;
2062 TREE_VALUE (node) = value;
2066 /* Similar, but build on the temp_decl_obstack. */
2069 decl_tree_cons (purpose, value, chain)
2070 tree purpose, value, chain;
2073 register struct obstack *ambient_obstack = current_obstack;
2074 current_obstack = &temp_decl_obstack;
2075 node = tree_cons (purpose, value, chain);
2076 current_obstack = ambient_obstack;
2080 /* Similar, but build on the expression_obstack. */
2083 expr_tree_cons (purpose, value, chain)
2084 tree purpose, value, chain;
2087 register struct obstack *ambient_obstack = current_obstack;
2088 current_obstack = expression_obstack;
2089 node = tree_cons (purpose, value, chain);
2090 current_obstack = ambient_obstack;
2094 /* Same as `tree_cons' but make a permanent object. */
2097 perm_tree_cons (purpose, value, chain)
2098 tree purpose, value, chain;
2101 register struct obstack *ambient_obstack = current_obstack;
2102 current_obstack = &permanent_obstack;
2104 node = tree_cons (purpose, value, chain);
2105 current_obstack = ambient_obstack;
2109 /* Same as `tree_cons', but make this node temporary, regardless. */
2112 temp_tree_cons (purpose, value, chain)
2113 tree purpose, value, chain;
2116 register struct obstack *ambient_obstack = current_obstack;
2117 current_obstack = &temporary_obstack;
2119 node = tree_cons (purpose, value, chain);
2120 current_obstack = ambient_obstack;
2124 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2127 saveable_tree_cons (purpose, value, chain)
2128 tree purpose, value, chain;
2131 register struct obstack *ambient_obstack = current_obstack;
2132 current_obstack = saveable_obstack;
2134 node = tree_cons (purpose, value, chain);
2135 current_obstack = ambient_obstack;
2139 /* Return the size nominally occupied by an object of type TYPE
2140 when it resides in memory. The value is measured in units of bytes,
2141 and its data type is that normally used for type sizes
2142 (which is the first type created by make_signed_type or
2143 make_unsigned_type). */
2146 size_in_bytes (type)
2151 if (type == error_mark_node)
2152 return integer_zero_node;
2154 type = TYPE_MAIN_VARIANT (type);
2155 t = TYPE_SIZE_UNIT (type);
2158 incomplete_type_error (NULL_TREE, type);
2159 return integer_zero_node;
2161 if (TREE_CODE (t) == INTEGER_CST)
2162 force_fit_type (t, 0);
2167 /* Return the size of TYPE (in bytes) as a wide integer
2168 or return -1 if the size can vary or is larger than an integer. */
2171 int_size_in_bytes (type)
2176 if (type == error_mark_node)
2179 type = TYPE_MAIN_VARIANT (type);
2180 t = TYPE_SIZE_UNIT (type);
2182 || TREE_CODE (t) != INTEGER_CST
2183 || TREE_INT_CST_HIGH (t) != 0)
2186 return TREE_INT_CST_LOW (t);
2189 /* Return, as a tree node, the number of elements for TYPE (which is an
2190 ARRAY_TYPE) minus one. This counts only elements of the top array.
2192 Don't let any SAVE_EXPRs escape; if we are called as part of a cleanup
2193 action, they would get unsaved. */
2196 array_type_nelts (type)
2199 tree index_type, min, max;
2201 /* If they did it with unspecified bounds, then we should have already
2202 given an error about it before we got here. */
2203 if (! TYPE_DOMAIN (type))
2204 return error_mark_node;
2206 index_type = TYPE_DOMAIN (type);
2207 min = TYPE_MIN_VALUE (index_type);
2208 max = TYPE_MAX_VALUE (index_type);
2210 if (! TREE_CONSTANT (min))
2213 if (TREE_CODE (min) == SAVE_EXPR && SAVE_EXPR_RTL (min))
2214 min = build (RTL_EXPR, TREE_TYPE (TYPE_MIN_VALUE (index_type)), 0,
2215 SAVE_EXPR_RTL (min));
2217 min = TYPE_MIN_VALUE (index_type);
2220 if (! TREE_CONSTANT (max))
2223 if (TREE_CODE (max) == SAVE_EXPR && SAVE_EXPR_RTL (max))
2224 max = build (RTL_EXPR, TREE_TYPE (TYPE_MAX_VALUE (index_type)), 0,
2225 SAVE_EXPR_RTL (max));
2227 max = TYPE_MAX_VALUE (index_type);
2230 return (integer_zerop (min)
2232 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
2235 /* Return nonzero if arg is static -- a reference to an object in
2236 static storage. This is not the same as the C meaning of `static'. */
2242 switch (TREE_CODE (arg))
2245 /* Nested functions aren't static, since taking their address
2246 involves a trampoline. */
2247 return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
2248 && ! DECL_NON_ADDR_CONST_P (arg);
2251 return (TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2252 && ! DECL_NON_ADDR_CONST_P (arg);
2255 return TREE_STATIC (arg);
2260 /* If we are referencing a bitfield, we can't evaluate an
2261 ADDR_EXPR at compile time and so it isn't a constant. */
2263 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
2264 && staticp (TREE_OPERAND (arg, 0)));
2270 /* This case is technically correct, but results in setting
2271 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2274 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
2278 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2279 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2280 return staticp (TREE_OPERAND (arg, 0));
2287 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2288 Do this to any expression which may be used in more than one place,
2289 but must be evaluated only once.
2291 Normally, expand_expr would reevaluate the expression each time.
2292 Calling save_expr produces something that is evaluated and recorded
2293 the first time expand_expr is called on it. Subsequent calls to
2294 expand_expr just reuse the recorded value.
2296 The call to expand_expr that generates code that actually computes
2297 the value is the first call *at compile time*. Subsequent calls
2298 *at compile time* generate code to use the saved value.
2299 This produces correct result provided that *at run time* control
2300 always flows through the insns made by the first expand_expr
2301 before reaching the other places where the save_expr was evaluated.
2302 You, the caller of save_expr, must make sure this is so.
2304 Constants, and certain read-only nodes, are returned with no
2305 SAVE_EXPR because that is safe. Expressions containing placeholders
2306 are not touched; see tree.def for an explanation of what these
2313 register tree t = fold (expr);
2315 /* We don't care about whether this can be used as an lvalue in this
2317 while (TREE_CODE (t) == NON_LVALUE_EXPR)
2318 t = TREE_OPERAND (t, 0);
2320 /* If the tree evaluates to a constant, then we don't want to hide that
2321 fact (i.e. this allows further folding, and direct checks for constants).
2322 However, a read-only object that has side effects cannot be bypassed.
2323 Since it is no problem to reevaluate literals, we just return the
2326 if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t))
2327 || TREE_CODE (t) == SAVE_EXPR || TREE_CODE (t) == ERROR_MARK)
2330 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2331 it means that the size or offset of some field of an object depends on
2332 the value within another field.
2334 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2335 and some variable since it would then need to be both evaluated once and
2336 evaluated more than once. Front-ends must assure this case cannot
2337 happen by surrounding any such subexpressions in their own SAVE_EXPR
2338 and forcing evaluation at the proper time. */
2339 if (contains_placeholder_p (t))
2342 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
2344 /* This expression might be placed ahead of a jump to ensure that the
2345 value was computed on both sides of the jump. So make sure it isn't
2346 eliminated as dead. */
2347 TREE_SIDE_EFFECTS (t) = 1;
2351 /* Arrange for an expression to be expanded multiple independent
2352 times. This is useful for cleanup actions, as the backend can
2353 expand them multiple times in different places. */
2361 /* If this is already protected, no sense in protecting it again. */
2362 if (TREE_CODE (expr) == UNSAVE_EXPR)
2365 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
2366 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
2370 /* Returns the index of the first non-tree operand for CODE, or the number
2371 of operands if all are trees. */
2375 enum tree_code code;
2381 case GOTO_SUBROUTINE_EXPR:
2386 case WITH_CLEANUP_EXPR:
2387 /* Should be defined to be 2. */
2389 case METHOD_CALL_EXPR:
2392 return tree_code_length [(int) code];
2396 /* Modify a tree in place so that all the evaluate only once things
2397 are cleared out. Return the EXPR given.
2399 LANG_UNSAVE_EXPR_NOW, if set, is a pointer to a function to handle
2400 language specific nodes.
2404 unsave_expr_now (expr)
2407 enum tree_code code;
2411 if (expr == NULL_TREE)
2414 code = TREE_CODE (expr);
2415 first_rtl = first_rtl_op (code);
2419 SAVE_EXPR_RTL (expr) = 0;
2423 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
2424 TREE_OPERAND (expr, 3) = NULL_TREE;
2428 /* I don't yet know how to emit a sequence multiple times. */
2429 if (RTL_EXPR_SEQUENCE (expr) != 0)
2434 CALL_EXPR_RTL (expr) = 0;
2435 if (TREE_OPERAND (expr, 1)
2436 && TREE_CODE (TREE_OPERAND (expr, 1)) == TREE_LIST)
2438 tree exp = TREE_OPERAND (expr, 1);
2441 unsave_expr_now (TREE_VALUE (exp));
2442 exp = TREE_CHAIN (exp);
2448 if (lang_unsave_expr_now)
2449 (*lang_unsave_expr_now) (expr);
2453 switch (TREE_CODE_CLASS (code))
2455 case 'c': /* a constant */
2456 case 't': /* a type node */
2457 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2458 case 'd': /* A decl node */
2459 case 'b': /* A block node */
2462 case 'e': /* an expression */
2463 case 'r': /* a reference */
2464 case 's': /* an expression with side effects */
2465 case '<': /* a comparison expression */
2466 case '2': /* a binary arithmetic expression */
2467 case '1': /* a unary arithmetic expression */
2468 for (i = first_rtl - 1; i >= 0; i--)
2469 unsave_expr_now (TREE_OPERAND (expr, i));
2477 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2478 or offset that depends on a field within a record. */
2481 contains_placeholder_p (exp)
2484 register enum tree_code code = TREE_CODE (exp);
2487 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2488 in it since it is supplying a value for it. */
2489 if (code == WITH_RECORD_EXPR)
2491 else if (code == PLACEHOLDER_EXPR)
2494 switch (TREE_CODE_CLASS (code))
2497 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2498 position computations since they will be converted into a
2499 WITH_RECORD_EXPR involving the reference, which will assume
2500 here will be valid. */
2501 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2504 if (code == TREE_LIST)
2505 return (contains_placeholder_p (TREE_VALUE (exp))
2506 || (TREE_CHAIN (exp) != 0
2507 && contains_placeholder_p (TREE_CHAIN (exp))));
2516 /* Ignoring the first operand isn't quite right, but works best. */
2517 return contains_placeholder_p (TREE_OPERAND (exp, 1));
2524 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
2525 || contains_placeholder_p (TREE_OPERAND (exp, 1))
2526 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
2529 /* If we already know this doesn't have a placeholder, don't
2531 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
2534 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
2535 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
2537 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
2542 return (TREE_OPERAND (exp, 1) != 0
2543 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
2549 switch (tree_code_length[(int) code])
2552 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2554 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
2555 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
2566 /* Return 1 if EXP contains any expressions that produce cleanups for an
2567 outer scope to deal with. Used by fold. */
2575 if (! TREE_SIDE_EFFECTS (exp))
2578 switch (TREE_CODE (exp))
2581 case GOTO_SUBROUTINE_EXPR:
2582 case WITH_CLEANUP_EXPR:
2585 case CLEANUP_POINT_EXPR:
2589 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
2591 cmp = has_cleanups (TREE_VALUE (exp));
2601 /* This general rule works for most tree codes. All exceptions should be
2602 handled above. If this is a language-specific tree code, we can't
2603 trust what might be in the operand, so say we don't know
2605 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
2608 nops = first_rtl_op (TREE_CODE (exp));
2609 for (i = 0; i < nops; i++)
2610 if (TREE_OPERAND (exp, i) != 0)
2612 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
2613 if (type == 'e' || type == '<' || type == '1' || type == '2'
2614 || type == 'r' || type == 's')
2616 cmp = has_cleanups (TREE_OPERAND (exp, i));
2625 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2626 return a tree with all occurrences of references to F in a
2627 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2628 contains only arithmetic expressions or a CALL_EXPR with a
2629 PLACEHOLDER_EXPR occurring only in its arglist. */
2632 substitute_in_expr (exp, f, r)
2637 enum tree_code code = TREE_CODE (exp);
2642 switch (TREE_CODE_CLASS (code))
2649 if (code == PLACEHOLDER_EXPR)
2651 else if (code == TREE_LIST)
2653 op0 = (TREE_CHAIN (exp) == 0
2654 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
2655 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
2656 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2659 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2668 switch (tree_code_length[(int) code])
2671 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2672 if (op0 == TREE_OPERAND (exp, 0))
2675 new = fold (build1 (code, TREE_TYPE (exp), op0));
2679 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2680 could, but we don't support it. */
2681 if (code == RTL_EXPR)
2683 else if (code == CONSTRUCTOR)
2686 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2687 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2688 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2691 new = fold (build (code, TREE_TYPE (exp), op0, op1));
2695 /* It cannot be that anything inside a SAVE_EXPR contains a
2696 PLACEHOLDER_EXPR. */
2697 if (code == SAVE_EXPR)
2700 else if (code == CALL_EXPR)
2702 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2703 if (op1 == TREE_OPERAND (exp, 1))
2706 return build (code, TREE_TYPE (exp),
2707 TREE_OPERAND (exp, 0), op1, NULL_TREE);
2710 else if (code != COND_EXPR)
2713 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2714 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2715 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2716 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2717 && op2 == TREE_OPERAND (exp, 2))
2720 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2733 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2734 and it is the right field, replace it with R. */
2735 for (inner = TREE_OPERAND (exp, 0);
2736 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2737 inner = TREE_OPERAND (inner, 0))
2739 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2740 && TREE_OPERAND (exp, 1) == f)
2743 /* If this expression hasn't been completed let, leave it
2745 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2746 && TREE_TYPE (inner) == 0)
2749 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2750 if (op0 == TREE_OPERAND (exp, 0))
2753 new = fold (build (code, TREE_TYPE (exp), op0,
2754 TREE_OPERAND (exp, 1)));
2758 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2759 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2760 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2761 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2762 && op2 == TREE_OPERAND (exp, 2))
2765 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2770 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2771 if (op0 == TREE_OPERAND (exp, 0))
2774 new = fold (build1 (code, TREE_TYPE (exp), op0));
2786 TREE_READONLY (new) = TREE_READONLY (exp);
2790 /* Stabilize a reference so that we can use it any number of times
2791 without causing its operands to be evaluated more than once.
2792 Returns the stabilized reference. This works by means of save_expr,
2793 so see the caveats in the comments about save_expr.
2795 Also allows conversion expressions whose operands are references.
2796 Any other kind of expression is returned unchanged. */
2799 stabilize_reference (ref)
2802 register tree result;
2803 register enum tree_code code = TREE_CODE (ref);
2810 /* No action is needed in this case. */
2816 case FIX_TRUNC_EXPR:
2817 case FIX_FLOOR_EXPR:
2818 case FIX_ROUND_EXPR:
2820 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2824 result = build_nt (INDIRECT_REF,
2825 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2829 result = build_nt (COMPONENT_REF,
2830 stabilize_reference (TREE_OPERAND (ref, 0)),
2831 TREE_OPERAND (ref, 1));
2835 result = build_nt (BIT_FIELD_REF,
2836 stabilize_reference (TREE_OPERAND (ref, 0)),
2837 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2838 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2842 result = build_nt (ARRAY_REF,
2843 stabilize_reference (TREE_OPERAND (ref, 0)),
2844 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2848 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2849 it wouldn't be ignored. This matters when dealing with
2851 return stabilize_reference_1 (ref);
2854 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2855 save_expr (build1 (ADDR_EXPR,
2856 build_pointer_type (TREE_TYPE (ref)),
2861 /* If arg isn't a kind of lvalue we recognize, make no change.
2862 Caller should recognize the error for an invalid lvalue. */
2867 return error_mark_node;
2870 TREE_TYPE (result) = TREE_TYPE (ref);
2871 TREE_READONLY (result) = TREE_READONLY (ref);
2872 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2873 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2874 TREE_RAISES (result) = TREE_RAISES (ref);
2879 /* Subroutine of stabilize_reference; this is called for subtrees of
2880 references. Any expression with side-effects must be put in a SAVE_EXPR
2881 to ensure that it is only evaluated once.
2883 We don't put SAVE_EXPR nodes around everything, because assigning very
2884 simple expressions to temporaries causes us to miss good opportunities
2885 for optimizations. Among other things, the opportunity to fold in the
2886 addition of a constant into an addressing mode often gets lost, e.g.
2887 "y[i+1] += x;". In general, we take the approach that we should not make
2888 an assignment unless we are forced into it - i.e., that any non-side effect
2889 operator should be allowed, and that cse should take care of coalescing
2890 multiple utterances of the same expression should that prove fruitful. */
2893 stabilize_reference_1 (e)
2896 register tree result;
2897 register enum tree_code code = TREE_CODE (e);
2899 /* We cannot ignore const expressions because it might be a reference
2900 to a const array but whose index contains side-effects. But we can
2901 ignore things that are actual constant or that already have been
2902 handled by this function. */
2904 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2907 switch (TREE_CODE_CLASS (code))
2917 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2918 so that it will only be evaluated once. */
2919 /* The reference (r) and comparison (<) classes could be handled as
2920 below, but it is generally faster to only evaluate them once. */
2921 if (TREE_SIDE_EFFECTS (e))
2922 return save_expr (e);
2926 /* Constants need no processing. In fact, we should never reach
2931 /* Division is slow and tends to be compiled with jumps,
2932 especially the division by powers of 2 that is often
2933 found inside of an array reference. So do it just once. */
2934 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2935 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2936 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2937 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2938 return save_expr (e);
2939 /* Recursively stabilize each operand. */
2940 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2941 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2945 /* Recursively stabilize each operand. */
2946 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2953 TREE_TYPE (result) = TREE_TYPE (e);
2954 TREE_READONLY (result) = TREE_READONLY (e);
2955 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2956 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2957 TREE_RAISES (result) = TREE_RAISES (e);
2962 /* Low-level constructors for expressions. */
2964 /* Build an expression of code CODE, data type TYPE,
2965 and operands as specified by the arguments ARG1 and following arguments.
2966 Expressions and reference nodes can be created this way.
2967 Constants, decls, types and misc nodes cannot be. */
2970 build VPROTO((enum tree_code code, tree tt, ...))
2972 #ifndef ANSI_PROTOTYPES
2973 enum tree_code code;
2978 register int length;
2983 #ifndef ANSI_PROTOTYPES
2984 code = va_arg (p, enum tree_code);
2985 tt = va_arg (p, tree);
2988 t = make_node (code);
2989 length = tree_code_length[(int) code];
2994 /* This is equivalent to the loop below, but faster. */
2995 register tree arg0 = va_arg (p, tree);
2996 register tree arg1 = va_arg (p, tree);
2997 TREE_OPERAND (t, 0) = arg0;
2998 TREE_OPERAND (t, 1) = arg1;
2999 if ((arg0 && TREE_SIDE_EFFECTS (arg0))
3000 || (arg1 && TREE_SIDE_EFFECTS (arg1)))
3001 TREE_SIDE_EFFECTS (t) = 1;
3003 = (arg0 && TREE_RAISES (arg0)) || (arg1 && TREE_RAISES (arg1));
3005 else if (length == 1)
3007 register tree arg0 = va_arg (p, tree);
3009 /* Call build1 for this! */
3010 if (TREE_CODE_CLASS (code) != 's')
3012 TREE_OPERAND (t, 0) = arg0;
3013 if (arg0 && TREE_SIDE_EFFECTS (arg0))
3014 TREE_SIDE_EFFECTS (t) = 1;
3015 TREE_RAISES (t) = (arg0 && TREE_RAISES (arg0));
3019 for (i = 0; i < length; i++)
3021 register tree operand = va_arg (p, tree);
3022 TREE_OPERAND (t, i) = operand;
3025 if (TREE_SIDE_EFFECTS (operand))
3026 TREE_SIDE_EFFECTS (t) = 1;
3027 if (TREE_RAISES (operand))
3028 TREE_RAISES (t) = 1;
3036 /* Same as above, but only builds for unary operators.
3037 Saves lions share of calls to `build'; cuts down use
3038 of varargs, which is expensive for RISC machines. */
3041 build1 (code, type, node)
3042 enum tree_code code;
3046 register struct obstack *obstack = expression_obstack;
3047 register int length;
3048 #ifdef GATHER_STATISTICS
3049 register tree_node_kind kind;
3053 #ifdef GATHER_STATISTICS
3054 if (TREE_CODE_CLASS (code) == 'r')
3060 length = sizeof (struct tree_exp);
3063 t = ggc_alloc_tree (length);
3065 t = (tree) obstack_alloc (obstack, length);
3066 bzero ((PTR) t, length);
3068 #ifdef GATHER_STATISTICS
3069 tree_node_counts[(int)kind]++;
3070 tree_node_sizes[(int)kind] += length;
3073 TREE_TYPE (t) = type;
3074 TREE_SET_CODE (t, code);
3076 if (obstack == &permanent_obstack)
3077 TREE_PERMANENT (t) = 1;
3079 TREE_OPERAND (t, 0) = node;
3082 if (TREE_SIDE_EFFECTS (node))
3083 TREE_SIDE_EFFECTS (t) = 1;
3084 if (TREE_RAISES (node))
3085 TREE_RAISES (t) = 1;
3091 /* Similar except don't specify the TREE_TYPE
3092 and leave the TREE_SIDE_EFFECTS as 0.
3093 It is permissible for arguments to be null,
3094 or even garbage if their values do not matter. */
3097 build_nt VPROTO((enum tree_code code, ...))
3099 #ifndef ANSI_PROTOTYPES
3100 enum tree_code code;
3104 register int length;
3109 #ifndef ANSI_PROTOTYPES
3110 code = va_arg (p, enum tree_code);
3113 t = make_node (code);
3114 length = tree_code_length[(int) code];
3116 for (i = 0; i < length; i++)
3117 TREE_OPERAND (t, i) = va_arg (p, tree);
3123 /* Similar to `build_nt', except we build
3124 on the temp_decl_obstack, regardless. */
3127 build_parse_node VPROTO((enum tree_code code, ...))
3129 #ifndef ANSI_PROTOTYPES
3130 enum tree_code code;
3132 register struct obstack *ambient_obstack = expression_obstack;
3135 register int length;
3140 #ifndef ANSI_PROTOTYPES
3141 code = va_arg (p, enum tree_code);
3144 expression_obstack = &temp_decl_obstack;
3146 t = make_node (code);
3147 length = tree_code_length[(int) code];
3149 for (i = 0; i < length; i++)
3150 TREE_OPERAND (t, i) = va_arg (p, tree);
3153 expression_obstack = ambient_obstack;
3158 /* Commented out because this wants to be done very
3159 differently. See cp-lex.c. */
3161 build_op_identifier (op1, op2)
3164 register tree t = make_node (OP_IDENTIFIER);
3165 TREE_PURPOSE (t) = op1;
3166 TREE_VALUE (t) = op2;
3171 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3172 We do NOT enter this node in any sort of symbol table.
3174 layout_decl is used to set up the decl's storage layout.
3175 Other slots are initialized to 0 or null pointers. */
3178 build_decl (code, name, type)
3179 enum tree_code code;
3184 t = make_node (code);
3186 /* if (type == error_mark_node)
3187 type = integer_type_node; */
3188 /* That is not done, deliberately, so that having error_mark_node
3189 as the type can suppress useless errors in the use of this variable. */
3191 DECL_NAME (t) = name;
3192 DECL_ASSEMBLER_NAME (t) = name;
3193 TREE_TYPE (t) = type;
3195 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3197 else if (code == FUNCTION_DECL)
3198 DECL_MODE (t) = FUNCTION_MODE;
3203 /* BLOCK nodes are used to represent the structure of binding contours
3204 and declarations, once those contours have been exited and their contents
3205 compiled. This information is used for outputting debugging info. */
3208 build_block (vars, tags, subblocks, supercontext, chain)
3209 tree vars, tags, subblocks, supercontext, chain;
3211 register tree block = make_node (BLOCK);
3212 BLOCK_VARS (block) = vars;
3213 BLOCK_TYPE_TAGS (block) = tags;
3214 BLOCK_SUBBLOCKS (block) = subblocks;
3215 BLOCK_SUPERCONTEXT (block) = supercontext;
3216 BLOCK_CHAIN (block) = chain;
3220 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3221 location where an expression or an identifier were encountered. It
3222 is necessary for languages where the frontend parser will handle
3223 recursively more than one file (Java is one of them). */
3226 build_expr_wfl (node, file, line, col)
3231 static const char *last_file = 0;
3232 static tree last_filenode = NULL_TREE;
3233 register tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
3235 EXPR_WFL_NODE (wfl) = node;
3236 EXPR_WFL_SET_LINECOL (wfl, line, col);
3237 if (file != last_file)
3240 last_filenode = file ? get_identifier (file) : NULL_TREE;
3242 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
3245 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
3246 TREE_TYPE (wfl) = TREE_TYPE (node);
3251 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3255 build_decl_attribute_variant (ddecl, attribute)
3256 tree ddecl, attribute;
3258 DECL_MACHINE_ATTRIBUTES (ddecl) = attribute;
3262 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3265 Record such modified types already made so we don't make duplicates. */
3268 build_type_attribute_variant (ttype, attribute)
3269 tree ttype, attribute;
3271 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3273 register int hashcode;
3274 register struct obstack *ambient_obstack = current_obstack;
3277 if (ambient_obstack != &permanent_obstack)
3278 current_obstack = TYPE_OBSTACK (ttype);
3280 ntype = copy_node (ttype);
3282 TYPE_POINTER_TO (ntype) = 0;
3283 TYPE_REFERENCE_TO (ntype) = 0;
3284 TYPE_ATTRIBUTES (ntype) = attribute;
3286 /* Create a new main variant of TYPE. */
3287 TYPE_MAIN_VARIANT (ntype) = ntype;
3288 TYPE_NEXT_VARIANT (ntype) = 0;
3289 set_type_quals (ntype, TYPE_UNQUALIFIED);
3291 hashcode = TYPE_HASH (TREE_CODE (ntype))
3292 + TYPE_HASH (TREE_TYPE (ntype))
3293 + attribute_hash_list (attribute);
3295 switch (TREE_CODE (ntype))
3298 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
3301 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
3304 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
3307 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
3313 ntype = type_hash_canon (hashcode, ntype);
3314 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
3316 /* We must restore the current obstack after the type_hash_canon call,
3317 because type_hash_canon calls type_hash_add for permanent types, and
3318 then type_hash_add calls oballoc expecting to get something permanent
3320 current_obstack = ambient_obstack;
3326 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3327 or type TYPE and 0 otherwise. Validity is determined the configuration
3328 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3331 valid_machine_attribute (attr_name, attr_args, decl, type)
3333 tree attr_args ATTRIBUTE_UNUSED;
3334 tree decl ATTRIBUTE_UNUSED;
3335 tree type ATTRIBUTE_UNUSED;
3338 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3339 tree decl_attr_list = decl != 0 ? DECL_MACHINE_ATTRIBUTES (decl) : 0;
3341 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3342 tree type_attr_list = TYPE_ATTRIBUTES (type);
3345 if (TREE_CODE (attr_name) != IDENTIFIER_NODE)
3348 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3350 && VALID_MACHINE_DECL_ATTRIBUTE (decl, decl_attr_list, attr_name, attr_args))
3352 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3355 if (attr != NULL_TREE)
3357 /* Override existing arguments. Declarations are unique so we can
3358 modify this in place. */
3359 TREE_VALUE (attr) = attr_args;
3363 decl_attr_list = tree_cons (attr_name, attr_args, decl_attr_list);
3364 decl = build_decl_attribute_variant (decl, decl_attr_list);
3371 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3373 /* Don't apply the attribute to both the decl and the type. */;
3374 else if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name,
3377 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3380 if (attr != NULL_TREE)
3382 /* Override existing arguments.
3383 ??? This currently works since attribute arguments are not
3384 included in `attribute_hash_list'. Something more complicated
3385 may be needed in the future. */
3386 TREE_VALUE (attr) = attr_args;
3390 /* If this is part of a declaration, create a type variant,
3391 otherwise, this is part of a type definition, so add it
3392 to the base type. */
3393 type_attr_list = tree_cons (attr_name, attr_args, type_attr_list);
3395 type = build_type_attribute_variant (type, type_attr_list);
3397 TYPE_ATTRIBUTES (type) = type_attr_list;
3400 TREE_TYPE (decl) = type;
3404 /* Handle putting a type attribute on pointer-to-function-type by putting
3405 the attribute on the function type. */
3406 else if (POINTER_TYPE_P (type)
3407 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3408 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type), type_attr_list,
3409 attr_name, attr_args))
3411 tree inner_type = TREE_TYPE (type);
3412 tree inner_attr_list = TYPE_ATTRIBUTES (inner_type);
3413 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3416 if (attr != NULL_TREE)
3417 TREE_VALUE (attr) = attr_args;
3420 inner_attr_list = tree_cons (attr_name, attr_args, inner_attr_list);
3421 inner_type = build_type_attribute_variant (inner_type,
3426 TREE_TYPE (decl) = build_pointer_type (inner_type);
3429 /* Clear TYPE_POINTER_TO for the old inner type, since
3430 `type' won't be pointing to it anymore. */
3431 TYPE_POINTER_TO (TREE_TYPE (type)) = NULL_TREE;
3432 TREE_TYPE (type) = inner_type;
3442 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3445 We try both `text' and `__text__', ATTR may be either one. */
3446 /* ??? It might be a reasonable simplification to require ATTR to be only
3447 `text'. One might then also require attribute lists to be stored in
3448 their canonicalized form. */
3451 is_attribute_p (attr, ident)
3455 int ident_len, attr_len;
3458 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3461 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
3464 p = IDENTIFIER_POINTER (ident);
3465 ident_len = strlen (p);
3466 attr_len = strlen (attr);
3468 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3472 || attr[attr_len - 2] != '_'
3473 || attr[attr_len - 1] != '_')
3475 if (ident_len == attr_len - 4
3476 && strncmp (attr + 2, p, attr_len - 4) == 0)
3481 if (ident_len == attr_len + 4
3482 && p[0] == '_' && p[1] == '_'
3483 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3484 && strncmp (attr, p + 2, attr_len) == 0)
3491 /* Given an attribute name and a list of attributes, return a pointer to the
3492 attribute's list element if the attribute is part of the list, or NULL_TREE
3496 lookup_attribute (attr_name, list)
3497 const char *attr_name;
3502 for (l = list; l; l = TREE_CHAIN (l))
3504 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
3506 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
3513 /* Return an attribute list that is the union of a1 and a2. */
3516 merge_attributes (a1, a2)
3517 register tree a1, a2;
3521 /* Either one unset? Take the set one. */
3523 if (! (attributes = a1))
3526 /* One that completely contains the other? Take it. */
3528 else if (a2 && ! attribute_list_contained (a1, a2))
3530 if (attribute_list_contained (a2, a1))
3534 /* Pick the longest list, and hang on the other list. */
3535 /* ??? For the moment we punt on the issue of attrs with args. */
3537 if (list_length (a1) < list_length (a2))
3538 attributes = a2, a2 = a1;
3540 for (; a2; a2 = TREE_CHAIN (a2))
3541 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3542 attributes) == NULL_TREE)
3544 a1 = copy_node (a2);
3545 TREE_CHAIN (a1) = attributes;
3553 /* Given types T1 and T2, merge their attributes and return
3557 merge_machine_type_attributes (t1, t2)
3560 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3561 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1, t2);
3563 return merge_attributes (TYPE_ATTRIBUTES (t1),
3564 TYPE_ATTRIBUTES (t2));
3568 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3572 merge_machine_decl_attributes (olddecl, newdecl)
3573 tree olddecl, newdecl;
3575 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3576 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl, newdecl);
3578 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl),
3579 DECL_MACHINE_ATTRIBUTES (newdecl));
3583 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3584 of the various TYPE_QUAL values. */
3587 set_type_quals (type, type_quals)
3591 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3592 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3593 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3596 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
3597 the same kind of data as TYPE describes. Variants point to the
3598 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
3599 and it points to a chain of other variants so that duplicate
3600 variants are never made. Only main variants should ever appear as
3601 types of expressions. */
3604 build_qualified_type (type, type_quals)
3610 /* Search the chain of variants to see if there is already one there just
3611 like the one we need to have. If so, use that existing one. We must
3612 preserve the TYPE_NAME, since there is code that depends on this. */
3614 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3615 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
3618 /* We need a new one. */
3619 t = build_type_copy (type);
3620 set_type_quals (t, type_quals);
3624 /* Create a new variant of TYPE, equivalent but distinct.
3625 This is so the caller can modify it. */
3628 build_type_copy (type)
3631 register tree t, m = TYPE_MAIN_VARIANT (type);
3632 register struct obstack *ambient_obstack = current_obstack;
3634 current_obstack = TYPE_OBSTACK (type);
3635 t = copy_node (type);
3636 current_obstack = ambient_obstack;
3638 TYPE_POINTER_TO (t) = 0;
3639 TYPE_REFERENCE_TO (t) = 0;
3641 /* Add this type to the chain of variants of TYPE. */
3642 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3643 TYPE_NEXT_VARIANT (m) = t;
3648 /* Hashing of types so that we don't make duplicates.
3649 The entry point is `type_hash_canon'. */
3651 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3652 with types in the TREE_VALUE slots), by adding the hash codes
3653 of the individual types. */
3656 type_hash_list (list)
3659 register int hashcode;
3661 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3662 hashcode += TYPE_HASH (TREE_VALUE (tail));
3666 /* Look in the type hash table for a type isomorphic to TYPE.
3667 If one is found, return it. Otherwise return 0. */
3670 type_hash_lookup (hashcode, type)
3674 register struct type_hash *h;
3675 for (h = type_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next)
3676 if (h->hashcode == hashcode
3677 && TREE_CODE (h->type) == TREE_CODE (type)
3678 && TREE_TYPE (h->type) == TREE_TYPE (type)
3679 && attribute_list_equal (TYPE_ATTRIBUTES (h->type),
3680 TYPE_ATTRIBUTES (type))
3681 && (TYPE_MAX_VALUE (h->type) == TYPE_MAX_VALUE (type)
3682 || tree_int_cst_equal (TYPE_MAX_VALUE (h->type),
3683 TYPE_MAX_VALUE (type)))
3684 && (TYPE_MIN_VALUE (h->type) == TYPE_MIN_VALUE (type)
3685 || tree_int_cst_equal (TYPE_MIN_VALUE (h->type),
3686 TYPE_MIN_VALUE (type)))
3687 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3688 && (TYPE_DOMAIN (h->type) == TYPE_DOMAIN (type)
3689 || (TYPE_DOMAIN (h->type)
3690 && TREE_CODE (TYPE_DOMAIN (h->type)) == TREE_LIST
3691 && TYPE_DOMAIN (type)
3692 && TREE_CODE (TYPE_DOMAIN (type)) == TREE_LIST
3693 && type_list_equal (TYPE_DOMAIN (h->type),
3694 TYPE_DOMAIN (type)))))
3699 /* Add an entry to the type-hash-table
3700 for a type TYPE whose hash code is HASHCODE. */
3703 type_hash_add (hashcode, type)
3707 register struct type_hash *h;
3709 h = (struct type_hash *) permalloc (sizeof (struct type_hash));
3710 h->hashcode = hashcode;
3712 h->next = type_hash_table[hashcode % TYPE_HASH_SIZE];
3713 type_hash_table[hashcode % TYPE_HASH_SIZE] = h;
3716 /* Given TYPE, and HASHCODE its hash code, return the canonical
3717 object for an identical type if one already exists.
3718 Otherwise, return TYPE, and record it as the canonical object
3719 if it is a permanent object.
3721 To use this function, first create a type of the sort you want.
3722 Then compute its hash code from the fields of the type that
3723 make it different from other similar types.
3724 Then call this function and use the value.
3725 This function frees the type you pass in if it is a duplicate. */
3727 /* Set to 1 to debug without canonicalization. Never set by program. */
3728 int debug_no_type_hash = 0;
3731 type_hash_canon (hashcode, type)
3737 if (debug_no_type_hash)
3740 t1 = type_hash_lookup (hashcode, type);
3744 obstack_free (TYPE_OBSTACK (type), type);
3745 #ifdef GATHER_STATISTICS
3746 tree_node_counts[(int)t_kind]--;
3747 tree_node_sizes[(int)t_kind] -= sizeof (struct tree_type);
3752 /* If this is a permanent type, record it for later reuse. */
3753 if (TREE_PERMANENT (type))
3754 type_hash_add (hashcode, type);
3759 /* Mark ARG (which is really a struct type_hash **) for GC. */
3762 mark_type_hash (arg)
3765 struct type_hash *t = *(struct type_hash **) arg;
3769 ggc_mark_tree (t->type);
3774 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3775 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3776 by adding the hash codes of the individual attributes. */
3779 attribute_hash_list (list)
3782 register int hashcode;
3784 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3785 /* ??? Do we want to add in TREE_VALUE too? */
3786 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3790 /* Given two lists of attributes, return true if list l2 is
3791 equivalent to l1. */
3794 attribute_list_equal (l1, l2)
3797 return attribute_list_contained (l1, l2)
3798 && attribute_list_contained (l2, l1);
3801 /* Given two lists of attributes, return true if list L2 is
3802 completely contained within L1. */
3803 /* ??? This would be faster if attribute names were stored in a canonicalized
3804 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3805 must be used to show these elements are equivalent (which they are). */
3806 /* ??? It's not clear that attributes with arguments will always be handled
3810 attribute_list_contained (l1, l2)
3813 register tree t1, t2;
3815 /* First check the obvious, maybe the lists are identical. */
3819 /* Maybe the lists are similar. */
3820 for (t1 = l1, t2 = l2;
3822 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3823 && TREE_VALUE (t1) == TREE_VALUE (t2);
3824 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3826 /* Maybe the lists are equal. */
3827 if (t1 == 0 && t2 == 0)
3830 for (; t2; t2 = TREE_CHAIN (t2))
3833 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3835 if (attr == NULL_TREE)
3837 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3844 /* Given two lists of types
3845 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3846 return 1 if the lists contain the same types in the same order.
3847 Also, the TREE_PURPOSEs must match. */
3850 type_list_equal (l1, l2)
3853 register tree t1, t2;
3855 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3856 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3857 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3858 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3859 && (TREE_TYPE (TREE_PURPOSE (t1))
3860 == TREE_TYPE (TREE_PURPOSE (t2))))))
3866 /* Nonzero if integer constants T1 and T2
3867 represent the same constant value. */
3870 tree_int_cst_equal (t1, t2)
3875 if (t1 == 0 || t2 == 0)
3877 if (TREE_CODE (t1) == INTEGER_CST
3878 && TREE_CODE (t2) == INTEGER_CST
3879 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3880 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3885 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3886 The precise way of comparison depends on their data type. */
3889 tree_int_cst_lt (t1, t2)
3895 if (!TREE_UNSIGNED (TREE_TYPE (t1)))
3896 return INT_CST_LT (t1, t2);
3897 return INT_CST_LT_UNSIGNED (t1, t2);
3900 /* Return an indication of the sign of the integer constant T.
3901 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3902 Note that -1 will never be returned it T's type is unsigned. */
3905 tree_int_cst_sgn (t)
3908 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3910 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3912 else if (TREE_INT_CST_HIGH (t) < 0)
3918 /* Compare two constructor-element-type constants. Return 1 if the lists
3919 are known to be equal; otherwise return 0. */
3922 simple_cst_list_equal (l1, l2)
3925 while (l1 != NULL_TREE && l2 != NULL_TREE)
3927 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3930 l1 = TREE_CHAIN (l1);
3931 l2 = TREE_CHAIN (l2);
3937 /* Return truthvalue of whether T1 is the same tree structure as T2.
3938 Return 1 if they are the same.
3939 Return 0 if they are understandably different.
3940 Return -1 if either contains tree structure not understood by
3944 simple_cst_equal (t1, t2)
3947 register enum tree_code code1, code2;
3952 if (t1 == 0 || t2 == 0)
3955 code1 = TREE_CODE (t1);
3956 code2 = TREE_CODE (t2);
3958 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3960 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3961 || code2 == NON_LVALUE_EXPR)
3962 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3964 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3966 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3967 || code2 == NON_LVALUE_EXPR)
3968 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3976 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3977 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
3980 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3983 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3984 && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3985 TREE_STRING_LENGTH (t1));
3988 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3994 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3997 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4000 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4003 /* Special case: if either target is an unallocated VAR_DECL,
4004 it means that it's going to be unified with whatever the
4005 TARGET_EXPR is really supposed to initialize, so treat it
4006 as being equivalent to anything. */
4007 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4008 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4009 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
4010 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4011 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4012 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
4015 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4018 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4020 case WITH_CLEANUP_EXPR:
4021 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4024 return simple_cst_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
4027 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4028 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4041 /* This general rule works for most tree codes. All exceptions should be
4042 handled above. If this is a language-specific tree code, we can't
4043 trust what might be in the operand, so say we don't know
4045 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4048 switch (TREE_CODE_CLASS (code1))
4058 for (i=0; i<tree_code_length[(int) code1]; ++i)
4060 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4071 /* Constructors for pointer, array and function types.
4072 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4073 constructed by language-dependent code, not here.) */
4075 /* Construct, lay out and return the type of pointers to TO_TYPE.
4076 If such a type has already been constructed, reuse it. */
4079 build_pointer_type (to_type)
4082 register tree t = TYPE_POINTER_TO (to_type);
4084 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4089 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4090 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
4091 t = make_node (POINTER_TYPE);
4094 TREE_TYPE (t) = to_type;
4096 /* Record this type as the pointer to TO_TYPE. */
4097 TYPE_POINTER_TO (to_type) = t;
4099 /* Lay out the type. This function has many callers that are concerned
4100 with expression-construction, and this simplifies them all.
4101 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4107 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4108 MAXVAL should be the maximum value in the domain
4109 (one less than the length of the array).
4111 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4112 We don't enforce this limit, that is up to caller (e.g. language front end).
4113 The limit exists because the result is a signed type and we don't handle
4114 sizes that use more than one HOST_WIDE_INT. */
4117 build_index_type (maxval)
4120 register tree itype = make_node (INTEGER_TYPE);
4122 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4123 TYPE_MIN_VALUE (itype) = size_zero_node;
4125 push_obstacks (TYPE_OBSTACK (itype), TYPE_OBSTACK (itype));
4126 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4129 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4130 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4131 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4132 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4133 if (TREE_CODE (maxval) == INTEGER_CST)
4135 int maxint = (int) TREE_INT_CST_LOW (maxval);
4136 /* If the domain should be empty, make sure the maxval
4137 remains -1 and is not spoiled by truncation. */
4138 if (INT_CST_LT (maxval, integer_zero_node))
4140 TYPE_MAX_VALUE (itype) = build_int_2 (-1, -1);
4141 TREE_TYPE (TYPE_MAX_VALUE (itype)) = sizetype;
4143 return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype);
4149 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4150 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4151 low bound LOWVAL and high bound HIGHVAL.
4152 if TYPE==NULL_TREE, sizetype is used. */
4155 build_range_type (type, lowval, highval)
4156 tree type, lowval, highval;
4158 register tree itype = make_node (INTEGER_TYPE);
4160 TREE_TYPE (itype) = type;
4161 if (type == NULL_TREE)
4164 push_obstacks (TYPE_OBSTACK (itype), TYPE_OBSTACK (itype));
4165 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4166 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4169 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4170 TYPE_MODE (itype) = TYPE_MODE (type);
4171 TYPE_SIZE (itype) = TYPE_SIZE (type);
4172 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4173 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4174 if (TREE_CODE (lowval) == INTEGER_CST)
4176 HOST_WIDE_INT lowint, highint;
4179 lowint = TREE_INT_CST_LOW (lowval);
4180 if (highval && TREE_CODE (highval) == INTEGER_CST)
4181 highint = TREE_INT_CST_LOW (highval);
4183 highint = (~(unsigned HOST_WIDE_INT)0) >> 1;
4185 maxint = (int) (highint - lowint);
4186 return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype);
4192 /* Just like build_index_type, but takes lowval and highval instead
4193 of just highval (maxval). */
4196 build_index_2_type (lowval,highval)
4197 tree lowval, highval;
4199 return build_range_type (NULL_TREE, lowval, highval);
4202 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4203 Needed because when index types are not hashed, equal index types
4204 built at different times appear distinct, even though structurally,
4208 index_type_equal (itype1, itype2)
4209 tree itype1, itype2;
4211 if (TREE_CODE (itype1) != TREE_CODE (itype2))
4213 if (TREE_CODE (itype1) == INTEGER_TYPE)
4215 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
4216 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
4217 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
4218 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
4220 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
4221 TYPE_MIN_VALUE (itype2))
4222 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
4223 TYPE_MAX_VALUE (itype2)))
4230 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4231 and number of elements specified by the range of values of INDEX_TYPE.
4232 If such a type has already been constructed, reuse it. */
4235 build_array_type (elt_type, index_type)
4236 tree elt_type, index_type;
4241 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4243 error ("arrays of functions are not meaningful");
4244 elt_type = integer_type_node;
4247 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4248 build_pointer_type (elt_type);
4250 /* Allocate the array after the pointer type,
4251 in case we free it in type_hash_canon. */
4252 t = make_node (ARRAY_TYPE);
4253 TREE_TYPE (t) = elt_type;
4254 TYPE_DOMAIN (t) = index_type;
4256 if (index_type == 0)
4261 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
4262 t = type_hash_canon (hashcode, t);
4264 if (TYPE_SIZE (t) == 0)
4269 /* Return the TYPE of the elements comprising
4270 the innermost dimension of ARRAY. */
4273 get_inner_array_type (array)
4276 tree type = TREE_TYPE (array);
4278 while (TREE_CODE (type) == ARRAY_TYPE)
4279 type = TREE_TYPE (type);
4284 /* Construct, lay out and return
4285 the type of functions returning type VALUE_TYPE
4286 given arguments of types ARG_TYPES.
4287 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4288 are data type nodes for the arguments of the function.
4289 If such a type has already been constructed, reuse it. */
4292 build_function_type (value_type, arg_types)
4293 tree value_type, arg_types;
4298 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4300 error ("function return type cannot be function");
4301 value_type = integer_type_node;
4304 /* Make a node of the sort we want. */
4305 t = make_node (FUNCTION_TYPE);
4306 TREE_TYPE (t) = value_type;
4307 TYPE_ARG_TYPES (t) = arg_types;
4309 /* If we already have such a type, use the old one and free this one. */
4310 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
4311 t = type_hash_canon (hashcode, t);
4313 if (TYPE_SIZE (t) == 0)
4318 /* Build the node for the type of references-to-TO_TYPE. */
4321 build_reference_type (to_type)
4324 register tree t = TYPE_REFERENCE_TO (to_type);
4326 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4331 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4332 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
4333 t = make_node (REFERENCE_TYPE);
4336 TREE_TYPE (t) = to_type;
4338 /* Record this type as the pointer to TO_TYPE. */
4339 TYPE_REFERENCE_TO (to_type) = t;
4346 /* Construct, lay out and return the type of methods belonging to class
4347 BASETYPE and whose arguments and values are described by TYPE.
4348 If that type exists already, reuse it.
4349 TYPE must be a FUNCTION_TYPE node. */
4352 build_method_type (basetype, type)
4353 tree basetype, type;
4358 /* Make a node of the sort we want. */
4359 t = make_node (METHOD_TYPE);
4361 if (TREE_CODE (type) != FUNCTION_TYPE)
4364 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4365 TREE_TYPE (t) = TREE_TYPE (type);
4367 /* The actual arglist for this function includes a "hidden" argument
4368 which is "this". Put it into the list of argument types. */
4371 = tree_cons (NULL_TREE,
4372 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
4374 /* If we already have such a type, use the old one and free this one. */
4375 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4376 t = type_hash_canon (hashcode, t);
4378 if (TYPE_SIZE (t) == 0)
4384 /* Construct, lay out and return the type of offsets to a value
4385 of type TYPE, within an object of type BASETYPE.
4386 If a suitable offset type exists already, reuse it. */
4389 build_offset_type (basetype, type)
4390 tree basetype, type;
4395 /* Make a node of the sort we want. */
4396 t = make_node (OFFSET_TYPE);
4398 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4399 TREE_TYPE (t) = type;
4401 /* If we already have such a type, use the old one and free this one. */
4402 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4403 t = type_hash_canon (hashcode, t);
4405 if (TYPE_SIZE (t) == 0)
4411 /* Create a complex type whose components are COMPONENT_TYPE. */
4414 build_complex_type (component_type)
4415 tree component_type;
4420 /* Make a node of the sort we want. */
4421 t = make_node (COMPLEX_TYPE);
4423 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4424 set_type_quals (t, TYPE_QUALS (component_type));
4426 /* If we already have such a type, use the old one and free this one. */
4427 hashcode = TYPE_HASH (component_type);
4428 t = type_hash_canon (hashcode, t);
4430 if (TYPE_SIZE (t) == 0)
4436 /* Return OP, stripped of any conversions to wider types as much as is safe.
4437 Converting the value back to OP's type makes a value equivalent to OP.
4439 If FOR_TYPE is nonzero, we return a value which, if converted to
4440 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4442 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4443 narrowest type that can hold the value, even if they don't exactly fit.
4444 Otherwise, bit-field references are changed to a narrower type
4445 only if they can be fetched directly from memory in that type.
4447 OP must have integer, real or enumeral type. Pointers are not allowed!
4449 There are some cases where the obvious value we could return
4450 would regenerate to OP if converted to OP's type,
4451 but would not extend like OP to wider types.
4452 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4453 For example, if OP is (unsigned short)(signed char)-1,
4454 we avoid returning (signed char)-1 if FOR_TYPE is int,
4455 even though extending that to an unsigned short would regenerate OP,
4456 since the result of extending (signed char)-1 to (int)
4457 is different from (int) OP. */
4460 get_unwidened (op, for_type)
4464 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4465 register tree type = TREE_TYPE (op);
4466 register unsigned final_prec
4467 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4469 = (for_type != 0 && for_type != type
4470 && final_prec > TYPE_PRECISION (type)
4471 && TREE_UNSIGNED (type));
4472 register tree win = op;
4474 while (TREE_CODE (op) == NOP_EXPR)
4476 register int bitschange
4477 = TYPE_PRECISION (TREE_TYPE (op))
4478 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4480 /* Truncations are many-one so cannot be removed.
4481 Unless we are later going to truncate down even farther. */
4483 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4486 /* See what's inside this conversion. If we decide to strip it,
4488 op = TREE_OPERAND (op, 0);
4490 /* If we have not stripped any zero-extensions (uns is 0),
4491 we can strip any kind of extension.
4492 If we have previously stripped a zero-extension,
4493 only zero-extensions can safely be stripped.
4494 Any extension can be stripped if the bits it would produce
4495 are all going to be discarded later by truncating to FOR_TYPE. */
4499 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4501 /* TREE_UNSIGNED says whether this is a zero-extension.
4502 Let's avoid computing it if it does not affect WIN
4503 and if UNS will not be needed again. */
4504 if ((uns || TREE_CODE (op) == NOP_EXPR)
4505 && TREE_UNSIGNED (TREE_TYPE (op)))
4513 if (TREE_CODE (op) == COMPONENT_REF
4514 /* Since type_for_size always gives an integer type. */
4515 && TREE_CODE (type) != REAL_TYPE
4516 /* Don't crash if field not laid out yet. */
4517 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4519 unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
4520 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
4522 /* We can get this structure field in the narrowest type it fits in.
4523 If FOR_TYPE is 0, do this only for a field that matches the
4524 narrower type exactly and is aligned for it
4525 The resulting extension to its nominal type (a fullword type)
4526 must fit the same conditions as for other extensions. */
4528 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4529 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4530 && (! uns || final_prec <= innerprec
4531 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4534 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4535 TREE_OPERAND (op, 1));
4536 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4537 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4538 TREE_RAISES (win) = TREE_RAISES (op);
4544 /* Return OP or a simpler expression for a narrower value
4545 which can be sign-extended or zero-extended to give back OP.
4546 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4547 or 0 if the value should be sign-extended. */
4550 get_narrower (op, unsignedp_ptr)
4554 register int uns = 0;
4556 register tree win = op;
4558 while (TREE_CODE (op) == NOP_EXPR)
4560 register int bitschange
4561 = TYPE_PRECISION (TREE_TYPE (op))
4562 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4564 /* Truncations are many-one so cannot be removed. */
4568 /* See what's inside this conversion. If we decide to strip it,
4570 op = TREE_OPERAND (op, 0);
4574 /* An extension: the outermost one can be stripped,
4575 but remember whether it is zero or sign extension. */
4577 uns = TREE_UNSIGNED (TREE_TYPE (op));
4578 /* Otherwise, if a sign extension has been stripped,
4579 only sign extensions can now be stripped;
4580 if a zero extension has been stripped, only zero-extensions. */
4581 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4585 else /* bitschange == 0 */
4587 /* A change in nominal type can always be stripped, but we must
4588 preserve the unsignedness. */
4590 uns = TREE_UNSIGNED (TREE_TYPE (op));
4597 if (TREE_CODE (op) == COMPONENT_REF
4598 /* Since type_for_size always gives an integer type. */
4599 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE)
4601 unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
4602 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
4604 /* We can get this structure field in a narrower type that fits it,
4605 but the resulting extension to its nominal type (a fullword type)
4606 must satisfy the same conditions as for other extensions.
4608 Do this only for fields that are aligned (not bit-fields),
4609 because when bit-field insns will be used there is no
4610 advantage in doing this. */
4612 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4613 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4614 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4618 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4619 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4620 TREE_OPERAND (op, 1));
4621 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4622 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4623 TREE_RAISES (win) = TREE_RAISES (op);
4626 *unsignedp_ptr = uns;
4630 /* Nonzero if integer constant C has a value that is permissible
4631 for type TYPE (an INTEGER_TYPE). */
4634 int_fits_type_p (c, type)
4637 if (TREE_UNSIGNED (type))
4638 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4639 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c))
4640 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
4641 && INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type)))
4642 /* Negative ints never fit unsigned types. */
4643 && ! (TREE_INT_CST_HIGH (c) < 0
4644 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4646 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4647 && INT_CST_LT (TYPE_MAX_VALUE (type), c))
4648 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
4649 && INT_CST_LT (c, TYPE_MIN_VALUE (type)))
4650 /* Unsigned ints with top bit set never fit signed types. */
4651 && ! (TREE_INT_CST_HIGH (c) < 0
4652 && TREE_UNSIGNED (TREE_TYPE (c))));
4655 /* Return the innermost context enclosing DECL that is
4656 a FUNCTION_DECL, or zero if none. */
4659 decl_function_context (decl)
4664 if (TREE_CODE (decl) == ERROR_MARK)
4667 if (TREE_CODE (decl) == SAVE_EXPR)
4668 context = SAVE_EXPR_CONTEXT (decl);
4670 context = DECL_CONTEXT (decl);
4672 while (context && TREE_CODE (context) != FUNCTION_DECL)
4674 if (TREE_CODE_CLASS (TREE_CODE (context)) == 't')
4675 context = TYPE_CONTEXT (context);
4676 else if (TREE_CODE_CLASS (TREE_CODE (context)) == 'd')
4677 context = DECL_CONTEXT (context);
4678 else if (TREE_CODE (context) == BLOCK)
4679 context = BLOCK_SUPERCONTEXT (context);
4681 /* Unhandled CONTEXT !? */
4688 /* Return the innermost context enclosing DECL that is
4689 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4690 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4693 decl_type_context (decl)
4696 tree context = DECL_CONTEXT (decl);
4700 if (TREE_CODE (context) == RECORD_TYPE
4701 || TREE_CODE (context) == UNION_TYPE
4702 || TREE_CODE (context) == QUAL_UNION_TYPE)
4704 if (TREE_CODE (context) == TYPE_DECL
4705 || TREE_CODE (context) == FUNCTION_DECL)
4706 context = DECL_CONTEXT (context);
4707 else if (TREE_CODE (context) == BLOCK)
4708 context = BLOCK_SUPERCONTEXT (context);
4710 /* Unhandled CONTEXT!? */
4716 /* Print debugging information about the obstack O, named STR. */
4719 print_obstack_statistics (str, o)
4723 struct _obstack_chunk *chunk = o->chunk;
4727 n_alloc += o->next_free - chunk->contents;
4728 chunk = chunk->prev;
4732 n_alloc += chunk->limit - &chunk->contents[0];
4733 chunk = chunk->prev;
4735 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
4736 str, n_alloc, n_chunks);
4739 /* Print debugging information about tree nodes generated during the compile,
4740 and any language-specific information. */
4743 dump_tree_statistics ()
4745 #ifdef GATHER_STATISTICS
4747 int total_nodes, total_bytes;
4750 fprintf (stderr, "\n??? tree nodes created\n\n");
4751 #ifdef GATHER_STATISTICS
4752 fprintf (stderr, "Kind Nodes Bytes\n");
4753 fprintf (stderr, "-------------------------------------\n");
4754 total_nodes = total_bytes = 0;
4755 for (i = 0; i < (int) all_kinds; i++)
4757 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4758 tree_node_counts[i], tree_node_sizes[i]);
4759 total_nodes += tree_node_counts[i];
4760 total_bytes += tree_node_sizes[i];
4762 fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size);
4763 fprintf (stderr, "-------------------------------------\n");
4764 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4765 fprintf (stderr, "-------------------------------------\n");
4767 fprintf (stderr, "(No per-node statistics)\n");
4769 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
4770 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack);
4771 print_obstack_statistics ("temporary_obstack", &temporary_obstack);
4772 print_obstack_statistics ("momentary_obstack", &momentary_obstack);
4773 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack);
4774 print_lang_statistics ();
4777 #define FILE_FUNCTION_PREFIX_LEN 9
4779 #ifndef NO_DOLLAR_IN_LABEL
4780 #define FILE_FUNCTION_FORMAT "_GLOBAL_$%s$%s"
4781 #else /* NO_DOLLAR_IN_LABEL */
4782 #ifndef NO_DOT_IN_LABEL
4783 #define FILE_FUNCTION_FORMAT "_GLOBAL_.%s.%s"
4784 #else /* NO_DOT_IN_LABEL */
4785 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4786 #endif /* NO_DOT_IN_LABEL */
4787 #endif /* NO_DOLLAR_IN_LABEL */
4789 extern char * first_global_object_name;
4790 extern char * weak_global_object_name;
4792 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4793 clashes in cases where we can't reliably choose a unique name.
4795 Derived from mkstemp.c in libiberty. */
4798 append_random_chars (template)
4801 static const char letters[]
4802 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4803 static unsigned HOST_WIDE_INT value;
4804 unsigned HOST_WIDE_INT v;
4806 #ifdef HAVE_GETTIMEOFDAY
4810 template += strlen (template);
4812 #ifdef HAVE_GETTIMEOFDAY
4813 /* Get some more or less random data. */
4814 gettimeofday (&tv, NULL);
4815 value += ((unsigned HOST_WIDE_INT) tv.tv_usec << 16) ^ tv.tv_sec ^ getpid ();
4822 /* Fill in the random bits. */
4823 template[0] = letters[v % 62];
4825 template[1] = letters[v % 62];
4827 template[2] = letters[v % 62];
4829 template[3] = letters[v % 62];
4831 template[4] = letters[v % 62];
4833 template[5] = letters[v % 62];
4838 /* Generate a name for a function unique to this translation unit.
4839 TYPE is some string to identify the purpose of this function to the
4840 linker or collect2. */
4843 get_file_function_name_long (type)
4849 if (first_global_object_name)
4850 p = first_global_object_name;
4853 /* We don't have anything that we know to be unique to this translation
4854 unit, so use what we do have and throw in some randomness. */
4856 const char *name = weak_global_object_name;
4857 const char *file = main_input_filename;
4862 file = input_filename;
4864 p = (char *) alloca (7 + strlen (name) + strlen (file));
4866 sprintf (p, "%s%s", name, file);
4867 append_random_chars (p);
4870 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4873 /* Set up the name of the file-level functions we may need. */
4874 /* Use a global object (which is already required to be unique over
4875 the program) rather than the file name (which imposes extra
4876 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
4877 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4879 /* Don't need to pull weird characters out of global names. */
4880 if (p != first_global_object_name)
4882 for (p = buf+11; *p; p++)
4884 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
4885 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
4889 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4892 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4900 return get_identifier (buf);
4903 /* If KIND=='I', return a suitable global initializer (constructor) name.
4904 If KIND=='D', return a suitable global clean-up (destructor) name. */
4907 get_file_function_name (kind)
4914 return get_file_function_name_long (p);
4918 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4919 The result is placed in BUFFER (which has length BIT_SIZE),
4920 with one bit in each char ('\000' or '\001').
4922 If the constructor is constant, NULL_TREE is returned.
4923 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4926 get_set_constructor_bits (init, buffer, bit_size)
4933 HOST_WIDE_INT domain_min
4934 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))));
4935 tree non_const_bits = NULL_TREE;
4936 for (i = 0; i < bit_size; i++)
4939 for (vals = TREE_OPERAND (init, 1);
4940 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4942 if (TREE_CODE (TREE_VALUE (vals)) != INTEGER_CST
4943 || (TREE_PURPOSE (vals) != NULL_TREE
4944 && TREE_CODE (TREE_PURPOSE (vals)) != INTEGER_CST))
4946 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4947 else if (TREE_PURPOSE (vals) != NULL_TREE)
4949 /* Set a range of bits to ones. */
4950 HOST_WIDE_INT lo_index
4951 = TREE_INT_CST_LOW (TREE_PURPOSE (vals)) - domain_min;
4952 HOST_WIDE_INT hi_index
4953 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
4954 if (lo_index < 0 || lo_index >= bit_size
4955 || hi_index < 0 || hi_index >= bit_size)
4957 for ( ; lo_index <= hi_index; lo_index++)
4958 buffer[lo_index] = 1;
4962 /* Set a single bit to one. */
4964 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
4965 if (index < 0 || index >= bit_size)
4967 error ("invalid initializer for bit string");
4973 return non_const_bits;
4976 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4977 The result is placed in BUFFER (which is an array of bytes).
4978 If the constructor is constant, NULL_TREE is returned.
4979 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4982 get_set_constructor_bytes (init, buffer, wd_size)
4984 unsigned char *buffer;
4988 int set_word_size = BITS_PER_UNIT;
4989 int bit_size = wd_size * set_word_size;
4991 unsigned char *bytep = buffer;
4992 char *bit_buffer = (char *) alloca(bit_size);
4993 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4995 for (i = 0; i < wd_size; i++)
4998 for (i = 0; i < bit_size; i++)
5002 if (BYTES_BIG_ENDIAN)
5003 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5005 *bytep |= 1 << bit_pos;
5008 if (bit_pos >= set_word_size)
5009 bit_pos = 0, bytep++;
5011 return non_const_bits;
5014 #if defined ENABLE_CHECKING && (__GNUC__ > 2 || __GNUC_MINOR__ > 6)
5015 /* Complain that the tree code of NODE does not match the expected CODE.
5016 FILE, LINE, and FUNCTION are of the caller. */
5018 tree_check_failed (node, code, file, line, function)
5020 enum tree_code code;
5023 const char *function;
5025 error ("Tree check: expected %s, have %s",
5026 tree_code_name[code], tree_code_name[TREE_CODE (node)]);
5027 fancy_abort (file, line, function);
5030 /* Similar to above, except that we check for a class of tree
5031 code, given in CL. */
5033 tree_class_check_failed (node, cl, file, line, function)
5038 const char *function;
5040 error ("Tree check: expected class '%c', have '%c' (%s)",
5041 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5042 tree_code_name[TREE_CODE (node)]);
5043 fancy_abort (file, line, function);
5046 #endif /* ENABLE_CHECKING */
5048 /* Return the alias set for T, which may be either a type or an
5055 if (!flag_strict_aliasing || !lang_get_alias_set)
5056 /* If we're not doing any lanaguage-specific alias analysis, just
5057 assume everything aliases everything else. */
5060 return (*lang_get_alias_set) (t);
5063 /* Return a brand-new alias set. */
5068 static int last_alias_set;
5069 if (flag_strict_aliasing)
5070 return ++last_alias_set;
5075 #ifndef CHAR_TYPE_SIZE
5076 #define CHAR_TYPE_SIZE BITS_PER_UNIT
5079 #ifndef SHORT_TYPE_SIZE
5080 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
5083 #ifndef INT_TYPE_SIZE
5084 #define INT_TYPE_SIZE BITS_PER_WORD
5087 #ifndef LONG_TYPE_SIZE
5088 #define LONG_TYPE_SIZE BITS_PER_WORD
5091 #ifndef LONG_LONG_TYPE_SIZE
5092 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
5095 #ifndef FLOAT_TYPE_SIZE
5096 #define FLOAT_TYPE_SIZE BITS_PER_WORD
5099 #ifndef DOUBLE_TYPE_SIZE
5100 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5103 #ifndef LONG_DOUBLE_TYPE_SIZE
5104 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5107 /* Create nodes for all integer types (and error_mark_node) using the sizes
5108 of C datatypes. The caller should call set_sizetype soon after calling
5109 this function to select one of the types as sizetype. */
5112 build_common_tree_nodes (signed_char)
5115 error_mark_node = make_node (ERROR_MARK);
5116 TREE_TYPE (error_mark_node) = error_mark_node;
5118 /* Define both `signed char' and `unsigned char'. */
5119 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5120 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5122 /* Define `char', which is like either `signed char' or `unsigned char'
5123 but not the same as either. */
5126 ? make_signed_type (CHAR_TYPE_SIZE)
5127 : make_unsigned_type (CHAR_TYPE_SIZE));
5129 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5130 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5131 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5132 /* Define an unsigned integer first. make_unsigned_type and make_signed_type
5133 both call set_sizetype for the first type that we create, and we want this
5134 to be large enough to hold the sizes of various types until we switch to
5135 the real sizetype. */
5136 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5137 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5138 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5139 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5140 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5142 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
5143 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
5144 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
5145 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
5146 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
5148 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
5149 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
5150 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
5151 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
5152 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
5155 /* For type TYPE, fill in the proper type for TYPE_SIZE and
5161 TREE_TYPE (TYPE_SIZE (type)) = sizetype;
5162 TREE_TYPE (TYPE_SIZE_UNIT (type)) = bitsizetype;
5165 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5166 It will fix the previously made nodes to have proper references to
5167 sizetype, and it will create several other common tree nodes. */
5169 build_common_tree_nodes_2 (short_double)
5172 fix_sizetype (signed_char_type_node);
5173 fix_sizetype (unsigned_char_type_node);
5174 fix_sizetype (char_type_node);
5175 fix_sizetype (short_integer_type_node);
5176 fix_sizetype (short_unsigned_type_node);
5177 fix_sizetype (integer_type_node);
5178 fix_sizetype (unsigned_type_node);
5179 fix_sizetype (long_unsigned_type_node);
5180 fix_sizetype (long_integer_type_node);
5181 fix_sizetype (long_long_integer_type_node);
5182 fix_sizetype (long_long_unsigned_type_node);
5184 fix_sizetype (intQI_type_node);
5185 fix_sizetype (intHI_type_node);
5186 fix_sizetype (intSI_type_node);
5187 fix_sizetype (intDI_type_node);
5188 fix_sizetype (intTI_type_node);
5189 fix_sizetype (unsigned_intQI_type_node);
5190 fix_sizetype (unsigned_intHI_type_node);
5191 fix_sizetype (unsigned_intSI_type_node);
5192 fix_sizetype (unsigned_intDI_type_node);
5193 fix_sizetype (unsigned_intTI_type_node);
5195 integer_zero_node = build_int_2 (0, 0);
5196 TREE_TYPE (integer_zero_node) = integer_type_node;
5197 integer_one_node = build_int_2 (1, 0);
5198 TREE_TYPE (integer_one_node) = integer_type_node;
5200 size_zero_node = build_int_2 (0, 0);
5201 TREE_TYPE (size_zero_node) = sizetype;
5202 size_one_node = build_int_2 (1, 0);
5203 TREE_TYPE (size_one_node) = sizetype;
5205 void_type_node = make_node (VOID_TYPE);
5206 layout_type (void_type_node); /* Uses size_zero_node */
5207 /* We are not going to have real types in C with less than byte alignment,
5208 so we might as well not have any types that claim to have it. */
5209 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5211 null_pointer_node = build_int_2 (0, 0);
5212 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5213 layout_type (TREE_TYPE (null_pointer_node));
5215 ptr_type_node = build_pointer_type (void_type_node);
5217 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5219 float_type_node = make_node (REAL_TYPE);
5220 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5221 layout_type (float_type_node);
5223 double_type_node = make_node (REAL_TYPE);
5225 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5227 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5228 layout_type (double_type_node);
5230 long_double_type_node = make_node (REAL_TYPE);
5231 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5232 layout_type (long_double_type_node);
5234 complex_integer_type_node = make_node (COMPLEX_TYPE);
5235 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5236 layout_type (complex_integer_type_node);
5238 complex_float_type_node = make_node (COMPLEX_TYPE);
5239 TREE_TYPE (complex_float_type_node) = float_type_node;
5240 layout_type (complex_float_type_node);
5242 complex_double_type_node = make_node (COMPLEX_TYPE);
5243 TREE_TYPE (complex_double_type_node) = double_type_node;
5244 layout_type (complex_double_type_node);
5246 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5247 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5248 layout_type (complex_long_double_type_node);
5250 #ifdef BUILD_VA_LIST_TYPE
5251 BUILD_VA_LIST_TYPE(va_list_type_node);
5253 va_list_type_node = ptr_type_node;