@@ -34,20 +34,20 @@ signature module InputSig {
34
34
}
35
35
36
36
/**
37
- * A node in the data flow graph that represents an output.
37
+ * A node in the data flow graph that represents an output of a call .
38
38
*/
39
39
class OutNode extends Node ;
40
40
41
41
/**
42
- * A node in the data flow graph representing the value of an argument after
43
- * an operation that might have changed its state. For example, consider the
44
- * following C++ code:
42
+ * A node in the data flow graph representing the value of some other node
43
+ * after an operation that might have changed its state. A typical example is
44
+ * an argument, which may have been modified by the callee. For example,
45
+ * consider the following code calling a setter method:
45
46
* ```
46
- * int a = 1;
47
- * increment(&a);
47
+ * x.setFoo(y);
48
48
* ```
49
- * The post-update node for `&a` represents the value of `&a` after
50
- * modification by the call to `increment` .
49
+ * The post-update node for the argument node `x` is the node representing the
50
+ * value of `x` after the field `foo` has been updated .
51
51
*/
52
52
class PostUpdateNode extends Node {
53
53
/**
@@ -206,9 +206,8 @@ signature module InputSig {
206
206
predicate parameterMatch ( ParameterPosition ppos , ArgumentPosition apos ) ;
207
207
208
208
/**
209
- * Holds if there is a simple local flow step from `node1` to `node2`. This
210
- * is the local flow predicate that's used as a building block in global
211
- * data flow. It may have less flow than the `localFlowStep` predicate.
209
+ * Holds if there is a simple local flow step from `node1` to `node2`. These
210
+ * are the value-preserving intra-callable flow steps.
212
211
*/
213
212
predicate simpleLocalFlowStep ( Node node1 , Node node2 ) ;
214
213
0 commit comments