gcc/gcc/tree.c

1119    TREE_CHAIN, if it has one, is zero and it has a fresh uid.  */
1481 	    /* Make sure no one is clobbering the shared constant.  */
1506 	      /* Insert this one into the hash table.  */
1525 	  /* Insert this one into the hash table.  */
1633 	/* Otherwise insert this one into the hash table.  */
1784 	 loop for both const and side effects, rather than one loop
2243 /* Return 1 if EXPR is the integer constant one or the corresponding
2271 /* Return 1 if EXPR is the integer constant one.  For complex and vector,
2272    return 1 if every piece is the integer constant one.  */
2314 /* Return 1 if EXPR is the integer constant minus one.  */
2329    one bit on).  */
2362 /* Return 1 if EXPR is the integer constant one.  For vector,
2363    return 1 if every piece is the integer constant minus one
2553 /* Return 1 if EXPR is the real constant one in real or complex form.
2583 /* Return 1 if EXPR is the real constant minus one.  Trailing zeroes
3021    ARRAY_TYPE) minus one. This counts only elements of the top array.  */
3122   /* The conditions below are slightly less strict than the one in
3159   /* The conditions below are slightly less strict than the one in
3252    Do this to any expression which may be used in more than one place,
4762 	 causes breakage in code that expects there to be a one-to-one
5172      new one.  */
5374 /* Add type or decl T to one of the list of tree nodes that need their
5498 	  /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5722 /* If T needs an assembler name, have one created for it.  */
6015       /* If they are not equal, they may still be one in the form
6016 	 'text' while the other one is in the form '__text__'.  TODO:
6081   /* Either one unset?  Take the set one.  */
6401 /* This function checks to see if TYPE matches the size one of the built-in
6444    TYPE_QUALS, if one exists.  If no qualified version exists yet,
6455   /* Search the chain of variants to see if there is already one there just
6456      like the one we need to have.  If so, use that existing one.  We must
6722 /* Lookup a debug expression for FROM, and return it if we find one.  */
6749 /* Lookup a value expression for FROM, and return it if we find one.  */
6777    find one.  */
6947    object for an identical type if one already exists.
7224      is one larger than the largest positive value.  This is equivalent to
7231      that we need one more bit for a signed than unsigned type.
7660 	      inchash::hash one, two;
7661 	      inchash::add_expr (TREE_OPERAND (t, 0), one);
7663 	      hstate.add_commutative (one, two);
7918    (one less than the length of the array).
7923    sizes that use more than one HOST_WIDE_INT.  */
8159   /* If we already have such a type, use the old one.  */
8315   /* If we already have such a type, use the old one.  */
8375   /* If we already have such a type, use the old one.  */
8415   /* If we already have such a type, use the old one.  */
8568       /* Truncations are many-one so cannot be removed.
8633       /* Truncations are many-one so cannot be removed.  */
8643 	  /* An extension: the outermost one can be stripped,
8723   /* If at least one bound of the type is a constant integer, we can check
8729      one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8787      can check ourselves here.  Look at the base type if we have one and it
9211    one of:
10403   /* We always build the non-opaque variant before the opaque one,
10404      so if it already exists, it is TYPE_NEXT_VARIANT of this one.  */
11025 	 by checking if we're pointing to another pointer, that one
11026 	 points to another pointer, that one does too, and we have no htab.
11028 	 the cost of the hash table if we don't need one.  */
11183 	/* Now walk the first one as a tail call.  */
11703       /* Insert this one into the hash table.  */
11730       /* Insert this one into the hash table.  */
11787 	 will give us if it has one).  Note that DECL's abstract origins are