╭─────────────╮ │scroll to top│ ╰─────────────╯ ╭ event.zig ────────────────────────────────────────────────────╮ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ╰───────────────────────────────────────────────────────────────╯
🬐 🬠 🬞🬂🬏 🬟 🬑 🬟 🬑 ╭5e04abec..╮ 5e04abec.. see-em: 🬋🬋🬋 🬋🬋🬋 🬋 🬋 │files │ commits refs discuss issues new login 🬐 🬠 🬐 🬠 🬑 🬟 🬰 ╰──────────╯ (315) user
╭────╮ ╭ clone ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╮ │http│ ssh │ │ ╰────╯ ╰ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╯
.. embed/ event/ test/ ui/ command.zig ╭─────────────────────────────────╮ │event.zig │ ╰─────────────────────────────────╯ lib.zig main.zig main_wasm.zig serve.zig serve_common.zig serve_http.zig serve_ssh.zig serve_ssh_protocol.zig test.zig testnet.zig try.zig ui.zig web.zig
699 700 return merged; 701 } 702 703 // three-way merge of one kind's records from a merge parent, field by field, so 704 // sides editing different fields combine cleanly. the result goes through the 705 // kind's `consume`, which re-derives the indexes from it. a field both sides 706 // changed differently keeps the target's value and records a conflict entry. a 707 // deletion carries over unless the other side changed the record, so a merge 708 // never fails. 709 pub fn merge( 710 comptime T: type, 711 comptime DB: type, 712 comptime hash_kind: hash.HashKind, 713 allocator: std.mem.Allocator, 714 haxy_moment: DB.HashMap(.read_write), 715 parent_moment: DB.HashMap(.read_only), 716 baseline_moment: DB.HashMap(.read_only), 717 ) !void { 718 const parent_set_cursor = try parent_moment.getCursor(hash.hashInt(hash_kind, T.id_set_key)) orelse return; 719 const parent_set = try DB.SortedSet(.read_only).init(parent_set_cursor); 720 721 const parent_records_cursor = try parent_moment.getCursor(hash.hashInt(hash_kind, T.record_map_key)) orelse return; 722 const parent_records = try DB.HashMap(.read_only).init(parent_records_cursor); 723 724 var baseline_records: ?DB.HashMap(.read_only) = null; 725 if (try baseline_moment.getCursor(hash.hashInt(hash_kind, T.record_map_key))) |cursor| { 726 baseline_records = try DB.HashMap(.read_only).init(cursor); 727 } 728 729 var parent_conflicts: ?DB.SortedMap(.read_only) = null; 730 if (try parent_moment.getCursor(hash.hashInt(hash_kind, T.conflicts_key))) |cursor| { 731 parent_conflicts = try DB.SortedMap(.read_only).init(cursor); 732 } 733 734 var baseline_conflicts: ?DB.SortedMap(.read_only) = null; 735 if (try baseline_moment.getCursor(hash.hashInt(hash_kind, T.conflicts_key))) |cursor| { 736 baseline_conflicts = try DB.SortedMap(.read_only).init(cursor); 737 } 738 739 var parent_id_to_field_to_oid: ?DB.HashMap(.read_only) = null; 740 if (try parent_moment.getCursor(hash.hashInt(hash_kind, T.id_to_field_to_oid_key))) |cursor| { 741 parent_id_to_field_to_oid = try DB.HashMap(.read_only).init(cursor); 742 } 743 744 var arena = std.heap.ArenaAllocator.init(allocator); 745 defer arena.deinit(); 746 747 // a record the parent deleted is deleted here too, unless the target 748 // changed it. runs first so a delete and recreate is applied in that order. 749 deletions: { 750 const baseline_map = baseline_records orelse break :deletions; 751 const baseline_set_cursor = try baseline_moment.getCursor(hash.hashInt(hash_kind, T.id_set_key)) orelse break :deletions; 752 const baseline_set = try DB.SortedSet(.read_only).init(baseline_set_cursor); 753 754 var baseline_iter = try baseline_set.iteratorFromIndex(0); 755 while (try baseline_iter.next()) |kv_pair_cursor| { 756 const event_id = try readOrderKeyId(DB, kv_pair_cursor); 757 const record_key = hash.hashInt(hash_kind, &event_id); 758 759 if (null != try parent_records.getSlot(record_key)) continue; 760 const baseline_record_cursor = try baseline_map.getCursor(record_key) orelse continue; 761 762 _ = arena.reset(.retain_capacity); 763 764 // re-derived every iteration, since `consume` writes through its 765 // own handles 766 const target_records_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, T.record_map_key)); 767 const target_records = try DB.HashMap(.read_write).init(target_records_cursor); 768 const target_record_cursor = try target_records.getCursor(record_key) orelse continue; 769 770 if (!target_record_cursor.slot().eql(baseline_record_cursor.slot())) { 771 // every write copies the record's block, so only a content 772 // change means the target kept it 773 const target_record = try read(T, DB, hash_kind, &arena, try DB.HashMap(.read_only).init(target_record_cursor)); 774 const baseline_record = try read(T, DB, hash_kind, &arena, try DB.HashMap(.read_only).init(baseline_record_cursor)); 775 if (!fieldsEqual(T, target_record, baseline_record)) continue; 776 } 777 778 try T.consume(DB, hash_kind, haxy_moment, &event_id, null, &arena, 0, null); 779 } 780 } 781 782 var iter = try parent_set.iteratorFromIndex(0); 783 while (try iter.next()) |kv_pair_cursor| { 784 const event_id = try readOrderKeyId(DB, kv_pair_cursor); 785 const record_key = hash.hashInt(hash_kind, &event_id); 786 787 _ = arena.reset(.retain_capacity); 788 789 const parent_record_cursor = try parent_records.getCursor(record_key) orelse continue; 790 const parent_slot = parent_record_cursor.slot(); 791 const baseline_slot = if (baseline_records) |map| try map.getSlot(record_key) else null; 792 793 // the parent left this record alone 794 if (baseline_slot) |slot| { 795 if (slot.eql(parent_slot)) continue; 796 } 797 798 const parent_record = try read(T, DB, hash_kind, &arena, try DB.HashMap(.read_only).init(parent_record_cursor)); 799 800 // re-derived every iteration, since `consume` writes through its own 801 // handles 802 const target_records_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, T.record_map_key)); 803 const target_records = try DB.HashMap(.read_write).init(target_records_cursor); 804 805 // a record the target doesn't have, or deleted, arrives wholesale from 806 // the parent 807 var outcome: [std.meta.fields(T).len]FieldMerge = @splat(.parent); 808 var merged = parent_record; 809 810 if (try target_records.getCursor(record_key)) |target_record_cursor| { 811 // both sides share the change 812 if (target_record_cursor.slot().eql(parent_slot)) continue; 813 814 const target_record = try read(T, DB, hash_kind, &arena, try DB.HashMap(.read_only).init(target_record_cursor)); 815 816 var baseline_record: ?T = null; 817 if (baseline_records) |map| { 818 if (try map.getCursor(record_key)) |baseline_record_cursor| { 819 baseline_record = try read(T, DB, hash_kind, &arena, try DB.HashMap(.read_only).init(baseline_record_cursor)); 820 } 821 } 822 823 outcome = @splat(.kept); 824 merged = mergeFields(T, baseline_record, target_record, parent_record, &outcome); 825 } 826 827 // the index is unique, so a key the target gave to a different record 828 // leaves this one out rather than stranding that one behind a name it 829 // no longer owns 830 if (@hasDecl(T, "name_index_key")) { 831 const index_key = try merged.indexKey(arena.allocator()); 832 const name_index_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, T.name_index_key)); 833 const name_index = try DB.HashMap(.read_write).init(name_index_cursor); 834 if (try name_index.getCursor(hash.hashInt(hash_kind, index_key))) |owner_cursor| { 835 var owner_id: [event_id_size]u8 = undefined; 836 _ = try owner_cursor.readBytes(&owner_id); 837 if (!std.mem.eql(u8, &owner_id, &event_id)) continue; 838 } 839 } 840 841 // `consume` sets no oids, since each field's winner may come from 842 // a different side 843 try T.consume(DB, hash_kind, haxy_moment, &event_id, merged, &arena, merged.created_ts, null); 844 845 const conflicts_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, T.conflicts_key)); 846 const conflicts = try DB.SortedMap(.read_write).init(conflicts_cursor); 847 const id_to_field_to_oid_cursor = try haxy_moment.putCursor(hash.hashInt(hash_kind, T.id_to_field_to_oid_key)); 848 const id_to_field_to_oid = try DB.HashMap(.read_write).init(id_to_field_to_oid_cursor); 849 const merged_key = orderKeyDesc(merged.created_ts, &event_id); 850 851 // both created only once a field actually comes from the parent 852 var parent_field_oids: ?DB.SortedMap(.read_only) = null; 853 if (parent_id_to_field_to_oid) |map| { 854 if (try map.getCursor(record_key)) |field_oids_cursor| { 855 parent_field_oids = try DB.SortedMap(.read_only).init(field_oids_cursor); 856 } 857 } 858 var field_oids: ?DB.SortedMap(.read_write) = null; 859 860 // the fields both sides changed differently, space separated 861 var conflicted_fields: [conflictedFieldsMaxLen(T)]u8 = undefined; 862 var conflicted_len: usize = 0; 863 864 inline for (std.meta.fields(T), 0..) |field, i| { 865 if (comptime !std.mem.eql(u8, field.name, "created_ts")) { 866 switch (outcome[i]) { 867 // the target's value stands, so its oid does too 868 .kept => {}, 869 .parent => if (parent_field_oids) |parent_map| { 870 if (try parent_map.getCursor(field.name)) |oid_cursor| { 871 if (field_oids == null) { 872 field_oids = try DB.SortedMap(.read_write).init(try id_to_field_to_oid.putCursor(record_key)); 873 } 874 if (field_oids) |map| try map.put(field.name, .{ .slot = oid_cursor.slot() }); 875 } 876 }, 877 .conflicted => { 878 if (conflicted_len > 0) { 879 conflicted_fields[conflicted_len] = ' '; 880 conflicted_len += 1; 881 } 882 @memcpy(conflicted_fields[conflicted_len..][0..field.name.len], field.name); 883 conflicted_len += field.name.len; 884 }, 885 } 886 } 887 } 888 889 if (conflicted_len > 0) { 890 // each side's whole record is stored by reference, so the view can 891 // show any of them or take theirs wholesale 892 _ = try conflicts.remove(&merged_key); 893 const conflict = try DB.HashMap(.read_write).init(try conflicts.putCursor(&merged_key)); 894 try conflict.put(hash.hashInt(hash_kind, conflicted_fields_key), .{ .bytes = conflicted_fields[0..conflicted_len] }); 895 try conflict.put(hash.hashInt(hash_kind, base_record_key), .{ .slot = baseline_slot }); 896 try conflict.put(hash.hashInt(hash_kind, their_record_key), .{ .slot = parent_slot }); 897 if (parent_field_oids) |map| { 898 try conflict.put(hash.hashInt(hash_kind, their_field_to_oid_key), .{ .slot = map.slot() }); 899 } 900 continue; 901 } 902 903 // created_ts never changes, so the parent keys this record's conflict 904 // identically, and it carries over when the target has none, unless the 905 // parent's entry is unchanged from the baseline, meaning the target 906 // inherited it too and resolving it removed it here. 907 if (parent_conflicts) |map| { 908 if (null == try conflicts.getCursor(&merged_key)) { 909 if (try map.getSlot(&merged_key)) |conflict_slot| { 910 const baseline_conflict_slot = if (baseline_conflicts) |baseline_map| try baseline_map.getSlot(&merged_key) else null; 911 const resolved = if (baseline_conflict_slot) |slot| slot.eql(conflict_slot) else false; 912 if (!resolved) try conflicts.put(&merged_key, .{ .slot = conflict_slot }); 913 } 914 } 915 } 916 } 917 } 918 919 pub fn currentMoment( 920 comptime repo_opts: rp.RepoOpts(.xit), 921 repo: *rp.Repo(.xit, repo_opts), 922 ) !rp.Repo(.xit, repo_opts).DB.HashMap(.read_only) { 923 return currentMomentFromDb(repo_opts.hash, &repo.core.db); 924 } 925 926 // the oid of the last event commit consumed into `db`, or null before any 927 // consume completed 928 fn lastConsumedOid( 929 comptime hash_kind: hash.HashKind, 930 db: *EventDB(hash_kind), 931 ) !?[hash.byteLen(hash_kind)]u8 { 932 const DB = EventDB(hash_kind); 933 const history = try DB.ArrayList(.read_only).init(db.rootCursor().readOnly()); 934 const moment_cursor = try history.getCursor(-1) orelse return null; 935 const moment = try DB.HashMap(.read_only).init(moment_cursor); 936 const last_object_id_cursor = try moment.getCursor(hash.hashInt(hash_kind, "haxy-last-object-id")) orelse return null; 937 var last_object_id: [hash.byteLen(hash_kind)]u8 = undefined; 938 _ = try last_object_id_cursor.readBytes(&last_object_id); 939 return last_object_id; 940 } 941 942 pub fn currentMomentFromDb( 943 comptime hash_kind: hash.HashKind, 944 db: *EventDB(hash_kind), 945 ) !EventDB(hash_kind).HashMap(.read_only) { 946 const DB = EventDB(hash_kind); 947 const last_object_id = (try lastConsumedOid(hash_kind, db)) orelse return error.NotFound; 948 const history = try DB.ArrayList(.read_only).init(db.rootCursor().readOnly()); 949 const moment_cursor = try history.getCursor(-1) orelse return error.NotFound; 950 const moment = try DB.HashMap(.read_only).init(moment_cursor); 951 const haxy_cursor = try moment.getCursor(hash.hashInt(hash_kind, "haxy")) orelse return error.NotFound; 952 const haxy = try DB.ArrayList(.read_only).init(haxy_cursor); 953 const haxy_moments_cursor = try haxy.getCursor(-1) orelse return error.NotFound; 954 const haxy_moments = try DB.HashMap(.read_only).init(haxy_moments_cursor); 955 const haxy_moment_cursor = try haxy_moments.getCursor(hash.bytesToInt(hash_kind, &last_object_id)) orelse return error.NotFound; 956 return try DB.HashMap(.read_only).init(haxy_moment_cursor); 957 } 958 959 // build the key for SortedSets sorted by timestamp. the big-endian timestamp 960 // makes byte order match creation order; the event id breaks ties and keeps 961 // keys unique within the same timestamp. 962 pub fn orderKey(timestamp: u64, event_id: *const [event_id_size]u8) [@sizeOf(u64) + event_id_size]u8 { 963 var key: [@sizeOf(u64) + event_id_size]u8 = undefined; 964 std.mem.writeInt(u64, key[0..@sizeOf(u64)], timestamp, .big); 965 @memcpy(key[@sizeOf(u64)..], event_id); 966 return key; 967 } 968 969 pub fn orderKeyDesc(timestamp: u64, event_id: *const [event_id_size]u8) [@sizeOf(u64) + event_id_size]u8 { 970 return orderKey(std.math.maxInt(u64) - timestamp, event_id); 971 } 972 973 // the event id embedded in a set entry's order key 974 fn readOrderKeyId(comptime DB: type, kv_pair_cursor: DB.Cursor(.read_only)) ![event_id_size]u8 { 975 var cursor = kv_pair_cursor; 976 const kv_pair = try cursor.readKeyValuePair(); 977 var order_key: [@sizeOf(u64) + event_id_size]u8 = undefined; 978 _ = try kv_pair.key_cursor.readBytes(&order_key); 979 return order_key[@sizeOf(u64)..][0..event_id_size].*; 980 } 981 982 // split a pushed "<owner>/<repo>" path into its two components, or null if it 983 // isn't exactly two non-empty segments. 984 pub fn parseOwnerRepoPath(path: []const u8) ?struct { owner: []const u8, name: []const u8 } { 985 var it = std.mem.splitScalar(u8, path, '/'); 986 const owner = it.next() orelse return null; 987 const name = it.next() orelse return null; 988 if (it.next() != null) return null; 989 if (owner.len == 0 or name.len == 0) return null; 990 991 return .{ .owner = owner, .name = name }; 992 } 993 994 // resolve a pushed `<owner>/<repo>` to the hex event id that names its on-disk 995 // directory under the repos dir 996 pub fn resolveOrCreateRepo( 997 io: std.Io, 998 allocator: std.mem.Allocator, 999 admin_repo_path: []const u8, 1000 owner_name: []const u8, 1001 repo_name: []const u8, 1002 create_if_missing: bool, 1003 ) !?[event_id_size * 2]u8 { 1004 var repo = rp.Repo(.xit, admin_repo_opts).open(io, allocator, .{ .path = admin_repo_path }) catch |err| switch (err) { 1005 error.RepoNotFound => return null, 1006 else => |e| return e, 1007 }; 1008 defer repo.deinit(io, allocator); 1009 1010 var arena = std.heap.ArenaAllocator.init(allocator); 1011 defer arena.deinit(); 1012 1013 const moment = try currentMoment(admin_repo_opts, &repo); 1014 1015 // an already-registered repo reuses its event id, so a re-push (or a clone) 1016 // lands in the same repo 1017 if (try Repo.readByOwnerAndName(AdminDB, admin_repo_opts.hash, moment, &arena, owner_name, repo_name)) |found| { 1018 return std.fmt.bytesToHex(found.event_id, .lower); 1019 } 1020 1021 if (!create_if_missing) return null; 1022 1023 // the new repo is owned by the named user, read from the name index; an 1024 // unknown owner can't own a repo, so the push is rejected 1025 const name_to_user_id_cursor = try moment.getCursor(hash.hashInt(admin_repo_opts.hash, "name->user-id")) orelse return null; 1026 const name_to_user_id = try AdminDB.HashMap(.read_only).init(name_to_user_id_cursor); 1027 const owner_id_cursor = try name_to_user_id.getCursor(hash.hashInt(admin_repo_opts.hash, owner_name)) orelse return null; 1028 var owner_user_id: [event_id_size]u8 = undefined; 1029 _ = try owner_id_cursor.readBytes(&owner_user_id); 1030 1031 var id_bytes: [event_id_size]u8 = undefined; 1032 io.random(&id_bytes); 1033 const event_id_hex = std.fmt.bytesToHex(id_bytes, .lower); 1034 1035 try consume(.xit, admin_repo_opts, io, allocator, &repo, events_ref, &[_]EventWithId{.{ 1036 .id = event_id_hex, 1037 .timestamp = @intCast(std.Io.Timestamp.now(io, .real).toSeconds()), 1038 .event = .{ .repo = .{ 1039 .user_id = &owner_user_id, 1040 .name = repo_name, 1041 .description = "", 1042 } }, 1043 }}); 1044 1045 return event_id_hex; 1046 } 1047 1048 // 1049 // reading from xitdb 1050 // 1051 1052 pub fn read( 1053 comptime T: type, 1054 comptime DB: type, 1055 comptime hash_kind: hash.HashKind, 1056 arena: *std.heap.ArenaAllocator, 1057 map: DB.HashMap(.read_only), 1058 ) !T { 1059 var event: T = undefined; 1060 1061 switch (@typeInfo(T)) { 1062 .@"struct" => |struct_info| { 1063 inline for (struct_info.fields) |field| { 1064 switch (@typeInfo(field.type)) { 1065 .pointer => |pointer_info| { 1066 if (pointer_info.size == .slice and pointer_info.child == u8 and pointer_info.is_const) { 1067 @field(event, field.name) = try readBytes(DB, hash_kind, arena.allocator(), map, field.name); 1068 } else { 1069 @compileError("unsupported read field type: " ++ @typeName(field.type)); 1070 } 1071 }, 1072 .array => |array_info| { 1073 if (array_info.child == u8) { 1074 const bytes = try readBytes(DB, hash_kind, arena.allocator(), map, field.name); 1075 if (bytes.len != array_info.len) return error.InvalidByteArrayLength; 1076 @memcpy(@field(event, field.name)[0..], bytes); 1077 } else { 1078 @compileError("unsupported read field type: " ++ @typeName(field.type)); 1079 } 1080 }, 1081 .bool => @field(event, field.name) = try readBool(DB, hash_kind, map, field.name), 1082 .int => |int_info| switch (int_info.signedness) { 1083 .unsigned => @field(event, field.name) = @intCast(try readUint(DB, hash_kind, map, field.name)), 1084 .signed => @field(event, field.name) = @intCast(try readInt(DB, hash_kind, map, field.name)), 1085 }, 1086 .@"enum" => { 1087 const bytes = try readBytes(DB, hash_kind, arena.allocator(), map, field.name); 1088 @field(event, field.name) = std.meta.stringToEnum(field.type, bytes) orelse return error.InvalidEnumTag; 1089 }, 1090 else => @compileError("unsupported read field type: " ++ @typeName(field.type)), 1091 } 1092 } 1093 }, 1094 else => @compileError("read expects a struct"), 1095 } 1096 1097 return event; 1098 } 1099 1100 // whether two events carry the same data. `created_ts` comes from the commit 1101 // rather than the payload, so it isn't compared. 1102 fn fieldsEqual(comptime T: type, a: T, b: T) bool { 1103 switch (@typeInfo(T)) { 1104 .@"struct" => |struct_info| { 1105 inline for (struct_info.fields) |field| { 1106 if (comptime std.mem.eql(u8, field.name, "created_ts")) continue; 1107 if (!fieldEqual(field.type, @field(a, field.name), @field(b, field.name))) return false; 1108 } 1109 }, 1110 else => @compileError("fieldsEqual expects a struct"), 1111 } 1112 1113 return true; 1114 } 1115 1116 pub fn fieldEqual(comptime Field: type, a: Field, b: Field) bool { 1117 switch (@typeInfo(Field)) { 1118 .pointer => |pointer_info| { 1119 if (pointer_info.size == .slice and pointer_info.child == u8) { 1120 return std.mem.eql(u8, a, b); 1121 } else { 1122 @compileError("unsupported field type: " ++ @typeName(Field)); 1123 } 1124 }, 1125 .array => |array_info| { 1126 if (array_info.child == u8) { 1127 return std.mem.eql(u8, &a, &b); 1128 } else { 1129 @compileError("unsupported field type: " ++ @typeName(Field)); 1130 } 1131 }, 1132 .bool, .int, .@"enum" => return a == b, 1133 else => @compileError("unsupported field type: " ++ @typeName(Field)), 1134 } 1135 } 1136 1137 fn readBytes( 1138 comptime DB: type, 1139 comptime hash_kind: hash.HashKind, 1140 allocator: std.mem.Allocator, 1141 map: DB.HashMap(.read_only), 1142 field_name: []const u8, 1143 ) ![]const u8 { 1144 const cursor = try map.getCursor(hash.hashInt(hash_kind, field_name)) orelse return error.NotFound; 1145 return try cursor.readBytesAlloc(allocator, null); 1146 } 1147 1148 fn readUint( 1149 comptime DB: type, 1150 comptime hash_kind: hash.HashKind, 1151 map: DB.HashMap(.read_only), 1152 field_name: []const u8, 1153 ) !u64 { 1154 const cursor = try map.getCursor(hash.hashInt(hash_kind, field_name)) orelse return error.NotFound; 1155 return try cursor.readUint(); 1156 } 1157 1158 fn readInt( 1159 comptime DB: type, 1160 comptime hash_kind: hash.HashKind, 1161 map: DB.HashMap(.read_only), 1162 field_name: []const u8, 1163 ) !i64 { 1164 const cursor = try map.getCursor(hash.hashInt(hash_kind, field_name)) orelse return error.NotFound; 1165 return try cursor.readInt(); 1166 } 1167 1168 fn readBool( 1169 comptime DB: type, 1170 comptime hash_kind: hash.HashKind, 1171 map: DB.HashMap(.read_only), 1172 field_name: []const u8, 1173 ) !bool { 1174 const cursor = try map.getCursor(hash.hashInt(hash_kind, field_name)) orelse return error.NotFound; 1175 var buffer: [5]u8 = undefined; 1176 const bytes = try cursor.readBytesObject(&buffer); 1177 const format_tag = bytes.format_tag orelse return error.InvalidFormatTag; 1178 if (!std.mem.eql(u8, &format_tag, "bl")) return error.InvalidFormatTag; 1179 if (std.mem.eql(u8, bytes.value, "true")) return true; 1180 if (std.mem.eql(u8, bytes.value, "false")) return false; 1181 return error.InvalidBool; 1182 } 1183 1184 // 1185 // writing to xitdb 1186 // 1187 1188 pub fn upsert( 1189 comptime T: type, 1190 comptime DB: type, 1191 comptime hash_kind: hash.HashKind, 1192 map: DB.HashMap(.read_write), 1193 event: T, 1194 ) !void { 1195 switch (@typeInfo(T)) { 1196 .@"struct" => |struct_info| { 1197 inline for (struct_info.fields) |field| { 1198 try upsertField(DB, hash_kind, map, field.name, field.type, @field(event, field.name)); 1199 } 1200 }, 1201 else => @compileError("upsert expects a struct"), 1202 } 1203 } 1204 1205 fn upsertField( 1206 comptime DB: type, 1207 comptime hash_kind: hash.HashKind, 1208 map: DB.HashMap(.read_write), 1209 comptime field_name: []const u8, 1210 comptime Field: type, 1211 value: Field, 1212 ) !void { 1213 const key = hash.hashInt(hash_kind, field_name); 1214 1215 switch (@typeInfo(Field)) { 1216 .pointer => |pointer_info| { 1217 if (pointer_info.size == .slice and pointer_info.child == u8) { 1218 try upsertBytes(DB, hash_kind, map, key, value); 1219 } else { 1220 @compileError("unsupported upsert field type: " ++ @typeName(Field)); 1221 } 1222 }, 1223 .array => |array_info| { 1224 if (array_info.child == u8) { 1225 try upsertBytes(DB, hash_kind, map, key, &value); 1226 } else { 1227 @compileError("unsupported upsert field type: " ++ @typeName(Field)); 1228 } 1229 }, 1230 .int => |int_info| switch (int_info.signedness) { 1231 .unsigned => { 1232 if (try map.getCursor(key)) |value_cursor| { 1233 if (try value_cursor.readUint() == value) { 1234 return; 1235 } 1236 } 1237 1238 try map.put(key, .{ .uint = value }); 1239 }, 1240 .signed => { 1241 if (try map.getCursor(key)) |value_cursor| { 1242 if (try value_cursor.readInt() == value) { 1243 return; 1244 } 1245 } 1246 1247 try map.put(key, .{ .int = value }); 1248 }, 1249 }, 1250 .bool => { 1251 const bytes = if (value) "true" else "false"; 1252 if (try map.getCursor(key)) |value_cursor| { 1253 var buffer: [5]u8 = undefined; 1254 const existing = try value_cursor.readBytesObject(&buffer); 1255 if (existing.format_tag) |format_tag| { 1256 if (std.mem.eql(u8, &format_tag, "bl") and std.mem.eql(u8, existing.value, bytes)) { 1257 return; 1258 } 1259 } 1260 } 1261 1262 try map.put(key, .{ .bytes_object = .{ .value = bytes, .format_tag = "bl".* } }); 1263 }, 1264 .@"enum" => try upsertBytes(DB, hash_kind, map, key, @tagName(value)), 1265 else => @compileError("unsupported upsert field type: " ++ @typeName(Field)), 1266 } 1267 } 1268 1269 fn upsertBytes( 1270 comptime DB: type, 1271 comptime hash_kind: hash.HashKind, 1272 map: DB.HashMap(.read_write), 1273 key: hash.HashInt(hash_kind), 1274 value: []const u8, 1275 ) !void { 1276 var existing_cursor_maybe = try map.getCursor(key); 1277 if (existing_cursor_maybe) |*existing_cursor| { 1278 if (try bytesEqual(DB, existing_cursor, value)) { 1279 return; 1280 } 1281 } 1282 1283 var value_cursor = try map.putCursor(key); 1284 var write_buffer: [1024]u8 = undefined; 1285 var writer = try value_cursor.writer(&write_buffer); 1286 try writer.interface.writeAll(value); 1287 try writer.finish(); 1288 } 1289 1290 fn bytesEqual( 1291 comptime DB: type, 1292 cursor: *DB.Cursor(.read_only), 1293 value: []const u8, 1294 ) !bool { 1295 var read_buffer: [1024]u8 = undefined; 1296 var reader = try cursor.reader(&read_buffer); 1297 if (reader.size != value.len) { 1298 return false; 1299 } 1300 1301 var chunk_buffer: [1024]u8 = undefined; 1302 var offset: usize = 0; 1303 while (offset < value.len) { 1304 const chunk_len = @min(chunk_buffer.len, value.len - offset); 1305 try reader.interface.readSliceAll(chunk_buffer[0..chunk_len]); 1306 if (!std.mem.eql(u8, chunk_buffer[0..chunk_len], value[offset .. offset + chunk_len])) { 1307 return false; 1308 } 1309 offset += chunk_len; 1310 } 1311 1312 return true; 1313 } 1314 1315 // 1316 // CommitIterator 1317 // 1318 // differs from xit's ObjectIterator in a few ways: 1319 // 1320 // 1. iterates parents first, rather than children first 1321 // 2. `next` only returns the object id, not the full Object 1322 // 3. stores its temporary state in a file on disk to avoid OOMs 1323 // 1324 1325 pub fn CommitIterator(comptime repo_kind: rp.RepoKind, comptime repo_opts: rp.RepoOpts(repo_kind)) type { 1326 return struct { 1327 const DB = EventDB(repo_opts.hash); 1328 const db_name = "haxy-repo-events.db"; 1329 1330 repo_dir: std.Io.Dir, 1331 db_file: std.Io.File, 1332 db: *DB, 1333 // map of each object id to its children 1334 parent_to_children: DB.HashMap(.read_write), 1335 // tracking pending parents is necessary because a child can only 1336 // be returned after all of its unconsumed parents have been returned 1337 child_to_pending_parents: DB.HashMap(.read_write), 1338 // queue of object ids that are ready to be returned from `next` 1339 ready_queue: DB.ArrayList(.read_write), 1340 ready_queue_index: u64, 1341 // the object id at the tip of this branch 1342 newest_object_id: ?[hash.byteLen(repo_opts.hash)]u8, 1343 // the object id furthest back in the history that hasn't been consumed 1344 oldest_object_id: ?[hash.byteLen(repo_opts.hash)]u8, 1345 1346 pub fn init( 1347 state: rp.Repo(repo_kind, repo_opts).State(.read_only), 1348 io: std.Io, 1349 allocator: std.mem.Allocator, 1350 consumed_object_ids: DB.HashMap(.read_only), 1351 ref: rf.Ref, 1352 ) !CommitIterator(repo_kind, repo_opts) { 1353 const db_file = try state.core.repo_dir.createFile(io, db_name, .{ .truncate = true, .lock = .exclusive, .read = true }); 1354 errdefer { 1355 db_file.close(io); 1356 state.core.repo_dir.deleteFile(io, db_name) catch {}; 1357 } 1358 1359 const buffer_ptr = try allocator.create(std.Io.Writer.Allocating); 1360 errdefer allocator.destroy(buffer_ptr); 1361 1362 buffer_ptr.* = std.Io.Writer.Allocating.init(allocator); 1363 errdefer buffer_ptr.deinit(); 1364 1365 const db_ptr = try allocator.create(DB); 1366 errdefer allocator.destroy(db_ptr); 1367 // the db is scratch state that gets deleted after iteration, so 1368 // there is nothing worth fsyncing 1369 db_ptr.* = try DB.init(.{ .io = io, .file = db_file, .buffer = buffer_ptr, .fsync = false }); 1370 1371 const map = try DB.HashMap(.read_write).init(db_ptr.rootCursor()); 1372 1373 const parent_to_children_cursor = try map.putCursor(hash.hashInt(repo_opts.hash, "parent->children")); 1374 const parent_to_children = try DB.HashMap(.read_write).init(parent_to_children_cursor); 1375 1376 const child_to_pending_parents_cursor = try map.putCursor(hash.hashInt(repo_opts.hash, "child->pending-parents")); 1377 const child_to_pending_parents = try DB.HashMap(.read_write).init(child_to_pending_parents_cursor); 1378 1379 const ready_queue_cursor = try map.putCursor(hash.hashInt(repo_opts.hash, "ready-queue")); 1380 const ready_queue = try DB.ArrayList(.read_write).init(ready_queue_cursor); 1381 1382 var self = CommitIterator(repo_kind, repo_opts){ 1383 .repo_dir = state.core.repo_dir, 1384 .db_file = db_file, 1385 .db = db_ptr, 1386 .parent_to_children = parent_to_children, 1387 .child_to_pending_parents = child_to_pending_parents, 1388 .ready_queue = ready_queue, 1389 .ready_queue_index = 0, 1390 .newest_object_id = null, 1391 .oldest_object_id = null, 1392 }; 1393 errdefer self.deinit(io, allocator); 1394 1395 try self.collect(state, io, allocator, consumed_object_ids, ref); 1396 1397 return self; 1398 } 1399 1400 pub fn deinit(self: *CommitIterator(repo_kind, repo_opts), io: std.Io, allocator: std.mem.Allocator) void { 1401 self.db_file.close(io); 1402 self.db.core.memory.buffer.deinit(); 1403 allocator.destroy(self.db.core.memory.buffer); 1404 self.repo_dir.deleteFile(io, db_name) catch {}; 1405 allocator.destroy(self.db); 1406 } 1407 1408 pub fn next(self: *CommitIterator(repo_kind, repo_opts)) !?[hash.byteLen(repo_opts.hash)]u8 { 1409 if (self.ready_queue_index >= try self.ready_queue.count()) return null; 1410 1411 const oid = try readOidFromList(self.ready_queue.readOnly(), self.ready_queue_index); 1412 self.ready_queue_index += 1; 1413 1414 try self.enqueueChildren(&oid); 1415 return oid; 1416 } 1417 1418 fn collect( 1419 self: *CommitIterator(repo_kind, repo_opts), 1420 state: rp.Repo(repo_kind, repo_opts).State(.read_only), 1421 io: std.Io, 1422 allocator: std.mem.Allocator, 1423 consumed_object_ids: DB.HashMap(.read_only), 1424 ref: rf.Ref, 1425 ) !void { 1426 const map = try DB.HashMap(.read_write).init(self.db.rootCursor()); 1427 1428 const walk_queue_cursor = try map.putCursor(hash.hashInt(repo_opts.hash, "walk-queue")); 1429 const walk_queue = try DB.ArrayList(.read_write).init(walk_queue_cursor); 1430 var walk_queue_index: u64 = 0; 1431 1432 const seen_object_ids_cursor = try map.putCursor(hash.hashInt(repo_opts.hash, "seen-object-ids")); 1433 const seen_object_ids = try DB.HashSet(.read_write).init(seen_object_ids_cursor); 1434 1435 const head_oid_hex = (try rf.readRecur(repo_kind, repo_opts, state, io, .{ .ref = ref })) orelse return error.OidNotFound; 1436 var head_oid: [hash.byteLen(repo_opts.hash)]u8 = undefined; 1437 _ = try std.fmt.hexToBytes(&head_oid, &head_oid_hex); 1438 try walk_queue.append(.{ .bytes = &head_oid }); 1439 1440 while (walk_queue_index < try walk_queue.count()) { 1441 const oid = try readOidFromList(walk_queue.readOnly(), walk_queue_index); 1442 const oid_int = hash.bytesToInt(repo_opts.hash, &oid); 1443 1444 walk_queue_index += 1; 1445 1446 // if we've seen this object id, skip it 1447 if (null != try seen_object_ids.getCursor(oid_int)) { 1448 continue; 1449 } 1450 1451 try seen_object_ids.put(oid_int, .{ .bytes = &oid }); 1452 1453 var commit_object = try obj.Object(repo_kind, repo_opts).init(state, io, allocator, &std.fmt.bytesToHex(oid, .lower)); 1454 defer commit_object.deinit(); 1455 1456 // if this object id has already been consumed, skip it 1457 if (null != try consumed_object_ids.getCursor(oid_int)) { 1458 continue; 1459 } 1460 1461 if (self.newest_object_id == null) self.newest_object_id = oid; 1462 self.oldest_object_id = oid; 1463 1464 const parent_oids = commit_object.content.commit.metadata.parent_oids orelse return error.ParentOidsNotFound; 1465 var pending_parent_count: u64 = 0; 1466 for (parent_oids) |*parent_oid| { 1467 var parent_oid_bytes: [hash.byteLen(repo_opts.hash)]u8 = undefined; 1468 _ = try std.fmt.hexToBytes(&parent_oid_bytes, parent_oid); 1469 const parent_oid_int = hash.bytesToInt(repo_opts.hash, &parent_oid_bytes); 1470 1471 // if this object id has already been consumed, skip it 1472 if (null != try consumed_object_ids.getCursor(parent_oid_int)) { 1473 continue; 1474 } 1475 1476 // if this object id hasn't already been seen, add it to the walk queue 1477 if (null == try seen_object_ids.getCursor(parent_oid_int)) { 1478 try walk_queue.append(.{ .bytes = &parent_oid_bytes }); 1479 } 1480 1481 const children_cursor = try self.parent_to_children.putCursor(parent_oid_int); 1482 const children = try DB.HashSet(.read_write).init(children_cursor); 1483 try children.put(oid_int, .{ .bytes = &oid }); 1484 pending_parent_count += 1; 1485 } 1486 1487 if (pending_parent_count == 0) { 1488 try self.ready_queue.append(.{ .bytes = &oid }); 1489 } else { 1490 try self.child_to_pending_parents.put(oid_int, .{ .uint = pending_parent_count }); 1491 } 1492 } 1493 } 1494 1495 fn enqueueChildren(self: *CommitIterator(repo_kind, repo_opts), oid: *const [hash.byteLen(repo_opts.hash)]u8) !void { 1496 const oid_int = hash.bytesToInt(repo_opts.hash, oid); 1497 const children_cursor = try self.parent_to_children.getCursor(oid_int) orelse return; 1498 const children = try DB.HashSet(.read_only).init(children_cursor); 1499 var children_iter = try children.iterator(); 1500 1501 while (try children_iter.next()) |*child_cursor| { 1502 const kv_pair = try child_cursor.readKeyValuePair(); 1503 const child_oid_int = kv_pair.hash; 1504 const pending_parent_cursor = try self.child_to_pending_parents.getCursor(child_oid_int) orelse return error.CursorNotFound; 1505 const pending_parent_count = try pending_parent_cursor.readUint(); 1506 1507 if (pending_parent_count <= 1) { 1508 _ = try self.child_to_pending_parents.remove(child_oid_int); 1509 const child_oid = hash.intToBytes(hash.HashInt(repo_opts.hash), child_oid_int); 1510 try self.ready_queue.append(.{ .bytes = &child_oid }); 1511 } else { 1512 try self.child_to_pending_parents.put(child_oid_int, .{ .uint = pending_parent_count - 1 }); 1513 } 1514 } 1515 } 1516 1517 fn readOidFromList(list: DB.ArrayList(.read_only), index: u64) ![hash.byteLen(repo_opts.hash)]u8 { 1518 const oid_cursor = try list.getCursor(index) orelse return error.CursorNotFound; 1519 var oid: [hash.byteLen(repo_opts.hash)]u8 = undefined; 1520 _ = try oid_cursor.readBytes(&oid); 1521 return oid; 1522 } 1523 }; 1524 } 1525