tree.def, [...]: Correctly document restrictions on the shift width.

2004-12-14  Tobias Schlueter  <tobias.schlueter@physik.uni-muenchen.de>

* tree.def, doc/c-tree.texi: Correctly document restrictions on the
shift width.

From-SVN: r92145

diff --git a/gcc/doc/c-tree.texi b/gcc/doc/c-tree.texi
index 514b98cc8c425894a299036a4380e49071b9293e..3dc7f71a109dec5a53cdef6ef4b0be4c50e3f6ba 100644 (file)
--- a/gcc/doc/c-tree.texi
+++ b/gcc/doc/c-tree.texi
@@ -2011,7 +2011,7 @@ shift.  Right shift should be treated as arithmetic, i.e., the
 high-order bits should be zero-filled when the expression has unsigned
 type and filled with the sign bit when the expression has signed type.
 Note that the result is undefined if the second operand is larger
-than the first operand's type size.
+than or equal to the first operand's type size.
 
 
 @item BIT_IOR_EXPR

diff --git a/gcc/tree.def b/gcc/tree.def
index ccb75c26f5b69e328277b554c5b564a5fb01bc26..3fc39e5d9134db108d02a47fcd79838b9f0e9141 100644 (file)
--- a/gcc/tree.def
+++ b/gcc/tree.def
@@ -630,7 +630,7 @@ DEFTREECODE (ABS_EXPR, "abs_expr", tcc_unary, 1)
    The second operand is the number of bits to
    shift by; it need not be the same type as the first operand and result.
    Note that the result is undefined if the second operand is larger
-   than the first operand's type size.  */
+   than or equal to the first operand's type size.  */
 DEFTREECODE (LSHIFT_EXPR, "lshift_expr", tcc_binary, 2)
 DEFTREECODE (RSHIFT_EXPR, "rshift_expr", tcc_binary, 2)
 DEFTREECODE (LROTATE_EXPR, "lrotate_expr", tcc_binary, 2)