14 #ifndef LLVM_IR_PREDITERATORCACHE_H
15 #define LLVM_IR_PREDITERATORCACHE_H
51 BlockToPredCountMap[BB] = PredCache.
size() - 1;
54 std::copy(PredCache.
begin(), PredCache.
end(), Entry);
60 return BlockToPredCountMap[BB];
71 BlockToPredsMap.clear();
72 BlockToPredCountMap.clear();
void push_back(const T &Elt)
This class provides various memory handling functions that manipulate MemoryBlock instances...
This file defines the MallocAllocator and BumpPtrAllocator interfaces.
ArrayRef< T > makeArrayRef(const T &OneElt)
Construct an ArrayRef from a single element.
PredIteratorCache - This class is an extremely trivial cache for predecessor iterator queries...
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory)...
LLVM Basic Block Representation.
Allocate memory in an ever growing pool, as if by bump-pointer.
Interval::pred_iterator pred_begin(Interval *I)
pred_begin/pred_end - define methods so that Intervals may be used just like BasicBlocks can with the...
Interval::pred_iterator pred_end(Interval *I)
void clear()
clear - Remove all information.
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small...
size_t size(BasicBlock *BB)