HAXY

▄ ▄▀▀▀▀ ▀ ▄▀▀▀▀▀ ▄▀▀▀ ▄▀▀▀▄▀▀ ▄▄▀▀▀▀▄▀ ▄▀▀▄▀▀▀▀ ▀▀▀▀▀▀▀▀▄ ▀▀▀▀▀▀▀▀▀ ▄ ▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀ ▀▄▄▀▄▀▀▀▀ ▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀ ▄ ▀▀▀▄▀▀▀▀▀▀▀ ▀▀▀▀▀ ▄▀▀▀▀▀▀▀▀▀▄▀▀▄ ▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▄ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▄ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀▄ ▀▀▄ ▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄ ▀▀▀▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▄▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▄▄▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▄▀▀▀▀▀▀▀▀▀▀▀▄▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀▄▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀▀ ▀▀▀▀▀▄▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▄▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▄▀▀▄▀▄ ▀▀ ▀▀▀▀▀▀▄▀▀▀▀▀▄▄▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▄▀▄▄▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀▀▀▀ ▀▀ ▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀▀▀ ▀ ▀▀▀▀▀▀▀▄▄▀▀▀▀▀▀▀▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▄▄▀▀▀▄▄▀▄▀▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▄▄▀▀▀ ▀▀ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄▀▀▄▀▀▄ ▀▀▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄ ▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀ ▀▀▀▀

╭ Repo.zig ─────────────────────────────────────────────────────╮ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ╰───────────────────────────────────────────────────────────────╯

╭────╮ ╭ clone ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╮ │http│ ssh │ │ ╰────╯ ╰ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╯

.. Attachment.zig Comment.zig Discussion.zig Fork.zig Issue.zig Patch.zig PatchRev.zig ╭─────────────────────────────────╮ │Repo.zig │ ╰─────────────────────────────────╯ User.zig

