aboutsummaryrefslogtreecommitdiff
path: root/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2010-02-25 07:45:24 +0000
committerChris Lattner <sabre@nondot.org>2010-02-25 07:45:24 +0000
commit04db82d2ba5d9d8e935de82a465b1de5ea7cdf69 (patch)
tree8b5565b609fdc60ab65dbf3db844ac2d950b83d2 /lib/Bitcode/Reader/BitcodeReader.cpp
parent85669637139089eaed8def1583ac04266c9654e2 (diff)
Implement the first half of redundancy factoring: efficiently
splitting all the patterns under scope nodes into equality sets based on their first node. The second step is to rewrite the graph info a form that exposes the sharing. Before I do this, I want to redesign the Scope node. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@97130 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions