-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhunk.zig
202 lines (166 loc) · 6.03 KB
/
hunk.zig
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
const std = @import("std");
const builtin = @import("builtin");
pub const HunkSide = struct {
pub const VTable = struct {
alloc: *const fn (self: *Hunk, n: usize, alignment: u8) ?[*]u8,
getMark: *const fn (self: *Hunk) usize,
freeToMark: *const fn (self: *Hunk, pos: usize) void,
};
hunk: *Hunk,
vtable: *const VTable,
const allocator_vtable: std.mem.Allocator.VTable = .{
.alloc = &allocFn,
.resize = &resizeFn,
.free = &freeFn,
};
fn init(hunk: *Hunk, vtable: *const VTable) HunkSide {
return .{
.hunk = hunk,
.vtable = vtable,
};
}
pub fn allocator(self: *const HunkSide) std.mem.Allocator {
return .{
.ptr = @constCast(self),
.vtable = &allocator_vtable,
};
}
pub fn getMark(self: HunkSide) usize {
return self.vtable.getMark(self.hunk);
}
pub fn freeToMark(self: HunkSide, pos: usize) void {
self.vtable.freeToMark(self.hunk, pos);
}
fn allocFn(ctx: *anyopaque, len: usize, ptr_align: u8, ret_addr: usize) ?[*]u8 {
_ = ret_addr;
const self: *const HunkSide = @ptrCast(@alignCast(ctx));
return self.vtable.alloc(self.hunk, len, ptr_align);
}
fn resizeFn(_: *anyopaque, old_mem: []u8, buf_align: u8, new_len: usize, ret_addr: usize) bool {
_ = buf_align;
_ = ret_addr;
return new_len <= old_mem.len;
}
fn freeFn(_: *anyopaque, buf: []u8, buf_align: u8, ret_addr: usize) void {
_ = buf;
_ = buf_align;
_ = ret_addr;
}
};
pub const Hunk = struct {
low_used: usize,
high_used: usize,
buffer: []u8,
pub fn init(buffer: []u8) Hunk {
return .{
.low_used = 0,
.high_used = 0,
.buffer = buffer,
};
}
pub fn low(self: *Hunk) HunkSide {
const GlobalStorage = struct {
const vtable: HunkSide.VTable = .{
.alloc = &allocLow,
.getMark = &getLowMark,
.freeToMark = &freeToLowMark,
};
};
return HunkSide.init(self, &GlobalStorage.vtable);
}
pub fn high(self: *Hunk) HunkSide {
const GlobalStorage = struct {
const vtable: HunkSide.VTable = .{
.alloc = &allocHigh,
.getMark = &getHighMark,
.freeToMark = &freeToHighMark,
};
};
return HunkSide.init(self, &GlobalStorage.vtable);
}
pub fn allocLow(self: *Hunk, n: usize, ptr_align: u8) ?[*]u8 {
const alignment = @as(u29, 1) << @as(u5, @intCast(ptr_align));
const start = @intFromPtr(self.buffer.ptr);
const adjusted_index = std.mem.alignForward(usize, start + self.low_used, alignment) - start;
const new_low_used = adjusted_index + n;
if (new_low_used > self.buffer.len - self.high_used) {
return null;
}
const result = self.buffer[adjusted_index..new_low_used];
self.low_used = new_low_used;
return result.ptr;
}
pub fn allocHigh(self: *Hunk, n: usize, ptr_align: u8) ?[*]u8 {
const alignment = @as(u29, 1) << @as(u5, @intCast(ptr_align));
const addr = @intFromPtr(self.buffer.ptr) + self.buffer.len - self.high_used;
const rem = @rem(addr, alignment);
const march_backward_bytes = rem;
const adjusted_index = self.high_used + march_backward_bytes;
const new_high_used = adjusted_index + n;
if (new_high_used > self.buffer.len - self.low_used) {
return null;
}
const start = self.buffer.len - adjusted_index - n;
const result = self.buffer[start .. start + n];
self.high_used = new_high_used;
return result.ptr;
}
pub fn getLowMark(self: *Hunk) usize {
return self.low_used;
}
pub fn getHighMark(self: *Hunk) usize {
return self.high_used;
}
pub fn freeToLowMark(self: *Hunk, pos: usize) void {
std.debug.assert(pos <= self.low_used);
if (pos < self.low_used) {
if (builtin.mode == .Debug) {
@memset(self.buffer[pos..self.low_used], 0xcc);
}
self.low_used = pos;
}
}
pub fn freeToHighMark(self: *Hunk, pos: usize) void {
std.debug.assert(pos <= self.high_used);
if (pos < self.high_used) {
if (builtin.mode == .Debug) {
const i = self.buffer.len - self.high_used;
const n = self.high_used - pos;
@memset(self.buffer[i .. i + n], 0xcc);
}
self.high_used = pos;
}
}
};
test "Hunk" {
// test a few random operations. very low coverage. write more later
var buf: [100]u8 = undefined;
var hunk = Hunk.init(buf[0..]);
const high_mark = hunk.getHighMark();
var hunk_low = hunk.low();
var hunk_high = hunk.high();
_ = try hunk_low.allocator().alloc(u8, 7);
_ = try hunk_high.allocator().alloc(u8, 8);
try std.testing.expectEqual(@as(usize, 7), hunk.low_used);
try std.testing.expectEqual(@as(usize, 8), hunk.high_used);
_ = try hunk_high.allocator().alloc(u8, 8);
try std.testing.expectEqual(@as(usize, 16), hunk.high_used);
const low_mark = hunk.getLowMark();
_ = try hunk_low.allocator().alloc(u8, 100 - 7 - 16);
try std.testing.expectEqual(@as(usize, 100 - 16), hunk.low_used);
try std.testing.expectError(error.OutOfMemory, hunk_high.allocator().alloc(u8, 1));
hunk.freeToLowMark(low_mark);
_ = try hunk_high.allocator().alloc(u8, 1);
hunk.freeToHighMark(high_mark);
try std.testing.expectEqual(@as(usize, 0), hunk.high_used);
}
test "resizing" {
var buf: [100]u8 = undefined;
var hunk = Hunk.init(buf[0..]);
var hunk_low = hunk.low();
const allocator = hunk_low.allocator();
const memory = try allocator.alloc(u8, 7);
try std.testing.expect(!allocator.resize(memory, 8));
try std.testing.expect(allocator.resize(memory, 7));
try std.testing.expect(allocator.resize(memory, 6));
}