faiss 0.2.0 → 0.2.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (215) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +16 -0
  3. data/LICENSE.txt +1 -1
  4. data/README.md +7 -7
  5. data/ext/faiss/extconf.rb +6 -3
  6. data/ext/faiss/numo.hpp +4 -4
  7. data/ext/faiss/utils.cpp +1 -1
  8. data/ext/faiss/utils.h +1 -1
  9. data/lib/faiss/version.rb +1 -1
  10. data/vendor/faiss/faiss/AutoTune.cpp +292 -291
  11. data/vendor/faiss/faiss/AutoTune.h +55 -56
  12. data/vendor/faiss/faiss/Clustering.cpp +365 -194
  13. data/vendor/faiss/faiss/Clustering.h +102 -35
  14. data/vendor/faiss/faiss/IVFlib.cpp +171 -195
  15. data/vendor/faiss/faiss/IVFlib.h +48 -51
  16. data/vendor/faiss/faiss/Index.cpp +85 -103
  17. data/vendor/faiss/faiss/Index.h +54 -48
  18. data/vendor/faiss/faiss/Index2Layer.cpp +126 -224
  19. data/vendor/faiss/faiss/Index2Layer.h +22 -36
  20. data/vendor/faiss/faiss/IndexAdditiveQuantizer.cpp +407 -0
  21. data/vendor/faiss/faiss/IndexAdditiveQuantizer.h +195 -0
  22. data/vendor/faiss/faiss/IndexBinary.cpp +45 -37
  23. data/vendor/faiss/faiss/IndexBinary.h +140 -132
  24. data/vendor/faiss/faiss/IndexBinaryFlat.cpp +73 -53
  25. data/vendor/faiss/faiss/IndexBinaryFlat.h +29 -24
  26. data/vendor/faiss/faiss/IndexBinaryFromFloat.cpp +46 -43
  27. data/vendor/faiss/faiss/IndexBinaryFromFloat.h +16 -15
  28. data/vendor/faiss/faiss/IndexBinaryHNSW.cpp +215 -232
  29. data/vendor/faiss/faiss/IndexBinaryHNSW.h +25 -24
  30. data/vendor/faiss/faiss/IndexBinaryHash.cpp +182 -177
  31. data/vendor/faiss/faiss/IndexBinaryHash.h +41 -34
  32. data/vendor/faiss/faiss/IndexBinaryIVF.cpp +489 -461
  33. data/vendor/faiss/faiss/IndexBinaryIVF.h +97 -68
  34. data/vendor/faiss/faiss/IndexFlat.cpp +115 -176
  35. data/vendor/faiss/faiss/IndexFlat.h +42 -59
  36. data/vendor/faiss/faiss/IndexFlatCodes.cpp +67 -0
  37. data/vendor/faiss/faiss/IndexFlatCodes.h +47 -0
  38. data/vendor/faiss/faiss/IndexHNSW.cpp +372 -348
  39. data/vendor/faiss/faiss/IndexHNSW.h +57 -41
  40. data/vendor/faiss/faiss/IndexIVF.cpp +545 -453
  41. data/vendor/faiss/faiss/IndexIVF.h +169 -118
  42. data/vendor/faiss/faiss/IndexIVFAdditiveQuantizer.cpp +316 -0
  43. data/vendor/faiss/faiss/IndexIVFAdditiveQuantizer.h +121 -0
  44. data/vendor/faiss/faiss/IndexIVFFlat.cpp +247 -252
  45. data/vendor/faiss/faiss/IndexIVFFlat.h +48 -51
  46. data/vendor/faiss/faiss/IndexIVFPQ.cpp +459 -517
  47. data/vendor/faiss/faiss/IndexIVFPQ.h +75 -67
  48. data/vendor/faiss/faiss/IndexIVFPQFastScan.cpp +406 -372
  49. data/vendor/faiss/faiss/IndexIVFPQFastScan.h +82 -57
  50. data/vendor/faiss/faiss/IndexIVFPQR.cpp +104 -102
  51. data/vendor/faiss/faiss/IndexIVFPQR.h +33 -28
  52. data/vendor/faiss/faiss/IndexIVFSpectralHash.cpp +163 -150
  53. data/vendor/faiss/faiss/IndexIVFSpectralHash.h +38 -25
  54. data/vendor/faiss/faiss/IndexLSH.cpp +66 -113
  55. data/vendor/faiss/faiss/IndexLSH.h +20 -38
  56. data/vendor/faiss/faiss/IndexLattice.cpp +42 -56
  57. data/vendor/faiss/faiss/IndexLattice.h +11 -16
  58. data/vendor/faiss/faiss/IndexNNDescent.cpp +229 -0
  59. data/vendor/faiss/faiss/IndexNNDescent.h +72 -0
  60. data/vendor/faiss/faiss/IndexNSG.cpp +301 -0
  61. data/vendor/faiss/faiss/IndexNSG.h +85 -0
  62. data/vendor/faiss/faiss/IndexPQ.cpp +387 -495
  63. data/vendor/faiss/faiss/IndexPQ.h +64 -82
  64. data/vendor/faiss/faiss/IndexPQFastScan.cpp +143 -170
  65. data/vendor/faiss/faiss/IndexPQFastScan.h +46 -32
  66. data/vendor/faiss/faiss/IndexPreTransform.cpp +120 -150
  67. data/vendor/faiss/faiss/IndexPreTransform.h +33 -36
  68. data/vendor/faiss/faiss/IndexRefine.cpp +139 -127
  69. data/vendor/faiss/faiss/IndexRefine.h +32 -23
  70. data/vendor/faiss/faiss/IndexReplicas.cpp +147 -153
  71. data/vendor/faiss/faiss/IndexReplicas.h +62 -56
  72. data/vendor/faiss/faiss/IndexScalarQuantizer.cpp +111 -172
  73. data/vendor/faiss/faiss/IndexScalarQuantizer.h +41 -59
  74. data/vendor/faiss/faiss/IndexShards.cpp +256 -240
  75. data/vendor/faiss/faiss/IndexShards.h +85 -73
  76. data/vendor/faiss/faiss/MatrixStats.cpp +112 -97
  77. data/vendor/faiss/faiss/MatrixStats.h +7 -10
  78. data/vendor/faiss/faiss/MetaIndexes.cpp +135 -157
  79. data/vendor/faiss/faiss/MetaIndexes.h +40 -34
  80. data/vendor/faiss/faiss/MetricType.h +7 -7
  81. data/vendor/faiss/faiss/VectorTransform.cpp +654 -475
  82. data/vendor/faiss/faiss/VectorTransform.h +64 -89
  83. data/vendor/faiss/faiss/clone_index.cpp +78 -73
  84. data/vendor/faiss/faiss/clone_index.h +4 -9
  85. data/vendor/faiss/faiss/gpu/GpuAutoTune.cpp +33 -38
  86. data/vendor/faiss/faiss/gpu/GpuAutoTune.h +11 -9
  87. data/vendor/faiss/faiss/gpu/GpuCloner.cpp +198 -171
  88. data/vendor/faiss/faiss/gpu/GpuCloner.h +53 -35
  89. data/vendor/faiss/faiss/gpu/GpuClonerOptions.cpp +12 -14
  90. data/vendor/faiss/faiss/gpu/GpuClonerOptions.h +27 -25
  91. data/vendor/faiss/faiss/gpu/GpuDistance.h +116 -112
  92. data/vendor/faiss/faiss/gpu/GpuFaissAssert.h +1 -2
  93. data/vendor/faiss/faiss/gpu/GpuIcmEncoder.h +60 -0
  94. data/vendor/faiss/faiss/gpu/GpuIndex.h +134 -137
  95. data/vendor/faiss/faiss/gpu/GpuIndexBinaryFlat.h +76 -73
  96. data/vendor/faiss/faiss/gpu/GpuIndexFlat.h +173 -162
  97. data/vendor/faiss/faiss/gpu/GpuIndexIVF.h +67 -64
  98. data/vendor/faiss/faiss/gpu/GpuIndexIVFFlat.h +89 -86
  99. data/vendor/faiss/faiss/gpu/GpuIndexIVFPQ.h +150 -141
  100. data/vendor/faiss/faiss/gpu/GpuIndexIVFScalarQuantizer.h +101 -103
  101. data/vendor/faiss/faiss/gpu/GpuIndicesOptions.h +17 -16
  102. data/vendor/faiss/faiss/gpu/GpuResources.cpp +116 -128
  103. data/vendor/faiss/faiss/gpu/GpuResources.h +182 -186
  104. data/vendor/faiss/faiss/gpu/StandardGpuResources.cpp +433 -422
  105. data/vendor/faiss/faiss/gpu/StandardGpuResources.h +131 -130
  106. data/vendor/faiss/faiss/gpu/impl/InterleavedCodes.cpp +468 -456
  107. data/vendor/faiss/faiss/gpu/impl/InterleavedCodes.h +25 -19
  108. data/vendor/faiss/faiss/gpu/impl/RemapIndices.cpp +22 -20
  109. data/vendor/faiss/faiss/gpu/impl/RemapIndices.h +9 -8
  110. data/vendor/faiss/faiss/gpu/perf/IndexWrapper-inl.h +39 -44
  111. data/vendor/faiss/faiss/gpu/perf/IndexWrapper.h +16 -14
  112. data/vendor/faiss/faiss/gpu/perf/PerfClustering.cpp +77 -71
  113. data/vendor/faiss/faiss/gpu/perf/PerfIVFPQAdd.cpp +109 -88
  114. data/vendor/faiss/faiss/gpu/perf/WriteIndex.cpp +75 -64
  115. data/vendor/faiss/faiss/gpu/test/TestCodePacking.cpp +230 -215
  116. data/vendor/faiss/faiss/gpu/test/TestGpuIndexBinaryFlat.cpp +80 -86
  117. data/vendor/faiss/faiss/gpu/test/TestGpuIndexFlat.cpp +284 -277
  118. data/vendor/faiss/faiss/gpu/test/TestGpuIndexIVFFlat.cpp +416 -416
  119. data/vendor/faiss/faiss/gpu/test/TestGpuIndexIVFPQ.cpp +611 -517
  120. data/vendor/faiss/faiss/gpu/test/TestGpuIndexIVFScalarQuantizer.cpp +166 -164
  121. data/vendor/faiss/faiss/gpu/test/TestGpuMemoryException.cpp +61 -53
  122. data/vendor/faiss/faiss/gpu/test/TestUtils.cpp +274 -238
  123. data/vendor/faiss/faiss/gpu/test/TestUtils.h +73 -57
  124. data/vendor/faiss/faiss/gpu/test/demo_ivfpq_indexing_gpu.cpp +47 -50
  125. data/vendor/faiss/faiss/gpu/utils/DeviceUtils.h +79 -72
  126. data/vendor/faiss/faiss/gpu/utils/StackDeviceMemory.cpp +140 -146
  127. data/vendor/faiss/faiss/gpu/utils/StackDeviceMemory.h +69 -71
  128. data/vendor/faiss/faiss/gpu/utils/StaticUtils.h +21 -16
  129. data/vendor/faiss/faiss/gpu/utils/Timer.cpp +25 -29
  130. data/vendor/faiss/faiss/gpu/utils/Timer.h +30 -29
  131. data/vendor/faiss/faiss/impl/AdditiveQuantizer.cpp +503 -0
  132. data/vendor/faiss/faiss/impl/AdditiveQuantizer.h +175 -0
  133. data/vendor/faiss/faiss/impl/AuxIndexStructures.cpp +90 -120
  134. data/vendor/faiss/faiss/impl/AuxIndexStructures.h +81 -65
  135. data/vendor/faiss/faiss/impl/FaissAssert.h +73 -58
  136. data/vendor/faiss/faiss/impl/FaissException.cpp +56 -48
  137. data/vendor/faiss/faiss/impl/FaissException.h +41 -29
  138. data/vendor/faiss/faiss/impl/HNSW.cpp +606 -617
  139. data/vendor/faiss/faiss/impl/HNSW.h +179 -200
  140. data/vendor/faiss/faiss/impl/LocalSearchQuantizer.cpp +855 -0
  141. data/vendor/faiss/faiss/impl/LocalSearchQuantizer.h +244 -0
  142. data/vendor/faiss/faiss/impl/NNDescent.cpp +487 -0
  143. data/vendor/faiss/faiss/impl/NNDescent.h +154 -0
  144. data/vendor/faiss/faiss/impl/NSG.cpp +679 -0
  145. data/vendor/faiss/faiss/impl/NSG.h +199 -0
  146. data/vendor/faiss/faiss/impl/PolysemousTraining.cpp +484 -454
  147. data/vendor/faiss/faiss/impl/PolysemousTraining.h +52 -55
  148. data/vendor/faiss/faiss/impl/ProductQuantizer-inl.h +26 -47
  149. data/vendor/faiss/faiss/impl/ProductQuantizer.cpp +469 -459
  150. data/vendor/faiss/faiss/impl/ProductQuantizer.h +76 -87
  151. data/vendor/faiss/faiss/impl/ResidualQuantizer.cpp +758 -0
  152. data/vendor/faiss/faiss/impl/ResidualQuantizer.h +188 -0
  153. data/vendor/faiss/faiss/impl/ResultHandler.h +96 -132
  154. data/vendor/faiss/faiss/impl/ScalarQuantizer.cpp +647 -707
  155. data/vendor/faiss/faiss/impl/ScalarQuantizer.h +48 -46
  156. data/vendor/faiss/faiss/impl/ThreadedIndex-inl.h +129 -131
  157. data/vendor/faiss/faiss/impl/ThreadedIndex.h +61 -55
  158. data/vendor/faiss/faiss/impl/index_read.cpp +631 -480
  159. data/vendor/faiss/faiss/impl/index_write.cpp +547 -407
  160. data/vendor/faiss/faiss/impl/io.cpp +76 -95
  161. data/vendor/faiss/faiss/impl/io.h +31 -41
  162. data/vendor/faiss/faiss/impl/io_macros.h +60 -29
  163. data/vendor/faiss/faiss/impl/kmeans1d.cpp +301 -0
  164. data/vendor/faiss/faiss/impl/kmeans1d.h +48 -0
  165. data/vendor/faiss/faiss/impl/lattice_Zn.cpp +137 -186
  166. data/vendor/faiss/faiss/impl/lattice_Zn.h +40 -51
  167. data/vendor/faiss/faiss/impl/platform_macros.h +29 -8
  168. data/vendor/faiss/faiss/impl/pq4_fast_scan.cpp +77 -124
  169. data/vendor/faiss/faiss/impl/pq4_fast_scan.h +39 -48
  170. data/vendor/faiss/faiss/impl/pq4_fast_scan_search_1.cpp +41 -52
  171. data/vendor/faiss/faiss/impl/pq4_fast_scan_search_qbs.cpp +80 -117
  172. data/vendor/faiss/faiss/impl/simd_result_handlers.h +109 -137
  173. data/vendor/faiss/faiss/index_factory.cpp +619 -397
  174. data/vendor/faiss/faiss/index_factory.h +8 -6
  175. data/vendor/faiss/faiss/index_io.h +23 -26
  176. data/vendor/faiss/faiss/invlists/BlockInvertedLists.cpp +67 -75
  177. data/vendor/faiss/faiss/invlists/BlockInvertedLists.h +22 -24
  178. data/vendor/faiss/faiss/invlists/DirectMap.cpp +96 -112
  179. data/vendor/faiss/faiss/invlists/DirectMap.h +29 -33
  180. data/vendor/faiss/faiss/invlists/InvertedLists.cpp +307 -364
  181. data/vendor/faiss/faiss/invlists/InvertedLists.h +151 -151
  182. data/vendor/faiss/faiss/invlists/InvertedListsIOHook.cpp +29 -34
  183. data/vendor/faiss/faiss/invlists/InvertedListsIOHook.h +17 -18
  184. data/vendor/faiss/faiss/invlists/OnDiskInvertedLists.cpp +257 -293
  185. data/vendor/faiss/faiss/invlists/OnDiskInvertedLists.h +50 -45
  186. data/vendor/faiss/faiss/python/python_callbacks.cpp +23 -26
  187. data/vendor/faiss/faiss/python/python_callbacks.h +9 -16
  188. data/vendor/faiss/faiss/utils/AlignedTable.h +79 -44
  189. data/vendor/faiss/faiss/utils/Heap.cpp +40 -48
  190. data/vendor/faiss/faiss/utils/Heap.h +186 -209
  191. data/vendor/faiss/faiss/utils/WorkerThread.cpp +67 -76
  192. data/vendor/faiss/faiss/utils/WorkerThread.h +32 -33
  193. data/vendor/faiss/faiss/utils/distances.cpp +305 -312
  194. data/vendor/faiss/faiss/utils/distances.h +170 -122
  195. data/vendor/faiss/faiss/utils/distances_simd.cpp +498 -508
  196. data/vendor/faiss/faiss/utils/extra_distances-inl.h +117 -0
  197. data/vendor/faiss/faiss/utils/extra_distances.cpp +113 -232
  198. data/vendor/faiss/faiss/utils/extra_distances.h +30 -29
  199. data/vendor/faiss/faiss/utils/hamming-inl.h +260 -209
  200. data/vendor/faiss/faiss/utils/hamming.cpp +375 -469
  201. data/vendor/faiss/faiss/utils/hamming.h +62 -85
  202. data/vendor/faiss/faiss/utils/ordered_key_value.h +16 -18
  203. data/vendor/faiss/faiss/utils/partitioning.cpp +393 -318
  204. data/vendor/faiss/faiss/utils/partitioning.h +26 -21
  205. data/vendor/faiss/faiss/utils/quantize_lut.cpp +78 -66
  206. data/vendor/faiss/faiss/utils/quantize_lut.h +22 -20
  207. data/vendor/faiss/faiss/utils/random.cpp +39 -63
  208. data/vendor/faiss/faiss/utils/random.h +13 -16
  209. data/vendor/faiss/faiss/utils/simdlib.h +4 -2
  210. data/vendor/faiss/faiss/utils/simdlib_avx2.h +88 -85
  211. data/vendor/faiss/faiss/utils/simdlib_emulated.h +226 -165
  212. data/vendor/faiss/faiss/utils/simdlib_neon.h +832 -0
  213. data/vendor/faiss/faiss/utils/utils.cpp +304 -287
  214. data/vendor/faiss/faiss/utils/utils.h +54 -49
  215. metadata +29 -4
