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 | | |
13 | 40.2M | uint8_t* encode_varint32(uint8_t* dst, uint32_t v) { |
14 | | // Operate on characters as unsigneds |
15 | 40.2M | static const int B = 128; |
16 | 40.2M | if (v < (1 << 7)) { |
17 | 39.2M | *(dst++) = uint8_t(v); |
18 | 39.2M | } else if (v < (1 << 14)) { |
19 | 917k | *(dst++) = uint8_t(v | B); |
20 | 917k | *(dst++) = uint8_t(v >> 7); |
21 | 917k | } else if (v < (1 << 21)) { |
22 | 42.5k | *(dst++) = uint8_t(v | B); |
23 | 42.5k | *(dst++) = uint8_t((v >> 7) | B); |
24 | 42.5k | *(dst++) = uint8_t(v >> 14); |
25 | 18.4E | } else if (v < (1 << 28)) { |
26 | 3 | *(dst++) = uint8_t(v | B); |
27 | 3 | *(dst++) = uint8_t((v >> 7) | B); |
28 | 3 | *(dst++) = uint8_t((v >> 14) | B); |
29 | 3 | *(dst++) = uint8_t(v >> 21); |
30 | 18.4E | } else { |
31 | 18.4E | *(dst++) = uint8_t(v | B); |
32 | 18.4E | *(dst++) = uint8_t((v >> 7) | B); |
33 | 18.4E | *(dst++) = uint8_t((v >> 14) | B); |
34 | 18.4E | *(dst++) = uint8_t((v >> 21) | B); |
35 | 18.4E | *(dst++) = uint8_t(v >> 28); |
36 | 18.4E | } |
37 | 40.2M | return dst; |
38 | 40.2M | } |
39 | | |
40 | | const uint8_t* decode_varint32_ptr_fallback(const uint8_t* p, const uint8_t* limit, |
41 | 714k | uint32_t* value) { |
42 | 714k | uint32_t result = 0; |
43 | 1.56M | for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) { |
44 | 1.56M | uint32_t byte = *p; |
45 | 1.56M | p++; |
46 | 1.56M | if (byte & 128) { |
47 | | // More bytes are present |
48 | 850k | result |= ((byte & 127) << shift); |
49 | 850k | } else { |
50 | 714k | result |= (byte << shift); |
51 | 714k | *value = result; |
52 | 714k | return p; |
53 | 714k | } |
54 | 1.56M | } |
55 | 18.4E | return nullptr; |
56 | 714k | } |
57 | | |
58 | 243k | const uint8_t* decode_varint64_ptr(const uint8_t* p, const uint8_t* limit, uint64_t* value) { |
59 | 243k | uint64_t result = 0; |
60 | 858k | for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) { |
61 | 858k | uint64_t byte = *p; |
62 | 858k | p++; |
63 | 858k | if (byte & 128) { |
64 | | // More bytes are present |
65 | 614k | result |= ((byte & 127) << shift); |
66 | 614k | } else { |
67 | 243k | result |= (byte << shift); |
68 | 243k | *value = result; |
69 | 243k | return p; |
70 | 243k | } |
71 | 858k | } |
72 | 18.4E | return nullptr; |
73 | 243k | } |
74 | | } // namespace doris |