]> git.sesse.net Git - plocate/blob - plocate-build.cpp
Fix some Valgrind issues in plocate-build.
[plocate] / plocate-build.cpp
1 #include "db.h"
2 #include "turbopfor-encode.h"
3
4 #include <algorithm>
5 #include <arpa/inet.h>
6 #include <assert.h>
7 #include <chrono>
8 #include <endian.h>
9 #include <fcntl.h>
10 #include <math.h>
11 #include <memory>
12 #include <stdio.h>
13 #include <string.h>
14 #include <string>
15 #include <sys/stat.h>
16 #include <sys/types.h>
17 #include <unistd.h>
18 #include <unordered_map>
19 #include <vector>
20 #include <zstd.h>
21
22 #define P4NENC_BOUND(n) ((n + 127) / 128 + (n + 32) * sizeof(uint32_t))
23 #define dprintf(...)
24 //#define dprintf(...) fprintf(stderr, __VA_ARGS__);
25
26 #define NUM_TRIGRAMS 16777216
27
28 using namespace std;
29 using namespace std::chrono;
30
31 string zstd_compress(const string &src, string *tempbuf);
32
33 constexpr unsigned num_overflow_slots = 16;
34
35 static inline uint32_t read_unigram(const string_view s, size_t idx)
36 {
37         if (idx < s.size()) {
38                 return (unsigned char)s[idx];
39         } else {
40                 return 0;
41         }
42 }
43
44 static inline uint32_t read_trigram(const string_view s, size_t start)
45 {
46         return read_unigram(s, start) |
47                 (read_unigram(s, start + 1) << 8) |
48                 (read_unigram(s, start + 2) << 16);
49 }
50
51 enum {
52         DBE_NORMAL = 0, /* A non-directory file */
53         DBE_DIRECTORY = 1, /* A directory */
54         DBE_END = 2 /* End of directory contents; contains no name */
55 };
56
57 // From mlocate.
58 struct db_header {
59         uint8_t magic[8];
60         uint32_t conf_size;
61         uint8_t version;
62         uint8_t check_visibility;
63         uint8_t pad[2];
64 };
65
66 // From mlocate.
67 struct db_directory {
68         uint64_t time_sec;
69         uint32_t time_nsec;
70         uint8_t pad[4];
71 };
72
73 class PostingListBuilder {
74 public:
75         inline void add_docid(uint32_t docid);
76         void finish();
77
78         string encoded;
79         size_t num_docids = 0;
80
81 private:
82         void write_header(uint32_t docid);
83         void append_block();
84
85         vector<uint32_t> pending_deltas;
86
87         uint32_t last_block_end, last_docid = -1;
88 };
89
90 void PostingListBuilder::add_docid(uint32_t docid)
91 {
92         // Deduplicate against the last inserted value, if any.
93         if (docid == last_docid) {
94                 return;
95         }
96
97         if (num_docids == 0) {
98                 // Very first docid.
99                 write_header(docid);
100                 ++num_docids;
101                 last_block_end = last_docid = docid;
102                 return;
103         }
104
105         pending_deltas.push_back(docid - last_docid - 1);
106         last_docid = docid;
107         if (pending_deltas.size() == 128) {
108                 append_block();
109                 pending_deltas.clear();
110                 last_block_end = docid;
111         }
112         ++num_docids;
113 }
114
115 void PostingListBuilder::finish()
116 {
117         if (pending_deltas.empty()) {
118                 return;
119         }
120
121         assert(!encoded.empty());  // write_header() should already have run.
122
123         // No interleaving for partial blocks.
124         unsigned char buf[P4NENC_BOUND(128)];
125         unsigned char *end = encode_pfor_single_block<128>(pending_deltas.data(), pending_deltas.size(), /*interleaved=*/false, buf);
126         encoded.append(reinterpret_cast<char *>(buf), reinterpret_cast<char *>(end));
127 }
128
129 void PostingListBuilder::append_block()
130 {
131         unsigned char buf[P4NENC_BOUND(128)];
132         assert(pending_deltas.size() == 128);
133         unsigned char *end = encode_pfor_single_block<128>(pending_deltas.data(), 128, /*interleaved=*/true, buf);
134         encoded.append(reinterpret_cast<char *>(buf), reinterpret_cast<char *>(end));
135 }
136
137 void PostingListBuilder::write_header(uint32_t docid)
138 {
139         unsigned char buf[P4NENC_BOUND(1)];
140         unsigned char *end = write_baseval(docid, buf);
141         encoded.append(reinterpret_cast<char *>(buf), end - buf);
142 }
143
144 class Corpus {
145 public:
146         Corpus(FILE *outfp, size_t block_size)
147                 : invindex(new PostingListBuilder *[NUM_TRIGRAMS]), outfp(outfp), block_size(block_size) {
148                 fill(invindex.get(), invindex.get() + NUM_TRIGRAMS, nullptr);
149         }
150         void add_file(string filename);
151         void flush_block();
152
153         vector<uint64_t> filename_blocks;
154         size_t num_files = 0, num_files_in_block = 0, num_blocks = 0;
155         bool seen_trigram(uint32_t trgm)
156         {
157                 return invindex[trgm] != nullptr;
158         }
159         PostingListBuilder &get_pl_builder(uint32_t trgm)
160         {
161                 if (invindex[trgm] == nullptr) {
162                         invindex[trgm] = new PostingListBuilder;
163                 }
164                 return *invindex[trgm];
165         }
166
167 private:
168         unique_ptr<PostingListBuilder *[]> invindex;
169         FILE *outfp;
170         string current_block;
171         string tempbuf;
172         const size_t block_size;
173 };
174
175 void Corpus::add_file(string filename)
176 {
177         ++num_files;
178         if (!current_block.empty()) {
179                 current_block.push_back('\0');
180         }
181         current_block += filename;
182         if (++num_files_in_block == block_size) {
183                 flush_block();
184         }
185 }
186
187 void Corpus::flush_block()
188 {
189         if (current_block.empty()) {
190                 return;
191         }
192
193         uint32_t docid = num_blocks;
194
195         // Create trigrams.
196         const char *ptr = current_block.c_str();
197         while (ptr < current_block.c_str() + current_block.size()) {
198                 string_view s(ptr);
199                 if (s.size() >= 3) {
200                         for (size_t j = 0; j < s.size() - 2; ++j) {
201                                 uint32_t trgm = read_trigram(s, j);
202                                 get_pl_builder(trgm).add_docid(docid);
203                         }
204                 }
205                 ptr += s.size() + 1;
206         }
207
208         // Compress and add the filename block.
209         filename_blocks.push_back(ftell(outfp));
210         string compressed = zstd_compress(current_block, &tempbuf);
211         if (fwrite(compressed.data(), compressed.size(), 1, outfp) != 1) {
212                 perror("fwrite()");
213                 exit(1);
214         }
215
216         current_block.clear();
217         num_files_in_block = 0;
218         ++num_blocks;
219 }
220
221 string read_cstr(FILE *fp)
222 {
223         string ret;
224         for (;;) {
225                 int ch = getc(fp);
226                 if (ch == -1) {
227                         perror("getc");
228                         exit(1);
229                 }
230                 if (ch == 0) {
231                         return ret;
232                 }
233                 ret.push_back(ch);
234         }
235 }
236
237 void handle_directory(FILE *fp, Corpus *corpus)
238 {
239         db_directory dummy;
240         if (fread(&dummy, sizeof(dummy), 1, fp) != 1) {
241                 if (feof(fp)) {
242                         return;
243                 } else {
244                         perror("fread");
245                 }
246         }
247
248         string dir_path = read_cstr(fp);
249         if (dir_path == "/") {
250                 dir_path = "";
251         }
252
253         for (;;) {
254                 int type = getc(fp);
255                 if (type == DBE_NORMAL) {
256                         string filename = read_cstr(fp);
257                         corpus->add_file(dir_path + "/" + filename);
258                 } else if (type == DBE_DIRECTORY) {
259                         string dirname = read_cstr(fp);
260                         corpus->add_file(dir_path + "/" + dirname);
261                 } else {
262                         return;  // Probably end.
263                 }
264         }
265 }
266
267 void read_mlocate(const char *filename, Corpus *corpus)
268 {
269         FILE *fp = fopen(filename, "rb");
270         if (fp == nullptr) {
271                 perror(filename);
272                 exit(1);
273         }
274
275         db_header hdr;
276         if (fread(&hdr, sizeof(hdr), 1, fp) != 1) {
277                 perror("short read");
278                 exit(1);
279         }
280
281         // TODO: Care about the base path.
282         string path = read_cstr(fp);
283         while (!feof(fp)) {
284                 handle_directory(fp, corpus);
285         }
286         fclose(fp);
287 }
288
289 string zstd_compress(const string &src, string *tempbuf)
290 {
291         size_t max_size = ZSTD_compressBound(src.size());
292         if (tempbuf->size() < max_size) {
293                 tempbuf->resize(max_size);
294         }
295         size_t size = ZSTD_compress(&(*tempbuf)[0], max_size, src.data(), src.size(), /*level=*/6);
296         return string(tempbuf->data(), size);
297 }
298
299 bool is_prime(uint32_t x)
300 {
301         if ((x % 2) == 0 || (x % 3) == 0) {
302                 return false;
303         }
304         uint32_t limit = ceil(sqrt(x));
305         for (uint32_t factor = 5; factor <= limit; ++factor) {
306                 if ((x % factor) == 0) {
307                         return false;
308                 }
309         }
310         return true;
311 }
312
313 uint32_t next_prime(uint32_t x)
314 {
315         if ((x % 2) == 0) {
316                 ++x;
317         }
318         while (!is_prime(x)) {
319                 x += 2;
320         }
321         return x;
322 }
323
324 unique_ptr<Trigram[]> create_hashtable(Corpus &corpus, const vector<uint32_t> &all_trigrams, uint32_t ht_size, uint32_t num_overflow_slots)
325 {
326         unique_ptr<Trigram[]> ht(new Trigram[ht_size + num_overflow_slots + 1]);  // 1 for the sentinel element at the end.
327         for (unsigned i = 0; i < ht_size + num_overflow_slots + 1; ++i) {
328                 ht[i].trgm = uint32_t(-1);
329                 ht[i].num_docids = 0;
330                 ht[i].offset = 0;
331         }
332         for (uint32_t trgm : all_trigrams) {
333                 // We don't know offset yet, so set it to zero.
334                 Trigram to_insert{ trgm, uint32_t(corpus.get_pl_builder(trgm).num_docids), 0 };
335
336                 uint32_t bucket = hash_trigram(trgm, ht_size);
337                 unsigned distance = 0;
338                 while (ht[bucket].num_docids != 0) {
339                         // Robin Hood hashing; reduces the longest distance by a lot.
340                         unsigned other_distance = bucket - hash_trigram(ht[bucket].trgm, ht_size);
341                         if (distance > other_distance) {
342                                 swap(to_insert, ht[bucket]);
343                                 distance = other_distance;
344                         }
345
346                         ++bucket, ++distance;
347                         if (distance > num_overflow_slots) {
348                                 return nullptr;
349                         }
350                 }
351                 ht[bucket] = to_insert;
352         }
353         return ht;
354 }
355
356 void do_build(const char *infile, const char *outfile, int block_size)
357 {
358         steady_clock::time_point start __attribute__((unused)) = steady_clock::now();
359
360         umask(0027);
361         FILE *outfp = fopen(outfile, "wb");
362
363         // Write the header.
364         Header hdr;
365         memcpy(hdr.magic, "\0plocate", 8);
366         hdr.version = -1;  // Mark as broken.
367         hdr.hashtable_size = 0;  // Not known yet.
368         hdr.extra_ht_slots = num_overflow_slots;
369         hdr.num_docids = 0;
370         hdr.hash_table_offset_bytes = -1;  // We don't know these offsets yet.
371         hdr.filename_index_offset_bytes = -1;
372         fwrite(&hdr, sizeof(hdr), 1, outfp);
373
374         Corpus corpus(outfp, block_size);
375
376         read_mlocate(infile, &corpus);
377         if (false) {  // To read a plain text file.
378                 FILE *fp = fopen(infile, "r");
379                 while (!feof(fp)) {
380                         char buf[1024];
381                         if (fgets(buf, 1024, fp) == nullptr || feof(fp)) {
382                                 break;
383                         }
384                         string s(buf);
385                         if (s.back() == '\n')
386                                 s.pop_back();
387                         corpus.add_file(move(s));
388                 }
389                 fclose(fp);
390         }
391         corpus.flush_block();
392         dprintf("Read %zu files from %s\n", corpus.num_files, infile);
393         hdr.num_docids = corpus.filename_blocks.size();
394
395         // Stick an empty block at the end as sentinel.
396         corpus.filename_blocks.push_back(ftell(outfp));
397         const size_t bytes_for_filenames = corpus.filename_blocks.back() - corpus.filename_blocks.front();
398
399         // Write the offsets to the filenames.
400         hdr.filename_index_offset_bytes = ftell(outfp);
401         const size_t bytes_for_filename_index = corpus.filename_blocks.size() * sizeof(uint64_t);
402         fwrite(corpus.filename_blocks.data(), corpus.filename_blocks.size(), sizeof(uint64_t), outfp);
403         corpus.filename_blocks.clear();
404         corpus.filename_blocks.shrink_to_fit();
405
406         // Finish up encoding the posting lists.
407         size_t trigrams = 0, longest_posting_list = 0;
408         size_t bytes_for_posting_lists = 0;
409         for (unsigned trgm = 0; trgm < NUM_TRIGRAMS; ++trgm) {
410                 if (!corpus.seen_trigram(trgm))
411                         continue;
412                 PostingListBuilder &pl_builder = corpus.get_pl_builder(trgm);
413                 pl_builder.finish();
414                 longest_posting_list = max(longest_posting_list, pl_builder.num_docids);
415                 trigrams += pl_builder.num_docids;
416                 bytes_for_posting_lists += pl_builder.encoded.size();
417         }
418         dprintf("%zu files, %zu different trigrams, %zu entries, avg len %.2f, longest %zu\n",
419                 corpus.num_files, corpus.invindex.size(), trigrams, double(trigrams) / corpus.invindex.size(), longest_posting_list);
420         dprintf("%zu bytes used for posting lists (%.2f bits/entry)\n", bytes_for_posting_lists, 8 * bytes_for_posting_lists / double(trigrams));
421
422         dprintf("Building posting lists took %.1f ms.\n\n", 1e3 * duration<float>(steady_clock::now() - start).count());
423
424         // Find the used trigrams.
425         vector<uint32_t> all_trigrams;
426         for (unsigned trgm = 0; trgm < NUM_TRIGRAMS; ++trgm) {
427                 if (corpus.seen_trigram(trgm)) {
428                         all_trigrams.push_back(trgm);
429                 }
430         }
431
432         // Create the hash table.
433         unique_ptr<Trigram[]> hashtable;
434         uint32_t ht_size = next_prime(all_trigrams.size());
435         for (;;) {
436                 hashtable = create_hashtable(corpus, all_trigrams, ht_size, num_overflow_slots);
437                 if (hashtable == nullptr) {
438                         dprintf("Failed creating hash table of size %u, increasing by 5%% and trying again.\n", ht_size);
439                         ht_size = next_prime(ht_size * 1.05);
440                 } else {
441                         dprintf("Created hash table of size %u.\n\n", ht_size);
442                         break;
443                 }
444         }
445
446         // Find the offsets for each posting list.
447         size_t bytes_for_hashtable = (ht_size + num_overflow_slots + 1) * sizeof(Trigram);
448         uint64_t offset = ftell(outfp) + bytes_for_hashtable;
449         for (unsigned i = 0; i < ht_size + num_overflow_slots + 1; ++i) {
450                 hashtable[i].offset = offset;  // Needs to be there even for empty slots.
451                 if (hashtable[i].num_docids == 0) {
452                         continue;
453                 }
454
455                 const string &encoded = corpus.get_pl_builder(hashtable[i].trgm).encoded;
456                 offset += encoded.size();
457         }
458
459         // Write the hash table.
460         hdr.hash_table_offset_bytes = ftell(outfp);
461         hdr.hashtable_size = ht_size;
462         fwrite(hashtable.get(), ht_size + num_overflow_slots + 1, sizeof(Trigram), outfp);
463
464         // Write the actual posting lists.
465         for (unsigned i = 0; i < ht_size + num_overflow_slots + 1; ++i) {
466                 if (hashtable[i].num_docids == 0) {
467                         continue;
468                 }
469                 const string &encoded = corpus.get_pl_builder(hashtable[i].trgm).encoded;
470                 fwrite(encoded.data(), encoded.size(), 1, outfp);
471         }
472
473         // Rewind, and write the updated header.
474         hdr.version = 0;
475         fseek(outfp, 0, SEEK_SET);
476         fwrite(&hdr, sizeof(hdr), 1, outfp);
477         fclose(outfp);
478
479         size_t total_bytes __attribute__((unused)) = (bytes_for_hashtable + bytes_for_posting_lists + bytes_for_filename_index + bytes_for_filenames);
480
481         dprintf("Block size:     %7d files\n", block_size);
482         dprintf("Hash table:     %'7.1f MB\n", bytes_for_hashtable / 1048576.0);
483         dprintf("Posting lists:  %'7.1f MB\n", bytes_for_posting_lists / 1048576.0);
484         dprintf("Filename index: %'7.1f MB\n", bytes_for_filename_index / 1048576.0);
485         dprintf("Filenames:      %'7.1f MB\n", bytes_for_filenames / 1048576.0);
486         dprintf("Total:          %'7.1f MB\n", total_bytes / 1048576.0);
487         dprintf("\n");
488 }
489
490 int main(int argc, char **argv)
491 {
492         do_build(argv[1], argv[2], 32);
493         exit(EXIT_SUCCESS);
494 }