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"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
53 /* obstack.[ch] explicitly declined to prototype this. */
54 extern int _obstack_allocated_p (struct obstack *h, void *obj);
56 #ifdef GATHER_STATISTICS
57 /* Statistics-gathering stuff. */
59 int tree_node_counts[(int) all_kinds];
60 int tree_node_sizes[(int) all_kinds];
62 /* Keep in sync with tree.h:enum tree_node_kind. */
63 static const char * const tree_node_kind_names[] = {
82 #endif /* GATHER_STATISTICS */
84 /* Unique id for next decl created. */
85 static GTY(()) int next_decl_uid;
86 /* Unique id for next type created. */
87 static GTY(()) int next_type_uid = 1;
89 /* Since we cannot rehash a type after it is in the table, we have to
90 keep the hash code. */
92 struct type_hash GTY(())
98 /* Initial size of the hash table (rounded to next prime). */
99 #define TYPE_HASH_INITIAL_SIZE 1000
101 /* Now here is the hash table. When recording a type, it is added to
102 the slot whose index is the hash code. Note that the hash table is
103 used for several kinds of types (function types, array types and
104 array index range types, for now). While all these live in the
105 same table, they are completely independent, and the hash code is
106 computed differently for each of these. */
108 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
109 htab_t type_hash_table;
111 static void set_type_quals (tree, int);
112 static int type_hash_eq (const void *, const void *);
113 static hashval_t type_hash_hash (const void *);
114 static void print_type_hash_statistics (void);
115 static tree make_vector_type (tree, int, enum machine_mode);
116 static int type_hash_marked_p (const void *);
117 static unsigned int type_hash_list (tree, hashval_t);
118 static unsigned int attribute_hash_list (tree, hashval_t);
120 tree global_trees[TI_MAX];
121 tree integer_types[itk_none];
128 /* Initialize the hash table of types. */
129 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
134 /* The name of the object as the assembler will see it (but before any
135 translations made by ASM_OUTPUT_LABELREF). Often this is the same
136 as DECL_NAME. It is an IDENTIFIER_NODE. */
138 decl_assembler_name (tree decl)
140 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
141 lang_hooks.set_decl_assembler_name (decl);
142 return DECL_CHECK (decl)->decl.assembler_name;
145 /* Compute the number of bytes occupied by 'node'. This routine only
146 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
148 tree_size (tree node)
150 enum tree_code code = TREE_CODE (node);
152 switch (TREE_CODE_CLASS (code))
154 case 'd': /* A decl node */
155 return sizeof (struct tree_decl);
157 case 't': /* a type node */
158 return sizeof (struct tree_type);
160 case 'r': /* a reference */
161 case 'e': /* an expression */
162 case 's': /* an expression with side effects */
163 case '<': /* a comparison expression */
164 case '1': /* a unary arithmetic expression */
165 case '2': /* a binary arithmetic expression */
166 return (sizeof (struct tree_exp)
167 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
169 case 'c': /* a constant */
172 case INTEGER_CST: return sizeof (struct tree_int_cst);
173 case REAL_CST: return sizeof (struct tree_real_cst);
174 case COMPLEX_CST: return sizeof (struct tree_complex);
175 case VECTOR_CST: return sizeof (struct tree_vector);
176 case STRING_CST: return sizeof (struct tree_string);
178 return lang_hooks.tree_size (code);
181 case 'x': /* something random, like an identifier. */
184 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
185 case TREE_LIST: return sizeof (struct tree_list);
186 case TREE_VEC: return (sizeof (struct tree_vec)
187 + TREE_VEC_LENGTH(node) * sizeof(char *)
191 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
193 case PHI_NODE: return (sizeof (struct tree_phi_node)
194 + (PHI_ARG_CAPACITY (node) - 1) *
195 sizeof (struct phi_arg_d));
197 case SSA_NAME: return sizeof (struct tree_ssa_name);
199 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
200 case BLOCK: return sizeof (struct tree_block);
201 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
204 return lang_hooks.tree_size (code);
212 /* Return a newly allocated node of code CODE.
213 For decl and type nodes, some other fields are initialized.
214 The rest of the node is initialized to zero.
216 Achoo! I got a code in the node. */
219 make_node_stat (enum tree_code code MEM_STAT_DECL)
222 int type = TREE_CODE_CLASS (code);
224 #ifdef GATHER_STATISTICS
227 struct tree_common ttmp;
229 /* We can't allocate a TREE_VEC, PHI_NODE, or STRING_CST
230 without knowing how many elements it will have. */
231 if (code == TREE_VEC || code == PHI_NODE)
234 TREE_SET_CODE ((tree)&ttmp, code);
235 length = tree_size ((tree)&ttmp);
237 #ifdef GATHER_STATISTICS
240 case 'd': /* A decl node */
244 case 't': /* a type node */
248 case 's': /* an expression with side effects */
252 case 'r': /* a reference */
256 case 'e': /* an expression */
257 case '<': /* a comparison expression */
258 case '1': /* a unary arithmetic expression */
259 case '2': /* a binary arithmetic expression */
263 case 'c': /* a constant */
267 case 'x': /* something random, like an identifier. */
268 if (code == IDENTIFIER_NODE)
270 else if (code == TREE_VEC)
272 else if (code == TREE_BINFO)
274 else if (code == PHI_NODE)
276 else if (code == SSA_NAME)
277 kind = ssa_name_kind;
278 else if (code == BLOCK)
288 tree_node_counts[(int) kind]++;
289 tree_node_sizes[(int) kind] += length;
292 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
294 memset (t, 0, length);
296 TREE_SET_CODE (t, code);
301 TREE_SIDE_EFFECTS (t) = 1;
305 if (code != FUNCTION_DECL)
307 DECL_USER_ALIGN (t) = 0;
308 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
309 DECL_SOURCE_LOCATION (t) = input_location;
310 DECL_UID (t) = next_decl_uid++;
312 /* We have not yet computed the alias set for this declaration. */
313 DECL_POINTER_ALIAS_SET (t) = -1;
317 TYPE_UID (t) = next_type_uid++;
318 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
319 TYPE_USER_ALIGN (t) = 0;
320 TYPE_MAIN_VARIANT (t) = t;
322 /* Default to no attributes for type, but let target change that. */
323 TYPE_ATTRIBUTES (t) = NULL_TREE;
324 targetm.set_default_type_attributes (t);
326 /* We have not yet computed the alias set for this type. */
327 TYPE_ALIAS_SET (t) = -1;
331 TREE_CONSTANT (t) = 1;
332 TREE_INVARIANT (t) = 1;
341 case PREDECREMENT_EXPR:
342 case PREINCREMENT_EXPR:
343 case POSTDECREMENT_EXPR:
344 case POSTINCREMENT_EXPR:
345 /* All of these have side-effects, no matter what their
347 TREE_SIDE_EFFECTS (t) = 1;
359 /* Return a new node with the same contents as NODE except that its
360 TREE_CHAIN is zero and it has a fresh uid. */
363 copy_node_stat (tree node MEM_STAT_DECL)
366 enum tree_code code = TREE_CODE (node);
369 #ifdef ENABLE_CHECKING
370 if (code == STATEMENT_LIST)
374 length = tree_size (node);
375 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
376 memcpy (t, node, length);
379 TREE_ASM_WRITTEN (t) = 0;
380 TREE_VISITED (t) = 0;
383 if (TREE_CODE_CLASS (code) == 'd')
384 DECL_UID (t) = next_decl_uid++;
385 else if (TREE_CODE_CLASS (code) == 't')
387 TYPE_UID (t) = next_type_uid++;
388 /* The following is so that the debug code for
389 the copy is different from the original type.
390 The two statements usually duplicate each other
391 (because they clear fields of the same union),
392 but the optimizer should catch that. */
393 TYPE_SYMTAB_POINTER (t) = 0;
394 TYPE_SYMTAB_ADDRESS (t) = 0;
396 /* Do not copy the values cache. */
397 if (TYPE_CACHED_VALUES_P(t))
399 TYPE_CACHED_VALUES_P (t) = 0;
400 TYPE_CACHED_VALUES (t) = NULL_TREE;
407 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
408 For example, this can copy a list made of TREE_LIST nodes. */
411 copy_list (tree list)
419 head = prev = copy_node (list);
420 next = TREE_CHAIN (list);
423 TREE_CHAIN (prev) = copy_node (next);
424 prev = TREE_CHAIN (prev);
425 next = TREE_CHAIN (next);
431 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
432 integer_type_node is used. */
435 build_int_cst (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
442 type = integer_type_node;
444 switch (TREE_CODE (type))
448 /* Cache NULL pointer. */
457 /* Cache false or true. */
466 if (TYPE_UNSIGNED (type))
469 limit = INTEGER_SHARE_LIMIT;
470 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
476 limit = INTEGER_SHARE_LIMIT + 1;
477 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
479 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
489 if (!TYPE_CACHED_VALUES_P (type))
491 TYPE_CACHED_VALUES_P (type) = 1;
492 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
495 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
498 /* Make sure no one is clobbering the shared constant. */
499 if (TREE_TYPE (t) != type)
501 if (TREE_INT_CST_LOW (t) != low || TREE_INT_CST_HIGH (t) != hi)
507 t = make_node (INTEGER_CST);
509 TREE_INT_CST_LOW (t) = low;
510 TREE_INT_CST_HIGH (t) = hi;
511 TREE_TYPE (t) = type;
514 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
519 /* Return a new VECTOR_CST node whose type is TYPE and whose values
520 are in a list pointed by VALS. */
523 build_vector (tree type, tree vals)
525 tree v = make_node (VECTOR_CST);
526 int over1 = 0, over2 = 0;
529 TREE_VECTOR_CST_ELTS (v) = vals;
530 TREE_TYPE (v) = type;
532 /* Iterate through elements and check for overflow. */
533 for (link = vals; link; link = TREE_CHAIN (link))
535 tree value = TREE_VALUE (link);
537 over1 |= TREE_OVERFLOW (value);
538 over2 |= TREE_CONSTANT_OVERFLOW (value);
541 TREE_OVERFLOW (v) = over1;
542 TREE_CONSTANT_OVERFLOW (v) = over2;
547 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
548 are in a list pointed to by VALS. */
550 build_constructor (tree type, tree vals)
552 tree c = make_node (CONSTRUCTOR);
553 TREE_TYPE (c) = type;
554 CONSTRUCTOR_ELTS (c) = vals;
556 /* ??? May not be necessary. Mirrors what build does. */
559 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
560 TREE_READONLY (c) = TREE_READONLY (vals);
561 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
562 TREE_INVARIANT (c) = TREE_INVARIANT (vals);
568 /* Return a new REAL_CST node whose type is TYPE and value is D. */
571 build_real (tree type, REAL_VALUE_TYPE d)
577 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
578 Consider doing it via real_convert now. */
580 v = make_node (REAL_CST);
581 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
582 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
584 TREE_TYPE (v) = type;
585 TREE_REAL_CST_PTR (v) = dp;
586 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
590 /* Return a new REAL_CST node whose type is TYPE
591 and whose value is the integer value of the INTEGER_CST node I. */
594 real_value_from_int_cst (tree type, tree i)
598 /* Clear all bits of the real value type so that we can later do
599 bitwise comparisons to see if two values are the same. */
600 memset (&d, 0, sizeof d);
602 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
603 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
604 TYPE_UNSIGNED (TREE_TYPE (i)));
608 /* Given a tree representing an integer constant I, return a tree
609 representing the same value as a floating-point constant of type TYPE. */
612 build_real_from_int_cst (tree type, tree i)
615 int overflow = TREE_OVERFLOW (i);
617 v = build_real (type, real_value_from_int_cst (type, i));
619 TREE_OVERFLOW (v) |= overflow;
620 TREE_CONSTANT_OVERFLOW (v) |= overflow;
624 /* Return a newly constructed STRING_CST node whose value is
625 the LEN characters at STR.
626 The TREE_TYPE is not initialized. */
629 build_string (int len, const char *str)
631 tree s = make_node (STRING_CST);
633 TREE_STRING_LENGTH (s) = len;
634 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
639 /* Return a newly constructed COMPLEX_CST node whose value is
640 specified by the real and imaginary parts REAL and IMAG.
641 Both REAL and IMAG should be constant nodes. TYPE, if specified,
642 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
645 build_complex (tree type, tree real, tree imag)
647 tree t = make_node (COMPLEX_CST);
649 TREE_REALPART (t) = real;
650 TREE_IMAGPART (t) = imag;
651 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
652 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
653 TREE_CONSTANT_OVERFLOW (t)
654 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
658 /* Build a BINFO with LEN language slots. */
661 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
664 size_t length = (offsetof (struct tree_binfo, base_binfos)
665 + VEC_embedded_size (tree, base_binfos));
667 #ifdef GATHER_STATISTICS
668 tree_node_counts[(int) binfo_kind]++;
669 tree_node_sizes[(int) binfo_kind] += length;
672 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
674 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
676 TREE_SET_CODE (t, TREE_BINFO);
678 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
684 /* Build a newly constructed TREE_VEC node of length LEN. */
687 make_tree_vec_stat (int len MEM_STAT_DECL)
690 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
692 #ifdef GATHER_STATISTICS
693 tree_node_counts[(int) vec_kind]++;
694 tree_node_sizes[(int) vec_kind] += length;
697 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
699 memset (t, 0, length);
701 TREE_SET_CODE (t, TREE_VEC);
702 TREE_VEC_LENGTH (t) = len;
707 /* Return 1 if EXPR is the integer constant zero or a complex constant
711 integer_zerop (tree expr)
715 return ((TREE_CODE (expr) == INTEGER_CST
716 && ! TREE_CONSTANT_OVERFLOW (expr)
717 && TREE_INT_CST_LOW (expr) == 0
718 && TREE_INT_CST_HIGH (expr) == 0)
719 || (TREE_CODE (expr) == COMPLEX_CST
720 && integer_zerop (TREE_REALPART (expr))
721 && integer_zerop (TREE_IMAGPART (expr))));
724 /* Return 1 if EXPR is the integer constant one or the corresponding
728 integer_onep (tree expr)
732 return ((TREE_CODE (expr) == INTEGER_CST
733 && ! TREE_CONSTANT_OVERFLOW (expr)
734 && TREE_INT_CST_LOW (expr) == 1
735 && TREE_INT_CST_HIGH (expr) == 0)
736 || (TREE_CODE (expr) == COMPLEX_CST
737 && integer_onep (TREE_REALPART (expr))
738 && integer_zerop (TREE_IMAGPART (expr))));
741 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
742 it contains. Likewise for the corresponding complex constant. */
745 integer_all_onesp (tree expr)
752 if (TREE_CODE (expr) == COMPLEX_CST
753 && integer_all_onesp (TREE_REALPART (expr))
754 && integer_zerop (TREE_IMAGPART (expr)))
757 else if (TREE_CODE (expr) != INTEGER_CST
758 || TREE_CONSTANT_OVERFLOW (expr))
761 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
763 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
764 && TREE_INT_CST_HIGH (expr) == -1);
766 /* Note that using TYPE_PRECISION here is wrong. We care about the
767 actual bits, not the (arbitrary) range of the type. */
768 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
769 if (prec >= HOST_BITS_PER_WIDE_INT)
771 HOST_WIDE_INT high_value;
774 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
776 if (shift_amount > HOST_BITS_PER_WIDE_INT)
777 /* Can not handle precisions greater than twice the host int size. */
779 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
780 /* Shifting by the host word size is undefined according to the ANSI
781 standard, so we must handle this as a special case. */
784 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
786 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
787 && TREE_INT_CST_HIGH (expr) == high_value);
790 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
793 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
797 integer_pow2p (tree expr)
800 HOST_WIDE_INT high, low;
804 if (TREE_CODE (expr) == COMPLEX_CST
805 && integer_pow2p (TREE_REALPART (expr))
806 && integer_zerop (TREE_IMAGPART (expr)))
809 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
812 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
813 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
814 high = TREE_INT_CST_HIGH (expr);
815 low = TREE_INT_CST_LOW (expr);
817 /* First clear all bits that are beyond the type's precision in case
818 we've been sign extended. */
820 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
822 else if (prec > HOST_BITS_PER_WIDE_INT)
823 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
827 if (prec < HOST_BITS_PER_WIDE_INT)
828 low &= ~((HOST_WIDE_INT) (-1) << prec);
831 if (high == 0 && low == 0)
834 return ((high == 0 && (low & (low - 1)) == 0)
835 || (low == 0 && (high & (high - 1)) == 0));
838 /* Return 1 if EXPR is an integer constant other than zero or a
839 complex constant other than zero. */
842 integer_nonzerop (tree expr)
846 return ((TREE_CODE (expr) == INTEGER_CST
847 && ! TREE_CONSTANT_OVERFLOW (expr)
848 && (TREE_INT_CST_LOW (expr) != 0
849 || TREE_INT_CST_HIGH (expr) != 0))
850 || (TREE_CODE (expr) == COMPLEX_CST
851 && (integer_nonzerop (TREE_REALPART (expr))
852 || integer_nonzerop (TREE_IMAGPART (expr)))));
855 /* Return the power of two represented by a tree node known to be a
859 tree_log2 (tree expr)
862 HOST_WIDE_INT high, low;
866 if (TREE_CODE (expr) == COMPLEX_CST)
867 return tree_log2 (TREE_REALPART (expr));
869 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
870 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
872 high = TREE_INT_CST_HIGH (expr);
873 low = TREE_INT_CST_LOW (expr);
875 /* First clear all bits that are beyond the type's precision in case
876 we've been sign extended. */
878 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
880 else if (prec > HOST_BITS_PER_WIDE_INT)
881 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
885 if (prec < HOST_BITS_PER_WIDE_INT)
886 low &= ~((HOST_WIDE_INT) (-1) << prec);
889 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
893 /* Similar, but return the largest integer Y such that 2 ** Y is less
894 than or equal to EXPR. */
897 tree_floor_log2 (tree expr)
900 HOST_WIDE_INT high, low;
904 if (TREE_CODE (expr) == COMPLEX_CST)
905 return tree_log2 (TREE_REALPART (expr));
907 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
908 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
910 high = TREE_INT_CST_HIGH (expr);
911 low = TREE_INT_CST_LOW (expr);
913 /* First clear all bits that are beyond the type's precision in case
914 we've been sign extended. Ignore if type's precision hasn't been set
915 since what we are doing is setting it. */
917 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
919 else if (prec > HOST_BITS_PER_WIDE_INT)
920 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
924 if (prec < HOST_BITS_PER_WIDE_INT)
925 low &= ~((HOST_WIDE_INT) (-1) << prec);
928 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
932 /* Return 1 if EXPR is the real constant zero. */
935 real_zerop (tree expr)
939 return ((TREE_CODE (expr) == REAL_CST
940 && ! TREE_CONSTANT_OVERFLOW (expr)
941 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
942 || (TREE_CODE (expr) == COMPLEX_CST
943 && real_zerop (TREE_REALPART (expr))
944 && real_zerop (TREE_IMAGPART (expr))));
947 /* Return 1 if EXPR is the real constant one in real or complex form. */
950 real_onep (tree expr)
954 return ((TREE_CODE (expr) == REAL_CST
955 && ! TREE_CONSTANT_OVERFLOW (expr)
956 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
957 || (TREE_CODE (expr) == COMPLEX_CST
958 && real_onep (TREE_REALPART (expr))
959 && real_zerop (TREE_IMAGPART (expr))));
962 /* Return 1 if EXPR is the real constant two. */
965 real_twop (tree expr)
969 return ((TREE_CODE (expr) == REAL_CST
970 && ! TREE_CONSTANT_OVERFLOW (expr)
971 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
972 || (TREE_CODE (expr) == COMPLEX_CST
973 && real_twop (TREE_REALPART (expr))
974 && real_zerop (TREE_IMAGPART (expr))));
977 /* Return 1 if EXPR is the real constant minus one. */
980 real_minus_onep (tree expr)
984 return ((TREE_CODE (expr) == REAL_CST
985 && ! TREE_CONSTANT_OVERFLOW (expr)
986 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
987 || (TREE_CODE (expr) == COMPLEX_CST
988 && real_minus_onep (TREE_REALPART (expr))
989 && real_zerop (TREE_IMAGPART (expr))));
992 /* Nonzero if EXP is a constant or a cast of a constant. */
995 really_constant_p (tree exp)
997 /* This is not quite the same as STRIP_NOPS. It does more. */
998 while (TREE_CODE (exp) == NOP_EXPR
999 || TREE_CODE (exp) == CONVERT_EXPR
1000 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1001 exp = TREE_OPERAND (exp, 0);
1002 return TREE_CONSTANT (exp);
1005 /* Return first list element whose TREE_VALUE is ELEM.
1006 Return 0 if ELEM is not in LIST. */
1009 value_member (tree elem, tree list)
1013 if (elem == TREE_VALUE (list))
1015 list = TREE_CHAIN (list);
1020 /* Return first list element whose TREE_PURPOSE is ELEM.
1021 Return 0 if ELEM is not in LIST. */
1024 purpose_member (tree elem, tree list)
1028 if (elem == TREE_PURPOSE (list))
1030 list = TREE_CHAIN (list);
1035 /* Return nonzero if ELEM is part of the chain CHAIN. */
1038 chain_member (tree elem, tree chain)
1044 chain = TREE_CHAIN (chain);
1050 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1051 We expect a null pointer to mark the end of the chain.
1052 This is the Lisp primitive `length'. */
1055 list_length (tree t)
1058 #ifdef ENABLE_TREE_CHECKING
1066 #ifdef ENABLE_TREE_CHECKING
1078 /* Returns the number of FIELD_DECLs in TYPE. */
1081 fields_length (tree type)
1083 tree t = TYPE_FIELDS (type);
1086 for (; t; t = TREE_CHAIN (t))
1087 if (TREE_CODE (t) == FIELD_DECL)
1093 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1094 by modifying the last node in chain 1 to point to chain 2.
1095 This is the Lisp primitive `nconc'. */
1098 chainon (tree op1, tree op2)
1107 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1109 TREE_CHAIN (t1) = op2;
1111 #ifdef ENABLE_TREE_CHECKING
1114 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1116 abort (); /* Circularity created. */
1123 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1126 tree_last (tree chain)
1130 while ((next = TREE_CHAIN (chain)))
1135 /* Reverse the order of elements in the chain T,
1136 and return the new head of the chain (old last element). */
1141 tree prev = 0, decl, next;
1142 for (decl = t; decl; decl = next)
1144 next = TREE_CHAIN (decl);
1145 TREE_CHAIN (decl) = prev;
1151 /* Return a newly created TREE_LIST node whose
1152 purpose and value fields are PARM and VALUE. */
1155 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1157 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1158 TREE_PURPOSE (t) = parm;
1159 TREE_VALUE (t) = value;
1163 /* Return a newly created TREE_LIST node whose
1164 purpose and value fields are PURPOSE and VALUE
1165 and whose TREE_CHAIN is CHAIN. */
1168 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1172 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1173 tree_zone PASS_MEM_STAT);
1175 memset (node, 0, sizeof (struct tree_common));
1177 #ifdef GATHER_STATISTICS
1178 tree_node_counts[(int) x_kind]++;
1179 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1182 TREE_SET_CODE (node, TREE_LIST);
1183 TREE_CHAIN (node) = chain;
1184 TREE_PURPOSE (node) = purpose;
1185 TREE_VALUE (node) = value;
1190 /* Return the size nominally occupied by an object of type TYPE
1191 when it resides in memory. The value is measured in units of bytes,
1192 and its data type is that normally used for type sizes
1193 (which is the first type created by make_signed_type or
1194 make_unsigned_type). */
1197 size_in_bytes (tree type)
1201 if (type == error_mark_node)
1202 return integer_zero_node;
1204 type = TYPE_MAIN_VARIANT (type);
1205 t = TYPE_SIZE_UNIT (type);
1209 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1210 return size_zero_node;
1213 if (TREE_CODE (t) == INTEGER_CST)
1214 t = force_fit_type (t, 0, false, false);
1219 /* Return the size of TYPE (in bytes) as a wide integer
1220 or return -1 if the size can vary or is larger than an integer. */
1223 int_size_in_bytes (tree type)
1227 if (type == error_mark_node)
1230 type = TYPE_MAIN_VARIANT (type);
1231 t = TYPE_SIZE_UNIT (type);
1233 || TREE_CODE (t) != INTEGER_CST
1234 || TREE_OVERFLOW (t)
1235 || TREE_INT_CST_HIGH (t) != 0
1236 /* If the result would appear negative, it's too big to represent. */
1237 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1240 return TREE_INT_CST_LOW (t);
1243 /* Return the bit position of FIELD, in bits from the start of the record.
1244 This is a tree of type bitsizetype. */
1247 bit_position (tree field)
1249 return bit_from_pos (DECL_FIELD_OFFSET (field),
1250 DECL_FIELD_BIT_OFFSET (field));
1253 /* Likewise, but return as an integer. Abort if it cannot be represented
1254 in that way (since it could be a signed value, we don't have the option
1255 of returning -1 like int_size_in_byte can. */
1258 int_bit_position (tree field)
1260 return tree_low_cst (bit_position (field), 0);
1263 /* Return the byte position of FIELD, in bytes from the start of the record.
1264 This is a tree of type sizetype. */
1267 byte_position (tree field)
1269 return byte_from_pos (DECL_FIELD_OFFSET (field),
1270 DECL_FIELD_BIT_OFFSET (field));
1273 /* Likewise, but return as an integer. Abort if it cannot be represented
1274 in that way (since it could be a signed value, we don't have the option
1275 of returning -1 like int_size_in_byte can. */
1278 int_byte_position (tree field)
1280 return tree_low_cst (byte_position (field), 0);
1283 /* Return the strictest alignment, in bits, that T is known to have. */
1288 unsigned int align0, align1;
1290 switch (TREE_CODE (t))
1292 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1293 /* If we have conversions, we know that the alignment of the
1294 object must meet each of the alignments of the types. */
1295 align0 = expr_align (TREE_OPERAND (t, 0));
1296 align1 = TYPE_ALIGN (TREE_TYPE (t));
1297 return MAX (align0, align1);
1299 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1300 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1301 case CLEANUP_POINT_EXPR:
1302 /* These don't change the alignment of an object. */
1303 return expr_align (TREE_OPERAND (t, 0));
1306 /* The best we can do is say that the alignment is the least aligned
1308 align0 = expr_align (TREE_OPERAND (t, 1));
1309 align1 = expr_align (TREE_OPERAND (t, 2));
1310 return MIN (align0, align1);
1312 case LABEL_DECL: case CONST_DECL:
1313 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1314 if (DECL_ALIGN (t) != 0)
1315 return DECL_ALIGN (t);
1319 return FUNCTION_BOUNDARY;
1325 /* Otherwise take the alignment from that of the type. */
1326 return TYPE_ALIGN (TREE_TYPE (t));
1329 /* Return, as a tree node, the number of elements for TYPE (which is an
1330 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1333 array_type_nelts (tree type)
1335 tree index_type, min, max;
1337 /* If they did it with unspecified bounds, then we should have already
1338 given an error about it before we got here. */
1339 if (! TYPE_DOMAIN (type))
1340 return error_mark_node;
1342 index_type = TYPE_DOMAIN (type);
1343 min = TYPE_MIN_VALUE (index_type);
1344 max = TYPE_MAX_VALUE (index_type);
1346 return (integer_zerop (min)
1348 : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min)));
1351 /* Return true if arg is static -- a reference to an object in
1352 static storage. This is not the same as the C meaning of `static'. */
1357 switch (TREE_CODE (arg))
1360 /* Nested functions aren't static, since taking their address
1361 involves a trampoline. */
1362 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1363 && ! DECL_NON_ADDR_CONST_P (arg));
1366 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1367 && ! DECL_THREAD_LOCAL (arg)
1368 && ! DECL_NON_ADDR_CONST_P (arg));
1371 return TREE_STATIC (arg);
1378 /* If the thing being referenced is not a field, then it is
1379 something language specific. */
1380 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1381 return (*lang_hooks.staticp) (arg);
1383 /* If we are referencing a bitfield, we can't evaluate an
1384 ADDR_EXPR at compile time and so it isn't a constant. */
1385 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1388 return staticp (TREE_OPERAND (arg, 0));
1394 /* This case is technically correct, but results in setting
1395 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1398 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1402 case ARRAY_RANGE_REF:
1403 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1404 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1405 return staticp (TREE_OPERAND (arg, 0));
1410 if ((unsigned int) TREE_CODE (arg)
1411 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1412 return lang_hooks.staticp (arg);
1418 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1419 Do this to any expression which may be used in more than one place,
1420 but must be evaluated only once.
1422 Normally, expand_expr would reevaluate the expression each time.
1423 Calling save_expr produces something that is evaluated and recorded
1424 the first time expand_expr is called on it. Subsequent calls to
1425 expand_expr just reuse the recorded value.
1427 The call to expand_expr that generates code that actually computes
1428 the value is the first call *at compile time*. Subsequent calls
1429 *at compile time* generate code to use the saved value.
1430 This produces correct result provided that *at run time* control
1431 always flows through the insns made by the first expand_expr
1432 before reaching the other places where the save_expr was evaluated.
1433 You, the caller of save_expr, must make sure this is so.
1435 Constants, and certain read-only nodes, are returned with no
1436 SAVE_EXPR because that is safe. Expressions containing placeholders
1437 are not touched; see tree.def for an explanation of what these
1441 save_expr (tree expr)
1443 tree t = fold (expr);
1446 /* If the tree evaluates to a constant, then we don't want to hide that
1447 fact (i.e. this allows further folding, and direct checks for constants).
1448 However, a read-only object that has side effects cannot be bypassed.
1449 Since it is no problem to reevaluate literals, we just return the
1451 inner = skip_simple_arithmetic (t);
1453 if (TREE_INVARIANT (inner)
1454 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1455 || TREE_CODE (inner) == SAVE_EXPR
1456 || TREE_CODE (inner) == ERROR_MARK)
1459 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1460 it means that the size or offset of some field of an object depends on
1461 the value within another field.
1463 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1464 and some variable since it would then need to be both evaluated once and
1465 evaluated more than once. Front-ends must assure this case cannot
1466 happen by surrounding any such subexpressions in their own SAVE_EXPR
1467 and forcing evaluation at the proper time. */
1468 if (contains_placeholder_p (inner))
1471 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1473 /* This expression might be placed ahead of a jump to ensure that the
1474 value was computed on both sides of the jump. So make sure it isn't
1475 eliminated as dead. */
1476 TREE_SIDE_EFFECTS (t) = 1;
1477 TREE_READONLY (t) = 1;
1478 TREE_INVARIANT (t) = 1;
1482 /* Look inside EXPR and into any simple arithmetic operations. Return
1483 the innermost non-arithmetic node. */
1486 skip_simple_arithmetic (tree expr)
1490 /* We don't care about whether this can be used as an lvalue in this
1492 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1493 expr = TREE_OPERAND (expr, 0);
1495 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1496 a constant, it will be more efficient to not make another SAVE_EXPR since
1497 it will allow better simplification and GCSE will be able to merge the
1498 computations if they actually occur. */
1502 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1503 inner = TREE_OPERAND (inner, 0);
1504 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1506 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1507 inner = TREE_OPERAND (inner, 0);
1508 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1509 inner = TREE_OPERAND (inner, 1);
1520 /* Returns the index of the first non-tree operand for CODE, or the number
1521 of operands if all are trees. */
1524 first_rtl_op (enum tree_code code)
1529 return TREE_CODE_LENGTH (code);
1533 /* Return which tree structure is used by T. */
1535 enum tree_node_structure_enum
1536 tree_node_structure (tree t)
1538 enum tree_code code = TREE_CODE (t);
1540 switch (TREE_CODE_CLASS (code))
1542 case 'd': return TS_DECL;
1543 case 't': return TS_TYPE;
1544 case 'r': case '<': case '1': case '2': case 'e': case 's':
1546 default: /* 'c' and 'x' */
1552 case INTEGER_CST: return TS_INT_CST;
1553 case REAL_CST: return TS_REAL_CST;
1554 case COMPLEX_CST: return TS_COMPLEX;
1555 case VECTOR_CST: return TS_VECTOR;
1556 case STRING_CST: return TS_STRING;
1558 case ERROR_MARK: return TS_COMMON;
1559 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1560 case TREE_LIST: return TS_LIST;
1561 case TREE_VEC: return TS_VEC;
1562 case PHI_NODE: return TS_PHI_NODE;
1563 case SSA_NAME: return TS_SSA_NAME;
1564 case PLACEHOLDER_EXPR: return TS_COMMON;
1565 case STATEMENT_LIST: return TS_STATEMENT_LIST;
1566 case BLOCK: return TS_BLOCK;
1567 case TREE_BINFO: return TS_BINFO;
1568 case VALUE_HANDLE: return TS_VALUE_HANDLE;
1575 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1576 or offset that depends on a field within a record. */
1579 contains_placeholder_p (tree exp)
1581 enum tree_code code;
1586 code = TREE_CODE (exp);
1587 if (code == PLACEHOLDER_EXPR)
1590 switch (TREE_CODE_CLASS (code))
1593 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1594 position computations since they will be converted into a
1595 WITH_RECORD_EXPR involving the reference, which will assume
1596 here will be valid. */
1597 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1600 if (code == TREE_LIST)
1601 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1602 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1611 /* Ignoring the first operand isn't quite right, but works best. */
1612 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1615 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1616 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1617 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1623 switch (first_rtl_op (code))
1626 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1628 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1629 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1640 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1641 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1645 type_contains_placeholder_p (tree type)
1647 /* If the size contains a placeholder or the parent type (component type in
1648 the case of arrays) type involves a placeholder, this type does. */
1649 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1650 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1651 || (TREE_TYPE (type) != 0
1652 && type_contains_placeholder_p (TREE_TYPE (type))))
1655 /* Now do type-specific checks. Note that the last part of the check above
1656 greatly limits what we have to do below. */
1657 switch (TREE_CODE (type))
1666 case REFERENCE_TYPE:
1674 /* Here we just check the bounds. */
1675 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1676 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1681 /* We're already checked the component type (TREE_TYPE), so just check
1683 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1687 case QUAL_UNION_TYPE:
1689 static tree seen_types = 0;
1693 /* We have to be careful here that we don't end up in infinite
1694 recursions due to a field of a type being a pointer to that type
1695 or to a mutually-recursive type. So we store a list of record
1696 types that we've seen and see if this type is in them. To save
1697 memory, we don't use a list for just one type. Here we check
1698 whether we've seen this type before and store it if not. */
1699 if (seen_types == 0)
1701 else if (TREE_CODE (seen_types) != TREE_LIST)
1703 if (seen_types == type)
1706 seen_types = tree_cons (NULL_TREE, type,
1707 build_tree_list (NULL_TREE, seen_types));
1711 if (value_member (type, seen_types) != 0)
1714 seen_types = tree_cons (NULL_TREE, type, seen_types);
1717 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1718 if (TREE_CODE (field) == FIELD_DECL
1719 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1720 || (TREE_CODE (type) == QUAL_UNION_TYPE
1721 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1722 || type_contains_placeholder_p (TREE_TYPE (field))))
1728 /* Now remove us from seen_types and return the result. */
1729 if (seen_types == type)
1732 seen_types = TREE_CHAIN (seen_types);
1742 /* Return 1 if EXP contains any expressions that produce cleanups for an
1743 outer scope to deal with. Used by fold. */
1746 has_cleanups (tree exp)
1750 if (! TREE_SIDE_EFFECTS (exp))
1753 switch (TREE_CODE (exp))
1756 case WITH_CLEANUP_EXPR:
1759 case CLEANUP_POINT_EXPR:
1763 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1765 cmp = has_cleanups (TREE_VALUE (exp));
1772 return (DECL_INITIAL (DECL_EXPR_DECL (exp))
1773 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp))));
1779 /* This general rule works for most tree codes. All exceptions should be
1780 handled above. If this is a language-specific tree code, we can't
1781 trust what might be in the operand, so say we don't know
1783 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1786 nops = first_rtl_op (TREE_CODE (exp));
1787 for (i = 0; i < nops; i++)
1788 if (TREE_OPERAND (exp, i) != 0)
1790 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1791 if (type == 'e' || type == '<' || type == '1' || type == '2'
1792 || type == 'r' || type == 's')
1794 cmp = has_cleanups (TREE_OPERAND (exp, i));
1803 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1804 return a tree with all occurrences of references to F in a
1805 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1806 contains only arithmetic expressions or a CALL_EXPR with a
1807 PLACEHOLDER_EXPR occurring only in its arglist. */
1810 substitute_in_expr (tree exp, tree f, tree r)
1812 enum tree_code code = TREE_CODE (exp);
1817 /* We handle TREE_LIST and COMPONENT_REF separately. */
1818 if (code == TREE_LIST)
1820 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1821 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1822 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1825 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1827 else if (code == COMPONENT_REF)
1829 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1830 and it is the right field, replace it with R. */
1831 for (inner = TREE_OPERAND (exp, 0);
1832 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1833 inner = TREE_OPERAND (inner, 0))
1835 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1836 && TREE_OPERAND (exp, 1) == f)
1839 /* If this expression hasn't been completed let, leave it alone. */
1840 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1843 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1844 if (op0 == TREE_OPERAND (exp, 0))
1847 new = fold (build3 (COMPONENT_REF, TREE_TYPE (exp),
1848 op0, TREE_OPERAND (exp, 1), NULL_TREE));
1851 switch (TREE_CODE_CLASS (code))
1863 switch (first_rtl_op (code))
1869 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1870 if (op0 == TREE_OPERAND (exp, 0))
1873 new = fold (build1 (code, TREE_TYPE (exp), op0));
1877 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1878 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1880 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1883 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1887 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1888 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1889 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1891 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1892 && op2 == TREE_OPERAND (exp, 2))
1895 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1907 TREE_READONLY (new) = TREE_READONLY (exp);
1911 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1912 for it within OBJ, a tree that is an object or a chain of references. */
1915 substitute_placeholder_in_expr (tree exp, tree obj)
1917 enum tree_code code = TREE_CODE (exp);
1918 tree op0, op1, op2, op3;
1920 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
1921 in the chain of OBJ. */
1922 if (code == PLACEHOLDER_EXPR)
1924 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
1927 for (elt = obj; elt != 0;
1928 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1929 || TREE_CODE (elt) == COND_EXPR)
1930 ? TREE_OPERAND (elt, 1)
1931 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1932 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
1933 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
1934 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
1935 ? TREE_OPERAND (elt, 0) : 0))
1936 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
1939 for (elt = obj; elt != 0;
1940 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1941 || TREE_CODE (elt) == COND_EXPR)
1942 ? TREE_OPERAND (elt, 1)
1943 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1944 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
1945 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
1946 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
1947 ? TREE_OPERAND (elt, 0) : 0))
1948 if (POINTER_TYPE_P (TREE_TYPE (elt))
1949 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
1951 return fold (build1 (INDIRECT_REF, need_type, elt));
1953 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
1954 survives until RTL generation, there will be an error. */
1958 /* TREE_LIST is special because we need to look at TREE_VALUE
1959 and TREE_CHAIN, not TREE_OPERANDS. */
1960 else if (code == TREE_LIST)
1962 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
1963 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
1964 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1967 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1970 switch (TREE_CODE_CLASS (code))
1983 switch (first_rtl_op (code))
1989 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
1990 if (op0 == TREE_OPERAND (exp, 0))
1993 return fold (build1 (code, TREE_TYPE (exp), op0));
1996 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
1997 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
1999 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2002 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2005 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2006 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2007 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2009 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2010 && op2 == TREE_OPERAND (exp, 2))
2013 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2016 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2017 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2018 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2019 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2021 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2022 && op2 == TREE_OPERAND (exp, 2)
2023 && op3 == TREE_OPERAND (exp, 3))
2026 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2038 /* Stabilize a reference so that we can use it any number of times
2039 without causing its operands to be evaluated more than once.
2040 Returns the stabilized reference. This works by means of save_expr,
2041 so see the caveats in the comments about save_expr.
2043 Also allows conversion expressions whose operands are references.
2044 Any other kind of expression is returned unchanged. */
2047 stabilize_reference (tree ref)
2050 enum tree_code code = TREE_CODE (ref);
2057 /* No action is needed in this case. */
2063 case FIX_TRUNC_EXPR:
2064 case FIX_FLOOR_EXPR:
2065 case FIX_ROUND_EXPR:
2067 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2071 result = build_nt (INDIRECT_REF,
2072 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2076 result = build_nt (COMPONENT_REF,
2077 stabilize_reference (TREE_OPERAND (ref, 0)),
2078 TREE_OPERAND (ref, 1), NULL_TREE);
2082 result = build_nt (BIT_FIELD_REF,
2083 stabilize_reference (TREE_OPERAND (ref, 0)),
2084 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2085 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2089 result = build_nt (ARRAY_REF,
2090 stabilize_reference (TREE_OPERAND (ref, 0)),
2091 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2092 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2095 case ARRAY_RANGE_REF:
2096 result = build_nt (ARRAY_RANGE_REF,
2097 stabilize_reference (TREE_OPERAND (ref, 0)),
2098 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2099 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2103 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2104 it wouldn't be ignored. This matters when dealing with
2106 return stabilize_reference_1 (ref);
2108 /* If arg isn't a kind of lvalue we recognize, make no change.
2109 Caller should recognize the error for an invalid lvalue. */
2114 return error_mark_node;
2117 TREE_TYPE (result) = TREE_TYPE (ref);
2118 TREE_READONLY (result) = TREE_READONLY (ref);
2119 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2120 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2125 /* Subroutine of stabilize_reference; this is called for subtrees of
2126 references. Any expression with side-effects must be put in a SAVE_EXPR
2127 to ensure that it is only evaluated once.
2129 We don't put SAVE_EXPR nodes around everything, because assigning very
2130 simple expressions to temporaries causes us to miss good opportunities
2131 for optimizations. Among other things, the opportunity to fold in the
2132 addition of a constant into an addressing mode often gets lost, e.g.
2133 "y[i+1] += x;". In general, we take the approach that we should not make
2134 an assignment unless we are forced into it - i.e., that any non-side effect
2135 operator should be allowed, and that cse should take care of coalescing
2136 multiple utterances of the same expression should that prove fruitful. */
2139 stabilize_reference_1 (tree e)
2142 enum tree_code code = TREE_CODE (e);
2144 /* We cannot ignore const expressions because it might be a reference
2145 to a const array but whose index contains side-effects. But we can
2146 ignore things that are actual constant or that already have been
2147 handled by this function. */
2149 if (TREE_INVARIANT (e))
2152 switch (TREE_CODE_CLASS (code))
2161 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2162 so that it will only be evaluated once. */
2163 /* The reference (r) and comparison (<) classes could be handled as
2164 below, but it is generally faster to only evaluate them once. */
2165 if (TREE_SIDE_EFFECTS (e))
2166 return save_expr (e);
2170 /* Constants need no processing. In fact, we should never reach
2175 /* Division is slow and tends to be compiled with jumps,
2176 especially the division by powers of 2 that is often
2177 found inside of an array reference. So do it just once. */
2178 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2179 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2180 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2181 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2182 return save_expr (e);
2183 /* Recursively stabilize each operand. */
2184 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2185 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2189 /* Recursively stabilize each operand. */
2190 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2197 TREE_TYPE (result) = TREE_TYPE (e);
2198 TREE_READONLY (result) = TREE_READONLY (e);
2199 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2200 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2201 TREE_INVARIANT (result) = 1;
2206 /* Low-level constructors for expressions. */
2208 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2209 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2212 recompute_tree_invarant_for_addr_expr (tree t)
2215 bool tc = true, ti = true, se = false;
2217 /* We started out assuming this address is both invariant and constant, but
2218 does not have side effects. Now go down any handled components and see if
2219 any of them involve offsets that are either non-constant or non-invariant.
2220 Also check for side-effects.
2222 ??? Note that this code makes no attempt to deal with the case where
2223 taking the address of something causes a copy due to misalignment. */
2225 #define UPDATE_TITCSE(NODE) \
2226 do { tree _node = (NODE); \
2227 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2228 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2229 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2231 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2232 node = TREE_OPERAND (node, 0))
2234 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2235 array reference (probably made temporarily by the G++ front end),
2236 so ignore all the operands. */
2237 if ((TREE_CODE (node) == ARRAY_REF
2238 || TREE_CODE (node) == ARRAY_RANGE_REF)
2239 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2241 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2242 UPDATE_TITCSE (array_ref_low_bound (node));
2243 UPDATE_TITCSE (array_ref_element_size (node));
2245 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2246 FIELD_DECL, apparently. The G++ front end can put something else
2247 there, at least temporarily. */
2248 else if (TREE_CODE (node) == COMPONENT_REF
2249 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2250 UPDATE_TITCSE (component_ref_field_offset (node));
2251 else if (TREE_CODE (node) == BIT_FIELD_REF)
2252 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2255 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2256 it. If it's a decl, it's invariant and constant if the decl is static.
2257 It's also invariant if it's a decl in the current function. (Taking the
2258 address of a volatile variable is not volatile.) If it's a constant,
2259 the address is both invariant and constant. Otherwise it's neither. */
2260 if (TREE_CODE (node) == INDIRECT_REF)
2261 UPDATE_TITCSE (node);
2262 else if (DECL_P (node))
2266 else if (decl_function_context (node) == current_function_decl)
2271 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2276 se |= TREE_SIDE_EFFECTS (node);
2279 TREE_CONSTANT (t) = tc;
2280 TREE_INVARIANT (t) = ti;
2281 TREE_SIDE_EFFECTS (t) = se;
2282 #undef UPDATE_TITCSE
2285 /* Build an expression of code CODE, data type TYPE, and operands as
2286 specified. Expressions and reference nodes can be created this way.
2287 Constants, decls, types and misc nodes cannot be.
2289 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2290 enough for all extant tree codes. These functions can be called
2291 directly (preferably!), but can also be obtained via GCC preprocessor
2292 magic within the build macro. */
2295 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2299 #ifdef ENABLE_CHECKING
2300 if (TREE_CODE_LENGTH (code) != 0)
2304 t = make_node_stat (code PASS_MEM_STAT);
2311 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2313 int length = sizeof (struct tree_exp);
2314 #ifdef GATHER_STATISTICS
2315 tree_node_kind kind;
2319 #ifdef GATHER_STATISTICS
2320 switch (TREE_CODE_CLASS (code))
2322 case 's': /* an expression with side effects */
2325 case 'r': /* a reference */
2333 tree_node_counts[(int) kind]++;
2334 tree_node_sizes[(int) kind] += length;
2337 #ifdef ENABLE_CHECKING
2338 if (TREE_CODE_LENGTH (code) != 1)
2340 #endif /* ENABLE_CHECKING */
2342 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2344 memset (t, 0, sizeof (struct tree_common));
2346 TREE_SET_CODE (t, code);
2348 TREE_TYPE (t) = type;
2349 #ifdef USE_MAPPED_LOCATION
2350 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2352 SET_EXPR_LOCUS (t, NULL);
2354 TREE_COMPLEXITY (t) = 0;
2355 TREE_OPERAND (t, 0) = node;
2356 TREE_BLOCK (t) = NULL_TREE;
2357 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2359 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2360 TREE_READONLY (t) = TREE_READONLY (node);
2363 if (TREE_CODE_CLASS (code) == 's')
2364 TREE_SIDE_EFFECTS (t) = 1;
2370 case PREDECREMENT_EXPR:
2371 case PREINCREMENT_EXPR:
2372 case POSTDECREMENT_EXPR:
2373 case POSTINCREMENT_EXPR:
2374 /* All of these have side-effects, no matter what their
2376 TREE_SIDE_EFFECTS (t) = 1;
2377 TREE_READONLY (t) = 0;
2381 /* Whether a dereference is readonly has nothing to do with whether
2382 its operand is readonly. */
2383 TREE_READONLY (t) = 0;
2388 recompute_tree_invarant_for_addr_expr (t);
2392 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2393 && TREE_CONSTANT (node))
2394 TREE_CONSTANT (t) = 1;
2395 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2396 TREE_INVARIANT (t) = 1;
2397 if (TREE_CODE_CLASS (code) == 'r' && node && TREE_THIS_VOLATILE (node))
2398 TREE_THIS_VOLATILE (t) = 1;
2405 #define PROCESS_ARG(N) \
2407 TREE_OPERAND (t, N) = arg##N; \
2408 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2410 if (TREE_SIDE_EFFECTS (arg##N)) \
2412 if (!TREE_READONLY (arg##N)) \
2414 if (!TREE_CONSTANT (arg##N)) \
2416 if (!TREE_INVARIANT (arg##N)) \
2422 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2424 bool constant, read_only, side_effects, invariant;
2428 #ifdef ENABLE_CHECKING
2429 if (TREE_CODE_LENGTH (code) != 2)
2433 t = make_node_stat (code PASS_MEM_STAT);
2436 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2437 result based on those same flags for the arguments. But if the
2438 arguments aren't really even `tree' expressions, we shouldn't be trying
2440 fro = first_rtl_op (code);
2442 /* Expressions without side effects may be constant if their
2443 arguments are as well. */
2444 constant = (TREE_CODE_CLASS (code) == '<'
2445 || TREE_CODE_CLASS (code) == '2');
2447 side_effects = TREE_SIDE_EFFECTS (t);
2448 invariant = constant;
2453 TREE_READONLY (t) = read_only;
2454 TREE_CONSTANT (t) = constant;
2455 TREE_INVARIANT (t) = invariant;
2456 TREE_SIDE_EFFECTS (t) = side_effects;
2457 TREE_THIS_VOLATILE (t)
2458 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2464 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2465 tree arg2 MEM_STAT_DECL)
2467 bool constant, read_only, side_effects, invariant;
2471 #ifdef ENABLE_CHECKING
2472 if (TREE_CODE_LENGTH (code) != 3)
2476 t = make_node_stat (code PASS_MEM_STAT);
2479 fro = first_rtl_op (code);
2481 side_effects = TREE_SIDE_EFFECTS (t);
2487 if (code == CALL_EXPR && !side_effects)
2492 /* Calls have side-effects, except those to const or
2494 i = call_expr_flags (t);
2495 if (!(i & (ECF_CONST | ECF_PURE)))
2498 /* And even those have side-effects if their arguments do. */
2499 else for (node = arg1; node; node = TREE_CHAIN (node))
2500 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2507 TREE_SIDE_EFFECTS (t) = side_effects;
2508 TREE_THIS_VOLATILE (t)
2509 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2515 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2516 tree arg2, tree arg3 MEM_STAT_DECL)
2518 bool constant, read_only, side_effects, invariant;
2522 #ifdef ENABLE_CHECKING
2523 if (TREE_CODE_LENGTH (code) != 4)
2527 t = make_node_stat (code PASS_MEM_STAT);
2530 fro = first_rtl_op (code);
2532 side_effects = TREE_SIDE_EFFECTS (t);
2539 TREE_SIDE_EFFECTS (t) = side_effects;
2540 TREE_THIS_VOLATILE (t)
2541 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2546 /* Backup definition for non-gcc build compilers. */
2549 (build) (enum tree_code code, tree tt, ...)
2551 tree t, arg0, arg1, arg2, arg3;
2552 int length = TREE_CODE_LENGTH (code);
2559 t = build0 (code, tt);
2562 arg0 = va_arg (p, tree);
2563 t = build1 (code, tt, arg0);
2566 arg0 = va_arg (p, tree);
2567 arg1 = va_arg (p, tree);
2568 t = build2 (code, tt, arg0, arg1);
2571 arg0 = va_arg (p, tree);
2572 arg1 = va_arg (p, tree);
2573 arg2 = va_arg (p, tree);
2574 t = build3 (code, tt, arg0, arg1, arg2);
2577 arg0 = va_arg (p, tree);
2578 arg1 = va_arg (p, tree);
2579 arg2 = va_arg (p, tree);
2580 arg3 = va_arg (p, tree);
2581 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2591 /* Similar except don't specify the TREE_TYPE
2592 and leave the TREE_SIDE_EFFECTS as 0.
2593 It is permissible for arguments to be null,
2594 or even garbage if their values do not matter. */
2597 build_nt (enum tree_code code, ...)
2606 t = make_node (code);
2607 length = TREE_CODE_LENGTH (code);
2609 for (i = 0; i < length; i++)
2610 TREE_OPERAND (t, i) = va_arg (p, tree);
2616 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2617 We do NOT enter this node in any sort of symbol table.
2619 layout_decl is used to set up the decl's storage layout.
2620 Other slots are initialized to 0 or null pointers. */
2623 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2627 t = make_node_stat (code PASS_MEM_STAT);
2629 /* if (type == error_mark_node)
2630 type = integer_type_node; */
2631 /* That is not done, deliberately, so that having error_mark_node
2632 as the type can suppress useless errors in the use of this variable. */
2634 DECL_NAME (t) = name;
2635 TREE_TYPE (t) = type;
2637 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2639 else if (code == FUNCTION_DECL)
2640 DECL_MODE (t) = FUNCTION_MODE;
2642 /* Set default visibility to whatever the user supplied with
2643 visibility_specified depending on #pragma GCC visibility. */
2644 DECL_VISIBILITY (t) = default_visibility;
2645 DECL_VISIBILITY_SPECIFIED (t) = visibility_options.inpragma;
2650 /* BLOCK nodes are used to represent the structure of binding contours
2651 and declarations, once those contours have been exited and their contents
2652 compiled. This information is used for outputting debugging info. */
2655 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2656 tree supercontext, tree chain)
2658 tree block = make_node (BLOCK);
2660 BLOCK_VARS (block) = vars;
2661 BLOCK_SUBBLOCKS (block) = subblocks;
2662 BLOCK_SUPERCONTEXT (block) = supercontext;
2663 BLOCK_CHAIN (block) = chain;
2667 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2668 /* ??? gengtype doesn't handle conditionals */
2669 static GTY(()) tree last_annotated_node;
2672 #ifdef USE_MAPPED_LOCATION
2675 expand_location (source_location loc)
2677 expanded_location xloc;
2678 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
2681 const struct line_map *map = linemap_lookup (&line_table, loc);
2682 xloc.file = map->to_file;
2683 xloc.line = SOURCE_LINE (map, loc);
2684 xloc.column = SOURCE_COLUMN (map, loc);
2691 /* Record the exact location where an expression or an identifier were
2695 annotate_with_file_line (tree node, const char *file, int line)
2697 /* Roughly one percent of the calls to this function are to annotate
2698 a node with the same information already attached to that node!
2699 Just return instead of wasting memory. */
2700 if (EXPR_LOCUS (node)
2701 && (EXPR_FILENAME (node) == file
2702 || ! strcmp (EXPR_FILENAME (node), file))
2703 && EXPR_LINENO (node) == line)
2705 last_annotated_node = node;
2709 /* In heavily macroized code (such as GCC itself) this single
2710 entry cache can reduce the number of allocations by more
2712 if (last_annotated_node
2713 && EXPR_LOCUS (last_annotated_node)
2714 && (EXPR_FILENAME (last_annotated_node) == file
2715 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2716 && EXPR_LINENO (last_annotated_node) == line)
2718 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2722 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2723 EXPR_LINENO (node) = line;
2724 EXPR_FILENAME (node) = file;
2725 last_annotated_node = node;
2729 annotate_with_locus (tree node, location_t locus)
2731 annotate_with_file_line (node, locus.file, locus.line);
2735 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2739 build_decl_attribute_variant (tree ddecl, tree attribute)
2741 DECL_ATTRIBUTES (ddecl) = attribute;
2745 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2748 Record such modified types already made so we don't make duplicates. */
2751 build_type_attribute_variant (tree ttype, tree attribute)
2753 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2755 hashval_t hashcode = 0;
2757 enum tree_code code = TREE_CODE (ttype);
2759 ntype = copy_node (ttype);
2761 TYPE_POINTER_TO (ntype) = 0;
2762 TYPE_REFERENCE_TO (ntype) = 0;
2763 TYPE_ATTRIBUTES (ntype) = attribute;
2765 /* Create a new main variant of TYPE. */
2766 TYPE_MAIN_VARIANT (ntype) = ntype;
2767 TYPE_NEXT_VARIANT (ntype) = 0;
2768 set_type_quals (ntype, TYPE_UNQUALIFIED);
2770 hashcode = iterative_hash_object (code, hashcode);
2771 if (TREE_TYPE (ntype))
2772 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2774 hashcode = attribute_hash_list (attribute, hashcode);
2776 switch (TREE_CODE (ntype))
2779 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2782 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2786 hashcode = iterative_hash_object
2787 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2788 hashcode = iterative_hash_object
2789 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2793 unsigned int precision = TYPE_PRECISION (ntype);
2794 hashcode = iterative_hash_object (precision, hashcode);
2801 ntype = type_hash_canon (hashcode, ntype);
2802 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2808 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2811 We try both `text' and `__text__', ATTR may be either one. */
2812 /* ??? It might be a reasonable simplification to require ATTR to be only
2813 `text'. One might then also require attribute lists to be stored in
2814 their canonicalized form. */
2817 is_attribute_p (const char *attr, tree ident)
2819 int ident_len, attr_len;
2822 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2825 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2828 p = IDENTIFIER_POINTER (ident);
2829 ident_len = strlen (p);
2830 attr_len = strlen (attr);
2832 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2836 || attr[attr_len - 2] != '_'
2837 || attr[attr_len - 1] != '_')
2839 if (ident_len == attr_len - 4
2840 && strncmp (attr + 2, p, attr_len - 4) == 0)
2845 if (ident_len == attr_len + 4
2846 && p[0] == '_' && p[1] == '_'
2847 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2848 && strncmp (attr, p + 2, attr_len) == 0)
2855 /* Given an attribute name and a list of attributes, return a pointer to the
2856 attribute's list element if the attribute is part of the list, or NULL_TREE
2857 if not found. If the attribute appears more than once, this only
2858 returns the first occurrence; the TREE_CHAIN of the return value should
2859 be passed back in if further occurrences are wanted. */
2862 lookup_attribute (const char *attr_name, tree list)
2866 for (l = list; l; l = TREE_CHAIN (l))
2868 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2870 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2877 /* Return an attribute list that is the union of a1 and a2. */
2880 merge_attributes (tree a1, tree a2)
2884 /* Either one unset? Take the set one. */
2886 if ((attributes = a1) == 0)
2889 /* One that completely contains the other? Take it. */
2891 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2893 if (attribute_list_contained (a2, a1))
2897 /* Pick the longest list, and hang on the other list. */
2899 if (list_length (a1) < list_length (a2))
2900 attributes = a2, a2 = a1;
2902 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2905 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2908 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2911 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2916 a1 = copy_node (a2);
2917 TREE_CHAIN (a1) = attributes;
2926 /* Given types T1 and T2, merge their attributes and return
2930 merge_type_attributes (tree t1, tree t2)
2932 return merge_attributes (TYPE_ATTRIBUTES (t1),
2933 TYPE_ATTRIBUTES (t2));
2936 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2940 merge_decl_attributes (tree olddecl, tree newdecl)
2942 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2943 DECL_ATTRIBUTES (newdecl));
2946 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
2948 /* Specialization of merge_decl_attributes for various Windows targets.
2950 This handles the following situation:
2952 __declspec (dllimport) int foo;
2955 The second instance of `foo' nullifies the dllimport. */
2958 merge_dllimport_decl_attributes (tree old, tree new)
2961 int delete_dllimport_p;
2963 old = DECL_ATTRIBUTES (old);
2964 new = DECL_ATTRIBUTES (new);
2966 /* What we need to do here is remove from `old' dllimport if it doesn't
2967 appear in `new'. dllimport behaves like extern: if a declaration is
2968 marked dllimport and a definition appears later, then the object
2969 is not dllimport'd. */
2970 if (lookup_attribute ("dllimport", old) != NULL_TREE
2971 && lookup_attribute ("dllimport", new) == NULL_TREE)
2972 delete_dllimport_p = 1;
2974 delete_dllimport_p = 0;
2976 a = merge_attributes (old, new);
2978 if (delete_dllimport_p)
2982 /* Scan the list for dllimport and delete it. */
2983 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2985 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2987 if (prev == NULL_TREE)
2990 TREE_CHAIN (prev) = TREE_CHAIN (t);
2999 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3000 struct attribute_spec.handler. */
3003 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3008 /* These attributes may apply to structure and union types being created,
3009 but otherwise should pass to the declaration involved. */
3012 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3013 | (int) ATTR_FLAG_ARRAY_NEXT))
3015 *no_add_attrs = true;
3016 return tree_cons (name, args, NULL_TREE);
3018 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3020 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3021 *no_add_attrs = true;
3027 /* Report error on dllimport ambiguities seen now before they cause
3029 if (is_attribute_p ("dllimport", name))
3031 /* Like MS, treat definition of dllimported variables and
3032 non-inlined functions on declaration as syntax errors. We
3033 allow the attribute for function definitions if declared
3035 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node)
3036 && !DECL_DECLARED_INLINE_P (node))
3038 error ("%Jfunction `%D' definition is marked dllimport.", node, node);
3039 *no_add_attrs = true;
3042 else if (TREE_CODE (node) == VAR_DECL)
3044 if (DECL_INITIAL (node))
3046 error ("%Jvariable `%D' definition is marked dllimport.",
3048 *no_add_attrs = true;
3051 /* `extern' needn't be specified with dllimport.
3052 Specify `extern' now and hope for the best. Sigh. */
3053 DECL_EXTERNAL (node) = 1;
3054 /* Also, implicitly give dllimport'd variables declared within
3055 a function global scope, unless declared static. */
3056 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3057 TREE_PUBLIC (node) = 1;
3061 /* Report error if symbol is not accessible at global scope. */
3062 if (!TREE_PUBLIC (node)
3063 && (TREE_CODE (node) == VAR_DECL
3064 || TREE_CODE (node) == FUNCTION_DECL))
3066 error ("%Jexternal linkage required for symbol '%D' because of "
3067 "'%s' attribute.", node, node, IDENTIFIER_POINTER (name));
3068 *no_add_attrs = true;
3074 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3076 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3077 of the various TYPE_QUAL values. */
3080 set_type_quals (tree type, int type_quals)
3082 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3083 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3084 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3087 /* Returns true iff cand is equivalent to base with type_quals. */
3090 check_qualified_type (tree cand, tree base, int type_quals)
3092 return (TYPE_QUALS (cand) == type_quals
3093 && TYPE_NAME (cand) == TYPE_NAME (base)
3094 /* Apparently this is needed for Objective-C. */
3095 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3096 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3097 TYPE_ATTRIBUTES (base)));
3100 /* Return a version of the TYPE, qualified as indicated by the
3101 TYPE_QUALS, if one exists. If no qualified version exists yet,
3102 return NULL_TREE. */
3105 get_qualified_type (tree type, int type_quals)
3109 if (TYPE_QUALS (type) == type_quals)
3112 /* Search the chain of variants to see if there is already one there just
3113 like the one we need to have. If so, use that existing one. We must
3114 preserve the TYPE_NAME, since there is code that depends on this. */
3115 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3116 if (check_qualified_type (t, type, type_quals))
3122 /* Like get_qualified_type, but creates the type if it does not
3123 exist. This function never returns NULL_TREE. */
3126 build_qualified_type (tree type, int type_quals)
3130 /* See if we already have the appropriate qualified variant. */
3131 t = get_qualified_type (type, type_quals);
3133 /* If not, build it. */
3136 t = build_variant_type_copy (type);
3137 set_type_quals (t, type_quals);
3143 /* Create a new distinct copy of TYPE. The new type is made its own
3147 build_distinct_type_copy (tree type)
3149 tree t = copy_node (type);
3151 TYPE_POINTER_TO (t) = 0;
3152 TYPE_REFERENCE_TO (t) = 0;
3154 /* Make it its own variant. */
3155 TYPE_MAIN_VARIANT (t) = t;
3156 TYPE_NEXT_VARIANT (t) = 0;
3161 /* Create a new variant of TYPE, equivalent but distinct.
3162 This is so the caller can modify it. */
3165 build_variant_type_copy (tree type)
3167 tree t, m = TYPE_MAIN_VARIANT (type);
3169 t = build_distinct_type_copy (type);
3171 /* Add the new type to the chain of variants of TYPE. */
3172 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3173 TYPE_NEXT_VARIANT (m) = t;
3174 TYPE_MAIN_VARIANT (t) = m;
3179 /* Hashing of types so that we don't make duplicates.
3180 The entry point is `type_hash_canon'. */
3182 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3183 with types in the TREE_VALUE slots), by adding the hash codes
3184 of the individual types. */
3187 type_hash_list (tree list, hashval_t hashcode)
3191 for (tail = list; tail; tail = TREE_CHAIN (tail))
3192 if (TREE_VALUE (tail) != error_mark_node)
3193 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3199 /* These are the Hashtable callback functions. */
3201 /* Returns true iff the types are equivalent. */
3204 type_hash_eq (const void *va, const void *vb)
3206 const struct type_hash *a = va, *b = vb;
3208 /* First test the things that are the same for all types. */
3209 if (a->hash != b->hash
3210 || TREE_CODE (a->type) != TREE_CODE (b->type)
3211 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3212 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3213 TYPE_ATTRIBUTES (b->type))
3214 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3215 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3218 switch (TREE_CODE (a->type))
3224 case REFERENCE_TYPE:
3228 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3229 && !(TYPE_VALUES (a->type)
3230 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3231 && TYPE_VALUES (b->type)
3232 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3233 && type_list_equal (TYPE_VALUES (a->type),
3234 TYPE_VALUES (b->type))))
3237 /* ... fall through ... */
3243 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3244 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3245 TYPE_MAX_VALUE (b->type)))
3246 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3247 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3248 TYPE_MIN_VALUE (b->type))));
3251 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3254 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3255 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3256 || (TYPE_ARG_TYPES (a->type)
3257 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3258 && TYPE_ARG_TYPES (b->type)
3259 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3260 && type_list_equal (TYPE_ARG_TYPES (a->type),
3261 TYPE_ARG_TYPES (b->type)))));
3265 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3269 case QUAL_UNION_TYPE:
3270 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3271 || (TYPE_FIELDS (a->type)
3272 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3273 && TYPE_FIELDS (b->type)
3274 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3275 && type_list_equal (TYPE_FIELDS (a->type),
3276 TYPE_FIELDS (b->type))));
3279 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3280 || (TYPE_ARG_TYPES (a->type)
3281 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3282 && TYPE_ARG_TYPES (b->type)
3283 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3284 && type_list_equal (TYPE_ARG_TYPES (a->type),
3285 TYPE_ARG_TYPES (b->type))));
3292 /* Return the cached hash value. */
3295 type_hash_hash (const void *item)
3297 return ((const struct type_hash *) item)->hash;
3300 /* Look in the type hash table for a type isomorphic to TYPE.
3301 If one is found, return it. Otherwise return 0. */
3304 type_hash_lookup (hashval_t hashcode, tree type)
3306 struct type_hash *h, in;
3308 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3309 must call that routine before comparing TYPE_ALIGNs. */
3315 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3321 /* Add an entry to the type-hash-table
3322 for a type TYPE whose hash code is HASHCODE. */
3325 type_hash_add (hashval_t hashcode, tree type)
3327 struct type_hash *h;
3330 h = ggc_alloc (sizeof (struct type_hash));
3333 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3334 *(struct type_hash **) loc = h;
3337 /* Given TYPE, and HASHCODE its hash code, return the canonical
3338 object for an identical type if one already exists.
3339 Otherwise, return TYPE, and record it as the canonical object.
3341 To use this function, first create a type of the sort you want.
3342 Then compute its hash code from the fields of the type that
3343 make it different from other similar types.
3344 Then call this function and use the value. */
3347 type_hash_canon (unsigned int hashcode, tree type)
3351 /* The hash table only contains main variants, so ensure that's what we're
3353 if (TYPE_MAIN_VARIANT (type) != type)
3356 if (!lang_hooks.types.hash_types)
3359 /* See if the type is in the hash table already. If so, return it.
3360 Otherwise, add the type. */
3361 t1 = type_hash_lookup (hashcode, type);
3364 #ifdef GATHER_STATISTICS
3365 tree_node_counts[(int) t_kind]--;
3366 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3372 type_hash_add (hashcode, type);
3377 /* See if the data pointed to by the type hash table is marked. We consider
3378 it marked if the type is marked or if a debug type number or symbol
3379 table entry has been made for the type. This reduces the amount of
3380 debugging output and eliminates that dependency of the debug output on
3381 the number of garbage collections. */
3384 type_hash_marked_p (const void *p)
3386 tree type = ((struct type_hash *) p)->type;
3388 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3392 print_type_hash_statistics (void)
3394 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3395 (long) htab_size (type_hash_table),
3396 (long) htab_elements (type_hash_table),
3397 htab_collisions (type_hash_table));
3400 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3401 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3402 by adding the hash codes of the individual attributes. */
3405 attribute_hash_list (tree list, hashval_t hashcode)
3409 for (tail = list; tail; tail = TREE_CHAIN (tail))
3410 /* ??? Do we want to add in TREE_VALUE too? */
3411 hashcode = iterative_hash_object
3412 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3416 /* Given two lists of attributes, return true if list l2 is
3417 equivalent to l1. */
3420 attribute_list_equal (tree l1, tree l2)
3422 return attribute_list_contained (l1, l2)
3423 && attribute_list_contained (l2, l1);
3426 /* Given two lists of attributes, return true if list L2 is
3427 completely contained within L1. */
3428 /* ??? This would be faster if attribute names were stored in a canonicalized
3429 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3430 must be used to show these elements are equivalent (which they are). */
3431 /* ??? It's not clear that attributes with arguments will always be handled
3435 attribute_list_contained (tree l1, tree l2)
3439 /* First check the obvious, maybe the lists are identical. */
3443 /* Maybe the lists are similar. */
3444 for (t1 = l1, t2 = l2;
3446 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3447 && TREE_VALUE (t1) == TREE_VALUE (t2);
3448 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3450 /* Maybe the lists are equal. */
3451 if (t1 == 0 && t2 == 0)
3454 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3457 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3459 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3462 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3469 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3476 /* Given two lists of types
3477 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3478 return 1 if the lists contain the same types in the same order.
3479 Also, the TREE_PURPOSEs must match. */
3482 type_list_equal (tree l1, tree l2)
3486 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3487 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3488 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3489 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3490 && (TREE_TYPE (TREE_PURPOSE (t1))
3491 == TREE_TYPE (TREE_PURPOSE (t2))))))
3497 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3498 given by TYPE. If the argument list accepts variable arguments,
3499 then this function counts only the ordinary arguments. */
3502 type_num_arguments (tree type)
3507 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3508 /* If the function does not take a variable number of arguments,
3509 the last element in the list will have type `void'. */
3510 if (VOID_TYPE_P (TREE_VALUE (t)))
3518 /* Nonzero if integer constants T1 and T2
3519 represent the same constant value. */
3522 tree_int_cst_equal (tree t1, tree t2)
3527 if (t1 == 0 || t2 == 0)
3530 if (TREE_CODE (t1) == INTEGER_CST
3531 && TREE_CODE (t2) == INTEGER_CST
3532 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3533 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3539 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3540 The precise way of comparison depends on their data type. */
3543 tree_int_cst_lt (tree t1, tree t2)
3548 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3550 int t1_sgn = tree_int_cst_sgn (t1);
3551 int t2_sgn = tree_int_cst_sgn (t2);
3553 if (t1_sgn < t2_sgn)
3555 else if (t1_sgn > t2_sgn)
3557 /* Otherwise, both are non-negative, so we compare them as
3558 unsigned just in case one of them would overflow a signed
3561 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3562 return INT_CST_LT (t1, t2);
3564 return INT_CST_LT_UNSIGNED (t1, t2);
3567 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3570 tree_int_cst_compare (tree t1, tree t2)
3572 if (tree_int_cst_lt (t1, t2))
3574 else if (tree_int_cst_lt (t2, t1))
3580 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3581 the host. If POS is zero, the value can be represented in a single
3582 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3583 be represented in a single unsigned HOST_WIDE_INT. */
3586 host_integerp (tree t, int pos)
3588 return (TREE_CODE (t) == INTEGER_CST
3589 && ! TREE_OVERFLOW (t)
3590 && ((TREE_INT_CST_HIGH (t) == 0
3591 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3592 || (! pos && TREE_INT_CST_HIGH (t) == -1
3593 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3594 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3595 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3598 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3599 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3600 be positive. Abort if we cannot satisfy the above conditions. */
3603 tree_low_cst (tree t, int pos)
3605 if (host_integerp (t, pos))
3606 return TREE_INT_CST_LOW (t);
3611 /* Return the most significant bit of the integer constant T. */
3614 tree_int_cst_msb (tree t)
3618 unsigned HOST_WIDE_INT l;
3620 /* Note that using TYPE_PRECISION here is wrong. We care about the
3621 actual bits, not the (arbitrary) range of the type. */
3622 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3623 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3624 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3625 return (l & 1) == 1;
3628 /* Return an indication of the sign of the integer constant T.
3629 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3630 Note that -1 will never be returned it T's type is unsigned. */
3633 tree_int_cst_sgn (tree t)
3635 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3637 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3639 else if (TREE_INT_CST_HIGH (t) < 0)
3645 /* Compare two constructor-element-type constants. Return 1 if the lists
3646 are known to be equal; otherwise return 0. */
3649 simple_cst_list_equal (tree l1, tree l2)
3651 while (l1 != NULL_TREE && l2 != NULL_TREE)
3653 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3656 l1 = TREE_CHAIN (l1);
3657 l2 = TREE_CHAIN (l2);
3663 /* Return truthvalue of whether T1 is the same tree structure as T2.
3664 Return 1 if they are the same.
3665 Return 0 if they are understandably different.
3666 Return -1 if either contains tree structure not understood by
3670 simple_cst_equal (tree t1, tree t2)
3672 enum tree_code code1, code2;
3678 if (t1 == 0 || t2 == 0)
3681 code1 = TREE_CODE (t1);
3682 code2 = TREE_CODE (t2);
3684 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3686 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3687 || code2 == NON_LVALUE_EXPR)
3688 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3690 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3693 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3694 || code2 == NON_LVALUE_EXPR)
3695 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3703 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3704 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3707 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3710 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3711 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3712 TREE_STRING_LENGTH (t1)));
3715 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3716 CONSTRUCTOR_ELTS (t2));
3719 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3722 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3726 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3729 /* Special case: if either target is an unallocated VAR_DECL,
3730 it means that it's going to be unified with whatever the
3731 TARGET_EXPR is really supposed to initialize, so treat it
3732 as being equivalent to anything. */
3733 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3734 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3735 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3736 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3737 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3738 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3741 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3746 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3748 case WITH_CLEANUP_EXPR:
3749 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3753 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3756 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3757 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3771 /* This general rule works for most tree codes. All exceptions should be
3772 handled above. If this is a language-specific tree code, we can't
3773 trust what might be in the operand, so say we don't know
3775 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3778 switch (TREE_CODE_CLASS (code1))
3787 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3789 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3801 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3802 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3803 than U, respectively. */
3806 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3808 if (tree_int_cst_sgn (t) < 0)
3810 else if (TREE_INT_CST_HIGH (t) != 0)
3812 else if (TREE_INT_CST_LOW (t) == u)
3814 else if (TREE_INT_CST_LOW (t) < u)
3820 /* Return true if CODE represents an associative tree code. Otherwise
3823 associative_tree_code (enum tree_code code)
3842 /* Return true if CODE represents an commutative tree code. Otherwise
3845 commutative_tree_code (enum tree_code code)
3858 case UNORDERED_EXPR:
3862 case TRUTH_AND_EXPR:
3863 case TRUTH_XOR_EXPR:
3873 /* Generate a hash value for an expression. This can be used iteratively
3874 by passing a previous result as the "val" argument.
3876 This function is intended to produce the same hash for expressions which
3877 would compare equal using operand_equal_p. */
3880 iterative_hash_expr (tree t, hashval_t val)
3883 enum tree_code code;
3887 return iterative_hash_object (t, val);
3889 code = TREE_CODE (t);
3890 class = TREE_CODE_CLASS (code);
3893 || TREE_CODE (t) == VALUE_HANDLE)
3895 /* Decls we can just compare by pointer. */
3896 val = iterative_hash_object (t, val);
3898 else if (class == 'c')
3900 /* Alas, constants aren't shared, so we can't rely on pointer
3902 if (code == INTEGER_CST)
3904 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3905 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3907 else if (code == REAL_CST)
3909 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
3911 val = iterative_hash (&val2, sizeof (unsigned int), val);
3913 else if (code == STRING_CST)
3914 val = iterative_hash (TREE_STRING_POINTER (t),
3915 TREE_STRING_LENGTH (t), val);
3916 else if (code == COMPLEX_CST)
3918 val = iterative_hash_expr (TREE_REALPART (t), val);
3919 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3921 else if (code == VECTOR_CST)
3922 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3926 else if (IS_EXPR_CODE_CLASS (class))
3928 val = iterative_hash_object (code, val);
3930 /* Don't hash the type, that can lead to having nodes which
3931 compare equal according to operand_equal_p, but which
3932 have different hash codes. */
3933 if (code == NOP_EXPR
3934 || code == CONVERT_EXPR
3935 || code == NON_LVALUE_EXPR)
3937 /* Make sure to include signness in the hash computation. */
3938 val += TYPE_UNSIGNED (TREE_TYPE (t));
3939 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
3942 if (commutative_tree_code (code))
3944 /* It's a commutative expression. We want to hash it the same
3945 however it appears. We do this by first hashing both operands
3946 and then rehashing based on the order of their independent
3948 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3949 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3953 t = one, one = two, two = t;
3955 val = iterative_hash_object (one, val);
3956 val = iterative_hash_object (two, val);
3959 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3960 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3962 else if (code == TREE_LIST)
3964 /* A list of expressions, for a CALL_EXPR or as the elements of a
3966 for (; t; t = TREE_CHAIN (t))
3967 val = iterative_hash_expr (TREE_VALUE (t), val);
3969 else if (code == SSA_NAME)
3971 val = iterative_hash_object (SSA_NAME_VERSION (t), val);
3972 val = iterative_hash_expr (SSA_NAME_VAR (t), val);
3980 /* Constructors for pointer, array and function types.
3981 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3982 constructed by language-dependent code, not here.) */
3984 /* Construct, lay out and return the type of pointers to TO_TYPE with
3985 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3986 reference all of memory. If such a type has already been
3987 constructed, reuse it. */
3990 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
3995 /* In some cases, languages will have things that aren't a POINTER_TYPE
3996 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3997 In that case, return that type without regard to the rest of our
4000 ??? This is a kludge, but consistent with the way this function has
4001 always operated and there doesn't seem to be a good way to avoid this
4003 if (TYPE_POINTER_TO (to_type) != 0
4004 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4005 return TYPE_POINTER_TO (to_type);
4007 /* First, if we already have a type for pointers to TO_TYPE and it's
4008 the proper mode, use it. */
4009 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4010 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4013 t = make_node (POINTER_TYPE);
4015 TREE_TYPE (t) = to_type;
4016 TYPE_MODE (t) = mode;
4017 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4018 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
4019 TYPE_POINTER_TO (to_type) = t;
4021 /* Lay out the type. This function has many callers that are concerned
4022 with expression-construction, and this simplifies them all. */
4028 /* By default build pointers in ptr_mode. */
4031 build_pointer_type (tree to_type)
4033 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4036 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4039 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4044 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4045 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4046 In that case, return that type without regard to the rest of our
4049 ??? This is a kludge, but consistent with the way this function has
4050 always operated and there doesn't seem to be a good way to avoid this
4052 if (TYPE_REFERENCE_TO (to_type) != 0
4053 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4054 return TYPE_REFERENCE_TO (to_type);
4056 /* First, if we already have a type for pointers to TO_TYPE and it's
4057 the proper mode, use it. */
4058 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4059 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4062 t = make_node (REFERENCE_TYPE);
4064 TREE_TYPE (t) = to_type;
4065 TYPE_MODE (t) = mode;
4066 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4067 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4068 TYPE_REFERENCE_TO (to_type) = t;
4076 /* Build the node for the type of references-to-TO_TYPE by default
4080 build_reference_type (tree to_type)
4082 return build_reference_type_for_mode (to_type, ptr_mode, false);
4085 /* Build a type that is compatible with t but has no cv quals anywhere
4088 const char *const *const * -> char ***. */
4091 build_type_no_quals (tree t)
4093 switch (TREE_CODE (t))
4096 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4098 TYPE_REF_CAN_ALIAS_ALL (t));
4099 case REFERENCE_TYPE:
4101 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4103 TYPE_REF_CAN_ALIAS_ALL (t));
4105 return TYPE_MAIN_VARIANT (t);
4109 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4110 MAXVAL should be the maximum value in the domain
4111 (one less than the length of the array).
4113 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4114 We don't enforce this limit, that is up to caller (e.g. language front end).
4115 The limit exists because the result is a signed type and we don't handle
4116 sizes that use more than one HOST_WIDE_INT. */
4119 build_index_type (tree maxval)
4121 tree itype = make_node (INTEGER_TYPE);
4123 TREE_TYPE (itype) = sizetype;
4124 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4125 TYPE_MIN_VALUE (itype) = size_zero_node;
4126 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4127 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4128 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4129 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4130 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4131 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4133 if (host_integerp (maxval, 1))
4134 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4139 /* Builds a signed or unsigned integer type of precision PRECISION.
4140 Used for C bitfields whose precision does not match that of
4141 built-in target types. */
4143 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4146 tree itype = make_node (INTEGER_TYPE);
4148 TYPE_PRECISION (itype) = precision;
4151 fixup_unsigned_type (itype);
4153 fixup_signed_type (itype);
4155 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4156 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
4161 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4162 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4163 low bound LOWVAL and high bound HIGHVAL.
4164 if TYPE==NULL_TREE, sizetype is used. */
4167 build_range_type (tree type, tree lowval, tree highval)
4169 tree itype = make_node (INTEGER_TYPE);
4171 TREE_TYPE (itype) = type;
4172 if (type == NULL_TREE)
4175 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4176 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4178 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4179 TYPE_MODE (itype) = TYPE_MODE (type);
4180 TYPE_SIZE (itype) = TYPE_SIZE (type);
4181 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4182 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4183 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4185 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4186 return type_hash_canon (tree_low_cst (highval, 0)
4187 - tree_low_cst (lowval, 0),
4193 /* Just like build_index_type, but takes lowval and highval instead
4194 of just highval (maxval). */
4197 build_index_2_type (tree lowval, tree highval)
4199 return build_range_type (sizetype, lowval, highval);
4202 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4203 and number of elements specified by the range of values of INDEX_TYPE.
4204 If such a type has already been constructed, reuse it. */
4207 build_array_type (tree elt_type, tree index_type)
4210 hashval_t hashcode = 0;
4212 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4214 error ("arrays of functions are not meaningful");
4215 elt_type = integer_type_node;
4218 t = make_node (ARRAY_TYPE);
4219 TREE_TYPE (t) = elt_type;
4220 TYPE_DOMAIN (t) = index_type;
4222 if (index_type == 0)
4225 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4226 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4227 t = type_hash_canon (hashcode, t);
4229 if (!COMPLETE_TYPE_P (t))
4234 /* Return the TYPE of the elements comprising
4235 the innermost dimension of ARRAY. */
4238 get_inner_array_type (tree array)
4240 tree type = TREE_TYPE (array);
4242 while (TREE_CODE (type) == ARRAY_TYPE)
4243 type = TREE_TYPE (type);
4248 /* Construct, lay out and return
4249 the type of functions returning type VALUE_TYPE
4250 given arguments of types ARG_TYPES.
4251 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4252 are data type nodes for the arguments of the function.
4253 If such a type has already been constructed, reuse it. */
4256 build_function_type (tree value_type, tree arg_types)
4259 hashval_t hashcode = 0;
4261 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4263 error ("function return type cannot be function");
4264 value_type = integer_type_node;
4267 /* Make a node of the sort we want. */
4268 t = make_node (FUNCTION_TYPE);
4269 TREE_TYPE (t) = value_type;
4270 TYPE_ARG_TYPES (t) = arg_types;
4272 /* If we already have such a type, use the old one. */
4273 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4274 hashcode = type_hash_list (arg_types, hashcode);
4275 t = type_hash_canon (hashcode, t);
4277 if (!COMPLETE_TYPE_P (t))
4282 /* Build a function type. The RETURN_TYPE is the type returned by the
4283 function. If additional arguments are provided, they are
4284 additional argument types. The list of argument types must always
4285 be terminated by NULL_TREE. */
4288 build_function_type_list (tree return_type, ...)
4293 va_start (p, return_type);
4295 t = va_arg (p, tree);
4296 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4297 args = tree_cons (NULL_TREE, t, args);
4300 args = nreverse (args);
4301 TREE_CHAIN (last) = void_list_node;
4302 args = build_function_type (return_type, args);
4308 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4309 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4310 for the method. An implicit additional parameter (of type
4311 pointer-to-BASETYPE) is added to the ARGTYPES. */
4314 build_method_type_directly (tree basetype,
4322 /* Make a node of the sort we want. */
4323 t = make_node (METHOD_TYPE);
4325 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4326 TREE_TYPE (t) = rettype;
4327 ptype = build_pointer_type (basetype);
4329 /* The actual arglist for this function includes a "hidden" argument
4330 which is "this". Put it into the list of argument types. */
4331 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4332 TYPE_ARG_TYPES (t) = argtypes;
4334 /* If we already have such a type, use the old one. */
4335 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4336 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4337 hashcode = type_hash_list (argtypes, hashcode);
4338 t = type_hash_canon (hashcode, t);
4340 if (!COMPLETE_TYPE_P (t))
4346 /* Construct, lay out and return the type of methods belonging to class
4347 BASETYPE and whose arguments and values are described by TYPE.
4348 If that type exists already, reuse it.
4349 TYPE must be a FUNCTION_TYPE node. */
4352 build_method_type (tree basetype, tree type)
4354 if (TREE_CODE (type) != FUNCTION_TYPE)
4357 return build_method_type_directly (basetype,
4359 TYPE_ARG_TYPES (type));
4362 /* Construct, lay out and return the type of offsets to a value
4363 of type TYPE, within an object of type BASETYPE.
4364 If a suitable offset type exists already, reuse it. */
4367 build_offset_type (tree basetype, tree type)
4370 hashval_t hashcode = 0;
4372 /* Make a node of the sort we want. */
4373 t = make_node (OFFSET_TYPE);
4375 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4376 TREE_TYPE (t) = type;
4378 /* If we already have such a type, use the old one. */
4379 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4380 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4381 t = type_hash_canon (hashcode, t);
4383 if (!COMPLETE_TYPE_P (t))
4389 /* Create a complex type whose components are COMPONENT_TYPE. */
4392 build_complex_type (tree component_type)
4397 /* Make a node of the sort we want. */
4398 t = make_node (COMPLEX_TYPE);
4400 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4402 /* If we already have such a type, use the old one. */
4403 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4404 t = type_hash_canon (hashcode, t);
4406 if (!COMPLETE_TYPE_P (t))
4409 /* If we are writing Dwarf2 output we need to create a name,
4410 since complex is a fundamental type. */
4411 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4415 if (component_type == char_type_node)
4416 name = "complex char";
4417 else if (component_type == signed_char_type_node)
4418 name = "complex signed char";
4419 else if (component_type == unsigned_char_type_node)
4420 name = "complex unsigned char";
4421 else if (component_type == short_integer_type_node)
4422 name = "complex short int";
4423 else if (component_type == short_unsigned_type_node)
4424 name = "complex short unsigned int";
4425 else if (component_type == integer_type_node)
4426 name = "complex int";
4427 else if (component_type == unsigned_type_node)
4428 name = "complex unsigned int";
4429 else if (component_type == long_integer_type_node)
4430 name = "complex long int";
4431 else if (component_type == long_unsigned_type_node)
4432 name = "complex long unsigned int";
4433 else if (component_type == long_long_integer_type_node)
4434 name = "complex long long int";
4435 else if (component_type == long_long_unsigned_type_node)
4436 name = "complex long long unsigned int";
4441 TYPE_NAME (t) = get_identifier (name);
4444 return build_qualified_type (t, TYPE_QUALS (component_type));
4447 /* Return OP, stripped of any conversions to wider types as much as is safe.
4448 Converting the value back to OP's type makes a value equivalent to OP.
4450 If FOR_TYPE is nonzero, we return a value which, if converted to
4451 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4453 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4454 narrowest type that can hold the value, even if they don't exactly fit.
4455 Otherwise, bit-field references are changed to a narrower type
4456 only if they can be fetched directly from memory in that type.
4458 OP must have integer, real or enumeral type. Pointers are not allowed!
4460 There are some cases where the obvious value we could return
4461 would regenerate to OP if converted to OP's type,
4462 but would not extend like OP to wider types.
4463 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4464 For example, if OP is (unsigned short)(signed char)-1,
4465 we avoid returning (signed char)-1 if FOR_TYPE is int,
4466 even though extending that to an unsigned short would regenerate OP,
4467 since the result of extending (signed char)-1 to (int)
4468 is different from (int) OP. */
4471 get_unwidened (tree op, tree for_type)
4473 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4474 tree type = TREE_TYPE (op);
4476 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4478 = (for_type != 0 && for_type != type
4479 && final_prec > TYPE_PRECISION (type)
4480 && TYPE_UNSIGNED (type));
4483 while (TREE_CODE (op) == NOP_EXPR)
4486 = TYPE_PRECISION (TREE_TYPE (op))
4487 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4489 /* Truncations are many-one so cannot be removed.
4490 Unless we are later going to truncate down even farther. */
4492 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4495 /* See what's inside this conversion. If we decide to strip it,
4497 op = TREE_OPERAND (op, 0);
4499 /* If we have not stripped any zero-extensions (uns is 0),
4500 we can strip any kind of extension.
4501 If we have previously stripped a zero-extension,
4502 only zero-extensions can safely be stripped.
4503 Any extension can be stripped if the bits it would produce
4504 are all going to be discarded later by truncating to FOR_TYPE. */
4508 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4510 /* TYPE_UNSIGNED says whether this is a zero-extension.
4511 Let's avoid computing it if it does not affect WIN
4512 and if UNS will not be needed again. */
4513 if ((uns || TREE_CODE (op) == NOP_EXPR)
4514 && TYPE_UNSIGNED (TREE_TYPE (op)))
4522 if (TREE_CODE (op) == COMPONENT_REF
4523 /* Since type_for_size always gives an integer type. */
4524 && TREE_CODE (type) != REAL_TYPE
4525 /* Don't crash if field not laid out yet. */
4526 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4527 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4529 unsigned int innerprec
4530 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4531 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4532 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4533 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4535 /* We can get this structure field in the narrowest type it fits in.
4536 If FOR_TYPE is 0, do this only for a field that matches the
4537 narrower type exactly and is aligned for it
4538 The resulting extension to its nominal type (a fullword type)
4539 must fit the same conditions as for other extensions. */
4542 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4543 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4544 && (! uns || final_prec <= innerprec || unsignedp))
4546 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4547 TREE_OPERAND (op, 1), NULL_TREE);
4548 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4549 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4556 /* Return OP or a simpler expression for a narrower value
4557 which can be sign-extended or zero-extended to give back OP.
4558 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4559 or 0 if the value should be sign-extended. */
4562 get_narrower (tree op, int *unsignedp_ptr)
4567 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
4569 while (TREE_CODE (op) == NOP_EXPR)
4572 = (TYPE_PRECISION (TREE_TYPE (op))
4573 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4575 /* Truncations are many-one so cannot be removed. */
4579 /* See what's inside this conversion. If we decide to strip it,
4584 op = TREE_OPERAND (op, 0);
4585 /* An extension: the outermost one can be stripped,
4586 but remember whether it is zero or sign extension. */
4588 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4589 /* Otherwise, if a sign extension has been stripped,
4590 only sign extensions can now be stripped;
4591 if a zero extension has been stripped, only zero-extensions. */
4592 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4596 else /* bitschange == 0 */
4598 /* A change in nominal type can always be stripped, but we must
4599 preserve the unsignedness. */
4601 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4603 op = TREE_OPERAND (op, 0);
4604 /* Keep trying to narrow, but don't assign op to win if it
4605 would turn an integral type into something else. */
4606 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
4613 if (TREE_CODE (op) == COMPONENT_REF
4614 /* Since type_for_size always gives an integer type. */
4615 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4616 /* Ensure field is laid out already. */
4617 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4618 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4620 unsigned HOST_WIDE_INT innerprec
4621 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4622 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4623 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4624 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4626 /* We can get this structure field in a narrower type that fits it,
4627 but the resulting extension to its nominal type (a fullword type)
4628 must satisfy the same conditions as for other extensions.
4630 Do this only for fields that are aligned (not bit-fields),
4631 because when bit-field insns will be used there is no
4632 advantage in doing this. */
4634 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4635 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4636 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4640 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4641 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4642 TREE_OPERAND (op, 1), NULL_TREE);
4643 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4644 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4647 *unsignedp_ptr = uns;
4651 /* Nonzero if integer constant C has a value that is permissible
4652 for type TYPE (an INTEGER_TYPE). */
4655 int_fits_type_p (tree c, tree type)
4657 tree type_low_bound = TYPE_MIN_VALUE (type);
4658 tree type_high_bound = TYPE_MAX_VALUE (type);
4659 int ok_for_low_bound, ok_for_high_bound;
4661 /* Perform some generic filtering first, which may allow making a decision
4662 even if the bounds are not constant. First, negative integers never fit
4663 in unsigned types, */
4664 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4665 /* Also, unsigned integers with top bit set never fit signed types. */
4666 || (! TYPE_UNSIGNED (type)
4667 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4670 /* If at least one bound of the type is a constant integer, we can check
4671 ourselves and maybe make a decision. If no such decision is possible, but
4672 this type is a subtype, try checking against that. Otherwise, use
4673 force_fit_type, which checks against the precision.
4675 Compute the status for each possibly constant bound, and return if we see
4676 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4677 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4678 for "constant known to fit". */
4680 ok_for_low_bound = -1;
4681 ok_for_high_bound = -1;
4683 /* Check if C >= type_low_bound. */
4684 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4686 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4687 if (! ok_for_low_bound)
4691 /* Check if c <= type_high_bound. */
4692 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4694 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4695 if (! ok_for_high_bound)
4699 /* If the constant fits both bounds, the result is known. */
4700 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4703 /* If we haven't been able to decide at this point, there nothing more we
4704 can check ourselves here. Look at the base type if we have one. */
4705 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4706 return int_fits_type_p (c, TREE_TYPE (type));
4708 /* Or to force_fit_type, if nothing else. */
4712 TREE_TYPE (c) = type;
4713 c = force_fit_type (c, -1, false, false);
4714 return !TREE_OVERFLOW (c);
4718 /* Subprogram of following function. Called by walk_tree.
4720 Return *TP if it is an automatic variable or parameter of the
4721 function passed in as DATA. */
4724 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
4726 tree fn = (tree) data;
4731 else if (DECL_P (*tp) && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
4737 /* Returns true if T is, contains, or refers to a type with variable
4738 size. If FN is nonzero, only return true if a modifier of the type
4739 or position of FN is a variable or parameter inside FN.
4741 This concept is more general than that of C99 'variably modified types':
4742 in C99, a struct type is never variably modified because a VLA may not
4743 appear as a structure member. However, in GNU C code like:
4745 struct S { int i[f()]; };
4747 is valid, and other languages may define similar constructs. */
4750 variably_modified_type_p (tree type, tree fn)
4754 /* Test if T is either variable (if FN is zero) or an expression containing
4755 a variable in FN. */
4756 #define RETURN_TRUE_IF_VAR(T) \
4757 do { tree _t = (T); \
4758 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4759 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4760 return true; } while (0)
4762 if (type == error_mark_node)
4765 /* If TYPE itself has variable size, it is variably modified.
4767 We do not yet have a representation of the C99 '[*]' syntax.
4768 When a representation is chosen, this function should be modified
4769 to test for that case as well. */
4770 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
4771 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
4773 switch (TREE_CODE (type))
4776 case REFERENCE_TYPE:
4780 if (variably_modified_type_p (TREE_TYPE (type), fn))
4786 /* If TYPE is a function type, it is variably modified if any of the
4787 parameters or the return type are variably modified. */
4788 if (variably_modified_type_p (TREE_TYPE (type), fn))
4791 for (t = TYPE_ARG_TYPES (type);
4792 t && t != void_list_node;
4794 if (variably_modified_type_p (TREE_VALUE (t), fn))
4803 /* Scalar types are variably modified if their end points
4805 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
4806 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
4811 case QUAL_UNION_TYPE:
4812 /* We can't see if any of the field are variably-modified by the
4813 definition we normally use, since that would produce infinite
4814 recursion via pointers. */
4815 /* This is variably modified if some field's type is. */
4816 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4817 if (TREE_CODE (t) == FIELD_DECL)
4819 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
4820 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
4821 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
4823 if (TREE_CODE (type) == QUAL_UNION_TYPE)
4824 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
4832 /* The current language may have other cases to check, but in general,
4833 all other types are not variably modified. */
4834 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
4836 #undef RETURN_TRUE_IF_VAR
4839 /* Given a DECL or TYPE, return the scope in which it was declared, or
4840 NULL_TREE if there is no containing scope. */
4843 get_containing_scope (tree t)
4845 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4848 /* Return the innermost context enclosing DECL that is
4849 a FUNCTION_DECL, or zero if none. */
4852 decl_function_context (tree decl)
4856 if (TREE_CODE (decl) == ERROR_MARK)
4859 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4860 where we look up the function at runtime. Such functions always take
4861 a first argument of type 'pointer to real context'.
4863 C++ should really be fixed to use DECL_CONTEXT for the real context,
4864 and use something else for the "virtual context". */
4865 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4868 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4870 context = DECL_CONTEXT (decl);
4872 while (context && TREE_CODE (context) != FUNCTION_DECL)
4874 if (TREE_CODE (context) == BLOCK)
4875 context = BLOCK_SUPERCONTEXT (context);
4877 context = get_containing_scope (context);
4883 /* Return the innermost context enclosing DECL that is
4884 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4885 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4888 decl_type_context (tree decl)
4890 tree context = DECL_CONTEXT (decl);
4893 switch (TREE_CODE (context))
4895 case NAMESPACE_DECL:
4896 case TRANSLATION_UNIT_DECL:
4901 case QUAL_UNION_TYPE:
4906 context = DECL_CONTEXT (context);
4910 context = BLOCK_SUPERCONTEXT (context);
4920 /* CALL is a CALL_EXPR. Return the declaration for the function
4921 called, or NULL_TREE if the called function cannot be
4925 get_callee_fndecl (tree call)
4929 /* It's invalid to call this function with anything but a
4931 if (TREE_CODE (call) != CALL_EXPR)
4934 /* The first operand to the CALL is the address of the function
4936 addr = TREE_OPERAND (call, 0);
4940 /* If this is a readonly function pointer, extract its initial value. */
4941 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4942 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4943 && DECL_INITIAL (addr))
4944 addr = DECL_INITIAL (addr);
4946 /* If the address is just `&f' for some function `f', then we know
4947 that `f' is being called. */
4948 if (TREE_CODE (addr) == ADDR_EXPR
4949 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4950 return TREE_OPERAND (addr, 0);
4952 /* We couldn't figure out what was being called. Maybe the front
4953 end has some idea. */
4954 return lang_hooks.lang_get_callee_fndecl (call);
4957 /* Print debugging information about tree nodes generated during the compile,
4958 and any language-specific information. */
4961 dump_tree_statistics (void)
4963 #ifdef GATHER_STATISTICS
4965 int total_nodes, total_bytes;
4968 fprintf (stderr, "\n??? tree nodes created\n\n");
4969 #ifdef GATHER_STATISTICS
4970 fprintf (stderr, "Kind Nodes Bytes\n");
4971 fprintf (stderr, "---------------------------------------\n");
4972 total_nodes = total_bytes = 0;
4973 for (i = 0; i < (int) all_kinds; i++)
4975 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4976 tree_node_counts[i], tree_node_sizes[i]);
4977 total_nodes += tree_node_counts[i];
4978 total_bytes += tree_node_sizes[i];
4980 fprintf (stderr, "---------------------------------------\n");
4981 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4982 fprintf (stderr, "---------------------------------------\n");
4983 ssanames_print_statistics ();
4984 phinodes_print_statistics ();
4986 fprintf (stderr, "(No per-node statistics)\n");
4988 print_type_hash_statistics ();
4989 lang_hooks.print_statistics ();
4992 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4994 /* Generate a crc32 of a string. */
4997 crc32_string (unsigned chksum, const char *string)
5001 unsigned value = *string << 24;
5004 for (ix = 8; ix--; value <<= 1)
5008 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
5017 /* P is a string that will be used in a symbol. Mask out any characters
5018 that are not valid in that context. */
5021 clean_symbol_name (char *p)
5025 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5028 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5035 /* Generate a name for a function unique to this translation unit.
5036 TYPE is some string to identify the purpose of this function to the
5037 linker or collect2. */
5040 get_file_function_name_long (const char *type)
5046 if (first_global_object_name)
5047 p = first_global_object_name;
5050 /* We don't have anything that we know to be unique to this translation
5051 unit, so use what we do have and throw in some randomness. */
5053 const char *name = weak_global_object_name;
5054 const char *file = main_input_filename;
5059 file = input_filename;
5061 len = strlen (file);
5062 q = alloca (9 * 2 + len + 1);
5063 memcpy (q, file, len + 1);
5064 clean_symbol_name (q);
5066 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5067 crc32_string (0, flag_random_seed));
5072 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5074 /* Set up the name of the file-level functions we may need.
5075 Use a global object (which is already required to be unique over
5076 the program) rather than the file name (which imposes extra
5078 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5080 return get_identifier (buf);
5083 /* If KIND=='I', return a suitable global initializer (constructor) name.
5084 If KIND=='D', return a suitable global clean-up (destructor) name. */
5087 get_file_function_name (int kind)
5094 return get_file_function_name_long (p);
5097 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5098 The result is placed in BUFFER (which has length BIT_SIZE),
5099 with one bit in each char ('\000' or '\001').
5101 If the constructor is constant, NULL_TREE is returned.
5102 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5105 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5109 HOST_WIDE_INT domain_min
5110 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5111 tree non_const_bits = NULL_TREE;
5113 for (i = 0; i < bit_size; i++)
5116 for (vals = TREE_OPERAND (init, 1);
5117 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5119 if (!host_integerp (TREE_VALUE (vals), 0)
5120 || (TREE_PURPOSE (vals) != NULL_TREE
5121 && !host_integerp (TREE_PURPOSE (vals), 0)))
5123 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5124 else if (TREE_PURPOSE (vals) != NULL_TREE)
5126 /* Set a range of bits to ones. */
5127 HOST_WIDE_INT lo_index
5128 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5129 HOST_WIDE_INT hi_index
5130 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5132 if (lo_index < 0 || lo_index >= bit_size
5133 || hi_index < 0 || hi_index >= bit_size)
5135 for (; lo_index <= hi_index; lo_index++)
5136 buffer[lo_index] = 1;
5140 /* Set a single bit to one. */
5142 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5143 if (index < 0 || index >= bit_size)
5145 error ("invalid initializer for bit string");
5151 return non_const_bits;
5154 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5155 The result is placed in BUFFER (which is an array of bytes).
5156 If the constructor is constant, NULL_TREE is returned.
5157 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5160 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5163 int set_word_size = BITS_PER_UNIT;
5164 int bit_size = wd_size * set_word_size;
5166 unsigned char *bytep = buffer;
5167 char *bit_buffer = alloca (bit_size);
5168 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5170 for (i = 0; i < wd_size; i++)
5173 for (i = 0; i < bit_size; i++)
5177 if (BYTES_BIG_ENDIAN)
5178 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5180 *bytep |= 1 << bit_pos;
5183 if (bit_pos >= set_word_size)
5184 bit_pos = 0, bytep++;
5186 return non_const_bits;
5189 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5191 /* Complain that the tree code of NODE does not match the expected 0
5192 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5196 tree_check_failed (const tree node, const char *file,
5197 int line, const char *function, ...)
5201 unsigned length = 0;
5204 va_start (args, function);
5205 while ((code = va_arg (args, int)))
5206 length += 4 + strlen (tree_code_name[code]);
5208 va_start (args, function);
5209 buffer = alloca (length);
5211 while ((code = va_arg (args, int)))
5215 strcpy (buffer + length, " or ");
5218 strcpy (buffer + length, tree_code_name[code]);
5219 length += strlen (tree_code_name[code]);
5223 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5224 buffer, tree_code_name[TREE_CODE (node)],
5225 function, trim_filename (file), line);
5228 /* Complain that the tree code of NODE does match the expected 0
5229 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5233 tree_not_check_failed (const tree node, const char *file,
5234 int line, const char *function, ...)
5238 unsigned length = 0;
5241 va_start (args, function);
5242 while ((code = va_arg (args, int)))
5243 length += 4 + strlen (tree_code_name[code]);
5245 va_start (args, function);
5246 buffer = alloca (length);
5248 while ((code = va_arg (args, int)))
5252 strcpy (buffer + length, " or ");
5255 strcpy (buffer + length, tree_code_name[code]);
5256 length += strlen (tree_code_name[code]);
5260 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5261 buffer, tree_code_name[TREE_CODE (node)],
5262 function, trim_filename (file), line);
5265 /* Similar to tree_check_failed, except that we check for a class of tree
5266 code, given in CL. */
5269 tree_class_check_failed (const tree node, int cl, const char *file,
5270 int line, const char *function)
5273 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5274 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5275 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5278 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5279 (dynamically sized) vector. */
5282 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5283 const char *function)
5286 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5287 idx + 1, len, function, trim_filename (file), line);
5290 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5291 (dynamically sized) vector. */
5294 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5295 const char *function)
5298 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5299 idx + 1, len, function, trim_filename (file), line);
5302 /* Similar to above, except that the check is for the bounds of the operand
5303 vector of an expression node. */
5306 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5307 int line, const char *function)
5310 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5311 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5312 function, trim_filename (file), line);
5314 #endif /* ENABLE_TREE_CHECKING */
5316 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5317 and mapped to the machine mode MODE. Initialize its fields and build
5318 the information necessary for debugging output. */
5321 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
5323 tree t = make_node (VECTOR_TYPE);
5325 TREE_TYPE (t) = innertype;
5326 TYPE_VECTOR_SUBPARTS (t) = nunits;
5327 TYPE_MODE (t) = mode;
5331 tree index = build_int_cst (NULL_TREE, nunits - 1, 0);
5332 tree array = build_array_type (innertype, build_index_type (index));
5333 tree rt = make_node (RECORD_TYPE);
5335 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5336 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5338 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5339 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5340 the representation type, and we want to find that die when looking up
5341 the vector type. This is most easily achieved by making the TYPE_UID
5343 TYPE_UID (rt) = TYPE_UID (t);
5350 make_or_reuse_type (unsigned size, int unsignedp)
5352 if (size == INT_TYPE_SIZE)
5353 return unsignedp ? unsigned_type_node : integer_type_node;
5354 if (size == CHAR_TYPE_SIZE)
5355 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5356 if (size == SHORT_TYPE_SIZE)
5357 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5358 if (size == LONG_TYPE_SIZE)
5359 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5360 if (size == LONG_LONG_TYPE_SIZE)
5361 return (unsignedp ? long_long_unsigned_type_node
5362 : long_long_integer_type_node);
5365 return make_unsigned_type (size);
5367 return make_signed_type (size);
5370 /* Create nodes for all integer types (and error_mark_node) using the sizes
5371 of C datatypes. The caller should call set_sizetype soon after calling
5372 this function to select one of the types as sizetype. */
5375 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
5377 error_mark_node = make_node (ERROR_MARK);
5378 TREE_TYPE (error_mark_node) = error_mark_node;
5380 initialize_sizetypes (signed_sizetype);
5382 /* Define both `signed char' and `unsigned char'. */
5383 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5384 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5386 /* Define `char', which is like either `signed char' or `unsigned char'
5387 but not the same as either. */
5390 ? make_signed_type (CHAR_TYPE_SIZE)
5391 : make_unsigned_type (CHAR_TYPE_SIZE));
5393 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5394 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5395 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5396 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5397 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5398 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5399 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5400 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5402 /* Define a boolean type. This type only represents boolean values but
5403 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5404 Front ends which want to override this size (i.e. Java) can redefine
5405 boolean_type_node before calling build_common_tree_nodes_2. */
5406 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5407 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5408 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1, 0);
5409 TYPE_PRECISION (boolean_type_node) = 1;
5411 /* Fill in the rest of the sized types. Reuse existing type nodes
5413 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5414 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5415 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5416 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5417 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5419 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5420 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5421 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5422 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5423 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5425 access_public_node = get_identifier ("public");
5426 access_protected_node = get_identifier ("protected");
5427 access_private_node = get_identifier ("private");
5430 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5431 It will create several other common tree nodes. */
5434 build_common_tree_nodes_2 (int short_double)
5436 /* Define these next since types below may used them. */
5437 integer_zero_node = build_int_cst (NULL_TREE, 0, 0);
5438 integer_one_node = build_int_cst (NULL_TREE, 1, 0);
5439 integer_minus_one_node = build_int_cst (NULL_TREE, -1, -1);
5441 size_zero_node = size_int (0);
5442 size_one_node = size_int (1);
5443 bitsize_zero_node = bitsize_int (0);
5444 bitsize_one_node = bitsize_int (1);
5445 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5447 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5448 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5450 void_type_node = make_node (VOID_TYPE);
5451 layout_type (void_type_node);
5453 /* We are not going to have real types in C with less than byte alignment,
5454 so we might as well not have any types that claim to have it. */
5455 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5456 TYPE_USER_ALIGN (void_type_node) = 0;
5458 null_pointer_node = build_int_cst (build_pointer_type (void_type_node),
5460 layout_type (TREE_TYPE (null_pointer_node));
5462 ptr_type_node = build_pointer_type (void_type_node);
5464 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5465 fileptr_type_node = ptr_type_node;
5467 float_type_node = make_node (REAL_TYPE);
5468 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5469 layout_type (float_type_node);
5471 double_type_node = make_node (REAL_TYPE);
5473 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5475 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5476 layout_type (double_type_node);
5478 long_double_type_node = make_node (REAL_TYPE);
5479 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5480 layout_type (long_double_type_node);
5482 float_ptr_type_node = build_pointer_type (float_type_node);
5483 double_ptr_type_node = build_pointer_type (double_type_node);
5484 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5485 integer_ptr_type_node = build_pointer_type (integer_type_node);
5487 complex_integer_type_node = make_node (COMPLEX_TYPE);
5488 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5489 layout_type (complex_integer_type_node);
5491 complex_float_type_node = make_node (COMPLEX_TYPE);
5492 TREE_TYPE (complex_float_type_node) = float_type_node;
5493 layout_type (complex_float_type_node);
5495 complex_double_type_node = make_node (COMPLEX_TYPE);
5496 TREE_TYPE (complex_double_type_node) = double_type_node;
5497 layout_type (complex_double_type_node);
5499 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5500 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5501 layout_type (complex_long_double_type_node);
5504 tree t = targetm.build_builtin_va_list ();
5506 /* Many back-ends define record types without setting TYPE_NAME.
5507 If we copied the record type here, we'd keep the original
5508 record type without a name. This breaks name mangling. So,
5509 don't copy record types and let c_common_nodes_and_builtins()
5510 declare the type to be __builtin_va_list. */
5511 if (TREE_CODE (t) != RECORD_TYPE)
5512 t = build_variant_type_copy (t);
5514 va_list_type_node = t;
5518 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5521 If we requested a pointer to a vector, build up the pointers that
5522 we stripped off while looking for the inner type. Similarly for
5523 return values from functions.
5525 The argument TYPE is the top of the chain, and BOTTOM is the
5526 new type which we will point to. */
5529 reconstruct_complex_type (tree type, tree bottom)
5533 if (POINTER_TYPE_P (type))
5535 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5536 outer = build_pointer_type (inner);
5538 else if (TREE_CODE (type) == ARRAY_TYPE)
5540 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5541 outer = build_array_type (inner, TYPE_DOMAIN (type));
5543 else if (TREE_CODE (type) == FUNCTION_TYPE)
5545 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5546 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5548 else if (TREE_CODE (type) == METHOD_TYPE)
5550 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5551 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5553 TYPE_ARG_TYPES (type));
5558 TYPE_READONLY (outer) = TYPE_READONLY (type);
5559 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5564 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5567 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5571 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5572 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5573 nunits = GET_MODE_NUNITS (mode);
5575 else if (GET_MODE_CLASS (mode) == MODE_INT)
5577 /* Check that there are no leftover bits. */
5578 if (GET_MODE_BITSIZE (mode) % TREE_INT_CST_LOW (TYPE_SIZE (innertype)))
5581 nunits = GET_MODE_BITSIZE (mode)
5582 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
5587 return make_vector_type (innertype, nunits, mode);
5590 /* Similarly, but takes the inner type and number of units, which must be
5594 build_vector_type (tree innertype, int nunits)
5596 return make_vector_type (innertype, nunits, VOIDmode);
5599 /* Given an initializer INIT, return TRUE if INIT is zero or some
5600 aggregate of zeros. Otherwise return FALSE. */
5602 initializer_zerop (tree init)
5608 switch (TREE_CODE (init))
5611 return integer_zerop (init);
5614 /* ??? Note that this is not correct for C4X float formats. There,
5615 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5616 negative exponent. */
5617 return real_zerop (init)
5618 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5621 return integer_zerop (init)
5622 || (real_zerop (init)
5623 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5624 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5627 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5628 if (!initializer_zerop (TREE_VALUE (elt)))
5633 elt = CONSTRUCTOR_ELTS (init);
5634 if (elt == NULL_TREE)
5637 /* A set is empty only if it has no elements. */
5638 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5641 for (; elt ; elt = TREE_CHAIN (elt))
5642 if (! initializer_zerop (TREE_VALUE (elt)))
5652 add_var_to_bind_expr (tree bind_expr, tree var)
5654 BIND_EXPR_VARS (bind_expr)
5655 = chainon (BIND_EXPR_VARS (bind_expr), var);
5656 if (BIND_EXPR_BLOCK (bind_expr))
5657 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5658 = BIND_EXPR_VARS (bind_expr);
5661 /* Build an empty statement. */
5664 build_empty_stmt (void)
5666 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5670 /* Returns true if it is possible to prove that the index of
5671 an array access REF (an ARRAY_REF expression) falls into the
5675 in_array_bounds_p (tree ref)
5677 tree idx = TREE_OPERAND (ref, 1);
5680 if (TREE_CODE (idx) != INTEGER_CST)
5683 min = array_ref_low_bound (ref);
5684 max = array_ref_up_bound (ref);
5687 || TREE_CODE (min) != INTEGER_CST
5688 || TREE_CODE (max) != INTEGER_CST)
5691 if (tree_int_cst_lt (idx, min)
5692 || tree_int_cst_lt (max, idx))
5698 /* Return true if T (assumed to be a DECL) is a global variable. */
5701 is_global_var (tree t)
5703 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5706 /* Return true if T (assumed to be a DECL) must be assigned a memory
5710 needs_to_live_in_memory (tree t)
5712 return (TREE_ADDRESSABLE (t)
5713 || is_global_var (t)
5714 || (TREE_CODE (t) == RESULT_DECL
5715 && aggregate_value_p (t, current_function_decl)));
5718 /* There are situations in which a language considers record types
5719 compatible which have different field lists. Decide if two fields
5720 are compatible. It is assumed that the parent records are compatible. */
5723 fields_compatible_p (tree f1, tree f2)
5725 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
5726 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
5729 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
5730 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
5733 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
5739 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5742 find_compatible_field (tree record, tree orig_field)
5746 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
5747 if (TREE_CODE (f) == FIELD_DECL
5748 && fields_compatible_p (f, orig_field))
5751 /* ??? Why isn't this on the main fields list? */
5752 f = TYPE_VFIELD (record);
5753 if (f && TREE_CODE (f) == FIELD_DECL
5754 && fields_compatible_p (f, orig_field))
5757 /* ??? We should abort here, but Java appears to do Bad Things
5758 with inherited fields. */
5762 /* Return value of a constant X. */
5765 int_cst_value (tree x)
5767 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
5768 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
5769 bool negative = ((val >> (bits - 1)) & 1) != 0;
5771 if (bits > HOST_BITS_PER_WIDE_INT)
5775 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
5777 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
5782 /* Returns the greatest common divisor of A and B, which must be
5786 tree_fold_gcd (tree a, tree b)
5789 tree type = TREE_TYPE (a);
5791 #if defined ENABLE_CHECKING
5792 if (TREE_CODE (a) != INTEGER_CST
5793 || TREE_CODE (b) != INTEGER_CST)
5797 if (integer_zerop (a))
5800 if (integer_zerop (b))
5803 if (tree_int_cst_sgn (a) == -1)
5804 a = fold (build2 (MULT_EXPR, type, a,
5805 convert (type, integer_minus_one_node)));
5807 if (tree_int_cst_sgn (b) == -1)
5808 b = fold (build2 (MULT_EXPR, type, b,
5809 convert (type, integer_minus_one_node)));
5813 a_mod_b = fold (build2 (CEIL_MOD_EXPR, type, a, b));
5815 if (!TREE_INT_CST_LOW (a_mod_b)
5816 && !TREE_INT_CST_HIGH (a_mod_b))
5824 #include "gt-tree.h"