Displaying 2 results from an estimated 2 matches for "ispotentiallyreachable".
2014 May 15
4
[LLVMdev] SROA is slow when compiling a large basic block
...will affect the
common case.
This will also help speed up the execution of code in other places. For
example, these two functions are called when GVN::processLoad is called and
iterate over a basic block's instruction list to determine the order of two
(load and stores) instructions.:
llvm::isPotentiallyReachable
// Linear scan, start at 'A', see whether we hit 'B' or the end first.
for (BasicBlock::const_iterator I = A, E = BB->end(); I != E; ++I) {
if (&*I == B)
return true;
}
DominatorTree::dominates
// Loop through the basic block until we find...
2014 May 15
2
[LLVMdev] SROA is slow when compiling a large basic block
...This will also help speed up the execution of code in other places. For
> example, these two functions are called when GVN::processLoad is called and
> iterate over a basic block's instruction list to determine the order of two
> (load and stores) instructions.:
>
>
> llvm::isPotentiallyReachable
>
>
> // Linear scan, start at 'A', see whether we hit 'B' or the end
> first.
>
> for (BasicBlock::const_iterator I = A, E = BB->end(); I != E; ++I) {
>
> if (&*I == B)
>
> return true;
>
> }
>
> Dominator...