RegionStore.txt 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  1. The analyzer "Store" represents the contents of memory regions. It is an opaque
  2. functional data structure stored in each ProgramState; the only class that can
  3. modify the store is its associated StoreManager.
  4. Currently (Feb. 2013), the only StoreManager implementation being used is
  5. RegionStoreManager. This store records bindings to memory regions using a "base
  6. region + offset" key. (This allows `*p` and `p[0]` to map to the same location,
  7. among other benefits.)
  8. Regions are grouped into "clusters", which roughly correspond to "regions with
  9. the same base region". This allows certain operations to be more efficient,
  10. such as invalidation.
  11. Regions that do not have a known offset use a special "symbolic" offset. These
  12. keys store both the original region, and the "concrete offset region" -- the
  13. last region whose offset is entirely concrete. (For example, in the expression
  14. `foo.bar[1][i].baz`, the concrete offset region is the array `foo.bar[1]`,
  15. since that has a known offset from the start of the top-level `foo` struct.)
  16. Binding Invalidation
  17. ====================
  18. Supporting both concrete and symbolic offsets makes things a bit tricky. Here's
  19. an example:
  20. foo[0] = 0;
  21. foo[1] = 1;
  22. foo[i] = i;
  23. After the third assignment, nothing can be said about the value of `foo[0]`,
  24. because `foo[i]` may have overwritten it! Thus, *binding to a region with a
  25. symbolic offset invalidates the entire concrete offset region.* We know
  26. `foo[i]` is somewhere within `foo`, so we don't have to invalidate anything
  27. else, but we do have to be conservative about all other bindings within `foo`.
  28. Continuing the example:
  29. foo[i] = i;
  30. foo[0] = 0;
  31. After this latest assignment, nothing can be said about the value of `foo[i]`,
  32. because `foo[0]` may have overwritten it! *Binding to a region R with a
  33. concrete offset invalidates any symbolic offset bindings whose concrete offset
  34. region is a super-region **or** sub-region of R.* All we know about `foo[i]` is
  35. that it is somewhere within `foo`, so changing *anything* within `foo` might
  36. change `foo[i]`, and changing *all* of `foo` (or its base region) will
  37. *definitely* change `foo[i]`.
  38. This logic could be improved by using the current constraints on `i`, at the
  39. cost of speed. The latter case could also be improved by matching region kinds,
  40. i.e. changing `foo[0].a` is unlikely to affect `foo[i].b`, no matter what `i`
  41. is.
  42. For more detail, read through RegionStoreManager::removeSubRegionBindings in
  43. RegionStore.cpp.
  44. ObjCIvarRegions
  45. ===============
  46. Objective-C instance variables require a bit of special handling. Like struct
  47. fields, they are not base regions, and when their parent object region is
  48. invalidated, all the instance variables must be invalidated as well. However,
  49. they have no concrete compile-time offsets (in the modern, "non-fragile"
  50. runtime), and so cannot easily be represented as an offset from the start of
  51. the object in the analyzer. Moreover, this means that invalidating a single
  52. instance variable should *not* invalidate the rest of the object, since unlike
  53. struct fields or array elements there is no way to perform pointer arithmetic
  54. to access another instance variable.
  55. Consequently, although the base region of an ObjCIvarRegion is the entire
  56. object, RegionStore offsets are computed from the start of the instance
  57. variable. Thus it is not valid to assume that all bindings with non-symbolic
  58. offsets start from the base region!
  59. Region Invalidation
  60. ===================
  61. Unlike binding invalidation, region invalidation occurs when the entire
  62. contents of a region may have changed---say, because it has been passed to a
  63. function the analyzer can model, like memcpy, or because its address has
  64. escaped, usually as an argument to an opaque function call. In these cases we
  65. need to throw away not just all bindings within the region itself, but within
  66. its entire cluster, since neighboring regions may be accessed via pointer
  67. arithmetic.
  68. Region invalidation typically does even more than this, however. Because it
  69. usually represents the complete escape of a region from the analyzer's model,
  70. its *contents* must also be transitively invalidated. (For example, if a region
  71. 'p' of type 'int **' is invalidated, the contents of '*p' and '**p' may have
  72. changed as well.) The algorithm that traverses this transitive closure of
  73. accessible regions is known as ClusterAnalysis, and is also used for finding
  74. all live bindings in the store (in order to throw away the dead ones). The name
  75. "ClusterAnalysis" predates the cluster-based organization of bindings, but
  76. refers to the same concept: during invalidation and liveness analysis, all
  77. bindings within a cluster must be treated in the same way for a conservative
  78. model of program behavior.
  79. Default Bindings
  80. ================
  81. Most bindings in RegionStore are simple scalar values -- integers and pointers.
  82. These are known as "Direct" bindings. However, RegionStore supports a second
  83. type of binding called a "Default" binding. These are used to provide values to
  84. all the elements of an aggregate type (struct or array) without having to
  85. explicitly specify a binding for each individual element.
  86. When there is no Direct binding for a particular region, the store manager
  87. looks at each super-region in turn to see if there is a Default binding. If so,
  88. this value is used as the value of the original region. The search ends when
  89. the base region is reached, at which point the RegionStore will pick an
  90. appropriate default value for the region (usually a symbolic value, but
  91. sometimes zero, for static data, or "uninitialized", for stack variables).
  92. int manyInts[10];
  93. manyInts[1] = 42; // Creates a Direct binding for manyInts[1].
  94. print(manyInts[1]); // Retrieves the Direct binding for manyInts[1];
  95. print(manyInts[0]); // There is no Direct binding for manyInts[1].
  96. // Is there a Default binding for the entire array?
  97. // There is not, but it is a stack variable, so we use
  98. // "uninitialized" as the default value (and emit a
  99. // diagnostic!).
  100. NOTE: The fact that bindings are stored as a base region plus an offset limits
  101. the Default Binding strategy, because in C aggregates can contain other
  102. aggregates. In the current implementation of RegionStore, there is no way to
  103. distinguish a Default binding for an entire aggregate from a Default binding
  104. for the sub-aggregate at offset 0.
  105. Lazy Bindings (LazyCompoundVal)
  106. ===============================
  107. RegionStore implements an optimization for copying aggregates (structs and
  108. arrays) called "lazy bindings", implemented using a special SVal called
  109. LazyCompoundVal. When the store is asked for the "binding" for an entire
  110. aggregate (i.e. for an lvalue-to-rvalue conversion), it returns a
  111. LazyCompoundVal instead. When this value is then stored into a variable, it is
  112. bound as a Default value. This makes copying arrays and structs much cheaper
  113. than if they had required memberwise access.
  114. Under the hood, a LazyCompoundVal is implemented as a uniqued pair of (region,
  115. store), representing "the value of the region during this 'snapshot' of the
  116. store". This has important implications for any sort of liveness or
  117. reachability analysis, which must take the bindings in the old store into
  118. account.
  119. Retrieving a value from a lazy binding happens in the same way as any other
  120. Default binding: since there is no direct binding, the store manager falls back
  121. to super-regions to look for an appropriate default binding. LazyCompoundVal
  122. differs from a normal default binding, however, in that it contains several
  123. different values, instead of one value that will appear several times. Because
  124. of this, the store manager has to reconstruct the subregion chain on top of the
  125. LazyCompoundVal region, and look up *that* region in the previous store.
  126. Here's a concrete example:
  127. CGPoint p;
  128. p.x = 42; // A Direct binding is made to the FieldRegion 'p.x'.
  129. CGPoint p2 = p; // A LazyCompoundVal is created for 'p', along with a
  130. // snapshot of the current store state. This value is then
  131. // used as a Default binding for the VarRegion 'p2'.
  132. return p2.x; // The binding for FieldRegion 'p2.x' is requested.
  133. // There is no Direct binding, so we look for a Default
  134. // binding to 'p2' and find the LCV.
  135. // Because it's an LCV, we look at our requested region
  136. // and see that it's the '.x' field. We ask for the value
  137. // of 'p.x' within the snapshot, and get back 42.