-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathplugin_data_host.cpp
More file actions
1779 lines (1623 loc) · 63.2 KB
/
Copy pathplugin_data_host.cpp
File metadata and controls
1779 lines (1623 loc) · 63.2 KB
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright 2026 Davide Faconti
// SPDX-License-Identifier: MPL-2.0
#include "pj_datastore/plugin_data_host.hpp"
#include <fmt/format.h>
#include <tsl/robin_map.h>
#include <tsl/robin_set.h>
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <cstring>
#include <deque>
#include <exception>
#include <memory>
#include <string>
#include <string_view>
#include <unordered_map>
#include <utility>
#include <vector>
#include "nanoarrow/nanoarrow.h"
#include "nanoarrow/nanoarrow.hpp"
#include "pj_base/dataset.hpp"
#include "pj_base/plugin_data_api.h"
#include "pj_base/sdk/plugin_data_api.hpp"
#include "pj_base/type_tree.hpp"
#include "pj_datastore/arrow_import.hpp"
#include "pj_datastore/chunk.hpp"
#include "pj_datastore/column_buffer.hpp"
#include "pj_datastore/encoding.hpp"
#include "pj_datastore/engine.hpp"
#include "pj_datastore/object_store.hpp"
#include "pj_datastore/topic_storage.hpp"
#include "pj_datastore/writer.hpp"
namespace PJ {
namespace {
using DataSourceHandle = PJ_data_source_handle_t;
using TopicHandle = PJ_topic_handle_t;
using FieldHandle = PJ_field_handle_t;
[[nodiscard]] std::string_view toStringView(PJ_string_view_t view) {
return std::string_view(view.data == nullptr ? "" : view.data, view.size);
}
[[nodiscard]] Expected<PrimitiveType> fromAbiType(PJ_primitive_type_t type) {
const auto raw = static_cast<uint32_t>(type);
if (raw > static_cast<uint32_t>(PrimitiveType::kString)) {
return unexpected(fmt::format("unsupported primitive type value {}", raw));
}
return static_cast<PrimitiveType>(type);
}
template <typename T>
[[nodiscard]] T loadFromBytes(const uint8_t* data) {
T value{};
std::memcpy(&value, data, sizeof(T));
return value;
}
[[nodiscard]] uint64_t readForOffset(const encoding::FrameOfReferenceEncoded& enc, std::size_t row) {
const uint8_t* data = enc.offsets.data();
switch (enc.offset_bytes) {
case 1:
return loadFromBytes<uint8_t>(data + row);
case 2:
return loadFromBytes<uint16_t>(data + row * 2);
default:
return loadFromBytes<uint32_t>(data + row * 4);
}
}
template <typename T>
[[nodiscard]] T decodeNumericExact(const TopicChunk& chunk, std::size_t col_index, std::size_t row) {
switch (chunk.columnEncoding(col_index)) {
case EncodingType::kConstant: {
const auto& enc = std::get<encoding::ConstantEncoded>(chunk.columns[col_index].data);
return loadFromBytes<T>(enc.value_bytes.data());
}
case EncodingType::kFrameOfReference: {
const auto& enc = std::get<encoding::FrameOfReferenceEncoded>(chunk.columns[col_index].data);
const uint64_t offset = readForOffset(enc, row);
return static_cast<T>(enc.reference + static_cast<int64_t>(offset));
}
case EncodingType::kRaw: {
const StorageKind kind = storageKindOf(chunk.columns[col_index].descriptor->logical_type);
const uint8_t* base = std::get<RawBuffer>(chunk.columns[col_index].data).data();
switch (kind) {
case StorageKind::kFloat32:
return static_cast<T>(loadFromBytes<float>(base + row * sizeof(float)));
case StorageKind::kFloat64:
return static_cast<T>(loadFromBytes<double>(base + row * sizeof(double)));
case StorageKind::kInt32:
return static_cast<T>(loadFromBytes<int32_t>(base + row * sizeof(int32_t)));
case StorageKind::kInt64:
return static_cast<T>(loadFromBytes<int64_t>(base + row * sizeof(int64_t)));
case StorageKind::kUint64:
return static_cast<T>(loadFromBytes<uint64_t>(base + row * sizeof(uint64_t)));
case StorageKind::kBool:
return static_cast<T>(chunk.readBool(col_index, row));
case StorageKind::kString:
return T{};
}
return T{};
}
default:
return T{};
}
}
void flattenColumnsImpl(
const TypeTreeNode& node, std::string_view prefix, FieldId& next_id, std::vector<ColumnDescriptor>& out) {
std::string path = prefix.empty() ? node.name : fmt::format("{}.{}", prefix, node.name);
switch (node.kind) {
case TypeKind::kPrimitive: {
ColumnDescriptor desc;
desc.field_id = next_id++;
desc.logical_type = node.primitive_type.value_or(PrimitiveType::kFloat64);
desc.field_path = std::move(path);
out.push_back(std::move(desc));
return;
}
case TypeKind::kEnum: {
ColumnDescriptor desc;
desc.field_id = next_id++;
desc.logical_type = node.primitive_type.value_or(PrimitiveType::kInt32);
desc.field_path = std::move(path);
out.push_back(std::move(desc));
return;
}
case TypeKind::kStruct:
for (const auto& child : node.children) {
flattenColumnsImpl(*child, path, next_id, out);
}
return;
case TypeKind::kArray:
return;
}
}
[[nodiscard]] std::vector<ColumnDescriptor> buildSchemaColumns(const TypeTreeNode& root) {
std::vector<ColumnDescriptor> result;
FieldId next_id = 0;
if (root.kind == TypeKind::kStruct) {
for (const auto& child : root.children) {
flattenColumnsImpl(*child, "", next_id, result);
}
} else {
flattenColumnsImpl(root, "", next_id, result);
}
return result;
}
[[nodiscard]] std::vector<ColumnDescriptor> effectiveColumns(const DataEngine& engine, const TopicStorage& storage) {
const auto& stored = storage.columnDescriptors();
if (!stored.empty()) {
return stored;
}
if (const auto* type_tree = engine.typeRegistry().lookup(storage.descriptor().schema_id)) {
return buildSchemaColumns(*type_tree);
}
const auto& chunks = storage.sealedChunks();
if (!chunks.empty()) {
std::vector<ColumnDescriptor> result;
result.reserve(chunks.front().columns.size());
for (const auto& col : chunks.front().columns) {
result.push_back(*col.descriptor);
}
return result;
}
return {};
}
[[nodiscard]] const ColumnDescriptor* findFieldDescriptor(
const std::vector<ColumnDescriptor>& columns, FieldId field_id) {
for (const auto& col : columns) {
if (col.field_id == field_id) {
return &col;
}
}
return nullptr;
}
} // namespace
struct WriteCore {
explicit WriteCore(DataEngine& engine) : engine_(engine), writer_(engine.createWriter()) {}
DataEngine& engine_;
DataWriter writer_;
std::string last_error_;
struct DatasetTopicKey {
DatasetId dataset_id;
std::string topic_name;
friend bool operator==(const DatasetTopicKey& a, const DatasetTopicKey& b) {
return a.dataset_id == b.dataset_id && a.topic_name == b.topic_name;
}
};
struct DatasetTopicKeyHash {
std::size_t operator()(const DatasetTopicKey& key) const noexcept {
std::size_t h1 = std::hash<DatasetId>{}(key.dataset_id);
std::size_t h2 = std::hash<std::string>{}(key.topic_name);
return h1 ^ (h2 << 1);
}
};
struct TopicFieldKey {
TopicId topic_id;
std::string field_name;
friend bool operator==(const TopicFieldKey& a, const TopicFieldKey& b) {
return a.topic_id == b.topic_id && a.field_name == b.field_name;
}
};
struct TopicFieldKeyHash {
std::size_t operator()(const TopicFieldKey& key) const noexcept {
std::size_t h1 = std::hash<TopicId>{}(key.topic_id);
std::size_t h2 = std::hash<std::string>{}(key.field_name);
return h1 ^ (h2 << 1);
}
};
struct TopicFieldIdKey {
TopicId topic_id;
FieldId field_id;
friend bool operator==(const TopicFieldIdKey& a, const TopicFieldIdKey& b) {
return a.topic_id == b.topic_id && a.field_id == b.field_id;
}
};
struct TopicFieldIdKeyHash {
std::size_t operator()(const TopicFieldIdKey& key) const noexcept {
std::size_t h1 = std::hash<TopicId>{}(key.topic_id);
std::size_t h2 = std::hash<FieldId>{}(key.field_id);
return h1 ^ (h2 << 1);
}
};
tsl::robin_map<DatasetTopicKey, TopicHandle, DatasetTopicKeyHash> topic_cache_;
tsl::robin_map<TopicFieldKey, FieldHandle, TopicFieldKeyHash> field_cache_;
tsl::robin_map<TopicFieldIdKey, PrimitiveType, TopicFieldIdKeyHash> field_types_;
void setError(std::string message) {
last_error_ = std::move(message);
}
[[nodiscard]] const char* lastError() const {
return last_error_.empty() ? nullptr : last_error_.c_str();
}
[[nodiscard]] bool createDataSource(std::string_view name, DataSourceHandle* out_source) {
auto id_or = engine_.createDataset(DatasetDescriptor{.source_name = std::string(name), .time_domain_id = 0});
if (!id_or.has_value()) {
setError(id_or.error());
return false;
}
*out_source = DataSourceHandle{.id = *id_or};
last_error_.clear();
return true;
}
[[nodiscard]] bool ensureTopic(DataSourceHandle source, std::string_view topic_name, TopicHandle* out_topic) {
const auto* dataset = engine_.getDataset(source.id);
if (dataset == nullptr) {
setError(fmt::format("data source {} not found", source.id));
return false;
}
DatasetTopicKey key{.dataset_id = source.id, .topic_name = std::string(topic_name)};
if (auto it = topic_cache_.find(key); it != topic_cache_.end()) {
*out_topic = it->second;
last_error_.clear();
return true;
}
auto topic_ids = engine_.listTopics(source.id);
std::sort(topic_ids.begin(), topic_ids.end());
for (TopicId tid : topic_ids) {
const auto* storage = engine_.getTopicStorage(tid);
if (storage != nullptr && storage->descriptor().name == topic_name) {
*out_topic = TopicHandle{.id = tid};
topic_cache_.emplace(std::move(key), *out_topic);
last_error_.clear();
return true;
}
}
TopicDescriptor desc;
desc.name = std::string(topic_name);
desc.schema_id = 0;
auto tid_or = writer_.registerTopic(source.id, std::move(desc));
if (!tid_or.has_value()) {
setError(tid_or.error());
return false;
}
*out_topic = TopicHandle{.id = *tid_or};
topic_cache_.emplace(std::move(key), *out_topic);
last_error_.clear();
return true;
}
[[nodiscard]] bool lookupFieldType(TopicHandle topic, FieldId field_id, PrimitiveType* out_type) {
const TopicFieldIdKey key{.topic_id = topic.id, .field_id = field_id};
if (auto it = field_types_.find(key); it != field_types_.end()) {
*out_type = it->second;
return true;
}
const auto* storage = engine_.getTopicStorage(topic.id);
if (storage == nullptr) {
setError(fmt::format("topic {} not found", topic.id));
return false;
}
const auto columns = effectiveColumns(engine_, *storage);
const auto* desc = findFieldDescriptor(columns, field_id);
if (desc == nullptr) {
setError(fmt::format("field {} not found in topic {}", field_id, topic.id));
return false;
}
*out_type = desc->logical_type;
field_types_[key] = desc->logical_type;
field_cache_[{.topic_id = topic.id, .field_name = desc->field_path}] = FieldHandle{.topic = topic, .id = field_id};
return true;
}
[[nodiscard]] bool ensureField(
TopicHandle topic, std::string_view field_name, PJ_primitive_type_t abi_type, FieldHandle* out_field) {
const auto* storage = engine_.getTopicStorage(topic.id);
if (storage == nullptr) {
setError(fmt::format("topic {} not found", topic.id));
return false;
}
auto type_or = fromAbiType(abi_type);
if (!type_or.has_value()) {
setError(type_or.error());
return false;
}
const PrimitiveType type = *type_or;
TopicFieldKey key{.topic_id = topic.id, .field_name = std::string(field_name)};
if (auto it = field_cache_.find(key); it != field_cache_.end()) {
PrimitiveType existing{};
if (!lookupFieldType(topic, it->second.id, &existing)) {
return false;
}
if (existing != type) {
setError(fmt::format("field '{}' already exists with a different type", field_name));
return false;
}
*out_field = it->second;
last_error_.clear();
return true;
}
auto field_id_or = writer_.ensureColumn(topic.id, field_name, type);
if (!field_id_or.has_value()) {
setError(field_id_or.error());
return false;
}
*out_field = FieldHandle{.topic = topic, .id = *field_id_or};
field_cache_.emplace(std::move(key), *out_field);
field_types_[{.topic_id = topic.id, .field_id = *field_id_or}] = type;
last_error_.clear();
return true;
}
[[nodiscard]] bool validateScalar(const PJ_scalar_value_t& value, PrimitiveType expected, std::string_view where) {
auto actual_or = fromAbiType(value.type);
if (!actual_or.has_value()) {
setError(actual_or.error());
return false;
}
if (*actual_or != expected) {
setError(fmt::format("{}: scalar type mismatch", where));
return false;
}
return true;
}
void setFieldValue(
TopicId topic_id, std::size_t col_index, PrimitiveType logical_type, const PJ_scalar_value_t& value) {
switch (logical_type) {
case PrimitiveType::kFloat32:
writer_.set(topic_id, col_index, value.data.as_float32);
break;
case PrimitiveType::kFloat64:
writer_.set(topic_id, col_index, value.data.as_float64);
break;
case PrimitiveType::kInt8:
writer_.set(topic_id, col_index, static_cast<int64_t>(value.data.as_int8));
break;
case PrimitiveType::kInt16:
writer_.set(topic_id, col_index, static_cast<int64_t>(value.data.as_int16));
break;
case PrimitiveType::kInt32:
writer_.set(topic_id, col_index, value.data.as_int32);
break;
case PrimitiveType::kInt64:
writer_.set(topic_id, col_index, value.data.as_int64);
break;
case PrimitiveType::kUint8:
writer_.set(topic_id, col_index, static_cast<uint64_t>(value.data.as_uint8));
break;
case PrimitiveType::kUint16:
writer_.set(topic_id, col_index, static_cast<uint64_t>(value.data.as_uint16));
break;
case PrimitiveType::kUint32:
writer_.set(topic_id, col_index, static_cast<uint64_t>(value.data.as_uint32));
break;
case PrimitiveType::kUint64:
writer_.set(topic_id, col_index, value.data.as_uint64);
break;
case PrimitiveType::kBool:
writer_.set(topic_id, col_index, value.data.as_bool != 0);
break;
case PrimitiveType::kString:
writer_.set(topic_id, col_index, toStringView(value.data.as_string));
break;
case PrimitiveType::kUnspecified:
break;
}
}
[[nodiscard]] bool appendRecord(
TopicHandle topic, Timestamp timestamp, const PJ_named_field_value_t* fields, std::size_t field_count) {
if (engine_.getTopicStorage(topic.id) == nullptr) {
setError(fmt::format("topic {} not found", topic.id));
return false;
}
tsl::robin_set<std::string_view> seen_names;
struct ResolvedField {
FieldHandle handle;
PrimitiveType type;
const PJ_named_field_value_t* raw;
};
std::vector<ResolvedField> resolved;
resolved.reserve(field_count);
for (std::size_t i = 0; i < field_count; ++i) {
const auto& field = fields[i];
const auto name = toStringView(field.name);
if (!seen_names.insert(name).second) {
setError(fmt::format("duplicate field name '{}'", name));
return false;
}
if (field.is_null) {
// Null values: look up existing field by name.
TopicFieldKey key{.topic_id = topic.id, .field_name = std::string(name)};
auto it = field_cache_.find(key);
if (it == field_cache_.end()) {
// Field has never been seen. Check if this is a typed null (the ABI
// carries value.type even when is_null is true). A valid type lets
// us create the column now; an untyped null (kNull) is silently
// skipped — the column will be created when a non-null value arrives.
auto type_or = fromAbiType(field.value.type);
if (type_or.has_value()) {
FieldHandle handle{};
if (!ensureField(topic, name, field.value.type, &handle)) {
return false;
}
resolved.push_back({handle, *type_or, &field});
}
continue;
}
PrimitiveType existing{};
if (!lookupFieldType(topic, it->second.id, &existing)) {
return false;
}
resolved.push_back({it->second, existing, &field});
} else {
auto type_or = fromAbiType(field.value.type);
if (!type_or.has_value()) {
setError(type_or.error());
return false;
}
FieldHandle handle{};
if (!ensureField(topic, name, field.value.type, &handle)) {
return false;
}
if (!validateScalar(field.value, *type_or, "appendRecord")) {
return false;
}
resolved.push_back({handle, *type_or, &field});
}
}
auto begin_status = writer_.beginRow(topic.id, timestamp);
if (!begin_status.has_value()) {
setError(begin_status.error());
return false;
}
for (const auto& field : resolved) {
if (field.raw->is_null) {
writer_.setNull(topic.id, static_cast<std::size_t>(field.handle.id));
} else {
setFieldValue(topic.id, static_cast<std::size_t>(field.handle.id), field.type, field.raw->value);
}
}
auto finish_status = writer_.finishRow(topic.id);
if (!finish_status.has_value()) {
setError(finish_status.error());
return false;
}
last_error_.clear();
return true;
}
[[nodiscard]] bool appendBoundRecord(
TopicHandle topic, Timestamp timestamp, const PJ_bound_field_value_t* fields, std::size_t field_count) {
if (engine_.getTopicStorage(topic.id) == nullptr) {
setError(fmt::format("topic {} not found", topic.id));
return false;
}
tsl::robin_set<FieldId> seen_ids;
struct ResolvedField {
PrimitiveType type;
const PJ_bound_field_value_t* raw;
};
std::vector<ResolvedField> resolved;
resolved.reserve(field_count);
for (std::size_t i = 0; i < field_count; ++i) {
const auto& field = fields[i];
if (field.field.topic.id != topic.id) {
setError("field handle does not belong to the target topic");
return false;
}
if (!seen_ids.insert(field.field.id).second) {
setError(fmt::format("duplicate field id {}", field.field.id));
return false;
}
PrimitiveType type{};
if (!lookupFieldType(topic, field.field.id, &type)) {
return false;
}
if (!field.is_null && !validateScalar(field.value, type, "appendBoundRecord")) {
return false;
}
resolved.push_back({type, &field});
}
auto begin_status = writer_.beginRow(topic.id, timestamp);
if (!begin_status.has_value()) {
setError(begin_status.error());
return false;
}
for (const auto& field : resolved) {
if (field.raw->is_null) {
writer_.setNull(topic.id, static_cast<std::size_t>(field.raw->field.id));
} else {
setFieldValue(topic.id, static_cast<std::size_t>(field.raw->field.id), field.type, field.raw->value);
}
}
auto finish_status = writer_.finishRow(topic.id);
if (!finish_status.has_value()) {
setError(finish_status.error());
return false;
}
last_error_.clear();
return true;
}
/// Ingest a whole Arrow C Data Interface stream into a topic.
///
/// Ownership contract: callers pass a producer-owned @p stream. The caller
/// decides whether to release after this call — this method does NOT
/// call stream->release. That lets the outermost ABI trampoline enforce
/// the "success releases, failure retains" rule uniformly.
[[nodiscard]] bool appendArrowStream(
TopicHandle topic, struct ArrowArrayStream* stream, PJ_string_view_t timestamp_column) {
if (stream == nullptr) {
setError("append_arrow_stream: null stream");
return false;
}
if (engine_.getTopicStorage(topic.id) == nullptr) {
setError(fmt::format("topic {} not found", topic.id));
return false;
}
auto schema_or = arrow_import::schemaFromArrowStream(stream);
if (!schema_or.has_value()) {
setError(schema_or.error());
return false;
}
const std::string_view timestamp_name = toStringView(timestamp_column);
int ts_arrow_col = -1;
std::vector<arrow_import::ArrowColumnMapping> mappings;
for (const auto& mapping : schema_or->second) {
if (!timestamp_name.empty() && mapping.field_name == timestamp_name) {
ts_arrow_col = mapping.arrow_column_index;
continue;
}
FieldHandle field{};
if (!ensureField(topic, mapping.field_name, static_cast<PJ_primitive_type_t>(mapping.pj_type), &field)) {
return false;
}
auto adjusted = mapping;
adjusted.pj_column_index = static_cast<std::size_t>(field.id);
mappings.push_back(std::move(adjusted));
}
if (!timestamp_name.empty() && ts_arrow_col < 0) {
setError(fmt::format("timestamp column '{}' not found in stream schema", timestamp_name));
return false;
}
auto status = arrow_import::importArrowStream(writer_, topic.id, stream, mappings, ts_arrow_col);
if (!status.has_value()) {
setError(status.error());
return false;
}
last_error_.clear();
return true;
}
void flushPending() {
auto flushed = writer_.flushAll();
if (!flushed.empty()) {
engine_.commitChunks(std::move(flushed));
}
}
};
struct CatalogSnapshotState {
std::deque<std::string> names;
std::vector<PJ_data_source_info_t> data_sources;
std::vector<PJ_topic_info_t> topics;
std::vector<PJ_field_info_t> fields;
};
void releaseCatalogSnapshot(void* ctx) {
delete static_cast<CatalogSnapshotState*>(ctx);
}
PJ_string_view_t storeString(CatalogSnapshotState& state, std::string_view value) {
state.names.emplace_back(value);
const auto& stored = state.names.back();
return PJ_string_view_t{stored.data(), stored.size()};
}
struct ToolboxCore {
explicit ToolboxCore(DataEngine& engine) : write(engine), engine_(engine) {}
WriteCore write;
DataEngine& engine_;
[[nodiscard]] bool acquireCatalogSnapshot(PJ_catalog_snapshot_t* out_snapshot) {
auto* state = new CatalogSnapshotState{};
auto dataset_ids = engine_.listDatasets();
std::sort(dataset_ids.begin(), dataset_ids.end());
state->data_sources.reserve(dataset_ids.size());
for (DatasetId ds_id : dataset_ids) {
const auto* dataset = engine_.getDataset(ds_id);
if (dataset == nullptr) {
continue;
}
const uint32_t first_topic = static_cast<uint32_t>(state->topics.size());
auto topic_ids = engine_.listTopics(ds_id);
std::sort(topic_ids.begin(), topic_ids.end());
for (TopicId tid : topic_ids) {
const auto* storage = engine_.getTopicStorage(tid);
if (storage == nullptr) {
continue;
}
const uint32_t first_field = static_cast<uint32_t>(state->fields.size());
const auto columns = effectiveColumns(engine_, *storage);
for (const auto& col : columns) {
state->fields.push_back(
PJ_field_info_t{
.handle = FieldHandle{.topic = TopicHandle{.id = tid}, .id = col.field_id},
.name = storeString(*state, col.field_path),
.type = static_cast<PJ_primitive_type_t>(col.logical_type),
});
}
state->topics.push_back(
PJ_topic_info_t{
.handle = TopicHandle{.id = tid},
.source = DataSourceHandle{.id = ds_id},
.name = storeString(*state, storage->descriptor().name),
.first_field = first_field,
.field_count = static_cast<uint32_t>(state->fields.size()) - first_field,
});
}
state->data_sources.push_back(
PJ_data_source_info_t{
.handle = DataSourceHandle{.id = ds_id},
.name = storeString(*state, dataset->source_name),
.first_topic = first_topic,
.topic_count = static_cast<uint32_t>(state->topics.size()) - first_topic,
});
}
*out_snapshot = PJ_catalog_snapshot_t{
.data_sources = state->data_sources.data(),
.data_source_count = state->data_sources.size(),
.topics = state->topics.data(),
.topic_count = state->topics.size(),
.fields = state->fields.data(),
.field_count = state->fields.size(),
.release_ctx = state,
.release = releaseCatalogSnapshot,
};
write.last_error_.clear();
return true;
}
// v4: materialise one field's time series into host-owned Arrow structs.
// Output is a struct array with 2 columns: ["timestamp" (int64),
// <field_name> (typed)]. The caller must invoke out_schema->release and
// out_array->release when done; release callbacks are set by nanoarrow
// and free all allocated buffers.
[[nodiscard]] bool readSeriesArrow(FieldHandle field, struct ArrowSchema* out_schema, struct ArrowArray* out_array) {
if (out_schema == nullptr || out_array == nullptr) {
write.setError("readSeriesArrow: out_schema and out_array must be non-null");
return false;
}
const auto* storage = engine_.getTopicStorage(field.topic.id);
if (storage == nullptr) {
write.setError(fmt::format("topic {} not found", field.topic.id));
return false;
}
const auto columns = effectiveColumns(engine_, *storage);
const auto* desc = findFieldDescriptor(columns, field.id);
if (desc == nullptr) {
write.setError(fmt::format("field {} not found in topic {}", field.id, field.topic.id));
return false;
}
const ArrowType value_arrow_type = [&]() {
switch (desc->logical_type) {
case PrimitiveType::kFloat32:
return NANOARROW_TYPE_FLOAT;
case PrimitiveType::kFloat64:
return NANOARROW_TYPE_DOUBLE;
case PrimitiveType::kInt8:
return NANOARROW_TYPE_INT8;
case PrimitiveType::kInt16:
return NANOARROW_TYPE_INT16;
case PrimitiveType::kInt32:
return NANOARROW_TYPE_INT32;
case PrimitiveType::kInt64:
return NANOARROW_TYPE_INT64;
case PrimitiveType::kUint8:
return NANOARROW_TYPE_UINT8;
case PrimitiveType::kUint16:
return NANOARROW_TYPE_UINT16;
case PrimitiveType::kUint32:
return NANOARROW_TYPE_UINT32;
case PrimitiveType::kUint64:
return NANOARROW_TYPE_UINT64;
case PrimitiveType::kBool:
return NANOARROW_TYPE_BOOL;
case PrimitiveType::kString:
return NANOARROW_TYPE_STRING;
case PrimitiveType::kUnspecified:
return NANOARROW_TYPE_NA;
}
return NANOARROW_TYPE_NA;
}();
nanoarrow::UniqueSchema schema;
ArrowSchemaInit(schema.get());
if (ArrowSchemaSetTypeStruct(schema.get(), 2) != NANOARROW_OK) {
write.setError("readSeriesArrow: ArrowSchemaSetTypeStruct failed");
return false;
}
ArrowSchemaInit(schema->children[0]);
if (ArrowSchemaSetType(schema->children[0], NANOARROW_TYPE_INT64) != NANOARROW_OK ||
ArrowSchemaSetName(schema->children[0], "timestamp") != NANOARROW_OK) {
write.setError("readSeriesArrow: failed to set timestamp child schema");
return false;
}
ArrowSchemaInit(schema->children[1]);
if (ArrowSchemaSetType(schema->children[1], value_arrow_type) != NANOARROW_OK ||
ArrowSchemaSetName(schema->children[1], desc->field_path.c_str()) != NANOARROW_OK) {
write.setError("readSeriesArrow: failed to set value child schema");
return false;
}
nanoarrow::UniqueArray array;
ArrowError arrow_err;
if (ArrowArrayInitFromSchema(array.get(), schema.get(), &arrow_err) != NANOARROW_OK) {
write.setError(std::string("readSeriesArrow: ArrowArrayInitFromSchema failed: ") + arrow_err.message);
return false;
}
if (ArrowArrayStartAppending(array.get()) != NANOARROW_OK) {
write.setError("readSeriesArrow: ArrowArrayStartAppending failed");
return false;
}
auto* ts_child = array->children[0];
auto* val_child = array->children[1];
for (const auto& chunk : storage->sealedChunks()) {
int col_index = -1;
for (std::size_t i = 0; i < chunk.columns.size(); ++i) {
if (chunk.columns[i].descriptor->field_id == field.id) {
col_index = static_cast<int>(i);
break;
}
}
if (col_index < 0) {
continue;
}
const auto col_sz = static_cast<std::size_t>(col_index);
for (uint32_t row = 0; row < chunk.stats.row_count; ++row) {
if (ArrowArrayAppendInt(ts_child, chunk.readTimestamp(row)) != NANOARROW_OK) {
write.setError("readSeriesArrow: timestamp append failed");
return false;
}
const bool is_null = chunk.isNull(col_sz, row);
if (is_null) {
if (ArrowArrayAppendNull(val_child, 1) != NANOARROW_OK) {
write.setError("readSeriesArrow: null append failed");
return false;
}
} else {
ArrowErrorCode rc = NANOARROW_OK;
switch (desc->logical_type) {
case PrimitiveType::kFloat32:
rc = ArrowArrayAppendDouble(val_child, decodeNumericExact<float>(chunk, col_sz, row));
break;
case PrimitiveType::kFloat64:
rc = ArrowArrayAppendDouble(val_child, decodeNumericExact<double>(chunk, col_sz, row));
break;
case PrimitiveType::kInt8:
rc = ArrowArrayAppendInt(val_child, decodeNumericExact<int8_t>(chunk, col_sz, row));
break;
case PrimitiveType::kInt16:
rc = ArrowArrayAppendInt(val_child, decodeNumericExact<int16_t>(chunk, col_sz, row));
break;
case PrimitiveType::kInt32:
rc = ArrowArrayAppendInt(val_child, decodeNumericExact<int32_t>(chunk, col_sz, row));
break;
case PrimitiveType::kInt64:
rc = ArrowArrayAppendInt(val_child, decodeNumericExact<int64_t>(chunk, col_sz, row));
break;
case PrimitiveType::kUint8:
rc = ArrowArrayAppendUInt(val_child, decodeNumericExact<uint8_t>(chunk, col_sz, row));
break;
case PrimitiveType::kUint16:
rc = ArrowArrayAppendUInt(val_child, decodeNumericExact<uint16_t>(chunk, col_sz, row));
break;
case PrimitiveType::kUint32:
rc = ArrowArrayAppendUInt(val_child, decodeNumericExact<uint32_t>(chunk, col_sz, row));
break;
case PrimitiveType::kUint64:
rc = ArrowArrayAppendUInt(val_child, decodeNumericExact<uint64_t>(chunk, col_sz, row));
break;
case PrimitiveType::kBool:
rc = ArrowArrayAppendInt(val_child, chunk.readBool(col_sz, row) ? 1 : 0);
break;
case PrimitiveType::kString: {
const auto text = chunk.readString(col_sz, row);
const ArrowStringView sv{text.data(), static_cast<int64_t>(text.size())};
rc = ArrowArrayAppendString(val_child, sv);
break;
}
case PrimitiveType::kUnspecified:
rc = ArrowArrayAppendNull(val_child, 1);
break;
}
if (rc != NANOARROW_OK) {
write.setError("readSeriesArrow: value append failed");
return false;
}
}
if (ArrowArrayFinishElement(array.get()) != NANOARROW_OK) {
write.setError("readSeriesArrow: ArrowArrayFinishElement failed");
return false;
}
}
}
if (ArrowArrayFinishBuildingDefault(array.get(), &arrow_err) != NANOARROW_OK) {
write.setError(std::string("readSeriesArrow: finish building failed: ") + arrow_err.message);
return false;
}
// Move schema + array into caller-provided out params (transfers release
// callbacks; the UniqueXxx destructors become no-ops).
ArrowSchemaMove(schema.get(), out_schema);
ArrowArrayMove(array.get(), out_array);
write.last_error_.clear();
return true;
}
};
struct DatastoreSourceWriteHostState {
DatastoreSourceWriteHostState(DataEngine& engine, DataSourceHandle source_handle)
: core(engine), source(source_handle) {}
WriteCore core;
DataSourceHandle source;
};
struct DatastoreParserWriteHostState {
DatastoreParserWriteHostState(DataEngine& engine, TopicHandle topic_handle) : core(engine), topic(topic_handle) {}
WriteCore core;
TopicHandle topic;
};
struct DatastoreToolboxHostState {
DatastoreToolboxHostState(DataEngine& engine, ObjectStore& store) : core(engine), object_store(store) {}
ToolboxCore core;
// Toolbox plugins share the session's object store; the host holds a
// reference so register_object_topic + push_owned_object can forward
// without going back through the engine.
ObjectStore& object_store;
std::string object_last_error;
void setObjectError(std::string msg) {
object_last_error = std::move(msg);
}
};
struct DatastoreSourceObjectWriteHostState {
DatastoreSourceObjectWriteHostState(ObjectStore& s, DatasetId dataset) : store(s), dataset_id(dataset) {}
ObjectStore& store;
DatasetId dataset_id;
std::string last_error;
void setError(std::string msg) {
last_error = std::move(msg);
}
};
struct DatastoreToolboxObjectReadHostState {
explicit DatastoreToolboxObjectReadHostState(ObjectStore& s) : store(s) {}
ObjectStore& store;
std::string last_error;
void setError(std::string msg) {
last_error = std::move(msg);
}
};
struct DatastoreParserObjectWriteHostState {
DatastoreParserObjectWriteHostState(ObjectStore& s, ObjectTopicId topic) : store(s), bound_topic(topic) {}
ObjectStore& store;
ObjectTopicId bound_topic;
std::string last_error;
void setError(std::string msg) {
last_error = std::move(msg);
}
};
void propagateError(PJ_error_t* out_error, const char* msg) {
sdk::fillError(out_error, 1, "datastore", msg != nullptr ? std::string_view(msg) : std::string_view{});
}
template <typename Fn>
bool guardHostCallback(PJ_error_t* out_error, Fn&& fn) noexcept {
try {
return fn();
} catch (const std::exception& e) {
propagateError(out_error, e.what());
} catch (...) {
propagateError(out_error, "unknown datastore host exception");
}
return false;
}
bool sourceEnsureTopic(void* ctx, PJ_string_view_t topic_name, TopicHandle* out_topic, PJ_error_t* out_error) noexcept {
return guardHostCallback(out_error, [&] {
auto* impl = static_cast<DatastoreSourceWriteHostState*>(ctx);
if (!impl->core.ensureTopic(impl->source, toStringView(topic_name), out_topic)) {
propagateError(out_error, impl->core.lastError());
return false;
}
return true;
});
}
bool sourceEnsureField(
void* ctx, TopicHandle topic, PJ_string_view_t field_name, PJ_primitive_type_t type, FieldHandle* out_field,
PJ_error_t* out_error) noexcept {
return guardHostCallback(out_error, [&] {
auto* impl = static_cast<DatastoreSourceWriteHostState*>(ctx);