search for: subsume

...of the rule that checks for empty lines at EOF. The one in maint.mk is much more efficient: >From cf93f04a980ec01ef37db9a0d4c7b99015169eee Mon Sep 17 00:00:00 2001 From: Jim Meyering <meyering at redhat.com> Date: Mon, 17 Sep 2012 11:49:34 +0200 Subject: [PATCH libguestfs] maint: remove a subsumed syntax-check rule * cfg.mk (sc_prohibit_trailing_blank_lines): Remove rule. It is now subsumed by the much more efficient sc_prohibit_empty_lines_at_EOF rule in gnulib's maint.mk. --- cfg.mk | 12 +----------- 1 file changed, 1 insertion(+), 11 deletions(-) diff --git a/cfg.mk b/cfg.mk ind...

I am trying to removing a load to a TargetGlobalAddress in ISelDagToDag that my backend does not support. The TargetGlobalAddress is assumed to always be of ConstantInt or ConstantFP type, so this transformation is valid. I am correctly able to modify the dag and remove all of the uses of the node as specified in the attached before and after dot images. The nodes in question is the

On 2015-04-04, Bill Maltby (C4B) <centos4bill at gmail.com> wrote: > On Sat, 2015-04-04 at 11:12 +0100, Nux! wrote: >> 100% with Digimer here. <snip> > >> All this energy should be put into contributing towards to the >> project, testing, helping out community. > > Well, I used to agree. But when a bug report filed in December goes > untouched entering

...os << "Test" << "{0}"_fs << 7; ~Aaron > > I'm not a huge fan of streaming, but if we want to go this route, I'd very > much like to keep the syntax short and sweet. "format" is pretty great for > that. If this is going to fully subsume its use cases, can we eventually get > that to be the name? > > (While I don't like streaming, I'm not trying to fight that battle here...) > > Also, you should probably look at what is quickly becoming a popular C++ > library in this space: https://github.com/fmtlib/fmt &...

...y. This could create a custom target with dependencies appropriately configured to build after Clang. The custom target would run CMake to configure the project like an outside build and then launch the build. IIUC there is a desire for Clang to be able to be built externally to LLVM rather than subsumed into its build process. The top-level CMakeLists.txt file of Clang already has code to do that, though it can be much cleaner after my patches to LLVM to provide LLVMConfig.cmake are integrated. Then it will even be possible to build Clang using CMake against a LLVM that was built and installed...

...'glm', 'lm', 'nls' and 'gls', 'lme' and others in package 'nlme'." Thus, I was expecting that logLik.nls() and logLik.nlme() could be used for objects of the nls and nlme class, respectively. Are these functions no longer needed because logLike() subsumes logLike.nls() and logLike.nlme() as special cases? Did/does logLike.nls() and logLike.nlme() have any advantages above and beyond logLike() when applying them to nls and nlme objects? On a related note, is there a way to get the log likelihoods of each individual from an nlsList object? On p....

...ne") { ... } > Here, the notes include a comma separated list of strings. Note, the notes > are > only attached to functions definitions. They are not attached to call or > invoke > instructions. All supported notes must be documented in LLVM language > reference. Would this subsume calling convention and linkage and const/pure specification? (as well as "used" (or more appropriately "do-not-internalize")). It seems that it covers those too if it applied to function definitions and declarations and thus reduce all the extra function meta-data to one format...

...n vectors. You could instead provide >both direction vectors and polyhedral info through the interface, >with some way to check if either is available. So far I see 3 ways of expressing dependencies: - Loop level - Direction vector - Polyhedral representation Polyhedral representation subsume direction vector and direction vector subsume loop level. We can as well: - create a hierarchy of dependence type and implementing the logic for isa, cast and dyn_cast. - Provide some constructors to build a dependence type from a less precise one. This does not scale well with the number of type...

...the GVNPRE pass has been removed from the main trunk, though it is present in the 2.6 release. From the llvm-commits archive, I found that it was removed  with this checkin: http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20090928/088214.html "remove the GVNPRE pass. It has been subsumed by the GVN pass." Does the GVN pass optimize all the partial redundancies that were caught by the GVNPRE pass? Thanks, -Jaydeep

...l/superoptimizer.html and adapt them to run on LLVM code. It would seem that operating on LLVM code would save a lot of time because its semantics are much simpler than x86. The cost of operating on LLVM is that target-specific tricks would be missed. The outcome would be a new LLVM pass that subsumes at least the instruction combiner, and probably a few other passes as well. Benefits would include not missing cases missed by the current combiner and also more easily adapting to changes in the LLVM IR. All previous superoptimizers have worked on linear sequences of code. It would seem muc...

