Displaying 10 results from an estimated 10 matches for "addx".
Did you mean:
addr
2011 Sep 08
1
predict.rma (metafor package)
Hi
(R 2.13.1, OSX 10.6.8)
I am trying to use predict.rma with continuous and categorical variables. The argument newmods in predict.rma seems to handle coviariates, but appears to falter on factors. While I realise that the coefficients for factors provide the answers, the goal is to eventually use predict.rma with ANCOVA type model with an interaction.
Here is a self contained example
2006 Oct 02
0
[LLVMdev] Instruction descriptions question
...: F3_12<"sll" , 0b100101, shl>;
defm SRL : F3_12<"srl" , 0b100110, srl>;
defm SRA : F3_12<"sra" , 0b100111, sra>;
defm ADD : F3_12<"add" , 0b000000, add>;
defm ADDCC : F3_12<"addcc", 0b010000, addc>;
defm ADDX : F3_12<"addx" , 0b001000, adde>;
defm SUB : F3_12<"sub" , 0b000100, sub>;
defm SUBX : F3_12<"subx" , 0b001100, sube>;
defm SUBCC : F3_12<"subcc", 0b010100, SPcmpicc>;
...
Each of these 'defm's expand into two instruc...
2019 Apr 01
3
Please expose predicates to MachineVerifier
...after ISEL, but the predicates are not being checked at this point. Thus, I could forget to check the target and build an instruction that is illegal for a specific configuration. In such a case it would be nice if the MachineVerifier could detect this for me.
Example predicate IsCore8 usage:
def ADDx: BINOP<...>, Requires<[IsCore8]>;
let Predicates=[IsCore8] in {
def : SUBX: BINOP<...>;
}
The predicates are encoded into the targets GenDAGIsel file but not anywhere else that I can find:
OPC_CheckPatternPredicate, 4, // (Subtarget.isCore8())
Thanks
-------------- next part...
2008 Oct 02
4
namespaces
I'd like to control my namespace thoroughly, separated by task. Is
there a way, in R session, to introduce namespaces for tasks
dynamically and switch them as needed? Or, is there a combination of
load/save workspace steps which can facilitate this?
Cheers,
Alexy
2012 May 05
3
metafor
...n European women.
adult<-read.csv("adult.csv")
print(adult)
dat<-escalc(measure="ZCOR",ri=Pearson,ni=N,data=adult,append=TRUE)
res<-rma(yi,vi,data=dat)
res<-rma(yi,vi,mods=cbind(sex,race),data=dat)
predict(res,transf=transf.ztor,newmods=cbind(seq(from=0,to=1,by=1),1),addx=TRUE)
I am getting different results between the forest function from
subgroup analyses, and the predict function from the meta-regression.
I thought they should have been the same - can I get help to explain
why there are differences? In both cases, I am transforming raw
Pearson coefficients to z...
2013 Mar 19
1
Error when adding lines to a plot using the mixed-effect model and metafor package
...48 3609
4 Mwanzia et al. 2011 4 2 8971 0 100
> dat<-escalc(measure="RR", ai = mosq1pos, bi = mosq1neg, ci = mosq2pos, di = mosq2neg, data = mixed, append = TRUE)
> res<-rma(yi, vi, mods = ablat, data=dat)
> predict(res,transf = exp, addx = TRUE)
> preds<-predict(res, transf = exp)
> wi<-1/sqrt(dat$vi)
> size<-0.5 + 3 *(wi-min(wi))/(max(wi)) - min(wi)
> plot(dat$ablat, exp(dat$yi), pch = 19, cex = size, xlab = "Absolute Latitude", ylab = "Relative Risk", las=1, bty = "l", log = &quo...
2006 Oct 01
2
[LLVMdev] Instruction descriptions question
Hi,
I'm trying to implement a new backend for an embedded CISC processor.
Therefore I thought that it makes sense to take X86 target as a basis,
to save some time.
But when I look into the X86InstrInfo.td, I have a very strong feeling
that it is one of the most complex instruction set descriptions
compared to other targets. I can imagine that this is due to the
complexity of X86's
2006 Oct 02
2
[LLVMdev] Instruction descriptions question
...t; , 0b100101, shl>;
> defm SRL : F3_12<"srl" , 0b100110, srl>;
> defm SRA : F3_12<"sra" , 0b100111, sra>;
> defm ADD : F3_12<"add" , 0b000000, add>;
> defm ADDCC : F3_12<"addcc", 0b010000, addc>;
> defm ADDX : F3_12<"addx" , 0b001000, adde>;
> defm SUB : F3_12<"sub" , 0b000100, sub>;
> defm SUBX : F3_12<"subx" , 0b001100, sube>;
> defm SUBCC : F3_12<"subcc", 0b010100, SPcmpicc>;
> ...
>
> Each of these 'defm...
2006 Jun 26
0
[klibc 35/43] sparc support for klibc
..., #function
+ .proc 017
+__muldi3:
+ save %sp, -104, %sp
+ mov %i1, %o0
+ call .umul, 0
+ mov %i3, %o1
+ mov %o0, %l2
+ mov %o1, %l3
+ mov %i1, %o0
+ call .umul, 0
+ mov %i2, %o1
+ mov %i0, %o1
+ mov %o0, %l0
+ call .umul, 0
+ mov %i3, %o0
+ mov 0, %l1
+ add %l0, %o0, %l0
+ addcc %l3, %l1, %i1
+ addx %l2, %l0, %i0
+ jmp %i7+8
+ restore
+ .size __muldi3, .-__muldi3
diff --git a/usr/klibc/arch/sparc/crt0.S b/usr/klibc/arch/sparc/crt0.S
new file mode 100644
index 0000000..63db188
--- /dev/null
+++ b/usr/klibc/arch/sparc/crt0.S
@@ -0,0 +1,2 @@
+#define TARGET_PTR_SIZE 32
+#include "crt0i.S&qu...
2006 Jun 28
35
[klibc 00/31] klibc as a historyless patchset (updated and reorganized)
I have updated the klibc patchset based on feedback received. In
particular, the patchset has been reorganized so as not to break
git-bisect.
Additionally, this updates the patch base to 2.6.17-git12
(d38b69689c349f35502b92e20dafb30c62d49d63) and klibc 1.4.8; the main
difference on the klibc side is removal of obsolete code.
This is also available as a git tree at: