aboutsummaryrefslogtreecommitdiffstats
path: root/searchlib/src/vespa/searchlib/diskindex/zcbuf.h
blob: b3c835b1d56368edfcfc0317c9311462101c5949 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.

#pragma once

#include <cstdint>
#include <cstddef>

namespace search::diskindex {

/*
 * Class containing Zc-encoded data in a memory buffer, typically
 * docid deltas and skip information for posting lists.
 */
class ZcBuf
{
public:
    uint8_t *_valI;
    uint8_t *_valE;
    uint8_t *_mallocStart;
    size_t _mallocSize;

    ZcBuf();
    ~ZcBuf();

    static size_t zcSlack() { return 4; }
    void clearReserve(size_t reserveSize);
    void clear() { _valI = _mallocStart; }
    size_t capacity() const { return _valE - _mallocStart; }
    size_t size() const { return _valI - _mallocStart; }
    size_t pos() const { return _valI - _mallocStart; }
    void expand();

    void maybeExpand() {
        if (__builtin_expect(_valI >= _valE, false)) {
            expand();
        }
    }

    void encode(uint32_t num) {
        for (;;) {
            if (num < (1 << 7)) {
                *_valI++ = num;
                break;
            }
            *_valI++ = (num & ((1 << 7) - 1)) | (1 << 7);
            num >>= 7;
        }
        maybeExpand();
    }

    uint32_t decode() {
        uint32_t res;
        uint8_t *valI = _valI;
        if (__builtin_expect(valI[0] < (1 << 7), true)) {
            res = valI[0];
            valI += 1;
        } else if (__builtin_expect(valI[1] < (1 << 7), true)) {
            res = (valI[0] & ((1 << 7) - 1)) +
                  (valI[1] << 7);
            valI += 2;
        } else if (__builtin_expect(valI[2] < (1 << 7), true)) {
            res = (valI[0] & ((1 << 7) - 1)) +
                  ((valI[1] & ((1 << 7) - 1)) << 7) +
                  (valI[2] << 14);
            valI += 3;
        } else if (__builtin_expect(valI[3] < (1 << 7), true)) {
            res = (valI[0] & ((1 << 7) - 1)) +
                  ((valI[1] & ((1 << 7) - 1)) << 7) +
                  ((valI[2] & ((1 << 7) - 1)) << 14) +
                  (valI[3] << 21);
            valI += 4;
        } else {
            res = (valI[0] & ((1 << 7) - 1)) +
                  ((valI[1] & ((1 << 7) - 1)) << 7) +
                  ((valI[2] & ((1 << 7) - 1)) << 14) +
                  ((valI[3] & ((1 << 7) - 1)) << 21) +
                  (valI[4] << 28);
            valI += 5;
        }
        _valI = valI;
        return res;
    }
};

}