search for: addrequiredtransit

..." MDA > specifically does NOT compute results in its runOnFunction(), > instead computing results on-demand when a user queries it. > Because MDA depends on AA, we must ensure that, as long as MDA is > alive and responding to queries, AA is alive as well. That is what > addRequiredTransitive does. I'm not sure if I follow this. So let's say I'm writing a pass Foo, and Foo depends on MDA. You're saying that Foo's getAnalysisUsage must call addRequiredTransitive< MemoryDependenceAnalysis>, not addRequired<MemoryDependenceAnalysis>, because otherw...

...gt; specifically does NOT compute results in its runOnFunction(), > > instead computing results on-demand when a user queries it. Because > > MDA depends on AA, we must ensure that, as long as MDA is alive and > > responding to queries, AA is alive as well. That is what > > addRequiredTransitive does. > > I'm not sure if I follow this. So let's say I'm writing a pass Foo, > and Foo depends on MDA. You're saying that Foo's getAnalysisUsage must > call addRequiredTransitive< MemoryDependenceAnalysis>, not > addRequired<MemoryDependenceAnalysis&...

Hi, I'm a bit confused about the distinction between addRequired and addRequiredTransitive in AnalysisUsage. From PassAnalysisSupport.h: "REQUIRES (must be available when the pass runs), REQUIRES TRANSITIVE (must be available throughout the lifetime of the pass)." The part that's confusing me is "must be available when the pass runs". I don't see how...

I am having a hard time figuring out the difference between addRequired and addRequiredTransitive. Could someone please clarify the difference? Let's say I have a function pass P1 that relies on a function pass P2. P1 computes some sort of analysis on a function F and P2 uses that analysis when it processes F. Does that mean that I should use addRequiredTransitive? Thanks, Ryan

On Mar 31, 2010, at 2:53 PM, Trevor Harmon wrote: > I'm a bit confused about the distinction between addRequired and > addRequiredTransitive in AnalysisUsage. From PassAnalysisSupport.h: > > "REQUIRES (must be available when the pass runs), REQUIRES TRANSITIVE > (must be available throughout the lifetime of the pass)." > > The part that's confusing me is "must be available when the pass > ru...

...A B ^ ^ / | | | C D | ^ ^ | |\ | | | \ | \ | \ | F E The arrows represent direct use of analysis pass data. So even though C is built upon information from A, F directly accesses information from both C and A. I have tried all kinds of combinations of addRequired and addRequiredTransitive but no matter what, pass C gets rerun before pass F as expected but pass A does not. This leads to a situation where pass F uses up to date information from pass C and out of date information from pass A, leading to an analysis inconsistency and a compiler abort. Note that even though pass C ru...

Hi all, I am using llvm to perform some static analysis with a module pass. In getAnalysisUsage(), I specified some required passes by: addRequiredTransitive<LoopInfo>(); When I run my pass using opt, it crashes with segmentation fault with callstack: #0 0x0877aebd in llvm::PMTopLevelManager::findAnalysisUsage (this=0x8c10934, P=0xb15b988) at PassManager.cpp:573 #1 0x0877aa9b in llvm::PMTopLevelManager::setLastUser (this=0x8c10934, Analysis...

...ysis<polly::ScopInfoWrapperPass>().getSI(); for (auto &It : SI) { assert(It.second && "Invalid SCoP object!"); dp.recomputeDependences(It.second.get(), polly::Dependences::AL_Access); } virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequiredTransitive<polly::ScopInfoWrapperPass>(); AU.setPreservesAll(); } }; } char mypass::ID = 0; static RegisterPass<mypass> X("mypass", "mypass World Pass", false, false); please help. i have been trying a lot. -------------- next part -------------- An HTML attachment...

...tSI(); > > for (auto &It : SI) { > assert(It.second && "Invalid SCoP object!"); > dp.recomputeDependences(It.second.get(), polly::Dependences::AL_Access); > } > virtual void getAnalysisUsage(AnalysisUsage &AU) const > { > > AU.addRequiredTransitive<polly::ScopInfoWrapperPass>(); > AU.setPreservesAll(); > } > }; > } > char mypass::ID = 0; > static RegisterPass<mypass> X("mypass", "mypass World Pass", false, false); > > please help. i have been trying a lot. > > _________...

...ss>().getSI(); for (auto &It : SI) { assert(It.second && "Invalid SCoP object!"); dp.recomputeDependences(It.second.get(), polly::Dependences::AL_Access); } return false; } virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequiredTransitive<polly::ScopInfoWrapperPass>(); AU.addRequired<LoopInfoWrapperPass>(); AU.addRequired<RegionInfoPass>(); AU.addRequired<DominatorTreeWrapperPass>(); AU.addRequiredTransitive<ScalarEvolutionWrapperPass>(); AU.addRequiredTransitive<polly::ScopDetectionWrap...

