search for: tmp4

...h "-03". --- %0 = type <{ i32* }> define i32 @main(%0* noalias nocapture %arg) nounwind readnone { bb: %tmp = alloca [1024 x i32], align 4 ; <[1024 x i32]*> [#uses=2] %tmp3 = getelementptr inbounds [1024 x i32]* %tmp, i32 0, i32 0 ; <i32*> [#uses=1] %tmp4 = bitcast [1024 x i32]* %tmp to [1 x i32]* ; <[1 x i32]*> [#uses=1] store [1 x i32] zeroinitializer, [1 x i32]* %tmp4 %tmp5 = load i32* %tmp3 ; <i32> [#uses=1] ret i32 %tmp5 } --- %tmp is what I'd like to call a local heap: It is allocated in the entr...

...tten using arrays: %struct1 = type { i32, i32 } %struct2 = type { %struct1, %struct1 } ; Function Attrs: ssp uwtable define i32 @test1(%struct2* %dm, i1 %tmp4, i64 %tmp9, i64 %tmp19) { bb: br i1 %tmp4, label %bb1, label %bb2 bb1: ; preds = %bb5 %tmp10 = getele...

Dear all I use R for Windows 2.3.1 on a fully updated Windows XP Home SP2 machine and I have two related regular expression problems. platform i386-pc-mingw32 arch i386 os mingw32 system i386, mingw32 status major 2 minor

I did M.getOrInsertFunction and called the exit function with . IRBuilder<> builder = IRBuilder<>(...); Value *one = ConstantInt::get(Type::getInt32Ty(M.getContext()),1); builder.CreateCall(exitF,one,"tmp4"); "Instruction has a name, but provides a void value! %tmp4 = call void @exit(i32 1) Broken module found, compilation aborted! " On Thu, Mar 31, 2011 at 3:51 PM, Frits van Bommel <fvbommel at gmail.com>wrote: > On Thu, Mar 31, 2011 at 9:31 PM, George Baah <georg...

...'m running on 3.0, but a quick test on trunk also showed the same behavior. First problem: --------------- I have code like: tmp1 = call llvm.stacksave() tmp2 = alloca [do some stuff with tmp2] call llvm.stackrestore(tmp1) [some other stuff] tmp3 = call llvm.stacksave() tmp4 = alloca [do some stuff with tmp4] call llvm.stackrestore(tmp3) Then some transformation rewrites this to tmp1 = call llvm.stacksave() tmp2 = alloca [do some stuff with tmp2] call llvm.stackrestore(tmp1) [some other stuff] tmp3 = call llvm.stacksave() tmp4 = tmp2...

...ge Baah <georgebaah at gmail.com> wrote: > I did M.getOrInsertFunction and called the exit function with . > > IRBuilder<> builder = IRBuilder<>(...); > > Value *one = ConstantInt::get(Type::getInt32Ty(M.getContext()),1); > > builder.CreateCall(exitF,one,"tmp4"); > > "Instruction has a name, but provides a void value! >   %tmp4 = call void @exit(i32 1) > Broken module found, compilation aborted! " So... don't give the call a name? (just remove the "tmp4" parameter)

...> wrote: > > I did M.getOrInsertFunction and called the exit function with . > > > > IRBuilder<> builder = IRBuilder<>(...); > > > > Value *one = ConstantInt::get(Type::getInt32Ty(M.getContext()),1); > > > > builder.CreateCall(exitF,one,"tmp4"); > > > > "Instruction has a name, but provides a void value! > > %tmp4 = call void @exit(i32 1) > > Broken module found, compilation aborted! " > > So... don't give the call a name? (just remove the "tmp4" parameter) > --------------...

How about vector parameters? define internal fastcc <4 x float> @add(<4 x float> %a.val, <4 x float> %b.val) nounwind { entry: %tmp4 = fadd <4 x float> %a.val, %b.val ret <4 x float> %tmp4 } a and b are flattened by SelectionDAGISel::LowerArguments(const BasicBlock *LLVMBB) before letting the target handle it. SDValue NewRoot = TLI.LowerFormalArguments(DAG.getRoot(), F.getCallingConv(),...

...: %tmp = load i32* @dst-ip ; <i32> [#uses=3] %tmp1 = and i32 %tmp, -16777216 ; <i32> [#uses=1] %tmp2 = icmp eq i32 %tmp1, 167772160 ; <i1> [#uses=2] %tmp3 = and i32 %tmp, -65536 ; <i32> [#uses=2] %tmp4 = icmp ne i32 %tmp3, 168296448 ; <i1> [#uses=1] %tmp5 = and i1 %tmp2, %tmp4 ; <i1> [#uses=1] %tmp6 = and i32 %tmp, -256 ; <i32> [#uses=2] %tmp7 = icmp eq i32 %tmp6, 168296704 ; <i1> [#uses=1] %tmp8 = icmp...

When I was trying to run mutiple E1s over TDMoE, the zaptel would drivers complain about too little memory, whenever I added more than 31 channels. Requesting 62 channels in a dynamic span gave me ... span creation failed: Cannot allocate memory upon loading the zaptel drivers. How would you go about running, 8 or 16 say, E1s over TDMoE? Would you create multiple dynamic spans or just one large

...d then add the indirect part. This makes the addition of the offset loop-invariant. This is pretty much what you would get from reassociation on algebraic expressions, except that it's involving a GEP. Basically, we'd transform this: ; Note: %call and %tmp7 are loop-invariant %tmp4 = load i32* %arrayidx %add = add i32 %tmp4, %call %arrayidx8 = getelementptr float* %tmp7, i32 %add into this: %tmp4 = load i32* %arrayidx %base = getelementptr float* %tmp7, %call %arrayidx8 = getelementptr float* %base, i32 %tmp4 The computation of %base then becomes loop-invari...

Some of the optimizations that the first DAG combine performs is counter productive for our 8-bit target. For example in: // I dropped the types because they are irrelevant. // Excuse me for changing the syntax... store %tmp1, %var %tmp2 = load %var %tmp4 = add %tmp3, %tmp2 Since load is the only user of var and since var has just be stored to, it assumes that %tmp1 is alive and it goes ahead and removes the load and does: store %tmp1, var tmp4 = add %tmp3 , %tmp1 This is great for architectures that have more than one registers because it is lik...

...ctly into the DAG, rather than being deferred. This is the function: define i32 @foo(i32 %x, i32 %z) nounwind { entry: switch i32 %x, label %UnifiedReturnBlock [ i32 0, label %bb i32 1, label %bb5 ] bb: ; preds = %entry %tmp4 = mul i32 %z, %x ; <i32> [#uses=1] ret i32 %tmp4 bb5: ; preds = %entry %tmp8 = add i32 %z, %x ; <i32> [#uses=1] ret i32 %tmp8 UnifiedReturnBlock: ; preds = %entry ret i32 %z } And here's the X86 DAG right...

...> Some of the optimizations that the first DAG combine performs is > counter > productive for our 8-bit target. For example in: > > // I dropped the types because they are irrelevant. > // Excuse me for changing the syntax... > store %tmp1, %var > %tmp2 = load %var > %tmp4 = add %tmp3, %tmp2 > > Since load is the only user of var and since var has just be stored > to, > it assumes that %tmp1 is alive and it goes ahead and removes the load > and does: > > store %tmp1, var > tmp4 = add %tmp3 , %tmp1 > > This is great for architectures th...

...ret = 0; for(int i = 0; i < x; i++) { ret += 1+i*i + i*(i+2); } return ret; } generates: define i32 @loop(i32 %x) nounwind readnone { %1 = icmp sgt i32 %x, 0 br i1 %1, label %bb.nph, label %3 bb.nph: ; preds = %0 %tmp4 = add i32 %x, -1 %tmp6 = add i32 %x, -2 %tmp16 = add i32 %x, -3 %tmp7 = zext i32 %tmp6 to i33 %tmp5 = zext i32 %tmp4 to i33 %tmp17 = zext i32 %tmp16 to i33 %tmp15 = mul i33 %tmp5, %tmp7 %tmp18 = mul i33 %tmp15, %tmp17 %tmp8 = mul i32 %tmp4, %tmp6 %tmp19 = lshr i3...

...ple > that still exhibited the problem, but wanted to see it to think > through things properly. > > > > > > > > %struct1 = type { i32, i32 } > %struct2 = type { %struct1, %struct1 } > ; Function Attrs: ssp uwtable > define i32 @test1(%struct2* %dm, i1 %tmp4, i64 %tmp9, i64 %tmp19) { > bb: > br i1 %tmp4, label %bb1, label %bb2 > bb1: ; preds = %bb5 > %tmp10 = getelementptr inbounds %struct2* %dm, i64 %tmp9, i32 0 > br label %bb3 > > bb2: ; preds = %.lr.ph.i.i > %tmp20 = getelementptr inbounds %struct2* %dm, i64 %tmp9, i32 1 &gt...

...p = load int* bitcast ([4 x ubyte]* getelementptr (%struct.anon* %foos, int 0, uint 1) to int*) %tmp3 = load int* bitcast ([4 x ubyte]* getelementptr (%struct.anon* %foos, int 0, uint 2) to int*) %tmp6 = load int* bitcast ([4 x ubyte]* getelementptr (%struct.anon* %foos, int 0, uint 3) to int*) %tmp4 = add int %tmp3, %tmp %tmp7 = add int %tmp4, %tmp6 ret int %tmp7 } int %bar() { entry: %tmp = load int* bitcast ([2 x { [4 x ubyte], sbyte }]* %bara to int*) %tmp4 = load int* bitcast ([4 x ubyte]* getelementptr ([2 x { [4 x ubyte], sbyte }]* %bara, int 0, int 1, uint 0) to int*) %tmp5 = add...

...%return, label %bb, !dbg !1018 bb: ; preds = %entry %tmp2 = load i16* %x, align 2, !dbg !1023 ; <i16> [#uses=1] %tmp3 = sext i16 %tmp2 to i32, !dbg !1023 ; <i32> [#uses=1] store i32 %tmp3, i32* %xx, align 4, !dbg !1023 %tmp4 = load i16* %y, align 2, !dbg !1024 ; <i16> [#uses=1] %tmp5 = sext i16 %tmp4 to i32, !dbg !1024 ; <i32> [#uses=1] store i32 %tmp5, i32* %yy, align 4, !dbg !1024 %tmp6 = load %struct.MT** @mt, align 8, !dbg !1025 ; <%struct.MT*> [#uses=1] call void @MTPoint_DIRE...

On 9/5/2012 5:02 PM, Khaled Mohammed wrote: > How about vector parameters? > > define internal fastcc <4 x float> @add(<4 x float> %a.val, <4 x float> > %b.val) nounwind { > entry: > %tmp4 = fadd <4 x float> %a.val, %b.val > ret <4 x float> %tmp4 > } That I don't know, but I'd look around TargetCallingConv.td, CallingConvLower.h, etc. -K -- Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum, hosted by The Linux Foundation

...deferred. > > This is the function: > define i32 @foo(i32 %x, i32 %z) nounwind { > entry: > switch i32 %x, label %UnifiedReturnBlock [ > i32 0, label %bb > i32 1, label %bb5 > ] > bb: ; preds = %entry > %tmp4 = mul i32 %z, %x ; <i32> [#uses=1] > ret i32 %tmp4 > bb5: ; preds = %entry > %tmp8 = add i32 %z, %x ; <i32> [#uses=1] > ret i32 %tmp8 > UnifiedReturnBlock: ; preds = %entry > ret i32 %z > } > &g...