search for: call2

...n at run time. I do this by using repeated indices to expand out a call with a single argument. However, when I change one of the arguments, all are changed. I don't see the same behavior when I initially create a call with multiple arguments. Even more strangely, calling identical(call1, call2) before any attempts to modify the structures changes the subsequent behavior to be correct. [If there are better methods to create and modify calls, please let me know!] > # Example of commands that give incorrect results > call1 <- Quote(f(arg[[1]], arg[[1]], arg[[1]])) > call2...

Thanks. isFreeCall() works well but for %call2 = call i32 bitcast (i32 (...)* @free to i32 (i8*)*)(i8* %call1) nounwind, !dbg !16 So I tried to figure out when the above instruction occurred. When <stdlib.h> is included, free(buf2R1); turn into call void @free(i8* %call1) nounwind, !dbg !16 when I forget to include <stdlib.h>, fr...

Hi! I want to know the way that calls are answer in this case... I have queue1 and queue2, one agent that receive call from both queues. queue1 <- call1 queue1 <- call2 queue2 <- call3 queue2 <- call4 In my test the agent answer calls in this order: call1,call3,call2 and call4. I think this must be in this order call1,call2, call3, call4 like a big FIFO. Its ok this behavior? Could I set priority between queues? Thanks -------------- next part -----------...

if you don't include stdlib.h, where free() is declared, you'll simply get a default C function signature: int free(...); On Mon, Mar 11, 2013 at 1:56 AM, Jane <270611649 at qq.com> wrote: > Thanks. isFreeCall() works well but for > %call2 = call i32 bitcast (i32 (...)* @free to i32 (i8*)*)(i8* %call1) > nounwind, !dbg !16 > So I tried to figure out when the above instruction occurred. > When <stdlib.h> is included, free(buf2R1); turn into call void @free(i8* > %call1) nounwind, !dbg !16 > when I forget to inc...

Hi All, Well I finally have found the time to get svn working and I have successfully built my own tuned atlas (multi-threaded version) libs and have both the r-devel and r-patched trees building daily on my box. The problem is I still do not have a good idea of the layout and design of R, and typically I "learn by doing" by trying to fix a bug that hits me. Unfortunately ;-)

...ay and then place the content as it gets received? I was doing multiple versions, but I finally ended up simplifying to something like: var call1 = new Ajax.Updater( ''id1'', ''/foo1.html'', { method: ''post'' }); var call2 = new Ajax.Updater( ''id2'', ''/foo2.html'', { method: ''post'' }); etc... Using firebug, I can see all the requests seem to get made simultaneously, but the chunks are received in order. Since each one takes about 3 second...

...%isum, align 4 %call1 = call i32 @one_12(i32 %0, i32 %1) <== store i32 %call1, i32* %isum, align <== %call = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([16 x i8]* @.str, i32 0, i32 0)) #1 %0 = load i32* %ivar1.addr, align 4 %1 = load i32* %ivar2.addr, align 4 %call2 = call i32 @one_11(i32 %0, i32 %1) <== store i32 %call2, i32* %isum, align 4 <== %2 = load i32* %isum, align 4 ret i32 %2 } With llc tool, I want to generate object file for modified llvm ir file and it should call function first "one_12"" and then function "one...

...ne if 614. %call = call i8* @gettext(i8* getelementptr inbounds ([221 x i8], [221 x i8]* @.str.42, i32 0 , i32 0)) #12, !dbg !1295 %0 = load %struct._IO_FILE*, %struct._IO_FILE** @stdout, align 4, !dbg !1295 %call1 = call i32 @fputs_unlocked(i8* %call, %struct._IO_FILE* %0), !dbg !1295 %call2 = call i8* @gettext(i8* getelementptr inbounds ([222 x i8], [222 x i8]* @.str.43, i32 0, i32 0)) #12, !dbg !1296 %1 = load %struct._IO_FILE*, %struct._IO_FILE** @stdout, align 4, !dbg !1296 %call3 = call i32 @fputs_unlocked(i8* %call2, %struct._IO_FILE* %1), !dbg !1296 ret void, !dbg !129...

...t disallow it until proven doable > by someone working in an isolated branch -- although proving it works may be difficult, > since so little code actually uses exceptions (only TableGen in llvm ?). Peter, I think this will be done lazily to avoid excessive splitting as in: Call1 -> LP Call2 -> LP Call3 -> LP => split Call1 Call1 -> LP-split -> LP-remainder Call2 -> LP-split-merge -> LP-remainder Call3 -> LP-split-merge -> LP-remainder But John will know best. -Andy -------------- next part -------------- An HTML attachment was scrubbed... URL: <http:/...

...x9ecd90, env = 0x508818}}} #0 DEBUG_SET_NAMED (x=0x9ebe58, v=1) at ../../../r-devel/r-devel/R/src/main/main.c:1444 #1 0x00002aaaaab6b5d3 in do_set (call=0x9ec1d8, op=Variable "op" is not available.) at ../../../r-devel/r-devel/R/src/main/eval.c:1353 Then I assigned call2 > > call2 <- Quote(f(arg[[1]]))[c(1,2,2,2)] Again a variety of objects (types 14, 14, 14, 14, 19) has named set to 2, all except for the final object (again type = 6) that had named set to 1 Breakpoint 1, DEBUG_SET_NAMED (x=0xf9b808, v=2) at ../../../r-devel/r-devel/R/src...