@@ -5,270 +5,285 @@
5
5
  * LICENSE file in the root directory of this source tree.
6
6
  */
7
7
 
8
-
9
8
  #include <faiss/gpu/impl/InterleavedCodes.h>
10
- #include <faiss/gpu/utils/StaticUtils.h>
11
9
  #include <faiss/gpu/test/TestUtils.h>
12
- #include <cmath>
10
+ #include <faiss/gpu/utils/StaticUtils.h>
13
11
  #include <gtest/gtest.h>
12
+ #include <cmath>
14
13
  #include <random>
15
14
  #include <sstream>
16
15
  #include <vector>
17
16
 
18
17
  TEST(TestCodePacking, NonInterleavedCodes_UnpackPack) {
19
- using namespace faiss::gpu;
18
+ using namespace faiss::gpu;
20
19
 
21
- // We are fine using non-fixed seeds here, the results should be fully
22
- // deterministic
23
- auto seed = std::random_device()();
24
- std::mt19937 gen(seed);
25
- std::uniform_int_distribution<uint8_t> dist;
20
+ // We are fine using non-fixed seeds here, the results should be fully
21
+ // deterministic
22
+ auto seed = std::random_device()();
23
+ std::mt19937 gen(seed);
24
+ std::uniform_int_distribution<uint8_t> dist;
26
25
 
27
- std::cout << "seed " << seed << "\n";
26
+ std::cout << "seed " << seed << "\n";
28
27
 
29
- for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
30
- for (auto dims : {1, 7, 8, 31, 32}) {
31
- for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
32
- std::cout << bitsPerCode << " " << dims << " " << numVecs << "\n";
28
+ for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
29
+ for (auto dims : {1, 7, 8, 31, 32}) {
30
+ for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
31
+ std::cout << bitsPerCode << " " << dims << " " << numVecs
32
+ << "\n";
33
33
 
34
- int srcVecSize = utils::divUp(dims * bitsPerCode, 8);
35
- std::vector<uint8_t> data(numVecs * srcVecSize);
34
+ int srcVecSize = utils::divUp(dims * bitsPerCode, 8);
35
+ std::vector<uint8_t> data(numVecs * srcVecSize);
36
36
 
37
- for (auto& v : data) {
38
- v = dist(gen);
39
- }
37
+ for (auto& v : data) {
38
+ v = dist(gen);
39
+ }
40
40
 
41
- // currently unimplemented
42
- EXPECT_FALSE(bitsPerCode > 8 && bitsPerCode % 8 != 0);
41
+ // currently unimplemented
42
+ EXPECT_FALSE(bitsPerCode > 8 && bitsPerCode % 8 != 0);
43
43
 
44
- // Due to bit packing, mask out bits that should be zero based on
45
- // dimensions we shouldn't have present
46
- int vectorSizeBits = dims * bitsPerCode;
47
- int vectorSizeBytes = utils::divUp(vectorSizeBits, 8);
48
- int remainder = vectorSizeBits % 8;
44
+ // Due to bit packing, mask out bits that should be zero based
45
+ // on dimensions we shouldn't have present
46
+ int vectorSizeBits = dims * bitsPerCode;
47
+ int vectorSizeBytes = utils::divUp(vectorSizeBits, 8);
48
+ int remainder = vectorSizeBits % 8;
49
49
 
50
- if (remainder > 0) {
51
- uint8_t mask = 0xff >> (8 - remainder);
50
+ if (remainder > 0) {
51
+ uint8_t mask = 0xff >> (8 - remainder);
52
52
 
53
- for (int i = 0; i < numVecs; ++i) {
54
- int lastVecByte = (i + 1) * vectorSizeBytes - 1;
55
- data[lastVecByte] &= mask;
56
- }
57
- }
53
+ for (int i = 0; i < numVecs; ++i) {
54
+ int lastVecByte = (i + 1) * vectorSizeBytes - 1;
55
+ data[lastVecByte] &= mask;
56
+ }
57
+ }
58
58
 
59
- auto up = unpackNonInterleaved(data, numVecs, dims, bitsPerCode);
60
- auto p = packNonInterleaved(up, numVecs, dims, bitsPerCode);
59
+ auto up =
60
+ unpackNonInterleaved(data, numVecs, dims, bitsPerCode);
61
+ auto p = packNonInterleaved(up, numVecs, dims, bitsPerCode);
61
62
 
62
- EXPECT_EQ(data, p);
63
- }
63
+ EXPECT_EQ(data, p);
64
+ }
65
+ }
64
66
  }
