Warning, /testsuites/fstests/fsrfsbitmap01/fsrfsbitmap01.scn is written in an unsupported language. File is not indexed.
0001 *** FILE SYSTEM TEST ( MOUNTED RFS ) ***
0002 Initializing filesystem MOUNTED RFS
0003
0004 START of RFS Bitmap Unit Test
0005 Bit set value : 0
0006 Bit clear value : 1
0007 Num bit per element : 32
0008
0009 RFS Bitmap Test : size = 4096 (128)
0010 1. Find bit with seed > size: pass (Success)
0011 2. Find bit with seed = size: pass (Success)
0012 3. Find bit 0 with seed = 0: pass (Success): bit = 0
0013 4. Find bit (size - 1) with seed = (size - 1) (4095): pass (Success): bit = 4095
0014 5. Test bit 0: pass (Success)
0015 6. Test bit (size - 1) (4095): pass (Success)
0016 7. Test bit range (1,4094] all clear: pass
0017 8. Set all bits: PASS (Success)
0018 9. Clear bit 3232: PASS (Success)
0019 10. Find bit with seed = 0: pass (Success): bit = 3232
0020 11. Fail to find bit with seed = 0: pass (Success): bit = 2048
0021 12. Clear bit 0: pass (Success)
0022 13. Find bit with seed = (size - 1): pass (Success): bit = 0
0023 14. Clear bit (size - 1) (4095): pass (Success)
0024 15. Find bit with seed = 0: pass (Success): bit = 4095
0025 16. Clear bit 0: pass (Success)
0026 17. Find bit with seed = (size / 2) (2048): pass (Success): bit = 0
0027 18. Clear bit (size - 1) (4095): pass, (Success)
0028 19. Find bit with seed = (size / 2) (2048): pass (Success): bit = 4095
0029 20. Clear bit 0: pass (Success)
0030 21. Find bit with seed = ((size / 2) - 1) (2047): pass (Success): bit = 0
0031 22. Clear bit (size - 1) (4095): pass (Success)
0032 23. Find bit with seed = ((size / 2) - 1) (2047): pass (Success): bit = 4095
0033 23. Set all bits
0034 23. Cleared bits (1432, 1463] (32)
0035 23. Alloc'ed all bits (1463, 1494] (32)
0036 24. Set all bits
0037 24. Cleared bits (660, 716] (57)
0038 24. Alloc'ed all bits (716, 772] (57)
0039 25. Set all bits: PASS (Success)
0040 26. Clear bit (1321, 2070]: PASS (Success)
0041 27. Check free count is 749: 749: pass (Success)
0042 28. Create search check free count is 749: 749: pass (Success)
0043 29. Map set check with bit (4098) larger than size (4096)
0044 30. Map clear check with bit (4098) larger than size (4096)
0045 31. Map test check with bit (4098) larger than size (4096)
0046 32. Set all bits in the map, then clear bit (2048) and set this bit once again: PASSED
0047 33. Attempt to find bit when all bits are set (expected FAILED): FAILED
0048 34. Clear all bits in the map.
0049
0050 RFS Bitmap Test : size = 2048 (64)
0051 1. Find bit with seed > size: pass (Success)
0052 2. Find bit with seed = size: pass (Success)
0053 3. Find bit 0 with seed = 0: pass (Success): bit = 0
0054 4. Find bit (size - 1) with seed = (size - 1) (2047): pass (Success): bit = 2047
0055 5. Test bit 0: pass (Success)
0056 6. Test bit (size - 1) (2047): pass (Success)
0057 7. Test bit range (1,2046] all clear: pass
0058 8. Set all bits: PASS (Success)
0059 9. Clear bit 449: PASS (Success)
0060 10. Find bit with seed = 0: pass (Success): bit = 449
0061 11. Fail to find bit with seed = 0: pass (Success): bit = 0
0062 12. Clear bit 0: pass (Success)
0063 13. Find bit with seed = (size - 1): pass (Success): bit = 0
0064 14. Clear bit (size - 1) (2047): pass (Success)
0065 15. Find bit with seed = 0: pass (Success): bit = 2047
0066 16. Clear bit 0: pass (Success)
0067 17. Find bit with seed = (size / 2) (1024): pass (Success): bit = 0
0068 18. Clear bit (size - 1) (2047): pass, (Success)
0069 19. Find bit with seed = (size / 2) (1024): pass (Success): bit = 2047
0070 20. Clear bit 0: pass (Success)
0071 21. Find bit with seed = ((size / 2) - 1) (1023): pass (Success): bit = 0
0072 22. Clear bit (size - 1) (2047): pass (Success)
0073 23. Find bit with seed = ((size / 2) - 1) (1023): pass (Success): bit = 2047
0074 23. Set all bits
0075 23. Cleared bits (960, 991] (32)
0076 23. Alloc'ed all bits (991, 1022] (32)
0077 24. Set all bits
0078 24. Cleared bits (166, 222] (57)
0079 24. Alloc'ed all bits (222, 278] (57)
0080 25. Set all bits: PASS (Success)
0081 26. Clear bit (177, 770]: PASS (Success)
0082 27. Check free count is 593: 593: pass (Success)
0083 28. Create search check free count is 593: 593: pass (Success)
0084 29. Map set check with bit (2050) larger than size (2048)
0085 30. Map clear check with bit (2050) larger than size (2048)
0086 31. Map test check with bit (2050) larger than size (2048)
0087 32. Set all bits in the map, then clear bit (1024) and set this bit once again: PASSED
0088 33. Attempt to find bit when all bits are set (expected FAILED): FAILED
0089 34. Clear all bits in the map.
0090
0091 RFS Bitmap Test : size = 420 (14)
0092 1. Find bit with seed > size: pass (Success)
0093 2. Find bit with seed = size: pass (Success)
0094 3. Find bit 0 with seed = 0: pass (Success): bit = 0
0095 4. Find bit (size - 1) with seed = (size - 1) (419): pass (Success): bit = 419
0096 5. Test bit 0: pass (Success)
0097 6. Test bit (size - 1) (419): pass (Success)
0098 7. Test bit range (1,418] all clear: pass
0099 8. Set all bits: PASS (Success)
0100 9. Clear bit 215: PASS (Success)
0101 10. Find bit with seed = 0: pass (Success): bit = 215
0102 11. Fail to find bit with seed = 0: pass (Success): bit = 0
0103 12. Clear bit 0: pass (Success)
0104 13. Find bit with seed = (size - 1): pass (Success): bit = 0
0105 14. Clear bit (size - 1) (419): pass (Success)
0106 15. Find bit with seed = 0: pass (Success): bit = 419
0107 16. Clear bit 0: pass (Success)
0108 17. Find bit with seed = (size / 2) (210): pass (Success): bit = 0
0109 18. Clear bit (size - 1) (419): pass, (Success)
0110 19. Find bit with seed = (size / 2) (210): pass (Success): bit = 419
0111 20. Clear bit 0: pass (Success)
0112 21. Find bit with seed = ((size / 2) - 1) (209): pass (Success): bit = 0
0113 22. Clear bit (size - 1) (419): pass (Success)
0114 23. Find bit with seed = ((size / 2) - 1) (209): pass (Success): bit = 419
0115 23. Set all bits
0116 23. Cleared bits (127, 158] (32)
0117 23. Alloc'ed all bits (158, 189] (32)
0118 24. Set all bits
0119 24. Cleared bits (83, 139] (57)
0120 24. Alloc'ed all bits (139, 195] (57)
0121 25. Set all bits: PASS (Success)
0122 26. Clear bit (94, 174]: PASS (Success)
0123 27. Check free count is 80: 80: pass (Success)
0124 28. Create search check free count is 80: 80: pass (Success)
0125 29. Map set check with bit (422) larger than size (420)
0126 30. Map clear check with bit (422) larger than size (420)
0127 31. Map test check with bit (422) larger than size (420)
0128 32. Set all bits in the map, then clear bit (210) and set this bit once again: PASSED
0129 33. Attempt to find bit when all bits are set (expected FAILED): FAILED
0130 34. Clear all bits in the map.
0131
0132 Testing bitmap_map functions with zero initialized bitmap control pointer
0133
0134 Allocate most of memory - attempt to fail while open bitmap - expect ENOMEM
0135 Attempt to open bitmap returned: Not enough space
0136 Freeing the allocated memory
0137
0138 END of RFS Bitmap Unit Test
0139
0140
0141 Shutting down filesystem MOUNTED RFS
0142 *** END OF FILE SYSTEM TEST ( MOUNTED RFS ) ***
