Displaying 20 results from an estimated 100 matches for "call1".
Did you mean:
call
2005 Jun 09
1
single assignment affecting multiple sub-structures (PR#7924)
...ly known 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]]))
>...
2010 Oct 15
5
[LLVMdev] How do I find all memory allocations in an llvm ir code file?
...= new int[2];
}
using:
clang test.cpp -S -emit-llvm -o - > test.llvm
and obtained this:
define void @_Z8FuncTestv() {
entry:
%a = alloca i32*, align 4
%b = alloca i32*, align 4
%call = call noalias i8* @_Znwj(i32 4)
%0 = bitcast i8* %call to i32*
store i32* %0, i32** %a, align 4
%call1 = call noalias i8* @_Znaj(i32 8)
%1 = bitcast i8* %call1 to i32*
store i32* %1, i32** %b, align 4
ret void
}
declare noalias i8* @_Znwj(i32)
declare noalias i8* @_Znaj(i32)
What I am wondering now is: where do the _Znwj and _Znaj symbols come
from? Are they just randomly assigned or is ther...
2013 Feb 14
2
Plotting survival curves after multiple imputation
...h.call()
if (!is.mids(data)) stop("The data must have class mids")
analyses <- as.list(1:data$m)
for (i in 1:data$m) {
data.i <- complete(data, i)
analyses[[i]] <- coxph(formula, data = data.i, ...)
}
object <- list(call = call, call1 = data$call,
nmis = data$nmis, analyses = analyses)
return(object)
}
pool.impute <- function (object, method = "smallsample") {
if ((m <- length(object$analyses)) < 2)
stop("At least two imputations are needed for pooling.\n")...
2013 Mar 11
2
[LLVMdev] How to detect all free() calls
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>, free(buf2R1); turn into %call2 = call i32 bitcast (i32 (...)* @f...
2016 Feb 09
2
Modified LLVM IR
...32 %ivar1, i32* %ivar1.addr, align 4
store i32 %ivar2, i32* %ivar2.addr, align 4
store i32 0, i32* %isum, align 4
%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
%call1 = call i32 @one_11(i32 %0, i32 %1)
store i32 %call1, i32* %isum, align 4
%2 = load i32* %isum, align 4
ret i32 %2
}
Modified LLVM IR file,
@.str2 = private unnamed_addr constant [17 x i8] c"\0AI am in
one_11\0A\00", align 1
@.str3 = private unnamed_addr constant [17 x i8] c"\0...
2013 Mar 11
0
[LLVMdev] How to detect all free() calls
...clude 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 include <stdlib.h>, free(buf2R1); turn into %call2 = call
&...
2016 Feb 10
2
Modified LLVM IR
...2, i32* %ivar2.addr, align 4
>> store i32 0, i32* %isum, align 4
>> %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
>> %call1 = call i32 @one_11(i32 %0, i32 %1)
>> store i32 %call1, i32* %isum, align 4
>> %2 = load i32* %isum, align 4
>> ret i32 %2
>> }
>>
>> Modified LLVM IR file,
>> @.str2 = private unnamed_addr constant [17 x i8] c"\0AI am in
>> one_11\0A\00&qu...
2008 Nov 28
1
Priority between calls from different queues
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
-------------- ne...
2011 Aug 05
0
[LLVMdev] RFC: Exception Handling Rewrite
...est to at first 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......
2016 Feb 10
2
Modified LLVM IR
...store i32 0, i32* %isum, align 4
>>>> %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
>>>> %call1 = call i32 @one_11(i32 %0, i32 %1)
>>>> store i32 %call1, i32* %isum, align 4
>>>> %2 = load i32* %isum, align 4
>>>> ret i32 %2
>>>> }
>>>>
>>>> Modified LLVM IR file,
>>>> @.str2 = private unnamed_addr const...
2007 May 17
1
MICE for Cox model
...match.call()
if (!is.mids(data))
stop("The data must have class mids")
analyses <- as.list(1:data$m)
for (i in 1:data$m) {
data.i <- complete(data, i)
analyses[[i]] <- coxph(formula, data = data.i, ...)
}
object <- list(call = call, call1 = data$call, nmis = data$nmis,
analyses = analyses)
oldClass(object) <- c("mira", "coxph")
return(object)
}
------------
The problem that I encounter occurs when I try to use the "pool"
function to pool the fitted models into one general model. He...
2010 Oct 15
0
[LLVMdev] How do I find all memory allocations in an llvm ir code file?
...gt; test.llvm
>
> and obtained this:
>
> define void @_Z8FuncTestv() {
> entry:
> %a = alloca i32*, align 4
> %b = alloca i32*, align 4
> %call = call noalias i8* @_Znwj(i32 4)
> %0 = bitcast i8* %call to i32*
> store i32* %0, i32** %a, align 4
> %call1 = call noalias i8* @_Znaj(i32 8)
> %1 = bitcast i8* %call1 to i32*
> store i32* %1, i32** %b, align 4
> ret void
> }
>
> declare noalias i8* @_Znwj(i32)
> declare noalias i8* @_Znaj(i32)
>
> What I am wondering now is: where do the _Znwj and _Znaj symbols come
&g...
2016 Feb 10
2
Modified LLVM IR
...;>>>> %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
>>>>>> %call1 = call i32 @one_11(i32 %0, i32 %1)
>>>>>> store i32 %call1, i32* %isum, align 4
>>>>>> %2 = load i32* %isum, align 4
>>>>>> ret i32 %2
>>>>>> }
>>>>>>
>>>>>> Modified LLVM IR file,
>...
2006 Jun 20
5
Multiple Ajax.Request or Ajax.Updater
...ff one at a time. So the pieces load up in the order they
were called. Maybe I''m being a noob, but shouldn''t all those requests
just fire away 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''
});...
2016 Apr 29
2
[MemorySSA] Potential CachingMemorySSAWalker bug
...tp://lists.llvm.org/pipermail/llvm-dev/attachments/20160429/f4c64f9b/attachment.html>
-------------- next part --------------
; opt -early-cse -S < LoadShorts-simple2.ll
target triple = "aarch64--linux-gnu"
%S1 = type { i32, i32, i16, i16, i8, i8 }
define void @test() {
entry:
%call1 = call noalias i8* @malloc()
%0 = bitcast i8* %call1 to %S1*
%ui = getelementptr inbounds %S1, %S1* %0, i32 0, i32 0
store i32 undef, i32* %ui, align 4
%us = getelementptr inbounds %S1, %S1* %0, i32 0, i32 2
store i16 undef, i16* %us, align 4
%s = getelementptr inbounds %S1, %S1* %0, i3...
2015 Jul 28
1
[LLVMdev] AliasSetTracker and UnknownInst's (callsites mostly) problem
...But the same logic when adding callsite is wrong (
findAliasSetForUnknownInst).
Callsite may be known to readonly access one pointer and change the content
of other pointer.
Why to merge together two noalias pointers if they have some mod/ref
relationships with common callsite?
If modrefinfo(%A, %call1) == REF and modrefinfo(%B, %call1) == MOD
it doesn't mean %A may/must alias %B.
AliasSet's for %A and %B must stay independent with corrected access
lattice: aliasset(%A).Access |= RefAccess, aliasset(%B).Access |= ModAccess.
And I think new UnknownInst must be added to both AliasSet's....
2020 Sep 16
2
[Debuginfo] Changing llvm.dbg.value and DBG_VALUE to support multiple location operands
...r location (DW_OP_reg0 RAX).
// Compile with clang -O2 -g
int baz();
int bar2(int arg) {
return arg * 4;
}
int bar() {
return bar2(1);
}
int foo() {
int a = baz() + bar() - 4;
return a * 2;
}
; Eventually becomes the IR...
%call = call i32 @_Z3bazv(), !dbg !25
%call1 = call i32 @_Z3barv(), !dbg !26
%add = add nsw i32 %call, %call1, !dbg !27
%sub = sub nsw i32 %add, 4, !dbg !28
call void @llvm.dbg.value(metadata i32 %sub, metadata !24, metadata !DIExpression()), !dbg !29
%mul = mul nsw i32 %sub, 2, !dbg !30
ret i32 %mul, !dbg !31
; Combine redundant i...
2015 Jan 16
3
[LLVMdev] Overloaded intrinsics: name explosion
Philip Reames wrote:
>> 1. Introduce aAny.
>
> Having a generic any type seems fine. I assume you'd create something like
> an llvm_any_type in Intrinsics.td?
That's precisely what ifavpAny is about: integer, float, array,
vector, pointer Any. aAny is meant for array-Any, and I wonder why so
few people care about arrays. I'll go ahead with Any and
llvm_any_type.
2020 May 26
3
Loop Unroll
...t; %entry
> %2 = load i32, i32* %i, align 4
> %cmp = icmp slt i32 %2, 16
> br i1 %cmp, label %for.body, label %for.end
>
> for.body: ; preds = %for.cond
> %3 = load i32, i32* %c, align 4
> %4 = load i32, i32* %d, align 4
> %call1 = call i32 @add(i32 %3, i32 %4)
> store i32 %call1, i32* %d, align 4
> br label %for.inc
>
> for.inc: ; preds = %for.body
> %5 = load i32, i32* %i, align 4
> %inc = add nsw i32 %5, 1
> store i32 %inc, i32* %i, align 4
> %6...
2020 May 23
2
Loop Unroll
...; preds = %for.inc.3,
%entry
%2 = load i32, i32* %i, align 4
%cmp = icmp slt i32 %2, 16
br i1 %cmp, label %for.body, label %for.end
for.body: ; preds = %for.cond
%3 = load i32, i32* %c, align 4
%4 = load i32, i32* %d, align 4
%call1 = call i32 @add(i32 %3, i32 %4)
store i32 %call1, i32* %d, align 4
br label %for.inc
for.inc: ; preds = %for.body
%5 = load i32, i32* %i, align 4
%inc = add nsw i32 %5, 1
store i32 %inc, i32* %i, align 4
%6 = load i32, i32* %i, align 4
%cmp.1...