Coverage Report

Created: 2025-04-29 20:56

/root/doris/be/src/util/coding.cpp
Line
Count
Source (jump to first uncovered line)
1
//  Copyright (c) 2011-present, Facebook, Inc.  All rights reserved.
2
//  This source code is licensed under both the GPLv2 (found in the
3
//  COPYING file in the root directory) and Apache 2.0 License
4
//  (found in the LICENSE.Apache file in the root directory).
5
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
6
// Use of this source code is governed by a BSD-style license that can be
7
// found in the LICENSE file. See the AUTHORS file for names of contributors.
8
9
#include "util/coding.h"
10
11
namespace doris {
12
13
34.9M
uint8_t* encode_varint32(uint8_t* dst, uint32_t v) {
14
    // Operate on characters as unsigneds
15
34.9M
    static const int B = 128;
16
34.9M
    if (v < (1 << 7)) {
17
34.6M
        *(dst++) = v;
18
34.6M
    } else if (v < (1 << 14)) {
19
231k
        *(dst++) = v | B;
20
231k
        *(dst++) = v >> 7;
21
231k
    } else if (v < (1 << 21)) {
22
71.7k
        *(dst++) = v | B;
23
71.7k
        *(dst++) = (v >> 7) | B;
24
71.7k
        *(dst++) = v >> 14;
25
18.4E
    } else if (v < (1 << 28)) {
26
5
        *(dst++) = v | B;
27
5
        *(dst++) = (v >> 7) | B;
28
5
        *(dst++) = (v >> 14) | B;
29
5
        *(dst++) = v >> 21;
30
18.4E
    } else {
31
18.4E
        *(dst++) = v | B;
32
18.4E
        *(dst++) = (v >> 7) | B;
33
18.4E
        *(dst++) = (v >> 14) | B;
34
18.4E
        *(dst++) = (v >> 21) | B;
35
18.4E
        *(dst++) = v >> 28;
36
18.4E
    }
37
34.9M
    return dst;
38
34.9M
}
39
40
const uint8_t* decode_varint32_ptr_fallback(const uint8_t* p, const uint8_t* limit,
41
192k
                                            uint32_t* value) {
42
192k
    uint32_t result = 0;
43
439k
    for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) {
44
439k
        uint32_t byte = *p;
45
439k
        p++;
46
439k
        if (byte & 128) {
47
            // More bytes are present
48
246k
            result |= ((byte & 127) << shift);
49
246k
        } else {
50
192k
            result |= (byte << shift);
51
192k
            *value = result;
52
192k
            return p;
53
192k
        }
54
439k
    }
55
18.4E
    return nullptr;
56
192k
}
57
58
124k
const uint8_t* decode_varint64_ptr(const uint8_t* p, const uint8_t* limit, uint64_t* value) {
59
124k
    uint64_t result = 0;
60
452k
    for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) {
61
452k
        uint64_t byte = *p;
62
452k
        p++;
63
452k
        if (byte & 128) {
64
            // More bytes are present
65
327k
            result |= ((byte & 127) << shift);
66
327k
        } else {
67
124k
            result |= (byte << shift);
68
124k
            *value = result;
69
124k
            return p;
70
124k
        }
71
452k
    }
72
0
    return nullptr;
73
124k
}
74
75
} // namespace doris