1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 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. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
50 /* obstack.[ch] explicitly declined to prototype this. */
51 extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj));
53 static void unsave_expr_now_r PARAMS ((tree));
55 /* Tree nodes of permanent duration are allocated in this obstack.
56 They are the identifier nodes, and everything outside of
57 the bodies and parameters of function definitions. */
59 struct obstack permanent_obstack;
61 /* The initial RTL, and all ..._TYPE nodes, in a function
62 are allocated in this obstack. Usually they are freed at the
63 end of the function, but if the function is inline they are saved.
64 For top-level functions, this is maybepermanent_obstack.
65 Separate obstacks are made for nested functions. */
67 struct obstack *function_maybepermanent_obstack;
69 /* This is the function_maybepermanent_obstack for top-level functions. */
71 struct obstack maybepermanent_obstack;
73 /* The contents of the current function definition are allocated
74 in this obstack, and all are freed at the end of the function.
75 For top-level functions, this is temporary_obstack.
76 Separate obstacks are made for nested functions. */
78 struct obstack *function_obstack;
80 /* This is used for reading initializers of global variables. */
82 struct obstack temporary_obstack;
84 /* The tree nodes of an expression are allocated
85 in this obstack, and all are freed at the end of the expression. */
87 struct obstack momentary_obstack;
89 /* The tree nodes of a declarator are allocated
90 in this obstack, and all are freed when the declarator
93 static struct obstack temp_decl_obstack;
95 /* This points at either permanent_obstack
96 or the current function_maybepermanent_obstack. */
98 struct obstack *saveable_obstack;
100 /* This is same as saveable_obstack during parse and expansion phase;
101 it points to the current function's obstack during optimization.
102 This is the obstack to be used for creating rtl objects. */
104 struct obstack *rtl_obstack;
106 /* This points at either permanent_obstack or the current function_obstack. */
108 struct obstack *current_obstack;
110 /* This points at either permanent_obstack or the current function_obstack
111 or momentary_obstack. */
113 struct obstack *expression_obstack;
115 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
119 struct obstack_stack *next;
120 struct obstack *current;
121 struct obstack *saveable;
122 struct obstack *expression;
126 struct obstack_stack *obstack_stack;
128 /* Obstack for allocating struct obstack_stack entries. */
130 static struct obstack obstack_stack_obstack;
132 /* Addresses of first objects in some obstacks.
133 This is for freeing their entire contents. */
134 char *maybepermanent_firstobj;
135 char *temporary_firstobj;
136 char *momentary_firstobj;
137 char *temp_decl_firstobj;
139 /* This is used to preserve objects (mainly array initializers) that need to
140 live until the end of the current function, but no further. */
141 char *momentary_function_firstobj;
143 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
145 int all_types_permanent;
147 /* Stack of places to restore the momentary obstack back to. */
149 struct momentary_level
151 /* Pointer back to previous such level. */
152 struct momentary_level *prev;
153 /* First object allocated within this level. */
155 /* Value of expression_obstack saved at entry to this level. */
156 struct obstack *obstack;
159 struct momentary_level *momentary_stack;
161 /* Table indexed by tree code giving a string containing a character
162 classifying the tree code. Possibilities are
163 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
165 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
167 char tree_code_type[MAX_TREE_CODES] = {
172 /* Table indexed by tree code giving number of expression
173 operands beyond the fixed part of the node structure.
174 Not used for types or decls. */
176 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
178 int tree_code_length[MAX_TREE_CODES] = {
183 /* Names of tree components.
184 Used for printing out the tree and error messages. */
185 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
187 const char *tree_code_name[MAX_TREE_CODES] = {
192 /* Statistics-gathering stuff. */
213 int tree_node_counts[(int) all_kinds];
214 int tree_node_sizes[(int) all_kinds];
215 int id_string_size = 0;
217 static const char * const tree_node_kind_names[] = {
235 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
237 #define MAX_HASH_TABLE 1009
238 static tree hash_table[MAX_HASH_TABLE]; /* id hash buckets */
240 /* 0 while creating built-in identifiers. */
241 static int do_identifier_warnings;
243 /* Unique id for next decl created. */
244 static int next_decl_uid;
245 /* Unique id for next type created. */
246 static int next_type_uid = 1;
248 /* Here is how primitive or already-canonicalized types' hash
250 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
252 /* Since we cannot rehash a type after it is in the table, we have to
253 keep the hash code. */
261 /* Initial size of the hash table (rounded to next prime). */
262 #define TYPE_HASH_INITIAL_SIZE 1000
264 /* Now here is the hash table. When recording a type, it is added to
265 the slot whose index is the hash code. Note that the hash table is
266 used for several kinds of types (function types, array types and
267 array index range types, for now). While all these live in the
268 same table, they are completely independent, and the hash code is
269 computed differently for each of these. */
271 htab_t type_hash_table;
273 static void build_real_from_int_cst_1 PARAMS ((PTR));
274 static void set_type_quals PARAMS ((tree, int));
275 static void append_random_chars PARAMS ((char *));
276 static void mark_type_hash PARAMS ((void *));
277 static int type_hash_eq PARAMS ((const void*, const void*));
278 static unsigned int type_hash_hash PARAMS ((const void*));
279 static void print_type_hash_statistics PARAMS((void));
280 static int mark_hash_entry PARAMS((void **, void *));
281 static void finish_vector_type PARAMS((tree));
283 /* If non-null, these are language-specific helper functions for
284 unsave_expr_now. If present, LANG_UNSAVE is called before its
285 argument (an UNSAVE_EXPR) is to be unsaved, and all other
286 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
287 called from unsave_expr_1 for language-specific tree codes. */
288 void (*lang_unsave) PARAMS ((tree *));
289 void (*lang_unsave_expr_now) PARAMS ((tree));
291 /* The string used as a placeholder instead of a source file name for
292 built-in tree nodes. The variable, which is dynamically allocated,
293 should be used; the macro is only used to initialize it. */
295 static char *built_in_filename;
296 #define BUILT_IN_FILENAME ("<built-in>")
298 tree global_trees[TI_MAX];
299 tree integer_types[itk_none];
301 /* Init the principal obstacks. */
306 gcc_obstack_init (&obstack_stack_obstack);
307 gcc_obstack_init (&permanent_obstack);
309 gcc_obstack_init (&temporary_obstack);
310 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
311 gcc_obstack_init (&momentary_obstack);
312 momentary_firstobj = (char *) obstack_alloc (&momentary_obstack, 0);
313 momentary_function_firstobj = momentary_firstobj;
314 gcc_obstack_init (&maybepermanent_obstack);
315 maybepermanent_firstobj
316 = (char *) obstack_alloc (&maybepermanent_obstack, 0);
317 gcc_obstack_init (&temp_decl_obstack);
318 temp_decl_firstobj = (char *) obstack_alloc (&temp_decl_obstack, 0);
320 function_obstack = &temporary_obstack;
321 function_maybepermanent_obstack = &maybepermanent_obstack;
322 current_obstack = &permanent_obstack;
323 expression_obstack = &permanent_obstack;
324 rtl_obstack = saveable_obstack = &permanent_obstack;
326 /* Init the hash table of identifiers. */
327 bzero ((char *) hash_table, sizeof hash_table);
328 ggc_add_tree_root (hash_table, sizeof hash_table / sizeof (tree));
330 /* Initialize the hash table of types. */
331 type_hash_table = htab_create (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
333 ggc_add_root (&type_hash_table, 1, sizeof type_hash_table, mark_type_hash);
334 ggc_add_tree_root (global_trees, TI_MAX);
335 ggc_add_tree_root (integer_types, itk_none);
339 gcc_obstack_init (obstack)
340 struct obstack *obstack;
342 /* Let particular systems override the size of a chunk. */
343 #ifndef OBSTACK_CHUNK_SIZE
344 #define OBSTACK_CHUNK_SIZE 0
346 /* Let them override the alloc and free routines too. */
347 #ifndef OBSTACK_CHUNK_ALLOC
348 #define OBSTACK_CHUNK_ALLOC xmalloc
350 #ifndef OBSTACK_CHUNK_FREE
351 #define OBSTACK_CHUNK_FREE free
353 _obstack_begin (obstack, OBSTACK_CHUNK_SIZE, 0,
354 (void *(*) PARAMS ((long))) OBSTACK_CHUNK_ALLOC,
355 (void (*) PARAMS ((void *))) OBSTACK_CHUNK_FREE);
358 /* Save all variables describing the current status into the structure
359 *P. This function is called whenever we start compiling one
360 function in the midst of compiling another. For example, when
361 compiling a nested function, or, in C++, a template instantiation
362 that is required by the function we are currently compiling.
364 CONTEXT is the decl_function_context for the function we're about to
365 compile; if it isn't current_function_decl, we have to play some games. */
371 p->all_types_permanent = all_types_permanent;
372 p->momentary_stack = momentary_stack;
373 p->maybepermanent_firstobj = maybepermanent_firstobj;
374 p->temporary_firstobj = temporary_firstobj;
375 p->momentary_firstobj = momentary_firstobj;
376 p->momentary_function_firstobj = momentary_function_firstobj;
377 p->function_obstack = function_obstack;
378 p->function_maybepermanent_obstack = function_maybepermanent_obstack;
379 p->current_obstack = current_obstack;
380 p->expression_obstack = expression_obstack;
381 p->saveable_obstack = saveable_obstack;
382 p->rtl_obstack = rtl_obstack;
384 function_maybepermanent_obstack
385 = (struct obstack *) xmalloc (sizeof (struct obstack));
386 gcc_obstack_init (function_maybepermanent_obstack);
387 maybepermanent_firstobj
388 = (char *) obstack_finish (function_maybepermanent_obstack);
390 function_obstack = (struct obstack *) xmalloc (sizeof (struct obstack));
391 gcc_obstack_init (function_obstack);
393 current_obstack = &permanent_obstack;
394 expression_obstack = &permanent_obstack;
395 rtl_obstack = saveable_obstack = &permanent_obstack;
397 temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0);
398 momentary_firstobj = (char *) obstack_finish (&momentary_obstack);
399 momentary_function_firstobj = momentary_firstobj;
402 /* Restore all variables describing the current status from the structure *P.
403 This is used after a nested function. */
406 restore_tree_status (p)
409 all_types_permanent = p->all_types_permanent;
410 momentary_stack = p->momentary_stack;
412 obstack_free (&momentary_obstack, momentary_function_firstobj);
414 /* Free saveable storage used by the function just compiled and not
416 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
417 if (obstack_empty_p (function_maybepermanent_obstack))
419 obstack_free (function_maybepermanent_obstack, NULL);
420 free (function_maybepermanent_obstack);
423 obstack_free (&temporary_obstack, temporary_firstobj);
424 obstack_free (&momentary_obstack, momentary_function_firstobj);
426 obstack_free (function_obstack, NULL);
427 free (function_obstack);
429 temporary_firstobj = p->temporary_firstobj;
430 momentary_firstobj = p->momentary_firstobj;
431 momentary_function_firstobj = p->momentary_function_firstobj;
432 maybepermanent_firstobj = p->maybepermanent_firstobj;
433 function_obstack = p->function_obstack;
434 function_maybepermanent_obstack = p->function_maybepermanent_obstack;
435 current_obstack = p->current_obstack;
436 expression_obstack = p->expression_obstack;
437 saveable_obstack = p->saveable_obstack;
438 rtl_obstack = p->rtl_obstack;
441 /* Start allocating on the temporary (per function) obstack.
442 This is done in start_function before parsing the function body,
443 and before each initialization at top level, and to go back
444 to temporary allocation after doing permanent_allocation. */
447 temporary_allocation ()
449 /* Note that function_obstack at top level points to temporary_obstack.
450 But within a nested function context, it is a separate obstack. */
451 current_obstack = function_obstack;
452 expression_obstack = function_obstack;
453 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
457 /* Start allocating on the permanent obstack but don't
458 free the temporary data. After calling this, call
459 `permanent_allocation' to fully resume permanent allocation status. */
462 end_temporary_allocation ()
464 current_obstack = &permanent_obstack;
465 expression_obstack = &permanent_obstack;
466 rtl_obstack = saveable_obstack = &permanent_obstack;
469 /* Resume allocating on the temporary obstack, undoing
470 effects of `end_temporary_allocation'. */
473 resume_temporary_allocation ()
475 current_obstack = function_obstack;
476 expression_obstack = function_obstack;
477 rtl_obstack = saveable_obstack = function_maybepermanent_obstack;
480 /* While doing temporary allocation, switch to allocating in such a
481 way as to save all nodes if the function is inlined. Call
482 resume_temporary_allocation to go back to ordinary temporary
486 saveable_allocation ()
488 /* Note that function_obstack at top level points to temporary_obstack.
489 But within a nested function context, it is a separate obstack. */
490 expression_obstack = current_obstack = saveable_obstack;
493 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
494 recording the previously current obstacks on a stack.
495 This does not free any storage in any obstack. */
498 push_obstacks (current, saveable)
499 struct obstack *current, *saveable;
501 struct obstack_stack *p;
503 p = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
504 (sizeof (struct obstack_stack)));
506 p->current = current_obstack;
507 p->saveable = saveable_obstack;
508 p->expression = expression_obstack;
509 p->rtl = rtl_obstack;
510 p->next = obstack_stack;
513 current_obstack = current;
514 expression_obstack = current;
515 rtl_obstack = saveable_obstack = saveable;
518 /* Save the current set of obstacks, but don't change them. */
521 push_obstacks_nochange ()
523 struct obstack_stack *p;
525 p = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack,
526 (sizeof (struct obstack_stack)));
528 p->current = current_obstack;
529 p->saveable = saveable_obstack;
530 p->expression = expression_obstack;
531 p->rtl = rtl_obstack;
532 p->next = obstack_stack;
536 /* Pop the obstack selection stack. */
541 struct obstack_stack *p;
544 obstack_stack = p->next;
546 current_obstack = p->current;
547 saveable_obstack = p->saveable;
548 expression_obstack = p->expression;
549 rtl_obstack = p->rtl;
551 obstack_free (&obstack_stack_obstack, p);
554 /* Nonzero if temporary allocation is currently in effect.
555 Zero if currently doing permanent allocation. */
558 allocation_temporary_p ()
560 return current_obstack != &permanent_obstack;
563 /* Go back to allocating on the permanent obstack
564 and free everything in the temporary obstack.
566 FUNCTION_END is true only if we have just finished compiling a function.
567 In that case, we also free preserved initial values on the momentary
571 permanent_allocation (function_end)
574 /* Free up previous temporary obstack data */
575 obstack_free (&temporary_obstack, temporary_firstobj);
578 obstack_free (&momentary_obstack, momentary_function_firstobj);
579 momentary_firstobj = momentary_function_firstobj;
582 obstack_free (&momentary_obstack, momentary_firstobj);
584 obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj);
585 obstack_free (&temp_decl_obstack, temp_decl_firstobj);
587 current_obstack = &permanent_obstack;
588 expression_obstack = &permanent_obstack;
589 rtl_obstack = saveable_obstack = &permanent_obstack;
592 /* Save permanently everything on the maybepermanent_obstack. */
597 maybepermanent_firstobj
598 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
602 preserve_initializer ()
604 struct momentary_level *tem;
608 = (char *) obstack_alloc (&temporary_obstack, 0);
609 maybepermanent_firstobj
610 = (char *) obstack_alloc (function_maybepermanent_obstack, 0);
612 old_momentary = momentary_firstobj;
614 = (char *) obstack_alloc (&momentary_obstack, 0);
615 if (momentary_firstobj != old_momentary)
616 for (tem = momentary_stack; tem; tem = tem->prev)
617 tem->base = momentary_firstobj;
620 /* Start allocating new rtl in current_obstack.
621 Use resume_temporary_allocation
622 to go back to allocating rtl in saveable_obstack. */
625 rtl_in_current_obstack ()
627 rtl_obstack = current_obstack;
630 /* Start allocating rtl from saveable_obstack. Intended to be used after
631 a call to push_obstacks_nochange. */
634 rtl_in_saveable_obstack ()
636 rtl_obstack = saveable_obstack;
639 /* Allocate SIZE bytes in the current obstack
640 and return a pointer to them.
641 In practice the current obstack is always the temporary one. */
647 return (char *) obstack_alloc (current_obstack, size);
650 /* Free the object PTR in the current obstack
651 as well as everything allocated since PTR.
652 In practice the current obstack is always the temporary one. */
658 obstack_free (current_obstack, ptr);
661 /* Allocate SIZE bytes in the permanent obstack
662 and return a pointer to them. */
668 return (char *) obstack_alloc (&permanent_obstack, size);
671 /* Allocate NELEM items of SIZE bytes in the permanent obstack
672 and return a pointer to them. The storage is cleared before
673 returning the value. */
676 perm_calloc (nelem, size)
680 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
681 bzero (rval, nelem * size);
685 /* Allocate SIZE bytes in the saveable obstack
686 and return a pointer to them. */
692 return (char *) obstack_alloc (saveable_obstack, size);
695 /* Allocate SIZE bytes in the expression obstack
696 and return a pointer to them. */
702 return (char *) obstack_alloc (expression_obstack, size);
705 /* Print out which obstack an object is in. */
708 print_obstack_name (object, file, prefix)
713 struct obstack *obstack = NULL;
714 const char *obstack_name = NULL;
717 for (p = outer_function_chain; p; p = p->next)
719 if (_obstack_allocated_p (p->function_obstack, object))
721 obstack = p->function_obstack;
722 obstack_name = "containing function obstack";
724 if (_obstack_allocated_p (p->function_maybepermanent_obstack, object))
726 obstack = p->function_maybepermanent_obstack;
727 obstack_name = "containing function maybepermanent obstack";
731 if (_obstack_allocated_p (&obstack_stack_obstack, object))
733 obstack = &obstack_stack_obstack;
734 obstack_name = "obstack_stack_obstack";
736 else if (_obstack_allocated_p (function_obstack, object))
738 obstack = function_obstack;
739 obstack_name = "function obstack";
741 else if (_obstack_allocated_p (&permanent_obstack, object))
743 obstack = &permanent_obstack;
744 obstack_name = "permanent_obstack";
746 else if (_obstack_allocated_p (&momentary_obstack, object))
748 obstack = &momentary_obstack;
749 obstack_name = "momentary_obstack";
751 else if (_obstack_allocated_p (function_maybepermanent_obstack, object))
753 obstack = function_maybepermanent_obstack;
754 obstack_name = "function maybepermanent obstack";
756 else if (_obstack_allocated_p (&temp_decl_obstack, object))
758 obstack = &temp_decl_obstack;
759 obstack_name = "temp_decl_obstack";
762 /* Check to see if the object is in the free area of the obstack. */
765 if (object >= obstack->next_free
766 && object < obstack->chunk_limit)
767 fprintf (file, "%s in free portion of obstack %s",
768 prefix, obstack_name);
770 fprintf (file, "%s allocated from %s", prefix, obstack_name);
773 fprintf (file, "%s not allocated from any obstack", prefix);
777 debug_obstack (object)
780 print_obstack_name (object, stderr, "object");
781 fprintf (stderr, ".\n");
784 /* Return 1 if OBJ is in the permanent obstack.
785 This is slow, and should be used only for debugging.
786 Use TREE_PERMANENT for other purposes. */
789 object_permanent_p (obj)
792 return _obstack_allocated_p (&permanent_obstack, obj);
795 /* Start a level of momentary allocation.
796 In C, each compound statement has its own level
797 and that level is freed at the end of each statement.
798 All expression nodes are allocated in the momentary allocation level. */
803 struct momentary_level *tem
804 = (struct momentary_level *) obstack_alloc (&momentary_obstack,
805 sizeof (struct momentary_level));
806 tem->prev = momentary_stack;
807 tem->base = (char *) obstack_base (&momentary_obstack);
808 tem->obstack = expression_obstack;
809 momentary_stack = tem;
810 expression_obstack = &momentary_obstack;
813 /* Set things up so the next clear_momentary will only clear memory
814 past our present position in momentary_obstack. */
817 preserve_momentary ()
819 momentary_stack->base = (char *) obstack_base (&momentary_obstack);
822 /* Free all the storage in the current momentary-allocation level.
823 In C, this happens at the end of each statement. */
828 obstack_free (&momentary_obstack, momentary_stack->base);
831 /* Discard a level of momentary allocation.
832 In C, this happens at the end of each compound statement.
833 Restore the status of expression node allocation
834 that was in effect before this level was created. */
839 struct momentary_level *tem = momentary_stack;
840 momentary_stack = tem->prev;
841 expression_obstack = tem->obstack;
842 /* We can't free TEM from the momentary_obstack, because there might
843 be objects above it which have been saved. We can free back to the
844 stack of the level we are popping off though. */
845 obstack_free (&momentary_obstack, tem->base);
848 /* Pop back to the previous level of momentary allocation,
849 but don't free any momentary data just yet. */
852 pop_momentary_nofree ()
854 struct momentary_level *tem = momentary_stack;
855 momentary_stack = tem->prev;
856 expression_obstack = tem->obstack;
859 /* Call when starting to parse a declaration:
860 make expressions in the declaration last the length of the function.
861 Returns an argument that should be passed to resume_momentary later. */
866 register int tem = expression_obstack == &momentary_obstack;
867 expression_obstack = saveable_obstack;
871 /* Call when finished parsing a declaration:
872 restore the treatment of node-allocation that was
873 in effect before the suspension.
874 YES should be the value previously returned by suspend_momentary. */
877 resume_momentary (yes)
881 expression_obstack = &momentary_obstack;
884 /* Init the tables indexed by tree code.
885 Note that languages can add to these tables to define their own codes. */
891 = ggc_alloc_string (BUILT_IN_FILENAME, sizeof (BUILT_IN_FILENAME));
892 ggc_add_string_root (&built_in_filename, 1);
895 /* Return a newly allocated node of code CODE.
896 Initialize the node's unique id and its TREE_PERMANENT flag.
897 Note that if garbage collection is in use, TREE_PERMANENT will
898 always be zero - we want to eliminate use of TREE_PERMANENT.
899 For decl and type nodes, some other fields are initialized.
900 The rest of the node is initialized to zero.
902 Achoo! I got a code in the node. */
909 register int type = TREE_CODE_CLASS (code);
910 register int length = 0;
911 register struct obstack *obstack = current_obstack;
912 #ifdef GATHER_STATISTICS
913 register tree_node_kind kind;
918 case 'd': /* A decl node */
919 #ifdef GATHER_STATISTICS
922 length = sizeof (struct tree_decl);
923 /* All decls in an inline function need to be saved. */
924 if (obstack != &permanent_obstack)
925 obstack = saveable_obstack;
927 /* PARM_DECLs go on the context of the parent. If this is a nested
928 function, then we must allocate the PARM_DECL on the parent's
929 obstack, so that they will live to the end of the parent's
930 closing brace. This is necessary in case we try to inline the
931 function into its parent.
933 PARM_DECLs of top-level functions do not have this problem. However,
934 we allocate them where we put the FUNCTION_DECL for languages such as
935 Ada that need to consult some flags in the PARM_DECLs of the function
938 See comment in restore_tree_status for why we can't put this
939 in function_obstack. */
940 if (code == PARM_DECL && obstack != &permanent_obstack)
943 if (current_function_decl)
944 context = decl_function_context (current_function_decl);
948 = find_function_data (context)->function_maybepermanent_obstack;
952 case 't': /* a type node */
953 #ifdef GATHER_STATISTICS
956 length = sizeof (struct tree_type);
957 /* All data types are put where we can preserve them if nec. */
958 if (obstack != &permanent_obstack)
959 obstack = all_types_permanent ? &permanent_obstack : saveable_obstack;
962 case 'b': /* a lexical block */
963 #ifdef GATHER_STATISTICS
966 length = sizeof (struct tree_block);
967 /* All BLOCK nodes are put where we can preserve them if nec. */
968 if (obstack != &permanent_obstack)
969 obstack = saveable_obstack;
972 case 's': /* an expression with side effects */
973 #ifdef GATHER_STATISTICS
977 case 'r': /* a reference */
978 #ifdef GATHER_STATISTICS
982 case 'e': /* an expression */
983 case '<': /* a comparison expression */
984 case '1': /* a unary arithmetic expression */
985 case '2': /* a binary arithmetic expression */
986 #ifdef GATHER_STATISTICS
990 obstack = expression_obstack;
991 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
992 if (code == BIND_EXPR && obstack != &permanent_obstack)
993 obstack = saveable_obstack;
994 length = sizeof (struct tree_exp)
995 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *);
998 case 'c': /* a constant */
999 #ifdef GATHER_STATISTICS
1002 obstack = expression_obstack;
1004 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
1005 words is machine-dependent due to varying length of HOST_WIDE_INT,
1006 which might be wider than a pointer (e.g., long long). Similarly
1007 for REAL_CST, since the number of words is machine-dependent due
1008 to varying size and alignment of `double'. */
1010 if (code == INTEGER_CST)
1011 length = sizeof (struct tree_int_cst);
1012 else if (code == REAL_CST)
1013 length = sizeof (struct tree_real_cst);
1015 length = sizeof (struct tree_common)
1016 + TREE_CODE_LENGTH (code) * sizeof (char *);
1019 case 'x': /* something random, like an identifier. */
1020 #ifdef GATHER_STATISTICS
1021 if (code == IDENTIFIER_NODE)
1023 else if (code == OP_IDENTIFIER)
1025 else if (code == TREE_VEC)
1030 length = sizeof (struct tree_common)
1031 + TREE_CODE_LENGTH (code) * sizeof (char *);
1032 /* Identifier nodes are always permanent since they are
1033 unique in a compiler run. */
1034 if (code == IDENTIFIER_NODE) obstack = &permanent_obstack;
1042 t = ggc_alloc_tree (length);
1044 t = (tree) obstack_alloc (obstack, length);
1046 memset ((PTR) t, 0, length);
1048 #ifdef GATHER_STATISTICS
1049 tree_node_counts[(int) kind]++;
1050 tree_node_sizes[(int) kind] += length;
1053 TREE_SET_CODE (t, code);
1054 TREE_SET_PERMANENT (t);
1059 TREE_SIDE_EFFECTS (t) = 1;
1060 TREE_TYPE (t) = void_type_node;
1064 if (code != FUNCTION_DECL)
1066 DECL_USER_ALIGN (t) = 0;
1067 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
1068 DECL_SOURCE_LINE (t) = lineno;
1069 DECL_SOURCE_FILE (t) =
1070 (input_filename) ? input_filename : built_in_filename;
1071 DECL_UID (t) = next_decl_uid++;
1072 /* Note that we have not yet computed the alias set for this
1074 DECL_POINTER_ALIAS_SET (t) = -1;
1078 TYPE_UID (t) = next_type_uid++;
1080 TYPE_USER_ALIGN (t) = 0;
1081 TYPE_MAIN_VARIANT (t) = t;
1082 TYPE_OBSTACK (t) = obstack;
1083 TYPE_ATTRIBUTES (t) = NULL_TREE;
1084 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1085 SET_DEFAULT_TYPE_ATTRIBUTES (t);
1087 /* Note that we have not yet computed the alias set for this
1089 TYPE_ALIAS_SET (t) = -1;
1093 TREE_CONSTANT (t) = 1;
1103 case PREDECREMENT_EXPR:
1104 case PREINCREMENT_EXPR:
1105 case POSTDECREMENT_EXPR:
1106 case POSTINCREMENT_EXPR:
1107 /* All of these have side-effects, no matter what their
1109 TREE_SIDE_EFFECTS (t) = 1;
1121 /* A front-end can reset this to an appropriate function if types need
1122 special handling. */
1124 tree (*make_lang_type_fn) PARAMS ((enum tree_code)) = make_node;
1126 /* Return a new type (with the indicated CODE), doing whatever
1127 language-specific processing is required. */
1130 make_lang_type (code)
1131 enum tree_code code;
1133 return (*make_lang_type_fn) (code);
1136 /* Return a new node with the same contents as NODE except that its
1137 TREE_CHAIN is zero and it has a fresh uid. Unlike make_node, this
1138 function always performs the allocation on the CURRENT_OBSTACK;
1139 it's up to the caller to pick the right obstack before calling this
1147 register enum tree_code code = TREE_CODE (node);
1148 register int length = 0;
1150 switch (TREE_CODE_CLASS (code))
1152 case 'd': /* A decl node */
1153 length = sizeof (struct tree_decl);
1156 case 't': /* a type node */
1157 length = sizeof (struct tree_type);
1160 case 'b': /* a lexical block node */
1161 length = sizeof (struct tree_block);
1164 case 'r': /* a reference */
1165 case 'e': /* an expression */
1166 case 's': /* an expression with side effects */
1167 case '<': /* a comparison expression */
1168 case '1': /* a unary arithmetic expression */
1169 case '2': /* a binary arithmetic expression */
1170 length = sizeof (struct tree_exp)
1171 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *);
1174 case 'c': /* a constant */
1175 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
1176 words is machine-dependent due to varying length of HOST_WIDE_INT,
1177 which might be wider than a pointer (e.g., long long). Similarly
1178 for REAL_CST, since the number of words is machine-dependent due
1179 to varying size and alignment of `double'. */
1180 if (code == INTEGER_CST)
1181 length = sizeof (struct tree_int_cst);
1182 else if (code == REAL_CST)
1183 length = sizeof (struct tree_real_cst);
1185 length = (sizeof (struct tree_common)
1186 + TREE_CODE_LENGTH (code) * sizeof (char *));
1189 case 'x': /* something random, like an identifier. */
1190 length = sizeof (struct tree_common)
1191 + TREE_CODE_LENGTH (code) * sizeof (char *);
1192 if (code == TREE_VEC)
1193 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
1197 t = ggc_alloc_tree (length);
1199 t = (tree) obstack_alloc (current_obstack, length);
1200 memcpy (t, node, length);
1203 TREE_ASM_WRITTEN (t) = 0;
1205 if (TREE_CODE_CLASS (code) == 'd')
1206 DECL_UID (t) = next_decl_uid++;
1207 else if (TREE_CODE_CLASS (code) == 't')
1209 TYPE_UID (t) = next_type_uid++;
1210 TYPE_OBSTACK (t) = current_obstack;
1212 /* The following is so that the debug code for
1213 the copy is different from the original type.
1214 The two statements usually duplicate each other
1215 (because they clear fields of the same union),
1216 but the optimizer should catch that. */
1217 TYPE_SYMTAB_POINTER (t) = 0;
1218 TYPE_SYMTAB_ADDRESS (t) = 0;
1221 TREE_SET_PERMANENT (t);
1226 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1227 For example, this can copy a list made of TREE_LIST nodes. */
1234 register tree prev, next;
1239 head = prev = copy_node (list);
1240 next = TREE_CHAIN (list);
1243 TREE_CHAIN (prev) = copy_node (next);
1244 prev = TREE_CHAIN (prev);
1245 next = TREE_CHAIN (next);
1252 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1253 If an identifier with that name has previously been referred to,
1254 the same node is returned this time. */
1257 get_identifier (text)
1258 register const char *text;
1263 register int len, hash_len;
1265 /* Compute length of text in len. */
1266 len = strlen (text);
1268 /* Decide how much of that length to hash on */
1270 if (warn_id_clash && len > id_clash_len)
1271 hash_len = id_clash_len;
1273 /* Compute hash code */
1274 hi = hash_len * 613 + (unsigned) text[0];
1275 for (i = 1; i < hash_len; i += 2)
1276 hi = ((hi * 613) + (unsigned) (text[i]));
1278 hi &= (1 << HASHBITS) - 1;
1279 hi %= MAX_HASH_TABLE;
1281 /* Search table for identifier. */
1282 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1283 if (IDENTIFIER_LENGTH (idp) == len
1284 && IDENTIFIER_POINTER (idp)[0] == text[0]
1285 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1286 /* Return if found. */
1289 /* Not found; optionally warn about a similar identifier. */
1290 if (warn_id_clash && do_identifier_warnings && len >= id_clash_len)
1291 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1292 if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len))
1294 warning ("`%s' and `%s' identical in first %d characters",
1295 IDENTIFIER_POINTER (idp), text, id_clash_len);
1299 if (TREE_CODE_LENGTH (IDENTIFIER_NODE) < 0)
1300 abort (); /* set_identifier_size hasn't been called. */
1302 /* Not found, create one, add to chain */
1303 idp = make_node (IDENTIFIER_NODE);
1304 IDENTIFIER_LENGTH (idp) = len;
1305 #ifdef GATHER_STATISTICS
1306 id_string_size += len;
1310 IDENTIFIER_POINTER (idp) = ggc_alloc_string (text, len);
1312 IDENTIFIER_POINTER (idp) = obstack_copy0 (&permanent_obstack, text, len);
1314 TREE_CHAIN (idp) = hash_table[hi];
1315 hash_table[hi] = idp;
1316 return idp; /* <-- return if created */
1319 /* If an identifier with the name TEXT (a null-terminated string) has
1320 previously been referred to, return that node; otherwise return
1324 maybe_get_identifier (text)
1325 register const char *text;
1330 register int len, hash_len;
1332 /* Compute length of text in len. */
1333 len = strlen (text);
1335 /* Decide how much of that length to hash on */
1337 if (warn_id_clash && len > id_clash_len)
1338 hash_len = id_clash_len;
1340 /* Compute hash code */
1341 hi = hash_len * 613 + (unsigned) text[0];
1342 for (i = 1; i < hash_len; i += 2)
1343 hi = ((hi * 613) + (unsigned) (text[i]));
1345 hi &= (1 << HASHBITS) - 1;
1346 hi %= MAX_HASH_TABLE;
1348 /* Search table for identifier. */
1349 for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp))
1350 if (IDENTIFIER_LENGTH (idp) == len
1351 && IDENTIFIER_POINTER (idp)[0] == text[0]
1352 && !bcmp (IDENTIFIER_POINTER (idp), text, len))
1353 return idp; /* <-- return if found */
1358 /* Enable warnings on similar identifiers (if requested).
1359 Done after the built-in identifiers are created. */
1362 start_identifier_warnings ()
1364 do_identifier_warnings = 1;
1367 /* Record the size of an identifier node for the language in use.
1368 SIZE is the total size in bytes.
1369 This is called by the language-specific files. This must be
1370 called before allocating any identifiers. */
1373 set_identifier_size (size)
1376 tree_code_length[(int) IDENTIFIER_NODE]
1377 = (size - sizeof (struct tree_common)) / sizeof (tree);
1380 /* Return a newly constructed INTEGER_CST node whose constant value
1381 is specified by the two ints LOW and HI.
1382 The TREE_TYPE is set to `int'.
1384 This function should be used via the `build_int_2' macro. */
1387 build_int_2_wide (low, hi)
1388 unsigned HOST_WIDE_INT low;
1391 register tree t = make_node (INTEGER_CST);
1393 TREE_INT_CST_LOW (t) = low;
1394 TREE_INT_CST_HIGH (t) = hi;
1395 TREE_TYPE (t) = integer_type_node;
1399 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1402 build_real (type, d)
1409 /* Check for valid float value for this type on this target machine;
1410 if not, can print error message and store a valid value in D. */
1411 #ifdef CHECK_FLOAT_VALUE
1412 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1415 v = make_node (REAL_CST);
1416 TREE_TYPE (v) = type;
1417 TREE_REAL_CST (v) = d;
1418 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1422 /* Return a new REAL_CST node whose type is TYPE
1423 and whose value is the integer value of the INTEGER_CST node I. */
1425 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1428 real_value_from_int_cst (type, i)
1429 tree type ATTRIBUTE_UNUSED, i;
1433 #ifdef REAL_ARITHMETIC
1434 /* Clear all bits of the real value type so that we can later do
1435 bitwise comparisons to see if two values are the same. */
1436 bzero ((char *) &d, sizeof d);
1438 if (! TREE_UNSIGNED (TREE_TYPE (i)))
1439 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1442 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
1443 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
1444 #else /* not REAL_ARITHMETIC */
1445 /* Some 386 compilers mishandle unsigned int to float conversions,
1446 so introduce a temporary variable E to avoid those bugs. */
1447 if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i)))
1451 d = (double) (~TREE_INT_CST_HIGH (i));
1452 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1453 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1455 e = (double) (~TREE_INT_CST_LOW (i));
1463 d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i);
1464 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
1465 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
1467 e = (double) TREE_INT_CST_LOW (i);
1470 #endif /* not REAL_ARITHMETIC */
1474 /* Args to pass to and from build_real_from_int_cst_1. */
1478 tree type; /* Input: type to conver to. */
1479 tree i; /* Input: operand to convert. */
1480 REAL_VALUE_TYPE d; /* Output: floating point value. */
1483 /* Convert an integer to a floating point value while protected by a floating
1484 point exception handler. */
1487 build_real_from_int_cst_1 (data)
1490 struct brfic_args *args = (struct brfic_args *) data;
1492 #ifdef REAL_ARITHMETIC
1493 args->d = real_value_from_int_cst (args->type, args->i);
1496 = REAL_VALUE_TRUNCATE (TYPE_MODE (args->type),
1497 real_value_from_int_cst (args->type, args->i));
1501 /* Given a tree representing an integer constant I, return a tree
1502 representing the same value as a floating-point constant of type TYPE.
1503 We cannot perform this operation if there is no way of doing arithmetic
1504 on floating-point values. */
1507 build_real_from_int_cst (type, i)
1512 int overflow = TREE_OVERFLOW (i);
1514 struct brfic_args args;
1516 v = make_node (REAL_CST);
1517 TREE_TYPE (v) = type;
1519 /* Setup input for build_real_from_int_cst_1() */
1523 if (do_float_handler (build_real_from_int_cst_1, (PTR) &args))
1524 /* Receive output from build_real_from_int_cst_1() */
1528 /* We got an exception from build_real_from_int_cst_1() */
1533 /* Check for valid float value for this type on this target machine. */
1535 #ifdef CHECK_FLOAT_VALUE
1536 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
1539 TREE_REAL_CST (v) = d;
1540 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1544 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1546 /* Return a newly constructed STRING_CST node whose value is
1547 the LEN characters at STR.
1548 The TREE_TYPE is not initialized. */
1551 build_string (len, str)
1555 /* Put the string in saveable_obstack since it will be placed in the RTL
1556 for an "asm" statement and will also be kept around a while if
1557 deferring constant output in varasm.c. */
1559 register tree s = make_node (STRING_CST);
1561 TREE_STRING_LENGTH (s) = len;
1563 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
1565 TREE_STRING_POINTER (s) = obstack_copy0 (saveable_obstack, str, len);
1570 /* Return a newly constructed COMPLEX_CST node whose value is
1571 specified by the real and imaginary parts REAL and IMAG.
1572 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1573 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1576 build_complex (type, real, imag)
1580 register tree t = make_node (COMPLEX_CST);
1582 TREE_REALPART (t) = real;
1583 TREE_IMAGPART (t) = imag;
1584 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1585 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1586 TREE_CONSTANT_OVERFLOW (t)
1587 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1591 /* Build a newly constructed TREE_VEC node of length LEN. */
1598 register int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
1599 register struct obstack *obstack = current_obstack;
1601 #ifdef GATHER_STATISTICS
1602 tree_node_counts[(int)vec_kind]++;
1603 tree_node_sizes[(int)vec_kind] += length;
1607 t = ggc_alloc_tree (length);
1609 t = (tree) obstack_alloc (obstack, length);
1611 memset ((PTR) t, 0, length);
1612 TREE_SET_CODE (t, TREE_VEC);
1613 TREE_VEC_LENGTH (t) = len;
1614 TREE_SET_PERMANENT (t);
1619 /* Return 1 if EXPR is the integer constant zero or a complex constant
1623 integer_zerop (expr)
1628 return ((TREE_CODE (expr) == INTEGER_CST
1629 && ! TREE_CONSTANT_OVERFLOW (expr)
1630 && TREE_INT_CST_LOW (expr) == 0
1631 && TREE_INT_CST_HIGH (expr) == 0)
1632 || (TREE_CODE (expr) == COMPLEX_CST
1633 && integer_zerop (TREE_REALPART (expr))
1634 && integer_zerop (TREE_IMAGPART (expr))));
1637 /* Return 1 if EXPR is the integer constant one or the corresponding
1638 complex constant. */
1646 return ((TREE_CODE (expr) == INTEGER_CST
1647 && ! TREE_CONSTANT_OVERFLOW (expr)
1648 && TREE_INT_CST_LOW (expr) == 1
1649 && TREE_INT_CST_HIGH (expr) == 0)
1650 || (TREE_CODE (expr) == COMPLEX_CST
1651 && integer_onep (TREE_REALPART (expr))
1652 && integer_zerop (TREE_IMAGPART (expr))));
1655 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1656 it contains. Likewise for the corresponding complex constant. */
1659 integer_all_onesp (expr)
1667 if (TREE_CODE (expr) == COMPLEX_CST
1668 && integer_all_onesp (TREE_REALPART (expr))
1669 && integer_zerop (TREE_IMAGPART (expr)))
1672 else if (TREE_CODE (expr) != INTEGER_CST
1673 || TREE_CONSTANT_OVERFLOW (expr))
1676 uns = TREE_UNSIGNED (TREE_TYPE (expr));
1678 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1679 && TREE_INT_CST_HIGH (expr) == -1);
1681 /* Note that using TYPE_PRECISION here is wrong. We care about the
1682 actual bits, not the (arbitrary) range of the type. */
1683 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1684 if (prec >= HOST_BITS_PER_WIDE_INT)
1686 HOST_WIDE_INT high_value;
1689 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1691 if (shift_amount > HOST_BITS_PER_WIDE_INT)
1692 /* Can not handle precisions greater than twice the host int size. */
1694 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
1695 /* Shifting by the host word size is undefined according to the ANSI
1696 standard, so we must handle this as a special case. */
1699 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1701 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1702 && TREE_INT_CST_HIGH (expr) == high_value);
1705 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1708 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1712 integer_pow2p (expr)
1716 HOST_WIDE_INT high, low;
1720 if (TREE_CODE (expr) == COMPLEX_CST
1721 && integer_pow2p (TREE_REALPART (expr))
1722 && integer_zerop (TREE_IMAGPART (expr)))
1725 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
1728 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1729 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1730 high = TREE_INT_CST_HIGH (expr);
1731 low = TREE_INT_CST_LOW (expr);
1733 /* First clear all bits that are beyond the type's precision in case
1734 we've been sign extended. */
1736 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1738 else if (prec > HOST_BITS_PER_WIDE_INT)
1739 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1743 if (prec < HOST_BITS_PER_WIDE_INT)
1744 low &= ~((HOST_WIDE_INT) (-1) << prec);
1747 if (high == 0 && low == 0)
1750 return ((high == 0 && (low & (low - 1)) == 0)
1751 || (low == 0 && (high & (high - 1)) == 0));
1754 /* Return the power of two represented by a tree node known to be a
1762 HOST_WIDE_INT high, low;
1766 if (TREE_CODE (expr) == COMPLEX_CST)
1767 return tree_log2 (TREE_REALPART (expr));
1769 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1770 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1772 high = TREE_INT_CST_HIGH (expr);
1773 low = TREE_INT_CST_LOW (expr);
1775 /* First clear all bits that are beyond the type's precision in case
1776 we've been sign extended. */
1778 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1780 else if (prec > HOST_BITS_PER_WIDE_INT)
1781 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1785 if (prec < HOST_BITS_PER_WIDE_INT)
1786 low &= ~((HOST_WIDE_INT) (-1) << prec);
1789 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1790 : exact_log2 (low));
1793 /* Similar, but return the largest integer Y such that 2 ** Y is less
1794 than or equal to EXPR. */
1797 tree_floor_log2 (expr)
1801 HOST_WIDE_INT high, low;
1805 if (TREE_CODE (expr) == COMPLEX_CST)
1806 return tree_log2 (TREE_REALPART (expr));
1808 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1809 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1811 high = TREE_INT_CST_HIGH (expr);
1812 low = TREE_INT_CST_LOW (expr);
1814 /* First clear all bits that are beyond the type's precision in case
1815 we've been sign extended. Ignore if type's precision hasn't been set
1816 since what we are doing is setting it. */
1818 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1820 else if (prec > HOST_BITS_PER_WIDE_INT)
1821 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1825 if (prec < HOST_BITS_PER_WIDE_INT)
1826 low &= ~((HOST_WIDE_INT) (-1) << prec);
1829 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1830 : floor_log2 (low));
1833 /* Return 1 if EXPR is the real constant zero. */
1841 return ((TREE_CODE (expr) == REAL_CST
1842 && ! TREE_CONSTANT_OVERFLOW (expr)
1843 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1844 || (TREE_CODE (expr) == COMPLEX_CST
1845 && real_zerop (TREE_REALPART (expr))
1846 && real_zerop (TREE_IMAGPART (expr))));
1849 /* Return 1 if EXPR is the real constant one in real or complex form. */
1857 return ((TREE_CODE (expr) == REAL_CST
1858 && ! TREE_CONSTANT_OVERFLOW (expr)
1859 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1860 || (TREE_CODE (expr) == COMPLEX_CST
1861 && real_onep (TREE_REALPART (expr))
1862 && real_zerop (TREE_IMAGPART (expr))));
1865 /* Return 1 if EXPR is the real constant two. */
1873 return ((TREE_CODE (expr) == REAL_CST
1874 && ! TREE_CONSTANT_OVERFLOW (expr)
1875 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1876 || (TREE_CODE (expr) == COMPLEX_CST
1877 && real_twop (TREE_REALPART (expr))
1878 && real_zerop (TREE_IMAGPART (expr))));
1881 /* Nonzero if EXP is a constant or a cast of a constant. */
1884 really_constant_p (exp)
1887 /* This is not quite the same as STRIP_NOPS. It does more. */
1888 while (TREE_CODE (exp) == NOP_EXPR
1889 || TREE_CODE (exp) == CONVERT_EXPR
1890 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1891 exp = TREE_OPERAND (exp, 0);
1892 return TREE_CONSTANT (exp);
1895 /* Return first list element whose TREE_VALUE is ELEM.
1896 Return 0 if ELEM is not in LIST. */
1899 value_member (elem, list)
1904 if (elem == TREE_VALUE (list))
1906 list = TREE_CHAIN (list);
1911 /* Return first list element whose TREE_PURPOSE is ELEM.
1912 Return 0 if ELEM is not in LIST. */
1915 purpose_member (elem, list)
1920 if (elem == TREE_PURPOSE (list))
1922 list = TREE_CHAIN (list);
1927 /* Return first list element whose BINFO_TYPE is ELEM.
1928 Return 0 if ELEM is not in LIST. */
1931 binfo_member (elem, list)
1936 if (elem == BINFO_TYPE (list))
1938 list = TREE_CHAIN (list);
1943 /* Return nonzero if ELEM is part of the chain CHAIN. */
1946 chain_member (elem, chain)
1953 chain = TREE_CHAIN (chain);
1959 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1960 chain CHAIN. This and the next function are currently unused, but
1961 are retained for completeness. */
1964 chain_member_value (elem, chain)
1969 if (elem == TREE_VALUE (chain))
1971 chain = TREE_CHAIN (chain);
1977 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1978 for any piece of chain CHAIN. */
1981 chain_member_purpose (elem, chain)
1986 if (elem == TREE_PURPOSE (chain))
1988 chain = TREE_CHAIN (chain);
1994 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1995 We expect a null pointer to mark the end of the chain.
1996 This is the Lisp primitive `length'. */
2003 register int len = 0;
2005 for (tail = t; tail; tail = TREE_CHAIN (tail))
2011 /* Returns the number of FIELD_DECLs in TYPE. */
2014 fields_length (type)
2017 tree t = TYPE_FIELDS (type);
2020 for (; t; t = TREE_CHAIN (t))
2021 if (TREE_CODE (t) == FIELD_DECL)
2027 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2028 by modifying the last node in chain 1 to point to chain 2.
2029 This is the Lisp primitive `nconc'. */
2039 #ifdef ENABLE_TREE_CHECKING
2043 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2045 TREE_CHAIN (t1) = op2;
2046 #ifdef ENABLE_TREE_CHECKING
2047 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2049 abort (); /* Circularity created. */
2057 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2061 register tree chain;
2065 while ((next = TREE_CHAIN (chain)))
2070 /* Reverse the order of elements in the chain T,
2071 and return the new head of the chain (old last element). */
2077 register tree prev = 0, decl, next;
2078 for (decl = t; decl; decl = next)
2080 next = TREE_CHAIN (decl);
2081 TREE_CHAIN (decl) = prev;
2087 /* Given a chain CHAIN of tree nodes,
2088 construct and return a list of those nodes. */
2094 tree result = NULL_TREE;
2095 tree in_tail = chain;
2096 tree out_tail = NULL_TREE;
2100 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
2102 TREE_CHAIN (out_tail) = next;
2106 in_tail = TREE_CHAIN (in_tail);
2112 /* Return a newly created TREE_LIST node whose
2113 purpose and value fields are PARM and VALUE. */
2116 build_tree_list (parm, value)
2119 register tree t = make_node (TREE_LIST);
2120 TREE_PURPOSE (t) = parm;
2121 TREE_VALUE (t) = value;
2125 /* Similar, but build on the temp_decl_obstack. */
2128 build_decl_list (parm, value)
2132 register struct obstack *ambient_obstack = current_obstack;
2134 current_obstack = &temp_decl_obstack;
2135 node = build_tree_list (parm, value);
2136 current_obstack = ambient_obstack;
2140 /* Similar, but build on the expression_obstack. */
2143 build_expr_list (parm, value)
2147 register struct obstack *ambient_obstack = current_obstack;
2149 current_obstack = expression_obstack;
2150 node = build_tree_list (parm, value);
2151 current_obstack = ambient_obstack;
2155 /* Return a newly created TREE_LIST node whose
2156 purpose and value fields are PARM and VALUE
2157 and whose TREE_CHAIN is CHAIN. */
2160 tree_cons (purpose, value, chain)
2161 tree purpose, value, chain;
2166 node = ggc_alloc_tree (sizeof (struct tree_list));
2168 node = (tree) obstack_alloc (current_obstack, sizeof (struct tree_list));
2170 memset (node, 0, sizeof (struct tree_common));
2172 #ifdef GATHER_STATISTICS
2173 tree_node_counts[(int) x_kind]++;
2174 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2177 TREE_SET_CODE (node, TREE_LIST);
2178 TREE_SET_PERMANENT (node);
2180 TREE_CHAIN (node) = chain;
2181 TREE_PURPOSE (node) = purpose;
2182 TREE_VALUE (node) = value;
2186 /* Similar, but build on the temp_decl_obstack. */
2189 decl_tree_cons (purpose, value, chain)
2190 tree purpose, value, chain;
2193 register struct obstack *ambient_obstack = current_obstack;
2195 current_obstack = &temp_decl_obstack;
2196 node = tree_cons (purpose, value, chain);
2197 current_obstack = ambient_obstack;
2201 /* Similar, but build on the expression_obstack. */
2204 expr_tree_cons (purpose, value, chain)
2205 tree purpose, value, chain;
2208 register struct obstack *ambient_obstack = current_obstack;
2210 current_obstack = expression_obstack;
2211 node = tree_cons (purpose, value, chain);
2212 current_obstack = ambient_obstack;
2216 /* Same as `tree_cons' but make a permanent object. */
2219 perm_tree_cons (purpose, value, chain)
2220 tree purpose, value, chain;
2223 register struct obstack *ambient_obstack = current_obstack;
2225 current_obstack = &permanent_obstack;
2226 node = tree_cons (purpose, value, chain);
2227 current_obstack = ambient_obstack;
2231 /* Same as `tree_cons', but make this node temporary, regardless. */
2234 temp_tree_cons (purpose, value, chain)
2235 tree purpose, value, chain;
2238 register struct obstack *ambient_obstack = current_obstack;
2240 current_obstack = &temporary_obstack;
2241 node = tree_cons (purpose, value, chain);
2242 current_obstack = ambient_obstack;
2246 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2249 saveable_tree_cons (purpose, value, chain)
2250 tree purpose, value, chain;
2253 register struct obstack *ambient_obstack = current_obstack;
2255 current_obstack = saveable_obstack;
2256 node = tree_cons (purpose, value, chain);
2257 current_obstack = ambient_obstack;
2261 /* Return the size nominally occupied by an object of type TYPE
2262 when it resides in memory. The value is measured in units of bytes,
2263 and its data type is that normally used for type sizes
2264 (which is the first type created by make_signed_type or
2265 make_unsigned_type). */
2268 size_in_bytes (type)
2273 if (type == error_mark_node)
2274 return integer_zero_node;
2276 type = TYPE_MAIN_VARIANT (type);
2277 t = TYPE_SIZE_UNIT (type);
2281 incomplete_type_error (NULL_TREE, type);
2282 return size_zero_node;
2285 if (TREE_CODE (t) == INTEGER_CST)
2286 force_fit_type (t, 0);
2291 /* Return the size of TYPE (in bytes) as a wide integer
2292 or return -1 if the size can vary or is larger than an integer. */
2295 int_size_in_bytes (type)
2300 if (type == error_mark_node)
2303 type = TYPE_MAIN_VARIANT (type);
2304 t = TYPE_SIZE_UNIT (type);
2306 || TREE_CODE (t) != INTEGER_CST
2307 || TREE_OVERFLOW (t)
2308 || TREE_INT_CST_HIGH (t) != 0
2309 /* If the result would appear negative, it's too big to represent. */
2310 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2313 return TREE_INT_CST_LOW (t);
2316 /* Return the bit position of FIELD, in bits from the start of the record.
2317 This is a tree of type bitsizetype. */
2320 bit_position (field)
2324 return bit_from_pos (DECL_FIELD_OFFSET (field),
2325 DECL_FIELD_BIT_OFFSET (field));
2328 /* Likewise, but return as an integer. Abort if it cannot be represented
2329 in that way (since it could be a signed value, we don't have the option
2330 of returning -1 like int_size_in_byte can. */
2333 int_bit_position (field)
2336 return tree_low_cst (bit_position (field), 0);
2339 /* Return the byte position of FIELD, in bytes from the start of the record.
2340 This is a tree of type sizetype. */
2343 byte_position (field)
2346 return byte_from_pos (DECL_FIELD_OFFSET (field),
2347 DECL_FIELD_BIT_OFFSET (field));
2350 /* Likewise, but return as an integer. Abort if it cannot be represented
2351 in that way (since it could be a signed value, we don't have the option
2352 of returning -1 like int_size_in_byte can. */
2355 int_byte_position (field)
2358 return tree_low_cst (byte_position (field), 0);
2361 /* Return the strictest alignment, in bits, that T is known to have. */
2367 unsigned int align0, align1;
2369 switch (TREE_CODE (t))
2371 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
2372 /* If we have conversions, we know that the alignment of the
2373 object must meet each of the alignments of the types. */
2374 align0 = expr_align (TREE_OPERAND (t, 0));
2375 align1 = TYPE_ALIGN (TREE_TYPE (t));
2376 return MAX (align0, align1);
2378 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2379 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2380 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
2381 /* These don't change the alignment of an object. */
2382 return expr_align (TREE_OPERAND (t, 0));
2385 /* The best we can do is say that the alignment is the least aligned
2387 align0 = expr_align (TREE_OPERAND (t, 1));
2388 align1 = expr_align (TREE_OPERAND (t, 2));
2389 return MIN (align0, align1);
2391 case LABEL_DECL: case CONST_DECL:
2392 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2393 if (DECL_ALIGN (t) != 0)
2394 return DECL_ALIGN (t);
2398 return FUNCTION_BOUNDARY;
2404 /* Otherwise take the alignment from that of the type. */
2405 return TYPE_ALIGN (TREE_TYPE (t));
2408 /* Return, as a tree node, the number of elements for TYPE (which is an
2409 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2412 array_type_nelts (type)
2415 tree index_type, min, max;
2417 /* If they did it with unspecified bounds, then we should have already
2418 given an error about it before we got here. */
2419 if (! TYPE_DOMAIN (type))
2420 return error_mark_node;
2422 index_type = TYPE_DOMAIN (type);
2423 min = TYPE_MIN_VALUE (index_type);
2424 max = TYPE_MAX_VALUE (index_type);
2426 return (integer_zerop (min)
2428 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
2431 /* Return nonzero if arg is static -- a reference to an object in
2432 static storage. This is not the same as the C meaning of `static'. */
2438 switch (TREE_CODE (arg))
2441 /* Nested functions aren't static, since taking their address
2442 involves a trampoline. */
2443 return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
2444 && ! DECL_NON_ADDR_CONST_P (arg);
2447 return (TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2448 && ! DECL_NON_ADDR_CONST_P (arg);
2451 return TREE_STATIC (arg);
2457 /* If we are referencing a bitfield, we can't evaluate an
2458 ADDR_EXPR at compile time and so it isn't a constant. */
2460 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
2461 && staticp (TREE_OPERAND (arg, 0)));
2467 /* This case is technically correct, but results in setting
2468 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2471 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
2475 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2476 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2477 return staticp (TREE_OPERAND (arg, 0));
2484 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2485 Do this to any expression which may be used in more than one place,
2486 but must be evaluated only once.
2488 Normally, expand_expr would reevaluate the expression each time.
2489 Calling save_expr produces something that is evaluated and recorded
2490 the first time expand_expr is called on it. Subsequent calls to
2491 expand_expr just reuse the recorded value.
2493 The call to expand_expr that generates code that actually computes
2494 the value is the first call *at compile time*. Subsequent calls
2495 *at compile time* generate code to use the saved value.
2496 This produces correct result provided that *at run time* control
2497 always flows through the insns made by the first expand_expr
2498 before reaching the other places where the save_expr was evaluated.
2499 You, the caller of save_expr, must make sure this is so.
2501 Constants, and certain read-only nodes, are returned with no
2502 SAVE_EXPR because that is safe. Expressions containing placeholders
2503 are not touched; see tree.def for an explanation of what these
2510 register tree t = fold (expr);
2512 /* We don't care about whether this can be used as an lvalue in this
2514 while (TREE_CODE (t) == NON_LVALUE_EXPR)
2515 t = TREE_OPERAND (t, 0);
2517 /* If the tree evaluates to a constant, then we don't want to hide that
2518 fact (i.e. this allows further folding, and direct checks for constants).
2519 However, a read-only object that has side effects cannot be bypassed.
2520 Since it is no problem to reevaluate literals, we just return the
2523 if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t))
2524 || TREE_CODE (t) == SAVE_EXPR || TREE_CODE (t) == ERROR_MARK)
2527 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2528 it means that the size or offset of some field of an object depends on
2529 the value within another field.
2531 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2532 and some variable since it would then need to be both evaluated once and
2533 evaluated more than once. Front-ends must assure this case cannot
2534 happen by surrounding any such subexpressions in their own SAVE_EXPR
2535 and forcing evaluation at the proper time. */
2536 if (contains_placeholder_p (t))
2539 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
2541 /* This expression might be placed ahead of a jump to ensure that the
2542 value was computed on both sides of the jump. So make sure it isn't
2543 eliminated as dead. */
2544 TREE_SIDE_EFFECTS (t) = 1;
2548 /* Arrange for an expression to be expanded multiple independent
2549 times. This is useful for cleanup actions, as the backend can
2550 expand them multiple times in different places. */
2558 /* If this is already protected, no sense in protecting it again. */
2559 if (TREE_CODE (expr) == UNSAVE_EXPR)
2562 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
2563 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
2567 /* Returns the index of the first non-tree operand for CODE, or the number
2568 of operands if all are trees. */
2572 enum tree_code code;
2578 case GOTO_SUBROUTINE_EXPR:
2583 case WITH_CLEANUP_EXPR:
2584 /* Should be defined to be 2. */
2586 case METHOD_CALL_EXPR:
2589 return TREE_CODE_LENGTH (code);
2593 /* Perform any modifications to EXPR required when it is unsaved. Does
2594 not recurse into EXPR's subtrees. */
2597 unsave_expr_1 (expr)
2600 switch (TREE_CODE (expr))
2603 if (! SAVE_EXPR_PERSISTENT_P (expr))
2604 SAVE_EXPR_RTL (expr) = 0;
2608 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
2609 It's OK for this to happen if it was part of a subtree that
2610 isn't immediately expanded, such as operand 2 of another
2612 if (TREE_OPERAND (expr, 1))
2615 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
2616 TREE_OPERAND (expr, 3) = NULL_TREE;
2620 /* I don't yet know how to emit a sequence multiple times. */
2621 if (RTL_EXPR_SEQUENCE (expr) != 0)
2626 CALL_EXPR_RTL (expr) = 0;
2630 if (lang_unsave_expr_now != 0)
2631 (*lang_unsave_expr_now) (expr);
2636 /* Helper function for unsave_expr_now. */
2639 unsave_expr_now_r (expr)
2642 enum tree_code code;
2644 /* There's nothing to do for NULL_TREE. */
2648 unsave_expr_1 (expr);
2650 code = TREE_CODE (expr);
2651 switch (TREE_CODE_CLASS (code))
2653 case 'c': /* a constant */
2654 case 't': /* a type node */
2655 case 'd': /* A decl node */
2656 case 'b': /* A block node */
2659 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
2660 if (code == TREE_LIST)
2662 unsave_expr_now_r (TREE_VALUE (expr));
2663 unsave_expr_now_r (TREE_CHAIN (expr));
2667 case 'e': /* an expression */
2668 case 'r': /* a reference */
2669 case 's': /* an expression with side effects */
2670 case '<': /* a comparison expression */
2671 case '2': /* a binary arithmetic expression */
2672 case '1': /* a unary arithmetic expression */
2676 for (i = first_rtl_op (code) - 1; i >= 0; i--)
2677 unsave_expr_now_r (TREE_OPERAND (expr, i));
2686 /* Modify a tree in place so that all the evaluate only once things
2687 are cleared out. Return the EXPR given. */
2690 unsave_expr_now (expr)
2693 if (lang_unsave!= 0)
2694 (*lang_unsave) (&expr);
2696 unsave_expr_now_r (expr);
2701 /* Return 0 if it is safe to evaluate EXPR multiple times,
2702 return 1 if it is safe if EXPR is unsaved afterward, or
2703 return 2 if it is completely unsafe.
2705 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
2706 an expression tree, so that it safe to unsave them and the surrounding
2707 context will be correct.
2709 SAVE_EXPRs basically *only* appear replicated in an expression tree,
2710 occasionally across the whole of a function. It is therefore only
2711 safe to unsave a SAVE_EXPR if you know that all occurrences appear
2712 below the UNSAVE_EXPR.
2714 RTL_EXPRs consume their rtl during evaluation. It is therefore
2715 never possible to unsave them. */
2718 unsafe_for_reeval (expr)
2722 enum tree_code code;
2727 if (expr == NULL_TREE)
2730 code = TREE_CODE (expr);
2731 first_rtl = first_rtl_op (code);
2740 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
2742 tmp = unsafe_for_reeval (TREE_VALUE (exp));
2743 unsafeness = MAX (tmp, unsafeness);
2749 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
2750 return MAX (tmp, 1);
2757 /* ??? Add a lang hook if it becomes necessary. */
2761 switch (TREE_CODE_CLASS (code))
2763 case 'c': /* a constant */
2764 case 't': /* a type node */
2765 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2766 case 'd': /* A decl node */
2767 case 'b': /* A block node */
2770 case 'e': /* an expression */
2771 case 'r': /* a reference */
2772 case 's': /* an expression with side effects */
2773 case '<': /* a comparison expression */
2774 case '2': /* a binary arithmetic expression */
2775 case '1': /* a unary arithmetic expression */
2776 for (i = first_rtl - 1; i >= 0; i--)
2778 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
2779 unsafeness = MAX (tmp, unsafeness);
2789 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2790 or offset that depends on a field within a record. */
2793 contains_placeholder_p (exp)
2796 register enum tree_code code = TREE_CODE (exp);
2799 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2800 in it since it is supplying a value for it. */
2801 if (code == WITH_RECORD_EXPR)
2803 else if (code == PLACEHOLDER_EXPR)
2806 switch (TREE_CODE_CLASS (code))
2809 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2810 position computations since they will be converted into a
2811 WITH_RECORD_EXPR involving the reference, which will assume
2812 here will be valid. */
2813 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2816 if (code == TREE_LIST)
2817 return (contains_placeholder_p (TREE_VALUE (exp))
2818 || (TREE_CHAIN (exp) != 0
2819 && contains_placeholder_p (TREE_CHAIN (exp))));
2828 /* Ignoring the first operand isn't quite right, but works best. */
2829 return contains_placeholder_p (TREE_OPERAND (exp, 1));
2836 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
2837 || contains_placeholder_p (TREE_OPERAND (exp, 1))
2838 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
2841 /* If we already know this doesn't have a placeholder, don't
2843 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
2846 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
2847 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
2849 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
2854 return (TREE_OPERAND (exp, 1) != 0
2855 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
2861 switch (TREE_CODE_LENGTH (code))
2864 return contains_placeholder_p (TREE_OPERAND (exp, 0));
2866 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
2867 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
2878 /* Return 1 if EXP contains any expressions that produce cleanups for an
2879 outer scope to deal with. Used by fold. */
2887 if (! TREE_SIDE_EFFECTS (exp))
2890 switch (TREE_CODE (exp))
2893 case GOTO_SUBROUTINE_EXPR:
2894 case WITH_CLEANUP_EXPR:
2897 case CLEANUP_POINT_EXPR:
2901 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
2903 cmp = has_cleanups (TREE_VALUE (exp));
2913 /* This general rule works for most tree codes. All exceptions should be
2914 handled above. If this is a language-specific tree code, we can't
2915 trust what might be in the operand, so say we don't know
2917 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
2920 nops = first_rtl_op (TREE_CODE (exp));
2921 for (i = 0; i < nops; i++)
2922 if (TREE_OPERAND (exp, i) != 0)
2924 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
2925 if (type == 'e' || type == '<' || type == '1' || type == '2'
2926 || type == 'r' || type == 's')
2928 cmp = has_cleanups (TREE_OPERAND (exp, i));
2937 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2938 return a tree with all occurrences of references to F in a
2939 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2940 contains only arithmetic expressions or a CALL_EXPR with a
2941 PLACEHOLDER_EXPR occurring only in its arglist. */
2944 substitute_in_expr (exp, f, r)
2949 enum tree_code code = TREE_CODE (exp);
2954 switch (TREE_CODE_CLASS (code))
2961 if (code == PLACEHOLDER_EXPR)
2963 else if (code == TREE_LIST)
2965 op0 = (TREE_CHAIN (exp) == 0
2966 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
2967 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
2968 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2971 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2980 switch (TREE_CODE_LENGTH (code))
2983 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2984 if (op0 == TREE_OPERAND (exp, 0))
2987 new = fold (build1 (code, TREE_TYPE (exp), op0));
2991 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2992 could, but we don't support it. */
2993 if (code == RTL_EXPR)
2995 else if (code == CONSTRUCTOR)
2998 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2999 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
3000 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3003 new = fold (build (code, TREE_TYPE (exp), op0, op1));
3007 /* It cannot be that anything inside a SAVE_EXPR contains a
3008 PLACEHOLDER_EXPR. */
3009 if (code == SAVE_EXPR)
3012 else if (code == CALL_EXPR)
3014 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
3015 if (op1 == TREE_OPERAND (exp, 1))
3018 return build (code, TREE_TYPE (exp),
3019 TREE_OPERAND (exp, 0), op1, NULL_TREE);
3022 else if (code != COND_EXPR)
3025 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
3026 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
3027 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
3028 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3029 && op2 == TREE_OPERAND (exp, 2))
3032 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
3045 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3046 and it is the right field, replace it with R. */
3047 for (inner = TREE_OPERAND (exp, 0);
3048 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
3049 inner = TREE_OPERAND (inner, 0))
3051 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
3052 && TREE_OPERAND (exp, 1) == f)
3055 /* If this expression hasn't been completed let, leave it
3057 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
3058 && TREE_TYPE (inner) == 0)
3061 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
3062 if (op0 == TREE_OPERAND (exp, 0))
3065 new = fold (build (code, TREE_TYPE (exp), op0,
3066 TREE_OPERAND (exp, 1)));
3070 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
3071 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
3072 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
3073 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3074 && op2 == TREE_OPERAND (exp, 2))
3077 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
3082 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
3083 if (op0 == TREE_OPERAND (exp, 0))
3086 new = fold (build1 (code, TREE_TYPE (exp), op0));
3098 TREE_READONLY (new) = TREE_READONLY (exp);
3102 /* Stabilize a reference so that we can use it any number of times
3103 without causing its operands to be evaluated more than once.
3104 Returns the stabilized reference. This works by means of save_expr,
3105 so see the caveats in the comments about save_expr.
3107 Also allows conversion expressions whose operands are references.
3108 Any other kind of expression is returned unchanged. */
3111 stabilize_reference (ref)
3114 register tree result;
3115 register enum tree_code code = TREE_CODE (ref);
3122 /* No action is needed in this case. */
3128 case FIX_TRUNC_EXPR:
3129 case FIX_FLOOR_EXPR:
3130 case FIX_ROUND_EXPR:
3132 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3136 result = build_nt (INDIRECT_REF,
3137 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3141 result = build_nt (COMPONENT_REF,
3142 stabilize_reference (TREE_OPERAND (ref, 0)),
3143 TREE_OPERAND (ref, 1));
3147 result = build_nt (BIT_FIELD_REF,
3148 stabilize_reference (TREE_OPERAND (ref, 0)),
3149 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3150 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3154 result = build_nt (ARRAY_REF,
3155 stabilize_reference (TREE_OPERAND (ref, 0)),
3156 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
3160 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3161 it wouldn't be ignored. This matters when dealing with
3163 return stabilize_reference_1 (ref);
3166 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
3167 save_expr (build1 (ADDR_EXPR,
3168 build_pointer_type (TREE_TYPE (ref)),
3172 /* If arg isn't a kind of lvalue we recognize, make no change.
3173 Caller should recognize the error for an invalid lvalue. */
3178 return error_mark_node;
3181 TREE_TYPE (result) = TREE_TYPE (ref);
3182 TREE_READONLY (result) = TREE_READONLY (ref);
3183 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3184 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3189 /* Subroutine of stabilize_reference; this is called for subtrees of
3190 references. Any expression with side-effects must be put in a SAVE_EXPR
3191 to ensure that it is only evaluated once.
3193 We don't put SAVE_EXPR nodes around everything, because assigning very
3194 simple expressions to temporaries causes us to miss good opportunities
3195 for optimizations. Among other things, the opportunity to fold in the
3196 addition of a constant into an addressing mode often gets lost, e.g.
3197 "y[i+1] += x;". In general, we take the approach that we should not make
3198 an assignment unless we are forced into it - i.e., that any non-side effect
3199 operator should be allowed, and that cse should take care of coalescing
3200 multiple utterances of the same expression should that prove fruitful. */
3203 stabilize_reference_1 (e)
3206 register tree result;
3207 register enum tree_code code = TREE_CODE (e);
3209 /* We cannot ignore const expressions because it might be a reference
3210 to a const array but whose index contains side-effects. But we can
3211 ignore things that are actual constant or that already have been
3212 handled by this function. */
3214 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
3217 switch (TREE_CODE_CLASS (code))
3227 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3228 so that it will only be evaluated once. */
3229 /* The reference (r) and comparison (<) classes could be handled as
3230 below, but it is generally faster to only evaluate them once. */
3231 if (TREE_SIDE_EFFECTS (e))
3232 return save_expr (e);
3236 /* Constants need no processing. In fact, we should never reach
3241 /* Division is slow and tends to be compiled with jumps,
3242 especially the division by powers of 2 that is often
3243 found inside of an array reference. So do it just once. */
3244 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3245 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3246 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3247 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3248 return save_expr (e);
3249 /* Recursively stabilize each operand. */
3250 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3251 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3255 /* Recursively stabilize each operand. */
3256 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3263 TREE_TYPE (result) = TREE_TYPE (e);
3264 TREE_READONLY (result) = TREE_READONLY (e);
3265 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3266 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3271 /* Low-level constructors for expressions. */
3273 /* Build an expression of code CODE, data type TYPE,
3274 and operands as specified by the arguments ARG1 and following arguments.
3275 Expressions and reference nodes can be created this way.
3276 Constants, decls, types and misc nodes cannot be. */
3279 build VPARAMS ((enum tree_code code, tree tt, ...))
3281 #ifndef ANSI_PROTOTYPES
3282 enum tree_code code;
3287 register int length;
3293 #ifndef ANSI_PROTOTYPES
3294 code = va_arg (p, enum tree_code);
3295 tt = va_arg (p, tree);
3298 t = make_node (code);
3299 length = TREE_CODE_LENGTH (code);
3302 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_RAISED for
3303 the result based on those same flags for the arguments. But, if
3304 the arguments aren't really even `tree' expressions, we shouldn't
3305 be trying to do this. */
3306 fro = first_rtl_op (code);
3310 /* This is equivalent to the loop below, but faster. */
3311 register tree arg0 = va_arg (p, tree);
3312 register tree arg1 = va_arg (p, tree);
3313 TREE_OPERAND (t, 0) = arg0;
3314 TREE_OPERAND (t, 1) = arg1;
3315 if (arg0 && fro > 0)
3317 if (TREE_SIDE_EFFECTS (arg0))
3318 TREE_SIDE_EFFECTS (t) = 1;
3320 if (arg1 && fro > 1)
3322 if (TREE_SIDE_EFFECTS (arg1))
3323 TREE_SIDE_EFFECTS (t) = 1;
3326 else if (length == 1)
3328 register tree arg0 = va_arg (p, tree);
3330 /* Call build1 for this! */
3331 if (TREE_CODE_CLASS (code) != 's')
3333 TREE_OPERAND (t, 0) = arg0;
3336 if (arg0 && TREE_SIDE_EFFECTS (arg0))
3337 TREE_SIDE_EFFECTS (t) = 1;
3342 for (i = 0; i < length; i++)
3344 register tree operand = va_arg (p, tree);
3345 TREE_OPERAND (t, i) = operand;
3346 if (operand && fro > i)
3348 if (TREE_SIDE_EFFECTS (operand))
3349 TREE_SIDE_EFFECTS (t) = 1;
3357 /* Same as above, but only builds for unary operators.
3358 Saves lions share of calls to `build'; cuts down use
3359 of varargs, which is expensive for RISC machines. */
3362 build1 (code, type, node)
3363 enum tree_code code;
3367 register struct obstack *obstack = expression_obstack;
3368 register int length;
3369 #ifdef GATHER_STATISTICS
3370 register tree_node_kind kind;
3374 #ifdef GATHER_STATISTICS
3375 if (TREE_CODE_CLASS (code) == 'r')
3381 length = sizeof (struct tree_exp);
3384 t = ggc_alloc_tree (length);
3386 t = (tree) obstack_alloc (obstack, length);
3388 memset ((PTR) t, 0, sizeof (struct tree_common));
3390 #ifdef GATHER_STATISTICS
3391 tree_node_counts[(int) kind]++;
3392 tree_node_sizes[(int) kind] += length;
3395 TREE_SET_CODE (t, code);
3396 TREE_SET_PERMANENT (t);
3398 TREE_TYPE (t) = type;
3399 TREE_COMPLEXITY (t) = 0;
3400 TREE_OPERAND (t, 0) = node;
3401 if (node && first_rtl_op (code) != 0 && TREE_SIDE_EFFECTS (node))
3402 TREE_SIDE_EFFECTS (t) = 1;
3410 case PREDECREMENT_EXPR:
3411 case PREINCREMENT_EXPR:
3412 case POSTDECREMENT_EXPR:
3413 case POSTINCREMENT_EXPR:
3414 /* All of these have side-effects, no matter what their
3416 TREE_SIDE_EFFECTS (t) = 1;
3426 /* Similar except don't specify the TREE_TYPE
3427 and leave the TREE_SIDE_EFFECTS as 0.
3428 It is permissible for arguments to be null,
3429 or even garbage if their values do not matter. */
3432 build_nt VPARAMS ((enum tree_code code, ...))
3434 #ifndef ANSI_PROTOTYPES
3435 enum tree_code code;
3439 register int length;
3444 #ifndef ANSI_PROTOTYPES
3445 code = va_arg (p, enum tree_code);
3448 t = make_node (code);
3449 length = TREE_CODE_LENGTH (code);
3451 for (i = 0; i < length; i++)
3452 TREE_OPERAND (t, i) = va_arg (p, tree);
3458 /* Similar to `build_nt', except we build
3459 on the temp_decl_obstack, regardless. */
3462 build_parse_node VPARAMS ((enum tree_code code, ...))
3464 #ifndef ANSI_PROTOTYPES
3465 enum tree_code code;
3467 register struct obstack *ambient_obstack = expression_obstack;
3470 register int length;
3475 #ifndef ANSI_PROTOTYPES
3476 code = va_arg (p, enum tree_code);
3479 expression_obstack = &temp_decl_obstack;
3481 t = make_node (code);
3482 length = TREE_CODE_LENGTH (code);
3484 for (i = 0; i < length; i++)
3485 TREE_OPERAND (t, i) = va_arg (p, tree);
3488 expression_obstack = ambient_obstack;
3493 /* Commented out because this wants to be done very
3494 differently. See cp-lex.c. */
3496 build_op_identifier (op1, op2)
3499 register tree t = make_node (OP_IDENTIFIER);
3500 TREE_PURPOSE (t) = op1;
3501 TREE_VALUE (t) = op2;
3506 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3507 We do NOT enter this node in any sort of symbol table.
3509 layout_decl is used to set up the decl's storage layout.
3510 Other slots are initialized to 0 or null pointers. */
3513 build_decl (code, name, type)
3514 enum tree_code code;
3519 t = make_node (code);
3521 /* if (type == error_mark_node)
3522 type = integer_type_node; */
3523 /* That is not done, deliberately, so that having error_mark_node
3524 as the type can suppress useless errors in the use of this variable. */
3526 DECL_NAME (t) = name;
3527 DECL_ASSEMBLER_NAME (t) = name;
3528 TREE_TYPE (t) = type;
3530 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3532 else if (code == FUNCTION_DECL)
3533 DECL_MODE (t) = FUNCTION_MODE;
3538 /* BLOCK nodes are used to represent the structure of binding contours
3539 and declarations, once those contours have been exited and their contents
3540 compiled. This information is used for outputting debugging info. */
3543 build_block (vars, tags, subblocks, supercontext, chain)
3544 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
3546 register tree block = make_node (BLOCK);
3548 BLOCK_VARS (block) = vars;
3549 BLOCK_SUBBLOCKS (block) = subblocks;
3550 BLOCK_SUPERCONTEXT (block) = supercontext;
3551 BLOCK_CHAIN (block) = chain;
3555 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3556 location where an expression or an identifier were encountered. It
3557 is necessary for languages where the frontend parser will handle
3558 recursively more than one file (Java is one of them). */
3561 build_expr_wfl (node, file, line, col)
3566 static const char *last_file = 0;
3567 static tree last_filenode = NULL_TREE;
3568 register tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
3570 EXPR_WFL_NODE (wfl) = node;
3571 EXPR_WFL_SET_LINECOL (wfl, line, col);
3572 if (file != last_file)
3575 last_filenode = file ? get_identifier (file) : NULL_TREE;
3578 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
3581 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
3582 TREE_TYPE (wfl) = TREE_TYPE (node);
3588 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3592 build_decl_attribute_variant (ddecl, attribute)
3593 tree ddecl, attribute;
3595 DECL_MACHINE_ATTRIBUTES (ddecl) = attribute;
3599 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3602 Record such modified types already made so we don't make duplicates. */
3605 build_type_attribute_variant (ttype, attribute)
3606 tree ttype, attribute;
3608 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3610 unsigned int hashcode;
3613 push_obstacks (TYPE_OBSTACK (ttype), TYPE_OBSTACK (ttype));
3614 ntype = copy_node (ttype);
3616 TYPE_POINTER_TO (ntype) = 0;
3617 TYPE_REFERENCE_TO (ntype) = 0;
3618 TYPE_ATTRIBUTES (ntype) = attribute;
3620 /* Create a new main variant of TYPE. */
3621 TYPE_MAIN_VARIANT (ntype) = ntype;
3622 TYPE_NEXT_VARIANT (ntype) = 0;
3623 set_type_quals (ntype, TYPE_UNQUALIFIED);
3625 hashcode = (TYPE_HASH (TREE_CODE (ntype))
3626 + TYPE_HASH (TREE_TYPE (ntype))
3627 + attribute_hash_list (attribute));
3629 switch (TREE_CODE (ntype))
3632 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
3635 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
3638 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
3641 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
3647 ntype = type_hash_canon (hashcode, ntype);
3648 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
3655 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3656 or type TYPE and 0 otherwise. Validity is determined the configuration
3657 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3660 valid_machine_attribute (attr_name, attr_args, decl, type)
3662 tree attr_args ATTRIBUTE_UNUSED;
3663 tree decl ATTRIBUTE_UNUSED;
3664 tree type ATTRIBUTE_UNUSED;
3667 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3668 tree decl_attr_list = decl != 0 ? DECL_MACHINE_ATTRIBUTES (decl) : 0;
3670 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3671 tree type_attr_list = TYPE_ATTRIBUTES (type);
3674 if (TREE_CODE (attr_name) != IDENTIFIER_NODE)
3677 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3679 && VALID_MACHINE_DECL_ATTRIBUTE (decl, decl_attr_list, attr_name,
3682 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3685 if (attr != NULL_TREE)
3687 /* Override existing arguments. Declarations are unique so we can
3688 modify this in place. */
3689 TREE_VALUE (attr) = attr_args;
3693 decl_attr_list = tree_cons (attr_name, attr_args, decl_attr_list);
3694 decl = build_decl_attribute_variant (decl, decl_attr_list);
3701 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3703 /* Don't apply the attribute to both the decl and the type. */
3705 else if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name,
3708 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3711 if (attr != NULL_TREE)
3713 /* Override existing arguments.
3714 ??? This currently works since attribute arguments are not
3715 included in `attribute_hash_list'. Something more complicated
3716 may be needed in the future. */
3717 TREE_VALUE (attr) = attr_args;
3721 /* If this is part of a declaration, create a type variant,
3722 otherwise, this is part of a type definition, so add it
3723 to the base type. */
3724 type_attr_list = tree_cons (attr_name, attr_args, type_attr_list);
3726 type = build_type_attribute_variant (type, type_attr_list);
3728 TYPE_ATTRIBUTES (type) = type_attr_list;
3732 TREE_TYPE (decl) = type;
3737 /* Handle putting a type attribute on pointer-to-function-type by putting
3738 the attribute on the function type. */
3739 else if (POINTER_TYPE_P (type)
3740 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3741 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type), type_attr_list,
3742 attr_name, attr_args))
3744 tree inner_type = TREE_TYPE (type);
3745 tree inner_attr_list = TYPE_ATTRIBUTES (inner_type);
3746 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
3749 if (attr != NULL_TREE)
3750 TREE_VALUE (attr) = attr_args;
3753 inner_attr_list = tree_cons (attr_name, attr_args, inner_attr_list);
3754 inner_type = build_type_attribute_variant (inner_type,
3759 TREE_TYPE (decl) = build_pointer_type (inner_type);
3762 /* Clear TYPE_POINTER_TO for the old inner type, since
3763 `type' won't be pointing to it anymore. */
3764 TYPE_POINTER_TO (TREE_TYPE (type)) = NULL_TREE;
3765 TREE_TYPE (type) = inner_type;
3775 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3778 We try both `text' and `__text__', ATTR may be either one. */
3779 /* ??? It might be a reasonable simplification to require ATTR to be only
3780 `text'. One might then also require attribute lists to be stored in
3781 their canonicalized form. */
3784 is_attribute_p (attr, ident)
3788 int ident_len, attr_len;
3791 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3794 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
3797 p = IDENTIFIER_POINTER (ident);
3798 ident_len = strlen (p);
3799 attr_len = strlen (attr);
3801 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3805 || attr[attr_len - 2] != '_'
3806 || attr[attr_len - 1] != '_')
3808 if (ident_len == attr_len - 4
3809 && strncmp (attr + 2, p, attr_len - 4) == 0)
3814 if (ident_len == attr_len + 4
3815 && p[0] == '_' && p[1] == '_'
3816 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3817 && strncmp (attr, p + 2, attr_len) == 0)
3824 /* Given an attribute name and a list of attributes, return a pointer to the
3825 attribute's list element if the attribute is part of the list, or NULL_TREE
3829 lookup_attribute (attr_name, list)
3830 const char *attr_name;
3835 for (l = list; l; l = TREE_CHAIN (l))
3837 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
3839 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
3846 /* Return an attribute list that is the union of a1 and a2. */
3849 merge_attributes (a1, a2)
3850 register tree a1, a2;
3854 /* Either one unset? Take the set one. */
3856 if ((attributes = a1) == 0)
3859 /* One that completely contains the other? Take it. */
3861 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3863 if (attribute_list_contained (a2, a1))
3867 /* Pick the longest list, and hang on the other list. */
3868 /* ??? For the moment we punt on the issue of attrs with args. */
3870 if (list_length (a1) < list_length (a2))
3871 attributes = a2, a2 = a1;
3873 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3874 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3875 attributes) == NULL_TREE)
3877 a1 = copy_node (a2);
3878 TREE_CHAIN (a1) = attributes;
3886 /* Given types T1 and T2, merge their attributes and return
3890 merge_machine_type_attributes (t1, t2)
3893 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3894 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1, t2);
3896 return merge_attributes (TYPE_ATTRIBUTES (t1),
3897 TYPE_ATTRIBUTES (t2));
3901 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3905 merge_machine_decl_attributes (olddecl, newdecl)
3906 tree olddecl, newdecl;
3908 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3909 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl, newdecl);
3911 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl),
3912 DECL_MACHINE_ATTRIBUTES (newdecl));
3916 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3917 of the various TYPE_QUAL values. */
3920 set_type_quals (type, type_quals)
3924 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3925 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3926 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3929 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
3930 the same kind of data as TYPE describes. Variants point to the
3931 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
3932 and it points to a chain of other variants so that duplicate
3933 variants are never made. Only main variants should ever appear as
3934 types of expressions. */
3937 build_qualified_type (type, type_quals)
3943 /* Search the chain of variants to see if there is already one there just
3944 like the one we need to have. If so, use that existing one. We must
3945 preserve the TYPE_NAME, since there is code that depends on this. */
3947 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3948 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
3951 /* We need a new one. */
3952 t = build_type_copy (type);
3953 set_type_quals (t, type_quals);
3957 /* Create a new variant of TYPE, equivalent but distinct.
3958 This is so the caller can modify it. */
3961 build_type_copy (type)
3964 register tree t, m = TYPE_MAIN_VARIANT (type);
3965 register struct obstack *ambient_obstack = current_obstack;
3967 current_obstack = TYPE_OBSTACK (type);
3968 t = copy_node (type);
3969 current_obstack = ambient_obstack;
3971 TYPE_POINTER_TO (t) = 0;
3972 TYPE_REFERENCE_TO (t) = 0;
3974 /* Add this type to the chain of variants of TYPE. */
3975 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3976 TYPE_NEXT_VARIANT (m) = t;
3981 /* Hashing of types so that we don't make duplicates.
3982 The entry point is `type_hash_canon'. */
3984 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3985 with types in the TREE_VALUE slots), by adding the hash codes
3986 of the individual types. */
3989 type_hash_list (list)
3992 unsigned int hashcode;
3995 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3996 hashcode += TYPE_HASH (TREE_VALUE (tail));
4001 /* These are the Hashtable callback functions. */
4003 /* Returns true if the types are equal. */
4006 type_hash_eq (va, vb)
4010 const struct type_hash *a = va, *b = vb;
4011 if (a->hash == b->hash
4012 && TREE_CODE (a->type) == TREE_CODE (b->type)
4013 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
4014 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4015 TYPE_ATTRIBUTES (b->type))
4016 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
4017 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4018 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4019 TYPE_MAX_VALUE (b->type)))
4020 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4021 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4022 TYPE_MIN_VALUE (b->type)))
4023 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
4024 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
4025 || (TYPE_DOMAIN (a->type)
4026 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
4027 && TYPE_DOMAIN (b->type)
4028 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
4029 && type_list_equal (TYPE_DOMAIN (a->type),
4030 TYPE_DOMAIN (b->type)))))
4035 /* Return the cached hash value. */
4038 type_hash_hash (item)
4041 return ((const struct type_hash *) item)->hash;
4044 /* Look in the type hash table for a type isomorphic to TYPE.
4045 If one is found, return it. Otherwise return 0. */
4048 type_hash_lookup (hashcode, type)
4049 unsigned int hashcode;
4052 struct type_hash *h, in;
4054 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4055 must call that routine before comparing TYPE_ALIGNs. */
4061 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4067 /* Add an entry to the type-hash-table
4068 for a type TYPE whose hash code is HASHCODE. */
4071 type_hash_add (hashcode, type)
4072 unsigned int hashcode;
4075 struct type_hash *h;
4078 h = (struct type_hash *) permalloc (sizeof (struct type_hash));
4081 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4082 *(struct type_hash **) loc = h;
4085 /* Given TYPE, and HASHCODE its hash code, return the canonical
4086 object for an identical type if one already exists.
4087 Otherwise, return TYPE, and record it as the canonical object
4088 if it is a permanent object.
4090 To use this function, first create a type of the sort you want.
4091 Then compute its hash code from the fields of the type that
4092 make it different from other similar types.
4093 Then call this function and use the value.
4094 This function frees the type you pass in if it is a duplicate. */
4096 /* Set to 1 to debug without canonicalization. Never set by program. */
4097 int debug_no_type_hash = 0;
4100 type_hash_canon (hashcode, type)
4101 unsigned int hashcode;
4106 if (debug_no_type_hash)
4109 t1 = type_hash_lookup (hashcode, type);
4113 obstack_free (TYPE_OBSTACK (type), type);
4115 #ifdef GATHER_STATISTICS
4116 tree_node_counts[(int) t_kind]--;
4117 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4122 /* If this is a permanent type, record it for later reuse. */
4123 if (ggc_p || TREE_PERMANENT (type))
4124 type_hash_add (hashcode, type);
4129 /* Callback function for htab_traverse. */
4132 mark_hash_entry (entry, param)
4134 void *param ATTRIBUTE_UNUSED;
4136 struct type_hash *p = *(struct type_hash **) entry;
4138 ggc_mark_tree (p->type);
4140 /* Continue scan. */
4144 /* Mark ARG (which is really a htab_t *) for GC. */
4147 mark_type_hash (arg)
4150 htab_t t = *(htab_t *) arg;
4152 htab_traverse (t, mark_hash_entry, 0);
4156 print_type_hash_statistics ()
4158 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4159 (long) htab_size (type_hash_table),
4160 (long) htab_elements (type_hash_table),
4161 htab_collisions (type_hash_table));
4164 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4165 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4166 by adding the hash codes of the individual attributes. */
4169 attribute_hash_list (list)
4172 unsigned int hashcode;
4175 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
4176 /* ??? Do we want to add in TREE_VALUE too? */
4177 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
4181 /* Given two lists of attributes, return true if list l2 is
4182 equivalent to l1. */
4185 attribute_list_equal (l1, l2)
4188 return attribute_list_contained (l1, l2)
4189 && attribute_list_contained (l2, l1);
4192 /* Given two lists of attributes, return true if list L2 is
4193 completely contained within L1. */
4194 /* ??? This would be faster if attribute names were stored in a canonicalized
4195 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4196 must be used to show these elements are equivalent (which they are). */
4197 /* ??? It's not clear that attributes with arguments will always be handled
4201 attribute_list_contained (l1, l2)
4204 register tree t1, t2;
4206 /* First check the obvious, maybe the lists are identical. */
4210 /* Maybe the lists are similar. */
4211 for (t1 = l1, t2 = l2;
4213 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4214 && TREE_VALUE (t1) == TREE_VALUE (t2);
4215 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4217 /* Maybe the lists are equal. */
4218 if (t1 == 0 && t2 == 0)
4221 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4224 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4229 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
4236 /* Given two lists of types
4237 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4238 return 1 if the lists contain the same types in the same order.
4239 Also, the TREE_PURPOSEs must match. */
4242 type_list_equal (l1, l2)
4245 register tree t1, t2;
4247 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4248 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4249 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4250 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4251 && (TREE_TYPE (TREE_PURPOSE (t1))
4252 == TREE_TYPE (TREE_PURPOSE (t2))))))
4258 /* Nonzero if integer constants T1 and T2
4259 represent the same constant value. */
4262 tree_int_cst_equal (t1, t2)
4268 if (t1 == 0 || t2 == 0)
4271 if (TREE_CODE (t1) == INTEGER_CST
4272 && TREE_CODE (t2) == INTEGER_CST
4273 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4274 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4280 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4281 The precise way of comparison depends on their data type. */
4284 tree_int_cst_lt (t1, t2)
4290 if (! TREE_UNSIGNED (TREE_TYPE (t1)))
4291 return INT_CST_LT (t1, t2);
4293 return INT_CST_LT_UNSIGNED (t1, t2);
4296 /* Return 1 if T is an INTEGER_CST that can be represented in a single
4297 HOST_WIDE_INT value. If POS is nonzero, the result must be positive. */
4300 host_integerp (t, pos)
4304 return (TREE_CODE (t) == INTEGER_CST
4305 && ! TREE_OVERFLOW (t)
4306 && ((TREE_INT_CST_HIGH (t) == 0
4307 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4308 || (! pos && TREE_INT_CST_HIGH (t) == -1
4309 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
4310 || (! pos && TREE_INT_CST_HIGH (t) == 0
4311 && TREE_UNSIGNED (TREE_TYPE (t)))));
4314 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4315 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4316 be positive. Abort if we cannot satisfy the above conditions. */
4319 tree_low_cst (t, pos)
4323 if (host_integerp (t, pos))
4324 return TREE_INT_CST_LOW (t);
4329 /* Return the most significant bit of the integer constant T. */
4332 tree_int_cst_msb (t)
4337 unsigned HOST_WIDE_INT l;
4339 /* Note that using TYPE_PRECISION here is wrong. We care about the
4340 actual bits, not the (arbitrary) range of the type. */
4341 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4342 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4343 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4344 return (l & 1) == 1;
4347 /* Return an indication of the sign of the integer constant T.
4348 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4349 Note that -1 will never be returned it T's type is unsigned. */
4352 tree_int_cst_sgn (t)
4355 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4357 else if (TREE_UNSIGNED (TREE_TYPE (t)))
4359 else if (TREE_INT_CST_HIGH (t) < 0)
4365 /* Compare two constructor-element-type constants. Return 1 if the lists
4366 are known to be equal; otherwise return 0. */
4369 simple_cst_list_equal (l1, l2)
4372 while (l1 != NULL_TREE && l2 != NULL_TREE)
4374 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4377 l1 = TREE_CHAIN (l1);
4378 l2 = TREE_CHAIN (l2);
4384 /* Return truthvalue of whether T1 is the same tree structure as T2.
4385 Return 1 if they are the same.
4386 Return 0 if they are understandably different.
4387 Return -1 if either contains tree structure not understood by
4391 simple_cst_equal (t1, t2)
4394 register enum tree_code code1, code2;
4400 if (t1 == 0 || t2 == 0)
4403 code1 = TREE_CODE (t1);
4404 code2 = TREE_CODE (t2);
4406 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4408 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4409 || code2 == NON_LVALUE_EXPR)
4410 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4412 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4415 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4416 || code2 == NON_LVALUE_EXPR)
4417 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4425 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4426 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4429 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4432 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4433 && ! bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4434 TREE_STRING_LENGTH (t1)));
4437 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
4443 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4446 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4450 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4453 /* Special case: if either target is an unallocated VAR_DECL,
4454 it means that it's going to be unified with whatever the
4455 TARGET_EXPR is really supposed to initialize, so treat it
4456 as being equivalent to anything. */
4457 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4458 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4459 && DECL_RTL (TREE_OPERAND (t1, 0)) == 0)
4460 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4461 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4462 && DECL_RTL (TREE_OPERAND (t2, 0)) == 0))
4465 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4470 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4472 case WITH_CLEANUP_EXPR:
4473 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4477 return simple_cst_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2));
4480 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4481 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4495 /* This general rule works for most tree codes. All exceptions should be
4496 handled above. If this is a language-specific tree code, we can't
4497 trust what might be in the operand, so say we don't know
4499 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4502 switch (TREE_CODE_CLASS (code1))
4511 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4513 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4525 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4526 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4527 than U, respectively. */
4530 compare_tree_int (t, u)
4534 if (tree_int_cst_sgn (t) < 0)
4536 else if (TREE_INT_CST_HIGH (t) != 0)
4538 else if (TREE_INT_CST_LOW (t) == u)
4540 else if (TREE_INT_CST_LOW (t) < u)
4546 /* Constructors for pointer, array and function types.
4547 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4548 constructed by language-dependent code, not here.) */
4550 /* Construct, lay out and return the type of pointers to TO_TYPE.
4551 If such a type has already been constructed, reuse it. */
4554 build_pointer_type (to_type)
4557 register tree t = TYPE_POINTER_TO (to_type);
4559 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4564 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4565 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
4566 t = make_node (POINTER_TYPE);
4569 TREE_TYPE (t) = to_type;
4571 /* Record this type as the pointer to TO_TYPE. */
4572 TYPE_POINTER_TO (to_type) = t;
4574 /* Lay out the type. This function has many callers that are concerned
4575 with expression-construction, and this simplifies them all.
4576 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4582 /* Build the node for the type of references-to-TO_TYPE. */
4585 build_reference_type (to_type)
4588 register tree t = TYPE_REFERENCE_TO (to_type);
4590 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4595 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4596 push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type));
4597 t = make_node (REFERENCE_TYPE);
4600 TREE_TYPE (t) = to_type;
4602 /* Record this type as the pointer to TO_TYPE. */
4603 TYPE_REFERENCE_TO (to_type) = t;
4610 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4611 MAXVAL should be the maximum value in the domain
4612 (one less than the length of the array).
4614 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4615 We don't enforce this limit, that is up to caller (e.g. language front end).
4616 The limit exists because the result is a signed type and we don't handle
4617 sizes that use more than one HOST_WIDE_INT. */
4620 build_index_type (maxval)
4623 register tree itype = make_node (INTEGER_TYPE);
4625 TREE_TYPE (itype) = sizetype;
4626 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4627 TYPE_MIN_VALUE (itype) = size_zero_node;
4629 push_obstacks (TYPE_OBSTACK (itype), TYPE_OBSTACK (itype));
4630 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4633 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4634 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4635 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4636 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4637 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4639 if (host_integerp (maxval, 1))
4640 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4645 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4646 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4647 low bound LOWVAL and high bound HIGHVAL.
4648 if TYPE==NULL_TREE, sizetype is used. */
4651 build_range_type (type, lowval, highval)
4652 tree type, lowval, highval;
4654 register tree itype = make_node (INTEGER_TYPE);
4656 TREE_TYPE (itype) = type;
4657 if (type == NULL_TREE)
4660 push_obstacks (TYPE_OBSTACK (itype), TYPE_OBSTACK (itype));
4661 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4662 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4665 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4666 TYPE_MODE (itype) = TYPE_MODE (type);
4667 TYPE_SIZE (itype) = TYPE_SIZE (type);
4668 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4669 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4670 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4672 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4673 return type_hash_canon (tree_low_cst (highval, 0)
4674 - tree_low_cst (lowval, 0),
4680 /* Just like build_index_type, but takes lowval and highval instead
4681 of just highval (maxval). */
4684 build_index_2_type (lowval,highval)
4685 tree lowval, highval;
4687 return build_range_type (sizetype, lowval, highval);
4690 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4691 Needed because when index types are not hashed, equal index types
4692 built at different times appear distinct, even though structurally,
4696 index_type_equal (itype1, itype2)
4697 tree itype1, itype2;
4699 if (TREE_CODE (itype1) != TREE_CODE (itype2))
4702 if (TREE_CODE (itype1) == INTEGER_TYPE)
4704 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
4705 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
4706 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
4707 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
4710 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
4711 TYPE_MIN_VALUE (itype2))
4712 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
4713 TYPE_MAX_VALUE (itype2)))
4720 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4721 and number of elements specified by the range of values of INDEX_TYPE.
4722 If such a type has already been constructed, reuse it. */
4725 build_array_type (elt_type, index_type)
4726 tree elt_type, index_type;
4729 unsigned int hashcode;
4731 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4733 error ("arrays of functions are not meaningful");
4734 elt_type = integer_type_node;
4737 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4738 build_pointer_type (elt_type);
4740 /* Allocate the array after the pointer type,
4741 in case we free it in type_hash_canon. */
4742 t = make_node (ARRAY_TYPE);
4743 TREE_TYPE (t) = elt_type;
4744 TYPE_DOMAIN (t) = index_type;
4746 if (index_type == 0)
4751 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
4752 t = type_hash_canon (hashcode, t);
4754 if (!COMPLETE_TYPE_P (t))
4759 /* Return the TYPE of the elements comprising
4760 the innermost dimension of ARRAY. */
4763 get_inner_array_type (array)
4766 tree type = TREE_TYPE (array);
4768 while (TREE_CODE (type) == ARRAY_TYPE)
4769 type = TREE_TYPE (type);
4774 /* Construct, lay out and return
4775 the type of functions returning type VALUE_TYPE
4776 given arguments of types ARG_TYPES.
4777 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4778 are data type nodes for the arguments of the function.
4779 If such a type has already been constructed, reuse it. */
4782 build_function_type (value_type, arg_types)
4783 tree value_type, arg_types;
4786 unsigned int hashcode;
4788 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4790 error ("function return type cannot be function");
4791 value_type = integer_type_node;
4794 /* Make a node of the sort we want. */
4795 t = make_node (FUNCTION_TYPE);
4796 TREE_TYPE (t) = value_type;
4797 TYPE_ARG_TYPES (t) = arg_types;
4799 /* If we already have such a type, use the old one and free this one. */
4800 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
4801 t = type_hash_canon (hashcode, t);
4803 if (!COMPLETE_TYPE_P (t))
4808 /* Construct, lay out and return the type of methods belonging to class
4809 BASETYPE and whose arguments and values are described by TYPE.
4810 If that type exists already, reuse it.
4811 TYPE must be a FUNCTION_TYPE node. */
4814 build_method_type (basetype, type)
4815 tree basetype, type;
4818 unsigned int hashcode;
4820 /* Make a node of the sort we want. */
4821 t = make_node (METHOD_TYPE);
4823 if (TREE_CODE (type) != FUNCTION_TYPE)
4826 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4827 TREE_TYPE (t) = TREE_TYPE (type);
4829 /* The actual arglist for this function includes a "hidden" argument
4830 which is "this". Put it into the list of argument types. */
4833 = tree_cons (NULL_TREE,
4834 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
4836 /* If we already have such a type, use the old one and free this one. */
4837 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4838 t = type_hash_canon (hashcode, t);
4840 if (!COMPLETE_TYPE_P (t))
4846 /* Construct, lay out and return the type of offsets to a value
4847 of type TYPE, within an object of type BASETYPE.
4848 If a suitable offset type exists already, reuse it. */
4851 build_offset_type (basetype, type)
4852 tree basetype, type;
4855 unsigned int hashcode;
4857 /* Make a node of the sort we want. */
4858 t = make_node (OFFSET_TYPE);
4860 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4861 TREE_TYPE (t) = type;
4863 /* If we already have such a type, use the old one and free this one. */
4864 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4865 t = type_hash_canon (hashcode, t);
4867 if (!COMPLETE_TYPE_P (t))
4873 /* Create a complex type whose components are COMPONENT_TYPE. */
4876 build_complex_type (component_type)
4877 tree component_type;
4880 unsigned int hashcode;
4882 /* Make a node of the sort we want. */
4883 t = make_node (COMPLEX_TYPE);
4885 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4886 set_type_quals (t, TYPE_QUALS (component_type));
4888 /* If we already have such a type, use the old one and free this one. */
4889 hashcode = TYPE_HASH (component_type);
4890 t = type_hash_canon (hashcode, t);
4892 if (!COMPLETE_TYPE_P (t))
4895 /* If we are writing Dwarf2 output we need to create a name,
4896 since complex is a fundamental type. */
4897 if (write_symbols == DWARF2_DEBUG && ! TYPE_NAME (t))
4900 if (component_type == char_type_node)
4901 name = "complex char";
4902 else if (component_type == signed_char_type_node)
4903 name = "complex signed char";
4904 else if (component_type == unsigned_char_type_node)
4905 name = "complex unsigned char";
4906 else if (component_type == short_integer_type_node)
4907 name = "complex short int";
4908 else if (component_type == short_unsigned_type_node)
4909 name = "complex short unsigned int";
4910 else if (component_type == integer_type_node)
4911 name = "complex int";
4912 else if (component_type == unsigned_type_node)
4913 name = "complex unsigned int";
4914 else if (component_type == long_integer_type_node)
4915 name = "complex long int";
4916 else if (component_type == long_unsigned_type_node)
4917 name = "complex long unsigned int";
4918 else if (component_type == long_long_integer_type_node)
4919 name = "complex long long int";
4920 else if (component_type == long_long_unsigned_type_node)
4921 name = "complex long long unsigned int";
4926 TYPE_NAME (t) = get_identifier (name);
4932 /* Return OP, stripped of any conversions to wider types as much as is safe.
4933 Converting the value back to OP's type makes a value equivalent to OP.
4935 If FOR_TYPE is nonzero, we return a value which, if converted to
4936 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4938 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4939 narrowest type that can hold the value, even if they don't exactly fit.
4940 Otherwise, bit-field references are changed to a narrower type
4941 only if they can be fetched directly from memory in that type.
4943 OP must have integer, real or enumeral type. Pointers are not allowed!
4945 There are some cases where the obvious value we could return
4946 would regenerate to OP if converted to OP's type,
4947 but would not extend like OP to wider types.
4948 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4949 For example, if OP is (unsigned short)(signed char)-1,
4950 we avoid returning (signed char)-1 if FOR_TYPE is int,
4951 even though extending that to an unsigned short would regenerate OP,
4952 since the result of extending (signed char)-1 to (int)
4953 is different from (int) OP. */
4956 get_unwidened (op, for_type)
4960 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4961 register tree type = TREE_TYPE (op);
4962 register unsigned final_prec
4963 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4965 = (for_type != 0 && for_type != type
4966 && final_prec > TYPE_PRECISION (type)
4967 && TREE_UNSIGNED (type));
4968 register tree win = op;
4970 while (TREE_CODE (op) == NOP_EXPR)
4972 register int bitschange
4973 = TYPE_PRECISION (TREE_TYPE (op))
4974 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4976 /* Truncations are many-one so cannot be removed.
4977 Unless we are later going to truncate down even farther. */
4979 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4982 /* See what's inside this conversion. If we decide to strip it,
4984 op = TREE_OPERAND (op, 0);
4986 /* If we have not stripped any zero-extensions (uns is 0),
4987 we can strip any kind of extension.
4988 If we have previously stripped a zero-extension,
4989 only zero-extensions can safely be stripped.
4990 Any extension can be stripped if the bits it would produce
4991 are all going to be discarded later by truncating to FOR_TYPE. */
4995 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4997 /* TREE_UNSIGNED says whether this is a zero-extension.
4998 Let's avoid computing it if it does not affect WIN
4999 and if UNS will not be needed again. */
5000 if ((uns || TREE_CODE (op) == NOP_EXPR)
5001 && TREE_UNSIGNED (TREE_TYPE (op)))
5009 if (TREE_CODE (op) == COMPONENT_REF
5010 /* Since type_for_size always gives an integer type. */
5011 && TREE_CODE (type) != REAL_TYPE
5012 /* Don't crash if field not laid out yet. */
5013 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
5015 unsigned int innerprec
5016 = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
5018 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
5020 /* We can get this structure field in the narrowest type it fits in.
5021 If FOR_TYPE is 0, do this only for a field that matches the
5022 narrower type exactly and is aligned for it
5023 The resulting extension to its nominal type (a fullword type)
5024 must fit the same conditions as for other extensions. */
5026 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5027 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5028 && (! uns || final_prec <= innerprec
5029 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
5032 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5033 TREE_OPERAND (op, 1));
5034 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5035 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5041 /* Return OP or a simpler expression for a narrower value
5042 which can be sign-extended or zero-extended to give back OP.
5043 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5044 or 0 if the value should be sign-extended. */
5047 get_narrower (op, unsignedp_ptr)
5051 register int uns = 0;
5053 register tree win = op;
5055 while (TREE_CODE (op) == NOP_EXPR)
5057 register int bitschange
5058 = (TYPE_PRECISION (TREE_TYPE (op))
5059 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5061 /* Truncations are many-one so cannot be removed. */
5065 /* See what's inside this conversion. If we decide to strip it,
5067 op = TREE_OPERAND (op, 0);
5071 /* An extension: the outermost one can be stripped,
5072 but remember whether it is zero or sign extension. */
5074 uns = TREE_UNSIGNED (TREE_TYPE (op));
5075 /* Otherwise, if a sign extension has been stripped,
5076 only sign extensions can now be stripped;
5077 if a zero extension has been stripped, only zero-extensions. */
5078 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
5082 else /* bitschange == 0 */
5084 /* A change in nominal type can always be stripped, but we must
5085 preserve the unsignedness. */
5087 uns = TREE_UNSIGNED (TREE_TYPE (op));
5094 if (TREE_CODE (op) == COMPONENT_REF
5095 /* Since type_for_size always gives an integer type. */
5096 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE)
5098 unsigned int innerprec
5099 = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1)));
5101 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
5103 /* We can get this structure field in a narrower type that fits it,
5104 but the resulting extension to its nominal type (a fullword type)
5105 must satisfy the same conditions as for other extensions.
5107 Do this only for fields that are aligned (not bit-fields),
5108 because when bit-field insns will be used there is no
5109 advantage in doing this. */
5111 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5112 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5113 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
5117 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
5118 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5119 TREE_OPERAND (op, 1));
5120 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5121 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5124 *unsignedp_ptr = uns;
5128 /* Nonzero if integer constant C has a value that is permissible
5129 for type TYPE (an INTEGER_TYPE). */
5132 int_fits_type_p (c, type)
5135 if (TREE_UNSIGNED (type))
5136 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
5137 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c))
5138 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
5139 && INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type)))
5140 /* Negative ints never fit unsigned types. */
5141 && ! (TREE_INT_CST_HIGH (c) < 0
5142 && ! TREE_UNSIGNED (TREE_TYPE (c))));
5144 return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
5145 && INT_CST_LT (TYPE_MAX_VALUE (type), c))
5146 && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST
5147 && INT_CST_LT (c, TYPE_MIN_VALUE (type)))
5148 /* Unsigned ints with top bit set never fit signed types. */
5149 && ! (TREE_INT_CST_HIGH (c) < 0
5150 && TREE_UNSIGNED (TREE_TYPE (c))));
5153 /* Given a DECL or TYPE, return the scope in which it was declared, or
5154 NULL_TREE if there is no containing scope. */
5157 get_containing_scope (t)
5160 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
5163 /* Return the innermost context enclosing DECL that is
5164 a FUNCTION_DECL, or zero if none. */
5167 decl_function_context (decl)
5172 if (TREE_CODE (decl) == ERROR_MARK)
5175 if (TREE_CODE (decl) == SAVE_EXPR)
5176 context = SAVE_EXPR_CONTEXT (decl);
5178 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5179 where we look up the function at runtime. Such functions always take
5180 a first argument of type 'pointer to real context'.
5182 C++ should really be fixed to use DECL_CONTEXT for the real context,
5183 and use something else for the "virtual context". */
5184 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
5187 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
5189 context = DECL_CONTEXT (decl);
5191 while (context && TREE_CODE (context) != FUNCTION_DECL)
5193 if (TREE_CODE (context) == BLOCK)
5194 context = BLOCK_SUPERCONTEXT (context);
5196 context = get_containing_scope (context);
5202 /* Return the innermost context enclosing DECL that is
5203 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5204 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5207 decl_type_context (decl)
5210 tree context = DECL_CONTEXT (decl);
5214 if (TREE_CODE (context) == RECORD_TYPE
5215 || TREE_CODE (context) == UNION_TYPE
5216 || TREE_CODE (context) == QUAL_UNION_TYPE)
5219 if (TREE_CODE (context) == TYPE_DECL
5220 || TREE_CODE (context) == FUNCTION_DECL)
5221 context = DECL_CONTEXT (context);
5223 else if (TREE_CODE (context) == BLOCK)
5224 context = BLOCK_SUPERCONTEXT (context);
5227 /* Unhandled CONTEXT!? */
5233 /* CALL is a CALL_EXPR. Return the declaration for the function
5234 called, or NULL_TREE if the called function cannot be
5238 get_callee_fndecl (call)
5243 /* It's invalid to call this function with anything but a
5245 if (TREE_CODE (call) != CALL_EXPR)
5248 /* The first operand to the CALL is the address of the function
5250 addr = TREE_OPERAND (call, 0);
5254 /* If this is a readonly function pointer, extract its initial value. */
5255 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5256 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5257 && DECL_INITIAL (addr))
5258 addr = DECL_INITIAL (addr);
5260 /* If the address is just `&f' for some function `f', then we know
5261 that `f' is being called. */
5262 if (TREE_CODE (addr) == ADDR_EXPR
5263 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5264 return TREE_OPERAND (addr, 0);
5266 /* We couldn't figure out what was being called. */
5270 /* Print debugging information about the obstack O, named STR. */
5273 print_obstack_statistics (str, o)
5277 struct _obstack_chunk *chunk = o->chunk;
5281 n_alloc += o->next_free - chunk->contents;
5282 chunk = chunk->prev;
5286 n_alloc += chunk->limit - &chunk->contents[0];
5287 chunk = chunk->prev;
5289 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
5290 str, n_alloc, n_chunks);
5293 /* Print debugging information about tree nodes generated during the compile,
5294 and any language-specific information. */
5297 dump_tree_statistics ()
5299 #ifdef GATHER_STATISTICS
5301 int total_nodes, total_bytes;
5304 fprintf (stderr, "\n??? tree nodes created\n\n");
5305 #ifdef GATHER_STATISTICS
5306 fprintf (stderr, "Kind Nodes Bytes\n");
5307 fprintf (stderr, "-------------------------------------\n");
5308 total_nodes = total_bytes = 0;
5309 for (i = 0; i < (int) all_kinds; i++)
5311 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
5312 tree_node_counts[i], tree_node_sizes[i]);
5313 total_nodes += tree_node_counts[i];
5314 total_bytes += tree_node_sizes[i];
5316 fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size);
5317 fprintf (stderr, "-------------------------------------\n");
5318 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
5319 fprintf (stderr, "-------------------------------------\n");
5321 fprintf (stderr, "(No per-node statistics)\n");
5323 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
5324 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack);
5325 print_obstack_statistics ("temporary_obstack", &temporary_obstack);
5326 print_obstack_statistics ("momentary_obstack", &momentary_obstack);
5327 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack);
5328 print_type_hash_statistics ();
5329 print_lang_statistics ();
5332 #define FILE_FUNCTION_PREFIX_LEN 9
5334 #ifndef NO_DOLLAR_IN_LABEL
5335 #define FILE_FUNCTION_FORMAT "_GLOBAL_$%s$%s"
5336 #else /* NO_DOLLAR_IN_LABEL */
5337 #ifndef NO_DOT_IN_LABEL
5338 #define FILE_FUNCTION_FORMAT "_GLOBAL_.%s.%s"
5339 #else /* NO_DOT_IN_LABEL */
5340 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5341 #endif /* NO_DOT_IN_LABEL */
5342 #endif /* NO_DOLLAR_IN_LABEL */
5344 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
5345 clashes in cases where we can't reliably choose a unique name.
5347 Derived from mkstemp.c in libiberty. */
5350 append_random_chars (template)
5353 static const char letters[]
5354 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
5355 static unsigned HOST_WIDE_INT value;
5356 unsigned HOST_WIDE_INT v;
5358 #ifdef HAVE_GETTIMEOFDAY
5362 template += strlen (template);
5364 #ifdef HAVE_GETTIMEOFDAY
5365 /* Get some more or less random data. */
5366 gettimeofday (&tv, NULL);
5367 value += ((unsigned HOST_WIDE_INT) tv.tv_usec << 16) ^ tv.tv_sec ^ getpid ();
5374 /* Fill in the random bits. */
5375 template[0] = letters[v % 62];
5377 template[1] = letters[v % 62];
5379 template[2] = letters[v % 62];
5381 template[3] = letters[v % 62];
5383 template[4] = letters[v % 62];
5385 template[5] = letters[v % 62];
5390 /* P is a string that will be used in a symbol. Mask out any characters
5391 that are not valid in that context. */
5394 clean_symbol_name (p)
5399 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5402 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5410 /* Generate a name for a function unique to this translation unit.
5411 TYPE is some string to identify the purpose of this function to the
5412 linker or collect2. */
5415 get_file_function_name_long (type)
5422 if (first_global_object_name)
5423 p = first_global_object_name;
5426 /* We don't have anything that we know to be unique to this translation
5427 unit, so use what we do have and throw in some randomness. */
5429 const char *name = weak_global_object_name;
5430 const char *file = main_input_filename;
5435 file = input_filename;
5437 q = (char *) alloca (7 + strlen (name) + strlen (file));
5439 sprintf (q, "%s%s", name, file);
5440 append_random_chars (q);
5444 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
5447 /* Set up the name of the file-level functions we may need.
5448 Use a global object (which is already required to be unique over
5449 the program) rather than the file name (which imposes extra
5451 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5453 /* Don't need to pull weird characters out of global names. */
5454 if (p != first_global_object_name)
5455 clean_symbol_name (buf + 11);
5457 return get_identifier (buf);
5460 /* If KIND=='I', return a suitable global initializer (constructor) name.
5461 If KIND=='D', return a suitable global clean-up (destructor) name. */
5464 get_file_function_name (kind)
5472 return get_file_function_name_long (p);
5475 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5476 The result is placed in BUFFER (which has length BIT_SIZE),
5477 with one bit in each char ('\000' or '\001').
5479 If the constructor is constant, NULL_TREE is returned.
5480 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5483 get_set_constructor_bits (init, buffer, bit_size)
5490 HOST_WIDE_INT domain_min
5491 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))));
5492 tree non_const_bits = NULL_TREE;
5493 for (i = 0; i < bit_size; i++)
5496 for (vals = TREE_OPERAND (init, 1);
5497 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5499 if (TREE_CODE (TREE_VALUE (vals)) != INTEGER_CST
5500 || (TREE_PURPOSE (vals) != NULL_TREE
5501 && TREE_CODE (TREE_PURPOSE (vals)) != INTEGER_CST))
5503 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5504 else if (TREE_PURPOSE (vals) != NULL_TREE)
5506 /* Set a range of bits to ones. */
5507 HOST_WIDE_INT lo_index
5508 = TREE_INT_CST_LOW (TREE_PURPOSE (vals)) - domain_min;
5509 HOST_WIDE_INT hi_index
5510 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
5512 if (lo_index < 0 || lo_index >= bit_size
5513 || hi_index < 0 || hi_index >= bit_size)
5515 for (; lo_index <= hi_index; lo_index++)
5516 buffer[lo_index] = 1;
5520 /* Set a single bit to one. */
5522 = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min;
5523 if (index < 0 || index >= bit_size)
5525 error ("invalid initializer for bit string");
5531 return non_const_bits;
5534 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5535 The result is placed in BUFFER (which is an array of bytes).
5536 If the constructor is constant, NULL_TREE is returned.
5537 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5540 get_set_constructor_bytes (init, buffer, wd_size)
5542 unsigned char *buffer;
5546 int set_word_size = BITS_PER_UNIT;
5547 int bit_size = wd_size * set_word_size;
5549 unsigned char *bytep = buffer;
5550 char *bit_buffer = (char *) alloca (bit_size);
5551 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5553 for (i = 0; i < wd_size; i++)
5556 for (i = 0; i < bit_size; i++)
5560 if (BYTES_BIG_ENDIAN)
5561 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5563 *bytep |= 1 << bit_pos;
5566 if (bit_pos >= set_word_size)
5567 bit_pos = 0, bytep++;
5569 return non_const_bits;
5572 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5573 /* Complain that the tree code of NODE does not match the expected CODE.
5574 FILE, LINE, and FUNCTION are of the caller. */
5577 tree_check_failed (node, code, file, line, function)
5579 enum tree_code code;
5582 const char *function;
5584 error ("Tree check: expected %s, have %s",
5585 tree_code_name[code], tree_code_name[TREE_CODE (node)]);
5586 fancy_abort (file, line, function);
5589 /* Similar to above, except that we check for a class of tree
5590 code, given in CL. */
5593 tree_class_check_failed (node, cl, file, line, function)
5598 const char *function;
5600 error ("Tree check: expected class '%c', have '%c' (%s)",
5601 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5602 tree_code_name[TREE_CODE (node)]);
5603 fancy_abort (file, line, function);
5606 #endif /* ENABLE_TREE_CHECKING */
5608 /* For a new vector type node T, build the information necessary for
5609 debuggint output. */
5612 finish_vector_type (t)
5618 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
5619 tree array = build_array_type (TREE_TYPE (t),
5620 build_index_type (index));
5621 tree rt = make_node (RECORD_TYPE);
5623 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5624 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5626 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5627 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5628 the representation type, and we want to find that die when looking up
5629 the vector type. This is most easily achieved by making the TYPE_UID
5631 TYPE_UID (rt) = TYPE_UID (t);
5635 #ifndef CHAR_TYPE_SIZE
5636 #define CHAR_TYPE_SIZE BITS_PER_UNIT
5639 #ifndef SHORT_TYPE_SIZE
5640 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
5643 #ifndef INT_TYPE_SIZE
5644 #define INT_TYPE_SIZE BITS_PER_WORD
5647 #ifndef LONG_TYPE_SIZE
5648 #define LONG_TYPE_SIZE BITS_PER_WORD
5651 #ifndef LONG_LONG_TYPE_SIZE
5652 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
5655 #ifndef FLOAT_TYPE_SIZE
5656 #define FLOAT_TYPE_SIZE BITS_PER_WORD
5659 #ifndef DOUBLE_TYPE_SIZE
5660 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5663 #ifndef LONG_DOUBLE_TYPE_SIZE
5664 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5667 /* Create nodes for all integer types (and error_mark_node) using the sizes
5668 of C datatypes. The caller should call set_sizetype soon after calling
5669 this function to select one of the types as sizetype. */
5672 build_common_tree_nodes (signed_char)
5675 error_mark_node = make_node (ERROR_MARK);
5676 TREE_TYPE (error_mark_node) = error_mark_node;
5678 initialize_sizetypes ();
5680 /* Define both `signed char' and `unsigned char'. */
5681 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5682 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5684 /* Define `char', which is like either `signed char' or `unsigned char'
5685 but not the same as either. */
5688 ? make_signed_type (CHAR_TYPE_SIZE)
5689 : make_unsigned_type (CHAR_TYPE_SIZE));
5691 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5692 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5693 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5694 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5695 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5696 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5697 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5698 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5700 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
5701 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
5702 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
5703 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
5704 #if HOST_BITS_PER_WIDE_INT >= 64
5705 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
5708 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
5709 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
5710 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
5711 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
5712 #if HOST_BITS_PER_WIDE_INT >= 64
5713 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
5717 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5718 It will create several other common tree nodes. */
5721 build_common_tree_nodes_2 (short_double)
5724 /* Define these next since types below may used them. */
5725 integer_zero_node = build_int_2 (0, 0);
5726 integer_one_node = build_int_2 (1, 0);
5728 size_zero_node = size_int (0);
5729 size_one_node = size_int (1);
5730 bitsize_zero_node = bitsize_int (0);
5731 bitsize_one_node = bitsize_int (1);
5732 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5734 void_type_node = make_node (VOID_TYPE);
5735 layout_type (void_type_node);
5737 /* We are not going to have real types in C with less than byte alignment,
5738 so we might as well not have any types that claim to have it. */
5739 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5740 TYPE_USER_ALIGN (void_type_node) = 0;
5742 null_pointer_node = build_int_2 (0, 0);
5743 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5744 layout_type (TREE_TYPE (null_pointer_node));
5746 ptr_type_node = build_pointer_type (void_type_node);
5748 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5750 float_type_node = make_node (REAL_TYPE);
5751 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5752 layout_type (float_type_node);
5754 double_type_node = make_node (REAL_TYPE);
5756 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5758 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5759 layout_type (double_type_node);
5761 long_double_type_node = make_node (REAL_TYPE);
5762 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5763 layout_type (long_double_type_node);
5765 complex_integer_type_node = make_node (COMPLEX_TYPE);
5766 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5767 layout_type (complex_integer_type_node);
5769 complex_float_type_node = make_node (COMPLEX_TYPE);
5770 TREE_TYPE (complex_float_type_node) = float_type_node;
5771 layout_type (complex_float_type_node);
5773 complex_double_type_node = make_node (COMPLEX_TYPE);
5774 TREE_TYPE (complex_double_type_node) = double_type_node;
5775 layout_type (complex_double_type_node);
5777 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5778 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5779 layout_type (complex_long_double_type_node);
5781 #ifdef BUILD_VA_LIST_TYPE
5782 BUILD_VA_LIST_TYPE (va_list_type_node);
5784 va_list_type_node = ptr_type_node;
5787 V4SF_type_node = make_node (VECTOR_TYPE);
5788 TREE_TYPE (V4SF_type_node) = float_type_node;
5789 TYPE_MODE (V4SF_type_node) = V4SFmode;
5790 finish_vector_type (V4SF_type_node);
5792 V4SI_type_node = make_node (VECTOR_TYPE);
5793 TREE_TYPE (V4SI_type_node) = intSI_type_node;
5794 TYPE_MODE (V4SI_type_node) = V4SImode;
5795 finish_vector_type (V4SI_type_node);
5797 V2SI_type_node = make_node (VECTOR_TYPE);
5798 TREE_TYPE (V2SI_type_node) = intSI_type_node;
5799 TYPE_MODE (V2SI_type_node) = V2SImode;
5800 finish_vector_type (V2SI_type_node);
5802 V4HI_type_node = make_node (VECTOR_TYPE);
5803 TREE_TYPE (V4HI_type_node) = intHI_type_node;
5804 TYPE_MODE (V4HI_type_node) = V4HImode;
5805 finish_vector_type (V4HI_type_node);
5807 V8QI_type_node = make_node (VECTOR_TYPE);
5808 TREE_TYPE (V8QI_type_node) = intQI_type_node;
5809 TYPE_MODE (V8QI_type_node) = V8QImode;
5810 finish_vector_type (V8QI_type_node);