| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | SuffixTreeNode.h | 44 unsigned StartIdx = EmptyIdx; member 92 SuffixTreeNode(NodeKind Kind, unsigned StartIdx) in SuffixTreeNode() 93 : Kind(Kind), StartIdx(StartIdx) {} in SuffixTreeNode() 153 SuffixTreeInternalNode(unsigned StartIdx, unsigned EndIdx, in SuffixTreeInternalNode() 155 : SuffixTreeNode(NodeKind::ST_Internal, StartIdx), EndIdx(EndIdx), in SuffixTreeInternalNode() 189 SuffixTreeLeafNode(unsigned StartIdx, unsigned *EndIdx) in SuffixTreeLeafNode() 190 : SuffixTreeNode(NodeKind::ST_Leaf, StartIdx), EndIdx(EndIdx) {} in SuffixTreeLeafNode()
|
| H A D | SuffixTree.h | 97 SuffixTreeNode *insertLeaf(SuffixTreeInternalNode &Parent, unsigned StartIdx, 109 unsigned StartIdx, unsigned EndIdx,
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegisterBankInfo.cpp | 267 static hash_code hashPartialMapping(unsigned StartIdx, unsigned Length, in hashPartialMapping() argument 269 return hash_combine(StartIdx, Length, RegBank ? RegBank->getID() : 0); in hashPartialMapping() 275 return hashPartialMapping(PartMapping.StartIdx, PartMapping.Length, in hash_value() 280 RegisterBankInfo::getPartialMapping(unsigned StartIdx, unsigned Length, in getPartialMapping() argument 284 hash_code Hash = hashPartialMapping(StartIdx, Length, &RegBank); in getPartialMapping() 292 PartMapping = std::make_unique<PartialMapping>(StartIdx, Length, RegBank); in getPartialMapping() 297 RegisterBankInfo::getValueMapping(unsigned StartIdx, unsigned Length, in getValueMapping() argument 299 return getValueMapping(&getPartialMapping(StartIdx, Length, RegBank), 1); in getValueMapping() 526 assert((StartIdx <= getHighBitIdx()) && "Overflow, switch to APInt?"); in verify() 534 OS << "[" << StartIdx << ", " << getHighBitIdx() << "], RegBank = "; in print() [all …]
|
| H A D | MachineOutliner.cpp | 652 unsigned StartIdx; member 655 MatchedEntry(unsigned StartIdx, unsigned EndIdx, unsigned Count) in MatchedEntry() 656 : StartIdx(StartIdx), EndIdx(EndIdx), Count(Count) {} in MatchedEntry() 727 MachineBasicBlock::iterator StartIt = InstrList[ME.StartIdx]; in findGlobalCandidates() 729 auto Length = ME.EndIdx - ME.StartIdx + 1; in findGlobalCandidates() 731 CandidatesForRepeatedSeq.emplace_back(ME.StartIdx, Length, StartIt, EndIt, in findGlobalCandidates() 773 for (const unsigned &StartIdx : RS.StartIndices) { in findCandidates() local 795 unsigned EndIdx = StartIdx + StringLen - 1; in findCandidates() 797 StartIdx <= CandidatesForRepeatedSeq.back().getEndIdx()) { in findCandidates() 800 LLVM_DEBUG(dbgs() << " .. DISCARD candidate @ [" << StartIdx << ", " in findCandidates() [all …]
|
| H A D | LiveInterval.cpp | 120 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Use) { in extendInBlock() argument 128 if (I->end <= StartIdx) in extendInBlock() 136 SlotIndex StartIdx, SlotIndex Use) { in extendInBlock() argument 142 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse)); in extendInBlock() 144 if (I->end <= StartIdx) in extendInBlock() 145 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse)); in extendInBlock() 550 SlotIndex StartIdx, SlotIndex Kill) { in extendInBlock() argument 553 return CalcLiveRangeUtilSet(this).extendInBlock(Undefs, StartIdx, Kill); in extendInBlock() 555 return CalcLiveRangeUtilVector(this).extendInBlock(Undefs, StartIdx, Kill); in extendInBlock() 558 VNInfo *LiveRange::extendInBlock(SlotIndex StartIdx, SlotIndex Kill) { in extendInBlock() argument [all …]
|
| H A D | StackMaps.cpp | 76 unsigned PatchPointOpers::getNextScratchIdx(unsigned StartIdx) const { in getNextScratchIdx() 77 if (!StartIdx) in getNextScratchIdx() 78 StartIdx = getVarIdx(); in getNextScratchIdx() 81 unsigned ScratchIdx = StartIdx, e = MI->getNumOperands(); in getNextScratchIdx() 564 const unsigned StartIdx = opers.getVarIdx(); in recordStatepoint() local 565 recordStackMapOpers(L, MI, opers.getID(), MI.operands_begin() + StartIdx, in recordStatepoint()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RegisterBankInfo.h | 53 unsigned StartIdx; member 66 constexpr PartialMapping(unsigned StartIdx, unsigned Length, in PartialMapping() 68 : StartIdx(StartIdx), Length(Length), RegBank(&RegBank) {} in PartialMapping() 72 unsigned getHighBitIdx() const { return StartIdx + Length - 1; } in getHighBitIdx() 316 getNewVRegsEnd(unsigned StartIdx, unsigned NumVal) const; 317 SmallVectorImpl<Register>::iterator getNewVRegsEnd(unsigned StartIdx, 471 const PartialMapping &getPartialMapping(unsigned StartIdx, unsigned Length, 479 const ValueMapping &getValueMapping(unsigned StartIdx, unsigned Length,
|
| H A D | MachineOutliner.h | 41 unsigned StartIdx = 0; 124 unsigned getStartIdx() const { return StartIdx; } in getStartIdx() 127 unsigned getEndIdx() const { return StartIdx + Len - 1; } in getEndIdx() 200 Candidate(unsigned StartIdx, unsigned Len, in Candidate() 204 : StartIdx(StartIdx), Len(Len), FirstInst(FirstInst), LastInst(LastInst), in Candidate()
|
| H A D | CallingConvLower.h | 370 for (unsigned StartIdx = 0; StartIdx <= Regs.size() - RegsRequired; in AllocateRegBlock() local 371 ++StartIdx) { in AllocateRegBlock() 375 if (isAllocated(Regs[StartIdx + BlockIdx])) { in AllocateRegBlock() 383 MarkAllocated(Regs[StartIdx + BlockIdx]); in AllocateRegBlock() 385 return Regs.slice(StartIdx, RegsRequired); in AllocateRegBlock()
|
| H A D | StackMaps.h | 141 LLVM_ABI unsigned getNextScratchIdx(unsigned StartIdx = 0) const;
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 59 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument 60 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf() 62 SuffixTreeLeafNode(StartIdx, &LeafEndIdx); in insertLeaf() 69 unsigned StartIdx, unsigned EndIdx, in insertInternalNode() argument 71 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode() 72 assert(!(!Parent && StartIdx != SuffixTreeNode::EmptyIdx) && in insertInternalNode() 75 SuffixTreeInternalNode(StartIdx, EndIdx, Root); in insertInternalNode()
|
| H A D | SuffixTreeNode.cpp | 18 unsigned SuffixTreeNode::getStartIdx() const { return StartIdx; } in getStartIdx() 19 void SuffixTreeNode::incrementStartIdx(unsigned Inc) { StartIdx += Inc; } in incrementStartIdx()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | SeedCollector.cpp | 30 ArrayRef<Instruction *> SeedBundle::getSlice(unsigned StartIdx, in getSlice() argument 44 assert(!isUsed(StartIdx) && "Expected unused at StartIdx"); in getSlice() 45 for (Instruction *S : drop_begin(Seeds, StartIdx)) { in getSlice() 48 if (isUsed(StartIdx + NumElements)) in getSlice() 70 return ArrayRef<Instruction *>(&Seeds[StartIdx], NumElements); in getSlice()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ExpandImm.cpp | 155 int StartIdx = NotSet; in trySequenceOfOnes() local 164 StartIdx = Idx; in trySequenceOfOnes() 170 if (StartIdx == NotSet || EndIdx == NotSet) in trySequenceOfOnes() 181 if (StartIdx > EndIdx) { in trySequenceOfOnes() 182 std::swap(StartIdx, EndIdx); in trySequenceOfOnes() 197 if ((Idx < StartIdx || EndIdx < Idx) && Chunk != Outside) { in trySequenceOfOnes() 208 } else if (Idx > StartIdx && Idx < EndIdx && Chunk != Inside) { in trySequenceOfOnes()
|
| H A D | AArch64GenRegisterBankInfo.def | 15 /* StartIdx, Length, RegBank */ 130 return Map.StartIdx == ValStartIdx && Map.Length == ValLength &&
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 426 IRSimilarityCandidate::IRSimilarityCandidate(unsigned StartIdx, unsigned Len, in IRSimilarityCandidate() argument 429 : StartIdx(StartIdx), Len(Len) { in IRSimilarityCandidate() 433 assert(StartIdx + Len > StartIdx && in IRSimilarityCandidate() 457 for (unsigned Loc = StartIdx; Loc < StartIdx + Len; Loc++, ID++) { in IRSimilarityCandidate() 900 return X.StartIdx <= Y.getEndIdx() && Y.StartIdx >= X.StartIdx; in overlap() 973 for (const unsigned &StartIdx : RS.StartIndices) { in createCandidatesFromSuffixTree() local 974 unsigned EndIdx = StartIdx + StringLen - 1; in createCandidatesFromSuffixTree() 978 for (unsigned CurrIdx = StartIdx; CurrIdx <= EndIdx; CurrIdx++) { in createCandidatesFromSuffixTree() 995 std::advance(StartIt, StartIdx); in createCandidatesFromSuffixTree() 999 CandsForRepSubstring.emplace_back(StartIdx, StringLen, *StartIt, *EndIt); in createCandidatesFromSuffixTree()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | IRSimilarityIdentifier.h | 656 unsigned StartIdx = 0; 687 LLVM_ABI IRSimilarityCandidate(unsigned StartIdx, unsigned Len, 930 unsigned getStartIdx() const { return StartIdx; } in getStartIdx() 933 unsigned getEndIdx() const { return StartIdx + Len - 1; } in getEndIdx()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenSchedule.cpp | 1294 unsigned StartIdx); 1528 bool IsRead, unsigned StartIdx) { in substituteVariantOperand() argument 1536 for (unsigned TransIdx = StartIdx, TransEnd = TransVec.size(); in substituteVariantOperand() 1568 unsigned StartIdx = TransVec.size(); in substituteVariants() local 1576 for (auto &PT : drop_begin(TransVec, StartIdx)) in substituteVariants() 1579 substituteVariantOperand(WriteSequence, /*IsRead=*/false, StartIdx); in substituteVariants() 1584 for (auto &PT : drop_begin(TransVec, StartIdx)) in substituteVariants() 1586 Subst |= substituteVariantOperand(ReadSequence, /*IsRead=*/true, StartIdx); in substituteVariants()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | DAGISelMatcherEmitter.cpp | 170 unsigned StartIdx, raw_ostream &OS); 431 unsigned StartIdx = CurrentIdx; in EmitMatcher() local 470 return CurrentIdx - StartIdx + 1; in EmitMatcher() 582 unsigned StartIdx = CurrentIdx; in EmitMatcher() local 650 return CurrentIdx - StartIdx + 1; in EmitMatcher()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCISelDAGToDAG.cpp | 1547 unsigned StartIdx, EndIdx; member 1560 : V(V), RLAmt(R), StartIdx(S), EndIdx(E), Repl32(false), Repl32CR(false), in BitGroup() 1925 if (BitGroups[0].StartIdx == 0 && in collectBitGroups() 1951 VRI.FirstGroupStartIdx = std::min(VRI.FirstGroupStartIdx, BG.StartIdx); in collectValueRotInfo() 1983 if (BG.StartIdx <= BG.EndIdx) { in assignRepl32BitGroups() 1984 for (unsigned i = BG.StartIdx; i <= BG.EndIdx; ++i) { in assignRepl32BitGroups() 1991 for (unsigned i = BG.StartIdx; i < Bits.size(); ++i) { in assignRepl32BitGroups() 2023 if (BG.StartIdx < 32 && BG.EndIdx < 32) { in assignRepl32BitGroups() 2034 << BG.StartIdx << ", " << BG.EndIdx << "]\n"); in assignRepl32BitGroups() 2046 I->StartIdx == (IP->EndIdx + 1) % 64 && I != IP) { in assignRepl32BitGroups() [all …]
|
| H A D | PPCGenRegisterBankInfo.def | 16 /* StartIdx, Length, RegBank */
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86GenRegisterBankInfo.def | 15 /* StartIdx, Length, RegBank */
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIOptimizeExecMaskingPreRA.cpp | 329 SlotIndex StartIdx = LIS->getInstructionIndex(SaveExecMI); in optimizeElseBranch() local 333 if (RegUnit.find(StartIdx) != std::prev(RegUnit.find(EndIdx))) in optimizeElseBranch()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | InlineAsmLowering.cpp | 305 unsigned StartIdx = Inst->getNumOperands(); in lowerInlineAsm() local 385 unsigned InstFlagIdx = StartIdx; in lowerInlineAsm()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | IROutliner.cpp | 2343 unsigned StartIdx = IRSC->getStartIdx(); in isCompatibleWithAlreadyOutlinedCode() local 2348 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in isCompatibleWithAlreadyOutlinedCode() 2401 unsigned StartIdx = IRSC.getStartIdx(); in pruneIncompatibleRegions() local 2405 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in pruneIncompatibleRegions() 2440 if (CurrentEndIdx != 0 && StartIdx <= CurrentEndIdx) in pruneIncompatibleRegions() 2947 unsigned StartIdx = OS->Candidate->getStartIdx(); in doOutline() local 2949 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in doOutline()
|