I have an analysis pass which uses Scalar Evolution information. My pass implements getAnalysisUsage as: virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.setPreservesAll(); AU.addRequiredTransitive<LoopInfo>(); AU.addRequiredTransitive<ScalarEvolution>(); AU.addRequiredTransitive<TargetData>(); } However, I am seeing cases where I'm getting bogus Loop data. That is, the Loop object seems to be corrupted (empty block lists, etc.). At first my pass wa...

Hello everyone, I am trying to find the alias between a store instruction's pointer operand and function arguments. This is the code, virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequiredTransitive<AliasAnalysis>(); AU.addPreserved<AliasAnalysis>(); } virtual bool runOnFunction(Function &F) { AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); for(Function::iterator i=F.begin();i!=F.end();++i){ for(BasicBlock::iterator j=i-...

...20; } int main(){ int *a=(int *)malloc(sizeof(int)); *a=15; map(a); return 0; } I want to check if the pointer operand of each store instruction aliases with the function's arguments. I have used below code for this, virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequiredTransitive<AliasAnalysis>(); AU.addPreserved<AliasAnalysis>(); } virtual bool runOnFunction(Function &F) { AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); for(Function::iterator i=F.begin();i!=F.end();++i){ for(BasicBlock::iterator j=i->begin();j!=i-&g...

...tSI(); > > for (auto &It : SI) { > assert(It.second && "Invalid SCoP object!"); > dp.recomputeDependences(It.second.get(), > polly::Dependences::AL_Access); } > virtual void getAnalysisUsage(AnalysisUsage &AU) const > { > > AU.addRequiredTransitive<polly::ScopInfoWrapperPass>(); > AU.setPreservesAll(); > } > }; > } > char mypass::ID = 0; > static RegisterPass<mypass> X("mypass", "mypass World Pass", false, false); > > please help. i have been trying a lot. > --------------...

...&It : SI) { >> assert(It.second && "Invalid SCoP object!"); >> dp.recomputeDependences(It.second.get(), >> polly::Dependences::AL_Access); } >> virtual void getAnalysisUsage(AnalysisUsage &AU) const >> { >> >> AU.addRequiredTransitive<polly::ScopInfoWrapperPass>(); >> AU.setPreservesAll(); >> } >> }; >> } >> char mypass::ID = 0; >> static RegisterPass<mypass> X("mypass", "mypass World Pass", false, >> false); >> >> please help. i ha...

Hello, Two questions regarding analysis groups that ``chain'' their results, like AliasAnalysis. (1) I have an analysis group, let's call it Provider. I also have two implementations of it: ProviderA and ProviderB. The "writing a pass" document suggests using: au.addRequiredTransitive< Provider >(); Within the getAnalysisUsage() method of both ProviderA and ProviderB. But... I'm doing something wrong, and I get an infinite recursion. (2) ALSO, I'm confused. Should I get the previous results using: Provider &previous = getAnalysis< Provider >();...

Hi all, A question for other regalloc hackers - is there any good reason why we're requiring RegisterCoalescer tranisitively in RegAllocLinearScan (via addRequiredTransitive) ? If there's no reason I'll switch it to a plain requirement (addRequired). It's not a big deal, but is a little cleaner. Cheers, Lang.

...e::getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequired<UnifyFunctionExitNodes>(); AU.addRequired<MemoryDependenceAnalysis>(); AU.setPreservesAll(); } }; void MemoryDependenceAnalysis::getAnalysisUsage(AnalysisUsage &AU) const { AU.setPreservesAll(); AU.addRequiredTransitive<AliasAnalysis>(); } The passmanager structure looks as follows: Target Data Layout Basic Alias Analysis (default AA impl) Type-Based Alias Analysis ModulePass Manager Basic CallGraph Construction Global Value Liveness Analysis Unnamed pass: implement Pass::getPassName()...

...t that the right way to do it? borya043 wrote: > > Hello everyone, > I am trying to find the alias between a store instruction's pointer > operand > and function arguments. This is the code, > virtual void getAnalysisUsage(AnalysisUsage &AU) const { > > AU.addRequiredTransitive<AliasAnalysis>(); > AU.addPreserved<AliasAnalysis>(); > } > virtual bool runOnFunction(Function &F) { > > > AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); > > for(Function::iterator i=F.begin();i!=F.end();++i){ &...

Hi Adarsh, > I have used the follwing command, > opt -load LLVComMan.so -ComMan -memdep -tbaa -mem2reg maptest.ll -S > What option other than -mem2reg should be included in this case to get the > right results? Does the order in which I specify the optimizations to be run > make a difference? what is in maptest.ll? Ciao, Duncan.