search for: slt

...there, I'm running R on windows 7 with Rstudio. Everyday I receive a zip file where a bunch of half-hourly files are zipped together. I then use xx=unzip(ind) to get xx, which consists of : [1] "./2011/A20112961503.flx" "./2011/A20112961503.log" "./2011/A20113211730.slt" "./2011/A20113211800.slt" "./2011/A20113211830.slt" "./2011/A20113211900.slt" [7] "./2011/A20113211930.slt" "./2011/A20113212000.slt" "./2011/A20113212030.slt" "./2011/A20113212100.slt" "./2011/A20113212130.slt"...

Hi all, I'm trying to get llvm to optimize away the %cmp to true in define i32 @foo(i32* %array, i32* %length_ptr, i32 %init) { entry: %length = load i32* %length_ptr, !range !0 %len.sub.1 = sub i32 %length, 1 %upper = icmp slt i32 %init, %len.sub.1 br i1 %upper, label %loop, label %exit loop: %civ = phi i32 [ %init, %entry ], [ %civ.inc, %latch ] %civ.inc = add i32 %civ, 1 %cmp = icmp slt i32 %civ.inc, %length br i1 %cmp, label %latch, label %break latch: store i32 0, i32* %array %check = icmp slt i32 %...

...;> >> I'm trying to get llvm to optimize away the %cmp to true in >> >> define i32 @foo(i32* %array, i32* %length_ptr, i32 %init) { >> entry: >> %length = load i32* %length_ptr, !range !0 >> %len.sub.1 = sub i32 %length, 1 >> %upper = icmp slt i32 %init, %len.sub.1 >> br i1 %upper, label %loop, label %exit >> >> loop: >> %civ = phi i32 [ %init, %entry ], [ %civ.inc, %latch ] >> %civ.inc = add i32 %civ, 1 >> %cmp = icmp slt i32 %civ.inc, %length >> br i1 %cmp, label %latch, label...

...two lots of i32 with a promotion? Expansion is expensive, so two lots of i32 would be best. I suggest the following scheme: (3) Suppose T is larger than the largest legal type. Look at all the legal types LT for which bitwidth T <= 2 * bitwidth of LT If there is one, take the smallest one (SLT) and promote T to 2*SLT. If there are none (because bitwidth T is too big), look at all the legal types LT for which bitwidth T <= 4 * bitwidth of LT If there is one, take the smallest one (SLT) and promote T to 4*SLT. Continue with 8*, 16* etc. For example, if i24 and i32 are the legal type...

...zilla" out of which I want to copy across 2 files. I have constructed the following rsync invocation: rsync -e ssh -av --delete \ --exclude='/rpm/BUILD' --exclude='/rpm/SOURCES' --exclude='/rpm/SPECS' --exclude='/rpm/RPMS' \ --include='.mozilla/arb/kfgj0v2y.slt/bookmarks.html' \ --include='.mozilla/arb/kfgj0v2y.slt/prefs.js' \ --exclude='.mozilla' \ .mozilla \ rpm \ $SERVER:laptop-backup Now, this works correct for the "rpm" directory, by only copying rpm/SRPMS, and leaving out rpm/BUILD, rpm/SOURCES, /rpm/SPECS and rpm/RPMS...

