search for: laa

..., at 18:37, Stefanos Baziotis via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > Ah, that's important information I didn't have. Thank you! > > No problem, glad to help! > > To the rest of your thoughts, I certainly agree. One interesting question is why LAA > didn't use DA at all. Other than that, note that LAA is quite specialized, namely for > loop vectorization. Actually, it's even more specific. For innermost loop vectorization. > That affects the design. It might had been easier to create this specialized tool than > extending...

...t double* %arrayidx2 to i64* store i64 %1, i64* %2, align 8, !tbaa !1 store double 0.000000e+00, double* %arrayidx, align 8, !tbaa !1 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 %exitcond = icmp eq i64 %indvars.iv.next, 1000 br i1 %exitcond, label %for.cond.cleanup, label %for.body LAA: Found a loop in foo: loop.17 LAA: Processing memory accesses... AST: Alias Set Tracker: 2 alias sets for 3 pointer values. AliasSet[0x9508b80, 1] must alias, No access Pointers: (<4 x i64>* %1, 18446744073709551615) AliasSet[0x95f8a70, 2] must alias, No access Pointers: (<4 x double...

...to save any files! I have a samba server that was joined to a win2k active directory and running for months. I dont know why, but now it isn't working correctly. This error is filling my logs: ------------------- libads/kerberos_verify.c:ads_keytab_verify_ticket(113) krb5_rd_req(HOST/SAMBA.laa.edu.au@LAA.EDU.AU) failed: Wrong principal in request ------------------- There are variations with HOST/SAMBA.laa.edu.au@LAA.EDU.AU, HOST/SAMBA@LAA.EDU.AU, HOST/samba.laa.edu.au@LAA.EDU.AU I really have no idea what to do. I can use kinit on any user on the domain successfully. Thanks Amie...

Stefanos Baziotis via llvm-dev <llvm-dev at lists.llvm.org> writes: > Their most important difference is that DA is used for compile-time / > static checks while LAA is mainly used for generating run-time checks. Ah, that's important information I didn't have. Thank you! > Now, as for unifying them, if we mean something other than just putting > them in the same file, I don't think it can happen. > IMHO they're way more apart than it...

...example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. > > Please let me know if you have any questions. > > I have gone through current LAA, found few gaps for reusing it. > > i.e. > 928 void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) { > 1029 if (isUniform(Ptr)) { > 1030 emitAnalysis( > 1031 LoopAccessReport(ST) > 1032 << "write to a loop invariant ad...

...lt;= MaxVFWithoutSLForwardIssues; vf *= 2) { if (Distance % vf && Distance / vf < NumCyclesForStoreLoadThroughMemory) { MaxVFWithoutSLForwardIssues = (vf >>=1); break; } } if (MaxVFWithoutSLForwardIssues< 2*TypeByteSize) { DEBUG(dbgs() << "LAA: Distance " << Distance << " that could cause a store-load forwarding conflict\n"); return true; } ---------------------------- Part B: typedef unsigned long long uint64; void foo(const unsigned char *m, unsigned int block, uint64 y[80]) { const unsig...

> On Mar 5, 2015, at 10:33 PM, Nema, Ashutosh <Ashutosh.Nema at amd.com> wrote: > > > I am about to post the patches to make LAA suitable for Loop Distribution. As you will hopefully find this will make the LAA more generic. I will cc you on the patches. > > Sure Adam. > > RuntimeCheckEmitter > “RuntimeCheckEmitter::addRuntimeCheck” > While creating runtime check I have found, some of the things are n...

...example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. > > Please let me know if you have any questions. > > I have gone through current LAA, found few gaps for reusing it. > > i.e. > 928 void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) { > 1029 if (isUniform(Ptr)) { > 1030 emitAnalysis( > 1031 LoopAccessReport(ST) > 1032 << "write to a loop invariant ad...

...p- and downsides: >> > >> > * llvm::DependenceAnalysis >> > * llvm::LoopAccessAnalysis >> >> Can someone explain the differences between these? As far as I can tell >> they essentially do the same thing (though perhaps one is more >> precise?). LAA seems to be used by vectorization (what else?) while DA >> seems to be used by loop transformations (what else?). >> >> I am not a loop opt guy so while I'm familiar with the basic ideas, the >> details are somewhat lost on me. Is there a reason to have two passes >&...

...example of how to use it, you can look at either the loop-vectorizer in the tree or the WIP patch for the loop-distribution pass in http://reviews.llvm.org/D6930 <http://reviews.llvm.org/D6930>. > > Please let me know if you have any questions. > > I have gone through current LAA, found few gaps for reusing it. > > i.e. > 928 void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) { > 1029 if (isUniform(Ptr)) { > 1030 emitAnalysis( > 1031 LoopAccessReport(ST) > 1032 << "write to a loop invariant ad...

Hello, could you please have a look at this code posted on godbolt.org: https://godbolt.org/z/O-O-Q7 The problem is that inside the compute function, only the first loop vectorizes while the rest copies of it don't. But if I remove any of the for loops, then the rest vectorize successfully. Could you please confirm that this is a bug, otherwise give me more insight on why the vectorization

...printable = no directory mask = 0770 create mask = 0770 [local] comment = SIT path = /usr3/films public = no writable = no printable = no directory mask = 0770 create mask = 0770 valid users = to01 to02 to03 anv siriy laa bas pc2 sdtu05 vad sdtu_tm write list = to01 to02 to03 anv siriy laa bas pc2 vad [asu] comment = ASU path = /usr2/asu public = no writable = no printable = no directory mask = 0770 create mask = 0770 valid users = laa anv odst...

...9;s data structures. To be concrete, holding a pointer to ScalarEvolution is not a fundamental problem because we could make the analysis reacquire the pointer at the start of every query. Holding SCEV* is the problem. > > Looks like SCEV* at least is held only by LoopAccessInfo. (Looks like LAA holds Loop* too) > > Note that Loop (and SCC) are somewhat special as they are IRUnitTs and might as a consequence be more reasonable to hold on to and expect definitive invalidation to occur. But I say "might". I think this will be case-by-case depending on how they're being u...

...tion_open = false rollback_db_transaction end if savepoint_open savepoint_open = false rollback_to_savepoint(savepoint_name) end raise end ensure commit_db_transaction if transaction_open release_savepoint(savepoint_name) if savepoint_open end Best regards, Laas

...ese. >>>> >>>> The idea was that infrastructure would be incrementally >>>> improved from two directions: >>>> >>>> - As new transformations are built analyses have to be improved >>>> (e.g. past improvements to LAA to support the LoopVersioning >>>> utility, future improvements for full LoopSROA beyond just >>>> store->load forwarding [1] or the improvements to LAA for the >>>> LoopFusion proposal[2]) >>>> >>>> - As more complex lo...

...tions (e.g. > LoopDistribution, LoopLoadElimination, LICMLoopVersioning) on top of these. > > The idea was that infrastructure would be incrementally improved from two > directions: > > - As new transformations are built analyses have to be improved (e.g. past > improvements to LAA to support the LoopVersioning utility, future > improvements for full LoopSROA beyond just store->load forwarding [1] or > the improvements to LAA for the LoopFusion proposal[2]) > > - As more complex loops would have to be analyzed we either improve LAA or > make DependenceAnalys...

...can not be sure this migrate does what I expect it to do. Whereas if migrate would run on :app, I would know exactly what I get even with multiple sites of the same code at different versions all on the same database server. If someone can explain me this, I would appreciate it. Best regards, Laas Toom

...concrete, holding a pointer to ScalarEvolution is not a >> fundamental problem because we could make the analysis reacquire the >> pointer at the start of every query. Holding SCEV* is the problem. >> > > Looks like SCEV* at least is held only by LoopAccessInfo. (Looks like LAA > holds Loop* too) > Note that Loop (and SCC) are somewhat special as they are IRUnitTs and might as a consequence be more reasonable to hold on to and expect definitive invalidation to occur. But I say "might". I think this will be case-by-case depending on how they're being u...

...;> LICMLoopVersioning) on top of these. >>> >>> The idea was that infrastructure would be incrementally improved >>> from two directions: >>> >>> - As new transformations are built analyses have to be improved >>> (e.g. past improvements to LAA to support the LoopVersioning >>> utility, future improvements for full LoopSROA beyond just >>> store->load forwarding [1] or the improvements to LAA for the >>> LoopFusion proposal[2]) >>> >>> - As more complex loops would have to be analyzed we...

...tribution, LoopLoadElimination, LICMLoopVersioning) on top of these. >> >> The idea was that infrastructure would be incrementally improved from two >> directions: >> >> - As new transformations are built analyses have to be improved (e.g. >> past improvements to LAA to support the LoopVersioning utility, future >> improvements for full LoopSROA beyond just store->load forwarding [1] or >> the improvements to LAA for the LoopFusion proposal[2]) >> >> - As more complex loops would have to be analyzed we either improve LAA >> or m...