╭─────────────╮ │scroll to top│ ╰─────────────╯ ╭ event.zig ────────────────────────────────────────────────────╮ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ │ ╰───────────────────────────────────────────────────────────────╯
╭────╮ ╭ clone ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╮ │http│ ssh │ │ ╰────╯ ╰ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ╯
1181 self.oldest_object_id = oid; 1182 1183 const parent_oids = commit_object.content.commit.metadata.parent_oids orelse return error.ParentOidsNotFound; 1184 var pending_parent_count: u64 = 0; 1185 for (parent_oids) |*parent_oid| { 1186 var parent_oid_bytes: [hash.byteLen(repo_opts.hash)]u8 = undefined; 1187 _ = try std.fmt.hexToBytes(&parent_oid_bytes, parent_oid); 1188 const parent_oid_int = hash.bytesToInt(repo_opts.hash, &parent_oid_bytes); 1189 1190 // if this object id has already been consumed, skip it 1191 if (null != try consumed_object_ids.getCursor(parent_oid_int)) { 1192 continue; 1193 } 1194 1195 // if this object id hasn't already been seen, add it to the walk queue 1196 if (null == try seen_object_ids.getCursor(parent_oid_int)) { 1197 try walk_queue.append(.{ .bytes = &parent_oid_bytes }); 1198 } 1199 1200 const children_cursor = try self.parent_to_children.putCursor(parent_oid_int); 1201 const children = try DB.HashSet(.read_write).init(children_cursor); 1202 try children.put(oid_int, .{ .bytes = &oid }); 1203 pending_parent_count += 1; 1204 } 1205 1206 if (pending_parent_count == 0) { 1207 try self.ready_queue.append(.{ .bytes = &oid }); 1208 } else { 1209 try self.child_to_pending_parents.put(oid_int, .{ .uint = pending_parent_count }); 1210 } 1211 } 1212 } 1213 1214 fn enqueueChildren(self: *CommitIterator(repo_kind, repo_opts), oid: *const [hash.byteLen(repo_opts.hash)]u8) !void { 1215 const oid_int = hash.bytesToInt(repo_opts.hash, oid); 1216 const children_cursor = try self.parent_to_children.getCursor(oid_int) orelse return; 1217 const children = try DB.HashSet(.read_only).init(children_cursor); 1218 var children_iter = try children.iterator(); 1219 1220 while (try children_iter.next()) |*child_cursor| { 1221 const kv_pair = try child_cursor.readKeyValuePair(); 1222 const child_oid_int = kv_pair.hash; 1223 const pending_parent_cursor = try self.child_to_pending_parents.getCursor(child_oid_int) orelse return error.CursorNotFound; 1224 const pending_parent_count = try pending_parent_cursor.readUint(); 1225 1226 if (pending_parent_count <= 1) { 1227 _ = try self.child_to_pending_parents.remove(child_oid_int); 1228 const child_oid = hash.intToBytes(hash.HashInt(repo_opts.hash), child_oid_int); 1229 try self.ready_queue.append(.{ .bytes = &child_oid }); 1230 } else { 1231 try self.child_to_pending_parents.put(child_oid_int, .{ .uint = pending_parent_count - 1 }); 1232 } 1233 } 1234 } 1235 1236 fn readOidFromList(list: DB.ArrayList(.read_only), index: u64) ![hash.byteLen(repo_opts.hash)]u8 { 1237 const oid_cursor = try list.getCursor(index) orelse return error.CursorNotFound; 1238 var oid: [hash.byteLen(repo_opts.hash)]u8 = undefined; 1239 _ = try oid_cursor.readBytes(&oid); 1240 return oid; 1241 } 1242 }; 1243 } 1244