source: rtems/testsuites/fstests/fsrfsbitmap01/fsrfsbitmap01.scn @ 8f1b6cde

4.11
Last change on this file since 8f1b6cde was 8f1b6cde, checked in by Sebastian Huber <sebastian.huber@…>, on Nov 12, 2012 at 1:58:13 PM

fstests/fsrfsbitmap01: Fix NULL pointer access

Move test files into one directory.

  • Property mode set to 100644
File size: 6.3 KB
Line 
1*** FILE SYSTEM TEST ( MOUNTED RFS ) ***
2Initializing filesystem MOUNTED RFS
3
4 START of RFS Bitmap Unit Test
5 Bit set value       : 0
6 Bit clear value     : 1
7 Num bit per element : 32
8
9RFS Bitmap Test : size = 4096 (128)
10  1. Find bit with seed > size: pass (Success)
11  2. Find bit with seed = size: pass (Success)
12  3. Find bit 0 with seed = 0: pass (Success): bit = 0
13  4. Find bit (size - 1) with seed = (size - 1) (4095): pass (Success): bit = 4095
14  5. Test bit 0: pass (Success)
15  6. Test bit (size - 1) (4095): pass (Success)
16  7. Test bit range (1,4094] all clear: pass
17  8. Set all bits: PASS (Success)
18  9. Clear bit 3232: PASS (Success)
19 10. Find bit with seed = 0: pass (Success): bit = 3232
20 11. Fail to find bit with seed = 0: pass (Success): bit = 2048
21 12. Clear bit 0: pass (Success)
22 13. Find bit with seed = (size - 1): pass (Success): bit = 0
23 14. Clear bit (size - 1) (4095): pass (Success)
24 15. Find bit with seed = 0: pass (Success): bit = 4095
25 16. Clear bit 0: pass (Success)
26 17. Find bit with seed = (size / 2) (2048): pass (Success): bit = 0
27 18. Clear bit (size - 1) (4095): pass, (Success)
28 19. Find bit with seed = (size / 2) (2048): pass (Success): bit = 4095
29 20. Clear bit 0: pass (Success)
30 21. Find bit with seed = ((size / 2) - 1) (2047): pass (Success): bit = 0
31 22. Clear bit (size - 1) (4095): pass (Success)
32 23. Find bit with seed = ((size / 2) - 1) (2047): pass (Success): bit = 4095
33 23. Set all bits
34 23. Cleared bits (1432, 1463] (32)
35 23. Alloc'ed all bits (1463, 1494] (32)
36 24. Set all bits
37 24. Cleared bits (660, 716] (57)
38 24. Alloc'ed all bits (716, 772] (57)
39 25. Set all bits: PASS (Success)
40 26. Clear bit (1321, 2070]: PASS (Success)
41 27. Check free count is 749: 749: pass (Success)
42 28. Create search check free count is 749: 749: pass (Success)
43 29. Map set check with bit (4098) larger than size (4096)
44 30. Map clear check with bit (4098) larger than size (4096)
45 31. Map test check with bit (4098) larger than size (4096)
46 32. Set all bits in the map, then clear bit (2048) and set this bit once again:  PASSED
47 33. Attempt to find bit when all bits are set (expected FAILED): FAILED
48 34. Clear all bits in the map.
49
50RFS Bitmap Test : size = 2048 (64)
51  1. Find bit with seed > size: pass (Success)
52  2. Find bit with seed = size: pass (Success)
53  3. Find bit 0 with seed = 0: pass (Success): bit = 0
54  4. Find bit (size - 1) with seed = (size - 1) (2047): pass (Success): bit = 2047
55  5. Test bit 0: pass (Success)
56  6. Test bit (size - 1) (2047): pass (Success)
57  7. Test bit range (1,2046] all clear: pass
58  8. Set all bits: PASS (Success)
59  9. Clear bit 449: PASS (Success)
60 10. Find bit with seed = 0: pass (Success): bit = 449
61 11. Fail to find bit with seed = 0: pass (Success): bit = 0
62 12. Clear bit 0: pass (Success)
63 13. Find bit with seed = (size - 1): pass (Success): bit = 0
64 14. Clear bit (size - 1) (2047): pass (Success)
65 15. Find bit with seed = 0: pass (Success): bit = 2047
66 16. Clear bit 0: pass (Success)
67 17. Find bit with seed = (size / 2) (1024): pass (Success): bit = 0
68 18. Clear bit (size - 1) (2047): pass, (Success)
69 19. Find bit with seed = (size / 2) (1024): pass (Success): bit = 2047
70 20. Clear bit 0: pass (Success)
71 21. Find bit with seed = ((size / 2) - 1) (1023): pass (Success): bit = 0
72 22. Clear bit (size - 1) (2047): pass (Success)
73 23. Find bit with seed = ((size / 2) - 1) (1023): pass (Success): bit = 2047
74 23. Set all bits
75 23. Cleared bits (960, 991] (32)
76 23. Alloc'ed all bits (991, 1022] (32)
77 24. Set all bits
78 24. Cleared bits (166, 222] (57)
79 24. Alloc'ed all bits (222, 278] (57)
80 25. Set all bits: PASS (Success)
81 26. Clear bit (177, 770]: PASS (Success)
82 27. Check free count is 593: 593: pass (Success)
83 28. Create search check free count is 593: 593: pass (Success)
84 29. Map set check with bit (2050) larger than size (2048)
85 30. Map clear check with bit (2050) larger than size (2048)
86 31. Map test check with bit (2050) larger than size (2048)
87 32. Set all bits in the map, then clear bit (1024) and set this bit once again:  PASSED
88 33. Attempt to find bit when all bits are set (expected FAILED): FAILED
89 34. Clear all bits in the map.
90
91RFS Bitmap Test : size = 420 (14)
92  1. Find bit with seed > size: pass (Success)
93  2. Find bit with seed = size: pass (Success)
94  3. Find bit 0 with seed = 0: pass (Success): bit = 0
95  4. Find bit (size - 1) with seed = (size - 1) (419): pass (Success): bit = 419
96  5. Test bit 0: pass (Success)
97  6. Test bit (size - 1) (419): pass (Success)
98  7. Test bit range (1,418] all clear: pass
99  8. Set all bits: PASS (Success)
100  9. Clear bit 215: PASS (Success)
101 10. Find bit with seed = 0: pass (Success): bit = 215
102 11. Fail to find bit with seed = 0: pass (Success): bit = 0
103 12. Clear bit 0: pass (Success)
104 13. Find bit with seed = (size - 1): pass (Success): bit = 0
105 14. Clear bit (size - 1) (419): pass (Success)
106 15. Find bit with seed = 0: pass (Success): bit = 419
107 16. Clear bit 0: pass (Success)
108 17. Find bit with seed = (size / 2) (210): pass (Success): bit = 0
109 18. Clear bit (size - 1) (419): pass, (Success)
110 19. Find bit with seed = (size / 2) (210): pass (Success): bit = 419
111 20. Clear bit 0: pass (Success)
112 21. Find bit with seed = ((size / 2) - 1) (209): pass (Success): bit = 0
113 22. Clear bit (size - 1) (419): pass (Success)
114 23. Find bit with seed = ((size / 2) - 1) (209): pass (Success): bit = 419
115 23. Set all bits
116 23. Cleared bits (127, 158] (32)
117 23. Alloc'ed all bits (158, 189] (32)
118 24. Set all bits
119 24. Cleared bits (83, 139] (57)
120 24. Alloc'ed all bits (139, 195] (57)
121 25. Set all bits: PASS (Success)
122 26. Clear bit (94, 174]: PASS (Success)
123 27. Check free count is 80: 80: pass (Success)
124 28. Create search check free count is 80: 80: pass (Success)
125 29. Map set check with bit (422) larger than size (420)
126 30. Map clear check with bit (422) larger than size (420)
127 31. Map test check with bit (422) larger than size (420)
128 32. Set all bits in the map, then clear bit (210) and set this bit once again:  PASSED
129 33. Attempt to find bit when all bits are set (expected FAILED): FAILED
130 34. Clear all bits in the map.
131
132 Testing bitmap_map functions with zero initialized bitmap control pointer
133
134 Allocate most of memory - attempt to fail while open bitmap - expect ENOMEM
135 Attempt to open bitmap returned: Not enough space
136 Freeing the allocated memory
137
138 END of RFS Bitmap Unit Test
139
140
141Shutting down filesystem MOUNTED RFS
142*** END OF FILE SYSTEM TEST ( MOUNTED RFS ) ***
Note: See TracBrowser for help on using the repository browser.