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. */
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
48 /* obstack.[ch] explicitly declined to prototype this. */
49 extern int _obstack_allocated_p PROTO ((struct obstack *h, PTR obj));
51 /* Tree nodes of permanent duration are allocated in this obstack.
52 They are the identifier nodes, and everything outside of
53 the bodies and parameters of function definitions. */
55 struct obstack permanent_obstack;
57 /* The initial RTL, and all ..._TYPE nodes, in a function
58 are allocated in this obstack. Usually they are freed at the
59 end of the function, but if the function is inline they are saved.
60 For top-level functions, this is maybepermanent_obstack.
61 Separate obstacks are made for nested functions. */
63 struct obstack *function_maybepermanent_obstack;
65 /* This is the function_maybepermanent_obstack for top-level functions. */
67 struct obstack maybepermanent_obstack;
69 /* The contents of the current function definition are allocated
70 in this obstack, and all are freed at the end of the function.
71 For top-level functions, this is temporary_obstack.
72 Separate obstacks are made for nested functions. */
74 struct obstack *function_obstack;
76 /* This is used for reading initializers of global variables. */
78 struct obstack temporary_obstack;
80 /* The tree nodes of an expression are allocated
81 in this obstack, and all are freed at the end of the expression. */
83 struct obstack momentary_obstack;
85 /* The tree nodes of a declarator are allocated
86 in this obstack, and all are freed when the declarator
89 static struct obstack temp_decl_obstack;
91 /* This points at either permanent_obstack
92 or the current function_maybepermanent_obstack. */
94 struct obstack *saveable_obstack;
96 /* This is same as saveable_obstack during parse and expansion phase;
97 it points to the current function's obstack during optimization.
98 This is the obstack to be used for creating rtl objects. */
100 struct obstack *rtl_obstack;
102 /* This points at either permanent_obstack or the current function_obstack. */
104 struct obstack *current_obstack;
106 /* This points at either permanent_obstack or the current function_obstack
107 or momentary_obstack. */
109 struct obstack *expression_obstack;
111 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
115 struct obstack_stack *next;
116 struct obstack *current;
117 struct obstack *saveable;
118 struct obstack *expression;
122 struct obstack_stack *obstack_stack;
124 /* Obstack for allocating struct obstack_stack entries. */
126 static struct obstack obstack_stack_obstack;
128 /* Addresses of first objects in some obstacks.
129 This is for freeing their entire contents. */
130 char *maybepermanent_firstobj;
131 char *temporary_firstobj;
132 char *momentary_firstobj;
133 char *temp_decl_firstobj;
135 /* This is used to preserve objects (mainly array initializers) that need to
136 live until the end of the current function, but no further. */
137 char *momentary_function_firstobj;
139 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
141 int all_types_permanent;
143 /* Stack of places to restore the momentary obstack back to. */
145 struct momentary_level
147 /* Pointer back to previous such level. */
148 struct momentary_level *prev;
149 /* First object allocated within this level. */
151 /* Value of expression_obstack saved at entry to this level. */
152 struct obstack *obstack;
155 struct momentary_level *momentary_stack;
157 /* Table indexed by tree code giving a string containing a character
158 classifying the tree code. Possibilities are
159 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
161 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
163 char tree_code_type[MAX_TREE_CODES] = {
168 /* Table indexed by tree code giving number of expression
169 operands beyond the fixed part of the node structure.
170 Not used for types or decls. */
172 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
174 int tree_code_length[MAX_TREE_CODES] = {
179 /* Names of tree components.
180 Used for printing out the tree and error messages. */
181 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
183 const char *tree_code_name[MAX_TREE_CODES] = {
188 /* Statistics-gathering stuff. */
209 int tree_node_counts[(int)all_kinds];
210 int tree_node_sizes[(int)all_kinds];
211 int id_string_size = 0;
213 static const char * const tree_node_kind_names[] = {
231 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
233 #define MAX_HASH_TABLE 1009
234 static tree hash_table[MAX_HASH_TABLE]; /* id hash buckets */
236 /* 0 while creating built-in identifiers. */
237 static int do_identifier_warnings;
239 /* Unique id for next decl created. */
240 static int next_decl_uid;
241 /* Unique id for next type created. */
242 static int next_type_uid = 1;
244 /* The language-specific function for alias analysis. If NULL, the
245 language does not do any special alias analysis. */
246 int (*lang_get_alias_set) PROTO((tree));
248 /* Here is how primitive or already-canonicalized types' hash
250 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
252 /* Each hash table slot is a bucket containing a chain
253 of these structures. */
257 struct type_hash *next; /* Next structure in the bucket. */
258 int hashcode; /* Hash code of this type. */
259 tree type; /* The type recorded here. */
262 /* Now here is the hash table. When recording a type, it is added
263 to the slot whose index is the hash code mod the table size.
264 Note that the hash table is used for several kinds of types
265 (function types, array types and array index range types, for now).
266 While all these live in the same table, they are completely independent,
267 and the hash code is computed differently for each of these. */
269 #define TYPE_HASH_SIZE 59
270 struct type_hash *type_hash_table[TYPE_HASH_SIZE];
272 static void set_type_quals PROTO((tree, int));
273 static void append_random_chars PROTO((char *));
274 static void build_real_from_int_cst_1 PROTO((PTR));
275 static void mark_type_hash PROTO ((void *));
276 static void fix_sizetype PROTO ((tree));
278 /* If non-null, a language specific helper for unsave_expr_now. */
280 void (*lang_unsave_expr_now) PROTO((tree));
282 /* The string used as a placeholder instead of a source file name for
283 built-in tree nodes. The variable, which is dynamically allocated,
284 should be used; the macro is only used to initialize it. */
286 static char *built_in_filename;
287 #define BUILT_IN_FILENAME ("<built-in>")
289 tree global_trees[TI_MAX];
291 /* Init the principal obstacks. */
296 gcc_obstack_init (&obstack_stack_obstack);
297 gcc_obstack_init (&permanent_obstack);
299 gcc_obstack_init (&temporary_obstack);
300 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
301 gcc_obstack_init (&momentary_obstack);
302 momentary_firstobj = (char *) obstack_alloc (&momentary_obstack, 0);
303 momentary_function_firstobj = momentary_firstobj;
304 gcc_obstack_init (&maybepermanent_obstack);
305 maybepermanent_firstobj
306 = (char *) obstack_alloc (&maybepermanent_obstack, 0);
307 gcc_obstack_init (&temp_decl_obstack);
308 temp_decl_firstobj = (char *) obstack_alloc (&temp_decl_obstack, 0);
310 function_obstack = &temporary_obstack;
311 function_maybepermanent_obstack = &maybepermanent_obstack;
312 current_obstack = &permanent_obstack;
313 expression_obstack = &permanent_obstack;
314 rtl_obstack = saveable_obstack = &permanent_obstack;
316 /* Init the hash table of identifiers. */
317 bzero ((char *) hash_table, sizeof hash_table);
319 ggc_add_tree_root (hash_table, MAX_HASH_TABLE);
320 ggc_add_root (type_hash_table, TYPE_HASH_SIZE,
321 sizeof(struct type_hash *),
323 ggc_add_tree_root (global_trees, TI_MAX);
327 gcc_obstack_init (obstack)
328 struct obstack *obstack;
330 /* Let particular systems override the size of a chunk. */
331 #ifndef OBSTACK_CHUNK_SIZE
332 #define OBSTACK_CHUNK_SIZE 0
334 /* Let them override the alloc and free routines too. */
335 #ifndef OBSTACK_CHUNK_ALLOC
336 #define OBSTACK_CHUNK_ALLOC xmalloc
338 #ifndef OBSTACK_CHUNK_FREE
339 #define OBSTACK_CHUNK_FREE free
341 _obstack_begin (obstack, OBSTACK_CHUNK_SIZE, 0,
342 (void *(*) PROTO ((long))) OBSTACK_CHUNK_ALLOC,
343 (void (*) PROTO ((void *))) OBSTACK_CHUNK_FREE);
346 /* Save all variables describing the current status into the structure
347 *P. This function is called whenever we start compiling one
348 function in the midst of compiling another. For example, when
349 compiling a nested function, or, in C++, a template instantiation
350 that is required by the function we are currently compiling.
352 CONTEXT is the decl_function_context for the function we're about to
353 compile; if it isn't current_function_decl, we have to play some games. */
359 p->all_types_permanent = all_types_permanent;
360 p->momentary_stack = momentary_stack;
361 p->maybepermanent_firstobj = maybepermanent_firstobj;
362 p->temporary_firstobj = temporary_firstobj;
363 p->momentary_firstobj = momentary_firstobj;
364 p->momentary_function_firstobj = momentary_function_firstobj;
365 p->function_obstack = function_obstack;
366 p->function_maybepermanent_obstack = function_maybepermanent_obstack;
367 p->current_obstack = current_obstack;
368 p->expression_obstack = expression_obstack;
369 p->saveable_obstack = saveable_obstack;
370 p->rtl_obstack = rtl_obstack;
372 function_maybepermanent_obstack
373 = (struct obstack *) xmalloc (sizeof (struct obstack));
374 gcc_obstack_init (function_maybepermanent_obstack);
375 maybepermanent_firstobj
376 = (char *) obstack_finish (function_maybepermanent_obstack);
378 function_obstack = (struct obstack *) xmalloc (sizeof (struct obstack));
379 gcc_obstack_init (function_obstack);
381 current_obstack = &permanent_obstack;
382 expression_obstack = &permanent_obstack;
383 rtl_obstack = saveable_obstack = &permanent_obstack;
385 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
386 momentary_firstobj = (char *) obstack_finish (&momentary_obstack);
387 momentary_function_firstobj = momentary_firstobj;
390 /* Restore all variables describing the current status from the structure *P.
391 This is used after a nested function. */
394 restore_tree_status (p)
397 all_types_permanent = p->all_types_permanent;
398 momentary_stack = p->momentary_stack;
400 obstack_free (&momentary_obstack, momentary_function_firstobj);
402 /* Free saveable storage used by the function just compiled and not
404 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
405 if (obstack_empty_p (function_maybepermanent_obstack))
407 obstack_free (function_maybepermanent_obstack, NULL);
408 free (function_maybepermanent_obstack);
411 obstack_free (&temporary_obstack, temporary_firstobj);
412 obstack_free (&momentary_obstack, momentary_function_firstobj);
414 obstack_free (function_obstack, NULL);
415 free (function_obstack);
417 temporary_firstobj = p->temporary_firstobj;
418 momentary_firstobj = p->momentary_firstobj;
419 momentary_function_firstobj = p->momentary_function_firstobj;
420 maybepermanent_firstobj = p->maybepermanent_firstobj;
421 function_obstack = p->function_obstack;
422 function_maybepermanent_obstack = p->function_maybepermanent_obstack;
423 current_obstack = p->current_obstack;
424 expression_obstack = p->expression_obstack;
425 saveable_obstack = p->saveable_obstack;
426 rtl_obstack = p->rtl_obstack;
429 /* Start allocating on the temporary (per function) obstack.
430 This is done in start_function before parsing the function body,
431 and before each initialization at top level, and to go back
432 to temporary allocation after doing permanent_allocation. */
435 temporary_allocation ()
437 /* Note that function_obstack at top level points to temporary_obstack.
438 But within a nested function context, it is a separate obstack. */
439 current_obstack = function_obstack;
440 expression_obstack = function_obstack;
441 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
445 /* Start allocating on the permanent obstack but don't
446 free the temporary data. After calling this, call
447 `permanent_allocation' to fully resume permanent allocation status. */
450 end_temporary_allocation ()
452 current_obstack = &permanent_obstack;
453 expression_obstack = &permanent_obstack;
454 rtl_obstack = saveable_obstack = &permanent_obstack;
457 /* Resume allocating on the temporary obstack, undoing
458 effects of `end_temporary_allocation'. */
461 resume_temporary_allocation ()
463 current_obstack = function_obstack;
464 expression_obstack = function_obstack;
465 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
468 /* While doing temporary allocation, switch to allocating in such a
469 way as to save all nodes if the function is inlined. Call
470 resume_temporary_allocation to go back to ordinary temporary
474 saveable_allocation ()
476 /* Note that function_obstack at top level points to temporary_obstack.
477 But within a nested function context, it is a separate obstack. */
478 expression_obstack = current_obstack = saveable_obstack;
481 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
482 recording the previously current obstacks on a stack.
483 This does not free any storage in any obstack. */
486 push_obstacks (current, saveable)
487 struct obstack *current, *saveable;
489 struct obstack_stack *p;
491 p = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
492 (sizeof (struct obstack_stack)));
494 p->current = current_obstack;
495 p->saveable = saveable_obstack;
496 p->expression = expression_obstack;
497 p->rtl = rtl_obstack;
498 p->next = obstack_stack;
501 current_obstack = current;
502 expression_obstack = current;
503 rtl_obstack = saveable_obstack = saveable;
506 /* Save the current set of obstacks, but don't change them. */
509 push_obstacks_nochange ()
511 struct obstack_stack *p;
513 p = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
514 (sizeof (struct obstack_stack)));
516 p->current = current_obstack;
517 p->saveable = saveable_obstack;
518 p->expression = expression_obstack;
519 p->rtl = rtl_obstack;
520 p->next = obstack_stack;
524 /* Pop the obstack selection stack. */
529 struct obstack_stack *p;
532 obstack_stack = p->next;
534 current_obstack = p->current;
535 saveable_obstack = p->saveable;
536 expression_obstack = p->expression;
537 rtl_obstack = p->rtl;
539 obstack_free (&obstack_stack_obstack, p);
542 /* Nonzero if temporary allocation is currently in effect.
543 Zero if currently doing permanent allocation. */
546 allocation_temporary_p ()
548 return current_obstack != &permanent_obstack;
551 /* Go back to allocating on the permanent obstack
552 and free everything in the temporary obstack.
554 FUNCTION_END is true only if we have just finished compiling a function.
555 In that case, we also free preserved initial values on the momentary
559 permanent_allocation (function_end)
562 /* Free up previous temporary obstack data */
563 obstack_free (&temporary_obstack, temporary_firstobj);
566 obstack_free (&momentary_obstack, momentary_function_firstobj);
567 momentary_firstobj = momentary_function_firstobj;
570 obstack_free (&momentary_obstack, momentary_firstobj);
571 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
572 obstack_free (&temp_decl_obstack, temp_decl_firstobj);
574 current_obstack = &permanent_obstack;
575 expression_obstack = &permanent_obstack;
576 rtl_obstack = saveable_obstack = &permanent_obstack;
579 /* Save permanently everything on the maybepermanent_obstack. */
584 maybepermanent_firstobj
585 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
589 preserve_initializer ()
591 struct momentary_level *tem;
595 = (char *) obstack_alloc (&temporary_obstack, 0);
596 maybepermanent_firstobj
597 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
599 old_momentary = momentary_firstobj;
601 = (char *) obstack_alloc (&momentary_obstack, 0);
602 if (momentary_firstobj != old_momentary)
603 for (tem = momentary_stack; tem; tem = tem->prev)
604 tem->base = momentary_firstobj;
607 /* Start allocating new rtl in current_obstack.
608 Use resume_temporary_allocation
609 to go back to allocating rtl in saveable_obstack. */
612 rtl_in_current_obstack ()
614 rtl_obstack = current_obstack;
617 /* Start allocating rtl from saveable_obstack. Intended to be used after
618 a call to push_obstacks_nochange. */
621 rtl_in_saveable_obstack ()
623 rtl_obstack = saveable_obstack;
626 /* Allocate SIZE bytes in the current obstack
627 and return a pointer to them.
628 In practice the current obstack is always the temporary one. */
634 return (char *) obstack_alloc (current_obstack, size);
637 /* Free the object PTR in the current obstack
638 as well as everything allocated since PTR.
639 In practice the current obstack is always the temporary one. */
645 obstack_free (current_obstack, ptr);
648 /* Allocate SIZE bytes in the permanent obstack
649 and return a pointer to them. */
655 return (char *) obstack_alloc (&permanent_obstack, size);
658 /* Allocate NELEM items of SIZE bytes in the permanent obstack
659 and return a pointer to them. The storage is cleared before
660 returning the value. */
663 perm_calloc (nelem, size)
667 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
668 bzero (rval, nelem * size);
672 /* Allocate SIZE bytes in the saveable obstack
673 and return a pointer to them. */
679 return (char *) obstack_alloc (saveable_obstack, size);
682 /* Allocate SIZE bytes in the expression obstack
683 and return a pointer to them. */
689 return (char *) obstack_alloc (expression_obstack, size);
692 /* Print out which obstack an object is in. */
695 print_obstack_name (object, file, prefix)
700 struct obstack *obstack = NULL;
701 const char *obstack_name = NULL;
704 for (p = outer_function_chain; p; p = p->next)
706 if (_obstack_allocated_p (p->function_obstack, object))
708 obstack = p->function_obstack;
709 obstack_name = "containing function obstack";
711 if (_obstack_allocated_p (p->function_maybepermanent_obstack, object))
713 obstack = p->function_maybepermanent_obstack;
714 obstack_name = "containing function maybepermanent obstack";
718 if (_obstack_allocated_p (&obstack_stack_obstack, object))
720 obstack = &obstack_stack_obstack;
721 obstack_name = "obstack_stack_obstack";
723 else if (_obstack_allocated_p (function_obstack, object))
725 obstack = function_obstack;
726 obstack_name = "function obstack";
728 else if (_obstack_allocated_p (&permanent_obstack, object))
730 obstack = &permanent_obstack;
731 obstack_name = "permanent_obstack";
733 else if (_obstack_allocated_p (&momentary_obstack, object))
735 obstack = &momentary_obstack;
736 obstack_name = "momentary_obstack";
738 else if (_obstack_allocated_p (function_maybepermanent_obstack, object))
740 obstack = function_maybepermanent_obstack;
741 obstack_name = "function maybepermanent obstack";
743 else if (_obstack_allocated_p (&temp_decl_obstack, object))
745 obstack = &temp_decl_obstack;
746 obstack_name = "temp_decl_obstack";
749 /* Check to see if the object is in the free area of the obstack. */
752 if (object >= obstack->next_free
753 && object < obstack->chunk_limit)
754 fprintf (file, "%s in free portion of obstack %s",
755 prefix, obstack_name);
757 fprintf (file, "%s allocated from %s", prefix, obstack_name);
760 fprintf (file, "%s not allocated from any obstack", prefix);
764 debug_obstack (object)
767 print_obstack_name (object, stderr, "object");
768 fprintf (stderr, ".\n");
771 /* Return 1 if OBJ is in the permanent obstack.
772 This is slow, and should be used only for debugging.
773 Use TREE_PERMANENT for other purposes. */
776 object_permanent_p (obj)
779 return _obstack_allocated_p (&permanent_obstack, obj);
782 /* Start a level of momentary allocation.
783 In C, each compound statement has its own level
784 and that level is freed at the end of each statement.
785 All expression nodes are allocated in the momentary allocation level. */
790 struct momentary_level *tem
791 = (struct momentary_level *) obstack_alloc (&momentary_obstack,
792 sizeof (struct momentary_level));
793 tem->prev = momentary_stack;
794 tem->base = (char *) obstack_base (&momentary_obstack);
795 tem->obstack = expression_obstack;
796 momentary_stack = tem;
797 expression_obstack = &momentary_obstack;
800 /* Set things up so the next clear_momentary will only clear memory
801 past our present position in momentary_obstack. */
804 preserve_momentary ()
806 momentary_stack->base = (char *) obstack_base (&momentary_obstack);
809 /* Free all the storage in the current momentary-allocation level.
810 In C, this happens at the end of each statement. */
815 obstack_free (&momentary_obstack, momentary_stack->base);
818 /* Discard a level of momentary allocation.
819 In C, this happens at the end of each compound statement.
820 Restore the status of expression node allocation
821 that was in effect before this level was created. */
826 struct momentary_level *tem = momentary_stack;
827 momentary_stack = tem->prev;
828 expression_obstack = tem->obstack;
829 /* We can't free TEM from the momentary_obstack, because there might
830 be objects above it which have been saved. We can free back to the
831 stack of the level we are popping off though. */
832 obstack_free (&momentary_obstack, tem->base);
835 /* Pop back to the previous level of momentary allocation,
836 but don't free any momentary data just yet. */
839 pop_momentary_nofree ()
841 struct momentary_level *tem = momentary_stack;
842 momentary_stack = tem->prev;
843 expression_obstack = tem->obstack;
846 /* Call when starting to parse a declaration:
847 make expressions in the declaration last the length of the function.
848 Returns an argument that should be passed to resume_momentary later. */
853 register int tem = expression_obstack == &momentary_obstack;
854 expression_obstack = saveable_obstack;
858 /* Call when finished parsing a declaration:
859 restore the treatment of node-allocation that was
860 in effect before the suspension.
861 YES should be the value previously returned by suspend_momentary. */
864 resume_momentary (yes)
868 expression_obstack = &momentary_obstack;
871 /* Init the tables indexed by tree code.
872 Note that languages can add to these tables to define their own codes. */
878 ggc_alloc_string (BUILT_IN_FILENAME, sizeof (BUILT_IN_FILENAME));
879 ggc_add_string_root (&built_in_filename, 1);
882 /* Return a newly allocated node of code CODE.
883 Initialize the node's unique id and its TREE_PERMANENT flag.
884 For decl and type nodes, some other fields are initialized.
885 The rest of the node is initialized to zero.
887 Achoo! I got a code in the node. */
894 register int type = TREE_CODE_CLASS (code);
895 register int length = 0;
896 register struct obstack *obstack = current_obstack;
897 #ifdef GATHER_STATISTICS
898 register tree_node_kind kind;
903 case 'd': /* A decl node */
904 #ifdef GATHER_STATISTICS
907 length = sizeof (struct tree_decl);
908 /* All decls in an inline function need to be saved. */
909 if (obstack != &permanent_obstack)
910 obstack = saveable_obstack;
912 /* PARM_DECLs go on the context of the parent. If this is a nested
913 function, then we must allocate the PARM_DECL on the parent's
914 obstack, so that they will live to the end of the parent's
915 closing brace. This is necessary in case we try to inline the
916 function into its parent.
918 PARM_DECLs of top-level functions do not have this problem. However,
919 we allocate them where we put the FUNCTION_DECL for languages such as
920 Ada that need to consult some flags in the PARM_DECLs of the function
923 See comment in restore_tree_status for why we can't put this
924 in function_obstack. */
925 if (code == PARM_DECL && obstack != &permanent_obstack)
928 if (current_function_decl)
929 context = decl_function_context (current_function_decl);
933 = find_function_data (context)->function_maybepermanent_obstack;
937 case 't': /* a type node */
938 #ifdef GATHER_STATISTICS
941 length = sizeof (struct tree_type);
942 /* All data types are put where we can preserve them if nec. */
943 if (obstack != &permanent_obstack)
944 obstack = all_types_permanent ? &permanent_obstack : saveable_obstack;
947 case 'b': /* a lexical block */
948 #ifdef GATHER_STATISTICS
951 length = sizeof (struct tree_block);
952 /* All BLOCK nodes are put where we can preserve them if nec. */
953 if (obstack != &permanent_obstack)
954 obstack = saveable_obstack;
957 case 's': /* an expression with side effects */
958 #ifdef GATHER_STATISTICS
962 case 'r': /* a reference */
963 #ifdef GATHER_STATISTICS
967 case 'e': /* an expression */
968 case '<': /* a comparison expression */
969 case '1': /* a unary arithmetic expression */
970 case '2': /* a binary arithmetic expression */
971 #ifdef GATHER_STATISTICS
975 obstack = expression_obstack;
976 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
977 if (code == BIND_EXPR && obstack != &permanent_obstack)
978 obstack = saveable_obstack;
979 length = sizeof (struct tree_exp)
980 + (tree_code_length[(int) code] - 1) * sizeof (char *);
983 case 'c': /* a constant */
984 #ifdef GATHER_STATISTICS
987 obstack = expression_obstack;
989 /* We can't use tree_code_length for INTEGER_CST, since the number of
990 words is machine-dependent due to varying length of HOST_WIDE_INT,
991 which might be wider than a pointer (e.g., long long). Similarly
992 for REAL_CST, since the number of words is machine-dependent due
993 to varying size and alignment of `double'. */
995 if (code == INTEGER_CST)
996 length = sizeof (struct tree_int_cst);
997 else if (code == REAL_CST)
998 length = sizeof (struct tree_real_cst);
1000 length = sizeof (struct tree_common)
1001 + tree_code_length[(int) code] * sizeof (char *);
1004 case 'x': /* something random, like an identifier. */
1005 #ifdef GATHER_STATISTICS
1006 if (code == IDENTIFIER_NODE)
1008 else if (code == OP_IDENTIFIER)
1010 else if (code == TREE_VEC)
1015 length = sizeof (struct tree_common)
1016 + tree_code_length[(int) code] * sizeof (char *);
1017 /* Identifier nodes are always permanent since they are
1018 unique in a compiler run. */
1019 if (code == IDENTIFIER_NODE) obstack = &permanent_obstack;
1027 t = ggc_alloc_tree (length);
1030 t = (tree) obstack_alloc (obstack, length);
1031 memset ((PTR) t, 0, length);
1034 #ifdef GATHER_STATISTICS
1035 tree_node_counts[(int)kind]++;
1036 tree_node_sizes[(int)kind] += length;
1039 TREE_SET_CODE (t, code);
1040 if (obstack == &permanent_obstack)
1041 TREE_PERMANENT (t) = 1;
1046 TREE_SIDE_EFFECTS (t) = 1;
1047 TREE_TYPE (t) = void_type_node;
1051 if (code != FUNCTION_DECL)
1053 DECL_IN_SYSTEM_HEADER (t)
1054 = in_system_header && (obstack == &permanent_obstack);
1055 DECL_SOURCE_LINE (t) = lineno;
1056 DECL_SOURCE_FILE (t) =
1057 (input_filename) ? input_filename : built_in_filename;
1058 DECL_UID (t) = next_decl_uid++;
1059 /* Note that we have not yet computed the alias set for this
1061 DECL_POINTER_ALIAS_SET (t) = -1;
1065 TYPE_UID (t) = next_type_uid++;
1067 TYPE_MAIN_VARIANT (t) = t;
1068 TYPE_OBSTACK (t) = obstack;
1069 TYPE_ATTRIBUTES (t) = NULL_TREE;
1070 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1071 SET_DEFAULT_TYPE_ATTRIBUTES (t);
1073 /* Note that we have not yet computed the alias set for this
1075 TYPE_ALIAS_SET (t) = -1;
1079 TREE_CONSTANT (t) = 1;
1089 case PREDECREMENT_EXPR:
1090 case PREINCREMENT_EXPR:
1091 case POSTDECREMENT_EXPR:
1092 case POSTINCREMENT_EXPR:
1093 /* All of these have side-effects, no matter what their
1095 TREE_SIDE_EFFECTS (t) = 1;
1107 /* A front-end can reset this to an appropriate function if types need
1108 special handling. */
1110 tree (*make_lang_type_fn) PROTO((enum tree_code)) = make_node;
1112 /* Return a new type (with the indicated CODE), doing whatever
1113 language-specific processing is required. */
1116 make_lang_type (code)
1117 enum tree_code code;
1119 return (*make_lang_type_fn) (code);
1122 /* Return a new node with the same contents as NODE except that its
1123 TREE_CHAIN is zero and it has a fresh uid. Unlike make_node, this
1124 function always performs the allocation on the CURRENT_OBSTACK;
1125 it's up to the caller to pick the right obstack before calling this
1133 register enum tree_code code = TREE_CODE (node);
1134 register int length = 0;
1136 switch (TREE_CODE_CLASS (code))
1138 case 'd': /* A decl node */
1139 length = sizeof (struct tree_decl);
1142 case 't': /* a type node */
1143 length = sizeof (struct tree_type);
1146 case 'b': /* a lexical block node */
1147 length = sizeof (struct tree_block);
1150 case 'r': /* a reference */
1151 case 'e': /* an expression */
1152 case 's': /* an expression with side effects */
1153 case '<': /* a comparison expression */
1154 case '1': /* a unary arithmetic expression */
1155 case '2': /* a binary arithmetic expression */
1156 length = sizeof (struct tree_exp)
1157 + (tree_code_length[(int) code] - 1) * sizeof (char *);
1160 case 'c': /* a constant */
1161 /* We can't use tree_code_length for INTEGER_CST, since the number of
1162 words is machine-dependent due to varying length of HOST_WIDE_INT,
1163 which might be wider than a pointer (e.g., long long). Similarly
1164 for REAL_CST, since the number of words is machine-dependent due
1165 to varying size and alignment of `double'. */
1166 if (code == INTEGER_CST)
1167 length = sizeof (struct tree_int_cst);
1168 else if (code == REAL_CST)
1169 length = sizeof (struct tree_real_cst);
1171 length = (sizeof (struct tree_common)
1172 + tree_code_length[(int) code] * sizeof (char *));
1175 case 'x': /* something random, like an identifier. */
1176 length = sizeof (struct tree_common)
1177 + tree_code_length[(int) code] * sizeof (char *);
1178 if (code == TREE_VEC)
1179 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
1183 t = ggc_alloc_tree (length);
1185 t = (tree) obstack_alloc (current_obstack, length);
1186 memcpy (t, node, length);
1188 /* EXPR_WITH_FILE_LOCATION must keep filename info stored in TREE_CHAIN */
1189 if (TREE_CODE (node) != EXPR_WITH_FILE_LOCATION)
1191 TREE_ASM_WRITTEN (t) = 0;
1193 if (TREE_CODE_CLASS (code) == 'd')
1194 DECL_UID (t) = next_decl_uid++;
1195 else if (TREE_CODE_CLASS (code) == 't')
1197 TYPE_UID (t) = next_type_uid++;
1198 TYPE_OBSTACK (t) = current_obstack;
1200 /* The following is so that the debug code for
1201 the copy is different from the original type.
1202 The two statements usually duplicate each other
1203 (because they clear fields of the same union),
1204 but the optimizer should catch that. */
1205 TYPE_SYMTAB_POINTER (t) = 0;
1206 TYPE_SYMTAB_ADDRESS (t) = 0;
1209 TREE_PERMANENT (t) = (current_obstack == &permanent_obstack);
1214 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1215 For example, this can copy a list made of TREE_LIST nodes. */
1222 register tree prev, next;
1227 head = prev = copy_node (list);
1228 next = TREE_CHAIN (list);
1231 TREE_CHAIN (prev) = copy_node (next);
1232 prev = TREE_CHAIN (prev);
1233 next = TREE_CHAIN (next);
1240 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1241 If an identifier with that name has previously been referred to,
1242 the same node is returned this time. */
1245 get_identifier (text)
1246 register const char *text;
1251 register int len, hash_len;
1253 /* Compute length of text in len. */
1254 len = strlen (text);
1256 /* Decide how much of that length to hash on */
1258 if (warn_id_clash && (unsigned)len > id_clash_len)
1259 hash_len = id_clash_len;
1261 /* Compute hash code */
1262 hi = hash_len * 613 + (unsigned) text[0];
1263 for (i = 1; i < hash_len; i += 2)
1264 hi = ((hi * 613) + (unsigned) (text[i]));
1266 hi &= (1 << HASHBITS) - 1;
1267 hi %= MAX_HASH_TABLE;
1269 /* Search table for identifier */
1270 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1271 if (IDENTIFIER_LENGTH (idp) == len
1272 && IDENTIFIER_POINTER (idp)[0] == text[0]
1273 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1274 return idp; /* <-- return if found */
1276 /* Not found; optionally warn about a similar identifier */
1277 if (warn_id_clash && do_identifier_warnings && (unsigned)len >= id_clash_len)
1278 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1279 if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len))
1281 warning ("`%s' and `%s' identical in first %d characters",
1282 IDENTIFIER_POINTER (idp), text, id_clash_len);
1286 if (tree_code_length[(int) IDENTIFIER_NODE] < 0)
1287 abort (); /* set_identifier_size hasn't been called. */
1289 /* Not found, create one, add to chain */
1290 idp = make_node (IDENTIFIER_NODE);
1291 IDENTIFIER_LENGTH (idp) = len;
1292 #ifdef GATHER_STATISTICS
1293 id_string_size += len;
1297 IDENTIFIER_POINTER (idp) = ggc_alloc_string (text, len);
1299 IDENTIFIER_POINTER (idp) = obstack_copy0 (&permanent_obstack, text, len);
1301 TREE_CHAIN (idp) = hash_table[hi];
1302 hash_table[hi] = idp;
1303 return idp; /* <-- return if created */
1306 /* If an identifier with the name TEXT (a null-terminated string) has
1307 previously been referred to, return that node; otherwise return
1311 maybe_get_identifier (text)
1312 register const char *text;
1317 register int len, hash_len;
1319 /* Compute length of text in len. */
1320 len = strlen (text);
1322 /* Decide how much of that length to hash on */
1324 if (warn_id_clash && (unsigned)len > id_clash_len)
1325 hash_len = id_clash_len;
1327 /* Compute hash code */
1328 hi = hash_len * 613 + (unsigned) text[0];
1329 for (i = 1; i < hash_len; i += 2)
1330 hi = ((hi * 613) + (unsigned) (text[i]));
1332 hi &= (1 << HASHBITS) - 1;
1333 hi %= MAX_HASH_TABLE;
1335 /* Search table for identifier */
1336 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1337 if (IDENTIFIER_LENGTH (idp) == len
1338 && IDENTIFIER_POINTER (idp)[0] == text[0]
1339 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1340 return idp; /* <-- return if found */
1345 /* Enable warnings on similar identifiers (if requested).
1346 Done after the built-in identifiers are created. */
1349 start_identifier_warnings ()
1351 do_identifier_warnings = 1;
1354 /* Record the size of an identifier node for the language in use.
1355 SIZE is the total size in bytes.
1356 This is called by the language-specific files. This must be
1357 called before allocating any identifiers. */
1360 set_identifier_size (size)
1363 tree_code_length[(int) IDENTIFIER_NODE]
1364 = (size - sizeof (struct tree_common)) / sizeof (tree);
1367 /* Return a newly constructed INTEGER_CST node whose constant value
1368 is specified by the two ints LOW and HI.
1369 The TREE_TYPE is set to `int'.
1371 This function should be used via the `build_int_2' macro. */
1374 build_int_2_wide (low, hi)
1375 HOST_WIDE_INT low, hi;
1377 register tree t = make_node (INTEGER_CST);
1378 TREE_INT_CST_LOW (t) = low;
1379 TREE_INT_CST_HIGH (t) = hi;
1380 TREE_TYPE (t) = integer_type_node;
1384 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1387 build_real (type, d)
1394 /* Check for valid float value for this type on this target machine;
1395 if not, can print error message and store a valid value in D. */
1396 #ifdef CHECK_FLOAT_VALUE
1397 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1400 v = make_node (REAL_CST);
1401 TREE_TYPE (v) = type;
1402 TREE_REAL_CST (v) = d;
1403 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1407 /* Return a new REAL_CST node whose type is TYPE
1408 and whose value is the integer value of the INTEGER_CST node I. */
1410 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1413 real_value_from_int_cst (type, i)
1418 #ifdef REAL_ARITHMETIC
1419 if (! TREE_UNSIGNED (TREE_TYPE (i)))
1420 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1423 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
1424 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
1425 #else /* not REAL_ARITHMETIC */
1426 /* Some 386 compilers mishandle unsigned int to float conversions,
1427 so introduce a temporary variable E to avoid those bugs. */
1428 if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i)))
1432 d = (double) (~ TREE_INT_CST_HIGH (i));
1433 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1434 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1436 e = (double) (unsigned HOST_WIDE_INT) (~ TREE_INT_CST_LOW (i));
1444 d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i);
1445 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1446 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1448 e = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (i);
1451 #endif /* not REAL_ARITHMETIC */
1464 build_real_from_int_cst_1 (data)
1467 struct brfic_args * args = (struct brfic_args *) data;
1469 #ifdef REAL_ARITHMETIC
1470 args->d = real_value_from_int_cst (args->type, args->i);
1473 REAL_VALUE_TRUNCATE (TYPE_MODE (args->type),
1474 real_value_from_int_cst (args->type, args->i));
1478 /* This function can't be implemented if we can't do arithmetic
1479 on the float representation. */
1482 build_real_from_int_cst (type, i)
1487 int overflow = TREE_OVERFLOW (i);
1489 struct brfic_args args;
1491 v = make_node (REAL_CST);
1492 TREE_TYPE (v) = type;
1494 /* Setup input for build_real_from_int_cst_1() */
1498 if (do_float_handler (build_real_from_int_cst_1, (PTR) &args))
1500 /* Receive output from build_real_from_int_cst_1() */
1505 /* We got an exception from build_real_from_int_cst_1() */
1510 /* Check for valid float value for this type on this target machine. */
1512 #ifdef CHECK_FLOAT_VALUE
1513 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1516 TREE_REAL_CST (v) = d;
1517 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1521 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1523 /* Return a newly constructed STRING_CST node whose value is
1524 the LEN characters at STR.
1525 The TREE_TYPE is not initialized. */
1528 build_string (len, str)
1532 /* Put the string in saveable_obstack since it will be placed in the RTL
1533 for an "asm" statement and will also be kept around a while if
1534 deferring constant output in varasm.c. */
1536 register tree s = make_node (STRING_CST);
1537 TREE_STRING_LENGTH (s) = len;
1539 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
1541 TREE_STRING_POINTER (s) = obstack_copy0 (saveable_obstack, str, len);
1545 /* Return a newly constructed COMPLEX_CST node whose value is
1546 specified by the real and imaginary parts REAL and IMAG.
1547 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1548 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1551 build_complex (type, real, imag)
1555 register tree t = make_node (COMPLEX_CST);
1557 TREE_REALPART (t) = real;
1558 TREE_IMAGPART (t) = imag;
1559 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1560 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1561 TREE_CONSTANT_OVERFLOW (t)
1562 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1566 /* Build a newly constructed TREE_VEC node of length LEN. */
1573 register int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
1574 register struct obstack *obstack = current_obstack;
1576 #ifdef GATHER_STATISTICS
1577 tree_node_counts[(int)vec_kind]++;
1578 tree_node_sizes[(int)vec_kind] += length;
1582 t = ggc_alloc_tree (length);
1585 t = (tree) obstack_alloc (obstack, length);
1586 bzero ((PTR) t, length);
1589 TREE_SET_CODE (t, TREE_VEC);
1590 TREE_VEC_LENGTH (t) = len;
1591 if (obstack == &permanent_obstack)
1592 TREE_PERMANENT (t) = 1;
1597 /* Return 1 if EXPR is the integer constant zero or a complex constant
1601 integer_zerop (expr)
1606 return ((TREE_CODE (expr) == INTEGER_CST
1607 && ! TREE_CONSTANT_OVERFLOW (expr)
1608 && TREE_INT_CST_LOW (expr) == 0
1609 && TREE_INT_CST_HIGH (expr) == 0)
1610 || (TREE_CODE (expr) == COMPLEX_CST
1611 && integer_zerop (TREE_REALPART (expr))
1612 && integer_zerop (TREE_IMAGPART (expr))));
1615 /* Return 1 if EXPR is the integer constant one or the corresponding
1616 complex constant. */
1624 return ((TREE_CODE (expr) == INTEGER_CST
1625 && ! TREE_CONSTANT_OVERFLOW (expr)
1626 && TREE_INT_CST_LOW (expr) == 1
1627 && TREE_INT_CST_HIGH (expr) == 0)
1628 || (TREE_CODE (expr) == COMPLEX_CST
1629 && integer_onep (TREE_REALPART (expr))
1630 && integer_zerop (TREE_IMAGPART (expr))));
1633 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1634 it contains. Likewise for the corresponding complex constant. */
1637 integer_all_onesp (expr)
1645 if (TREE_CODE (expr) == COMPLEX_CST
1646 && integer_all_onesp (TREE_REALPART (expr))
1647 && integer_zerop (TREE_IMAGPART (expr)))
1650 else if (TREE_CODE (expr) != INTEGER_CST
1651 || TREE_CONSTANT_OVERFLOW (expr))
1654 uns = TREE_UNSIGNED (TREE_TYPE (expr));
1656 return TREE_INT_CST_LOW (expr) == -1 && TREE_INT_CST_HIGH (expr) == -1;
1658 /* Note that using TYPE_PRECISION here is wrong. We care about the
1659 actual bits, not the (arbitrary) range of the type. */
1660 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1661 if (prec >= HOST_BITS_PER_WIDE_INT)
1663 int high_value, shift_amount;
1665 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1667 if (shift_amount > HOST_BITS_PER_WIDE_INT)
1668 /* Can not handle precisions greater than twice the host int size. */
1670 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
1671 /* Shifting by the host word size is undefined according to the ANSI
1672 standard, so we must handle this as a special case. */
1675 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1677 return TREE_INT_CST_LOW (expr) == -1
1678 && TREE_INT_CST_HIGH (expr) == high_value;
1681 return TREE_INT_CST_LOW (expr) == ((HOST_WIDE_INT) 1 << prec) - 1;
1684 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1688 integer_pow2p (expr)
1692 HOST_WIDE_INT high, low;
1696 if (TREE_CODE (expr) == COMPLEX_CST
1697 && integer_pow2p (TREE_REALPART (expr))
1698 && integer_zerop (TREE_IMAGPART (expr)))
1701 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
1704 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1705 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1706 high = TREE_INT_CST_HIGH (expr);
1707 low = TREE_INT_CST_LOW (expr);
1709 /* First clear all bits that are beyond the type's precision in case
1710 we've been sign extended. */
1712 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1714 else if (prec > HOST_BITS_PER_WIDE_INT)
1715 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1719 if (prec < HOST_BITS_PER_WIDE_INT)
1720 low &= ~((HOST_WIDE_INT) (-1) << prec);
1723 if (high == 0 && low == 0)
1726 return ((high == 0 && (low & (low - 1)) == 0)
1727 || (low == 0 && (high & (high - 1)) == 0));
1730 /* Return the power of two represented by a tree node known to be a
1738 HOST_WIDE_INT high, low;
1742 if (TREE_CODE (expr) == COMPLEX_CST)
1743 return tree_log2 (TREE_REALPART (expr));
1745 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1746 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1748 high = TREE_INT_CST_HIGH (expr);
1749 low = TREE_INT_CST_LOW (expr);
1751 /* First clear all bits that are beyond the type's precision in case
1752 we've been sign extended. */
1754 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1756 else if (prec > HOST_BITS_PER_WIDE_INT)
1757 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1761 if (prec < HOST_BITS_PER_WIDE_INT)
1762 low &= ~((HOST_WIDE_INT) (-1) << prec);
1765 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1766 : exact_log2 (low));
1769 /* Return 1 if EXPR is the real constant zero. */
1777 return ((TREE_CODE (expr) == REAL_CST
1778 && ! TREE_CONSTANT_OVERFLOW (expr)
1779 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1780 || (TREE_CODE (expr) == COMPLEX_CST
1781 && real_zerop (TREE_REALPART (expr))
1782 && real_zerop (TREE_IMAGPART (expr))));
1785 /* Return 1 if EXPR is the real constant one in real or complex form. */
1793 return ((TREE_CODE (expr) == REAL_CST
1794 && ! TREE_CONSTANT_OVERFLOW (expr)
1795 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1796 || (TREE_CODE (expr) == COMPLEX_CST
1797 && real_onep (TREE_REALPART (expr))
1798 && real_zerop (TREE_IMAGPART (expr))));
1801 /* Return 1 if EXPR is the real constant two. */
1809 return ((TREE_CODE (expr) == REAL_CST
1810 && ! TREE_CONSTANT_OVERFLOW (expr)
1811 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1812 || (TREE_CODE (expr) == COMPLEX_CST
1813 && real_twop (TREE_REALPART (expr))
1814 && real_zerop (TREE_IMAGPART (expr))));
1817 /* Nonzero if EXP is a constant or a cast of a constant. */
1820 really_constant_p (exp)
1823 /* This is not quite the same as STRIP_NOPS. It does more. */
1824 while (TREE_CODE (exp) == NOP_EXPR
1825 || TREE_CODE (exp) == CONVERT_EXPR
1826 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1827 exp = TREE_OPERAND (exp, 0);
1828 return TREE_CONSTANT (exp);
1831 /* Return first list element whose TREE_VALUE is ELEM.
1832 Return 0 if ELEM is not in LIST. */
1835 value_member (elem, list)
1840 if (elem == TREE_VALUE (list))
1842 list = TREE_CHAIN (list);
1847 /* Return first list element whose TREE_PURPOSE is ELEM.
1848 Return 0 if ELEM is not in LIST. */
1851 purpose_member (elem, list)
1856 if (elem == TREE_PURPOSE (list))
1858 list = TREE_CHAIN (list);
1863 /* Return first list element whose BINFO_TYPE is ELEM.
1864 Return 0 if ELEM is not in LIST. */
1867 binfo_member (elem, list)
1872 if (elem == BINFO_TYPE (list))
1874 list = TREE_CHAIN (list);
1879 /* Return nonzero if ELEM is part of the chain CHAIN. */
1882 chain_member (elem, chain)
1889 chain = TREE_CHAIN (chain);
1895 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1897 /* ??? This function was added for machine specific attributes but is no
1898 longer used. It could be deleted if we could confirm all front ends
1902 chain_member_value (elem, chain)
1907 if (elem == TREE_VALUE (chain))
1909 chain = TREE_CHAIN (chain);
1915 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1916 for any piece of chain CHAIN. */
1917 /* ??? This function was added for machine specific attributes but is no
1918 longer used. It could be deleted if we could confirm all front ends
1922 chain_member_purpose (elem, chain)
1927 if (elem == TREE_PURPOSE (chain))
1929 chain = TREE_CHAIN (chain);
1935 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1936 We expect a null pointer to mark the end of the chain.
1937 This is the Lisp primitive `length'. */
1944 register int len = 0;
1946 for (tail = t; tail; tail = TREE_CHAIN (tail))
1952 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1953 by modifying the last node in chain 1 to point to chain 2.
1954 This is the Lisp primitive `nconc'. */
1964 #ifdef ENABLE_CHECKING
1968 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1970 TREE_CHAIN (t1) = op2;
1971 #ifdef ENABLE_CHECKING
1972 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1974 abort (); /* Circularity created. */
1981 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1985 register tree chain;
1989 while ((next = TREE_CHAIN (chain)))
1994 /* Reverse the order of elements in the chain T,
1995 and return the new head of the chain (old last element). */
2001 register tree prev = 0, decl, next;
2002 for (decl = t; decl; decl = next)
2004 next = TREE_CHAIN (decl);
2005 TREE_CHAIN (decl) = prev;
2011 /* Given a chain CHAIN of tree nodes,
2012 construct and return a list of those nodes. */
2018 tree result = NULL_TREE;
2019 tree in_tail = chain;
2020 tree out_tail = NULL_TREE;
2024 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
2026 TREE_CHAIN (out_tail) = next;
2030 in_tail = TREE_CHAIN (in_tail);
2036 /* Return a newly created TREE_LIST node whose
2037 purpose and value fields are PARM and VALUE. */
2040 build_tree_list (parm, value)
2043 register tree t = make_node (TREE_LIST);
2044 TREE_PURPOSE (t) = parm;
2045 TREE_VALUE (t) = value;
2049 /* Similar, but build on the temp_decl_obstack. */
2052 build_decl_list (parm, value)
2056 register struct obstack *ambient_obstack = current_obstack;
2057 current_obstack = &temp_decl_obstack;
2058 node = build_tree_list (parm, value);
2059 current_obstack = ambient_obstack;
2063 /* Similar, but build on the expression_obstack. */
2066 build_expr_list (parm, value)
2070 register struct obstack *ambient_obstack = current_obstack;
2071 current_obstack = expression_obstack;
2072 node = build_tree_list (parm, value);
2073 current_obstack = ambient_obstack;
2077 /* Return a newly created TREE_LIST node whose
2078 purpose and value fields are PARM and VALUE
2079 and whose TREE_CHAIN is CHAIN. */
2082 tree_cons (purpose, value, chain)
2083 tree purpose, value, chain;
2086 register tree node = make_node (TREE_LIST);
2091 node = ggc_alloc_tree (sizeof (struct tree_list));
2094 node = (tree) obstack_alloc (current_obstack, sizeof (struct tree_list));
2095 memset (node, 0, sizeof (struct tree_common));
2098 #ifdef GATHER_STATISTICS
2099 tree_node_counts[(int)x_kind]++;
2100 tree_node_sizes[(int)x_kind] += sizeof (struct tree_list);
2104 TREE_SET_CODE (node, TREE_LIST);
2105 if (current_obstack == &permanent_obstack)
2106 TREE_PERMANENT (node) = 1;
2109 TREE_CHAIN (node) = chain;
2110 TREE_PURPOSE (node) = purpose;
2111 TREE_VALUE (node) = value;
2115 /* Similar, but build on the temp_decl_obstack. */
2118 decl_tree_cons (purpose, value, chain)
2119 tree purpose, value, chain;
2122 register struct obstack *ambient_obstack = current_obstack;
2123 current_obstack = &temp_decl_obstack;
2124 node = tree_cons (purpose, value, chain);
2125 current_obstack = ambient_obstack;
2129 /* Similar, but build on the expression_obstack. */
2132 expr_tree_cons (purpose, value, chain)
2133 tree purpose, value, chain;
2136 register struct obstack *ambient_obstack = current_obstack;
2137 current_obstack = expression_obstack;
2138 node = tree_cons (purpose, value, chain);
2139 current_obstack = ambient_obstack;
2143 /* Same as `tree_cons' but make a permanent object. */
2146 perm_tree_cons (purpose, value, chain)
2147 tree purpose, value, chain;
2150 register struct obstack *ambient_obstack = current_obstack;
2151 current_obstack = &permanent_obstack;
2153 node = tree_cons (purpose, value, chain);
2154 current_obstack = ambient_obstack;
2158 /* Same as `tree_cons', but make this node temporary, regardless. */
2161 temp_tree_cons (purpose, value, chain)
2162 tree purpose, value, chain;
2165 register struct obstack *ambient_obstack = current_obstack;
2166 current_obstack = &temporary_obstack;
2168 node = tree_cons (purpose, value, chain);
2169 current_obstack = ambient_obstack;
2173 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2176 saveable_tree_cons (purpose, value, chain)
2177 tree purpose, value, chain;
2180 register struct obstack *ambient_obstack = current_obstack;
2181 current_obstack = saveable_obstack;
2183 node = tree_cons (purpose, value, chain);
2184 current_obstack = ambient_obstack;
2188 /* Return the size nominally occupied by an object of type TYPE
2189 when it resides in memory. The value is measured in units of bytes,
2190 and its data type is that normally used for type sizes
2191 (which is the first type created by make_signed_type or
2192 make_unsigned_type). */
2195 size_in_bytes (type)
2200 if (type == error_mark_node)
2201 return integer_zero_node;
2203 type = TYPE_MAIN_VARIANT (type);
2204 t = TYPE_SIZE_UNIT (type);
2207 incomplete_type_error (NULL_TREE, type);
2208 return integer_zero_node;
2210 if (TREE_CODE (t) == INTEGER_CST)
2211 force_fit_type (t, 0);
2216 /* Return the size of TYPE (in bytes) as a wide integer
2217 or return -1 if the size can vary or is larger than an integer. */
2220 int_size_in_bytes (type)
2225 if (type == error_mark_node)
2228 type = TYPE_MAIN_VARIANT (type);
2229 t = TYPE_SIZE_UNIT (type);
2231 || TREE_CODE (t) != INTEGER_CST
2232 || TREE_INT_CST_HIGH (t) != 0)
2235 return TREE_INT_CST_LOW (t);
2238 /* Return, as a tree node, the number of elements for TYPE (which is an
2239 ARRAY_TYPE) minus one. This counts only elements of the top array.
2241 Don't let any SAVE_EXPRs escape; if we are called as part of a cleanup
2242 action, they would get unsaved. */
2245 array_type_nelts (type)
2248 tree index_type, min, max;
2250 /* If they did it with unspecified bounds, then we should have already
2251 given an error about it before we got here. */
2252 if (! TYPE_DOMAIN (type))
2253 return error_mark_node;
2255 index_type = TYPE_DOMAIN (type);
2256 min = TYPE_MIN_VALUE (index_type);
2257 max = TYPE_MAX_VALUE (index_type);
2259 if (! TREE_CONSTANT (min))
2262 if (TREE_CODE (min) == SAVE_EXPR && SAVE_EXPR_RTL (min))
2263 min = build (RTL_EXPR, TREE_TYPE (TYPE_MIN_VALUE (index_type)), 0,
2264 SAVE_EXPR_RTL (min));
2266 min = TYPE_MIN_VALUE (index_type);
2269 if (! TREE_CONSTANT (max))
2272 if (TREE_CODE (max) == SAVE_EXPR && SAVE_EXPR_RTL (max))
2273 max = build (RTL_EXPR, TREE_TYPE (TYPE_MAX_VALUE (index_type)), 0,
2274 SAVE_EXPR_RTL (max));
2276 max = TYPE_MAX_VALUE (index_type);
2279 return (integer_zerop (min)
2281 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
2284 /* Return nonzero if arg is static -- a reference to an object in
2285 static storage. This is not the same as the C meaning of `static'. */
2291 switch (TREE_CODE (arg))
2294 /* Nested functions aren't static, since taking their address
2295 involves a trampoline. */
2296 return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
2297 && ! DECL_NON_ADDR_CONST_P (arg);
2300 return (TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2301 && ! DECL_NON_ADDR_CONST_P (arg);
2304 return TREE_STATIC (arg);
2309 /* If we are referencing a bitfield, we can't evaluate an
2310 ADDR_EXPR at compile time and so it isn't a constant. */
2312 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
2313 && staticp (TREE_OPERAND (arg, 0)));
2319 /* This case is technically correct, but results in setting
2320 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2323 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
2327 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2328 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2329 return staticp (TREE_OPERAND (arg, 0));
2336 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2337 Do this to any expression which may be used in more than one place,
2338 but must be evaluated only once.
2340 Normally, expand_expr would reevaluate the expression each time.
2341 Calling save_expr produces something that is evaluated and recorded
2342 the first time expand_expr is called on it. Subsequent calls to
2343 expand_expr just reuse the recorded value.
2345 The call to expand_expr that generates code that actually computes
2346 the value is the first call *at compile time*. Subsequent calls
2347 *at compile time* generate code to use the saved value.
2348 This produces correct result provided that *at run time* control
2349 always flows through the insns made by the first expand_expr
2350 before reaching the other places where the save_expr was evaluated.
2351 You, the caller of save_expr, must make sure this is so.
2353 Constants, and certain read-only nodes, are returned with no
2354 SAVE_EXPR because that is safe. Expressions containing placeholders
2355 are not touched; see tree.def for an explanation of what these
2362 register tree t = fold (expr);
2364 /* We don't care about whether this can be used as an lvalue in this
2366 while (TREE_CODE (t) == NON_LVALUE_EXPR)
2367 t = TREE_OPERAND (t, 0);
2369 /* If the tree evaluates to a constant, then we don't want to hide that
2370 fact (i.e. this allows further folding, and direct checks for constants).
2371 However, a read-only object that has side effects cannot be bypassed.
2372 Since it is no problem to reevaluate literals, we just return the
2375 if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t))
2376 || TREE_CODE (t) == SAVE_EXPR || TREE_CODE (t) == ERROR_MARK)
2379 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2380 it means that the size or offset of some field of an object depends on
2381 the value within another field.
2383 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2384 and some variable since it would then need to be both evaluated once and
2385 evaluated more than once. Front-ends must assure this case cannot
2386 happen by surrounding any such subexpressions in their own SAVE_EXPR
2387 and forcing evaluation at the proper time. */
2388 if (contains_placeholder_p (t))
2391 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
2393 /* This expression might be placed ahead of a jump to ensure that the
2394 value was computed on both sides of the jump. So make sure it isn't
2395 eliminated as dead. */
2396 TREE_SIDE_EFFECTS (t) = 1;
2400 /* Arrange for an expression to be expanded multiple independent
2401 times. This is useful for cleanup actions, as the backend can
2402 expand them multiple times in different places. */
2410 /* If this is already protected, no sense in protecting it again. */
2411 if (TREE_CODE (expr) == UNSAVE_EXPR)
2414 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
2415 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
2419 /* Returns the index of the first non-tree operand for CODE, or the number
2420 of operands if all are trees. */
2424 enum tree_code code;
2430 case GOTO_SUBROUTINE_EXPR:
2435 case WITH_CLEANUP_EXPR:
2436 /* Should be defined to be 2. */
2438 case METHOD_CALL_EXPR:
2441 return tree_code_length [(int) code];
2445 /* Modify a tree in place so that all the evaluate only once things
2446 are cleared out. Return the EXPR given.
2448 LANG_UNSAVE_EXPR_NOW, if set, is a pointer to a function to handle
2449 language specific nodes.
2453 unsave_expr_now (expr)
2456 enum tree_code code;
2460 if (expr == NULL_TREE)
2463 code = TREE_CODE (expr);
2464 first_rtl = first_rtl_op (code);
2468 SAVE_EXPR_RTL (expr) = 0;
2472 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
2473 TREE_OPERAND (expr, 3) = NULL_TREE;
2477 /* I don't yet know how to emit a sequence multiple times. */
2478 if (RTL_EXPR_SEQUENCE (expr) != 0)
2483 CALL_EXPR_RTL (expr) = 0;
2484 if (TREE_OPERAND (expr, 1)
2485 && TREE_CODE (TREE_OPERAND (expr, 1)) == TREE_LIST)
2487 tree exp = TREE_OPERAND (expr, 1);
2490 unsave_expr_now (TREE_VALUE (exp));
2491 exp = TREE_CHAIN (exp);
2497 if (lang_unsave_expr_now)
2498 (*lang_unsave_expr_now) (expr);
2502 switch (TREE_CODE_CLASS (code))
2504 case 'c': /* a constant */
2505 case 't': /* a type node */
2506 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2507 case 'd': /* A decl node */
2508 case 'b': /* A block node */
2511 case 'e': /* an expression */
2512 case 'r': /* a reference */
2513 case 's': /* an expression with side effects */
2514 case '<': /* a comparison expression */
2515 case '2': /* a binary arithmetic expression */
2516 case '1': /* a unary arithmetic expression */
2517 for (i = first_rtl - 1; i >= 0; i--)
2518 unsave_expr_now (TREE_OPERAND (expr, i));
2526 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2527 or offset that depends on a field within a record. */
2530 contains_placeholder_p (exp)
2533 register enum tree_code code = TREE_CODE (exp);
2536 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2537 in it since it is supplying a value for it. */
2538 if (code == WITH_RECORD_EXPR)
2540 else if (code == PLACEHOLDER_EXPR)
2543 switch (TREE_CODE_CLASS (code))
2546 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2547 position computations since they will be converted into a
2548 WITH_RECORD_EXPR involving the reference, which will assume
2549 here will be valid. */
2550 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2553 if (code == TREE_LIST)
2554 return (contains_placeholder_p (TREE_VALUE (exp))
2555 || (TREE_CHAIN (exp) != 0
2556 && contains_placeholder_p (TREE_CHAIN (exp))));
2565 /* Ignoring the first operand isn't quite right, but works best. */
2566 return contains_placeholder_p (TREE_OPERAND (exp, 1));
2573 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
2574 || contains_placeholder_p (TREE_OPERAND (exp, 1))
2575 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
2578 /* If we already know this doesn't have a placeholder, don't
2580 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
2583 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
2584 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
2586 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
2591 return (TREE_OPERAND (exp, 1) != 0
2592 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
2598 switch (tree_code_length[(int) code])
2601 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2603 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
2604 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
2615 /* Return 1 if EXP contains any expressions that produce cleanups for an
2616 outer scope to deal with. Used by fold. */
2624 if (! TREE_SIDE_EFFECTS (exp))
2627 switch (TREE_CODE (exp))
2630 case GOTO_SUBROUTINE_EXPR:
2631 case WITH_CLEANUP_EXPR:
2634 case CLEANUP_POINT_EXPR:
2638 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
2640 cmp = has_cleanups (TREE_VALUE (exp));
2650 /* This general rule works for most tree codes. All exceptions should be
2651 handled above. If this is a language-specific tree code, we can't
2652 trust what might be in the operand, so say we don't know
2654 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
2657 nops = first_rtl_op (TREE_CODE (exp));
2658 for (i = 0; i < nops; i++)
2659 if (TREE_OPERAND (exp, i) != 0)
2661 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
2662 if (type == 'e' || type == '<' || type == '1' || type == '2'
2663 || type == 'r' || type == 's')
2665 cmp = has_cleanups (TREE_OPERAND (exp, i));
2674 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2675 return a tree with all occurrences of references to F in a
2676 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2677 contains only arithmetic expressions or a CALL_EXPR with a
2678 PLACEHOLDER_EXPR occurring only in its arglist. */
2681 substitute_in_expr (exp, f, r)
2686 enum tree_code code = TREE_CODE (exp);
2691 switch (TREE_CODE_CLASS (code))
2698 if (code == PLACEHOLDER_EXPR)
2700 else if (code == TREE_LIST)
2702 op0 = (TREE_CHAIN (exp) == 0
2703 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
2704 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
2705 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2708 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2717 switch (tree_code_length[(int) code])
2720 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2721 if (op0 == TREE_OPERAND (exp, 0))
2724 new = fold (build1 (code, TREE_TYPE (exp), op0));
2728 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2729 could, but we don't support it. */
2730 if (code == RTL_EXPR)
2732 else if (code == CONSTRUCTOR)
2735 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2736 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2737 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2740 new = fold (build (code, TREE_TYPE (exp), op0, op1));
2744 /* It cannot be that anything inside a SAVE_EXPR contains a
2745 PLACEHOLDER_EXPR. */
2746 if (code == SAVE_EXPR)
2749 else if (code == CALL_EXPR)
2751 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2752 if (op1 == TREE_OPERAND (exp, 1))
2755 return build (code, TREE_TYPE (exp),
2756 TREE_OPERAND (exp, 0), op1, NULL_TREE);
2759 else if (code != COND_EXPR)
2762 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2763 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2764 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2765 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2766 && op2 == TREE_OPERAND (exp, 2))
2769 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2782 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2783 and it is the right field, replace it with R. */
2784 for (inner = TREE_OPERAND (exp, 0);
2785 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2786 inner = TREE_OPERAND (inner, 0))
2788 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2789 && TREE_OPERAND (exp, 1) == f)
2792 /* If this expression hasn't been completed let, leave it
2794 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2795 && TREE_TYPE (inner) == 0)
2798 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2799 if (op0 == TREE_OPERAND (exp, 0))
2802 new = fold (build (code, TREE_TYPE (exp), op0,
2803 TREE_OPERAND (exp, 1)));
2807 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2808 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2809 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2810 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2811 && op2 == TREE_OPERAND (exp, 2))
2814 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2819 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2820 if (op0 == TREE_OPERAND (exp, 0))
2823 new = fold (build1 (code, TREE_TYPE (exp), op0));
2835 TREE_READONLY (new) = TREE_READONLY (exp);
2839 /* Stabilize a reference so that we can use it any number of times
2840 without causing its operands to be evaluated more than once.
2841 Returns the stabilized reference. This works by means of save_expr,
2842 so see the caveats in the comments about save_expr.
2844 Also allows conversion expressions whose operands are references.
2845 Any other kind of expression is returned unchanged. */
2848 stabilize_reference (ref)
2851 register tree result;
2852 register enum tree_code code = TREE_CODE (ref);
2859 /* No action is needed in this case. */
2865 case FIX_TRUNC_EXPR:
2866 case FIX_FLOOR_EXPR:
2867 case FIX_ROUND_EXPR:
2869 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2873 result = build_nt (INDIRECT_REF,
2874 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2878 result = build_nt (COMPONENT_REF,
2879 stabilize_reference (TREE_OPERAND (ref, 0)),
2880 TREE_OPERAND (ref, 1));
2884 result = build_nt (BIT_FIELD_REF,
2885 stabilize_reference (TREE_OPERAND (ref, 0)),
2886 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2887 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2891 result = build_nt (ARRAY_REF,
2892 stabilize_reference (TREE_OPERAND (ref, 0)),
2893 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2897 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2898 it wouldn't be ignored. This matters when dealing with
2900 return stabilize_reference_1 (ref);
2903 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2904 save_expr (build1 (ADDR_EXPR,
2905 build_pointer_type (TREE_TYPE (ref)),
2910 /* If arg isn't a kind of lvalue we recognize, make no change.
2911 Caller should recognize the error for an invalid lvalue. */
2916 return error_mark_node;
2919 TREE_TYPE (result) = TREE_TYPE (ref);
2920 TREE_READONLY (result) = TREE_READONLY (ref);
2921 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2922 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2923 TREE_RAISES (result) = TREE_RAISES (ref);
2928 /* Subroutine of stabilize_reference; this is called for subtrees of
2929 references. Any expression with side-effects must be put in a SAVE_EXPR
2930 to ensure that it is only evaluated once.
2932 We don't put SAVE_EXPR nodes around everything, because assigning very
2933 simple expressions to temporaries causes us to miss good opportunities
2934 for optimizations. Among other things, the opportunity to fold in the
2935 addition of a constant into an addressing mode often gets lost, e.g.
2936 "y[i+1] += x;". In general, we take the approach that we should not make
2937 an assignment unless we are forced into it - i.e., that any non-side effect
2938 operator should be allowed, and that cse should take care of coalescing
2939 multiple utterances of the same expression should that prove fruitful. */
2942 stabilize_reference_1 (e)
2945 register tree result;
2946 register enum tree_code code = TREE_CODE (e);
2948 /* We cannot ignore const expressions because it might be a reference
2949 to a const array but whose index contains side-effects. But we can
2950 ignore things that are actual constant or that already have been
2951 handled by this function. */
2953 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2956 switch (TREE_CODE_CLASS (code))
2966 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2967 so that it will only be evaluated once. */
2968 /* The reference (r) and comparison (<) classes could be handled as
2969 below, but it is generally faster to only evaluate them once. */
2970 if (TREE_SIDE_EFFECTS (e))
2971 return save_expr (e);
2975 /* Constants need no processing. In fact, we should never reach
2980 /* Division is slow and tends to be compiled with jumps,
2981 especially the division by powers of 2 that is often
2982 found inside of an array reference. So do it just once. */
2983 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2984 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2985 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2986 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2987 return save_expr (e);
2988 /* Recursively stabilize each operand. */
2989 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2990 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2994 /* Recursively stabilize each operand. */
2995 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3002 TREE_TYPE (result) = TREE_TYPE (e);
3003 TREE_READONLY (result) = TREE_READONLY (e);
3004 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3005 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3006 TREE_RAISES (result) = TREE_RAISES (e);
3011 /* Low-level constructors for expressions. */
3013 /* Build an expression of code CODE, data type TYPE,
3014 and operands as specified by the arguments ARG1 and following arguments.
3015 Expressions and reference nodes can be created this way.
3016 Constants, decls, types and misc nodes cannot be. */
3019 build VPROTO((enum tree_code code, tree tt, ...))
3021 #ifndef ANSI_PROTOTYPES
3022 enum tree_code code;
3027 register int length;
3033 #ifndef ANSI_PROTOTYPES
3034 code = va_arg (p, enum tree_code);
3035 tt = va_arg (p, tree);
3038 t = make_node (code);
3039 length = tree_code_length[(int) code];
3042 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_RAISED for
3043 the result based on those same flags for the arguments. But, if
3044 the arguments aren't really even `tree' expressions, we shouldn't
3045 be trying to do this. */
3046 fro = first_rtl_op (code);
3050 /* This is equivalent to the loop below, but faster. */
3051 register tree arg0 = va_arg (p, tree);
3052 register tree arg1 = va_arg (p, tree);
3053 TREE_OPERAND (t, 0) = arg0;
3054 TREE_OPERAND (t, 1) = arg1;
3055 if (arg0 && fro > 0)
3057 if (TREE_SIDE_EFFECTS (arg0))
3058 TREE_SIDE_EFFECTS (t) = 1;
3059 if (TREE_RAISES (arg0))
3060 TREE_RAISES (t) = 1;
3062 if (arg1 && fro > 1)
3064 if (TREE_SIDE_EFFECTS (arg1))
3065 TREE_SIDE_EFFECTS (t) = 1;
3066 if (TREE_RAISES (arg1))
3067 TREE_RAISES (t) = 1;
3070 else if (length == 1)
3072 register tree arg0 = va_arg (p, tree);
3074 /* Call build1 for this! */
3075 if (TREE_CODE_CLASS (code) != 's')
3077 TREE_OPERAND (t, 0) = arg0;
3080 if (arg0 && TREE_SIDE_EFFECTS (arg0))
3081 TREE_SIDE_EFFECTS (t) = 1;
3082 TREE_RAISES (t) = (arg0 && TREE_RAISES (arg0));
3087 for (i = 0; i < length; i++)
3089 register tree operand = va_arg (p, tree);
3090 TREE_OPERAND (t, i) = operand;
3091 if (operand && fro > i)
3093 if (TREE_SIDE_EFFECTS (operand))
3094 TREE_SIDE_EFFECTS (t) = 1;
3095 if (TREE_RAISES (operand))
3096 TREE_RAISES (t) = 1;
3104 /* Same as above, but only builds for unary operators.
3105 Saves lions share of calls to `build'; cuts down use
3106 of varargs, which is expensive for RISC machines. */
3109 build1 (code, type, node)
3110 enum tree_code code;
3114 register struct obstack *obstack = expression_obstack;
3115 register int length;
3116 #ifdef GATHER_STATISTICS
3117 register tree_node_kind kind;
3121 #ifdef GATHER_STATISTICS
3122 if (TREE_CODE_CLASS (code) == 'r')
3128 length = sizeof (struct tree_exp);
3131 t = ggc_alloc_tree (length);
3134 t = (tree) obstack_alloc (obstack, length);
3135 memset ((PTR) t, 0, length);
3138 #ifdef GATHER_STATISTICS
3139 tree_node_counts[(int)kind]++;
3140 tree_node_sizes[(int)kind] += length;
3143 TREE_TYPE (t) = type;
3144 TREE_SET_CODE (t, code);
3146 if (obstack == &permanent_obstack)
3147 TREE_PERMANENT (t) = 1;
3149 TREE_OPERAND (t, 0) = node;
3150 if (node && first_rtl_op (code) != 0)
3152 if (TREE_SIDE_EFFECTS (node))
3153 TREE_SIDE_EFFECTS (t) = 1;
3154 if (TREE_RAISES (node))
3155 TREE_RAISES (t) = 1;
3164 case PREDECREMENT_EXPR:
3165 case PREINCREMENT_EXPR:
3166 case POSTDECREMENT_EXPR:
3167 case POSTINCREMENT_EXPR:
3168 /* All of these have side-effects, no matter what their
3170 TREE_SIDE_EFFECTS (t) = 1;
3180 /* Similar except don't specify the TREE_TYPE
3181 and leave the TREE_SIDE_EFFECTS as 0.
3182 It is permissible for arguments to be null,
3183 or even garbage if their values do not matter. */
3186 build_nt VPROTO((enum tree_code code, ...))
3188 #ifndef ANSI_PROTOTYPES
3189 enum tree_code code;
3193 register int length;
3198 #ifndef ANSI_PROTOTYPES
3199 code = va_arg (p, enum tree_code);
3202 t = make_node (code);
3203 length = tree_code_length[(int) code];
3205 for (i = 0; i < length; i++)
3206 TREE_OPERAND (t, i) = va_arg (p, tree);
3212 /* Similar to `build_nt', except we build
3213 on the temp_decl_obstack, regardless. */
3216 build_parse_node VPROTO((enum tree_code code, ...))
3218 #ifndef ANSI_PROTOTYPES
3219 enum tree_code code;
3221 register struct obstack *ambient_obstack = expression_obstack;
3224 register int length;
3229 #ifndef ANSI_PROTOTYPES
3230 code = va_arg (p, enum tree_code);
3233 expression_obstack = &temp_decl_obstack;
3235 t = make_node (code);
3236 length = tree_code_length[(int) code];
3238 for (i = 0; i < length; i++)
3239 TREE_OPERAND (t, i) = va_arg (p, tree);
3242 expression_obstack = ambient_obstack;
3247 /* Commented out because this wants to be done very
3248 differently. See cp-lex.c. */
3250 build_op_identifier (op1, op2)
3253 register tree t = make_node (OP_IDENTIFIER);
3254 TREE_PURPOSE (t) = op1;
3255 TREE_VALUE (t) = op2;
3260 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3261 We do NOT enter this node in any sort of symbol table.
3263 layout_decl is used to set up the decl's storage layout.
3264 Other slots are initialized to 0 or null pointers. */
3267 build_decl (code, name, type)
3268 enum tree_code code;
3273 t = make_node (code);
3275 /* if (type == error_mark_node)
3276 type = integer_type_node; */
3277 /* That is not done, deliberately, so that having error_mark_node
3278 as the type can suppress useless errors in the use of this variable. */
3280 DECL_NAME (t) = name;
3281 DECL_ASSEMBLER_NAME (t) = name;
3282 TREE_TYPE (t) = type;
3284 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3286 else if (code == FUNCTION_DECL)
3287 DECL_MODE (t) = FUNCTION_MODE;
3292 /* BLOCK nodes are used to represent the structure of binding contours
3293 and declarations, once those contours have been exited and their contents
3294 compiled. This information is used for outputting debugging info. */
3297 build_block (vars, tags, subblocks, supercontext, chain)
3298 tree vars, tags, subblocks, supercontext, chain;
3300 register tree block = make_node (BLOCK);
3301 BLOCK_VARS (block) = vars;
3302 BLOCK_TYPE_TAGS (block) = tags;
3303 BLOCK_SUBBLOCKS (block) = subblocks;
3304 BLOCK_SUPERCONTEXT (block) = supercontext;
3305 BLOCK_CHAIN (block) = chain;
3309 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3310 location where an expression or an identifier were encountered. It
3311 is necessary for languages where the frontend parser will handle
3312 recursively more than one file (Java is one of them). */
3315 build_expr_wfl (node, file, line, col)
3320 static const char *last_file = 0;
3321 static tree last_filenode = NULL_TREE;
3322 register tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
3324 EXPR_WFL_NODE (wfl) = node;
3325 EXPR_WFL_SET_LINECOL (wfl, line, col);
3326 if (file != last_file)
3329 last_filenode = file ? get_identifier (file) : NULL_TREE;
3331 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
3334 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
3335 TREE_TYPE (wfl) = TREE_TYPE (node);
3340 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3344 build_decl_attribute_variant (ddecl, attribute)
3345 tree ddecl, attribute;
3347 DECL_MACHINE_ATTRIBUTES (ddecl) = attribute;
3351 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3354 Record such modified types already made so we don't make duplicates. */
3357 build_type_attribute_variant (ttype, attribute)
3358 tree ttype, attribute;
3360 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3362 register int hashcode;
3363 register struct obstack *ambient_obstack = current_obstack;
3366 if (ambient_obstack != &permanent_obstack)
3367 current_obstack = TYPE_OBSTACK (ttype);
3369 ntype = copy_node (ttype);
3371 TYPE_POINTER_TO (ntype) = 0;
3372 TYPE_REFERENCE_TO (ntype) = 0;
3373 TYPE_ATTRIBUTES (ntype) = attribute;
3375 /* Create a new main variant of TYPE. */
3376 TYPE_MAIN_VARIANT (ntype) = ntype;
3377 TYPE_NEXT_VARIANT (ntype) = 0;
3378 set_type_quals (ntype, TYPE_UNQUALIFIED);
3380 hashcode = TYPE_HASH (TREE_CODE (ntype))
3381 + TYPE_HASH (TREE_TYPE (ntype))
3382 + attribute_hash_list (attribute);
3384 switch (TREE_CODE (ntype))
3387 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
3390 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
3393 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
3396 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
3402 ntype = type_hash_canon (hashcode, ntype);
3403 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
3405 /* We must restore the current obstack after the type_hash_canon call,
3406 because type_hash_canon calls type_hash_add for permanent types, and
3407 then type_hash_add calls oballoc expecting to get something permanent
3409 current_obstack = ambient_obstack;
3415 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3416 or type TYPE and 0 otherwise. Validity is determined the configuration
3417 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3420 valid_machine_attribute (attr_name, attr_args, decl, type)
3422 tree attr_args ATTRIBUTE_UNUSED;
3423 tree decl ATTRIBUTE_UNUSED;
3424 tree type ATTRIBUTE_UNUSED;
3427 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3428 tree decl_attr_list = decl != 0 ? DECL_MACHINE_ATTRIBUTES (decl) : 0;
3430 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3431 tree type_attr_list = TYPE_ATTRIBUTES (type);
3434 if (TREE_CODE (attr_name) != IDENTIFIER_NODE)
3437 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3439 && VALID_MACHINE_DECL_ATTRIBUTE (decl, decl_attr_list, attr_name, attr_args))
3441 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3444 if (attr != NULL_TREE)
3446 /* Override existing arguments. Declarations are unique so we can
3447 modify this in place. */
3448 TREE_VALUE (attr) = attr_args;
3452 decl_attr_list = tree_cons (attr_name, attr_args, decl_attr_list);
3453 decl = build_decl_attribute_variant (decl, decl_attr_list);
3460 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3462 /* Don't apply the attribute to both the decl and the type. */;
3463 else if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name,
3466 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3469 if (attr != NULL_TREE)
3471 /* Override existing arguments.
3472 ??? This currently works since attribute arguments are not
3473 included in `attribute_hash_list'. Something more complicated
3474 may be needed in the future. */
3475 TREE_VALUE (attr) = attr_args;
3479 /* If this is part of a declaration, create a type variant,
3480 otherwise, this is part of a type definition, so add it
3481 to the base type. */
3482 type_attr_list = tree_cons (attr_name, attr_args, type_attr_list);
3484 type = build_type_attribute_variant (type, type_attr_list);
3486 TYPE_ATTRIBUTES (type) = type_attr_list;
3489 TREE_TYPE (decl) = type;
3493 /* Handle putting a type attribute on pointer-to-function-type by putting
3494 the attribute on the function type. */
3495 else if (POINTER_TYPE_P (type)
3496 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3497 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type), type_attr_list,
3498 attr_name, attr_args))
3500 tree inner_type = TREE_TYPE (type);
3501 tree inner_attr_list = TYPE_ATTRIBUTES (inner_type);
3502 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3505 if (attr != NULL_TREE)
3506 TREE_VALUE (attr) = attr_args;
3509 inner_attr_list = tree_cons (attr_name, attr_args, inner_attr_list);
3510 inner_type = build_type_attribute_variant (inner_type,
3515 TREE_TYPE (decl) = build_pointer_type (inner_type);
3518 /* Clear TYPE_POINTER_TO for the old inner type, since
3519 `type' won't be pointing to it anymore. */
3520 TYPE_POINTER_TO (TREE_TYPE (type)) = NULL_TREE;
3521 TREE_TYPE (type) = inner_type;
3531 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3534 We try both `text' and `__text__', ATTR may be either one. */
3535 /* ??? It might be a reasonable simplification to require ATTR to be only
3536 `text'. One might then also require attribute lists to be stored in
3537 their canonicalized form. */
3540 is_attribute_p (attr, ident)
3544 int ident_len, attr_len;
3547 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3550 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
3553 p = IDENTIFIER_POINTER (ident);
3554 ident_len = strlen (p);
3555 attr_len = strlen (attr);
3557 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3561 || attr[attr_len - 2] != '_'
3562 || attr[attr_len - 1] != '_')
3564 if (ident_len == attr_len - 4
3565 && strncmp (attr + 2, p, attr_len - 4) == 0)
3570 if (ident_len == attr_len + 4
3571 && p[0] == '_' && p[1] == '_'
3572 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3573 && strncmp (attr, p + 2, attr_len) == 0)
3580 /* Given an attribute name and a list of attributes, return a pointer to the
3581 attribute's list element if the attribute is part of the list, or NULL_TREE
3585 lookup_attribute (attr_name, list)
3586 const char *attr_name;
3591 for (l = list; l; l = TREE_CHAIN (l))
3593 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
3595 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
3602 /* Return an attribute list that is the union of a1 and a2. */
3605 merge_attributes (a1, a2)
3606 register tree a1, a2;
3610 /* Either one unset? Take the set one. */
3612 if (! (attributes = a1))
3615 /* One that completely contains the other? Take it. */
3617 else if (a2 && ! attribute_list_contained (a1, a2))
3619 if (attribute_list_contained (a2, a1))
3623 /* Pick the longest list, and hang on the other list. */
3624 /* ??? For the moment we punt on the issue of attrs with args. */
3626 if (list_length (a1) < list_length (a2))
3627 attributes = a2, a2 = a1;
3629 for (; a2; a2 = TREE_CHAIN (a2))
3630 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3631 attributes) == NULL_TREE)
3633 a1 = copy_node (a2);
3634 TREE_CHAIN (a1) = attributes;
3642 /* Given types T1 and T2, merge their attributes and return
3646 merge_machine_type_attributes (t1, t2)
3649 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3650 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1, t2);
3652 return merge_attributes (TYPE_ATTRIBUTES (t1),
3653 TYPE_ATTRIBUTES (t2));
3657 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3661 merge_machine_decl_attributes (olddecl, newdecl)
3662 tree olddecl, newdecl;
3664 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3665 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl, newdecl);
3667 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl),
3668 DECL_MACHINE_ATTRIBUTES (newdecl));
3672 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3673 of the various TYPE_QUAL values. */
3676 set_type_quals (type, type_quals)
3680 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3681 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3682 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3685 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
3686 the same kind of data as TYPE describes. Variants point to the
3687 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
3688 and it points to a chain of other variants so that duplicate
3689 variants are never made. Only main variants should ever appear as
3690 types of expressions. */
3693 build_qualified_type (type, type_quals)
3699 /* Search the chain of variants to see if there is already one there just
3700 like the one we need to have. If so, use that existing one. We must
3701 preserve the TYPE_NAME, since there is code that depends on this. */
3703 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3704 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
3707 /* We need a new one. */
3708 t = build_type_copy (type);
3709 set_type_quals (t, type_quals);
3713 /* Create a new variant of TYPE, equivalent but distinct.
3714 This is so the caller can modify it. */
3717 build_type_copy (type)
3720 register tree t, m = TYPE_MAIN_VARIANT (type);
3721 register struct obstack *ambient_obstack = current_obstack;
3723 current_obstack = TYPE_OBSTACK (type);
3724 t = copy_node (type);
3725 current_obstack = ambient_obstack;
3727 TYPE_POINTER_TO (t) = 0;
3728 TYPE_REFERENCE_TO (t) = 0;
3730 /* Add this type to the chain of variants of TYPE. */
3731 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3732 TYPE_NEXT_VARIANT (m) = t;
3737 /* Hashing of types so that we don't make duplicates.
3738 The entry point is `type_hash_canon'. */
3740 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3741 with types in the TREE_VALUE slots), by adding the hash codes
3742 of the individual types. */
3745 type_hash_list (list)
3748 register int hashcode;
3750 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3751 hashcode += TYPE_HASH (TREE_VALUE (tail));
3755 /* Look in the type hash table for a type isomorphic to TYPE.
3756 If one is found, return it. Otherwise return 0. */
3759 type_hash_lookup (hashcode, type)
3763 register struct type_hash *h;
3765 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3766 must call that routine before comparing TYPE_ALIGNs. */
3769 for (h = type_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next)
3770 if (h->hashcode == hashcode
3771 && TREE_CODE (h->type) == TREE_CODE (type)
3772 && TREE_TYPE (h->type) == TREE_TYPE (type)
3773 && attribute_list_equal (TYPE_ATTRIBUTES (h->type),
3774 TYPE_ATTRIBUTES (type))
3775 && TYPE_ALIGN (h->type) == TYPE_ALIGN (type)
3776 && (TYPE_MAX_VALUE (h->type) == TYPE_MAX_VALUE (type)
3777 || tree_int_cst_equal (TYPE_MAX_VALUE (h->type),
3778 TYPE_MAX_VALUE (type)))
3779 && (TYPE_MIN_VALUE (h->type) == TYPE_MIN_VALUE (type)
3780 || tree_int_cst_equal (TYPE_MIN_VALUE (h->type),
3781 TYPE_MIN_VALUE (type)))
3782 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3783 && (TYPE_DOMAIN (h->type) == TYPE_DOMAIN (type)
3784 || (TYPE_DOMAIN (h->type)
3785 && TREE_CODE (TYPE_DOMAIN (h->type)) == TREE_LIST
3786 && TYPE_DOMAIN (type)
3787 && TREE_CODE (TYPE_DOMAIN (type)) == TREE_LIST
3788 && type_list_equal (TYPE_DOMAIN (h->type),
3789 TYPE_DOMAIN (type)))))
3794 /* Add an entry to the type-hash-table
3795 for a type TYPE whose hash code is HASHCODE. */
3798 type_hash_add (hashcode, type)
3802 register struct type_hash *h;
3804 h = (struct type_hash *) permalloc (sizeof (struct type_hash));
3805 h->hashcode = hashcode;
3807 h->next = type_hash_table[hashcode % TYPE_HASH_SIZE];
3808 type_hash_table[hashcode % TYPE_HASH_SIZE] = h;
3811 /* Given TYPE, and HASHCODE its hash code, return the canonical
3812 object for an identical type if one already exists.
3813 Otherwise, return TYPE, and record it as the canonical object
3814 if it is a permanent object.
3816 To use this function, first create a type of the sort you want.
3817 Then compute its hash code from the fields of the type that
3818 make it different from other similar types.
3819 Then call this function and use the value.
3820 This function frees the type you pass in if it is a duplicate. */
3822 /* Set to 1 to debug without canonicalization. Never set by program. */
3823 int debug_no_type_hash = 0;
3826 type_hash_canon (hashcode, type)
3832 if (debug_no_type_hash)
3835 t1 = type_hash_lookup (hashcode, type);
3839 obstack_free (TYPE_OBSTACK (type), type);
3840 #ifdef GATHER_STATISTICS
3841 tree_node_counts[(int)t_kind]--;
3842 tree_node_sizes[(int)t_kind] -= sizeof (struct tree_type);
3847 /* If this is a permanent type, record it for later reuse. */
3848 if (ggc_p || TREE_PERMANENT (type))
3849 type_hash_add (hashcode, type);
3854 /* Mark ARG (which is really a struct type_hash **) for GC. */
3857 mark_type_hash (arg)
3860 struct type_hash *t = *(struct type_hash **) arg;
3864 ggc_mark_tree (t->type);
3869 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3870 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3871 by adding the hash codes of the individual attributes. */
3874 attribute_hash_list (list)
3877 register int hashcode;
3879 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3880 /* ??? Do we want to add in TREE_VALUE too? */
3881 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3885 /* Given two lists of attributes, return true if list l2 is
3886 equivalent to l1. */
3889 attribute_list_equal (l1, l2)
3892 return attribute_list_contained (l1, l2)
3893 && attribute_list_contained (l2, l1);
3896 /* Given two lists of attributes, return true if list L2 is
3897 completely contained within L1. */
3898 /* ??? This would be faster if attribute names were stored in a canonicalized
3899 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3900 must be used to show these elements are equivalent (which they are). */
3901 /* ??? It's not clear that attributes with arguments will always be handled
3905 attribute_list_contained (l1, l2)
3908 register tree t1, t2;
3910 /* First check the obvious, maybe the lists are identical. */
3914 /* Maybe the lists are similar. */
3915 for (t1 = l1, t2 = l2;
3917 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3918 && TREE_VALUE (t1) == TREE_VALUE (t2);
3919 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3921 /* Maybe the lists are equal. */
3922 if (t1 == 0 && t2 == 0)
3925 for (; t2; t2 = TREE_CHAIN (t2))
3928 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3930 if (attr == NULL_TREE)
3932 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3939 /* Given two lists of types
3940 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3941 return 1 if the lists contain the same types in the same order.
3942 Also, the TREE_PURPOSEs must match. */
3945 type_list_equal (l1, l2)
3948 register tree t1, t2;
3950 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3951 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3952 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3953 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3954 && (TREE_TYPE (TREE_PURPOSE (t1))
3955 == TREE_TYPE (TREE_PURPOSE (t2))))))
3961 /* Nonzero if integer constants T1 and T2
3962 represent the same constant value. */
3965 tree_int_cst_equal (t1, t2)
3970 if (t1 == 0 || t2 == 0)
3972 if (TREE_CODE (t1) == INTEGER_CST
3973 && TREE_CODE (t2) == INTEGER_CST
3974 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3975 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3980 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3981 The precise way of comparison depends on their data type. */
3984 tree_int_cst_lt (t1, t2)
3990 if (!TREE_UNSIGNED (TREE_TYPE (t1)))
3991 return INT_CST_LT (t1, t2);
3992 return INT_CST_LT_UNSIGNED (t1, t2);
3995 /* Return an indication of the sign of the integer constant T.
3996 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3997 Note that -1 will never be returned it T's type is unsigned. */
4000 tree_int_cst_sgn (t)
4003 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4005 else if (TREE_UNSIGNED (TREE_TYPE (t)))
4007 else if (TREE_INT_CST_HIGH (t) < 0)
4013 /* Compare two constructor-element-type constants. Return 1 if the lists
4014 are known to be equal; otherwise return 0. */
4017 simple_cst_list_equal (l1, l2)
4020 while (l1 != NULL_TREE && l2 != NULL_TREE)
4022 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4025 l1 = TREE_CHAIN (l1);
4026 l2 = TREE_CHAIN (l2);
4032 /* Return truthvalue of whether T1 is the same tree structure as T2.
4033 Return 1 if they are the same.
4034 Return 0 if they are understandably different.
4035 Return -1 if either contains tree structure not understood by
4039 simple_cst_equal (t1, t2)
4042 register enum tree_code code1, code2;
4047 if (t1 == 0 || t2 == 0)
4050 code1 = TREE_CODE (t1);
4051 code2 = TREE_CODE (t2);
4053 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4055 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4056 || code2 == NON_LVALUE_EXPR)
4057 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4059 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4061 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4062 || code2 == NON_LVALUE_EXPR)
4063 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4071 return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4072 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2);
4075 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4078 return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4079 && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4080 TREE_STRING_LENGTH (t1));
4083 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
4089 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4092 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4095 return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4098 /* Special case: if either target is an unallocated VAR_DECL,
4099 it means that it's going to be unified with whatever the
4100 TARGET_EXPR is really supposed to initialize, so treat it
4101 as being equivalent to anything. */
4102 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4103 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4104 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
4105 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4106 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4107 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
4110 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4113 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4115 case WITH_CLEANUP_EXPR:
4116 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4119 return simple_cst_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
4122 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4123 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4136 /* This general rule works for most tree codes. All exceptions should be
4137 handled above. If this is a language-specific tree code, we can't
4138 trust what might be in the operand, so say we don't know
4140 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4143 switch (TREE_CODE_CLASS (code1))
4153 for (i=0; i<tree_code_length[(int) code1]; ++i)
4155 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4166 /* Constructors for pointer, array and function types.
4167 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4168 constructed by language-dependent code, not here.) */
4170 /* Construct, lay out and return the type of pointers to TO_TYPE.
4171 If such a type has already been constructed, reuse it. */
4174 build_pointer_type (to_type)
4177 register tree t = TYPE_POINTER_TO (to_type);
4179 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4184 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4185 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
4186 t = make_node (POINTER_TYPE);
4189 TREE_TYPE (t) = to_type;
4191 /* Record this type as the pointer to TO_TYPE. */
4192 TYPE_POINTER_TO (to_type) = t;
4194 /* Lay out the type. This function has many callers that are concerned
4195 with expression-construction, and this simplifies them all.
4196 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4202 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4203 MAXVAL should be the maximum value in the domain
4204 (one less than the length of the array).
4206 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4207 We don't enforce this limit, that is up to caller (e.g. language front end).
4208 The limit exists because the result is a signed type and we don't handle
4209 sizes that use more than one HOST_WIDE_INT. */
4212 build_index_type (maxval)
4215 register tree itype = make_node (INTEGER_TYPE);
4217 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4218 TYPE_MIN_VALUE (itype) = size_zero_node;
4220 push_obstacks (TYPE_OBSTACK (itype), TYPE_OBSTACK (itype));
4221 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4224 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4225 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4226 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4227 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4228 if (TREE_CODE (maxval) == INTEGER_CST)
4230 int maxint = (int) TREE_INT_CST_LOW (maxval);
4231 /* If the domain should be empty, make sure the maxval
4232 remains -1 and is not spoiled by truncation. */
4233 if (INT_CST_LT (maxval, integer_zero_node))
4235 TYPE_MAX_VALUE (itype) = build_int_2 (-1, -1);
4236 TREE_TYPE (TYPE_MAX_VALUE (itype)) = sizetype;
4238 return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype);
4244 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4245 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4246 low bound LOWVAL and high bound HIGHVAL.
4247 if TYPE==NULL_TREE, sizetype is used. */
4250 build_range_type (type, lowval, highval)
4251 tree type, lowval, highval;
4253 register tree itype = make_node (INTEGER_TYPE);
4255 TREE_TYPE (itype) = type;
4256 if (type == NULL_TREE)
4259 push_obstacks (TYPE_OBSTACK (itype), TYPE_OBSTACK (itype));
4260 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4261 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4264 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4265 TYPE_MODE (itype) = TYPE_MODE (type);
4266 TYPE_SIZE (itype) = TYPE_SIZE (type);
4267 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4268 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4269 if (TREE_CODE (lowval) == INTEGER_CST)
4271 HOST_WIDE_INT lowint, highint;
4274 lowint = TREE_INT_CST_LOW (lowval);
4275 if (highval && TREE_CODE (highval) == INTEGER_CST)
4276 highint = TREE_INT_CST_LOW (highval);
4278 highint = (~(unsigned HOST_WIDE_INT)0) >> 1;
4280 maxint = (int) (highint - lowint);
4281 return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype);
4287 /* Just like build_index_type, but takes lowval and highval instead
4288 of just highval (maxval). */
4291 build_index_2_type (lowval,highval)
4292 tree lowval, highval;
4294 return build_range_type (NULL_TREE, lowval, highval);
4297 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4298 Needed because when index types are not hashed, equal index types
4299 built at different times appear distinct, even though structurally,
4303 index_type_equal (itype1, itype2)
4304 tree itype1, itype2;
4306 if (TREE_CODE (itype1) != TREE_CODE (itype2))
4308 if (TREE_CODE (itype1) == INTEGER_TYPE)
4310 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
4311 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
4312 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
4313 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
4315 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
4316 TYPE_MIN_VALUE (itype2))
4317 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
4318 TYPE_MAX_VALUE (itype2)))
4325 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4326 and number of elements specified by the range of values of INDEX_TYPE.
4327 If such a type has already been constructed, reuse it. */
4330 build_array_type (elt_type, index_type)
4331 tree elt_type, index_type;
4336 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4338 error ("arrays of functions are not meaningful");
4339 elt_type = integer_type_node;
4342 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4343 build_pointer_type (elt_type);
4345 /* Allocate the array after the pointer type,
4346 in case we free it in type_hash_canon. */
4347 t = make_node (ARRAY_TYPE);
4348 TREE_TYPE (t) = elt_type;
4349 TYPE_DOMAIN (t) = index_type;
4351 if (index_type == 0)
4356 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
4357 t = type_hash_canon (hashcode, t);
4359 if (TYPE_SIZE (t) == 0)
4364 /* Return the TYPE of the elements comprising
4365 the innermost dimension of ARRAY. */
4368 get_inner_array_type (array)
4371 tree type = TREE_TYPE (array);
4373 while (TREE_CODE (type) == ARRAY_TYPE)
4374 type = TREE_TYPE (type);
4379 /* Construct, lay out and return
4380 the type of functions returning type VALUE_TYPE
4381 given arguments of types ARG_TYPES.
4382 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4383 are data type nodes for the arguments of the function.
4384 If such a type has already been constructed, reuse it. */
4387 build_function_type (value_type, arg_types)
4388 tree value_type, arg_types;
4393 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4395 error ("function return type cannot be function");
4396 value_type = integer_type_node;
4399 /* Make a node of the sort we want. */
4400 t = make_node (FUNCTION_TYPE);
4401 TREE_TYPE (t) = value_type;
4402 TYPE_ARG_TYPES (t) = arg_types;
4404 /* If we already have such a type, use the old one and free this one. */
4405 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
4406 t = type_hash_canon (hashcode, t);
4408 if (TYPE_SIZE (t) == 0)
4413 /* Build the node for the type of references-to-TO_TYPE. */
4416 build_reference_type (to_type)
4419 register tree t = TYPE_REFERENCE_TO (to_type);
4421 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4426 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4427 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
4428 t = make_node (REFERENCE_TYPE);
4431 TREE_TYPE (t) = to_type;
4433 /* Record this type as the pointer to TO_TYPE. */
4434 TYPE_REFERENCE_TO (to_type) = t;
4441 /* Construct, lay out and return the type of methods belonging to class
4442 BASETYPE and whose arguments and values are described by TYPE.
4443 If that type exists already, reuse it.
4444 TYPE must be a FUNCTION_TYPE node. */
4447 build_method_type (basetype, type)
4448 tree basetype, type;
4453 /* Make a node of the sort we want. */
4454 t = make_node (METHOD_TYPE);
4456 if (TREE_CODE (type) != FUNCTION_TYPE)
4459 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4460 TREE_TYPE (t) = TREE_TYPE (type);
4462 /* The actual arglist for this function includes a "hidden" argument
4463 which is "this". Put it into the list of argument types. */
4466 = tree_cons (NULL_TREE,
4467 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
4469 /* If we already have such a type, use the old one and free this one. */
4470 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4471 t = type_hash_canon (hashcode, t);
4473 if (TYPE_SIZE (t) == 0)
4479 /* Construct, lay out and return the type of offsets to a value
4480 of type TYPE, within an object of type BASETYPE.
4481 If a suitable offset type exists already, reuse it. */
4484 build_offset_type (basetype, type)
4485 tree basetype, type;
4490 /* Make a node of the sort we want. */
4491 t = make_node (OFFSET_TYPE);
4493 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4494 TREE_TYPE (t) = type;
4496 /* If we already have such a type, use the old one and free this one. */
4497 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4498 t = type_hash_canon (hashcode, t);
4500 if (TYPE_SIZE (t) == 0)
4506 /* Create a complex type whose components are COMPONENT_TYPE. */
4509 build_complex_type (component_type)
4510 tree component_type;
4515 /* Make a node of the sort we want. */
4516 t = make_node (COMPLEX_TYPE);
4518 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4519 set_type_quals (t, TYPE_QUALS (component_type));
4521 /* If we already have such a type, use the old one and free this one. */
4522 hashcode = TYPE_HASH (component_type);
4523 t = type_hash_canon (hashcode, t);
4525 if (TYPE_SIZE (t) == 0)
4528 /* If we are writing Dwarf2 output we need to create a name,
4529 since complex is a fundamental type. */
4530 if (write_symbols == DWARF2_DEBUG && ! TYPE_NAME (t))
4533 if (component_type == char_type_node)
4534 name = "complex char";
4535 else if (component_type == signed_char_type_node)
4536 name = "complex signed char";
4537 else if (component_type == unsigned_char_type_node)
4538 name = "complex unsigned char";
4539 else if (component_type == short_integer_type_node)
4540 name = "complex short int";
4541 else if (component_type == short_unsigned_type_node)
4542 name = "complex short unsigned int";
4543 else if (component_type == integer_type_node)
4544 name = "complex int";
4545 else if (component_type == unsigned_type_node)
4546 name = "complex unsigned int";
4547 else if (component_type == long_integer_type_node)
4548 name = "complex long int";
4549 else if (component_type == long_unsigned_type_node)
4550 name = "complex long unsigned int";
4551 else if (component_type == long_long_integer_type_node)
4552 name = "complex long long int";
4553 else if (component_type == long_long_unsigned_type_node)
4554 name = "complex long long unsigned int";
4559 TYPE_NAME (t) = get_identifier (name);
4565 /* Return OP, stripped of any conversions to wider types as much as is safe.
4566 Converting the value back to OP's type makes a value equivalent to OP.
4568 If FOR_TYPE is nonzero, we return a value which, if converted to
4569 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4571 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4572 narrowest type that can hold the value, even if they don't exactly fit.
4573 Otherwise, bit-field references are changed to a narrower type
4574 only if they can be fetched directly from memory in that type.
4576 OP must have integer, real or enumeral type. Pointers are not allowed!
4578 There are some cases where the obvious value we could return
4579 would regenerate to OP if converted to OP's type,
4580 but would not extend like OP to wider types.
4581 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4582 For example, if OP is (unsigned short)(signed char)-1,
4583 we avoid returning (signed char)-1 if FOR_TYPE is int,
4584 even though extending that to an unsigned short would regenerate OP,
4585 since the result of extending (signed char)-1 to (int)
4586 is different from (int) OP. */
4589 get_unwidened (op, for_type)
4593 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4594 register tree type = TREE_TYPE (op);
4595 register unsigned final_prec
4596 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4598 = (for_type != 0 && for_type != type
4599 && final_prec > TYPE_PRECISION (type)
4600 && TREE_UNSIGNED (type));
4601 register tree win = op;
4603 while (TREE_CODE (op) == NOP_EXPR)
4605 register int bitschange
4606 = TYPE_PRECISION (TREE_TYPE (op))
4607 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4609 /* Truncations are many-one so cannot be removed.
4610 Unless we are later going to truncate down even farther. */
4612 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4615 /* See what's inside this conversion. If we decide to strip it,
4617 op = TREE_OPERAND (op, 0);
4619 /* If we have not stripped any zero-extensions (uns is 0),
4620 we can strip any kind of extension.
4621 If we have previously stripped a zero-extension,
4622 only zero-extensions can safely be stripped.
4623 Any extension can be stripped if the bits it would produce
4624 are all going to be discarded later by truncating to FOR_TYPE. */
4628 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4630 /* TREE_UNSIGNED says whether this is a zero-extension.
4631 Let's avoid computing it if it does not affect WIN
4632 and if UNS will not be needed again. */
4633 if ((uns || TREE_CODE (op) == NOP_EXPR)
4634 && TREE_UNSIGNED (TREE_TYPE (op)))
4642 if (TREE_CODE (op) == COMPONENT_REF
4643 /* Since type_for_size always gives an integer type. */
4644 && TREE_CODE (type) != REAL_TYPE
4645 /* Don't crash if field not laid out yet. */
4646 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4648 unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
4649 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
4651 /* We can get this structure field in the narrowest type it fits in.
4652 If FOR_TYPE is 0, do this only for a field that matches the
4653 narrower type exactly and is aligned for it
4654 The resulting extension to its nominal type (a fullword type)
4655 must fit the same conditions as for other extensions. */
4657 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4658 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4659 && (! uns || final_prec <= innerprec
4660 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4663 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4664 TREE_OPERAND (op, 1));
4665 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4666 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4667 TREE_RAISES (win) = TREE_RAISES (op);
4673 /* Return OP or a simpler expression for a narrower value
4674 which can be sign-extended or zero-extended to give back OP.
4675 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4676 or 0 if the value should be sign-extended. */
4679 get_narrower (op, unsignedp_ptr)
4683 register int uns = 0;
4685 register tree win = op;
4687 while (TREE_CODE (op) == NOP_EXPR)
4689 register int bitschange
4690 = TYPE_PRECISION (TREE_TYPE (op))
4691 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4693 /* Truncations are many-one so cannot be removed. */
4697 /* See what's inside this conversion. If we decide to strip it,
4699 op = TREE_OPERAND (op, 0);
4703 /* An extension: the outermost one can be stripped,
4704 but remember whether it is zero or sign extension. */
4706 uns = TREE_UNSIGNED (TREE_TYPE (op));
4707 /* Otherwise, if a sign extension has been stripped,
4708 only sign extensions can now be stripped;
4709 if a zero extension has been stripped, only zero-extensions. */
4710 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4714 else /* bitschange == 0 */
4716 /* A change in nominal type can always be stripped, but we must
4717 preserve the unsignedness. */
4719 uns = TREE_UNSIGNED (TREE_TYPE (op));
4726 if (TREE_CODE (op) == COMPONENT_REF
4727 /* Since type_for_size always gives an integer type. */
4728 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE)
4730 unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
4731 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
4733 /* We can get this structure field in a narrower type that fits it,
4734 but the resulting extension to its nominal type (a fullword type)
4735 must satisfy the same conditions as for other extensions.
4737 Do this only for fields that are aligned (not bit-fields),
4738 because when bit-field insns will be used there is no
4739 advantage in doing this. */
4741 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4742 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4743 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4747 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4748 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4749 TREE_OPERAND (op, 1));
4750 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4751 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4752 TREE_RAISES (win) = TREE_RAISES (op);
4755 *unsignedp_ptr = uns;
4759 /* Nonzero if integer constant C has a value that is permissible
4760 for type TYPE (an INTEGER_TYPE). */
4763 int_fits_type_p (c, type)
4766 if (TREE_UNSIGNED (type))
4767 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4768 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c))
4769 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
4770 && INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type)))
4771 /* Negative ints never fit unsigned types. */
4772 && ! (TREE_INT_CST_HIGH (c) < 0
4773 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4775 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4776 && INT_CST_LT (TYPE_MAX_VALUE (type), c))
4777 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
4778 && INT_CST_LT (c, TYPE_MIN_VALUE (type)))
4779 /* Unsigned ints with top bit set never fit signed types. */
4780 && ! (TREE_INT_CST_HIGH (c) < 0
4781 && TREE_UNSIGNED (TREE_TYPE (c))));
4784 /* Return the innermost context enclosing DECL that is
4785 a FUNCTION_DECL, or zero if none. */
4788 decl_function_context (decl)
4793 if (TREE_CODE (decl) == ERROR_MARK)
4796 if (TREE_CODE (decl) == SAVE_EXPR)
4797 context = SAVE_EXPR_CONTEXT (decl);
4799 context = DECL_CONTEXT (decl);
4801 while (context && TREE_CODE (context) != FUNCTION_DECL)
4803 if (TREE_CODE_CLASS (TREE_CODE (context)) == 't')
4804 context = TYPE_CONTEXT (context);
4805 else if (TREE_CODE_CLASS (TREE_CODE (context)) == 'd')
4806 context = DECL_CONTEXT (context);
4807 else if (TREE_CODE (context) == BLOCK)
4808 context = BLOCK_SUPERCONTEXT (context);
4810 /* Unhandled CONTEXT !? */
4817 /* Return the innermost context enclosing DECL that is
4818 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4819 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4822 decl_type_context (decl)
4825 tree context = DECL_CONTEXT (decl);
4829 if (TREE_CODE (context) == RECORD_TYPE
4830 || TREE_CODE (context) == UNION_TYPE
4831 || TREE_CODE (context) == QUAL_UNION_TYPE)
4833 if (TREE_CODE (context) == TYPE_DECL
4834 || TREE_CODE (context) == FUNCTION_DECL)
4835 context = DECL_CONTEXT (context);
4836 else if (TREE_CODE (context) == BLOCK)
4837 context = BLOCK_SUPERCONTEXT (context);
4839 /* Unhandled CONTEXT!? */
4845 /* Print debugging information about the obstack O, named STR. */
4848 print_obstack_statistics (str, o)
4852 struct _obstack_chunk *chunk = o->chunk;
4856 n_alloc += o->next_free - chunk->contents;
4857 chunk = chunk->prev;
4861 n_alloc += chunk->limit - &chunk->contents[0];
4862 chunk = chunk->prev;
4864 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
4865 str, n_alloc, n_chunks);
4868 /* Print debugging information about tree nodes generated during the compile,
4869 and any language-specific information. */
4872 dump_tree_statistics ()
4874 #ifdef GATHER_STATISTICS
4876 int total_nodes, total_bytes;
4879 fprintf (stderr, "\n??? tree nodes created\n\n");
4880 #ifdef GATHER_STATISTICS
4881 fprintf (stderr, "Kind Nodes Bytes\n");
4882 fprintf (stderr, "-------------------------------------\n");
4883 total_nodes = total_bytes = 0;
4884 for (i = 0; i < (int) all_kinds; i++)
4886 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4887 tree_node_counts[i], tree_node_sizes[i]);
4888 total_nodes += tree_node_counts[i];
4889 total_bytes += tree_node_sizes[i];
4891 fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size);
4892 fprintf (stderr, "-------------------------------------\n");
4893 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4894 fprintf (stderr, "-------------------------------------\n");
4896 fprintf (stderr, "(No per-node statistics)\n");
4898 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
4899 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack);
4900 print_obstack_statistics ("temporary_obstack", &temporary_obstack);
4901 print_obstack_statistics ("momentary_obstack", &momentary_obstack);
4902 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack);
4903 print_lang_statistics ();
4906 #define FILE_FUNCTION_PREFIX_LEN 9
4908 #ifndef NO_DOLLAR_IN_LABEL
4909 #define FILE_FUNCTION_FORMAT "_GLOBAL_$%s$%s"
4910 #else /* NO_DOLLAR_IN_LABEL */
4911 #ifndef NO_DOT_IN_LABEL
4912 #define FILE_FUNCTION_FORMAT "_GLOBAL_.%s.%s"
4913 #else /* NO_DOT_IN_LABEL */
4914 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4915 #endif /* NO_DOT_IN_LABEL */
4916 #endif /* NO_DOLLAR_IN_LABEL */
4918 extern char * first_global_object_name;
4919 extern char * weak_global_object_name;
4921 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4922 clashes in cases where we can't reliably choose a unique name.
4924 Derived from mkstemp.c in libiberty. */
4927 append_random_chars (template)
4930 static const char letters[]
4931 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4932 static unsigned HOST_WIDE_INT value;
4933 unsigned HOST_WIDE_INT v;
4935 #ifdef HAVE_GETTIMEOFDAY
4939 template += strlen (template);
4941 #ifdef HAVE_GETTIMEOFDAY
4942 /* Get some more or less random data. */
4943 gettimeofday (&tv, NULL);
4944 value += ((unsigned HOST_WIDE_INT) tv.tv_usec << 16) ^ tv.tv_sec ^ getpid ();
4951 /* Fill in the random bits. */
4952 template[0] = letters[v % 62];
4954 template[1] = letters[v % 62];
4956 template[2] = letters[v % 62];
4958 template[3] = letters[v % 62];
4960 template[4] = letters[v % 62];
4962 template[5] = letters[v % 62];
4967 /* Generate a name for a function unique to this translation unit.
4968 TYPE is some string to identify the purpose of this function to the
4969 linker or collect2. */
4972 get_file_function_name_long (type)
4978 if (first_global_object_name)
4979 p = first_global_object_name;
4982 /* We don't have anything that we know to be unique to this translation
4983 unit, so use what we do have and throw in some randomness. */
4985 const char *name = weak_global_object_name;
4986 const char *file = main_input_filename;
4991 file = input_filename;
4993 p = (char *) alloca (7 + strlen (name) + strlen (file));
4995 sprintf (p, "%s%s", name, file);
4996 append_random_chars (p);
4999 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
5002 /* Set up the name of the file-level functions we may need. */
5003 /* Use a global object (which is already required to be unique over
5004 the program) rather than the file name (which imposes extra
5005 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
5006 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5008 /* Don't need to pull weird characters out of global names. */
5009 if (p != first_global_object_name)
5011 for (p = buf+11; *p; p++)
5013 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
5014 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
5018 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5021 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5029 return get_identifier (buf);
5032 /* If KIND=='I', return a suitable global initializer (constructor) name.
5033 If KIND=='D', return a suitable global clean-up (destructor) name. */
5036 get_file_function_name (kind)
5043 return get_file_function_name_long (p);
5047 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5048 The result is placed in BUFFER (which has length BIT_SIZE),
5049 with one bit in each char ('\000' or '\001').
5051 If the constructor is constant, NULL_TREE is returned.
5052 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5055 get_set_constructor_bits (init, buffer, bit_size)
5062 HOST_WIDE_INT domain_min
5063 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))));
5064 tree non_const_bits = NULL_TREE;
5065 for (i = 0; i < bit_size; i++)
5068 for (vals = TREE_OPERAND (init, 1);
5069 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5071 if (TREE_CODE (TREE_VALUE (vals)) != INTEGER_CST
5072 || (TREE_PURPOSE (vals) != NULL_TREE
5073 && TREE_CODE (TREE_PURPOSE (vals)) != INTEGER_CST))
5075 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5076 else if (TREE_PURPOSE (vals) != NULL_TREE)
5078 /* Set a range of bits to ones. */
5079 HOST_WIDE_INT lo_index
5080 = TREE_INT_CST_LOW (TREE_PURPOSE (vals)) - domain_min;
5081 HOST_WIDE_INT hi_index
5082 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
5083 if (lo_index < 0 || lo_index >= bit_size
5084 || hi_index < 0 || hi_index >= bit_size)
5086 for ( ; lo_index <= hi_index; lo_index++)
5087 buffer[lo_index] = 1;
5091 /* Set a single bit to one. */
5093 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
5094 if (index < 0 || index >= bit_size)
5096 error ("invalid initializer for bit string");
5102 return non_const_bits;
5105 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5106 The result is placed in BUFFER (which is an array of bytes).
5107 If the constructor is constant, NULL_TREE is returned.
5108 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5111 get_set_constructor_bytes (init, buffer, wd_size)
5113 unsigned char *buffer;
5117 int set_word_size = BITS_PER_UNIT;
5118 int bit_size = wd_size * set_word_size;
5120 unsigned char *bytep = buffer;
5121 char *bit_buffer = (char *) alloca(bit_size);
5122 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5124 for (i = 0; i < wd_size; i++)
5127 for (i = 0; i < bit_size; i++)
5131 if (BYTES_BIG_ENDIAN)
5132 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5134 *bytep |= 1 << bit_pos;
5137 if (bit_pos >= set_word_size)
5138 bit_pos = 0, bytep++;
5140 return non_const_bits;
5143 #if defined ENABLE_CHECKING && (__GNUC__ > 2 || __GNUC_MINOR__ > 6)
5144 /* Complain that the tree code of NODE does not match the expected CODE.
5145 FILE, LINE, and FUNCTION are of the caller. */
5147 tree_check_failed (node, code, file, line, function)
5149 enum tree_code code;
5152 const char *function;
5154 error ("Tree check: expected %s, have %s",
5155 tree_code_name[code], tree_code_name[TREE_CODE (node)]);
5156 fancy_abort (file, line, function);
5159 /* Similar to above, except that we check for a class of tree
5160 code, given in CL. */
5162 tree_class_check_failed (node, cl, file, line, function)
5167 const char *function;
5169 error ("Tree check: expected class '%c', have '%c' (%s)",
5170 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5171 tree_code_name[TREE_CODE (node)]);
5172 fancy_abort (file, line, function);
5175 #endif /* ENABLE_CHECKING */
5177 /* Return the alias set for T, which may be either a type or an
5184 if (!flag_strict_aliasing || !lang_get_alias_set)
5185 /* If we're not doing any lanaguage-specific alias analysis, just
5186 assume everything aliases everything else. */
5189 return (*lang_get_alias_set) (t);
5192 /* Return a brand-new alias set. */
5197 static int last_alias_set;
5198 if (flag_strict_aliasing)
5199 return ++last_alias_set;
5204 #ifndef CHAR_TYPE_SIZE
5205 #define CHAR_TYPE_SIZE BITS_PER_UNIT
5208 #ifndef SHORT_TYPE_SIZE
5209 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
5212 #ifndef INT_TYPE_SIZE
5213 #define INT_TYPE_SIZE BITS_PER_WORD
5216 #ifndef LONG_TYPE_SIZE
5217 #define LONG_TYPE_SIZE BITS_PER_WORD
5220 #ifndef LONG_LONG_TYPE_SIZE
5221 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
5224 #ifndef FLOAT_TYPE_SIZE
5225 #define FLOAT_TYPE_SIZE BITS_PER_WORD
5228 #ifndef DOUBLE_TYPE_SIZE
5229 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5232 #ifndef LONG_DOUBLE_TYPE_SIZE
5233 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5236 /* Create nodes for all integer types (and error_mark_node) using the sizes
5237 of C datatypes. The caller should call set_sizetype soon after calling
5238 this function to select one of the types as sizetype. */
5241 build_common_tree_nodes (signed_char)
5244 error_mark_node = make_node (ERROR_MARK);
5245 TREE_TYPE (error_mark_node) = error_mark_node;
5247 /* Define both `signed char' and `unsigned char'. */
5248 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5249 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5251 /* Define `char', which is like either `signed char' or `unsigned char'
5252 but not the same as either. */
5255 ? make_signed_type (CHAR_TYPE_SIZE)
5256 : make_unsigned_type (CHAR_TYPE_SIZE));
5258 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5259 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5260 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5261 /* Define an unsigned integer first. make_unsigned_type and make_signed_type
5262 both call set_sizetype for the first type that we create, and we want this
5263 to be large enough to hold the sizes of various types until we switch to
5264 the real sizetype. */
5265 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5266 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5267 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5268 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5269 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5271 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
5272 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
5273 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
5274 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
5275 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
5277 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
5278 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
5279 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
5280 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
5281 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
5284 /* For type TYPE, fill in the proper type for TYPE_SIZE and
5290 TREE_TYPE (TYPE_SIZE (type)) = bitsizetype;
5291 TREE_TYPE (TYPE_SIZE_UNIT (type)) = sizetype;
5294 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5295 It will fix the previously made nodes to have proper references to
5296 sizetype, and it will create several other common tree nodes. */
5298 build_common_tree_nodes_2 (short_double)
5301 fix_sizetype (signed_char_type_node);
5302 fix_sizetype (unsigned_char_type_node);
5303 fix_sizetype (char_type_node);
5304 fix_sizetype (short_integer_type_node);
5305 fix_sizetype (short_unsigned_type_node);
5306 fix_sizetype (integer_type_node);
5307 fix_sizetype (unsigned_type_node);
5308 fix_sizetype (long_unsigned_type_node);
5309 fix_sizetype (long_integer_type_node);
5310 fix_sizetype (long_long_integer_type_node);
5311 fix_sizetype (long_long_unsigned_type_node);
5313 fix_sizetype (intQI_type_node);
5314 fix_sizetype (intHI_type_node);
5315 fix_sizetype (intSI_type_node);
5316 fix_sizetype (intDI_type_node);
5317 fix_sizetype (intTI_type_node);
5318 fix_sizetype (unsigned_intQI_type_node);
5319 fix_sizetype (unsigned_intHI_type_node);
5320 fix_sizetype (unsigned_intSI_type_node);
5321 fix_sizetype (unsigned_intDI_type_node);
5322 fix_sizetype (unsigned_intTI_type_node);
5324 integer_zero_node = build_int_2 (0, 0);
5325 TREE_TYPE (integer_zero_node) = integer_type_node;
5326 integer_one_node = build_int_2 (1, 0);
5327 TREE_TYPE (integer_one_node) = integer_type_node;
5329 size_zero_node = build_int_2 (0, 0);
5330 TREE_TYPE (size_zero_node) = sizetype;
5331 size_one_node = build_int_2 (1, 0);
5332 TREE_TYPE (size_one_node) = sizetype;
5334 void_type_node = make_node (VOID_TYPE);
5335 layout_type (void_type_node); /* Uses size_zero_node */
5336 /* We are not going to have real types in C with less than byte alignment,
5337 so we might as well not have any types that claim to have it. */
5338 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5340 null_pointer_node = build_int_2 (0, 0);
5341 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5342 layout_type (TREE_TYPE (null_pointer_node));
5344 ptr_type_node = build_pointer_type (void_type_node);
5346 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5348 float_type_node = make_node (REAL_TYPE);
5349 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5350 layout_type (float_type_node);
5352 double_type_node = make_node (REAL_TYPE);
5354 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5356 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5357 layout_type (double_type_node);
5359 long_double_type_node = make_node (REAL_TYPE);
5360 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5361 layout_type (long_double_type_node);
5363 complex_integer_type_node = make_node (COMPLEX_TYPE);
5364 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5365 layout_type (complex_integer_type_node);
5367 complex_float_type_node = make_node (COMPLEX_TYPE);
5368 TREE_TYPE (complex_float_type_node) = float_type_node;
5369 layout_type (complex_float_type_node);
5371 complex_double_type_node = make_node (COMPLEX_TYPE);
5372 TREE_TYPE (complex_double_type_node) = double_type_node;
5373 layout_type (complex_double_type_node);
5375 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5376 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5377 layout_type (complex_long_double_type_node);
5379 #ifdef BUILD_VA_LIST_TYPE
5380 BUILD_VA_LIST_TYPE(va_list_type_node);
5382 va_list_type_node = ptr_type_node;