summaryrefslogtreecommitdiff
path: root/src/Registers.zig
diff options
context:
space:
mode:
authorGabriel Schneider <[email protected]>2026-10-31 06:28:48 -0300
committerGabriel Schneider <[email protected]>2026-10-31 06:28:48 -0300
commita479792a1ab2b593642d7f648194bfa23ce01dba (patch)
tree96ddee7d879a9084daa07db43b0b7910b072a785 /src/Registers.zig
parente179cc44fe5060c76a5b00c41e53f11209f5acd9 (diff)
parent4c761893e5b3fdae422622cfa02104ab36633045 (diff)
downloadpardes-a479792a1ab2b593642d7f648194bfa23ce01dba.tar.gz
pardes-a479792a1ab2b593642d7f648194bfa23ce01dba.zip
Merge the upstream daemon and replicated client/server refactor
Diffstat (limited to 'src/Registers.zig')
-rw-r--r--src/Registers.zig39
1 files changed, 23 insertions, 16 deletions
diff --git a/src/Registers.zig b/src/Registers.zig
index 5e23da5b..6df7401d 100644
--- a/src/Registers.zig
+++ b/src/Registers.zig
@@ -5,13 +5,19 @@
//! computed from the editor rather than stored (`_`, `#`, `.`, `%`) and the
//! clipboard's paste side are read in edit.zig, which has the pane at hand.
const std = @import("std");
+const freeRaw = @import("memory.zig").freeRaw;
const Registers = @This();
list: std.ArrayList(Reg) = .empty,
last_search: u21 = '/',
+/// The values (their array too) and the joined text are replaced whole,
+/// never written in place (`put` makes a new array), freed raw: blobs
+/// (src/walk.zig), which a digest hashes once and a replica's rollback copy
+/// pins as it does a file's text.
pub const Reg = struct {
+ pub const replica = .{ .blob = .{ "values", "joined" } };
name: u21,
/// gpa-owned, one per range, in document order
values: [][]u8,
@@ -30,9 +36,9 @@ pub fn deinit(r: *Registers, gpa: std.mem.Allocator) void {
}
fn freeReg(gpa: std.mem.Allocator, reg: *Reg) void {
- for (reg.values) |v| gpa.free(v);
- gpa.free(reg.values);
- if (reg.joined) |j| gpa.free(j);
+ for (reg.values) |v| freeRaw(gpa, v);
+ freeRaw(gpa, reg.values);
+ if (reg.joined) |j| freeRaw(gpa, j);
}
pub fn get(r: *Registers, name: u21) ?*Reg {
@@ -60,19 +66,20 @@ pub fn put(r: *Registers, gpa: std.mem.Allocator, name: u21, bytes: []const u8,
};
break :blk &r.list.items[r.list.items.len - 1];
};
- if (fresh or reg.values.len != n) {
- const values = gpa.alloc([]u8, n) catch {
- gpa.free(copy);
- return;
- };
- for (values) |*v| v.* = &.{};
- freeReg(gpa, reg);
- reg.* = .{ .name = name, .values = values };
- }
- gpa.free(reg.values[i]);
- reg.values[i] = copy;
- if (reg.joined) |j| gpa.free(j);
- reg.joined = null;
+ // A new array, the old one's values moved into it but value `i`.
+ const values = gpa.alloc([]u8, n) catch {
+ gpa.free(copy);
+ return;
+ };
+ const keep = !fresh and reg.values.len == n;
+ for (values, 0..) |*v, j| v.* = if (keep and j != i) reg.values[j] else &.{};
+ values[i] = copy;
+ if (keep) {
+ freeRaw(gpa, reg.values[i]);
+ freeRaw(gpa, reg.values);
+ if (reg.joined) |j| freeRaw(gpa, j);
+ } else freeReg(gpa, reg);
+ reg.* = .{ .name = name, .values = values };
}
/// The whole register as one text: its values joined by newlines, no