65
- }
66
67
  }
67
68
 
68
69
  TEST(TestCodePacking, NonInterleavedCodes_PackUnpack) {
69
- using namespace faiss::gpu;
70
+ using namespace faiss::gpu;
70
71
 
71
- // We are fine using non-fixed seeds here, the results should be fully
72
- // deterministic
73
- std::random_device rd;
74
- std::mt19937 gen(rd());
75
- std::uniform_int_distribution<uint8_t> dist;
72
+ // We are fine using non-fixed seeds here, the results should be fully
73
+ // deterministic
74
+ std::random_device rd;
75
+ std::mt19937 gen(rd());
76
+ std::uniform_int_distribution<uint8_t> dist;
76
77
 
77
- for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
78
- for (auto dims : {1, 7, 8, 31, 32}) {
79
- for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
80
- std::cout << bitsPerCode << " " << dims << " " << numVecs << "\n";
78
+ for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
79
+ for (auto dims : {1, 7, 8, 31, 32}) {
80
+ for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
81
+ std::cout << bitsPerCode << " " << dims << " " << numVecs
82
+ << "\n";
81
83
 
82
- std::vector<uint8_t> data(numVecs * dims * utils::divUp(bitsPerCode, 8));
84
+ std::vector<uint8_t> data(
85
+ numVecs * dims * utils::divUp(bitsPerCode, 8));
83
86
 
84
- // currently unimplemented
85
- EXPECT_FALSE(bitsPerCode > 8 && bitsPerCode % 8 != 0);
87
+ // currently unimplemented
88
+ EXPECT_FALSE(bitsPerCode > 8 && bitsPerCode % 8 != 0);
86
89
 
87
- // Mask out high bits we shouldn't have based on code size
88
- uint8_t mask = bitsPerCode < 8 ? (0xff >> (8 - bitsPerCode)) : 0xff;
90
+ // Mask out high bits we shouldn't have based on code size
91
+ uint8_t mask =
92
+ bitsPerCode < 8 ? (0xff >> (8 - bitsPerCode)) : 0xff;
89
93
 
90
- for (auto& v : data) {
91
- v = dist(gen) & mask;
92
- }
94
+ for (auto& v : data) {
95
+ v = dist(gen) & mask;
96
+ }
93
97
 
94
- auto p = packNonInterleaved(data, numVecs, dims, bitsPerCode);
95
- auto up = unpackNonInterleaved(p, numVecs, dims, bitsPerCode);
98
+ auto p = packNonInterleaved(data, numVecs, dims, bitsPerCode);
99
+ auto up = unpackNonInterleaved(p, numVecs, dims, bitsPerCode);
96
100
 
97
- EXPECT_EQ(data, up);
98
- }
101
+ EXPECT_EQ(data, up);
102
+ }
103
+ }
99
104
  }
