1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
#pragma once
#include "defs.h"
#include <arrow/compute/api.h>
#include <arrow/datum.h>
#include <arrow/memory_pool.h>
#include <arrow/util/bit_util.h>
#include <util/generic/maybe.h>
#include <util/generic/vector.h>
#include <functional>
namespace NYql {
namespace NUdf {
enum class EPgStringType {
None,
Text,
CString,
Fixed
};
std::shared_ptr<arrow::Buffer> AllocateBitmapWithReserve(size_t bitCount, arrow::MemoryPool* pool);
std::shared_ptr<arrow::Buffer> MakeDenseBitmap(const ui8* srcSparse, size_t len, arrow::MemoryPool* pool);
std::shared_ptr<arrow::Buffer> MakeDenseBitmapNegate(const ui8* srcSparse, size_t len, arrow::MemoryPool* pool);
std::shared_ptr<arrow::Buffer> MakeDenseBitmapCopy(const ui8* src, size_t len, size_t offset, arrow::MemoryPool* pool);
std::shared_ptr<arrow::Buffer> MakeDenseFalseBitmap(int64_t len, arrow::MemoryPool* pool);
/// \brief Recursive version of ArrayData::Slice() method
std::shared_ptr<arrow::ArrayData> DeepSlice(const std::shared_ptr<arrow::ArrayData>& data, size_t offset, size_t len);
/// \brief Chops first len items of `data` as new ArrayData object
std::shared_ptr<arrow::ArrayData> Chop(std::shared_ptr<arrow::ArrayData>& data, size_t len);
/// \brief Unwrap array (decrease optional level)
std::shared_ptr<arrow::ArrayData> Unwrap(const arrow::ArrayData& data, bool isNestedOptional);
void ForEachArrayData(const arrow::Datum& datum, const std::function<void(const std::shared_ptr<arrow::ArrayData>&)>& func);
arrow::Datum MakeArray(const TVector<std::shared_ptr<arrow::ArrayData>>& chunks);
inline bool IsNull(const arrow::ArrayData& data, size_t index) {
return data.GetNullCount() > 0 && !arrow::BitUtil::GetBit(data.GetValues<uint8_t>(0, 0), index + data.offset);
}
ui64 GetSizeOfArrowBatchInBytes(const arrow::RecordBatch& batch);
ui64 GetSizeOfArrowExecBatchInBytes(const arrow::compute::ExecBatch& batch);
class TResizeableBuffer : public arrow::ResizableBuffer {
public:
explicit TResizeableBuffer(arrow::MemoryPool* pool)
: ResizableBuffer(nullptr, 0, arrow::CPUDevice::memory_manager(pool))
, Pool(pool)
{
}
~TResizeableBuffer() override {
uint8_t* ptr = mutable_data();
if (ptr) {
Pool->Free(ptr, capacity_);
}
}
arrow::Status Reserve(const int64_t capacity) override {
if (capacity < 0) {
return arrow::Status::Invalid("Negative buffer capacity: ", capacity);
}
uint8_t* ptr = mutable_data();
if (!ptr || capacity > capacity_) {
int64_t newCapacity = arrow::BitUtil::RoundUpToMultipleOf64(capacity);
if (ptr) {
ARROW_RETURN_NOT_OK(Pool->Reallocate(capacity_, newCapacity, &ptr));
} else {
ARROW_RETURN_NOT_OK(Pool->Allocate(newCapacity, &ptr));
}
data_ = ptr;
capacity_ = newCapacity;
}
return arrow::Status::OK();
}
arrow::Status Resize(const int64_t newSize, bool shrink_to_fit = true) override {
if (ARROW_PREDICT_FALSE(newSize < 0)) {
return arrow::Status::Invalid("Negative buffer resize: ", newSize);
}
uint8_t* ptr = mutable_data();
if (ptr && shrink_to_fit) {
int64_t newCapacity = arrow::BitUtil::RoundUpToMultipleOf64(newSize);
if (capacity_ != newCapacity) {
ARROW_RETURN_NOT_OK(Pool->Reallocate(capacity_, newCapacity, &ptr));
data_ = ptr;
capacity_ = newCapacity;
}
} else {
RETURN_NOT_OK(Reserve(newSize));
}
size_ = newSize;
return arrow::Status::OK();
}
private:
arrow::MemoryPool* Pool;
};
/// \brief same as arrow::AllocateResizableBuffer, but allows to control zero padding
template<typename TBuffer = TResizeableBuffer>
std::unique_ptr<arrow::ResizableBuffer> AllocateResizableBuffer(size_t size, arrow::MemoryPool* pool, bool zeroPad = false) {
std::unique_ptr<TBuffer> result = std::make_unique<TBuffer>(pool);
ARROW_OK(result->Reserve(size));
if (zeroPad) {
result->ZeroPadding();
}
return result;
}
/// \brief owning buffer that calls destructors
template<typename T>
class TResizableManagedBuffer final : public TResizeableBuffer {
static_assert(!std::is_trivially_destructible_v<T>);
public:
explicit TResizableManagedBuffer(arrow::MemoryPool* pool)
: TResizeableBuffer(pool) {}
~TResizableManagedBuffer() override {
for (int64_t i = 0; i < size_; i += sizeof(T)) {
auto* ptr = reinterpret_cast<T*>(mutable_data() + i);
ptr->~T();
}
}
};
// similar to arrow::TypedBufferBuilder, but:
// 1) with UnsafeAdvance() method
// 2) shrinkToFit = false
// 3) doesn't zero pad buffer
template<typename T>
class TTypedBufferBuilder {
static_assert(!std::is_same_v<T, bool>);
using TArrowBuffer = std::conditional_t<std::is_trivially_destructible_v<T>, TResizeableBuffer, TResizableManagedBuffer<T>>;
public:
explicit TTypedBufferBuilder(arrow::MemoryPool* pool, TMaybe<ui8> minFillPercentage = {})
: MinFillPercentage(minFillPercentage)
, Pool(pool)
{
Y_ENSURE(!MinFillPercentage || *MinFillPercentage <= 100);
}
inline void Reserve(size_t size) {
if (!Buffer) {
bool zeroPad = false;
Buffer = AllocateResizableBuffer<TArrowBuffer>(size * sizeof(T), Pool, zeroPad);
} else {
size_t requiredBytes = (size + Length()) * sizeof(T);
size_t currentCapacity = Buffer->capacity();
if (requiredBytes > currentCapacity) {
size_t newCapacity = std::max(requiredBytes, currentCapacity * 2);
ARROW_OK(Buffer->Reserve(newCapacity));
}
}
}
inline size_t Length() const {
return Len;
}
inline size_t Capacity() const {
return Buffer ? size_t(Buffer->capacity()) : 0;
}
inline T* MutableData() {
return reinterpret_cast<T*>(Buffer->mutable_data());
}
inline T* End() {
return MutableData() + Length();
}
inline const T* Data() const {
return reinterpret_cast<const T*>(Buffer->data());
}
inline void UnsafeAppend(const T* values, size_t count) {
Y_DEBUG_ABORT_UNLESS(count + Length() <= Buffer->capacity() / sizeof(T));
std::memcpy(End(), values, count * sizeof(T));
UnsafeAdvance(count);
}
inline void UnsafeAppend(size_t count, const T& value) {
Y_DEBUG_ABORT_UNLESS(count + Length() <= Buffer->capacity() / sizeof(T));
T* target = End();
std::fill(target, target + count, value);
UnsafeAdvance(count);
}
inline void UnsafeAppend(T&& value) {
Y_DEBUG_ABORT_UNLESS(1 + Length() <= Buffer->capacity() / sizeof(T));
*End() = std::move(value);
UnsafeAdvance(1);
}
inline void UnsafeAdvance(size_t count) {
Y_DEBUG_ABORT_UNLESS(count + Length() <= Buffer->capacity() / sizeof(T));
Len += count;
}
inline std::shared_ptr<arrow::Buffer> Finish() {
int64_t newSize = Len * sizeof(T);
bool shrinkToFit = MinFillPercentage
? newSize <= Buffer->capacity() * *MinFillPercentage / 100
: false;
ARROW_OK(Buffer->Resize(newSize, shrinkToFit));
std::shared_ptr<arrow::ResizableBuffer> result;
std::swap(result, Buffer);
Len = 0;
return result;
}
private:
const TMaybe<ui8> MinFillPercentage;
arrow::MemoryPool* const Pool;
std::shared_ptr<arrow::ResizableBuffer> Buffer;
size_t Len = 0;
};
inline void* GetMemoryContext(const void* ptr) {
return *(void**)((char*)ptr - sizeof(void*));
}
inline void SetMemoryContext(void* ptr, void* ctx) {
*(void**)((char*)ptr - sizeof(void*)) = ctx;
}
inline void ZeroMemoryContext(void* ptr) {
SetMemoryContext(ptr, nullptr);
}
} // namespace NUdf
} // namespace NYql
|
