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

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIntervalPartition.h44 IntervalMapTy IntervalMap;
78 IntervalMapTy::iterator I = IntervalMap.find(BB);
79 return I != IntervalMap.end() ? I->second : nullptr;
96 // interval itself (in the IntervalMap).
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DIntervalPartition.cpp41 IntervalMap.clear();
53 // interval itself (in the IntervalMap).
60 IntervalMap.insert(std::make_pair(*It, I));
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h1 //===- llvm/ADT/IntervalMap.h - A sorted interval map -----------*- C++ -*-===//
17 // Like SmallVector, IntervalMap will store the first N intervals in the map
22 // A Traits class specifies how keys are compared. It also allows IntervalMap to
30 // IntervalMap is optimized for small key and value objects, 4 or 8 bytes each
38 // class IntervalMap {
46 // explicit IntervalMap(Allocator&);
47 // ~IntervalMap():
66 // class IntervalMap::const_iterator :
90 // class IntervalMap::iterator : public const_iterator {
120 // The IntervalMap work
[all...]
H A DCoalescingBitVector.h9 /// \file A bitvector that uses an IntervalMap to coalesce adjacent elements
17 #include "llvm/ADT/IntervalMap.h"
28 /// A bitvector that, under the hood, relies on an IntervalMap to coalesce
44 using MapT = IntervalMap<IndexT, char>;
98 "IntervalMap will assert");
221 // case that results in comparison of the (unused) IntervalMap values.
245 // Querying the start/stop of an IntervalMap iterator can be very expensive.
/freebsd-13-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/
H A DPdbIndex.h13 #include "llvm/ADT/IntervalMap.h"
100 llvm::IntervalMap<lldb::addr_t, uint32_t>::Allocator m_allocator;
103 llvm::IntervalMap<lldb::addr_t, uint16_t> m_va_to_modi;
H A DPdbIndex.cpp99 llvm::IntervalMap<uint64_t, uint16_t> &m_imap;
102 Visitor(PdbIndex &ctx, llvm::IntervalMap<uint64_t, uint16_t> &imap)
111 // IntervalMap's start and end represent a closed range, not a half-open
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h19 #include "llvm/ADT/IntervalMap.h"
46 using LiveSegments = IntervalMap<SlotIndex, LiveInterval*>;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DDeadStoreElimination.cpp1038 OverlapIntervalsTy &IntervalMap,
1040 if (IntervalMap.empty() || !isShortenableAtTheEnd(EarlierWrite))
1043 OverlapIntervalsTy::iterator OII = --IntervalMap.end();
1051 IntervalMap.erase(OII);
1059 OverlapIntervalsTy &IntervalMap,
1061 if (IntervalMap.empty() || !isShortenableAtTheBeginning(EarlierWrite))
1064 OverlapIntervalsTy::iterator OII = IntervalMap.begin();
1073 IntervalMap.erase(OII);
1093 OverlapIntervalsTy &IntervalMap = OI.second; local
1095 tryToShortenEnd(EarlierWrite, IntervalMap, EarlierStar
1037 tryToShortenEnd(Instruction *EarlierWrite, OverlapIntervalsTy &IntervalMap, int64_t &EarlierStart, int64_t &EarlierSize) argument
1058 tryToShortenBegin(Instruction *EarlierWrite, OverlapIntervalsTy &IntervalMap, int64_t &EarlierStart, int64_t &EarlierSize) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/DWARFLinker/
H A DDWARFLinkerCompileUnit.h12 #include "llvm/ADT/IntervalMap.h"
23 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DSymbolCache.h13 #include "llvm/ADT/IntervalMap.h"
69 IntervalMap<uint64_t, uint16_t, 8, IntervalMapHalfOpenInfo<uint64_t>>;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSplitKit.h21 #include "llvm/ADT/IntervalMap.h"
308 using RegAssignMap = IntervalMap<SlotIndex, unsigned>;
H A DLiveDebugVariables.cpp24 #include "llvm/ADT/IntervalMap.h"
141 using LocMap = IntervalMap<SlotIndex, DbgVariableValue, 4>;
1173 // IntervalMap if two vreg intervals collapse to the same physical location.
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp5442 using IntervalMap = DenseMap<Instruction *, unsigned>;
5447 IntervalMap EndPoint;
/freebsd-13-stable/contrib/llvm-project/lldb/source/Plugins/ObjectFile/ELF/
H A DObjectFileELF.cpp33 #include "llvm/ADT/IntervalMap.h"
1678 using VMMap = llvm::IntervalMap<addr_t, SectionSP, 4,
/freebsd-13-stable/lib/clang/libllvm/
H A DMakefile912 SRCS_MIN+= Support/IntervalMap.cpp
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp22 #include "llvm/ADT/IntervalMap.h"
22020 llvm::IntervalMap<int64_t, UnitT, 8, IntervalMapHalfOpenInfo<int64_t>>;

Completed in 197 milliseconds