X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2FAliasAnalysis.html;h=6663f0caa75fb1d7f1a4b49ca24c8225872677fa;hb=0f4012f4759a6c6ca28f11ed1eb98feb8ab1481b;hp=b1163e0633bd128faf74836b428cca4c454b299b;hpb=8036ca47e27c22055cf8d708358b2e48b2a63e3b;p=oota-llvm.git diff --git a/docs/AliasAnalysis.html b/docs/AliasAnalysis.html index b1163e0633b..6663f0caa75 100644 --- a/docs/AliasAnalysis.html +++ b/docs/AliasAnalysis.html @@ -50,6 +50,7 @@ implementations +
  • Memory Dependence Analysis
  • @@ -755,6 +756,9 @@ field-sensitive" version of Steensgaard's algorithm using the Data Structure Analysis framework. This gives it substantially more precision than the standard algorithm while maintaining excellent analysis scalability.

    +

    Note that -steens-aa is available in the optional "poolalloc" +module, it is not part of the LLVM core.

    +
    @@ -775,6 +779,9 @@ queries, and can provide context-sensitive mod/ref information as well. The only major facility not implemented so far is support for must-alias information.

    +

    Note that -ds-aa is available in the optional "poolalloc" +module, it is not part of the LLVM core.

    + @@ -941,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.

    + +
    +