4 Commits

Author	SHA1	Message	Date
Owen Anderson	b05a1d116f	Revert my previous patch to ABCD and fix things the right way. There are two problems addressed ... here: 1) We need to avoid processing sigma nodes as phi nodes for constraint generation. 2) We need to generate constraints for comparisons against constants properly. This includes our first working ABCD test! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86498 91177308-0d34-0410-b5e6-96231b3b80d8	2009-11-09 00:44:44 +00:00
Owen Anderson	9feeeaf9ed	Fix an issue where the ordering of blocks within a function could lead to different constraint ... graphs being produced. The cause was that we were incorrectly marking sigma instructions as processed after handling the sigma-specific constraints for them, potentially neglecting to process them as normal instructions as well. Unfortunately, the testcase that inspired this still doesn't work because of a bug in the solver, which is next on the list to debug. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@86486 91177308-0d34-0410-b5e6-96231b3b80d8	2009-11-08 22:36:55 +00:00
Nick Lewycky	abbe42e136	Apply some cleanups. No functionality changes. ... git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@85498 91177308-0d34-0410-b5e6-96231b3b80d8	2009-10-29 07:35:15 +00:00
Nick Lewycky	40cc524ede	Add ABCD, a generalized implementation of the Elimination of Array Bounds ... Checks on Demand algorithm which looks at arbitrary branches instead of loop iterations. This is GSoC work by Andre Tavares with only editorial changes applied! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@85382 91177308-0d34-0410-b5e6-96231b3b80d8	2009-10-28 07:03:15 +00:00