-
Notifications
You must be signed in to change notification settings - Fork 1.8k
Shared: Skip non-CFG children in StandardTree
#20230
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
hvitved
merged 1 commit into
github:main
from
hvitved:cfg/standard-tree-skip-non-tree-children
Aug 18, 2025
Merged
Changes from all commits
Commits
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
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 | ||||||
---|---|---|---|---|---|---|---|---|
|
@@ -261,40 +261,52 @@ module MakeWithSplitting< | |||||||
/** Gets the `i`th child element, in order of evaluation. */ | ||||||||
abstract AstNode getChildNode(int i); | ||||||||
|
||||||||
private AstNode getChildNodeRanked(int i) { | ||||||||
result = rank[i + 1](AstNode child, int j | child = this.getChildNode(j) | child order by j) | ||||||||
private ControlFlowTree getChildTreeRanked(int i) { | ||||||||
result = | ||||||||
rank[i + 1](ControlFlowTree child, int j | child = this.getChildNode(j) | child order by j) | ||||||||
} | ||||||||
|
||||||||
/** Gets the first child node of this element. */ | ||||||||
final AstNode getFirstChildNode() { result = this.getChildNodeRanked(0) } | ||||||||
deprecated final AstNode getFirstChildNode() { result = this.getChildTreeRanked(0) } | ||||||||
|
||||||||
/** Gets the first child node of this element. */ | ||||||||
final ControlFlowTree getFirstChildTree() { result = this.getChildTreeRanked(0) } | ||||||||
|
||||||||
/** Gets the last child node of this node. */ | ||||||||
deprecated final AstNode getLastChildElement() { | ||||||||
exists(int last | | ||||||||
result = this.getChildTreeRanked(last) and | ||||||||
not exists(this.getChildTreeRanked(last + 1)) | ||||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. The deprecated
Suggested change
Copilot uses AI. Check for mistakes. Positive FeedbackNegative Feedback |
||||||||
) | ||||||||
} | ||||||||
|
||||||||
/** Gets the last child node of this node. */ | ||||||||
final AstNode getLastChildElement() { | ||||||||
final ControlFlowTree getLastChildTree() { | ||||||||
exists(int last | | ||||||||
result = this.getChildNodeRanked(last) and | ||||||||
not exists(this.getChildNodeRanked(last + 1)) | ||||||||
result = this.getChildTreeRanked(last) and | ||||||||
not exists(this.getChildTreeRanked(last + 1)) | ||||||||
) | ||||||||
} | ||||||||
|
||||||||
/** Holds if this element has no children. */ | ||||||||
predicate isLeafElement() { not exists(this.getFirstChildNode()) } | ||||||||
predicate isLeafElement() { not exists(this.getFirstChildTree()) } | ||||||||
|
||||||||
override predicate propagatesAbnormal(AstNode child) { child = this.getChildNode(_) } | ||||||||
|
||||||||
pragma[nomagic] | ||||||||
override predicate succ(AstNode pred, AstNode succ, Completion c) { | ||||||||
exists(int i | | ||||||||
last(this.getChildNodeRanked(i), pred, c) and | ||||||||
last(this.getChildTreeRanked(i), pred, c) and | ||||||||
completionIsNormal(c) and | ||||||||
first(this.getChildNodeRanked(i + 1), succ) | ||||||||
first(this.getChildTreeRanked(i + 1), succ) | ||||||||
) | ||||||||
} | ||||||||
} | ||||||||
|
||||||||
/** A standard element that is executed in pre-order. */ | ||||||||
abstract class StandardPreOrderTree extends StandardTree, PreOrderTree { | ||||||||
override predicate last(AstNode last, Completion c) { | ||||||||
last(this.getLastChildElement(), last, c) | ||||||||
last(this.getLastChildTree(), last, c) | ||||||||
or | ||||||||
this.isLeafElement() and | ||||||||
completionIsValidFor(c, this) and | ||||||||
|
@@ -305,24 +317,24 @@ module MakeWithSplitting< | |||||||
StandardTree.super.succ(pred, succ, c) | ||||||||
or | ||||||||
pred = this and | ||||||||
first(this.getFirstChildNode(), succ) and | ||||||||
first(this.getFirstChildTree(), succ) and | ||||||||
completionIsSimple(c) | ||||||||
} | ||||||||
} | ||||||||
|
||||||||
/** A standard element that is executed in post-order. */ | ||||||||
abstract class StandardPostOrderTree extends StandardTree, PostOrderTree { | ||||||||
override predicate first(AstNode first) { | ||||||||
first(this.getFirstChildNode(), first) | ||||||||
first(this.getFirstChildTree(), first) | ||||||||
or | ||||||||
not exists(this.getFirstChildNode()) and | ||||||||
not exists(this.getFirstChildTree()) and | ||||||||
first = this | ||||||||
} | ||||||||
|
||||||||
override predicate succ(AstNode pred, AstNode succ, Completion c) { | ||||||||
StandardTree.super.succ(pred, succ, c) | ||||||||
or | ||||||||
last(this.getLastChildElement(), pred, c) and | ||||||||
last(this.getLastChildTree(), pred, c) and | ||||||||
succ = this and | ||||||||
completionIsNormal(c) | ||||||||
} | ||||||||
|
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The deprecated
getFirstChildNode()
method returnsAstNode
but callsgetChildTreeRanked(0)
which returnsControlFlowTree
. This type mismatch will cause compilation errors sinceControlFlowTree
cannot be implicitly converted toAstNode
.Copilot uses AI. Check for mistakes.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think it can do that conversion just fine. This change doesn't appear to preserve the existing behaviour of
getFirstChildNode
perfectly, but as it's being deprecated I'm not overly concerned about that.