[svn-r428] Changes since 19980612

----------------------

./src/H5Tbit.c
./MANIFEST
./test/Makefile.in
./test/bittests.c	NEW
	Finished the bit vector operations and added test cases.

./src/H5Tconv.c
./test/dtypes.c
	Finished integer->integer general conversion and added test
	cases. Overflows and underflows are handled by substituting
	the closest possible value.  Examples:

	   (unsigned)0xffff -> (unsigned)  0xff
	   (  signed)0xffff -> (unsigned)0x0000
	   (unsigned)0xffff -> (  signed)0x7fff
	   (  signed)0x7fff -> (  signed)  0x7f
	   (  signed)0xbfff -> (  signed)  0xbf
	   (  signed)0x8000 -> (  signed)  0x80

./src/H5private.h
	Added definitions for MIN and MAX that take 3 or 4 arguments:
	MIN3(), MIN4(), MAX3(), MAX4(). Also added MIN2() and MAX2()
	as aliases for MIN() and MAX().

./test/tattr.c
	Removed some redundant `&' operators.

./configure.in
./src/H5config.h.in	[regenerated]
./src/H5.c
	Fixed warnings on DEC where long double is the same as
	double.

1 files changed, 524 insertions, 0 deletions

diff --git a/test/bittests.c b/test/bittests.c
new file mode 100644
index 0000000..88c48dc
--- /dev/null
+++ b/test/bittests.c
@@ -0,0 +1,524 @@
+/*
+ * Copyright (C) 1998 NCSA
+ *                    All rights reserved.
+ *
+ * Programmer:  Robb Matzke <matzke@llnl.gov>
+ *              Tuesday, June 16, 1998
+ *
+ * Purpose:	Tests functions in H5Tbit.c
+ */
+#define H5T_PACKAGE
+#include <H5Tpkg.h>
+
+#define NTESTS	100000
+
+
+/*-------------------------------------------------------------------------
+ * Function:	test_find
+ *
+ * Purpose:	Test bit find operations.  This is just the basic stuff; more
+ *		rigorous testing will be performed by the other test
+ *		functions.
+ *
+ * Return:	Success:	0
+ *
+ *		Failure:	-1
+ *
+ * Programmer:	Robb Matzke
+ *              Tuesday, June 16, 1998
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+static herr_t
+test_find (void)
+{
+    uint8	v1[8];
+    intn	i;
+    ssize_t	n;
+    
+    printf ("%-70s", "Testing bit search operations");
+    fflush (stdout);
+
+    /* The zero length buffer */
+    memset (v1, 0xaa, sizeof v1);
+    n = H5T_bit_find (v1, 0, 0, H5T_BIT_LSB, TRUE);
+    if (-1!=n) {
+	puts ("*FAILED*");
+	puts ("   Zero length test failed (lsb)!");
+	goto failed;
+    }
+    n = H5T_bit_find (v1, 0, 0, H5T_BIT_MSB, TRUE);
+    if (-1!=n) {
+	puts ("*FAILED*");
+	puts ("   Zero length test failed (msb)!");
+	goto failed;
+    }
+    
+
+    /* The zero buffer */
+    memset (v1, 0, sizeof v1);
+    n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_LSB, TRUE);
+    if (-1!=n) {
+	puts ("*FAILED*");
+	puts ("   Zero buffer test failed (lsb)!");
+	goto failed;
+    }
+    n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_MSB, TRUE);
+    if (-1!=n) {
+	puts ("*FAILED*");
+	puts ("   Zero buffer test failed (msb)!");
+	goto failed;
+    }
+
+    /* Try all combinations of one byte */
+    for (i=0; i<8*(int)sizeof(v1); i++) {
+	memset (v1, 0, sizeof v1);
+	v1[i/8] = 1<<(i%8);
+	n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_LSB, TRUE);
+	if ((ssize_t)i!=n) {
+	    puts ("*FAILED*");
+	    printf ("   Test for set bit %d failed (lsb)!\n", i);
+	    goto failed;
+	}
+	n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_MSB, TRUE);
+	if ((ssize_t)i!=n) {
+	    puts ("*FAILED*");
+	    printf ("   Test for set bit %d failed (msb)!\n", i);
+	    goto failed;
+	}
+    }
+    
+    /* The one buffer */
+    memset (v1, 0xff, sizeof v1);
+    n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_LSB, FALSE);
+    if (-1!=n) {
+	puts ("*FAILED*");
+	puts ("   One buffer test failed (lsb)!");
+	goto failed;
+    }
+    n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_MSB, FALSE);
+    if (-1!=n) {
+	puts ("*FAILED*");
+	puts ("   One buffer test failed (msb)!");
+	goto failed;
+    }
+
+    /* Try all combinations of one byte */
+    for (i=0; i<8*(int)sizeof(v1); i++) {
+	memset (v1, 0xff, sizeof v1);
+	v1[i/8] &= ~(1<<(i%8));
+	n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_LSB, FALSE);
+	if ((ssize_t)i!=n) {
+	    puts ("*FAILED*");
+	    printf ("   Test for clear bit %d failed (lsb)!\n", i);
+	    goto failed;
+	}
+	n = H5T_bit_find (v1, 0, 8*sizeof(v1), H5T_BIT_MSB, FALSE);
+	if ((ssize_t)i!=n) {
+	    puts ("*FAILED*");
+	    printf ("   Test for clear bit %d failed (lsb)!\n", i);
+	    goto failed;
+	}
+    }
+    
+
+    puts (" PASSED");
+    return 0;
+
+ failed:
+    printf ("   v = 0x");
+    for (i=0; i<(int)sizeof(v1); i++) printf ("%02x", v1[i]);
+    printf ("\n");
+    return -1;
+}
+
+
+/*-------------------------------------------------------------------------
+ * Function:	test_copy
+ *
+ * Purpose:	Test bit copy operations.
+ *
+ * Return:	Success:	0
+ *
+ *		Failure:	-1
+ *
+ * Programmer:	Robb Matzke
+ *              Tuesday, June 16, 1998
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+static herr_t
+test_copy (void)
+{
+    uint8	v1[8], v2[8];
+    size_t	s_offset, d_offset, size;
+    intn	i, j;
+    ssize_t	n;
+    
+    printf ("%-70s", "Testing bit copy operations");
+    fflush (stdout);
+
+    for (i=0; i<NTESTS; i++) {
+	s_offset = rand() % (8*sizeof v1);
+	d_offset = rand() % (8*sizeof v2);
+	size = (unsigned)rand() % MIN (8*sizeof(v1), 8*sizeof(v2));
+	size = MIN3 (size, 8*sizeof(v1)-s_offset, 8*sizeof(v2)-d_offset);
+	memset (v1, 0xff, sizeof v1);
+	memset (v2, 0x00, sizeof v2);
+	
+	/* Copy some bits to v2 and make sure something was copied */
+	H5T_bit_copy (v2, d_offset, v1, s_offset, size);
+	for (j=0; j<(intn)sizeof(v2); j++) if (v2[j]) break;
+	if (size>0 && j>=(intn)sizeof(v2)) {
+	    puts ("*FAILED*");
+	    puts ("   Unabled to find copied region in destination");
+	    goto failed;
+	}
+	if (0==size && j<(intn)sizeof(v2)) {
+	    puts ("*FAILED*");
+	    puts ("   Found copied bits when we shouldn't have");
+	    goto failed;
+	}
+	
+
+	/* Look for the zeros and ones */
+	n = H5T_bit_find (v2, 0, 8*sizeof(v2), H5T_BIT_LSB, 1);
+	if (size>0 && n!=(ssize_t)d_offset) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find first copied bit in destination "
+		    "(n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==size && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found copied bits and shouldn't have!");
+	    goto failed;
+	}
+	n = H5T_bit_find (v2, d_offset, 8*sizeof(v2)-d_offset, H5T_BIT_LSB, 0);
+	if (d_offset+size<8*sizeof(v2) && n!=(ssize_t)size) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find last copied bit in destination "
+		    "(n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (d_offset+size==8*sizeof(v2) && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   High-order zeros are present and shouldn't be!");
+	    goto failed;
+	}
+
+	/*
+	 * Look for zeros and ones in reverse order.  This is only to test
+	 * that reverse searches work as expected.
+	 */
+	n = H5T_bit_find (v2, 0, 8*sizeof(v2), H5T_BIT_MSB, 1);
+	if (size>0 && (size_t)(n+1)!=d_offset+size) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find last copied bit in destination "
+		    "(reverse, n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==size && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found copied bits but shouldn't have (reverse)!");
+	    goto failed;
+	}
+	n = H5T_bit_find (v2, 0, d_offset+size, H5T_BIT_MSB, 0);
+	if (d_offset>0 && n+1!=(ssize_t)d_offset) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find beginning of copied data "
+		    "(reverse, n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==d_offset && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found leading original data but shouldn't have!");
+	    goto failed;
+	}
+
+    }
+
+    puts (" PASSED");
+    return 0;
+
+ failed:
+    printf ("   i=%d, s_offset=%lu, d_offset=%lu, size=%lu\n",
+	    i, (unsigned long)s_offset, (unsigned long)d_offset,
+	    (unsigned long)size);
+    printf ("   s = 0x");
+    for (j=sizeof(v1)-1; j>=0; --j) printf ("%02x", v1[j]);
+    printf ("\n   d = 0x");
+    for (j=sizeof(v2)-1; j>=0; --j) printf ("%02x", v2[j]);
+    printf ("\n");
+    return -1;
+}
+
+
+/*-------------------------------------------------------------------------
+ * Function:	test_set
+ *
+ * Purpose:	Test bit set operations
+ *
+ * Return:	Success:	0
+ *
+ *		Failure:	-1
+ *
+ * Programmer:	Robb Matzke
+ *              Tuesday, June 16, 1998
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+static herr_t
+test_set (void)
+{
+    uint8	v2[8];
+    size_t	d_offset, size;
+    intn	i, j;
+    ssize_t	n;
+    
+    printf ("%-70s", "Testing bit set operations");
+    fflush (stdout);
+
+    for (i=0; i<NTESTS; i++) {
+	d_offset = rand() % (8*sizeof v2);
+	size = (unsigned)rand() % (8*sizeof(v2));
+	size = MIN (size, 8*sizeof(v2)-d_offset);
+	memset (v2, 0x00, sizeof v2);
+	
+	/* Set some bits in v2 */
+	H5T_bit_set (v2, d_offset, size, TRUE);
+	for (j=0; j<(intn)sizeof(v2); j++) if (v2[j]) break;
+	if (size>0 && j>=(intn)sizeof(v2)) {
+	    puts ("*FAILED*");
+	    puts ("   Unabled to find set region in buffer");
+	    goto failed;
+	}
+	if (0==size && j<(intn)sizeof(v2)) {
+	    puts ("*FAILED*");
+	    puts ("   Found set bits when we shouldn't have");
+	    goto failed;
+	}
+	
+
+	/* Look for the zeros and ones */
+	n = H5T_bit_find (v2, 0, 8*sizeof(v2), H5T_BIT_LSB, 1);
+	if (size>0 && n!=(ssize_t)d_offset) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find first set bit in destination "
+		    "(n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==size && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found set bits and shouldn't have!");
+	    goto failed;
+	}
+	n = H5T_bit_find (v2, d_offset, 8*sizeof(v2)-d_offset, H5T_BIT_LSB, 0);
+	if (d_offset+size<8*sizeof(v2) && n!=(ssize_t)size) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find last set bit in destination "
+		    "(n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (d_offset+size==8*sizeof(v2) && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   High-order zeros are present and shouldn't be!");
+	    goto failed;
+	}
+
+	/*
+	 * Look for zeros and ones in reverse order.  This is only to test
+	 * that reverse searches work as expected.
+	 */
+	n = H5T_bit_find (v2, 0, 8*sizeof(v2), H5T_BIT_MSB, 1);
+	if (size>0 && (size_t)(n+1)!=d_offset+size) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find last set bit in destination "
+		    "(reverse, n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==size && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found set bits but shouldn't have (reverse)!");
+	    goto failed;
+	}
+	n = H5T_bit_find (v2, 0, d_offset+size, H5T_BIT_MSB, 0);
+	if (d_offset>0 && n+1!=(ssize_t)d_offset) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find beginning of set bit region "
+		    "(reverse, n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==d_offset && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found leading zeros but shouldn't have!");
+	    goto failed;
+	}
+
+    }
+
+    puts (" PASSED");
+    return 0;
+
+ failed:
+    printf ("   i=%d, d_offset=%lu, size=%lu\n",
+	    i, (unsigned long)d_offset, (unsigned long)size);
+    printf ("   d = 0x");
+    for (j=sizeof(v2)-1; j>=0; --j) printf ("%02x", v2[j]);
+    printf ("\n");
+    return -1;
+}
+
+
+/*-------------------------------------------------------------------------
+ * Function:	test_clear
+ *
+ * Purpose:	Test bit clear operations
+ *
+ * Return:	Success:	0
+ *
+ *		Failure:	-1
+ *
+ * Programmer:	Robb Matzke
+ *              Tuesday, June 16, 1998
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+static herr_t
+test_clear (void)
+{
+    uint8	v2[8];
+    size_t	d_offset, size;
+    intn	i, j;
+    ssize_t	n;
+    
+    printf ("%-70s", "Testing bit clear operations");
+    fflush (stdout);
+
+    for (i=0; i<NTESTS; i++) {
+	d_offset = rand() % (8*sizeof v2);
+	size = (unsigned)rand() % (8*sizeof(v2));
+	size = MIN (size, 8*sizeof(v2)-d_offset);
+	memset (v2, 0xff, sizeof v2);
+	
+	/* Clear some bits in v2 */
+	H5T_bit_set (v2, d_offset, size, FALSE);
+	for (j=0; j<(intn)sizeof(v2); j++) if (0xff!=v2[j]) break;
+	if (size>0 && j>=(intn)sizeof(v2)) {
+	    puts ("*FAILED*");
+	    puts ("   Unabled to find cleared region in buffer");
+	    goto failed;
+	}
+	if (0==size && j<(intn)sizeof(v2)) {
+	    puts ("*FAILED*");
+	    puts ("   Found cleared bits when we shouldn't have");
+	    goto failed;
+	}
+	
+
+	/* Look for the zeros and ones */
+	n = H5T_bit_find (v2, 0, 8*sizeof(v2), H5T_BIT_LSB, 0);
+	if (size>0 && n!=(ssize_t)d_offset) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find first cleared bit in destination "
+		    "(n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==size && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found cleared bits and shouldn't have!");
+	    goto failed;
+	}
+	n = H5T_bit_find (v2, d_offset, 8*sizeof(v2)-d_offset, H5T_BIT_LSB, 1);
+	if (d_offset+size<8*sizeof(v2) && n!=(ssize_t)size) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find last cleared bit in destination "
+		    "(n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (d_offset+size==8*sizeof(v2) && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   High-order ones are present and shouldn't be!");
+	    goto failed;
+	}
+
+	/*
+	 * Look for zeros and ones in reverse order.  This is only to test
+	 * that reverse searches work as expected.
+	 */
+	n = H5T_bit_find (v2, 0, 8*sizeof(v2), H5T_BIT_MSB, 0);
+	if (size>0 && (size_t)(n+1)!=d_offset+size) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find last cleared bit in destination "
+		    "(reverse, n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==size && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found cleared bits but shouldn't have (reverse)!");
+	    goto failed;
+	}
+	n = H5T_bit_find (v2, 0, d_offset+size, H5T_BIT_MSB, 1);
+	if (d_offset>0 && n+1!=(ssize_t)d_offset) {
+	    puts ("*FAILED*");
+	    printf ("   Unable to find beginning of cleared bit region "
+		    "(reverse, n=%d)\n", (int)n);
+	    goto failed;
+	}
+	if (0==d_offset && n>=0) {
+	    puts ("*FAILED*");
+	    puts ("   Found leading ones but shouldn't have!");
+	    goto failed;
+	}
+
+    }
+
+    puts (" PASSED");
+    return 0;
+
+ failed:
+    printf ("   i=%d, d_offset=%lu, size=%lu\n",
+	    i, (unsigned long)d_offset, (unsigned long)size);
+    printf ("   d = 0x");
+    for (j=sizeof(v2)-1; j>=0; --j) printf ("%02x", v2[j]);
+    printf ("\n");
+    return -1;
+}
+
+
+/*-------------------------------------------------------------------------
+ * Function:	main
+ *
+ * Purpose:	
+ *
+ * Return:	Success:	
+ *
+ *		Failure:	
+ *
+ * Programmer:	Robb Matzke
+ *              Tuesday, June 16, 1998
+ *
+ * Modifications:
+ *
+ *-------------------------------------------------------------------------
+ */
+int
+main (void)
+{
+    intn	nerrors=0;
+
+    nerrors += test_find ()<0?1:0;
+    nerrors += test_set  ()<0?1:0;
+    nerrors += test_clear()<0?1:0;
+    nerrors += test_copy ()<0?1:0;
+
+    return nerrors?1:0;
+}