Displaying 16 results from an estimated 16 matches for "end8".
Did you mean:
end
2013 Aug 16
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...tr inbounds i8** %argv, i64 1
>> %0 = load i8** %arrayidx, align 8
>> %call = tail call i32 (i8*, ...)* bitcast (i32 (...)* @atoi to i32 (i8*,
>> ...)*)(i8* %0) #3
>> %cmp117 = icmp sgt i32 %call, 0
>> br i1 %cmp117, label %for.cond2.preheader.lr.ph, label %for.end8
>> for.cond2.preheader.lr.ph:
>> %cond22 = phi i32 [ %call, %cond.end ], [ 46, %entry ]
>> %cmp314 = icmp sgt i32 %cond22, 0
>> br label %for.cond2.preheader
>> for.cond2.preheader:
>> %x.019 = phi i32 [ 0, %for.cond2.preheader.lr.ph ], [ %x.1.lcssa,
>...
2013 Aug 15
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...rayidx = getelementptr inbounds i8** %argv, i64 1
> %0 = load i8** %arrayidx, align 8
> %call = tail call i32 (i8*, ...)* bitcast (i32 (...)* @atoi to i32 (i8*,
> ...)*)(i8* %0) #3
> %cmp117 = icmp sgt i32 %call, 0
> br i1 %cmp117, label %for.cond2.preheader.lr.ph, label %for.end8
> for.cond2.preheader.lr.ph:
> %cond22 = phi i32 [ %call, %cond.end ], [ 46, %entry ]
> %cmp314 = icmp sgt i32 %cond22, 0
> br label %for.cond2.preheader
> for.cond2.preheader:
> %x.019 = phi i32 [ 0, %for.cond2.preheader.lr.ph ], [ %x.1.lcssa,
> %for.inc6 ]
> %a.0...
2013 Aug 16
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...;>> %0 = load i8** %arrayidx, align 8
>>> %call = tail call i32 (i8*, ...)* bitcast (i32 (...)* @atoi to i32
>>> (i8*,
>>> ...)*)(i8* %0) #3
>>> %cmp117 = icmp sgt i32 %call, 0
>>> br i1 %cmp117, label %for.cond2.preheader.lr.ph, label %for.end8
>>> for.cond2.preheader.lr.ph:
>>> %cond22 = phi i32 [ %call, %cond.end ], [ 46, %entry ]
>>> %cmp314 = icmp sgt i32 %cond22, 0
>>> br label %for.cond2.preheader
>>> for.cond2.preheader:
>>> %x.019 = phi i32 [ 0, %for.cond2.preheader.lr....
2013 Jul 03
2
[LLVMdev] [Polly] Assert in Scope construction
...preds = %for.inc,
> %entry.split
> %j.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.inc ]
> %cmp3 = icmp sgt i32 %j.0, 2
> %cmp5 = icmp eq i32 %j.0, 1
> %or.cond13 = or i1 %cmp3, %cmp5
> store i32 %j.0, i32* %j.0.lcssa.reg2mem, align 8
> br i1 %or.cond13, label %for.end8, label %for.inc,
> !llvm.listen.preserve.while.opt !0
>
> for.inc: ; preds = %for.cond2
> %inc = add nsw i32 %j.0, 1
> br label %for.cond2
>
> for.end8: ; preds = %for.cond2
> %j.0.lcssa...
2013 Aug 15
4
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...%arrayidx = getelementptr inbounds i8** %argv, i64 1
%0 = load i8** %arrayidx, align 8
%call = tail call i32 (i8*, ...)* bitcast (i32 (...)* @atoi to i32 (i8*, ...)*)(i8* %0) #3
%cmp117 = icmp sgt i32 %call, 0
br i1 %cmp117, label %for.cond2.preheader.lr.ph, label %for.end8
for.cond2.preheader.lr.ph:
%cond22 = phi i32 [ %call, %cond.end ], [ 46, %entry ]
%cmp314 = icmp sgt i32 %cond22, 0
br label %for.cond2.preheader
for.cond2.preheader:
%x.019 = phi i32 [ 0, %for.cond2.preheader.lr.ph ], [ %x.1.lcssa, %for.inc...
2018 Jun 29
2
Cleaning up ‘br i1 false’ cases in CodeGenPrepare
...opy.exit33
copy.exit33: ; preds = %cond.true8.i27, %cond.false.i29, %cond.false9.i31
%.pre-phi49 = phi i1 [ true, %cond.true8.i27 ], [ true, %cond.false.i29 ], [ false, %cond.false9.i31 ]
%6 = icmp ne i8* %py_src, null
br i1 %6, label %cond.true.i38, label %if.end8
cond.true.i38: ; preds = %copy.exit33
br i1 %.pre-phi49, label %cond.true5.i40, label %cond.false9.i45
cond.true5.i40: ; preds = %cond.true.i38
%7 = trunc i64 %conv to i32
%cmp6.i39 = icmp ugt i32 %7, 16
br i1 %cmp6.i3...
2013 Jul 05
0
[LLVMdev] [Polly] Assert in Scope construction
...split
> > %j.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.inc ]
> > %cmp3 = icmp sgt i32 %j.0, 2
> > %cmp5 = icmp eq i32 %j.0, 1
> > %or.cond13 = or i1 %cmp3, %cmp5
> > store i32 %j.0, i32* %j.0.lcssa.reg2mem, align 8
> > br i1 %or.cond13, label %for.end8, label %for.inc,
> > !llvm.listen.preserve.while.opt !0
> >
> > for.inc: ; preds = %for.cond2
> > %inc = add nsw i32 %j.0, 1
> > br label %for.cond2
> >
> > for.end8: ; pre...
2013 Nov 08
1
[LLVMdev] loop vectorizer and storing to uniform addresses
...4* %start.addr, align 8
store i64 %1, i64* %i, align 8
br label %for.cond
for.cond: ; preds = %for.inc6,
%entry
%2 = load i64* %i, align 8
%3 = load i64* %end.addr, align 8
%cmp = icmp slt i64 %2, %3
br i1 %cmp, label %for.body, label %for.end8
for.body: ; preds = %for.cond
store i64 0, i64* %q, align 8
br label %for.cond1
for.cond1: ; preds = %for.inc,
%for.body
%4 = load i64* %q, align 8
%cmp2 = icmp slt i64 %4, 4
br i1 %cmp2, label %for.bod...
2013 Jul 02
0
[LLVMdev] [LNT] Question about results reliability in LNT infrustructure
On 07/01/2013 09:41 AM, Renato Golin wrote:
> On 1 July 2013 02:02, Chris Matthews <chris.matthews at apple.com> wrote:
>
>> One thing that LNT is doing to help “smooth” the results for you is by
>> presenting the min of the data at a particular revision, which (hopefully)
>> is approximating the actual runtime without noise.
>>
>
> That's an
2013 Nov 08
0
[LLVMdev] loop vectorizer and storing to uniform addresses
On 7 November 2013 17:18, Frank Winter <fwinter at jlab.org> wrote:
> LV: We don't allow storing to uniform addresses
>
This is triggering because it didn't recognize as a reduction variable
during the canVectorizeInstrs() but did recognize that sum[q] is loop
invariant in canVectorizeMemory().
I'm guessing the nested loop was unrolled because of the low trip-count,
and
2013 Jul 01
2
[LLVMdev] [LNT] Question about results reliability in LNT infrustructure
On 1 July 2013 02:02, Chris Matthews <chris.matthews at apple.com> wrote:
> One thing that LNT is doing to help “smooth” the results for you is by
> presenting the min of the data at a particular revision, which (hopefully)
> is approximating the actual runtime without noise.
>
That's an interesting idea, as you said, if you run multiple times on every
revision.
On ARM,
2013 Nov 08
3
[LLVMdev] loop vectorizer and storing to uniform addresses
I am trying my luck on this global reduction kernel:
float foo( int start , int end , float * A )
{
float sum[4] = {0.,0.,0.,0.};
for (int i = start ; i < end ; ++i ) {
for (int q = 0 ; q < 4 ; ++q )
sum[q] += A[i*4+q];
}
return sum[0]+sum[1]+sum[2]+sum[3];
}
LV: Checking a loop in "foo"
LV: Found a loop: for.cond1
LV: Found an induction variable.
LV: We
2012 Aug 20
3
[LLVMdev] Problem with "Does not dominate all uses"
...n function '@safer_k64_setup'
make: *** [src/ciphers/safer/safer.o] Aborted
So the problem come from the bloc if.end11 and cond.end. I understand the dominate problem, but the thing is that these instruction (in first file):
if.end11: ; preds = %if.end8
%6 = load i8** %key.addr, align 8, !dbg !322
%7 = load i8** %key.addr, align 8, !dbg !322
...
cond.end: ; preds = %cond.false, %cond.true
%cond.reload = load i32* %cond.reg2mem
%10 = load %union.Symmetric_key** %skey.addr, align 8, !dbg !322
%sa...
2012 Aug 20
0
[LLVMdev] Problem with "Does not dominate all uses"
...up'
> make: *** [src/ciphers/safer/safer.o] Aborted
>
>
> So the problem come from the bloc if.end11 and cond.end. I understand the dominate problem, but the thing is that these instruction (in first file):
>
> if.end11: ; preds = %if.end8
> %6 = load i8** %key.addr, align 8, !dbg !322
> %7 = load i8** %key.addr, align 8, !dbg !322
> ...
>
> cond.end: ; preds = %cond.false, %cond.true
> %cond.reload = load i32* %cond.reg2mem
> %10 = load %union.Symmetric_key** %skey....
2020 Nov 13
0
Question about LLVM region analysis
...nalyze region.ll" I got:
```
Printing analysis 'Detect single entry single exit regions' for
function 'split':
Region tree:
[0] entry => <Function Return>
[1] entry => if.end9
[2] for.cond => for.end
[3] for.body => if.end
[2] if.else => if.end8
End region tree
```
LLVM uses "for.cond" as the entry and "for.end" as the exit, but there
is a loop preheader block before "for.cond" named "if.then", using
"if.then" as the entry can still get a legal region. So I wonder why
LLVM does not contain...
2013 Aug 16
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...rrayidx = getelementptr inbounds i8** %argv, i64 1
> %0 = load i8** %arrayidx, align 8
> %call = tail call i32 (i8*, ...)* bitcast (i32 (...)* @atoi to i32 (i8*, ...)*)(i8* %0) #3
> %cmp117 = icmp sgt i32 %call, 0
> br i1 %cmp117, label %for.cond2.preheader.lr.ph, label %for.end8
> for.cond2.preheader.lr.ph:
> %cond22 = phi i32 [ %call, %cond.end ], [ 46, %entry ]
> %cmp314 = icmp sgt i32 %cond22, 0
> br label %for.cond2.preheader
> for.cond2.preheader:
> %x.019 = phi i32 [ 0, %for.cond2.preheader.lr.ph ], [ %x.1.lcssa, %for.inc6 ]
> %a.0...