sequence_test.go 46 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218
  1. package bitmap
  2. import (
  3. "math/rand"
  4. "testing"
  5. "time"
  6. )
  7. func TestSequenceGetAvailableBit(t *testing.T) {
  8. input := []struct {
  9. head *sequence
  10. from uint64
  11. bytePos uint64
  12. bitPos uint64
  13. }{
  14. {&sequence{block: 0x0, count: 0}, 0, invalidPos, invalidPos},
  15. {&sequence{block: 0x0, count: 1}, 0, 0, 0},
  16. {&sequence{block: 0x0, count: 100}, 0, 0, 0},
  17. {&sequence{block: 0x80000000, count: 0}, 0, invalidPos, invalidPos},
  18. {&sequence{block: 0x80000000, count: 1}, 0, 0, 1},
  19. {&sequence{block: 0x80000000, count: 100}, 0, 0, 1},
  20. {&sequence{block: 0xFF000000, count: 0}, 0, invalidPos, invalidPos},
  21. {&sequence{block: 0xFF000000, count: 1}, 0, 1, 0},
  22. {&sequence{block: 0xFF000000, count: 100}, 0, 1, 0},
  23. {&sequence{block: 0xFF800000, count: 0}, 0, invalidPos, invalidPos},
  24. {&sequence{block: 0xFF800000, count: 1}, 0, 1, 1},
  25. {&sequence{block: 0xFF800000, count: 100}, 0, 1, 1},
  26. {&sequence{block: 0xFFC0FF00, count: 0}, 0, invalidPos, invalidPos},
  27. {&sequence{block: 0xFFC0FF00, count: 1}, 0, 1, 2},
  28. {&sequence{block: 0xFFC0FF00, count: 100}, 0, 1, 2},
  29. {&sequence{block: 0xFFE0FF00, count: 0}, 0, invalidPos, invalidPos},
  30. {&sequence{block: 0xFFE0FF00, count: 1}, 0, 1, 3},
  31. {&sequence{block: 0xFFE0FF00, count: 100}, 0, 1, 3},
  32. {&sequence{block: 0xFFFEFF00, count: 0}, 0, invalidPos, invalidPos},
  33. {&sequence{block: 0xFFFEFF00, count: 1}, 0, 1, 7},
  34. {&sequence{block: 0xFFFEFF00, count: 100}, 0, 1, 7},
  35. {&sequence{block: 0xFFFFC0FF, count: 0}, 0, invalidPos, invalidPos},
  36. {&sequence{block: 0xFFFFC0FF, count: 1}, 0, 2, 2},
  37. {&sequence{block: 0xFFFFC0FF, count: 100}, 0, 2, 2},
  38. {&sequence{block: 0xFFFFFF00, count: 0}, 0, invalidPos, invalidPos},
  39. {&sequence{block: 0xFFFFFF00, count: 1}, 0, 3, 0},
  40. {&sequence{block: 0xFFFFFF00, count: 100}, 0, 3, 0},
  41. {&sequence{block: 0xFFFFFFFE, count: 0}, 0, invalidPos, invalidPos},
  42. {&sequence{block: 0xFFFFFFFE, count: 1}, 0, 3, 7},
  43. {&sequence{block: 0xFFFFFFFE, count: 100}, 0, 3, 7},
  44. {&sequence{block: 0xFFFFFFFF, count: 0}, 0, invalidPos, invalidPos},
  45. {&sequence{block: 0xFFFFFFFF, count: 1}, 0, invalidPos, invalidPos},
  46. {&sequence{block: 0xFFFFFFFF, count: 100}, 0, invalidPos, invalidPos},
  47. // now test with offset
  48. {&sequence{block: 0x0, count: 0}, 0, invalidPos, invalidPos},
  49. {&sequence{block: 0x0, count: 0}, 31, invalidPos, invalidPos},
  50. {&sequence{block: 0x0, count: 0}, 32, invalidPos, invalidPos},
  51. {&sequence{block: 0x0, count: 1}, 0, 0, 0},
  52. {&sequence{block: 0x0, count: 1}, 1, 0, 1},
  53. {&sequence{block: 0x0, count: 1}, 31, 3, 7},
  54. {&sequence{block: 0xF0FF0000, count: 1}, 0, 0, 4},
  55. {&sequence{block: 0xF0FF0000, count: 1}, 8, 2, 0},
  56. {&sequence{block: 0xFFFFFFFF, count: 1}, 0, invalidPos, invalidPos},
  57. {&sequence{block: 0xFFFFFFFF, count: 1}, 16, invalidPos, invalidPos},
  58. {&sequence{block: 0xFFFFFFFF, count: 1}, 31, invalidPos, invalidPos},
  59. {&sequence{block: 0xFFFFFFFE, count: 1}, 0, 3, 7},
  60. {&sequence{block: 0xFFFFFFFF, count: 2}, 0, invalidPos, invalidPos},
  61. {&sequence{block: 0xFFFFFFFF, count: 2}, 32, invalidPos, invalidPos},
  62. }
  63. for n, i := range input {
  64. b, bb, err := i.head.getAvailableBit(i.from)
  65. if b != i.bytePos || bb != i.bitPos {
  66. t.Fatalf("Error in sequence.getAvailableBit(%d) (%d).\nExp: (%d, %d)\nGot: (%d, %d), err: %v", i.from, n, i.bytePos, i.bitPos, b, bb, err)
  67. }
  68. }
  69. }
  70. func TestSequenceEqual(t *testing.T) {
  71. input := []struct {
  72. first *sequence
  73. second *sequence
  74. areEqual bool
  75. }{
  76. {&sequence{block: 0x0, count: 8, next: nil}, &sequence{block: 0x0, count: 8}, true},
  77. {&sequence{block: 0x0, count: 0, next: nil}, &sequence{block: 0x0, count: 0}, true},
  78. {&sequence{block: 0x0, count: 2, next: nil}, &sequence{block: 0x0, count: 1, next: &sequence{block: 0x0, count: 1}}, false},
  79. {&sequence{block: 0x0, count: 2, next: &sequence{block: 0x1, count: 1}}, &sequence{block: 0x0, count: 2}, false},
  80. {&sequence{block: 0x12345678, count: 8, next: nil}, &sequence{block: 0x12345678, count: 8}, true},
  81. {&sequence{block: 0x12345678, count: 8, next: nil}, &sequence{block: 0x12345678, count: 9}, false},
  82. {&sequence{block: 0x12345678, count: 1, next: &sequence{block: 0xFFFFFFFF, count: 1}}, &sequence{block: 0x12345678, count: 1}, false},
  83. {&sequence{block: 0x12345678, count: 1}, &sequence{block: 0x12345678, count: 1, next: &sequence{block: 0xFFFFFFFF, count: 1}}, false},
  84. }
  85. for n, i := range input {
  86. if i.areEqual != i.first.equal(i.second) {
  87. t.Fatalf("Error in sequence.equal() (%d).\nExp: %t\nGot: %t,", n, i.areEqual, !i.areEqual)
  88. }
  89. }
  90. }
  91. func TestSequenceCopy(t *testing.T) {
  92. s := getTestSequence()
  93. n := s.getCopy()
  94. if !s.equal(n) {
  95. t.Fatal("copy of s failed")
  96. }
  97. if n == s {
  98. t.Fatal("not true copy of s")
  99. }
  100. }
  101. func TestGetFirstAvailable(t *testing.T) {
  102. input := []struct {
  103. mask *sequence
  104. bytePos uint64
  105. bitPos uint64
  106. start uint64
  107. }{
  108. {&sequence{block: 0xffffffff, count: 2048}, invalidPos, invalidPos, 0},
  109. {&sequence{block: 0x0, count: 8}, 0, 0, 0},
  110. {&sequence{block: 0x80000000, count: 8}, 0, 1, 0},
  111. {&sequence{block: 0xC0000000, count: 8}, 0, 2, 0},
  112. {&sequence{block: 0xE0000000, count: 8}, 0, 3, 0},
  113. {&sequence{block: 0xF0000000, count: 8}, 0, 4, 0},
  114. {&sequence{block: 0xF8000000, count: 8}, 0, 5, 0},
  115. {&sequence{block: 0xFC000000, count: 8}, 0, 6, 0},
  116. {&sequence{block: 0xFE000000, count: 8}, 0, 7, 0},
  117. {&sequence{block: 0xFE000000, count: 8}, 3, 0, 24},
  118. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x00000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 0, 0},
  119. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 1, 0},
  120. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 2, 0},
  121. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xE0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 3, 0},
  122. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xF0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 4, 0},
  123. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xF8000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 5, 0},
  124. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFC000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 6, 0},
  125. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFE000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 7, 0},
  126. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x0E000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 0, 16},
  127. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFF000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 0, 0},
  128. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFF800000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 1, 0},
  129. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFC00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 2, 0},
  130. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFE00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 3, 0},
  131. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFF00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 4, 0},
  132. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFF80000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 5, 0},
  133. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFC0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 6, 0},
  134. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFE0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 7, 0},
  135. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xfffffffe, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 7, 7, 0},
  136. {&sequence{block: 0xffffffff, count: 2, next: &sequence{block: 0x0, count: 6}}, 8, 0, 0},
  137. {&sequence{block: 0xfffcffff, count: 1, next: &sequence{block: 0x0, count: 6}}, 4, 0, 16},
  138. {&sequence{block: 0xfffcffff, count: 1, next: &sequence{block: 0x0, count: 6}}, 1, 7, 15},
  139. {&sequence{block: 0xfffcffff, count: 1, next: &sequence{block: 0x0, count: 6}}, 1, 6, 10},
  140. {&sequence{block: 0xfffcfffe, count: 1, next: &sequence{block: 0x0, count: 6}}, 3, 7, 31},
  141. {&sequence{block: 0xfffcffff, count: 1, next: &sequence{block: 0xffffffff, count: 6}}, invalidPos, invalidPos, 31},
  142. }
  143. for n, i := range input {
  144. bytePos, bitPos, _ := getFirstAvailable(i.mask, i.start)
  145. if bytePos != i.bytePos || bitPos != i.bitPos {
  146. t.Fatalf("Error in (%d) getFirstAvailable(). Expected (%d, %d). Got (%d, %d)", n, i.bytePos, i.bitPos, bytePos, bitPos)
  147. }
  148. }
  149. }
  150. func TestFindSequence(t *testing.T) {
  151. input := []struct {
  152. head *sequence
  153. bytePos uint64
  154. precBlocks uint64
  155. inBlockBytePos uint64
  156. }{
  157. {&sequence{block: 0xffffffff, count: 0}, 0, 0, invalidPos},
  158. {&sequence{block: 0xffffffff, count: 0}, 31, 0, invalidPos},
  159. {&sequence{block: 0xffffffff, count: 0}, 100, 0, invalidPos},
  160. {&sequence{block: 0x0, count: 1}, 0, 0, 0},
  161. {&sequence{block: 0x0, count: 1}, 1, 0, 1},
  162. {&sequence{block: 0x0, count: 1}, 31, 0, invalidPos},
  163. {&sequence{block: 0x0, count: 1}, 60, 0, invalidPos},
  164. {&sequence{block: 0xffffffff, count: 10}, 0, 0, 0},
  165. {&sequence{block: 0xffffffff, count: 10}, 3, 0, 3},
  166. {&sequence{block: 0xffffffff, count: 10}, 4, 1, 0},
  167. {&sequence{block: 0xffffffff, count: 10}, 7, 1, 3},
  168. {&sequence{block: 0xffffffff, count: 10}, 8, 2, 0},
  169. {&sequence{block: 0xffffffff, count: 10}, 39, 9, 3},
  170. {&sequence{block: 0xffffffff, count: 10, next: &sequence{block: 0xcc000000, count: 10}}, 79, 9, 3},
  171. {&sequence{block: 0xffffffff, count: 10, next: &sequence{block: 0xcc000000, count: 10}}, 80, 0, invalidPos},
  172. }
  173. for n, i := range input {
  174. _, _, precBlocks, inBlockBytePos := findSequence(i.head, i.bytePos)
  175. if precBlocks != i.precBlocks || inBlockBytePos != i.inBlockBytePos {
  176. t.Fatalf("Error in (%d) findSequence(). Expected (%d, %d). Got (%d, %d)", n, i.precBlocks, i.inBlockBytePos, precBlocks, inBlockBytePos)
  177. }
  178. }
  179. }
  180. func TestCheckIfAvailable(t *testing.T) {
  181. input := []struct {
  182. head *sequence
  183. ordinal uint64
  184. bytePos uint64
  185. bitPos uint64
  186. }{
  187. {&sequence{block: 0xffffffff, count: 0}, 0, invalidPos, invalidPos},
  188. {&sequence{block: 0xffffffff, count: 0}, 31, invalidPos, invalidPos},
  189. {&sequence{block: 0xffffffff, count: 0}, 100, invalidPos, invalidPos},
  190. {&sequence{block: 0x0, count: 1}, 0, 0, 0},
  191. {&sequence{block: 0x0, count: 1}, 1, 0, 1},
  192. {&sequence{block: 0x0, count: 1}, 31, 3, 7},
  193. {&sequence{block: 0x0, count: 1}, 60, invalidPos, invalidPos},
  194. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x800000ff, count: 1}}, 31, invalidPos, invalidPos},
  195. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x800000ff, count: 1}}, 32, invalidPos, invalidPos},
  196. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x800000ff, count: 1}}, 33, 4, 1},
  197. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1}}, 33, invalidPos, invalidPos},
  198. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1}}, 34, 4, 2},
  199. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1, next: &sequence{block: 0x0, count: 1}}}, 55, 6, 7},
  200. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1, next: &sequence{block: 0x0, count: 1}}}, 56, invalidPos, invalidPos},
  201. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1, next: &sequence{block: 0x0, count: 1}}}, 63, invalidPos, invalidPos},
  202. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1, next: &sequence{block: 0x0, count: 1}}}, 64, 8, 0},
  203. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1, next: &sequence{block: 0x0, count: 1}}}, 95, 11, 7},
  204. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC00000ff, count: 1, next: &sequence{block: 0x0, count: 1}}}, 96, invalidPos, invalidPos},
  205. }
  206. for n, i := range input {
  207. bytePos, bitPos, err := checkIfAvailable(i.head, i.ordinal)
  208. if bytePos != i.bytePos || bitPos != i.bitPos {
  209. t.Fatalf("Error in (%d) checkIfAvailable(ord:%d). Expected (%d, %d). Got (%d, %d). err: %v", n, i.ordinal, i.bytePos, i.bitPos, bytePos, bitPos, err)
  210. }
  211. }
  212. }
  213. func TestMergeSequences(t *testing.T) {
  214. input := []struct {
  215. original *sequence
  216. merged *sequence
  217. }{
  218. {&sequence{block: 0xFE000000, count: 8, next: &sequence{block: 0xFE000000, count: 2}}, &sequence{block: 0xFE000000, count: 10}},
  219. {&sequence{block: 0xFFFFFFFF, count: 8, next: &sequence{block: 0xFFFFFFFF, count: 1}}, &sequence{block: 0xFFFFFFFF, count: 9}},
  220. {&sequence{block: 0xFFFFFFFF, count: 1, next: &sequence{block: 0xFFFFFFFF, count: 8}}, &sequence{block: 0xFFFFFFFF, count: 9}},
  221. {&sequence{block: 0xFFFFFFF0, count: 8, next: &sequence{block: 0xFFFFFFF0, count: 1}}, &sequence{block: 0xFFFFFFF0, count: 9}},
  222. {&sequence{block: 0xFFFFFFF0, count: 1, next: &sequence{block: 0xFFFFFFF0, count: 8}}, &sequence{block: 0xFFFFFFF0, count: 9}},
  223. {&sequence{block: 0xFE, count: 8, next: &sequence{block: 0xFE, count: 1, next: &sequence{block: 0xFE, count: 5}}}, &sequence{block: 0xFE, count: 14}},
  224. {
  225. &sequence{block: 0xFE, count: 8, next: &sequence{block: 0xFE, count: 1, next: &sequence{block: 0xFE, count: 5, next: &sequence{block: 0xFF, count: 1}}}},
  226. &sequence{block: 0xFE, count: 14, next: &sequence{block: 0xFF, count: 1}},
  227. },
  228. // No merge
  229. {
  230. &sequence{block: 0xFE, count: 8, next: &sequence{block: 0xF8, count: 1, next: &sequence{block: 0xFE, count: 5}}},
  231. &sequence{block: 0xFE, count: 8, next: &sequence{block: 0xF8, count: 1, next: &sequence{block: 0xFE, count: 5}}},
  232. },
  233. // No merge from head: // Merge function tries to merge from passed head. If it can't merge with next, it does not reattempt with next as head
  234. {
  235. &sequence{block: 0xFE, count: 8, next: &sequence{block: 0xFF, count: 1, next: &sequence{block: 0xFF, count: 5}}},
  236. &sequence{block: 0xFE, count: 8, next: &sequence{block: 0xFF, count: 6}},
  237. },
  238. }
  239. for n, i := range input {
  240. mergeSequences(i.original)
  241. for !i.merged.equal(i.original) {
  242. t.Fatalf("Error in (%d) mergeSequences().\nExp: %s\nGot: %s,", n, i.merged.toString(), i.original.toString())
  243. }
  244. }
  245. }
  246. func TestPushReservation(t *testing.T) {
  247. input := []struct {
  248. mask *sequence
  249. bytePos uint64
  250. bitPos uint64
  251. newMask *sequence
  252. }{
  253. // Create first sequence and fill in 8 addresses starting from address 0
  254. {&sequence{block: 0x0, count: 8, next: nil}, 0, 0, &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 7, next: nil}}},
  255. {&sequence{block: 0x80000000, count: 8}, 0, 1, &sequence{block: 0xC0000000, count: 1, next: &sequence{block: 0x80000000, count: 7, next: nil}}},
  256. {&sequence{block: 0xC0000000, count: 8}, 0, 2, &sequence{block: 0xE0000000, count: 1, next: &sequence{block: 0xC0000000, count: 7, next: nil}}},
  257. {&sequence{block: 0xE0000000, count: 8}, 0, 3, &sequence{block: 0xF0000000, count: 1, next: &sequence{block: 0xE0000000, count: 7, next: nil}}},
  258. {&sequence{block: 0xF0000000, count: 8}, 0, 4, &sequence{block: 0xF8000000, count: 1, next: &sequence{block: 0xF0000000, count: 7, next: nil}}},
  259. {&sequence{block: 0xF8000000, count: 8}, 0, 5, &sequence{block: 0xFC000000, count: 1, next: &sequence{block: 0xF8000000, count: 7, next: nil}}},
  260. {&sequence{block: 0xFC000000, count: 8}, 0, 6, &sequence{block: 0xFE000000, count: 1, next: &sequence{block: 0xFC000000, count: 7, next: nil}}},
  261. {&sequence{block: 0xFE000000, count: 8}, 0, 7, &sequence{block: 0xFF000000, count: 1, next: &sequence{block: 0xFE000000, count: 7, next: nil}}},
  262. {&sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 7}}, 0, 1, &sequence{block: 0xC0000000, count: 1, next: &sequence{block: 0x0, count: 7, next: nil}}},
  263. // Create second sequence and fill in 8 addresses starting from address 32
  264. {
  265. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x00000000, count: 1, next: &sequence{block: 0xffffffff, count: 6, next: nil}}}, 4, 0,
  266. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  267. },
  268. {
  269. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 1,
  270. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  271. },
  272. {
  273. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xC0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 2,
  274. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xE0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  275. },
  276. {
  277. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xE0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 3,
  278. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xF0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  279. },
  280. {
  281. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xF0000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 4,
  282. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xF8000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  283. },
  284. {
  285. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xF8000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 5,
  286. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFC000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  287. },
  288. {
  289. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFC000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 6,
  290. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFE000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  291. },
  292. {
  293. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFE000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 4, 7,
  294. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFF000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  295. },
  296. // fill in 8 addresses starting from address 40
  297. {
  298. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFF000000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 0,
  299. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFF800000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  300. },
  301. {
  302. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFF800000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 1,
  303. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFC00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  304. },
  305. {
  306. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFC00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 2,
  307. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFE00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  308. },
  309. {
  310. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFE00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 3,
  311. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFF00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  312. },
  313. {
  314. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFF00000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 4,
  315. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFF80000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  316. },
  317. {
  318. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFF80000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 5,
  319. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFC0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  320. },
  321. {
  322. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFC0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 6,
  323. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFE0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  324. },
  325. {
  326. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFE0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}}, 5, 7,
  327. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xFFFF0000, count: 1, next: &sequence{block: 0xffffffff, count: 6}}},
  328. },
  329. // Insert new sequence
  330. {
  331. &sequence{block: 0xffffffff, count: 2, next: &sequence{block: 0x0, count: 6}}, 8, 0,
  332. &sequence{block: 0xffffffff, count: 2, next: &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 5}}},
  333. },
  334. {
  335. &sequence{block: 0xffffffff, count: 2, next: &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 5}}}, 8, 1,
  336. &sequence{block: 0xffffffff, count: 2, next: &sequence{block: 0xC0000000, count: 1, next: &sequence{block: 0x0, count: 5}}},
  337. },
  338. // Merge affected with next
  339. {
  340. &sequence{block: 0xffffffff, count: 7, next: &sequence{block: 0xfffffffe, count: 2, next: &sequence{block: 0xffffffff, count: 1}}}, 31, 7,
  341. &sequence{block: 0xffffffff, count: 8, next: &sequence{block: 0xfffffffe, count: 1, next: &sequence{block: 0xffffffff, count: 1}}},
  342. },
  343. {
  344. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xfffffffc, count: 1, next: &sequence{block: 0xfffffffe, count: 6}}}, 7, 6,
  345. &sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xfffffffe, count: 7}},
  346. },
  347. // Merge affected with next and next.next
  348. {
  349. &sequence{block: 0xffffffff, count: 7, next: &sequence{block: 0xfffffffe, count: 1, next: &sequence{block: 0xffffffff, count: 1}}}, 31, 7,
  350. &sequence{block: 0xffffffff, count: 9},
  351. },
  352. {
  353. &sequence{block: 0xffffffff, count: 7, next: &sequence{block: 0xfffffffe, count: 1}}, 31, 7,
  354. &sequence{block: 0xffffffff, count: 8},
  355. },
  356. // Merge affected with previous and next
  357. {
  358. &sequence{block: 0xffffffff, count: 7, next: &sequence{block: 0xfffffffe, count: 1, next: &sequence{block: 0xffffffff, count: 1}}}, 31, 7,
  359. &sequence{block: 0xffffffff, count: 9},
  360. },
  361. // Redundant push: No change
  362. {&sequence{block: 0xffff0000, count: 1}, 0, 0, &sequence{block: 0xffff0000, count: 1}},
  363. {&sequence{block: 0xffff0000, count: 7}, 25, 7, &sequence{block: 0xffff0000, count: 7}},
  364. {
  365. &sequence{block: 0xffffffff, count: 7, next: &sequence{block: 0xfffffffe, count: 1, next: &sequence{block: 0xffffffff, count: 1}}}, 7, 7,
  366. &sequence{block: 0xffffffff, count: 7, next: &sequence{block: 0xfffffffe, count: 1, next: &sequence{block: 0xffffffff, count: 1}}},
  367. },
  368. // Set last bit
  369. {&sequence{block: 0x0, count: 8}, 31, 7, &sequence{block: 0x0, count: 7, next: &sequence{block: 0x1, count: 1}}},
  370. // Set bit in a middle sequence in the first block, first bit
  371. {
  372. &sequence{block: 0x40000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 4, 0,
  373. &sequence{block: 0x40000000, count: 1, next: &sequence{block: 0x80000000, count: 1, next: &sequence{
  374. block: 0x0, count: 5,
  375. next: &sequence{block: 0x1, count: 1},
  376. }}},
  377. },
  378. // Set bit in a middle sequence in the first block, first bit (merge involved)
  379. {
  380. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 4, 0,
  381. &sequence{block: 0x80000000, count: 2, next: &sequence{block: 0x0, count: 5, next: &sequence{block: 0x1, count: 1}}},
  382. },
  383. // Set bit in a middle sequence in the first block, last bit
  384. {
  385. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 4, 31,
  386. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x1, count: 1, next: &sequence{
  387. block: 0x0, count: 5,
  388. next: &sequence{block: 0x1, count: 1},
  389. }}},
  390. },
  391. // Set bit in a middle sequence in the first block, middle bit
  392. {
  393. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 4, 16,
  394. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x8000, count: 1, next: &sequence{
  395. block: 0x0, count: 5,
  396. next: &sequence{block: 0x1, count: 1},
  397. }}},
  398. },
  399. // Set bit in a middle sequence in a middle block, first bit
  400. {
  401. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 16, 0,
  402. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 3, next: &sequence{
  403. block: 0x80000000, count: 1,
  404. next: &sequence{block: 0x0, count: 2, next: &sequence{block: 0x1, count: 1}},
  405. }}},
  406. },
  407. // Set bit in a middle sequence in a middle block, last bit
  408. {
  409. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 16, 31,
  410. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 3, next: &sequence{
  411. block: 0x1, count: 1,
  412. next: &sequence{block: 0x0, count: 2, next: &sequence{block: 0x1, count: 1}},
  413. }}},
  414. },
  415. // Set bit in a middle sequence in a middle block, middle bit
  416. {
  417. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 16, 15,
  418. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 3, next: &sequence{
  419. block: 0x10000, count: 1,
  420. next: &sequence{block: 0x0, count: 2, next: &sequence{block: 0x1, count: 1}},
  421. }}},
  422. },
  423. // Set bit in a middle sequence in the last block, first bit
  424. {
  425. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 24, 0,
  426. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 5, next: &sequence{
  427. block: 0x80000000, count: 1,
  428. next: &sequence{block: 0x1, count: 1},
  429. }}},
  430. },
  431. // Set bit in a middle sequence in the last block, last bit
  432. {
  433. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x4, count: 1}}}, 24, 31,
  434. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 5, next: &sequence{
  435. block: 0x1, count: 1,
  436. next: &sequence{block: 0x4, count: 1},
  437. }}},
  438. },
  439. // Set bit in a middle sequence in the last block, last bit (merge involved)
  440. {
  441. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 24, 31,
  442. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 5, next: &sequence{block: 0x1, count: 2}}},
  443. },
  444. // Set bit in a middle sequence in the last block, middle bit
  445. {
  446. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 6, next: &sequence{block: 0x1, count: 1}}}, 24, 16,
  447. &sequence{block: 0x80000000, count: 1, next: &sequence{block: 0x0, count: 5, next: &sequence{
  448. block: 0x8000, count: 1,
  449. next: &sequence{block: 0x1, count: 1},
  450. }}},
  451. },
  452. }
  453. for n, i := range input {
  454. mask := pushReservation(i.bytePos, i.bitPos, i.mask, false)
  455. if !mask.equal(i.newMask) {
  456. t.Fatalf("Error in (%d) pushReservation():\n%s + (%d,%d):\nExp: %s\nGot: %s,",
  457. n, i.mask.toString(), i.bytePos, i.bitPos, i.newMask.toString(), mask.toString())
  458. }
  459. }
  460. }
  461. func TestSerializeDeserialize(t *testing.T) {
  462. s := getTestSequence()
  463. data, err := s.toByteArray()
  464. if err != nil {
  465. t.Fatal(err)
  466. }
  467. r := &sequence{}
  468. err = r.fromByteArray(data)
  469. if err != nil {
  470. t.Fatal(err)
  471. }
  472. if !s.equal(r) {
  473. t.Fatalf("Sequences are different: \n%v\n%v", s, r)
  474. }
  475. }
  476. func getTestSequence() *sequence {
  477. // Returns a custom sequence of 1024 * 32 bits
  478. return &sequence{
  479. block: 0xFFFFFFFF,
  480. count: 100,
  481. next: &sequence{
  482. block: 0xFFFFFFFE,
  483. count: 1,
  484. next: &sequence{
  485. block: 0xFF000000,
  486. count: 10,
  487. next: &sequence{
  488. block: 0xFFFFFFFF,
  489. count: 50,
  490. next: &sequence{
  491. block: 0xFFFFFFFC,
  492. count: 1,
  493. next: &sequence{
  494. block: 0xFF800000,
  495. count: 1,
  496. next: &sequence{
  497. block: 0xFFFFFFFF,
  498. count: 87,
  499. next: &sequence{
  500. block: 0x0,
  501. count: 150,
  502. next: &sequence{
  503. block: 0xFFFFFFFF,
  504. count: 200,
  505. next: &sequence{
  506. block: 0x0000FFFF,
  507. count: 1,
  508. next: &sequence{
  509. block: 0x0,
  510. count: 399,
  511. next: &sequence{
  512. block: 0xFFFFFFFF,
  513. count: 23,
  514. next: &sequence{
  515. block: 0x1,
  516. count: 1,
  517. },
  518. },
  519. },
  520. },
  521. },
  522. },
  523. },
  524. },
  525. },
  526. },
  527. },
  528. },
  529. }
  530. }
  531. func TestSet(t *testing.T) {
  532. hnd := New(1024 * 32)
  533. hnd.head = getTestSequence()
  534. firstAv := uint64(32*100 + 31)
  535. last := uint64(1024*32 - 1)
  536. if hnd.IsSet(100000) {
  537. t.Fatal("IsSet() returned wrong result")
  538. }
  539. if !hnd.IsSet(0) {
  540. t.Fatal("IsSet() returned wrong result")
  541. }
  542. if hnd.IsSet(firstAv) {
  543. t.Fatal("IsSet() returned wrong result")
  544. }
  545. if !hnd.IsSet(last) {
  546. t.Fatal("IsSet() returned wrong result")
  547. }
  548. if err := hnd.Set(0); err == nil {
  549. t.Fatal("Expected failure, but succeeded")
  550. }
  551. os, err := hnd.SetAny(false)
  552. if err != nil {
  553. t.Fatalf("Unexpected failure: %v", err)
  554. }
  555. if os != firstAv {
  556. t.Fatalf("SetAny returned unexpected ordinal. Expected %d. Got %d.", firstAv, os)
  557. }
  558. if !hnd.IsSet(firstAv) {
  559. t.Fatal("IsSet() returned wrong result")
  560. }
  561. if err := hnd.Unset(firstAv); err != nil {
  562. t.Fatalf("Unexpected failure: %v", err)
  563. }
  564. if hnd.IsSet(firstAv) {
  565. t.Fatal("IsSet() returned wrong result")
  566. }
  567. if err := hnd.Set(firstAv); err != nil {
  568. t.Fatalf("Unexpected failure: %v", err)
  569. }
  570. if err := hnd.Set(last); err == nil {
  571. t.Fatal("Expected failure, but succeeded")
  572. }
  573. }
  574. func TestSetUnset(t *testing.T) {
  575. numBits := uint64(32 * blockLen)
  576. hnd := New(numBits)
  577. if err := hnd.Set(uint64(32 * blockLen)); err == nil {
  578. t.Fatal("Expected failure, but succeeded")
  579. }
  580. if err := hnd.Unset(uint64(32 * blockLen)); err == nil {
  581. t.Fatal("Expected failure, but succeeded")
  582. }
  583. // set and unset all one by one
  584. for hnd.Unselected() > 0 {
  585. if _, err := hnd.SetAny(false); err != nil {
  586. t.Fatal(err)
  587. }
  588. }
  589. if _, err := hnd.SetAny(false); err != ErrNoBitAvailable {
  590. t.Fatal("Expected error. Got success")
  591. }
  592. if _, err := hnd.SetAnyInRange(10, 20, false); err != ErrNoBitAvailable {
  593. t.Fatal("Expected error. Got success")
  594. }
  595. if err := hnd.Set(50); err != ErrBitAllocated {
  596. t.Fatalf("Expected error. Got %v: %s", err, hnd)
  597. }
  598. i := uint64(0)
  599. for hnd.Unselected() < numBits {
  600. if err := hnd.Unset(i); err != nil {
  601. t.Fatal(err)
  602. }
  603. i++
  604. }
  605. }
  606. func TestOffsetSetUnset(t *testing.T) {
  607. numBits := uint64(32 * blockLen)
  608. hnd := New(numBits)
  609. // set and unset all one by one
  610. for hnd.Unselected() > 0 {
  611. if _, err := hnd.SetAny(false); err != nil {
  612. t.Fatal(err)
  613. }
  614. }
  615. if _, err := hnd.SetAny(false); err != ErrNoBitAvailable {
  616. t.Fatal("Expected error. Got success")
  617. }
  618. if _, err := hnd.SetAnyInRange(10, 20, false); err != ErrNoBitAvailable {
  619. t.Fatal("Expected error. Got success")
  620. }
  621. if err := hnd.Unset(288); err != nil {
  622. t.Fatal(err)
  623. }
  624. // At this point sequence is (0xffffffff, 9)->(0x7fffffff, 1)->(0xffffffff, 22)->end
  625. o, err := hnd.SetAnyInRange(32, 500, false)
  626. if err != nil {
  627. t.Fatal(err)
  628. }
  629. if o != 288 {
  630. t.Fatalf("Expected ordinal not received, Received:%d", o)
  631. }
  632. }
  633. func TestSetInRange(t *testing.T) {
  634. numBits := uint64(1024 * blockLen)
  635. hnd := New(numBits)
  636. hnd.head = getTestSequence()
  637. firstAv := uint64(100*blockLen + blockLen - 1)
  638. if o, err := hnd.SetAnyInRange(4, 3, false); err == nil {
  639. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  640. }
  641. if o, err := hnd.SetAnyInRange(0, numBits, false); err == nil {
  642. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  643. }
  644. o, err := hnd.SetAnyInRange(100*uint64(blockLen), 101*uint64(blockLen), false)
  645. if err != nil {
  646. t.Fatalf("Unexpected failure: (%d, %v)", o, err)
  647. }
  648. if o != firstAv {
  649. t.Fatalf("Unexpected ordinal: %d", o)
  650. }
  651. if o, err := hnd.SetAnyInRange(0, uint64(blockLen), false); err == nil {
  652. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  653. }
  654. if o, err := hnd.SetAnyInRange(0, firstAv-1, false); err == nil {
  655. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  656. }
  657. if o, err := hnd.SetAnyInRange(111*uint64(blockLen), 161*uint64(blockLen), false); err == nil {
  658. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  659. }
  660. o, err = hnd.SetAnyInRange(161*uint64(blockLen), 162*uint64(blockLen), false)
  661. if err != nil {
  662. t.Fatal(err)
  663. }
  664. if o != 161*uint64(blockLen)+30 {
  665. t.Fatalf("Unexpected ordinal: %d", o)
  666. }
  667. o, err = hnd.SetAnyInRange(161*uint64(blockLen), 162*uint64(blockLen), false)
  668. if err != nil {
  669. t.Fatal(err)
  670. }
  671. if o != 161*uint64(blockLen)+31 {
  672. t.Fatalf("Unexpected ordinal: %d", o)
  673. }
  674. o, err = hnd.SetAnyInRange(161*uint64(blockLen), 162*uint64(blockLen), false)
  675. if err == nil {
  676. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  677. }
  678. if _, err := hnd.SetAnyInRange(0, numBits-1, false); err != nil {
  679. t.Fatalf("Unexpected failure: %v", err)
  680. }
  681. // set one bit using the set range with 1 bit size range
  682. if _, err := hnd.SetAnyInRange(uint64(163*blockLen-1), uint64(163*blockLen-1), false); err != nil {
  683. t.Fatal(err)
  684. }
  685. // create a non multiple of 32 mask
  686. hnd = New(30)
  687. // set all bit in the first range
  688. for hnd.Unselected() > 22 {
  689. if o, err := hnd.SetAnyInRange(0, 7, false); err != nil {
  690. t.Fatalf("Unexpected failure: (%d, %v)", o, err)
  691. }
  692. }
  693. // try one more set, which should fail
  694. o, err = hnd.SetAnyInRange(0, 7, false)
  695. if err == nil {
  696. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  697. }
  698. if err != ErrNoBitAvailable {
  699. t.Fatalf("Unexpected error: %v", err)
  700. }
  701. // set all bit in a second range
  702. for hnd.Unselected() > 14 {
  703. if o, err := hnd.SetAnyInRange(8, 15, false); err != nil {
  704. t.Fatalf("Unexpected failure: (%d, %v)", o, err)
  705. }
  706. }
  707. // try one more set, which should fail
  708. o, err = hnd.SetAnyInRange(0, 15, false)
  709. if err == nil {
  710. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  711. }
  712. if err != ErrNoBitAvailable {
  713. t.Fatalf("Unexpected error: %v", err)
  714. }
  715. // set all bit in a range which includes the last bit
  716. for hnd.Unselected() > 12 {
  717. if o, err := hnd.SetAnyInRange(28, 29, false); err != nil {
  718. t.Fatalf("Unexpected failure: (%d, %v)", o, err)
  719. }
  720. }
  721. o, err = hnd.SetAnyInRange(28, 29, false)
  722. if err == nil {
  723. t.Fatalf("Expected failure. Got success with ordinal:%d", o)
  724. }
  725. if err != ErrNoBitAvailable {
  726. t.Fatalf("Unexpected error: %v", err)
  727. }
  728. }
  729. // This one tests an allocation pattern which unveiled an issue in pushReservation
  730. // Specifically a failure in detecting when we are in the (B) case (the bit to set
  731. // belongs to the last block of the current sequence). Because of a bug, code
  732. // was assuming the bit belonged to a block in the middle of the current sequence.
  733. // Which in turn caused an incorrect allocation when requesting a bit which is not
  734. // in the first or last sequence block.
  735. func TestSetAnyInRange(t *testing.T) {
  736. numBits := uint64(8 * blockLen)
  737. hnd := New(numBits)
  738. if err := hnd.Set(0); err != nil {
  739. t.Fatal(err)
  740. }
  741. if err := hnd.Set(255); err != nil {
  742. t.Fatal(err)
  743. }
  744. o, err := hnd.SetAnyInRange(128, 255, false)
  745. if err != nil {
  746. t.Fatal(err)
  747. }
  748. if o != 128 {
  749. t.Fatalf("Unexpected ordinal: %d", o)
  750. }
  751. o, err = hnd.SetAnyInRange(128, 255, false)
  752. if err != nil {
  753. t.Fatal(err)
  754. }
  755. if o != 129 {
  756. t.Fatalf("Unexpected ordinal: %d", o)
  757. }
  758. o, err = hnd.SetAnyInRange(246, 255, false)
  759. if err != nil {
  760. t.Fatal(err)
  761. }
  762. if o != 246 {
  763. t.Fatalf("Unexpected ordinal: %d", o)
  764. }
  765. o, err = hnd.SetAnyInRange(246, 255, false)
  766. if err != nil {
  767. t.Fatal(err)
  768. }
  769. if o != 247 {
  770. t.Fatalf("Unexpected ordinal: %d", o)
  771. }
  772. }
  773. func TestMethods(t *testing.T) {
  774. numBits := uint64(256 * blockLen)
  775. hnd := New(numBits)
  776. if hnd.Bits() != numBits {
  777. t.Fatalf("Unexpected bit number: %d", hnd.Bits())
  778. }
  779. if hnd.Unselected() != numBits {
  780. t.Fatalf("Unexpected bit number: %d", hnd.Unselected())
  781. }
  782. exp := "(0x0, 256)->end"
  783. if hnd.head.toString() != exp {
  784. t.Fatalf("Unexpected sequence string: %s", hnd.head.toString())
  785. }
  786. for i := 0; i < 192; i++ {
  787. _, err := hnd.SetAny(false)
  788. if err != nil {
  789. t.Fatal(err)
  790. }
  791. }
  792. exp = "(0xffffffff, 6)->(0x0, 250)->end"
  793. if hnd.head.toString() != exp {
  794. t.Fatalf("Unexpected sequence string: %s", hnd.head.toString())
  795. }
  796. }
  797. func TestRandomAllocateDeallocate(t *testing.T) {
  798. numBits := int(16 * blockLen)
  799. hnd := New(uint64(numBits))
  800. seed := time.Now().Unix()
  801. rng := rand.New(rand.NewSource(seed))
  802. // Allocate all bits using a random pattern
  803. pattern := rng.Perm(numBits)
  804. for _, bit := range pattern {
  805. err := hnd.Set(uint64(bit))
  806. if err != nil {
  807. t.Fatalf("Unexpected failure on allocation of %d: %v.\nSeed: %d.\n%s", bit, err, seed, hnd)
  808. }
  809. }
  810. if hnd.Unselected() != 0 {
  811. t.Fatalf("Expected full sequence. Instead found %d free bits. Seed: %d.\n%s", hnd.unselected, seed, hnd)
  812. }
  813. if hnd.head.toString() != "(0xffffffff, 16)->end" {
  814. t.Fatalf("Unexpected db: %s", hnd.head.toString())
  815. }
  816. // Deallocate all bits using a random pattern
  817. pattern = rng.Perm(numBits)
  818. for _, bit := range pattern {
  819. err := hnd.Unset(uint64(bit))
  820. if err != nil {
  821. t.Fatalf("Unexpected failure on deallocation of %d: %v.\nSeed: %d.\n%s", bit, err, seed, hnd)
  822. }
  823. }
  824. if hnd.Unselected() != uint64(numBits) {
  825. t.Fatalf("Expected full sequence. Instead found %d free bits. Seed: %d.\n%s", hnd.unselected, seed, hnd)
  826. }
  827. if hnd.head.toString() != "(0x0, 16)->end" {
  828. t.Fatalf("Unexpected db: %s", hnd.head.toString())
  829. }
  830. }
  831. func TestAllocateRandomDeallocate(t *testing.T) {
  832. numBlocks := uint32(8)
  833. numBits := int(numBlocks * blockLen)
  834. hnd := New(uint64(numBits))
  835. expected := &sequence{block: 0xffffffff, count: uint64(numBlocks / 2), next: &sequence{block: 0x0, count: uint64(numBlocks / 2)}}
  836. // Allocate first half of the bits
  837. for i := 0; i < numBits/2; i++ {
  838. _, err := hnd.SetAny(false)
  839. if err != nil {
  840. t.Fatalf("Unexpected failure on allocation %d: %v\n%s", i, err, hnd)
  841. }
  842. }
  843. if hnd.Unselected() != uint64(numBits/2) {
  844. t.Fatalf("Expected full sequence. Instead found %d free bits. %s", hnd.unselected, hnd)
  845. }
  846. if !hnd.head.equal(expected) {
  847. t.Fatalf("Unexpected sequence. Got:\n%s", hnd)
  848. }
  849. seed := time.Now().Unix()
  850. rng := rand.New(rand.NewSource(seed))
  851. // Deallocate half of the allocated bits following a random pattern
  852. pattern := rng.Perm(numBits / 2)
  853. for i := 0; i < numBits/4; i++ {
  854. bit := pattern[i]
  855. err := hnd.Unset(uint64(bit))
  856. if err != nil {
  857. t.Fatalf("Unexpected failure on deallocation of %d: %v.\nSeed: %d.\n%s", bit, err, seed, hnd)
  858. }
  859. }
  860. if hnd.Unselected() != uint64(3*numBits/4) {
  861. t.Fatalf("Expected full sequence. Instead found %d free bits.\nSeed: %d.\n%s", hnd.unselected, seed, hnd)
  862. }
  863. // Request a quarter of bits
  864. for i := 0; i < numBits/4; i++ {
  865. _, err := hnd.SetAny(false)
  866. if err != nil {
  867. t.Fatalf("Unexpected failure on allocation %d: %v\nSeed: %d\n%s", i, err, seed, hnd)
  868. }
  869. }
  870. if hnd.Unselected() != uint64(numBits/2) {
  871. t.Fatalf("Expected half sequence. Instead found %d free bits.\nSeed: %d\n%s", hnd.unselected, seed, hnd)
  872. }
  873. if !hnd.head.equal(expected) {
  874. t.Fatalf("Unexpected sequence. Got:\n%s", hnd)
  875. }
  876. }
  877. func TestAllocateRandomDeallocateSerialize(t *testing.T) {
  878. numBlocks := uint32(8)
  879. numBits := int(numBlocks * blockLen)
  880. hnd := New(uint64(numBits))
  881. expected := &sequence{block: 0xffffffff, count: uint64(numBlocks / 2), next: &sequence{block: 0x0, count: uint64(numBlocks / 2)}}
  882. // Allocate first half of the bits
  883. for i := 0; i < numBits/2; i++ {
  884. _, err := hnd.SetAny(true)
  885. if err != nil {
  886. t.Fatalf("Unexpected failure on allocation %d: %v\n%s", i, err, hnd)
  887. }
  888. }
  889. if hnd.Unselected() != uint64(numBits/2) {
  890. t.Fatalf("Expected full sequence. Instead found %d free bits. %s", hnd.unselected, hnd)
  891. }
  892. if !hnd.head.equal(expected) {
  893. t.Fatalf("Unexpected sequence. Got:\n%s", hnd)
  894. }
  895. seed := time.Now().Unix()
  896. rng := rand.New(rand.NewSource(seed))
  897. // Deallocate half of the allocated bits following a random pattern
  898. pattern := rng.Perm(numBits / 2)
  899. for i := 0; i < numBits/4; i++ {
  900. bit := pattern[i]
  901. err := hnd.Unset(uint64(bit))
  902. if err != nil {
  903. t.Fatalf("Unexpected failure on deallocation of %d: %v.\nSeed: %d.\n%s", bit, err, seed, hnd)
  904. }
  905. }
  906. if hnd.Unselected() != uint64(3*numBits/4) {
  907. t.Fatalf("Expected full sequence. Instead found %d free bits.\nSeed: %d.\n%s", hnd.unselected, seed, hnd)
  908. }
  909. // Request a quarter of bits
  910. for i := 0; i < numBits/4; i++ {
  911. _, err := hnd.SetAny(true)
  912. if err != nil {
  913. t.Fatalf("Unexpected failure on allocation %d: %v\nSeed: %d\n%s", i, err, seed, hnd)
  914. }
  915. }
  916. if hnd.Unselected() != uint64(numBits/2) {
  917. t.Fatalf("Expected half sequence. Instead found %d free bits.\nSeed: %d\n%s", hnd.unselected, seed, hnd)
  918. }
  919. }
  920. func testSetRollover(t *testing.T, serial bool) {
  921. numBlocks := uint32(8)
  922. numBits := int(numBlocks * blockLen)
  923. hnd := New(uint64(numBits))
  924. // Allocate first half of the bits
  925. for i := 0; i < numBits/2; i++ {
  926. _, err := hnd.SetAny(serial)
  927. if err != nil {
  928. t.Fatalf("Unexpected failure on allocation %d: %v\n%s", i, err, hnd)
  929. }
  930. }
  931. if hnd.Unselected() != uint64(numBits/2) {
  932. t.Fatalf("Expected full sequence. Instead found %d free bits. %s", hnd.unselected, hnd)
  933. }
  934. seed := time.Now().Unix()
  935. rng := rand.New(rand.NewSource(seed))
  936. // Deallocate half of the allocated bits following a random pattern
  937. pattern := rng.Perm(numBits / 2)
  938. for i := 0; i < numBits/4; i++ {
  939. bit := pattern[i]
  940. err := hnd.Unset(uint64(bit))
  941. if err != nil {
  942. t.Fatalf("Unexpected failure on deallocation of %d: %v.\nSeed: %d.\n%s", bit, err, seed, hnd)
  943. }
  944. }
  945. if hnd.Unselected() != uint64(3*numBits/4) {
  946. t.Fatalf("Unexpected free bits: found %d free bits.\nSeed: %d.\n%s", hnd.unselected, seed, hnd)
  947. }
  948. // request to allocate for remaining half of the bits
  949. for i := 0; i < numBits/2; i++ {
  950. _, err := hnd.SetAny(serial)
  951. if err != nil {
  952. t.Fatalf("Unexpected failure on allocation %d: %v\nSeed: %d\n%s", i, err, seed, hnd)
  953. }
  954. }
  955. // At this point all the bits must be allocated except the randomly unallocated bits
  956. // which were unallocated in the first half of the bit sequence
  957. if hnd.Unselected() != uint64(numBits/4) {
  958. t.Fatalf("Unexpected number of unselected bits %d, Expected %d", hnd.Unselected(), numBits/4)
  959. }
  960. for i := 0; i < numBits/4; i++ {
  961. _, err := hnd.SetAny(serial)
  962. if err != nil {
  963. t.Fatalf("Unexpected failure on allocation %d: %v\nSeed: %d\n%s", i, err, seed, hnd)
  964. }
  965. }
  966. // Now requesting to allocate the unallocated random bits (qurter of the number of bits) should
  967. // leave no more bits that can be allocated.
  968. if hnd.Unselected() != 0 {
  969. t.Fatalf("Unexpected number of unselected bits %d, Expected %d", hnd.Unselected(), 0)
  970. }
  971. }
  972. func TestSetRollover(t *testing.T) {
  973. testSetRollover(t, false)
  974. }
  975. func TestSetRolloverSerial(t *testing.T) {
  976. testSetRollover(t, true)
  977. }
  978. func TestGetFirstAvailableFromCurrent(t *testing.T) {
  979. input := []struct {
  980. mask *sequence
  981. bytePos uint64
  982. bitPos uint64
  983. start uint64
  984. curr uint64
  985. end uint64
  986. }{
  987. {&sequence{block: 0xffffffff, count: 2048}, invalidPos, invalidPos, 0, 0, 65536},
  988. {&sequence{block: 0x0, count: 8}, 0, 0, 0, 0, 256},
  989. {&sequence{block: 0x80000000, count: 8}, 1, 0, 0, 8, 256},
  990. {&sequence{block: 0xC0000000, count: 8}, 0, 2, 0, 2, 256},
  991. {&sequence{block: 0xE0000000, count: 8}, 0, 3, 0, 0, 256},
  992. {&sequence{block: 0xFFFB1FFF, count: 8}, 2, 0, 14, 0, 256},
  993. {&sequence{block: 0xFFFFFFFE, count: 8}, 3, 7, 0, 0, 256},
  994. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0x00000000, count: 1, next: &sequence{block: 0xffffffff, count: 14}}}, 4, 0, 0, 32, 512},
  995. {&sequence{block: 0xfffeffff, count: 1, next: &sequence{block: 0xffffffff, count: 15}}, 1, 7, 0, 16, 512},
  996. {&sequence{block: 0xfffeffff, count: 15, next: &sequence{block: 0xffffffff, count: 1}}, 5, 7, 0, 16, 512},
  997. {&sequence{block: 0xfffeffff, count: 15, next: &sequence{block: 0xffffffff, count: 1}}, 9, 7, 0, 48, 512},
  998. {&sequence{block: 0xffffffff, count: 2, next: &sequence{block: 0xffffffef, count: 14}}, 19, 3, 0, 124, 512},
  999. {&sequence{block: 0xfffeffff, count: 15, next: &sequence{block: 0x0fffffff, count: 1}}, 60, 0, 0, 480, 512},
  1000. {&sequence{block: 0xffffffff, count: 1, next: &sequence{block: 0xfffeffff, count: 14, next: &sequence{block: 0xffffffff, count: 1}}}, 17, 7, 0, 124, 512},
  1001. {&sequence{block: 0xfffffffb, count: 1, next: &sequence{block: 0xffffffff, count: 14, next: &sequence{block: 0xffffffff, count: 1}}}, 3, 5, 0, 124, 512},
  1002. {&sequence{block: 0xfffffffb, count: 1, next: &sequence{block: 0xfffeffff, count: 14, next: &sequence{block: 0xffffffff, count: 1}}}, 13, 7, 0, 80, 512},
  1003. }
  1004. for n, i := range input {
  1005. bytePos, bitPos, _ := getAvailableFromCurrent(i.mask, i.start, i.curr, i.end)
  1006. if bytePos != i.bytePos || bitPos != i.bitPos {
  1007. t.Fatalf("Error in (%d) getFirstAvailable(). Expected (%d, %d). Got (%d, %d)", n, i.bytePos, i.bitPos, bytePos, bitPos)
  1008. }
  1009. }
  1010. }
  1011. func TestMarshalJSON(t *testing.T) {
  1012. expected := []byte("hello libnetwork")
  1013. hnd := New(uint64(len(expected) * 8))
  1014. for i, c := range expected {
  1015. for j := 0; j < 8; j++ {
  1016. if c&(1<<j) == 0 {
  1017. continue
  1018. }
  1019. if err := hnd.Set(uint64(i*8 + j)); err != nil {
  1020. t.Fatal(err)
  1021. }
  1022. }
  1023. }
  1024. hstr := hnd.String()
  1025. t.Log(hstr)
  1026. marshaled, err := hnd.MarshalJSON()
  1027. if err != nil {
  1028. t.Fatalf("MarshalJSON() err = %v", err)
  1029. }
  1030. t.Logf("%s", marshaled)
  1031. // Serializations of hnd as would be marshaled by versions of the code
  1032. // found in the wild. We need to support unmarshaling old versions to
  1033. // maintain backwards compatibility with sequences persisted on disk.
  1034. const (
  1035. goldenV0 = `"AAAAAAAAAIAAAAAAAAAAPRamNjYAAAAAAAAAAfYENpYAAAAAAAAAAUZ2pi4AAAAAAAAAAe72TtYAAAAAAAAAAQ=="`
  1036. )
  1037. if string(marshaled) != goldenV0 {
  1038. t.Errorf("MarshalJSON() output differs from golden. Please add a new golden case to this test.")
  1039. }
  1040. for _, tt := range []struct {
  1041. name string
  1042. data []byte
  1043. }{
  1044. {name: "Live", data: marshaled},
  1045. {name: "Golden-v0", data: []byte(goldenV0)},
  1046. } {
  1047. tt := tt
  1048. t.Run("UnmarshalJSON="+tt.name, func(t *testing.T) {
  1049. hnd2 := New(0)
  1050. if err := hnd2.UnmarshalJSON(tt.data); err != nil {
  1051. t.Errorf("UnmarshalJSON() err = %v", err)
  1052. }
  1053. h2str := hnd2.String()
  1054. t.Log(h2str)
  1055. if hstr != h2str {
  1056. t.Errorf("Unmarshaled a different bitmap: want %q, got %q", hstr, h2str)
  1057. }
  1058. })
  1059. }
  1060. }