Displaying 8 results from an estimated 8 matches for "_z3fooi".
Did you mean:
_z3foov
2016 Sep 16
2
SCEV cannot compute the trip count of Simple loop
...for (p = x+3 ; p<= x+6 ;p++)
mat[x][p][i] = mat[x][p][i] + 5;
}
For a quick reference I have added the generated IR compiled with clang using -O3.
Please let me know if this is an known issue in SCEV or I am missing something here ?
; Function Attrs: nounwind readnone uwtable
define void @_Z3fooi(i32 %x) local_unnamed_addr #0 {
entry:
%mat = alloca [6 x [6 x [6 x i32]]], align 16
%0 = bitcast [6 x [6 x [6 x i32]]]* %mat to i8*
call void @llvm.lifetime.start(i64 864, i8* %0) #2
%add = add nsw i32 %x, 3
%add1 = add nsw i32 %x, 6
%idxprom3 = sext i32 %x to i64
%1 = sext i32 %add...
2016 Sep 16
3
SCEV cannot compute the trip count of Simple loop
...for (p = x+3 ; p<= x+6 ;p++)
mat[x][p][i] = mat[x][p][i] + 5;
}
For a quick reference I have added the generated IR compiled with clang using –O3.
Please let me know if this is an known issue in SCEV or I am missing something here ?
; Function Attrs: nounwind readnone uwtable
define void @_Z3fooi(i32 %x) local_unnamed_addr #0 {
entry:
%mat = alloca [6 x [6 x [6 x i32]]], align 16
%0 = bitcast [6 x [6 x [6 x i32]]]* %mat to i8*
call void @llvm.lifetime.start(i64 864, i8* %0) #2
%add = add nsw i32 %x, 3
%add1 = add nsw i32 %x, 6
%idxprom3 = sext i32 %x to i64
%1 = sext i32 %add...
2012 Feb 25
3
[LLVMdev] Missed optimization on array initialization
...; ModuleID = '/tmp/webcompile/_11079_0.bc'
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"
define void @_Z3fooi(i32 %a) uwtable {
%ar =alloca [100 xi32],align 16
%1 =bitcast [100 xi32]* %arto i8*
call void @llvm.memset.p0i8.i64(i8* %1,i8 0,i64 400,i32 16,i1 false)
%2 =getelementptr inbounds [100 xi32]* %ar,i64 0,i64 0
store i32 %a,i32* %2,align 16, !tbaa !0
%3 =icmp eq i3...
2019 Aug 07
2
Status of the New Pass Manager
On 8/7/19 6:20 PM, Hiroshi Yamauchi wrote:
> I basically run "clang
> -fexperimental-new-pass-manager -print-after-all ..."
>
> It's conceivable that something is different in our setup or in clang
> (from opt)... I'll see if I can reproduce it outside our setup.
Does it depend on machine architecture?
I generally use x86...
regards,
Fedor.
>
> Thanks.
2005 May 04
3
[LLVMdev] Simplifying boolean expressions
...target endian = little
target pointersize = 32
target triple = "i686-pc-linux-gnu"
deplibs = [ "stdc++", "c", "crtend" ]
%i = external global int ; <int*> [#uses=2]
%j = external global int ; <int*> [#uses=3]
implementation ; Functions:
int %_Z3fooi(int %k) {
entry:
%tmp.24 = setgt int %k, 0 ; <bool> [#uses=1]
%tmp.35 = load int* %i ; <int> [#uses=2]
br label %next1
; br bool %tmp.24, label %no_exit.preheader, label %loopexit
next1:
br bool %tmp.24, label %next2, label %next3
next2:
%tmp.100 = add int %tmp.35, 1
store int...
2012 Mar 06
2
[LLVMdev] Work with CallSites
Hi.
I have a test program:
class A {
int A;
public:
virtual void test ( int x ) = 0;
};
class B : public A {
int B;
public:
void test ( int x ) {};
};
int main() {
A *a = new B();
a->test(1);
}
We have call site CS: "a->test(1);". CS.getCalledFunction() - return NULL, so we can say that this call site is virtual. My optimization determines, that in this call site
2017 May 11
3
Alias analysis results
Hello,
I'm trying to get the whole picture of what we are doing in terms
of alias analysis in LLVM. Being new to this I may be missing
some well known things so my apologies if I seem to ask obvious
things.
There are lots of questions arise in my head as I read related
bug reports, sources and documentation, of which looks to be the
most simple is,
Why the current TBAA implementation
2005 Apr 25
5
[LLVMdev] "Best" alias analysis algorithm
....1 = setgt int %tmp.0, 10 ; <bool> [#uses=1]
br bool %tmp.1, label %then, label %UnifiedReturnBlock
then: ; preds = %entry
%tmp.3 = add int %p, 2 ; <int> [#uses=1]
ret int %tmp.3
UnifiedReturnBlock: ; preds = %entry
ret int 0
}
int %_Z3fooi(int %p) {
entry:
%tmp.0 = load int* %i ; <int> [#uses=1]
%tmp.1 = setgt int %tmp.0, 15 ; <bool> [#uses=1]
br bool %tmp.1, label %UnifiedReturnBlock, label %else
else: ; preds = %entry
%tmp.3 = call int %_Z3bari( int %p ) ; <int> [#uses=1]...