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
|
//! What a key costs on the library (`zig build bench -- <KiB> <keys>`, Debug
//! or -Doptimize): a text of that size in the C grammar's shape, a key
//! typed into its middle `keys` times, each with an arena of its own; the
//! 4 KiB pages of the value a typed character changes; a full parse of the
//! text. `keys` 0 makes the text alone, to count what the keys add; a
//! third argument, `pages`, counts the pages (a copy and a compare a key,
//! which an instruction count of the keys leaves out).
const std = @import("std");
const pe = @import("pardes-editor");
const Ed = pe.Editor(.{ .text = 128 * 1024, .undo = 512 * 1024 });
extern fn tree_sitter_c() *const pe.syntax.ts.Language;
fn now() u64 {
var ts: std.c.timespec = undefined;
_ = std.c.clock_gettime(.MONOTONIC, &ts);
return @as(u64, @intCast(ts.sec)) * std.time.ns_per_s + @as(u64, @intCast(ts.nsec));
}
pub fn main(init: std.process.Init) !void {
const gpa = std.heap.page_allocator;
const args = try init.minimal.args.toSlice(init.arena.allocator());
const kib = try std.fmt.parseInt(usize, args[1], 10);
const keys = try std.fmt.parseInt(usize, args[2], 10);
const count_pages = args.len > 3;
var text: std.ArrayList(u8) = .empty;
var i: usize = 0;
while (text.items.len < kib * 1024) : (i += 1) try text.print(gpa, "int f{d}(int x) {{ return x + {d}; }}\n", .{ i, i });
text.items.len = kib * 1024;
const ed = try gpa.create(Ed);
ed.* = .{};
try ed.load(text.items);
var arena = std.heap.ArenaAllocator.init(gpa);
defer arena.deinit();
// to the middle, into insert mode
for ([_]pe.Key{ .{ .cp = '%', .text = "%" }, .{ .cp = ';', .text = ";" } }) |k| _ = ed.key(arena.allocator(), k);
var to_middle: [8]u8 = undefined;
for (std.fmt.bufPrint(&to_middle, "{d}G", .{text.items.len / 2 / 32}) catch unreachable) |c| _ = ed.key(arena.allocator(), .{ .cp = c, .text = &.{c} });
_ = ed.key(arena.allocator(), .{ .cp = 'i', .text = "i" });
_ = arena.reset(.free_all);
if (keys == 0) return;
const before = try gpa.create(Ed);
var pages_max: usize = 0;
var pages_sum: usize = 0;
var key_ns: u64 = 0;
for (0..keys) |n| {
if (count_pages) before.* = ed.*;
const t0 = now();
const out = ed.key(arena.allocator(), .{ .cp = 'a' + @as(u21, @intCast(n % 26)), .text = &.{'a' + @as(u8, @intCast(n % 26))} });
key_ns += now() - t0;
if (out != .done) return error.NotTyped;
_ = arena.reset(.retain_capacity);
if (!count_pages) continue;
const a = std.mem.asBytes(before);
const b = std.mem.asBytes(ed);
var pages: usize = 0;
var at: usize = 0;
while (at < a.len) : (at += 4096) {
const end = @min(at + 4096, a.len);
if (!std.mem.eql(u8, a[at..end], b[at..end])) pages += 1;
}
pages_max = @max(pages_max, pages);
pages_sum += pages;
}
const per_key = key_ns / keys;
pe.syntax.start(std.heap.smp_allocator); // tree-sitter mallocs: not a page each
const lang: pe.Language = .{ .name = "c-as-dsl", .ext = ".cdsl", .ts = tree_sitter_c() };
var syn: pe.Syntax = .{};
// the parser and its queries made once, then the parse alone timed
_ = syn.parse(arena.allocator(), ed, lang) orelse return error.NoTree;
syn.tree.?.destroy();
syn.tree = null;
const p0 = now();
_ = syn.parse(arena.allocator(), ed, lang) orelse return error.NoTree;
const parse = now() - p0;
std.debug.print("{d} KiB: {d} keys, {d} ns a key, pages changed a key {d} max {d:.2} mean, value {d} bytes, full parse {d} ns\n", .{ kib, keys, per_key, pages_max, @as(f64, @floatFromInt(pages_sum)) / @as(f64, @floatFromInt(keys)), @sizeOf(Ed), parse });
}
|