| /minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | BitVector.h | 27 class BitVector {
40 friend class BitVector; variable
48 reference(BitVector &b, unsigned Idx) { in reference()
75 BitVector() : Size(0), Capacity(0) { in BitVector() function
81 explicit BitVector(unsigned s, bool t = false) : Size(s) { in Size()
90 BitVector(const BitVector &RHS) : Size(RHS.size()) { in BitVector() function
102 BitVector(BitVector &&RHS) in BitVector() function
107 ~BitVector() { in ~BitVector()
235 BitVector &set() { in set()
241 BitVector &set(unsigned Idx) { in set()
[all …]
|
| H A D | SmallBitVector.h | 89 BitVector *getPointer() const { in getPointer()
91 return reinterpret_cast<BitVector *>(X); in getPointer()
100 void switchToLarge(BitVector *BV) { in switchToLarge()
146 switchToLarge(new BitVector(s, t));
154 switchToLarge(new BitVector(*RHS.getPointer())); in SmallBitVector()
260 BitVector *BV = new BitVector(N, t);
273 BitVector *BV = new BitVector(SmallSize); in reserve()
500 switchToLarge(new BitVector(*RHS.getPointer()));
|
| H A D | SparseBitVector.h | 332 const SparseBitVector<ElementSize> *BitVector;
350 if (BitVector->Elements.empty()) {
354 Iter = BitVector->Elements.begin();
382 if (Iter == BitVector->Elements.end()) {
434 SparseBitVectorIterator(): BitVector(NULL) {
439 bool end = false):BitVector(RHS) {
440 Iter = BitVector->Elements.begin();
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | RegisterScavenging.h | 64 BitVector RegUnitsAvailable;
68 BitVector KillRegUnits, DefRegUnits;
69 BitVector TmpRegUnits;
118 BitVector getRegsAvailable(const TargetRegisterClass *RC);
166 void setUsed(BitVector &RegUnits) { in setUsed()
169 void setUnused(BitVector &RegUnits) { in setUnused()
178 void addRegUnits(BitVector &BV, unsigned Reg);
186 BitVector &Candidates,
|
| /minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
| H A D | SpillPlacement.h | 37 class BitVector; variable
53 BitVector *ActiveNodes;
104 void prepare(BitVector &RegBundles);
|
| H A D | RegisterScavenging.cpp | 58 BitVector PR = MBB->getParent()->getFrameInfo()->getPristineRegs(MBB); in initRegState()
92 void RegScavenger::addRegUnits(BitVector &BV, unsigned Reg) { in addRegUnits()
277 BitVector RegScavenger::getRegsAvailable(const TargetRegisterClass *RC) { in getRegsAvailable()
278 BitVector Mask(TRI->getNumRegs()); in getRegsAvailable()
293 BitVector &Candidates, in findSurvivorReg()
371 BitVector Candidates = in scavengeRegister()
384 BitVector Available = getRegsAvailable(RC); in scavengeRegister()
|
| H A D | CriticalAntiDepBreaker.h | 44 const BitVector AllocatableSet;
68 BitVector KeepRegs;
|
| H A D | TargetRegisterInfo.cpp | 132 const TargetRegisterClass *RC, BitVector &R){ in getAllocatableSetForRC()
139 BitVector TargetRegisterInfo::getAllocatableSet(const MachineFunction &MF, in getAllocatableSet()
141 BitVector Allocatable(getNumRegs()); in getAllocatableSet()
155 BitVector Reserved = getReservedRegs(MF); in getAllocatableSet()
|
| H A D | AggressiveAntiDepBreaker.h | 121 BitVector CriticalPathSet;
172 BitVector GetRenameRegisters(unsigned Reg);
|
| H A D | StackColoring.cpp | 98 BitVector Begin;
100 BitVector End;
102 BitVector LiveIn;
104 BitVector LiveOut;
309 BitVector LocalLiveIn; in calculateLocalLiveness()
310 BitVector LocalLiveOut; in calculateLocalLiveness()
347 BitVector LocalEndBegin = BlockInfo.End; in calculateLocalLiveness()
|
| H A D | AggressiveAntiDepBreaker.cpp | 123 BitVector CPSet = TRI->getAllocatableSet(MF, CriticalPathRCs[i]); in AggressiveAntiDepBreaker()
166 BitVector Pristine = MFI->getPristineRegs(BB); in StartBlock()
495 BitVector AggressiveAntiDepBreaker::GetRenameRegisters(unsigned Reg) { in GetRenameRegisters()
496 BitVector BV(TRI->getNumRegs(), false); in GetRenameRegisters()
513 BitVector RCBV = TRI->getAllocatableSet(MF, RC); in GetRenameRegisters()
550 std::map<unsigned, BitVector> RenameRegisterMap; in FindSuitableFreeRegisters()
561 BitVector BV = GetRenameRegisters(Reg); in FindSuitableFreeRegisters()
562 RenameRegisterMap.insert(std::pair<unsigned, BitVector>(Reg, BV)); in FindSuitableFreeRegisters()
648 BitVector BV = RenameRegisterMap[Reg]; in FindSuitableFreeRegisters()
799 BitVector *ExcludeRegs = nullptr; in BreakAntiDependencies()
|
| /minix3/external/bsd/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| H A D | ReachableCode.h | 24 class BitVector; variable
62 llvm::BitVector &Reachable);
|
| H A D | CFGReachabilityAnalysis.h | 33 typedef llvm::BitVector ReachableSet;
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/R600/ |
| H A D | AMDGPURegisterInfo.h | 37 BitVector getReservedRegs(const MachineFunction &MF) const override { in getReservedRegs()
38 assert(!"Unimplemented"); return BitVector(); in getReservedRegs()
|
| H A D | R600RegisterInfo.cpp | 27 BitVector R600RegisterInfo::getReservedRegs(const MachineFunction &MF) const { in getReservedRegs()
28 BitVector Reserved(getNumRegs()); in getReservedRegs()
|
| H A D | R600RegisterInfo.h | 29 BitVector getReservedRegs(const MachineFunction &MF) const override;
|
| /minix3/external/bsd/llvm/dist/llvm/unittests/ADT/ |
| H A D | SCCIteratorTest.cpp | 34 typedef unsigned char BitVector; // Where the limitation N <= 8 comes from. typedef in llvm::Graph::NodeSubset
35 BitVector Elements;
36 NodeSubset(BitVector e) : Elements(e) {} in NodeSubset()
40 assert(N <= sizeof(BitVector)*CHAR_BIT && "Graph too big!"); in NodeSubset()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/NVPTX/ |
| H A D | NVPTXRegisterInfo.cpp | 87 BitVector NVPTXRegisterInfo::getReservedRegs(const MachineFunction &MF) const { in getReservedRegs()
88 BitVector Reserved(getNumRegs()); in getReservedRegs()
|
| /minix3/external/bsd/llvm/dist/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.h | 274 BitVector SubClasses;
300 BitVector TopoSigs;
360 BitVector &Out) const;
371 const BitVector &getSubClasses() const { return SubClasses; } in getSubClasses()
394 const BitVector &getTopoSigs() const { return TopoSigs; } in getTopoSigs()
718 BitVector computeCoveredRegisters(ArrayRef<Record*> Regs);
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/Mips/ |
| H A D | MipsDelaySlotFiller.cpp | 89 bool checkRegDefsUses(BitVector &NewDefs, BitVector &NewUses, unsigned Reg,
93 bool isRegInSet(const BitVector &RegSet, unsigned Reg) const;
96 BitVector Defs, Uses;
320 BitVector CallerSavedRegs(TRI.getNumRegs(), true); in setCallerSaved()
333 BitVector AllocSet = TRI.getAllocatableSet(MF); in setUnallocatableRegs()
356 BitVector NewDefs(TRI.getNumRegs()), NewUses(TRI.getNumRegs()); in update()
372 bool RegDefsUses::checkRegDefsUses(BitVector &NewDefs, BitVector &NewUses, in checkRegDefsUses()
385 bool RegDefsUses::isRegInSet(const BitVector &RegSet, unsigned Reg) const { in isRegInSet()
|
| /minix3/external/bsd/llvm/dist/clang/lib/Analysis/ |
| H A D | ReachableCode.cpp | 268 llvm::BitVector &Reachable, in scanFromBlock()
335 llvm::BitVector &Reachable) { in scanMaybeReachableFromBlock()
345 llvm::BitVector Visited;
346 llvm::BitVector &Reachable;
356 DeadCodeScan(llvm::BitVector &reachable, Preprocessor &PP) in DeadCodeScan()
633 llvm::BitVector &Reachable) { in ScanReachableFromBlock()
646 llvm::BitVector reachable(cfg->getNumBlockIDs()); in FindUnreachableCode()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/MSP430/ |
| H A D | MSP430RegisterInfo.h | 32 BitVector getReservedRegs(const MachineFunction &MF) const override;
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | CtorUtils.cpp | 29 void removeGlobalCtors(GlobalVariable *GCL, const BitVector &CtorsToRemove) { in removeGlobalCtors()
133 BitVector CtorsToRemove(NumCtors); in optimizeGlobalCtorsList()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/XCore/ |
| H A D | XCoreRegisterInfo.h | 35 BitVector getReservedRegs(const MachineFunction &MF) const override;
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/SystemZ/ |
| H A D | SystemZRegisterInfo.cpp | 35 BitVector
37 BitVector Reserved(getNumRegs()); in getReservedRegs()
|