aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Bitcode
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
commitcd632fb0570fd33ef3bff6d2b8c348de285d7d30 (patch)
tree8b5565b609fdc60ab65dbf3db844ac2d950b83d2 /lib/Bitcode
parent8eb9f25b0ae3cacfa4d199d1ad2db0cd78672ec9 (diff)
downloadexternal_llvm-cd632fb0570fd33ef3bff6d2b8c348de285d7d30.zip
external_llvm-cd632fb0570fd33ef3bff6d2b8c348de285d7d30.tar.gz
external_llvm-cd632fb0570fd33ef3bff6d2b8c348de285d7d30.tar.bz2
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')
0 files changed, 0 insertions, 0 deletions