X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FAliasAnalysis.html;h=6663f0caa75fb1d7f1a4b49ca24c8225872677fa;hb=0f4012f4759a6c6ca28f11ed1eb98feb8ab1481b;hp=748b3cb30eb9c958fb426ffeefe6276849153cef;hpb=d6e0dd1db6c54aab3f76c4189686a881616f73c1;p=oota-llvm.git diff --git a/docs/AliasAnalysis.html b/docs/AliasAnalysis.html index 748b3cb30eb..6663f0caa75 100644 --- a/docs/AliasAnalysis.html +++ b/docs/AliasAnalysis.html @@ -50,6 +50,7 @@ implementations +
  • Memory Dependence Analysis
  • @@ -947,6 +948,24 @@ algorithm will have a lower number of may aliases).

    + +
    + Memory Dependence Analysis +
    + + +
    + +

    If you're just looking to be a client of alias analysis information, consider +using the Memory Dependence Analysis interface instead. MemDep is a lazy, +caching layer on top of alias analysis that is able to answer the question of +what preceding memory operations a given instruction depends on, either at an +intra- or inter-block level. Because of its laziness and caching +policy, using MemDep can be a significant performance win over accessing alias +analysis directly.

    + +
    +