search for: unoptimiz

Hi all, I have a property, defined in an external stylesheet: .my_class { background-color: #FF0000; } I want to retrieve the value of this background-color of the class my_class. How can I do that with prototype/scriptaculous ? Thanks in advance, Nicolas Terray

...ia32-specific > option that showed consistent value was -momit-leaf-frame-pointer. > > The genetic algorithm was able to find sets of flags that produced > faster code than that emitted by the default -O1, -O2, and -O3 options > (with the exception of almabench, which is largely unoptimizable by > nature). In many cases, this was due to the inclusion of "new" flags > introduced with more recent version of GCC. Acovea discovers additional > options that improve performance over that provided by the default > settings; in essence, the genetic algorithm determ...

...g transformations on the > specified function. What about module passes? Do you want to disable all module passes in a TU which contains a single one of these? I'll be unhappy if we need to litter checks throughout the module passes that determine whether a given instruction is inside an unoptimizable function or not. Saying that module passes are exempt from checking the 'noopt' attribute is fine to me, but then somebody needs to know how to module passes (and users may be surprised to discover that adding such an annotation to one function will cause seemingly-unrelated functio...

...gt;> option that showed consistent value was -momit-leaf-frame-pointer. >> >> The genetic algorithm was able to find sets of flags that produced >> faster code than that emitted by the default -O1, -O2, and -O3 options >> (with the exception of almabench, which is largely unoptimizable by >> nature). In many cases, this was due to the inclusion of "new" flags >> introduced with more recent version of GCC. Acovea discovers >> additional >> options that improve performance over that provided by the default >> settings; in essence, the ge...

...rt of the reason I abandoned this project was because of limitations in LLVM's garbage collection intrinsics, which I have written about extensively on this list. The current llvm.gcroot strategy requires the frontend to be very complex, generate highly inefficient code, and that code is mostly unoptimizable since LLVM's optimizers generally won't touch a value that has been marked as a GC root. Worse, the support for GC in the LLVM community is fairly low - the garbage collection intrinsics in LLVM have not been updated or improved in the 7 years of my following the project, and there'...

...t; > > > What about module passes? Do you want to disable all module passes in a > > TU which contains a single one of these? I'll be unhappy if we need to > > litter checks throughout the module passes that determine whether a > > given instruction is inside an unoptimizable function or not. Saying > > that module passes are exempt from checking the 'noopt' attribute is > > fine to me, but then somebody needs to know how to module passes (and > > users may be surprised to discover that adding such an annotation to one > > functi...

Hi, I previously made a proposal for adding a pragma for per-function optimization level control due to a number of requests from our customers (See http://comments.gmane.org/gmane.comp.compilers.clang.devel/28958 for the previous discussion), however the discussion was inconclusive. Some of my colleagues recently had the opportunity to discuss the proposal with a number of people at and

...showed consistent value was -momit-leaf-frame-pointer. > >> > >> The genetic algorithm was able to find sets of flags that produced > >> faster code than that emitted by the default -O1, -O2, and -O3 options > >> (with the exception of almabench, which is largely unoptimizable by > >> nature). In many cases, this was due to the inclusion of "new" flags > >> introduced with more recent version of GCC. Acovea discovers > >> additional > >> options that improve performance over that provided by the default > >> set...

Hello llvm-dev! My colleages and I are currently evaluating llvm's suitability as a JIT compiler interfacing with a precise, relocating garbage collector. While we couldn't find code or writeups that deal with the issues specific to this design goal, it is entirely possible that we may have missed something; we would appreciate references to relevant code or writeups that people on this

...> What about module passes? Do you want to disable all module passes in > a >>> TU which contains a single one of these? I'll be unhappy if we need to > >>> litter checks throughout the module passes that determine whether a >>> given instruction is inside an unoptimizable function or not. Saying >>> that module passes are exempt from checking the 'noopt' attribute is >>> fine to me, but then somebody needs to know how to module passes (and >>> users may be surprised to discover that adding such an annotation to > one >&gt...

...hat about module passes? Do you want to disable all module passes in > a > > > TU which contains a single one of these? I'll be unhappy if we need to > > > > litter checks throughout the module passes that determine whether a > > > given instruction is inside an unoptimizable function or not. Saying > > > that module passes are exempt from checking the 'noopt' attribute is > > > fine to me, but then somebody needs to know how to module passes (and > > > users may be surprised to discover that adding such an annotation to > one &...

Hi David: >> How do you deal with basic blocks which appear to be used by multiple parts >> of the coroutine? We handled this in WinEHPrepare by cloning any BBs which >> were shared. I experimented with several approaches, but, cloning ended up being the simplest and most reliable. Suspend points express three different control flows that can happen at the suspend point: a

Please review the properties of an address space which are configurable via the data layout.  For example, bitwidth is one of those parameters.  If that parameter space covers your needs, then you do not need LLVM side support. Philip On 7/30/19 2:59 PM, Amy Huang wrote: > Thanks for the info-- > It seems like the way to do this is for clang to use address spaces to > represent

<font size=2 face="sans-serif">Hi Johannes,</font><br><br><font size=2 face="sans-serif">Thank you for the explanation.</font><br><br><font size=2 face="sans-serif">I think we need to clarify some details about code generation in Clang today:</font><br><br><font size=2

Hi, Apologies for the very late response. We have manually tried the idea with a very simple Fibonacci sequence code. While being very very simple, the recursion cannot be handled by TRE. Because there are two recursive callsites, it also needs to keep some sort of state across iterations of the "while(stack not empty)" loop. We get between 2.5 and 8x slowdowns depending on which