diff options
Diffstat (limited to 'cpukit/libfs/src/rfs/rtems-rfs-bitmaps-ut.c')
| -rw-r--r-- | cpukit/libfs/src/rfs/rtems-rfs-bitmaps-ut.c | 60 |
1 files changed, 30 insertions, 30 deletions
diff --git a/cpukit/libfs/src/rfs/rtems-rfs-bitmaps-ut.c b/cpukit/libfs/src/rfs/rtems-rfs-bitmaps-ut.c index 1240940bc2..db77a5177c 100644 --- a/cpukit/libfs/src/rfs/rtems-rfs-bitmaps-ut.c +++ b/cpukit/libfs/src/rfs/rtems-rfs-bitmaps-ut.c @@ -60,7 +60,7 @@ rtems_rfs_bitmap_ut_test_range (rtems_rfs_bitmap_control* control, return false; } } - + printf (" %2d. Test bit range (%" PRId32 ",%ld] all %s: pass\n", test, bit, bit + size - 1, set ? "set" : "clear"); @@ -76,7 +76,7 @@ rtems_rfs_bitmap_ut_alloc_seq_test (rtems_rfs_bitmap_control* control, bool state; int i; int rc; - + printf (" %2d. Set all bits\n", test); rc = rtems_rfs_bitmap_map_set_all (control); if (rc > 0) @@ -84,13 +84,13 @@ rtems_rfs_bitmap_ut_alloc_seq_test (rtems_rfs_bitmap_control* control, printf (" %2d. set all bits: FAIL (%s)\n", test, strerror (rc)); return false; } - + for (i = 0; i < size; i++) rtems_rfs_bitmap_map_clear (control, bit + i); - + printf (" %2d. Cleared bits (%" PRId32 ", %ld] (%zd)\n", test, bit, bit + size - 1, size); - + for (i = 0; i < rtems_rfs_bitmap_element_bits (); i++) { rc = rtems_rfs_bitmap_map_test (control, bit + i, &state); @@ -105,7 +105,7 @@ rtems_rfs_bitmap_ut_alloc_seq_test (rtems_rfs_bitmap_control* control, return false; } } - + for (i = 0, bit = 0; i < size; i++) { rtems_rfs_bitmap_bit seed = bit; @@ -127,7 +127,7 @@ rtems_rfs_bitmap_ut_alloc_seq_test (rtems_rfs_bitmap_control* control, printf (" %2d. Alloc'ed all bits (%" PRId32 ", %ld] (%zd)\n", test, bit, bit + size - 1, size); - + return true; } @@ -151,7 +151,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) memset (&fs, 0, sizeof (fs)); memset (&buffer, 0, sizeof (buffer)); - + buffer.buffer = malloc (bytes); buffer.block = 1; @@ -166,7 +166,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) #else memset (buffer.buffer, 0xff, bytes); #endif - + /* * Do not close the handle so no writes need occur. */ @@ -180,10 +180,10 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) handle.buffer = &buffer; handle.bnum = 1; - + printf ("\nRFS Bitmap Test : size = %zd (%zd)\n", size, rtems_rfs_bitmap_elements (size)); - rc = rtems_rfs_bitmap_open (&control, &fs, &handle, size, 1); + rc = rtems_rfs_bitmap_open (&control, &fs, &handle, size, 1); if (rc > 0) { printf (" Cannot open the bitmap: %s\n", strerror (rc)); @@ -199,7 +199,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) printf (" 1. Find bit with seed > size: %s (%s)\n", result ? "FAIL" : "pass", strerror (rc)); rtems_rfs_exit_on_error (rc, result, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_alloc (&control, size, &result, &bit); printf (" 2. Find bit with seed = size: %s (%s)\n", result ? "FAIL" : "pass", strerror (rc)); @@ -210,14 +210,14 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) printf (" 3. Find bit 0 with seed = 0: %s (%s): bit = %" PRId32 "\n", result ? "pass" : "FAIL", strerror (rc), bit); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_alloc (&control, size - 1, &result, &bit); result = result && (bit == (size - 1)); printf (" 4. Find bit (size - 1) with seed = (size - 1) (%zd): %s (%s): bit = %" PRId32 "\n", size - 1, result ? "pass" : "FAIL", strerror (rc), bit); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + /* * Test the bits allocated to make sure they are set. */ @@ -226,12 +226,12 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) printf (" 5. Test bit 0: %s (%s)\n", result ? "pass" : "FAIL", strerror (rc)); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_test (&control, size - 1, &result); printf (" 6. Test bit (size - 1) (%zd): %s (%s)\n", size - 1, result ? "pass" : "FAIL", strerror (rc)); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + if (!rtems_rfs_bitmap_ut_test_range (&control, 7, false, 1, size - 2)) rtems_rfs_exit_on_error (0, !result, &control, buffer.buffer); @@ -244,7 +244,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) rtems_rfs_exit_on_error (rc, false, &control, buffer.buffer); bit = rand () % size; - + rc = rtems_rfs_bitmap_map_clear (&control, bit); printf (" 9. Clear bit %" PRId32 ": %s (%s)\n", bit, rc == 0 ? "PASS" : "FAIL", strerror (rc)); @@ -256,18 +256,18 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) printf (" 10. Find bit with seed = 0: %s (%s): bit = %" PRId32 "\n", result ? "pass" : "FAIL", strerror (rc), bit); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_alloc (&control, 0, &result, &bit); result = !result || (bit != last_bit); printf (" 11. Fail to find bit with seed = 0: %s (%s): bit = %" PRId32 "\n", result ? "pass" : "FAIL", strerror (rc), bit); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_clear (&control, 0); printf (" 12. Clear bit 0: %s (%s)\n", rc == 0 ? "pass" : "FAIL", strerror (rc)); rtems_rfs_exit_on_error (rc, false, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_alloc (&control, size - 1, &result, &bit); result = result && (bit == 0); printf (" 13. Find bit with seed = (size - 1): %s (%s): bit = %" PRId32 "\n", @@ -288,7 +288,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) rc = rtems_rfs_bitmap_map_clear (&control, 0); printf (" 16. Clear bit 0: %s (%s)\n", rc == 0 ? "pass" : "FAIL", strerror (rc)); - + rc = rtems_rfs_bitmap_map_alloc (&control, size / 2, &result, &bit); result = result && (bit == 0); printf (" 17. Find bit with seed = (size / 2) (%zd): %s (%s): bit = %" PRId32 "\n", @@ -299,7 +299,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) printf (" 18. Clear bit (size - 1) (%zd): %s, (%s)\n", size - 1, rc == 0 ? "pass" : "FAIL", strerror (rc)); rtems_rfs_exit_on_error (rc, false, &control, buffer.buffer); - + rc = rtems_rfs_bitmap_map_alloc (&control, size / 2, &result, &bit); result = result && (bit == (size - 1)); printf (" 19. Find bit with seed = (size / 2) (%zd): %s (%s): bit = %" PRId32 "\n", @@ -309,7 +309,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) rc = rtems_rfs_bitmap_map_clear (&control, 0); printf (" 20. Clear bit 0: %s (%s)\n", rc == 0 ? "pass" : "FAIL", strerror (rc)); - + rc = rtems_rfs_bitmap_map_alloc (&control, (size / 2) - 1, &result, &bit); result = result && (bit == 0); printf (" 21. Find bit with seed = ((size / 2) - 1) (%zd): %s (%s): bit = %" PRId32 "\n", @@ -319,7 +319,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) rc = rtems_rfs_bitmap_map_clear (&control, size - 1); printf (" 22. Clear bit (size - 1) (%zd): %s (%s)\n", size - 1, rc == 0 ? "pass" : "FAIL", strerror (rc)); - + rc = rtems_rfs_bitmap_map_alloc (&control, (size / 2) - 1, &result, &bit); result = result && (bit == (size - 1)); printf (" 23. Find bit with seed = ((size / 2) - 1) (%zd): %s (%s): bit = %" PRId32 "\n", @@ -330,7 +330,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) result = rtems_rfs_bitmap_ut_alloc_seq_test (&control, 23, bit, rtems_rfs_bitmap_element_bits ()); rtems_rfs_exit_on_error (0, !result, &control, buffer.buffer); - + bit = rand () % (size / 2) + rtems_rfs_bitmap_element_bits (); result = rtems_rfs_bitmap_ut_alloc_seq_test (&control, 24, bit, 57); rtems_rfs_exit_on_error (0, !result, &control, buffer.buffer); @@ -344,7 +344,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) rc == 0 ? "PASS" : "FAIL", strerror (rc)); rtems_rfs_exit_on_error (rc, false, &control, buffer.buffer); - first_bit = rand () % (size / 2) + rtems_rfs_bitmap_element_bits (); + first_bit = rand () % (size / 2) + rtems_rfs_bitmap_element_bits (); last_bit = first_bit + rand () % (size / 2) + rtems_rfs_bitmap_element_bits (); for (bit = first_bit; bit < last_bit; bit++) @@ -357,10 +357,10 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) rtems_rfs_exit_on_error (rc, false, &control, buffer.buffer); } } - + printf (" 26. Clear bit (%" PRId32 ", %" PRId32 "]: %s (%s)\n", first_bit, last_bit, rc == 0 ? "PASS" : "FAIL", strerror (rc)); - + clear = rtems_rfs_bitmap_map_free (&control); result = clear == (last_bit - first_bit); printf (" 27. Check free count is %zd: %" PRId32 ": %s (%s)\n", @@ -373,7 +373,7 @@ rtems_rfs_bitmap_ut_test_bitmap (size_t size) clear, rtems_rfs_bitmap_map_free (&control), result ? "pass" : "FAIL", strerror (rc)); rtems_rfs_exit_on_error (rc, !result, &control, buffer.buffer); - + rtems_rfs_bitmap_close (&control); free (buffer.buffer); } @@ -391,7 +391,7 @@ rtems_rfs_bitmap_unit_test (void) #else srand (0x2398); #endif - + rtems_rfs_bitmap_ut_test_bitmap (2048); rtems_rfs_bitmap_ut_test_bitmap (420); } |