/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineOutliner.h | 40 unsigned StartIdx = 0; member in struct:llvm::outliner::Candidate 91 unsigned getStartIdx() const { return StartIdx; } 94 unsigned getEndIdx() const { return StartIdx + Len - 1; } 120 Candidate(unsigned StartIdx, unsigned Len, argument 124 : StartIdx(StartIdx), Len(Len), FirstInst(FirstInst), LastInst(LastInst),
|
H A D | CallingConvLower.h | 389 for (unsigned StartIdx = 0; StartIdx <= Regs.size() - RegsRequired; 390 ++StartIdx) { 394 if (isAllocated(Regs[StartIdx + BlockIdx])) { 402 MarkAllocated(Regs[StartIdx + BlockIdx]); 404 return Regs[StartIdx];
|
H A D | StackMaps.h | 140 unsigned getNextScratchIdx(unsigned StartIdx = 0) const;
|
H A D | FastISel.h | 595 const CallInst *CI, unsigned StartIdx);
|
H A D | LiveInterval.h | 473 /// Attempt to extend a value defined after @p StartIdx to include @p Use. 474 /// Both @p StartIdx and @p Use should be in the same basic block. In case 482 /// @p StartIdx, and there is no intervening "undef", extend it to be live 484 /// segment before @p Use and there is no "undef" between @p StartIdx and 488 SlotIndex StartIdx, SlotIndex Kill); 493 /// at @p StartIdx, extend it to be live up to @p Use, and return the 495 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Kill);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | RegisterBankInfo.h | 43 /// The StartIdx and Length represent what region of the orginal 46 /// at StartIdx bit and spanning Length bits. 47 /// StartIdx is the number of bits from the less significant bits. 52 unsigned StartIdx; member in struct:llvm::RegisterBankInfo::PartialMapping 56 /// from StartIdx to StartIdx + Length -1. 65 PartialMapping(unsigned StartIdx, unsigned Length, argument 67 : StartIdx(StartIdx), Length(Length), RegBank(&RegBank) {} 71 unsigned getHighBitIdx() const { return StartIdx [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | RegisterBankInfo.cpp | 267 static hash_code hashPartialMapping(unsigned StartIdx, unsigned Length, argument 269 return hash_combine(StartIdx, Length, RegBank ? RegBank->getID() : 0); 275 return hashPartialMapping(PartMapping.StartIdx, PartMapping.Length, 280 RegisterBankInfo::getPartialMapping(unsigned StartIdx, unsigned Length, argument 284 hash_code Hash = hashPartialMapping(StartIdx, Length, &RegBank); 292 PartMapping = std::make_unique<PartialMapping>(StartIdx, Length, RegBank); 297 RegisterBankInfo::getValueMapping(unsigned StartIdx, unsigned Length, argument 299 return getValueMapping(&getPartialMapping(StartIdx, Length, RegBank), 1); 522 assert((StartIdx <= getHighBitIdx()) && "Overflow, switch to APInt?"); 529 OS << "[" << StartIdx << ", " << getHighBitId [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineOutliner.cpp | 129 unsigned StartIdx = EmptyIdx; member in struct:__anon1760::SuffixTreeNode 172 bool isRoot() const { return StartIdx == EmptyIdx; } 185 return *EndIdx - StartIdx + 1; 188 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link) argument 189 : StartIdx(StartIdx), EndIdx(EndIdx), Link(Link) {} 272 /// \param StartIdx The start index of this node's associated string. 276 SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx, argument 279 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); 282 SuffixTreeNode(StartIdx, 296 insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx, unsigned EndIdx, unsigned Edge) argument [all...] |
H A D | StackMaps.cpp | 69 unsigned PatchPointOpers::getNextScratchIdx(unsigned StartIdx) const { 70 if (!StartIdx) 71 StartIdx = getVarIdx(); 74 unsigned ScratchIdx = StartIdx, e = MI->getNumOperands(); 399 const unsigned StartIdx = opers.getVarIdx(); local 400 recordStackMapOpers(L, MI, opers.getID(), MI.operands_begin() + StartIdx,
|
H A D | LiveInterval.cpp | 120 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Use) { argument 128 if (I->end <= StartIdx) 136 SlotIndex StartIdx, SlotIndex Use) { 142 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse)); 144 if (I->end <= StartIdx) 145 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse)); 565 SlotIndex StartIdx, SlotIndex Kill) { 568 return CalcLiveRangeUtilSet(this).extendInBlock(Undefs, StartIdx, Kill); 570 return CalcLiveRangeUtilVector(this).extendInBlock(Undefs, StartIdx, Kill); 573 VNInfo *LiveRange::extendInBlock(SlotIndex StartIdx, SlotInde 135 extendInBlock(ArrayRef<SlotIndex> Undefs, SlotIndex StartIdx, SlotIndex Use) argument [all...] |
H A D | TargetInstrInfo.cpp | 472 unsigned StartIdx = 0; local 476 StartIdx = StackMapOpers(&MI).getVarIdx(); 482 StartIdx = PatchPointOpers(&MI).getVarIdx(); 487 StartIdx = StatepointOpers(&MI).getVarIdx(); 497 if (Op < StartIdx) 506 for (unsigned i = 0; i < StartIdx; ++i) 509 for (unsigned i = StartIdx; i < MI.getNumOperands(); ++i) {
|
H A D | LiveDebugVariables.cpp | 176 void insertDebugValue(MachineBasicBlock *MBB, SlotIndex StartIdx, 1304 void UserValue::insertDebugValue(MachineBasicBlock *MBB, SlotIndex StartIdx, argument 1312 MachineBasicBlock::iterator I = findInsertLocation(MBB, StartIdx, LIS);
|
H A D | RegAllocGreedy.cpp | 2159 SlotIndex StartIdx = local 2177 // StartIdx and after StopIdx. 2180 Matrix->getLiveUnions()[*Units] .find(StartIdx); 2204 LiveRange::const_iterator I = LR.find(StartIdx);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64ExpandImm.cpp | 157 int StartIdx = NotSet; local 166 StartIdx = Idx; 172 if (StartIdx == NotSet || EndIdx == NotSet) 183 if (StartIdx > EndIdx) { 184 std::swap(StartIdx, EndIdx); 199 if ((Idx < StartIdx || EndIdx < Idx) && Chunk != Outside) { 210 } else if (Idx > StartIdx && Idx < EndIdx && Chunk != Inside) {
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Lex/ |
H A D | HeaderSearch.h | 198 unsigned StartIdx = 0; member in struct:clang::HeaderSearch::LookupFileCacheInfo 210 void reset(unsigned StartIdx) { argument 211 this->StartIdx = StartIdx;
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DAGISelMatcherEmitter.cpp | 86 unsigned StartIdx, raw_ostream &OS); 291 unsigned StartIdx = CurrentIdx; local 344 return CurrentIdx - StartIdx + 1; 436 unsigned StartIdx = CurrentIdx; local 519 return CurrentIdx-StartIdx;
|
H A D | CodeGenSchedule.cpp | 1334 bool IsRead, unsigned StartIdx); 1570 // operand. StartIdx is an index into TransVec where partial results 1571 // starts. RWSeq must be applied to all transitions between StartIdx and the end 1574 const SmallVectorImpl<unsigned> &RWSeq, bool IsRead, unsigned StartIdx) { 1583 for (unsigned TransIdx = StartIdx, TransEnd = TransVec.size(); 1617 unsigned StartIdx = TransVec.size(); local 1628 TransVec.begin() + StartIdx, E = TransVec.end(); I != E; ++I) { 1631 substituteVariantOperand(*WSI, /*IsRead=*/false, StartIdx); 1639 TransVec.begin() + StartIdx, E = TransVec.end(); I != E; ++I) { 1642 substituteVariantOperand(*RSI, /*IsRead=*/true, StartIdx); 1573 substituteVariantOperand( const SmallVectorImpl<unsigned> &RWSeq, bool IsRead, unsigned StartIdx) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCISelDAGToDAG.cpp | 1152 unsigned StartIdx, EndIdx; member in struct:__anon2358::BitPermutationSelector::BitGroup 1165 : V(V), RLAmt(R), StartIdx(S), EndIdx(E), Repl32(false), Repl32CR(false), 1517 if (BitGroups[0].StartIdx == 0 && 1543 VRI.FirstGroupStartIdx = std::min(VRI.FirstGroupStartIdx, BG.StartIdx); 1575 if (BG.StartIdx <= BG.EndIdx) { 1576 for (unsigned i = BG.StartIdx; i <= BG.EndIdx; ++i) { 1583 for (unsigned i = BG.StartIdx; i < Bits.size(); ++i) { 1615 if (BG.StartIdx < 32 && BG.EndIdx < 32) { 1626 << BG.StartIdx << ", " << BG.EndIdx << "]\n"); 1638 I->StartIdx [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineAddSub.cpp | 543 unsigned StartIdx = SimpVect.size(); local 563 if (StartIdx + 1 != SimpVect.size()) { 565 R = *SimpVect[StartIdx]; 566 for (unsigned Idx = StartIdx + 1; Idx < SimpVect.size(); Idx++) 570 SimpVect.resize(StartIdx);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 563 /// This function adds (StartIdx, StartIdx + Step, StartIdx + 2*Step, ...) 566 virtual Value *getStepVector(Value *Val, int StartIdx, Value *Step, 793 Value *getStepVector(Value *Val, int StartIdx, Value *Step, 1902 Value *InnerLoopVectorizer::getStepVector(Value *Val, int StartIdx, Value *Step, 1918 Indices.push_back(ConstantInt::get(STy, StartIdx + i)); 1936 Indices.push_back(ConstantFP::get(STy, (double)(StartIdx + i))); 1990 auto *StartIdx = getSignedIntOrFpConstant(ScalarIVTy, VF * Part + Lane); 1991 auto *Mul = addFastMathFlag(Builder.CreateBinOp(MulOp, StartIdx, Ste [all...] |
H A D | SLPVectorizer.cpp | 5793 unsigned StartIdx = 0; 5795 for (unsigned Cnt = StartIdx, E = Operands.size(); Cnt + Size <= E;) { 5805 if (Cnt == StartIdx) 5806 StartIdx += Size; 5813 if (StartIdx >= Operands.size())
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMRegisterBankInfo.cpp | 51 return PM.StartIdx == Start && PM.Length == Length &&
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | FastISel.cpp | 776 const CallInst *CI, unsigned StartIdx) { 777 for (unsigned i = StartIdx, e = CI->getNumArgOperands(); i != e; ++i) { 775 addStackMapLiveVars(SmallVectorImpl<MachineOperand> &Ops, const CallInst *CI, unsigned StartIdx) argument
|
H A D | SelectionDAGBuilder.cpp | 3697 int StartIdx[2] = { -1, -1 }; // StartIdx to extract from local 3714 (StartIdx[Input] >= 0 && StartIdx[Input] != NewStartIdx)) 3716 // Make sure we always update StartIdx as we use it to track if all 3718 StartIdx[Input] = NewStartIdx; 3721 if (StartIdx[0] < 0 && StartIdx[1] < 0) { 3729 if (StartIdx[Input] < 0) 3734 DAG.getConstant(StartIdx[Inpu 8718 addStackMapLiveVars(ImmutableCallSite CS, unsigned StartIdx, const SDLoc &DL, SmallVectorImpl<SDValue> &Ops, SelectionDAGBuilder &Builder) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Lex/ |
H A D | HeaderSearch.cpp | 878 if (!SkipCache && CacheLookup.StartIdx == i+1) { 890 CacheLookup.reset(/*StartIdx=*/i+1);
|