1 const std = @import("std"); 2 const evt = @import("../event.zig"); 3 const xit = @import("xit"); 4 const hash = xit.hash; 5 6 user_id: []const u8, 7 name: []const u8, 8 description: []const u8, 9 read_access: Access = .private, 10 write_access: Access = .private, 11 read_user_ids: []const u8 = "", 12 write_user_ids: []const u8 = "", 13 14 // what the db stores: the event's data plus the commit-derived fields 15 pub const Record = struct { 16 event: Self, 17 removed: bool = false, 18 created_order: u64 = 0, 19 updated_order: u64 = 0, 20 21 // a repo's key in the name index. it's unique per owner, so the read side 22 // resolves the url's username to its user id first. 23 pub fn indexKey(self: Record, allocator: std.mem.Allocator) ![]const u8 { 24 return std.fmt.allocPrint(allocator, "{s}/{s}", .{ self.event.user_id, self.event.name }); 25 } 26 }; 27 28 const Self = @This(); 29 30 pub const Access = enum { 31 private, 32 public, 33 }; 34 35 // what a user may do in a repo, ordered so a higher role includes the lower ones 36 pub const Role = enum { 37 none, 38 read, 39 write, 40 owner, 41 42 pub fn atLeast(self: Role, min: Role) bool { 43 return @intFromEnum(self) >= @intFromEnum(min); 44 } 45 }; 46 47 pub const name_max_len = 32; 48 49 // the role `user_id_maybe` holds in the repo. null is a logged-out user, who 50 // gets the base role the access fields give everyone. 51 pub fn roleOf(record: Record, user_id_maybe: ?[evt.event_id_size]u8) Role { 52 const event = record.event; 53 const base: Role = if (event.write_access == .public) .write else if (event.read_access == .public) .read else .none; 54 const user_id = user_id_maybe orelse return base; 55 if (std.mem.eql(u8, event.user_id, &user_id)) return .owner; 56 57 const user_id_hex = std.fmt.bytesToHex(user_id, .lower); 58 if (base == .write or containsUserId(event.write_user_ids, &user_id_hex)) return .write; 59 if (base == .read or containsUserId(event.read_user_ids, &user_id_hex)) return .read; 60 return .none; 61 } 62 63 fn containsUserId(user_ids: []const u8, user_id_hex: []const u8) bool { 64 var lines = std.mem.tokenizeScalar(u8, user_ids, '\n'); 65 while (lines.next()) |id| { 66 if (std.mem.eql(u8, id, user_id_hex)) return true; 67 } 68 return false; 69 } 70 71 // the moment keys `evt.merge` reads and writes for this kind 72 pub const merge_policy: evt.MergePolicy = .target_wins; 73 pub const record_map_key = "event-id->repo"; 74 pub const all_id_set_key = "repo-id-set"; 75 pub const active_id_set_key = "active-repo-id-set"; 76 pub const name_index_key = "name->repo-id"; 77 78 pub fn validateName(name: []const u8) !void { 79 if (name.len == 0) return error.NameEmpty; 80 if (name.len > name_max_len) return error.NameTooLong; 81 if (std.mem.eql(u8, name, ".") or std.mem.eql(u8, name, "..")) return error.InvalidName; 82 83 for (name) |c| { 84 if (!std.ascii.isAlphanumeric(c) and c != '-' and c != '_' and c != '.') 85 return error.InvalidName; 86 } 87 } 88 89 fn validateUserIds(user_ids: []const u8) !void { 90 var lines = std.mem.tokenizeScalar(u8, user_ids, '\n'); 91 while (lines.next()) |id| _ = try evt.parseEventId(id); 92 } 93 94 pub fn consume( 95 comptime DB: type, 96 comptime hash_kind: hash.HashKind, 97 haxy_moment: DB.HashMap(.read_write), 98 event_id: *const [evt.event_id_size]u8, 99 record_maybe: ?Record, 100 arena: *std.heap.ArenaAllocator, 101 _: ?[]const u8, 102 ) !void { 103 const repo_key = hash.hashInt(hash_kind, event_id); 104 105 const event_id_to_repo_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, "event-id->repo")); 106 const event_id_to_repo = try DB.HashMap(.read_write).init(event_id_to_repo_cursor); 107 108 const name_to_repo_id_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, "name->repo-id")); 109 const name_to_repo_id = try DB.HashMap(.read_write).init(name_to_repo_id_cursor); 110 111 var existing_record_maybe: ?Record = null; 112 const existing_cursor_maybe = try event_id_to_repo.getCursor(repo_key); 113 if (existing_cursor_maybe) |existing_cursor| { 114 const existing_repo = try DB.HashMap(.read_only).init(existing_cursor); 115 existing_record_maybe = try evt.read(Record, DB, hash_kind, arena, existing_repo); 116 } 117 118 var record_to_write = record_maybe orelse try evt.removedRecord(Record, DB, hash_kind, haxy_moment.readOnly(), existing_record_maybe); 119 120 if (!record_to_write.removed) { 121 try validateName(record_to_write.event.name); 122 try validateUserIds(record_to_write.event.read_user_ids); 123 try validateUserIds(record_to_write.event.write_user_ids); 124 } 125 126 const user_id_to_repo_id_set_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, "user-id->repo-id-set")); 127 const user_id_to_repo_id_set = try DB.HashMap(.read_write).init(user_id_to_repo_id_set_cursor); 128 129 if (existing_record_maybe) |existing_record| { 130 // updates preserve the original creation metadata 131 record_to_write.created_order = existing_record.created_order; 132 const order_key = evt.orderKeyDesc(existing_record.created_order, event_id); 133 134 // drop the old active indexes; active values are re-added below 135 if (!existing_record.removed) { 136 const existing_path = try existing_record.indexKey(arena.allocator()); 137 _ = try name_to_repo_id.remove(hash.hashInt(hash_kind, existing_path)); 138 139 const old_user_repos_cursor = try user_id_to_repo_id_set.putCursor(hash.hashInt(hash_kind, existing_record.event.user_id)); 140 const old_user_repos = try DB.SortedSet(.read_write).init(old_user_repos_cursor); 141 _ = try old_user_repos.remove(&order_key); 142 } 143 } 144 145 const repo_cursor = try event_id_to_repo.putCursor(repo_key); 146 const repo = try DB.HashMap(.read_write).init(repo_cursor); 147 try evt.upsert(Record, DB, hash_kind, repo, record_to_write); 148 try evt.indexEvent(DB, hash_kind, haxy_moment, event_id, .repo, existing_record_maybe, record_to_write); 149 150 const order_key = evt.orderKeyDesc(record_to_write.created_order, event_id); 151 152 // the id set retains removed records so merges can carry removals 153 if (existing_cursor_maybe == null) { 154 const repo_id_set_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, all_id_set_key)); 155 const repo_id_set = try DB.SortedSet(.read_write).init(repo_id_set_cursor); 156 try repo_id_set.put(&order_key); 157 } 158 159 const active = try DB.SortedSet(.read_write).init(try haxy_moment.putCursor(hash.hashInt(hash_kind, active_id_set_key))); 160 if (record_to_write.removed) { 161 _ = try active.remove(&order_key); 162 } else { 163 try active.put(&order_key); 164 const repo_path = try record_to_write.indexKey(arena.allocator()); 165 try name_to_repo_id.put(hash.hashInt(hash_kind, repo_path), .{ .bytes = event_id }); 166 167 // each user's repos are ordered by creation time, newest first 168 const user_repos_cursor = try user_id_to_repo_id_set.putCursor(hash.hashInt(hash_kind, record_to_write.event.user_id)); 169 const user_repos = try DB.SortedSet(.read_write).init(user_repos_cursor); 170 try user_repos.put(&order_key); 171 } 172 } 173 174 // a repo plus its event id (the id is the on-disk repo directory name, so the 175 // caller can locate the working repo under <server>/repos/<hex event id>). 176 pub const RepoWithId = struct { 177 repo: Record, 178 event_id: [evt.event_id_size]u8, 179 }; 180 181 // read a repo by its owner's name and repo name. the owner name is resolved to 182 // a user id via name->user-id (the repo index is keyed by "user-id/repo-name"), 183 // matching the /repo/username/reponame url. 184 pub fn readByOwnerAndName( 185 comptime DB: type, 186 comptime hash_kind: hash.HashKind, 187 haxy_moment: DB.HashMap(.read_only), 188 arena: *std.heap.ArenaAllocator, 189 owner_name: []const u8, 190 repo_name: []const u8, 191 ) !?RepoWithId { 192 // owner name -> user id 193 const name_to_user_id_cursor = try haxy_moment.getCursor(hash.hashInt(hash_kind, "name->user-id")) orelse return null; 194 const name_to_user_id = try DB.HashMap(.read_only).init(name_to_user_id_cursor); 195 const user_id_cursor = try name_to_user_id.getCursor(hash.hashInt(hash_kind, owner_name)) orelse return null; 196 var user_id: [evt.event_id_size]u8 = undefined; 197 _ = try user_id_cursor.readBytes(&user_id); 198 199 // "user-id/repo-name" -> repo event id 200 const repo_path = try (Record{ .event = .{ .user_id = user_id[0..], .name = repo_name, .description = "" } }).indexKey(arena.allocator()); 201 const name_to_repo_id_cursor = try haxy_moment.getCursor(hash.hashInt(hash_kind, "name->repo-id")) orelse return null; 202 const name_to_repo_id = try DB.HashMap(.read_only).init(name_to_repo_id_cursor); 203 const repo_id_cursor = try name_to_repo_id.getCursor(hash.hashInt(hash_kind, repo_path)) orelse return null; 204 var repo_id: [evt.event_id_size]u8 = undefined; 205 _ = try repo_id_cursor.readBytes(&repo_id); 206 207 const event_id_to_repo_cursor = try haxy_moment.getCursor(hash.hashInt(hash_kind, "event-id->repo")) orelse return null; 208 const event_id_to_repo = try DB.HashMap(.read_only).init(event_id_to_repo_cursor); 209 const repo_cursor = try event_id_to_repo.getCursor(hash.hashInt(hash_kind, &repo_id)) orelse return null; 210 const repo_map = try DB.HashMap(.read_only).init(repo_cursor); 211 return .{ .repo = try evt.read(Record, DB, hash_kind, arena, repo_map), .event_id = repo_id }; 212 } 213 214 pub fn readById( 215 comptime DB: type, 216 comptime hash_kind: hash.HashKind, 217 haxy_moment: DB.HashMap(.read_only), 218 arena: *std.heap.ArenaAllocator, 219 id: []const u8, 220 ) !?Record { 221 const records_cursor = try haxy_moment.getCursor(hash.hashInt(hash_kind, record_map_key)) orelse return null; 222 const records = try DB.HashMap(.read_only).init(records_cursor); 223 const record_cursor = try records.getCursor(hash.hashInt(hash_kind, id)) orelse return null; 224 return try evt.read(Record, DB, hash_kind, arena, try DB.HashMap(.read_only).init(record_cursor)); 225 } 226