100
- }
101
105
  }
102
106
 
103
107
  TEST(TestCodePacking, InterleavedCodes_UnpackPack) {
104
- using namespace faiss::gpu;
105
-
106
- // We are fine using non-fixed seeds here, the results should be fully
107
- // deterministic
108
- std::random_device rd;
109
- std::mt19937 gen(rd());
110
- std::uniform_int_distribution<uint8_t> dist;
111
-
112
- for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
113
- for (auto dims : {1, 7, 8, 31, 32}) {
114
- for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
115
- std::cout << bitsPerCode << " " << dims << " " << numVecs << "\n";
116
-
117
- int blocks = utils::divUp(numVecs, 32);
118
- int bytesPerDimBlock = 32 * bitsPerCode / 8;
119
- int bytesPerBlock = bytesPerDimBlock * dims;
120
- int size = blocks * bytesPerBlock;
121
-
122
- std::vector<uint8_t> data(size);
123
-
124
- if (bitsPerCode == 8 || bitsPerCode == 16 || bitsPerCode == 32) {
125
- int bytesPerCode = bitsPerCode / 8;
126
-
127
- for (int i = 0; i < blocks; ++i) {
128
- for (int j = 0; j < dims; ++j) {
129
- for (int k = 0; k < 32; ++k) {
130
- for (int l = 0; l < bytesPerCode; ++l) {
131
- int vec = i * 32 + k;
132
- if (vec < numVecs) {
133
- data[i * bytesPerBlock +
134
- j * bytesPerDimBlock +
135
- k * bytesPerCode + l] = dist(gen);
136
- }
137
- }
138
- }
139
- }
140
- }
141
- } else if (bitsPerCode < 8) {
142
- for (int i = 0; i < blocks; ++i) {
143
- for (int j = 0; j < dims; ++j) {
144
- for (int k = 0; k < bytesPerDimBlock; ++k) {
145
- int loVec = i * 32 + (k * 8) / bitsPerCode;
146
- int hiVec = loVec + 1;
147
- int hiVec2 = hiVec + 1;
148
-
149
- uint8_t lo = loVec < numVecs ?
150
- dist(gen) & (0xff >> (8 - bitsPerCode)) : 0;
151
- uint8_t hi = hiVec < numVecs ?
152
- dist(gen) & (0xff >> (8 - bitsPerCode)) : 0;
153
- uint8_t hi2 = hiVec2 < numVecs ?
154
- dist(gen) & (0xff >> (8 - bitsPerCode)) : 0;
155
-
156
- uint8_t v = 0;
157
- if (bitsPerCode == 4) {
158
- v = lo | (hi << 4);
159
- } else if (bitsPerCode == 5) {
160
- switch (k % 5) {
161
- case 0:
162
- // 5 msbs of lower as vOut lsbs
163
- // 3 lsbs of upper as vOut msbs
164
- v = (lo & 0x1f) | (hi << 5);
165
- break;
166
- case 1:
167
- // 2 msbs of lower as vOut lsbs
168
- // 5 lsbs of upper as vOut msbs
169
- // 1 lsbs of upper2 as vOut msb
170
- v = (lo >> 3) | (hi << 2) | (hi2 << 7);
171
- break;
172
- case 2:
173
- // 4 msbs of lower as vOut lsbs
174
- // 4 lsbs of upper as vOut msbs
175
- v = (lo >> 1) | (hi << 4);
176
- break;
177
- case 3:
178
- // 1 msbs of lower as vOut lsbs
179
- // 5 lsbs of upper as vOut msbs
180
- // 2 lsbs of upper2 as vOut msb
181
- v = (lo >> 4) | (hi << 1) | (hi2 << 6);
182
- break;
183
- case 4:
184
- // 3 msbs of lower as vOut lsbs
185
- // 5 lsbs of upper as vOut msbs
186
- v = (lo >> 2) | (hi << 3);
187
- break;
188
- }
189
- } else if (bitsPerCode == 6) {
190
- switch (k % 3) {
191
- case 0:
192
- // 6 msbs of lower as vOut lsbs
193
- // 2 lsbs of upper as vOut msbs
194
- v = (lo & 0x3f) | (hi << 6);
195
- break;
196
- case 1:
197
- // 4 msbs of lower as vOut lsbs
198
- // 4 lsbs of upper as vOut msbs
199
- v = (lo >> 2) | (hi << 4);
200
- break;
201
- case 2:
202
- // 2 msbs of lower as vOut lsbs
203
- // 6 lsbs of upper as vOut msbs
204
- v = (lo >> 4) | (hi << 2);
205
- break;
206
- }
108
+ using namespace faiss::gpu;
109
+
110
+ // We are fine using non-fixed seeds here, the results should be fully
111
+ // deterministic
112
+ std::random_device rd;
113
+ std::mt19937 gen(rd());
114
+ std::uniform_int_distribution<uint8_t> dist;
115
+
116
+ for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
117
+ for (auto dims : {1, 7, 8, 31, 32}) {
118
+ for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
119
+ std::cout << bitsPerCode << " " << dims << " " << numVecs
120
+ << "\n";
121
+
122
+ int blocks = utils::divUp(numVecs, 32);
123
+ int bytesPerDimBlock = 32 * bitsPerCode / 8;
124
+ int bytesPerBlock = bytesPerDimBlock * dims;
125
+ int size = blocks * bytesPerBlock;
126
+
127
+ std::vector<uint8_t> data(size);
128
+
129
+ if (bitsPerCode == 8 || bitsPerCode == 16 ||
130
+ bitsPerCode == 32) {
131
+ int bytesPerCode = bitsPerCode / 8;
132
+
133
+ for (int i = 0; i < blocks; ++i) {
134
+ for (int j = 0; j < dims; ++j) {
135
+ for (int k = 0; k < 32; ++k) {
136
+ for (int l = 0; l < bytesPerCode; ++l) {
137
+ int vec = i * 32 + k;
138
+ if (vec < numVecs) {
139
+ data[i * bytesPerBlock +
140
+ j * bytesPerDimBlock +
141
+ k * bytesPerCode + l] = dist(gen);
142
+ }
143
+ }
144
+ }
145
+ }
146
+ }
147
+ } else if (bitsPerCode < 8) {
148
+ for (int i = 0; i < blocks; ++i) {
149
+ for (int j = 0; j < dims; ++j) {
150
+ for (int k = 0; k < bytesPerDimBlock; ++k) {
151
+ int loVec = i * 32 + (k * 8) / bitsPerCode;
152
+ int hiVec = loVec + 1;
153
+ int hiVec2 = hiVec + 1;
154
+
155
+ uint8_t lo = loVec < numVecs ? dist(gen) &
156
+ (0xff >> (8 - bitsPerCode))
157
+ : 0;
158
+ uint8_t hi = hiVec < numVecs ? dist(gen) &
159
+ (0xff >> (8 - bitsPerCode))
160
+ : 0;
161
+ uint8_t hi2 = hiVec2 < numVecs ? dist(gen) &
162
+ (0xff >> (8 - bitsPerCode))
163
+ : 0;
164
+
165
+ uint8_t v = 0;
166
+ if (bitsPerCode == 4) {
167
+ v = lo | (hi << 4);
168
+ } else if (bitsPerCode == 5) {
169
+ switch (k % 5) {
170
+ case 0:
171
+ // 5 msbs of lower as vOut lsbs
172
+ // 3 lsbs of upper as vOut msbs
173
+ v = (lo & 0x1f) | (hi << 5);
174
+ break;
175
+ case 1:
176
+ // 2 msbs of lower as vOut lsbs
177
+ // 5 lsbs of upper as vOut msbs
178
+ // 1 lsbs of upper2 as vOut msb
179
+ v = (lo >> 3) | (hi << 2) |
180
+ (hi2 << 7);
181
+ break;
182
+ case 2:
183
+ // 4 msbs of lower as vOut lsbs
184
+ // 4 lsbs of upper as vOut msbs
185
+ v = (lo >> 1) | (hi << 4);
186
+ break;
187
+ case 3:
188
+ // 1 msbs of lower as vOut lsbs
189
+ // 5 lsbs of upper as vOut msbs
190
+ // 2 lsbs of upper2 as vOut msb
191
+ v = (lo >> 4) | (hi << 1) |
192
+ (hi2 << 6);
193
+ break;
194
+ case 4:
195
+ // 3 msbs of lower as vOut lsbs
196
+ // 5 lsbs of upper as vOut msbs
197
+ v = (lo >> 2) | (hi << 3);
198
+ break;
199
+ }
200
+ } else if (bitsPerCode == 6) {
201
+ switch (k % 3) {
202
+ case 0:
203
+ // 6 msbs of lower as vOut lsbs
204
+ // 2 lsbs of upper as vOut msbs
205
+ v = (lo & 0x3f) | (hi << 6);
206
+ break;
207
+ case 1:
208
+ // 4 msbs of lower as vOut lsbs
209
+ // 4 lsbs of upper as vOut msbs
210
+ v = (lo >> 2) | (hi << 4);
211
+ break;
212
+ case 2:
213
+ // 2 msbs of lower as vOut lsbs
214
+ // 6 lsbs of upper as vOut msbs
215
+ v = (lo >> 4) | (hi << 2);
216
+ break;
217
+ }
218
+ } else {
219
+ // unimplemented
220
+ EXPECT_TRUE(false);
221
+ }
222
+
223
+ data[i * bytesPerBlock + j * bytesPerDimBlock +
224
+ k] = v;
225
+ }
226
+ }
227
+ }
207
228
  } else {
208
- // unimplemented
209
- EXPECT_TRUE(false);
229
+ // unimplemented
230
+ EXPECT_TRUE(false);
210
231
  }
211
232
 
212
- data[i * bytesPerBlock + j * bytesPerDimBlock + k] = v;
213
- }
233
+ auto up = unpackInterleaved(data, numVecs, dims, bitsPerCode);
234
+ auto p = packInterleaved(up, numVecs, dims, bitsPerCode);
235
+
236
+ EXPECT_EQ(data, p);
214
237
  }
215
- }
216
- } else {
217
- // unimplemented
218
- EXPECT_TRUE(false);
219
238
  }
220
-
221
- auto up = unpackInterleaved(data, numVecs, dims, bitsPerCode);
222
- auto p = packInterleaved(up, numVecs, dims, bitsPerCode);
223
-
224
- EXPECT_EQ(data, p);
225
- }
226
239
  }
227
- }
228
240
  }
