Displaying 2 results from an estimated 2 matches for "processequality".
2015 Jan 15
2
[LLVMdev] generate llvm.assume calls in GVN?
...b == 5:
if c == 3:
print a # replace 'a' with 8
which requires that it solve a bidirectional dataflow problem. It also knew
that a < b implied b > 0, and a < b < c implies that c > 1. Some of the
things predsimplify used to do are now implemented inside gvn's
processEquality. Predsimplify also had an odd trick:
a = phi [0, a.i]
b = phi [10, x]
if a == 1:
# here we know that b == x. (x could still equal 10 though.)
which I haven't seen replicated elsewhere in llvm.
I went through many iterations of the implementation trying to minimize the
compile time...
2015 Jan 15
2
[LLVMdev] generate llvm.assume calls in GVN?
Would it be wrong to generate the llvm.assume IR suggested below? in GVN?
Given more info via the AssumptionCache, InstCombine can then do more
optimizing.
On Thu, Dec 4, 2014 at 12:10 PM, Philip Reames <listmail at philipreames.com>
wrote:
>
> On 12/04/2014 02:19 AM, Lars Rasmusson SICS wrote:
>
> Hi,
>
> I'm compiling a large code base that uses tagged data, with