search for: osre

On 10/27/10 8:34 PM, Eli Friedman wrote: > On Wed, Oct 27, 2010 at 1:29 PM, Brian West<bnwest at rice.edu> wrote: >> Here is the patch for the new Operator Strength Reduction optimization >> pass that I have written. The bulk of the code is in >> >> lib/Transforms/Scalar/OperatorStrengthReduce.cpp >> >> The algorithm finds reduction opportunities in

On Thu, Oct 28, 2010 at 9:38 AM, Brian West <bnwest at rice.edu> wrote: >> 3. LLVM already has a significant amount of infrastructure for loop >> passes; why does this pass have its own code for finding loops? > > I saw the loop infrastructure for CFG loops. This algorithm finds loops in > the data flow (more precisely: strongly-connected components in the >

Eli Friedman <eli.friedman <at> gmail.com> writes: > >> > I did not mention in the original email (and should have) that OSR needs > >> > -instcombine to be run after it for cleanup. Also -licm, -reassociate, -gvn > >> > and -sccp can be enabling optimizations for OSR. > >> > >> Hmm... perhaps that could be partially fixed

On 10/29/10 1:26 PM, Eli Friedman wrote: > Sure, but you know which induction variables you created; you can just > zap the unused ones at the end of the pass, no? This is feasible. We would have to collect more information during OSR proper pass and add logic to cleanup at the end. >> FWIW I noticed that other optimizations (as seen in StandardPasses.h) are >> followed by

Eli Friedman <eli.friedman <at> gmail.com> writes: > > Empirically the OSR optimization is compile-time faster than LSR. I have > > also noticed that OSR has more "analysis" requirements: Induction Variable > > User, Natural Loop Information, Canonicalize natural loops, and Scalar > > Evolution Analysis. Both OSR and LSR require the Dominator Tree

> > A big downside of the current LSR algorithm is it's slow. I had initially > hoped that some of the heuristics would protect it better, but the problem > is > more complex than I had expected. I haven't done any measurements, > but it's likely that OSR is faster, which may interest some people > regardless > of how the output compares. > A few years

On Oct 29, 2010, at 12:20 PM, Brian West wrote: > On 10/29/10 1:26 PM, Eli Friedman wrote: >> Sure, but you know which induction variables you created; you can just >> zap the unused ones at the end of the pass, no? > This is feasible. We would have to collect more information during OSR > proper pass and add logic to cleanup at the end. > >>> FWIW I noticed

On Fri, Oct 29, 2010 at 11:18 AM, Brian West <bnwest at rice.edu> wrote: > Eli Friedman <eli.friedman <at> gmail.com> writes: >> >> > I did not mention in the original email (and should have) that OSR >> >> > needs >> >> > -instcombine to be run after it for cleanup. Also -licm, >> >> > -reassociate, -gvn >>

On Wed, Oct 27, 2010 at 1:29 PM, Brian West <bnwest at rice.edu> wrote: > Here is the patch for the new Operator Strength Reduction optimization > pass that I have written.  The bulk of the code is in > > lib/Transforms/Scalar/OperatorStrengthReduce.cpp > > The algorithm finds reduction opportunities in both array accesses and > explicit multiplications within loops.

On 11/13/10 11:05 PM, Daniel Berlin wrote: > > A big downside of the current LSR algorithm is it's slow. I had > initially > hoped that some of the heuristics would protect it better, but the > problem is > more complex than I had expected. I haven't done any measurements, > but it's likely that OSR is faster, which may interest some

Here is the patch for the new Operator Strength Reduction optimization pass that I have written. The bulk of the code is in lib/Transforms/Scalar/OperatorStrengthReduce.cpp The optimization is based on the algorithm described within the paper that can be found here: http://portal.acm.org/citation.cfm?id=504709.504710 Keith D. Cooper , L. Taylor Simpson , Christopher A. Vick, Operator strength

Evan Cheng <evan.cheng <at> apple.com> writes: > Eli is right. We do need to see some benchmark numbers and understand how the pass will fit in the target > independent optimizer. While we encourage contribution, we typically don't commit new passes unless it > introduce new functionalities that have active clients. It would also help if you provide us with compile

Downloaded Samba 2.2.8a and loaded into a Samba directory on UNIX 5.0.6 OSR system. Installed gcc compiler and patches as recommended from gcc.gnu.org. Went back to Samba directory and ran ./configure Upon executing ./configure The following message was written to the config.log file: This file contains any messages produced by compilers while running configure, to aid debugging if configure

On Mon, Nov 15, 2010 at 10:38 AM, Brian West <bnwest at rice.edu> wrote: > On 11/13/10 11:05 PM, Daniel Berlin wrote: > > A big downside of the current LSR algorithm is it's slow. I had >> initially >> hoped that some of the heuristics would protect it better, but the problem >> is >> more complex than I had expected. I haven't done any

Hi, openssh_cvs as of today, SCO Open Server 3.0, socklen_t this typedef doesn't exist on SCO OSR 3, and "configure" properly detects this, leading to /* #undef HAVE_SOCKLEN_T */ in config.h. Problem: I can't find any place where this is actually being used? I'd expect something like #ifndef HAVE_SOCKLEN_T typdef int socklen_t; #endif ("int" is what the

When the world was young, Ole Holm Nielsen carved some runes like this: > Date: Fri, 20 Nov 1998 12:03:59 +0100 > From: Ole Holm Nielsen <Ole.H.Nielsen@fysik.dtu.dk> > Subject: Re: Dial in accounts > Regarding remote network browsing: > We have had mixed success browsing Network Neighborhood from > PPP-connected Win95 PCs. Our servers are all SAMBA, no NT here :-)

In NT Explorer, my 9GB usr shares show up as 4GB. Any suggestions? Doug Smith

...s currently running 2.6.32-71.29.1.el6.x86_64 and I am considering trying vanilla kernel build to see if that corrects the issues. The hardware is HP DL145G3, and we have several other (non-cPanel) servers that are identical running CentOS 6.0 without issue. Any ideas? Thank you, -- James Shupe, OSRE developer/ engineer BSD/ Linux support & hosting jshupe at osre.org | www.osre.org O 9032530140 | F 9032530150 | M 9035223425 -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 836 bytes Desc: This is a digital...

> On Feb 11, 2016, at 12:43 AM, via llvm-dev <Alexander G. Riccio> wrote: > > I don’t think that we can agree to abstract code guidelines without knowing what it means in practice for the codebase. If you’re interested in this, please include a diff that shows the impact to the headers, and we should also measure what happens to the performance of the generated compiler. > >

I know syslinux supports FAT16 and works very well, but how about FAT32? Does syslinux support FAT32? If so, which version? eg., 3.11 and above Thanks!