/root/doris/be/src/util/coding.h
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 | | #pragma once |
10 | | |
11 | | #include <bit> |
12 | | |
13 | | #ifndef __APPLE__ |
14 | | #include <endian.h> |
15 | | #endif |
16 | | #include <stdint.h> |
17 | | #include <string.h> |
18 | | |
19 | | #include "olap/olap_common.h" |
20 | | #include "util/slice.h" |
21 | | #include "vec/common/endian.h" |
22 | | |
23 | | namespace doris { |
24 | | |
25 | | // TODO(zc): add encode big endian later when we need it |
26 | | // use big endian when we have order requirement. |
27 | | // little endian is more efficient when we use X86 CPU, so |
28 | | // when we have no order needs, we prefer little endian encoding |
29 | | inline void encode_fixed8(uint8_t* buf, uint8_t val) { |
30 | | *buf = val; |
31 | | } |
32 | | |
33 | 985 | inline void encode_fixed16_le(uint8_t* buf, uint16_t val) { |
34 | 985 | val = to_endian<std::endian::little>(val); |
35 | 985 | memcpy(buf, &val, sizeof(val)); |
36 | 985 | } |
37 | | |
38 | 443k | inline void encode_fixed32_le(uint8_t* buf, uint32_t val) { |
39 | 443k | val = to_endian<std::endian::little>(val); |
40 | 443k | memcpy(buf, &val, sizeof(val)); |
41 | 443k | } |
42 | | |
43 | 80.9k | inline void encode_fixed64_le(uint8_t* buf, uint64_t val) { |
44 | 80.9k | val = to_endian<std::endian::little>(val); |
45 | 80.9k | memcpy(buf, &val, sizeof(val)); |
46 | 80.9k | } |
47 | | |
48 | 24.4k | inline void encode_fixed128_le(uint8_t* buf, uint128_t val) { |
49 | 24.4k | val = to_endian<std::endian::little>(val); |
50 | 24.4k | memcpy(buf, &val, sizeof(val)); |
51 | 24.4k | } |
52 | | |
53 | 131k | inline uint8_t decode_fixed8(const uint8_t* buf) { |
54 | 131k | return *buf; |
55 | 131k | } |
56 | | |
57 | 47.5k | inline uint16_t decode_fixed16_le(const uint8_t* buf) { |
58 | 47.5k | uint16_t res; |
59 | 47.5k | memcpy(&res, buf, sizeof(res)); |
60 | 47.5k | return to_endian<std::endian::little>(res); |
61 | 47.5k | } |
62 | | |
63 | 636k | inline uint32_t decode_fixed32_le(const uint8_t* buf) { |
64 | 636k | uint32_t res; |
65 | 636k | memcpy(&res, buf, sizeof(res)); |
66 | 636k | return to_endian<std::endian::little>(res); |
67 | 636k | } |
68 | | |
69 | 330M | inline uint64_t decode_fixed64_le(const uint8_t* buf) { |
70 | 330M | uint64_t res; |
71 | 330M | memcpy(&res, buf, sizeof(res)); |
72 | 330M | return to_endian<std::endian::little>(res); |
73 | 330M | } |
74 | | |
75 | 24.4k | inline uint128_t decode_fixed128_le(const uint8_t* buf) { |
76 | 24.4k | uint128_t res; |
77 | 24.4k | memcpy(&res, buf, sizeof(res)); |
78 | 24.4k | return to_endian<std::endian::little>(res); |
79 | 24.4k | } |
80 | | |
81 | | template <typename T> |
82 | 317k | void put_fixed32_le(T* dst, uint32_t val) { |
83 | 317k | uint8_t buf[sizeof(val)]; |
84 | 317k | encode_fixed32_le(buf, val); |
85 | 317k | dst->append((char*)buf, sizeof(buf)); |
86 | 317k | } _ZN5doris14put_fixed32_leINS_10faststringEEEvPT_j Line | Count | Source | 82 | 270k | void put_fixed32_le(T* dst, uint32_t val) { | 83 | 270k | uint8_t buf[sizeof(val)]; | 84 | 270k | encode_fixed32_le(buf, val); | 85 | 270k | dst->append((char*)buf, sizeof(buf)); | 86 | 270k | } |
_ZN5doris14put_fixed32_leINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEEvPT_j Line | Count | Source | 82 | 47.9k | void put_fixed32_le(T* dst, uint32_t val) { | 83 | 47.9k | uint8_t buf[sizeof(val)]; | 84 | 47.9k | encode_fixed32_le(buf, val); | 85 | 47.9k | dst->append((char*)buf, sizeof(buf)); | 86 | 47.9k | } |
|
87 | | |
88 | | template <typename T> |
89 | 25.4k | void put_fixed64_le(T* dst, uint64_t val) { |
90 | 25.4k | uint8_t buf[sizeof(val)]; |
91 | 25.4k | encode_fixed64_le(buf, val); |
92 | 25.4k | dst->append((char*)buf, sizeof(buf)); |
93 | 25.4k | } _ZN5doris14put_fixed64_leINSt7__cxx1112basic_stringIcSt11char_traitsIcESaIcEEEEEvPT_m Line | Count | Source | 89 | 939 | void put_fixed64_le(T* dst, uint64_t val) { | 90 | 939 | uint8_t buf[sizeof(val)]; | 91 | 939 | encode_fixed64_le(buf, val); | 92 | 939 | dst->append((char*)buf, sizeof(buf)); | 93 | 939 | } |
_ZN5doris14put_fixed64_leINS_10faststringEEEvPT_m Line | Count | Source | 89 | 24.4k | void put_fixed64_le(T* dst, uint64_t val) { | 90 | 24.4k | uint8_t buf[sizeof(val)]; | 91 | 24.4k | encode_fixed64_le(buf, val); | 92 | 24.4k | dst->append((char*)buf, sizeof(buf)); | 93 | 24.4k | } |
|
94 | | |
95 | | // Returns the length of the varint32 or varint64 encoding of "v" |
96 | 13 | inline int varint_length(uint64_t v) { |
97 | 13 | int len = 1; |
98 | 13 | while (v >= 128) { |
99 | 0 | v >>= 7; |
100 | 0 | len++; |
101 | 0 | } |
102 | 13 | return len; |
103 | 13 | } |
104 | | |
105 | | template <typename T> |
106 | 24.4k | void put_fixed128_le(T* dst, uint128_t val) { |
107 | 24.4k | uint8_t buf[sizeof(val)]; |
108 | 24.4k | encode_fixed128_le(buf, val); |
109 | 24.4k | dst->append((char*)buf, sizeof(buf)); |
110 | 24.4k | } |
111 | | |
112 | | extern uint8_t* encode_varint32(uint8_t* dst, uint32_t value); |
113 | | extern uint8_t* encode_varint64(uint8_t* dst, uint64_t value); |
114 | | |
115 | 53.3k | inline uint8_t* encode_varint64(uint8_t* dst, uint64_t v) { |
116 | 53.3k | static const unsigned int B = 128; |
117 | 146k | while (v >= B) { |
118 | | // Fetch low seven bits from current v, and the eight bit is marked as compression mark. |
119 | | // v | B is optimised from (v & (B-1)) | B, because result is assigned to uint8_t and other bits |
120 | | // is cleared by implicit conversion. |
121 | 92.7k | *(dst++) = v | B; |
122 | 92.7k | v >>= 7; |
123 | 92.7k | } |
124 | 53.3k | *(dst++) = static_cast<unsigned char>(v); |
125 | 53.3k | return dst; |
126 | 53.3k | } |
127 | | |
128 | | extern const uint8_t* decode_varint32_ptr_fallback(const uint8_t* p, const uint8_t* limit, |
129 | | uint32_t* value); |
130 | | |
131 | | inline const uint8_t* decode_varint32_ptr(const uint8_t* ptr, const uint8_t* limit, |
132 | 511k | uint32_t* value) { |
133 | 511k | if (ptr < limit) { |
134 | 511k | uint32_t result = *ptr; |
135 | 511k | if ((result & 128) == 0) { |
136 | 482k | *value = result; |
137 | 482k | return ptr + 1; |
138 | 482k | } |
139 | 511k | } |
140 | 29.0k | return decode_varint32_ptr_fallback(ptr, limit, value); |
141 | 511k | } |
142 | | |
143 | | extern const uint8_t* decode_varint64_ptr(const uint8_t* p, const uint8_t* limit, uint64_t* value); |
144 | | |
145 | | template <typename T> |
146 | 340k | void put_varint32(T* dst, uint32_t v) { |
147 | 340k | uint8_t buf[16]; |
148 | 340k | uint8_t* ptr = encode_varint32(buf, v); |
149 | 340k | dst->append((char*)buf, static_cast<size_t>(ptr - buf)); |
150 | 340k | } |
151 | | |
152 | | template <typename T> |
153 | | void put_varint64(T* dst, uint64_t v) { |
154 | | uint8_t buf[16]; |
155 | | uint8_t* ptr = encode_varint64(buf, v); |
156 | | dst->append((char*)buf, static_cast<size_t>(ptr - buf)); |
157 | | } |
158 | | |
159 | | template <typename T> |
160 | 53.3k | void put_length_prefixed_slice(T* dst, const Slice& value) { |
161 | 53.3k | put_varint32(dst, value.get_size()); |
162 | 53.3k | dst->append(value.get_data(), value.get_size()); |
163 | 53.3k | } |
164 | | |
165 | | template <typename T> |
166 | 53.3k | void put_varint64_varint32(T* dst, uint64_t v1, uint32_t v2) { |
167 | 53.3k | uint8_t buf[16]; |
168 | 53.3k | uint8_t* ptr = encode_varint64(buf, v1); |
169 | 53.3k | ptr = encode_varint32(ptr, v2); |
170 | 53.3k | dst->append((char*)buf, static_cast<size_t>(ptr - buf)); |
171 | 53.3k | } |
172 | | |
173 | | // parse a varint32 from the start of `input` into `val`. |
174 | | // on success, return true and advance `input` past the parsed value. |
175 | | // on failure, return false and `input` is not modified. |
176 | 63.3k | inline bool get_varint32(Slice* input, uint32_t* val) { |
177 | 63.3k | const uint8_t* p = (const uint8_t*)input->data; |
178 | 63.3k | const uint8_t* limit = p + input->size; |
179 | 63.3k | const uint8_t* q = decode_varint32_ptr(p, limit, val); |
180 | 63.3k | if (q == nullptr) { |
181 | 0 | return false; |
182 | 63.3k | } else { |
183 | 63.3k | *input = Slice(q, limit - q); |
184 | 63.3k | return true; |
185 | 63.3k | } |
186 | 63.3k | } |
187 | | |
188 | | // parse a varint64 from the start of `input` into `val`. |
189 | | // on success, return true and advance `input` past the parsed value. |
190 | | // on failure, return false and `input` is not modified. |
191 | 20.5k | inline bool get_varint64(Slice* input, uint64_t* val) { |
192 | 20.5k | const uint8_t* p = (const uint8_t*)input->data; |
193 | 20.5k | const uint8_t* limit = p + input->size; |
194 | 20.5k | const uint8_t* q = decode_varint64_ptr(p, limit, val); |
195 | 20.5k | if (q == nullptr) { |
196 | 0 | return false; |
197 | 20.5k | } else { |
198 | 20.5k | *input = Slice(q, limit - q); |
199 | 20.5k | return true; |
200 | 20.5k | } |
201 | 20.5k | } |
202 | | |
203 | | // parse a length-prefixed-slice from the start of `input` into `val`. |
204 | | // on success, return true and advance `input` past the parsed value. |
205 | | // on failure, return false and `input` may or may not be modified. |
206 | 20.5k | inline bool get_length_prefixed_slice(Slice* input, Slice* val) { |
207 | 20.5k | uint32_t len; |
208 | 20.5k | if (get_varint32(input, &len) && input->get_size() >= len) { |
209 | 20.5k | *val = Slice(input->get_data(), len); |
210 | 20.5k | input->remove_prefix(len); |
211 | 20.5k | return true; |
212 | 20.5k | } else { |
213 | 4 | return false; |
214 | 4 | } |
215 | 20.5k | } |
216 | | |
217 | | } // namespace doris |