Searched refs:IntervalMap (Results 1 - 8 of 8) sorted by relevance

/freebsd-10.2-release/contrib/llvm/include/llvm/Analysis/
H A DIntervalPartition.h42 IntervalMapTy IntervalMap; member in class:llvm::IntervalPartition
79 IntervalMapTy::iterator I = IntervalMap.find(BB);
80 return I != IntervalMap.end() ? I->second : 0;
97 // interval itself (in the IntervalMap).
/freebsd-10.2-release/contrib/llvm/lib/Analysis/
H A DIntervalPartition.cpp30 IntervalMap.clear();
42 // interval itself (in the IntervalMap).
50 IntervalMap.insert(std::make_pair(*It, I));
/freebsd-10.2-release/contrib/llvm/include/llvm/ADT/
H A DIntervalMap.h1 //===- llvm/ADT/IntervalMap.h - A sorted interval map -----------*- C++ -*-===//
18 // Like SmallVector, IntervalMap will store the first N intervals in the map
23 // A Traits class specifies how keys are compared. It also allows IntervalMap to
31 // IntervalMap is optimized for small key and value objects, 4 or 8 bytes each
39 // class IntervalMap {
47 // explicit IntervalMap(Allocator&);
48 // ~IntervalMap():
67 // class IntervalMap::const_iterator :
91 // class IntervalMap::iterator : public const_iterator {
115 // The IntervalMap work
[all...]
/freebsd-10.2-release/contrib/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h20 #include "llvm/ADT/IntervalMap.h"
36 const IntervalMap<SlotIndex, LiveInterval*>::const_iterator &LUSeg) {
48 typedef IntervalMap<SlotIndex, LiveInterval*> LiveSegments;
35 overlap(const LiveInterval::Segment &VRSeg, const IntervalMap<SlotIndex, LiveInterval*>::const_iterator &LUSeg) argument
/freebsd-10.2-release/lib/clang/libllvmsupport/
H A DMakefile36 IntervalMap.cpp \
/freebsd-10.2-release/contrib/llvm/lib/CodeGen/
H A DSplitKit.h21 #include "llvm/ADT/IntervalMap.h"
262 typedef IntervalMap<SlotIndex, unsigned> RegAssignMap;
H A DLiveDebugVariables.cpp24 #include "llvm/ADT/IntervalMap.h"
72 typedef IntervalMap<SlotIndex, unsigned, 4> LocMap;
/freebsd-10.2-release/contrib/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp4693 typedef DenseMap<Instruction*, unsigned> IntervalMap;
4697 IntervalMap EndPoint;
4739 for (IntervalMap::iterator it = EndPoint.begin(), e = EndPoint.end();

Completed in 114 milliseconds