╭─────────────╮ │scroll to top│ ╰─────────────╯ ╭ event.zig ────────────────────────────────────────────────────╮ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ╰───────────────────────────────────────────────────────────────╯
╭────╮ ╭ clone ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╮ │http│ ssh │ │ ╰────╯ ╰ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╯
2064 if (self.newest_object_id == null) self.newest_object_id = oid; 2065 self.oldest_object_id = oid; 2066 2067 const parent_oids = commit_object.content.commit.metadata.parent_oids orelse return error.ParentOidsNotFound; 2068 var pending_parent_count: u64 = 0; 2069 for (parent_oids) |*parent_oid| { 2070 var parent_oid_bytes: [hash.byteLen(repo_opts.hash)]u8 = undefined; 2071 _ = try std.fmt.hexToBytes(&parent_oid_bytes, parent_oid); 2072 const parent_oid_int = hash.bytesToInt(repo_opts.hash, &parent_oid_bytes); 2073 2074 // if this object id has already been consumed, skip it 2075 if (null != try consumed_object_ids.getCursor(parent_oid_int)) { 2076 continue; 2077 } 2078 2079 // if this object id hasn't already been seen, add it to the walk queue 2080 if (null == try seen_object_ids.getCursor(parent_oid_int)) { 2081 try walk_queue.append(.{ .bytes = &parent_oid_bytes }); 2082 } 2083 2084 const children_cursor = try self.parent_to_children.putCursor(parent_oid_int); 2085 const children = try DB.HashSet(.read_write).init(children_cursor); 2086 try children.put(oid_int, .{ .bytes = &oid }); 2087 pending_parent_count += 1; 2088 } 2089 2090 if (pending_parent_count == 0) { 2091 try self.ready_queue.append(.{ .bytes = &oid }); 2092 } else { 2093 try self.child_to_pending_parents.put(oid_int, .{ .uint = pending_parent_count }); 2094 } 2095 } 2096 } 2097 2098 fn enqueueChildren(self: *CommitIterator(repo_kind, repo_opts), oid: *const [hash.byteLen(repo_opts.hash)]u8) !void { 2099 const oid_int = hash.bytesToInt(repo_opts.hash, oid); 2100 const children_cursor = try self.parent_to_children.getCursor(oid_int) orelse return; 2101 const children = try DB.HashSet(.read_only).init(children_cursor); 2102 var children_iter = try children.iterator(); 2103 2104 while (try children_iter.next()) |*child_cursor| { 2105 const kv_pair = try child_cursor.readKeyValuePair(); 2106 const child_oid_int = kv_pair.hash; 2107 const pending_parent_cursor = try self.child_to_pending_parents.getCursor(child_oid_int) orelse return error.CursorNotFound; 2108 const pending_parent_count = try pending_parent_cursor.readUint(); 2109 2110 if (pending_parent_count <= 1) { 2111 _ = try self.child_to_pending_parents.remove(child_oid_int); 2112 const child_oid = hash.intToBytes(hash.HashInt(repo_opts.hash), child_oid_int); 2113 try self.ready_queue.append(.{ .bytes = &child_oid }); 2114 } else { 2115 try self.child_to_pending_parents.put(child_oid_int, .{ .uint = pending_parent_count - 1 }); 2116 } 2117 } 2118 } 2119 2120 fn readOidFromList(list: DB.ArrayList(.read_only), index: u64) ![hash.byteLen(repo_opts.hash)]u8 { 2121 const oid_cursor = try list.getCursor(index) orelse return error.CursorNotFound; 2122 var oid: [hash.byteLen(repo_opts.hash)]u8 = undefined; 2123 _ = try oid_cursor.readBytes(&oid); 2124 return oid; 2125 } 2126 }; 2127 } 2128