> > Well, I used to agree. But when a bug report filed in December goes > untouched entering April, which I don't recall happening prior to RH > subsuming the project, it takes away impetus to ever file one again from > lowly end users like me I think. It appears that you are the only one to have encountered this bug. Within any project, open source or proprietary; problems

...omparing against (for terms of precision)? I know --anders-aa seems to give me pretty good results. Online [1] it seemed to mention steensgaard's algorithm and some kind of data structure analysis, but neither of these are currently accepted by opt. Is there some way to get them, or are they subsumed by the results of --anders-aa? Thanks, Ben Chambers [1] http://llvm.org/docs/AliasAnalysis.html

...8 07:03, Nicolas Capens wrote: >> >>> 1) Does ScalarReplAggregates totally superscede >>> PromoteMemoryToRegister? I >> >> Nope, they are different. Mem2Reg is really important if you want >> register >> allocation. > > Actually SROA does fully subsume Mem2Reg. It iterates between breaking > up aggregates and promoting them to registers. > >>> think I need it to optimize small arrays, but what is the expected >>> added >>> complexity? >> >> I shouldn't think it would be very expensive at all. >...

100% with Digimer here. I think there are no conspiracy theories. IMO RedHat does not want nor does it afford to mess up CentOS. All this energy should be put into contributing towards to the project, testing, helping out community. Lucian -- Sent from the Delta quadrant using Borg technology! Nux! www.nux.ro ----- Original Message ----- > From: "Digimer" <lists at

...rint("unclosed function_b") # no closing } c.R: function_c <- function(){ print("function_c will be part of function_b") } #extra closing } to close function_b } -------- The package builder will import `a.R` and `b.R`. And because function_b was never closed, `c.R` gets subsumed into function_b. It's pretty hard to debug, and it means that a production implementation depends on the file structure never changing. (If you define a function across `b.R` and `d.R`, you can never add an R script that starts with `c`.) What's the benefit of letting functions be defined...

...ate all the logic from compiler-rt's cmake/config-ix.cmake about which sanitizers are supported on which targets. Maybe compiler-rt could have a new check-all-compiler-rt target, which runs the checks for all supported sanitizers? Is it possible to implement this (it would be a lit target that subsumes a bunch of other lit targets)? Any other ideas? Thanks, Jay.

...this: # LAD regression and related plot rq(formula = SBP ~ Age) f = coef(rq(SBP ~ Age)) pred = f[1] + f[2]*Age plot (Age, SBP) lines (Age, pred) # OLS regression and related plot Pred = lm(SBP ~ Age) plot (Age, SBP) lines (Age,fitted(Pred)) Well for comparatative reason I would would like to subsume both plots into a unifying plot and save them in one file.pdf. I tried to find an answer in FAQ and mailinglists archive, no luck. Maybe did miss an appropiate answer to my question, so a pointer to solve my problem woud be sufficient! Much thanks Thomas My system: platform i686-pc-linux-g...

...rote: > On Tuesday 20 May 2008 07:03, Nicolas Capens wrote: > >> 1) Does ScalarReplAggregates totally superscede >> PromoteMemoryToRegister? I > > Nope, they are different. Mem2Reg is really important if you want > register > allocation. Actually SROA does fully subsume Mem2Reg. It iterates between breaking up aggregates and promoting them to registers. >> think I need it to optimize small arrays, but what is the expected >> added >> complexity? > > I shouldn't think it would be very expensive at all. Agreed. >> 2) Does SCC...

...ot;{0}"_fs << 7; > > ~Aaron > > > > > I'm not a huge fan of streaming, but if we want to go this route, I'd > very > > much like to keep the syntax short and sweet. "format" is pretty great > for > > that. If this is going to fully subsume its use cases, can we eventually > get > > that to be the name? > > > > (While I don't like streaming, I'm not trying to fight that battle > here...) > > > > Also, you should probably look at what is quickly becoming a popular C++ > > library in thi...

...onsume 4 more opcodes, but it would not bloat the bytecode when natural alignment is used. 3. Create pseudo ops for 'attributed' load/store instructions. These instructions contain a set of optional attributes encoded in some way. The current volatile load/store instructions could be subsumed by these instructions. I'm leaning away from 1, but unsure whether 2 or 3 is better. Thanks -- Christopher Lamb -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20070331/67fc5c79/attachment.html>