You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

450 lines
14 KiB

7 years ago
7 years ago
6 years ago
7 years ago
6 years ago
6 years ago
6 years ago
6 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
6 years ago
7 years ago
7 years ago
7 years ago
7 years ago
6 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
7 years ago
5 years ago
7 years ago
7 years ago
7 years ago
5 years ago
5 years ago
5 years ago
6 years ago
6 years ago
  1. package filer2
  2. import (
  3. "log"
  4. "math"
  5. "testing"
  6. "fmt"
  7. "github.com/stretchr/testify/assert"
  8. "github.com/chrislusf/seaweedfs/weed/pb/filer_pb"
  9. )
  10. func TestCompactFileChunks(t *testing.T) {
  11. chunks := []*filer_pb.FileChunk{
  12. {Offset: 10, Size: 100, FileId: "abc", Mtime: 50},
  13. {Offset: 100, Size: 100, FileId: "def", Mtime: 100},
  14. {Offset: 200, Size: 100, FileId: "ghi", Mtime: 200},
  15. {Offset: 110, Size: 200, FileId: "jkl", Mtime: 300},
  16. }
  17. compacted, garbage := CompactFileChunks(nil, chunks)
  18. if len(compacted) != 3 {
  19. t.Fatalf("unexpected compacted: %d", len(compacted))
  20. }
  21. if len(garbage) != 1 {
  22. t.Fatalf("unexpected garbage: %d", len(garbage))
  23. }
  24. }
  25. func TestCompactFileChunks2(t *testing.T) {
  26. chunks := []*filer_pb.FileChunk{
  27. {Offset: 0, Size: 100, FileId: "abc", Mtime: 50},
  28. {Offset: 100, Size: 100, FileId: "def", Mtime: 100},
  29. {Offset: 200, Size: 100, FileId: "ghi", Mtime: 200},
  30. {Offset: 0, Size: 100, FileId: "abcf", Mtime: 300},
  31. {Offset: 50, Size: 100, FileId: "fhfh", Mtime: 400},
  32. {Offset: 100, Size: 100, FileId: "yuyu", Mtime: 500},
  33. }
  34. k := 3
  35. for n := 0; n < k; n++ {
  36. chunks = append(chunks, &filer_pb.FileChunk{
  37. Offset: int64(n * 100), Size: 100, FileId: fmt.Sprintf("fileId%d", n), Mtime: int64(n),
  38. })
  39. chunks = append(chunks, &filer_pb.FileChunk{
  40. Offset: int64(n * 50), Size: 100, FileId: fmt.Sprintf("fileId%d", n+k), Mtime: int64(n + k),
  41. })
  42. }
  43. compacted, garbage := CompactFileChunks(nil, chunks)
  44. if len(compacted) != 4 {
  45. t.Fatalf("unexpected compacted: %d", len(compacted))
  46. }
  47. if len(garbage) != 8 {
  48. t.Fatalf("unexpected garbage: %d", len(garbage))
  49. }
  50. }
  51. func TestIntervalMerging(t *testing.T) {
  52. testcases := []struct {
  53. Chunks []*filer_pb.FileChunk
  54. Expected []*VisibleInterval
  55. }{
  56. // case 0: normal
  57. {
  58. Chunks: []*filer_pb.FileChunk{
  59. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  60. {Offset: 100, Size: 100, FileId: "asdf", Mtime: 134},
  61. {Offset: 200, Size: 100, FileId: "fsad", Mtime: 353},
  62. },
  63. Expected: []*VisibleInterval{
  64. {start: 0, stop: 100, fileId: "abc"},
  65. {start: 100, stop: 200, fileId: "asdf"},
  66. {start: 200, stop: 300, fileId: "fsad"},
  67. },
  68. },
  69. // case 1: updates overwrite full chunks
  70. {
  71. Chunks: []*filer_pb.FileChunk{
  72. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  73. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 134},
  74. },
  75. Expected: []*VisibleInterval{
  76. {start: 0, stop: 200, fileId: "asdf"},
  77. },
  78. },
  79. // case 2: updates overwrite part of previous chunks
  80. {
  81. Chunks: []*filer_pb.FileChunk{
  82. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  83. {Offset: 0, Size: 50, FileId: "asdf", Mtime: 134},
  84. },
  85. Expected: []*VisibleInterval{
  86. {start: 0, stop: 50, fileId: "asdf"},
  87. {start: 50, stop: 100, fileId: "abc"},
  88. },
  89. },
  90. // case 3: updates overwrite full chunks
  91. {
  92. Chunks: []*filer_pb.FileChunk{
  93. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  94. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 134},
  95. {Offset: 50, Size: 250, FileId: "xxxx", Mtime: 154},
  96. },
  97. Expected: []*VisibleInterval{
  98. {start: 0, stop: 50, fileId: "asdf"},
  99. {start: 50, stop: 300, fileId: "xxxx"},
  100. },
  101. },
  102. // case 4: updates far away from prev chunks
  103. {
  104. Chunks: []*filer_pb.FileChunk{
  105. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  106. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 134},
  107. {Offset: 250, Size: 250, FileId: "xxxx", Mtime: 154},
  108. },
  109. Expected: []*VisibleInterval{
  110. {start: 0, stop: 200, fileId: "asdf"},
  111. {start: 250, stop: 500, fileId: "xxxx"},
  112. },
  113. },
  114. // case 5: updates overwrite full chunks
  115. {
  116. Chunks: []*filer_pb.FileChunk{
  117. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  118. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 184},
  119. {Offset: 70, Size: 150, FileId: "abc", Mtime: 143},
  120. {Offset: 80, Size: 100, FileId: "xxxx", Mtime: 134},
  121. },
  122. Expected: []*VisibleInterval{
  123. {start: 0, stop: 200, fileId: "asdf"},
  124. {start: 200, stop: 220, fileId: "abc"},
  125. },
  126. },
  127. // case 6: same updates
  128. {
  129. Chunks: []*filer_pb.FileChunk{
  130. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  131. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  132. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  133. },
  134. Expected: []*VisibleInterval{
  135. {start: 0, stop: 100, fileId: "abc"},
  136. },
  137. },
  138. // case 7: real updates
  139. {
  140. Chunks: []*filer_pb.FileChunk{
  141. {Offset: 0, Size: 2097152, FileId: "7,0294cbb9892b", Mtime: 123},
  142. {Offset: 0, Size: 3145728, FileId: "3,029565bf3092", Mtime: 130},
  143. {Offset: 2097152, Size: 3145728, FileId: "6,029632f47ae2", Mtime: 140},
  144. {Offset: 5242880, Size: 3145728, FileId: "2,029734c5aa10", Mtime: 150},
  145. {Offset: 8388608, Size: 3145728, FileId: "5,02982f80de50", Mtime: 160},
  146. {Offset: 11534336, Size: 2842193, FileId: "7,0299ad723803", Mtime: 170},
  147. },
  148. Expected: []*VisibleInterval{
  149. {start: 0, stop: 2097152, fileId: "3,029565bf3092"},
  150. {start: 2097152, stop: 5242880, fileId: "6,029632f47ae2"},
  151. {start: 5242880, stop: 8388608, fileId: "2,029734c5aa10"},
  152. {start: 8388608, stop: 11534336, fileId: "5,02982f80de50"},
  153. {start: 11534336, stop: 14376529, fileId: "7,0299ad723803"},
  154. },
  155. },
  156. // case 8: real bug
  157. {
  158. Chunks: []*filer_pb.FileChunk{
  159. {Offset: 0, Size: 77824, FileId: "4,0b3df938e301", Mtime: 123},
  160. {Offset: 471040, Size: 472225 - 471040, FileId: "6,0b3e0650019c", Mtime: 130},
  161. {Offset: 77824, Size: 208896 - 77824, FileId: "4,0b3f0c7202f0", Mtime: 140},
  162. {Offset: 208896, Size: 339968 - 208896, FileId: "2,0b4031a72689", Mtime: 150},
  163. {Offset: 339968, Size: 471040 - 339968, FileId: "3,0b416a557362", Mtime: 160},
  164. },
  165. Expected: []*VisibleInterval{
  166. {start: 0, stop: 77824, fileId: "4,0b3df938e301"},
  167. {start: 77824, stop: 208896, fileId: "4,0b3f0c7202f0"},
  168. {start: 208896, stop: 339968, fileId: "2,0b4031a72689"},
  169. {start: 339968, stop: 471040, fileId: "3,0b416a557362"},
  170. {start: 471040, stop: 472225, fileId: "6,0b3e0650019c"},
  171. },
  172. },
  173. }
  174. for i, testcase := range testcases {
  175. log.Printf("++++++++++ merged test case %d ++++++++++++++++++++", i)
  176. intervals, _ := NonOverlappingVisibleIntervals(nil, testcase.Chunks)
  177. for x, interval := range intervals {
  178. log.Printf("test case %d, interval %d, start=%d, stop=%d, fileId=%s",
  179. i, x, interval.start, interval.stop, interval.fileId)
  180. }
  181. for x, interval := range intervals {
  182. if interval.start != testcase.Expected[x].start {
  183. t.Fatalf("failed on test case %d, interval %d, start %d, expect %d",
  184. i, x, interval.start, testcase.Expected[x].start)
  185. }
  186. if interval.stop != testcase.Expected[x].stop {
  187. t.Fatalf("failed on test case %d, interval %d, stop %d, expect %d",
  188. i, x, interval.stop, testcase.Expected[x].stop)
  189. }
  190. if interval.fileId != testcase.Expected[x].fileId {
  191. t.Fatalf("failed on test case %d, interval %d, chunkId %s, expect %s",
  192. i, x, interval.fileId, testcase.Expected[x].fileId)
  193. }
  194. }
  195. if len(intervals) != len(testcase.Expected) {
  196. t.Fatalf("failed to compact test case %d, len %d expected %d", i, len(intervals), len(testcase.Expected))
  197. }
  198. }
  199. }
  200. func TestChunksReading(t *testing.T) {
  201. testcases := []struct {
  202. Chunks []*filer_pb.FileChunk
  203. Offset int64
  204. Size int64
  205. Expected []*ChunkView
  206. }{
  207. // case 0: normal
  208. {
  209. Chunks: []*filer_pb.FileChunk{
  210. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  211. {Offset: 100, Size: 100, FileId: "asdf", Mtime: 134},
  212. {Offset: 200, Size: 100, FileId: "fsad", Mtime: 353},
  213. },
  214. Offset: 0,
  215. Size: 250,
  216. Expected: []*ChunkView{
  217. {Offset: 0, Size: 100, FileId: "abc", LogicOffset: 0},
  218. {Offset: 0, Size: 100, FileId: "asdf", LogicOffset: 100},
  219. {Offset: 0, Size: 50, FileId: "fsad", LogicOffset: 200},
  220. },
  221. },
  222. // case 1: updates overwrite full chunks
  223. {
  224. Chunks: []*filer_pb.FileChunk{
  225. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  226. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 134},
  227. },
  228. Offset: 50,
  229. Size: 100,
  230. Expected: []*ChunkView{
  231. {Offset: 50, Size: 100, FileId: "asdf", LogicOffset: 50},
  232. },
  233. },
  234. // case 2: updates overwrite part of previous chunks
  235. {
  236. Chunks: []*filer_pb.FileChunk{
  237. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  238. {Offset: 0, Size: 50, FileId: "asdf", Mtime: 134},
  239. },
  240. Offset: 25,
  241. Size: 50,
  242. Expected: []*ChunkView{
  243. {Offset: 25, Size: 25, FileId: "asdf", LogicOffset: 25},
  244. {Offset: 0, Size: 25, FileId: "abc", LogicOffset: 50},
  245. },
  246. },
  247. // case 3: updates overwrite full chunks
  248. {
  249. Chunks: []*filer_pb.FileChunk{
  250. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  251. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 134},
  252. {Offset: 50, Size: 250, FileId: "xxxx", Mtime: 154},
  253. },
  254. Offset: 0,
  255. Size: 200,
  256. Expected: []*ChunkView{
  257. {Offset: 0, Size: 50, FileId: "asdf", LogicOffset: 0},
  258. {Offset: 0, Size: 150, FileId: "xxxx", LogicOffset: 50},
  259. },
  260. },
  261. // case 4: updates far away from prev chunks
  262. {
  263. Chunks: []*filer_pb.FileChunk{
  264. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  265. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 134},
  266. {Offset: 250, Size: 250, FileId: "xxxx", Mtime: 154},
  267. },
  268. Offset: 0,
  269. Size: 400,
  270. Expected: []*ChunkView{
  271. {Offset: 0, Size: 200, FileId: "asdf", LogicOffset: 0},
  272. {Offset: 0, Size: 150, FileId: "xxxx", LogicOffset: 250},
  273. },
  274. },
  275. // case 5: updates overwrite full chunks
  276. {
  277. Chunks: []*filer_pb.FileChunk{
  278. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  279. {Offset: 0, Size: 200, FileId: "asdf", Mtime: 184},
  280. {Offset: 70, Size: 150, FileId: "abc", Mtime: 143},
  281. {Offset: 80, Size: 100, FileId: "xxxx", Mtime: 134},
  282. },
  283. Offset: 0,
  284. Size: 220,
  285. Expected: []*ChunkView{
  286. {Offset: 0, Size: 200, FileId: "asdf", LogicOffset: 0},
  287. {Offset: 0, Size: 20, FileId: "abc", LogicOffset: 200},
  288. },
  289. },
  290. // case 6: same updates
  291. {
  292. Chunks: []*filer_pb.FileChunk{
  293. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  294. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  295. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  296. },
  297. Offset: 0,
  298. Size: 100,
  299. Expected: []*ChunkView{
  300. {Offset: 0, Size: 100, FileId: "abc", LogicOffset: 0},
  301. },
  302. },
  303. // case 7: edge cases
  304. {
  305. Chunks: []*filer_pb.FileChunk{
  306. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  307. {Offset: 100, Size: 100, FileId: "asdf", Mtime: 134},
  308. {Offset: 200, Size: 100, FileId: "fsad", Mtime: 353},
  309. },
  310. Offset: 0,
  311. Size: 200,
  312. Expected: []*ChunkView{
  313. {Offset: 0, Size: 100, FileId: "abc", LogicOffset: 0},
  314. {Offset: 0, Size: 100, FileId: "asdf", LogicOffset: 100},
  315. },
  316. },
  317. // case 8: edge cases
  318. {
  319. Chunks: []*filer_pb.FileChunk{
  320. {Offset: 0, Size: 100, FileId: "abc", Mtime: 123},
  321. {Offset: 90, Size: 200, FileId: "asdf", Mtime: 134},
  322. {Offset: 190, Size: 300, FileId: "fsad", Mtime: 353},
  323. },
  324. Offset: 0,
  325. Size: 300,
  326. Expected: []*ChunkView{
  327. {Offset: 0, Size: 90, FileId: "abc", LogicOffset: 0},
  328. {Offset: 0, Size: 100, FileId: "asdf", LogicOffset: 90},
  329. {Offset: 0, Size: 110, FileId: "fsad", LogicOffset: 190},
  330. },
  331. },
  332. // case 9: edge cases
  333. {
  334. Chunks: []*filer_pb.FileChunk{
  335. {Offset: 0, Size: 43175947, FileId: "2,111fc2cbfac1", Mtime: 1},
  336. {Offset: 43175936, Size: 52981771 - 43175936, FileId: "2,112a36ea7f85", Mtime: 2},
  337. {Offset: 52981760, Size: 72564747 - 52981760, FileId: "4,112d5f31c5e7", Mtime: 3},
  338. {Offset: 72564736, Size: 133255179 - 72564736, FileId: "1,113245f0cdb6", Mtime: 4},
  339. {Offset: 133255168, Size: 137269259 - 133255168, FileId: "3,1141a70733b5", Mtime: 5},
  340. {Offset: 137269248, Size: 153578836 - 137269248, FileId: "1,114201d5bbdb", Mtime: 6},
  341. },
  342. Offset: 0,
  343. Size: 153578836,
  344. Expected: []*ChunkView{
  345. {Offset: 0, Size: 43175936, FileId: "2,111fc2cbfac1", LogicOffset: 0},
  346. {Offset: 0, Size: 52981760 - 43175936, FileId: "2,112a36ea7f85", LogicOffset: 43175936},
  347. {Offset: 0, Size: 72564736 - 52981760, FileId: "4,112d5f31c5e7", LogicOffset: 52981760},
  348. {Offset: 0, Size: 133255168 - 72564736, FileId: "1,113245f0cdb6", LogicOffset: 72564736},
  349. {Offset: 0, Size: 137269248 - 133255168, FileId: "3,1141a70733b5", LogicOffset: 133255168},
  350. {Offset: 0, Size: 153578836 - 137269248, FileId: "1,114201d5bbdb", LogicOffset: 137269248},
  351. },
  352. },
  353. }
  354. for i, testcase := range testcases {
  355. log.Printf("++++++++++ read test case %d ++++++++++++++++++++", i)
  356. chunks := ViewFromChunks(nil, testcase.Chunks, testcase.Offset, testcase.Size)
  357. for x, chunk := range chunks {
  358. log.Printf("read case %d, chunk %d, offset=%d, size=%d, fileId=%s",
  359. i, x, chunk.Offset, chunk.Size, chunk.FileId)
  360. if chunk.Offset != testcase.Expected[x].Offset {
  361. t.Fatalf("failed on read case %d, chunk %d, Offset %d, expect %d",
  362. i, x, chunk.Offset, testcase.Expected[x].Offset)
  363. }
  364. if chunk.Size != testcase.Expected[x].Size {
  365. t.Fatalf("failed on read case %d, chunk %d, Size %d, expect %d",
  366. i, x, chunk.Size, testcase.Expected[x].Size)
  367. }
  368. if chunk.FileId != testcase.Expected[x].FileId {
  369. t.Fatalf("failed on read case %d, chunk %d, FileId %s, expect %s",
  370. i, x, chunk.FileId, testcase.Expected[x].FileId)
  371. }
  372. if chunk.LogicOffset != testcase.Expected[x].LogicOffset {
  373. t.Fatalf("failed on read case %d, chunk %d, LogicOffset %d, expect %d",
  374. i, x, chunk.LogicOffset, testcase.Expected[x].LogicOffset)
  375. }
  376. }
  377. if len(chunks) != len(testcase.Expected) {
  378. t.Fatalf("failed to read test case %d, len %d expected %d", i, len(chunks), len(testcase.Expected))
  379. }
  380. }
  381. }
  382. func BenchmarkCompactFileChunks(b *testing.B) {
  383. var chunks []*filer_pb.FileChunk
  384. k := 1024
  385. for n := 0; n < k; n++ {
  386. chunks = append(chunks, &filer_pb.FileChunk{
  387. Offset: int64(n * 100), Size: 100, FileId: fmt.Sprintf("fileId%d", n), Mtime: int64(n),
  388. })
  389. chunks = append(chunks, &filer_pb.FileChunk{
  390. Offset: int64(n * 50), Size: 100, FileId: fmt.Sprintf("fileId%d", n+k), Mtime: int64(n + k),
  391. })
  392. }
  393. for n := 0; n < b.N; n++ {
  394. CompactFileChunks(nil, chunks)
  395. }
  396. }
  397. func TestViewFromVisibleIntervals(t *testing.T) {
  398. visibles := []VisibleInterval{
  399. {
  400. start: 0,
  401. stop: 25,
  402. fileId: "fid1",
  403. },
  404. {
  405. start: 4096,
  406. stop: 8192,
  407. fileId: "fid2",
  408. },
  409. {
  410. start: 16384,
  411. stop: 18551,
  412. fileId: "fid3",
  413. },
  414. }
  415. views := ViewFromVisibleIntervals(visibles, 0, math.MaxInt32)
  416. if len(views) != len(visibles) {
  417. assert.Equal(t, len(visibles), len(views), "ViewFromVisibleIntervals error")
  418. }
  419. }