31 const llvm::SmallPtrSet<Block *, 4> &
32 getReachableImpl(Block *block, FnTy getNextNodes,  in getReachableImpl()
33                  DenseMap<Block *, llvm::SmallPtrSet<Block *, 4>> &cache) {  in getReachableImpl()  argument
38   llvm::SmallPtrSet<Block *, 4> &reachable = cache[block];  in getReachableImpl()
39   SmallVector<Block *> worklist;  in getReachableImpl()
42     Block *current = worklist.pop_back_val();  in getReachableImpl()
43     for (Block *predecessor : getNextNodes(current)) {  in getReachableImpl()
150     Block *defBlock = operand.get().getParentBlock();  in isUseLive()
205       Block *ancestorBlock = ancestor->getBlock();  in isUseLive()
206       Block *from =  in isUseLive()
265   PotentialDeleters isMaybeFreedOnPaths(Block *from, Block *to, Value value,  in isMaybeFreedOnPaths()
270     const llvm::SmallPtrSet<Block *, 4> &sources = getReachableFrom(to);  in isMaybeFreedOnPaths()
274     llvm::SmallPtrSet<Block *, 4> reachable(getReachable(from));  in isMaybeFreedOnPaths()
285     for (Block *block : reachable) {  in isMaybeFreedOnPaths()
297   const llvm::SmallPtrSet<Block *, 4> &getReachable(Block *block) {  in getReachable()
299         block, [](Block *b) { return b->getSuccessors(); }, reachableCache);  in getReachable()
304   const llvm::SmallPtrSet<Block *, 4> &getReachableFrom(Block *block) {  in getReachableFrom()
306         block, [](Block *b) { return b->getPredecessors(); },  in getReachableFrom()
360   DenseMap<Block *, llvm::SmallPtrSet<Block *, 4>> reachableCache;
361   DenseMap<Block *, llvm::SmallPtrSet<Block *, 4>> reachableFromCache;