sequence_test.go 42 KB

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