tigerbeetle-node 0.11.2 → 0.11.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (75) hide show
  1. package/dist/.client.node.sha256 +1 -1
  2. package/package.json +1 -1
  3. package/src/node.zig +6 -1
  4. package/src/tigerbeetle/src/benchmark.zig +1 -1
  5. package/src/tigerbeetle/src/c/tb_client/context.zig +1 -1
  6. package/src/tigerbeetle/src/c/tb_client/echo_client.zig +1 -1
  7. package/src/tigerbeetle/src/c/tb_client/thread.zig +1 -1
  8. package/src/tigerbeetle/src/c/tb_client.h +97 -111
  9. package/src/tigerbeetle/src/c/tb_client.zig +29 -18
  10. package/src/tigerbeetle/src/c/tb_client_header.zig +218 -0
  11. package/src/tigerbeetle/src/c/test.zig +7 -7
  12. package/src/tigerbeetle/src/cli.zig +4 -4
  13. package/src/tigerbeetle/src/config.zig +184 -374
  14. package/src/tigerbeetle/src/constants.zig +394 -0
  15. package/src/tigerbeetle/src/demo.zig +1 -1
  16. package/src/tigerbeetle/src/ewah.zig +18 -29
  17. package/src/tigerbeetle/src/ewah_fuzz.zig +130 -0
  18. package/src/tigerbeetle/src/io/darwin.zig +1 -1
  19. package/src/tigerbeetle/src/io/linux.zig +2 -2
  20. package/src/tigerbeetle/src/io/windows.zig +1 -1
  21. package/src/tigerbeetle/src/lsm/bloom_filter.zig +1 -1
  22. package/src/tigerbeetle/src/lsm/compaction.zig +55 -2
  23. package/src/tigerbeetle/src/lsm/forest.zig +1 -1
  24. package/src/tigerbeetle/src/lsm/forest_fuzz.zig +15 -7
  25. package/src/tigerbeetle/src/lsm/grid.zig +1 -1
  26. package/src/tigerbeetle/src/lsm/groove.zig +5 -39
  27. package/src/tigerbeetle/src/lsm/level_iterator.zig +1 -1
  28. package/src/tigerbeetle/src/lsm/manifest.zig +1 -6
  29. package/src/tigerbeetle/src/lsm/manifest_level.zig +1 -1
  30. package/src/tigerbeetle/src/lsm/manifest_log.zig +1 -1
  31. package/src/tigerbeetle/src/lsm/manifest_log_fuzz.zig +14 -9
  32. package/src/tigerbeetle/src/lsm/posted_groove.zig +2 -13
  33. package/src/tigerbeetle/src/lsm/segmented_array_benchmark.zig +1 -1
  34. package/src/tigerbeetle/src/lsm/set_associative_cache.zig +1 -1
  35. package/src/tigerbeetle/src/lsm/table.zig +25 -17
  36. package/src/tigerbeetle/src/lsm/table_immutable.zig +1 -1
  37. package/src/tigerbeetle/src/lsm/table_iterator.zig +1 -1
  38. package/src/tigerbeetle/src/lsm/table_mutable.zig +1 -1
  39. package/src/tigerbeetle/src/lsm/test.zig +1 -1
  40. package/src/tigerbeetle/src/lsm/tree.zig +47 -5
  41. package/src/tigerbeetle/src/lsm/tree_fuzz.zig +22 -18
  42. package/src/tigerbeetle/src/main.zig +22 -16
  43. package/src/tigerbeetle/src/message_bus.zig +1 -1
  44. package/src/tigerbeetle/src/message_pool.zig +2 -2
  45. package/src/tigerbeetle/src/simulator.zig +3 -10
  46. package/src/tigerbeetle/src/state_machine.zig +627 -1806
  47. package/src/tigerbeetle/src/storage.zig +1 -1
  48. package/src/tigerbeetle/src/test/accounting/auditor.zig +1 -1
  49. package/src/tigerbeetle/src/test/accounting/workload.zig +1 -1
  50. package/src/tigerbeetle/src/test/cluster.zig +1 -1
  51. package/src/tigerbeetle/src/test/conductor.zig +1 -1
  52. package/src/tigerbeetle/src/test/fuzz.zig +19 -0
  53. package/src/tigerbeetle/src/test/message_bus.zig +1 -1
  54. package/src/tigerbeetle/src/test/network.zig +1 -1
  55. package/src/tigerbeetle/src/test/state_checker.zig +2 -2
  56. package/src/tigerbeetle/src/test/storage.zig +14 -5
  57. package/src/tigerbeetle/src/test/storage_checker.zig +1 -1
  58. package/src/tigerbeetle/src/test/table.zig +226 -0
  59. package/src/tigerbeetle/src/time.zig +1 -1
  60. package/src/tigerbeetle/src/tracer.zig +507 -0
  61. package/src/tigerbeetle/src/unit_tests.zig +2 -0
  62. package/src/tigerbeetle/src/vsr/client.zig +1 -1
  63. package/src/tigerbeetle/src/vsr/clock.zig +1 -1
  64. package/src/tigerbeetle/src/vsr/journal.zig +46 -115
  65. package/src/tigerbeetle/src/vsr/journal_format_fuzz.zig +111 -0
  66. package/src/tigerbeetle/src/vsr/replica.zig +50 -159
  67. package/src/tigerbeetle/src/vsr/replica_format.zig +216 -0
  68. package/src/tigerbeetle/src/vsr/superblock.zig +1 -1
  69. package/src/tigerbeetle/src/vsr/superblock_client_table.zig +1 -1
  70. package/src/tigerbeetle/src/vsr/superblock_free_set.zig +3 -2
  71. package/src/tigerbeetle/src/vsr/superblock_free_set_fuzz.zig +2 -0
  72. package/src/tigerbeetle/src/vsr/superblock_fuzz.zig +8 -5
  73. package/src/tigerbeetle/src/vsr/superblock_manifest.zig +1 -1
  74. package/src/tigerbeetle/src/vsr/superblock_quorums_fuzz.zig +2 -0
  75. package/src/tigerbeetle/src/vsr.zig +2 -2
