similar to: [LLVMdev] Question about Value Range Propagation

Hi, Gratian, I did that Summer of Code. I used a different algorithm than Patterson's. It is a constraint system by Su and Wagner, which is more modern, and has some advantages over older works. In particular, it is non-iterative. I found it very hard to compare it with Patterson's analysis, because there is not much description in that paper. However, there is another paper, by

Hi Andrey, > On 21.02.2011 20:27, Douglas do Couto Teixeira wrote: >> My work is not part of the LLVM mainline yet. But I would be happy to >> contribute with the code of my range analysis implementation if it can help >> you in something else. > We were thinking of adding VRP to LLVM too, though we were mostly > interested in Patterson's approach (i.e. not

Hi Douglas, On 21.02.2011 20:27, Douglas do Couto Teixeira wrote: > My work is not part of the LLVM mainline yet. But I would be happy to > contribute with the code of my range analysis implementation if it can help > you in something else. We were thinking of adding VRP to LLVM too, though we were mostly interested in Patterson's approach (i.e. not connected with SSI form). It

On Dec 28, 2010, at 9:39 AM, Lup Gratian wrote: > I recently downloaded LLVM 2.8 and started playing with the optimizations a bit. > I saw something curious while trying the following function: > > int g(unsigned int a) { > unsigned int c[100]; > c[10] = a; > c[11] = a; > unsigned int b = c[10] + c[11]; > > if(b > a*2) a = 4; > else a = 8; >

On Dec 28, 2010, at 12:48 PM, Chris Lattner wrote: > On Dec 28, 2010, at 9:39 AM, Lup Gratian wrote: >> I find it strange that it hasn't found that %add and %mul have the same value, %cmp would be then false, selecting and returning 15. If 'a' is replaced by a constant it works. > > You're right, that is a missed optimization. I added it to the missed optimization

I recently downloaded LLVM 2.8 and started playing with the optimizations a bit. I saw something curious while trying the following function: int g(unsigned int a) { unsigned int c[100]; c[10] = a; c[11] = a; unsigned int b = c[10] + c[11]; if(b > a*2) a = 4; else a = 8; return a + 7; } The generated code, with -O3 activated, is define i32 @g(i32 a) nounwind readnone { %add = shl i32

On Tue, Feb 22, 2011 at 6:19 AM, Duncan Sands <baldrick at free.fr> wrote: > the big problem with Patterson's VRP is that it is expensive in terms of > compile time.  LLVM used to have some passes (ABCD, predsimplify) that did > this kind of thing, but they were removed essentially because their compile > time was too great for the goodness they brought. Any reason not to

Hi, Andrey, sorry for the delay: I made a page with the code available for download: http://homepages.dcc.ufmg.br/~douglas/projects/RangeAnalysis/RangeAnalysis.html Feel free to get it, and if you need some help, I will be happy to tell you how to set the analysis up, in case the explanation in the page is not good. I also have a report describing the implementation here: (

Can't read your paper because the permission is not set. Chuck On 2/25/2011 12:16 PM, Douglas do Couto Teixeira wrote: > Hi, Andrey, > > sorry for the delay: I made a page with the code available for > download: > http://homepages.dcc.ufmg.br/~douglas/projects/RangeAnalysis/RangeAnalysis.html >

Hi, LLVMers, has someone implemented bitwidth analysis for LLVM? I was looking for something similar to the bitwise compiler described in "Bidwidth analysis with application to silicon compilation, by Mark Stephenson, Jonathan Babb and Saman Amarasinghe" e.g.: http://portal.acm.org/citation.cfm?id=349299.349317 all the best, Fernando

Dear LLVMers, my name is Douglas, and I would like to participate in the Summer of Code this year. I am currently a Computer Science student at the Federal University of Minas Gerais, Brazil, and I work as a research assistant at the Programming Languages Lab, in that university. I work together with Andre Tavares and Andrei Rimsa, two summer of coders last year, and my advisor is Fernando

Hi! My name is Gratian and I would like to participate to GSOC 2011. I'm interested in profile-guided optimizations, and I want to implement two optimizations that can bring tangible benefits for most applications: profile-guided function inlining and basic block positioning. Inlining can be greatly improved if we take into consideration how many times the function we want to inline was

On Wed, Mar 23, 2011 at 6:24 PM, John Criswell <criswell at illinois.edu> wrote: > > > On 3/23/11 8:06 AM, Douglas do Couto Teixeira wrote: > > > > the execution of a program. Thus, for each integer variable, a range > > analysis determines its lower and upper limits. A very simple range analysis > > > would, for instance, map each variable to the limits

Hello, I have a pretty standard two-interface setup with masquerading, so the local network can connect through the firewall to the Internet. On the firewall box (trevor), eth0 is connected to a cable modem and eth1 is connected to the local network via a crossed cable. There is one other machine on the local network (brian), whose eth0 is at the other end of the crossed cable. I used to have

Hello, all; I get an unexpected result when trying to plot a probability histogram with R1.9.1 on windows xp: #with the following code: > x <- runif(100,0,1) > hist(x) > hist(x, freq=F) > h <- hist(x, freq=F) > summary(h) # Length Class Mode #breaks 11 -none- numeric #counts 10 -none- numeric #intensities 10 -none- numeric #density 10

Hi all, Can I safely assume that each migration is excuted within a transaction, so that''s it''s safe to have migrations executing failing statements? Thanks, - Rowan -- Morality is usually taught by the immoral.

Dear R-help, Please can someone explain how to put a column name on an output data.frame. ##Starting with a data.frame with 3 columns (d$Year, d$NoIndiv, d$wtd_tl) yr_ind <- split (d$NoIndiv, d$Year) yr_tl <- split (d$wtd_tl, d$Year) ann_ind <- sapply (yr_ind, sum) ann_tl <- sapply (yr_tl, sum) av_tl <- ann_tl/ann_ind d2<- data.frame (av_tl) ##This gives me a data.frame

I second the motion. All in favor? On Fri, Apr 1, 2016 at 10:57 AM, Renato Golin via cfe-dev < cfe-dev at lists.llvm.org> wrote: > On 1 April 2016 at 18:50, Richard Smith via cfe-dev > <cfe-dev at lists.llvm.org> wrote: > > * The name has been used by a kickstarter project, causing incalculable > > confusion[0] > > Neal Stephenson has poetic license to do

So after successfully getting the test SQLite db to run from memory, I tried running some tests but found that somewhere in the schema translation from Postgres (my devel database) and SQLite Rails fails to properly set the ''id'' column, which breaks all kinds of things. Take as an example my ''users'' table. In Postgres the schema is (generated with pgAdmin III):

Full_Name: Alec Stephenson Version: 1.6.0 OS: linux Submission from: (NULL) (148.88.138.5) Appears to be a sign error in as.POSIX(lt/ct) > library("chron") The following is fine, with default origin. > tmp <- chron(1:2, origin = c(1,1,1970)) > as.POSIXlt(tmp) [1] "1970-01-02 01:00:00 GMT" "1970-01-03 01:00:00 GMT" These are not. > tmp <-