...2 %1) <== >> store i32 %call1, i32* %isum, align <== >> %call = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([16 x >> i8]* @.str, i32 0, i32 0)) #1 >> %0 = load i32* %ivar1.addr, align 4 >> %1 = load i32* %ivar2.addr, align 4 >> %call2 = call i32 @one_11(i32 %0, i32 %1) <== >> store i32 %call2, i32* %isum, align 4 <== >> %2 = load i32* %isum, align 4 >> ret i32 %2 >> } >> >> With llc tool, I want to generate object file for modified llvm ir file >> and it should call funct...

...@gettext(i8* getelementptr inbounds ([221 x i8], [221 x > i8]* @.str.42, i32 0 , i32 0)) #12, !dbg !1295 > %0 = load %struct._IO_FILE*, %struct._IO_FILE** @stdout, align 4, !dbg > !1295 > %call1 = call i32 @fputs_unlocked(i8* %call, %struct._IO_FILE* %0), !dbg > !1295 > %call2 = call i8* @gettext(i8* getelementptr inbounds ([222 x i8], [222 > x i8]* @.str.43, i32 0, i32 0)) #12, !dbg !1296 > %1 = load %struct._IO_FILE*, %struct._IO_FILE** @stdout, align 4, !dbg > !1296 > %call3 = call i32 @fputs_unlocked(i8* %call2, %struct._IO_FILE* %1), > !dbg !1...

...not is running wich I need: for (BasicBlock::iterator Is = i->begin(), e = i->end(); Is != e; ++Is){ if(isa<CallInst>(*Is)){ CallInst *call = dyn_cast<CallInst>(&*Is); Function* ft = call->getCalledFunction(); *arguments = ????* CallInst *call2 = CallInst::Create(ft, *arguments.begin(), arguments.end()*, "", ++Is); } } Thanks, -- *Rafael Parizi* -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120106/6dc1ea9b/attachment.html>

...s: CallInst *CI=dyn_cast<CallInst>(&*i); then see if the Function name matches: name=CI->getCalledFunction()->getName(); if(name=="_ZdlPv"||name=="_ZdaPv"||name=="free") It worked but when something like this occurs %call2 = call i32 bitcast (i32 (...)* @free to i32 (i8*)*)(i8* %call1) nounwind, !dbg !16 It seems like a indirect function call and I don't know how to detect free() in such situation. By the way, is there any way that is more convenient to detect all free()/delete() call instructions in a mo...

...ptr inbounds ([221 x i8], [221 >> x i8]* @.str.42, i32 0 , i32 0)) #12, !dbg !1295 >> %0 = load %struct._IO_FILE*, %struct._IO_FILE** @stdout, align 4, !dbg >> !1295 >> %call1 = call i32 @fputs_unlocked(i8* %call, %struct._IO_FILE* %0), >> !dbg !1295 >> %call2 = call i8* @gettext(i8* getelementptr inbounds ([222 x i8], [222 >> x i8]* @.str.43, i32 0, i32 0)) #12, !dbg !1296 >> %1 = load %struct._IO_FILE*, %struct._IO_FILE** @stdout, align 4, !dbg >> !1296 >> %call3 = call i32 @fputs_unlocked(i8* %call2, %struct._IO_FILE* %...

..., i32* %isum, align <== >>>> %call = call i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([16 >>>> x i8]* @.str, i32 0, i32 0)) #1 >>>> %0 = load i32* %ivar1.addr, align 4 >>>> %1 = load i32* %ivar2.addr, align 4 >>>> %call2 = call i32 @one_11(i32 %0, i32 %1) <== >>>> store i32 %call2, i32* %isum, align 4 <== >>>> %2 = load i32* %isum, align 4 >>>> ret i32 %2 >>>> } >>>> >>>> With llc tool, I want to generate object file for modifie...

...call void @llvm.dbg.declare(metadata !{i32* %f}, metadata !17), !dbg !18 %2 = load i32* %n.addr, align 4, !dbg !19 %sub = sub i32 %2, 1, !dbg !19 %call = call i32 @fib(i32 %sub), !dbg !19 %3 = load i32* %n.addr, align 4, !dbg !20 %sub1 = sub i32 %3, 2, !dbg !20 %call2 = call i32 @fib(i32 %sub1), !dbg !20 %add = add i32 %call, %call2, !dbg !20 store i32 %add, i32* %f, align 4, !dbg !20 %4 = load i32* %f, align 4, !dbg !21 store i32 %4, i32* %retval, !dbg !21 br label %return, !dbg !21 [...] !17 = metadata !{i32 786688, meta...

...i32 1, i32 0) br label %while.cond while.cond: ; preds = %while.body, %entry %2 = load i32** %callback.addr, align 8 %3 = bitcast i32* %2 to %struct.kernelgen_callback_t* %lock1 = getelementptr inbounds %struct.kernelgen_callback_t* %3, i32 0, i32 0 %call2 = call ptx_device i32 @_Z12__iAtomicCASPiii(i32* %lock1, i32 1, i32 1) %tobool = icmp ne i32 %call2, 0 %lnot = xor i1 %tobool, true br i1 %lnot, label %while.body, label %while.end while.body: ; preds = %while.cond br label %while.cond while.end:...

Hello everybody, On the documentation page for the tailcallelim pass you can read: "This pass transforms functions that are prevented from being tail recursive by an associative expression to use an accumulator variable, thus compiling the typical naive factorial or fib implementation into efficient code” However, I don’t see this behavior when trying to compile this variant of the

Guys, on second thought... doesn't making the exception registers live from the InvokeInst to the LandingpadInst create problems for critical-edge-splitting ? if a landingpad-edge is critical and needs to be split, won't we be creating and inserting a new BB between the "invoke-block" and the "landingpad-block", and if we do then isn't there the