search for: assumptioncachetrack

...etter = [this] (Function &F) -> ScalarEvolution & { return this->getAnalysis<ScalarEvolutionWrapperPass>(F).getSE(); }; auto AssumptionCacheGetter = [this] (Function &F) -> AssumptionCache & { return this->getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F); }; auto OREGetter = [this] (Function &F) -> OptimizationRemarkEmitter & { return this-> getAnalysis<OptimizationRemarkEmitterWrapperPass>(F).getORE(); }; }

...nfo.h" #include "llvm/ADT/SmallPtrSet.h" #include "llvm/ADT/Statistic.h" #include "llvm/Analysis/AliasAnalysis.h"@@ -58,6 +59,7 @@ Inliner::Inliner(char &ID, bool InsertLifetime) void Inliner::getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequired<AssumptionCacheTracker>(); AU.addRequired<TargetLibraryInfoWrapperPass>();+ AU.addRequired<LoopInfoWrapperPass>(); getAAResultsAnalysisUsage(AU); CallGraphSCCPass::getAnalysisUsage(AU);} I get llvm_unreachable in `void PMDataManager::addLowerLevelRequiredPass(Pass *P, Pass *RequiredPass)' Than...

Hello, I need to analyze dependencies in my llvm ir by using polly. i created a new pass called mypass there i added polly dependency analysis pass but when i execute this pass in gdb i get no data. Why is that so? My code is follows; namespace { struct mypass : public FunctionPass { static char ID; mypass() : FunctionPass(ID) { } virtual bool runOnFunction(Function &F) {

...tAnalysis<LoopInfoWrapperPass>().getLoopInfo(); auto &AA2 = getAnalysis<AAResultsWrapperPass>().getAAResults(); auto const &DL2 = F.getParent()->getDataLayout(); auto &DT2 = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); auto &AC2 = getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F); Result.reset(new ScopInfo{DL2, SD2, SE2, LI2, AA2, DT2, AC2}); polly::DependenceInfoWrapperPass dp; auto &SI = *getAnalysis<polly::ScopInfoWrapperPass>().getSI(); for (auto &It : SI) { assert(It.second && "Invalid SCoP object!&qu...

...m/ADT/SmallPtrSet.h" > #include "llvm/ADT/Statistic.h" > #include "llvm/Analysis/AliasAnalysis.h" > @@ -58,6 +59,7 @@ Inliner::Inliner(char &ID, bool InsertLifetime) > void Inliner::getAnalysisUsage(AnalysisUsage &AU) const { > AU.addRequired<AssumptionCacheTracker>(); > AU.addRequired<TargetLibraryInfoWrapperPass>(); > + AU.addRequired<LoopInfoWrapperPass>(); > getAAResultsAnalysisUsage(AU); > CallGraphSCCPass::getAnalysisUsage(AU); > } > > I get llvm_unreachable in `void > PMDataManager::addLowerLevelRequi...

How do you compile the code? Within the Polly subdirectory using CMake? How do you run your pass. Using "opt -mypass inputfile.ll"? Michael 2018-01-28 9:30 GMT-06:00 hameeza ahmed via llvm-dev <llvm-dev at lists.llvm.org>: > Hello, > > I need to analyze dependencies in my llvm ir by using polly. i created a new > pass called mypass there i added polly dependency

...tAnalysis<LoopInfoWrapperPass>().getLoopInfo(); auto &AA2 = getAnalysis<AAResultsWrapperPass>().getAAResults(); auto const &DL2 = F.getParent()->getDataLayout(); auto &DT2 = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); auto &AC2 = getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F); Result.reset(new ScopInfo{DL2, SD2, SE2, LI2, AA2, DT2, AC2}); polly::DependenceInfoWrapperPass dp; auto &SI = *getAnalysis<polly::ScopInfoWrapperPass>().getSI(); for (auto &It : SI) { assert(It.second && "Invalid SCoP object!&q...

...oWrapperPass>().getLoopInfo(); > auto &AA2 = getAnalysis<AAResultsWrapperPass>().getAAResults(); > auto const &DL2 = F.getParent()->getDataLayout(); > auto &DT2 = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); > auto &AC2 = getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F); > > Result.reset(new ScopInfo{DL2, SD2, SE2, LI2, AA2, DT2, AC2}); > > > polly::DependenceInfoWrapperPass dp; > > auto &SI = *getAnalysis<polly::ScopInfoWrapperPass>().getSI(); > > for (auto &It : SI) { > assert(It.s...

...of analyses of the same IRUnit intermingled with transformation passes on that same IRUnit, so you only have the "analysis" part of the tuple above, making things much simpler (and handling dependencies is much simpler too). We've obviously outgrown this model with examples like LAA, AssumptionCacheTracker, etc. that hack around this in the old PM. We may want to have a fresh re-examination of what problems we are exactly trying to solve. For me, my main concern now is what changes need to be made in order to feel confident running a pipeline in the new PM without assertions+ASan. Sorry for the...

Hi, I'm writing an analysis pass which is supposed to find instructions in a function that modify function's by-ref arguments. For that I'm using llvm AliasAnalysis pass, particularly querying for ModRef info for instructions and function arguments, to see if a given instruction modifies a given argument. However, for functions with more than one by-ref argument, I get strange

...> intermingled with transformation passes on that same IRUnit, so you only >> have the "analysis" part of the tuple above, making things much simpler >> (and handling dependencies is much simpler too). We've obviously outgrown >> this model with examples like LAA, AssumptionCacheTracker, etc. that hack >> around this in the old PM. We may want to have a fresh re-examination of >> what problems we are exactly trying to solve. >> >> For me, my main concern now is what changes need to be made in order to >> feel confident running a pipeline in the new...

...s>),some-module-pass-that-makes-no-changes,cgscc(some-cgscc-pass-that-uses-foo-cgscc-analysis))` > but that seems like a restriction we can live with. > Again, sorry for the braindump. > -- Sean Silva > > We've obviously outgrown this model with examples like LAA, > > AssumptionCacheTracker, etc. that hack around this in the old PM. > > We > > may want to have a fresh re-examination of what problems we are > > exactly trying to solve. > > > For me, my main concern now is what changes need to be made in > > order > > to feel confident running...

...> > > > only have the "analysis" part of the tuple above, making things > > > > much > > > > simpler (and handling dependencies is much simpler too). We've > > > > obviously outgrown this model with examples like LAA, > > > > AssumptionCacheTracker, etc. that hack around this in the old > > > > PM. > > > > We > > > > may want to have a fresh re-examination of what problems we are > > > > exactly trying to solve. > > > > > > > > > > For me, my main concern now...

...gt; > > but that seems like a restriction we can live with. > > > > > > Again, sorry for the braindump. > > > > > > -- Sean Silva > > > > > > > We've obviously outgrown this model with examples like LAA, > > > > AssumptionCacheTracker, etc. that hack around this in the old > > > > PM. > > > > We > > > > may want to have a fresh re-examination of what problems we are > > > > exactly trying to solve. > > > > > > > > > > For me, my main concern now...

...gt; > > but that seems like a restriction we can live with. > > > > > > Again, sorry for the braindump. > > > > > > -- Sean Silva > > > > > > > We've obviously outgrown this model with examples like LAA, > > > > AssumptionCacheTracker, etc. that hack around this in the old > > > > PM. > > > > We > > > > may want to have a fresh re-examination of what problems we are > > > > exactly trying to solve. > > > > > > > > > > For me, my main concern now...

Hi Sanjoy, Thanks for feedback! As for memory effects, currently I use " inaccessiblememonly " for it. It allows to prove that it doesn't alias with any other load/store in the function, but doesn't allow CSE to eliminate it. It is not actually super-cool, because there is no way that we can safely hoist it out of loop (and sometimes we want to, for example to make unswitching).

...hat-uses-foo-cgscc-analysis))` >> but that seems like a restriction we can live with. >> >> >> Again, sorry for the braindump. >> >> >> -- Sean Silva >> >> >>> We've obviously outgrown this model with examples like LAA, >>> AssumptionCacheTracker, etc. that hack around this in the old PM. We may >>> want to have a fresh re-examination of what problems we are exactly trying >>> to solve. >>> >>> For me, my main concern now is what changes need to be made in order to >>> feel confident running a...

...ransformation passes on that same IRUnit, so you only >>>> have the "analysis" part of the tuple above, making things much simpler >>>> (and handling dependencies is much simpler too). We've obviously outgrown >>>> this model with examples like LAA, AssumptionCacheTracker, etc. that hack >>>> around this in the old PM. We may want to have a fresh re-examination of >>>> what problems we are exactly trying to solve. >>>> >>>> For me, my main concern now is what changes need to be made in order to >>>> feel...

...but that seems like a restriction we can live with. >>> >>> >>> Again, sorry for the braindump. >>> >>> >>> -- Sean Silva >>> >>> >>>> We've obviously outgrown this model with examples like LAA, >>>> AssumptionCacheTracker, etc. that hack around this in the old PM. We may >>>> want to have a fresh re-examination of what problems we are exactly trying >>>> to solve. >>>> >>>> For me, my main concern now is what changes need to be made in order to >>>> feel...

...that same IRUnit, so you only >>>>>> have the "analysis" part of the tuple above, making things much simpler >>>>>> (and handling dependencies is much simpler too). We've obviously outgrown >>>>>> this model with examples like LAA, AssumptionCacheTracker, etc. that hack >>>>>> around this in the old PM. We may want to have a fresh re-examination of >>>>>> what problems we are exactly trying to solve. >>>>>> >>>>>> For me, my main concern now is what changes need to be made in...