...R which leads to 6 different asm outputs for x86. Which of these should we choose as canonical IR form? 1. Two selects int zero_negone_one(int x, int y) { if (x == y) return 0; if (x < y) return -1; return 1; } define i32 @zero_negone_one(i32, i32) { %3 = icmp eq i32 %0, %1 %4 = icmp slt i32 %0, %1 %5 = select i1 %4, i32 -1, i32 1 %6 = select i1 %3, i32 0, i32 %5 ret i32 %6 } 2. Two selects, but different int zero_one_negone(int x, int y) { if (x == y) return 0; if (x > y) return 1; return -1; } define i32 @zero_one_negone(i32, i32) { %3 = icmp eq i32 %0, %1 %...

...due >>>> to lost debug info. >>>> For example, >>>> 1: if (x < 0) >>>> 2: if (y < 0) >>>> 3: do_something(); >>>> is transformed into something like >>>> %0 = and i32 %y, %x >>>> %1 = icmp slt i32 %0, 0 >>>> br i1 %1, label %if.then2, label %if.end3 >>>> where all 3 instructions are associated with line 1. >>>> >>>> This patch disables folding of conditional branches in functions with >>>> sanitize_memory attribute. >>&g...

...t a, unsigned short * in, unsigned short * out) { for (unsigned short w = 1; w < a - 1; w++) //this will never overflow out[w] = in[w+7] * 2; } I think it will be sufficient to add a couple of new cases to ScalarEvolution::HowManyLessThans -- zext(A) ult zext(B) == A ult B sext(A) slt sext(B) == A slt B Currently it bails out if it sees a non-add recurrence on the LHS of the ult/slt. You could also teach ScalarEvolution::isImpliedCondOperands the following: zext(A) ult zext(B) <=> A ult B sext(A) slt sext(B) <=> A slt B to get more aggressive promotion from e...

Inspired by Rudolf Biczok's query of Fri, Jan 23, 2009 at 1:25 AM, I tried to implement iteration in a generic way using S4. (Though I am admittedly still struggling with learning S4.) > setClass("foo",representation(bar="list")) [1] "foo" > x<-new("foo",bar=list(1,2,3)) Given this, I would not expect for(i in x)... to work, since R has no way

...debug info. >>>>> For example, >>>>> 1: if (x < 0) >>>>> 2: if (y < 0) >>>>> 3: do_something(); >>>>> is transformed into something like >>>>> %0 = and i32 %y, %x >>>>> %1 = icmp slt i32 %0, 0 >>>>> br i1 %1, label %if.then2, label %if.end3 >>>>> where all 3 instructions are associated with line 1. >>>>> >>>>> This patch disables folding of conditional branches in functions with >>>>> sanitize_memory a...

I have a new SMART1050SLT Tripp Lite UPS that both tripplite and tripplitesu drivers hate. Both simply time out with a "can't find" message. Does anyone know about the SmartPro series?

...usefull for somebody over here. ================================ mainlocation ================================ %userprofile%\Application data\Mozilla\Profiles\%profile%\%salted%\... %userprofile% = C:\Documents and settings\%username% %profile% = "default" %salted% = "12345678.slt" (8 cijfers/letters) folders - Cache - Mail - ImapMail files - prefs.js - abook.mab - bookmarks.html ================================ Methode for making standard salted path ================================ rename"12345678.slt" to "unsalted.slt" Start mozilla Remove...

...;>> For example, >>>>>> 1: if (x < 0) >>>>>> 2: if (y < 0) >>>>>> 3: do_something(); >>>>>> is transformed into something like >>>>>> %0 = and i32 %y, %x >>>>>> %1 = icmp slt i32 %0, 0 >>>>>> br i1 %1, label %if.then2, label %if.end3 >>>>>> where all 3 instructions are associated with line 1. >>>>>> >>>>>> This patch disables folding of conditional branches in functions with >>>>>&g...

...%i = alloca i32, align 4 store i32 %n, i32* %1, align 4 store i32* %array_x, i32** %2, align 8 store i32 0, i32* %i, align 4 br label %3 ; <label>:3 ; preds = %13, %0 %4 = load i32, i32* %i, align 4 %5 = load i32, i32* %1, align 4 %6 = icmp slt i32 %4, %5 br i1 %6, label %7, label %16 ; <label>:7 ; preds = %3 %8 = load i32, i32* %i, align 4 %9 = load i32, i32* %i, align 4 %10 = sext i32 %9 to i64 %11 = load i32*, i32** %2, align 8 %12 = getelementptr inbounds i32, i32* %11, i64 %10...

Hi, I'm looking for some guidance on whether to use S4 or Reference Classes for an analysis application I'm developing. I'm a C++/Python developer, and like to 'think' in OOD. I started my app with S4, thinking that was the best set of OO features in R. However, it appears that one needs Reference Classes to allow object methods to assign values (other than

...;>> For example, >>>>>> 1: if (x < 0) >>>>>> 2: if (y < 0) >>>>>> 3: do_something(); >>>>>> is transformed into something like >>>>>> %0 = and i32 %y, %x >>>>>> %1 = icmp slt i32 %0, 0 >>>>>> br i1 %1, label %if.then2, label %if.end3 >>>>>> where all 3 instructions are associated with line 1. >>>>>> >>>>>> This patch disables folding of conditional branches in functions with >>>>>&g...

..., i32* %1, align 4 > store i32* %array_x, i32** %2, align 8 > store i32 0, i32* %i, align 4 > br label %3 > > ; <label>:3 ; preds = %13, %0 > %4 = load i32, i32* %i, align 4 > %5 = load i32, i32* %1, align 4 > %6 = icmp slt i32 %4, %5 > br i1 %6, label %7, label %16 > > ; <label>:7 ; preds = %3 > %8 = load i32, i32* %i, align 4 > %9 = load i32, i32* %i, align 4 > %10 = sext i32 %9 to i64 > %11 = load i32*, i32** %2, align 8 > %12 = getelem...

...te an index variable to pointer size. However that introduces truncations, which can't be optimized away by simple peephole optimizations in the backend anymore. Does it make sense to add a target hook for this? -Manuel Example: define void @foo(i32 %n, i32* %a) { entry: %cmp1 = icmp slt i32 0, %n br i1 %cmp1, label %for.body, label %for.end for.body: ; preds = %for.body, %entry %i = phi i32 [ %inc, %for.body ], [ 0, %entry ] %ptr = getelementptr inbounds i32, i32* %a, i32 %i store i32 %i, i32* %ptr, align 4 %inc = add nsw i3...

...t;>>>>> 1: if (x < 0) > >>>>>> 2: if (y < 0) > >>>>>> 3: do_something(); > >>>>>> is transformed into something like > >>>>>> %0 = and i32 %y, %x > >>>>>> %1 = icmp slt i32 %0, 0 > >>>>>> br i1 %1, label %if.then2, label %if.end3 where all 3 > >>>>>> instructions are associated with line 1. > >>>>>> > >>>>>> This patch disables folding of conditional branches in functions > &g...

I actually think it is a problem with the optimizer like Kay first thought. -instcombine seems turning "((x and 6) shl 5) slt 32" into "(x and 6) slt 1". If the comparison were unsigned or the shl had a nsw flag, I think this would be okay. Since none of these is true, I don't think this transformation is correct. H. On Sat, Nov 16, 2013 at 1:41 AM, Mark Lacey <mark.lacey at apple.com> wrote:...