search for: hi1

...a faster method that leverages existing R functionality? I feel like the hack below is pretty clunky and can be sped up on the true dataset. I would like to run a more efficient script many times adjusting the value of 'per'. ts <- 1:1000 examp <- data.frame(ts=ts, stage=sin(ts)) hi1 <- list() hi2 <- list() per <- 7 elev1 <- 0.6 elev2 <- 0.85 for(i in per:nrow(examp)){ examp_per <- examp[seq(i - (per - 1), i, by=1),] stg_hi_cond1 <- subset(examp_per, examp_per$stage > elev1) stg_hi_cond2 <- subset(examp_per, examp_per$stage > elev2)...

...teger(N->getOperand(0), InL, InH); SDValue NVBitsNode = DAG.getConstant(NVTBits, ShTy); SDValue Amt2 = DAG.getNode(ISD::SUB, dl, ShTy, NVBitsNode, Amt); SDValue Cmp = DAG.getSetCC(dl, TLI.getSetCCResultType(ShTy), Amt, NVBitsNode, ISD::SETULT); SDValue Lo1, Hi1, Lo2, Hi2; switch (N->getOpcode()) { default: llvm_unreachable("Unknown shift"); case ISD::SHL: // ShAmt < NVTBits Lo1 = DAG.getConstant(0, NVT); // Low part is zero. Hi1 = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); // High part from Lo part. /...

On Mon, Nov 30, 2009 at 7:22 PM, Javier Martinez <javier at jmartinez.org> wrote: > Hello, > > I'm working in adding support for 64-bit integers to my target. I'm using > LLVM to decompose the 64-bit integer operations by using 32-bit registers > wherever possible and emulating support where not. When looking at the bit > shift decomposition I saw what seems to be a

...it.r. I obtained and tested the following fitting estimates based on dat1: xmin <- 0.01715686 alpha <- 2.381581 I then simply wanted to print the observed and fitted dists in one plot, so I ran: library(ggplot2) library(VGAM) dat2 <- rpareto(length(dat1), location=xmin, shape=alpha) hi1 <- hist(dat1, plot=FALSE, breaks="FD") hi2 <- hist(dat2, plot=FALSE, breaks="FD") y1 <- hi1$counts/sum(hi1$counts) y2 <- hi2$counts/sum(hi2$counts) x1 <- hi1$mids x2 <- hi2$mids qplot() + geom_line(aes(x=x1,y=y1)) + geom_line(aes(x=x2,y=y2), color="red&...

...to last. neither of which are clear enough to disambiguate this. Example: library(MASS) data(quine) quine.hi <- aov(log(Days + 2.5) ~ .^4, quine) quine.nxt <- update(quine.hi, . ~ . - Eth:Sex:Age:Lrn) quine.lo <- aov(log(Days+2.5) ~ 1, quine) anova(quine.hi, quine.nxt, quine.lo) quine.hi1 <- glm(log(Days + 2.5) ~ .^4, data=quine) quine.nxt1 <- update(quine.hi1, . ~ . - Eth:Sex:Age:Lrn) quine.lo1 <- glm(log(Days+2.5) ~ 1, data=quine) anova(quine.hi1, quine.nxt1, quine.lo1, test="F") S: Resid. Df RSS Test Df Sum of Sq F Value Pr(F) 1...

Hi, I want to use the value of variable to quote elements in matrix. For example, I have a matrix like:               y1   y2m1         1      2m2         3      4 where y1,y2,m1,m2 are column and row names.  I have two random character variable, say x,  that could be either  y1 or y2  and  y that could be either m1 or m2.  So can I  do like   Matrix[y,x] to quote elements?  I've tried this

...he addition to be done (IIRC) by using shufflevector to split the vector into two, followed by an addition of the two halves, repeatedly. In fact for your case you could do something similar: %lo1 = shufflevector <4 x i1> %16, <4 x i1> undef, <2 x i32> <i32 0, i32 1> %hi1 = shufflevector <4 x i1> %16, <4 x i1> undef, <2 x i32> <i32 2, i32 3> %join = or <2 x i1> %lo1, %hi1 %lo2 = extractelement <2 x i1> %join, i32 0 %hi2 = extractelement <2 x i1> %join, i32 1 %final = or i1 %lo2, %hi2 Currently I would expect the...

Hi all, llvm newbie here. I'm trying to branch based on a vector compare. I've found a slow way (below) which goes through memory. Is there some idiom I'm missing so that it would use for instance movmsk for SSE or vcmpgt & cr6 for altivec? Or do I need to resort to calling the intrinsic directly? Thanks, Stephen. %16 = fcmp ogt <4 x float> %15, %cr %17 =

I just also wanted to mention that I have the current released source tarballs downloaded and placed at http://people.debian.org/~jbouse/xen/ at this time. As the only way to get the source tarballs I've found is via bittorrent unless you want to give your email address I'll continue to keep the the current tarball located there. That is one thing that I noticed about Ralph's

On Wed, May 20, 2009 at 4:55 PM, Dan Gohman <gohman at apple.com> wrote: > Can you explain why you chose the approach of using a new pass? > I pictured removing LegalizeDAG's type legalization code would > mostly consist of finding all the places that use TLI.getTypeAction > and just deleting code for handling its Expand and Promote. Are you > anticipating something more

On May 20, 2009, at 1:34 PM, Eli Friedman wrote: > On Wed, May 20, 2009 at 1:19 PM, Eli Friedman > <eli.friedman at gmail.com> wrote: > >> Per subject, this patch adding an additional pass to handle vector >> >> operations; the idea is that this allows removing the code from >> >> LegalizeDAG that handles illegal types, which should be a significant

...SDValue LHSLo, LHSHi, RHSLo, RHSHi; - ExpandOp(LHS, LHSLo, LHSHi); - ExpandOp(RHS, RHSLo, RHSHi); - ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get(); - - if (VT==MVT::ppcf128) { - // FIXME: This generated code sucks. We want to generate - // FCMPU crN, hi1, hi2 - // BNE crN, L: - // FCMPU crN, lo1, lo2 - // The following can be improved, but not that much. - Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()), - LHSHi, RHSHi, ISD::SETOEQ); - Tmp2 = DAG.getSetCC(dl, TLI...