diff options
| author | 2024-02-20 09:13:36 -0400 | |
|---|---|---|
| committer | 2024-02-20 09:13:36 -0400 | |
| commit | 134a7df8206aa66ca7b0abbc7f31f08410b502d2 (patch) | |
| tree | e3c520dce4f529de5290bc145847e78fb5583bee /codegen | |
| parent | Cleaned up directory structure (diff) | |
| download | zg-134a7df8206aa66ca7b0abbc7f31f08410b502d2.tar.gz zg-134a7df8206aa66ca7b0abbc7f31f08410b502d2.tar.xz zg-134a7df8206aa66ca7b0abbc7f31f08410b502d2.zip | |
Replaced ccc_map with table. 20ms faster
Diffstat (limited to 'codegen')
| -rw-r--r-- | codegen/normp.zig | 128 |
1 files changed, 128 insertions, 0 deletions
diff --git a/codegen/normp.zig b/codegen/normp.zig new file mode 100644 index 0000000..25af65c --- /dev/null +++ b/codegen/normp.zig | |||
| @@ -0,0 +1,128 @@ | |||
| 1 | const std = @import("std"); | ||
| 2 | |||
| 3 | const options = @import("options"); | ||
| 4 | |||
| 5 | const block_size = 256; | ||
| 6 | const Block = [block_size]u8; | ||
| 7 | |||
| 8 | const BlockMap = std.HashMap( | ||
| 9 | Block, | ||
| 10 | u16, | ||
| 11 | struct { | ||
| 12 | pub fn hash(_: @This(), k: Block) u64 { | ||
| 13 | var hasher = std.hash.Wyhash.init(0); | ||
| 14 | std.hash.autoHashStrat(&hasher, k, .DeepRecursive); | ||
| 15 | return hasher.final(); | ||
| 16 | } | ||
| 17 | |||
| 18 | pub fn eql(_: @This(), a: Block, b: Block) bool { | ||
| 19 | return std.mem.eql(u8, &a, &b); | ||
| 20 | } | ||
| 21 | }, | ||
| 22 | std.hash_map.default_max_load_percentage, | ||
| 23 | ); | ||
| 24 | |||
| 25 | pub fn main() !void { | ||
| 26 | var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator); | ||
| 27 | defer arena.deinit(); | ||
| 28 | const allocator = arena.allocator(); | ||
| 29 | |||
| 30 | var flat_map = std.AutoHashMap(u21, u8).init(allocator); | ||
| 31 | defer flat_map.deinit(); | ||
| 32 | |||
| 33 | var line_buf: [4096]u8 = undefined; | ||
| 34 | |||
| 35 | // Process DerivedEastAsianWidth.txt | ||
| 36 | var cc_file = try std.fs.cwd().openFile("data/unicode/extracted/DerivedCombiningClass.txt", .{}); | ||
| 37 | defer cc_file.close(); | ||
| 38 | var cc_buf = std.io.bufferedReader(cc_file.reader()); | ||
| 39 | const cc_reader = cc_buf.reader(); | ||
| 40 | |||
| 41 | while (try cc_reader.readUntilDelimiterOrEof(&line_buf, '\n')) |line| { | ||
| 42 | if (line.len == 0 or line[0] == '#') continue; | ||
| 43 | const no_comment = if (std.mem.indexOfScalar(u8, line, '#')) |octo| line[0..octo] else line; | ||
| 44 | |||
| 45 | var field_iter = std.mem.tokenizeAny(u8, no_comment, "; "); | ||
| 46 | var current_code: [2]u21 = undefined; | ||
| 47 | |||
| 48 | var i: usize = 0; | ||
| 49 | while (field_iter.next()) |field| : (i += 1) { | ||
| 50 | switch (i) { | ||
| 51 | 0 => { | ||
| 52 | // Code point(s) | ||
| 53 | if (std.mem.indexOf(u8, field, "..")) |dots| { | ||
| 54 | current_code = .{ | ||
| 55 | try std.fmt.parseInt(u21, field[0..dots], 16), | ||
| 56 | try std.fmt.parseInt(u21, field[dots + 2 ..], 16), | ||
| 57 | }; | ||
| 58 | } else { | ||
| 59 | const code = try std.fmt.parseInt(u21, field, 16); | ||
| 60 | current_code = .{ code, code }; | ||
| 61 | } | ||
| 62 | }, | ||
| 63 | 1 => { | ||
| 64 | // Combining Class | ||
| 65 | if (std.mem.eql(u8, field, "0")) continue; | ||
| 66 | const cc = try std.fmt.parseInt(u8, field, 10); | ||
| 67 | for (current_code[0]..current_code[1] + 1) |cp| try flat_map.put(@intCast(cp), cc); | ||
| 68 | }, | ||
| 69 | else => {}, | ||
| 70 | } | ||
| 71 | } | ||
| 72 | } | ||
| 73 | |||
| 74 | var blocks_map = BlockMap.init(allocator); | ||
| 75 | defer blocks_map.deinit(); | ||
| 76 | |||
| 77 | var stage1 = std.ArrayList(u16).init(allocator); | ||
| 78 | defer stage1.deinit(); | ||
| 79 | |||
| 80 | var stage2 = std.ArrayList(u8).init(allocator); | ||
| 81 | defer stage2.deinit(); | ||
| 82 | |||
| 83 | var block: Block = [_]u8{0} ** block_size; | ||
| 84 | var block_len: u16 = 0; | ||
| 85 | |||
| 86 | for (0..0x110000) |i| { | ||
| 87 | const cp: u21 = @intCast(i); | ||
| 88 | const cc = flat_map.get(cp) orelse 0; | ||
| 89 | |||
| 90 | // Process block | ||
| 91 | block[block_len] = cc; | ||
| 92 | block_len += 1; | ||
| 93 | |||
| 94 | if (block_len < block_size and cp != 0x10ffff) continue; | ||
| 95 | |||
| 96 | const gop = try blocks_map.getOrPut(block); | ||
| 97 | if (!gop.found_existing) { | ||
| 98 | gop.value_ptr.* = @intCast(stage2.items.len); | ||
| 99 | try stage2.appendSlice(&block); | ||
| 100 | } | ||
| 101 | |||
| 102 | try stage1.append(gop.value_ptr.*); | ||
| 103 | block_len = 0; | ||
| 104 | } | ||
| 105 | |||
| 106 | var args_iter = try std.process.argsWithAllocator(allocator); | ||
| 107 | defer args_iter.deinit(); | ||
| 108 | _ = args_iter.skip(); | ||
| 109 | const output_path = args_iter.next() orelse @panic("No output file arg!"); | ||
| 110 | |||
| 111 | var out_file = try std.fs.cwd().createFile(output_path, .{}); | ||
| 112 | defer out_file.close(); | ||
| 113 | var out_buf = std.io.bufferedWriter(out_file.writer()); | ||
| 114 | const writer = out_buf.writer(); | ||
| 115 | |||
| 116 | try writer.writeAll("const std = @import(\"std\");\n"); | ||
| 117 | |||
| 118 | try writer.print("const Stage2Int = std.math.IntFittingRange(0, {});\n", .{stage2.items.len}); | ||
| 119 | try writer.print("pub const stage_1 = [{}]Stage2Int{{", .{stage1.items.len}); | ||
| 120 | for (stage1.items) |v| try writer.print("{},", .{v}); | ||
| 121 | try writer.writeAll("};\n"); | ||
| 122 | |||
| 123 | try writer.print("pub const stage_2 = [{}]u8{{", .{stage2.items.len}); | ||
| 124 | for (stage2.items) |v| try writer.print("{},", .{v}); | ||
| 125 | try writer.writeAll("};\n"); | ||
| 126 | |||
| 127 | try out_buf.flush(); | ||
| 128 | } | ||