Coverage Report

Created: 2025-09-20 15:26

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
35.3M
uint8_t* encode_varint32(uint8_t* dst, uint32_t v) {
15
    // Operate on characters as unsigneds
16
35.3M
    static const int B = 128;
17
35.3M
    if (v < (1 << 7)) {
18
35.0M
        *(dst++) = uint8_t(v);
19
35.0M
    } else if (v < (1 << 14)) {
20
239k
        *(dst++) = uint8_t(v | B);
21
239k
        *(dst++) = uint8_t(v >> 7);
22
239k
    } else if (v < (1 << 21)) {
23
100k
        *(dst++) = uint8_t(v | B);
24
100k
        *(dst++) = uint8_t((v >> 7) | B);
25
100k
        *(dst++) = uint8_t(v >> 14);
26
18.4E
    } else if (v < (1 << 28)) {
27
4
        *(dst++) = uint8_t(v | B);
28
4
        *(dst++) = uint8_t((v >> 7) | B);
29
4
        *(dst++) = uint8_t((v >> 14) | B);
30
4
        *(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
35.3M
    return dst;
39
35.3M
}
40
41
const uint8_t* decode_varint32_ptr_fallback(const uint8_t* p, const uint8_t* limit,
42
6.72M
                                            uint32_t* value) {
43
6.72M
    uint32_t result = 0;
44
14.0M
    for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) {
45
14.0M
        uint32_t byte = *p;
46
14.0M
        p++;
47
14.0M
        if (byte & 128) {
48
            // More bytes are present
49
7.34M
            result |= ((byte & 127) << shift);
50
7.34M
        } else {
51
6.73M
            result |= (byte << shift);
52
6.73M
            *value = result;
53
6.73M
            return p;
54
6.73M
        }
55
14.0M
    }
56
18.4E
    return nullptr;
57
6.72M
}
58
59
6.08M
const uint8_t* decode_varint64_ptr(const uint8_t* p, const uint8_t* limit, uint64_t* value) {
60
6.08M
    uint64_t result = 0;
61
18.6M
    for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) {
62
18.6M
        uint64_t byte = *p;
63
18.6M
        p++;
64
18.6M
        if (byte & 128) {
65
            // More bytes are present
66
12.5M
            result |= ((byte & 127) << shift);
67
12.5M
        } else {
68
6.08M
            result |= (byte << shift);
69
6.08M
            *value = result;
70
6.08M
            return p;
71
6.08M
        }
72
18.6M
    }
73
18.4E
    return nullptr;
74
6.08M
}
75
#include "common/compile_check_end.h"
76
} // namespace doris