Data flow: Use parameterized module to share code between pruning stages #8301
Conversation
hvitved
force-pushed
the
dataflow/param-stages
branch
3 times, most recently
from
ea8f3ba to
31e5693
Compare
hvitved
force-pushed
the
dataflow/param-stages
branch
2 times, most recently
from
e1c369c to
987b8c6
Compare
hvitved
force-pushed
the
dataflow/param-stages
branch
2 times, most recently
from
aa88421 to
e2e4f26
Compare
hvitved
force-pushed
the
dataflow/param-stages
branch
from
e2e4f26 to
a7e7cb4
Compare
![github-advanced-security[bot]](https://avatars.githubusercontent.com/in/57789?s=60&v=4){kind=small}
| * The corresponding paths are generated from the end-points and the graph | ||
| * included in the module `PathGraph`. | ||
| */ | ||
| predicate hasFlowPath(PathNode source, PathNode sink) { flowsTo(source, sink, _, _, this) } |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * The corresponding paths are generated from the end-points and the graph | ||
| * included in the module `PathGraph`. | ||
| */ | ||
| predicate hasFlowPath(PathNode source, PathNode sink) { flowsTo(source, sink, _, _, this) } |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * | ||
| * To use this in a `path-problem` query, import the module `PartialPathGraph`. | ||
| */ | ||
| final predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * | ||
| * To use this in a `path-problem` query, import the module `PartialPathGraph`. | ||
| */ | ||
| final predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * Note that reverse flow has slightly lower precision than the corresponding | ||
| * forward flow, as reverse flow disregards type pruning among other features. | ||
| */ | ||
| final predicate hasPartialFlowRev(PartialPathNode node, PartialPathNode sink, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| predicate prevStageReadStepCand(NodeEx n1, Content c, NodeEx n2, Configuration config); | ||
|
|
||
| predicate prevStageStoreStepCand( | ||
| NodeEx node1, ApApprox ap1, TypedContent tc, NodeEx node2, DataFlowType contentType, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| // TODO: Use separate module once supported for all `prevStage` predicates | ||
| bindingset[node, state, config] | ||
| predicate prevStageRevFlow( | ||
| NodeEx node, FlowState state, boolean toReturn, ApApproxOption returnAp, ApApprox ap, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| // TODO: Use separate module once supported for all `prevStage` predicates | ||
| bindingset[node, state, config] | ||
| predicate prevStageRevFlow( | ||
| NodeEx node, FlowState state, boolean toReturn, ApApproxOption returnAp, ApApprox ap, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
|
|
||
| class ApApprox = PrevStage::Ap; | ||
| predicate prevStageParameterMayFlowThrough( | ||
| ParamNodeEx p, DataFlowCallable c, ApApprox ap, Configuration config |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| predicate prevStageReadStepCand(NodeEx n1, Content c, NodeEx n2, Configuration config); | ||
|
|
||
| predicate prevStageStoreStepCand( | ||
| NodeEx node1, ApApprox ap1, TypedContent tc, NodeEx node2, DataFlowType contentType, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * The corresponding paths are generated from the end-points and the graph | ||
| * included in the module `PathGraph`. | ||
| */ | ||
| predicate hasFlowPath(PathNode source, PathNode sink) { flowsTo(source, sink, _, _, this) } |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * The corresponding paths are generated from the end-points and the graph | ||
| * included in the module `PathGraph`. | ||
| */ | ||
| predicate hasFlowPath(PathNode source, PathNode sink) { flowsTo(source, sink, _, _, this) } |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * | ||
| * To use this in a `path-problem` query, import the module `PartialPathGraph`. | ||
| */ | ||
| final predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * | ||
| * To use this in a `path-problem` query, import the module `PartialPathGraph`. | ||
| */ | ||
| final predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * Note that reverse flow has slightly lower precision than the corresponding | ||
| * forward flow, as reverse flow disregards type pruning among other features. | ||
| */ | ||
| final predicate hasPartialFlowRev(PartialPathNode node, PartialPathNode sink, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * Note that reverse flow has slightly lower precision than the corresponding | ||
| * forward flow, as reverse flow disregards type pruning among other features. | ||
| */ | ||
| final predicate hasPartialFlowRev(PartialPathNode node, PartialPathNode sink, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * Note that reverse flow has slightly lower precision than the corresponding | ||
| * forward flow, as reverse flow disregards type pruning among other features. | ||
| */ | ||
| final predicate hasPartialFlowRev(PartialPathNode node, PartialPathNode sink, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| // TODO: Use separate module once supported for all `prevStage` predicates | ||
| bindingset[node, state, config] | ||
| predicate prevStageRevFlow( | ||
| NodeEx node, FlowState state, boolean toReturn, ApApproxOption returnAp, ApApprox ap, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| // TODO: Use separate module once supported for all `prevStage` predicates | ||
| bindingset[node, state, config] | ||
| predicate prevStageRevFlow( | ||
| NodeEx node, FlowState state, boolean toReturn, ApApproxOption returnAp, ApApprox ap, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
|
|
||
| class ApApprox = PrevStage::Ap; | ||
| predicate prevStageParameterMayFlowThrough( | ||
| ParamNodeEx p, DataFlowCallable c, ApApprox ap, Configuration config |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * The corresponding paths are generated from the end-points and the graph | ||
| * included in the module `PathGraph`. | ||
| */ | ||
| predicate hasFlowPath(PathNode source, PathNode sink) { flowsTo(source, sink, _, _, this) } |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * The corresponding paths are generated from the end-points and the graph | ||
| * included in the module `PathGraph`. | ||
| */ | ||
| predicate hasFlowPath(PathNode source, PathNode sink) { flowsTo(source, sink, _, _, this) } |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * | ||
| * To use this in a `path-problem` query, import the module `PartialPathGraph`. | ||
| */ | ||
| final predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * | ||
| * To use this in a `path-problem` query, import the module `PartialPathGraph`. | ||
| */ | ||
| final predicate hasPartialFlow(PartialPathNode source, PartialPathNode node, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * Note that reverse flow has slightly lower precision than the corresponding | ||
| * forward flow, as reverse flow disregards type pruning among other features. | ||
| */ | ||
| final predicate hasPartialFlowRev(PartialPathNode node, PartialPathNode sink, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| * Note that reverse flow has slightly lower precision than the corresponding | ||
| * forward flow, as reverse flow disregards type pruning among other features. | ||
| */ | ||
| final predicate hasPartialFlowRev(PartialPathNode node, PartialPathNode sink, int dist) { |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| // TODO: Use separate module once supported for all `prevStage` predicates | ||
| bindingset[node, state, config] | ||
| predicate prevStageRevFlow( | ||
| NodeEx node, FlowState state, boolean toReturn, ApApproxOption returnAp, ApApprox ap, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| // TODO: Use separate module once supported for all `prevStage` predicates | ||
| bindingset[node, state, config] | ||
| predicate prevStageRevFlow( | ||
| NodeEx node, FlowState state, boolean toReturn, ApApproxOption returnAp, ApApprox ap, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
|
|
||
| class ApApprox = PrevStage::Ap; | ||
| predicate prevStageParameterMayFlowThrough( | ||
| ParamNodeEx p, DataFlowCallable c, ApApprox ap, Configuration config |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
| predicate prevStageReadStepCand(NodeEx n1, Content c, NodeEx n2, Configuration config); | ||
|
|
||
| predicate prevStageStoreStepCand( | ||
| NodeEx node1, ApApprox ap1, TypedContent tc, NodeEx node2, DataFlowType contentType, |
Check warning
Code scanning / CodeQL
Consistency predicate that should be empty
|
Superseded by #9823. |
No description provided.