@@ -0,0 +1,507 @@
1
+ //! The tracer records a tree of event spans.
2
+ //!
3
+ //! In order to create event spans, you need somewhere to store the `SpanStart`.
4
+ //!
5
+ //! var slot: ?SpanStart = null;
6
+ //! tracer.start(&slot, group, event, @src());
7
+ //! ... do stuff ...
8
+ //! tracer.end(&slot, group, event);
9
+ //!
10
+ //! Each slot can be used as many times as you like,
11
+ //! but you must alternate calls to start and end,
12
+ //! and you must end every event.
13
+ //!
14
+ //! // good
15
+ //! tracer.start(&slot, group_a, event_a, @src());
16
+ //! tracer.end(&slot, group_a, event_a);
17
+ //! tracer.start(&slot, group_b, event_b, @src());
18
+ //! tracer.end(&slot, group_b, event_b);
19
+ //!
20
+ //! // bad
21
+ //! tracer.start(&slot, group_a, event_a, @src());
22
+ //! tracer.start(&slot, group_b, event_b, @src());
23
+ //! tracer.end(&slot, group_b, event_b);
24
+ //! tracer.end(&slot, group_a, event_a);
25
+ //!
26
+ //! // bad
27
+ //! tracer.end(&slot, group_a, event_a);
28
+ //! tracer.start(&slot, group_a, event_a, @src());
29
+ //!
30
+ //! // bad
31
+ //! tracer.start(&slot, group_a, event_a, @src());
32
+ //! std.os.exit(0);
33
+ //!
34
+ //! Before freeing a slot, you should `assert(slot == null)`
35
+ //! to ensure that you didn't forget to end an event.
36
+ //!
37
+ //! Each `Event` has an `EventGroup`.
38
+ //! Within each group, event spans should form a tree.
39
+ //!
40
+ //! // good
41
+ //! tracer.start(&a, group, ...);
42
+ //! tracer.start(&b, group, ...);
43
+ //! tracer.end(&b, group, ...);
44
+ //! tracer.end(&a, group, ...);
45
+ //!
46
+ //! // bad
47
+ //! tracer.start(&a, group, ...);
48
+ //! tracer.start(&b, group, ...);
49
+ //! tracer.end(&a, group, ...);
50
+ //! tracer.end(&b, group, ...);
51
+ //!
52
+ //! The tracer itself will not object to non-tree spans,
53
+ //! but some config.tracer_backends will either refuse to open the trace or will render it weirdly.
54
+ //!
55
+ //! If you're having trouble making your spans form a tree, feel free to just add new groups.
56
+
57
+ const std = @import("std");
58
+ const assert = std.debug.assert;
59
+ const Allocator = std.mem.Allocator;
60
+ const log = std.log.scoped(.tracer);
61
+
62
+ const config = @import("./constants.zig");
63
+ const Time = @import("./time.zig").Time;
64
+ const util = @import("util.zig");
65
+
66
+ /// All strings in Event must be comptime constants to ensure that they live until after `tracer.deinit` is called.
67
+ pub const Event = union(enum) {
68
+ tracer_flush,
69
+ commit: struct {
70
+ op: u64,
71
+ },
72
+ checkpoint,
73
+ state_machine_prefetch,
74
+ state_machine_commit,
75
+ state_machine_compact,
76
+ tree_compaction_beat: struct {
77
+ tree_name: []const u8,
78
+ },
79
+ tree_compaction_tick: struct {
80
+ tree_name: []const u8,
81
+ level_b: u8,
82
+ },
83
+ tree_compaction_merge: struct {
84
+ tree_name: []const u8,
85
+ level_b: u8,
86
+ },
87
+
88
+ pub fn format(
89
+ event: Event,
90
+ comptime fmt: []const u8,
91
+ options: std.fmt.FormatOptions,
92
+ writer: anytype,
93
+ ) !void {
94
+ _ = fmt;
95
+ _ = options;
96
+
97
+ switch (event) {
98
+ .tracer_flush => try writer.print("tracer_flush", .{}),
99
+ .commit => |commit| try writer.print("commit({})", .{commit.op}),
100
+ .checkpoint => try writer.print("checkpoint", .{}),
101
+ .state_machine_prefetch => try writer.print("state_machine_prefetch", .{}),
102
+ .state_machine_commit => try writer.print("state_machine_commit", .{}),
103
+ .state_machine_compact => try writer.print("state_machine_compact", .{}),
104
+ .tree_compaction_beat => |tree_compaction_tick| try writer.print(
105
+ "tree_compaction_beat({s})",
106
+ .{tree_compaction_tick.tree_name},
107
+ ),
108
+ .tree_compaction_tick => |tree_compaction_tick| try writer.print(
109
+ "tree_compaction_tick({s}, {})",
110
+ .{ tree_compaction_tick.tree_name, tree_compaction_tick.level_b },
111
+ ),
112
+ .tree_compaction_merge => |tree_compaction_merge| try writer.print(
113
+ "tree_compaction_merge({s}, {})",
114
+ .{ tree_compaction_merge.tree_name, tree_compaction_merge.level_b },
115
+ ),
116
+ }
117
+ }
118
+ };
119
+
120
+ /// All strings in EventGroup must be comptime constants to ensure that they live until after `tracer.deinit` is called.
121
+ pub const EventGroup = union(enum) {
122
+ main,
123
+ tracer,
124
+ tree: struct {
125
+ tree_name: [:0]const u8,
126
+ },
127
+
128
+ fn name(event_group: EventGroup) [:0]const u8 {
129
+ return switch (event_group) {
130
+ .main => "main",
131
+ .tracer => "tracer",
132
+ .tree => |tree| tree.tree_name,
133
+ };
134
+ }
135
+ };
136
+
137
+ usingnamespace switch (config.tracer_backend) {
138
+ .none => TracerNone,
139
+ .perfetto => TracerPerfetto,
140
+ .tracy => TracerTracy,
141
+ };
142
+
143
+ pub const TracerNone = struct {
144
+ pub const SpanStart = void;
145
+ pub fn init(allocator: Allocator) !void {
146
+ _ = allocator;
147
+ }
148
+ pub fn deinit(allocator: Allocator) void {
149
+ _ = allocator;
150
+ }
151
+ pub fn start(
152
+ slot: *?SpanStart,
153
+ event_group: EventGroup,
154
+ event: Event,
155
+ src: std.builtin.SourceLocation,
156
+ ) void {
157
+ _ = src;
158
+ _ = slot;
159
+ _ = event_group;
160
+ _ = event;
161
+ }
162
+ pub fn end(slot: *?SpanStart, event_group: EventGroup, event: Event) void {
163
+ _ = slot;
164
+ _ = event_group;
165
+ _ = event;
166
+ }
167
+ pub fn flush() void {}
168
+ };
169
+
170
+ pub const TracerPerfetto = struct {
171
+ var is_initialized = false;
172
+ var timer = Time{};
173
+ var span_id_next: u64 = 0;
174
+ var spans: std.ArrayList(Span) = undefined;
175
+ var flush_slot: ?SpanStart = null;
176
+ var log_file: std.fs.File = undefined;
177
+
178
+ const span_count_max = 1 << 20;
179
+ const log_path = "./tracer.json";
180
+
181
+ const SpanId = u64;
182
+
183
+ pub const SpanStart = struct {
184
+ id: SpanId,
185
+ start_time_ns: u64,
186
+ group: EventGroup,
187
+ event: Event,
188
+ };
189
+
190
+ const Span = struct {
191
+ id: SpanId,
192
+ start_time_ns: u64,
193
+ end_time_ns: u64,
194
+ group: EventGroup,
195
+ event: Event,
196
+ };
197
+
198
+ pub fn init(allocator: Allocator) !void {
199
+ assert(!is_initialized);
200
+
201
+ spans = try std.ArrayList(Span).initCapacity(allocator, span_count_max);
202
+ errdefer spans.deinit();
203
+
204
+ log_file = try std.fs.cwd().createFile(log_path, .{ .truncate = true });
205
+ errdefer log_file.close();
206
+
207
+ try log_file.writeAll(
208
+ \\{"traceEvents":[
209
+ \\
210
+ );
211
+
212
+ is_initialized = true;
213
+ }
214
+
215
+ pub fn deinit(allocator: Allocator) void {
216
+ _ = allocator;
217
+
218
+ assert(is_initialized);
219
+
220
+ flush();
221
+ log_file.close();
222
+ assert(flush_slot == null);
223
+ spans.deinit();
224
+ is_initialized = false;
225
+ }
226
+
227
+ pub fn start(
228
+ slot: *?SpanStart,
229
+ event_group: EventGroup,
230
+ event: Event,
231
+ src: std.builtin.SourceLocation,
232
+ ) void {
233
+ _ = src;
234
+ assert(is_initialized);
235
+
236
+ // The event must not have already been started.
237
+ assert(slot.* == null);
238
+
239
+ slot.* = .{
240
+ .id = span_id_next,
241
+ .start_time_ns = timer.monotonic(),
242
+ .group = event_group,
243
+ .event = event,
244
+ };
245
+ span_id_next += 1;
246
+ }
247
+
248
+ pub fn end(slot: *?SpanStart, event_group: EventGroup, event: Event) void {
249
+ assert(is_initialized);
250
+
251
+ // The event must have already been started.
252
+ const span_start = &slot.*.?;
253
+ assert(std.meta.eql(span_start.group, event_group));
254
+ assert(std.meta.eql(span_start.event, event));
255
+
256
+ // Make sure we have room in spans.
257
+ if (spans.items.len >= span_count_max) flush();
258
+ assert(spans.items.len < span_count_max);
259
+
260
+ spans.appendAssumeCapacity(.{
261
+ .id = span_start.id,
262
+ .start_time_ns = span_start.start_time_ns,
263
+ .end_time_ns = timer.monotonic(),
264
+ .group = span_start.group,
265
+ .event = span_start.event,
266
+ });
267
+ slot.* = null;
268
+ }
269
+
270
+ pub fn flush() void {
271
+ assert(is_initialized);
272
+
273
+ if (spans.items.len == 0) return;
274
+
275
+ start(&flush_slot, .tracer, .tracer_flush, @src());
276
+ flush_or_err() catch |err| {
277
+ log.err("Could not flush tracer log, discarding instead: {}", .{err});
278
+ };
279
+ spans.shrinkRetainingCapacity(0);
280
+ end(&flush_slot, .tracer, .tracer_flush);
281
+ }
282
+
283
+ fn flush_or_err() !void {
284
+ for (spans.items) |span| {
285
+ // Perfetto requires this json format:
286
+ // https://docs.google.com/document/d/1CvAClvFfyA5R-PhYUmn5OOQtYMH4h6I0nSsKchNAySU/preview
287
+ const NameJson = struct {
288
+ event: Event,
289
+
290
+ pub fn jsonStringify(
291
+ name_json: @This(),
292
+ options: std.json.StringifyOptions,
293
+ writer: anytype,
294
+ ) @TypeOf(writer).Error!void {
295
+ _ = options;
296
+ try writer.writeAll("\"");
297
+ try writer.print("{}", .{name_json.event});
298
+ try writer.writeAll("\"");
299
+ }
300
+ };
301
+ const SpanJson = struct {
302
+ name: NameJson,
303
+ cat: []const u8 = "default",
304
+ ph: []const u8 = "X",
305
+ ts: f64,
306
+ dur: f64,
307
+ pid: u64 = 0,
308
+ tid: u64,
309
+ };
310
+ const MetaJson = struct {
311
+ name: []const u8,
312
+ ph: []const u8 = "M",
313
+ pid: u64 = 0,
314
+ tid: u64,
315
+ args: struct {
316
+ name: []const u8,
317
+ },
318
+ };
319
+
320
+ const tid_64 = switch (span.group) {
321
+ .main => 0,
322
+ .tracer => 1,
323
+ .tree => |tree| std.hash_map.hashString(tree.tree_name),
324
+ };
325
+ const tid = @truncate(u32, tid_64) ^ @truncate(u32, tid_64 >> 32);
326
+
327
+ var buffered_writer = std.io.bufferedWriter(log_file.writer());
328
+ const writer = buffered_writer.writer();
329
+
330
+ try std.json.stringify(
331
+ SpanJson{
332
+ .name = .{ .event = span.event },
333
+ .ts = @intToFloat(f64, span.start_time_ns) / 1000,
334
+ .dur = @intToFloat(f64, span.end_time_ns - span.start_time_ns) / 1000,
335
+ .tid = tid,
336
+ },
337
+ .{},
338
+ writer,
339
+ );
340
+ try writer.writeAll(",\n");
341
+
342
+ // TODO Only emit metadata once per group name.
343
+ try std.json.stringify(
344
+ MetaJson{
345
+ .name = "thread_name",
346
+ .tid = tid,
347
+ .args = .{ .name = span.group.name() },
348
+ },
349
+ .{},
350
+ writer,
351
+ );
352
+ try writer.writeAll(",\n");
353
+
354
+ try buffered_writer.flush();
355
+ }
356
+ }
357
+ };
358
+
359
+ const TracerTracy = struct {
360
+ const c = @cImport({
361
+ @cDefine("TRACY_ENABLE", "1");
362
+ @cDefine("TRACY_FIBERS", "1");
363
+ @cInclude("TracyC.h");
364
+ });
365
+
366
+ // TODO Ask constants.zig for a static bound on callstack depth.
367
+ const callstack_depth = 64;
368
+
369
+ pub const SpanStart = c.___tracy_c_zone_context;
370
+
371
+ var print_buffer: [1024]u8 = undefined;
372
+
373
+ pub fn init(allocator: Allocator) !void {
374
+ _ = allocator;
375
+ }
376
+
377
+ pub fn deinit(allocator: Allocator) void {
378
+ _ = allocator;
379
+ }
380
+
381
+ pub fn start(
382
+ slot: *?SpanStart,
383
+ event_group: EventGroup,
384
+ event: Event,
385
+ src: std.builtin.SourceLocation,
386
+ ) void {
387
+ // The event must not already have been started.
388
+ assert(slot.* == null);
389
+ c.___tracy_fiber_enter(event_group.name());
390
+ const name = std.fmt.bufPrint(&print_buffer, "{}", .{event}) catch name: {
391
+ const dots = "...";
392
+ util.copy_disjoint(.exact, u8, print_buffer[print_buffer.len - dots.len ..], dots);
393
+ break :name &print_buffer;
394
+ };
395
+ // TODO The alloc_srcloc here is not free and should be unnecessary,
396
+ // but the alloc-free version currently crashes:
397
+ // https://github.com/ziglang/zig/issues/13315#issuecomment-1331099909.
398
+ slot.* = c.___tracy_emit_zone_begin_alloc_callstack(c.___tracy_alloc_srcloc_name(
399
+ src.line,
400
+ src.file.ptr,
401
+ src.file.len,
402
+ src.fn_name.ptr,
403
+ src.fn_name.len,
404
+ name.ptr,
405
+ name.len,
406
+ ), callstack_depth, 1);
407
+ }
408
+
409
+ pub fn end(slot: *?SpanStart, event_group: EventGroup, event: Event) void {
410
+ _ = event;
411
+
412
+ // The event must already have been started.
413
+ const tracy_context = slot.*.?;
414
+ c.___tracy_fiber_enter(event_group.name());
415
+ c.___tracy_emit_zone_end(tracy_context);
416
+ slot.* = null;
417
+ }
418
+
419
+ pub fn flush() void {}
420
+
421
+ pub fn log_fn(
422
+ comptime level: std.log.Level,
423
+ comptime scope: @TypeOf(.EnumLiteral),
424
+ comptime format: []const u8,
425
+ args: anytype,
426
+ ) void {
427
+ const level_text = comptime level.asText();
428
+ const prefix = if (scope == .default) ": " else "(" ++ @tagName(scope) ++ "): ";
429
+ const message = std.fmt.bufPrint(
430
+ &print_buffer,
431
+ level_text ++ prefix ++ format,
432
+ args,
433
+ ) catch message: {
434
+ const dots = "...";
435
+ util.copy_disjoint(.exact, u8, print_buffer[print_buffer.len - dots.len ..], dots);
436
+ break :message &print_buffer;
437
+ };
438
+ c.___tracy_fiber_enter((EventGroup{ .main = {} }).name());
439
+ c.___tracy_emit_message(message.ptr, message.len, callstack_depth);
440
+ }
441
+
442
+ // Copied from zig/src/tracy.zig
443
+ pub const TracerAllocator = struct {
444
+ parent_allocator: std.mem.Allocator,
445
+
446
+ pub fn init(parent_allocator: std.mem.Allocator) TracerAllocator {
447
+ return .{
448
+ .parent_allocator = parent_allocator,
449
+ };
450
+ }
451
+
452
+ pub fn allocator(self: *TracerAllocator) std.mem.Allocator {
453
+ return std.mem.Allocator.init(self, allocFn, resizeFn, freeFn);
454
+ }
455
+
456
+ fn allocFn(
457
+ self: *TracerAllocator,
458
+ len: usize,
459
+ ptr_align: u29,
460
+ len_align: u29,
461
+ ret_addr: usize,
462
+ ) std.mem.Allocator.Error![]u8 {
463
+ const result = self.parent_allocator.rawAlloc(len, ptr_align, len_align, ret_addr);
464
+ if (result) |data| {
465
+ if (data.len != 0) {
466
+ c.___tracy_emit_memory_alloc_callstack(data.ptr, data.len, callstack_depth, 0);
467
+ }
468
+ } else |_| {}
469
+ return result;
470
+ }
471
+
472
+ fn resizeFn(
473
+ self: *TracerAllocator,
474
+ buf: []u8,
475
+ buf_align: u29,
476
+ new_len: usize,
477
+ len_align: u29,
478
+ ret_addr: usize,
479
+ ) ?usize {
480
+ if (self.parent_allocator.rawResize(
481
+ buf,
482
+ buf_align,
483
+ new_len,
484
+ len_align,
485
+ ret_addr,
486
+ )) |resized_len| {
487
+ c.___tracy_emit_memory_free_callstack(buf.ptr, callstack_depth, 0);
488
+ c.___tracy_emit_memory_alloc_callstack(buf.ptr, resized_len, callstack_depth, 0);
489
+
490
+ return resized_len;
491
+ }
492
+
493
+ // during normal operation the compiler hits this case thousands of times due to this
494
+ // emitting messages for it is both slow and causes clutter
495
+ return null;
496
+ }
497
+
498
+ fn freeFn(self: *TracerAllocator, buf: []u8, buf_align: u29, ret_addr: usize) void {
499
+ self.parent_allocator.rawFree(buf, buf_align, ret_addr);
500
+ // this condition is to handle free being called on an empty slice that was never even allocated
501
+ // example case: `std.process.getSelfExeSharedLibPaths` can return `&[_][:0]u8{}`
502
+ if (buf.len != 0) {
503
+ c.___tracy_emit_memory_free_callstack(buf.ptr, callstack_depth, 0);
504
+ }
505
+ }
506
+ };
507
+ };
@@ -2,6 +2,7 @@ test {
2
2
  _ = @import("vsr.zig");
3
3
  _ = @import("vsr/journal.zig");
4
4
  _ = @import("vsr/marzullo.zig");
5
+ _ = @import("vsr/replica_format.zig");
5
6
  _ = @import("vsr/superblock.zig");
6
7
  _ = @import("vsr/superblock_free_set.zig");
7
8
  _ = @import("vsr/superblock_manifest.zig");
@@ -32,4 +33,5 @@ test {
32
33
  _ = @import("test/accounting/auditor.zig");
33
34
  _ = @import("test/accounting/workload.zig");
34
35
  _ = @import("test/storage.zig");
36
+ _ = @import("test/table.zig");
35
37
  }
@@ -2,7 +2,7 @@ const std = @import("std");
2
2
  const assert = std.debug.assert;
3
3
  const mem = std.mem;
4
4
 
5
- const config = @import("../config.zig");
5
+ const config = @import("../constants.zig");
6
6
  const vsr = @import("../vsr.zig");
7
7
  const Header = vsr.Header;
8
8
 
@@ -3,7 +3,7 @@ const assert = std.debug.assert;
3
3
  const log = std.log.scoped(.clock);
4
4
  const fmt = std.fmt;
5
5
 
6
- const config = @import("../config.zig");
6
+ const config = @import("../constants.zig");
7
7
 
8
8
  const clock_offset_tolerance_max: u64 = config.clock_offset_tolerance_max_ms * std.time.ns_per_ms;
9
9
  const epoch_max: u64 = config.clock_epoch_max_ms * std.time.ns_per_ms;