search for: lno

...much smaller and hence enable lots of downstream optimizations. This sound >> to be a big win for control-intensive programs where Loop-nest-opt normally is a big, expensive no-op. >> >> The con side is that, as you said, the nest is not perfect any more. However, I would argue LNO optimizations >> should be able to tackle the cases when imperfect part is simple enough (say, no call, no control etc). >> (FYI, Open64's LNO is able to tackle imperfect nesting so long as imperfect part is simple). Or you just reverse >> the LICM, that dosen't sound har...

...ownstream optimizations. This sound >>> to be a big win for control-intensive programs where Loop-nest-opt >>> normally is a big, expensive no-op. >>> >>> The con side is that, as you said, the nest is not perfect any >>> more. However, I would argue LNO optimizations >>> should be able to tackle the cases when imperfect part is simple >>> enough (say, no call, no control etc). >>> (FYI, Open64's LNO is able to tackle imperfect nesting so long as >>> imperfect part is simple). Or you just reverse >>&...

...to think that exponentially distributed data fits better with a lognormal distribution, and vice versa. For example, X <- rexp(1000) Gexp <- gamlss(X~1,family=EXP) # X~1 is X tilde 1 GAMLSS-RS iteration 1: Global Deviance = 2037.825 GAMLSS-RS iteration 2: Global Deviance = 2037.825 Glno <- gamlss(X~1,family=LNO) GAMLSS-RS iteration 1: Global Deviance = 2185.763 GAMLSS-RS iteration 2: Global Deviance = 2185.763 Gexp$aic [1] 2039.825 Glno$aic [1] 2189.763 Can anybody shed light on why these results would occur? cheers, RdR -- View this message in context: http://r.789695...

...ken care of later. > Yes, LICM will make perfect nesting become imperfect. When I define pre-ipo pass, I also take this into account as well. I think for a while, and are not able to figure out any strong reason for running or not running LICM in pre-ipo pass, or other compilation phase before LNO. The pro for running LICM early is that it may move big redundant stuff out of loop nest. You never know how big it is. In case you are lucky , you can move lot of stuff out of loop, the loop may become much smaller and hence enable lots of downstream optimizations. This sound to be a big wi...

...ons. This sound >>>> to be a big win for control-intensive programs where Loop-nest-opt >>>> normally is a big, expensive no-op. >>>> >>>> The con side is that, as you said, the nest is not perfect any >>>> more. However, I would argue LNO optimizations >>>> should be able to tackle the cases when imperfect part is simple >>>> enough (say, no call, no control etc). >>>> (FYI, Open64's LNO is able to tackle imperfect nesting so long as >>>> imperfect part is simple). Or you just r...

...p may become much smaller and hence enable lots of downstream optimizations. This sound > to be a big win for control-intensive programs where Loop-nest-opt normally is a big, expensive no-op. > > The con side is that, as you said, the nest is not perfect any more. However, I would argue LNO optimizations > should be able to tackle the cases when imperfect part is simple enough (say, no call, no control etc). > (FYI, Open64's LNO is able to tackle imperfect nesting so long as imperfect part is simple). Or you just reverse > the LICM, that dosen't sound hard. FWIW, I...

On 7/31/2013 6:30 PM, Tobias Grosser wrote: > > I can see us following Andrews > suggestion to disable LICM in case a LNO is run and having the LNO > schedule an additional set of cleanup passes later on. The way I was thinking about it is that LICM could be optionally added to the preparation steps, something like requiring loop-closed SSA form for certain transformations. -K -- Qualcomm Innovation Center, I...

...: > As said before, we could probably add it in between those two passes: > > MPM.add(createReassociatePass()); // Reassociate expressions > + addExtensionsToPM(EP_LoopOptimizerStart, MPM); > MPM.add(createLoopRotatePass()); // Rotate Loop As this is in the middle of other LNO passes, can you please rename s/EP_LoopOptimizerStart/EP_Polly_LNO/ or anything other than LoopOptimizerStart? Thanks, Sebastian -- Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum, hosted by The Linux Foundation

...could probably add it in between those two passes: >> >> MPM.add(createReassociatePass()); // Reassociate expressions >> + addExtensionsToPM(EP_LoopOptimizerStart, MPM); >> MPM.add(createLoopRotatePass()); // Rotate Loop > > As this is in the middle of other LNO passes, can you please rename > s/EP_LoopOptimizerStart/EP_Polly_LNO/ or anything other than LoopOptimizerStart? It is in the middle? The passes executed before are: MPM.add(createJumpThreadingPass()); // Thread jumps. MPM.add(createCorrelatedValuePropagationPass()); // Propagate con...

...take many different paths. Polyhedral affine-to-affine, generative/lowering in linalg, and also exploring lifting lower level constructs into affine and further into linalg and tensor compute ops. I'm all for exchanging on the rationale, use cases, and design of these paths, alongside with LLVM LNO. One practical option being to compose these lifting, affine transformations and lowering steps to build an LLVM LNO. Ideally this could be one generic effort that would also interop with numerical libraries or specialized hardware ops where they exist, and that can be used to implement domain-spec...

...e IR needs to be canonicalized enough to allow scalar > evolution & Co to work. Right, Sergei has also pointed out that PromoteMemoryToRegister is needed that early because otherwise SCEV would not be able to recognize induction variables allocated on the stack. If we schedule polly in the LNO, this constraint would be satisfied. > 2) The IR generated by Polly, should be well optimized through LLVM > > This means we do not only need to perform the optimizations that > would have been necessary for the input code, but we also want to > take advantage of optimization oppor...

...loop >> transformation sense. > > Most nest optimizations only apply to perfect nests. Each such > optimization could try to "fix" the nest for its own purposes, but it > would be a lot of duplicated effort. If each L.N.O pass have to fix by itself, I would say this LNO component is pretty lame. IMHO, It is natural to run a preparation pass to shape the loop nests into a shape such that following LNO optimizers feel comfortable to kick in. Such preparation/fix pass should include getting rid of imperfect part, fusion, fission on individual nests or the neighb...

...n the ballpark, but sigma is very low. I get similar results on repeated trials and with Normal and standard normal distributions. How should I understand sigma in these results? cheers, RdR ######### Example ######### # enable reproduction set.seed(1234) # create some lognormal data X <- rlnorm(1000,meanlog=10,sdlog=2) # try gamlss fit gLNO <- gamlss(X~1,family=LNO) summary(gLNO) ******************************************************************* Family: c("LNO", "Box-Cox") Call: gamlss(formula = X ~ 1, family = LNO) Fitting method: RS() ---------------...

...things using the example code in the binequality manual, page 6 (or, "?fitFunc"). However, it exhibits the same problems as does my code and another example found elsewhere on the Internet, namely NA results for all fields of interest, as follows: Time difference of 0.776551 secs for LNO fit across 2 distributions $datOut State obsMean distribution estMean var cv cv_sqr gini theil MLD 1 California NA LNO NA NA NA NA NA NA NA 2 Texas NA LNO NA NA NA NA NA NA NA SDL aic bic didConverge logLikelihood nparams me...

On 7/31/2013 12:20 PM, Chris Lattner wrote: > On Jul 31, 2013, at 6:53 AM, Krzysztof Parzyszek > <kparzysz at codeaurora.org <mailto:kparzysz at codeaurora.org>> wrote: >> On 7/30/2013 11:44 PM, Chris Lattner wrote: >>> >>> The canonical form should be that loop invariants are hoisted. >> >> The canonical form should not depend on the knowledge

...;> generation strategy we probably need a couple of scalar cleanups, >> with the scev based code generation, there is normally a lot less to >> do. >> > > Right: let's try to see whether with SCEVcodegen we can have better performance > when scheduling Polly in the LNO. We can probably just schedule it there and then guess a reasonable set of cleanup passes around Polly in the case when SCEVcodegen is disabled. It seems we agree the right location is somewhere in the LNO. As said before, we could probably add it in between those two passes: MPM.add(create...

...MASKNO:08770 CLASS=PBX LAC=05 DN=2171035 OPMODE=IBW END JOB 7776 Channells status whit reverse lock STATPBXLN:LAC=05,DN=2171035; OPMODE : ISDN BOTHWAY LAC DN LNO C EQN STATUS DNCTR LNCTR CHBAR ------+------------+-----+-+-------------+------+-------+-------+------- 05 2171035 1 B 0-42- 0- 1 DIDLE& 1- 0 1- 0 1- 0 BBAC 05 2171035 2 B...

I am doing cluster analysis [hclust(Dist, method="average")] on data that potentially contains redundant objects. As expected, the inclusion of redundant objects affects the clustering result, i.e., the data a1, = a2, = a3, b, c, d, e1, = e2 is likely to cluster differently from the same data without the redundancy, i.e., a1, b, c, d, e1. This is apparent when the outcome is visualized

On 7/29/2013 6:28 PM, Andrew Trick wrote: > > You mean that LICM and Unswitching should be left for later? For the purpose of exposing scalar optimizations, I'm not sure I agree with that but I'd be interested in examples. Optimizations like LICM, and unswitching can potentially damage perfect nesting of loops. For example, consider this nest: for (i) { for (j) {

...d/build_dir/staging_dir/target-mips_24kc_musl/usr/lib -L/home/build/build_dir/staging_dir/target-mips_24kc_musl/lib -L/home/build/build_dir/staging_dir/toolchain-mips_24kc_gcc-8.4.0_musl/usr/lib -L/home/build/build_dir/staging_dir/toolchain-mips_24kc_gcc-8.4.0_musl/lib -znow -zrelro -lvorbisidec -Lno/lib -lssl ../libtool: line 5992: cd: no/lib: No such file or directory OpenWrt-libtool: link: cannot determine absolute directory name of `no/lib' > > On 6 Oct 2020, at 0:42, Rosen Penev wrote: > > > Useful for embedded systems. > > > > Signed-off-by: Rosen Penev &lt...