-
Notifications
You must be signed in to change notification settings - Fork 1.4k
[Package/ModuleGraph] Allow cyclic package dependencies if they don't introduce a cycle in a build graph #7530
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 9 commits
Commits
Show all changes
11 commits
Select commit
Hold shift + click to select a range
07bd625
[Basics] Implement a pre-order depth-first graph traversal algorithm
xedin b6fdae0
[Workspace] Switch manifest loading to use DFS instead of findCycles+…
xedin a52aeb3
[ModulesGraph] Avoid re-fetching and sorting packages multiple times
xedin 0ad8cd5
[Plugins] Provide plugin invocation and serialization with underlying…
xedin db1a26f
[PackageGraph] Switch `ResolvedPackage` dependencies to use `PackageI…
xedin 72522a0
[ModulesGraph] NFC: Handle module->package and product->package link …
xedin 5855285
[PackageGraph] Use DFS to build a set of package graph nodes to load
xedin f8fd35b
[PackageGraph] Detect and diagnose cycles in target graph
xedin eb4038c
[Tests] NFC: Switch some tests to use `ModulesGraph.package(for: Pack…
xedin 982e279
NFC: Rename `DFS` to `depthFirstSeach`
xedin e3a16d4
NFC: Add a CHANGELOG.md entry about cyclic package-level dependencies
xedin File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,57 @@ | ||
//===----------------------------------------------------------------------===// | ||
// | ||
// This source file is part of the Swift open source project | ||
// | ||
// Copyright (c) 2015-2024 Apple Inc. and the Swift project authors | ||
// Licensed under Apache License v2.0 with Runtime Library Exception | ||
// | ||
// See http://swift.org/LICENSE.txt for license information | ||
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors | ||
// | ||
//===----------------------------------------------------------------------===// | ||
|
||
import struct OrderedCollections.OrderedSet | ||
|
||
/// Implements a pre-order depth-first search. | ||
/// | ||
/// The cycles are handled by skipping cycle points but it should be possible to | ||
/// to extend this in the future to provide a callback for every cycle. | ||
/// | ||
/// - Parameters: | ||
/// - nodes: The list of input nodes to sort. | ||
/// - successors: A closure for fetching the successors of a particular node. | ||
/// - onUnique: A callback to indicate the the given node is being processed for the first time. | ||
/// - onDuplicate: A callback to indicate that the node was already processed at least once. | ||
/// | ||
/// - Complexity: O(v + e) where (v, e) are the number of vertices and edges | ||
/// reachable from the input nodes via the relation. | ||
public func DFS<T: Hashable>( | ||
_ nodes: [T], | ||
successors: (T) throws -> [T], | ||
onUnique: (T) -> Void, | ||
onDuplicate: (T, T) -> Void | ||
) rethrows { | ||
var stack = OrderedSet<T>() | ||
var visited = Set<T>() | ||
|
||
for node in nodes { | ||
precondition(stack.isEmpty) | ||
stack.append(node) | ||
|
||
while !stack.isEmpty { | ||
let curr = stack.removeLast() | ||
|
||
let visitResult = visited.insert(curr) | ||
if visitResult.inserted { | ||
onUnique(curr) | ||
} else { | ||
onDuplicate(visitResult.memberAfterInsert, curr) | ||
continue | ||
} | ||
|
||
for succ in try successors(curr) { | ||
stack.append(succ) | ||
} | ||
} | ||
} | ||
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.