Changes between Version 11 and Version 12 of AliasAnalysis
- Timestamp:
- 04/26/16 13:11:15 (10 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
AliasAnalysis
v11 v12 55 55 Suppose `p0` is the process executes the main function, and `p1` is the spawned process that executes `f`. 56 56 57 Then the alias result of statements `s0` and `s1` would be:57 Then the alias analysis result of statements `s0` and `s1` would be: 58 58 59 59 `O(p, s0)={x}` … … 62 62 and 63 63 `OR(p, s0)={x}` 64 `OR( 1, s1)={y}`64 `OR(q, s1)={y}` 65 65 66 66 Suppose the current state is `S=(p0: s0, p1:s1)`, i.e., the enable statement of `p0` and `p1` is `s0` and `s1`, respectively. Since we know **statically** that `O(p, s0)` never intersect with `O(q, s1)`, then we know that `s0` and `s1` commute. So the ample set at `S` is either `{p0}` or `{p1}`. … … 89 89 } 90 90 }}} 91 92 alias analysis result: 91 93 92 94 `O(p, s0')={}`\\ … … 119 121 120 122 121
