hohn/codeql
1
0
Fork 0
mirror of https://github.com/github/codeql.git synced 2026-04-27 09:45:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

C++: Improve join order in IR reachability

Browse Source
This commit is contained in:
Dave Bartolomeo
2018-12-10 10:50:32 -08:00
parent 99d33f9623
commit b2e596fcc2
3 changed files with 18 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
cpp/ql/src/semmle/code/cpp/ir/implementation/aliased_ssa/internal/reachability/ReachableBlock.qll
View File

@@ -22,7 +22,9 @@ IRBlock getAFeasiblePredecessor(IRBlock successor) {
}
predicate isBlockReachable(IRBlock block) {
getAFeasiblePredecessor*(block) = block.getFunctionIR().getEntryBlock()
exists(FunctionIR f |
getAFeasiblePredecessor*(block) = f.getEntryBlock()
)
}
predicate isInstructionReachable(Instruction instr) {
@@ -43,7 +45,9 @@ class ReachableInstruction extends Instruction {
module Graph {
predicate isEntryBlock(ReachableBlock block) {
block = block.getFunctionIR().getEntryBlock()
exists(FunctionIR f |
block = f.getEntryBlock()
)
}
predicate blockSuccessor(ReachableBlock pred, ReachableBlock succ) {

8
cpp/ql/src/semmle/code/cpp/ir/implementation/raw/internal/reachability/ReachableBlock.qll
View File

@@ -22,7 +22,9 @@ IRBlock getAFeasiblePredecessor(IRBlock successor) {
}
predicate isBlockReachable(IRBlock block) {
getAFeasiblePredecessor*(block) = block.getFunctionIR().getEntryBlock()
exists(FunctionIR f |
getAFeasiblePredecessor*(block) = f.getEntryBlock()
)
}
predicate isInstructionReachable(Instruction instr) {
@@ -43,7 +45,9 @@ class ReachableInstruction extends Instruction {
module Graph {
predicate isEntryBlock(ReachableBlock block) {
block = block.getFunctionIR().getEntryBlock()
exists(FunctionIR f |
block = f.getEntryBlock()
)
}
predicate blockSuccessor(ReachableBlock pred, ReachableBlock succ) {

8
cpp/ql/src/semmle/code/cpp/ir/implementation/unaliased_ssa/internal/reachability/ReachableBlock.qll
View File

@@ -22,7 +22,9 @@ IRBlock getAFeasiblePredecessor(IRBlock successor) {
}
predicate isBlockReachable(IRBlock block) {
getAFeasiblePredecessor*(block) = block.getFunctionIR().getEntryBlock()
exists(FunctionIR f |
getAFeasiblePredecessor*(block) = f.getEntryBlock()
)
}
predicate isInstructionReachable(Instruction instr) {
@@ -43,7 +45,9 @@ class ReachableInstruction extends Instruction {
module Graph {
predicate isEntryBlock(ReachableBlock block) {
block = block.getFunctionIR().getEntryBlock()
exists(FunctionIR f |
block = f.getEntryBlock()
)
}
predicate blockSuccessor(ReachableBlock pred, ReachableBlock succ) {