be/src/storage/segment/column_reader.cpp
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 | | |
18 | | #include "storage/segment/column_reader.h" |
19 | | |
20 | | #include <assert.h> |
21 | | #include <gen_cpp/Descriptors_types.h> |
22 | | #include <gen_cpp/segment_v2.pb.h> |
23 | | #include <glog/logging.h> |
24 | | |
25 | | #include <algorithm> |
26 | | #include <memory> |
27 | | #include <ostream> |
28 | | #include <set> |
29 | | #include <utility> |
30 | | |
31 | | #include "common/compiler_util.h" // IWYU pragma: keep |
32 | | #include "common/status.h" |
33 | | #include "core/assert_cast.h" |
34 | | #include "core/binary_cast.hpp" |
35 | | #include "core/column/column.h" |
36 | | #include "core/column/column_array.h" |
37 | | #include "core/column/column_map.h" |
38 | | #include "core/column/column_nullable.h" |
39 | | #include "core/column/column_struct.h" |
40 | | #include "core/column/column_vector.h" |
41 | | #include "core/data_type/data_type_agg_state.h" |
42 | | #include "core/data_type/data_type_factory.hpp" |
43 | | #include "core/data_type/data_type_nullable.h" |
44 | | #include "core/data_type/define_primitive_type.h" |
45 | | #include "core/decimal12.h" |
46 | | #include "core/string_ref.h" |
47 | | #include "core/types.h" |
48 | | #include "core/value/decimalv2_value.h" |
49 | | #include "core/value/vdatetime_value.h" //for VecDateTime |
50 | | #include "io/fs/file_reader.h" |
51 | | #include "storage/index/ann/ann_index_reader.h" |
52 | | #include "storage/index/bloom_filter/bloom_filter.h" |
53 | | #include "storage/index/bloom_filter/bloom_filter_index_reader.h" |
54 | | #include "storage/index/index_file_reader.h" |
55 | | #include "storage/index/index_reader.h" |
56 | | #include "storage/index/inverted/analyzer/analyzer.h" |
57 | | #include "storage/index/inverted/inverted_index_reader.h" |
58 | | #include "storage/index/zone_map/zone_map_index.h" |
59 | | #include "storage/iterators.h" |
60 | | #include "storage/olap_common.h" |
61 | | #include "storage/predicate/block_column_predicate.h" |
62 | | #include "storage/predicate/column_predicate.h" |
63 | | #include "storage/segment/binary_dict_page.h" // for BinaryDictPageDecoder |
64 | | #include "storage/segment/binary_plain_page.h" |
65 | | #include "storage/segment/column_meta_accessor.h" |
66 | | #include "storage/segment/encoding_info.h" // for EncodingInfo |
67 | | #include "storage/segment/page_decoder.h" |
68 | | #include "storage/segment/page_handle.h" // for PageHandle |
69 | | #include "storage/segment/page_io.h" |
70 | | #include "storage/segment/page_pointer.h" // for PagePointer |
71 | | #include "storage/segment/row_ranges.h" |
72 | | #include "storage/segment/segment.h" |
73 | | #include "storage/segment/segment_prefetcher.h" |
74 | | #include "storage/segment/variant/variant_column_reader.h" |
75 | | #include "storage/tablet/tablet_schema.h" |
76 | | #include "storage/types.h" // for TypeInfo |
77 | | #include "util/bitmap.h" |
78 | | #include "util/block_compression.h" |
79 | | #include "util/concurrency_stats.h" |
80 | | #include "util/rle_encoding.h" // for RleDecoder |
81 | | #include "util/slice.h" |
82 | | |
83 | | namespace doris::segment_v2 { |
84 | | #include "common/compile_check_begin.h" |
85 | | #include "storage/segment/column_reader.h" |
86 | | |
87 | 833 | inline bool read_as_string(PrimitiveType type) { |
88 | 833 | return type == PrimitiveType::TYPE_STRING || type == PrimitiveType::INVALID_TYPE || |
89 | 833 | type == PrimitiveType::TYPE_BITMAP || type == PrimitiveType::TYPE_FIXED_LENGTH_OBJECT; |
90 | 833 | } |
91 | | |
92 | | Status ColumnReader::create_array(const ColumnReaderOptions& opts, const ColumnMetaPB& meta, |
93 | | const io::FileReaderSPtr& file_reader, |
94 | 71.7k | std::shared_ptr<ColumnReader>* reader) { |
95 | 71.7k | DCHECK(meta.children_columns_size() == 2 || meta.children_columns_size() == 3); |
96 | | |
97 | 71.7k | std::shared_ptr<ColumnReader> item_reader; |
98 | 71.7k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(0), |
99 | 71.7k | meta.children_columns(0).num_rows(), file_reader, |
100 | 71.7k | &item_reader)); |
101 | | |
102 | 71.7k | std::shared_ptr<ColumnReader> offset_reader; |
103 | 71.7k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(1), |
104 | 71.7k | meta.children_columns(1).num_rows(), file_reader, |
105 | 71.7k | &offset_reader)); |
106 | | |
107 | 71.7k | std::shared_ptr<ColumnReader> null_reader; |
108 | 71.7k | if (meta.is_nullable()) { |
109 | 51.6k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(2), |
110 | 51.6k | meta.children_columns(2).num_rows(), file_reader, |
111 | 51.6k | &null_reader)); |
112 | 51.6k | } |
113 | | |
114 | | // The num rows of the array reader equals to the num rows of the length reader. |
115 | 71.7k | uint64_t array_num_rows = meta.children_columns(1).num_rows(); |
116 | 71.7k | std::shared_ptr<ColumnReader> array_reader( |
117 | 71.7k | new ColumnReader(opts, meta, array_num_rows, file_reader)); |
118 | | // array reader do not need to init |
119 | 71.7k | array_reader->_sub_readers.resize(meta.children_columns_size()); |
120 | 71.7k | array_reader->_sub_readers[0] = std::move(item_reader); |
121 | 71.7k | array_reader->_sub_readers[1] = std::move(offset_reader); |
122 | 71.7k | if (meta.is_nullable()) { |
123 | 51.1k | array_reader->_sub_readers[2] = std::move(null_reader); |
124 | 51.1k | } |
125 | 71.7k | array_reader->_meta_type = FieldType::OLAP_FIELD_TYPE_ARRAY; |
126 | 71.7k | *reader = std::move(array_reader); |
127 | 71.7k | return Status::OK(); |
128 | 71.7k | } |
129 | | |
130 | | Status ColumnReader::create_map(const ColumnReaderOptions& opts, const ColumnMetaPB& meta, |
131 | | const io::FileReaderSPtr& file_reader, |
132 | 70.5k | std::shared_ptr<ColumnReader>* reader) { |
133 | | // map reader now has 3 sub readers for key, value, offsets(scalar), null(scala) |
134 | 70.5k | DCHECK(meta.children_columns_size() == 3 || meta.children_columns_size() == 4); |
135 | 70.5k | std::shared_ptr<ColumnReader> key_reader; |
136 | 70.5k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(0), |
137 | 70.5k | meta.children_columns(0).num_rows(), file_reader, |
138 | 70.5k | &key_reader)); |
139 | 70.5k | std::shared_ptr<ColumnReader> val_reader; |
140 | 70.5k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(1), |
141 | 70.5k | meta.children_columns(1).num_rows(), file_reader, |
142 | 70.5k | &val_reader)); |
143 | 70.5k | std::shared_ptr<ColumnReader> offset_reader; |
144 | 70.5k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(2), |
145 | 70.5k | meta.children_columns(2).num_rows(), file_reader, |
146 | 70.5k | &offset_reader)); |
147 | 70.5k | std::shared_ptr<ColumnReader> null_reader; |
148 | 70.5k | if (meta.is_nullable()) { |
149 | 14.2k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(3), |
150 | 14.2k | meta.children_columns(3).num_rows(), file_reader, |
151 | 14.2k | &null_reader)); |
152 | 14.2k | } |
153 | | |
154 | | // The num rows of the map reader equals to the num rows of the length reader. |
155 | 70.5k | uint64_t map_num_rows = meta.children_columns(2).num_rows(); |
156 | 70.5k | std::shared_ptr<ColumnReader> map_reader( |
157 | 70.5k | new ColumnReader(opts, meta, map_num_rows, file_reader)); |
158 | 70.5k | map_reader->_sub_readers.resize(meta.children_columns_size()); |
159 | | |
160 | 70.5k | map_reader->_sub_readers[0] = std::move(key_reader); |
161 | 70.5k | map_reader->_sub_readers[1] = std::move(val_reader); |
162 | 70.5k | map_reader->_sub_readers[2] = std::move(offset_reader); |
163 | 70.5k | if (meta.is_nullable()) { |
164 | 14.2k | map_reader->_sub_readers[3] = std::move(null_reader); |
165 | 14.2k | } |
166 | 70.5k | map_reader->_meta_type = FieldType::OLAP_FIELD_TYPE_MAP; |
167 | 70.5k | *reader = std::move(map_reader); |
168 | 70.5k | return Status::OK(); |
169 | 70.5k | } |
170 | | |
171 | | Status ColumnReader::create_struct(const ColumnReaderOptions& opts, const ColumnMetaPB& meta, |
172 | | uint64_t num_rows, const io::FileReaderSPtr& file_reader, |
173 | 7.79k | std::shared_ptr<ColumnReader>* reader) { |
174 | | // not support empty struct |
175 | 7.79k | DCHECK(meta.children_columns_size() >= 1); |
176 | | // create struct column reader |
177 | 7.79k | std::shared_ptr<ColumnReader> struct_reader( |
178 | 7.79k | new ColumnReader(opts, meta, num_rows, file_reader)); |
179 | 7.79k | struct_reader->_sub_readers.reserve(meta.children_columns_size()); |
180 | | // now we support struct column can add the children columns according to the schema-change behavior |
181 | 40.0k | for (int i = 0; i < meta.children_columns_size(); i++) { |
182 | 32.2k | std::shared_ptr<ColumnReader> sub_reader; |
183 | 32.2k | RETURN_IF_ERROR(ColumnReader::create(opts, meta.children_columns(i), |
184 | 32.2k | meta.children_columns(i).num_rows(), file_reader, |
185 | 32.2k | &sub_reader)); |
186 | 32.2k | struct_reader->_sub_readers.push_back(std::move(sub_reader)); |
187 | 32.2k | } |
188 | 7.79k | struct_reader->_meta_type = FieldType::OLAP_FIELD_TYPE_STRUCT; |
189 | 7.79k | *reader = std::move(struct_reader); |
190 | 7.79k | return Status::OK(); |
191 | 7.79k | } |
192 | | |
193 | | Status ColumnReader::create_agg_state(const ColumnReaderOptions& opts, const ColumnMetaPB& meta, |
194 | | uint64_t num_rows, const io::FileReaderSPtr& file_reader, |
195 | 839 | std::shared_ptr<ColumnReader>* reader) { |
196 | 839 | if (!meta.has_function_name()) { // meet old version ColumnMetaPB |
197 | 0 | std::shared_ptr<ColumnReader> reader_local( |
198 | 0 | new ColumnReader(opts, meta, num_rows, file_reader)); |
199 | 0 | RETURN_IF_ERROR(reader_local->init(&meta)); |
200 | 0 | *reader = std::move(reader_local); |
201 | 0 | return Status::OK(); |
202 | 0 | } |
203 | | |
204 | 839 | auto data_type = DataTypeFactory::instance().create_data_type(meta); |
205 | 839 | const auto* agg_state_type = assert_cast<const DataTypeAggState*>(data_type.get()); |
206 | 839 | agg_state_type->check_function_compatibility(opts.be_exec_version); |
207 | 839 | auto type = agg_state_type->get_serialized_type()->get_primitive_type(); |
208 | | |
209 | 839 | if (read_as_string(type)) { |
210 | 777 | std::shared_ptr<ColumnReader> reader_local( |
211 | 777 | new ColumnReader(opts, meta, num_rows, file_reader)); |
212 | 777 | RETURN_IF_ERROR(reader_local->init(&meta)); |
213 | 777 | *reader = std::move(reader_local); |
214 | 777 | return Status::OK(); |
215 | 777 | } else if (type == PrimitiveType::TYPE_MAP) { |
216 | 44 | return create_map(opts, meta, file_reader, reader); |
217 | 44 | } else if (type == PrimitiveType::TYPE_ARRAY) { |
218 | 11 | return create_array(opts, meta, file_reader, reader); |
219 | 11 | } else if (type == PrimitiveType::TYPE_STRUCT) { |
220 | 0 | return create_struct(opts, meta, num_rows, file_reader, reader); |
221 | 0 | } |
222 | | |
223 | 7 | return Status::InternalError("Not supported type: {}, serialized type: {}", |
224 | 7 | agg_state_type->get_name(), int(type)); |
225 | 839 | } |
226 | | |
227 | 150k | bool ColumnReader::is_compaction_reader_type(ReaderType type) { |
228 | 150k | return type == ReaderType::READER_BASE_COMPACTION || |
229 | 150k | type == ReaderType::READER_CUMULATIVE_COMPACTION || |
230 | 150k | type == ReaderType::READER_COLD_DATA_COMPACTION || |
231 | 150k | type == ReaderType::READER_SEGMENT_COMPACTION || |
232 | 150k | type == ReaderType::READER_FULL_COMPACTION; |
233 | 150k | } |
234 | | |
235 | | Status ColumnReader::create(const ColumnReaderOptions& opts, const ColumnMetaPB& meta, |
236 | | uint64_t num_rows, const io::FileReaderSPtr& file_reader, |
237 | 21.0M | std::shared_ptr<ColumnReader>* reader) { |
238 | 21.0M | if (is_scalar_type((FieldType)meta.type())) { |
239 | 20.9M | std::shared_ptr<ColumnReader> reader_local( |
240 | 20.9M | new ColumnReader(opts, meta, num_rows, file_reader)); |
241 | 20.9M | RETURN_IF_ERROR(reader_local->init(&meta)); |
242 | 20.9M | *reader = std::move(reader_local); |
243 | 20.9M | return Status::OK(); |
244 | 20.9M | } else { |
245 | 174k | auto type = (FieldType)meta.type(); |
246 | 174k | switch (type) { |
247 | 841 | case FieldType::OLAP_FIELD_TYPE_AGG_STATE: { |
248 | 841 | return create_agg_state(opts, meta, num_rows, file_reader, reader); |
249 | 0 | } |
250 | 7.79k | case FieldType::OLAP_FIELD_TYPE_STRUCT: { |
251 | 7.79k | return create_struct(opts, meta, num_rows, file_reader, reader); |
252 | 0 | } |
253 | 72.0k | case FieldType::OLAP_FIELD_TYPE_ARRAY: { |
254 | 72.0k | return create_array(opts, meta, file_reader, reader); |
255 | 0 | } |
256 | 70.5k | case FieldType::OLAP_FIELD_TYPE_MAP: { |
257 | 70.5k | return create_map(opts, meta, file_reader, reader); |
258 | 0 | } |
259 | 22.0k | case FieldType::OLAP_FIELD_TYPE_VARIANT: { |
260 | | // Read variant only root data using a single ColumnReader |
261 | 22.0k | std::shared_ptr<ColumnReader> reader_local( |
262 | 22.0k | new ColumnReader(opts, meta, num_rows, file_reader)); |
263 | 22.0k | RETURN_IF_ERROR(reader_local->init(&meta)); |
264 | 22.0k | *reader = std::move(reader_local); |
265 | 22.0k | return Status::OK(); |
266 | 22.0k | } |
267 | 0 | default: |
268 | 0 | return Status::NotSupported("unsupported type for ColumnReader: {}", |
269 | 0 | std::to_string(int(type))); |
270 | 174k | } |
271 | 174k | } |
272 | 21.0M | } |
273 | | |
274 | 22.0k | ColumnReader::ColumnReader() = default; |
275 | | |
276 | | ColumnReader::ColumnReader(const ColumnReaderOptions& opts, const ColumnMetaPB& meta, |
277 | | uint64_t num_rows, io::FileReaderSPtr file_reader) |
278 | 21.1M | : _use_index_page_cache(!config::disable_storage_page_cache), |
279 | 21.1M | _opts(opts), |
280 | 21.1M | _num_rows(num_rows), |
281 | 21.1M | _file_reader(std::move(file_reader)), |
282 | 21.1M | _dict_encoding_type(UNKNOWN_DICT_ENCODING) { |
283 | 21.1M | _meta_length = meta.length(); |
284 | 21.1M | _meta_type = (FieldType)meta.type(); |
285 | 21.1M | if (_meta_type == FieldType::OLAP_FIELD_TYPE_ARRAY) { |
286 | 71.8k | _meta_children_column_type = (FieldType)meta.children_columns(0).type(); |
287 | 71.8k | } |
288 | 21.1M | _data_type = DataTypeFactory::instance().create_data_type(meta); |
289 | 21.1M | _meta_is_nullable = meta.is_nullable(); |
290 | 21.1M | _meta_dict_page = meta.dict_page(); |
291 | 21.1M | _meta_compression = meta.compression(); |
292 | 21.1M | } |
293 | | |
294 | 21.3M | ColumnReader::~ColumnReader() = default; |
295 | | |
296 | 21.0M | int64_t ColumnReader::get_metadata_size() const { |
297 | 21.0M | return sizeof(ColumnReader) + (_segment_zone_map ? _segment_zone_map->ByteSizeLong() : 0); |
298 | 21.0M | } |
299 | | |
300 | | #ifdef BE_TEST |
301 | | /// This function is only used in UT to verify the correctness of data read from zone map |
302 | | /// See UT case 'SegCompactionMoWTest.SegCompactionInterleaveWithBig_ooooOOoOooooooooO' |
303 | | /// be/test/olap/segcompaction_mow_test.cpp |
304 | | void ColumnReader::check_data_by_zone_map_for_test(const MutableColumnPtr& dst) const { |
305 | | if (!_segment_zone_map) { |
306 | | return; |
307 | | } |
308 | | |
309 | | const auto rows = dst->size(); |
310 | | if (rows == 0) { |
311 | | return; |
312 | | } |
313 | | |
314 | | FieldType type = _type_info->type(); |
315 | | |
316 | | if (type != FieldType::OLAP_FIELD_TYPE_INT) { |
317 | | return; |
318 | | } |
319 | | |
320 | | auto* non_nullable_column = |
321 | | dst->is_nullable() |
322 | | ? assert_cast<ColumnNullable*>(dst.get())->get_nested_column_ptr().get() |
323 | | : dst.get(); |
324 | | |
325 | | /// `PredicateColumnType<TYPE_INT>` does not support `void get(size_t n, Field& res)`, |
326 | | /// So here only check `CoumnVector<TYPE_INT>` |
327 | | if (check_and_get_column<ColumnVector<TYPE_INT>>(non_nullable_column) == nullptr) { |
328 | | return; |
329 | | } |
330 | | |
331 | | ZoneMap zone_map; |
332 | | THROW_IF_ERROR(ZoneMap::from_proto(*_segment_zone_map, _data_type, zone_map)); |
333 | | |
334 | | if (zone_map.has_null) { |
335 | | return; |
336 | | } |
337 | | |
338 | | for (size_t i = 0; i != rows; ++i) { |
339 | | Field field; |
340 | | dst->get(i, field); |
341 | | DCHECK(!field.is_null()); |
342 | | const auto v = field.get<TYPE_INT>(); |
343 | | DCHECK_GE(v, zone_map.min_value.get<TYPE_INT>()); |
344 | | DCHECK_LE(v, zone_map.max_value.get<TYPE_INT>()); |
345 | | } |
346 | | } |
347 | | #endif |
348 | | |
349 | 20.8M | Status ColumnReader::init(const ColumnMetaPB* meta) { |
350 | 20.8M | _type_info = get_type_info(meta); |
351 | | |
352 | 20.8M | if (meta->has_be_exec_version()) { |
353 | 20.7M | _be_exec_version = meta->be_exec_version(); |
354 | 20.7M | } |
355 | | |
356 | 20.8M | if (_type_info == nullptr) { |
357 | 0 | return Status::NotSupported("unsupported typeinfo, type={}", meta->type()); |
358 | 0 | } |
359 | 20.8M | RETURN_IF_ERROR(EncodingInfo::get(_type_info->type(), meta->encoding(), {}, &_encoding_info)); |
360 | | |
361 | 62.1M | for (int i = 0; i < meta->indexes_size(); i++) { |
362 | 41.2M | const auto& index_meta = meta->indexes(i); |
363 | 41.2M | switch (index_meta.type()) { |
364 | 0 | case BITMAP_INDEX: |
365 | 0 | break; |
366 | 20.9M | case ORDINAL_INDEX: |
367 | 20.9M | _ordinal_index.reset( |
368 | 20.9M | new OrdinalIndexReader(_file_reader, _num_rows, index_meta.ordinal_index())); |
369 | 20.9M | break; |
370 | 20.4M | case ZONE_MAP_INDEX: |
371 | 20.4M | _segment_zone_map = |
372 | 20.4M | std::make_unique<ZoneMapPB>(index_meta.zone_map_index().segment_zone_map()); |
373 | 20.4M | _zone_map_index.reset(new ZoneMapIndexReader( |
374 | 20.4M | _file_reader, index_meta.zone_map_index().page_zone_maps())); |
375 | 20.4M | break; |
376 | 5.49k | case BLOOM_FILTER_INDEX: |
377 | 5.49k | _bloom_filter_index.reset( |
378 | 5.49k | new BloomFilterIndexReader(_file_reader, index_meta.bloom_filter_index())); |
379 | 5.49k | break; |
380 | 0 | case NESTED_OFFSETS_INDEX: |
381 | 0 | break; |
382 | 0 | default: |
383 | 0 | return Status::Corruption("Bad file {}: invalid column index type {}", |
384 | 0 | _file_reader->path().native(), index_meta.type()); |
385 | 41.2M | } |
386 | 41.2M | } |
387 | 20.8M | update_metadata_size(); |
388 | | |
389 | | // ArrayColumnWriter writes a single empty array and flushes. In this scenario, |
390 | | // the item writer doesn't write any data and the corresponding ordinal index is empty. |
391 | 20.8M | if (_ordinal_index == nullptr && !is_empty()) { |
392 | 0 | return Status::Corruption("Bad file {}: missing ordinal index for column {}", |
393 | 0 | _file_reader->path().native(), meta->column_id()); |
394 | 0 | } |
395 | | |
396 | 20.8M | return Status::OK(); |
397 | 20.8M | } |
398 | | |
399 | | Status ColumnReader::new_index_iterator(const std::shared_ptr<IndexFileReader>& index_file_reader, |
400 | | const TabletIndex* index_meta, |
401 | 68.4k | std::unique_ptr<IndexIterator>* iterator) { |
402 | 68.4k | RETURN_IF_ERROR(_load_index(index_file_reader, index_meta)); |
403 | 68.4k | { |
404 | 68.4k | std::shared_lock<std::shared_mutex> rlock(_load_index_lock); |
405 | 68.4k | auto iter = _index_readers.find(index_meta->index_id()); |
406 | 68.6k | if (iter != _index_readers.end()) { |
407 | 68.6k | if (iter->second != nullptr) { |
408 | 68.6k | RETURN_IF_ERROR(iter->second->new_iterator(iterator)); |
409 | 68.6k | } |
410 | 68.6k | } |
411 | 68.4k | } |
412 | 68.4k | return Status::OK(); |
413 | 68.4k | } |
414 | | |
415 | | Status ColumnReader::read_page(const ColumnIteratorOptions& iter_opts, const PagePointer& pp, |
416 | | PageHandle* handle, Slice* page_body, PageFooterPB* footer, |
417 | 2.17M | BlockCompressionCodec* codec, bool is_dict_page) const { |
418 | 2.17M | SCOPED_CONCURRENCY_COUNT(ConcurrencyStatsManager::instance().column_reader_read_page); |
419 | 2.17M | iter_opts.sanity_check(); |
420 | 2.17M | PageReadOptions opts(iter_opts.io_ctx); |
421 | 2.17M | opts.verify_checksum = _opts.verify_checksum; |
422 | 2.17M | opts.use_page_cache = iter_opts.use_page_cache; |
423 | 2.17M | opts.kept_in_memory = _opts.kept_in_memory; |
424 | 2.17M | opts.type = iter_opts.type; |
425 | 2.17M | opts.file_reader = iter_opts.file_reader; |
426 | 2.17M | opts.page_pointer = pp; |
427 | 2.17M | opts.codec = codec; |
428 | 2.17M | opts.stats = iter_opts.stats; |
429 | 2.17M | opts.encoding_info = _encoding_info; |
430 | 2.17M | opts.is_dict_page = is_dict_page; |
431 | | |
432 | 2.17M | return PageIO::read_and_decompress_page(opts, handle, page_body, footer); |
433 | 2.17M | } |
434 | | |
435 | | Status ColumnReader::get_row_ranges_by_zone_map( |
436 | | const AndBlockColumnPredicate* col_predicates, |
437 | | const std::vector<std::shared_ptr<const ColumnPredicate>>* delete_predicates, |
438 | 77.7k | RowRanges* row_ranges, const ColumnIteratorOptions& iter_opts) { |
439 | 77.7k | std::vector<uint32_t> page_indexes; |
440 | 77.7k | RETURN_IF_ERROR( |
441 | 77.7k | _get_filtered_pages(col_predicates, delete_predicates, &page_indexes, iter_opts)); |
442 | 77.7k | RETURN_IF_ERROR(_calculate_row_ranges(page_indexes, row_ranges, iter_opts)); |
443 | 77.7k | return Status::OK(); |
444 | 77.7k | } |
445 | | |
446 | 3.03k | Status ColumnReader::next_batch_of_zone_map(size_t* n, MutableColumnPtr& dst) const { |
447 | 3.03k | if (_segment_zone_map == nullptr) { |
448 | 0 | return Status::InternalError("segment zonemap not exist"); |
449 | 0 | } |
450 | | // TODO: this work to get min/max value seems should only do once |
451 | 3.03k | ZoneMap zone_map; |
452 | 3.03k | RETURN_IF_ERROR(ZoneMap::from_proto(*_segment_zone_map, _data_type, zone_map)); |
453 | | |
454 | 3.03k | dst->reserve(*n); |
455 | 3.03k | if (!zone_map.has_not_null) { |
456 | 11 | assert_cast<ColumnNullable&>(*dst).insert_many_defaults(*n); |
457 | 11 | return Status::OK(); |
458 | 11 | } |
459 | 3.02k | dst->insert(zone_map.max_value); |
460 | 6.15k | for (int i = 1; i < *n; ++i) { |
461 | 3.13k | dst->insert(zone_map.min_value); |
462 | 3.13k | } |
463 | 3.02k | return Status::OK(); |
464 | 3.03k | } |
465 | | |
466 | | Status ColumnReader::match_condition(const AndBlockColumnPredicate* col_predicates, |
467 | 1.29M | bool* matched) const { |
468 | 1.29M | *matched = true; |
469 | 1.29M | if (_zone_map_index == nullptr) { |
470 | 0 | return Status::OK(); |
471 | 0 | } |
472 | 1.29M | ZoneMap zone_map; |
473 | 1.29M | RETURN_IF_ERROR(ZoneMap::from_proto(*_segment_zone_map, _data_type, zone_map)); |
474 | | |
475 | 1.29M | *matched = _zone_map_match_condition(zone_map, col_predicates); |
476 | 1.29M | return Status::OK(); |
477 | 1.29M | } |
478 | | |
479 | | Status ColumnReader::prune_predicates_by_zone_map( |
480 | | std::vector<std::shared_ptr<ColumnPredicate>>& predicates, const int column_id, |
481 | 1.21M | bool* pruned) const { |
482 | 1.21M | *pruned = false; |
483 | 1.21M | if (_zone_map_index == nullptr) { |
484 | 121 | return Status::OK(); |
485 | 121 | } |
486 | | |
487 | 1.21M | ZoneMap zone_map; |
488 | 1.21M | RETURN_IF_ERROR(ZoneMap::from_proto(*_segment_zone_map, _data_type, zone_map)); |
489 | 1.21M | if (zone_map.pass_all) { |
490 | 0 | return Status::OK(); |
491 | 0 | } |
492 | | |
493 | 2.56M | for (auto it = predicates.begin(); it != predicates.end();) { |
494 | 1.35M | auto predicate = *it; |
495 | 1.35M | if (predicate->column_id() == column_id && predicate->is_always_true(zone_map)) { |
496 | 13.7k | *pruned = true; |
497 | 13.7k | it = predicates.erase(it); |
498 | 1.34M | } else { |
499 | 1.34M | ++it; |
500 | 1.34M | } |
501 | 1.35M | } |
502 | 1.21M | return Status::OK(); |
503 | 1.21M | } |
504 | | |
505 | | bool ColumnReader::_zone_map_match_condition(const ZoneMap& zone_map, |
506 | 1.38M | const AndBlockColumnPredicate* col_predicates) const { |
507 | 1.38M | if (zone_map.pass_all) { |
508 | 0 | return true; |
509 | 0 | } |
510 | | |
511 | 1.38M | return col_predicates->evaluate_and(zone_map); |
512 | 1.38M | } |
513 | | |
514 | | Status ColumnReader::_get_filtered_pages( |
515 | | const AndBlockColumnPredicate* col_predicates, |
516 | | const std::vector<std::shared_ptr<const ColumnPredicate>>* delete_predicates, |
517 | 77.3k | std::vector<uint32_t>* page_indexes, const ColumnIteratorOptions& iter_opts) { |
518 | 77.3k | RETURN_IF_ERROR(_load_zone_map_index(_use_index_page_cache, _opts.kept_in_memory, iter_opts)); |
519 | | |
520 | 77.3k | const std::vector<ZoneMapPB>& zone_maps = _zone_map_index->page_zone_maps(); |
521 | 77.3k | size_t page_size = _zone_map_index->num_pages(); |
522 | 211k | for (size_t i = 0; i < page_size; ++i) { |
523 | 134k | if (zone_maps[i].pass_all()) { |
524 | 45.0k | page_indexes->push_back(cast_set<uint32_t>(i)); |
525 | 89.4k | } else { |
526 | 89.4k | segment_v2::ZoneMap zone_map; |
527 | 89.4k | RETURN_IF_ERROR(ZoneMap::from_proto(zone_maps[i], _data_type, zone_map)); |
528 | 89.4k | if (_zone_map_match_condition(zone_map, col_predicates)) { |
529 | 87.9k | bool should_read = true; |
530 | 87.9k | if (delete_predicates != nullptr) { |
531 | 4 | for (auto del_pred : *delete_predicates) { |
532 | | // TODO: Both `min_value` and `max_value` should be 0 or neither should be 0. |
533 | | // So nullable only need to judge once. |
534 | 4 | if (del_pred->evaluate_del(zone_map)) { |
535 | 1 | should_read = false; |
536 | 1 | break; |
537 | 1 | } |
538 | 4 | } |
539 | 3 | } |
540 | 87.9k | if (should_read) { |
541 | 87.9k | page_indexes->push_back(cast_set<uint32_t>(i)); |
542 | 87.9k | } |
543 | 87.9k | } |
544 | 89.4k | } |
545 | 134k | } |
546 | 18.4E | VLOG(1) << "total-pages: " << page_size << " not-filtered-pages: " << page_indexes->size() |
547 | 18.4E | << " filtered-percent:" |
548 | 18.4E | << 1.0 - (static_cast<double>(page_indexes->size()) / |
549 | 18.4E | (static_cast<double>(page_size) * 1.0)); |
550 | 77.3k | return Status::OK(); |
551 | 77.3k | } |
552 | | |
553 | | Status ColumnReader::_calculate_row_ranges(const std::vector<uint32_t>& page_indexes, |
554 | | RowRanges* row_ranges, |
555 | 79.4k | const ColumnIteratorOptions& iter_opts) { |
556 | 79.4k | row_ranges->clear(); |
557 | 79.4k | RETURN_IF_ERROR(_load_ordinal_index(_use_index_page_cache, _opts.kept_in_memory, iter_opts)); |
558 | 132k | for (auto i : page_indexes) { |
559 | 132k | ordinal_t page_first_id = _ordinal_index->get_first_ordinal(i); |
560 | 132k | ordinal_t page_last_id = _ordinal_index->get_last_ordinal(i); |
561 | 132k | RowRanges page_row_ranges(RowRanges::create_single(page_first_id, page_last_id + 1)); |
562 | 132k | RowRanges::ranges_union(*row_ranges, page_row_ranges, row_ranges); |
563 | 132k | } |
564 | 79.4k | return Status::OK(); |
565 | 79.4k | } |
566 | | |
567 | | Status ColumnReader::get_row_ranges_by_bloom_filter(const AndBlockColumnPredicate* col_predicates, |
568 | | RowRanges* row_ranges, |
569 | 97 | const ColumnIteratorOptions& iter_opts) { |
570 | 97 | RETURN_IF_ERROR(_load_ordinal_index(_use_index_page_cache, _opts.kept_in_memory, iter_opts)); |
571 | 97 | RETURN_IF_ERROR( |
572 | 97 | _load_bloom_filter_index(_use_index_page_cache, _opts.kept_in_memory, iter_opts)); |
573 | 97 | RowRanges bf_row_ranges; |
574 | 97 | std::unique_ptr<BloomFilterIndexIterator> bf_iter; |
575 | 97 | RETURN_IF_ERROR(_bloom_filter_index->new_iterator(&bf_iter, iter_opts.stats)); |
576 | 97 | size_t range_size = row_ranges->range_size(); |
577 | | // get covered page ids |
578 | 97 | std::set<uint32_t> page_ids; |
579 | 194 | for (int i = 0; i < range_size; ++i) { |
580 | 97 | int64_t from = row_ranges->get_range_from(i); |
581 | 97 | int64_t idx = from; |
582 | 97 | int64_t to = row_ranges->get_range_to(i); |
583 | 97 | auto iter = _ordinal_index->seek_at_or_before(from); |
584 | 221 | while (idx < to && iter.valid()) { |
585 | 124 | page_ids.insert(iter.page_index()); |
586 | 124 | idx = iter.last_ordinal() + 1; |
587 | 124 | iter.next(); |
588 | 124 | } |
589 | 97 | } |
590 | 124 | for (auto& pid : page_ids) { |
591 | 124 | std::unique_ptr<BloomFilter> bf; |
592 | 124 | RETURN_IF_ERROR(bf_iter->read_bloom_filter(pid, &bf)); |
593 | 124 | if (col_predicates->evaluate_and(bf.get())) { |
594 | 21 | bf_row_ranges.add(RowRange(_ordinal_index->get_first_ordinal(pid), |
595 | 21 | _ordinal_index->get_last_ordinal(pid) + 1)); |
596 | 21 | } |
597 | 124 | } |
598 | 97 | RowRanges::ranges_intersection(*row_ranges, bf_row_ranges, row_ranges); |
599 | 97 | return Status::OK(); |
600 | 97 | } |
601 | | |
602 | | Status ColumnReader::_load_ordinal_index(bool use_page_cache, bool kept_in_memory, |
603 | 1.81M | const ColumnIteratorOptions& iter_opts) { |
604 | 1.81M | if (!_ordinal_index) { |
605 | 0 | return Status::InternalError("ordinal_index not inited"); |
606 | 0 | } |
607 | 1.81M | return _ordinal_index->load(use_page_cache, kept_in_memory, iter_opts.stats); |
608 | 1.81M | } |
609 | | |
610 | | Status ColumnReader::_load_zone_map_index(bool use_page_cache, bool kept_in_memory, |
611 | 77.4k | const ColumnIteratorOptions& iter_opts) { |
612 | 77.4k | if (_zone_map_index != nullptr) { |
613 | 77.4k | return _zone_map_index->load(use_page_cache, kept_in_memory, iter_opts.stats); |
614 | 77.4k | } |
615 | 18.4E | return Status::OK(); |
616 | 77.4k | } |
617 | | |
618 | | Status ColumnReader::_load_index(const std::shared_ptr<IndexFileReader>& index_file_reader, |
619 | 68.5k | const TabletIndex* index_meta) { |
620 | 68.5k | std::unique_lock<std::shared_mutex> wlock(_load_index_lock); |
621 | | |
622 | 68.5k | if (index_meta == nullptr) { |
623 | 0 | return Status::Error<ErrorCode::INVERTED_INDEX_CLUCENE_ERROR>( |
624 | 0 | "Failed to load inverted index: index metadata is null"); |
625 | 0 | } |
626 | | |
627 | 68.5k | auto it = _index_readers.find(index_meta->index_id()); |
628 | 68.5k | if (it != _index_readers.end()) { |
629 | 0 | return Status::OK(); |
630 | 0 | } |
631 | | |
632 | 68.5k | bool should_analyzer = |
633 | 68.5k | inverted_index::InvertedIndexAnalyzer::should_analyzer(index_meta->properties()); |
634 | | |
635 | 68.5k | FieldType type; |
636 | 68.5k | if (_meta_type == FieldType::OLAP_FIELD_TYPE_ARRAY) { |
637 | 6.49k | type = _meta_children_column_type; |
638 | 62.0k | } else { |
639 | 62.0k | type = _type_info->type(); |
640 | 62.0k | } |
641 | | |
642 | 68.5k | if (index_meta->index_type() == IndexType::ANN) { |
643 | 142 | _index_readers[index_meta->index_id()] = |
644 | 142 | std::make_shared<AnnIndexReader>(index_meta, index_file_reader); |
645 | 142 | return Status::OK(); |
646 | 142 | } |
647 | | |
648 | 68.4k | IndexReaderPtr index_reader; |
649 | | |
650 | 68.4k | if (is_string_type(type)) { |
651 | 36.6k | if (should_analyzer) { |
652 | 21.0k | try { |
653 | 21.0k | index_reader = FullTextIndexReader::create_shared(index_meta, index_file_reader); |
654 | 21.0k | } catch (const CLuceneError& e) { |
655 | 0 | return Status::Error<ErrorCode::INVERTED_INDEX_CLUCENE_ERROR>( |
656 | 0 | "create FullTextIndexReader error: {}", e.what()); |
657 | 0 | } |
658 | 21.0k | } else { |
659 | 15.5k | try { |
660 | 15.5k | index_reader = |
661 | 15.5k | StringTypeInvertedIndexReader::create_shared(index_meta, index_file_reader); |
662 | 15.5k | } catch (const CLuceneError& e) { |
663 | 0 | return Status::Error<ErrorCode::INVERTED_INDEX_CLUCENE_ERROR>( |
664 | 0 | "create StringTypeInvertedIndexReader error: {}", e.what()); |
665 | 0 | } |
666 | 15.5k | } |
667 | 36.6k | } else if (is_numeric_type(type)) { |
668 | 31.7k | try { |
669 | 31.7k | index_reader = BkdIndexReader::create_shared(index_meta, index_file_reader); |
670 | 31.7k | } catch (const CLuceneError& e) { |
671 | 0 | return Status::Error<ErrorCode::INVERTED_INDEX_CLUCENE_ERROR>( |
672 | 0 | "create BkdIndexReader error: {}", e.what()); |
673 | 0 | } |
674 | 31.7k | } else { |
675 | 106 | return Status::Error<ErrorCode::INVERTED_INDEX_NOT_SUPPORTED>( |
676 | 106 | "Field type {} is not supported for inverted index", type); |
677 | 106 | } |
678 | 68.4k | _index_readers[index_meta->index_id()] = index_reader; |
679 | 68.4k | return Status::OK(); |
680 | 68.4k | } |
681 | | |
682 | 54.9k | bool ColumnReader::has_bloom_filter_index(bool ngram) const { |
683 | 55.3k | if (_bloom_filter_index == nullptr) return false; |
684 | | |
685 | 18.4E | if (ngram) { |
686 | 77 | return _bloom_filter_index->algorithm() == BloomFilterAlgorithmPB::NGRAM_BLOOM_FILTER; |
687 | 18.4E | } else { |
688 | 18.4E | return _bloom_filter_index->algorithm() != BloomFilterAlgorithmPB::NGRAM_BLOOM_FILTER; |
689 | 18.4E | } |
690 | 18.4E | } |
691 | | |
692 | | Status ColumnReader::_load_bloom_filter_index(bool use_page_cache, bool kept_in_memory, |
693 | 97 | const ColumnIteratorOptions& iter_opts) { |
694 | 97 | if (_bloom_filter_index != nullptr) { |
695 | 97 | return _bloom_filter_index->load(use_page_cache, kept_in_memory, iter_opts.stats); |
696 | 97 | } |
697 | 0 | return Status::OK(); |
698 | 97 | } |
699 | | |
700 | | Status ColumnReader::seek_at_or_before(ordinal_t ordinal, OrdinalPageIndexIterator* iter, |
701 | 1.73M | const ColumnIteratorOptions& iter_opts) { |
702 | 1.73M | RETURN_IF_ERROR(_load_ordinal_index(_use_index_page_cache, _opts.kept_in_memory, iter_opts)); |
703 | 1.73M | *iter = _ordinal_index->seek_at_or_before(ordinal); |
704 | 1.73M | if (!iter->valid()) { |
705 | 0 | return Status::NotFound("Failed to seek to ordinal {}, ", ordinal); |
706 | 0 | } |
707 | 1.73M | return Status::OK(); |
708 | 1.73M | } |
709 | | |
710 | | Status ColumnReader::get_ordinal_index_reader(OrdinalIndexReader*& reader, |
711 | 914k | OlapReaderStatistics* index_load_stats) { |
712 | 18.4E | CHECK(_ordinal_index) << fmt::format("ordinal index is null for column reader of type {}", |
713 | 18.4E | std::to_string(int(_meta_type))); |
714 | 914k | RETURN_IF_ERROR( |
715 | 914k | _ordinal_index->load(_use_index_page_cache, _opts.kept_in_memory, index_load_stats)); |
716 | 914k | reader = _ordinal_index.get(); |
717 | 914k | return Status::OK(); |
718 | 914k | } |
719 | | |
720 | 421k | Status ColumnReader::new_iterator(ColumnIteratorUPtr* iterator, const TabletColumn* tablet_column) { |
721 | 421k | return new_iterator(iterator, tablet_column, nullptr); |
722 | 421k | } |
723 | | |
724 | | Status ColumnReader::new_iterator(ColumnIteratorUPtr* iterator, const TabletColumn* tablet_column, |
725 | 19.6M | const StorageReadOptions* opt) { |
726 | 19.6M | if (is_empty()) { |
727 | 47.2k | *iterator = std::make_unique<EmptyFileColumnIterator>(); |
728 | 47.2k | return Status::OK(); |
729 | 47.2k | } |
730 | 19.5M | if (is_scalar_type(_meta_type)) { |
731 | 19.5M | *iterator = std::make_unique<FileColumnIterator>(shared_from_this()); |
732 | 19.5M | (*iterator)->set_column_name(tablet_column ? tablet_column->name() : ""); |
733 | 19.5M | return Status::OK(); |
734 | 19.5M | } else { |
735 | 81.6k | auto type = _meta_type; |
736 | 81.6k | switch (type) { |
737 | 783 | case FieldType::OLAP_FIELD_TYPE_AGG_STATE: { |
738 | 783 | return new_agg_state_iterator(iterator); |
739 | 0 | } |
740 | 7.71k | case FieldType::OLAP_FIELD_TYPE_STRUCT: { |
741 | 7.71k | return new_struct_iterator(iterator, tablet_column); |
742 | 0 | } |
743 | 68.1k | case FieldType::OLAP_FIELD_TYPE_ARRAY: { |
744 | 68.1k | return new_array_iterator(iterator, tablet_column); |
745 | 0 | } |
746 | 33.5k | case FieldType::OLAP_FIELD_TYPE_MAP: { |
747 | 33.5k | return new_map_iterator(iterator, tablet_column); |
748 | 0 | } |
749 | 0 | default: |
750 | 0 | return Status::NotSupported("unsupported type to create iterator: {}", |
751 | 0 | std::to_string(int(type))); |
752 | 81.6k | } |
753 | 81.6k | } |
754 | 19.5M | } |
755 | | |
756 | 779 | Status ColumnReader::new_agg_state_iterator(ColumnIteratorUPtr* iterator) { |
757 | 779 | *iterator = std::make_unique<FileColumnIterator>(shared_from_this()); |
758 | 779 | return Status::OK(); |
759 | 779 | } |
760 | | |
761 | | Status ColumnReader::new_array_iterator(ColumnIteratorUPtr* iterator, |
762 | 67.8k | const TabletColumn* tablet_column) { |
763 | 67.8k | ColumnIteratorUPtr item_iterator; |
764 | 67.8k | RETURN_IF_ERROR(_sub_readers[0]->new_iterator( |
765 | 67.8k | &item_iterator, tablet_column && tablet_column->get_subtype_count() > 0 |
766 | 67.8k | ? &tablet_column->get_sub_column(0) |
767 | 67.8k | : nullptr)); |
768 | | |
769 | 67.8k | item_iterator->set_column_name(tablet_column ? tablet_column->get_sub_column(0).name() : ""); |
770 | | |
771 | 67.8k | ColumnIteratorUPtr offset_iterator; |
772 | 67.8k | RETURN_IF_ERROR(_sub_readers[1]->new_iterator(&offset_iterator, nullptr)); |
773 | 67.8k | auto* file_iter = static_cast<FileColumnIterator*>(offset_iterator.release()); |
774 | 67.8k | OffsetFileColumnIteratorUPtr ofcIter = std::make_unique<OffsetFileColumnIterator>( |
775 | 67.8k | std::unique_ptr<FileColumnIterator>(file_iter)); |
776 | | |
777 | 67.8k | ColumnIteratorUPtr null_iterator; |
778 | 67.8k | if (is_nullable()) { |
779 | 48.1k | RETURN_IF_ERROR(_sub_readers[2]->new_iterator(&null_iterator, nullptr)); |
780 | 48.1k | } |
781 | 67.8k | *iterator = std::make_unique<ArrayFileColumnIterator>(shared_from_this(), std::move(ofcIter), |
782 | 67.8k | std::move(item_iterator), |
783 | 67.8k | std::move(null_iterator)); |
784 | 67.8k | return Status::OK(); |
785 | 67.8k | } |
786 | | |
787 | | Status ColumnReader::new_map_iterator(ColumnIteratorUPtr* iterator, |
788 | 33.4k | const TabletColumn* tablet_column) { |
789 | 33.4k | ColumnIteratorUPtr key_iterator; |
790 | 33.4k | RETURN_IF_ERROR(_sub_readers[0]->new_iterator( |
791 | 33.4k | &key_iterator, tablet_column && tablet_column->get_subtype_count() > 1 |
792 | 33.4k | ? &tablet_column->get_sub_column(0) |
793 | 33.4k | : nullptr)); |
794 | 33.4k | key_iterator->set_column_name(tablet_column ? tablet_column->get_sub_column(0).name() : ""); |
795 | 33.4k | ColumnIteratorUPtr val_iterator; |
796 | 33.4k | RETURN_IF_ERROR(_sub_readers[1]->new_iterator( |
797 | 33.4k | &val_iterator, tablet_column && tablet_column->get_subtype_count() > 1 |
798 | 33.4k | ? &tablet_column->get_sub_column(1) |
799 | 33.4k | : nullptr)); |
800 | 33.4k | val_iterator->set_column_name(tablet_column ? tablet_column->get_sub_column(1).name() : ""); |
801 | 33.4k | ColumnIteratorUPtr offsets_iterator; |
802 | 33.4k | RETURN_IF_ERROR(_sub_readers[2]->new_iterator(&offsets_iterator, nullptr)); |
803 | 33.4k | auto* file_iter = static_cast<FileColumnIterator*>(offsets_iterator.release()); |
804 | 33.4k | OffsetFileColumnIteratorUPtr ofcIter = std::make_unique<OffsetFileColumnIterator>( |
805 | 33.4k | std::unique_ptr<FileColumnIterator>(file_iter)); |
806 | | |
807 | 33.4k | ColumnIteratorUPtr null_iterator; |
808 | 33.4k | if (is_nullable()) { |
809 | 14.0k | RETURN_IF_ERROR(_sub_readers[3]->new_iterator(&null_iterator, nullptr)); |
810 | 14.0k | } |
811 | 33.4k | *iterator = std::make_unique<MapFileColumnIterator>( |
812 | 33.4k | shared_from_this(), std::move(null_iterator), std::move(ofcIter), |
813 | 33.4k | std::move(key_iterator), std::move(val_iterator)); |
814 | 33.4k | return Status::OK(); |
815 | 33.4k | } |
816 | | |
817 | | Status ColumnReader::new_struct_iterator(ColumnIteratorUPtr* iterator, |
818 | 7.71k | const TabletColumn* tablet_column) { |
819 | 7.71k | std::vector<ColumnIteratorUPtr> sub_column_iterators; |
820 | 7.71k | size_t child_size = is_nullable() ? _sub_readers.size() - 1 : _sub_readers.size(); |
821 | 7.71k | size_t tablet_column_size = tablet_column ? tablet_column->get_sub_columns().size() : 0; |
822 | 7.71k | sub_column_iterators.reserve(child_size); |
823 | | |
824 | 32.6k | for (uint64_t i = 0; i < child_size; i++) { |
825 | 24.9k | ColumnIteratorUPtr sub_column_iterator; |
826 | 24.9k | RETURN_IF_ERROR(_sub_readers[i]->new_iterator( |
827 | 24.9k | &sub_column_iterator, tablet_column ? &tablet_column->get_sub_column(i) : nullptr)); |
828 | 24.9k | sub_column_iterator->set_column_name(tablet_column ? tablet_column->get_sub_column(i).name() |
829 | 24.9k | : ""); |
830 | 24.9k | sub_column_iterators.emplace_back(std::move(sub_column_iterator)); |
831 | 24.9k | } |
832 | | |
833 | | // create default_iterator for schema-change behavior which increase column |
834 | 9.01k | for (size_t i = child_size; i < tablet_column_size; i++) { |
835 | 1.30k | TabletColumn column = tablet_column->get_sub_column(i); |
836 | 1.30k | ColumnIteratorUPtr it; |
837 | 1.30k | RETURN_IF_ERROR(Segment::new_default_iterator(column, &it)); |
838 | 1.30k | it->set_column_name(column.name()); |
839 | 1.30k | sub_column_iterators.emplace_back(std::move(it)); |
840 | 1.30k | } |
841 | | |
842 | 7.71k | ColumnIteratorUPtr null_iterator; |
843 | 7.71k | if (is_nullable()) { |
844 | 6.85k | RETURN_IF_ERROR(_sub_readers[child_size]->new_iterator(&null_iterator, nullptr)); |
845 | 6.85k | } |
846 | 7.71k | *iterator = std::make_unique<StructFileColumnIterator>( |
847 | 7.71k | shared_from_this(), std::move(null_iterator), std::move(sub_column_iterators)); |
848 | 7.71k | return Status::OK(); |
849 | 7.71k | } |
850 | | |
851 | | Result<TColumnAccessPaths> ColumnIterator::_get_sub_access_paths( |
852 | 114k | const TColumnAccessPaths& access_paths) { |
853 | 114k | TColumnAccessPaths sub_access_paths = access_paths; |
854 | 175k | for (auto it = sub_access_paths.begin(); it != sub_access_paths.end();) { |
855 | 61.6k | TColumnAccessPath& name_path = *it; |
856 | 61.6k | if (name_path.data_access_path.path.empty()) { |
857 | 1 | return ResultError( |
858 | 1 | Status::InternalError("Invalid access path for struct column: path is empty")); |
859 | 1 | } |
860 | | |
861 | 61.6k | if (!StringCaseEqual()(name_path.data_access_path.path[0], _column_name)) { |
862 | 1 | return ResultError(Status::InternalError( |
863 | 1 | R"(Invalid access path for column: expected name "{}", got "{}")", _column_name, |
864 | 1 | name_path.data_access_path.path[0])); |
865 | 1 | } |
866 | | |
867 | 61.6k | name_path.data_access_path.path.erase(name_path.data_access_path.path.begin()); |
868 | 61.6k | if (!name_path.data_access_path.path.empty()) { |
869 | 4.32k | ++it; |
870 | 57.3k | } else { |
871 | 57.3k | set_need_to_read(); |
872 | 57.3k | it = sub_access_paths.erase(it); |
873 | 57.3k | } |
874 | 61.6k | } |
875 | 114k | return sub_access_paths; |
876 | 114k | } |
877 | | |
878 | | ///====================== MapFileColumnIterator ============================//// |
879 | | MapFileColumnIterator::MapFileColumnIterator(std::shared_ptr<ColumnReader> reader, |
880 | | ColumnIteratorUPtr null_iterator, |
881 | | OffsetFileColumnIteratorUPtr offsets_iterator, |
882 | | ColumnIteratorUPtr key_iterator, |
883 | | ColumnIteratorUPtr val_iterator) |
884 | 33.4k | : _map_reader(reader), |
885 | 33.4k | _offsets_iterator(std::move(offsets_iterator)), |
886 | 33.4k | _key_iterator(std::move(key_iterator)), |
887 | 33.4k | _val_iterator(std::move(val_iterator)) { |
888 | 33.4k | if (_map_reader->is_nullable()) { |
889 | 14.1k | _null_iterator = std::move(null_iterator); |
890 | 14.1k | } |
891 | 33.4k | } |
892 | | |
893 | 33.3k | Status MapFileColumnIterator::init(const ColumnIteratorOptions& opts) { |
894 | 33.3k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
895 | 0 | DLOG(INFO) << "Map column iterator column " << _column_name << " skip reading."; |
896 | 0 | return Status::OK(); |
897 | 0 | } |
898 | 33.3k | RETURN_IF_ERROR(_key_iterator->init(opts)); |
899 | 33.3k | RETURN_IF_ERROR(_val_iterator->init(opts)); |
900 | 33.3k | RETURN_IF_ERROR(_offsets_iterator->init(opts)); |
901 | 33.3k | if (_map_reader->is_nullable()) { |
902 | 14.1k | RETURN_IF_ERROR(_null_iterator->init(opts)); |
903 | 14.1k | } |
904 | 33.3k | return Status::OK(); |
905 | 33.3k | } |
906 | | |
907 | 16.9k | Status MapFileColumnIterator::seek_to_ordinal(ordinal_t ord) { |
908 | 16.9k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
909 | 0 | DLOG(INFO) << "Map column iterator column " << _column_name << " skip reading."; |
910 | 0 | return Status::OK(); |
911 | 0 | } |
912 | | |
913 | 16.9k | if (_map_reader->is_nullable()) { |
914 | 9.76k | RETURN_IF_ERROR(_null_iterator->seek_to_ordinal(ord)); |
915 | 9.76k | } |
916 | 16.9k | RETURN_IF_ERROR(_offsets_iterator->seek_to_ordinal(ord)); |
917 | | // here to use offset info |
918 | 16.9k | ordinal_t offset = 0; |
919 | 16.9k | RETURN_IF_ERROR(_offsets_iterator->_peek_one_offset(&offset)); |
920 | 16.9k | RETURN_IF_ERROR(_key_iterator->seek_to_ordinal(offset)); |
921 | 16.9k | RETURN_IF_ERROR(_val_iterator->seek_to_ordinal(offset)); |
922 | 16.9k | return Status::OK(); |
923 | 16.9k | } |
924 | | |
925 | 5.86k | Status MapFileColumnIterator::init_prefetcher(const SegmentPrefetchParams& params) { |
926 | 5.86k | RETURN_IF_ERROR(_offsets_iterator->init_prefetcher(params)); |
927 | 5.86k | if (_map_reader->is_nullable()) { |
928 | 4.64k | RETURN_IF_ERROR(_null_iterator->init_prefetcher(params)); |
929 | 4.64k | } |
930 | 5.86k | RETURN_IF_ERROR(_key_iterator->init_prefetcher(params)); |
931 | 5.86k | RETURN_IF_ERROR(_val_iterator->init_prefetcher(params)); |
932 | 5.86k | return Status::OK(); |
933 | 5.86k | } |
934 | | |
935 | | void MapFileColumnIterator::collect_prefetchers( |
936 | | std::map<PrefetcherInitMethod, std::vector<SegmentPrefetcher*>>& prefetchers, |
937 | 5.86k | PrefetcherInitMethod init_method) { |
938 | 5.86k | _offsets_iterator->collect_prefetchers(prefetchers, init_method); |
939 | 5.86k | if (_map_reader->is_nullable()) { |
940 | 4.63k | _null_iterator->collect_prefetchers(prefetchers, init_method); |
941 | 4.63k | } |
942 | | // the actual data pages to read of key/value column depends on the read result of offset column, |
943 | | // so we can't init prefetch blocks according to rowids, just prefetch all data blocks here. |
944 | 5.86k | _key_iterator->collect_prefetchers(prefetchers, PrefetcherInitMethod::ALL_DATA_BLOCKS); |
945 | 5.86k | _val_iterator->collect_prefetchers(prefetchers, PrefetcherInitMethod::ALL_DATA_BLOCKS); |
946 | 5.86k | } |
947 | | |
948 | 16.9k | Status MapFileColumnIterator::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
949 | 16.9k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
950 | 0 | DLOG(INFO) << "Map column iterator column " << _column_name << " skip reading."; |
951 | 0 | dst->insert_many_defaults(*n); |
952 | 0 | return Status::OK(); |
953 | 0 | } |
954 | | |
955 | 16.9k | auto& column_map = assert_cast<ColumnMap&, TypeCheckOnRelease::DISABLE>( |
956 | 16.9k | dst->is_nullable() ? static_cast<ColumnNullable&>(*dst).get_nested_column() : *dst); |
957 | 16.9k | auto column_offsets_ptr = column_map.get_offsets_column().assume_mutable(); |
958 | 16.9k | bool offsets_has_null = false; |
959 | 16.9k | ssize_t start = column_offsets_ptr->size(); |
960 | 16.9k | RETURN_IF_ERROR(_offsets_iterator->next_batch(n, column_offsets_ptr, &offsets_has_null)); |
961 | 16.9k | if (*n == 0) { |
962 | 0 | return Status::OK(); |
963 | 0 | } |
964 | 16.9k | auto& column_offsets = static_cast<ColumnArray::ColumnOffsets&>(*column_offsets_ptr); |
965 | 16.9k | RETURN_IF_ERROR(_offsets_iterator->_calculate_offsets(start, column_offsets)); |
966 | 16.9k | DCHECK(column_offsets.get_data().back() >= column_offsets.get_data()[start - 1]); |
967 | 16.9k | size_t num_items = |
968 | 16.9k | column_offsets.get_data().back() - column_offsets.get_data()[start - 1]; // -1 is valid |
969 | 16.9k | auto key_ptr = column_map.get_keys().assume_mutable(); |
970 | 16.9k | auto val_ptr = column_map.get_values().assume_mutable(); |
971 | | |
972 | 16.9k | if (num_items > 0) { |
973 | 12.5k | size_t num_read = num_items; |
974 | 12.5k | bool key_has_null = false; |
975 | 12.5k | bool val_has_null = false; |
976 | 12.5k | RETURN_IF_ERROR(_key_iterator->next_batch(&num_read, key_ptr, &key_has_null)); |
977 | 12.5k | RETURN_IF_ERROR(_val_iterator->next_batch(&num_read, val_ptr, &val_has_null)); |
978 | 12.5k | DCHECK(num_read == num_items); |
979 | | |
980 | 12.5k | column_map.get_keys_ptr() = std::move(key_ptr); |
981 | 12.5k | column_map.get_values_ptr() = std::move(val_ptr); |
982 | 12.5k | } |
983 | | |
984 | 16.9k | if (dst->is_nullable()) { |
985 | 9.76k | size_t num_read = *n; |
986 | 9.76k | auto null_map_ptr = static_cast<ColumnNullable&>(*dst).get_null_map_column_ptr(); |
987 | | // in not-null to null linked-schemachange mode, |
988 | | // actually we do not change dat data include meta in footer, |
989 | | // so may dst from changed meta which is nullable but old data is not nullable, |
990 | | // if so, we should set null_map to all null by default |
991 | 9.76k | if (_null_iterator) { |
992 | 9.76k | bool null_signs_has_null = false; |
993 | 9.76k | RETURN_IF_ERROR( |
994 | 9.76k | _null_iterator->next_batch(&num_read, null_map_ptr, &null_signs_has_null)); |
995 | 9.76k | } else { |
996 | 0 | auto& null_map = assert_cast<ColumnUInt8&, TypeCheckOnRelease::DISABLE>(*null_map_ptr); |
997 | 0 | null_map.insert_many_vals(0, num_read); |
998 | 0 | } |
999 | 9.76k | DCHECK(num_read == *n); |
1000 | 9.76k | } |
1001 | 16.9k | return Status::OK(); |
1002 | 16.9k | } |
1003 | | |
1004 | | Status MapFileColumnIterator::read_by_rowids(const rowid_t* rowids, const size_t count, |
1005 | 16.0k | MutableColumnPtr& dst) { |
1006 | 16.0k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1007 | 1 | DLOG(INFO) << "File column iterator column " << _column_name << " skip reading."; |
1008 | 1 | dst->insert_many_defaults(count); |
1009 | 1 | return Status::OK(); |
1010 | 1 | } |
1011 | 16.0k | if (count == 0) { |
1012 | 0 | return Status::OK(); |
1013 | 0 | } |
1014 | | // resolve ColumnMap and nullable wrapper |
1015 | 16.0k | const auto* column_map = check_and_get_column<ColumnMap>( |
1016 | 16.0k | dst->is_nullable() ? static_cast<ColumnNullable&>(*dst).get_nested_column() : *dst); |
1017 | 16.0k | auto offsets_ptr = column_map->get_offsets_column().assume_mutable(); |
1018 | 16.0k | auto& offsets = static_cast<ColumnArray::ColumnOffsets&>(*offsets_ptr); |
1019 | 16.0k | size_t base = offsets.get_data().empty() ? 0 : offsets.get_data().back(); |
1020 | | |
1021 | | // 1. bulk read null-map if nullable |
1022 | 16.0k | std::vector<uint8_t> null_mask; // 0: not null, 1: null |
1023 | 16.0k | if (_map_reader->is_nullable()) { |
1024 | | // For nullable map columns, the destination column must also be nullable. |
1025 | 3.02k | if (UNLIKELY(!dst->is_nullable())) { |
1026 | 0 | return Status::InternalError( |
1027 | 0 | "unexpected non-nullable destination column for nullable map reader"); |
1028 | 0 | } |
1029 | 3.02k | auto null_map_ptr = static_cast<ColumnNullable&>(*dst).get_null_map_column_ptr(); |
1030 | 3.02k | size_t null_before = null_map_ptr->size(); |
1031 | 3.02k | RETURN_IF_ERROR(_null_iterator->read_by_rowids(rowids, count, null_map_ptr)); |
1032 | | // extract a light-weight view to decide element reads |
1033 | 3.02k | auto& null_map_col = assert_cast<ColumnUInt8&>(*null_map_ptr); |
1034 | 3.02k | null_mask.reserve(count); |
1035 | 38.8k | for (size_t i = 0; i < count; ++i) { |
1036 | 35.8k | null_mask.push_back(null_map_col.get_element(null_before + i)); |
1037 | 35.8k | } |
1038 | 13.0k | } else if (dst->is_nullable()) { |
1039 | | // in not-null to null linked-schemachange mode, |
1040 | | // actually we do not change dat data include meta in footer, |
1041 | | // so may dst from changed meta which is nullable but old data is not nullable, |
1042 | | // if so, we should set null_map to all null by default |
1043 | 1 | auto null_map_ptr = static_cast<ColumnNullable&>(*dst).get_null_map_column_ptr(); |
1044 | 1 | auto& null_map = assert_cast<ColumnUInt8&>(*null_map_ptr); |
1045 | 1 | null_map.insert_many_vals(0, count); |
1046 | 1 | } |
1047 | | |
1048 | | // 2. bulk read start ordinals for requested rows |
1049 | 16.0k | MutableColumnPtr starts_col = ColumnOffset64::create(); |
1050 | 16.0k | starts_col->reserve(count); |
1051 | 16.0k | RETURN_IF_ERROR(_offsets_iterator->read_by_rowids(rowids, count, starts_col)); |
1052 | | |
1053 | | // 3. bulk read next-start ordinals for rowid+1 (within bounds) |
1054 | 16.0k | std::vector<rowid_t> next_rowids(count); |
1055 | 349k | for (size_t i = 0; i < count; ++i) { |
1056 | 333k | uint64_t nr = rowids[i] + 1; |
1057 | 333k | next_rowids[i] = nr < _map_reader->num_rows() ? static_cast<rowid_t>(nr) |
1058 | 333k | : static_cast<rowid_t>(0); // placeholder |
1059 | 333k | } |
1060 | 16.0k | MutableColumnPtr next_starts_col = ColumnOffset64::create(); |
1061 | 16.0k | next_starts_col->reserve(count); |
1062 | | // read for all; we'll fix out-of-bound cases below |
1063 | 16.0k | RETURN_IF_ERROR(_offsets_iterator->read_by_rowids(next_rowids.data(), count, next_starts_col)); |
1064 | | |
1065 | | // 4. fix next_start for rows whose next_rowid is out-of-bound (rowid == num_rows-1) |
1066 | 345k | for (size_t i = 0; i < count; ++i) { |
1067 | 329k | if (rowids[i] + 1 >= _map_reader->num_rows()) { |
1068 | | // seek to the last row and consume one to move decoder to end-of-page, |
1069 | | // then peek page-tail sentinel next_array_item_ordinal as next_start |
1070 | 14.1k | RETURN_IF_ERROR(_offsets_iterator->seek_to_ordinal(rowids[i])); |
1071 | 14.1k | size_t one = 1; |
1072 | 14.1k | bool has_null_unused = false; |
1073 | 14.1k | MutableColumnPtr tmp = ColumnOffset64::create(); |
1074 | 14.1k | RETURN_IF_ERROR(_offsets_iterator->next_batch(&one, tmp, &has_null_unused)); |
1075 | 14.1k | ordinal_t ns = 0; |
1076 | 14.1k | RETURN_IF_ERROR(_offsets_iterator->_peek_one_offset(&ns)); |
1077 | | // overwrite with sentinel |
1078 | 14.1k | assert_cast<ColumnOffset64&, TypeCheckOnRelease::DISABLE>(*next_starts_col) |
1079 | 14.1k | .get_data()[i] = ns; |
1080 | 14.1k | } |
1081 | 329k | } |
1082 | | |
1083 | | // 5. compute sizes and append offsets prefix-sum |
1084 | 16.0k | auto& starts_data = assert_cast<ColumnOffset64&>(*starts_col).get_data(); |
1085 | 16.0k | auto& next_starts_data = assert_cast<ColumnOffset64&>(*next_starts_col).get_data(); |
1086 | 16.0k | std::vector<size_t> sizes(count, 0); |
1087 | 16.0k | size_t acc = base; |
1088 | 16.0k | const auto original_size = offsets.get_data().back(); |
1089 | 16.0k | offsets.get_data().reserve(offsets.get_data().size() + count); |
1090 | 336k | for (size_t i = 0; i < count; ++i) { |
1091 | 320k | size_t sz = static_cast<size_t>(next_starts_data[i] - starts_data[i]); |
1092 | 320k | if (_map_reader->is_nullable() && !null_mask.empty() && null_mask[i]) { |
1093 | 705 | sz = 0; // null rows do not consume elements |
1094 | 705 | } |
1095 | 320k | sizes[i] = sz; |
1096 | 320k | acc += sz; |
1097 | 320k | offsets.get_data().push_back(acc); |
1098 | 320k | } |
1099 | | |
1100 | | // 6. read key/value elements for non-empty sizes |
1101 | 16.0k | auto keys_ptr = column_map->get_keys().assume_mutable(); |
1102 | 16.0k | auto vals_ptr = column_map->get_values().assume_mutable(); |
1103 | | |
1104 | 16.0k | size_t this_run = sizes[0]; |
1105 | 16.0k | auto start_idx = starts_data[0]; |
1106 | 16.0k | auto last_idx = starts_data[0] + this_run; |
1107 | 323k | for (size_t i = 1; i < count; ++i) { |
1108 | 306k | size_t sz = sizes[i]; |
1109 | 306k | if (sz == 0) { |
1110 | 168k | continue; |
1111 | 168k | } |
1112 | 138k | auto start = static_cast<ordinal_t>(starts_data[i]); |
1113 | 138k | if (start != last_idx) { |
1114 | 135 | size_t n = this_run; |
1115 | 135 | bool dummy_has_null = false; |
1116 | | |
1117 | 135 | if (this_run != 0) { |
1118 | 135 | if (_key_iterator->reading_flag() != ReadingFlag::SKIP_READING) { |
1119 | 135 | RETURN_IF_ERROR(_key_iterator->seek_to_ordinal(start_idx)); |
1120 | 135 | RETURN_IF_ERROR(_key_iterator->next_batch(&n, keys_ptr, &dummy_has_null)); |
1121 | 135 | DCHECK(n == this_run); |
1122 | 135 | } |
1123 | | |
1124 | 135 | if (_val_iterator->reading_flag() != ReadingFlag::SKIP_READING) { |
1125 | 135 | n = this_run; |
1126 | 135 | RETURN_IF_ERROR(_val_iterator->seek_to_ordinal(start_idx)); |
1127 | 135 | RETURN_IF_ERROR(_val_iterator->next_batch(&n, vals_ptr, &dummy_has_null)); |
1128 | 135 | DCHECK(n == this_run); |
1129 | 135 | } |
1130 | 135 | } |
1131 | 135 | start_idx = start; |
1132 | 135 | this_run = sz; |
1133 | 135 | last_idx = start + sz; |
1134 | 135 | continue; |
1135 | 135 | } |
1136 | | |
1137 | 138k | this_run += sz; |
1138 | 138k | last_idx += sz; |
1139 | 138k | } |
1140 | | |
1141 | 16.0k | size_t n = this_run; |
1142 | 16.0k | const size_t total_count = offsets.get_data().back() - original_size; |
1143 | 16.0k | bool dummy_has_null = false; |
1144 | 16.0k | if (_key_iterator->reading_flag() != ReadingFlag::SKIP_READING) { |
1145 | 16.0k | if (this_run != 0) { |
1146 | 6.01k | RETURN_IF_ERROR(_key_iterator->seek_to_ordinal(start_idx)); |
1147 | 6.01k | RETURN_IF_ERROR(_key_iterator->next_batch(&n, keys_ptr, &dummy_has_null)); |
1148 | 6.01k | DCHECK(n == this_run); |
1149 | 6.01k | } |
1150 | 16.0k | } else { |
1151 | 7 | keys_ptr->insert_many_defaults(total_count); |
1152 | 7 | } |
1153 | | |
1154 | 16.0k | if (_val_iterator->reading_flag() != ReadingFlag::SKIP_READING) { |
1155 | 16.0k | if (this_run != 0) { |
1156 | 6.01k | n = this_run; |
1157 | 6.01k | RETURN_IF_ERROR(_val_iterator->seek_to_ordinal(start_idx)); |
1158 | 6.01k | RETURN_IF_ERROR(_val_iterator->next_batch(&n, vals_ptr, &dummy_has_null)); |
1159 | 6.01k | DCHECK(n == this_run); |
1160 | 6.01k | } |
1161 | 16.0k | } else { |
1162 | 9 | vals_ptr->insert_many_defaults(total_count); |
1163 | 9 | } |
1164 | | |
1165 | 16.0k | return Status::OK(); |
1166 | 16.0k | } |
1167 | | |
1168 | 5.96k | void MapFileColumnIterator::set_need_to_read() { |
1169 | 5.96k | set_reading_flag(ReadingFlag::NEED_TO_READ); |
1170 | 5.96k | _key_iterator->set_need_to_read(); |
1171 | 5.96k | _val_iterator->set_need_to_read(); |
1172 | 5.96k | } |
1173 | | |
1174 | 6.58k | void MapFileColumnIterator::remove_pruned_sub_iterators() { |
1175 | 6.58k | _key_iterator->remove_pruned_sub_iterators(); |
1176 | 6.58k | _val_iterator->remove_pruned_sub_iterators(); |
1177 | 6.58k | } |
1178 | | |
1179 | | Status MapFileColumnIterator::set_access_paths(const TColumnAccessPaths& all_access_paths, |
1180 | 6.29k | const TColumnAccessPaths& predicate_access_paths) { |
1181 | 6.29k | if (all_access_paths.empty()) { |
1182 | 1.50k | return Status::OK(); |
1183 | 1.50k | } |
1184 | | |
1185 | 4.78k | if (!predicate_access_paths.empty()) { |
1186 | 41 | set_reading_flag(ReadingFlag::READING_FOR_PREDICATE); |
1187 | 41 | DLOG(INFO) << "Map column iterator set sub-column " << _column_name |
1188 | 41 | << " to READING_FOR_PREDICATE"; |
1189 | 41 | } |
1190 | | |
1191 | 4.78k | auto sub_all_access_paths = DORIS_TRY(_get_sub_access_paths(all_access_paths)); |
1192 | 4.78k | auto sub_predicate_access_paths = DORIS_TRY(_get_sub_access_paths(predicate_access_paths)); |
1193 | | |
1194 | 4.78k | if (sub_all_access_paths.empty()) { |
1195 | 4.17k | return Status::OK(); |
1196 | 4.17k | } |
1197 | | |
1198 | 609 | TColumnAccessPaths key_all_access_paths; |
1199 | 609 | TColumnAccessPaths val_all_access_paths; |
1200 | 609 | TColumnAccessPaths key_predicate_access_paths; |
1201 | 609 | TColumnAccessPaths val_predicate_access_paths; |
1202 | | |
1203 | 711 | for (auto paths : sub_all_access_paths) { |
1204 | 711 | if (paths.data_access_path.path[0] == "*") { |
1205 | 167 | paths.data_access_path.path[0] = _key_iterator->column_name(); |
1206 | 167 | key_all_access_paths.emplace_back(paths); |
1207 | 167 | paths.data_access_path.path[0] = _val_iterator->column_name(); |
1208 | 167 | val_all_access_paths.emplace_back(paths); |
1209 | 544 | } else if (paths.data_access_path.path[0] == "KEYS") { |
1210 | 257 | paths.data_access_path.path[0] = _key_iterator->column_name(); |
1211 | 257 | key_all_access_paths.emplace_back(paths); |
1212 | 287 | } else if (paths.data_access_path.path[0] == "VALUES") { |
1213 | 285 | paths.data_access_path.path[0] = _val_iterator->column_name(); |
1214 | 285 | val_all_access_paths.emplace_back(paths); |
1215 | 285 | } |
1216 | 711 | } |
1217 | 609 | const auto need_read_keys = !key_all_access_paths.empty(); |
1218 | 609 | const auto need_read_values = !val_all_access_paths.empty(); |
1219 | | |
1220 | 609 | for (auto paths : sub_predicate_access_paths) { |
1221 | 3 | if (paths.data_access_path.path[0] == "*") { |
1222 | 3 | paths.data_access_path.path[0] = _key_iterator->column_name(); |
1223 | 3 | key_predicate_access_paths.emplace_back(paths); |
1224 | 3 | paths.data_access_path.path[0] = _val_iterator->column_name(); |
1225 | 3 | val_predicate_access_paths.emplace_back(paths); |
1226 | 3 | } else if (paths.data_access_path.path[0] == "KEYS") { |
1227 | 0 | paths.data_access_path.path[0] = _key_iterator->column_name(); |
1228 | 0 | key_predicate_access_paths.emplace_back(paths); |
1229 | 0 | } else if (paths.data_access_path.path[0] == "VALUES") { |
1230 | 0 | paths.data_access_path.path[0] = _val_iterator->column_name(); |
1231 | 0 | val_predicate_access_paths.emplace_back(paths); |
1232 | 0 | } |
1233 | 3 | } |
1234 | | |
1235 | 609 | if (need_read_keys) { |
1236 | 428 | _key_iterator->set_reading_flag(ReadingFlag::NEED_TO_READ); |
1237 | 428 | RETURN_IF_ERROR( |
1238 | 428 | _key_iterator->set_access_paths(key_all_access_paths, key_predicate_access_paths)); |
1239 | 428 | } else { |
1240 | 181 | _key_iterator->set_reading_flag(ReadingFlag::SKIP_READING); |
1241 | 181 | DLOG(INFO) << "Map column iterator set key column to SKIP_READING"; |
1242 | 181 | } |
1243 | | |
1244 | 609 | if (need_read_values) { |
1245 | 459 | _val_iterator->set_reading_flag(ReadingFlag::NEED_TO_READ); |
1246 | 459 | RETURN_IF_ERROR( |
1247 | 459 | _val_iterator->set_access_paths(val_all_access_paths, val_predicate_access_paths)); |
1248 | 459 | } else { |
1249 | 150 | _val_iterator->set_reading_flag(ReadingFlag::SKIP_READING); |
1250 | 150 | DLOG(INFO) << "Map column iterator set value column to SKIP_READING"; |
1251 | 150 | } |
1252 | 609 | return Status::OK(); |
1253 | 609 | } |
1254 | | |
1255 | | //////////////////////////////////////////////////////////////////////////////// |
1256 | | |
1257 | | StructFileColumnIterator::StructFileColumnIterator( |
1258 | | std::shared_ptr<ColumnReader> reader, ColumnIteratorUPtr null_iterator, |
1259 | | std::vector<ColumnIteratorUPtr>&& sub_column_iterators) |
1260 | 7.71k | : _struct_reader(reader), _sub_column_iterators(std::move(sub_column_iterators)) { |
1261 | 7.71k | if (_struct_reader->is_nullable()) { |
1262 | 6.85k | _null_iterator = std::move(null_iterator); |
1263 | 6.85k | } |
1264 | 7.71k | } |
1265 | | |
1266 | 7.68k | Status StructFileColumnIterator::init(const ColumnIteratorOptions& opts) { |
1267 | 7.68k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1268 | 0 | DLOG(INFO) << "Struct column iterator column " << _column_name << " skip reading."; |
1269 | 0 | return Status::OK(); |
1270 | 0 | } |
1271 | | |
1272 | 26.1k | for (auto& column_iterator : _sub_column_iterators) { |
1273 | 26.1k | RETURN_IF_ERROR(column_iterator->init(opts)); |
1274 | 26.1k | } |
1275 | 7.68k | if (_struct_reader->is_nullable()) { |
1276 | 6.83k | RETURN_IF_ERROR(_null_iterator->init(opts)); |
1277 | 6.83k | } |
1278 | 7.68k | return Status::OK(); |
1279 | 7.68k | } |
1280 | | |
1281 | 4.41k | Status StructFileColumnIterator::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
1282 | 4.41k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1283 | 0 | DLOG(INFO) << "Struct column iterator column " << _column_name << " skip reading."; |
1284 | 0 | dst->insert_many_defaults(*n); |
1285 | 0 | return Status::OK(); |
1286 | 0 | } |
1287 | | |
1288 | 4.41k | auto& column_struct = assert_cast<ColumnStruct&, TypeCheckOnRelease::DISABLE>( |
1289 | 4.41k | dst->is_nullable() ? static_cast<ColumnNullable&>(*dst).get_nested_column() : *dst); |
1290 | 17.6k | for (size_t i = 0; i < column_struct.tuple_size(); i++) { |
1291 | 13.2k | size_t num_read = *n; |
1292 | 13.2k | auto sub_column_ptr = column_struct.get_column(i).assume_mutable(); |
1293 | 13.2k | bool column_has_null = false; |
1294 | 13.2k | RETURN_IF_ERROR( |
1295 | 13.2k | _sub_column_iterators[i]->next_batch(&num_read, sub_column_ptr, &column_has_null)); |
1296 | 13.2k | DCHECK(num_read == *n); |
1297 | 13.2k | column_struct.get_column_ptr(i) = std::move(sub_column_ptr); |
1298 | 13.2k | } |
1299 | | |
1300 | 4.41k | if (dst->is_nullable()) { |
1301 | 4.07k | size_t num_read = *n; |
1302 | 4.07k | auto null_map_ptr = static_cast<ColumnNullable&>(*dst).get_null_map_column_ptr(); |
1303 | | // in not-null to null linked-schemachange mode, |
1304 | | // actually we do not change dat data include meta in footer, |
1305 | | // so may dst from changed meta which is nullable but old data is not nullable, |
1306 | | // if so, we should set null_map to all null by default |
1307 | 4.07k | if (_null_iterator) { |
1308 | 3.98k | bool null_signs_has_null = false; |
1309 | 3.98k | RETURN_IF_ERROR( |
1310 | 3.98k | _null_iterator->next_batch(&num_read, null_map_ptr, &null_signs_has_null)); |
1311 | 3.98k | } else { |
1312 | 89 | auto& null_map = assert_cast<ColumnUInt8&, TypeCheckOnRelease::DISABLE>(*null_map_ptr); |
1313 | 89 | null_map.insert_many_vals(0, num_read); |
1314 | 89 | } |
1315 | 4.07k | DCHECK(num_read == *n); |
1316 | 4.07k | } |
1317 | | |
1318 | 4.41k | return Status::OK(); |
1319 | 4.41k | } |
1320 | | |
1321 | 4.41k | Status StructFileColumnIterator::seek_to_ordinal(ordinal_t ord) { |
1322 | 4.41k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1323 | 0 | DLOG(INFO) << "Struct column iterator column " << _column_name << " skip reading."; |
1324 | 0 | return Status::OK(); |
1325 | 0 | } |
1326 | | |
1327 | 13.2k | for (auto& column_iterator : _sub_column_iterators) { |
1328 | 13.2k | RETURN_IF_ERROR(column_iterator->seek_to_ordinal(ord)); |
1329 | 13.2k | } |
1330 | 4.41k | if (_struct_reader->is_nullable()) { |
1331 | 3.98k | RETURN_IF_ERROR(_null_iterator->seek_to_ordinal(ord)); |
1332 | 3.98k | } |
1333 | 4.41k | return Status::OK(); |
1334 | 4.41k | } |
1335 | | |
1336 | 3.34k | Status StructFileColumnIterator::init_prefetcher(const SegmentPrefetchParams& params) { |
1337 | 10.5k | for (auto& column_iterator : _sub_column_iterators) { |
1338 | 10.5k | RETURN_IF_ERROR(column_iterator->init_prefetcher(params)); |
1339 | 10.5k | } |
1340 | 3.34k | if (_struct_reader->is_nullable()) { |
1341 | 2.99k | RETURN_IF_ERROR(_null_iterator->init_prefetcher(params)); |
1342 | 2.99k | } |
1343 | 3.34k | return Status::OK(); |
1344 | 3.34k | } |
1345 | | |
1346 | | void StructFileColumnIterator::collect_prefetchers( |
1347 | | std::map<PrefetcherInitMethod, std::vector<SegmentPrefetcher*>>& prefetchers, |
1348 | 3.35k | PrefetcherInitMethod init_method) { |
1349 | 10.5k | for (auto& column_iterator : _sub_column_iterators) { |
1350 | 10.5k | column_iterator->collect_prefetchers(prefetchers, init_method); |
1351 | 10.5k | } |
1352 | 3.35k | if (_struct_reader->is_nullable()) { |
1353 | 2.99k | _null_iterator->collect_prefetchers(prefetchers, init_method); |
1354 | 2.99k | } |
1355 | 3.35k | } |
1356 | | |
1357 | | Status StructFileColumnIterator::read_by_rowids(const rowid_t* rowids, const size_t count, |
1358 | 2.49k | MutableColumnPtr& dst) { |
1359 | 2.49k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1360 | 0 | DLOG(INFO) << "Struct column iterator column " << _column_name << " skip reading."; |
1361 | 0 | dst->insert_many_defaults(count); |
1362 | 0 | return Status::OK(); |
1363 | 0 | } |
1364 | | |
1365 | 2.49k | if (count == 0) { |
1366 | 0 | return Status::OK(); |
1367 | 0 | } |
1368 | | |
1369 | 2.49k | size_t this_run = 1; |
1370 | 2.49k | auto start_idx = rowids[0]; |
1371 | 2.49k | auto last_idx = rowids[0]; |
1372 | 2.57k | for (size_t i = 1; i < count; ++i) { |
1373 | 89 | if (last_idx == rowids[i] - 1) { |
1374 | 85 | last_idx = rowids[i]; |
1375 | 85 | this_run++; |
1376 | 85 | continue; |
1377 | 85 | } |
1378 | 4 | RETURN_IF_ERROR(seek_to_ordinal(start_idx)); |
1379 | 4 | size_t num_read = this_run; |
1380 | 4 | RETURN_IF_ERROR(next_batch(&num_read, dst, nullptr)); |
1381 | 4 | DCHECK_EQ(num_read, this_run); |
1382 | | |
1383 | 4 | start_idx = rowids[i]; |
1384 | 4 | last_idx = rowids[i]; |
1385 | 4 | this_run = 1; |
1386 | 4 | } |
1387 | | |
1388 | 2.49k | RETURN_IF_ERROR(seek_to_ordinal(start_idx)); |
1389 | 2.49k | size_t num_read = this_run; |
1390 | 2.49k | RETURN_IF_ERROR(next_batch(&num_read, dst, nullptr)); |
1391 | 2.49k | DCHECK_EQ(num_read, this_run); |
1392 | 2.49k | return Status::OK(); |
1393 | 2.49k | } |
1394 | | |
1395 | 6.60k | void StructFileColumnIterator::set_need_to_read() { |
1396 | 6.60k | set_reading_flag(ReadingFlag::NEED_TO_READ); |
1397 | 23.3k | for (auto& sub_iterator : _sub_column_iterators) { |
1398 | 23.3k | sub_iterator->set_need_to_read(); |
1399 | 23.3k | } |
1400 | 6.60k | } |
1401 | | |
1402 | 6.64k | void StructFileColumnIterator::remove_pruned_sub_iterators() { |
1403 | 30.1k | for (auto it = _sub_column_iterators.begin(); it != _sub_column_iterators.end();) { |
1404 | 23.5k | auto& sub_iterator = *it; |
1405 | 23.5k | if (sub_iterator->reading_flag() == ReadingFlag::SKIP_READING) { |
1406 | 33 | DLOG(INFO) << "Struct column iterator remove pruned sub-column " |
1407 | 33 | << sub_iterator->column_name(); |
1408 | 33 | it = _sub_column_iterators.erase(it); |
1409 | 23.4k | } else { |
1410 | 23.4k | sub_iterator->remove_pruned_sub_iterators(); |
1411 | 23.4k | ++it; |
1412 | 23.4k | } |
1413 | 23.5k | } |
1414 | 6.64k | } |
1415 | | |
1416 | | Status StructFileColumnIterator::set_access_paths( |
1417 | | const TColumnAccessPaths& all_access_paths, |
1418 | 6.10k | const TColumnAccessPaths& predicate_access_paths) { |
1419 | 6.10k | if (all_access_paths.empty()) { |
1420 | 1.86k | return Status::OK(); |
1421 | 1.86k | } |
1422 | | |
1423 | 4.23k | if (!predicate_access_paths.empty()) { |
1424 | 50 | set_reading_flag(ReadingFlag::READING_FOR_PREDICATE); |
1425 | 50 | DLOG(INFO) << "Struct column iterator set sub-column " << _column_name |
1426 | 50 | << " to READING_FOR_PREDICATE"; |
1427 | 50 | } |
1428 | 4.23k | auto sub_all_access_paths = DORIS_TRY(_get_sub_access_paths(all_access_paths)); |
1429 | 4.23k | auto sub_predicate_access_paths = DORIS_TRY(_get_sub_access_paths(predicate_access_paths)); |
1430 | | |
1431 | 4.23k | const auto no_sub_column_to_skip = sub_all_access_paths.empty(); |
1432 | 4.23k | const auto no_predicate_sub_column = sub_predicate_access_paths.empty(); |
1433 | | |
1434 | 18.0k | for (auto& sub_iterator : _sub_column_iterators) { |
1435 | 18.0k | const auto name = sub_iterator->column_name(); |
1436 | 18.0k | bool need_to_read = no_sub_column_to_skip; |
1437 | 18.0k | TColumnAccessPaths sub_all_access_paths_of_this; |
1438 | 18.0k | if (!need_to_read) { |
1439 | 475 | for (const auto& paths : sub_all_access_paths) { |
1440 | 475 | if (paths.data_access_path.path[0] == name) { |
1441 | 142 | sub_all_access_paths_of_this.emplace_back(paths); |
1442 | 142 | } |
1443 | 475 | } |
1444 | 177 | need_to_read = !sub_all_access_paths_of_this.empty(); |
1445 | 177 | } |
1446 | | |
1447 | 18.0k | if (!need_to_read) { |
1448 | 36 | set_reading_flag(ReadingFlag::SKIP_READING); |
1449 | 36 | sub_iterator->set_reading_flag(ReadingFlag::SKIP_READING); |
1450 | 36 | DLOG(INFO) << "Struct column iterator set sub-column " << name << " to SKIP_READING"; |
1451 | 36 | continue; |
1452 | 36 | } |
1453 | 18.0k | set_reading_flag(ReadingFlag::NEED_TO_READ); |
1454 | 18.0k | sub_iterator->set_reading_flag(ReadingFlag::NEED_TO_READ); |
1455 | | |
1456 | 18.0k | TColumnAccessPaths sub_predicate_access_paths_of_this; |
1457 | | |
1458 | 18.0k | if (!no_predicate_sub_column) { |
1459 | 638 | for (const auto& paths : sub_predicate_access_paths) { |
1460 | 638 | if (StringCaseEqual()(paths.data_access_path.path[0], name)) { |
1461 | 48 | sub_predicate_access_paths_of_this.emplace_back(paths); |
1462 | 48 | } |
1463 | 638 | } |
1464 | 638 | } |
1465 | | |
1466 | 18.0k | RETURN_IF_ERROR(sub_iterator->set_access_paths(sub_all_access_paths_of_this, |
1467 | 18.0k | sub_predicate_access_paths_of_this)); |
1468 | 18.0k | } |
1469 | 4.23k | return Status::OK(); |
1470 | 4.23k | } |
1471 | | |
1472 | | //////////////////////////////////////////////////////////////////////////////// |
1473 | 100k | Status OffsetFileColumnIterator::init(const ColumnIteratorOptions& opts) { |
1474 | 100k | RETURN_IF_ERROR(_offset_iterator->init(opts)); |
1475 | | // allocate peek tmp column once |
1476 | 100k | _peek_tmp_col = ColumnOffset64::create(); |
1477 | 100k | return Status::OK(); |
1478 | 100k | } |
1479 | | |
1480 | 467k | Status OffsetFileColumnIterator::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
1481 | 467k | RETURN_IF_ERROR(_offset_iterator->next_batch(n, dst, has_null)); |
1482 | 467k | return Status::OK(); |
1483 | 467k | } |
1484 | | |
1485 | 914k | Status OffsetFileColumnIterator::_peek_one_offset(ordinal_t* offset) { |
1486 | 914k | if (_offset_iterator->get_current_page()->has_remaining()) { |
1487 | 826k | PageDecoder* offset_page_decoder = _offset_iterator->get_current_page()->data_decoder.get(); |
1488 | 826k | size_t n = 1; |
1489 | 826k | _peek_tmp_col->clear(); |
1490 | 826k | RETURN_IF_ERROR(offset_page_decoder->peek_next_batch(&n, _peek_tmp_col)); // not null |
1491 | 826k | DCHECK(_peek_tmp_col->size() == 1); |
1492 | 826k | *offset = |
1493 | 826k | assert_cast<const ColumnOffset64*, TypeCheckOnRelease::DISABLE>(_peek_tmp_col.get()) |
1494 | 826k | ->get_element(0); |
1495 | 826k | } else { |
1496 | 87.6k | *offset = _offset_iterator->get_current_page()->next_array_item_ordinal; |
1497 | 87.6k | } |
1498 | 914k | return Status::OK(); |
1499 | 914k | } |
1500 | | |
1501 | 54.9k | Status OffsetFileColumnIterator::init_prefetcher(const SegmentPrefetchParams& params) { |
1502 | 54.9k | return _offset_iterator->init_prefetcher(params); |
1503 | 54.9k | } |
1504 | | |
1505 | | void OffsetFileColumnIterator::collect_prefetchers( |
1506 | | std::map<PrefetcherInitMethod, std::vector<SegmentPrefetcher*>>& prefetchers, |
1507 | 54.6k | PrefetcherInitMethod init_method) { |
1508 | 54.6k | _offset_iterator->collect_prefetchers(prefetchers, init_method); |
1509 | 54.6k | } |
1510 | | |
1511 | | /** |
1512 | | * first_storage_offset read from page should smaller than next_storage_offset which here call _peek_one_offset from page, |
1513 | | and first_column_offset is keep in memory data which is different dimension with (first_storage_offset and next_storage_offset) |
1514 | | eg. step1. read page: first_storage_offset = 16382 |
1515 | | step2. read page below with _peek_one_offset(&last_offset): last_offset = 16387 |
1516 | | step3. first_offset = 126 which is calculate in column offsets |
1517 | | for loop column offsets element in size |
1518 | | we can calculate from first_storage_offset to next_storage_offset one by one to fill with offsets_data in memory column offsets |
1519 | | * @param start |
1520 | | * @param column_offsets |
1521 | | * @return |
1522 | | */ |
1523 | | Status OffsetFileColumnIterator::_calculate_offsets(ssize_t start, |
1524 | 452k | ColumnArray::ColumnOffsets& column_offsets) { |
1525 | 452k | ordinal_t next_storage_offset = 0; |
1526 | 452k | RETURN_IF_ERROR(_peek_one_offset(&next_storage_offset)); |
1527 | | |
1528 | | // calculate real offsets |
1529 | 452k | auto& offsets_data = column_offsets.get_data(); |
1530 | 452k | ordinal_t first_column_offset = offsets_data[start - 1]; // -1 is valid |
1531 | 452k | ordinal_t first_storage_offset = offsets_data[start]; |
1532 | 452k | DCHECK(next_storage_offset >= first_storage_offset); |
1533 | 4.88M | for (ssize_t i = start; i < offsets_data.size() - 1; ++i) { |
1534 | 4.43M | offsets_data[i] = first_column_offset + (offsets_data[i + 1] - first_storage_offset); |
1535 | 4.43M | } |
1536 | | // last offset |
1537 | 452k | offsets_data[offsets_data.size() - 1] = |
1538 | 452k | first_column_offset + (next_storage_offset - first_storage_offset); |
1539 | 452k | return Status::OK(); |
1540 | 452k | } |
1541 | | |
1542 | | //////////////////////////////////////////////////////////////////////////////// |
1543 | | ArrayFileColumnIterator::ArrayFileColumnIterator(std::shared_ptr<ColumnReader> reader, |
1544 | | OffsetFileColumnIteratorUPtr offset_reader, |
1545 | | ColumnIteratorUPtr item_iterator, |
1546 | | ColumnIteratorUPtr null_iterator) |
1547 | 67.4k | : _array_reader(reader), |
1548 | 67.4k | _offset_iterator(std::move(offset_reader)), |
1549 | 67.4k | _item_iterator(std::move(item_iterator)) { |
1550 | 67.4k | if (_array_reader->is_nullable()) { |
1551 | 48.1k | _null_iterator = std::move(null_iterator); |
1552 | 48.1k | } |
1553 | 67.4k | } |
1554 | | |
1555 | 67.3k | Status ArrayFileColumnIterator::init(const ColumnIteratorOptions& opts) { |
1556 | 67.3k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1557 | 0 | DLOG(INFO) << "Array column iterator column " << _column_name << " skip readking."; |
1558 | 0 | return Status::OK(); |
1559 | 0 | } |
1560 | | |
1561 | 67.3k | RETURN_IF_ERROR(_offset_iterator->init(opts)); |
1562 | 67.3k | RETURN_IF_ERROR(_item_iterator->init(opts)); |
1563 | 67.3k | if (_array_reader->is_nullable()) { |
1564 | 47.9k | RETURN_IF_ERROR(_null_iterator->init(opts)); |
1565 | 47.9k | } |
1566 | 67.3k | return Status::OK(); |
1567 | 67.3k | } |
1568 | | |
1569 | 435k | Status ArrayFileColumnIterator::_seek_by_offsets(ordinal_t ord) { |
1570 | | // using offsets info |
1571 | 435k | ordinal_t offset = 0; |
1572 | 435k | RETURN_IF_ERROR(_offset_iterator->_peek_one_offset(&offset)); |
1573 | 435k | RETURN_IF_ERROR(_item_iterator->seek_to_ordinal(offset)); |
1574 | 435k | return Status::OK(); |
1575 | 435k | } |
1576 | | |
1577 | 434k | Status ArrayFileColumnIterator::seek_to_ordinal(ordinal_t ord) { |
1578 | 434k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1579 | 0 | DLOG(INFO) << "Array column iterator column " << _column_name << " skip reading."; |
1580 | 0 | return Status::OK(); |
1581 | 0 | } |
1582 | | |
1583 | 434k | RETURN_IF_ERROR(_offset_iterator->seek_to_ordinal(ord)); |
1584 | 434k | if (_array_reader->is_nullable()) { |
1585 | 407k | RETURN_IF_ERROR(_null_iterator->seek_to_ordinal(ord)); |
1586 | 407k | } |
1587 | 434k | return _seek_by_offsets(ord); |
1588 | 434k | } |
1589 | | |
1590 | 435k | Status ArrayFileColumnIterator::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
1591 | 435k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1592 | 0 | DLOG(INFO) << "Array column iterator column " << _column_name << " skip reading."; |
1593 | 0 | dst->insert_many_defaults(*n); |
1594 | 0 | return Status::OK(); |
1595 | 0 | } |
1596 | | |
1597 | 435k | const auto* column_array = check_and_get_column<ColumnArray>( |
1598 | 435k | dst->is_nullable() ? static_cast<ColumnNullable&>(*dst).get_nested_column() : *dst); |
1599 | | |
1600 | 435k | bool offsets_has_null = false; |
1601 | 435k | auto column_offsets_ptr = column_array->get_offsets_column().assume_mutable(); |
1602 | 435k | ssize_t start = column_offsets_ptr->size(); |
1603 | 435k | RETURN_IF_ERROR(_offset_iterator->next_batch(n, column_offsets_ptr, &offsets_has_null)); |
1604 | 435k | if (*n == 0) { |
1605 | 0 | return Status::OK(); |
1606 | 0 | } |
1607 | 435k | auto& column_offsets = static_cast<ColumnArray::ColumnOffsets&>(*column_offsets_ptr); |
1608 | 435k | RETURN_IF_ERROR(_offset_iterator->_calculate_offsets(start, column_offsets)); |
1609 | 435k | size_t num_items = |
1610 | 435k | column_offsets.get_data().back() - column_offsets.get_data()[start - 1]; // -1 is valid |
1611 | 435k | auto column_items_ptr = column_array->get_data().assume_mutable(); |
1612 | 435k | if (num_items > 0) { |
1613 | 118k | size_t num_read = num_items; |
1614 | 118k | bool items_has_null = false; |
1615 | 118k | RETURN_IF_ERROR(_item_iterator->next_batch(&num_read, column_items_ptr, &items_has_null)); |
1616 | 118k | DCHECK(num_read == num_items); |
1617 | 118k | } |
1618 | | |
1619 | 435k | if (dst->is_nullable()) { |
1620 | 410k | auto null_map_ptr = static_cast<ColumnNullable&>(*dst).get_null_map_column_ptr(); |
1621 | 410k | size_t num_read = *n; |
1622 | | // in not-null to null linked-schemachange mode, |
1623 | | // actually we do not change dat data include meta in footer, |
1624 | | // so may dst from changed meta which is nullable but old data is not nullable, |
1625 | | // if so, we should set null_map to all null by default |
1626 | 410k | if (_null_iterator) { |
1627 | 409k | bool null_signs_has_null = false; |
1628 | 409k | RETURN_IF_ERROR( |
1629 | 409k | _null_iterator->next_batch(&num_read, null_map_ptr, &null_signs_has_null)); |
1630 | 409k | } else { |
1631 | 142 | auto& null_map = assert_cast<ColumnUInt8&, TypeCheckOnRelease::DISABLE>(*null_map_ptr); |
1632 | 142 | null_map.insert_many_vals(0, num_read); |
1633 | 142 | } |
1634 | 410k | DCHECK(num_read == *n); |
1635 | 410k | } |
1636 | | |
1637 | 435k | return Status::OK(); |
1638 | 435k | } |
1639 | | |
1640 | 49.1k | Status ArrayFileColumnIterator::init_prefetcher(const SegmentPrefetchParams& params) { |
1641 | 49.1k | RETURN_IF_ERROR(_offset_iterator->init_prefetcher(params)); |
1642 | 49.1k | RETURN_IF_ERROR(_item_iterator->init_prefetcher(params)); |
1643 | 49.1k | if (_array_reader->is_nullable()) { |
1644 | 31.7k | RETURN_IF_ERROR(_null_iterator->init_prefetcher(params)); |
1645 | 31.7k | } |
1646 | 49.1k | return Status::OK(); |
1647 | 49.1k | } |
1648 | | |
1649 | | void ArrayFileColumnIterator::collect_prefetchers( |
1650 | | std::map<PrefetcherInitMethod, std::vector<SegmentPrefetcher*>>& prefetchers, |
1651 | 48.9k | PrefetcherInitMethod init_method) { |
1652 | 48.9k | _offset_iterator->collect_prefetchers(prefetchers, init_method); |
1653 | | // the actual data pages to read of item column depends on the read result of offset column, |
1654 | | // so we can't init prefetch blocks according to rowids, just prefetch all data blocks here. |
1655 | 48.9k | _item_iterator->collect_prefetchers(prefetchers, PrefetcherInitMethod::ALL_DATA_BLOCKS); |
1656 | 48.9k | if (_array_reader->is_nullable()) { |
1657 | 31.6k | _null_iterator->collect_prefetchers(prefetchers, init_method); |
1658 | 31.6k | } |
1659 | 48.9k | } |
1660 | | |
1661 | | Status ArrayFileColumnIterator::read_by_rowids(const rowid_t* rowids, const size_t count, |
1662 | 96.9k | MutableColumnPtr& dst) { |
1663 | 96.9k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1664 | 0 | DLOG(INFO) << "Array column iterator column " << _column_name << " skip reading."; |
1665 | 0 | dst->insert_many_defaults(count); |
1666 | 0 | return Status::OK(); |
1667 | 0 | } |
1668 | | |
1669 | 505k | for (size_t i = 0; i < count; ++i) { |
1670 | | // TODO(cambyzju): now read array one by one, need optimize later |
1671 | 408k | RETURN_IF_ERROR(seek_to_ordinal(rowids[i])); |
1672 | 408k | size_t num_read = 1; |
1673 | 408k | RETURN_IF_ERROR(next_batch(&num_read, dst, nullptr)); |
1674 | 408k | DCHECK(num_read == 1); |
1675 | 408k | } |
1676 | 96.9k | return Status::OK(); |
1677 | 96.9k | } |
1678 | | |
1679 | 50.6k | void ArrayFileColumnIterator::set_need_to_read() { |
1680 | 50.6k | set_reading_flag(ReadingFlag::NEED_TO_READ); |
1681 | 50.6k | _item_iterator->set_need_to_read(); |
1682 | 50.6k | } |
1683 | | |
1684 | 50.2k | void ArrayFileColumnIterator::remove_pruned_sub_iterators() { |
1685 | 50.2k | _item_iterator->remove_pruned_sub_iterators(); |
1686 | 50.2k | } |
1687 | | |
1688 | | Status ArrayFileColumnIterator::set_access_paths(const TColumnAccessPaths& all_access_paths, |
1689 | 49.7k | const TColumnAccessPaths& predicate_access_paths) { |
1690 | 49.7k | if (all_access_paths.empty()) { |
1691 | 1.75k | return Status::OK(); |
1692 | 1.75k | } |
1693 | | |
1694 | 48.0k | if (!predicate_access_paths.empty()) { |
1695 | 3.11k | set_reading_flag(ReadingFlag::READING_FOR_PREDICATE); |
1696 | 3.11k | DLOG(INFO) << "Array column iterator set sub-column " << _column_name |
1697 | 3.11k | << " to READING_FOR_PREDICATE"; |
1698 | 3.11k | } |
1699 | | |
1700 | 48.0k | auto sub_all_access_paths = DORIS_TRY(_get_sub_access_paths(all_access_paths)); |
1701 | 48.0k | auto sub_predicate_access_paths = DORIS_TRY(_get_sub_access_paths(predicate_access_paths)); |
1702 | | |
1703 | 48.0k | const auto no_sub_column_to_skip = sub_all_access_paths.empty(); |
1704 | 48.0k | const auto no_predicate_sub_column = sub_predicate_access_paths.empty(); |
1705 | | |
1706 | 48.0k | if (!no_sub_column_to_skip) { |
1707 | 3.28k | for (auto& path : sub_all_access_paths) { |
1708 | 3.28k | if (path.data_access_path.path[0] == "*") { |
1709 | 3.24k | path.data_access_path.path[0] = _item_iterator->column_name(); |
1710 | 3.24k | } |
1711 | 3.28k | } |
1712 | 3.25k | } |
1713 | | |
1714 | 48.0k | if (!no_predicate_sub_column) { |
1715 | 192 | for (auto& path : sub_predicate_access_paths) { |
1716 | 192 | if (path.data_access_path.path[0] == "*") { |
1717 | 192 | path.data_access_path.path[0] = _item_iterator->column_name(); |
1718 | 192 | } |
1719 | 192 | } |
1720 | 192 | } |
1721 | | |
1722 | 48.0k | if (!no_sub_column_to_skip || !no_predicate_sub_column) { |
1723 | 3.26k | _item_iterator->set_reading_flag(ReadingFlag::NEED_TO_READ); |
1724 | 3.26k | RETURN_IF_ERROR( |
1725 | 3.26k | _item_iterator->set_access_paths(sub_all_access_paths, sub_predicate_access_paths)); |
1726 | 3.26k | } |
1727 | 48.0k | return Status::OK(); |
1728 | 48.0k | } |
1729 | | |
1730 | | //////////////////////////////////////////////////////////////////////////////// |
1731 | | |
1732 | 19.6M | FileColumnIterator::FileColumnIterator(std::shared_ptr<ColumnReader> reader) : _reader(reader) {} |
1733 | | |
1734 | 19.4M | Status FileColumnIterator::init(const ColumnIteratorOptions& opts) { |
1735 | 19.4M | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1736 | 485 | DLOG(INFO) << "File column iterator column " << _column_name << " skip reading."; |
1737 | 485 | return Status::OK(); |
1738 | 485 | } |
1739 | | |
1740 | 19.4M | _opts = opts; |
1741 | 19.4M | if (!_opts.use_page_cache) { |
1742 | 18.7M | _reader->disable_index_meta_cache(); |
1743 | 18.7M | } |
1744 | 19.4M | RETURN_IF_ERROR(get_block_compression_codec(_reader->get_compression(), &_compress_codec)); |
1745 | 19.4M | if (config::enable_low_cardinality_optimize && |
1746 | 19.5M | opts.io_ctx.reader_type == ReaderType::READER_QUERY && |
1747 | 19.4M | _reader->encoding_info()->encoding() == DICT_ENCODING) { |
1748 | 11.5M | auto dict_encoding_type = _reader->get_dict_encoding_type(); |
1749 | | // Only if the column is a predicate column, then we need check the all dict encoding flag |
1750 | | // because we could rewrite the predciate to accelarate query speed. But if it is not a |
1751 | | // predicate column, then it is useless. And it has a bad impact on cold read(first time read) |
1752 | | // because it will load the column's ordinal index and zonemap index and maybe other indices. |
1753 | | // it has bad impact on primary key query. For example, select * from table where pk = 1, and |
1754 | | // the table has 2000 columns. |
1755 | 11.5M | if (dict_encoding_type == ColumnReader::UNKNOWN_DICT_ENCODING && opts.is_predicate_column) { |
1756 | 15.8k | RETURN_IF_ERROR(seek_to_ordinal(_reader->num_rows() - 1)); |
1757 | 15.8k | _is_all_dict_encoding = _page.is_dict_encoding; |
1758 | 15.8k | _reader->set_dict_encoding_type(_is_all_dict_encoding |
1759 | 15.8k | ? ColumnReader::ALL_DICT_ENCODING |
1760 | 15.8k | : ColumnReader::PARTIAL_DICT_ENCODING); |
1761 | 11.5M | } else { |
1762 | 11.5M | _is_all_dict_encoding = dict_encoding_type == ColumnReader::ALL_DICT_ENCODING; |
1763 | 11.5M | } |
1764 | 11.5M | } |
1765 | 19.4M | return Status::OK(); |
1766 | 19.4M | } |
1767 | | |
1768 | 19.6M | FileColumnIterator::~FileColumnIterator() = default; |
1769 | | |
1770 | 1.85M | void FileColumnIterator::_trigger_prefetch_if_eligible(ordinal_t ord) { |
1771 | 1.85M | std::vector<BlockRange> ranges; |
1772 | 1.85M | if (_prefetcher->need_prefetch(cast_set<uint32_t>(ord), &ranges)) { |
1773 | 888k | for (const auto& range : ranges) { |
1774 | 888k | _cached_remote_file_reader->prefetch_range(range.offset, range.size, &_opts.io_ctx); |
1775 | 888k | } |
1776 | 887k | } |
1777 | 1.85M | } |
1778 | | |
1779 | 4.25M | Status FileColumnIterator::seek_to_ordinal(ordinal_t ord) { |
1780 | 4.25M | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1781 | 468 | DLOG(INFO) << "File column iterator column " << _column_name << " skip reading."; |
1782 | 468 | return Status::OK(); |
1783 | 468 | } |
1784 | | |
1785 | 18.4E | LOG_IF(INFO, config::enable_segment_prefetch_verbose_log) << fmt::format( |
1786 | 18.4E | "[verbose] FileColumnIterator::seek_to_ordinal seek to ordinal {}, enable_prefetch={}", |
1787 | 18.4E | ord, _enable_prefetch); |
1788 | 4.24M | if (_enable_prefetch) { |
1789 | 1.85M | _trigger_prefetch_if_eligible(ord); |
1790 | 1.85M | } |
1791 | | |
1792 | | // if current page contains this row, we don't need to seek |
1793 | 4.24M | if (!_page || !_page.contains(ord) || !_page_iter.valid()) { |
1794 | 1.73M | RETURN_IF_ERROR(_reader->seek_at_or_before(ord, &_page_iter, _opts)); |
1795 | 1.73M | RETURN_IF_ERROR(_read_data_page(_page_iter)); |
1796 | 1.73M | } |
1797 | 4.24M | RETURN_IF_ERROR(_seek_to_pos_in_page(&_page, ord - _page.first_ordinal)); |
1798 | 4.24M | _current_ordinal = ord; |
1799 | 4.24M | return Status::OK(); |
1800 | 4.24M | } |
1801 | | |
1802 | 0 | Status FileColumnIterator::seek_to_page_start() { |
1803 | 0 | return seek_to_ordinal(_page.first_ordinal); |
1804 | 0 | } |
1805 | | |
1806 | 4.30M | Status FileColumnIterator::_seek_to_pos_in_page(ParsedPage* page, ordinal_t offset_in_page) const { |
1807 | 4.30M | if (page->offset_in_page == offset_in_page) { |
1808 | | // fast path, do nothing |
1809 | 2.47M | return Status::OK(); |
1810 | 2.47M | } |
1811 | | |
1812 | 1.83M | ordinal_t pos_in_data = offset_in_page; |
1813 | 1.83M | if (_page.has_null) { |
1814 | 408k | ordinal_t offset_in_data = 0; |
1815 | 408k | ordinal_t skips = offset_in_page; |
1816 | | |
1817 | 408k | if (offset_in_page > page->offset_in_page) { |
1818 | | // forward, reuse null bitmap |
1819 | 360k | skips = offset_in_page - page->offset_in_page; |
1820 | 360k | offset_in_data = page->data_decoder->current_index(); |
1821 | 360k | } else { |
1822 | | // rewind null bitmap, and |
1823 | 48.6k | page->null_decoder = RleDecoder<bool>((const uint8_t*)page->null_bitmap.data, |
1824 | 48.6k | cast_set<int>(page->null_bitmap.size), 1); |
1825 | 48.6k | } |
1826 | | |
1827 | 408k | auto skip_nulls = page->null_decoder.Skip(skips); |
1828 | 408k | pos_in_data = offset_in_data + skips - skip_nulls; |
1829 | 408k | } |
1830 | | |
1831 | 1.83M | RETURN_IF_ERROR(page->data_decoder->seek_to_position_in_page(pos_in_data)); |
1832 | 1.83M | page->offset_in_page = offset_in_page; |
1833 | 1.83M | return Status::OK(); |
1834 | 1.83M | } |
1835 | | |
1836 | 3.00k | Status FileColumnIterator::next_batch_of_zone_map(size_t* n, MutableColumnPtr& dst) { |
1837 | 3.00k | return _reader->next_batch_of_zone_map(n, dst); |
1838 | 3.00k | } |
1839 | | |
1840 | 3.18M | Status FileColumnIterator::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
1841 | 3.18M | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1842 | 468 | DLOG(INFO) << "File column iterator column " << _column_name << " skip reading."; |
1843 | 468 | dst->insert_many_defaults(*n); |
1844 | 468 | return Status::OK(); |
1845 | 468 | } |
1846 | | |
1847 | 3.18M | size_t curr_size = dst->byte_size(); |
1848 | 3.18M | dst->reserve(*n); |
1849 | 3.18M | size_t remaining = *n; |
1850 | 3.18M | *has_null = false; |
1851 | 6.43M | while (remaining > 0) { |
1852 | 3.24M | if (!_page.has_remaining()) { |
1853 | 52.8k | bool eos = false; |
1854 | 52.8k | RETURN_IF_ERROR(_load_next_page(&eos)); |
1855 | 52.8k | if (eos) { |
1856 | 0 | break; |
1857 | 0 | } |
1858 | 52.8k | } |
1859 | | |
1860 | | // number of rows to be read from this page |
1861 | 3.24M | size_t nrows_in_page = std::min(remaining, _page.remaining()); |
1862 | 3.24M | size_t nrows_to_read = nrows_in_page; |
1863 | 3.24M | if (_page.has_null) { |
1864 | 1.40M | while (nrows_to_read > 0) { |
1865 | 1.16M | bool is_null = false; |
1866 | 1.16M | size_t this_run = _page.null_decoder.GetNextRun(&is_null, nrows_to_read); |
1867 | | // we use num_rows only for CHECK |
1868 | 1.16M | size_t num_rows = this_run; |
1869 | 1.16M | if (!is_null) { |
1870 | 612k | RETURN_IF_ERROR(_page.data_decoder->next_batch(&num_rows, dst)); |
1871 | 612k | DCHECK_EQ(this_run, num_rows); |
1872 | 612k | } else { |
1873 | 555k | *has_null = true; |
1874 | 555k | auto* null_col = check_and_get_column<ColumnNullable>(dst.get()); |
1875 | 557k | if (null_col != nullptr) { |
1876 | 557k | null_col->insert_many_defaults(this_run); |
1877 | 18.4E | } else { |
1878 | 18.4E | return Status::InternalError("unexpected column type in column reader"); |
1879 | 18.4E | } |
1880 | 555k | } |
1881 | | |
1882 | 1.17M | nrows_to_read -= this_run; |
1883 | 1.17M | _page.offset_in_page += this_run; |
1884 | 1.17M | _current_ordinal += this_run; |
1885 | 1.17M | } |
1886 | 3.01M | } else { |
1887 | 3.01M | RETURN_IF_ERROR(_page.data_decoder->next_batch(&nrows_to_read, dst)); |
1888 | 3.01M | DCHECK_EQ(nrows_to_read, nrows_in_page); |
1889 | | |
1890 | 3.01M | _page.offset_in_page += nrows_to_read; |
1891 | 3.01M | _current_ordinal += nrows_to_read; |
1892 | 3.01M | } |
1893 | 3.24M | remaining -= nrows_in_page; |
1894 | 3.24M | } |
1895 | 3.18M | *n -= remaining; |
1896 | 3.18M | _opts.stats->bytes_read += (dst->byte_size() - curr_size) + BitmapSize(*n); |
1897 | | |
1898 | | #ifdef BE_TEST |
1899 | | _reader->check_data_by_zone_map_for_test(dst); |
1900 | | #endif |
1901 | 3.18M | return Status::OK(); |
1902 | 3.18M | } |
1903 | | |
1904 | | Status FileColumnIterator::read_by_rowids(const rowid_t* rowids, const size_t count, |
1905 | 726k | MutableColumnPtr& dst) { |
1906 | 726k | if (_reading_flag == ReadingFlag::SKIP_READING) { |
1907 | 0 | DLOG(INFO) << "File column iterator column " << _column_name << " skip reading."; |
1908 | 0 | dst->insert_many_defaults(count); |
1909 | 0 | return Status::OK(); |
1910 | 0 | } |
1911 | | |
1912 | 726k | size_t remaining = count; |
1913 | 726k | size_t total_read_count = 0; |
1914 | 726k | size_t nrows_to_read = 0; |
1915 | 1.48M | while (remaining > 0) { |
1916 | 755k | RETURN_IF_ERROR(seek_to_ordinal(rowids[total_read_count])); |
1917 | | |
1918 | | // number of rows to be read from this page |
1919 | 755k | nrows_to_read = std::min(remaining, _page.remaining()); |
1920 | | |
1921 | 755k | if (_page.has_null) { |
1922 | 85.0k | size_t already_read = 0; |
1923 | 2.72M | while ((nrows_to_read - already_read) > 0) { |
1924 | 2.63M | bool is_null = false; |
1925 | 2.63M | size_t this_run = std::min(nrows_to_read - already_read, _page.remaining()); |
1926 | 2.63M | if (UNLIKELY(this_run == 0)) { |
1927 | 53 | break; |
1928 | 53 | } |
1929 | 2.63M | this_run = _page.null_decoder.GetNextRun(&is_null, this_run); |
1930 | 2.63M | size_t offset = total_read_count + already_read; |
1931 | 2.63M | size_t this_read_count = 0; |
1932 | 2.63M | rowid_t current_ordinal_in_page = |
1933 | 2.63M | cast_set<uint32_t>(_page.offset_in_page + _page.first_ordinal); |
1934 | 24.4M | for (size_t i = 0; i < this_run; ++i) { |
1935 | 22.7M | if (rowids[offset + i] - current_ordinal_in_page >= this_run) { |
1936 | 982k | break; |
1937 | 982k | } |
1938 | 21.7M | this_read_count++; |
1939 | 21.7M | } |
1940 | | |
1941 | 2.63M | auto origin_index = _page.data_decoder->current_index(); |
1942 | 2.63M | if (this_read_count > 0) { |
1943 | 1.82M | if (is_null) { |
1944 | 1.01M | auto* null_col = check_and_get_column<ColumnNullable>(dst.get()); |
1945 | 1.01M | if (UNLIKELY(null_col == nullptr)) { |
1946 | 0 | return Status::InternalError("unexpected column type in column reader"); |
1947 | 0 | } |
1948 | | |
1949 | 1.01M | null_col->insert_many_defaults(this_read_count); |
1950 | 1.01M | } else { |
1951 | 801k | size_t read_count = this_read_count; |
1952 | | |
1953 | | // ordinal in nullable columns' data buffer maybe be not continuously(the data doesn't contain null value), |
1954 | | // so we need use `page_start_off_in_decoder` to calculate the actual offset in `data_decoder` |
1955 | 801k | size_t page_start_off_in_decoder = |
1956 | 801k | _page.first_ordinal + _page.offset_in_page - origin_index; |
1957 | 801k | RETURN_IF_ERROR(_page.data_decoder->read_by_rowids( |
1958 | 801k | &rowids[offset], page_start_off_in_decoder, &read_count, dst)); |
1959 | 801k | DCHECK_EQ(read_count, this_read_count); |
1960 | 801k | } |
1961 | 1.82M | } |
1962 | | |
1963 | 2.63M | if (!is_null) { |
1964 | 1.23M | RETURN_IF_ERROR( |
1965 | 1.23M | _page.data_decoder->seek_to_position_in_page(origin_index + this_run)); |
1966 | 1.23M | } |
1967 | | |
1968 | 2.63M | already_read += this_read_count; |
1969 | 2.63M | _page.offset_in_page += this_run; |
1970 | 2.63M | DCHECK(_page.offset_in_page <= _page.num_rows); |
1971 | 2.63M | } |
1972 | | |
1973 | 85.0k | nrows_to_read = already_read; |
1974 | 85.0k | total_read_count += nrows_to_read; |
1975 | 85.0k | remaining -= nrows_to_read; |
1976 | 670k | } else { |
1977 | 670k | RETURN_IF_ERROR(_page.data_decoder->read_by_rowids( |
1978 | 670k | &rowids[total_read_count], _page.first_ordinal, &nrows_to_read, dst)); |
1979 | 670k | total_read_count += nrows_to_read; |
1980 | 670k | remaining -= nrows_to_read; |
1981 | 670k | } |
1982 | 755k | } |
1983 | 726k | return Status::OK(); |
1984 | 726k | } |
1985 | | |
1986 | 52.8k | Status FileColumnIterator::_load_next_page(bool* eos) { |
1987 | 52.8k | _page_iter.next(); |
1988 | 52.8k | if (!_page_iter.valid()) { |
1989 | 0 | *eos = true; |
1990 | 0 | return Status::OK(); |
1991 | 0 | } |
1992 | | |
1993 | 52.8k | RETURN_IF_ERROR(_read_data_page(_page_iter)); |
1994 | 52.8k | RETURN_IF_ERROR(_seek_to_pos_in_page(&_page, 0)); |
1995 | 52.8k | *eos = false; |
1996 | 52.8k | return Status::OK(); |
1997 | 52.8k | } |
1998 | | |
1999 | 1.78M | Status FileColumnIterator::_read_data_page(const OrdinalPageIndexIterator& iter) { |
2000 | 1.78M | PageHandle handle; |
2001 | 1.78M | Slice page_body; |
2002 | 1.78M | PageFooterPB footer; |
2003 | 1.78M | _opts.type = DATA_PAGE; |
2004 | 1.78M | RETURN_IF_ERROR( |
2005 | 1.78M | _reader->read_page(_opts, iter.page(), &handle, &page_body, &footer, _compress_codec)); |
2006 | | // parse data page |
2007 | 1.78M | auto st = ParsedPage::create(std::move(handle), page_body, footer.data_page_footer(), |
2008 | 1.78M | _reader->encoding_info(), iter.page(), iter.page_index(), &_page); |
2009 | 1.78M | if (!st.ok()) { |
2010 | 0 | LOG(WARNING) << "failed to create ParsedPage, file=" << _opts.file_reader->path().native() |
2011 | 0 | << ", page_offset=" << iter.page().offset << ", page_size=" << iter.page().size |
2012 | 0 | << ", page_index=" << iter.page_index() << ", error=" << st; |
2013 | 0 | return st; |
2014 | 0 | } |
2015 | | |
2016 | | // dictionary page is read when the first data page that uses it is read, |
2017 | | // this is to optimize the memory usage: when there is no query on one column, we could |
2018 | | // release the memory of dictionary page. |
2019 | | // note that concurrent iterators for the same column won't repeatedly read dictionary page |
2020 | | // because of page cache. |
2021 | 1.78M | if (_reader->encoding_info()->encoding() == DICT_ENCODING) { |
2022 | 564k | auto dict_page_decoder = reinterpret_cast<BinaryDictPageDecoder*>(_page.data_decoder.get()); |
2023 | 564k | if (dict_page_decoder->is_dict_encoding()) { |
2024 | 535k | if (_dict_decoder == nullptr) { |
2025 | 391k | RETURN_IF_ERROR(_read_dict_data()); |
2026 | 391k | CHECK_NOTNULL(_dict_decoder); |
2027 | 391k | } |
2028 | | |
2029 | 535k | dict_page_decoder->set_dict_decoder(cast_set<uint32_t>(_dict_decoder->count()), |
2030 | 535k | _dict_word_info.get()); |
2031 | 535k | } |
2032 | 564k | } |
2033 | 1.78M | return Status::OK(); |
2034 | 1.78M | } |
2035 | | |
2036 | 391k | Status FileColumnIterator::_read_dict_data() { |
2037 | 391k | CHECK_EQ(_reader->encoding_info()->encoding(), DICT_ENCODING); |
2038 | | // read dictionary page |
2039 | 391k | Slice dict_data; |
2040 | 391k | PageFooterPB dict_footer; |
2041 | 391k | _opts.type = INDEX_PAGE; |
2042 | | |
2043 | 391k | RETURN_IF_ERROR(_reader->read_page(_opts, _reader->get_dict_page_pointer(), &_dict_page_handle, |
2044 | 391k | &dict_data, &dict_footer, _compress_codec, true)); |
2045 | 391k | const EncodingInfo* encoding_info; |
2046 | 391k | RETURN_IF_ERROR(EncodingInfo::get(FieldType::OLAP_FIELD_TYPE_VARCHAR, |
2047 | 391k | dict_footer.dict_page_footer().encoding(), {}, |
2048 | 391k | &encoding_info)); |
2049 | 391k | RETURN_IF_ERROR(encoding_info->create_page_decoder(dict_data, {}, _dict_decoder)); |
2050 | 391k | RETURN_IF_ERROR(_dict_decoder->init()); |
2051 | | |
2052 | 391k | _dict_word_info.reset(new StringRef[_dict_decoder->count()]); |
2053 | 391k | RETURN_IF_ERROR(_dict_decoder->get_dict_word_info(_dict_word_info.get())); |
2054 | 391k | return Status::OK(); |
2055 | 391k | } |
2056 | | |
2057 | | Status FileColumnIterator::get_row_ranges_by_zone_map( |
2058 | | const AndBlockColumnPredicate* col_predicates, |
2059 | | const std::vector<std::shared_ptr<const ColumnPredicate>>* delete_predicates, |
2060 | 77.5k | RowRanges* row_ranges) { |
2061 | 77.6k | if (_reader->has_zone_map()) { |
2062 | 77.6k | RETURN_IF_ERROR(_reader->get_row_ranges_by_zone_map(col_predicates, delete_predicates, |
2063 | 77.6k | row_ranges, _opts)); |
2064 | 77.6k | } |
2065 | 77.5k | return Status::OK(); |
2066 | 77.5k | } |
2067 | | |
2068 | | Status FileColumnIterator::get_row_ranges_by_bloom_filter( |
2069 | 78.8k | const AndBlockColumnPredicate* col_predicates, RowRanges* row_ranges) { |
2070 | 78.8k | if ((col_predicates->can_do_bloom_filter(false) && _reader->has_bloom_filter_index(false)) || |
2071 | 78.8k | (col_predicates->can_do_bloom_filter(true) && _reader->has_bloom_filter_index(true))) { |
2072 | 97 | RETURN_IF_ERROR(_reader->get_row_ranges_by_bloom_filter(col_predicates, row_ranges, _opts)); |
2073 | 97 | } |
2074 | 78.8k | return Status::OK(); |
2075 | 78.8k | } |
2076 | | |
2077 | | Status FileColumnIterator::get_row_ranges_by_dict(const AndBlockColumnPredicate* col_predicates, |
2078 | 81.2k | RowRanges* row_ranges) { |
2079 | 81.2k | if (!_is_all_dict_encoding) { |
2080 | 69.6k | return Status::OK(); |
2081 | 69.6k | } |
2082 | | |
2083 | 11.5k | if (!_dict_decoder) { |
2084 | 0 | RETURN_IF_ERROR(_read_dict_data()); |
2085 | 0 | CHECK_NOTNULL(_dict_decoder); |
2086 | 0 | } |
2087 | | |
2088 | 11.5k | if (!col_predicates->evaluate_and(_dict_word_info.get(), _dict_decoder->count())) { |
2089 | 1.39k | row_ranges->clear(); |
2090 | 1.39k | } |
2091 | 11.5k | return Status::OK(); |
2092 | 11.5k | } |
2093 | | |
2094 | 916k | Status FileColumnIterator::init_prefetcher(const SegmentPrefetchParams& params) { |
2095 | 916k | if (_cached_remote_file_reader = |
2096 | 916k | std::dynamic_pointer_cast<io::CachedRemoteFileReader>(_reader->_file_reader); |
2097 | 916k | !_cached_remote_file_reader) { |
2098 | 0 | return Status::OK(); |
2099 | 0 | } |
2100 | 916k | _enable_prefetch = true; |
2101 | 916k | _prefetcher = std::make_unique<SegmentPrefetcher>(params.config); |
2102 | 916k | RETURN_IF_ERROR(_prefetcher->init(_reader, params.read_options)); |
2103 | 916k | return Status::OK(); |
2104 | 916k | } |
2105 | | |
2106 | | void FileColumnIterator::collect_prefetchers( |
2107 | | std::map<PrefetcherInitMethod, std::vector<SegmentPrefetcher*>>& prefetchers, |
2108 | 914k | PrefetcherInitMethod init_method) { |
2109 | 915k | if (_prefetcher) { |
2110 | 915k | prefetchers[init_method].emplace_back(_prefetcher.get()); |
2111 | 915k | } |
2112 | 914k | } |
2113 | | |
2114 | 26.6k | Status DefaultValueColumnIterator::init(const ColumnIteratorOptions& opts) { |
2115 | 26.6k | _opts = opts; |
2116 | | // be consistent with segment v1 |
2117 | | // if _has_default_value, we should create default column iterator for this column, and |
2118 | | // "NULL" is a special default value which means the default value is null. |
2119 | 26.6k | if (_has_default_value) { |
2120 | 1.97k | if (_default_value == "NULL") { |
2121 | 1.21k | _default_value_field = Field::create_field<TYPE_NULL>(Null {}); |
2122 | 1.21k | } else { |
2123 | 762 | if (_type_info->type() == FieldType::OLAP_FIELD_TYPE_ARRAY) { |
2124 | 8 | if (_default_value != "[]") { |
2125 | 0 | return Status::NotSupported("Array default {} is unsupported", _default_value); |
2126 | 8 | } else { |
2127 | 8 | _default_value_field = Field::create_field<TYPE_ARRAY>(Array {}); |
2128 | 8 | return Status::OK(); |
2129 | 8 | } |
2130 | 754 | } else if (_type_info->type() == FieldType::OLAP_FIELD_TYPE_STRUCT) { |
2131 | 0 | return Status::NotSupported("STRUCT default type is unsupported"); |
2132 | 754 | } else if (_type_info->type() == FieldType::OLAP_FIELD_TYPE_MAP) { |
2133 | 0 | return Status::NotSupported("MAP default type is unsupported"); |
2134 | 0 | } |
2135 | 754 | const auto t = _type_info->type(); |
2136 | 754 | const auto serde = DataTypeFactory::instance() |
2137 | 754 | .create_data_type(t, _precision, _scale, _len) |
2138 | 754 | ->get_serde(); |
2139 | 754 | DataTypeSerDe::FormatOptions opt; |
2140 | 754 | RETURN_IF_ERROR(serde->from_olap_string(_default_value, _default_value_field, opt)); |
2141 | 754 | } |
2142 | 24.6k | } else if (_is_nullable) { |
2143 | 24.6k | _default_value_field = Field::create_field<TYPE_NULL>(Null {}); |
2144 | 18.4E | } else { |
2145 | 18.4E | return Status::InternalError( |
2146 | 18.4E | "invalid default value column for no default value and not nullable"); |
2147 | 18.4E | } |
2148 | 26.6k | return Status::OK(); |
2149 | 26.6k | } |
2150 | | |
2151 | 4.73k | Status DefaultValueColumnIterator::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
2152 | 4.73k | *has_null = _default_value_field.is_null(); |
2153 | 4.73k | _insert_many_default(dst, *n); |
2154 | 4.73k | return Status::OK(); |
2155 | 4.73k | } |
2156 | | |
2157 | | Status DefaultValueColumnIterator::read_by_rowids(const rowid_t* rowids, const size_t count, |
2158 | 6.30k | MutableColumnPtr& dst) { |
2159 | 6.30k | _insert_many_default(dst, count); |
2160 | 6.30k | return Status::OK(); |
2161 | 6.30k | } |
2162 | | |
2163 | 11.0k | void DefaultValueColumnIterator::_insert_many_default(MutableColumnPtr& dst, size_t n) { |
2164 | 11.0k | if (_default_value_field.is_null()) { |
2165 | 10.6k | dst->insert_many_defaults(n); |
2166 | 10.6k | } else { |
2167 | 413 | dst = dst->convert_to_predicate_column_if_dictionary(); |
2168 | 413 | dst->insert_duplicate_fields(_default_value_field, n); |
2169 | 413 | } |
2170 | 11.0k | } |
2171 | | |
2172 | 2.00k | Status RowIdColumnIteratorV2::next_batch(size_t* n, MutableColumnPtr& dst, bool* has_null) { |
2173 | 2.00k | auto* string_column = assert_cast<ColumnString*, TypeCheckOnRelease::DISABLE>(dst.get()); |
2174 | | |
2175 | 7.30M | for (uint32_t i = 0; i < *n; ++i) { |
2176 | 7.30M | uint32_t row_id = _current_rowid + i; |
2177 | 7.30M | GlobalRowLoacationV2 location(_version, _backend_id, _file_id, row_id); |
2178 | 7.30M | string_column->insert_data(reinterpret_cast<const char*>(&location), |
2179 | 7.30M | sizeof(GlobalRowLoacationV2)); |
2180 | 7.30M | } |
2181 | 2.00k | _current_rowid += *n; |
2182 | 2.00k | return Status::OK(); |
2183 | 2.00k | } |
2184 | | |
2185 | | Status RowIdColumnIteratorV2::read_by_rowids(const rowid_t* rowids, const size_t count, |
2186 | 6.87k | MutableColumnPtr& dst) { |
2187 | 6.87k | auto* string_column = assert_cast<ColumnString*>(dst.get()); |
2188 | | |
2189 | 19.4M | for (size_t i = 0; i < count; ++i) { |
2190 | 19.4M | uint32_t row_id = rowids[i]; |
2191 | 19.4M | GlobalRowLoacationV2 location(_version, _backend_id, _file_id, row_id); |
2192 | 19.4M | string_column->insert_data(reinterpret_cast<const char*>(&location), |
2193 | 19.4M | sizeof(GlobalRowLoacationV2)); |
2194 | 19.4M | } |
2195 | 6.87k | return Status::OK(); |
2196 | 6.87k | } |
2197 | | #include "common/compile_check_end.h" |
2198 | | |
2199 | | } // namespace doris::segment_v2 |