1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
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. */
34 #include "coretypes.h"
47 #include "langhooks.h"
49 /* obstack.[ch] explicitly declined to prototype this. */
50 extern int _obstack_allocated_p (struct obstack *h, void *obj);
52 #ifdef GATHER_STATISTICS
53 /* Statistics-gathering stuff. */
55 int tree_node_counts[(int) all_kinds];
56 int tree_node_sizes[(int) all_kinds];
58 /* Keep in sync with tree.h:enum tree_node_kind. */
59 static const char * const tree_node_kind_names[] = {
75 #endif /* GATHER_STATISTICS */
77 /* Unique id for next decl created. */
78 static GTY(()) int next_decl_uid;
79 /* Unique id for next type created. */
80 static GTY(()) int next_type_uid = 1;
82 /* Since we cannot rehash a type after it is in the table, we have to
83 keep the hash code. */
85 struct type_hash GTY(())
91 /* Initial size of the hash table (rounded to next prime). */
92 #define TYPE_HASH_INITIAL_SIZE 1000
94 /* Now here is the hash table. When recording a type, it is added to
95 the slot whose index is the hash code. Note that the hash table is
96 used for several kinds of types (function types, array types and
97 array index range types, for now). While all these live in the
98 same table, they are completely independent, and the hash code is
99 computed differently for each of these. */
101 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
102 htab_t type_hash_table;
104 static void set_type_quals (tree, int);
105 static int type_hash_eq (const void *, const void *);
106 static hashval_t type_hash_hash (const void *);
107 static void print_type_hash_statistics (void);
108 static void finish_vector_type (tree);
109 static int type_hash_marked_p (const void *);
110 static unsigned int type_hash_list (tree, hashval_t);
111 static unsigned int attribute_hash_list (tree, hashval_t);
113 tree global_trees[TI_MAX];
114 tree integer_types[itk_none];
121 /* Initialize the hash table of types. */
122 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
127 /* The name of the object as the assembler will see it (but before any
128 translations made by ASM_OUTPUT_LABELREF). Often this is the same
129 as DECL_NAME. It is an IDENTIFIER_NODE. */
131 decl_assembler_name (tree decl)
133 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
134 lang_hooks.set_decl_assembler_name (decl);
135 return DECL_CHECK (decl)->decl.assembler_name;
138 /* Compute the number of bytes occupied by 'node'. This routine only
139 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
141 tree_size (tree node)
143 enum tree_code code = TREE_CODE (node);
145 switch (TREE_CODE_CLASS (code))
147 case 'd': /* A decl node */
148 return sizeof (struct tree_decl);
150 case 't': /* a type node */
151 return sizeof (struct tree_type);
153 case 'b': /* a lexical block node */
154 return sizeof (struct tree_block);
156 case 'r': /* a reference */
157 case 'e': /* an expression */
158 case 's': /* an expression with side effects */
159 case '<': /* a comparison expression */
160 case '1': /* a unary arithmetic expression */
161 case '2': /* a binary arithmetic expression */
162 return (sizeof (struct tree_exp)
163 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
165 case 'c': /* a constant */
168 case INTEGER_CST: return sizeof (struct tree_int_cst);
169 case REAL_CST: return sizeof (struct tree_real_cst);
170 case COMPLEX_CST: return sizeof (struct tree_complex);
171 case VECTOR_CST: return sizeof (struct tree_vector);
172 case STRING_CST: return sizeof (struct tree_string);
174 return lang_hooks.tree_size (code);
177 case 'x': /* something random, like an identifier. */
180 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
181 case TREE_LIST: return sizeof (struct tree_list);
182 case TREE_VEC: return (sizeof (struct tree_vec)
183 + TREE_VEC_LENGTH(node) * sizeof(char *)
187 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
190 return lang_hooks.tree_size (code);
198 /* Return a newly allocated node of code CODE.
199 For decl and type nodes, some other fields are initialized.
200 The rest of the node is initialized to zero.
202 Achoo! I got a code in the node. */
205 make_node_stat (enum tree_code code MEM_STAT_DECL)
208 int type = TREE_CODE_CLASS (code);
210 #ifdef GATHER_STATISTICS
213 struct tree_common ttmp;
215 /* We can't allocate a TREE_VEC without knowing how many elements
217 if (code == TREE_VEC)
220 TREE_SET_CODE ((tree)&ttmp, code);
221 length = tree_size ((tree)&ttmp);
223 #ifdef GATHER_STATISTICS
226 case 'd': /* A decl node */
230 case 't': /* a type node */
234 case 'b': /* a lexical block */
238 case 's': /* an expression with side effects */
242 case 'r': /* a reference */
246 case 'e': /* an expression */
247 case '<': /* a comparison expression */
248 case '1': /* a unary arithmetic expression */
249 case '2': /* a binary arithmetic expression */
253 case 'c': /* a constant */
257 case 'x': /* something random, like an identifier. */
258 if (code == IDENTIFIER_NODE)
260 else if (code == TREE_VEC)
270 tree_node_counts[(int) kind]++;
271 tree_node_sizes[(int) kind] += length;
274 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
276 memset (t, 0, length);
278 TREE_SET_CODE (t, code);
283 TREE_SIDE_EFFECTS (t) = 1;
287 if (code != FUNCTION_DECL)
289 DECL_USER_ALIGN (t) = 0;
290 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
291 DECL_SOURCE_LOCATION (t) = input_location;
292 DECL_UID (t) = next_decl_uid++;
294 /* We have not yet computed the alias set for this declaration. */
295 DECL_POINTER_ALIAS_SET (t) = -1;
299 TYPE_UID (t) = next_type_uid++;
300 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
301 TYPE_USER_ALIGN (t) = 0;
302 TYPE_MAIN_VARIANT (t) = t;
304 /* Default to no attributes for type, but let target change that. */
305 TYPE_ATTRIBUTES (t) = NULL_TREE;
306 targetm.set_default_type_attributes (t);
308 /* We have not yet computed the alias set for this type. */
309 TYPE_ALIAS_SET (t) = -1;
313 TREE_CONSTANT (t) = 1;
323 case PREDECREMENT_EXPR:
324 case PREINCREMENT_EXPR:
325 case POSTDECREMENT_EXPR:
326 case POSTINCREMENT_EXPR:
327 /* All of these have side-effects, no matter what their
329 TREE_SIDE_EFFECTS (t) = 1;
341 /* Return a new node with the same contents as NODE except that its
342 TREE_CHAIN is zero and it has a fresh uid. */
345 copy_node_stat (tree node MEM_STAT_DECL)
348 enum tree_code code = TREE_CODE (node);
351 length = tree_size (node);
352 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
353 memcpy (t, node, length);
356 TREE_ASM_WRITTEN (t) = 0;
358 if (TREE_CODE_CLASS (code) == 'd')
359 DECL_UID (t) = next_decl_uid++;
360 else if (TREE_CODE_CLASS (code) == 't')
362 TYPE_UID (t) = next_type_uid++;
363 /* The following is so that the debug code for
364 the copy is different from the original type.
365 The two statements usually duplicate each other
366 (because they clear fields of the same union),
367 but the optimizer should catch that. */
368 TYPE_SYMTAB_POINTER (t) = 0;
369 TYPE_SYMTAB_ADDRESS (t) = 0;
375 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
376 For example, this can copy a list made of TREE_LIST nodes. */
379 copy_list (tree list)
387 head = prev = copy_node (list);
388 next = TREE_CHAIN (list);
391 TREE_CHAIN (prev) = copy_node (next);
392 prev = TREE_CHAIN (prev);
393 next = TREE_CHAIN (next);
399 /* Return a newly constructed INTEGER_CST node whose constant value
400 is specified by the two ints LOW and HI.
401 The TREE_TYPE is set to `int'.
403 This function should be used via the `build_int_2' macro. */
406 build_int_2_wide (unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
408 tree t = make_node (INTEGER_CST);
410 TREE_INT_CST_LOW (t) = low;
411 TREE_INT_CST_HIGH (t) = hi;
412 TREE_TYPE (t) = integer_type_node;
416 /* Return a new VECTOR_CST node whose type is TYPE and whose values
417 are in a list pointed by VALS. */
420 build_vector (tree type, tree vals)
422 tree v = make_node (VECTOR_CST);
423 int over1 = 0, over2 = 0;
426 TREE_VECTOR_CST_ELTS (v) = vals;
427 TREE_TYPE (v) = type;
429 /* Iterate through elements and check for overflow. */
430 for (link = vals; link; link = TREE_CHAIN (link))
432 tree value = TREE_VALUE (link);
434 over1 |= TREE_OVERFLOW (value);
435 over2 |= TREE_CONSTANT_OVERFLOW (value);
438 TREE_OVERFLOW (v) = over1;
439 TREE_CONSTANT_OVERFLOW (v) = over2;
444 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
445 are in a list pointed to by VALS. */
447 build_constructor (tree type, tree vals)
449 tree c = make_node (CONSTRUCTOR);
450 TREE_TYPE (c) = type;
451 CONSTRUCTOR_ELTS (c) = vals;
453 /* ??? May not be necessary. Mirrors what build does. */
456 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
457 TREE_READONLY (c) = TREE_READONLY (vals);
458 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
461 TREE_CONSTANT (c) = 0; /* safe side */
466 /* Return a new REAL_CST node whose type is TYPE and value is D. */
469 build_real (tree type, REAL_VALUE_TYPE d)
475 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
476 Consider doing it via real_convert now. */
478 v = make_node (REAL_CST);
479 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
480 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
482 TREE_TYPE (v) = type;
483 TREE_REAL_CST_PTR (v) = dp;
484 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
488 /* Return a new REAL_CST node whose type is TYPE
489 and whose value is the integer value of the INTEGER_CST node I. */
492 real_value_from_int_cst (tree type, tree i)
496 /* Clear all bits of the real value type so that we can later do
497 bitwise comparisons to see if two values are the same. */
498 memset (&d, 0, sizeof d);
500 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
501 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
502 TYPE_UNSIGNED (TREE_TYPE (i)));
506 /* Given a tree representing an integer constant I, return a tree
507 representing the same value as a floating-point constant of type TYPE. */
510 build_real_from_int_cst (tree type, tree i)
513 int overflow = TREE_OVERFLOW (i);
515 v = build_real (type, real_value_from_int_cst (type, i));
517 TREE_OVERFLOW (v) |= overflow;
518 TREE_CONSTANT_OVERFLOW (v) |= overflow;
522 /* Return a newly constructed STRING_CST node whose value is
523 the LEN characters at STR.
524 The TREE_TYPE is not initialized. */
527 build_string (int len, const char *str)
529 tree s = make_node (STRING_CST);
531 TREE_STRING_LENGTH (s) = len;
532 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
537 /* Return a newly constructed COMPLEX_CST node whose value is
538 specified by the real and imaginary parts REAL and IMAG.
539 Both REAL and IMAG should be constant nodes. TYPE, if specified,
540 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
543 build_complex (tree type, tree real, tree imag)
545 tree t = make_node (COMPLEX_CST);
547 TREE_REALPART (t) = real;
548 TREE_IMAGPART (t) = imag;
549 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
550 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
551 TREE_CONSTANT_OVERFLOW (t)
552 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
556 /* Build a newly constructed TREE_VEC node of length LEN. */
559 make_tree_vec_stat (int len MEM_STAT_DECL)
562 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
564 #ifdef GATHER_STATISTICS
565 tree_node_counts[(int) vec_kind]++;
566 tree_node_sizes[(int) vec_kind] += length;
569 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
571 memset (t, 0, length);
573 TREE_SET_CODE (t, TREE_VEC);
574 TREE_VEC_LENGTH (t) = len;
579 /* Return 1 if EXPR is the integer constant zero or a complex constant
583 integer_zerop (tree expr)
587 return ((TREE_CODE (expr) == INTEGER_CST
588 && ! TREE_CONSTANT_OVERFLOW (expr)
589 && TREE_INT_CST_LOW (expr) == 0
590 && TREE_INT_CST_HIGH (expr) == 0)
591 || (TREE_CODE (expr) == COMPLEX_CST
592 && integer_zerop (TREE_REALPART (expr))
593 && integer_zerop (TREE_IMAGPART (expr))));
596 /* Return 1 if EXPR is the integer constant one or the corresponding
600 integer_onep (tree expr)
604 return ((TREE_CODE (expr) == INTEGER_CST
605 && ! TREE_CONSTANT_OVERFLOW (expr)
606 && TREE_INT_CST_LOW (expr) == 1
607 && TREE_INT_CST_HIGH (expr) == 0)
608 || (TREE_CODE (expr) == COMPLEX_CST
609 && integer_onep (TREE_REALPART (expr))
610 && integer_zerop (TREE_IMAGPART (expr))));
613 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
614 it contains. Likewise for the corresponding complex constant. */
617 integer_all_onesp (tree expr)
624 if (TREE_CODE (expr) == COMPLEX_CST
625 && integer_all_onesp (TREE_REALPART (expr))
626 && integer_zerop (TREE_IMAGPART (expr)))
629 else if (TREE_CODE (expr) != INTEGER_CST
630 || TREE_CONSTANT_OVERFLOW (expr))
633 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
635 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
636 && TREE_INT_CST_HIGH (expr) == -1);
638 /* Note that using TYPE_PRECISION here is wrong. We care about the
639 actual bits, not the (arbitrary) range of the type. */
640 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
641 if (prec >= HOST_BITS_PER_WIDE_INT)
643 HOST_WIDE_INT high_value;
646 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
648 if (shift_amount > HOST_BITS_PER_WIDE_INT)
649 /* Can not handle precisions greater than twice the host int size. */
651 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
652 /* Shifting by the host word size is undefined according to the ANSI
653 standard, so we must handle this as a special case. */
656 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
658 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
659 && TREE_INT_CST_HIGH (expr) == high_value);
662 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
665 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
669 integer_pow2p (tree expr)
672 HOST_WIDE_INT high, low;
676 if (TREE_CODE (expr) == COMPLEX_CST
677 && integer_pow2p (TREE_REALPART (expr))
678 && integer_zerop (TREE_IMAGPART (expr)))
681 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
684 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
685 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
686 high = TREE_INT_CST_HIGH (expr);
687 low = TREE_INT_CST_LOW (expr);
689 /* First clear all bits that are beyond the type's precision in case
690 we've been sign extended. */
692 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
694 else if (prec > HOST_BITS_PER_WIDE_INT)
695 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
699 if (prec < HOST_BITS_PER_WIDE_INT)
700 low &= ~((HOST_WIDE_INT) (-1) << prec);
703 if (high == 0 && low == 0)
706 return ((high == 0 && (low & (low - 1)) == 0)
707 || (low == 0 && (high & (high - 1)) == 0));
710 /* Return 1 if EXPR is an integer constant other than zero or a
711 complex constant other than zero. */
714 integer_nonzerop (tree expr)
718 return ((TREE_CODE (expr) == INTEGER_CST
719 && ! TREE_CONSTANT_OVERFLOW (expr)
720 && (TREE_INT_CST_LOW (expr) != 0
721 || TREE_INT_CST_HIGH (expr) != 0))
722 || (TREE_CODE (expr) == COMPLEX_CST
723 && (integer_nonzerop (TREE_REALPART (expr))
724 || integer_nonzerop (TREE_IMAGPART (expr)))));
727 /* Return the power of two represented by a tree node known to be a
731 tree_log2 (tree expr)
734 HOST_WIDE_INT high, low;
738 if (TREE_CODE (expr) == COMPLEX_CST)
739 return tree_log2 (TREE_REALPART (expr));
741 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
742 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
744 high = TREE_INT_CST_HIGH (expr);
745 low = TREE_INT_CST_LOW (expr);
747 /* First clear all bits that are beyond the type's precision in case
748 we've been sign extended. */
750 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
752 else if (prec > HOST_BITS_PER_WIDE_INT)
753 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
757 if (prec < HOST_BITS_PER_WIDE_INT)
758 low &= ~((HOST_WIDE_INT) (-1) << prec);
761 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
765 /* Similar, but return the largest integer Y such that 2 ** Y is less
766 than or equal to EXPR. */
769 tree_floor_log2 (tree expr)
772 HOST_WIDE_INT high, low;
776 if (TREE_CODE (expr) == COMPLEX_CST)
777 return tree_log2 (TREE_REALPART (expr));
779 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
780 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
782 high = TREE_INT_CST_HIGH (expr);
783 low = TREE_INT_CST_LOW (expr);
785 /* First clear all bits that are beyond the type's precision in case
786 we've been sign extended. Ignore if type's precision hasn't been set
787 since what we are doing is setting it. */
789 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
791 else if (prec > HOST_BITS_PER_WIDE_INT)
792 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
796 if (prec < HOST_BITS_PER_WIDE_INT)
797 low &= ~((HOST_WIDE_INT) (-1) << prec);
800 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
804 /* Return 1 if EXPR is the real constant zero. */
807 real_zerop (tree expr)
811 return ((TREE_CODE (expr) == REAL_CST
812 && ! TREE_CONSTANT_OVERFLOW (expr)
813 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
814 || (TREE_CODE (expr) == COMPLEX_CST
815 && real_zerop (TREE_REALPART (expr))
816 && real_zerop (TREE_IMAGPART (expr))));
819 /* Return 1 if EXPR is the real constant one in real or complex form. */
822 real_onep (tree expr)
826 return ((TREE_CODE (expr) == REAL_CST
827 && ! TREE_CONSTANT_OVERFLOW (expr)
828 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
829 || (TREE_CODE (expr) == COMPLEX_CST
830 && real_onep (TREE_REALPART (expr))
831 && real_zerop (TREE_IMAGPART (expr))));
834 /* Return 1 if EXPR is the real constant two. */
837 real_twop (tree expr)
841 return ((TREE_CODE (expr) == REAL_CST
842 && ! TREE_CONSTANT_OVERFLOW (expr)
843 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
844 || (TREE_CODE (expr) == COMPLEX_CST
845 && real_twop (TREE_REALPART (expr))
846 && real_zerop (TREE_IMAGPART (expr))));
849 /* Return 1 if EXPR is the real constant minus one. */
852 real_minus_onep (tree expr)
856 return ((TREE_CODE (expr) == REAL_CST
857 && ! TREE_CONSTANT_OVERFLOW (expr)
858 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
859 || (TREE_CODE (expr) == COMPLEX_CST
860 && real_minus_onep (TREE_REALPART (expr))
861 && real_zerop (TREE_IMAGPART (expr))));
864 /* Nonzero if EXP is a constant or a cast of a constant. */
867 really_constant_p (tree exp)
869 /* This is not quite the same as STRIP_NOPS. It does more. */
870 while (TREE_CODE (exp) == NOP_EXPR
871 || TREE_CODE (exp) == CONVERT_EXPR
872 || TREE_CODE (exp) == NON_LVALUE_EXPR)
873 exp = TREE_OPERAND (exp, 0);
874 return TREE_CONSTANT (exp);
877 /* Return first list element whose TREE_VALUE is ELEM.
878 Return 0 if ELEM is not in LIST. */
881 value_member (tree elem, tree list)
885 if (elem == TREE_VALUE (list))
887 list = TREE_CHAIN (list);
892 /* Return first list element whose TREE_PURPOSE is ELEM.
893 Return 0 if ELEM is not in LIST. */
896 purpose_member (tree elem, tree list)
900 if (elem == TREE_PURPOSE (list))
902 list = TREE_CHAIN (list);
907 /* Return first list element whose BINFO_TYPE is ELEM.
908 Return 0 if ELEM is not in LIST. */
911 binfo_member (tree elem, tree list)
915 if (elem == BINFO_TYPE (list))
917 list = TREE_CHAIN (list);
922 /* Return nonzero if ELEM is part of the chain CHAIN. */
925 chain_member (tree elem, tree chain)
931 chain = TREE_CHAIN (chain);
937 /* Return the length of a chain of nodes chained through TREE_CHAIN.
938 We expect a null pointer to mark the end of the chain.
939 This is the Lisp primitive `length'. */
945 #ifdef ENABLE_TREE_CHECKING
953 #ifdef ENABLE_TREE_CHECKING
965 /* Returns the number of FIELD_DECLs in TYPE. */
968 fields_length (tree type)
970 tree t = TYPE_FIELDS (type);
973 for (; t; t = TREE_CHAIN (t))
974 if (TREE_CODE (t) == FIELD_DECL)
980 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
981 by modifying the last node in chain 1 to point to chain 2.
982 This is the Lisp primitive `nconc'. */
985 chainon (tree op1, tree op2)
994 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
996 TREE_CHAIN (t1) = op2;
998 #ifdef ENABLE_TREE_CHECKING
1001 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1003 abort (); /* Circularity created. */
1010 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1013 tree_last (tree chain)
1017 while ((next = TREE_CHAIN (chain)))
1022 /* Reverse the order of elements in the chain T,
1023 and return the new head of the chain (old last element). */
1028 tree prev = 0, decl, next;
1029 for (decl = t; decl; decl = next)
1031 next = TREE_CHAIN (decl);
1032 TREE_CHAIN (decl) = prev;
1038 /* Return a newly created TREE_LIST node whose
1039 purpose and value fields are PARM and VALUE. */
1042 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1044 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1045 TREE_PURPOSE (t) = parm;
1046 TREE_VALUE (t) = value;
1050 /* Return a newly created TREE_LIST node whose
1051 purpose and value fields are PURPOSE and VALUE
1052 and whose TREE_CHAIN is CHAIN. */
1055 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1059 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1060 tree_zone PASS_MEM_STAT);
1062 memset (node, 0, sizeof (struct tree_common));
1064 #ifdef GATHER_STATISTICS
1065 tree_node_counts[(int) x_kind]++;
1066 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1069 TREE_SET_CODE (node, TREE_LIST);
1070 TREE_CHAIN (node) = chain;
1071 TREE_PURPOSE (node) = purpose;
1072 TREE_VALUE (node) = value;
1076 /* Return the first expression in a sequence of COMPOUND_EXPRs. */
1079 expr_first (tree expr)
1081 if (expr == NULL_TREE)
1083 while (TREE_CODE (expr) == COMPOUND_EXPR)
1084 expr = TREE_OPERAND (expr, 0);
1088 /* Return the last expression in a sequence of COMPOUND_EXPRs. */
1091 expr_last (tree expr)
1093 if (expr == NULL_TREE)
1095 while (TREE_CODE (expr) == COMPOUND_EXPR)
1096 expr = TREE_OPERAND (expr, 1);
1100 /* Return the number of subexpressions in a sequence of COMPOUND_EXPRs. */
1103 expr_length (tree expr)
1107 if (expr == NULL_TREE)
1109 for (; TREE_CODE (expr) == COMPOUND_EXPR; expr = TREE_OPERAND (expr, 1))
1110 len += expr_length (TREE_OPERAND (expr, 0));
1115 /* Return the size nominally occupied by an object of type TYPE
1116 when it resides in memory. The value is measured in units of bytes,
1117 and its data type is that normally used for type sizes
1118 (which is the first type created by make_signed_type or
1119 make_unsigned_type). */
1122 size_in_bytes (tree type)
1126 if (type == error_mark_node)
1127 return integer_zero_node;
1129 type = TYPE_MAIN_VARIANT (type);
1130 t = TYPE_SIZE_UNIT (type);
1134 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1135 return size_zero_node;
1138 if (TREE_CODE (t) == INTEGER_CST)
1139 force_fit_type (t, 0);
1144 /* Return the size of TYPE (in bytes) as a wide integer
1145 or return -1 if the size can vary or is larger than an integer. */
1148 int_size_in_bytes (tree type)
1152 if (type == error_mark_node)
1155 type = TYPE_MAIN_VARIANT (type);
1156 t = TYPE_SIZE_UNIT (type);
1158 || TREE_CODE (t) != INTEGER_CST
1159 || TREE_OVERFLOW (t)
1160 || TREE_INT_CST_HIGH (t) != 0
1161 /* If the result would appear negative, it's too big to represent. */
1162 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1165 return TREE_INT_CST_LOW (t);
1168 /* Return the bit position of FIELD, in bits from the start of the record.
1169 This is a tree of type bitsizetype. */
1172 bit_position (tree field)
1174 return bit_from_pos (DECL_FIELD_OFFSET (field),
1175 DECL_FIELD_BIT_OFFSET (field));
1178 /* Likewise, but return as an integer. Abort if it cannot be represented
1179 in that way (since it could be a signed value, we don't have the option
1180 of returning -1 like int_size_in_byte can. */
1183 int_bit_position (tree field)
1185 return tree_low_cst (bit_position (field), 0);
1188 /* Return the byte position of FIELD, in bytes from the start of the record.
1189 This is a tree of type sizetype. */
1192 byte_position (tree field)
1194 return byte_from_pos (DECL_FIELD_OFFSET (field),
1195 DECL_FIELD_BIT_OFFSET (field));
1198 /* Likewise, but return as an integer. Abort if it cannot be represented
1199 in that way (since it could be a signed value, we don't have the option
1200 of returning -1 like int_size_in_byte can. */
1203 int_byte_position (tree field)
1205 return tree_low_cst (byte_position (field), 0);
1208 /* Return the strictest alignment, in bits, that T is known to have. */
1213 unsigned int align0, align1;
1215 switch (TREE_CODE (t))
1217 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1218 /* If we have conversions, we know that the alignment of the
1219 object must meet each of the alignments of the types. */
1220 align0 = expr_align (TREE_OPERAND (t, 0));
1221 align1 = TYPE_ALIGN (TREE_TYPE (t));
1222 return MAX (align0, align1);
1224 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1225 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1226 case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1227 /* These don't change the alignment of an object. */
1228 return expr_align (TREE_OPERAND (t, 0));
1231 /* The best we can do is say that the alignment is the least aligned
1233 align0 = expr_align (TREE_OPERAND (t, 1));
1234 align1 = expr_align (TREE_OPERAND (t, 2));
1235 return MIN (align0, align1);
1237 case LABEL_DECL: case CONST_DECL:
1238 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1239 if (DECL_ALIGN (t) != 0)
1240 return DECL_ALIGN (t);
1244 return FUNCTION_BOUNDARY;
1250 /* Otherwise take the alignment from that of the type. */
1251 return TYPE_ALIGN (TREE_TYPE (t));
1254 /* Return, as a tree node, the number of elements for TYPE (which is an
1255 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1258 array_type_nelts (tree type)
1260 tree index_type, min, max;
1262 /* If they did it with unspecified bounds, then we should have already
1263 given an error about it before we got here. */
1264 if (! TYPE_DOMAIN (type))
1265 return error_mark_node;
1267 index_type = TYPE_DOMAIN (type);
1268 min = TYPE_MIN_VALUE (index_type);
1269 max = TYPE_MAX_VALUE (index_type);
1271 return (integer_zerop (min)
1273 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1276 /* Return nonzero if arg is static -- a reference to an object in
1277 static storage. This is not the same as the C meaning of `static'. */
1282 switch (TREE_CODE (arg))
1285 /* Nested functions aren't static, since taking their address
1286 involves a trampoline. */
1287 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1288 && ! DECL_NON_ADDR_CONST_P (arg));
1291 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1292 && ! DECL_THREAD_LOCAL (arg)
1293 && ! DECL_NON_ADDR_CONST_P (arg));
1296 return TREE_STATIC (arg);
1302 /* If we are referencing a bitfield, we can't evaluate an
1303 ADDR_EXPR at compile time and so it isn't a constant. */
1305 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1306 && staticp (TREE_OPERAND (arg, 0)));
1312 /* This case is technically correct, but results in setting
1313 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1316 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1320 case ARRAY_RANGE_REF:
1321 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1322 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1323 return staticp (TREE_OPERAND (arg, 0));
1326 if ((unsigned int) TREE_CODE (arg)
1327 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1328 return lang_hooks.staticp (arg);
1334 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1335 Do this to any expression which may be used in more than one place,
1336 but must be evaluated only once.
1338 Normally, expand_expr would reevaluate the expression each time.
1339 Calling save_expr produces something that is evaluated and recorded
1340 the first time expand_expr is called on it. Subsequent calls to
1341 expand_expr just reuse the recorded value.
1343 The call to expand_expr that generates code that actually computes
1344 the value is the first call *at compile time*. Subsequent calls
1345 *at compile time* generate code to use the saved value.
1346 This produces correct result provided that *at run time* control
1347 always flows through the insns made by the first expand_expr
1348 before reaching the other places where the save_expr was evaluated.
1349 You, the caller of save_expr, must make sure this is so.
1351 Constants, and certain read-only nodes, are returned with no
1352 SAVE_EXPR because that is safe. Expressions containing placeholders
1353 are not touched; see tree.def for an explanation of what these
1357 save_expr (tree expr)
1359 tree t = fold (expr);
1362 /* If the tree evaluates to a constant, then we don't want to hide that
1363 fact (i.e. this allows further folding, and direct checks for constants).
1364 However, a read-only object that has side effects cannot be bypassed.
1365 Since it is no problem to reevaluate literals, we just return the
1367 inner = skip_simple_arithmetic (t);
1368 if (TREE_CONSTANT (inner)
1369 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1370 || TREE_CODE (inner) == SAVE_EXPR
1371 || TREE_CODE (inner) == ERROR_MARK)
1374 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1375 it means that the size or offset of some field of an object depends on
1376 the value within another field.
1378 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1379 and some variable since it would then need to be both evaluated once and
1380 evaluated more than once. Front-ends must assure this case cannot
1381 happen by surrounding any such subexpressions in their own SAVE_EXPR
1382 and forcing evaluation at the proper time. */
1383 if (contains_placeholder_p (inner))
1386 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1388 /* This expression might be placed ahead of a jump to ensure that the
1389 value was computed on both sides of the jump. So make sure it isn't
1390 eliminated as dead. */
1391 TREE_SIDE_EFFECTS (t) = 1;
1392 TREE_READONLY (t) = 1;
1396 /* Look inside EXPR and into any simple arithmetic operations. Return
1397 the innermost non-arithmetic node. */
1400 skip_simple_arithmetic (tree expr)
1404 /* We don't care about whether this can be used as an lvalue in this
1406 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1407 expr = TREE_OPERAND (expr, 0);
1409 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1410 a constant, it will be more efficient to not make another SAVE_EXPR since
1411 it will allow better simplification and GCSE will be able to merge the
1412 computations if they actually occur. */
1416 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1417 inner = TREE_OPERAND (inner, 0);
1418 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1420 if (TREE_CONSTANT (TREE_OPERAND (inner, 1)))
1421 inner = TREE_OPERAND (inner, 0);
1422 else if (TREE_CONSTANT (TREE_OPERAND (inner, 0)))
1423 inner = TREE_OPERAND (inner, 1);
1434 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
1435 SAVE_EXPR. Return FALSE otherwise. */
1438 saved_expr_p (tree expr)
1440 return TREE_CODE (skip_simple_arithmetic (expr)) == SAVE_EXPR;
1443 /* Arrange for an expression to be expanded multiple independent
1444 times. This is useful for cleanup actions, as the backend can
1445 expand them multiple times in different places. */
1448 unsave_expr (tree expr)
1452 /* If this is already protected, no sense in protecting it again. */
1453 if (TREE_CODE (expr) == UNSAVE_EXPR)
1456 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1457 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1461 /* Returns the index of the first non-tree operand for CODE, or the number
1462 of operands if all are trees. */
1465 first_rtl_op (enum tree_code code)
1471 case GOTO_SUBROUTINE_EXPR:
1474 case WITH_CLEANUP_EXPR:
1477 return TREE_CODE_LENGTH (code);
1481 /* Return which tree structure is used by T. */
1483 enum tree_node_structure_enum
1484 tree_node_structure (tree t)
1486 enum tree_code code = TREE_CODE (t);
1488 switch (TREE_CODE_CLASS (code))
1490 case 'd': return TS_DECL;
1491 case 't': return TS_TYPE;
1492 case 'b': return TS_BLOCK;
1493 case 'r': case '<': case '1': case '2': case 'e': case 's':
1495 default: /* 'c' and 'x' */
1501 case INTEGER_CST: return TS_INT_CST;
1502 case REAL_CST: return TS_REAL_CST;
1503 case COMPLEX_CST: return TS_COMPLEX;
1504 case VECTOR_CST: return TS_VECTOR;
1505 case STRING_CST: return TS_STRING;
1507 case ERROR_MARK: return TS_COMMON;
1508 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1509 case TREE_LIST: return TS_LIST;
1510 case TREE_VEC: return TS_VEC;
1511 case PLACEHOLDER_EXPR: return TS_COMMON;
1518 /* Perform any modifications to EXPR required when it is unsaved. Does
1519 not recurse into EXPR's subtrees. */
1522 unsave_expr_1 (tree expr)
1524 switch (TREE_CODE (expr))
1527 if (! SAVE_EXPR_PERSISTENT_P (expr))
1528 SAVE_EXPR_RTL (expr) = 0;
1532 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1533 It's OK for this to happen if it was part of a subtree that
1534 isn't immediately expanded, such as operand 2 of another
1536 if (TREE_OPERAND (expr, 1))
1539 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1540 TREE_OPERAND (expr, 3) = NULL_TREE;
1544 /* I don't yet know how to emit a sequence multiple times. */
1545 if (RTL_EXPR_SEQUENCE (expr) != 0)
1554 /* Default lang hook for "unsave_expr_now". */
1557 lhd_unsave_expr_now (tree expr)
1559 enum tree_code code;
1561 /* There's nothing to do for NULL_TREE. */
1565 unsave_expr_1 (expr);
1567 code = TREE_CODE (expr);
1568 switch (TREE_CODE_CLASS (code))
1570 case 'c': /* a constant */
1571 case 't': /* a type node */
1572 case 'd': /* A decl node */
1573 case 'b': /* A block node */
1576 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1577 if (code == TREE_LIST)
1579 lhd_unsave_expr_now (TREE_VALUE (expr));
1580 lhd_unsave_expr_now (TREE_CHAIN (expr));
1584 case 'e': /* an expression */
1585 case 'r': /* a reference */
1586 case 's': /* an expression with side effects */
1587 case '<': /* a comparison expression */
1588 case '2': /* a binary arithmetic expression */
1589 case '1': /* a unary arithmetic expression */
1593 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1594 lhd_unsave_expr_now (TREE_OPERAND (expr, i));
1605 /* Return 0 if it is safe to evaluate EXPR multiple times,
1606 return 1 if it is safe if EXPR is unsaved afterward, or
1607 return 2 if it is completely unsafe.
1609 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1610 an expression tree, so that it safe to unsave them and the surrounding
1611 context will be correct.
1613 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1614 occasionally across the whole of a function. It is therefore only
1615 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1616 below the UNSAVE_EXPR.
1618 RTL_EXPRs consume their rtl during evaluation. It is therefore
1619 never possible to unsave them. */
1622 unsafe_for_reeval (tree expr)
1625 enum tree_code code;
1630 if (expr == NULL_TREE)
1633 code = TREE_CODE (expr);
1634 first_rtl = first_rtl_op (code);
1643 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1645 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1646 unsafeness = MAX (tmp, unsafeness);
1652 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1653 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1654 return MAX (MAX (tmp, 1), tmp2);
1660 case EXIT_BLOCK_EXPR:
1661 /* EXIT_BLOCK_LABELED_BLOCK, a.k.a. TREE_OPERAND (expr, 0), holds
1662 a reference to an ancestor LABELED_BLOCK, so we need to avoid
1663 unbounded recursion in the 'e' traversal code below. */
1664 exp = EXIT_BLOCK_RETURN (expr);
1665 return exp ? unsafe_for_reeval (exp) : 0;
1668 tmp = lang_hooks.unsafe_for_reeval (expr);
1674 switch (TREE_CODE_CLASS (code))
1676 case 'c': /* a constant */
1677 case 't': /* a type node */
1678 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1679 case 'd': /* A decl node */
1680 case 'b': /* A block node */
1683 case 'e': /* an expression */
1684 case 'r': /* a reference */
1685 case 's': /* an expression with side effects */
1686 case '<': /* a comparison expression */
1687 case '2': /* a binary arithmetic expression */
1688 case '1': /* a unary arithmetic expression */
1689 for (i = first_rtl - 1; i >= 0; i--)
1691 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1692 unsafeness = MAX (tmp, unsafeness);
1702 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1703 or offset that depends on a field within a record. */
1706 contains_placeholder_p (tree exp)
1708 enum tree_code code;
1714 code = TREE_CODE (exp);
1715 if (code == PLACEHOLDER_EXPR)
1718 switch (TREE_CODE_CLASS (code))
1721 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1722 position computations since they will be converted into a
1723 WITH_RECORD_EXPR involving the reference, which will assume
1724 here will be valid. */
1725 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1728 if (code == TREE_LIST)
1729 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1730 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1739 /* Ignoring the first operand isn't quite right, but works best. */
1740 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1743 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1744 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1745 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1748 /* If we already know this doesn't have a placeholder, don't
1750 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1753 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1754 result = CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1756 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1764 switch (first_rtl_op (code))
1767 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1769 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1770 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1781 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1782 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1786 type_contains_placeholder_p (tree type)
1788 /* If the size contains a placeholder or the parent type (component type in
1789 the case of arrays) type involves a placeholder, this type does. */
1790 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1791 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1792 || (TREE_TYPE (type) != 0
1793 && type_contains_placeholder_p (TREE_TYPE (type))))
1796 /* Now do type-specific checks. Note that the last part of the check above
1797 greatly limits what we have to do below. */
1798 switch (TREE_CODE (type))
1807 case REFERENCE_TYPE:
1815 /* Here we just check the bounds. */
1816 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1817 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1822 /* We're already checked the component type (TREE_TYPE), so just check
1824 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1828 case QUAL_UNION_TYPE:
1830 static tree seen_types = 0;
1834 /* We have to be careful here that we don't end up in infinite
1835 recursions due to a field of a type being a pointer to that type
1836 or to a mutually-recursive type. So we store a list of record
1837 types that we've seen and see if this type is in them. To save
1838 memory, we don't use a list for just one type. Here we check
1839 whether we've seen this type before and store it if not. */
1840 if (seen_types == 0)
1842 else if (TREE_CODE (seen_types) != TREE_LIST)
1844 if (seen_types == type)
1847 seen_types = tree_cons (NULL_TREE, type,
1848 build_tree_list (NULL_TREE, seen_types));
1852 if (value_member (type, seen_types) != 0)
1855 seen_types = tree_cons (NULL_TREE, type, seen_types);
1858 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1859 if (TREE_CODE (field) == FIELD_DECL
1860 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1861 || (TREE_CODE (type) == QUAL_UNION_TYPE
1862 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1863 || type_contains_placeholder_p (TREE_TYPE (field))))
1869 /* Now remove us from seen_types and return the result. */
1870 if (seen_types == type)
1873 seen_types = TREE_CHAIN (seen_types);
1883 /* Return 1 if EXP contains any expressions that produce cleanups for an
1884 outer scope to deal with. Used by fold. */
1887 has_cleanups (tree exp)
1891 if (! TREE_SIDE_EFFECTS (exp))
1894 switch (TREE_CODE (exp))
1897 case GOTO_SUBROUTINE_EXPR:
1898 case WITH_CLEANUP_EXPR:
1901 case CLEANUP_POINT_EXPR:
1905 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1907 cmp = has_cleanups (TREE_VALUE (exp));
1917 /* This general rule works for most tree codes. All exceptions should be
1918 handled above. If this is a language-specific tree code, we can't
1919 trust what might be in the operand, so say we don't know
1921 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1924 nops = first_rtl_op (TREE_CODE (exp));
1925 for (i = 0; i < nops; i++)
1926 if (TREE_OPERAND (exp, i) != 0)
1928 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1929 if (type == 'e' || type == '<' || type == '1' || type == '2'
1930 || type == 'r' || type == 's')
1932 cmp = has_cleanups (TREE_OPERAND (exp, i));
1941 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1942 return a tree with all occurrences of references to F in a
1943 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1944 contains only arithmetic expressions or a CALL_EXPR with a
1945 PLACEHOLDER_EXPR occurring only in its arglist. */
1948 substitute_in_expr (tree exp, tree f, tree r)
1950 enum tree_code code = TREE_CODE (exp);
1955 /* We handle TREE_LIST and COMPONENT_REF separately. */
1956 if (code == TREE_LIST)
1958 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1959 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1960 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1963 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1965 else if (code == COMPONENT_REF)
1967 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1968 and it is the right field, replace it with R. */
1969 for (inner = TREE_OPERAND (exp, 0);
1970 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1971 inner = TREE_OPERAND (inner, 0))
1973 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1974 && TREE_OPERAND (exp, 1) == f)
1977 /* If this expression hasn't been completed let, leave it
1979 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1982 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1983 if (op0 == TREE_OPERAND (exp, 0))
1986 new = fold (build (code, TREE_TYPE (exp), op0, TREE_OPERAND (exp, 1)));
1989 switch (TREE_CODE_CLASS (code))
2001 switch (first_rtl_op (code))
2007 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2008 if (op0 == TREE_OPERAND (exp, 0))
2011 new = fold (build1 (code, TREE_TYPE (exp), op0));
2015 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2016 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2018 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2021 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
2025 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2026 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2027 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2029 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2030 && op2 == TREE_OPERAND (exp, 2))
2033 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2045 TREE_READONLY (new) = TREE_READONLY (exp);
2049 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2050 for it within OBJ, a tree that is an object or a chain of references. */
2053 substitute_placeholder_in_expr (tree exp, tree obj)
2055 enum tree_code code = TREE_CODE (exp);
2058 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2059 in the chain of OBJ. */
2060 if (code == PLACEHOLDER_EXPR)
2062 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2065 for (elt = obj; elt != 0;
2066 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2067 || TREE_CODE (elt) == COND_EXPR)
2068 ? TREE_OPERAND (elt, 1)
2069 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2070 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2071 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2072 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2073 ? TREE_OPERAND (elt, 0) : 0))
2074 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2077 for (elt = obj; elt != 0;
2078 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2079 || TREE_CODE (elt) == COND_EXPR)
2080 ? TREE_OPERAND (elt, 1)
2081 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2082 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2083 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2084 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2085 ? TREE_OPERAND (elt, 0) : 0))
2086 if (POINTER_TYPE_P (TREE_TYPE (elt))
2087 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2089 return fold (build1 (INDIRECT_REF, need_type, elt));
2091 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2092 survives until RTL generation, there will be an error. */
2096 /* TREE_LIST is special because we need to look at TREE_VALUE
2097 and TREE_CHAIN, not TREE_OPERANDS. */
2098 else if (code == TREE_LIST)
2100 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2101 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2102 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2105 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2108 switch (TREE_CODE_CLASS (code))
2122 switch (first_rtl_op (code))
2128 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2129 if (op0 == TREE_OPERAND (exp, 0))
2132 return fold (build1 (code, TREE_TYPE (exp), op0));
2135 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2136 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2138 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2141 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2144 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2145 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2146 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2148 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2149 && op2 == TREE_OPERAND (exp, 2))
2152 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2164 /* Stabilize a reference so that we can use it any number of times
2165 without causing its operands to be evaluated more than once.
2166 Returns the stabilized reference. This works by means of save_expr,
2167 so see the caveats in the comments about save_expr.
2169 Also allows conversion expressions whose operands are references.
2170 Any other kind of expression is returned unchanged. */
2173 stabilize_reference (tree ref)
2176 enum tree_code code = TREE_CODE (ref);
2183 /* No action is needed in this case. */
2189 case FIX_TRUNC_EXPR:
2190 case FIX_FLOOR_EXPR:
2191 case FIX_ROUND_EXPR:
2193 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2197 result = build_nt (INDIRECT_REF,
2198 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2202 result = build_nt (COMPONENT_REF,
2203 stabilize_reference (TREE_OPERAND (ref, 0)),
2204 TREE_OPERAND (ref, 1));
2208 result = build_nt (BIT_FIELD_REF,
2209 stabilize_reference (TREE_OPERAND (ref, 0)),
2210 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2211 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2215 result = build_nt (ARRAY_REF,
2216 stabilize_reference (TREE_OPERAND (ref, 0)),
2217 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2220 case ARRAY_RANGE_REF:
2221 result = build_nt (ARRAY_RANGE_REF,
2222 stabilize_reference (TREE_OPERAND (ref, 0)),
2223 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2227 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2228 it wouldn't be ignored. This matters when dealing with
2230 return stabilize_reference_1 (ref);
2233 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2234 save_expr (build1 (ADDR_EXPR,
2235 build_pointer_type (TREE_TYPE (ref)),
2239 /* If arg isn't a kind of lvalue we recognize, make no change.
2240 Caller should recognize the error for an invalid lvalue. */
2245 return error_mark_node;
2248 TREE_TYPE (result) = TREE_TYPE (ref);
2249 TREE_READONLY (result) = TREE_READONLY (ref);
2250 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2251 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2256 /* Subroutine of stabilize_reference; this is called for subtrees of
2257 references. Any expression with side-effects must be put in a SAVE_EXPR
2258 to ensure that it is only evaluated once.
2260 We don't put SAVE_EXPR nodes around everything, because assigning very
2261 simple expressions to temporaries causes us to miss good opportunities
2262 for optimizations. Among other things, the opportunity to fold in the
2263 addition of a constant into an addressing mode often gets lost, e.g.
2264 "y[i+1] += x;". In general, we take the approach that we should not make
2265 an assignment unless we are forced into it - i.e., that any non-side effect
2266 operator should be allowed, and that cse should take care of coalescing
2267 multiple utterances of the same expression should that prove fruitful. */
2270 stabilize_reference_1 (tree e)
2273 enum tree_code code = TREE_CODE (e);
2275 /* We cannot ignore const expressions because it might be a reference
2276 to a const array but whose index contains side-effects. But we can
2277 ignore things that are actual constant or that already have been
2278 handled by this function. */
2280 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2283 switch (TREE_CODE_CLASS (code))
2293 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2294 so that it will only be evaluated once. */
2295 /* The reference (r) and comparison (<) classes could be handled as
2296 below, but it is generally faster to only evaluate them once. */
2297 if (TREE_SIDE_EFFECTS (e))
2298 return save_expr (e);
2302 /* Constants need no processing. In fact, we should never reach
2307 /* Division is slow and tends to be compiled with jumps,
2308 especially the division by powers of 2 that is often
2309 found inside of an array reference. So do it just once. */
2310 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2311 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2312 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2313 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2314 return save_expr (e);
2315 /* Recursively stabilize each operand. */
2316 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2317 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2321 /* Recursively stabilize each operand. */
2322 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2329 TREE_TYPE (result) = TREE_TYPE (e);
2330 TREE_READONLY (result) = TREE_READONLY (e);
2331 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2332 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2337 /* Low-level constructors for expressions. */
2339 /* Build an expression of code CODE, data type TYPE, and operands as
2340 specified. Expressions and reference nodes can be created this way.
2341 Constants, decls, types and misc nodes cannot be.
2343 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2344 enough for all extant tree codes. These functions can be called
2345 directly (preferably!), but can also be obtained via GCC preprocessor
2346 magic within the build macro. */
2349 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2353 #ifdef ENABLE_CHECKING
2354 if (TREE_CODE_LENGTH (code) != 0)
2358 t = make_node_stat (code PASS_MEM_STAT);
2365 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2367 int length = sizeof (struct tree_exp);
2368 #ifdef GATHER_STATISTICS
2369 tree_node_kind kind;
2373 #ifdef GATHER_STATISTICS
2374 switch (TREE_CODE_CLASS (code))
2376 case 's': /* an expression with side effects */
2379 case 'r': /* a reference */
2387 tree_node_counts[(int) kind]++;
2388 tree_node_sizes[(int) kind] += length;
2391 #ifdef ENABLE_CHECKING
2392 if (TREE_CODE_LENGTH (code) != 1)
2394 #endif /* ENABLE_CHECKING */
2396 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2398 memset (t, 0, sizeof (struct tree_common));
2400 TREE_SET_CODE (t, code);
2402 TREE_TYPE (t) = type;
2403 TREE_COMPLEXITY (t) = 0;
2404 TREE_OPERAND (t, 0) = node;
2405 if (node && first_rtl_op (code) != 0)
2407 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2408 TREE_READONLY (t) = TREE_READONLY (node);
2411 if (TREE_CODE_CLASS (code) == 's')
2412 TREE_SIDE_EFFECTS (t) = 1;
2419 case PREDECREMENT_EXPR:
2420 case PREINCREMENT_EXPR:
2421 case POSTDECREMENT_EXPR:
2422 case POSTINCREMENT_EXPR:
2423 /* All of these have side-effects, no matter what their
2425 TREE_SIDE_EFFECTS (t) = 1;
2426 TREE_READONLY (t) = 0;
2430 /* Whether a dereference is readonly has nothing to do with whether
2431 its operand is readonly. */
2432 TREE_READONLY (t) = 0;
2438 /* The address of a volatile decl or reference does not have
2439 side-effects. But be careful not to ignore side-effects from
2440 other sources deeper in the expression--if node is a _REF and
2441 one of its operands has side-effects, so do we. */
2442 if (TREE_THIS_VOLATILE (node))
2444 TREE_SIDE_EFFECTS (t) = 0;
2447 int i = first_rtl_op (TREE_CODE (node)) - 1;
2450 if (TREE_SIDE_EFFECTS (TREE_OPERAND (node, i)))
2451 TREE_SIDE_EFFECTS (t) = 1;
2459 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2460 TREE_CONSTANT (t) = 1;
2467 #define PROCESS_ARG(N) \
2469 TREE_OPERAND (t, N) = arg##N; \
2470 if (arg##N && fro > N) \
2472 if (TREE_SIDE_EFFECTS (arg##N)) \
2474 if (!TREE_READONLY (arg##N)) \
2476 if (!TREE_CONSTANT (arg##N)) \
2482 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2484 bool constant, read_only, side_effects;
2488 #ifdef ENABLE_CHECKING
2489 if (TREE_CODE_LENGTH (code) != 2)
2493 t = make_node_stat (code PASS_MEM_STAT);
2496 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2497 result based on those same flags for the arguments. But if the
2498 arguments aren't really even `tree' expressions, we shouldn't be trying
2500 fro = first_rtl_op (code);
2502 /* Expressions without side effects may be constant if their
2503 arguments are as well. */
2504 constant = (TREE_CODE_CLASS (code) == '<'
2505 || TREE_CODE_CLASS (code) == '2');
2507 side_effects = TREE_SIDE_EFFECTS (t);
2512 if (code == CALL_EXPR && !side_effects)
2517 /* Calls have side-effects, except those to const or
2519 i = call_expr_flags (t);
2520 if (!(i & (ECF_CONST | ECF_PURE)))
2523 /* And even those have side-effects if their arguments do. */
2524 else for (node = TREE_OPERAND (t, 1); node; node = TREE_CHAIN (node))
2525 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2532 TREE_READONLY (t) = read_only;
2533 TREE_CONSTANT (t) = constant;
2534 TREE_SIDE_EFFECTS (t) = side_effects;
2540 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2541 tree arg2 MEM_STAT_DECL)
2543 bool constant, read_only, side_effects;
2547 /* ??? Quite a lot of existing code passes one too many arguments to
2548 CALL_EXPR. Not going to fix them, because CALL_EXPR is about to
2549 grow a new argument, so it would just mean changing them back. */
2550 if (code == CALL_EXPR)
2552 if (arg2 != NULL_TREE)
2554 return build2 (code, tt, arg0, arg1);
2557 #ifdef ENABLE_CHECKING
2558 if (TREE_CODE_LENGTH (code) != 3)
2562 t = make_node_stat (code PASS_MEM_STAT);
2565 fro = first_rtl_op (code);
2567 side_effects = TREE_SIDE_EFFECTS (t);
2573 TREE_SIDE_EFFECTS (t) = side_effects;
2579 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2580 tree arg2, tree arg3 MEM_STAT_DECL)
2582 bool constant, read_only, side_effects;
2586 #ifdef ENABLE_CHECKING
2587 if (TREE_CODE_LENGTH (code) != 4)
2591 t = make_node_stat (code PASS_MEM_STAT);
2594 fro = first_rtl_op (code);
2596 side_effects = TREE_SIDE_EFFECTS (t);
2603 TREE_SIDE_EFFECTS (t) = side_effects;
2608 /* Backup definition for non-gcc build compilers. */
2611 (build) (enum tree_code code, tree tt, ...)
2613 tree t, arg0, arg1, arg2, arg3;
2614 int length = TREE_CODE_LENGTH (code);
2621 t = build0 (code, tt);
2624 arg0 = va_arg (p, tree);
2625 t = build1 (code, tt, arg0);
2628 arg0 = va_arg (p, tree);
2629 arg1 = va_arg (p, tree);
2630 t = build2 (code, tt, arg0, arg1);
2633 arg0 = va_arg (p, tree);
2634 arg1 = va_arg (p, tree);
2635 arg2 = va_arg (p, tree);
2636 t = build3 (code, tt, arg0, arg1, arg2);
2639 arg0 = va_arg (p, tree);
2640 arg1 = va_arg (p, tree);
2641 arg2 = va_arg (p, tree);
2642 arg3 = va_arg (p, tree);
2643 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2653 /* Similar except don't specify the TREE_TYPE
2654 and leave the TREE_SIDE_EFFECTS as 0.
2655 It is permissible for arguments to be null,
2656 or even garbage if their values do not matter. */
2659 build_nt (enum tree_code code, ...)
2668 t = make_node (code);
2669 length = TREE_CODE_LENGTH (code);
2671 for (i = 0; i < length; i++)
2672 TREE_OPERAND (t, i) = va_arg (p, tree);
2678 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2679 We do NOT enter this node in any sort of symbol table.
2681 layout_decl is used to set up the decl's storage layout.
2682 Other slots are initialized to 0 or null pointers. */
2685 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2689 t = make_node_stat (code PASS_MEM_STAT);
2691 /* if (type == error_mark_node)
2692 type = integer_type_node; */
2693 /* That is not done, deliberately, so that having error_mark_node
2694 as the type can suppress useless errors in the use of this variable. */
2696 DECL_NAME (t) = name;
2697 TREE_TYPE (t) = type;
2699 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2701 else if (code == FUNCTION_DECL)
2702 DECL_MODE (t) = FUNCTION_MODE;
2707 /* BLOCK nodes are used to represent the structure of binding contours
2708 and declarations, once those contours have been exited and their contents
2709 compiled. This information is used for outputting debugging info. */
2712 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2713 tree supercontext, tree chain)
2715 tree block = make_node (BLOCK);
2717 BLOCK_VARS (block) = vars;
2718 BLOCK_SUBBLOCKS (block) = subblocks;
2719 BLOCK_SUPERCONTEXT (block) = supercontext;
2720 BLOCK_CHAIN (block) = chain;
2724 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2725 location where an expression or an identifier were encountered. It
2726 is necessary for languages where the frontend parser will handle
2727 recursively more than one file (Java is one of them). */
2730 build_expr_wfl (tree node, const char *file, int line, int col)
2732 static const char *last_file = 0;
2733 static tree last_filenode = NULL_TREE;
2734 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2736 EXPR_WFL_NODE (wfl) = node;
2737 EXPR_WFL_SET_LINECOL (wfl, line, col);
2738 if (file != last_file)
2741 last_filenode = file ? get_identifier (file) : NULL_TREE;
2744 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2747 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2748 TREE_TYPE (wfl) = TREE_TYPE (node);
2754 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2758 build_decl_attribute_variant (tree ddecl, tree attribute)
2760 DECL_ATTRIBUTES (ddecl) = attribute;
2764 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2767 Record such modified types already made so we don't make duplicates. */
2770 build_type_attribute_variant (tree ttype, tree attribute)
2772 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2774 hashval_t hashcode = 0;
2776 enum tree_code code = TREE_CODE (ttype);
2778 ntype = copy_node (ttype);
2780 TYPE_POINTER_TO (ntype) = 0;
2781 TYPE_REFERENCE_TO (ntype) = 0;
2782 TYPE_ATTRIBUTES (ntype) = attribute;
2784 /* Create a new main variant of TYPE. */
2785 TYPE_MAIN_VARIANT (ntype) = ntype;
2786 TYPE_NEXT_VARIANT (ntype) = 0;
2787 set_type_quals (ntype, TYPE_UNQUALIFIED);
2789 hashcode = iterative_hash_object (code, hashcode);
2790 if (TREE_TYPE (ntype))
2791 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2793 hashcode = attribute_hash_list (attribute, hashcode);
2795 switch (TREE_CODE (ntype))
2798 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2801 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2805 hashcode = iterative_hash_object
2806 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2807 hashcode = iterative_hash_object
2808 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2812 unsigned int precision = TYPE_PRECISION (ntype);
2813 hashcode = iterative_hash_object (precision, hashcode);
2820 ntype = type_hash_canon (hashcode, ntype);
2821 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2827 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2830 We try both `text' and `__text__', ATTR may be either one. */
2831 /* ??? It might be a reasonable simplification to require ATTR to be only
2832 `text'. One might then also require attribute lists to be stored in
2833 their canonicalized form. */
2836 is_attribute_p (const char *attr, tree ident)
2838 int ident_len, attr_len;
2841 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2844 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2847 p = IDENTIFIER_POINTER (ident);
2848 ident_len = strlen (p);
2849 attr_len = strlen (attr);
2851 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2855 || attr[attr_len - 2] != '_'
2856 || attr[attr_len - 1] != '_')
2858 if (ident_len == attr_len - 4
2859 && strncmp (attr + 2, p, attr_len - 4) == 0)
2864 if (ident_len == attr_len + 4
2865 && p[0] == '_' && p[1] == '_'
2866 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2867 && strncmp (attr, p + 2, attr_len) == 0)
2874 /* Given an attribute name and a list of attributes, return a pointer to the
2875 attribute's list element if the attribute is part of the list, or NULL_TREE
2876 if not found. If the attribute appears more than once, this only
2877 returns the first occurrence; the TREE_CHAIN of the return value should
2878 be passed back in if further occurrences are wanted. */
2881 lookup_attribute (const char *attr_name, tree list)
2885 for (l = list; l; l = TREE_CHAIN (l))
2887 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2889 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2896 /* Return an attribute list that is the union of a1 and a2. */
2899 merge_attributes (tree a1, tree a2)
2903 /* Either one unset? Take the set one. */
2905 if ((attributes = a1) == 0)
2908 /* One that completely contains the other? Take it. */
2910 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2912 if (attribute_list_contained (a2, a1))
2916 /* Pick the longest list, and hang on the other list. */
2918 if (list_length (a1) < list_length (a2))
2919 attributes = a2, a2 = a1;
2921 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2924 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2927 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2930 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2935 a1 = copy_node (a2);
2936 TREE_CHAIN (a1) = attributes;
2945 /* Given types T1 and T2, merge their attributes and return
2949 merge_type_attributes (tree t1, tree t2)
2951 return merge_attributes (TYPE_ATTRIBUTES (t1),
2952 TYPE_ATTRIBUTES (t2));
2955 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2959 merge_decl_attributes (tree olddecl, tree newdecl)
2961 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2962 DECL_ATTRIBUTES (newdecl));
2965 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2967 /* Specialization of merge_decl_attributes for various Windows targets.
2969 This handles the following situation:
2971 __declspec (dllimport) int foo;
2974 The second instance of `foo' nullifies the dllimport. */
2977 merge_dllimport_decl_attributes (tree old, tree new)
2980 int delete_dllimport_p;
2982 old = DECL_ATTRIBUTES (old);
2983 new = DECL_ATTRIBUTES (new);
2985 /* What we need to do here is remove from `old' dllimport if it doesn't
2986 appear in `new'. dllimport behaves like extern: if a declaration is
2987 marked dllimport and a definition appears later, then the object
2988 is not dllimport'd. */
2989 if (lookup_attribute ("dllimport", old) != NULL_TREE
2990 && lookup_attribute ("dllimport", new) == NULL_TREE)
2991 delete_dllimport_p = 1;
2993 delete_dllimport_p = 0;
2995 a = merge_attributes (old, new);
2997 if (delete_dllimport_p)
3001 /* Scan the list for dllimport and delete it. */
3002 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3004 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3006 if (prev == NULL_TREE)
3009 TREE_CHAIN (prev) = TREE_CHAIN (t);
3018 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3020 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3021 of the various TYPE_QUAL values. */
3024 set_type_quals (tree type, int type_quals)
3026 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3027 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3028 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3031 /* Returns true iff cand is equivalent to base with type_quals. */
3034 check_qualified_type (tree cand, tree base, int type_quals)
3036 return (TYPE_QUALS (cand) == type_quals
3037 && TYPE_NAME (cand) == TYPE_NAME (base)
3038 /* Apparently this is needed for Objective-C. */
3039 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3040 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3041 TYPE_ATTRIBUTES (base)));
3044 /* Return a version of the TYPE, qualified as indicated by the
3045 TYPE_QUALS, if one exists. If no qualified version exists yet,
3046 return NULL_TREE. */
3049 get_qualified_type (tree type, int type_quals)
3053 if (TYPE_QUALS (type) == type_quals)
3056 /* Search the chain of variants to see if there is already one there just
3057 like the one we need to have. If so, use that existing one. We must
3058 preserve the TYPE_NAME, since there is code that depends on this. */
3059 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3060 if (check_qualified_type (t, type, type_quals))
3066 /* Like get_qualified_type, but creates the type if it does not
3067 exist. This function never returns NULL_TREE. */
3070 build_qualified_type (tree type, int type_quals)
3074 /* See if we already have the appropriate qualified variant. */
3075 t = get_qualified_type (type, type_quals);
3077 /* If not, build it. */
3080 t = build_type_copy (type);
3081 set_type_quals (t, type_quals);
3087 /* Create a new variant of TYPE, equivalent but distinct.
3088 This is so the caller can modify it. */
3091 build_type_copy (tree type)
3093 tree t, m = TYPE_MAIN_VARIANT (type);
3095 t = copy_node (type);
3097 TYPE_POINTER_TO (t) = 0;
3098 TYPE_REFERENCE_TO (t) = 0;
3100 /* Add this type to the chain of variants of TYPE. */
3101 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3102 TYPE_NEXT_VARIANT (m) = t;
3107 /* Hashing of types so that we don't make duplicates.
3108 The entry point is `type_hash_canon'. */
3110 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3111 with types in the TREE_VALUE slots), by adding the hash codes
3112 of the individual types. */
3115 type_hash_list (tree list, hashval_t hashcode)
3119 for (tail = list; tail; tail = TREE_CHAIN (tail))
3120 if (TREE_VALUE (tail) != error_mark_node)
3121 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3127 /* These are the Hashtable callback functions. */
3129 /* Returns true iff the types are equivalent. */
3132 type_hash_eq (const void *va, const void *vb)
3134 const struct type_hash *a = va, *b = vb;
3136 /* First test the things that are the same for all types. */
3137 if (a->hash != b->hash
3138 || TREE_CODE (a->type) != TREE_CODE (b->type)
3139 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3140 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3141 TYPE_ATTRIBUTES (b->type))
3142 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3143 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3146 switch (TREE_CODE (a->type))
3152 case REFERENCE_TYPE:
3156 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3157 && !(TYPE_VALUES (a->type)
3158 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3159 && TYPE_VALUES (b->type)
3160 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3161 && type_list_equal (TYPE_VALUES (a->type),
3162 TYPE_VALUES (b->type))))
3165 /* ... fall through ... */
3171 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3172 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3173 TYPE_MAX_VALUE (b->type)))
3174 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3175 && tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3176 TYPE_MIN_VALUE (b->type))));
3179 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3182 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3183 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3184 || (TYPE_ARG_TYPES (a->type)
3185 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3186 && TYPE_ARG_TYPES (b->type)
3187 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3188 && type_list_equal (TYPE_ARG_TYPES (a->type),
3189 TYPE_ARG_TYPES (b->type)))));
3193 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3197 case QUAL_UNION_TYPE:
3198 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3199 || (TYPE_FIELDS (a->type)
3200 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3201 && TYPE_FIELDS (b->type)
3202 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3203 && type_list_equal (TYPE_FIELDS (a->type),
3204 TYPE_FIELDS (b->type))));
3207 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3208 || (TYPE_ARG_TYPES (a->type)
3209 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3210 && TYPE_ARG_TYPES (b->type)
3211 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3212 && type_list_equal (TYPE_ARG_TYPES (a->type),
3213 TYPE_ARG_TYPES (b->type))));
3220 /* Return the cached hash value. */
3223 type_hash_hash (const void *item)
3225 return ((const struct type_hash *) item)->hash;
3228 /* Look in the type hash table for a type isomorphic to TYPE.
3229 If one is found, return it. Otherwise return 0. */
3232 type_hash_lookup (hashval_t hashcode, tree type)
3234 struct type_hash *h, in;
3236 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3237 must call that routine before comparing TYPE_ALIGNs. */
3243 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3249 /* Add an entry to the type-hash-table
3250 for a type TYPE whose hash code is HASHCODE. */
3253 type_hash_add (hashval_t hashcode, tree type)
3255 struct type_hash *h;
3258 h = ggc_alloc (sizeof (struct type_hash));
3261 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3262 *(struct type_hash **) loc = h;
3265 /* Given TYPE, and HASHCODE its hash code, return the canonical
3266 object for an identical type if one already exists.
3267 Otherwise, return TYPE, and record it as the canonical object.
3269 To use this function, first create a type of the sort you want.
3270 Then compute its hash code from the fields of the type that
3271 make it different from other similar types.
3272 Then call this function and use the value. */
3275 type_hash_canon (unsigned int hashcode, tree type)
3279 /* The hash table only contains main variants, so ensure that's what we're
3281 if (TYPE_MAIN_VARIANT (type) != type)
3284 if (!lang_hooks.types.hash_types)
3287 /* See if the type is in the hash table already. If so, return it.
3288 Otherwise, add the type. */
3289 t1 = type_hash_lookup (hashcode, type);
3292 #ifdef GATHER_STATISTICS
3293 tree_node_counts[(int) t_kind]--;
3294 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3300 type_hash_add (hashcode, type);
3305 /* See if the data pointed to by the type hash table is marked. We consider
3306 it marked if the type is marked or if a debug type number or symbol
3307 table entry has been made for the type. This reduces the amount of
3308 debugging output and eliminates that dependency of the debug output on
3309 the number of garbage collections. */
3312 type_hash_marked_p (const void *p)
3314 tree type = ((struct type_hash *) p)->type;
3316 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3320 print_type_hash_statistics (void)
3322 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3323 (long) htab_size (type_hash_table),
3324 (long) htab_elements (type_hash_table),
3325 htab_collisions (type_hash_table));
3328 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3329 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3330 by adding the hash codes of the individual attributes. */
3333 attribute_hash_list (tree list, hashval_t hashcode)
3337 for (tail = list; tail; tail = TREE_CHAIN (tail))
3338 /* ??? Do we want to add in TREE_VALUE too? */
3339 hashcode = iterative_hash_object
3340 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3344 /* Given two lists of attributes, return true if list l2 is
3345 equivalent to l1. */
3348 attribute_list_equal (tree l1, tree l2)
3350 return attribute_list_contained (l1, l2)
3351 && attribute_list_contained (l2, l1);
3354 /* Given two lists of attributes, return true if list L2 is
3355 completely contained within L1. */
3356 /* ??? This would be faster if attribute names were stored in a canonicalized
3357 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3358 must be used to show these elements are equivalent (which they are). */
3359 /* ??? It's not clear that attributes with arguments will always be handled
3363 attribute_list_contained (tree l1, tree l2)
3367 /* First check the obvious, maybe the lists are identical. */
3371 /* Maybe the lists are similar. */
3372 for (t1 = l1, t2 = l2;
3374 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3375 && TREE_VALUE (t1) == TREE_VALUE (t2);
3376 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3378 /* Maybe the lists are equal. */
3379 if (t1 == 0 && t2 == 0)
3382 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3385 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3387 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3390 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3397 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3404 /* Given two lists of types
3405 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3406 return 1 if the lists contain the same types in the same order.
3407 Also, the TREE_PURPOSEs must match. */
3410 type_list_equal (tree l1, tree l2)
3414 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3415 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3416 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3417 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3418 && (TREE_TYPE (TREE_PURPOSE (t1))
3419 == TREE_TYPE (TREE_PURPOSE (t2))))))
3425 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3426 given by TYPE. If the argument list accepts variable arguments,
3427 then this function counts only the ordinary arguments. */
3430 type_num_arguments (tree type)
3435 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3436 /* If the function does not take a variable number of arguments,
3437 the last element in the list will have type `void'. */
3438 if (VOID_TYPE_P (TREE_VALUE (t)))
3446 /* Nonzero if integer constants T1 and T2
3447 represent the same constant value. */
3450 tree_int_cst_equal (tree t1, tree t2)
3455 if (t1 == 0 || t2 == 0)
3458 if (TREE_CODE (t1) == INTEGER_CST
3459 && TREE_CODE (t2) == INTEGER_CST
3460 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3461 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3467 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3468 The precise way of comparison depends on their data type. */
3471 tree_int_cst_lt (tree t1, tree t2)
3476 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3478 int t1_sgn = tree_int_cst_sgn (t1);
3479 int t2_sgn = tree_int_cst_sgn (t2);
3481 if (t1_sgn < t2_sgn)
3483 else if (t1_sgn > t2_sgn)
3485 /* Otherwise, both are non-negative, so we compare them as
3486 unsigned just in case one of them would overflow a signed
3489 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3490 return INT_CST_LT (t1, t2);
3492 return INT_CST_LT_UNSIGNED (t1, t2);
3495 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3498 tree_int_cst_compare (tree t1, tree t2)
3500 if (tree_int_cst_lt (t1, t2))
3502 else if (tree_int_cst_lt (t2, t1))
3508 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3509 the host. If POS is zero, the value can be represented in a single
3510 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3511 be represented in a single unsigned HOST_WIDE_INT. */
3514 host_integerp (tree t, int pos)
3516 return (TREE_CODE (t) == INTEGER_CST
3517 && ! TREE_OVERFLOW (t)
3518 && ((TREE_INT_CST_HIGH (t) == 0
3519 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3520 || (! pos && TREE_INT_CST_HIGH (t) == -1
3521 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3522 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3523 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3526 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3527 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3528 be positive. Abort if we cannot satisfy the above conditions. */
3531 tree_low_cst (tree t, int pos)
3533 if (host_integerp (t, pos))
3534 return TREE_INT_CST_LOW (t);
3539 /* Return the most significant bit of the integer constant T. */
3542 tree_int_cst_msb (tree t)
3546 unsigned HOST_WIDE_INT l;
3548 /* Note that using TYPE_PRECISION here is wrong. We care about the
3549 actual bits, not the (arbitrary) range of the type. */
3550 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3551 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3552 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3553 return (l & 1) == 1;
3556 /* Return an indication of the sign of the integer constant T.
3557 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3558 Note that -1 will never be returned it T's type is unsigned. */
3561 tree_int_cst_sgn (tree t)
3563 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3565 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3567 else if (TREE_INT_CST_HIGH (t) < 0)
3573 /* Compare two constructor-element-type constants. Return 1 if the lists
3574 are known to be equal; otherwise return 0. */
3577 simple_cst_list_equal (tree l1, tree l2)
3579 while (l1 != NULL_TREE && l2 != NULL_TREE)
3581 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3584 l1 = TREE_CHAIN (l1);
3585 l2 = TREE_CHAIN (l2);
3591 /* Return truthvalue of whether T1 is the same tree structure as T2.
3592 Return 1 if they are the same.
3593 Return 0 if they are understandably different.
3594 Return -1 if either contains tree structure not understood by
3598 simple_cst_equal (tree t1, tree t2)
3600 enum tree_code code1, code2;
3606 if (t1 == 0 || t2 == 0)
3609 code1 = TREE_CODE (t1);
3610 code2 = TREE_CODE (t2);
3612 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3614 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3615 || code2 == NON_LVALUE_EXPR)
3616 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3618 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3621 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3622 || code2 == NON_LVALUE_EXPR)
3623 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3631 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3632 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3635 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3638 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3639 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3640 TREE_STRING_LENGTH (t1)));
3643 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3649 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3652 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3656 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3659 /* Special case: if either target is an unallocated VAR_DECL,
3660 it means that it's going to be unified with whatever the
3661 TARGET_EXPR is really supposed to initialize, so treat it
3662 as being equivalent to anything. */
3663 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3664 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3665 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3666 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3667 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3668 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3671 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3676 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3678 case WITH_CLEANUP_EXPR:
3679 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3683 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3686 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3687 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3701 /* This general rule works for most tree codes. All exceptions should be
3702 handled above. If this is a language-specific tree code, we can't
3703 trust what might be in the operand, so say we don't know
3705 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3708 switch (TREE_CODE_CLASS (code1))
3717 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3719 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3731 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3732 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3733 than U, respectively. */
3736 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3738 if (tree_int_cst_sgn (t) < 0)
3740 else if (TREE_INT_CST_HIGH (t) != 0)
3742 else if (TREE_INT_CST_LOW (t) == u)
3744 else if (TREE_INT_CST_LOW (t) < u)
3750 /* Return true if CODE represents an associative tree code. Otherwise
3753 associative_tree_code (enum tree_code code)
3775 /* Return true if CODE represents an commutative tree code. Otherwise
3778 commutative_tree_code (enum tree_code code)
3799 /* Generate a hash value for an expression. This can be used iteratively
3800 by passing a previous result as the "val" argument.
3802 This function is intended to produce the same hash for expressions which
3803 would compare equal using operand_equal_p. */
3806 iterative_hash_expr (tree t, hashval_t val)
3809 enum tree_code code;
3813 return iterative_hash_object (t, val);
3815 code = TREE_CODE (t);
3816 class = TREE_CODE_CLASS (code);
3820 /* Decls we can just compare by pointer. */
3821 val = iterative_hash_object (t, val);
3823 else if (class == 'c')
3825 /* Alas, constants aren't shared, so we can't rely on pointer
3827 if (code == INTEGER_CST)
3829 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3830 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3832 else if (code == REAL_CST)
3833 val = iterative_hash (TREE_REAL_CST_PTR (t),
3834 sizeof (REAL_VALUE_TYPE), val);
3835 else if (code == STRING_CST)
3836 val = iterative_hash (TREE_STRING_POINTER (t),
3837 TREE_STRING_LENGTH (t), val);
3838 else if (code == COMPLEX_CST)
3840 val = iterative_hash_expr (TREE_REALPART (t), val);
3841 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3843 else if (code == VECTOR_CST)
3844 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3848 else if (IS_EXPR_CODE_CLASS (class))
3850 val = iterative_hash_object (code, val);
3852 if (code == NOP_EXPR || code == CONVERT_EXPR
3853 || code == NON_LVALUE_EXPR)
3854 val = iterative_hash_object (TREE_TYPE (t), val);
3856 if (commutative_tree_code (code))
3858 /* It's a commutative expression. We want to hash it the same
3859 however it appears. We do this by first hashing both operands
3860 and then rehashing based on the order of their independent
3862 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3863 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3867 t = one, one = two, two = t;
3869 val = iterative_hash_object (one, val);
3870 val = iterative_hash_object (two, val);
3873 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3874 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3876 else if (code == TREE_LIST)
3878 /* A list of expressions, for a CALL_EXPR or as the elements of a
3880 for (; t; t = TREE_CHAIN (t))
3881 val = iterative_hash_expr (TREE_VALUE (t), val);
3889 /* Constructors for pointer, array and function types.
3890 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3891 constructed by language-dependent code, not here.) */
3893 /* Construct, lay out and return the type of pointers to TO_TYPE with
3894 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3895 reference all of memory. If such a type has already been
3896 constructed, reuse it. */
3899 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
3904 /* In some cases, languages will have things that aren't a POINTER_TYPE
3905 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3906 In that case, return that type without regard to the rest of our
3909 ??? This is a kludge, but consistent with the way this function has
3910 always operated and there doesn't seem to be a good way to avoid this
3912 if (TYPE_POINTER_TO (to_type) != 0
3913 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
3914 return TYPE_POINTER_TO (to_type);
3916 /* First, if we already have a type for pointers to TO_TYPE and it's
3917 the proper mode, use it. */
3918 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
3919 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
3922 t = make_node (POINTER_TYPE);
3924 TREE_TYPE (t) = to_type;
3925 TYPE_MODE (t) = mode;
3926 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
3927 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
3928 TYPE_POINTER_TO (to_type) = t;
3930 /* Lay out the type. This function has many callers that are concerned
3931 with expression-construction, and this simplifies them all. */
3937 /* By default build pointers in ptr_mode. */
3940 build_pointer_type (tree to_type)
3942 return build_pointer_type_for_mode (to_type, ptr_mode, false);
3945 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
3948 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
3953 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
3954 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
3955 In that case, return that type without regard to the rest of our
3958 ??? This is a kludge, but consistent with the way this function has
3959 always operated and there doesn't seem to be a good way to avoid this
3961 if (TYPE_REFERENCE_TO (to_type) != 0
3962 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
3963 return TYPE_REFERENCE_TO (to_type);
3965 /* First, if we already have a type for pointers to TO_TYPE and it's
3966 the proper mode, use it. */
3967 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
3968 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
3971 t = make_node (REFERENCE_TYPE);
3973 TREE_TYPE (t) = to_type;
3974 TYPE_MODE (t) = mode;
3975 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
3976 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
3977 TYPE_REFERENCE_TO (to_type) = t;
3985 /* Build the node for the type of references-to-TO_TYPE by default
3989 build_reference_type (tree to_type)
3991 return build_reference_type_for_mode (to_type, ptr_mode, false);
3994 /* Build a type that is compatible with t but has no cv quals anywhere
3997 const char *const *const * -> char ***. */
4000 build_type_no_quals (tree t)
4002 switch (TREE_CODE (t))
4005 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4007 TYPE_REF_CAN_ALIAS_ALL (t));
4008 case REFERENCE_TYPE:
4010 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4012 TYPE_REF_CAN_ALIAS_ALL (t));
4014 return TYPE_MAIN_VARIANT (t);
4018 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4019 MAXVAL should be the maximum value in the domain
4020 (one less than the length of the array).
4022 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4023 We don't enforce this limit, that is up to caller (e.g. language front end).
4024 The limit exists because the result is a signed type and we don't handle
4025 sizes that use more than one HOST_WIDE_INT. */
4028 build_index_type (tree maxval)
4030 tree itype = make_node (INTEGER_TYPE);
4032 TREE_TYPE (itype) = sizetype;
4033 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4034 TYPE_MIN_VALUE (itype) = size_zero_node;
4035 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4036 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4037 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4038 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4039 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4040 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4042 if (host_integerp (maxval, 1))
4043 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4048 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4049 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4050 low bound LOWVAL and high bound HIGHVAL.
4051 if TYPE==NULL_TREE, sizetype is used. */
4054 build_range_type (tree type, tree lowval, tree highval)
4056 tree itype = make_node (INTEGER_TYPE);
4058 TREE_TYPE (itype) = type;
4059 if (type == NULL_TREE)
4062 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4063 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4065 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4066 TYPE_MODE (itype) = TYPE_MODE (type);
4067 TYPE_SIZE (itype) = TYPE_SIZE (type);
4068 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4069 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4070 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4072 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4073 return type_hash_canon (tree_low_cst (highval, 0)
4074 - tree_low_cst (lowval, 0),
4080 /* Just like build_index_type, but takes lowval and highval instead
4081 of just highval (maxval). */
4084 build_index_2_type (tree lowval, tree highval)
4086 return build_range_type (sizetype, lowval, highval);
4089 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4090 and number of elements specified by the range of values of INDEX_TYPE.
4091 If such a type has already been constructed, reuse it. */
4094 build_array_type (tree elt_type, tree index_type)
4097 hashval_t hashcode = 0;
4099 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4101 error ("arrays of functions are not meaningful");
4102 elt_type = integer_type_node;
4105 t = make_node (ARRAY_TYPE);
4106 TREE_TYPE (t) = elt_type;
4107 TYPE_DOMAIN (t) = index_type;
4109 if (index_type == 0)
4112 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4113 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4114 t = type_hash_canon (hashcode, t);
4116 if (!COMPLETE_TYPE_P (t))
4121 /* Return the TYPE of the elements comprising
4122 the innermost dimension of ARRAY. */
4125 get_inner_array_type (tree array)
4127 tree type = TREE_TYPE (array);
4129 while (TREE_CODE (type) == ARRAY_TYPE)
4130 type = TREE_TYPE (type);
4135 /* Construct, lay out and return
4136 the type of functions returning type VALUE_TYPE
4137 given arguments of types ARG_TYPES.
4138 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4139 are data type nodes for the arguments of the function.
4140 If such a type has already been constructed, reuse it. */
4143 build_function_type (tree value_type, tree arg_types)
4146 hashval_t hashcode = 0;
4148 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4150 error ("function return type cannot be function");
4151 value_type = integer_type_node;
4154 /* Make a node of the sort we want. */
4155 t = make_node (FUNCTION_TYPE);
4156 TREE_TYPE (t) = value_type;
4157 TYPE_ARG_TYPES (t) = arg_types;
4159 /* If we already have such a type, use the old one. */
4160 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4161 hashcode = type_hash_list (arg_types, hashcode);
4162 t = type_hash_canon (hashcode, t);
4164 if (!COMPLETE_TYPE_P (t))
4169 /* Build a function type. The RETURN_TYPE is the type returned by the
4170 function. If additional arguments are provided, they are
4171 additional argument types. The list of argument types must always
4172 be terminated by NULL_TREE. */
4175 build_function_type_list (tree return_type, ...)
4180 va_start (p, return_type);
4182 t = va_arg (p, tree);
4183 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4184 args = tree_cons (NULL_TREE, t, args);
4187 args = nreverse (args);
4188 TREE_CHAIN (last) = void_list_node;
4189 args = build_function_type (return_type, args);
4195 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4196 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4197 for the method. An implicit additional parameter (of type
4198 pointer-to-BASETYPE) is added to the ARGTYPES. */
4201 build_method_type_directly (tree basetype,
4209 /* Make a node of the sort we want. */
4210 t = make_node (METHOD_TYPE);
4212 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4213 TREE_TYPE (t) = rettype;
4214 ptype = build_pointer_type (basetype);
4216 /* The actual arglist for this function includes a "hidden" argument
4217 which is "this". Put it into the list of argument types. */
4218 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4219 TYPE_ARG_TYPES (t) = argtypes;
4221 /* If we already have such a type, use the old one. */
4222 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4223 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4224 hashcode = type_hash_list (argtypes, hashcode);
4225 t = type_hash_canon (hashcode, t);
4227 if (!COMPLETE_TYPE_P (t))
4233 /* Construct, lay out and return the type of methods belonging to class
4234 BASETYPE and whose arguments and values are described by TYPE.
4235 If that type exists already, reuse it.
4236 TYPE must be a FUNCTION_TYPE node. */
4239 build_method_type (tree basetype, tree type)
4241 if (TREE_CODE (type) != FUNCTION_TYPE)
4244 return build_method_type_directly (basetype,
4246 TYPE_ARG_TYPES (type));
4249 /* Construct, lay out and return the type of offsets to a value
4250 of type TYPE, within an object of type BASETYPE.
4251 If a suitable offset type exists already, reuse it. */
4254 build_offset_type (tree basetype, tree type)
4257 hashval_t hashcode = 0;
4259 /* Make a node of the sort we want. */
4260 t = make_node (OFFSET_TYPE);
4262 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4263 TREE_TYPE (t) = type;
4265 /* If we already have such a type, use the old one. */
4266 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4267 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4268 t = type_hash_canon (hashcode, t);
4270 if (!COMPLETE_TYPE_P (t))
4276 /* Create a complex type whose components are COMPONENT_TYPE. */
4279 build_complex_type (tree component_type)
4284 /* Make a node of the sort we want. */
4285 t = make_node (COMPLEX_TYPE);
4287 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4289 /* If we already have such a type, use the old one. */
4290 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4291 t = type_hash_canon (hashcode, t);
4293 if (!COMPLETE_TYPE_P (t))
4296 /* If we are writing Dwarf2 output we need to create a name,
4297 since complex is a fundamental type. */
4298 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4302 if (component_type == char_type_node)
4303 name = "complex char";
4304 else if (component_type == signed_char_type_node)
4305 name = "complex signed char";
4306 else if (component_type == unsigned_char_type_node)
4307 name = "complex unsigned char";
4308 else if (component_type == short_integer_type_node)
4309 name = "complex short int";
4310 else if (component_type == short_unsigned_type_node)
4311 name = "complex short unsigned int";
4312 else if (component_type == integer_type_node)
4313 name = "complex int";
4314 else if (component_type == unsigned_type_node)
4315 name = "complex unsigned int";
4316 else if (component_type == long_integer_type_node)
4317 name = "complex long int";
4318 else if (component_type == long_unsigned_type_node)
4319 name = "complex long unsigned int";
4320 else if (component_type == long_long_integer_type_node)
4321 name = "complex long long int";
4322 else if (component_type == long_long_unsigned_type_node)
4323 name = "complex long long unsigned int";
4328 TYPE_NAME (t) = get_identifier (name);
4331 return build_qualified_type (t, TYPE_QUALS (component_type));
4334 /* Return OP, stripped of any conversions to wider types as much as is safe.
4335 Converting the value back to OP's type makes a value equivalent to OP.
4337 If FOR_TYPE is nonzero, we return a value which, if converted to
4338 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4340 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4341 narrowest type that can hold the value, even if they don't exactly fit.
4342 Otherwise, bit-field references are changed to a narrower type
4343 only if they can be fetched directly from memory in that type.
4345 OP must have integer, real or enumeral type. Pointers are not allowed!
4347 There are some cases where the obvious value we could return
4348 would regenerate to OP if converted to OP's type,
4349 but would not extend like OP to wider types.
4350 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4351 For example, if OP is (unsigned short)(signed char)-1,
4352 we avoid returning (signed char)-1 if FOR_TYPE is int,
4353 even though extending that to an unsigned short would regenerate OP,
4354 since the result of extending (signed char)-1 to (int)
4355 is different from (int) OP. */
4358 get_unwidened (tree op, tree for_type)
4360 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4361 tree type = TREE_TYPE (op);
4363 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4365 = (for_type != 0 && for_type != type
4366 && final_prec > TYPE_PRECISION (type)
4367 && TYPE_UNSIGNED (type));
4370 while (TREE_CODE (op) == NOP_EXPR)
4373 = TYPE_PRECISION (TREE_TYPE (op))
4374 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4376 /* Truncations are many-one so cannot be removed.
4377 Unless we are later going to truncate down even farther. */
4379 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4382 /* See what's inside this conversion. If we decide to strip it,
4384 op = TREE_OPERAND (op, 0);
4386 /* If we have not stripped any zero-extensions (uns is 0),
4387 we can strip any kind of extension.
4388 If we have previously stripped a zero-extension,
4389 only zero-extensions can safely be stripped.
4390 Any extension can be stripped if the bits it would produce
4391 are all going to be discarded later by truncating to FOR_TYPE. */
4395 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4397 /* TYPE_UNSIGNED says whether this is a zero-extension.
4398 Let's avoid computing it if it does not affect WIN
4399 and if UNS will not be needed again. */
4400 if ((uns || TREE_CODE (op) == NOP_EXPR)
4401 && TYPE_UNSIGNED (TREE_TYPE (op)))
4409 if (TREE_CODE (op) == COMPONENT_REF
4410 /* Since type_for_size always gives an integer type. */
4411 && TREE_CODE (type) != REAL_TYPE
4412 /* Don't crash if field not laid out yet. */
4413 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4414 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4416 unsigned int innerprec
4417 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4418 int unsignedp = (TREE_UNSIGNED (TREE_OPERAND (op, 1))
4419 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4420 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4422 /* We can get this structure field in the narrowest type it fits in.
4423 If FOR_TYPE is 0, do this only for a field that matches the
4424 narrower type exactly and is aligned for it
4425 The resulting extension to its nominal type (a fullword type)
4426 must fit the same conditions as for other extensions. */
4429 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4430 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4431 && (! uns || final_prec <= innerprec || unsignedp))
4433 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4434 TREE_OPERAND (op, 1));
4435 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4436 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4443 /* Return OP or a simpler expression for a narrower value
4444 which can be sign-extended or zero-extended to give back OP.
4445 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4446 or 0 if the value should be sign-extended. */
4449 get_narrower (tree op, int *unsignedp_ptr)
4455 while (TREE_CODE (op) == NOP_EXPR)
4458 = (TYPE_PRECISION (TREE_TYPE (op))
4459 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4461 /* Truncations are many-one so cannot be removed. */
4465 /* See what's inside this conversion. If we decide to strip it,
4470 op = TREE_OPERAND (op, 0);
4471 /* An extension: the outermost one can be stripped,
4472 but remember whether it is zero or sign extension. */
4474 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4475 /* Otherwise, if a sign extension has been stripped,
4476 only sign extensions can now be stripped;
4477 if a zero extension has been stripped, only zero-extensions. */
4478 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4482 else /* bitschange == 0 */
4484 /* A change in nominal type can always be stripped, but we must
4485 preserve the unsignedness. */
4487 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4489 op = TREE_OPERAND (op, 0);
4495 if (TREE_CODE (op) == COMPONENT_REF
4496 /* Since type_for_size always gives an integer type. */
4497 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4498 /* Ensure field is laid out already. */
4499 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4501 unsigned HOST_WIDE_INT innerprec
4502 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4503 int unsignedp = (TREE_UNSIGNED (TREE_OPERAND (op, 1))
4504 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4505 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4507 /* We can get this structure field in a narrower type that fits it,
4508 but the resulting extension to its nominal type (a fullword type)
4509 must satisfy the same conditions as for other extensions.
4511 Do this only for fields that are aligned (not bit-fields),
4512 because when bit-field insns will be used there is no
4513 advantage in doing this. */
4515 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4516 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4517 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4521 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4522 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4523 TREE_OPERAND (op, 1));
4524 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4525 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4528 *unsignedp_ptr = uns;
4532 /* Nonzero if integer constant C has a value that is permissible
4533 for type TYPE (an INTEGER_TYPE). */
4536 int_fits_type_p (tree c, tree type)
4538 tree type_low_bound = TYPE_MIN_VALUE (type);
4539 tree type_high_bound = TYPE_MAX_VALUE (type);
4540 int ok_for_low_bound, ok_for_high_bound;
4542 /* Perform some generic filtering first, which may allow making a decision
4543 even if the bounds are not constant. First, negative integers never fit
4544 in unsigned types, */
4545 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4546 /* Also, unsigned integers with top bit set never fit signed types. */
4547 || (! TYPE_UNSIGNED (type)
4548 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4551 /* If at least one bound of the type is a constant integer, we can check
4552 ourselves and maybe make a decision. If no such decision is possible, but
4553 this type is a subtype, try checking against that. Otherwise, use
4554 force_fit_type, which checks against the precision.
4556 Compute the status for each possibly constant bound, and return if we see
4557 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4558 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4559 for "constant known to fit". */
4561 ok_for_low_bound = -1;
4562 ok_for_high_bound = -1;
4564 /* Check if C >= type_low_bound. */
4565 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4567 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4568 if (! ok_for_low_bound)
4572 /* Check if c <= type_high_bound. */
4573 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4575 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4576 if (! ok_for_high_bound)
4580 /* If the constant fits both bounds, the result is known. */
4581 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4584 /* If we haven't been able to decide at this point, there nothing more we
4585 can check ourselves here. Look at the base type if we have one. */
4586 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4587 return int_fits_type_p (c, TREE_TYPE (type));
4589 /* Or to force_fit_type, if nothing else. */
4593 TREE_TYPE (c) = type;
4594 return !force_fit_type (c, 0);
4598 /* Returns true if T is, contains, or refers to a type with variable
4599 size. This concept is more general than that of C99 'variably
4600 modified types': in C99, a struct type is never variably modified
4601 because a VLA may not appear as a structure member. However, in
4604 struct S { int i[f()]; };
4606 is valid, and other languages may define similar constructs. */
4609 variably_modified_type_p (tree type)
4613 if (type == error_mark_node)
4616 /* If TYPE itself has variable size, it is variably modified.
4618 We do not yet have a representation of the C99 '[*]' syntax.
4619 When a representation is chosen, this function should be modified
4620 to test for that case as well. */
4621 t = TYPE_SIZE (type);
4622 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4625 switch (TREE_CODE (type))
4628 case REFERENCE_TYPE:
4630 /* If TYPE is a pointer or reference, it is variably modified if
4631 the type pointed to is variably modified. Similarly for arrays;
4632 note that VLAs are handled by the TYPE_SIZE check above. */
4633 return variably_modified_type_p (TREE_TYPE (type));
4637 /* If TYPE is a function type, it is variably modified if any of the
4638 parameters or the return type are variably modified. */
4642 if (variably_modified_type_p (TREE_TYPE (type)))
4644 for (parm = TYPE_ARG_TYPES (type);
4645 parm && parm != void_list_node;
4646 parm = TREE_CHAIN (parm))
4647 if (variably_modified_type_p (TREE_VALUE (parm)))
4653 /* Scalar types are variably modified if their end points
4655 t = TYPE_MIN_VALUE (type);
4656 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4658 t = TYPE_MAX_VALUE (type);
4659 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4667 /* The current language may have other cases to check, but in general,
4668 all other types are not variably modified. */
4669 return lang_hooks.tree_inlining.var_mod_type_p (type);
4672 /* Given a DECL or TYPE, return the scope in which it was declared, or
4673 NULL_TREE if there is no containing scope. */
4676 get_containing_scope (tree t)
4678 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4681 /* Return the innermost context enclosing DECL that is
4682 a FUNCTION_DECL, or zero if none. */
4685 decl_function_context (tree decl)
4689 if (TREE_CODE (decl) == ERROR_MARK)
4692 if (TREE_CODE (decl) == SAVE_EXPR)
4693 context = SAVE_EXPR_CONTEXT (decl);
4695 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4696 where we look up the function at runtime. Such functions always take
4697 a first argument of type 'pointer to real context'.
4699 C++ should really be fixed to use DECL_CONTEXT for the real context,
4700 and use something else for the "virtual context". */
4701 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4704 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4706 context = DECL_CONTEXT (decl);
4708 while (context && TREE_CODE (context) != FUNCTION_DECL)
4710 if (TREE_CODE (context) == BLOCK)
4711 context = BLOCK_SUPERCONTEXT (context);
4713 context = get_containing_scope (context);
4719 /* Return the innermost context enclosing DECL that is
4720 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4721 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4724 decl_type_context (tree decl)
4726 tree context = DECL_CONTEXT (decl);
4729 switch (TREE_CODE (context))
4731 case NAMESPACE_DECL:
4732 case TRANSLATION_UNIT_DECL:
4737 case QUAL_UNION_TYPE:
4742 context = DECL_CONTEXT (context);
4746 context = BLOCK_SUPERCONTEXT (context);
4756 /* CALL is a CALL_EXPR. Return the declaration for the function
4757 called, or NULL_TREE if the called function cannot be
4761 get_callee_fndecl (tree call)
4765 /* It's invalid to call this function with anything but a
4767 if (TREE_CODE (call) != CALL_EXPR)
4770 /* The first operand to the CALL is the address of the function
4772 addr = TREE_OPERAND (call, 0);
4776 /* If this is a readonly function pointer, extract its initial value. */
4777 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4778 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4779 && DECL_INITIAL (addr))
4780 addr = DECL_INITIAL (addr);
4782 /* If the address is just `&f' for some function `f', then we know
4783 that `f' is being called. */
4784 if (TREE_CODE (addr) == ADDR_EXPR
4785 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4786 return TREE_OPERAND (addr, 0);
4788 /* We couldn't figure out what was being called. Maybe the front
4789 end has some idea. */
4790 return lang_hooks.lang_get_callee_fndecl (call);
4793 /* Print debugging information about tree nodes generated during the compile,
4794 and any language-specific information. */
4797 dump_tree_statistics (void)
4799 #ifdef GATHER_STATISTICS
4801 int total_nodes, total_bytes;
4804 fprintf (stderr, "\n??? tree nodes created\n\n");
4805 #ifdef GATHER_STATISTICS
4806 fprintf (stderr, "Kind Nodes Bytes\n");
4807 fprintf (stderr, "---------------------------------------\n");
4808 total_nodes = total_bytes = 0;
4809 for (i = 0; i < (int) all_kinds; i++)
4811 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4812 tree_node_counts[i], tree_node_sizes[i]);
4813 total_nodes += tree_node_counts[i];
4814 total_bytes += tree_node_sizes[i];
4816 fprintf (stderr, "---------------------------------------\n");
4817 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4818 fprintf (stderr, "---------------------------------------\n");
4820 fprintf (stderr, "(No per-node statistics)\n");
4822 print_type_hash_statistics ();
4823 lang_hooks.print_statistics ();
4826 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4828 /* Generate a crc32 of a string. */
4831 crc32_string (unsigned chksum, const char *string)
4835 unsigned value = *string << 24;
4838 for (ix = 8; ix--; value <<= 1)
4842 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
4851 /* P is a string that will be used in a symbol. Mask out any characters
4852 that are not valid in that context. */
4855 clean_symbol_name (char *p)
4859 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4862 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4869 /* Generate a name for a function unique to this translation unit.
4870 TYPE is some string to identify the purpose of this function to the
4871 linker or collect2. */
4874 get_file_function_name_long (const char *type)
4880 if (first_global_object_name)
4881 p = first_global_object_name;
4884 /* We don't have anything that we know to be unique to this translation
4885 unit, so use what we do have and throw in some randomness. */
4887 const char *name = weak_global_object_name;
4888 const char *file = main_input_filename;
4893 file = input_filename;
4895 len = strlen (file);
4896 q = alloca (9 * 2 + len + 1);
4897 memcpy (q, file, len + 1);
4898 clean_symbol_name (q);
4900 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
4901 crc32_string (0, flag_random_seed));
4906 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
4908 /* Set up the name of the file-level functions we may need.
4909 Use a global object (which is already required to be unique over
4910 the program) rather than the file name (which imposes extra
4912 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4914 return get_identifier (buf);
4917 /* If KIND=='I', return a suitable global initializer (constructor) name.
4918 If KIND=='D', return a suitable global clean-up (destructor) name. */
4921 get_file_function_name (int kind)
4928 return get_file_function_name_long (p);
4931 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4932 The result is placed in BUFFER (which has length BIT_SIZE),
4933 with one bit in each char ('\000' or '\001').
4935 If the constructor is constant, NULL_TREE is returned.
4936 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4939 get_set_constructor_bits (tree init, char *buffer, int bit_size)
4943 HOST_WIDE_INT domain_min
4944 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4945 tree non_const_bits = NULL_TREE;
4947 for (i = 0; i < bit_size; i++)
4950 for (vals = TREE_OPERAND (init, 1);
4951 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4953 if (!host_integerp (TREE_VALUE (vals), 0)
4954 || (TREE_PURPOSE (vals) != NULL_TREE
4955 && !host_integerp (TREE_PURPOSE (vals), 0)))
4957 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4958 else if (TREE_PURPOSE (vals) != NULL_TREE)
4960 /* Set a range of bits to ones. */
4961 HOST_WIDE_INT lo_index
4962 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4963 HOST_WIDE_INT hi_index
4964 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4966 if (lo_index < 0 || lo_index >= bit_size
4967 || hi_index < 0 || hi_index >= bit_size)
4969 for (; lo_index <= hi_index; lo_index++)
4970 buffer[lo_index] = 1;
4974 /* Set a single bit to one. */
4976 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4977 if (index < 0 || index >= bit_size)
4979 error ("invalid initializer for bit string");
4985 return non_const_bits;
4988 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4989 The result is placed in BUFFER (which is an array of bytes).
4990 If the constructor is constant, NULL_TREE is returned.
4991 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4994 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
4997 int set_word_size = BITS_PER_UNIT;
4998 int bit_size = wd_size * set_word_size;
5000 unsigned char *bytep = buffer;
5001 char *bit_buffer = alloca (bit_size);
5002 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5004 for (i = 0; i < wd_size; i++)
5007 for (i = 0; i < bit_size; i++)
5011 if (BYTES_BIG_ENDIAN)
5012 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5014 *bytep |= 1 << bit_pos;
5017 if (bit_pos >= set_word_size)
5018 bit_pos = 0, bytep++;
5020 return non_const_bits;
5023 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5025 /* Complain that the tree code of NODE does not match the expected CODE.
5026 FILE, LINE, and FUNCTION are of the caller. */
5029 tree_check_failed (const tree node, enum tree_code code, const char *file,
5030 int line, const char *function)
5032 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5033 tree_code_name[code], tree_code_name[TREE_CODE (node)],
5034 function, trim_filename (file), line);
5037 /* Similar to above except that we allowed the code to be one of two
5041 tree_check2_failed (const tree node, enum tree_code code1,
5042 enum tree_code code2, const char *file,
5043 int line, const char *function)
5045 internal_error ("tree check: expected %s or %s, have %s in %s, at %s:%d",
5046 tree_code_name[code1], tree_code_name[code2],
5047 tree_code_name[TREE_CODE (node)],
5048 function, trim_filename (file), line);
5051 /* Likewise for three different codes. */
5054 tree_check3_failed (const tree node, enum tree_code code1,
5055 enum tree_code code2, enum tree_code code3,
5056 const char *file, int line, const char *function)
5058 internal_error ("tree check: expected %s, %s or %s; have %s in %s, at %s:%d",
5059 tree_code_name[code1], tree_code_name[code2],
5060 tree_code_name[code3], tree_code_name[TREE_CODE (node)],
5061 function, trim_filename (file), line);
5064 /* ... and for four different codes. */
5067 tree_check4_failed (const tree node, enum tree_code code1,
5068 enum tree_code code2, enum tree_code code3,
5069 enum tree_code code4, const char *file, int line,
5070 const char *function)
5073 ("tree check: expected %s, %s, %s or %s; have %s in %s, at %s:%d",
5074 tree_code_name[code1], tree_code_name[code2], tree_code_name[code3],
5075 tree_code_name[code4], tree_code_name[TREE_CODE (node)], function,
5076 trim_filename (file), line);
5079 /* ... and for five different codes. */
5082 tree_check5_failed (const tree node, enum tree_code code1,
5083 enum tree_code code2, enum tree_code code3,
5084 enum tree_code code4, enum tree_code code5,
5085 const char *file, int line, const char *function)
5088 ("tree check: expected %s, %s, %s, %s or %s; have %s in %s, at %s:%d",
5089 tree_code_name[code1], tree_code_name[code2], tree_code_name[code3],
5090 tree_code_name[code4], tree_code_name[code5],
5091 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5094 /* Similar to tree_check_failed, except that we check for a class of tree
5095 code, given in CL. */
5098 tree_class_check_failed (const tree node, int cl, const char *file,
5099 int line, const char *function)
5102 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5103 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5104 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5107 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5108 (dynamically sized) vector. */
5111 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5112 const char *function)
5115 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5116 idx + 1, len, function, trim_filename (file), line);
5119 /* Similar to above, except that the check is for the bounds of the operand
5120 vector of an expression node. */
5123 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5124 int line, const char *function)
5127 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5128 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5129 function, trim_filename (file), line);
5131 #endif /* ENABLE_TREE_CHECKING */
5133 /* For a new vector type node T, build the information necessary for
5134 debugging output. */
5137 finish_vector_type (tree t)
5142 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
5143 tree array = build_array_type (TREE_TYPE (t),
5144 build_index_type (index));
5145 tree rt = make_node (RECORD_TYPE);
5147 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5148 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5150 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5151 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5152 the representation type, and we want to find that die when looking up
5153 the vector type. This is most easily achieved by making the TYPE_UID
5155 TYPE_UID (rt) = TYPE_UID (t);
5159 /* Create nodes for all integer types (and error_mark_node) using the sizes
5160 of C datatypes. The caller should call set_sizetype soon after calling
5161 this function to select one of the types as sizetype. */
5164 build_common_tree_nodes (int signed_char)
5166 error_mark_node = make_node (ERROR_MARK);
5167 TREE_TYPE (error_mark_node) = error_mark_node;
5169 initialize_sizetypes ();
5171 /* Define both `signed char' and `unsigned char'. */
5172 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5173 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5175 /* Define `char', which is like either `signed char' or `unsigned char'
5176 but not the same as either. */
5179 ? make_signed_type (CHAR_TYPE_SIZE)
5180 : make_unsigned_type (CHAR_TYPE_SIZE));
5182 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5183 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5184 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5185 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5186 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5187 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5188 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5189 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5191 /* Define a boolean type. This type only represents boolean values but
5192 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5193 Front ends which want to override this size (i.e. Java) can redefine
5194 boolean_type_node before calling build_common_tree_nodes_2. */
5195 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5196 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5197 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
5198 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
5199 TYPE_PRECISION (boolean_type_node) = 1;
5201 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
5202 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
5203 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
5204 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
5205 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
5207 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
5208 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
5209 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
5210 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
5211 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
5213 access_public_node = get_identifier ("public");
5214 access_protected_node = get_identifier ("protected");
5215 access_private_node = get_identifier ("private");
5218 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5219 It will create several other common tree nodes. */
5222 build_common_tree_nodes_2 (int short_double)
5224 /* Define these next since types below may used them. */
5225 integer_zero_node = build_int_2 (0, 0);
5226 integer_one_node = build_int_2 (1, 0);
5227 integer_minus_one_node = build_int_2 (-1, -1);
5229 size_zero_node = size_int (0);
5230 size_one_node = size_int (1);
5231 bitsize_zero_node = bitsize_int (0);
5232 bitsize_one_node = bitsize_int (1);
5233 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5235 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5236 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5238 void_type_node = make_node (VOID_TYPE);
5239 layout_type (void_type_node);
5241 /* We are not going to have real types in C with less than byte alignment,
5242 so we might as well not have any types that claim to have it. */
5243 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5244 TYPE_USER_ALIGN (void_type_node) = 0;
5246 null_pointer_node = build_int_2 (0, 0);
5247 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5248 layout_type (TREE_TYPE (null_pointer_node));
5250 ptr_type_node = build_pointer_type (void_type_node);
5252 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5254 float_type_node = make_node (REAL_TYPE);
5255 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5256 layout_type (float_type_node);
5258 double_type_node = make_node (REAL_TYPE);
5260 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5262 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5263 layout_type (double_type_node);
5265 long_double_type_node = make_node (REAL_TYPE);
5266 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5267 layout_type (long_double_type_node);
5269 float_ptr_type_node = build_pointer_type (float_type_node);
5270 double_ptr_type_node = build_pointer_type (double_type_node);
5271 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5272 integer_ptr_type_node = build_pointer_type (integer_type_node);
5274 complex_integer_type_node = make_node (COMPLEX_TYPE);
5275 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5276 layout_type (complex_integer_type_node);
5278 complex_float_type_node = make_node (COMPLEX_TYPE);
5279 TREE_TYPE (complex_float_type_node) = float_type_node;
5280 layout_type (complex_float_type_node);
5282 complex_double_type_node = make_node (COMPLEX_TYPE);
5283 TREE_TYPE (complex_double_type_node) = double_type_node;
5284 layout_type (complex_double_type_node);
5286 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5287 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5288 layout_type (complex_long_double_type_node);
5291 tree t = targetm.build_builtin_va_list ();
5293 /* Many back-ends define record types without setting TYPE_NAME.
5294 If we copied the record type here, we'd keep the original
5295 record type without a name. This breaks name mangling. So,
5296 don't copy record types and let c_common_nodes_and_builtins()
5297 declare the type to be __builtin_va_list. */
5298 if (TREE_CODE (t) != RECORD_TYPE)
5299 t = build_type_copy (t);
5301 va_list_type_node = t;
5305 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5308 If we requested a pointer to a vector, build up the pointers that
5309 we stripped off while looking for the inner type. Similarly for
5310 return values from functions.
5312 The argument TYPE is the top of the chain, and BOTTOM is the
5313 new type which we will point to. */
5316 reconstruct_complex_type (tree type, tree bottom)
5320 if (POINTER_TYPE_P (type))
5322 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5323 outer = build_pointer_type (inner);
5325 else if (TREE_CODE (type) == ARRAY_TYPE)
5327 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5328 outer = build_array_type (inner, TYPE_DOMAIN (type));
5330 else if (TREE_CODE (type) == FUNCTION_TYPE)
5332 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5333 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5335 else if (TREE_CODE (type) == METHOD_TYPE)
5337 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5338 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5340 TYPE_ARG_TYPES (type));
5345 TREE_READONLY (outer) = TREE_READONLY (type);
5346 TREE_THIS_VOLATILE (outer) = TREE_THIS_VOLATILE (type);
5351 /* Returns a vector tree node given a vector mode and inner type. */
5353 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5356 t = make_node (VECTOR_TYPE);
5357 TREE_TYPE (t) = innertype;
5358 TYPE_MODE (t) = mode;
5359 finish_vector_type (t);
5363 /* Similarly, but takes inner type and units. */
5366 build_vector_type (tree innertype, int nunits)
5368 enum machine_mode innermode = TYPE_MODE (innertype);
5369 enum machine_mode mode;
5371 if (GET_MODE_CLASS (innermode) == MODE_FLOAT)
5372 mode = MIN_MODE_VECTOR_FLOAT;
5374 mode = MIN_MODE_VECTOR_INT;
5376 for (; mode != VOIDmode ; mode = GET_MODE_WIDER_MODE (mode))
5377 if (GET_MODE_NUNITS (mode) == nunits && GET_MODE_INNER (mode) == innermode)
5378 return build_vector_type_for_mode (innertype, mode);
5383 /* Given an initializer INIT, return TRUE if INIT is zero or some
5384 aggregate of zeros. Otherwise return FALSE. */
5386 initializer_zerop (tree init)
5390 switch (TREE_CODE (init))
5393 return integer_zerop (init);
5395 return real_zerop (init)
5396 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5398 return integer_zerop (init)
5399 || (real_zerop (init)
5400 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5401 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5404 /* Set is empty if it has no elements. */
5405 if ((TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5406 && CONSTRUCTOR_ELTS (init))
5409 if (AGGREGATE_TYPE_P (TREE_TYPE (init)))
5411 tree aggr_init = CONSTRUCTOR_ELTS (init);
5415 if (! initializer_zerop (TREE_VALUE (aggr_init)))
5417 aggr_init = TREE_CHAIN (aggr_init);
5428 #include "gt-tree.h"