Coverage Report

Created: 2025-11-14 17:29

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/root/doris/be/src/util/coding.cpp
Line
Count
Source
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
#include "common/compile_check_begin.h"
13
14
34.0M
uint8_t* encode_varint32(uint8_t* dst, uint32_t v) {
15
    // Operate on characters as unsigneds
16
34.0M
    static const int B = 128;
17
34.0M
    if (v < (1 << 7)) {
18
33.7M
        *(dst++) = uint8_t(v);
19
33.7M
    } else if (v < (1 << 14)) {
20
240k
        *(dst++) = uint8_t(v | B);
21
240k
        *(dst++) = uint8_t(v >> 7);
22
240k
    } else if (v < (1 << 21)) {
23
79.1k
        *(dst++) = uint8_t(v | B);
24
79.1k
        *(dst++) = uint8_t((v >> 7) | B);
25
79.1k
        *(dst++) = uint8_t(v >> 14);
26
18.4E
    } else if (v < (1 << 28)) {
27
1
        *(dst++) = uint8_t(v | B);
28
1
        *(dst++) = uint8_t((v >> 7) | B);
29
1
        *(dst++) = uint8_t((v >> 14) | B);
30
1
        *(dst++) = uint8_t(v >> 21);
31
18.4E
    } else {
32
18.4E
        *(dst++) = uint8_t(v | B);
33
18.4E
        *(dst++) = uint8_t((v >> 7) | B);
34
18.4E
        *(dst++) = uint8_t((v >> 14) | B);
35
18.4E
        *(dst++) = uint8_t((v >> 21) | B);
36
18.4E
        *(dst++) = uint8_t(v >> 28);
37
18.4E
    }
38
34.0M
    return dst;
39
34.0M
}
40
41
const uint8_t* decode_varint32_ptr_fallback(const uint8_t* p, const uint8_t* limit,
42
5.33M
                                            uint32_t* value) {
43
5.33M
    uint32_t result = 0;
44
11.1M
    for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) {
45
11.0M
        uint32_t byte = *p;
46
11.0M
        p++;
47
11.0M
        if (byte & 128) {
48
            // More bytes are present
49
5.84M
            result |= ((byte & 127) << shift);
50
5.84M
        } else {
51
5.21M
            result |= (byte << shift);
52
5.21M
            *value = result;
53
5.21M
            return p;
54
5.21M
        }
55
11.0M
    }
56
118k
    return nullptr;
57
5.33M
}
58
59
4.54M
const uint8_t* decode_varint64_ptr(const uint8_t* p, const uint8_t* limit, uint64_t* value) {
60
4.54M
    uint64_t result = 0;
61
14.7M
    for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) {
62
14.5M
        uint64_t byte = *p;
63
14.5M
        p++;
64
14.5M
        if (byte & 128) {
65
            // More bytes are present
66
10.1M
            result |= ((byte & 127) << shift);
67
10.1M
        } else {
68
4.34M
            result |= (byte << shift);
69
4.34M
            *value = result;
70
4.34M
            return p;
71
4.34M
        }
72
14.5M
    }
73
199k
    return nullptr;
74
4.54M
}
75
#include "common/compile_check_end.h"
76
} // namespace doris