|
| 1 | +import semmle.code.cpp.ir.dataflow.DataFlow |
| 2 | +import semmle.code.cpp.ir.dataflow.DataFlow2 |
| 3 | + |
| 4 | +module ProductFlow { |
| 5 | + abstract class Configuration extends string { |
| 6 | + bindingset[this] |
| 7 | + Configuration() { any() } |
| 8 | + |
| 9 | + /** |
| 10 | + * Holds if `(source1, source2)` is a relevant data flow source. |
| 11 | + * |
| 12 | + * `source1` and `source2` must belong to the same callable. |
| 13 | + */ |
| 14 | + abstract predicate isSourcePair(DataFlow::Node source1, DataFlow::Node source2); |
| 15 | + |
| 16 | + /** |
| 17 | + * Holds if `(sink1, sink2)` is a relevant data flow sink. |
| 18 | + * |
| 19 | + * `sink1` and `sink2` must belong to the same callable. |
| 20 | + */ |
| 21 | + abstract predicate isSinkPair(DataFlow::Node sink1, DataFlow::Node sink2); |
| 22 | + |
| 23 | + predicate hasFlowPath( |
| 24 | + DataFlow::PathNode source1, DataFlow2::PathNode source2, DataFlow::PathNode sink1, |
| 25 | + DataFlow2::PathNode sink2 |
| 26 | + ) { |
| 27 | + reachable(this, source1, source2, sink1, sink2) |
| 28 | + } |
| 29 | + } |
| 30 | + |
| 31 | + private import Internal |
| 32 | + |
| 33 | + module Internal { |
| 34 | + class Conf1 extends DataFlow::Configuration { |
| 35 | + Conf1() { this = "Conf1" } |
| 36 | + |
| 37 | + override predicate isSource(DataFlow::Node source) { |
| 38 | + exists(Configuration conf | conf.isSourcePair(source, _)) |
| 39 | + } |
| 40 | + |
| 41 | + override predicate isSink(DataFlow::Node sink) { |
| 42 | + exists(Configuration conf | conf.isSinkPair(sink, _)) |
| 43 | + } |
| 44 | + } |
| 45 | + |
| 46 | + class Conf2 extends DataFlow2::Configuration { |
| 47 | + Conf2() { this = "Conf2" } |
| 48 | + |
| 49 | + override predicate isSource(DataFlow::Node source) { |
| 50 | + exists(Configuration conf, DataFlow::Node source1 | |
| 51 | + conf.isSourcePair(source1, source) and |
| 52 | + any(Conf1 c).hasFlow(source1, _) |
| 53 | + ) |
| 54 | + } |
| 55 | + |
| 56 | + override predicate isSink(DataFlow::Node sink) { |
| 57 | + exists(Configuration conf, DataFlow::Node sink1 | |
| 58 | + conf.isSinkPair(sink1, sink) and any(Conf1 c).hasFlow(_, sink1) |
| 59 | + ) |
| 60 | + } |
| 61 | + } |
| 62 | + } |
| 63 | + |
| 64 | + private predicate reachableInterprocEntry( |
| 65 | + Configuration conf, DataFlow::PathNode source1, DataFlow2::PathNode source2, |
| 66 | + DataFlow::PathNode node1, DataFlow2::PathNode node2 |
| 67 | + ) { |
| 68 | + conf.isSourcePair(node1.getNode(), node2.getNode()) and |
| 69 | + node1 = source1 and |
| 70 | + node2 = source2 |
| 71 | + or |
| 72 | + exists( |
| 73 | + DataFlow::PathNode midEntry1, DataFlow2::PathNode midEntry2, DataFlow::PathNode midExit1, |
| 74 | + DataFlow2::PathNode midExit2 |
| 75 | + | |
| 76 | + reachableInterprocEntry(conf, source1, source2, midEntry1, midEntry2) and |
| 77 | + interprocEdgePair(midExit1, midExit2, node1, node2) and |
| 78 | + localPathStep1*(midEntry1, midExit1) and |
| 79 | + localPathStep2*(midEntry2, midExit2) |
| 80 | + ) |
| 81 | + } |
| 82 | + |
| 83 | + private predicate localPathStep1(DataFlow::PathNode pred, DataFlow::PathNode succ) { |
| 84 | + DataFlow::PathGraph::edges(pred, succ) and |
| 85 | + pragma[only_bind_out](pred.getNode().getEnclosingCallable()) = |
| 86 | + pragma[only_bind_out](succ.getNode().getEnclosingCallable()) |
| 87 | + } |
| 88 | + |
| 89 | + private predicate localPathStep2(DataFlow2::PathNode pred, DataFlow2::PathNode succ) { |
| 90 | + DataFlow2::PathGraph::edges(pred, succ) and |
| 91 | + pragma[only_bind_out](pred.getNode().getEnclosingCallable()) = |
| 92 | + pragma[only_bind_out](succ.getNode().getEnclosingCallable()) |
| 93 | + } |
| 94 | + |
| 95 | + pragma[nomagic] |
| 96 | + private predicate interprocEdge1( |
| 97 | + Declaration predDecl, Declaration succDecl, DataFlow::PathNode pred1, DataFlow::PathNode succ1 |
| 98 | + ) { |
| 99 | + DataFlow::PathGraph::edges(pred1, succ1) and |
| 100 | + predDecl != succDecl and |
| 101 | + pred1.getNode().getEnclosingCallable() = predDecl and |
| 102 | + succ1.getNode().getEnclosingCallable() = succDecl |
| 103 | + } |
| 104 | + |
| 105 | + pragma[nomagic] |
| 106 | + private predicate interprocEdge2( |
| 107 | + Declaration predDecl, Declaration succDecl, DataFlow2::PathNode pred2, DataFlow2::PathNode succ2 |
| 108 | + ) { |
| 109 | + DataFlow2::PathGraph::edges(pred2, succ2) and |
| 110 | + predDecl != succDecl and |
| 111 | + pred2.getNode().getEnclosingCallable() = predDecl and |
| 112 | + succ2.getNode().getEnclosingCallable() = succDecl |
| 113 | + } |
| 114 | + |
| 115 | + private predicate interprocEdgePair( |
| 116 | + DataFlow::PathNode pred1, DataFlow2::PathNode pred2, DataFlow::PathNode succ1, |
| 117 | + DataFlow2::PathNode succ2 |
| 118 | + ) { |
| 119 | + exists(Declaration predDecl, Declaration succDecl | |
| 120 | + interprocEdge1(predDecl, succDecl, pred1, succ1) and |
| 121 | + interprocEdge2(predDecl, succDecl, pred2, succ2) |
| 122 | + ) |
| 123 | + } |
| 124 | + |
| 125 | + private predicate reachable( |
| 126 | + Configuration conf, DataFlow::PathNode source1, DataFlow2::PathNode source2, |
| 127 | + DataFlow::PathNode sink1, DataFlow2::PathNode sink2 |
| 128 | + ) { |
| 129 | + exists(DataFlow::PathNode mid1, DataFlow2::PathNode mid2 | |
| 130 | + reachableInterprocEntry(conf, source1, source2, mid1, mid2) and |
| 131 | + conf.isSinkPair(sink1.getNode(), sink2.getNode()) and |
| 132 | + localPathStep1*(mid1, sink1) and |
| 133 | + localPathStep2*(mid2, sink2) |
| 134 | + ) |
| 135 | + } |
| 136 | +} |
0 commit comments