229
241
 
230
242
  TEST(TestCodePacking, InterleavedCodes_PackUnpack) {
231
- using namespace faiss::gpu;
232
-
233
- // We are fine using non-fixed seeds here, the results should be fully
234
- // deterministic
235
- std::random_device rd;
236
- std::mt19937 gen(rd());
237
- std::uniform_int_distribution<uint8_t> dist;
238
-
239
- for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
240
- for (auto dims : {1, 7, 8, 31, 32}) {
241
- for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
242
- std::cout << bitsPerCode << " " << dims << " " << numVecs << "\n";
243
-
244
- std::vector<uint8_t> data(numVecs * dims * utils::divUp(bitsPerCode, 8));
245
-
246
- if (bitsPerCode == 8 || bitsPerCode == 16 || bitsPerCode == 32) {
247
- for (auto& v : data) {
248
- v = dist(gen);
249
- }
250
- } else if (bitsPerCode < 8) {
251
- uint8_t mask = 0xff >> (8 - bitsPerCode);
252
-
253
- for (auto& v : data) {
254
- v = dist(gen) & mask;
255
- }
256
- } else {
257
- // unimplemented
258
- EXPECT_TRUE(false);
259
- }
243
+ using namespace faiss::gpu;
244
+
245
+ // We are fine using non-fixed seeds here, the results should be fully
246
+ // deterministic
247
+ std::random_device rd;
248
+ std::mt19937 gen(rd());
249
+ std::uniform_int_distribution<uint8_t> dist;
250
+
251
+ for (auto bitsPerCode : {4, 5, 6, 8, 16, 32}) {
252
+ for (auto dims : {1, 7, 8, 31, 32}) {
253
+ for (auto numVecs : {1, 3, 4, 5, 6, 8, 31, 32, 33, 65}) {
254
+ std::cout << bitsPerCode << " " << dims << " " << numVecs
255
+ << "\n";
256
+
257
+ std::vector<uint8_t> data(
258
+ numVecs * dims * utils::divUp(bitsPerCode, 8));
259
+
260
+ if (bitsPerCode == 8 || bitsPerCode == 16 ||
261
+ bitsPerCode == 32) {
262
+ for (auto& v : data) {
263
+ v = dist(gen);
264
+ }
265
+ } else if (bitsPerCode < 8) {
266
+ uint8_t mask = 0xff >> (8 - bitsPerCode);
267
+
268
+ for (auto& v : data) {
269
+ v = dist(gen) & mask;
270
+ }
271
+ } else {
272
+ // unimplemented
273
+ EXPECT_TRUE(false);
274
+ }
260
275
 
261
- auto p = packInterleaved(data, numVecs, dims, bitsPerCode);
262
- auto up = unpackInterleaved(p, numVecs, dims, bitsPerCode);
276
+ auto p = packInterleaved(data, numVecs, dims, bitsPerCode);
277
+ auto up = unpackInterleaved(p, numVecs, dims, bitsPerCode);
263
278
 
264
- EXPECT_EQ(data, up);
265
- }
279
+ EXPECT_EQ(data, up);
280
+ }
281
+ }
266
282
  }
267
- }
268
283
  }
269
284
 
270
285
  int main(int argc, char** argv) {
271
- testing::InitGoogleTest(&argc, argv);
286
+ testing::InitGoogleTest(&argc, argv);
272
287
 
273
- return RUN_ALL_TESTS();
288
+ return RUN_ALL_TESTS();
274
289
  }