1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
45 #define obstack_chunk_alloc xmalloc
46 #define obstack_chunk_free free
47 /* obstack.[ch] explicitly declined to prototype this. */
48 extern int _obstack_allocated_p
PROTO ((struct obstack
*h
, PTR obj
));
50 /* Tree nodes of permanent duration are allocated in this obstack.
51 They are the identifier nodes, and everything outside of
52 the bodies and parameters of function definitions. */
54 struct obstack permanent_obstack
;
56 /* The initial RTL, and all ..._TYPE nodes, in a function
57 are allocated in this obstack. Usually they are freed at the
58 end of the function, but if the function is inline they are saved.
59 For top-level functions, this is maybepermanent_obstack.
60 Separate obstacks are made for nested functions. */
62 struct obstack
*function_maybepermanent_obstack
;
64 /* This is the function_maybepermanent_obstack for top-level functions. */
66 struct obstack maybepermanent_obstack
;
68 /* The contents of the current function definition are allocated
69 in this obstack, and all are freed at the end of the function.
70 For top-level functions, this is temporary_obstack.
71 Separate obstacks are made for nested functions. */
73 struct obstack
*function_obstack
;
75 /* This is used for reading initializers of global variables. */
77 struct obstack temporary_obstack
;
79 /* The tree nodes of an expression are allocated
80 in this obstack, and all are freed at the end of the expression. */
82 struct obstack momentary_obstack
;
84 /* The tree nodes of a declarator are allocated
85 in this obstack, and all are freed when the declarator
88 static struct obstack temp_decl_obstack
;
90 /* This points at either permanent_obstack
91 or the current function_maybepermanent_obstack. */
93 struct obstack
*saveable_obstack
;
95 /* This is same as saveable_obstack during parse and expansion phase;
96 it points to the current function's obstack during optimization.
97 This is the obstack to be used for creating rtl objects. */
99 struct obstack
*rtl_obstack
;
101 /* This points at either permanent_obstack or the current function_obstack. */
103 struct obstack
*current_obstack
;
105 /* This points at either permanent_obstack or the current function_obstack
106 or momentary_obstack. */
108 struct obstack
*expression_obstack
;
110 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
114 struct obstack_stack
*next
;
115 struct obstack
*current
;
116 struct obstack
*saveable
;
117 struct obstack
*expression
;
121 struct obstack_stack
*obstack_stack
;
123 /* Obstack for allocating struct obstack_stack entries. */
125 static struct obstack obstack_stack_obstack
;
127 /* Addresses of first objects in some obstacks.
128 This is for freeing their entire contents. */
129 char *maybepermanent_firstobj
;
130 char *temporary_firstobj
;
131 char *momentary_firstobj
;
132 char *temp_decl_firstobj
;
134 /* This is used to preserve objects (mainly array initializers) that need to
135 live until the end of the current function, but no further. */
136 char *momentary_function_firstobj
;
138 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
140 int all_types_permanent
;
142 /* Stack of places to restore the momentary obstack back to. */
144 struct momentary_level
146 /* Pointer back to previous such level. */
147 struct momentary_level
*prev
;
148 /* First object allocated within this level. */
150 /* Value of expression_obstack saved at entry to this level. */
151 struct obstack
*obstack
;
154 struct momentary_level
*momentary_stack
;
156 /* Table indexed by tree code giving a string containing a character
157 classifying the tree code. Possibilities are
158 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
160 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
162 char tree_code_type
[MAX_TREE_CODES
] = {
167 /* Table indexed by tree code giving number of expression
168 operands beyond the fixed part of the node structure.
169 Not used for types or decls. */
171 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
173 int tree_code_length
[MAX_TREE_CODES
] = {
178 /* Names of tree components.
179 Used for printing out the tree and error messages. */
180 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
182 const char *tree_code_name
[MAX_TREE_CODES
] = {
187 /* Statistics-gathering stuff. */
208 int tree_node_counts
[(int)all_kinds
];
209 int tree_node_sizes
[(int)all_kinds
];
210 int id_string_size
= 0;
212 const char *tree_node_kind_names
[] = {
230 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
232 #define MAX_HASH_TABLE 1009
233 static tree hash_table
[MAX_HASH_TABLE
]; /* id hash buckets */
235 /* 0 while creating built-in identifiers. */
236 static int do_identifier_warnings
;
238 /* Unique id for next decl created. */
239 static int next_decl_uid
;
240 /* Unique id for next type created. */
241 static int next_type_uid
= 1;
243 /* The language-specific function for alias analysis. If NULL, the
244 language does not do any special alias analysis. */
245 int (*lang_get_alias_set
) PROTO((tree
));
247 /* Here is how primitive or already-canonicalized types' hash
249 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
251 /* Each hash table slot is a bucket containing a chain
252 of these structures. */
256 struct type_hash
*next
; /* Next structure in the bucket. */
257 int hashcode
; /* Hash code of this type. */
258 tree type
; /* The type recorded here. */
261 /* Now here is the hash table. When recording a type, it is added
262 to the slot whose index is the hash code mod the table size.
263 Note that the hash table is used for several kinds of types
264 (function types, array types and array index range types, for now).
265 While all these live in the same table, they are completely independent,
266 and the hash code is computed differently for each of these. */
268 #define TYPE_HASH_SIZE 59
269 struct type_hash
*type_hash_table
[TYPE_HASH_SIZE
];
271 static void set_type_quals
PROTO((tree
, int));
272 static void append_random_chars
PROTO((char *));
273 static void build_real_from_int_cst_1
PROTO((PTR
));
274 static void mark_type_hash
PROTO ((void *));
276 void gcc_obstack_init ();
278 /* If non-null, a language specific helper for unsave_expr_now. */
280 void (*lang_unsave_expr_now
) PROTO((tree
));
282 tree global_trees
[TI_MAX
];
284 /* Init the principal obstacks. */
289 gcc_obstack_init (&obstack_stack_obstack
);
290 gcc_obstack_init (&permanent_obstack
);
292 gcc_obstack_init (&temporary_obstack
);
293 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
294 gcc_obstack_init (&momentary_obstack
);
295 momentary_firstobj
= (char *) obstack_alloc (&momentary_obstack
, 0);
296 momentary_function_firstobj
= momentary_firstobj
;
297 gcc_obstack_init (&maybepermanent_obstack
);
298 maybepermanent_firstobj
299 = (char *) obstack_alloc (&maybepermanent_obstack
, 0);
300 gcc_obstack_init (&temp_decl_obstack
);
301 temp_decl_firstobj
= (char *) obstack_alloc (&temp_decl_obstack
, 0);
303 function_obstack
= &temporary_obstack
;
304 function_maybepermanent_obstack
= &maybepermanent_obstack
;
305 current_obstack
= &permanent_obstack
;
306 expression_obstack
= &permanent_obstack
;
307 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
309 /* Init the hash table of identifiers. */
310 bzero ((char *) hash_table
, sizeof hash_table
);
312 ggc_add_tree_root (hash_table
, MAX_HASH_TABLE
);
313 ggc_add_root (type_hash_table
, TYPE_HASH_SIZE
,
314 sizeof(struct type_hash
*),
316 ggc_add_tree_root (global_trees
, TI_MAX
);
320 gcc_obstack_init (obstack
)
321 struct obstack
*obstack
;
323 /* Let particular systems override the size of a chunk. */
324 #ifndef OBSTACK_CHUNK_SIZE
325 #define OBSTACK_CHUNK_SIZE 0
327 /* Let them override the alloc and free routines too. */
328 #ifndef OBSTACK_CHUNK_ALLOC
329 #define OBSTACK_CHUNK_ALLOC xmalloc
331 #ifndef OBSTACK_CHUNK_FREE
332 #define OBSTACK_CHUNK_FREE free
334 _obstack_begin (obstack
, OBSTACK_CHUNK_SIZE
, 0,
335 (void *(*) ()) OBSTACK_CHUNK_ALLOC
,
336 (void (*) ()) OBSTACK_CHUNK_FREE
);
339 /* Save all variables describing the current status into the structure
340 *P. This function is called whenever we start compiling one
341 function in the midst of compiling another. For example, when
342 compiling a nested function, or, in C++, a template instantiation
343 that is required by the function we are currently compiling.
345 CONTEXT is the decl_function_context for the function we're about to
346 compile; if it isn't current_function_decl, we have to play some games. */
352 p
->all_types_permanent
= all_types_permanent
;
353 p
->momentary_stack
= momentary_stack
;
354 p
->maybepermanent_firstobj
= maybepermanent_firstobj
;
355 p
->temporary_firstobj
= temporary_firstobj
;
356 p
->momentary_firstobj
= momentary_firstobj
;
357 p
->momentary_function_firstobj
= momentary_function_firstobj
;
358 p
->function_obstack
= function_obstack
;
359 p
->function_maybepermanent_obstack
= function_maybepermanent_obstack
;
360 p
->current_obstack
= current_obstack
;
361 p
->expression_obstack
= expression_obstack
;
362 p
->saveable_obstack
= saveable_obstack
;
363 p
->rtl_obstack
= rtl_obstack
;
365 function_maybepermanent_obstack
366 = (struct obstack
*) xmalloc (sizeof (struct obstack
));
367 gcc_obstack_init (function_maybepermanent_obstack
);
368 maybepermanent_firstobj
369 = (char *) obstack_finish (function_maybepermanent_obstack
);
371 function_obstack
= (struct obstack
*) xmalloc (sizeof (struct obstack
));
372 gcc_obstack_init (function_obstack
);
374 current_obstack
= &permanent_obstack
;
375 expression_obstack
= &permanent_obstack
;
376 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
378 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
379 momentary_firstobj
= (char *) obstack_finish (&momentary_obstack
);
380 momentary_function_firstobj
= momentary_firstobj
;
383 /* Restore all variables describing the current status from the structure *P.
384 This is used after a nested function. */
387 restore_tree_status (p
)
390 all_types_permanent
= p
->all_types_permanent
;
391 momentary_stack
= p
->momentary_stack
;
393 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
395 /* Free saveable storage used by the function just compiled and not
397 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
398 if (obstack_empty_p (function_maybepermanent_obstack
))
400 obstack_free (function_maybepermanent_obstack
, NULL
);
401 free (function_maybepermanent_obstack
);
404 obstack_free (&temporary_obstack
, temporary_firstobj
);
405 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
407 obstack_free (function_obstack
, NULL
);
408 free (function_obstack
);
410 temporary_firstobj
= p
->temporary_firstobj
;
411 momentary_firstobj
= p
->momentary_firstobj
;
412 momentary_function_firstobj
= p
->momentary_function_firstobj
;
413 maybepermanent_firstobj
= p
->maybepermanent_firstobj
;
414 function_obstack
= p
->function_obstack
;
415 function_maybepermanent_obstack
= p
->function_maybepermanent_obstack
;
416 current_obstack
= p
->current_obstack
;
417 expression_obstack
= p
->expression_obstack
;
418 saveable_obstack
= p
->saveable_obstack
;
419 rtl_obstack
= p
->rtl_obstack
;
422 /* Start allocating on the temporary (per function) obstack.
423 This is done in start_function before parsing the function body,
424 and before each initialization at top level, and to go back
425 to temporary allocation after doing permanent_allocation. */
428 temporary_allocation ()
430 /* Note that function_obstack at top level points to temporary_obstack.
431 But within a nested function context, it is a separate obstack. */
432 current_obstack
= function_obstack
;
433 expression_obstack
= function_obstack
;
434 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
438 /* Start allocating on the permanent obstack but don't
439 free the temporary data. After calling this, call
440 `permanent_allocation' to fully resume permanent allocation status. */
443 end_temporary_allocation ()
445 current_obstack
= &permanent_obstack
;
446 expression_obstack
= &permanent_obstack
;
447 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
450 /* Resume allocating on the temporary obstack, undoing
451 effects of `end_temporary_allocation'. */
454 resume_temporary_allocation ()
456 current_obstack
= function_obstack
;
457 expression_obstack
= function_obstack
;
458 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
461 /* While doing temporary allocation, switch to allocating in such a
462 way as to save all nodes if the function is inlined. Call
463 resume_temporary_allocation to go back to ordinary temporary
467 saveable_allocation ()
469 /* Note that function_obstack at top level points to temporary_obstack.
470 But within a nested function context, it is a separate obstack. */
471 expression_obstack
= current_obstack
= saveable_obstack
;
474 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
475 recording the previously current obstacks on a stack.
476 This does not free any storage in any obstack. */
479 push_obstacks (current
, saveable
)
480 struct obstack
*current
, *saveable
;
482 struct obstack_stack
*p
;
484 p
= (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
485 (sizeof (struct obstack_stack
)));
487 p
->current
= current_obstack
;
488 p
->saveable
= saveable_obstack
;
489 p
->expression
= expression_obstack
;
490 p
->rtl
= rtl_obstack
;
491 p
->next
= obstack_stack
;
494 current_obstack
= current
;
495 expression_obstack
= current
;
496 rtl_obstack
= saveable_obstack
= saveable
;
499 /* Save the current set of obstacks, but don't change them. */
502 push_obstacks_nochange ()
504 struct obstack_stack
*p
;
506 p
= (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
507 (sizeof (struct obstack_stack
)));
509 p
->current
= current_obstack
;
510 p
->saveable
= saveable_obstack
;
511 p
->expression
= expression_obstack
;
512 p
->rtl
= rtl_obstack
;
513 p
->next
= obstack_stack
;
517 /* Pop the obstack selection stack. */
522 struct obstack_stack
*p
;
525 obstack_stack
= p
->next
;
527 current_obstack
= p
->current
;
528 saveable_obstack
= p
->saveable
;
529 expression_obstack
= p
->expression
;
530 rtl_obstack
= p
->rtl
;
532 obstack_free (&obstack_stack_obstack
, p
);
535 /* Nonzero if temporary allocation is currently in effect.
536 Zero if currently doing permanent allocation. */
539 allocation_temporary_p ()
541 return current_obstack
!= &permanent_obstack
;
544 /* Go back to allocating on the permanent obstack
545 and free everything in the temporary obstack.
547 FUNCTION_END is true only if we have just finished compiling a function.
548 In that case, we also free preserved initial values on the momentary
552 permanent_allocation (function_end
)
555 /* Free up previous temporary obstack data */
556 obstack_free (&temporary_obstack
, temporary_firstobj
);
559 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
560 momentary_firstobj
= momentary_function_firstobj
;
563 obstack_free (&momentary_obstack
, momentary_firstobj
);
564 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
565 obstack_free (&temp_decl_obstack
, temp_decl_firstobj
);
567 current_obstack
= &permanent_obstack
;
568 expression_obstack
= &permanent_obstack
;
569 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
572 /* Save permanently everything on the maybepermanent_obstack. */
577 maybepermanent_firstobj
578 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
582 preserve_initializer ()
584 struct momentary_level
*tem
;
588 = (char *) obstack_alloc (&temporary_obstack
, 0);
589 maybepermanent_firstobj
590 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
592 old_momentary
= momentary_firstobj
;
594 = (char *) obstack_alloc (&momentary_obstack
, 0);
595 if (momentary_firstobj
!= old_momentary
)
596 for (tem
= momentary_stack
; tem
; tem
= tem
->prev
)
597 tem
->base
= momentary_firstobj
;
600 /* Start allocating new rtl in current_obstack.
601 Use resume_temporary_allocation
602 to go back to allocating rtl in saveable_obstack. */
605 rtl_in_current_obstack ()
607 rtl_obstack
= current_obstack
;
610 /* Start allocating rtl from saveable_obstack. Intended to be used after
611 a call to push_obstacks_nochange. */
614 rtl_in_saveable_obstack ()
616 rtl_obstack
= saveable_obstack
;
619 /* Allocate SIZE bytes in the current obstack
620 and return a pointer to them.
621 In practice the current obstack is always the temporary one. */
627 return (char *) obstack_alloc (current_obstack
, size
);
630 /* Free the object PTR in the current obstack
631 as well as everything allocated since PTR.
632 In practice the current obstack is always the temporary one. */
638 obstack_free (current_obstack
, ptr
);
641 /* Allocate SIZE bytes in the permanent obstack
642 and return a pointer to them. */
648 return (char *) obstack_alloc (&permanent_obstack
, size
);
651 /* Allocate NELEM items of SIZE bytes in the permanent obstack
652 and return a pointer to them. The storage is cleared before
653 returning the value. */
656 perm_calloc (nelem
, size
)
660 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
661 bzero (rval
, nelem
* size
);
665 /* Allocate SIZE bytes in the saveable obstack
666 and return a pointer to them. */
672 return (char *) obstack_alloc (saveable_obstack
, size
);
675 /* Allocate SIZE bytes in the expression obstack
676 and return a pointer to them. */
682 return (char *) obstack_alloc (expression_obstack
, size
);
685 /* Print out which obstack an object is in. */
688 print_obstack_name (object
, file
, prefix
)
693 struct obstack
*obstack
= NULL
;
694 const char *obstack_name
= NULL
;
697 for (p
= outer_function_chain
; p
; p
= p
->next
)
699 if (_obstack_allocated_p (p
->function_obstack
, object
))
701 obstack
= p
->function_obstack
;
702 obstack_name
= "containing function obstack";
704 if (_obstack_allocated_p (p
->function_maybepermanent_obstack
, object
))
706 obstack
= p
->function_maybepermanent_obstack
;
707 obstack_name
= "containing function maybepermanent obstack";
711 if (_obstack_allocated_p (&obstack_stack_obstack
, object
))
713 obstack
= &obstack_stack_obstack
;
714 obstack_name
= "obstack_stack_obstack";
716 else if (_obstack_allocated_p (function_obstack
, object
))
718 obstack
= function_obstack
;
719 obstack_name
= "function obstack";
721 else if (_obstack_allocated_p (&permanent_obstack
, object
))
723 obstack
= &permanent_obstack
;
724 obstack_name
= "permanent_obstack";
726 else if (_obstack_allocated_p (&momentary_obstack
, object
))
728 obstack
= &momentary_obstack
;
729 obstack_name
= "momentary_obstack";
731 else if (_obstack_allocated_p (function_maybepermanent_obstack
, object
))
733 obstack
= function_maybepermanent_obstack
;
734 obstack_name
= "function maybepermanent obstack";
736 else if (_obstack_allocated_p (&temp_decl_obstack
, object
))
738 obstack
= &temp_decl_obstack
;
739 obstack_name
= "temp_decl_obstack";
742 /* Check to see if the object is in the free area of the obstack. */
745 if (object
>= obstack
->next_free
746 && object
< obstack
->chunk_limit
)
747 fprintf (file
, "%s in free portion of obstack %s",
748 prefix
, obstack_name
);
750 fprintf (file
, "%s allocated from %s", prefix
, obstack_name
);
753 fprintf (file
, "%s not allocated from any obstack", prefix
);
757 debug_obstack (object
)
760 print_obstack_name (object
, stderr
, "object");
761 fprintf (stderr
, ".\n");
764 /* Return 1 if OBJ is in the permanent obstack.
765 This is slow, and should be used only for debugging.
766 Use TREE_PERMANENT for other purposes. */
769 object_permanent_p (obj
)
772 return _obstack_allocated_p (&permanent_obstack
, obj
);
775 /* Start a level of momentary allocation.
776 In C, each compound statement has its own level
777 and that level is freed at the end of each statement.
778 All expression nodes are allocated in the momentary allocation level. */
783 struct momentary_level
*tem
784 = (struct momentary_level
*) obstack_alloc (&momentary_obstack
,
785 sizeof (struct momentary_level
));
786 tem
->prev
= momentary_stack
;
787 tem
->base
= (char *) obstack_base (&momentary_obstack
);
788 tem
->obstack
= expression_obstack
;
789 momentary_stack
= tem
;
790 expression_obstack
= &momentary_obstack
;
793 /* Set things up so the next clear_momentary will only clear memory
794 past our present position in momentary_obstack. */
797 preserve_momentary ()
799 momentary_stack
->base
= (char *) obstack_base (&momentary_obstack
);
802 /* Free all the storage in the current momentary-allocation level.
803 In C, this happens at the end of each statement. */
808 obstack_free (&momentary_obstack
, momentary_stack
->base
);
811 /* Discard a level of momentary allocation.
812 In C, this happens at the end of each compound statement.
813 Restore the status of expression node allocation
814 that was in effect before this level was created. */
819 struct momentary_level
*tem
= momentary_stack
;
820 momentary_stack
= tem
->prev
;
821 expression_obstack
= tem
->obstack
;
822 /* We can't free TEM from the momentary_obstack, because there might
823 be objects above it which have been saved. We can free back to the
824 stack of the level we are popping off though. */
825 obstack_free (&momentary_obstack
, tem
->base
);
828 /* Pop back to the previous level of momentary allocation,
829 but don't free any momentary data just yet. */
832 pop_momentary_nofree ()
834 struct momentary_level
*tem
= momentary_stack
;
835 momentary_stack
= tem
->prev
;
836 expression_obstack
= tem
->obstack
;
839 /* Call when starting to parse a declaration:
840 make expressions in the declaration last the length of the function.
841 Returns an argument that should be passed to resume_momentary later. */
846 register int tem
= expression_obstack
== &momentary_obstack
;
847 expression_obstack
= saveable_obstack
;
851 /* Call when finished parsing a declaration:
852 restore the treatment of node-allocation that was
853 in effect before the suspension.
854 YES should be the value previously returned by suspend_momentary. */
857 resume_momentary (yes
)
861 expression_obstack
= &momentary_obstack
;
864 /* Init the tables indexed by tree code.
865 Note that languages can add to these tables to define their own codes. */
873 /* Return a newly allocated node of code CODE.
874 Initialize the node's unique id and its TREE_PERMANENT flag.
875 For decl and type nodes, some other fields are initialized.
876 The rest of the node is initialized to zero.
878 Achoo! I got a code in the node. */
885 register int type
= TREE_CODE_CLASS (code
);
886 register int length
= 0;
887 register struct obstack
*obstack
= current_obstack
;
888 #ifdef GATHER_STATISTICS
889 register tree_node_kind kind
;
894 case 'd': /* A decl node */
895 #ifdef GATHER_STATISTICS
898 length
= sizeof (struct tree_decl
);
899 /* All decls in an inline function need to be saved. */
900 if (obstack
!= &permanent_obstack
)
901 obstack
= saveable_obstack
;
903 /* PARM_DECLs go on the context of the parent. If this is a nested
904 function, then we must allocate the PARM_DECL on the parent's
905 obstack, so that they will live to the end of the parent's
906 closing brace. This is necessary in case we try to inline the
907 function into its parent.
909 PARM_DECLs of top-level functions do not have this problem. However,
910 we allocate them where we put the FUNCTION_DECL for languages such as
911 Ada that need to consult some flags in the PARM_DECLs of the function
914 See comment in restore_tree_status for why we can't put this
915 in function_obstack. */
916 if (code
== PARM_DECL
&& obstack
!= &permanent_obstack
)
919 if (current_function_decl
)
920 context
= decl_function_context (current_function_decl
);
924 = find_function_data (context
)->function_maybepermanent_obstack
;
928 case 't': /* a type node */
929 #ifdef GATHER_STATISTICS
932 length
= sizeof (struct tree_type
);
933 /* All data types are put where we can preserve them if nec. */
934 if (obstack
!= &permanent_obstack
)
935 obstack
= all_types_permanent
? &permanent_obstack
: saveable_obstack
;
938 case 'b': /* a lexical block */
939 #ifdef GATHER_STATISTICS
942 length
= sizeof (struct tree_block
);
943 /* All BLOCK nodes are put where we can preserve them if nec. */
944 if (obstack
!= &permanent_obstack
)
945 obstack
= saveable_obstack
;
948 case 's': /* an expression with side effects */
949 #ifdef GATHER_STATISTICS
953 case 'r': /* a reference */
954 #ifdef GATHER_STATISTICS
958 case 'e': /* an expression */
959 case '<': /* a comparison expression */
960 case '1': /* a unary arithmetic expression */
961 case '2': /* a binary arithmetic expression */
962 #ifdef GATHER_STATISTICS
966 obstack
= expression_obstack
;
967 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
968 if (code
== BIND_EXPR
&& obstack
!= &permanent_obstack
)
969 obstack
= saveable_obstack
;
970 length
= sizeof (struct tree_exp
)
971 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
974 case 'c': /* a constant */
975 #ifdef GATHER_STATISTICS
978 obstack
= expression_obstack
;
980 /* We can't use tree_code_length for INTEGER_CST, since the number of
981 words is machine-dependent due to varying length of HOST_WIDE_INT,
982 which might be wider than a pointer (e.g., long long). Similarly
983 for REAL_CST, since the number of words is machine-dependent due
984 to varying size and alignment of `double'. */
986 if (code
== INTEGER_CST
)
987 length
= sizeof (struct tree_int_cst
);
988 else if (code
== REAL_CST
)
989 length
= sizeof (struct tree_real_cst
);
991 length
= sizeof (struct tree_common
)
992 + tree_code_length
[(int) code
] * sizeof (char *);
995 case 'x': /* something random, like an identifier. */
996 #ifdef GATHER_STATISTICS
997 if (code
== IDENTIFIER_NODE
)
999 else if (code
== OP_IDENTIFIER
)
1001 else if (code
== TREE_VEC
)
1006 length
= sizeof (struct tree_common
)
1007 + tree_code_length
[(int) code
] * sizeof (char *);
1008 /* Identifier nodes are always permanent since they are
1009 unique in a compiler run. */
1010 if (code
== IDENTIFIER_NODE
) obstack
= &permanent_obstack
;
1018 t
= ggc_alloc_tree (length
);
1021 t
= (tree
) obstack_alloc (obstack
, length
);
1022 bzero ((PTR
) t
, length
);
1025 #ifdef GATHER_STATISTICS
1026 tree_node_counts
[(int)kind
]++;
1027 tree_node_sizes
[(int)kind
] += length
;
1030 TREE_SET_CODE (t
, code
);
1031 if (obstack
== &permanent_obstack
)
1032 TREE_PERMANENT (t
) = 1;
1037 TREE_SIDE_EFFECTS (t
) = 1;
1038 TREE_TYPE (t
) = void_type_node
;
1042 if (code
!= FUNCTION_DECL
)
1044 DECL_IN_SYSTEM_HEADER (t
)
1045 = in_system_header
&& (obstack
== &permanent_obstack
);
1046 DECL_SOURCE_LINE (t
) = lineno
;
1047 DECL_SOURCE_FILE (t
) = (input_filename
) ? input_filename
: "<built-in>";
1048 DECL_UID (t
) = next_decl_uid
++;
1049 /* Note that we have not yet computed the alias set for this
1051 DECL_POINTER_ALIAS_SET (t
) = -1;
1055 TYPE_UID (t
) = next_type_uid
++;
1057 TYPE_MAIN_VARIANT (t
) = t
;
1058 TYPE_OBSTACK (t
) = obstack
;
1059 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1060 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1061 SET_DEFAULT_TYPE_ATTRIBUTES (t
);
1063 /* Note that we have not yet computed the alias set for this
1065 TYPE_ALIAS_SET (t
) = -1;
1069 TREE_CONSTANT (t
) = 1;
1076 /* Return a new node with the same contents as NODE except that its
1077 TREE_CHAIN is zero and it has a fresh uid. Unlike make_node, this
1078 function always performs the allocation on the CURRENT_OBSTACK;
1079 it's up to the caller to pick the right obstack before calling this
1087 register enum tree_code code
= TREE_CODE (node
);
1088 register int length
= 0;
1090 switch (TREE_CODE_CLASS (code
))
1092 case 'd': /* A decl node */
1093 length
= sizeof (struct tree_decl
);
1096 case 't': /* a type node */
1097 length
= sizeof (struct tree_type
);
1100 case 'b': /* a lexical block node */
1101 length
= sizeof (struct tree_block
);
1104 case 'r': /* a reference */
1105 case 'e': /* an expression */
1106 case 's': /* an expression with side effects */
1107 case '<': /* a comparison expression */
1108 case '1': /* a unary arithmetic expression */
1109 case '2': /* a binary arithmetic expression */
1110 length
= sizeof (struct tree_exp
)
1111 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
1114 case 'c': /* a constant */
1115 /* We can't use tree_code_length for INTEGER_CST, since the number of
1116 words is machine-dependent due to varying length of HOST_WIDE_INT,
1117 which might be wider than a pointer (e.g., long long). Similarly
1118 for REAL_CST, since the number of words is machine-dependent due
1119 to varying size and alignment of `double'. */
1120 if (code
== INTEGER_CST
)
1121 length
= sizeof (struct tree_int_cst
);
1122 else if (code
== REAL_CST
)
1123 length
= sizeof (struct tree_real_cst
);
1125 length
= (sizeof (struct tree_common
)
1126 + tree_code_length
[(int) code
] * sizeof (char *));
1129 case 'x': /* something random, like an identifier. */
1130 length
= sizeof (struct tree_common
)
1131 + tree_code_length
[(int) code
] * sizeof (char *);
1132 if (code
== TREE_VEC
)
1133 length
+= (TREE_VEC_LENGTH (node
) - 1) * sizeof (char *);
1137 t
= ggc_alloc_tree (length
);
1139 t
= (tree
) obstack_alloc (current_obstack
, length
);
1140 memcpy (t
, node
, length
);
1142 /* EXPR_WITH_FILE_LOCATION must keep filename info stored in TREE_CHAIN */
1143 if (TREE_CODE (node
) != EXPR_WITH_FILE_LOCATION
)
1145 TREE_ASM_WRITTEN (t
) = 0;
1147 if (TREE_CODE_CLASS (code
) == 'd')
1148 DECL_UID (t
) = next_decl_uid
++;
1149 else if (TREE_CODE_CLASS (code
) == 't')
1151 TYPE_UID (t
) = next_type_uid
++;
1152 TYPE_OBSTACK (t
) = current_obstack
;
1154 /* The following is so that the debug code for
1155 the copy is different from the original type.
1156 The two statements usually duplicate each other
1157 (because they clear fields of the same union),
1158 but the optimizer should catch that. */
1159 TYPE_SYMTAB_POINTER (t
) = 0;
1160 TYPE_SYMTAB_ADDRESS (t
) = 0;
1163 TREE_PERMANENT (t
) = (current_obstack
== &permanent_obstack
);
1168 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1169 For example, this can copy a list made of TREE_LIST nodes. */
1176 register tree prev
, next
;
1181 head
= prev
= copy_node (list
);
1182 next
= TREE_CHAIN (list
);
1185 TREE_CHAIN (prev
) = copy_node (next
);
1186 prev
= TREE_CHAIN (prev
);
1187 next
= TREE_CHAIN (next
);
1194 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1195 If an identifier with that name has previously been referred to,
1196 the same node is returned this time. */
1199 get_identifier (text
)
1200 register const char *text
;
1205 register int len
, hash_len
;
1207 /* Compute length of text in len. */
1208 len
= strlen (text
);
1210 /* Decide how much of that length to hash on */
1212 if (warn_id_clash
&& (unsigned)len
> id_clash_len
)
1213 hash_len
= id_clash_len
;
1215 /* Compute hash code */
1216 hi
= hash_len
* 613 + (unsigned) text
[0];
1217 for (i
= 1; i
< hash_len
; i
+= 2)
1218 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1220 hi
&= (1 << HASHBITS
) - 1;
1221 hi
%= MAX_HASH_TABLE
;
1223 /* Search table for identifier */
1224 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1225 if (IDENTIFIER_LENGTH (idp
) == len
1226 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1227 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1228 return idp
; /* <-- return if found */
1230 /* Not found; optionally warn about a similar identifier */
1231 if (warn_id_clash
&& do_identifier_warnings
&& (unsigned)len
>= id_clash_len
)
1232 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1233 if (!strncmp (IDENTIFIER_POINTER (idp
), text
, id_clash_len
))
1235 warning ("`%s' and `%s' identical in first %d characters",
1236 IDENTIFIER_POINTER (idp
), text
, id_clash_len
);
1240 if (tree_code_length
[(int) IDENTIFIER_NODE
] < 0)
1241 abort (); /* set_identifier_size hasn't been called. */
1243 /* Not found, create one, add to chain */
1244 idp
= make_node (IDENTIFIER_NODE
);
1245 IDENTIFIER_LENGTH (idp
) = len
;
1246 #ifdef GATHER_STATISTICS
1247 id_string_size
+= len
;
1251 IDENTIFIER_POINTER (idp
) = ggc_alloc_string (text
, len
);
1253 IDENTIFIER_POINTER (idp
) = obstack_copy0 (&permanent_obstack
, text
, len
);
1255 TREE_CHAIN (idp
) = hash_table
[hi
];
1256 hash_table
[hi
] = idp
;
1257 return idp
; /* <-- return if created */
1260 /* If an identifier with the name TEXT (a null-terminated string) has
1261 previously been referred to, return that node; otherwise return
1265 maybe_get_identifier (text
)
1266 register const char *text
;
1271 register int len
, hash_len
;
1273 /* Compute length of text in len. */
1274 len
= strlen (text
);
1276 /* Decide how much of that length to hash on */
1278 if (warn_id_clash
&& (unsigned)len
> id_clash_len
)
1279 hash_len
= id_clash_len
;
1281 /* Compute hash code */
1282 hi
= hash_len
* 613 + (unsigned) text
[0];
1283 for (i
= 1; i
< hash_len
; i
+= 2)
1284 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1286 hi
&= (1 << HASHBITS
) - 1;
1287 hi
%= MAX_HASH_TABLE
;
1289 /* Search table for identifier */
1290 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1291 if (IDENTIFIER_LENGTH (idp
) == len
1292 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1293 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1294 return idp
; /* <-- return if found */
1299 /* Enable warnings on similar identifiers (if requested).
1300 Done after the built-in identifiers are created. */
1303 start_identifier_warnings ()
1305 do_identifier_warnings
= 1;
1308 /* Record the size of an identifier node for the language in use.
1309 SIZE is the total size in bytes.
1310 This is called by the language-specific files. This must be
1311 called before allocating any identifiers. */
1314 set_identifier_size (size
)
1317 tree_code_length
[(int) IDENTIFIER_NODE
]
1318 = (size
- sizeof (struct tree_common
)) / sizeof (tree
);
1321 /* Return a newly constructed INTEGER_CST node whose constant value
1322 is specified by the two ints LOW and HI.
1323 The TREE_TYPE is set to `int'.
1325 This function should be used via the `build_int_2' macro. */
1328 build_int_2_wide (low
, hi
)
1329 HOST_WIDE_INT low
, hi
;
1331 register tree t
= make_node (INTEGER_CST
);
1332 TREE_INT_CST_LOW (t
) = low
;
1333 TREE_INT_CST_HIGH (t
) = hi
;
1334 TREE_TYPE (t
) = integer_type_node
;
1338 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1341 build_real (type
, d
)
1348 /* Check for valid float value for this type on this target machine;
1349 if not, can print error message and store a valid value in D. */
1350 #ifdef CHECK_FLOAT_VALUE
1351 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1354 v
= make_node (REAL_CST
);
1355 TREE_TYPE (v
) = type
;
1356 TREE_REAL_CST (v
) = d
;
1357 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1361 /* Return a new REAL_CST node whose type is TYPE
1362 and whose value is the integer value of the INTEGER_CST node I. */
1364 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1367 real_value_from_int_cst (type
, i
)
1372 #ifdef REAL_ARITHMETIC
1373 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
1374 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1377 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
1378 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
1379 #else /* not REAL_ARITHMETIC */
1380 /* Some 386 compilers mishandle unsigned int to float conversions,
1381 so introduce a temporary variable E to avoid those bugs. */
1382 if (TREE_INT_CST_HIGH (i
) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i
)))
1386 d
= (double) (~ TREE_INT_CST_HIGH (i
));
1387 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1388 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1390 e
= (double) (unsigned HOST_WIDE_INT
) (~ TREE_INT_CST_LOW (i
));
1398 d
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (i
);
1399 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1400 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1402 e
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (i
);
1405 #endif /* not REAL_ARITHMETIC */
1418 build_real_from_int_cst_1 (data
)
1421 struct brfic_args
* args
= (struct brfic_args
*) data
;
1423 #ifdef REAL_ARITHMETIC
1424 args
->d
= real_value_from_int_cst (args
->type
, args
->i
);
1427 REAL_VALUE_TRUNCATE (TYPE_MODE (args
->type
),
1428 real_value_from_int_cst (args
->type
, args
->i
));
1432 /* This function can't be implemented if we can't do arithmetic
1433 on the float representation. */
1436 build_real_from_int_cst (type
, i
)
1441 int overflow
= TREE_OVERFLOW (i
);
1443 struct brfic_args args
;
1445 v
= make_node (REAL_CST
);
1446 TREE_TYPE (v
) = type
;
1448 /* Setup input for build_real_from_int_cst_1() */
1452 if (do_float_handler (build_real_from_int_cst_1
, (PTR
) &args
))
1454 /* Receive output from build_real_from_int_cst_1() */
1459 /* We got an exception from build_real_from_int_cst_1() */
1464 /* Check for valid float value for this type on this target machine. */
1466 #ifdef CHECK_FLOAT_VALUE
1467 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1470 TREE_REAL_CST (v
) = d
;
1471 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1475 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1477 /* Return a newly constructed STRING_CST node whose value is
1478 the LEN characters at STR.
1479 The TREE_TYPE is not initialized. */
1482 build_string (len
, str
)
1486 /* Put the string in saveable_obstack since it will be placed in the RTL
1487 for an "asm" statement and will also be kept around a while if
1488 deferring constant output in varasm.c. */
1490 register tree s
= make_node (STRING_CST
);
1491 TREE_STRING_LENGTH (s
) = len
;
1493 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
1495 TREE_STRING_POINTER (s
) = obstack_copy0 (saveable_obstack
, str
, len
);
1499 /* Return a newly constructed COMPLEX_CST node whose value is
1500 specified by the real and imaginary parts REAL and IMAG.
1501 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1502 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1505 build_complex (type
, real
, imag
)
1509 register tree t
= make_node (COMPLEX_CST
);
1511 TREE_REALPART (t
) = real
;
1512 TREE_IMAGPART (t
) = imag
;
1513 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1514 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1515 TREE_CONSTANT_OVERFLOW (t
)
1516 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1520 /* Build a newly constructed TREE_VEC node of length LEN. */
1527 register int length
= (len
-1) * sizeof (tree
) + sizeof (struct tree_vec
);
1528 register struct obstack
*obstack
= current_obstack
;
1530 #ifdef GATHER_STATISTICS
1531 tree_node_counts
[(int)vec_kind
]++;
1532 tree_node_sizes
[(int)vec_kind
] += length
;
1536 t
= ggc_alloc_tree (length
);
1539 t
= (tree
) obstack_alloc (obstack
, length
);
1540 bzero ((PTR
) t
, length
);
1543 TREE_SET_CODE (t
, TREE_VEC
);
1544 TREE_VEC_LENGTH (t
) = len
;
1545 if (obstack
== &permanent_obstack
)
1546 TREE_PERMANENT (t
) = 1;
1551 /* Return 1 if EXPR is the integer constant zero or a complex constant
1555 integer_zerop (expr
)
1560 return ((TREE_CODE (expr
) == INTEGER_CST
1561 && ! TREE_CONSTANT_OVERFLOW (expr
)
1562 && TREE_INT_CST_LOW (expr
) == 0
1563 && TREE_INT_CST_HIGH (expr
) == 0)
1564 || (TREE_CODE (expr
) == COMPLEX_CST
1565 && integer_zerop (TREE_REALPART (expr
))
1566 && integer_zerop (TREE_IMAGPART (expr
))));
1569 /* Return 1 if EXPR is the integer constant one or the corresponding
1570 complex constant. */
1578 return ((TREE_CODE (expr
) == INTEGER_CST
1579 && ! TREE_CONSTANT_OVERFLOW (expr
)
1580 && TREE_INT_CST_LOW (expr
) == 1
1581 && TREE_INT_CST_HIGH (expr
) == 0)
1582 || (TREE_CODE (expr
) == COMPLEX_CST
1583 && integer_onep (TREE_REALPART (expr
))
1584 && integer_zerop (TREE_IMAGPART (expr
))));
1587 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1588 it contains. Likewise for the corresponding complex constant. */
1591 integer_all_onesp (expr
)
1599 if (TREE_CODE (expr
) == COMPLEX_CST
1600 && integer_all_onesp (TREE_REALPART (expr
))
1601 && integer_zerop (TREE_IMAGPART (expr
)))
1604 else if (TREE_CODE (expr
) != INTEGER_CST
1605 || TREE_CONSTANT_OVERFLOW (expr
))
1608 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
1610 return TREE_INT_CST_LOW (expr
) == -1 && TREE_INT_CST_HIGH (expr
) == -1;
1612 /* Note that using TYPE_PRECISION here is wrong. We care about the
1613 actual bits, not the (arbitrary) range of the type. */
1614 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1615 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1617 int high_value
, shift_amount
;
1619 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1621 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
1622 /* Can not handle precisions greater than twice the host int size. */
1624 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1625 /* Shifting by the host word size is undefined according to the ANSI
1626 standard, so we must handle this as a special case. */
1629 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1631 return TREE_INT_CST_LOW (expr
) == -1
1632 && TREE_INT_CST_HIGH (expr
) == high_value
;
1635 return TREE_INT_CST_LOW (expr
) == ((HOST_WIDE_INT
) 1 << prec
) - 1;
1638 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1642 integer_pow2p (expr
)
1646 HOST_WIDE_INT high
, low
;
1650 if (TREE_CODE (expr
) == COMPLEX_CST
1651 && integer_pow2p (TREE_REALPART (expr
))
1652 && integer_zerop (TREE_IMAGPART (expr
)))
1655 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1658 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1659 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1660 high
= TREE_INT_CST_HIGH (expr
);
1661 low
= TREE_INT_CST_LOW (expr
);
1663 /* First clear all bits that are beyond the type's precision in case
1664 we've been sign extended. */
1666 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1668 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1669 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1673 if (prec
< HOST_BITS_PER_WIDE_INT
)
1674 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1677 if (high
== 0 && low
== 0)
1680 return ((high
== 0 && (low
& (low
- 1)) == 0)
1681 || (low
== 0 && (high
& (high
- 1)) == 0));
1684 /* Return the power of two represented by a tree node known to be a
1692 HOST_WIDE_INT high
, low
;
1696 if (TREE_CODE (expr
) == COMPLEX_CST
)
1697 return tree_log2 (TREE_REALPART (expr
));
1699 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1700 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1702 high
= TREE_INT_CST_HIGH (expr
);
1703 low
= TREE_INT_CST_LOW (expr
);
1705 /* First clear all bits that are beyond the type's precision in case
1706 we've been sign extended. */
1708 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1710 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1711 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1715 if (prec
< HOST_BITS_PER_WIDE_INT
)
1716 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1719 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1720 : exact_log2 (low
));
1723 /* Return 1 if EXPR is the real constant zero. */
1731 return ((TREE_CODE (expr
) == REAL_CST
1732 && ! TREE_CONSTANT_OVERFLOW (expr
)
1733 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1734 || (TREE_CODE (expr
) == COMPLEX_CST
1735 && real_zerop (TREE_REALPART (expr
))
1736 && real_zerop (TREE_IMAGPART (expr
))));
1739 /* Return 1 if EXPR is the real constant one in real or complex form. */
1747 return ((TREE_CODE (expr
) == REAL_CST
1748 && ! TREE_CONSTANT_OVERFLOW (expr
)
1749 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1750 || (TREE_CODE (expr
) == COMPLEX_CST
1751 && real_onep (TREE_REALPART (expr
))
1752 && real_zerop (TREE_IMAGPART (expr
))));
1755 /* Return 1 if EXPR is the real constant two. */
1763 return ((TREE_CODE (expr
) == REAL_CST
1764 && ! TREE_CONSTANT_OVERFLOW (expr
)
1765 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1766 || (TREE_CODE (expr
) == COMPLEX_CST
1767 && real_twop (TREE_REALPART (expr
))
1768 && real_zerop (TREE_IMAGPART (expr
))));
1771 /* Nonzero if EXP is a constant or a cast of a constant. */
1774 really_constant_p (exp
)
1777 /* This is not quite the same as STRIP_NOPS. It does more. */
1778 while (TREE_CODE (exp
) == NOP_EXPR
1779 || TREE_CODE (exp
) == CONVERT_EXPR
1780 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1781 exp
= TREE_OPERAND (exp
, 0);
1782 return TREE_CONSTANT (exp
);
1785 /* Return first list element whose TREE_VALUE is ELEM.
1786 Return 0 if ELEM is not in LIST. */
1789 value_member (elem
, list
)
1794 if (elem
== TREE_VALUE (list
))
1796 list
= TREE_CHAIN (list
);
1801 /* Return first list element whose TREE_PURPOSE is ELEM.
1802 Return 0 if ELEM is not in LIST. */
1805 purpose_member (elem
, list
)
1810 if (elem
== TREE_PURPOSE (list
))
1812 list
= TREE_CHAIN (list
);
1817 /* Return first list element whose BINFO_TYPE is ELEM.
1818 Return 0 if ELEM is not in LIST. */
1821 binfo_member (elem
, list
)
1826 if (elem
== BINFO_TYPE (list
))
1828 list
= TREE_CHAIN (list
);
1833 /* Return nonzero if ELEM is part of the chain CHAIN. */
1836 chain_member (elem
, chain
)
1843 chain
= TREE_CHAIN (chain
);
1849 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1851 /* ??? This function was added for machine specific attributes but is no
1852 longer used. It could be deleted if we could confirm all front ends
1856 chain_member_value (elem
, chain
)
1861 if (elem
== TREE_VALUE (chain
))
1863 chain
= TREE_CHAIN (chain
);
1869 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1870 for any piece of chain CHAIN. */
1871 /* ??? This function was added for machine specific attributes but is no
1872 longer used. It could be deleted if we could confirm all front ends
1876 chain_member_purpose (elem
, chain
)
1881 if (elem
== TREE_PURPOSE (chain
))
1883 chain
= TREE_CHAIN (chain
);
1889 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1890 We expect a null pointer to mark the end of the chain.
1891 This is the Lisp primitive `length'. */
1898 register int len
= 0;
1900 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1906 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1907 by modifying the last node in chain 1 to point to chain 2.
1908 This is the Lisp primitive `nconc'. */
1918 #ifdef ENABLE_CHECKING
1922 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1924 TREE_CHAIN (t1
) = op2
;
1925 #ifdef ENABLE_CHECKING
1926 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1928 abort (); /* Circularity created. */
1935 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1939 register tree chain
;
1943 while ((next
= TREE_CHAIN (chain
)))
1948 /* Reverse the order of elements in the chain T,
1949 and return the new head of the chain (old last element). */
1955 register tree prev
= 0, decl
, next
;
1956 for (decl
= t
; decl
; decl
= next
)
1958 next
= TREE_CHAIN (decl
);
1959 TREE_CHAIN (decl
) = prev
;
1965 /* Given a chain CHAIN of tree nodes,
1966 construct and return a list of those nodes. */
1972 tree result
= NULL_TREE
;
1973 tree in_tail
= chain
;
1974 tree out_tail
= NULL_TREE
;
1978 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
1980 TREE_CHAIN (out_tail
) = next
;
1984 in_tail
= TREE_CHAIN (in_tail
);
1990 /* Return a newly created TREE_LIST node whose
1991 purpose and value fields are PARM and VALUE. */
1994 build_tree_list (parm
, value
)
1997 register tree t
= make_node (TREE_LIST
);
1998 TREE_PURPOSE (t
) = parm
;
1999 TREE_VALUE (t
) = value
;
2003 /* Similar, but build on the temp_decl_obstack. */
2006 build_decl_list (parm
, value
)
2010 register struct obstack
*ambient_obstack
= current_obstack
;
2011 current_obstack
= &temp_decl_obstack
;
2012 node
= build_tree_list (parm
, value
);
2013 current_obstack
= ambient_obstack
;
2017 /* Similar, but build on the expression_obstack. */
2020 build_expr_list (parm
, value
)
2024 register struct obstack
*ambient_obstack
= current_obstack
;
2025 current_obstack
= expression_obstack
;
2026 node
= build_tree_list (parm
, value
);
2027 current_obstack
= ambient_obstack
;
2031 /* Return a newly created TREE_LIST node whose
2032 purpose and value fields are PARM and VALUE
2033 and whose TREE_CHAIN is CHAIN. */
2036 tree_cons (purpose
, value
, chain
)
2037 tree purpose
, value
, chain
;
2040 register tree node
= make_node (TREE_LIST
);
2045 node
= ggc_alloc_tree (sizeof (struct tree_list
));
2048 node
= (tree
) obstack_alloc (current_obstack
, sizeof (struct tree_list
));
2049 bzero (node
, sizeof (struct tree_common
));
2052 #ifdef GATHER_STATISTICS
2053 tree_node_counts
[(int)x_kind
]++;
2054 tree_node_sizes
[(int)x_kind
] += sizeof (struct tree_list
);
2058 TREE_SET_CODE (node
, TREE_LIST
);
2059 if (current_obstack
== &permanent_obstack
)
2060 TREE_PERMANENT (node
) = 1;
2063 TREE_CHAIN (node
) = chain
;
2064 TREE_PURPOSE (node
) = purpose
;
2065 TREE_VALUE (node
) = value
;
2069 /* Similar, but build on the temp_decl_obstack. */
2072 decl_tree_cons (purpose
, value
, chain
)
2073 tree purpose
, value
, chain
;
2076 register struct obstack
*ambient_obstack
= current_obstack
;
2077 current_obstack
= &temp_decl_obstack
;
2078 node
= tree_cons (purpose
, value
, chain
);
2079 current_obstack
= ambient_obstack
;
2083 /* Similar, but build on the expression_obstack. */
2086 expr_tree_cons (purpose
, value
, chain
)
2087 tree purpose
, value
, chain
;
2090 register struct obstack
*ambient_obstack
= current_obstack
;
2091 current_obstack
= expression_obstack
;
2092 node
= tree_cons (purpose
, value
, chain
);
2093 current_obstack
= ambient_obstack
;
2097 /* Same as `tree_cons' but make a permanent object. */
2100 perm_tree_cons (purpose
, value
, chain
)
2101 tree purpose
, value
, chain
;
2104 register struct obstack
*ambient_obstack
= current_obstack
;
2105 current_obstack
= &permanent_obstack
;
2107 node
= tree_cons (purpose
, value
, chain
);
2108 current_obstack
= ambient_obstack
;
2112 /* Same as `tree_cons', but make this node temporary, regardless. */
2115 temp_tree_cons (purpose
, value
, chain
)
2116 tree purpose
, value
, chain
;
2119 register struct obstack
*ambient_obstack
= current_obstack
;
2120 current_obstack
= &temporary_obstack
;
2122 node
= tree_cons (purpose
, value
, chain
);
2123 current_obstack
= ambient_obstack
;
2127 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2130 saveable_tree_cons (purpose
, value
, chain
)
2131 tree purpose
, value
, chain
;
2134 register struct obstack
*ambient_obstack
= current_obstack
;
2135 current_obstack
= saveable_obstack
;
2137 node
= tree_cons (purpose
, value
, chain
);
2138 current_obstack
= ambient_obstack
;
2142 /* Return the size nominally occupied by an object of type TYPE
2143 when it resides in memory. The value is measured in units of bytes,
2144 and its data type is that normally used for type sizes
2145 (which is the first type created by make_signed_type or
2146 make_unsigned_type). */
2149 size_in_bytes (type
)
2154 if (type
== error_mark_node
)
2155 return integer_zero_node
;
2157 type
= TYPE_MAIN_VARIANT (type
);
2158 t
= TYPE_SIZE_UNIT (type
);
2161 incomplete_type_error (NULL_TREE
, type
);
2162 return integer_zero_node
;
2164 if (TREE_CODE (t
) == INTEGER_CST
)
2165 force_fit_type (t
, 0);
2170 /* Return the size of TYPE (in bytes) as a wide integer
2171 or return -1 if the size can vary or is larger than an integer. */
2174 int_size_in_bytes (type
)
2179 if (type
== error_mark_node
)
2182 type
= TYPE_MAIN_VARIANT (type
);
2183 t
= TYPE_SIZE_UNIT (type
);
2185 || TREE_CODE (t
) != INTEGER_CST
2186 || TREE_INT_CST_HIGH (t
) != 0)
2189 return TREE_INT_CST_LOW (t
);
2192 /* Return, as a tree node, the number of elements for TYPE (which is an
2193 ARRAY_TYPE) minus one. This counts only elements of the top array.
2195 Don't let any SAVE_EXPRs escape; if we are called as part of a cleanup
2196 action, they would get unsaved. */
2199 array_type_nelts (type
)
2202 tree index_type
, min
, max
;
2204 /* If they did it with unspecified bounds, then we should have already
2205 given an error about it before we got here. */
2206 if (! TYPE_DOMAIN (type
))
2207 return error_mark_node
;
2209 index_type
= TYPE_DOMAIN (type
);
2210 min
= TYPE_MIN_VALUE (index_type
);
2211 max
= TYPE_MAX_VALUE (index_type
);
2213 if (! TREE_CONSTANT (min
))
2216 if (TREE_CODE (min
) == SAVE_EXPR
&& SAVE_EXPR_RTL (min
))
2217 min
= build (RTL_EXPR
, TREE_TYPE (TYPE_MIN_VALUE (index_type
)), 0,
2218 SAVE_EXPR_RTL (min
));
2220 min
= TYPE_MIN_VALUE (index_type
);
2223 if (! TREE_CONSTANT (max
))
2226 if (TREE_CODE (max
) == SAVE_EXPR
&& SAVE_EXPR_RTL (max
))
2227 max
= build (RTL_EXPR
, TREE_TYPE (TYPE_MAX_VALUE (index_type
)), 0,
2228 SAVE_EXPR_RTL (max
));
2230 max
= TYPE_MAX_VALUE (index_type
);
2233 return (integer_zerop (min
)
2235 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
2238 /* Return nonzero if arg is static -- a reference to an object in
2239 static storage. This is not the same as the C meaning of `static'. */
2245 switch (TREE_CODE (arg
))
2248 /* Nested functions aren't static, since taking their address
2249 involves a trampoline. */
2250 return (decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
2251 && ! DECL_NON_ADDR_CONST_P (arg
);
2254 return (TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2255 && ! DECL_NON_ADDR_CONST_P (arg
);
2258 return TREE_STATIC (arg
);
2263 /* If we are referencing a bitfield, we can't evaluate an
2264 ADDR_EXPR at compile time and so it isn't a constant. */
2266 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
2267 && staticp (TREE_OPERAND (arg
, 0)));
2273 /* This case is technically correct, but results in setting
2274 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2277 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
2281 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2282 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2283 return staticp (TREE_OPERAND (arg
, 0));
2290 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2291 Do this to any expression which may be used in more than one place,
2292 but must be evaluated only once.
2294 Normally, expand_expr would reevaluate the expression each time.
2295 Calling save_expr produces something that is evaluated and recorded
2296 the first time expand_expr is called on it. Subsequent calls to
2297 expand_expr just reuse the recorded value.
2299 The call to expand_expr that generates code that actually computes
2300 the value is the first call *at compile time*. Subsequent calls
2301 *at compile time* generate code to use the saved value.
2302 This produces correct result provided that *at run time* control
2303 always flows through the insns made by the first expand_expr
2304 before reaching the other places where the save_expr was evaluated.
2305 You, the caller of save_expr, must make sure this is so.
2307 Constants, and certain read-only nodes, are returned with no
2308 SAVE_EXPR because that is safe. Expressions containing placeholders
2309 are not touched; see tree.def for an explanation of what these
2316 register tree t
= fold (expr
);
2318 /* We don't care about whether this can be used as an lvalue in this
2320 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
2321 t
= TREE_OPERAND (t
, 0);
2323 /* If the tree evaluates to a constant, then we don't want to hide that
2324 fact (i.e. this allows further folding, and direct checks for constants).
2325 However, a read-only object that has side effects cannot be bypassed.
2326 Since it is no problem to reevaluate literals, we just return the
2329 if (TREE_CONSTANT (t
) || (TREE_READONLY (t
) && ! TREE_SIDE_EFFECTS (t
))
2330 || TREE_CODE (t
) == SAVE_EXPR
|| TREE_CODE (t
) == ERROR_MARK
)
2333 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2334 it means that the size or offset of some field of an object depends on
2335 the value within another field.
2337 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2338 and some variable since it would then need to be both evaluated once and
2339 evaluated more than once. Front-ends must assure this case cannot
2340 happen by surrounding any such subexpressions in their own SAVE_EXPR
2341 and forcing evaluation at the proper time. */
2342 if (contains_placeholder_p (t
))
2345 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
2347 /* This expression might be placed ahead of a jump to ensure that the
2348 value was computed on both sides of the jump. So make sure it isn't
2349 eliminated as dead. */
2350 TREE_SIDE_EFFECTS (t
) = 1;
2354 /* Arrange for an expression to be expanded multiple independent
2355 times. This is useful for cleanup actions, as the backend can
2356 expand them multiple times in different places. */
2364 /* If this is already protected, no sense in protecting it again. */
2365 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
2368 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
2369 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
2373 /* Returns the index of the first non-tree operand for CODE, or the number
2374 of operands if all are trees. */
2378 enum tree_code code
;
2384 case GOTO_SUBROUTINE_EXPR
:
2389 case WITH_CLEANUP_EXPR
:
2390 /* Should be defined to be 2. */
2392 case METHOD_CALL_EXPR
:
2395 return tree_code_length
[(int) code
];
2399 /* Modify a tree in place so that all the evaluate only once things
2400 are cleared out. Return the EXPR given.
2402 LANG_UNSAVE_EXPR_NOW, if set, is a pointer to a function to handle
2403 language specific nodes.
2407 unsave_expr_now (expr
)
2410 enum tree_code code
;
2414 if (expr
== NULL_TREE
)
2417 code
= TREE_CODE (expr
);
2418 first_rtl
= first_rtl_op (code
);
2422 SAVE_EXPR_RTL (expr
) = 0;
2426 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2427 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2431 /* I don't yet know how to emit a sequence multiple times. */
2432 if (RTL_EXPR_SEQUENCE (expr
) != 0)
2437 CALL_EXPR_RTL (expr
) = 0;
2438 if (TREE_OPERAND (expr
, 1)
2439 && TREE_CODE (TREE_OPERAND (expr
, 1)) == TREE_LIST
)
2441 tree exp
= TREE_OPERAND (expr
, 1);
2444 unsave_expr_now (TREE_VALUE (exp
));
2445 exp
= TREE_CHAIN (exp
);
2451 if (lang_unsave_expr_now
)
2452 (*lang_unsave_expr_now
) (expr
);
2456 switch (TREE_CODE_CLASS (code
))
2458 case 'c': /* a constant */
2459 case 't': /* a type node */
2460 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2461 case 'd': /* A decl node */
2462 case 'b': /* A block node */
2465 case 'e': /* an expression */
2466 case 'r': /* a reference */
2467 case 's': /* an expression with side effects */
2468 case '<': /* a comparison expression */
2469 case '2': /* a binary arithmetic expression */
2470 case '1': /* a unary arithmetic expression */
2471 for (i
= first_rtl
- 1; i
>= 0; i
--)
2472 unsave_expr_now (TREE_OPERAND (expr
, i
));
2480 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2481 or offset that depends on a field within a record. */
2484 contains_placeholder_p (exp
)
2487 register enum tree_code code
= TREE_CODE (exp
);
2490 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2491 in it since it is supplying a value for it. */
2492 if (code
== WITH_RECORD_EXPR
)
2494 else if (code
== PLACEHOLDER_EXPR
)
2497 switch (TREE_CODE_CLASS (code
))
2500 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2501 position computations since they will be converted into a
2502 WITH_RECORD_EXPR involving the reference, which will assume
2503 here will be valid. */
2504 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2507 if (code
== TREE_LIST
)
2508 return (contains_placeholder_p (TREE_VALUE (exp
))
2509 || (TREE_CHAIN (exp
) != 0
2510 && contains_placeholder_p (TREE_CHAIN (exp
))));
2519 /* Ignoring the first operand isn't quite right, but works best. */
2520 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
2527 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2528 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
2529 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
2532 /* If we already know this doesn't have a placeholder, don't
2534 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
2537 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
2538 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
2540 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
2545 return (TREE_OPERAND (exp
, 1) != 0
2546 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2552 switch (tree_code_length
[(int) code
])
2555 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2557 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2558 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2569 /* Return 1 if EXP contains any expressions that produce cleanups for an
2570 outer scope to deal with. Used by fold. */
2578 if (! TREE_SIDE_EFFECTS (exp
))
2581 switch (TREE_CODE (exp
))
2584 case GOTO_SUBROUTINE_EXPR
:
2585 case WITH_CLEANUP_EXPR
:
2588 case CLEANUP_POINT_EXPR
:
2592 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
2594 cmp
= has_cleanups (TREE_VALUE (exp
));
2604 /* This general rule works for most tree codes. All exceptions should be
2605 handled above. If this is a language-specific tree code, we can't
2606 trust what might be in the operand, so say we don't know
2608 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
2611 nops
= first_rtl_op (TREE_CODE (exp
));
2612 for (i
= 0; i
< nops
; i
++)
2613 if (TREE_OPERAND (exp
, i
) != 0)
2615 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
2616 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
2617 || type
== 'r' || type
== 's')
2619 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
2628 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2629 return a tree with all occurrences of references to F in a
2630 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2631 contains only arithmetic expressions or a CALL_EXPR with a
2632 PLACEHOLDER_EXPR occurring only in its arglist. */
2635 substitute_in_expr (exp
, f
, r
)
2640 enum tree_code code
= TREE_CODE (exp
);
2645 switch (TREE_CODE_CLASS (code
))
2652 if (code
== PLACEHOLDER_EXPR
)
2654 else if (code
== TREE_LIST
)
2656 op0
= (TREE_CHAIN (exp
) == 0
2657 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2658 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2659 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2662 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2671 switch (tree_code_length
[(int) code
])
2674 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2675 if (op0
== TREE_OPERAND (exp
, 0))
2678 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2682 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2683 could, but we don't support it. */
2684 if (code
== RTL_EXPR
)
2686 else if (code
== CONSTRUCTOR
)
2689 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2690 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2691 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2694 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2698 /* It cannot be that anything inside a SAVE_EXPR contains a
2699 PLACEHOLDER_EXPR. */
2700 if (code
== SAVE_EXPR
)
2703 else if (code
== CALL_EXPR
)
2705 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2706 if (op1
== TREE_OPERAND (exp
, 1))
2709 return build (code
, TREE_TYPE (exp
),
2710 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2713 else if (code
!= COND_EXPR
)
2716 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2717 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2718 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2719 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2720 && op2
== TREE_OPERAND (exp
, 2))
2723 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2736 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2737 and it is the right field, replace it with R. */
2738 for (inner
= TREE_OPERAND (exp
, 0);
2739 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2740 inner
= TREE_OPERAND (inner
, 0))
2742 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2743 && TREE_OPERAND (exp
, 1) == f
)
2746 /* If this expression hasn't been completed let, leave it
2748 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2749 && TREE_TYPE (inner
) == 0)
2752 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2753 if (op0
== TREE_OPERAND (exp
, 0))
2756 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2757 TREE_OPERAND (exp
, 1)));
2761 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2762 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2763 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2764 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2765 && op2
== TREE_OPERAND (exp
, 2))
2768 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2773 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2774 if (op0
== TREE_OPERAND (exp
, 0))
2777 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2789 TREE_READONLY (new) = TREE_READONLY (exp
);
2793 /* Stabilize a reference so that we can use it any number of times
2794 without causing its operands to be evaluated more than once.
2795 Returns the stabilized reference. This works by means of save_expr,
2796 so see the caveats in the comments about save_expr.
2798 Also allows conversion expressions whose operands are references.
2799 Any other kind of expression is returned unchanged. */
2802 stabilize_reference (ref
)
2805 register tree result
;
2806 register enum tree_code code
= TREE_CODE (ref
);
2813 /* No action is needed in this case. */
2819 case FIX_TRUNC_EXPR
:
2820 case FIX_FLOOR_EXPR
:
2821 case FIX_ROUND_EXPR
:
2823 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2827 result
= build_nt (INDIRECT_REF
,
2828 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2832 result
= build_nt (COMPONENT_REF
,
2833 stabilize_reference (TREE_OPERAND (ref
, 0)),
2834 TREE_OPERAND (ref
, 1));
2838 result
= build_nt (BIT_FIELD_REF
,
2839 stabilize_reference (TREE_OPERAND (ref
, 0)),
2840 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2841 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2845 result
= build_nt (ARRAY_REF
,
2846 stabilize_reference (TREE_OPERAND (ref
, 0)),
2847 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2851 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2852 it wouldn't be ignored. This matters when dealing with
2854 return stabilize_reference_1 (ref
);
2857 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2858 save_expr (build1 (ADDR_EXPR
,
2859 build_pointer_type (TREE_TYPE (ref
)),
2864 /* If arg isn't a kind of lvalue we recognize, make no change.
2865 Caller should recognize the error for an invalid lvalue. */
2870 return error_mark_node
;
2873 TREE_TYPE (result
) = TREE_TYPE (ref
);
2874 TREE_READONLY (result
) = TREE_READONLY (ref
);
2875 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2876 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2877 TREE_RAISES (result
) = TREE_RAISES (ref
);
2882 /* Subroutine of stabilize_reference; this is called for subtrees of
2883 references. Any expression with side-effects must be put in a SAVE_EXPR
2884 to ensure that it is only evaluated once.
2886 We don't put SAVE_EXPR nodes around everything, because assigning very
2887 simple expressions to temporaries causes us to miss good opportunities
2888 for optimizations. Among other things, the opportunity to fold in the
2889 addition of a constant into an addressing mode often gets lost, e.g.
2890 "y[i+1] += x;". In general, we take the approach that we should not make
2891 an assignment unless we are forced into it - i.e., that any non-side effect
2892 operator should be allowed, and that cse should take care of coalescing
2893 multiple utterances of the same expression should that prove fruitful. */
2896 stabilize_reference_1 (e
)
2899 register tree result
;
2900 register enum tree_code code
= TREE_CODE (e
);
2902 /* We cannot ignore const expressions because it might be a reference
2903 to a const array but whose index contains side-effects. But we can
2904 ignore things that are actual constant or that already have been
2905 handled by this function. */
2907 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2910 switch (TREE_CODE_CLASS (code
))
2920 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2921 so that it will only be evaluated once. */
2922 /* The reference (r) and comparison (<) classes could be handled as
2923 below, but it is generally faster to only evaluate them once. */
2924 if (TREE_SIDE_EFFECTS (e
))
2925 return save_expr (e
);
2929 /* Constants need no processing. In fact, we should never reach
2934 /* Division is slow and tends to be compiled with jumps,
2935 especially the division by powers of 2 that is often
2936 found inside of an array reference. So do it just once. */
2937 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2938 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2939 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2940 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2941 return save_expr (e
);
2942 /* Recursively stabilize each operand. */
2943 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2944 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2948 /* Recursively stabilize each operand. */
2949 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2956 TREE_TYPE (result
) = TREE_TYPE (e
);
2957 TREE_READONLY (result
) = TREE_READONLY (e
);
2958 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2959 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2960 TREE_RAISES (result
) = TREE_RAISES (e
);
2965 /* Low-level constructors for expressions. */
2967 /* Build an expression of code CODE, data type TYPE,
2968 and operands as specified by the arguments ARG1 and following arguments.
2969 Expressions and reference nodes can be created this way.
2970 Constants, decls, types and misc nodes cannot be. */
2973 build
VPROTO((enum tree_code code
, tree tt
, ...))
2975 #ifndef ANSI_PROTOTYPES
2976 enum tree_code code
;
2981 register int length
;
2986 #ifndef ANSI_PROTOTYPES
2987 code
= va_arg (p
, enum tree_code
);
2988 tt
= va_arg (p
, tree
);
2991 t
= make_node (code
);
2992 length
= tree_code_length
[(int) code
];
2997 /* This is equivalent to the loop below, but faster. */
2998 register tree arg0
= va_arg (p
, tree
);
2999 register tree arg1
= va_arg (p
, tree
);
3000 TREE_OPERAND (t
, 0) = arg0
;
3001 TREE_OPERAND (t
, 1) = arg1
;
3002 if ((arg0
&& TREE_SIDE_EFFECTS (arg0
))
3003 || (arg1
&& TREE_SIDE_EFFECTS (arg1
)))
3004 TREE_SIDE_EFFECTS (t
) = 1;
3006 = (arg0
&& TREE_RAISES (arg0
)) || (arg1
&& TREE_RAISES (arg1
));
3008 else if (length
== 1)
3010 register tree arg0
= va_arg (p
, tree
);
3012 /* Call build1 for this! */
3013 if (TREE_CODE_CLASS (code
) != 's')
3015 TREE_OPERAND (t
, 0) = arg0
;
3016 if (arg0
&& TREE_SIDE_EFFECTS (arg0
))
3017 TREE_SIDE_EFFECTS (t
) = 1;
3018 TREE_RAISES (t
) = (arg0
&& TREE_RAISES (arg0
));
3022 for (i
= 0; i
< length
; i
++)
3024 register tree operand
= va_arg (p
, tree
);
3025 TREE_OPERAND (t
, i
) = operand
;
3028 if (TREE_SIDE_EFFECTS (operand
))
3029 TREE_SIDE_EFFECTS (t
) = 1;
3030 if (TREE_RAISES (operand
))
3031 TREE_RAISES (t
) = 1;
3039 /* Same as above, but only builds for unary operators.
3040 Saves lions share of calls to `build'; cuts down use
3041 of varargs, which is expensive for RISC machines. */
3044 build1 (code
, type
, node
)
3045 enum tree_code code
;
3049 register struct obstack
*obstack
= expression_obstack
;
3050 register int length
;
3051 #ifdef GATHER_STATISTICS
3052 register tree_node_kind kind
;
3056 #ifdef GATHER_STATISTICS
3057 if (TREE_CODE_CLASS (code
) == 'r')
3063 length
= sizeof (struct tree_exp
);
3066 t
= ggc_alloc_tree (length
);
3068 t
= (tree
) obstack_alloc (obstack
, length
);
3069 bzero ((PTR
) t
, length
);
3071 #ifdef GATHER_STATISTICS
3072 tree_node_counts
[(int)kind
]++;
3073 tree_node_sizes
[(int)kind
] += length
;
3076 TREE_TYPE (t
) = type
;
3077 TREE_SET_CODE (t
, code
);
3079 if (obstack
== &permanent_obstack
)
3080 TREE_PERMANENT (t
) = 1;
3082 TREE_OPERAND (t
, 0) = node
;
3085 if (TREE_SIDE_EFFECTS (node
))
3086 TREE_SIDE_EFFECTS (t
) = 1;
3087 if (TREE_RAISES (node
))
3088 TREE_RAISES (t
) = 1;
3094 /* Similar except don't specify the TREE_TYPE
3095 and leave the TREE_SIDE_EFFECTS as 0.
3096 It is permissible for arguments to be null,
3097 or even garbage if their values do not matter. */
3100 build_nt
VPROTO((enum tree_code code
, ...))
3102 #ifndef ANSI_PROTOTYPES
3103 enum tree_code code
;
3107 register int length
;
3112 #ifndef ANSI_PROTOTYPES
3113 code
= va_arg (p
, enum tree_code
);
3116 t
= make_node (code
);
3117 length
= tree_code_length
[(int) code
];
3119 for (i
= 0; i
< length
; i
++)
3120 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3126 /* Similar to `build_nt', except we build
3127 on the temp_decl_obstack, regardless. */
3130 build_parse_node
VPROTO((enum tree_code code
, ...))
3132 #ifndef ANSI_PROTOTYPES
3133 enum tree_code code
;
3135 register struct obstack
*ambient_obstack
= expression_obstack
;
3138 register int length
;
3143 #ifndef ANSI_PROTOTYPES
3144 code
= va_arg (p
, enum tree_code
);
3147 expression_obstack
= &temp_decl_obstack
;
3149 t
= make_node (code
);
3150 length
= tree_code_length
[(int) code
];
3152 for (i
= 0; i
< length
; i
++)
3153 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3156 expression_obstack
= ambient_obstack
;
3161 /* Commented out because this wants to be done very
3162 differently. See cp-lex.c. */
3164 build_op_identifier (op1
, op2
)
3167 register tree t
= make_node (OP_IDENTIFIER
);
3168 TREE_PURPOSE (t
) = op1
;
3169 TREE_VALUE (t
) = op2
;
3174 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3175 We do NOT enter this node in any sort of symbol table.
3177 layout_decl is used to set up the decl's storage layout.
3178 Other slots are initialized to 0 or null pointers. */
3181 build_decl (code
, name
, type
)
3182 enum tree_code code
;
3187 t
= make_node (code
);
3189 /* if (type == error_mark_node)
3190 type = integer_type_node; */
3191 /* That is not done, deliberately, so that having error_mark_node
3192 as the type can suppress useless errors in the use of this variable. */
3194 DECL_NAME (t
) = name
;
3195 DECL_ASSEMBLER_NAME (t
) = name
;
3196 TREE_TYPE (t
) = type
;
3198 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3200 else if (code
== FUNCTION_DECL
)
3201 DECL_MODE (t
) = FUNCTION_MODE
;
3206 /* BLOCK nodes are used to represent the structure of binding contours
3207 and declarations, once those contours have been exited and their contents
3208 compiled. This information is used for outputting debugging info. */
3211 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
3212 tree vars
, tags
, subblocks
, supercontext
, chain
;
3214 register tree block
= make_node (BLOCK
);
3215 BLOCK_VARS (block
) = vars
;
3216 BLOCK_TYPE_TAGS (block
) = tags
;
3217 BLOCK_SUBBLOCKS (block
) = subblocks
;
3218 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3219 BLOCK_CHAIN (block
) = chain
;
3223 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3224 location where an expression or an identifier were encountered. It
3225 is necessary for languages where the frontend parser will handle
3226 recursively more than one file (Java is one of them). */
3229 build_expr_wfl (node
, file
, line
, col
)
3234 static const char *last_file
= 0;
3235 static tree last_filenode
= NULL_TREE
;
3236 register tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
3238 EXPR_WFL_NODE (wfl
) = node
;
3239 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
3240 if (file
!= last_file
)
3243 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
3245 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
3248 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
3249 TREE_TYPE (wfl
) = TREE_TYPE (node
);
3254 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3258 build_decl_attribute_variant (ddecl
, attribute
)
3259 tree ddecl
, attribute
;
3261 DECL_MACHINE_ATTRIBUTES (ddecl
) = attribute
;
3265 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3268 Record such modified types already made so we don't make duplicates. */
3271 build_type_attribute_variant (ttype
, attribute
)
3272 tree ttype
, attribute
;
3274 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3276 register int hashcode
;
3277 register struct obstack
*ambient_obstack
= current_obstack
;
3280 if (ambient_obstack
!= &permanent_obstack
)
3281 current_obstack
= TYPE_OBSTACK (ttype
);
3283 ntype
= copy_node (ttype
);
3285 TYPE_POINTER_TO (ntype
) = 0;
3286 TYPE_REFERENCE_TO (ntype
) = 0;
3287 TYPE_ATTRIBUTES (ntype
) = attribute
;
3289 /* Create a new main variant of TYPE. */
3290 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3291 TYPE_NEXT_VARIANT (ntype
) = 0;
3292 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3294 hashcode
= TYPE_HASH (TREE_CODE (ntype
))
3295 + TYPE_HASH (TREE_TYPE (ntype
))
3296 + attribute_hash_list (attribute
);
3298 switch (TREE_CODE (ntype
))
3301 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
3304 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
3307 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
3310 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
3316 ntype
= type_hash_canon (hashcode
, ntype
);
3317 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3319 /* We must restore the current obstack after the type_hash_canon call,
3320 because type_hash_canon calls type_hash_add for permanent types, and
3321 then type_hash_add calls oballoc expecting to get something permanent
3323 current_obstack
= ambient_obstack
;
3329 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3330 or type TYPE and 0 otherwise. Validity is determined the configuration
3331 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3334 valid_machine_attribute (attr_name
, attr_args
, decl
, type
)
3336 tree attr_args ATTRIBUTE_UNUSED
;
3337 tree decl ATTRIBUTE_UNUSED
;
3338 tree type ATTRIBUTE_UNUSED
;
3341 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3342 tree decl_attr_list
= decl
!= 0 ? DECL_MACHINE_ATTRIBUTES (decl
) : 0;
3344 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3345 tree type_attr_list
= TYPE_ATTRIBUTES (type
);
3348 if (TREE_CODE (attr_name
) != IDENTIFIER_NODE
)
3351 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3353 && VALID_MACHINE_DECL_ATTRIBUTE (decl
, decl_attr_list
, attr_name
, attr_args
))
3355 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3358 if (attr
!= NULL_TREE
)
3360 /* Override existing arguments. Declarations are unique so we can
3361 modify this in place. */
3362 TREE_VALUE (attr
) = attr_args
;
3366 decl_attr_list
= tree_cons (attr_name
, attr_args
, decl_attr_list
);
3367 decl
= build_decl_attribute_variant (decl
, decl_attr_list
);
3374 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3376 /* Don't apply the attribute to both the decl and the type. */;
3377 else if (VALID_MACHINE_TYPE_ATTRIBUTE (type
, type_attr_list
, attr_name
,
3380 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3383 if (attr
!= NULL_TREE
)
3385 /* Override existing arguments.
3386 ??? This currently works since attribute arguments are not
3387 included in `attribute_hash_list'. Something more complicated
3388 may be needed in the future. */
3389 TREE_VALUE (attr
) = attr_args
;
3393 /* If this is part of a declaration, create a type variant,
3394 otherwise, this is part of a type definition, so add it
3395 to the base type. */
3396 type_attr_list
= tree_cons (attr_name
, attr_args
, type_attr_list
);
3398 type
= build_type_attribute_variant (type
, type_attr_list
);
3400 TYPE_ATTRIBUTES (type
) = type_attr_list
;
3403 TREE_TYPE (decl
) = type
;
3407 /* Handle putting a type attribute on pointer-to-function-type by putting
3408 the attribute on the function type. */
3409 else if (POINTER_TYPE_P (type
)
3410 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3411 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type
), type_attr_list
,
3412 attr_name
, attr_args
))
3414 tree inner_type
= TREE_TYPE (type
);
3415 tree inner_attr_list
= TYPE_ATTRIBUTES (inner_type
);
3416 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3419 if (attr
!= NULL_TREE
)
3420 TREE_VALUE (attr
) = attr_args
;
3423 inner_attr_list
= tree_cons (attr_name
, attr_args
, inner_attr_list
);
3424 inner_type
= build_type_attribute_variant (inner_type
,
3429 TREE_TYPE (decl
) = build_pointer_type (inner_type
);
3432 /* Clear TYPE_POINTER_TO for the old inner type, since
3433 `type' won't be pointing to it anymore. */
3434 TYPE_POINTER_TO (TREE_TYPE (type
)) = NULL_TREE
;
3435 TREE_TYPE (type
) = inner_type
;
3445 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3448 We try both `text' and `__text__', ATTR may be either one. */
3449 /* ??? It might be a reasonable simplification to require ATTR to be only
3450 `text'. One might then also require attribute lists to be stored in
3451 their canonicalized form. */
3454 is_attribute_p (attr
, ident
)
3458 int ident_len
, attr_len
;
3461 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3464 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
3467 p
= IDENTIFIER_POINTER (ident
);
3468 ident_len
= strlen (p
);
3469 attr_len
= strlen (attr
);
3471 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3475 || attr
[attr_len
- 2] != '_'
3476 || attr
[attr_len
- 1] != '_')
3478 if (ident_len
== attr_len
- 4
3479 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3484 if (ident_len
== attr_len
+ 4
3485 && p
[0] == '_' && p
[1] == '_'
3486 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3487 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3494 /* Given an attribute name and a list of attributes, return a pointer to the
3495 attribute's list element if the attribute is part of the list, or NULL_TREE
3499 lookup_attribute (attr_name
, list
)
3500 const char *attr_name
;
3505 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3507 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
3509 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
3516 /* Return an attribute list that is the union of a1 and a2. */
3519 merge_attributes (a1
, a2
)
3520 register tree a1
, a2
;
3524 /* Either one unset? Take the set one. */
3526 if (! (attributes
= a1
))
3529 /* One that completely contains the other? Take it. */
3531 else if (a2
&& ! attribute_list_contained (a1
, a2
))
3533 if (attribute_list_contained (a2
, a1
))
3537 /* Pick the longest list, and hang on the other list. */
3538 /* ??? For the moment we punt on the issue of attrs with args. */
3540 if (list_length (a1
) < list_length (a2
))
3541 attributes
= a2
, a2
= a1
;
3543 for (; a2
; a2
= TREE_CHAIN (a2
))
3544 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3545 attributes
) == NULL_TREE
)
3547 a1
= copy_node (a2
);
3548 TREE_CHAIN (a1
) = attributes
;
3556 /* Given types T1 and T2, merge their attributes and return
3560 merge_machine_type_attributes (t1
, t2
)
3563 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3564 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1
, t2
);
3566 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3567 TYPE_ATTRIBUTES (t2
));
3571 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3575 merge_machine_decl_attributes (olddecl
, newdecl
)
3576 tree olddecl
, newdecl
;
3578 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3579 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl
, newdecl
);
3581 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl
),
3582 DECL_MACHINE_ATTRIBUTES (newdecl
));
3586 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3587 of the various TYPE_QUAL values. */
3590 set_type_quals (type
, type_quals
)
3594 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3595 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3596 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3599 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
3600 the same kind of data as TYPE describes. Variants point to the
3601 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
3602 and it points to a chain of other variants so that duplicate
3603 variants are never made. Only main variants should ever appear as
3604 types of expressions. */
3607 build_qualified_type (type
, type_quals
)
3613 /* Search the chain of variants to see if there is already one there just
3614 like the one we need to have. If so, use that existing one. We must
3615 preserve the TYPE_NAME, since there is code that depends on this. */
3617 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3618 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
))
3621 /* We need a new one. */
3622 t
= build_type_copy (type
);
3623 set_type_quals (t
, type_quals
);
3627 /* Create a new variant of TYPE, equivalent but distinct.
3628 This is so the caller can modify it. */
3631 build_type_copy (type
)
3634 register tree t
, m
= TYPE_MAIN_VARIANT (type
);
3635 register struct obstack
*ambient_obstack
= current_obstack
;
3637 current_obstack
= TYPE_OBSTACK (type
);
3638 t
= copy_node (type
);
3639 current_obstack
= ambient_obstack
;
3641 TYPE_POINTER_TO (t
) = 0;
3642 TYPE_REFERENCE_TO (t
) = 0;
3644 /* Add this type to the chain of variants of TYPE. */
3645 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3646 TYPE_NEXT_VARIANT (m
) = t
;
3651 /* Hashing of types so that we don't make duplicates.
3652 The entry point is `type_hash_canon'. */
3654 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3655 with types in the TREE_VALUE slots), by adding the hash codes
3656 of the individual types. */
3659 type_hash_list (list
)
3662 register int hashcode
;
3664 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3665 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3669 /* Look in the type hash table for a type isomorphic to TYPE.
3670 If one is found, return it. Otherwise return 0. */
3673 type_hash_lookup (hashcode
, type
)
3677 register struct type_hash
*h
;
3679 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3680 must call that routine before comparing TYPE_ALIGNs. */
3683 for (h
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
]; h
; h
= h
->next
)
3684 if (h
->hashcode
== hashcode
3685 && TREE_CODE (h
->type
) == TREE_CODE (type
)
3686 && TREE_TYPE (h
->type
) == TREE_TYPE (type
)
3687 && attribute_list_equal (TYPE_ATTRIBUTES (h
->type
),
3688 TYPE_ATTRIBUTES (type
))
3689 && TYPE_ALIGN (h
->type
) == TYPE_ALIGN (type
)
3690 && (TYPE_MAX_VALUE (h
->type
) == TYPE_MAX_VALUE (type
)
3691 || tree_int_cst_equal (TYPE_MAX_VALUE (h
->type
),
3692 TYPE_MAX_VALUE (type
)))
3693 && (TYPE_MIN_VALUE (h
->type
) == TYPE_MIN_VALUE (type
)
3694 || tree_int_cst_equal (TYPE_MIN_VALUE (h
->type
),
3695 TYPE_MIN_VALUE (type
)))
3696 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3697 && (TYPE_DOMAIN (h
->type
) == TYPE_DOMAIN (type
)
3698 || (TYPE_DOMAIN (h
->type
)
3699 && TREE_CODE (TYPE_DOMAIN (h
->type
)) == TREE_LIST
3700 && TYPE_DOMAIN (type
)
3701 && TREE_CODE (TYPE_DOMAIN (type
)) == TREE_LIST
3702 && type_list_equal (TYPE_DOMAIN (h
->type
),
3703 TYPE_DOMAIN (type
)))))
3708 /* Add an entry to the type-hash-table
3709 for a type TYPE whose hash code is HASHCODE. */
3712 type_hash_add (hashcode
, type
)
3716 register struct type_hash
*h
;
3718 h
= (struct type_hash
*) permalloc (sizeof (struct type_hash
));
3719 h
->hashcode
= hashcode
;
3721 h
->next
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
];
3722 type_hash_table
[hashcode
% TYPE_HASH_SIZE
] = h
;
3725 /* Given TYPE, and HASHCODE its hash code, return the canonical
3726 object for an identical type if one already exists.
3727 Otherwise, return TYPE, and record it as the canonical object
3728 if it is a permanent object.
3730 To use this function, first create a type of the sort you want.
3731 Then compute its hash code from the fields of the type that
3732 make it different from other similar types.
3733 Then call this function and use the value.
3734 This function frees the type you pass in if it is a duplicate. */
3736 /* Set to 1 to debug without canonicalization. Never set by program. */
3737 int debug_no_type_hash
= 0;
3740 type_hash_canon (hashcode
, type
)
3746 if (debug_no_type_hash
)
3749 t1
= type_hash_lookup (hashcode
, type
);
3753 obstack_free (TYPE_OBSTACK (type
), type
);
3754 #ifdef GATHER_STATISTICS
3755 tree_node_counts
[(int)t_kind
]--;
3756 tree_node_sizes
[(int)t_kind
] -= sizeof (struct tree_type
);
3761 /* If this is a permanent type, record it for later reuse. */
3762 if (ggc_p
|| TREE_PERMANENT (type
))
3763 type_hash_add (hashcode
, type
);
3768 /* Mark ARG (which is really a struct type_hash **) for GC. */
3771 mark_type_hash (arg
)
3774 struct type_hash
*t
= *(struct type_hash
**) arg
;
3778 ggc_mark_tree (t
->type
);
3783 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3784 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3785 by adding the hash codes of the individual attributes. */
3788 attribute_hash_list (list
)
3791 register int hashcode
;
3793 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3794 /* ??? Do we want to add in TREE_VALUE too? */
3795 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3799 /* Given two lists of attributes, return true if list l2 is
3800 equivalent to l1. */
3803 attribute_list_equal (l1
, l2
)
3806 return attribute_list_contained (l1
, l2
)
3807 && attribute_list_contained (l2
, l1
);
3810 /* Given two lists of attributes, return true if list L2 is
3811 completely contained within L1. */
3812 /* ??? This would be faster if attribute names were stored in a canonicalized
3813 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3814 must be used to show these elements are equivalent (which they are). */
3815 /* ??? It's not clear that attributes with arguments will always be handled
3819 attribute_list_contained (l1
, l2
)
3822 register tree t1
, t2
;
3824 /* First check the obvious, maybe the lists are identical. */
3828 /* Maybe the lists are similar. */
3829 for (t1
= l1
, t2
= l2
;
3831 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3832 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3833 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3835 /* Maybe the lists are equal. */
3836 if (t1
== 0 && t2
== 0)
3839 for (; t2
; t2
= TREE_CHAIN (t2
))
3842 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3844 if (attr
== NULL_TREE
)
3846 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3853 /* Given two lists of types
3854 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3855 return 1 if the lists contain the same types in the same order.
3856 Also, the TREE_PURPOSEs must match. */
3859 type_list_equal (l1
, l2
)
3862 register tree t1
, t2
;
3864 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3865 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3866 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3867 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3868 && (TREE_TYPE (TREE_PURPOSE (t1
))
3869 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3875 /* Nonzero if integer constants T1 and T2
3876 represent the same constant value. */
3879 tree_int_cst_equal (t1
, t2
)
3884 if (t1
== 0 || t2
== 0)
3886 if (TREE_CODE (t1
) == INTEGER_CST
3887 && TREE_CODE (t2
) == INTEGER_CST
3888 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3889 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3894 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3895 The precise way of comparison depends on their data type. */
3898 tree_int_cst_lt (t1
, t2
)
3904 if (!TREE_UNSIGNED (TREE_TYPE (t1
)))
3905 return INT_CST_LT (t1
, t2
);
3906 return INT_CST_LT_UNSIGNED (t1
, t2
);
3909 /* Return an indication of the sign of the integer constant T.
3910 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3911 Note that -1 will never be returned it T's type is unsigned. */
3914 tree_int_cst_sgn (t
)
3917 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3919 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3921 else if (TREE_INT_CST_HIGH (t
) < 0)
3927 /* Compare two constructor-element-type constants. Return 1 if the lists
3928 are known to be equal; otherwise return 0. */
3931 simple_cst_list_equal (l1
, l2
)
3934 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3936 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3939 l1
= TREE_CHAIN (l1
);
3940 l2
= TREE_CHAIN (l2
);
3946 /* Return truthvalue of whether T1 is the same tree structure as T2.
3947 Return 1 if they are the same.
3948 Return 0 if they are understandably different.
3949 Return -1 if either contains tree structure not understood by
3953 simple_cst_equal (t1
, t2
)
3956 register enum tree_code code1
, code2
;
3961 if (t1
== 0 || t2
== 0)
3964 code1
= TREE_CODE (t1
);
3965 code2
= TREE_CODE (t2
);
3967 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3969 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3970 || code2
== NON_LVALUE_EXPR
)
3971 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3973 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3975 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3976 || code2
== NON_LVALUE_EXPR
)
3977 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3985 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3986 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
3989 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3992 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3993 && !bcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3994 TREE_STRING_LENGTH (t1
));
3997 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
4003 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4006 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4009 return simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4012 /* Special case: if either target is an unallocated VAR_DECL,
4013 it means that it's going to be unified with whatever the
4014 TARGET_EXPR is really supposed to initialize, so treat it
4015 as being equivalent to anything. */
4016 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4017 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4018 && DECL_RTL (TREE_OPERAND (t1
, 0)) == 0)
4019 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4020 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4021 && DECL_RTL (TREE_OPERAND (t2
, 0)) == 0))
4024 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4027 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4029 case WITH_CLEANUP_EXPR
:
4030 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4033 return simple_cst_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
4036 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4037 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4050 /* This general rule works for most tree codes. All exceptions should be
4051 handled above. If this is a language-specific tree code, we can't
4052 trust what might be in the operand, so say we don't know
4054 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4057 switch (TREE_CODE_CLASS (code1
))
4067 for (i
=0; i
<tree_code_length
[(int) code1
]; ++i
)
4069 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4080 /* Constructors for pointer, array and function types.
4081 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4082 constructed by language-dependent code, not here.) */
4084 /* Construct, lay out and return the type of pointers to TO_TYPE.
4085 If such a type has already been constructed, reuse it. */
4088 build_pointer_type (to_type
)
4091 register tree t
= TYPE_POINTER_TO (to_type
);
4093 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4098 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4099 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4100 t
= make_node (POINTER_TYPE
);
4103 TREE_TYPE (t
) = to_type
;
4105 /* Record this type as the pointer to TO_TYPE. */
4106 TYPE_POINTER_TO (to_type
) = t
;
4108 /* Lay out the type. This function has many callers that are concerned
4109 with expression-construction, and this simplifies them all.
4110 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4116 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4117 MAXVAL should be the maximum value in the domain
4118 (one less than the length of the array).
4120 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4121 We don't enforce this limit, that is up to caller (e.g. language front end).
4122 The limit exists because the result is a signed type and we don't handle
4123 sizes that use more than one HOST_WIDE_INT. */
4126 build_index_type (maxval
)
4129 register tree itype
= make_node (INTEGER_TYPE
);
4131 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4132 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4134 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4135 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
4138 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4139 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4140 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4141 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4142 if (TREE_CODE (maxval
) == INTEGER_CST
)
4144 int maxint
= (int) TREE_INT_CST_LOW (maxval
);
4145 /* If the domain should be empty, make sure the maxval
4146 remains -1 and is not spoiled by truncation. */
4147 if (INT_CST_LT (maxval
, integer_zero_node
))
4149 TYPE_MAX_VALUE (itype
) = build_int_2 (-1, -1);
4150 TREE_TYPE (TYPE_MAX_VALUE (itype
)) = sizetype
;
4152 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4158 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4159 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4160 low bound LOWVAL and high bound HIGHVAL.
4161 if TYPE==NULL_TREE, sizetype is used. */
4164 build_range_type (type
, lowval
, highval
)
4165 tree type
, lowval
, highval
;
4167 register tree itype
= make_node (INTEGER_TYPE
);
4169 TREE_TYPE (itype
) = type
;
4170 if (type
== NULL_TREE
)
4173 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4174 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4175 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4178 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4179 TYPE_MODE (itype
) = TYPE_MODE (type
);
4180 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4181 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4182 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4183 if (TREE_CODE (lowval
) == INTEGER_CST
)
4185 HOST_WIDE_INT lowint
, highint
;
4188 lowint
= TREE_INT_CST_LOW (lowval
);
4189 if (highval
&& TREE_CODE (highval
) == INTEGER_CST
)
4190 highint
= TREE_INT_CST_LOW (highval
);
4192 highint
= (~(unsigned HOST_WIDE_INT
)0) >> 1;
4194 maxint
= (int) (highint
- lowint
);
4195 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4201 /* Just like build_index_type, but takes lowval and highval instead
4202 of just highval (maxval). */
4205 build_index_2_type (lowval
,highval
)
4206 tree lowval
, highval
;
4208 return build_range_type (NULL_TREE
, lowval
, highval
);
4211 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4212 Needed because when index types are not hashed, equal index types
4213 built at different times appear distinct, even though structurally,
4217 index_type_equal (itype1
, itype2
)
4218 tree itype1
, itype2
;
4220 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
4222 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
4224 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
4225 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
4226 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
4227 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
4229 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
4230 TYPE_MIN_VALUE (itype2
))
4231 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
4232 TYPE_MAX_VALUE (itype2
)))
4239 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4240 and number of elements specified by the range of values of INDEX_TYPE.
4241 If such a type has already been constructed, reuse it. */
4244 build_array_type (elt_type
, index_type
)
4245 tree elt_type
, index_type
;
4250 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4252 error ("arrays of functions are not meaningful");
4253 elt_type
= integer_type_node
;
4256 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4257 build_pointer_type (elt_type
);
4259 /* Allocate the array after the pointer type,
4260 in case we free it in type_hash_canon. */
4261 t
= make_node (ARRAY_TYPE
);
4262 TREE_TYPE (t
) = elt_type
;
4263 TYPE_DOMAIN (t
) = index_type
;
4265 if (index_type
== 0)
4270 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
4271 t
= type_hash_canon (hashcode
, t
);
4273 if (TYPE_SIZE (t
) == 0)
4278 /* Return the TYPE of the elements comprising
4279 the innermost dimension of ARRAY. */
4282 get_inner_array_type (array
)
4285 tree type
= TREE_TYPE (array
);
4287 while (TREE_CODE (type
) == ARRAY_TYPE
)
4288 type
= TREE_TYPE (type
);
4293 /* Construct, lay out and return
4294 the type of functions returning type VALUE_TYPE
4295 given arguments of types ARG_TYPES.
4296 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4297 are data type nodes for the arguments of the function.
4298 If such a type has already been constructed, reuse it. */
4301 build_function_type (value_type
, arg_types
)
4302 tree value_type
, arg_types
;
4307 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4309 error ("function return type cannot be function");
4310 value_type
= integer_type_node
;
4313 /* Make a node of the sort we want. */
4314 t
= make_node (FUNCTION_TYPE
);
4315 TREE_TYPE (t
) = value_type
;
4316 TYPE_ARG_TYPES (t
) = arg_types
;
4318 /* If we already have such a type, use the old one and free this one. */
4319 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
4320 t
= type_hash_canon (hashcode
, t
);
4322 if (TYPE_SIZE (t
) == 0)
4327 /* Build the node for the type of references-to-TO_TYPE. */
4330 build_reference_type (to_type
)
4333 register tree t
= TYPE_REFERENCE_TO (to_type
);
4335 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4340 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4341 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4342 t
= make_node (REFERENCE_TYPE
);
4345 TREE_TYPE (t
) = to_type
;
4347 /* Record this type as the pointer to TO_TYPE. */
4348 TYPE_REFERENCE_TO (to_type
) = t
;
4355 /* Construct, lay out and return the type of methods belonging to class
4356 BASETYPE and whose arguments and values are described by TYPE.
4357 If that type exists already, reuse it.
4358 TYPE must be a FUNCTION_TYPE node. */
4361 build_method_type (basetype
, type
)
4362 tree basetype
, type
;
4367 /* Make a node of the sort we want. */
4368 t
= make_node (METHOD_TYPE
);
4370 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4373 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4374 TREE_TYPE (t
) = TREE_TYPE (type
);
4376 /* The actual arglist for this function includes a "hidden" argument
4377 which is "this". Put it into the list of argument types. */
4380 = tree_cons (NULL_TREE
,
4381 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4383 /* If we already have such a type, use the old one and free this one. */
4384 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4385 t
= type_hash_canon (hashcode
, t
);
4387 if (TYPE_SIZE (t
) == 0)
4393 /* Construct, lay out and return the type of offsets to a value
4394 of type TYPE, within an object of type BASETYPE.
4395 If a suitable offset type exists already, reuse it. */
4398 build_offset_type (basetype
, type
)
4399 tree basetype
, type
;
4404 /* Make a node of the sort we want. */
4405 t
= make_node (OFFSET_TYPE
);
4407 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4408 TREE_TYPE (t
) = type
;
4410 /* If we already have such a type, use the old one and free this one. */
4411 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4412 t
= type_hash_canon (hashcode
, t
);
4414 if (TYPE_SIZE (t
) == 0)
4420 /* Create a complex type whose components are COMPONENT_TYPE. */
4423 build_complex_type (component_type
)
4424 tree component_type
;
4429 /* Make a node of the sort we want. */
4430 t
= make_node (COMPLEX_TYPE
);
4432 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4433 set_type_quals (t
, TYPE_QUALS (component_type
));
4435 /* If we already have such a type, use the old one and free this one. */
4436 hashcode
= TYPE_HASH (component_type
);
4437 t
= type_hash_canon (hashcode
, t
);
4439 if (TYPE_SIZE (t
) == 0)
4445 /* Return OP, stripped of any conversions to wider types as much as is safe.
4446 Converting the value back to OP's type makes a value equivalent to OP.
4448 If FOR_TYPE is nonzero, we return a value which, if converted to
4449 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4451 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4452 narrowest type that can hold the value, even if they don't exactly fit.
4453 Otherwise, bit-field references are changed to a narrower type
4454 only if they can be fetched directly from memory in that type.
4456 OP must have integer, real or enumeral type. Pointers are not allowed!
4458 There are some cases where the obvious value we could return
4459 would regenerate to OP if converted to OP's type,
4460 but would not extend like OP to wider types.
4461 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4462 For example, if OP is (unsigned short)(signed char)-1,
4463 we avoid returning (signed char)-1 if FOR_TYPE is int,
4464 even though extending that to an unsigned short would regenerate OP,
4465 since the result of extending (signed char)-1 to (int)
4466 is different from (int) OP. */
4469 get_unwidened (op
, for_type
)
4473 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4474 register tree type
= TREE_TYPE (op
);
4475 register unsigned final_prec
4476 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4478 = (for_type
!= 0 && for_type
!= type
4479 && final_prec
> TYPE_PRECISION (type
)
4480 && TREE_UNSIGNED (type
));
4481 register tree win
= op
;
4483 while (TREE_CODE (op
) == NOP_EXPR
)
4485 register int bitschange
4486 = TYPE_PRECISION (TREE_TYPE (op
))
4487 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4489 /* Truncations are many-one so cannot be removed.
4490 Unless we are later going to truncate down even farther. */
4492 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4495 /* See what's inside this conversion. If we decide to strip it,
4497 op
= TREE_OPERAND (op
, 0);
4499 /* If we have not stripped any zero-extensions (uns is 0),
4500 we can strip any kind of extension.
4501 If we have previously stripped a zero-extension,
4502 only zero-extensions can safely be stripped.
4503 Any extension can be stripped if the bits it would produce
4504 are all going to be discarded later by truncating to FOR_TYPE. */
4508 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4510 /* TREE_UNSIGNED says whether this is a zero-extension.
4511 Let's avoid computing it if it does not affect WIN
4512 and if UNS will not be needed again. */
4513 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4514 && TREE_UNSIGNED (TREE_TYPE (op
)))
4522 if (TREE_CODE (op
) == COMPONENT_REF
4523 /* Since type_for_size always gives an integer type. */
4524 && TREE_CODE (type
) != REAL_TYPE
4525 /* Don't crash if field not laid out yet. */
4526 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4528 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4529 type
= type_for_size (innerprec
, TREE_UNSIGNED (TREE_OPERAND (op
, 1)));
4531 /* We can get this structure field in the narrowest type it fits in.
4532 If FOR_TYPE is 0, do this only for a field that matches the
4533 narrower type exactly and is aligned for it
4534 The resulting extension to its nominal type (a fullword type)
4535 must fit the same conditions as for other extensions. */
4537 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4538 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4539 && (! uns
|| final_prec
<= innerprec
4540 || TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4543 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4544 TREE_OPERAND (op
, 1));
4545 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4546 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4547 TREE_RAISES (win
) = TREE_RAISES (op
);
4553 /* Return OP or a simpler expression for a narrower value
4554 which can be sign-extended or zero-extended to give back OP.
4555 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4556 or 0 if the value should be sign-extended. */
4559 get_narrower (op
, unsignedp_ptr
)
4563 register int uns
= 0;
4565 register tree win
= op
;
4567 while (TREE_CODE (op
) == NOP_EXPR
)
4569 register int bitschange
4570 = TYPE_PRECISION (TREE_TYPE (op
))
4571 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4573 /* Truncations are many-one so cannot be removed. */
4577 /* See what's inside this conversion. If we decide to strip it,
4579 op
= TREE_OPERAND (op
, 0);
4583 /* An extension: the outermost one can be stripped,
4584 but remember whether it is zero or sign extension. */
4586 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4587 /* Otherwise, if a sign extension has been stripped,
4588 only sign extensions can now be stripped;
4589 if a zero extension has been stripped, only zero-extensions. */
4590 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4594 else /* bitschange == 0 */
4596 /* A change in nominal type can always be stripped, but we must
4597 preserve the unsignedness. */
4599 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4606 if (TREE_CODE (op
) == COMPONENT_REF
4607 /* Since type_for_size always gives an integer type. */
4608 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
)
4610 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4611 tree type
= type_for_size (innerprec
, TREE_UNSIGNED (op
));
4613 /* We can get this structure field in a narrower type that fits it,
4614 but the resulting extension to its nominal type (a fullword type)
4615 must satisfy the same conditions as for other extensions.
4617 Do this only for fields that are aligned (not bit-fields),
4618 because when bit-field insns will be used there is no
4619 advantage in doing this. */
4621 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4622 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4623 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4627 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4628 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4629 TREE_OPERAND (op
, 1));
4630 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4631 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4632 TREE_RAISES (win
) = TREE_RAISES (op
);
4635 *unsignedp_ptr
= uns
;
4639 /* Nonzero if integer constant C has a value that is permissible
4640 for type TYPE (an INTEGER_TYPE). */
4643 int_fits_type_p (c
, type
)
4646 if (TREE_UNSIGNED (type
))
4647 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4648 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
))
4649 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4650 && INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
)))
4651 /* Negative ints never fit unsigned types. */
4652 && ! (TREE_INT_CST_HIGH (c
) < 0
4653 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4655 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4656 && INT_CST_LT (TYPE_MAX_VALUE (type
), c
))
4657 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4658 && INT_CST_LT (c
, TYPE_MIN_VALUE (type
)))
4659 /* Unsigned ints with top bit set never fit signed types. */
4660 && ! (TREE_INT_CST_HIGH (c
) < 0
4661 && TREE_UNSIGNED (TREE_TYPE (c
))));
4664 /* Return the innermost context enclosing DECL that is
4665 a FUNCTION_DECL, or zero if none. */
4668 decl_function_context (decl
)
4673 if (TREE_CODE (decl
) == ERROR_MARK
)
4676 if (TREE_CODE (decl
) == SAVE_EXPR
)
4677 context
= SAVE_EXPR_CONTEXT (decl
);
4679 context
= DECL_CONTEXT (decl
);
4681 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4683 if (TREE_CODE_CLASS (TREE_CODE (context
)) == 't')
4684 context
= TYPE_CONTEXT (context
);
4685 else if (TREE_CODE_CLASS (TREE_CODE (context
)) == 'd')
4686 context
= DECL_CONTEXT (context
);
4687 else if (TREE_CODE (context
) == BLOCK
)
4688 context
= BLOCK_SUPERCONTEXT (context
);
4690 /* Unhandled CONTEXT !? */
4697 /* Return the innermost context enclosing DECL that is
4698 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4699 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4702 decl_type_context (decl
)
4705 tree context
= DECL_CONTEXT (decl
);
4709 if (TREE_CODE (context
) == RECORD_TYPE
4710 || TREE_CODE (context
) == UNION_TYPE
4711 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4713 if (TREE_CODE (context
) == TYPE_DECL
4714 || TREE_CODE (context
) == FUNCTION_DECL
)
4715 context
= DECL_CONTEXT (context
);
4716 else if (TREE_CODE (context
) == BLOCK
)
4717 context
= BLOCK_SUPERCONTEXT (context
);
4719 /* Unhandled CONTEXT!? */
4725 /* Print debugging information about the obstack O, named STR. */
4728 print_obstack_statistics (str
, o
)
4732 struct _obstack_chunk
*chunk
= o
->chunk
;
4736 n_alloc
+= o
->next_free
- chunk
->contents
;
4737 chunk
= chunk
->prev
;
4741 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4742 chunk
= chunk
->prev
;
4744 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4745 str
, n_alloc
, n_chunks
);
4748 /* Print debugging information about tree nodes generated during the compile,
4749 and any language-specific information. */
4752 dump_tree_statistics ()
4754 #ifdef GATHER_STATISTICS
4756 int total_nodes
, total_bytes
;
4759 fprintf (stderr
, "\n??? tree nodes created\n\n");
4760 #ifdef GATHER_STATISTICS
4761 fprintf (stderr
, "Kind Nodes Bytes\n");
4762 fprintf (stderr
, "-------------------------------------\n");
4763 total_nodes
= total_bytes
= 0;
4764 for (i
= 0; i
< (int) all_kinds
; i
++)
4766 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4767 tree_node_counts
[i
], tree_node_sizes
[i
]);
4768 total_nodes
+= tree_node_counts
[i
];
4769 total_bytes
+= tree_node_sizes
[i
];
4771 fprintf (stderr
, "%-20s %9d\n", "identifier names", id_string_size
);
4772 fprintf (stderr
, "-------------------------------------\n");
4773 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4774 fprintf (stderr
, "-------------------------------------\n");
4776 fprintf (stderr
, "(No per-node statistics)\n");
4778 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
4779 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack
);
4780 print_obstack_statistics ("temporary_obstack", &temporary_obstack
);
4781 print_obstack_statistics ("momentary_obstack", &momentary_obstack
);
4782 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack
);
4783 print_lang_statistics ();
4786 #define FILE_FUNCTION_PREFIX_LEN 9
4788 #ifndef NO_DOLLAR_IN_LABEL
4789 #define FILE_FUNCTION_FORMAT "_GLOBAL_$%s$%s"
4790 #else /* NO_DOLLAR_IN_LABEL */
4791 #ifndef NO_DOT_IN_LABEL
4792 #define FILE_FUNCTION_FORMAT "_GLOBAL_.%s.%s"
4793 #else /* NO_DOT_IN_LABEL */
4794 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4795 #endif /* NO_DOT_IN_LABEL */
4796 #endif /* NO_DOLLAR_IN_LABEL */
4798 extern char * first_global_object_name
;
4799 extern char * weak_global_object_name
;
4801 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4802 clashes in cases where we can't reliably choose a unique name.
4804 Derived from mkstemp.c in libiberty. */
4807 append_random_chars (template)
4810 static const char letters
[]
4811 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4812 static unsigned HOST_WIDE_INT value
;
4813 unsigned HOST_WIDE_INT v
;
4815 #ifdef HAVE_GETTIMEOFDAY
4819 template += strlen (template);
4821 #ifdef HAVE_GETTIMEOFDAY
4822 /* Get some more or less random data. */
4823 gettimeofday (&tv
, NULL
);
4824 value
+= ((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16) ^ tv
.tv_sec
^ getpid ();
4831 /* Fill in the random bits. */
4832 template[0] = letters
[v
% 62];
4834 template[1] = letters
[v
% 62];
4836 template[2] = letters
[v
% 62];
4838 template[3] = letters
[v
% 62];
4840 template[4] = letters
[v
% 62];
4842 template[5] = letters
[v
% 62];
4847 /* Generate a name for a function unique to this translation unit.
4848 TYPE is some string to identify the purpose of this function to the
4849 linker or collect2. */
4852 get_file_function_name_long (type
)
4858 if (first_global_object_name
)
4859 p
= first_global_object_name
;
4862 /* We don't have anything that we know to be unique to this translation
4863 unit, so use what we do have and throw in some randomness. */
4865 const char *name
= weak_global_object_name
;
4866 const char *file
= main_input_filename
;
4871 file
= input_filename
;
4873 p
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4875 sprintf (p
, "%s%s", name
, file
);
4876 append_random_chars (p
);
4879 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4882 /* Set up the name of the file-level functions we may need. */
4883 /* Use a global object (which is already required to be unique over
4884 the program) rather than the file name (which imposes extra
4885 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
4886 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4888 /* Don't need to pull weird characters out of global names. */
4889 if (p
!= first_global_object_name
)
4891 for (p
= buf
+11; *p
; p
++)
4893 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
4894 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
4898 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4901 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4909 return get_identifier (buf
);
4912 /* If KIND=='I', return a suitable global initializer (constructor) name.
4913 If KIND=='D', return a suitable global clean-up (destructor) name. */
4916 get_file_function_name (kind
)
4923 return get_file_function_name_long (p
);
4927 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4928 The result is placed in BUFFER (which has length BIT_SIZE),
4929 with one bit in each char ('\000' or '\001').
4931 If the constructor is constant, NULL_TREE is returned.
4932 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4935 get_set_constructor_bits (init
, buffer
, bit_size
)
4942 HOST_WIDE_INT domain_min
4943 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))));
4944 tree non_const_bits
= NULL_TREE
;
4945 for (i
= 0; i
< bit_size
; i
++)
4948 for (vals
= TREE_OPERAND (init
, 1);
4949 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4951 if (TREE_CODE (TREE_VALUE (vals
)) != INTEGER_CST
4952 || (TREE_PURPOSE (vals
) != NULL_TREE
4953 && TREE_CODE (TREE_PURPOSE (vals
)) != INTEGER_CST
))
4955 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4956 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4958 /* Set a range of bits to ones. */
4959 HOST_WIDE_INT lo_index
4960 = TREE_INT_CST_LOW (TREE_PURPOSE (vals
)) - domain_min
;
4961 HOST_WIDE_INT hi_index
4962 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
4963 if (lo_index
< 0 || lo_index
>= bit_size
4964 || hi_index
< 0 || hi_index
>= bit_size
)
4966 for ( ; lo_index
<= hi_index
; lo_index
++)
4967 buffer
[lo_index
] = 1;
4971 /* Set a single bit to one. */
4973 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
4974 if (index
< 0 || index
>= bit_size
)
4976 error ("invalid initializer for bit string");
4982 return non_const_bits
;
4985 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4986 The result is placed in BUFFER (which is an array of bytes).
4987 If the constructor is constant, NULL_TREE is returned.
4988 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4991 get_set_constructor_bytes (init
, buffer
, wd_size
)
4993 unsigned char *buffer
;
4997 int set_word_size
= BITS_PER_UNIT
;
4998 int bit_size
= wd_size
* set_word_size
;
5000 unsigned char *bytep
= buffer
;
5001 char *bit_buffer
= (char *) alloca(bit_size
);
5002 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5004 for (i
= 0; i
< wd_size
; i
++)
5007 for (i
= 0; i
< bit_size
; i
++)
5011 if (BYTES_BIG_ENDIAN
)
5012 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5014 *bytep
|= 1 << bit_pos
;
5017 if (bit_pos
>= set_word_size
)
5018 bit_pos
= 0, bytep
++;
5020 return non_const_bits
;
5023 #if defined ENABLE_CHECKING && (__GNUC__ > 2 || __GNUC_MINOR__ > 6)
5024 /* Complain that the tree code of NODE does not match the expected CODE.
5025 FILE, LINE, and FUNCTION are of the caller. */
5027 tree_check_failed (node
, code
, file
, line
, function
)
5029 enum tree_code code
;
5032 const char *function
;
5034 error ("Tree check: expected %s, have %s",
5035 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)]);
5036 fancy_abort (file
, line
, function
);
5039 /* Similar to above, except that we check for a class of tree
5040 code, given in CL. */
5042 tree_class_check_failed (node
, cl
, file
, line
, function
)
5047 const char *function
;
5049 error ("Tree check: expected class '%c', have '%c' (%s)",
5050 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
5051 tree_code_name
[TREE_CODE (node
)]);
5052 fancy_abort (file
, line
, function
);
5055 #endif /* ENABLE_CHECKING */
5057 /* Return the alias set for T, which may be either a type or an
5064 if (!flag_strict_aliasing
|| !lang_get_alias_set
)
5065 /* If we're not doing any lanaguage-specific alias analysis, just
5066 assume everything aliases everything else. */
5069 return (*lang_get_alias_set
) (t
);
5072 /* Return a brand-new alias set. */
5077 static int last_alias_set
;
5078 if (flag_strict_aliasing
)
5079 return ++last_alias_set
;
5084 #ifndef CHAR_TYPE_SIZE
5085 #define CHAR_TYPE_SIZE BITS_PER_UNIT
5088 #ifndef SHORT_TYPE_SIZE
5089 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
5092 #ifndef INT_TYPE_SIZE
5093 #define INT_TYPE_SIZE BITS_PER_WORD
5096 #ifndef LONG_TYPE_SIZE
5097 #define LONG_TYPE_SIZE BITS_PER_WORD
5100 #ifndef LONG_LONG_TYPE_SIZE
5101 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
5104 #ifndef FLOAT_TYPE_SIZE
5105 #define FLOAT_TYPE_SIZE BITS_PER_WORD
5108 #ifndef DOUBLE_TYPE_SIZE
5109 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5112 #ifndef LONG_DOUBLE_TYPE_SIZE
5113 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5116 /* Create nodes for all integer types (and error_mark_node) using the sizes
5117 of C datatypes. The caller should call set_sizetype soon after calling
5118 this function to select one of the types as sizetype. */
5121 build_common_tree_nodes (signed_char
)
5124 error_mark_node
= make_node (ERROR_MARK
);
5125 TREE_TYPE (error_mark_node
) = error_mark_node
;
5127 /* Define both `signed char' and `unsigned char'. */
5128 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5129 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5131 /* Define `char', which is like either `signed char' or `unsigned char'
5132 but not the same as either. */
5135 ? make_signed_type (CHAR_TYPE_SIZE
)
5136 : make_unsigned_type (CHAR_TYPE_SIZE
));
5138 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5139 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5140 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5141 /* Define an unsigned integer first. make_unsigned_type and make_signed_type
5142 both call set_sizetype for the first type that we create, and we want this
5143 to be large enough to hold the sizes of various types until we switch to
5144 the real sizetype. */
5145 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5146 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5147 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5148 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5149 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5151 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5152 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5153 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5154 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5155 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5157 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5158 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5159 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5160 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5161 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5164 /* For type TYPE, fill in the proper type for TYPE_SIZE and
5170 TREE_TYPE (TYPE_SIZE (type
)) = sizetype
;
5171 TREE_TYPE (TYPE_SIZE_UNIT (type
)) = bitsizetype
;
5174 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5175 It will fix the previously made nodes to have proper references to
5176 sizetype, and it will create several other common tree nodes. */
5178 build_common_tree_nodes_2 (short_double
)
5181 fix_sizetype (signed_char_type_node
);
5182 fix_sizetype (unsigned_char_type_node
);
5183 fix_sizetype (char_type_node
);
5184 fix_sizetype (short_integer_type_node
);
5185 fix_sizetype (short_unsigned_type_node
);
5186 fix_sizetype (integer_type_node
);
5187 fix_sizetype (unsigned_type_node
);
5188 fix_sizetype (long_unsigned_type_node
);
5189 fix_sizetype (long_integer_type_node
);
5190 fix_sizetype (long_long_integer_type_node
);
5191 fix_sizetype (long_long_unsigned_type_node
);
5193 fix_sizetype (intQI_type_node
);
5194 fix_sizetype (intHI_type_node
);
5195 fix_sizetype (intSI_type_node
);
5196 fix_sizetype (intDI_type_node
);
5197 fix_sizetype (intTI_type_node
);
5198 fix_sizetype (unsigned_intQI_type_node
);
5199 fix_sizetype (unsigned_intHI_type_node
);
5200 fix_sizetype (unsigned_intSI_type_node
);
5201 fix_sizetype (unsigned_intDI_type_node
);
5202 fix_sizetype (unsigned_intTI_type_node
);
5204 integer_zero_node
= build_int_2 (0, 0);
5205 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5206 integer_one_node
= build_int_2 (1, 0);
5207 TREE_TYPE (integer_one_node
) = integer_type_node
;
5209 size_zero_node
= build_int_2 (0, 0);
5210 TREE_TYPE (size_zero_node
) = sizetype
;
5211 size_one_node
= build_int_2 (1, 0);
5212 TREE_TYPE (size_one_node
) = sizetype
;
5214 void_type_node
= make_node (VOID_TYPE
);
5215 layout_type (void_type_node
); /* Uses size_zero_node */
5216 /* We are not going to have real types in C with less than byte alignment,
5217 so we might as well not have any types that claim to have it. */
5218 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5220 null_pointer_node
= build_int_2 (0, 0);
5221 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5222 layout_type (TREE_TYPE (null_pointer_node
));
5224 ptr_type_node
= build_pointer_type (void_type_node
);
5226 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5228 float_type_node
= make_node (REAL_TYPE
);
5229 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5230 layout_type (float_type_node
);
5232 double_type_node
= make_node (REAL_TYPE
);
5234 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5236 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5237 layout_type (double_type_node
);
5239 long_double_type_node
= make_node (REAL_TYPE
);
5240 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5241 layout_type (long_double_type_node
);
5243 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5244 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5245 layout_type (complex_integer_type_node
);
5247 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5248 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5249 layout_type (complex_float_type_node
);
5251 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5252 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5253 layout_type (complex_double_type_node
);
5255 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5256 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5257 layout_type (complex_long_double_type_node
);
5259 #ifdef BUILD_VA_LIST_TYPE
5260 BUILD_VA_LIST_TYPE(va_list_type_node
);
5262 va_list_type_node
= ptr_type_node
;