Displaying 20 results from an estimated 100 matches for "cond2".
Did you mean:
cond
2013 Aug 16
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...; @.str = private unnamed_addr constant [4 x i8] c"%d\0A\00", align 1
>> ; Function Attrs: nounwind uwtable
>> define i32 @main(i32 %argc, i8** nocapture readonly %argv) {
>> entry:
>> %cmp = icmp eq i32 %argc, 2
>> br i1 %cmp, label %cond.end, label %for.cond2.preheader.lr.ph
>> cond.end:
>> %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
&...
2013 Aug 15
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...s shown as:
>
> @.str = private unnamed_addr constant [4 x i8] c"%d\0A\00", align 1
> ; Function Attrs: nounwind uwtable
> define i32 @main(i32 %argc, i8** nocapture readonly %argv) {
> entry:
> %cmp = icmp eq i32 %argc, 2
> br i1 %cmp, label %cond.end, label %for.cond2.preheader.lr.ph
> cond.end:
> %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, lab...
2013 Aug 16
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...named_addr constant [4 x i8] c"%d\0A\00", align 1
>>> ; Function Attrs: nounwind uwtable
>>> define i32 @main(i32 %argc, i8** nocapture readonly %argv) {
>>> entry:
>>> %cmp = icmp eq i32 %argc, 2
>>> br i1 %cmp, label %cond.end, label %for.cond2.preheader.lr.ph
>>> cond.end:
>>> %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
>>>...
2013 Aug 15
4
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...duced by "clang -O1") is shown as:
@.str = private unnamed_addr constant [4 x i8] c"%d\0A\00", align 1
; Function Attrs: nounwind uwtable
define i32 @main(i32 %argc, i8** nocapture readonly %argv) {
entry:
%cmp = icmp eq i32 %argc, 2
br i1 %cmp, label %cond.end, label %for.cond2.preheader.lr.ph
cond.end:
%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...
2010 Nov 29
1
cross tabulate variables by subject id
Dear list,
I have data like this:
dat1 <- data.frame(subject=rep(1:10,2),
cond1=rep(c("A","B"),each=5),
cond2=rep(c("C","D"),each=10),
choice=sample(0:1,10,replace=TRUE))
I would like to compare subjects' "choice" for (cond1=="A" &
cond2=="C") vs (cond1=="A" & cond2=="D"), using mcnemar.test
The ?mcnemar....
2007 Dec 04
2
Multiple stacked barplots on the same graph?
Dear R-Users,
I would like to know whether it is possible to draw several
stacked barplots (i.e. side by side on the same sheet)...
my data look like :
Cond1 Cond1' Cond2 Cond2'
Compartment 1 11,81 2,05 12,49 0,70
Compartment 2 10,51 1,98 13,56 0,85
Compartment 3 1,95 0,63 2,81 0,22
Compartment 4 2,08 0,17 3,13 0,06
Compartment 5 2,51 0,20 4,58 0,03
ps: Cond1' values should be stacked...
2013 Jul 03
2
[LLVMdev] [Polly] Assert in Scope construction
...> entry:
> %j.0.lcssa.reg2mem = alloca i32, align 8
> br label %entry.split
>
> entry.split: ; preds = %entry
> %call = tail call i32 @foo(i32 0, i32 0) #2
> %call1 = tail call i32 @foo(i32 %call, i32 %call) #2
> br label %for.cond2
>
> for.cond2: ; 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*...
2015 Jul 16
3
[LLVMdev] why LoopUnswitch pass does not constant fold conditional branch and merge blocks
..._body, label %loop_exit" and merge %loop_body into %loop_begin.
My understanding is that later llvm passes (likely -simplifycfg) will cleanup the code properly and doing this in LoopUnswtich pass is duplicated. However, consider the following case:
define i32 @test(i32* %var, i1 %cond1, i1 %cond2) {
br label %loop_begin
loop_begin:
br i1 %cond1, label %continue, label %loop_exit
continue:
%var_val = load i32, i32* %var
br i1 %cond2, label %do_something, label %loop_exit
do_something:
call void @some_func() noreturn nounwind
br label %loop_begin
loop_exit:
ret i32 0
}...
2017 Jul 24
5
Ifelse statements and combining columns
Hi everyone,
I'm having some trouble with my ifelse statements.
I'm trying to put 12 conditions within 3 groups. Here is the code I have so
far:
dat$cond <- ifelse(test = dat$cond == "cond1" | dat$cond == "cond2" |
dat$cond == "cond3" dat$cond == "cond4"
yes = "Uniform"
no = ifelse(test = dat$cond == "cond5" | dat$cond ==
"cond6") | dat$cond == "cond7" dat$cond == "cond8"
yes...
2017 May 22
5
[poison] is select-of-select to logic+select allowed?
Some InstCombine transforms for select-of-select were added here:
https://reviews.llvm.org/rL228409
But Alive says this is more poisonous:
Name: selsel
%s1 = select i1 %cond1, i8 C1, i8 C2
%s2 = select i1 %cond2, i8 %s1, i8 C2
=>
%andcond = and i1 %cond1, %cond2
%s2 = select i1 %andcond, i8 C1, i8 C2
http://rise4fun.com/Alive/JT6
Are those transforms legal?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/2017052...
2012 Feb 03
0
Nested? Two-way ANOVA with repeated measures
...t <- data.frame(Family = 1:60, # Plant
family name
Pop = rep(c("Pop1","Pop2","Pop3"), each=20), # Population name
Cond1 = rnorm(60, 15, 1), # obtained
values at experimental conditions 1
Cond2 = rnorm(60, 20, 1)) #
experimental conditions 2
# rearrange data
data.wide <- data.frame(Family = 1:20,
subset(dat, dat$Pop == "Pop1")[3:4],
subset(dat, dat$Pop == "Pop2")[3:4],
subset(dat, dat$Pop == "Pop3")[3:4])
nam...
2007 Oct 10
1
Deleting for() loop in function
...<- rbind(t(Y), -t(X))
# make inequality matrix
f.dir <- rep(">=", s+m)
# make objective matrix
f.obj <- c(1, rep(0,n))
# solve LP for all DMUs by using for syntax
for(i in 1:n){
# make part of lhs constraint matrix
cond2 <- matrix(c(rep(0, s), X[i,]), byrow=T)
# make final constraint matrix
f.con <- cbind(cond2, cond1)
# make rhs constraint
f.rhs <- c(Y[i,], rep(0, m))
# solve LP problem
result[i,'eff'] <- lp("min", f.obj, f.con,...
2012 Sep 27
2
equivalent of Stata "by construct"
...g the switch is the coding flexibility in R (e.g. Stata does not support linear/quadratic programming). I have been going over the R syntax and I had a quick question:
In Stata, one has a very useful construction called "by", e.g.
by month signal: gen xxx = myfunction(yyy zzz) if cond1==cond2
Similarly, in SAS, one can write
by monthn signal;
if cond1=cond2 then xxx = myfunction(yyy zzz);
run;
I looked at a lot of R tutorials, but I haven't come across the equivalent of the Stata or SAS "by" construct in R?
________________________________
This communication is f...
2017 May 18
2
Computing loop trip counts with Scalar evolution
Hello.
I tried to get the trip count of a loop with Scalar evolution. I got inspired from
http://stackoverflow.com/questions/13834364/how-to-get-loop-bounds-in-llvm .
However the analysis described there doesn't work well for the second inner loop of
thes function below (although if we declare Bcols a short it works well):
void MatMul(int Arows, int Acols, int Brows, int
2002 Mar 04
2
Plotting a x axis from a vector with rownames
Hi all,
suppose there is a vector y with rownames:
> y
cond1 cond2 cond3 cond4
78.952 87.308 86.490 74.040
how can I easily plot this vector using the rownames? plot(y) gives me a
plot with a x-axis from 1 to 4 in 0.5 steps, also plot(rownames(y), y)
and plot(y ~ rownames(y) don't work. I know I can build a x-axis with
axis(1, ...), but in this case I nee...
2013 Jul 05
0
[LLVMdev] [Polly] Assert in Scope construction
...a.reg2mem = alloca i32, align 8
> > br label %entry.split
> >
> > entry.split: ; preds = %entry
> > %call = tail call i32 @foo(i32 0, i32 0) #2
> > %call1 = tail call i32 @foo(i32 %call, i32 %call) #2
> > br label %for.cond2
> >
> > for.cond2: ; 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,...
2011 May 22
2
Convert dataframe with two factors from wide to long format
I know how to convert a simple dataframe from wide to long format with one
varying factor. However, for a dataset with two factors like the following,
Subj T1_Cond1 T1_Cond2 T2_Cond1 T2_Cond2
1 0.125869 4.108232 1.099392 5.556614
2 1.427940 2.170026 0.120748 1.176353
How to elegantly convert to a long form as
Subj Time Cond Value
1 1 1 0.125869
1 1 2 4.108232
1 2 1 1.099392
...
Thanks...
2013 Nov 03
2
[LLVMdev] loop vectorizer issue
...it contains only one 'store' instruction with '%.pre'.
Seems that no 'load' instruction prevented the Vectorizer to detect
dependency.
Is that a bug, or I'm missing something? Please advice
for.body4: ; preds = %for.body4,
%for.cond2.preheader
%k.030 = phi i32 [ 20, %for.cond2.preheader ], [ %inc8, %for.body4 ]
%arrayidx6 = getelementptr inbounds i32* %0, i32 %k.030
store i32 %.pre, i32* %arrayidx6, align 4, !tbaa !0
%inc8 = add nsw i32 %k.030, 1
%exitcond32 = icmp eq i32 %inc8, 50
br i1 %exitcond32, label %fo...
2006 Apr 11
5
multiple select_tag
Hello again,
I have a table called line_items, with the following fields:
id int
item_name varchar()
qty int
conditions text
I''ve made my LineItem model, and everything works as such (with simple
text_fields)..
Now I''d like for the conditions field to be a select_tag() with multiple
choice possibility.
I''m guessing I need some code to expand/restract the array for
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