Home
last modified time | relevance | path

Searched refs:IntervalMap (Results 1 – 22 of 22) sorted by relevance

/netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/
H A DIntervalMap.h36 class IntervalMap : public Map<Key_t, Value_t>
40 IntervalMap ();
41 ~IntervalMap ();
64 const int IntervalMap<Key_t, Value_t>::CHUNK_SIZE = 16384;
67 IntervalMap<Key_t, Value_t>::IntervalMap () in IntervalMap() function
76 IntervalMap<Key_t, Value_t>::~IntervalMap () in ~IntervalMap()
86 IntervalMap<Key_t, Value_t>::put (Key_t key, Value_t val) in put()
128 IntervalMap<Key_t, Value_t>::get (Key_t key) in get()
135 IntervalMap<Key_t, Value_t>::get (Key_t key, typename Map<Key_t, Value_t>::Relation rel) in get()
186 IntervalMap<Key_t, Value_t>::remove (Key_t) in remove()
H A DDefaultMap2D.h88 map2 = new IntervalMap<Key2_t, Value_t>; in put()
/netbsd-src/external/gpl3/binutils/dist/gprofng/src/
H A DIntervalMap.h36 class IntervalMap : public Map<Key_t, Value_t>
40 IntervalMap ();
41 ~IntervalMap ();
64 const int IntervalMap<Key_t, Value_t>::CHUNK_SIZE = 16384;
67 IntervalMap<Key_t, Value_t>::IntervalMap () in IntervalMap() function
76 IntervalMap<Key_t, Value_t>::~IntervalMap () in ~IntervalMap()
86 IntervalMap<Key_t, Value_t>::put (Key_t key, Value_t val) in put()
128 IntervalMap<Key_t, Value_t>::get (Key_t key) in get()
135 IntervalMap<Key_t, Value_t>::get (Key_t key, typename Map<Key_t, Value_t>::Relation rel) in get()
186 IntervalMap<Key_t, Value_t>::remove (Key_t) in remove()
H A DDefaultMap2D.h88 map2 = new IntervalMap<Key2_t, Value_t>; in put()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DIntervalMap.h938 class IntervalMap {
1038 void visitNodes(void (IntervalMap::*f)(IntervalMapImpl::NodeRef,
1043 explicit IntervalMap(Allocator &a) : height(0), rootSize(0), allocator(a) { in IntervalMap() function
1049 ~IntervalMap() { in ~IntervalMap()
1155 ValT IntervalMap<KeyT, ValT, N, Traits>::
1168 IntervalMapImpl::IdxPair IntervalMap<KeyT, ValT, N, Traits>::
1209 IntervalMapImpl::IdxPair IntervalMap<KeyT, ValT, N, Traits>::
1247 void IntervalMap<KeyT, ValT, N, Traits>::
1248 visitNodes(void (IntervalMap::*f)(IntervalMapImpl::NodeRef, unsigned Height)) { in visitNodes()
1274 void IntervalMap<KeyT, ValT, N, Traits>::
[all …]
H A DCoalescingBitVector.h44 using MapT = IntervalMap<IndexT, char>;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DIntervalPartition.h44 IntervalMapTy IntervalMap; variable
78 IntervalMapTy::iterator I = IntervalMap.find(BB); in getBlockInterval()
79 return I != IntervalMap.end() ? I->second : nullptr; in getBlockInterval()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DIntervalPartition.cpp41 IntervalMap.clear(); in releaseMemory()
60 IntervalMap.insert(std::make_pair(*It, I)); in addIntervalToPartition()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DDeadStoreElimination.cpp661 OverlapIntervalsTy &IntervalMap, in tryToShortenEnd() argument
663 if (IntervalMap.empty() || !isShortenableAtTheEnd(EarlierWrite)) in tryToShortenEnd()
666 OverlapIntervalsTy::iterator OII = --IntervalMap.end(); in tryToShortenEnd()
681 IntervalMap.erase(OII); in tryToShortenEnd()
689 OverlapIntervalsTy &IntervalMap, in tryToShortenBegin() argument
691 if (IntervalMap.empty() || !isShortenableAtTheBeginning(EarlierWrite)) in tryToShortenBegin()
694 OverlapIntervalsTy::iterator OII = IntervalMap.begin(); in tryToShortenBegin()
710 IntervalMap.erase(OII); in tryToShortenBegin()
730 OverlapIntervalsTy &IntervalMap = OI.second; in removePartiallyOverlappedStores() local
732 tryToShortenEnd(EarlierWrite, IntervalMap, EarlierStart, EarlierSize); in removePartiallyOverlappedStores()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h46 using LiveSegments = IntervalMap<SlotIndex, LiveInterval*>;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
H A DNativeSession.h131 IntervalMap<uint64_t, uint16_t, 8, IntervalMapHalfOpenInfo<uint64_t>>;
/netbsd-src/external/apache2/llvm/lib/libLLVMSupport/
H A DMakefile62 IntervalMap.cpp \
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DWARFLinker/
H A DDWARFLinkerCompileUnit.h23 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
/netbsd-src/external/apache2/llvm/dist/llvm/utils/gn/secondary/llvm/lib/Support/
H A DBUILD.gn87 "IntervalMap.cpp",
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DSplitKit.h317 using RegAssignMap = IntervalMap<SlotIndex, unsigned>;
H A DLiveDebugVariables.cpp261 using LocMap = IntervalMap<SlotIndex, DbgVariableValue, 4>;
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DCMakeLists.txt138 IntervalMap.cpp
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DProgrammersManual.rst2277 llvm/ADT/IntervalMap.h
2280 IntervalMap is a compact map for small keys and values. It maps key intervals
2285 The IntervalMap iterators are quite big, so they should not be passed around as
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp6516 using IntervalMap = DenseMap<Instruction *, unsigned>; in calculateRegisterUsage() typedef
6521 IntervalMap EndPoint; in calculateRegisterUsage()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp23012 llvm::IntervalMap<int64_t, UnitT, 8, IntervalMapHalfOpenInfo<int64_t>>; in parallelizeChainedStores()
/netbsd-src/external/gpl3/binutils.old/dist/
H A Dsha256.sum15102 6e0ec86d62dbf55272ea2fcfb8e836a7040527d5c5fd83213c62df2f64d77f31 gprofng/src/IntervalMap.h
/netbsd-src/external/gpl3/binutils/dist/
H A Dsha256.sum16580 5c468e99b317fbe70de2e2d5c7ca38b7827060e50d8bea383979fb96db38541d gprofng/src/IntervalMap.h