be/src/util/bit_stream_utils.inline.h
Line | Count | Source |
1 | | // Licensed to the Apache Software Foundation (ASF) under one |
2 | | // or more contributor license agreements. See the NOTICE file |
3 | | // distributed with this work for additional information |
4 | | // regarding copyright ownership. The ASF licenses this file |
5 | | // to you under the Apache License, Version 2.0 (the |
6 | | // "License"); you may not use this file except in compliance |
7 | | // with the License. You may obtain a copy of the License at |
8 | | // |
9 | | // http://www.apache.org/licenses/LICENSE-2.0 |
10 | | // |
11 | | // Unless required by applicable law or agreed to in writing, |
12 | | // software distributed under the License is distributed on an |
13 | | // "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
14 | | // KIND, either express or implied. See the License for the |
15 | | // specific language governing permissions and limitations |
16 | | // under the License. |
17 | | // This file is copied from |
18 | | // https://github.com/apache/impala/blob/branch-2.9.0/be/src/util/bit-stream-utils.inline.h |
19 | | // and modified by Doris |
20 | | |
21 | | #pragma once |
22 | | |
23 | | #include <algorithm> |
24 | | |
25 | | #include "glog/logging.h" |
26 | | #include "util/alignment.h" |
27 | | #include "util/bit_packing.inline.h" |
28 | | #include "util/bit_stream_utils.h" |
29 | | #include "util/bit_util.h" |
30 | | |
31 | | using doris::BitUtil; |
32 | | |
33 | | namespace doris { |
34 | | #include "common/compile_check_begin.h" |
35 | 19.4M | inline void BitWriter::PutValue(uint64_t v, int num_bits) { |
36 | 19.4M | DCHECK_LE(num_bits, 64); |
37 | | // Truncate the higher-order bits. This is necessary to |
38 | | // support signed values. |
39 | 19.4M | v &= ~0ULL >> (64 - num_bits); |
40 | | |
41 | 19.4M | buffered_values_ |= v << bit_offset_; |
42 | 19.4M | bit_offset_ += num_bits; |
43 | | |
44 | 19.4M | if (bit_offset_ >= 64) [[unlikely]] { |
45 | | // Flush buffered_values_ and write out bits of v that did not fit |
46 | 281k | buffer_->reserve(ALIGN_UP(byte_offset_ + 8, 8)); |
47 | 281k | buffer_->resize(byte_offset_ + 8); |
48 | 281k | DCHECK_LE(byte_offset_ + 8, buffer_->capacity()); |
49 | 281k | memcpy(buffer_->data() + byte_offset_, &buffered_values_, 8); |
50 | 281k | buffered_values_ = 0; |
51 | 281k | byte_offset_ += 8; |
52 | 281k | bit_offset_ -= 64; |
53 | 281k | buffered_values_ = BitUtil::ShiftRightZeroOnOverflow(v, (num_bits - bit_offset_)); |
54 | 281k | } |
55 | 19.4M | DCHECK_LT(bit_offset_, 64); |
56 | 19.4M | } |
57 | | |
58 | 70.8M | inline void BitWriter::Flush(bool align) { |
59 | 70.8M | int num_bytes = BitUtil::Ceil(bit_offset_, 8); |
60 | 70.8M | buffer_->reserve(ALIGN_UP(byte_offset_ + num_bytes, 8)); |
61 | 70.8M | buffer_->resize(byte_offset_ + num_bytes); |
62 | 70.8M | DCHECK_LE(byte_offset_ + num_bytes, buffer_->capacity()); |
63 | 70.8M | memcpy(buffer_->data() + byte_offset_, &buffered_values_, num_bytes); |
64 | | |
65 | 70.8M | if (align) { |
66 | 59.6M | buffered_values_ = 0; |
67 | 59.6M | byte_offset_ += num_bytes; |
68 | 59.6M | bit_offset_ = 0; |
69 | 59.6M | } |
70 | 70.8M | } |
71 | | |
72 | 59.6M | inline uint8_t* BitWriter::GetNextBytePtr(int num_bytes) { |
73 | 59.6M | Flush(/* align */ true); |
74 | 59.6M | buffer_->reserve(ALIGN_UP(byte_offset_ + num_bytes, 8)); |
75 | 59.6M | buffer_->resize(byte_offset_ + num_bytes); |
76 | 59.6M | uint8_t* ptr = buffer_->data() + byte_offset_; |
77 | 59.6M | byte_offset_ += num_bytes; |
78 | 59.6M | DCHECK_LE(byte_offset_, buffer_->capacity()); |
79 | 59.6M | return ptr; |
80 | 59.6M | } |
81 | | |
82 | | template <typename T> |
83 | 58.5M | void BitWriter::PutAligned(T val, int num_bytes) { |
84 | 58.5M | DCHECK_LE(num_bytes, sizeof(T)); |
85 | 58.5M | uint8_t* ptr = GetNextBytePtr(num_bytes); |
86 | 58.5M | memcpy(ptr, &val, num_bytes); |
87 | 58.5M | } _ZN5doris9BitWriter10PutAlignedIhEEvT_i Line | Count | Source | 83 | 38.3M | void BitWriter::PutAligned(T val, int num_bytes) { | 84 | | DCHECK_LE(num_bytes, sizeof(T)); | 85 | 38.3M | uint8_t* ptr = GetNextBytePtr(num_bytes); | 86 | 38.3M | memcpy(ptr, &val, num_bytes); | 87 | 38.3M | } |
_ZN5doris9BitWriter10PutAlignedImEEvT_i Line | Count | Source | 83 | 20.1M | void BitWriter::PutAligned(T val, int num_bytes) { | 84 | | DCHECK_LE(num_bytes, sizeof(T)); | 85 | 20.1M | uint8_t* ptr = GetNextBytePtr(num_bytes); | 86 | 20.1M | memcpy(ptr, &val, num_bytes); | 87 | 20.1M | } |
|
88 | | |
89 | 20.1M | inline void BitWriter::PutVlqInt(int32_t v) { |
90 | 38.3M | while ((v & 0xFFFFFF80) != 0L) { |
91 | 18.1M | PutAligned<uint8_t>((v & 0x7F) | 0x80, 1); |
92 | 18.1M | v >>= 7; |
93 | 18.1M | } |
94 | 20.1M | PutAligned<uint8_t>(v & 0x7F, 1); |
95 | 20.1M | } |
96 | | |
97 | | inline BitReader::BitReader(const uint8_t* buffer, int buffer_len) |
98 | 1.37M | : buffer_(buffer), |
99 | 1.37M | max_bytes_(buffer_len), |
100 | 1.37M | buffered_values_(0), |
101 | 1.37M | byte_offset_(0), |
102 | 1.37M | bit_offset_(0) { |
103 | 1.37M | int num_bytes = std::min(8, max_bytes_); |
104 | 1.37M | memcpy(&buffered_values_, buffer_ + byte_offset_, num_bytes); |
105 | 1.37M | } |
106 | | |
107 | 2.83M | inline void BitReader::BufferValues() { |
108 | 2.83M | int bytes_remaining = max_bytes_ - byte_offset_; |
109 | 2.83M | if (bytes_remaining >= 8) [[likely]] { |
110 | 2.78M | memcpy(&buffered_values_, buffer_ + byte_offset_, 8); |
111 | 2.78M | } else { |
112 | 43.8k | memcpy(&buffered_values_, buffer_ + byte_offset_, bytes_remaining); |
113 | 43.8k | } |
114 | 2.83M | } |
115 | | |
116 | | template <typename T> |
117 | 131M | bool BitReader::GetValue(int num_bits, T* v) { |
118 | 131M | DCHECK_LE(num_bits, 64); |
119 | 131M | DCHECK_LE(num_bits, sizeof(T) * 8); |
120 | | |
121 | 131M | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { |
122 | 0 | return false; |
123 | 0 | } |
124 | | |
125 | 131M | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> |
126 | 131M | bit_offset_); |
127 | | |
128 | 131M | bit_offset_ += num_bits; |
129 | 131M | if (bit_offset_ >= 64) { |
130 | 2.83M | byte_offset_ += 8; |
131 | 2.83M | bit_offset_ -= 64; |
132 | 2.83M | BufferValues(); |
133 | | // Read bits of v that crossed into new buffered_values_ |
134 | 2.83M | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), |
135 | 2.83M | (num_bits - bit_offset_)); |
136 | 2.83M | } |
137 | 131M | DCHECK_LE(bit_offset_, 64); |
138 | 131M | return true; |
139 | 131M | } _ZN5doris9BitReader8GetValueIsEEbiPT_ Line | Count | Source | 117 | 92.4M | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 92.4M | DCHECK_LE(num_bits, 64); | 119 | 92.4M | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 92.4M | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 92.4M | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 92.4M | bit_offset_); | 127 | | | 128 | 92.4M | bit_offset_ += num_bits; | 129 | 92.4M | if (bit_offset_ >= 64) { | 130 | 1.95M | byte_offset_ += 8; | 131 | 1.95M | bit_offset_ -= 64; | 132 | 1.95M | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 1.95M | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 1.95M | (num_bits - bit_offset_)); | 136 | 1.95M | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 92.4M | return true; | 139 | 92.4M | } |
_ZN5doris9BitReader8GetValueImEEbiPT_ Line | Count | Source | 117 | 6.48M | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 6.48M | DCHECK_LE(num_bits, 64); | 119 | 6.48M | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 6.48M | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 6.48M | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 6.48M | bit_offset_); | 127 | | | 128 | 6.48M | bit_offset_ += num_bits; | 129 | 6.48M | if (bit_offset_ >= 64) { | 130 | 64.1k | byte_offset_ += 8; | 131 | 64.1k | bit_offset_ -= 64; | 132 | 64.1k | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 64.1k | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 64.1k | (num_bits - bit_offset_)); | 136 | 64.1k | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 6.48M | return true; | 139 | 6.48M | } |
_ZN5doris9BitReader8GetValueIbEEbiPT_ Line | Count | Source | 117 | 5.88M | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 5.88M | DCHECK_LE(num_bits, 64); | 119 | 5.88M | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 5.88M | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 5.88M | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 5.88M | bit_offset_); | 127 | | | 128 | 5.88M | bit_offset_ += num_bits; | 129 | 5.88M | if (bit_offset_ >= 64) { | 130 | 45.3k | byte_offset_ += 8; | 131 | 45.3k | bit_offset_ -= 64; | 132 | 45.3k | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 45.3k | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 45.3k | (num_bits - bit_offset_)); | 136 | 45.3k | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 5.88M | return true; | 139 | 5.88M | } |
_ZN5doris9BitReader8GetValueIhEEbiPT_ Line | Count | Source | 117 | 24.9M | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 24.9M | DCHECK_LE(num_bits, 64); | 119 | 24.9M | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 24.9M | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 24.9M | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 24.9M | bit_offset_); | 127 | | | 128 | 24.9M | bit_offset_ += num_bits; | 129 | 24.9M | if (bit_offset_ >= 64) { | 130 | 368k | byte_offset_ += 8; | 131 | 368k | bit_offset_ -= 64; | 132 | 368k | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 368k | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 368k | (num_bits - bit_offset_)); | 136 | 368k | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 24.9M | return true; | 139 | 24.9M | } |
_ZN5doris9BitReader8GetValueIiEEbiPT_ Line | Count | Source | 117 | 196k | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 196k | DCHECK_LE(num_bits, 64); | 119 | 196k | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 196k | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 196k | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 196k | bit_offset_); | 127 | | | 128 | 196k | bit_offset_ += num_bits; | 129 | 196k | if (bit_offset_ >= 64) { | 130 | 11.3k | byte_offset_ += 8; | 131 | 11.3k | bit_offset_ -= 64; | 132 | 11.3k | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 11.3k | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 11.3k | (num_bits - bit_offset_)); | 136 | 11.3k | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 196k | return true; | 139 | 196k | } |
_ZN5doris9BitReader8GetValueIlEEbiPT_ Line | Count | Source | 117 | 541k | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 541k | DCHECK_LE(num_bits, 64); | 119 | 541k | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 541k | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 541k | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 541k | bit_offset_); | 127 | | | 128 | 541k | bit_offset_ += num_bits; | 129 | 541k | if (bit_offset_ >= 64) { | 130 | 286k | byte_offset_ += 8; | 131 | 286k | bit_offset_ -= 64; | 132 | 286k | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 286k | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 286k | (num_bits - bit_offset_)); | 136 | 286k | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 541k | return true; | 139 | 541k | } |
_ZN5doris9BitReader8GetValueIcEEbiPT_ Line | Count | Source | 117 | 789k | bool BitReader::GetValue(int num_bits, T* v) { | 118 | 789k | DCHECK_LE(num_bits, 64); | 119 | 789k | DCHECK_LE(num_bits, sizeof(T) * 8); | 120 | | | 121 | 789k | if (byte_offset_ * 8 + bit_offset_ + num_bits > max_bytes_ * 8) [[unlikely]] { | 122 | 0 | return false; | 123 | 0 | } | 124 | | | 125 | 789k | *v = static_cast<T>(BitUtil::TrailingBits(buffered_values_, bit_offset_ + num_bits) >> | 126 | 789k | bit_offset_); | 127 | | | 128 | 789k | bit_offset_ += num_bits; | 129 | 789k | if (bit_offset_ >= 64) { | 130 | 98.6k | byte_offset_ += 8; | 131 | 98.6k | bit_offset_ -= 64; | 132 | 98.6k | BufferValues(); | 133 | | // Read bits of v that crossed into new buffered_values_ | 134 | 98.6k | *v |= BitUtil::ShiftLeftZeroOnOverflow(BitUtil::TrailingBits(buffered_values_, bit_offset_), | 135 | 98.6k | (num_bits - bit_offset_)); | 136 | 98.6k | } | 137 | | DCHECK_LE(bit_offset_, 64); | 138 | 789k | return true; | 139 | 789k | } |
|
140 | | |
141 | 2.28M | inline void BitReader::Rewind(int num_bits) { |
142 | 2.28M | bit_offset_ -= num_bits; |
143 | 2.28M | if (bit_offset_ >= 0) { |
144 | 2.27M | return; |
145 | 2.27M | } |
146 | 25.4k | while (bit_offset_ < 0) { |
147 | 13.1k | int seek_back = std::min(byte_offset_, 8); |
148 | 13.1k | byte_offset_ -= seek_back; |
149 | 13.1k | bit_offset_ += seek_back * 8; |
150 | 13.1k | } |
151 | | // This should only be executed *if* rewinding by 'num_bits' |
152 | | // make the existing buffered_values_ invalid |
153 | 12.3k | DCHECK_GE(byte_offset_, 0); // Check for underflow |
154 | 12.3k | memcpy(&buffered_values_, buffer_ + byte_offset_, 8); |
155 | 12.3k | } |
156 | | |
157 | 1.30k | inline bool BitReader::Advance(int64_t num_bits) { |
158 | 1.30k | int64_t bits_required = bit_offset_ + num_bits; |
159 | 1.30k | int64_t bytes_required = (bits_required >> 3) + ((bits_required & 7) != 0); |
160 | 1.30k | if (bytes_required > max_bytes_ - byte_offset_) { |
161 | 0 | return false; |
162 | 0 | } |
163 | 1.30k | byte_offset_ += static_cast<int>(bits_required >> 3); |
164 | 1.30k | bit_offset_ = static_cast<int>(bits_required & 7); |
165 | 1.30k | BufferValues(); |
166 | 1.30k | return true; |
167 | 1.30k | } |
168 | | |
169 | 0 | inline void BitReader::SeekToBit(unsigned int stream_position) { |
170 | 0 | DCHECK_LE(stream_position, max_bytes_ * 8); |
171 | 0 |
|
172 | 0 | int delta = static_cast<int>(stream_position) - position(); |
173 | 0 | if (delta == 0) { |
174 | 0 | return; |
175 | 0 | } else if (delta < 0) { |
176 | 0 | Rewind(position() - stream_position); |
177 | 0 | } else { |
178 | 0 | bit_offset_ += delta; |
179 | 0 | while (bit_offset_ >= 64) { |
180 | 0 | byte_offset_ += 8; |
181 | 0 | bit_offset_ -= 64; |
182 | 0 | if (bit_offset_ < 64) { |
183 | 0 | // This should only be executed if seeking to |
184 | 0 | // 'stream_position' makes the existing buffered_values_ |
185 | 0 | // invalid. |
186 | 0 | BufferValues(); |
187 | 0 | } |
188 | 0 | } |
189 | 0 | } |
190 | 0 | } |
191 | | |
192 | | template <typename T> |
193 | 18.5M | bool BitReader::GetAligned(int num_bytes, T* v) { |
194 | 18.5M | DCHECK_LE(num_bytes, sizeof(T)); |
195 | 18.5M | int bytes_read = BitUtil::Ceil(bit_offset_, 8); |
196 | 18.5M | if (byte_offset_ + bytes_read + num_bytes > max_bytes_) [[unlikely]] { |
197 | 11.9k | return false; |
198 | 11.9k | } |
199 | | |
200 | | // Advance byte_offset to next unread byte and read num_bytes |
201 | 18.5M | byte_offset_ += bytes_read; |
202 | 18.5M | memcpy(v, buffer_ + byte_offset_, num_bytes); |
203 | 18.5M | byte_offset_ += num_bytes; |
204 | | |
205 | | // Reset buffered_values_ |
206 | 18.5M | bit_offset_ = 0; |
207 | 18.5M | int bytes_remaining = max_bytes_ - byte_offset_; |
208 | 18.5M | if (bytes_remaining >= 8) [[likely]] { |
209 | 15.8M | memcpy(&buffered_values_, buffer_ + byte_offset_, 8); |
210 | 15.8M | } else { |
211 | 2.70M | memcpy(&buffered_values_, buffer_ + byte_offset_, bytes_remaining); |
212 | 2.70M | } |
213 | 18.5M | return true; |
214 | 18.5M | } _ZN5doris9BitReader10GetAlignedIhEEbiPT_ Line | Count | Source | 193 | 13.1M | bool BitReader::GetAligned(int num_bytes, T* v) { | 194 | 13.1M | DCHECK_LE(num_bytes, sizeof(T)); | 195 | 13.1M | int bytes_read = BitUtil::Ceil(bit_offset_, 8); | 196 | 13.1M | if (byte_offset_ + bytes_read + num_bytes > max_bytes_) [[unlikely]] { | 197 | 11.9k | return false; | 198 | 11.9k | } | 199 | | | 200 | | // Advance byte_offset to next unread byte and read num_bytes | 201 | 13.1M | byte_offset_ += bytes_read; | 202 | 13.1M | memcpy(v, buffer_ + byte_offset_, num_bytes); | 203 | 13.1M | byte_offset_ += num_bytes; | 204 | | | 205 | | // Reset buffered_values_ | 206 | 13.1M | bit_offset_ = 0; | 207 | 13.1M | int bytes_remaining = max_bytes_ - byte_offset_; | 208 | 13.1M | if (bytes_remaining >= 8) [[likely]] { | 209 | 11.4M | memcpy(&buffered_values_, buffer_ + byte_offset_, 8); | 210 | 11.4M | } else { | 211 | 1.72M | memcpy(&buffered_values_, buffer_ + byte_offset_, bytes_remaining); | 212 | 1.72M | } | 213 | 13.1M | return true; | 214 | 13.1M | } |
_ZN5doris9BitReader10GetAlignedIsEEbiPT_ Line | Count | Source | 193 | 5.09M | bool BitReader::GetAligned(int num_bytes, T* v) { | 194 | 5.09M | DCHECK_LE(num_bytes, sizeof(T)); | 195 | 5.09M | int bytes_read = BitUtil::Ceil(bit_offset_, 8); | 196 | 5.09M | if (byte_offset_ + bytes_read + num_bytes > max_bytes_) [[unlikely]] { | 197 | 0 | return false; | 198 | 0 | } | 199 | | | 200 | | // Advance byte_offset to next unread byte and read num_bytes | 201 | 5.09M | byte_offset_ += bytes_read; | 202 | 5.09M | memcpy(v, buffer_ + byte_offset_, num_bytes); | 203 | 5.09M | byte_offset_ += num_bytes; | 204 | | | 205 | | // Reset buffered_values_ | 206 | 5.09M | bit_offset_ = 0; | 207 | 5.09M | int bytes_remaining = max_bytes_ - byte_offset_; | 208 | 5.09M | if (bytes_remaining >= 8) [[likely]] { | 209 | 4.37M | memcpy(&buffered_values_, buffer_ + byte_offset_, 8); | 210 | 4.37M | } else { | 211 | 718k | memcpy(&buffered_values_, buffer_ + byte_offset_, bytes_remaining); | 212 | 718k | } | 213 | 5.09M | return true; | 214 | 5.09M | } |
_ZN5doris9BitReader10GetAlignedIbEEbiPT_ Line | Count | Source | 193 | 319k | bool BitReader::GetAligned(int num_bytes, T* v) { | 194 | 319k | DCHECK_LE(num_bytes, sizeof(T)); | 195 | 319k | int bytes_read = BitUtil::Ceil(bit_offset_, 8); | 196 | 319k | if (byte_offset_ + bytes_read + num_bytes > max_bytes_) [[unlikely]] { | 197 | 0 | return false; | 198 | 0 | } | 199 | | | 200 | | // Advance byte_offset to next unread byte and read num_bytes | 201 | 319k | byte_offset_ += bytes_read; | 202 | 319k | memcpy(v, buffer_ + byte_offset_, num_bytes); | 203 | 319k | byte_offset_ += num_bytes; | 204 | | | 205 | | // Reset buffered_values_ | 206 | 319k | bit_offset_ = 0; | 207 | 319k | int bytes_remaining = max_bytes_ - byte_offset_; | 208 | 319k | if (bytes_remaining >= 8) [[likely]] { | 209 | 62.7k | memcpy(&buffered_values_, buffer_ + byte_offset_, 8); | 210 | 256k | } else { | 211 | 256k | memcpy(&buffered_values_, buffer_ + byte_offset_, bytes_remaining); | 212 | 256k | } | 213 | 319k | return true; | 214 | 319k | } |
|
215 | | |
216 | 10.5M | inline bool BitReader::GetVlqInt(uint32_t* v) { |
217 | 10.5M | uint32_t tmp = 0; |
218 | 13.1M | for (int num_bytes = 0; num_bytes < MAX_VLQ_BYTE_LEN; num_bytes++) { |
219 | 13.1M | uint8_t byte = 0; |
220 | 13.1M | if (!GetAligned<uint8_t>(1, &byte)) return false; |
221 | 13.1M | tmp |= static_cast<uint32_t>(byte & 0x7F) << (7 * num_bytes); |
222 | 13.1M | if ((byte & 0x80) == 0) { |
223 | 10.5M | *v = tmp; |
224 | 10.5M | return true; |
225 | 10.5M | } |
226 | 13.1M | } |
227 | 18.4E | return false; |
228 | 10.5M | } |
229 | | |
230 | 2.29k | inline bool BitReader::GetZigZagVlqInt(int32_t* v) { |
231 | 2.29k | uint32_t u; |
232 | 2.29k | if (!GetVlqInt(&u)) { |
233 | 3 | return false; |
234 | 3 | } |
235 | 2.29k | u = (u >> 1) ^ (~(u & 1) + 1); |
236 | | // copy uint32_t to int32_t |
237 | 2.29k | std::memcpy(v, &u, sizeof(uint32_t)); |
238 | 2.29k | return true; |
239 | 2.29k | } |
240 | | |
241 | 4.49k | inline bool BitReader::GetVlqInt(uint64_t* v) { |
242 | 4.49k | uint64_t tmp = 0; |
243 | 16.4k | for (int num_bytes = 0; num_bytes < MAX_VLQ_BYTE_LEN_FOR_INT64; num_bytes++) { |
244 | 16.4k | uint8_t byte = 0; |
245 | 16.4k | if (!GetAligned<uint8_t>(1, &byte)) return false; |
246 | 16.4k | tmp |= static_cast<uint64_t>(byte & 0x7F) << (7 * num_bytes); |
247 | 16.4k | if ((byte & 0x80) == 0) { |
248 | 4.49k | *v = tmp; |
249 | 4.49k | return true; |
250 | 4.49k | } |
251 | 16.4k | } |
252 | 0 | return false; |
253 | 4.49k | } |
254 | | |
255 | 4.49k | inline bool BitReader::GetZigZagVlqInt(int64_t* v) { |
256 | 4.49k | uint64_t u; |
257 | 4.49k | if (!GetVlqInt(&u)) { |
258 | 0 | return false; |
259 | 0 | } |
260 | 4.49k | u = (u >> 1) ^ (~(u & 1) + 1); |
261 | 4.49k | std::memcpy(v, &u, sizeof(uint64_t)); |
262 | 4.49k | return true; |
263 | 4.49k | } |
264 | | |
265 | | template <typename T> |
266 | 7.30M | int BatchedBitReader::UnpackBatch(int bit_width, int num_values, T* v) { |
267 | 7.30M | DCHECK(buffer_pos_ != nullptr); |
268 | 7.30M | DCHECK_GE(bit_width, 0); |
269 | 7.30M | DCHECK_LE(bit_width, MAX_BITWIDTH); |
270 | 7.30M | DCHECK_LE(bit_width, sizeof(T) * 8); |
271 | 7.30M | DCHECK_GE(num_values, 0); |
272 | | |
273 | 7.30M | int64_t num_read; |
274 | 7.30M | std::tie(buffer_pos_, num_read) = |
275 | 7.30M | BitPacking::UnpackValues(bit_width, buffer_pos_, bytes_left(), num_values, v); |
276 | 7.30M | DCHECK_LE(buffer_pos_, buffer_end_); |
277 | 7.30M | DCHECK_LE(num_read, num_values); |
278 | 7.30M | return static_cast<int>(num_read); |
279 | 7.30M | } _ZN5doris16BatchedBitReader11UnpackBatchIjEEiiiPT_ Line | Count | Source | 266 | 7.21M | int BatchedBitReader::UnpackBatch(int bit_width, int num_values, T* v) { | 267 | 7.21M | DCHECK(buffer_pos_ != nullptr); | 268 | 7.21M | DCHECK_GE(bit_width, 0); | 269 | 7.21M | DCHECK_LE(bit_width, MAX_BITWIDTH); | 270 | 7.21M | DCHECK_LE(bit_width, sizeof(T) * 8); | 271 | 7.21M | DCHECK_GE(num_values, 0); | 272 | | | 273 | 7.21M | int64_t num_read; | 274 | 7.21M | std::tie(buffer_pos_, num_read) = | 275 | 7.21M | BitPacking::UnpackValues(bit_width, buffer_pos_, bytes_left(), num_values, v); | 276 | 7.21M | DCHECK_LE(buffer_pos_, buffer_end_); | 277 | | DCHECK_LE(num_read, num_values); | 278 | 7.21M | return static_cast<int>(num_read); | 279 | 7.21M | } |
_ZN5doris16BatchedBitReader11UnpackBatchIhEEiiiPT_ Line | Count | Source | 266 | 94.5k | int BatchedBitReader::UnpackBatch(int bit_width, int num_values, T* v) { | 267 | 94.5k | DCHECK(buffer_pos_ != nullptr); | 268 | 94.5k | DCHECK_GE(bit_width, 0); | 269 | 94.5k | DCHECK_LE(bit_width, MAX_BITWIDTH); | 270 | 94.5k | DCHECK_LE(bit_width, sizeof(T) * 8); | 271 | 94.5k | DCHECK_GE(num_values, 0); | 272 | | | 273 | 94.5k | int64_t num_read; | 274 | 94.5k | std::tie(buffer_pos_, num_read) = | 275 | 94.5k | BitPacking::UnpackValues(bit_width, buffer_pos_, bytes_left(), num_values, v); | 276 | 94.5k | DCHECK_LE(buffer_pos_, buffer_end_); | 277 | | DCHECK_LE(num_read, num_values); | 278 | 94.5k | return static_cast<int>(num_read); | 279 | 94.5k | } |
|
280 | | |
281 | 148 | inline bool BatchedBitReader::SkipBatch(int bit_width, int num_values_to_skip) { |
282 | 148 | DCHECK(buffer_pos_ != nullptr); |
283 | 148 | DCHECK_GE(bit_width, 0); |
284 | 148 | DCHECK_LE(bit_width, MAX_BITWIDTH); |
285 | 148 | DCHECK_GE(num_values_to_skip, 0); |
286 | | |
287 | 148 | int skip_bytes = BitUtil::RoundUpNumBytes(bit_width * num_values_to_skip); |
288 | 148 | if (skip_bytes > buffer_end_ - buffer_pos_) { |
289 | 0 | return false; |
290 | 0 | } |
291 | 148 | buffer_pos_ += skip_bytes; |
292 | 148 | return true; |
293 | 148 | } |
294 | | |
295 | | template <typename T> |
296 | | int BatchedBitReader::UnpackAndDecodeBatch(int bit_width, T* dict, int64_t dict_len, int num_values, |
297 | | T* v, int64_t stride) { |
298 | | DCHECK(buffer_pos_ != nullptr); |
299 | | DCHECK_GE(bit_width, 0); |
300 | | DCHECK_LE(bit_width, MAX_BITWIDTH); |
301 | | DCHECK_GE(num_values, 0); |
302 | | |
303 | | const uint8_t* new_buffer_pos; |
304 | | int64_t num_read; |
305 | | bool decode_error = false; |
306 | | std::tie(new_buffer_pos, num_read) = |
307 | | BitPacking::UnpackAndDecodeValues(bit_width, buffer_pos_, bytes_left(), dict, dict_len, |
308 | | num_values, v, stride, &decode_error); |
309 | | if (UNLIKELY(decode_error)) return -1; |
310 | | buffer_pos_ = new_buffer_pos; |
311 | | DCHECK_LE(buffer_pos_, buffer_end_); |
312 | | DCHECK_LE(num_read, num_values); |
313 | | return static_cast<int>(num_read); |
314 | | } |
315 | | |
316 | | template <typename T> |
317 | 11.3M | bool BatchedBitReader::GetBytes(int num_bytes, T* v) { |
318 | 11.3M | DCHECK(buffer_pos_ != nullptr); |
319 | 11.3M | DCHECK_GE(num_bytes, 0); |
320 | 11.3M | DCHECK_LE(num_bytes, sizeof(T)); |
321 | 11.3M | if (UNLIKELY(buffer_pos_ + num_bytes > buffer_end_)) return false; |
322 | 11.3M | *v = 0; // Ensure unset bytes are initialized to zero. |
323 | 11.3M | memcpy(v, buffer_pos_, num_bytes); |
324 | 11.3M | buffer_pos_ += num_bytes; |
325 | 11.3M | return true; |
326 | 11.3M | } _ZN5doris16BatchedBitReader8GetBytesIhEEbiPT_ Line | Count | Source | 317 | 7.91M | bool BatchedBitReader::GetBytes(int num_bytes, T* v) { | 318 | 7.91M | DCHECK(buffer_pos_ != nullptr); | 319 | 7.91M | DCHECK_GE(num_bytes, 0); | 320 | 7.91M | DCHECK_LE(num_bytes, sizeof(T)); | 321 | 7.91M | if (UNLIKELY(buffer_pos_ + num_bytes > buffer_end_)) return false; | 322 | 7.91M | *v = 0; // Ensure unset bytes are initialized to zero. | 323 | 7.91M | memcpy(v, buffer_pos_, num_bytes); | 324 | 7.91M | buffer_pos_ += num_bytes; | 325 | 7.91M | return true; | 326 | 7.91M | } |
_ZN5doris16BatchedBitReader8GetBytesIjEEbiPT_ Line | Count | Source | 317 | 3.39M | bool BatchedBitReader::GetBytes(int num_bytes, T* v) { | 318 | 3.39M | DCHECK(buffer_pos_ != nullptr); | 319 | 3.39M | DCHECK_GE(num_bytes, 0); | 320 | 3.39M | DCHECK_LE(num_bytes, sizeof(T)); | 321 | 3.39M | if (UNLIKELY(buffer_pos_ + num_bytes > buffer_end_)) return false; | 322 | 3.39M | *v = 0; // Ensure unset bytes are initialized to zero. | 323 | 3.39M | memcpy(v, buffer_pos_, num_bytes); | 324 | 3.39M | buffer_pos_ += num_bytes; | 325 | 3.39M | return true; | 326 | 3.39M | } |
|
327 | | |
328 | | template <typename UINT_T> |
329 | 7.88M | bool BatchedBitReader::GetUleb128(UINT_T* v) { |
330 | 7.88M | static_assert(std::is_integral<UINT_T>::value, "Integral type required."); |
331 | 7.88M | static_assert(std::is_unsigned<UINT_T>::value, "Unsigned type required."); |
332 | 7.88M | static_assert(!std::is_same<UINT_T, bool>::value, "Bools are not supported."); |
333 | | |
334 | 7.88M | *v = 0; |
335 | 7.88M | int shift = 0; |
336 | 7.88M | uint8_t byte = 0; |
337 | 7.91M | do { |
338 | 7.91M | if (UNLIKELY(shift >= max_vlq_byte_len<UINT_T>() * 7)) return false; |
339 | 7.91M | if (!GetBytes(1, &byte)) return false; |
340 | | |
341 | | /// We need to convert 'byte' to UINT_T so that the result of the bitwise and |
342 | | /// operation is at least as long an integer as '*v', otherwise the shift may be too |
343 | | /// big and lead to undefined behaviour. |
344 | 7.91M | const UINT_T byte_as_UINT_T = byte; |
345 | 7.91M | *v |= (byte_as_UINT_T & 0x7Fu) << shift; |
346 | 7.91M | shift += 7; |
347 | 7.91M | } while ((byte & 0x80u) != 0); |
348 | 7.88M | return true; |
349 | 7.88M | } |
350 | | |
351 | | #include "common/compile_check_end.h" |
352 | | } // namespace doris |