-
Notifications
You must be signed in to change notification settings - Fork 3.4k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Enhancement] Support some compress functions #47307
Open
lzyy2024
wants to merge
3
commits into
apache:master
Choose a base branch
from
lzyy2024:CompressFunctions
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+594
−1
Open
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,269 @@ | ||
// Licensed to the Apache Software Foundation (ASF) under one | ||
// or more contributor license agreements. See the NOTICE file | ||
// distributed with this work for additional information | ||
// regarding copyright ownership. The ASF licenses this file | ||
// to you under the Apache License, Version 2.0 (the | ||
// "License"); you may not use this file except in compliance | ||
// with the License. You may obtain a copy of the License at | ||
// | ||
// http://www.apache.org/licenses/LICENSE-2.0 | ||
// | ||
// Unless required by applicable law or agreed to in writing, | ||
// software distributed under the License is distributed on an | ||
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | ||
// KIND, either express or implied. See the License for the | ||
// specific language governing permissions and limitations | ||
// under the License. | ||
#include <glog/logging.h> | ||
|
||
#include <cctype> | ||
#include <cstddef> | ||
#include <cstring> | ||
#include <memory> | ||
#include <string> | ||
#include <utility> | ||
|
||
#include "common/status.h" | ||
#include "util/block_compression.h" | ||
#include "util/faststring.h" | ||
#include "vec/aggregate_functions/aggregate_function.h" | ||
#include "vec/columns/column.h" | ||
#include "vec/columns/column_nullable.h" | ||
#include "vec/columns/column_string.h" | ||
#include "vec/columns/column_vector.h" | ||
#include "vec/columns/columns_number.h" | ||
#include "vec/common/assert_cast.h" | ||
#include "vec/core/block.h" | ||
#include "vec/core/column_numbers.h" | ||
#include "vec/core/column_with_type_and_name.h" | ||
#include "vec/core/types.h" | ||
#include "vec/data_types/data_type.h" | ||
#include "vec/data_types/data_type_nullable.h" | ||
#include "vec/data_types/data_type_number.h" | ||
#include "vec/data_types/data_type_string.h" | ||
#include "vec/functions/function.h" | ||
#include "vec/functions/simple_function_factory.h" | ||
|
||
namespace doris { | ||
class FunctionContext; | ||
} // namespace doris | ||
|
||
namespace doris::vectorized { | ||
|
||
class FunctionCompress : public IFunction { | ||
string hexadecimal = "0123456789ABCDEF"; | ||
|
||
public: | ||
static constexpr auto name = "compress"; | ||
static FunctionPtr create() { return std::make_shared<FunctionCompress>(); } | ||
|
||
String get_name() const override { return name; } | ||
|
||
size_t get_number_of_arguments() const override { return 1; } | ||
|
||
DataTypePtr get_return_type_impl(const DataTypes& arguments) const override { | ||
return make_nullable(std::make_shared<DataTypeString>()); | ||
} | ||
|
||
Status execute_impl(FunctionContext* context, Block& block, const ColumnNumbers& arguments, | ||
uint32_t result, size_t input_rows_count) const override { | ||
// Get the compression algorithm object | ||
BlockCompressionCodec* compression_codec; | ||
RETURN_IF_ERROR(get_block_compression_codec(segment_v2::CompressionTypePB::ZLIB, | ||
&compression_codec)); | ||
|
||
const auto& arg_column = | ||
assert_cast<const ColumnString&>(*block.get_by_position(arguments[0]).column); | ||
auto result_column = ColumnString::create(); | ||
|
||
auto& col_data = result_column->get_chars(); | ||
auto& col_offset = result_column->get_offsets(); | ||
col_offset.resize(input_rows_count); | ||
|
||
auto null_column = ColumnUInt8::create(input_rows_count); | ||
auto& null_map = null_column->get_data(); | ||
|
||
faststring compressed_str; | ||
Slice data; | ||
for (size_t row = 0; row < input_rows_count; row++) { | ||
null_map[row] = false; | ||
const auto& str = arg_column.get_data_at(row); | ||
data = Slice(str.data, str.size); | ||
|
||
auto st = compression_codec->compress(data, &compressed_str); | ||
|
||
if (!st.ok()) { // Failed to decompress. data is an illegal value | ||
col_offset[row] = col_offset[row - 1]; | ||
null_map[row] = true; | ||
continue; | ||
} | ||
|
||
size_t idx = col_data.size(); | ||
if (!str.size) { // data is '' | ||
col_data.resize(col_data.size() + 2); | ||
col_data[idx] = '0', col_data[idx + 1] = 'x'; | ||
col_offset[row] = col_offset[row - 1] + 2; | ||
continue; | ||
} | ||
|
||
// first ten digits represent the length of the uncompressed string | ||
int value = (int)str.size; | ||
col_data.resize(col_data.size() + 10); | ||
col_data[idx] = '0', col_data[idx + 1] = 'x'; | ||
for (size_t i = 0; i < 4; i++) { | ||
unsigned char byte = (value >> (i * 8)) & 0xFF; | ||
col_data[idx + 2 + i * 2] = hexadecimal[byte >> 4]; // higher four | ||
col_data[idx + 3 + i * 2] = hexadecimal[byte & 0x0F]; | ||
} | ||
idx += 10; | ||
|
||
col_data.resize(col_data.size() + 2 * compressed_str.size()); | ||
|
||
unsigned char* src = compressed_str.data(); | ||
{ | ||
for (size_t i = 0; i < compressed_str.size(); i++) { | ||
col_data[idx] = | ||
((*src >> 4) & 0x0F) + (((*src >> 4) & 0x0F) < 10 ? '0' : 'A' - 10); | ||
col_data[idx + 1] = (*src & 0x0F) + ((*src & 0x0F) < 10 ? '0' : 'A' - 10); | ||
idx += 2; | ||
src++; | ||
} | ||
|
||
col_offset[row] = col_offset[row - 1] + 10 + compressed_str.size() * 2; | ||
} | ||
} | ||
|
||
block.replace_by_position( | ||
result, ColumnNullable::create(std::move(result_column), std::move(null_column))); | ||
return Status::OK(); | ||
} | ||
}; | ||
|
||
class FunctionUncompress : public IFunction { | ||
string hexadecimal = "0123456789ABCDEF"; | ||
|
||
public: | ||
static constexpr auto name = "uncompress"; | ||
static FunctionPtr create() { return std::make_shared<FunctionUncompress>(); } | ||
|
||
String get_name() const override { return name; } | ||
|
||
size_t get_number_of_arguments() const override { return 1; } | ||
|
||
DataTypePtr get_return_type_impl(const DataTypes& arguments) const override { | ||
return make_nullable(std::make_shared<DataTypeString>()); | ||
} | ||
|
||
Status execute_impl(FunctionContext* context, Block& block, const ColumnNumbers& arguments, | ||
uint32_t result, size_t input_rows_count) const override { | ||
// Get the compression algorithm object | ||
BlockCompressionCodec* compression_codec; | ||
RETURN_IF_ERROR(get_block_compression_codec(segment_v2::CompressionTypePB::ZLIB, | ||
&compression_codec)); | ||
|
||
const auto& arg_column = | ||
assert_cast<const ColumnString&>(*block.get_by_position(arguments[0]).column); | ||
|
||
auto result_column = ColumnString::create(); | ||
auto& col_data = result_column->get_chars(); | ||
auto& col_offset = result_column->get_offsets(); | ||
col_offset.resize(input_rows_count); | ||
|
||
auto null_column = ColumnUInt8::create(input_rows_count); | ||
auto& null_map = null_column->get_data(); | ||
|
||
std::string uncompressed; | ||
Slice data; | ||
Slice uncompressed_slice; | ||
for (size_t row = 0; row < input_rows_count; row++) { | ||
auto check = [](char x) { | ||
return ((x >= '0' && x <= '9') || (x >= 'a' && x <= 'f') || (x >= 'A' && x <= 'F')); | ||
}; | ||
|
||
null_map[row] = false; | ||
const auto& str = arg_column.get_data_at(row); | ||
data = Slice(str.data, str.size); | ||
|
||
int illegal = 0; | ||
// The first ten digits are "0x" and length, followed by hexadecimal, each two digits is a byte | ||
if ((int)str.size < 10 || (int)str.size % 2 == 1) { | ||
illegal = 1; | ||
} else { | ||
if (data[0] != '0' || data[1] != 'x') { | ||
illegal = 1; | ||
} | ||
for (size_t i = 2; i <= 9; i += 2) { | ||
if (!check(data[i])) { | ||
illegal = 1; | ||
} | ||
} | ||
} | ||
|
||
if (illegal) { // The top ten don't fit the rules | ||
if ((int)data.size == 2 && data[0] == '0' && data[1] == 'x') { | ||
int idx = col_data.size(); | ||
col_data.resize(col_data.size() + 2); | ||
col_data[idx] = '0', col_data[idx + 1] = 'x'; | ||
col_offset[row] = col_offset[row - 1] + 2; | ||
continue; | ||
} | ||
col_offset[row] = col_offset[row - 1]; | ||
null_map[row] = true; | ||
continue; | ||
} | ||
|
||
unsigned int length = 0; | ||
for (size_t i = 2; i <= 9; i += 2) { | ||
unsigned char byte = | ||
(data[i] >= '0' && data[i] <= '9') ? (data[i] - '0') : (data[i] - 'A' + 10); | ||
byte = (byte << 4) + ((data[i + 1] >= '0' && data[i + 1] <= '9') | ||
? (data[i + 1] - '0') | ||
: (data[i + 1] - 'A' + 10)); | ||
length += (byte << (8 * (i / 2 - 1))); | ||
} | ||
|
||
uncompressed.resize(length); | ||
uncompressed_slice = Slice(uncompressed); | ||
|
||
//Converts a hexadecimal readable string to a compressed byte stream | ||
std::string s(((int)data.size - 10) / 2, ' '); // byte stream data.size >= 10 | ||
for (size_t i = 10, j = 0; i < data.size; i += 2, j++) { | ||
s[j] = (((data[i] >= '0' && data[i] <= '9') ? (data[i] - '0') | ||
: (data[i] - 'A' + 10)) | ||
<< 4) + | ||
((data[i + 1] >= '0' && data[i + 1] <= '9') ? (data[i + 1] - '0') | ||
: (data[i + 1] - 'A' + 10)); | ||
} | ||
Slice compressed_data(s); | ||
auto st = compression_codec->decompress(compressed_data, &uncompressed_slice); | ||
|
||
if (!st.ok()) { // is not a legal compressed string | ||
col_offset[row] = col_offset[row - 1]; | ||
null_map[row] = true; | ||
continue; | ||
} | ||
|
||
int idx = col_data.size(); | ||
col_data.resize(col_data.size() + 2 * uncompressed_slice.size + 2); | ||
col_offset[row] = col_offset[row - 1] + 2 * uncompressed_slice.size + 2; | ||
|
||
col_data[idx] = '0', col_data[idx + 1] = 'x'; | ||
for (size_t i = 0; i < uncompressed_slice.size; i++) { | ||
unsigned char byte = uncompressed_slice[i]; | ||
col_data[idx + 2 + i * 2] = hexadecimal[byte >> 4]; | ||
col_data[idx + 3 + i * 2] = hexadecimal[byte & 0x0F]; | ||
} | ||
} | ||
|
||
block.replace_by_position( | ||
result, ColumnNullable::create(std::move(result_column), std::move(null_column))); | ||
return Status::OK(); | ||
} | ||
}; | ||
|
||
void register_function_compress(SimpleFunctionFactory& factory) { | ||
factory.register_function<FunctionCompress>(); | ||
factory.register_function<FunctionUncompress>(); | ||
} | ||
|
||
} // namespace doris::vectorized |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What's this value for?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The first ten digits of the compress value are "0x" and eight digits long, followed by each digit split into two hexadecimal values