1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
48 /* obstack.[ch] explicitly declined to prototype this. */
49 extern int _obstack_allocated_p
PROTO ((struct obstack
*h
, PTR obj
));
51 static void unsave_expr_now_r
PROTO ((tree
));
53 /* Tree nodes of permanent duration are allocated in this obstack.
54 They are the identifier nodes, and everything outside of
55 the bodies and parameters of function definitions. */
57 struct obstack permanent_obstack
;
59 /* The initial RTL, and all ..._TYPE nodes, in a function
60 are allocated in this obstack. Usually they are freed at the
61 end of the function, but if the function is inline they are saved.
62 For top-level functions, this is maybepermanent_obstack.
63 Separate obstacks are made for nested functions. */
65 struct obstack
*function_maybepermanent_obstack
;
67 /* This is the function_maybepermanent_obstack for top-level functions. */
69 struct obstack maybepermanent_obstack
;
71 /* The contents of the current function definition are allocated
72 in this obstack, and all are freed at the end of the function.
73 For top-level functions, this is temporary_obstack.
74 Separate obstacks are made for nested functions. */
76 struct obstack
*function_obstack
;
78 /* This is used for reading initializers of global variables. */
80 struct obstack temporary_obstack
;
82 /* The tree nodes of an expression are allocated
83 in this obstack, and all are freed at the end of the expression. */
85 struct obstack momentary_obstack
;
87 /* The tree nodes of a declarator are allocated
88 in this obstack, and all are freed when the declarator
91 static struct obstack temp_decl_obstack
;
93 /* This points at either permanent_obstack
94 or the current function_maybepermanent_obstack. */
96 struct obstack
*saveable_obstack
;
98 /* This is same as saveable_obstack during parse and expansion phase;
99 it points to the current function's obstack during optimization.
100 This is the obstack to be used for creating rtl objects. */
102 struct obstack
*rtl_obstack
;
104 /* This points at either permanent_obstack or the current function_obstack. */
106 struct obstack
*current_obstack
;
108 /* This points at either permanent_obstack or the current function_obstack
109 or momentary_obstack. */
111 struct obstack
*expression_obstack
;
113 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
117 struct obstack_stack
*next
;
118 struct obstack
*current
;
119 struct obstack
*saveable
;
120 struct obstack
*expression
;
124 struct obstack_stack
*obstack_stack
;
126 /* Obstack for allocating struct obstack_stack entries. */
128 static struct obstack obstack_stack_obstack
;
130 /* Addresses of first objects in some obstacks.
131 This is for freeing their entire contents. */
132 char *maybepermanent_firstobj
;
133 char *temporary_firstobj
;
134 char *momentary_firstobj
;
135 char *temp_decl_firstobj
;
137 /* This is used to preserve objects (mainly array initializers) that need to
138 live until the end of the current function, but no further. */
139 char *momentary_function_firstobj
;
141 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
143 int all_types_permanent
;
145 /* Stack of places to restore the momentary obstack back to. */
147 struct momentary_level
149 /* Pointer back to previous such level. */
150 struct momentary_level
*prev
;
151 /* First object allocated within this level. */
153 /* Value of expression_obstack saved at entry to this level. */
154 struct obstack
*obstack
;
157 struct momentary_level
*momentary_stack
;
159 /* Table indexed by tree code giving a string containing a character
160 classifying the tree code. Possibilities are
161 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
163 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
165 char tree_code_type
[MAX_TREE_CODES
] = {
170 /* Table indexed by tree code giving number of expression
171 operands beyond the fixed part of the node structure.
172 Not used for types or decls. */
174 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
176 int tree_code_length
[MAX_TREE_CODES
] = {
181 /* Names of tree components.
182 Used for printing out the tree and error messages. */
183 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
185 const char *tree_code_name
[MAX_TREE_CODES
] = {
190 /* Statistics-gathering stuff. */
211 int tree_node_counts
[(int)all_kinds
];
212 int tree_node_sizes
[(int)all_kinds
];
213 int id_string_size
= 0;
215 static const char * const tree_node_kind_names
[] = {
233 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
235 #define MAX_HASH_TABLE 1009
236 static tree hash_table
[MAX_HASH_TABLE
]; /* id hash buckets */
238 /* 0 while creating built-in identifiers. */
239 static int do_identifier_warnings
;
241 /* Unique id for next decl created. */
242 static int next_decl_uid
;
243 /* Unique id for next type created. */
244 static int next_type_uid
= 1;
246 /* The language-specific function for alias analysis. If NULL, the
247 language does not do any special alias analysis. */
248 int (*lang_get_alias_set
) PROTO((tree
));
250 /* Here is how primitive or already-canonicalized types' hash
252 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
254 /* Each hash table slot is a bucket containing a chain
255 of these structures. */
259 struct type_hash
*next
; /* Next structure in the bucket. */
260 int hashcode
; /* Hash code of this type. */
261 tree type
; /* The type recorded here. */
264 /* Now here is the hash table. When recording a type, it is added
265 to the slot whose index is the hash code mod the table size.
266 Note that the hash table is used for several kinds of types
267 (function types, array types and array index range types, for now).
268 While all these live in the same table, they are completely independent,
269 and the hash code is computed differently for each of these. */
271 #define TYPE_HASH_SIZE 59
272 struct type_hash
*type_hash_table
[TYPE_HASH_SIZE
];
274 static void set_type_quals
PROTO((tree
, int));
275 static void append_random_chars
PROTO((char *));
276 static void build_real_from_int_cst_1
PROTO((PTR
));
277 static void mark_type_hash
PROTO ((void *));
278 static void fix_sizetype
PROTO ((tree
));
280 /* If non-null, these are language-specific helper functions for
281 unsave_expr_now. If present, LANG_UNSAVE is called before its
282 argument (an UNSAVE_EXPR) is to be unsaved, and all other
283 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
284 called from unsave_expr_1 for language-specific tree codes. */
285 void (*lang_unsave
) PROTO((tree
*));
286 void (*lang_unsave_expr_now
) PROTO((tree
));
288 /* The string used as a placeholder instead of a source file name for
289 built-in tree nodes. The variable, which is dynamically allocated,
290 should be used; the macro is only used to initialize it. */
292 static char *built_in_filename
;
293 #define BUILT_IN_FILENAME ("<built-in>")
295 tree global_trees
[TI_MAX
];
297 /* Init the principal obstacks. */
302 gcc_obstack_init (&obstack_stack_obstack
);
303 gcc_obstack_init (&permanent_obstack
);
305 gcc_obstack_init (&temporary_obstack
);
306 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
307 gcc_obstack_init (&momentary_obstack
);
308 momentary_firstobj
= (char *) obstack_alloc (&momentary_obstack
, 0);
309 momentary_function_firstobj
= momentary_firstobj
;
310 gcc_obstack_init (&maybepermanent_obstack
);
311 maybepermanent_firstobj
312 = (char *) obstack_alloc (&maybepermanent_obstack
, 0);
313 gcc_obstack_init (&temp_decl_obstack
);
314 temp_decl_firstobj
= (char *) obstack_alloc (&temp_decl_obstack
, 0);
316 function_obstack
= &temporary_obstack
;
317 function_maybepermanent_obstack
= &maybepermanent_obstack
;
318 current_obstack
= &permanent_obstack
;
319 expression_obstack
= &permanent_obstack
;
320 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
322 /* Init the hash table of identifiers. */
323 bzero ((char *) hash_table
, sizeof hash_table
);
325 ggc_add_tree_root (hash_table
, MAX_HASH_TABLE
);
326 ggc_add_root (type_hash_table
, TYPE_HASH_SIZE
,
327 sizeof(struct type_hash
*),
329 ggc_add_tree_root (global_trees
, TI_MAX
);
333 gcc_obstack_init (obstack
)
334 struct obstack
*obstack
;
336 /* Let particular systems override the size of a chunk. */
337 #ifndef OBSTACK_CHUNK_SIZE
338 #define OBSTACK_CHUNK_SIZE 0
340 /* Let them override the alloc and free routines too. */
341 #ifndef OBSTACK_CHUNK_ALLOC
342 #define OBSTACK_CHUNK_ALLOC xmalloc
344 #ifndef OBSTACK_CHUNK_FREE
345 #define OBSTACK_CHUNK_FREE free
347 _obstack_begin (obstack
, OBSTACK_CHUNK_SIZE
, 0,
348 (void *(*) PROTO ((long))) OBSTACK_CHUNK_ALLOC
,
349 (void (*) PROTO ((void *))) OBSTACK_CHUNK_FREE
);
352 /* Save all variables describing the current status into the structure
353 *P. This function is called whenever we start compiling one
354 function in the midst of compiling another. For example, when
355 compiling a nested function, or, in C++, a template instantiation
356 that is required by the function we are currently compiling.
358 CONTEXT is the decl_function_context for the function we're about to
359 compile; if it isn't current_function_decl, we have to play some games. */
365 p
->all_types_permanent
= all_types_permanent
;
366 p
->momentary_stack
= momentary_stack
;
367 p
->maybepermanent_firstobj
= maybepermanent_firstobj
;
368 p
->temporary_firstobj
= temporary_firstobj
;
369 p
->momentary_firstobj
= momentary_firstobj
;
370 p
->momentary_function_firstobj
= momentary_function_firstobj
;
371 p
->function_obstack
= function_obstack
;
372 p
->function_maybepermanent_obstack
= function_maybepermanent_obstack
;
373 p
->current_obstack
= current_obstack
;
374 p
->expression_obstack
= expression_obstack
;
375 p
->saveable_obstack
= saveable_obstack
;
376 p
->rtl_obstack
= rtl_obstack
;
378 function_maybepermanent_obstack
379 = (struct obstack
*) xmalloc (sizeof (struct obstack
));
380 gcc_obstack_init (function_maybepermanent_obstack
);
381 maybepermanent_firstobj
382 = (char *) obstack_finish (function_maybepermanent_obstack
);
384 function_obstack
= (struct obstack
*) xmalloc (sizeof (struct obstack
));
385 gcc_obstack_init (function_obstack
);
387 current_obstack
= &permanent_obstack
;
388 expression_obstack
= &permanent_obstack
;
389 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
391 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
392 momentary_firstobj
= (char *) obstack_finish (&momentary_obstack
);
393 momentary_function_firstobj
= momentary_firstobj
;
396 /* Restore all variables describing the current status from the structure *P.
397 This is used after a nested function. */
400 restore_tree_status (p
)
403 all_types_permanent
= p
->all_types_permanent
;
404 momentary_stack
= p
->momentary_stack
;
406 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
408 /* Free saveable storage used by the function just compiled and not
410 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
411 if (obstack_empty_p (function_maybepermanent_obstack
))
413 obstack_free (function_maybepermanent_obstack
, NULL
);
414 free (function_maybepermanent_obstack
);
417 obstack_free (&temporary_obstack
, temporary_firstobj
);
418 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
420 obstack_free (function_obstack
, NULL
);
421 free (function_obstack
);
423 temporary_firstobj
= p
->temporary_firstobj
;
424 momentary_firstobj
= p
->momentary_firstobj
;
425 momentary_function_firstobj
= p
->momentary_function_firstobj
;
426 maybepermanent_firstobj
= p
->maybepermanent_firstobj
;
427 function_obstack
= p
->function_obstack
;
428 function_maybepermanent_obstack
= p
->function_maybepermanent_obstack
;
429 current_obstack
= p
->current_obstack
;
430 expression_obstack
= p
->expression_obstack
;
431 saveable_obstack
= p
->saveable_obstack
;
432 rtl_obstack
= p
->rtl_obstack
;
435 /* Start allocating on the temporary (per function) obstack.
436 This is done in start_function before parsing the function body,
437 and before each initialization at top level, and to go back
438 to temporary allocation after doing permanent_allocation. */
441 temporary_allocation ()
443 /* Note that function_obstack at top level points to temporary_obstack.
444 But within a nested function context, it is a separate obstack. */
445 current_obstack
= function_obstack
;
446 expression_obstack
= function_obstack
;
447 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
451 /* Start allocating on the permanent obstack but don't
452 free the temporary data. After calling this, call
453 `permanent_allocation' to fully resume permanent allocation status. */
456 end_temporary_allocation ()
458 current_obstack
= &permanent_obstack
;
459 expression_obstack
= &permanent_obstack
;
460 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
463 /* Resume allocating on the temporary obstack, undoing
464 effects of `end_temporary_allocation'. */
467 resume_temporary_allocation ()
469 current_obstack
= function_obstack
;
470 expression_obstack
= function_obstack
;
471 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
474 /* While doing temporary allocation, switch to allocating in such a
475 way as to save all nodes if the function is inlined. Call
476 resume_temporary_allocation to go back to ordinary temporary
480 saveable_allocation ()
482 /* Note that function_obstack at top level points to temporary_obstack.
483 But within a nested function context, it is a separate obstack. */
484 expression_obstack
= current_obstack
= saveable_obstack
;
487 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
488 recording the previously current obstacks on a stack.
489 This does not free any storage in any obstack. */
492 push_obstacks (current
, saveable
)
493 struct obstack
*current
, *saveable
;
495 struct obstack_stack
*p
;
497 p
= (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
498 (sizeof (struct obstack_stack
)));
500 p
->current
= current_obstack
;
501 p
->saveable
= saveable_obstack
;
502 p
->expression
= expression_obstack
;
503 p
->rtl
= rtl_obstack
;
504 p
->next
= obstack_stack
;
507 current_obstack
= current
;
508 expression_obstack
= current
;
509 rtl_obstack
= saveable_obstack
= saveable
;
512 /* Save the current set of obstacks, but don't change them. */
515 push_obstacks_nochange ()
517 struct obstack_stack
*p
;
519 p
= (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
520 (sizeof (struct obstack_stack
)));
522 p
->current
= current_obstack
;
523 p
->saveable
= saveable_obstack
;
524 p
->expression
= expression_obstack
;
525 p
->rtl
= rtl_obstack
;
526 p
->next
= obstack_stack
;
530 /* Pop the obstack selection stack. */
535 struct obstack_stack
*p
;
538 obstack_stack
= p
->next
;
540 current_obstack
= p
->current
;
541 saveable_obstack
= p
->saveable
;
542 expression_obstack
= p
->expression
;
543 rtl_obstack
= p
->rtl
;
545 obstack_free (&obstack_stack_obstack
, p
);
548 /* Nonzero if temporary allocation is currently in effect.
549 Zero if currently doing permanent allocation. */
552 allocation_temporary_p ()
554 return current_obstack
!= &permanent_obstack
;
557 /* Go back to allocating on the permanent obstack
558 and free everything in the temporary obstack.
560 FUNCTION_END is true only if we have just finished compiling a function.
561 In that case, we also free preserved initial values on the momentary
565 permanent_allocation (function_end
)
568 /* Free up previous temporary obstack data */
569 obstack_free (&temporary_obstack
, temporary_firstobj
);
572 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
573 momentary_firstobj
= momentary_function_firstobj
;
576 obstack_free (&momentary_obstack
, momentary_firstobj
);
577 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
578 obstack_free (&temp_decl_obstack
, temp_decl_firstobj
);
580 current_obstack
= &permanent_obstack
;
581 expression_obstack
= &permanent_obstack
;
582 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
585 /* Save permanently everything on the maybepermanent_obstack. */
590 maybepermanent_firstobj
591 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
595 preserve_initializer ()
597 struct momentary_level
*tem
;
601 = (char *) obstack_alloc (&temporary_obstack
, 0);
602 maybepermanent_firstobj
603 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
605 old_momentary
= momentary_firstobj
;
607 = (char *) obstack_alloc (&momentary_obstack
, 0);
608 if (momentary_firstobj
!= old_momentary
)
609 for (tem
= momentary_stack
; tem
; tem
= tem
->prev
)
610 tem
->base
= momentary_firstobj
;
613 /* Start allocating new rtl in current_obstack.
614 Use resume_temporary_allocation
615 to go back to allocating rtl in saveable_obstack. */
618 rtl_in_current_obstack ()
620 rtl_obstack
= current_obstack
;
623 /* Start allocating rtl from saveable_obstack. Intended to be used after
624 a call to push_obstacks_nochange. */
627 rtl_in_saveable_obstack ()
629 rtl_obstack
= saveable_obstack
;
632 /* Allocate SIZE bytes in the current obstack
633 and return a pointer to them.
634 In practice the current obstack is always the temporary one. */
640 return (char *) obstack_alloc (current_obstack
, size
);
643 /* Free the object PTR in the current obstack
644 as well as everything allocated since PTR.
645 In practice the current obstack is always the temporary one. */
651 obstack_free (current_obstack
, ptr
);
654 /* Allocate SIZE bytes in the permanent obstack
655 and return a pointer to them. */
661 return (char *) obstack_alloc (&permanent_obstack
, size
);
664 /* Allocate NELEM items of SIZE bytes in the permanent obstack
665 and return a pointer to them. The storage is cleared before
666 returning the value. */
669 perm_calloc (nelem
, size
)
673 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
674 bzero (rval
, nelem
* size
);
678 /* Allocate SIZE bytes in the saveable obstack
679 and return a pointer to them. */
685 return (char *) obstack_alloc (saveable_obstack
, size
);
688 /* Allocate SIZE bytes in the expression obstack
689 and return a pointer to them. */
695 return (char *) obstack_alloc (expression_obstack
, size
);
698 /* Print out which obstack an object is in. */
701 print_obstack_name (object
, file
, prefix
)
706 struct obstack
*obstack
= NULL
;
707 const char *obstack_name
= NULL
;
710 for (p
= outer_function_chain
; p
; p
= p
->next
)
712 if (_obstack_allocated_p (p
->function_obstack
, object
))
714 obstack
= p
->function_obstack
;
715 obstack_name
= "containing function obstack";
717 if (_obstack_allocated_p (p
->function_maybepermanent_obstack
, object
))
719 obstack
= p
->function_maybepermanent_obstack
;
720 obstack_name
= "containing function maybepermanent obstack";
724 if (_obstack_allocated_p (&obstack_stack_obstack
, object
))
726 obstack
= &obstack_stack_obstack
;
727 obstack_name
= "obstack_stack_obstack";
729 else if (_obstack_allocated_p (function_obstack
, object
))
731 obstack
= function_obstack
;
732 obstack_name
= "function obstack";
734 else if (_obstack_allocated_p (&permanent_obstack
, object
))
736 obstack
= &permanent_obstack
;
737 obstack_name
= "permanent_obstack";
739 else if (_obstack_allocated_p (&momentary_obstack
, object
))
741 obstack
= &momentary_obstack
;
742 obstack_name
= "momentary_obstack";
744 else if (_obstack_allocated_p (function_maybepermanent_obstack
, object
))
746 obstack
= function_maybepermanent_obstack
;
747 obstack_name
= "function maybepermanent obstack";
749 else if (_obstack_allocated_p (&temp_decl_obstack
, object
))
751 obstack
= &temp_decl_obstack
;
752 obstack_name
= "temp_decl_obstack";
755 /* Check to see if the object is in the free area of the obstack. */
758 if (object
>= obstack
->next_free
759 && object
< obstack
->chunk_limit
)
760 fprintf (file
, "%s in free portion of obstack %s",
761 prefix
, obstack_name
);
763 fprintf (file
, "%s allocated from %s", prefix
, obstack_name
);
766 fprintf (file
, "%s not allocated from any obstack", prefix
);
770 debug_obstack (object
)
773 print_obstack_name (object
, stderr
, "object");
774 fprintf (stderr
, ".\n");
777 /* Return 1 if OBJ is in the permanent obstack.
778 This is slow, and should be used only for debugging.
779 Use TREE_PERMANENT for other purposes. */
782 object_permanent_p (obj
)
785 return _obstack_allocated_p (&permanent_obstack
, obj
);
788 /* Start a level of momentary allocation.
789 In C, each compound statement has its own level
790 and that level is freed at the end of each statement.
791 All expression nodes are allocated in the momentary allocation level. */
796 struct momentary_level
*tem
797 = (struct momentary_level
*) obstack_alloc (&momentary_obstack
,
798 sizeof (struct momentary_level
));
799 tem
->prev
= momentary_stack
;
800 tem
->base
= (char *) obstack_base (&momentary_obstack
);
801 tem
->obstack
= expression_obstack
;
802 momentary_stack
= tem
;
803 expression_obstack
= &momentary_obstack
;
806 /* Set things up so the next clear_momentary will only clear memory
807 past our present position in momentary_obstack. */
810 preserve_momentary ()
812 momentary_stack
->base
= (char *) obstack_base (&momentary_obstack
);
815 /* Free all the storage in the current momentary-allocation level.
816 In C, this happens at the end of each statement. */
821 obstack_free (&momentary_obstack
, momentary_stack
->base
);
824 /* Discard a level of momentary allocation.
825 In C, this happens at the end of each compound statement.
826 Restore the status of expression node allocation
827 that was in effect before this level was created. */
832 struct momentary_level
*tem
= momentary_stack
;
833 momentary_stack
= tem
->prev
;
834 expression_obstack
= tem
->obstack
;
835 /* We can't free TEM from the momentary_obstack, because there might
836 be objects above it which have been saved. We can free back to the
837 stack of the level we are popping off though. */
838 obstack_free (&momentary_obstack
, tem
->base
);
841 /* Pop back to the previous level of momentary allocation,
842 but don't free any momentary data just yet. */
845 pop_momentary_nofree ()
847 struct momentary_level
*tem
= momentary_stack
;
848 momentary_stack
= tem
->prev
;
849 expression_obstack
= tem
->obstack
;
852 /* Call when starting to parse a declaration:
853 make expressions in the declaration last the length of the function.
854 Returns an argument that should be passed to resume_momentary later. */
859 register int tem
= expression_obstack
== &momentary_obstack
;
860 expression_obstack
= saveable_obstack
;
864 /* Call when finished parsing a declaration:
865 restore the treatment of node-allocation that was
866 in effect before the suspension.
867 YES should be the value previously returned by suspend_momentary. */
870 resume_momentary (yes
)
874 expression_obstack
= &momentary_obstack
;
877 /* Init the tables indexed by tree code.
878 Note that languages can add to these tables to define their own codes. */
884 ggc_alloc_string (BUILT_IN_FILENAME
, sizeof (BUILT_IN_FILENAME
));
885 ggc_add_string_root (&built_in_filename
, 1);
888 /* Return a newly allocated node of code CODE.
889 Initialize the node's unique id and its TREE_PERMANENT flag.
890 For decl and type nodes, some other fields are initialized.
891 The rest of the node is initialized to zero.
893 Achoo! I got a code in the node. */
900 register int type
= TREE_CODE_CLASS (code
);
901 register int length
= 0;
902 register struct obstack
*obstack
= current_obstack
;
903 #ifdef GATHER_STATISTICS
904 register tree_node_kind kind
;
909 case 'd': /* A decl node */
910 #ifdef GATHER_STATISTICS
913 length
= sizeof (struct tree_decl
);
914 /* All decls in an inline function need to be saved. */
915 if (obstack
!= &permanent_obstack
)
916 obstack
= saveable_obstack
;
918 /* PARM_DECLs go on the context of the parent. If this is a nested
919 function, then we must allocate the PARM_DECL on the parent's
920 obstack, so that they will live to the end of the parent's
921 closing brace. This is necessary in case we try to inline the
922 function into its parent.
924 PARM_DECLs of top-level functions do not have this problem. However,
925 we allocate them where we put the FUNCTION_DECL for languages such as
926 Ada that need to consult some flags in the PARM_DECLs of the function
929 See comment in restore_tree_status for why we can't put this
930 in function_obstack. */
931 if (code
== PARM_DECL
&& obstack
!= &permanent_obstack
)
934 if (current_function_decl
)
935 context
= decl_function_context (current_function_decl
);
939 = find_function_data (context
)->function_maybepermanent_obstack
;
943 case 't': /* a type node */
944 #ifdef GATHER_STATISTICS
947 length
= sizeof (struct tree_type
);
948 /* All data types are put where we can preserve them if nec. */
949 if (obstack
!= &permanent_obstack
)
950 obstack
= all_types_permanent
? &permanent_obstack
: saveable_obstack
;
953 case 'b': /* a lexical block */
954 #ifdef GATHER_STATISTICS
957 length
= sizeof (struct tree_block
);
958 /* All BLOCK nodes are put where we can preserve them if nec. */
959 if (obstack
!= &permanent_obstack
)
960 obstack
= saveable_obstack
;
963 case 's': /* an expression with side effects */
964 #ifdef GATHER_STATISTICS
968 case 'r': /* a reference */
969 #ifdef GATHER_STATISTICS
973 case 'e': /* an expression */
974 case '<': /* a comparison expression */
975 case '1': /* a unary arithmetic expression */
976 case '2': /* a binary arithmetic expression */
977 #ifdef GATHER_STATISTICS
981 obstack
= expression_obstack
;
982 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
983 if (code
== BIND_EXPR
&& obstack
!= &permanent_obstack
)
984 obstack
= saveable_obstack
;
985 length
= sizeof (struct tree_exp
)
986 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
989 case 'c': /* a constant */
990 #ifdef GATHER_STATISTICS
993 obstack
= expression_obstack
;
995 /* We can't use tree_code_length for INTEGER_CST, since the number of
996 words is machine-dependent due to varying length of HOST_WIDE_INT,
997 which might be wider than a pointer (e.g., long long). Similarly
998 for REAL_CST, since the number of words is machine-dependent due
999 to varying size and alignment of `double'. */
1001 if (code
== INTEGER_CST
)
1002 length
= sizeof (struct tree_int_cst
);
1003 else if (code
== REAL_CST
)
1004 length
= sizeof (struct tree_real_cst
);
1006 length
= sizeof (struct tree_common
)
1007 + tree_code_length
[(int) code
] * sizeof (char *);
1010 case 'x': /* something random, like an identifier. */
1011 #ifdef GATHER_STATISTICS
1012 if (code
== IDENTIFIER_NODE
)
1014 else if (code
== OP_IDENTIFIER
)
1016 else if (code
== TREE_VEC
)
1021 length
= sizeof (struct tree_common
)
1022 + tree_code_length
[(int) code
] * sizeof (char *);
1023 /* Identifier nodes are always permanent since they are
1024 unique in a compiler run. */
1025 if (code
== IDENTIFIER_NODE
) obstack
= &permanent_obstack
;
1033 t
= ggc_alloc_tree (length
);
1036 t
= (tree
) obstack_alloc (obstack
, length
);
1037 memset ((PTR
) t
, 0, length
);
1040 #ifdef GATHER_STATISTICS
1041 tree_node_counts
[(int)kind
]++;
1042 tree_node_sizes
[(int)kind
] += length
;
1045 TREE_SET_CODE (t
, code
);
1046 if (obstack
== &permanent_obstack
)
1047 TREE_PERMANENT (t
) = 1;
1052 TREE_SIDE_EFFECTS (t
) = 1;
1053 TREE_TYPE (t
) = void_type_node
;
1057 if (code
!= FUNCTION_DECL
)
1059 DECL_IN_SYSTEM_HEADER (t
)
1060 = in_system_header
&& (obstack
== &permanent_obstack
);
1061 DECL_SOURCE_LINE (t
) = lineno
;
1062 DECL_SOURCE_FILE (t
) =
1063 (input_filename
) ? input_filename
: built_in_filename
;
1064 DECL_UID (t
) = next_decl_uid
++;
1065 /* Note that we have not yet computed the alias set for this
1067 DECL_POINTER_ALIAS_SET (t
) = -1;
1071 TYPE_UID (t
) = next_type_uid
++;
1073 TYPE_MAIN_VARIANT (t
) = t
;
1074 TYPE_OBSTACK (t
) = obstack
;
1075 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1076 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1077 SET_DEFAULT_TYPE_ATTRIBUTES (t
);
1079 /* Note that we have not yet computed the alias set for this
1081 TYPE_ALIAS_SET (t
) = -1;
1085 TREE_CONSTANT (t
) = 1;
1095 case PREDECREMENT_EXPR
:
1096 case PREINCREMENT_EXPR
:
1097 case POSTDECREMENT_EXPR
:
1098 case POSTINCREMENT_EXPR
:
1099 /* All of these have side-effects, no matter what their
1101 TREE_SIDE_EFFECTS (t
) = 1;
1113 /* A front-end can reset this to an appropriate function if types need
1114 special handling. */
1116 tree (*make_lang_type_fn
) PROTO((enum tree_code
)) = make_node
;
1118 /* Return a new type (with the indicated CODE), doing whatever
1119 language-specific processing is required. */
1122 make_lang_type (code
)
1123 enum tree_code code
;
1125 return (*make_lang_type_fn
) (code
);
1128 /* Return a new node with the same contents as NODE except that its
1129 TREE_CHAIN is zero and it has a fresh uid. Unlike make_node, this
1130 function always performs the allocation on the CURRENT_OBSTACK;
1131 it's up to the caller to pick the right obstack before calling this
1139 register enum tree_code code
= TREE_CODE (node
);
1140 register int length
= 0;
1142 switch (TREE_CODE_CLASS (code
))
1144 case 'd': /* A decl node */
1145 length
= sizeof (struct tree_decl
);
1148 case 't': /* a type node */
1149 length
= sizeof (struct tree_type
);
1152 case 'b': /* a lexical block node */
1153 length
= sizeof (struct tree_block
);
1156 case 'r': /* a reference */
1157 case 'e': /* an expression */
1158 case 's': /* an expression with side effects */
1159 case '<': /* a comparison expression */
1160 case '1': /* a unary arithmetic expression */
1161 case '2': /* a binary arithmetic expression */
1162 length
= sizeof (struct tree_exp
)
1163 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
1166 case 'c': /* a constant */
1167 /* We can't use tree_code_length for INTEGER_CST, since the number of
1168 words is machine-dependent due to varying length of HOST_WIDE_INT,
1169 which might be wider than a pointer (e.g., long long). Similarly
1170 for REAL_CST, since the number of words is machine-dependent due
1171 to varying size and alignment of `double'. */
1172 if (code
== INTEGER_CST
)
1173 length
= sizeof (struct tree_int_cst
);
1174 else if (code
== REAL_CST
)
1175 length
= sizeof (struct tree_real_cst
);
1177 length
= (sizeof (struct tree_common
)
1178 + tree_code_length
[(int) code
] * sizeof (char *));
1181 case 'x': /* something random, like an identifier. */
1182 length
= sizeof (struct tree_common
)
1183 + tree_code_length
[(int) code
] * sizeof (char *);
1184 if (code
== TREE_VEC
)
1185 length
+= (TREE_VEC_LENGTH (node
) - 1) * sizeof (char *);
1189 t
= ggc_alloc_tree (length
);
1191 t
= (tree
) obstack_alloc (current_obstack
, length
);
1192 memcpy (t
, node
, length
);
1194 /* EXPR_WITH_FILE_LOCATION must keep filename info stored in TREE_CHAIN */
1195 if (TREE_CODE (node
) != EXPR_WITH_FILE_LOCATION
)
1197 TREE_ASM_WRITTEN (t
) = 0;
1199 if (TREE_CODE_CLASS (code
) == 'd')
1200 DECL_UID (t
) = next_decl_uid
++;
1201 else if (TREE_CODE_CLASS (code
) == 't')
1203 TYPE_UID (t
) = next_type_uid
++;
1204 TYPE_OBSTACK (t
) = current_obstack
;
1206 /* The following is so that the debug code for
1207 the copy is different from the original type.
1208 The two statements usually duplicate each other
1209 (because they clear fields of the same union),
1210 but the optimizer should catch that. */
1211 TYPE_SYMTAB_POINTER (t
) = 0;
1212 TYPE_SYMTAB_ADDRESS (t
) = 0;
1215 TREE_PERMANENT (t
) = (current_obstack
== &permanent_obstack
);
1220 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1221 For example, this can copy a list made of TREE_LIST nodes. */
1228 register tree prev
, next
;
1233 head
= prev
= copy_node (list
);
1234 next
= TREE_CHAIN (list
);
1237 TREE_CHAIN (prev
) = copy_node (next
);
1238 prev
= TREE_CHAIN (prev
);
1239 next
= TREE_CHAIN (next
);
1246 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1247 If an identifier with that name has previously been referred to,
1248 the same node is returned this time. */
1251 get_identifier (text
)
1252 register const char *text
;
1257 register int len
, hash_len
;
1259 /* Compute length of text in len. */
1260 len
= strlen (text
);
1262 /* Decide how much of that length to hash on */
1264 if (warn_id_clash
&& (unsigned)len
> id_clash_len
)
1265 hash_len
= id_clash_len
;
1267 /* Compute hash code */
1268 hi
= hash_len
* 613 + (unsigned) text
[0];
1269 for (i
= 1; i
< hash_len
; i
+= 2)
1270 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1272 hi
&= (1 << HASHBITS
) - 1;
1273 hi
%= MAX_HASH_TABLE
;
1275 /* Search table for identifier */
1276 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1277 if (IDENTIFIER_LENGTH (idp
) == len
1278 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1279 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1280 return idp
; /* <-- return if found */
1282 /* Not found; optionally warn about a similar identifier */
1283 if (warn_id_clash
&& do_identifier_warnings
&& (unsigned)len
>= id_clash_len
)
1284 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1285 if (!strncmp (IDENTIFIER_POINTER (idp
), text
, id_clash_len
))
1287 warning ("`%s' and `%s' identical in first %d characters",
1288 IDENTIFIER_POINTER (idp
), text
, id_clash_len
);
1292 if (tree_code_length
[(int) IDENTIFIER_NODE
] < 0)
1293 abort (); /* set_identifier_size hasn't been called. */
1295 /* Not found, create one, add to chain */
1296 idp
= make_node (IDENTIFIER_NODE
);
1297 IDENTIFIER_LENGTH (idp
) = len
;
1298 #ifdef GATHER_STATISTICS
1299 id_string_size
+= len
;
1303 IDENTIFIER_POINTER (idp
) = ggc_alloc_string (text
, len
);
1305 IDENTIFIER_POINTER (idp
) = obstack_copy0 (&permanent_obstack
, text
, len
);
1307 TREE_CHAIN (idp
) = hash_table
[hi
];
1308 hash_table
[hi
] = idp
;
1309 return idp
; /* <-- return if created */
1312 /* If an identifier with the name TEXT (a null-terminated string) has
1313 previously been referred to, return that node; otherwise return
1317 maybe_get_identifier (text
)
1318 register const char *text
;
1323 register int len
, hash_len
;
1325 /* Compute length of text in len. */
1326 len
= strlen (text
);
1328 /* Decide how much of that length to hash on */
1330 if (warn_id_clash
&& (unsigned)len
> id_clash_len
)
1331 hash_len
= id_clash_len
;
1333 /* Compute hash code */
1334 hi
= hash_len
* 613 + (unsigned) text
[0];
1335 for (i
= 1; i
< hash_len
; i
+= 2)
1336 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1338 hi
&= (1 << HASHBITS
) - 1;
1339 hi
%= MAX_HASH_TABLE
;
1341 /* Search table for identifier */
1342 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1343 if (IDENTIFIER_LENGTH (idp
) == len
1344 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1345 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1346 return idp
; /* <-- return if found */
1351 /* Enable warnings on similar identifiers (if requested).
1352 Done after the built-in identifiers are created. */
1355 start_identifier_warnings ()
1357 do_identifier_warnings
= 1;
1360 /* Record the size of an identifier node for the language in use.
1361 SIZE is the total size in bytes.
1362 This is called by the language-specific files. This must be
1363 called before allocating any identifiers. */
1366 set_identifier_size (size
)
1369 tree_code_length
[(int) IDENTIFIER_NODE
]
1370 = (size
- sizeof (struct tree_common
)) / sizeof (tree
);
1373 /* Return a newly constructed INTEGER_CST node whose constant value
1374 is specified by the two ints LOW and HI.
1375 The TREE_TYPE is set to `int'.
1377 This function should be used via the `build_int_2' macro. */
1380 build_int_2_wide (low
, hi
)
1381 HOST_WIDE_INT low
, hi
;
1383 register tree t
= make_node (INTEGER_CST
);
1384 TREE_INT_CST_LOW (t
) = low
;
1385 TREE_INT_CST_HIGH (t
) = hi
;
1386 TREE_TYPE (t
) = integer_type_node
;
1390 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1393 build_real (type
, d
)
1400 /* Check for valid float value for this type on this target machine;
1401 if not, can print error message and store a valid value in D. */
1402 #ifdef CHECK_FLOAT_VALUE
1403 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1406 v
= make_node (REAL_CST
);
1407 TREE_TYPE (v
) = type
;
1408 TREE_REAL_CST (v
) = d
;
1409 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1413 /* Return a new REAL_CST node whose type is TYPE
1414 and whose value is the integer value of the INTEGER_CST node I. */
1416 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1419 real_value_from_int_cst (type
, i
)
1424 #ifdef REAL_ARITHMETIC
1425 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
1426 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1429 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
1430 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
1431 #else /* not REAL_ARITHMETIC */
1432 /* Some 386 compilers mishandle unsigned int to float conversions,
1433 so introduce a temporary variable E to avoid those bugs. */
1434 if (TREE_INT_CST_HIGH (i
) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i
)))
1438 d
= (double) (~ TREE_INT_CST_HIGH (i
));
1439 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1440 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1442 e
= (double) (unsigned HOST_WIDE_INT
) (~ TREE_INT_CST_LOW (i
));
1450 d
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (i
);
1451 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1452 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1454 e
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (i
);
1457 #endif /* not REAL_ARITHMETIC */
1470 build_real_from_int_cst_1 (data
)
1473 struct brfic_args
* args
= (struct brfic_args
*) data
;
1475 #ifdef REAL_ARITHMETIC
1476 args
->d
= real_value_from_int_cst (args
->type
, args
->i
);
1479 REAL_VALUE_TRUNCATE (TYPE_MODE (args
->type
),
1480 real_value_from_int_cst (args
->type
, args
->i
));
1484 /* This function can't be implemented if we can't do arithmetic
1485 on the float representation. */
1488 build_real_from_int_cst (type
, i
)
1493 int overflow
= TREE_OVERFLOW (i
);
1495 struct brfic_args args
;
1497 v
= make_node (REAL_CST
);
1498 TREE_TYPE (v
) = type
;
1500 /* Setup input for build_real_from_int_cst_1() */
1504 if (do_float_handler (build_real_from_int_cst_1
, (PTR
) &args
))
1506 /* Receive output from build_real_from_int_cst_1() */
1511 /* We got an exception from build_real_from_int_cst_1() */
1516 /* Check for valid float value for this type on this target machine. */
1518 #ifdef CHECK_FLOAT_VALUE
1519 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1522 TREE_REAL_CST (v
) = d
;
1523 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1527 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1529 /* Return a newly constructed STRING_CST node whose value is
1530 the LEN characters at STR.
1531 The TREE_TYPE is not initialized. */
1534 build_string (len
, str
)
1538 /* Put the string in saveable_obstack since it will be placed in the RTL
1539 for an "asm" statement and will also be kept around a while if
1540 deferring constant output in varasm.c. */
1542 register tree s
= make_node (STRING_CST
);
1543 TREE_STRING_LENGTH (s
) = len
;
1545 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
1547 TREE_STRING_POINTER (s
) = obstack_copy0 (saveable_obstack
, str
, len
);
1551 /* Return a newly constructed COMPLEX_CST node whose value is
1552 specified by the real and imaginary parts REAL and IMAG.
1553 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1554 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1557 build_complex (type
, real
, imag
)
1561 register tree t
= make_node (COMPLEX_CST
);
1563 TREE_REALPART (t
) = real
;
1564 TREE_IMAGPART (t
) = imag
;
1565 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1566 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1567 TREE_CONSTANT_OVERFLOW (t
)
1568 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1572 /* Build a newly constructed TREE_VEC node of length LEN. */
1579 register int length
= (len
-1) * sizeof (tree
) + sizeof (struct tree_vec
);
1580 register struct obstack
*obstack
= current_obstack
;
1582 #ifdef GATHER_STATISTICS
1583 tree_node_counts
[(int)vec_kind
]++;
1584 tree_node_sizes
[(int)vec_kind
] += length
;
1588 t
= ggc_alloc_tree (length
);
1591 t
= (tree
) obstack_alloc (obstack
, length
);
1592 bzero ((PTR
) t
, length
);
1595 TREE_SET_CODE (t
, TREE_VEC
);
1596 TREE_VEC_LENGTH (t
) = len
;
1597 if (obstack
== &permanent_obstack
)
1598 TREE_PERMANENT (t
) = 1;
1603 /* Return 1 if EXPR is the integer constant zero or a complex constant
1607 integer_zerop (expr
)
1612 return ((TREE_CODE (expr
) == INTEGER_CST
1613 && ! TREE_CONSTANT_OVERFLOW (expr
)
1614 && TREE_INT_CST_LOW (expr
) == 0
1615 && TREE_INT_CST_HIGH (expr
) == 0)
1616 || (TREE_CODE (expr
) == COMPLEX_CST
1617 && integer_zerop (TREE_REALPART (expr
))
1618 && integer_zerop (TREE_IMAGPART (expr
))));
1621 /* Return 1 if EXPR is the integer constant one or the corresponding
1622 complex constant. */
1630 return ((TREE_CODE (expr
) == INTEGER_CST
1631 && ! TREE_CONSTANT_OVERFLOW (expr
)
1632 && TREE_INT_CST_LOW (expr
) == 1
1633 && TREE_INT_CST_HIGH (expr
) == 0)
1634 || (TREE_CODE (expr
) == COMPLEX_CST
1635 && integer_onep (TREE_REALPART (expr
))
1636 && integer_zerop (TREE_IMAGPART (expr
))));
1639 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1640 it contains. Likewise for the corresponding complex constant. */
1643 integer_all_onesp (expr
)
1651 if (TREE_CODE (expr
) == COMPLEX_CST
1652 && integer_all_onesp (TREE_REALPART (expr
))
1653 && integer_zerop (TREE_IMAGPART (expr
)))
1656 else if (TREE_CODE (expr
) != INTEGER_CST
1657 || TREE_CONSTANT_OVERFLOW (expr
))
1660 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
1662 return TREE_INT_CST_LOW (expr
) == -1 && TREE_INT_CST_HIGH (expr
) == -1;
1664 /* Note that using TYPE_PRECISION here is wrong. We care about the
1665 actual bits, not the (arbitrary) range of the type. */
1666 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1667 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1669 int high_value
, shift_amount
;
1671 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1673 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
1674 /* Can not handle precisions greater than twice the host int size. */
1676 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1677 /* Shifting by the host word size is undefined according to the ANSI
1678 standard, so we must handle this as a special case. */
1681 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1683 return TREE_INT_CST_LOW (expr
) == -1
1684 && TREE_INT_CST_HIGH (expr
) == high_value
;
1687 return TREE_INT_CST_LOW (expr
) == ((HOST_WIDE_INT
) 1 << prec
) - 1;
1690 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1694 integer_pow2p (expr
)
1698 HOST_WIDE_INT high
, low
;
1702 if (TREE_CODE (expr
) == COMPLEX_CST
1703 && integer_pow2p (TREE_REALPART (expr
))
1704 && integer_zerop (TREE_IMAGPART (expr
)))
1707 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1710 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1711 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1712 high
= TREE_INT_CST_HIGH (expr
);
1713 low
= TREE_INT_CST_LOW (expr
);
1715 /* First clear all bits that are beyond the type's precision in case
1716 we've been sign extended. */
1718 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1720 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1721 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1725 if (prec
< HOST_BITS_PER_WIDE_INT
)
1726 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1729 if (high
== 0 && low
== 0)
1732 return ((high
== 0 && (low
& (low
- 1)) == 0)
1733 || (low
== 0 && (high
& (high
- 1)) == 0));
1736 /* Return the power of two represented by a tree node known to be a
1744 HOST_WIDE_INT high
, low
;
1748 if (TREE_CODE (expr
) == COMPLEX_CST
)
1749 return tree_log2 (TREE_REALPART (expr
));
1751 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1752 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1754 high
= TREE_INT_CST_HIGH (expr
);
1755 low
= TREE_INT_CST_LOW (expr
);
1757 /* First clear all bits that are beyond the type's precision in case
1758 we've been sign extended. */
1760 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1762 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1763 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1767 if (prec
< HOST_BITS_PER_WIDE_INT
)
1768 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1771 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1772 : exact_log2 (low
));
1775 /* Return 1 if EXPR is the real constant zero. */
1783 return ((TREE_CODE (expr
) == REAL_CST
1784 && ! TREE_CONSTANT_OVERFLOW (expr
)
1785 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1786 || (TREE_CODE (expr
) == COMPLEX_CST
1787 && real_zerop (TREE_REALPART (expr
))
1788 && real_zerop (TREE_IMAGPART (expr
))));
1791 /* Return 1 if EXPR is the real constant one in real or complex form. */
1799 return ((TREE_CODE (expr
) == REAL_CST
1800 && ! TREE_CONSTANT_OVERFLOW (expr
)
1801 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1802 || (TREE_CODE (expr
) == COMPLEX_CST
1803 && real_onep (TREE_REALPART (expr
))
1804 && real_zerop (TREE_IMAGPART (expr
))));
1807 /* Return 1 if EXPR is the real constant two. */
1815 return ((TREE_CODE (expr
) == REAL_CST
1816 && ! TREE_CONSTANT_OVERFLOW (expr
)
1817 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1818 || (TREE_CODE (expr
) == COMPLEX_CST
1819 && real_twop (TREE_REALPART (expr
))
1820 && real_zerop (TREE_IMAGPART (expr
))));
1823 /* Nonzero if EXP is a constant or a cast of a constant. */
1826 really_constant_p (exp
)
1829 /* This is not quite the same as STRIP_NOPS. It does more. */
1830 while (TREE_CODE (exp
) == NOP_EXPR
1831 || TREE_CODE (exp
) == CONVERT_EXPR
1832 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1833 exp
= TREE_OPERAND (exp
, 0);
1834 return TREE_CONSTANT (exp
);
1837 /* Return first list element whose TREE_VALUE is ELEM.
1838 Return 0 if ELEM is not in LIST. */
1841 value_member (elem
, list
)
1846 if (elem
== TREE_VALUE (list
))
1848 list
= TREE_CHAIN (list
);
1853 /* Return first list element whose TREE_PURPOSE is ELEM.
1854 Return 0 if ELEM is not in LIST. */
1857 purpose_member (elem
, list
)
1862 if (elem
== TREE_PURPOSE (list
))
1864 list
= TREE_CHAIN (list
);
1869 /* Return first list element whose BINFO_TYPE is ELEM.
1870 Return 0 if ELEM is not in LIST. */
1873 binfo_member (elem
, list
)
1878 if (elem
== BINFO_TYPE (list
))
1880 list
= TREE_CHAIN (list
);
1885 /* Return nonzero if ELEM is part of the chain CHAIN. */
1888 chain_member (elem
, chain
)
1895 chain
= TREE_CHAIN (chain
);
1901 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1903 /* ??? This function was added for machine specific attributes but is no
1904 longer used. It could be deleted if we could confirm all front ends
1908 chain_member_value (elem
, chain
)
1913 if (elem
== TREE_VALUE (chain
))
1915 chain
= TREE_CHAIN (chain
);
1921 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1922 for any piece of chain CHAIN. */
1923 /* ??? This function was added for machine specific attributes but is no
1924 longer used. It could be deleted if we could confirm all front ends
1928 chain_member_purpose (elem
, chain
)
1933 if (elem
== TREE_PURPOSE (chain
))
1935 chain
= TREE_CHAIN (chain
);
1941 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1942 We expect a null pointer to mark the end of the chain.
1943 This is the Lisp primitive `length'. */
1950 register int len
= 0;
1952 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1958 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1959 by modifying the last node in chain 1 to point to chain 2.
1960 This is the Lisp primitive `nconc'. */
1970 #ifdef ENABLE_CHECKING
1974 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1976 TREE_CHAIN (t1
) = op2
;
1977 #ifdef ENABLE_CHECKING
1978 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1980 abort (); /* Circularity created. */
1987 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1991 register tree chain
;
1995 while ((next
= TREE_CHAIN (chain
)))
2000 /* Reverse the order of elements in the chain T,
2001 and return the new head of the chain (old last element). */
2007 register tree prev
= 0, decl
, next
;
2008 for (decl
= t
; decl
; decl
= next
)
2010 next
= TREE_CHAIN (decl
);
2011 TREE_CHAIN (decl
) = prev
;
2017 /* Given a chain CHAIN of tree nodes,
2018 construct and return a list of those nodes. */
2024 tree result
= NULL_TREE
;
2025 tree in_tail
= chain
;
2026 tree out_tail
= NULL_TREE
;
2030 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
2032 TREE_CHAIN (out_tail
) = next
;
2036 in_tail
= TREE_CHAIN (in_tail
);
2042 /* Return a newly created TREE_LIST node whose
2043 purpose and value fields are PARM and VALUE. */
2046 build_tree_list (parm
, value
)
2049 register tree t
= make_node (TREE_LIST
);
2050 TREE_PURPOSE (t
) = parm
;
2051 TREE_VALUE (t
) = value
;
2055 /* Similar, but build on the temp_decl_obstack. */
2058 build_decl_list (parm
, value
)
2062 register struct obstack
*ambient_obstack
= current_obstack
;
2063 current_obstack
= &temp_decl_obstack
;
2064 node
= build_tree_list (parm
, value
);
2065 current_obstack
= ambient_obstack
;
2069 /* Similar, but build on the expression_obstack. */
2072 build_expr_list (parm
, value
)
2076 register struct obstack
*ambient_obstack
= current_obstack
;
2077 current_obstack
= expression_obstack
;
2078 node
= build_tree_list (parm
, value
);
2079 current_obstack
= ambient_obstack
;
2083 /* Return a newly created TREE_LIST node whose
2084 purpose and value fields are PARM and VALUE
2085 and whose TREE_CHAIN is CHAIN. */
2088 tree_cons (purpose
, value
, chain
)
2089 tree purpose
, value
, chain
;
2092 register tree node
= make_node (TREE_LIST
);
2097 node
= ggc_alloc_tree (sizeof (struct tree_list
));
2100 node
= (tree
) obstack_alloc (current_obstack
, sizeof (struct tree_list
));
2101 memset (node
, 0, sizeof (struct tree_common
));
2104 #ifdef GATHER_STATISTICS
2105 tree_node_counts
[(int)x_kind
]++;
2106 tree_node_sizes
[(int)x_kind
] += sizeof (struct tree_list
);
2110 TREE_SET_CODE (node
, TREE_LIST
);
2111 if (current_obstack
== &permanent_obstack
)
2112 TREE_PERMANENT (node
) = 1;
2115 TREE_CHAIN (node
) = chain
;
2116 TREE_PURPOSE (node
) = purpose
;
2117 TREE_VALUE (node
) = value
;
2121 /* Similar, but build on the temp_decl_obstack. */
2124 decl_tree_cons (purpose
, value
, chain
)
2125 tree purpose
, value
, chain
;
2128 register struct obstack
*ambient_obstack
= current_obstack
;
2129 current_obstack
= &temp_decl_obstack
;
2130 node
= tree_cons (purpose
, value
, chain
);
2131 current_obstack
= ambient_obstack
;
2135 /* Similar, but build on the expression_obstack. */
2138 expr_tree_cons (purpose
, value
, chain
)
2139 tree purpose
, value
, chain
;
2142 register struct obstack
*ambient_obstack
= current_obstack
;
2143 current_obstack
= expression_obstack
;
2144 node
= tree_cons (purpose
, value
, chain
);
2145 current_obstack
= ambient_obstack
;
2149 /* Same as `tree_cons' but make a permanent object. */
2152 perm_tree_cons (purpose
, value
, chain
)
2153 tree purpose
, value
, chain
;
2156 register struct obstack
*ambient_obstack
= current_obstack
;
2157 current_obstack
= &permanent_obstack
;
2159 node
= tree_cons (purpose
, value
, chain
);
2160 current_obstack
= ambient_obstack
;
2164 /* Same as `tree_cons', but make this node temporary, regardless. */
2167 temp_tree_cons (purpose
, value
, chain
)
2168 tree purpose
, value
, chain
;
2171 register struct obstack
*ambient_obstack
= current_obstack
;
2172 current_obstack
= &temporary_obstack
;
2174 node
= tree_cons (purpose
, value
, chain
);
2175 current_obstack
= ambient_obstack
;
2179 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2182 saveable_tree_cons (purpose
, value
, chain
)
2183 tree purpose
, value
, chain
;
2186 register struct obstack
*ambient_obstack
= current_obstack
;
2187 current_obstack
= saveable_obstack
;
2189 node
= tree_cons (purpose
, value
, chain
);
2190 current_obstack
= ambient_obstack
;
2194 /* Return the size nominally occupied by an object of type TYPE
2195 when it resides in memory. The value is measured in units of bytes,
2196 and its data type is that normally used for type sizes
2197 (which is the first type created by make_signed_type or
2198 make_unsigned_type). */
2201 size_in_bytes (type
)
2206 if (type
== error_mark_node
)
2207 return integer_zero_node
;
2209 type
= TYPE_MAIN_VARIANT (type
);
2210 t
= TYPE_SIZE_UNIT (type
);
2213 incomplete_type_error (NULL_TREE
, type
);
2214 return integer_zero_node
;
2216 if (TREE_CODE (t
) == INTEGER_CST
)
2217 force_fit_type (t
, 0);
2222 /* Return the size of TYPE (in bytes) as a wide integer
2223 or return -1 if the size can vary or is larger than an integer. */
2226 int_size_in_bytes (type
)
2231 if (type
== error_mark_node
)
2234 type
= TYPE_MAIN_VARIANT (type
);
2235 t
= TYPE_SIZE_UNIT (type
);
2237 || TREE_CODE (t
) != INTEGER_CST
2238 || TREE_INT_CST_HIGH (t
) != 0)
2241 return TREE_INT_CST_LOW (t
);
2244 /* Return, as a tree node, the number of elements for TYPE (which is an
2245 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2248 array_type_nelts (type
)
2251 tree index_type
, min
, max
;
2253 /* If they did it with unspecified bounds, then we should have already
2254 given an error about it before we got here. */
2255 if (! TYPE_DOMAIN (type
))
2256 return error_mark_node
;
2258 index_type
= TYPE_DOMAIN (type
);
2259 min
= TYPE_MIN_VALUE (index_type
);
2260 max
= TYPE_MAX_VALUE (index_type
);
2262 return (integer_zerop (min
)
2264 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
2267 /* Return nonzero if arg is static -- a reference to an object in
2268 static storage. This is not the same as the C meaning of `static'. */
2274 switch (TREE_CODE (arg
))
2277 /* Nested functions aren't static, since taking their address
2278 involves a trampoline. */
2279 return (decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
2280 && ! DECL_NON_ADDR_CONST_P (arg
);
2283 return (TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2284 && ! DECL_NON_ADDR_CONST_P (arg
);
2287 return TREE_STATIC (arg
);
2292 /* If we are referencing a bitfield, we can't evaluate an
2293 ADDR_EXPR at compile time and so it isn't a constant. */
2295 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
2296 && staticp (TREE_OPERAND (arg
, 0)));
2302 /* This case is technically correct, but results in setting
2303 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2306 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
2310 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2311 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2312 return staticp (TREE_OPERAND (arg
, 0));
2319 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2320 Do this to any expression which may be used in more than one place,
2321 but must be evaluated only once.
2323 Normally, expand_expr would reevaluate the expression each time.
2324 Calling save_expr produces something that is evaluated and recorded
2325 the first time expand_expr is called on it. Subsequent calls to
2326 expand_expr just reuse the recorded value.
2328 The call to expand_expr that generates code that actually computes
2329 the value is the first call *at compile time*. Subsequent calls
2330 *at compile time* generate code to use the saved value.
2331 This produces correct result provided that *at run time* control
2332 always flows through the insns made by the first expand_expr
2333 before reaching the other places where the save_expr was evaluated.
2334 You, the caller of save_expr, must make sure this is so.
2336 Constants, and certain read-only nodes, are returned with no
2337 SAVE_EXPR because that is safe. Expressions containing placeholders
2338 are not touched; see tree.def for an explanation of what these
2345 register tree t
= fold (expr
);
2347 /* We don't care about whether this can be used as an lvalue in this
2349 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
2350 t
= TREE_OPERAND (t
, 0);
2352 /* If the tree evaluates to a constant, then we don't want to hide that
2353 fact (i.e. this allows further folding, and direct checks for constants).
2354 However, a read-only object that has side effects cannot be bypassed.
2355 Since it is no problem to reevaluate literals, we just return the
2358 if (TREE_CONSTANT (t
) || (TREE_READONLY (t
) && ! TREE_SIDE_EFFECTS (t
))
2359 || TREE_CODE (t
) == SAVE_EXPR
|| TREE_CODE (t
) == ERROR_MARK
)
2362 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2363 it means that the size or offset of some field of an object depends on
2364 the value within another field.
2366 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2367 and some variable since it would then need to be both evaluated once and
2368 evaluated more than once. Front-ends must assure this case cannot
2369 happen by surrounding any such subexpressions in their own SAVE_EXPR
2370 and forcing evaluation at the proper time. */
2371 if (contains_placeholder_p (t
))
2374 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
2376 /* This expression might be placed ahead of a jump to ensure that the
2377 value was computed on both sides of the jump. So make sure it isn't
2378 eliminated as dead. */
2379 TREE_SIDE_EFFECTS (t
) = 1;
2383 /* Arrange for an expression to be expanded multiple independent
2384 times. This is useful for cleanup actions, as the backend can
2385 expand them multiple times in different places. */
2393 /* If this is already protected, no sense in protecting it again. */
2394 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
2397 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
2398 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
2402 /* Returns the index of the first non-tree operand for CODE, or the number
2403 of operands if all are trees. */
2407 enum tree_code code
;
2413 case GOTO_SUBROUTINE_EXPR
:
2418 case WITH_CLEANUP_EXPR
:
2419 /* Should be defined to be 2. */
2421 case METHOD_CALL_EXPR
:
2424 return tree_code_length
[(int) code
];
2428 /* Perform any modifications to EXPR required when it is unsaved. Does
2429 not recurse into EXPR's subtrees. */
2432 unsave_expr_1 (expr
)
2435 switch (TREE_CODE (expr
))
2438 if (!SAVE_EXPR_PERSISTENT_P (expr
))
2439 SAVE_EXPR_RTL (expr
) = 0;
2443 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2444 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2448 /* I don't yet know how to emit a sequence multiple times. */
2449 if (RTL_EXPR_SEQUENCE (expr
))
2454 CALL_EXPR_RTL (expr
) = 0;
2458 if (lang_unsave_expr_now
)
2459 (*lang_unsave_expr_now
) (expr
);
2464 /* Helper function for unsave_expr_now. */
2467 unsave_expr_now_r (expr
)
2470 enum tree_code code
;
2472 unsave_expr_1 (expr
);
2474 code
= TREE_CODE (expr
);
2475 if (code
== CALL_EXPR
2476 && TREE_OPERAND (expr
, 1)
2477 && TREE_CODE (TREE_OPERAND (expr
, 1)) == TREE_LIST
)
2479 tree exp
= TREE_OPERAND (expr
, 1);
2482 unsave_expr_now_r (TREE_VALUE (exp
));
2483 exp
= TREE_CHAIN (exp
);
2487 switch (TREE_CODE_CLASS (code
))
2489 case 'c': /* a constant */
2490 case 't': /* a type node */
2491 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2492 case 'd': /* A decl node */
2493 case 'b': /* A block node */
2496 case 'e': /* an expression */
2497 case 'r': /* a reference */
2498 case 's': /* an expression with side effects */
2499 case '<': /* a comparison expression */
2500 case '2': /* a binary arithmetic expression */
2501 case '1': /* a unary arithmetic expression */
2505 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
2506 unsave_expr_now_r (TREE_OPERAND (expr
, i
));
2515 /* Modify a tree in place so that all the evaluate only once things
2516 are cleared out. Return the EXPR given. */
2519 unsave_expr_now (expr
)
2523 (*lang_unsave
) (&expr
);
2525 unsave_expr_now_r (expr
);
2530 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2531 or offset that depends on a field within a record. */
2534 contains_placeholder_p (exp
)
2537 register enum tree_code code
= TREE_CODE (exp
);
2540 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2541 in it since it is supplying a value for it. */
2542 if (code
== WITH_RECORD_EXPR
)
2544 else if (code
== PLACEHOLDER_EXPR
)
2547 switch (TREE_CODE_CLASS (code
))
2550 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2551 position computations since they will be converted into a
2552 WITH_RECORD_EXPR involving the reference, which will assume
2553 here will be valid. */
2554 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2557 if (code
== TREE_LIST
)
2558 return (contains_placeholder_p (TREE_VALUE (exp
))
2559 || (TREE_CHAIN (exp
) != 0
2560 && contains_placeholder_p (TREE_CHAIN (exp
))));
2569 /* Ignoring the first operand isn't quite right, but works best. */
2570 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
2577 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2578 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
2579 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
2582 /* If we already know this doesn't have a placeholder, don't
2584 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
2587 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
2588 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
2590 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
2595 return (TREE_OPERAND (exp
, 1) != 0
2596 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2602 switch (tree_code_length
[(int) code
])
2605 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2607 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2608 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2619 /* Return 1 if EXP contains any expressions that produce cleanups for an
2620 outer scope to deal with. Used by fold. */
2628 if (! TREE_SIDE_EFFECTS (exp
))
2631 switch (TREE_CODE (exp
))
2634 case GOTO_SUBROUTINE_EXPR
:
2635 case WITH_CLEANUP_EXPR
:
2638 case CLEANUP_POINT_EXPR
:
2642 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
2644 cmp
= has_cleanups (TREE_VALUE (exp
));
2654 /* This general rule works for most tree codes. All exceptions should be
2655 handled above. If this is a language-specific tree code, we can't
2656 trust what might be in the operand, so say we don't know
2658 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
2661 nops
= first_rtl_op (TREE_CODE (exp
));
2662 for (i
= 0; i
< nops
; i
++)
2663 if (TREE_OPERAND (exp
, i
) != 0)
2665 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
2666 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
2667 || type
== 'r' || type
== 's')
2669 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
2678 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2679 return a tree with all occurrences of references to F in a
2680 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2681 contains only arithmetic expressions or a CALL_EXPR with a
2682 PLACEHOLDER_EXPR occurring only in its arglist. */
2685 substitute_in_expr (exp
, f
, r
)
2690 enum tree_code code
= TREE_CODE (exp
);
2695 switch (TREE_CODE_CLASS (code
))
2702 if (code
== PLACEHOLDER_EXPR
)
2704 else if (code
== TREE_LIST
)
2706 op0
= (TREE_CHAIN (exp
) == 0
2707 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2708 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2709 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2712 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2721 switch (tree_code_length
[(int) code
])
2724 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2725 if (op0
== TREE_OPERAND (exp
, 0))
2728 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2732 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2733 could, but we don't support it. */
2734 if (code
== RTL_EXPR
)
2736 else if (code
== CONSTRUCTOR
)
2739 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2740 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2741 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2744 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2748 /* It cannot be that anything inside a SAVE_EXPR contains a
2749 PLACEHOLDER_EXPR. */
2750 if (code
== SAVE_EXPR
)
2753 else if (code
== CALL_EXPR
)
2755 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2756 if (op1
== TREE_OPERAND (exp
, 1))
2759 return build (code
, TREE_TYPE (exp
),
2760 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2763 else if (code
!= COND_EXPR
)
2766 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2767 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2768 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2769 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2770 && op2
== TREE_OPERAND (exp
, 2))
2773 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2786 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2787 and it is the right field, replace it with R. */
2788 for (inner
= TREE_OPERAND (exp
, 0);
2789 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2790 inner
= TREE_OPERAND (inner
, 0))
2792 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2793 && TREE_OPERAND (exp
, 1) == f
)
2796 /* If this expression hasn't been completed let, leave it
2798 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2799 && TREE_TYPE (inner
) == 0)
2802 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2803 if (op0
== TREE_OPERAND (exp
, 0))
2806 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2807 TREE_OPERAND (exp
, 1)));
2811 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2812 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2813 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2814 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2815 && op2
== TREE_OPERAND (exp
, 2))
2818 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2823 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2824 if (op0
== TREE_OPERAND (exp
, 0))
2827 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2839 TREE_READONLY (new) = TREE_READONLY (exp
);
2843 /* Stabilize a reference so that we can use it any number of times
2844 without causing its operands to be evaluated more than once.
2845 Returns the stabilized reference. This works by means of save_expr,
2846 so see the caveats in the comments about save_expr.
2848 Also allows conversion expressions whose operands are references.
2849 Any other kind of expression is returned unchanged. */
2852 stabilize_reference (ref
)
2855 register tree result
;
2856 register enum tree_code code
= TREE_CODE (ref
);
2863 /* No action is needed in this case. */
2869 case FIX_TRUNC_EXPR
:
2870 case FIX_FLOOR_EXPR
:
2871 case FIX_ROUND_EXPR
:
2873 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2877 result
= build_nt (INDIRECT_REF
,
2878 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2882 result
= build_nt (COMPONENT_REF
,
2883 stabilize_reference (TREE_OPERAND (ref
, 0)),
2884 TREE_OPERAND (ref
, 1));
2888 result
= build_nt (BIT_FIELD_REF
,
2889 stabilize_reference (TREE_OPERAND (ref
, 0)),
2890 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2891 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2895 result
= build_nt (ARRAY_REF
,
2896 stabilize_reference (TREE_OPERAND (ref
, 0)),
2897 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2901 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2902 it wouldn't be ignored. This matters when dealing with
2904 return stabilize_reference_1 (ref
);
2907 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2908 save_expr (build1 (ADDR_EXPR
,
2909 build_pointer_type (TREE_TYPE (ref
)),
2914 /* If arg isn't a kind of lvalue we recognize, make no change.
2915 Caller should recognize the error for an invalid lvalue. */
2920 return error_mark_node
;
2923 TREE_TYPE (result
) = TREE_TYPE (ref
);
2924 TREE_READONLY (result
) = TREE_READONLY (ref
);
2925 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2926 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2927 TREE_RAISES (result
) = TREE_RAISES (ref
);
2932 /* Subroutine of stabilize_reference; this is called for subtrees of
2933 references. Any expression with side-effects must be put in a SAVE_EXPR
2934 to ensure that it is only evaluated once.
2936 We don't put SAVE_EXPR nodes around everything, because assigning very
2937 simple expressions to temporaries causes us to miss good opportunities
2938 for optimizations. Among other things, the opportunity to fold in the
2939 addition of a constant into an addressing mode often gets lost, e.g.
2940 "y[i+1] += x;". In general, we take the approach that we should not make
2941 an assignment unless we are forced into it - i.e., that any non-side effect
2942 operator should be allowed, and that cse should take care of coalescing
2943 multiple utterances of the same expression should that prove fruitful. */
2946 stabilize_reference_1 (e
)
2949 register tree result
;
2950 register enum tree_code code
= TREE_CODE (e
);
2952 /* We cannot ignore const expressions because it might be a reference
2953 to a const array but whose index contains side-effects. But we can
2954 ignore things that are actual constant or that already have been
2955 handled by this function. */
2957 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2960 switch (TREE_CODE_CLASS (code
))
2970 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2971 so that it will only be evaluated once. */
2972 /* The reference (r) and comparison (<) classes could be handled as
2973 below, but it is generally faster to only evaluate them once. */
2974 if (TREE_SIDE_EFFECTS (e
))
2975 return save_expr (e
);
2979 /* Constants need no processing. In fact, we should never reach
2984 /* Division is slow and tends to be compiled with jumps,
2985 especially the division by powers of 2 that is often
2986 found inside of an array reference. So do it just once. */
2987 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2988 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2989 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2990 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2991 return save_expr (e
);
2992 /* Recursively stabilize each operand. */
2993 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2994 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2998 /* Recursively stabilize each operand. */
2999 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3006 TREE_TYPE (result
) = TREE_TYPE (e
);
3007 TREE_READONLY (result
) = TREE_READONLY (e
);
3008 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3009 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3010 TREE_RAISES (result
) = TREE_RAISES (e
);
3015 /* Low-level constructors for expressions. */
3017 /* Build an expression of code CODE, data type TYPE,
3018 and operands as specified by the arguments ARG1 and following arguments.
3019 Expressions and reference nodes can be created this way.
3020 Constants, decls, types and misc nodes cannot be. */
3023 build
VPROTO((enum tree_code code
, tree tt
, ...))
3025 #ifndef ANSI_PROTOTYPES
3026 enum tree_code code
;
3031 register int length
;
3037 #ifndef ANSI_PROTOTYPES
3038 code
= va_arg (p
, enum tree_code
);
3039 tt
= va_arg (p
, tree
);
3042 t
= make_node (code
);
3043 length
= tree_code_length
[(int) code
];
3046 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_RAISED for
3047 the result based on those same flags for the arguments. But, if
3048 the arguments aren't really even `tree' expressions, we shouldn't
3049 be trying to do this. */
3050 fro
= first_rtl_op (code
);
3054 /* This is equivalent to the loop below, but faster. */
3055 register tree arg0
= va_arg (p
, tree
);
3056 register tree arg1
= va_arg (p
, tree
);
3057 TREE_OPERAND (t
, 0) = arg0
;
3058 TREE_OPERAND (t
, 1) = arg1
;
3059 if (arg0
&& fro
> 0)
3061 if (TREE_SIDE_EFFECTS (arg0
))
3062 TREE_SIDE_EFFECTS (t
) = 1;
3063 if (TREE_RAISES (arg0
))
3064 TREE_RAISES (t
) = 1;
3066 if (arg1
&& fro
> 1)
3068 if (TREE_SIDE_EFFECTS (arg1
))
3069 TREE_SIDE_EFFECTS (t
) = 1;
3070 if (TREE_RAISES (arg1
))
3071 TREE_RAISES (t
) = 1;
3074 else if (length
== 1)
3076 register tree arg0
= va_arg (p
, tree
);
3078 /* Call build1 for this! */
3079 if (TREE_CODE_CLASS (code
) != 's')
3081 TREE_OPERAND (t
, 0) = arg0
;
3084 if (arg0
&& TREE_SIDE_EFFECTS (arg0
))
3085 TREE_SIDE_EFFECTS (t
) = 1;
3086 TREE_RAISES (t
) = (arg0
&& TREE_RAISES (arg0
));
3091 for (i
= 0; i
< length
; i
++)
3093 register tree operand
= va_arg (p
, tree
);
3094 TREE_OPERAND (t
, i
) = operand
;
3095 if (operand
&& fro
> i
)
3097 if (TREE_SIDE_EFFECTS (operand
))
3098 TREE_SIDE_EFFECTS (t
) = 1;
3099 if (TREE_RAISES (operand
))
3100 TREE_RAISES (t
) = 1;
3108 /* Same as above, but only builds for unary operators.
3109 Saves lions share of calls to `build'; cuts down use
3110 of varargs, which is expensive for RISC machines. */
3113 build1 (code
, type
, node
)
3114 enum tree_code code
;
3118 register struct obstack
*obstack
= expression_obstack
;
3119 register int length
;
3120 #ifdef GATHER_STATISTICS
3121 register tree_node_kind kind
;
3125 #ifdef GATHER_STATISTICS
3126 if (TREE_CODE_CLASS (code
) == 'r')
3132 length
= sizeof (struct tree_exp
);
3135 t
= ggc_alloc_tree (length
);
3138 t
= (tree
) obstack_alloc (obstack
, length
);
3139 memset ((PTR
) t
, 0, length
);
3142 #ifdef GATHER_STATISTICS
3143 tree_node_counts
[(int)kind
]++;
3144 tree_node_sizes
[(int)kind
] += length
;
3147 TREE_TYPE (t
) = type
;
3148 TREE_SET_CODE (t
, code
);
3150 if (obstack
== &permanent_obstack
)
3151 TREE_PERMANENT (t
) = 1;
3153 TREE_OPERAND (t
, 0) = node
;
3154 if (node
&& first_rtl_op (code
) != 0)
3156 if (TREE_SIDE_EFFECTS (node
))
3157 TREE_SIDE_EFFECTS (t
) = 1;
3158 if (TREE_RAISES (node
))
3159 TREE_RAISES (t
) = 1;
3168 case PREDECREMENT_EXPR
:
3169 case PREINCREMENT_EXPR
:
3170 case POSTDECREMENT_EXPR
:
3171 case POSTINCREMENT_EXPR
:
3172 /* All of these have side-effects, no matter what their
3174 TREE_SIDE_EFFECTS (t
) = 1;
3184 /* Similar except don't specify the TREE_TYPE
3185 and leave the TREE_SIDE_EFFECTS as 0.
3186 It is permissible for arguments to be null,
3187 or even garbage if their values do not matter. */
3190 build_nt
VPROTO((enum tree_code code
, ...))
3192 #ifndef ANSI_PROTOTYPES
3193 enum tree_code code
;
3197 register int length
;
3202 #ifndef ANSI_PROTOTYPES
3203 code
= va_arg (p
, enum tree_code
);
3206 t
= make_node (code
);
3207 length
= tree_code_length
[(int) code
];
3209 for (i
= 0; i
< length
; i
++)
3210 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3216 /* Similar to `build_nt', except we build
3217 on the temp_decl_obstack, regardless. */
3220 build_parse_node
VPROTO((enum tree_code code
, ...))
3222 #ifndef ANSI_PROTOTYPES
3223 enum tree_code code
;
3225 register struct obstack
*ambient_obstack
= expression_obstack
;
3228 register int length
;
3233 #ifndef ANSI_PROTOTYPES
3234 code
= va_arg (p
, enum tree_code
);
3237 expression_obstack
= &temp_decl_obstack
;
3239 t
= make_node (code
);
3240 length
= tree_code_length
[(int) code
];
3242 for (i
= 0; i
< length
; i
++)
3243 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3246 expression_obstack
= ambient_obstack
;
3251 /* Commented out because this wants to be done very
3252 differently. See cp-lex.c. */
3254 build_op_identifier (op1
, op2
)
3257 register tree t
= make_node (OP_IDENTIFIER
);
3258 TREE_PURPOSE (t
) = op1
;
3259 TREE_VALUE (t
) = op2
;
3264 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3265 We do NOT enter this node in any sort of symbol table.
3267 layout_decl is used to set up the decl's storage layout.
3268 Other slots are initialized to 0 or null pointers. */
3271 build_decl (code
, name
, type
)
3272 enum tree_code code
;
3277 t
= make_node (code
);
3279 /* if (type == error_mark_node)
3280 type = integer_type_node; */
3281 /* That is not done, deliberately, so that having error_mark_node
3282 as the type can suppress useless errors in the use of this variable. */
3284 DECL_NAME (t
) = name
;
3285 DECL_ASSEMBLER_NAME (t
) = name
;
3286 TREE_TYPE (t
) = type
;
3288 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3290 else if (code
== FUNCTION_DECL
)
3291 DECL_MODE (t
) = FUNCTION_MODE
;
3296 /* BLOCK nodes are used to represent the structure of binding contours
3297 and declarations, once those contours have been exited and their contents
3298 compiled. This information is used for outputting debugging info. */
3301 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
3302 tree vars
, tags
, subblocks
, supercontext
, chain
;
3304 register tree block
= make_node (BLOCK
);
3305 BLOCK_VARS (block
) = vars
;
3306 BLOCK_SUBBLOCKS (block
) = subblocks
;
3307 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3308 BLOCK_CHAIN (block
) = chain
;
3312 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3313 location where an expression or an identifier were encountered. It
3314 is necessary for languages where the frontend parser will handle
3315 recursively more than one file (Java is one of them). */
3318 build_expr_wfl (node
, file
, line
, col
)
3323 static const char *last_file
= 0;
3324 static tree last_filenode
= NULL_TREE
;
3325 register tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
3327 EXPR_WFL_NODE (wfl
) = node
;
3328 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
3329 if (file
!= last_file
)
3332 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
3334 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
3337 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
3338 TREE_TYPE (wfl
) = TREE_TYPE (node
);
3343 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3347 build_decl_attribute_variant (ddecl
, attribute
)
3348 tree ddecl
, attribute
;
3350 DECL_MACHINE_ATTRIBUTES (ddecl
) = attribute
;
3354 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3357 Record such modified types already made so we don't make duplicates. */
3360 build_type_attribute_variant (ttype
, attribute
)
3361 tree ttype
, attribute
;
3363 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3365 register int hashcode
;
3368 push_obstacks (TYPE_OBSTACK (ttype
), TYPE_OBSTACK (ttype
));
3369 ntype
= copy_node (ttype
);
3371 TYPE_POINTER_TO (ntype
) = 0;
3372 TYPE_REFERENCE_TO (ntype
) = 0;
3373 TYPE_ATTRIBUTES (ntype
) = attribute
;
3375 /* Create a new main variant of TYPE. */
3376 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3377 TYPE_NEXT_VARIANT (ntype
) = 0;
3378 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3380 hashcode
= TYPE_HASH (TREE_CODE (ntype
))
3381 + TYPE_HASH (TREE_TYPE (ntype
))
3382 + attribute_hash_list (attribute
);
3384 switch (TREE_CODE (ntype
))
3387 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
3390 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
3393 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
3396 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
3402 ntype
= type_hash_canon (hashcode
, ntype
);
3403 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3410 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3411 or type TYPE and 0 otherwise. Validity is determined the configuration
3412 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3415 valid_machine_attribute (attr_name
, attr_args
, decl
, type
)
3417 tree attr_args ATTRIBUTE_UNUSED
;
3418 tree decl ATTRIBUTE_UNUSED
;
3419 tree type ATTRIBUTE_UNUSED
;
3422 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3423 tree decl_attr_list
= decl
!= 0 ? DECL_MACHINE_ATTRIBUTES (decl
) : 0;
3425 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3426 tree type_attr_list
= TYPE_ATTRIBUTES (type
);
3429 if (TREE_CODE (attr_name
) != IDENTIFIER_NODE
)
3432 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3434 && VALID_MACHINE_DECL_ATTRIBUTE (decl
, decl_attr_list
, attr_name
, attr_args
))
3436 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3439 if (attr
!= NULL_TREE
)
3441 /* Override existing arguments. Declarations are unique so we can
3442 modify this in place. */
3443 TREE_VALUE (attr
) = attr_args
;
3447 decl_attr_list
= tree_cons (attr_name
, attr_args
, decl_attr_list
);
3448 decl
= build_decl_attribute_variant (decl
, decl_attr_list
);
3455 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3457 /* Don't apply the attribute to both the decl and the type. */;
3458 else if (VALID_MACHINE_TYPE_ATTRIBUTE (type
, type_attr_list
, attr_name
,
3461 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3464 if (attr
!= NULL_TREE
)
3466 /* Override existing arguments.
3467 ??? This currently works since attribute arguments are not
3468 included in `attribute_hash_list'. Something more complicated
3469 may be needed in the future. */
3470 TREE_VALUE (attr
) = attr_args
;
3474 /* If this is part of a declaration, create a type variant,
3475 otherwise, this is part of a type definition, so add it
3476 to the base type. */
3477 type_attr_list
= tree_cons (attr_name
, attr_args
, type_attr_list
);
3479 type
= build_type_attribute_variant (type
, type_attr_list
);
3481 TYPE_ATTRIBUTES (type
) = type_attr_list
;
3484 TREE_TYPE (decl
) = type
;
3488 /* Handle putting a type attribute on pointer-to-function-type by putting
3489 the attribute on the function type. */
3490 else if (POINTER_TYPE_P (type
)
3491 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3492 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type
), type_attr_list
,
3493 attr_name
, attr_args
))
3495 tree inner_type
= TREE_TYPE (type
);
3496 tree inner_attr_list
= TYPE_ATTRIBUTES (inner_type
);
3497 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3500 if (attr
!= NULL_TREE
)
3501 TREE_VALUE (attr
) = attr_args
;
3504 inner_attr_list
= tree_cons (attr_name
, attr_args
, inner_attr_list
);
3505 inner_type
= build_type_attribute_variant (inner_type
,
3510 TREE_TYPE (decl
) = build_pointer_type (inner_type
);
3513 /* Clear TYPE_POINTER_TO for the old inner type, since
3514 `type' won't be pointing to it anymore. */
3515 TYPE_POINTER_TO (TREE_TYPE (type
)) = NULL_TREE
;
3516 TREE_TYPE (type
) = inner_type
;
3526 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3529 We try both `text' and `__text__', ATTR may be either one. */
3530 /* ??? It might be a reasonable simplification to require ATTR to be only
3531 `text'. One might then also require attribute lists to be stored in
3532 their canonicalized form. */
3535 is_attribute_p (attr
, ident
)
3539 int ident_len
, attr_len
;
3542 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3545 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
3548 p
= IDENTIFIER_POINTER (ident
);
3549 ident_len
= strlen (p
);
3550 attr_len
= strlen (attr
);
3552 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3556 || attr
[attr_len
- 2] != '_'
3557 || attr
[attr_len
- 1] != '_')
3559 if (ident_len
== attr_len
- 4
3560 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3565 if (ident_len
== attr_len
+ 4
3566 && p
[0] == '_' && p
[1] == '_'
3567 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3568 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3575 /* Given an attribute name and a list of attributes, return a pointer to the
3576 attribute's list element if the attribute is part of the list, or NULL_TREE
3580 lookup_attribute (attr_name
, list
)
3581 const char *attr_name
;
3586 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3588 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
3590 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
3597 /* Return an attribute list that is the union of a1 and a2. */
3600 merge_attributes (a1
, a2
)
3601 register tree a1
, a2
;
3605 /* Either one unset? Take the set one. */
3607 if (! (attributes
= a1
))
3610 /* One that completely contains the other? Take it. */
3612 else if (a2
&& ! attribute_list_contained (a1
, a2
))
3614 if (attribute_list_contained (a2
, a1
))
3618 /* Pick the longest list, and hang on the other list. */
3619 /* ??? For the moment we punt on the issue of attrs with args. */
3621 if (list_length (a1
) < list_length (a2
))
3622 attributes
= a2
, a2
= a1
;
3624 for (; a2
; a2
= TREE_CHAIN (a2
))
3625 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3626 attributes
) == NULL_TREE
)
3628 a1
= copy_node (a2
);
3629 TREE_CHAIN (a1
) = attributes
;
3637 /* Given types T1 and T2, merge their attributes and return
3641 merge_machine_type_attributes (t1
, t2
)
3644 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3645 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1
, t2
);
3647 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3648 TYPE_ATTRIBUTES (t2
));
3652 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3656 merge_machine_decl_attributes (olddecl
, newdecl
)
3657 tree olddecl
, newdecl
;
3659 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3660 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl
, newdecl
);
3662 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl
),
3663 DECL_MACHINE_ATTRIBUTES (newdecl
));
3667 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3668 of the various TYPE_QUAL values. */
3671 set_type_quals (type
, type_quals
)
3675 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3676 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3677 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3680 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
3681 the same kind of data as TYPE describes. Variants point to the
3682 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
3683 and it points to a chain of other variants so that duplicate
3684 variants are never made. Only main variants should ever appear as
3685 types of expressions. */
3688 build_qualified_type (type
, type_quals
)
3694 /* Search the chain of variants to see if there is already one there just
3695 like the one we need to have. If so, use that existing one. We must
3696 preserve the TYPE_NAME, since there is code that depends on this. */
3698 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3699 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
))
3702 /* We need a new one. */
3703 t
= build_type_copy (type
);
3704 set_type_quals (t
, type_quals
);
3708 /* Create a new variant of TYPE, equivalent but distinct.
3709 This is so the caller can modify it. */
3712 build_type_copy (type
)
3715 register tree t
, m
= TYPE_MAIN_VARIANT (type
);
3716 register struct obstack
*ambient_obstack
= current_obstack
;
3718 current_obstack
= TYPE_OBSTACK (type
);
3719 t
= copy_node (type
);
3720 current_obstack
= ambient_obstack
;
3722 TYPE_POINTER_TO (t
) = 0;
3723 TYPE_REFERENCE_TO (t
) = 0;
3725 /* Add this type to the chain of variants of TYPE. */
3726 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3727 TYPE_NEXT_VARIANT (m
) = t
;
3732 /* Hashing of types so that we don't make duplicates.
3733 The entry point is `type_hash_canon'. */
3735 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3736 with types in the TREE_VALUE slots), by adding the hash codes
3737 of the individual types. */
3740 type_hash_list (list
)
3743 register int hashcode
;
3745 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3746 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3750 /* Look in the type hash table for a type isomorphic to TYPE.
3751 If one is found, return it. Otherwise return 0. */
3754 type_hash_lookup (hashcode
, type
)
3758 register struct type_hash
*h
;
3760 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3761 must call that routine before comparing TYPE_ALIGNs. */
3764 for (h
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
]; h
; h
= h
->next
)
3765 if (h
->hashcode
== hashcode
3766 && TREE_CODE (h
->type
) == TREE_CODE (type
)
3767 && TREE_TYPE (h
->type
) == TREE_TYPE (type
)
3768 && attribute_list_equal (TYPE_ATTRIBUTES (h
->type
),
3769 TYPE_ATTRIBUTES (type
))
3770 && TYPE_ALIGN (h
->type
) == TYPE_ALIGN (type
)
3771 && (TYPE_MAX_VALUE (h
->type
) == TYPE_MAX_VALUE (type
)
3772 || tree_int_cst_equal (TYPE_MAX_VALUE (h
->type
),
3773 TYPE_MAX_VALUE (type
)))
3774 && (TYPE_MIN_VALUE (h
->type
) == TYPE_MIN_VALUE (type
)
3775 || tree_int_cst_equal (TYPE_MIN_VALUE (h
->type
),
3776 TYPE_MIN_VALUE (type
)))
3777 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3778 && (TYPE_DOMAIN (h
->type
) == TYPE_DOMAIN (type
)
3779 || (TYPE_DOMAIN (h
->type
)
3780 && TREE_CODE (TYPE_DOMAIN (h
->type
)) == TREE_LIST
3781 && TYPE_DOMAIN (type
)
3782 && TREE_CODE (TYPE_DOMAIN (type
)) == TREE_LIST
3783 && type_list_equal (TYPE_DOMAIN (h
->type
),
3784 TYPE_DOMAIN (type
)))))
3789 /* Add an entry to the type-hash-table
3790 for a type TYPE whose hash code is HASHCODE. */
3793 type_hash_add (hashcode
, type
)
3797 register struct type_hash
*h
;
3799 h
= (struct type_hash
*) permalloc (sizeof (struct type_hash
));
3800 h
->hashcode
= hashcode
;
3802 h
->next
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
];
3803 type_hash_table
[hashcode
% TYPE_HASH_SIZE
] = h
;
3806 /* Given TYPE, and HASHCODE its hash code, return the canonical
3807 object for an identical type if one already exists.
3808 Otherwise, return TYPE, and record it as the canonical object
3809 if it is a permanent object.
3811 To use this function, first create a type of the sort you want.
3812 Then compute its hash code from the fields of the type that
3813 make it different from other similar types.
3814 Then call this function and use the value.
3815 This function frees the type you pass in if it is a duplicate. */
3817 /* Set to 1 to debug without canonicalization. Never set by program. */
3818 int debug_no_type_hash
= 0;
3821 type_hash_canon (hashcode
, type
)
3827 if (debug_no_type_hash
)
3830 t1
= type_hash_lookup (hashcode
, type
);
3834 obstack_free (TYPE_OBSTACK (type
), type
);
3835 #ifdef GATHER_STATISTICS
3836 tree_node_counts
[(int)t_kind
]--;
3837 tree_node_sizes
[(int)t_kind
] -= sizeof (struct tree_type
);
3842 /* If this is a permanent type, record it for later reuse. */
3843 if (ggc_p
|| TREE_PERMANENT (type
))
3844 type_hash_add (hashcode
, type
);
3849 /* Mark ARG (which is really a struct type_hash **) for GC. */
3852 mark_type_hash (arg
)
3855 struct type_hash
*t
= *(struct type_hash
**) arg
;
3859 ggc_mark_tree (t
->type
);
3864 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3865 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3866 by adding the hash codes of the individual attributes. */
3869 attribute_hash_list (list
)
3872 register int hashcode
;
3874 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3875 /* ??? Do we want to add in TREE_VALUE too? */
3876 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3880 /* Given two lists of attributes, return true if list l2 is
3881 equivalent to l1. */
3884 attribute_list_equal (l1
, l2
)
3887 return attribute_list_contained (l1
, l2
)
3888 && attribute_list_contained (l2
, l1
);
3891 /* Given two lists of attributes, return true if list L2 is
3892 completely contained within L1. */
3893 /* ??? This would be faster if attribute names were stored in a canonicalized
3894 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3895 must be used to show these elements are equivalent (which they are). */
3896 /* ??? It's not clear that attributes with arguments will always be handled
3900 attribute_list_contained (l1
, l2
)
3903 register tree t1
, t2
;
3905 /* First check the obvious, maybe the lists are identical. */
3909 /* Maybe the lists are similar. */
3910 for (t1
= l1
, t2
= l2
;
3912 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3913 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3914 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3916 /* Maybe the lists are equal. */
3917 if (t1
== 0 && t2
== 0)
3920 for (; t2
; t2
= TREE_CHAIN (t2
))
3923 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3925 if (attr
== NULL_TREE
)
3927 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3934 /* Given two lists of types
3935 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3936 return 1 if the lists contain the same types in the same order.
3937 Also, the TREE_PURPOSEs must match. */
3940 type_list_equal (l1
, l2
)
3943 register tree t1
, t2
;
3945 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3946 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3947 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3948 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3949 && (TREE_TYPE (TREE_PURPOSE (t1
))
3950 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3956 /* Nonzero if integer constants T1 and T2
3957 represent the same constant value. */
3960 tree_int_cst_equal (t1
, t2
)
3965 if (t1
== 0 || t2
== 0)
3967 if (TREE_CODE (t1
) == INTEGER_CST
3968 && TREE_CODE (t2
) == INTEGER_CST
3969 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3970 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3975 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3976 The precise way of comparison depends on their data type. */
3979 tree_int_cst_lt (t1
, t2
)
3985 if (!TREE_UNSIGNED (TREE_TYPE (t1
)))
3986 return INT_CST_LT (t1
, t2
);
3987 return INT_CST_LT_UNSIGNED (t1
, t2
);
3990 /* Return an indication of the sign of the integer constant T.
3991 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3992 Note that -1 will never be returned it T's type is unsigned. */
3995 tree_int_cst_sgn (t
)
3998 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4000 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
4002 else if (TREE_INT_CST_HIGH (t
) < 0)
4008 /* Compare two constructor-element-type constants. Return 1 if the lists
4009 are known to be equal; otherwise return 0. */
4012 simple_cst_list_equal (l1
, l2
)
4015 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4017 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4020 l1
= TREE_CHAIN (l1
);
4021 l2
= TREE_CHAIN (l2
);
4027 /* Return truthvalue of whether T1 is the same tree structure as T2.
4028 Return 1 if they are the same.
4029 Return 0 if they are understandably different.
4030 Return -1 if either contains tree structure not understood by
4034 simple_cst_equal (t1
, t2
)
4037 register enum tree_code code1
, code2
;
4042 if (t1
== 0 || t2
== 0)
4045 code1
= TREE_CODE (t1
);
4046 code2
= TREE_CODE (t2
);
4048 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
4050 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4051 || code2
== NON_LVALUE_EXPR
)
4052 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4054 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
4056 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4057 || code2
== NON_LVALUE_EXPR
)
4058 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
4066 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4067 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
4070 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
4073 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
4074 && !bcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
4075 TREE_STRING_LENGTH (t1
));
4078 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
4084 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4087 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4090 return simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4093 /* Special case: if either target is an unallocated VAR_DECL,
4094 it means that it's going to be unified with whatever the
4095 TARGET_EXPR is really supposed to initialize, so treat it
4096 as being equivalent to anything. */
4097 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4098 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4099 && DECL_RTL (TREE_OPERAND (t1
, 0)) == 0)
4100 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4101 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4102 && DECL_RTL (TREE_OPERAND (t2
, 0)) == 0))
4105 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4108 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4110 case WITH_CLEANUP_EXPR
:
4111 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4114 return simple_cst_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
4117 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4118 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4131 /* This general rule works for most tree codes. All exceptions should be
4132 handled above. If this is a language-specific tree code, we can't
4133 trust what might be in the operand, so say we don't know
4135 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4138 switch (TREE_CODE_CLASS (code1
))
4148 for (i
=0; i
<tree_code_length
[(int) code1
]; ++i
)
4150 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4161 /* Constructors for pointer, array and function types.
4162 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4163 constructed by language-dependent code, not here.) */
4165 /* Construct, lay out and return the type of pointers to TO_TYPE.
4166 If such a type has already been constructed, reuse it. */
4169 build_pointer_type (to_type
)
4172 register tree t
= TYPE_POINTER_TO (to_type
);
4174 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4179 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4180 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4181 t
= make_node (POINTER_TYPE
);
4184 TREE_TYPE (t
) = to_type
;
4186 /* Record this type as the pointer to TO_TYPE. */
4187 TYPE_POINTER_TO (to_type
) = t
;
4189 /* Lay out the type. This function has many callers that are concerned
4190 with expression-construction, and this simplifies them all.
4191 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4197 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4198 MAXVAL should be the maximum value in the domain
4199 (one less than the length of the array).
4201 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4202 We don't enforce this limit, that is up to caller (e.g. language front end).
4203 The limit exists because the result is a signed type and we don't handle
4204 sizes that use more than one HOST_WIDE_INT. */
4207 build_index_type (maxval
)
4210 register tree itype
= make_node (INTEGER_TYPE
);
4212 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4213 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4215 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4216 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
4219 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4220 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4221 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4222 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4223 if (TREE_CODE (maxval
) == INTEGER_CST
)
4225 int maxint
= (int) TREE_INT_CST_LOW (maxval
);
4226 /* If the domain should be empty, make sure the maxval
4227 remains -1 and is not spoiled by truncation. */
4228 if (INT_CST_LT (maxval
, integer_zero_node
))
4230 TYPE_MAX_VALUE (itype
) = build_int_2 (-1, -1);
4231 TREE_TYPE (TYPE_MAX_VALUE (itype
)) = sizetype
;
4233 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4239 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4240 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4241 low bound LOWVAL and high bound HIGHVAL.
4242 if TYPE==NULL_TREE, sizetype is used. */
4245 build_range_type (type
, lowval
, highval
)
4246 tree type
, lowval
, highval
;
4248 register tree itype
= make_node (INTEGER_TYPE
);
4250 TREE_TYPE (itype
) = type
;
4251 if (type
== NULL_TREE
)
4254 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4255 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4256 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4259 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4260 TYPE_MODE (itype
) = TYPE_MODE (type
);
4261 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4262 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4263 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4264 if (TREE_CODE (lowval
) == INTEGER_CST
)
4266 HOST_WIDE_INT lowint
, highint
;
4269 lowint
= TREE_INT_CST_LOW (lowval
);
4270 if (highval
&& TREE_CODE (highval
) == INTEGER_CST
)
4271 highint
= TREE_INT_CST_LOW (highval
);
4273 highint
= (~(unsigned HOST_WIDE_INT
)0) >> 1;
4275 maxint
= (int) (highint
- lowint
);
4276 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4282 /* Just like build_index_type, but takes lowval and highval instead
4283 of just highval (maxval). */
4286 build_index_2_type (lowval
,highval
)
4287 tree lowval
, highval
;
4289 return build_range_type (NULL_TREE
, lowval
, highval
);
4292 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4293 Needed because when index types are not hashed, equal index types
4294 built at different times appear distinct, even though structurally,
4298 index_type_equal (itype1
, itype2
)
4299 tree itype1
, itype2
;
4301 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
4303 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
4305 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
4306 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
4307 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
4308 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
4310 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
4311 TYPE_MIN_VALUE (itype2
))
4312 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
4313 TYPE_MAX_VALUE (itype2
)))
4320 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4321 and number of elements specified by the range of values of INDEX_TYPE.
4322 If such a type has already been constructed, reuse it. */
4325 build_array_type (elt_type
, index_type
)
4326 tree elt_type
, index_type
;
4331 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4333 error ("arrays of functions are not meaningful");
4334 elt_type
= integer_type_node
;
4337 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4338 build_pointer_type (elt_type
);
4340 /* Allocate the array after the pointer type,
4341 in case we free it in type_hash_canon. */
4342 t
= make_node (ARRAY_TYPE
);
4343 TREE_TYPE (t
) = elt_type
;
4344 TYPE_DOMAIN (t
) = index_type
;
4346 if (index_type
== 0)
4351 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
4352 t
= type_hash_canon (hashcode
, t
);
4354 if (TYPE_SIZE (t
) == 0)
4359 /* Return the TYPE of the elements comprising
4360 the innermost dimension of ARRAY. */
4363 get_inner_array_type (array
)
4366 tree type
= TREE_TYPE (array
);
4368 while (TREE_CODE (type
) == ARRAY_TYPE
)
4369 type
= TREE_TYPE (type
);
4374 /* Construct, lay out and return
4375 the type of functions returning type VALUE_TYPE
4376 given arguments of types ARG_TYPES.
4377 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4378 are data type nodes for the arguments of the function.
4379 If such a type has already been constructed, reuse it. */
4382 build_function_type (value_type
, arg_types
)
4383 tree value_type
, arg_types
;
4388 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4390 error ("function return type cannot be function");
4391 value_type
= integer_type_node
;
4394 /* Make a node of the sort we want. */
4395 t
= make_node (FUNCTION_TYPE
);
4396 TREE_TYPE (t
) = value_type
;
4397 TYPE_ARG_TYPES (t
) = arg_types
;
4399 /* If we already have such a type, use the old one and free this one. */
4400 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
4401 t
= type_hash_canon (hashcode
, t
);
4403 if (TYPE_SIZE (t
) == 0)
4408 /* Build the node for the type of references-to-TO_TYPE. */
4411 build_reference_type (to_type
)
4414 register tree t
= TYPE_REFERENCE_TO (to_type
);
4416 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4421 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4422 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4423 t
= make_node (REFERENCE_TYPE
);
4426 TREE_TYPE (t
) = to_type
;
4428 /* Record this type as the pointer to TO_TYPE. */
4429 TYPE_REFERENCE_TO (to_type
) = t
;
4436 /* Construct, lay out and return the type of methods belonging to class
4437 BASETYPE and whose arguments and values are described by TYPE.
4438 If that type exists already, reuse it.
4439 TYPE must be a FUNCTION_TYPE node. */
4442 build_method_type (basetype
, type
)
4443 tree basetype
, type
;
4448 /* Make a node of the sort we want. */
4449 t
= make_node (METHOD_TYPE
);
4451 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4454 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4455 TREE_TYPE (t
) = TREE_TYPE (type
);
4457 /* The actual arglist for this function includes a "hidden" argument
4458 which is "this". Put it into the list of argument types. */
4461 = tree_cons (NULL_TREE
,
4462 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4464 /* If we already have such a type, use the old one and free this one. */
4465 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4466 t
= type_hash_canon (hashcode
, t
);
4468 if (TYPE_SIZE (t
) == 0)
4474 /* Construct, lay out and return the type of offsets to a value
4475 of type TYPE, within an object of type BASETYPE.
4476 If a suitable offset type exists already, reuse it. */
4479 build_offset_type (basetype
, type
)
4480 tree basetype
, type
;
4485 /* Make a node of the sort we want. */
4486 t
= make_node (OFFSET_TYPE
);
4488 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4489 TREE_TYPE (t
) = type
;
4491 /* If we already have such a type, use the old one and free this one. */
4492 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4493 t
= type_hash_canon (hashcode
, t
);
4495 if (TYPE_SIZE (t
) == 0)
4501 /* Create a complex type whose components are COMPONENT_TYPE. */
4504 build_complex_type (component_type
)
4505 tree component_type
;
4510 /* Make a node of the sort we want. */
4511 t
= make_node (COMPLEX_TYPE
);
4513 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4514 set_type_quals (t
, TYPE_QUALS (component_type
));
4516 /* If we already have such a type, use the old one and free this one. */
4517 hashcode
= TYPE_HASH (component_type
);
4518 t
= type_hash_canon (hashcode
, t
);
4520 if (TYPE_SIZE (t
) == 0)
4523 /* If we are writing Dwarf2 output we need to create a name,
4524 since complex is a fundamental type. */
4525 if (write_symbols
== DWARF2_DEBUG
&& ! TYPE_NAME (t
))
4528 if (component_type
== char_type_node
)
4529 name
= "complex char";
4530 else if (component_type
== signed_char_type_node
)
4531 name
= "complex signed char";
4532 else if (component_type
== unsigned_char_type_node
)
4533 name
= "complex unsigned char";
4534 else if (component_type
== short_integer_type_node
)
4535 name
= "complex short int";
4536 else if (component_type
== short_unsigned_type_node
)
4537 name
= "complex short unsigned int";
4538 else if (component_type
== integer_type_node
)
4539 name
= "complex int";
4540 else if (component_type
== unsigned_type_node
)
4541 name
= "complex unsigned int";
4542 else if (component_type
== long_integer_type_node
)
4543 name
= "complex long int";
4544 else if (component_type
== long_unsigned_type_node
)
4545 name
= "complex long unsigned int";
4546 else if (component_type
== long_long_integer_type_node
)
4547 name
= "complex long long int";
4548 else if (component_type
== long_long_unsigned_type_node
)
4549 name
= "complex long long unsigned int";
4554 TYPE_NAME (t
) = get_identifier (name
);
4560 /* Return OP, stripped of any conversions to wider types as much as is safe.
4561 Converting the value back to OP's type makes a value equivalent to OP.
4563 If FOR_TYPE is nonzero, we return a value which, if converted to
4564 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4566 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4567 narrowest type that can hold the value, even if they don't exactly fit.
4568 Otherwise, bit-field references are changed to a narrower type
4569 only if they can be fetched directly from memory in that type.
4571 OP must have integer, real or enumeral type. Pointers are not allowed!
4573 There are some cases where the obvious value we could return
4574 would regenerate to OP if converted to OP's type,
4575 but would not extend like OP to wider types.
4576 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4577 For example, if OP is (unsigned short)(signed char)-1,
4578 we avoid returning (signed char)-1 if FOR_TYPE is int,
4579 even though extending that to an unsigned short would regenerate OP,
4580 since the result of extending (signed char)-1 to (int)
4581 is different from (int) OP. */
4584 get_unwidened (op
, for_type
)
4588 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4589 register tree type
= TREE_TYPE (op
);
4590 register unsigned final_prec
4591 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4593 = (for_type
!= 0 && for_type
!= type
4594 && final_prec
> TYPE_PRECISION (type
)
4595 && TREE_UNSIGNED (type
));
4596 register tree win
= op
;
4598 while (TREE_CODE (op
) == NOP_EXPR
)
4600 register int bitschange
4601 = TYPE_PRECISION (TREE_TYPE (op
))
4602 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4604 /* Truncations are many-one so cannot be removed.
4605 Unless we are later going to truncate down even farther. */
4607 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4610 /* See what's inside this conversion. If we decide to strip it,
4612 op
= TREE_OPERAND (op
, 0);
4614 /* If we have not stripped any zero-extensions (uns is 0),
4615 we can strip any kind of extension.
4616 If we have previously stripped a zero-extension,
4617 only zero-extensions can safely be stripped.
4618 Any extension can be stripped if the bits it would produce
4619 are all going to be discarded later by truncating to FOR_TYPE. */
4623 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4625 /* TREE_UNSIGNED says whether this is a zero-extension.
4626 Let's avoid computing it if it does not affect WIN
4627 and if UNS will not be needed again. */
4628 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4629 && TREE_UNSIGNED (TREE_TYPE (op
)))
4637 if (TREE_CODE (op
) == COMPONENT_REF
4638 /* Since type_for_size always gives an integer type. */
4639 && TREE_CODE (type
) != REAL_TYPE
4640 /* Don't crash if field not laid out yet. */
4641 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4643 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4644 type
= type_for_size (innerprec
, TREE_UNSIGNED (TREE_OPERAND (op
, 1)));
4646 /* We can get this structure field in the narrowest type it fits in.
4647 If FOR_TYPE is 0, do this only for a field that matches the
4648 narrower type exactly and is aligned for it
4649 The resulting extension to its nominal type (a fullword type)
4650 must fit the same conditions as for other extensions. */
4652 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4653 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4654 && (! uns
|| final_prec
<= innerprec
4655 || TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4658 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4659 TREE_OPERAND (op
, 1));
4660 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4661 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4662 TREE_RAISES (win
) = TREE_RAISES (op
);
4668 /* Return OP or a simpler expression for a narrower value
4669 which can be sign-extended or zero-extended to give back OP.
4670 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4671 or 0 if the value should be sign-extended. */
4674 get_narrower (op
, unsignedp_ptr
)
4678 register int uns
= 0;
4680 register tree win
= op
;
4682 while (TREE_CODE (op
) == NOP_EXPR
)
4684 register int bitschange
4685 = TYPE_PRECISION (TREE_TYPE (op
))
4686 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4688 /* Truncations are many-one so cannot be removed. */
4692 /* See what's inside this conversion. If we decide to strip it,
4694 op
= TREE_OPERAND (op
, 0);
4698 /* An extension: the outermost one can be stripped,
4699 but remember whether it is zero or sign extension. */
4701 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4702 /* Otherwise, if a sign extension has been stripped,
4703 only sign extensions can now be stripped;
4704 if a zero extension has been stripped, only zero-extensions. */
4705 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4709 else /* bitschange == 0 */
4711 /* A change in nominal type can always be stripped, but we must
4712 preserve the unsignedness. */
4714 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4721 if (TREE_CODE (op
) == COMPONENT_REF
4722 /* Since type_for_size always gives an integer type. */
4723 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
)
4725 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4726 tree type
= type_for_size (innerprec
, TREE_UNSIGNED (op
));
4728 /* We can get this structure field in a narrower type that fits it,
4729 but the resulting extension to its nominal type (a fullword type)
4730 must satisfy the same conditions as for other extensions.
4732 Do this only for fields that are aligned (not bit-fields),
4733 because when bit-field insns will be used there is no
4734 advantage in doing this. */
4736 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4737 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4738 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4742 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4743 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4744 TREE_OPERAND (op
, 1));
4745 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4746 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4747 TREE_RAISES (win
) = TREE_RAISES (op
);
4750 *unsignedp_ptr
= uns
;
4754 /* Nonzero if integer constant C has a value that is permissible
4755 for type TYPE (an INTEGER_TYPE). */
4758 int_fits_type_p (c
, type
)
4761 if (TREE_UNSIGNED (type
))
4762 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4763 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
))
4764 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4765 && INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
)))
4766 /* Negative ints never fit unsigned types. */
4767 && ! (TREE_INT_CST_HIGH (c
) < 0
4768 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4770 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4771 && INT_CST_LT (TYPE_MAX_VALUE (type
), c
))
4772 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4773 && INT_CST_LT (c
, TYPE_MIN_VALUE (type
)))
4774 /* Unsigned ints with top bit set never fit signed types. */
4775 && ! (TREE_INT_CST_HIGH (c
) < 0
4776 && TREE_UNSIGNED (TREE_TYPE (c
))));
4779 /* Given a DECL or TYPE, return the scope in which it was declared, or
4780 NUL_TREE if there is no containing scope. */
4783 get_containing_scope (t
)
4786 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4789 /* Return the innermost context enclosing DECL that is
4790 a FUNCTION_DECL, or zero if none. */
4793 decl_function_context (decl
)
4798 if (TREE_CODE (decl
) == ERROR_MARK
)
4801 if (TREE_CODE (decl
) == SAVE_EXPR
)
4802 context
= SAVE_EXPR_CONTEXT (decl
);
4804 context
= DECL_CONTEXT (decl
);
4806 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4808 if (TREE_CODE (context
) == BLOCK
)
4809 context
= BLOCK_SUPERCONTEXT (context
);
4811 context
= get_containing_scope (context
);
4817 /* Return the innermost context enclosing DECL that is
4818 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4819 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4822 decl_type_context (decl
)
4825 tree context
= DECL_CONTEXT (decl
);
4829 if (TREE_CODE (context
) == RECORD_TYPE
4830 || TREE_CODE (context
) == UNION_TYPE
4831 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4833 if (TREE_CODE (context
) == TYPE_DECL
4834 || TREE_CODE (context
) == FUNCTION_DECL
)
4835 context
= DECL_CONTEXT (context
);
4836 else if (TREE_CODE (context
) == BLOCK
)
4837 context
= BLOCK_SUPERCONTEXT (context
);
4839 /* Unhandled CONTEXT!? */
4845 /* CALL is a CALL_EXPR. Return the declaration for the function
4846 called, or NULL_TREE if the called function cannot be
4850 get_callee_fndecl (call
)
4855 /* It's invalid to call this function with anything but a
4857 if (TREE_CODE (call
) != CALL_EXPR
)
4860 /* The first operand to the CALL is the address of the function
4862 addr
= TREE_OPERAND (call
, 0);
4864 /* If the address is just `&f' for some function `f', then we know
4865 that `f' is being called. */
4866 if (TREE_CODE (addr
) == ADDR_EXPR
4867 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4868 return TREE_OPERAND (addr
, 0);
4870 /* We couldn't figure out what was being called. */
4874 /* Print debugging information about the obstack O, named STR. */
4877 print_obstack_statistics (str
, o
)
4881 struct _obstack_chunk
*chunk
= o
->chunk
;
4885 n_alloc
+= o
->next_free
- chunk
->contents
;
4886 chunk
= chunk
->prev
;
4890 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4891 chunk
= chunk
->prev
;
4893 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4894 str
, n_alloc
, n_chunks
);
4897 /* Print debugging information about tree nodes generated during the compile,
4898 and any language-specific information. */
4901 dump_tree_statistics ()
4903 #ifdef GATHER_STATISTICS
4905 int total_nodes
, total_bytes
;
4908 fprintf (stderr
, "\n??? tree nodes created\n\n");
4909 #ifdef GATHER_STATISTICS
4910 fprintf (stderr
, "Kind Nodes Bytes\n");
4911 fprintf (stderr
, "-------------------------------------\n");
4912 total_nodes
= total_bytes
= 0;
4913 for (i
= 0; i
< (int) all_kinds
; i
++)
4915 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4916 tree_node_counts
[i
], tree_node_sizes
[i
]);
4917 total_nodes
+= tree_node_counts
[i
];
4918 total_bytes
+= tree_node_sizes
[i
];
4920 fprintf (stderr
, "%-20s %9d\n", "identifier names", id_string_size
);
4921 fprintf (stderr
, "-------------------------------------\n");
4922 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4923 fprintf (stderr
, "-------------------------------------\n");
4925 fprintf (stderr
, "(No per-node statistics)\n");
4927 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
4928 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack
);
4929 print_obstack_statistics ("temporary_obstack", &temporary_obstack
);
4930 print_obstack_statistics ("momentary_obstack", &momentary_obstack
);
4931 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack
);
4932 print_lang_statistics ();
4935 #define FILE_FUNCTION_PREFIX_LEN 9
4937 #ifndef NO_DOLLAR_IN_LABEL
4938 #define FILE_FUNCTION_FORMAT "_GLOBAL_$%s$%s"
4939 #else /* NO_DOLLAR_IN_LABEL */
4940 #ifndef NO_DOT_IN_LABEL
4941 #define FILE_FUNCTION_FORMAT "_GLOBAL_.%s.%s"
4942 #else /* NO_DOT_IN_LABEL */
4943 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4944 #endif /* NO_DOT_IN_LABEL */
4945 #endif /* NO_DOLLAR_IN_LABEL */
4947 extern char * first_global_object_name
;
4948 extern char * weak_global_object_name
;
4950 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4951 clashes in cases where we can't reliably choose a unique name.
4953 Derived from mkstemp.c in libiberty. */
4956 append_random_chars (template)
4959 static const char letters
[]
4960 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4961 static unsigned HOST_WIDE_INT value
;
4962 unsigned HOST_WIDE_INT v
;
4964 #ifdef HAVE_GETTIMEOFDAY
4968 template += strlen (template);
4970 #ifdef HAVE_GETTIMEOFDAY
4971 /* Get some more or less random data. */
4972 gettimeofday (&tv
, NULL
);
4973 value
+= ((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16) ^ tv
.tv_sec
^ getpid ();
4980 /* Fill in the random bits. */
4981 template[0] = letters
[v
% 62];
4983 template[1] = letters
[v
% 62];
4985 template[2] = letters
[v
% 62];
4987 template[3] = letters
[v
% 62];
4989 template[4] = letters
[v
% 62];
4991 template[5] = letters
[v
% 62];
4996 /* Generate a name for a function unique to this translation unit.
4997 TYPE is some string to identify the purpose of this function to the
4998 linker or collect2. */
5001 get_file_function_name_long (type
)
5007 if (first_global_object_name
)
5008 p
= first_global_object_name
;
5011 /* We don't have anything that we know to be unique to this translation
5012 unit, so use what we do have and throw in some randomness. */
5014 const char *name
= weak_global_object_name
;
5015 const char *file
= main_input_filename
;
5020 file
= input_filename
;
5022 p
= (char *) alloca (7 + strlen (name
) + strlen (file
));
5024 sprintf (p
, "%s%s", name
, file
);
5025 append_random_chars (p
);
5028 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
5031 /* Set up the name of the file-level functions we may need. */
5032 /* Use a global object (which is already required to be unique over
5033 the program) rather than the file name (which imposes extra
5034 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
5035 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5037 /* Don't need to pull weird characters out of global names. */
5038 if (p
!= first_global_object_name
)
5040 for (p
= buf
+11; *p
; p
++)
5042 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
5043 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
5047 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5050 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5058 return get_identifier (buf
);
5061 /* If KIND=='I', return a suitable global initializer (constructor) name.
5062 If KIND=='D', return a suitable global clean-up (destructor) name. */
5065 get_file_function_name (kind
)
5072 return get_file_function_name_long (p
);
5076 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5077 The result is placed in BUFFER (which has length BIT_SIZE),
5078 with one bit in each char ('\000' or '\001').
5080 If the constructor is constant, NULL_TREE is returned.
5081 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5084 get_set_constructor_bits (init
, buffer
, bit_size
)
5091 HOST_WIDE_INT domain_min
5092 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))));
5093 tree non_const_bits
= NULL_TREE
;
5094 for (i
= 0; i
< bit_size
; i
++)
5097 for (vals
= TREE_OPERAND (init
, 1);
5098 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5100 if (TREE_CODE (TREE_VALUE (vals
)) != INTEGER_CST
5101 || (TREE_PURPOSE (vals
) != NULL_TREE
5102 && TREE_CODE (TREE_PURPOSE (vals
)) != INTEGER_CST
))
5104 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5105 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5107 /* Set a range of bits to ones. */
5108 HOST_WIDE_INT lo_index
5109 = TREE_INT_CST_LOW (TREE_PURPOSE (vals
)) - domain_min
;
5110 HOST_WIDE_INT hi_index
5111 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
5112 if (lo_index
< 0 || lo_index
>= bit_size
5113 || hi_index
< 0 || hi_index
>= bit_size
)
5115 for ( ; lo_index
<= hi_index
; lo_index
++)
5116 buffer
[lo_index
] = 1;
5120 /* Set a single bit to one. */
5122 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
5123 if (index
< 0 || index
>= bit_size
)
5125 error ("invalid initializer for bit string");
5131 return non_const_bits
;
5134 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5135 The result is placed in BUFFER (which is an array of bytes).
5136 If the constructor is constant, NULL_TREE is returned.
5137 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5140 get_set_constructor_bytes (init
, buffer
, wd_size
)
5142 unsigned char *buffer
;
5146 int set_word_size
= BITS_PER_UNIT
;
5147 int bit_size
= wd_size
* set_word_size
;
5149 unsigned char *bytep
= buffer
;
5150 char *bit_buffer
= (char *) alloca(bit_size
);
5151 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5153 for (i
= 0; i
< wd_size
; i
++)
5156 for (i
= 0; i
< bit_size
; i
++)
5160 if (BYTES_BIG_ENDIAN
)
5161 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5163 *bytep
|= 1 << bit_pos
;
5166 if (bit_pos
>= set_word_size
)
5167 bit_pos
= 0, bytep
++;
5169 return non_const_bits
;
5172 #if defined ENABLE_CHECKING && (GCC_VERSION >= 2007)
5173 /* Complain that the tree code of NODE does not match the expected CODE.
5174 FILE, LINE, and FUNCTION are of the caller. */
5176 tree_check_failed (node
, code
, file
, line
, function
)
5178 enum tree_code code
;
5181 const char *function
;
5183 error ("Tree check: expected %s, have %s",
5184 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)]);
5185 fancy_abort (file
, line
, function
);
5188 /* Similar to above, except that we check for a class of tree
5189 code, given in CL. */
5191 tree_class_check_failed (node
, cl
, file
, line
, function
)
5196 const char *function
;
5198 error ("Tree check: expected class '%c', have '%c' (%s)",
5199 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
5200 tree_code_name
[TREE_CODE (node
)]);
5201 fancy_abort (file
, line
, function
);
5204 #endif /* ENABLE_CHECKING */
5206 /* Return the alias set for T, which may be either a type or an
5213 if (!flag_strict_aliasing
|| !lang_get_alias_set
)
5214 /* If we're not doing any lanaguage-specific alias analysis, just
5215 assume everything aliases everything else. */
5218 return (*lang_get_alias_set
) (t
);
5221 /* Return a brand-new alias set. */
5226 static int last_alias_set
;
5227 if (flag_strict_aliasing
)
5228 return ++last_alias_set
;
5233 #ifndef CHAR_TYPE_SIZE
5234 #define CHAR_TYPE_SIZE BITS_PER_UNIT
5237 #ifndef SHORT_TYPE_SIZE
5238 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
5241 #ifndef INT_TYPE_SIZE
5242 #define INT_TYPE_SIZE BITS_PER_WORD
5245 #ifndef LONG_TYPE_SIZE
5246 #define LONG_TYPE_SIZE BITS_PER_WORD
5249 #ifndef LONG_LONG_TYPE_SIZE
5250 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
5253 #ifndef FLOAT_TYPE_SIZE
5254 #define FLOAT_TYPE_SIZE BITS_PER_WORD
5257 #ifndef DOUBLE_TYPE_SIZE
5258 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5261 #ifndef LONG_DOUBLE_TYPE_SIZE
5262 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5265 /* Create nodes for all integer types (and error_mark_node) using the sizes
5266 of C datatypes. The caller should call set_sizetype soon after calling
5267 this function to select one of the types as sizetype. */
5270 build_common_tree_nodes (signed_char
)
5273 error_mark_node
= make_node (ERROR_MARK
);
5274 TREE_TYPE (error_mark_node
) = error_mark_node
;
5276 /* Define both `signed char' and `unsigned char'. */
5277 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5278 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5280 /* Define `char', which is like either `signed char' or `unsigned char'
5281 but not the same as either. */
5284 ? make_signed_type (CHAR_TYPE_SIZE
)
5285 : make_unsigned_type (CHAR_TYPE_SIZE
));
5287 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5288 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5289 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5290 /* Define an unsigned integer first. make_unsigned_type and make_signed_type
5291 both call set_sizetype for the first type that we create, and we want this
5292 to be large enough to hold the sizes of various types until we switch to
5293 the real sizetype. */
5294 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5295 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5296 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5297 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5298 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5300 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5301 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5302 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5303 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5304 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5306 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5307 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5308 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5309 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5310 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5313 /* For type TYPE, fill in the proper type for TYPE_SIZE and
5319 TREE_TYPE (TYPE_SIZE (type
)) = bitsizetype
;
5320 TREE_TYPE (TYPE_SIZE_UNIT (type
)) = sizetype
;
5323 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5324 It will fix the previously made nodes to have proper references to
5325 sizetype, and it will create several other common tree nodes. */
5327 build_common_tree_nodes_2 (short_double
)
5330 fix_sizetype (signed_char_type_node
);
5331 fix_sizetype (unsigned_char_type_node
);
5332 fix_sizetype (char_type_node
);
5333 fix_sizetype (short_integer_type_node
);
5334 fix_sizetype (short_unsigned_type_node
);
5335 fix_sizetype (integer_type_node
);
5336 fix_sizetype (unsigned_type_node
);
5337 fix_sizetype (long_unsigned_type_node
);
5338 fix_sizetype (long_integer_type_node
);
5339 fix_sizetype (long_long_integer_type_node
);
5340 fix_sizetype (long_long_unsigned_type_node
);
5342 fix_sizetype (intQI_type_node
);
5343 fix_sizetype (intHI_type_node
);
5344 fix_sizetype (intSI_type_node
);
5345 fix_sizetype (intDI_type_node
);
5346 fix_sizetype (intTI_type_node
);
5347 fix_sizetype (unsigned_intQI_type_node
);
5348 fix_sizetype (unsigned_intHI_type_node
);
5349 fix_sizetype (unsigned_intSI_type_node
);
5350 fix_sizetype (unsigned_intDI_type_node
);
5351 fix_sizetype (unsigned_intTI_type_node
);
5353 integer_zero_node
= build_int_2 (0, 0);
5354 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5355 integer_one_node
= build_int_2 (1, 0);
5356 TREE_TYPE (integer_one_node
) = integer_type_node
;
5358 size_zero_node
= build_int_2 (0, 0);
5359 TREE_TYPE (size_zero_node
) = sizetype
;
5360 size_one_node
= build_int_2 (1, 0);
5361 TREE_TYPE (size_one_node
) = sizetype
;
5363 void_type_node
= make_node (VOID_TYPE
);
5364 layout_type (void_type_node
); /* Uses size_zero_node */
5365 /* We are not going to have real types in C with less than byte alignment,
5366 so we might as well not have any types that claim to have it. */
5367 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5369 null_pointer_node
= build_int_2 (0, 0);
5370 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5371 layout_type (TREE_TYPE (null_pointer_node
));
5373 ptr_type_node
= build_pointer_type (void_type_node
);
5375 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5377 float_type_node
= make_node (REAL_TYPE
);
5378 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5379 layout_type (float_type_node
);
5381 double_type_node
= make_node (REAL_TYPE
);
5383 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5385 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5386 layout_type (double_type_node
);
5388 long_double_type_node
= make_node (REAL_TYPE
);
5389 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5390 layout_type (long_double_type_node
);
5392 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5393 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5394 layout_type (complex_integer_type_node
);
5396 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5397 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5398 layout_type (complex_float_type_node
);
5400 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5401 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5402 layout_type (complex_double_type_node
);
5404 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5405 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5406 layout_type (complex_long_double_type_node
);
5408 #ifdef BUILD_VA_LIST_TYPE
5409 BUILD_VA_LIST_TYPE(va_list_type_node
);
5411 va_list_type_node
= ptr_type_node
;