Home
last modified time | relevance | path

Searched refs:StartIdx (Results 1 – 25 of 51) sorted by relevance

123

/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DSuffixTreeNode.h43 unsigned StartIdx = EmptyIdx; member
91 SuffixTreeNode(NodeKind Kind, unsigned StartIdx) in SuffixTreeNode()
92 : Kind(Kind), StartIdx(StartIdx) {} in SuffixTreeNode()
152 SuffixTreeInternalNode(unsigned StartIdx, unsigned EndIdx, in SuffixTreeInternalNode()
154 : SuffixTreeNode(NodeKind::ST_Internal, StartIdx), EndIdx(EndIdx), in SuffixTreeInternalNode()
188 SuffixTreeLeafNode(unsigned StartIdx, unsigned *EndIdx) in SuffixTreeLeafNode()
189 : SuffixTreeNode(NodeKind::ST_Leaf, StartIdx), EndIdx(EndIdx) {} in SuffixTreeLeafNode()
H A DSuffixTree.h96 SuffixTreeNode *insertLeaf(SuffixTreeInternalNode &Parent, unsigned StartIdx,
108 unsigned StartIdx, unsigned EndIdx,
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegisterBankInfo.cpp269 static hash_code hashPartialMapping(unsigned StartIdx, unsigned Length, in hashPartialMapping() argument
271 return hash_combine(StartIdx, Length, RegBank ? RegBank->getID() : 0); in hashPartialMapping()
277 return hashPartialMapping(PartMapping.StartIdx, PartMapping.Length, in hash_value()
282 RegisterBankInfo::getPartialMapping(unsigned StartIdx, unsigned Length, in getPartialMapping() argument
286 hash_code Hash = hashPartialMapping(StartIdx, Length, &RegBank); in getPartialMapping()
294 PartMapping = std::make_unique<PartialMapping>(StartIdx, Length, RegBank); in getPartialMapping()
299 RegisterBankInfo::getValueMapping(unsigned StartIdx, unsigned Length, in getValueMapping() argument
301 return getValueMapping(&getPartialMapping(StartIdx, Length, RegBank), 1); in getValueMapping()
528 assert((StartIdx <= getHighBitIdx()) && "Overflow, switch to APInt?"); in verify()
536 OS << "[" << StartIdx << ", " << getHighBitIdx() << "], RegBank = "; in print()
[all …]
H A DLiveInterval.cpp120 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, SlotInde argument
[all...]
H A DStackMaps.cpp77 unsigned PatchPointOpers::getNextScratchIdx(unsigned StartIdx) const { in getNextScratchIdx()
78 if (!StartIdx) in getNextScratchIdx()
79 StartIdx = getVarIdx(); in getNextScratchIdx()
82 unsigned ScratchIdx = StartIdx, e = MI->getNumOperands(); in getNextScratchIdx()
573 const unsigned StartIdx = opers.getVarIdx(); in recordPatchPoint()
574 recordStackMapOpers(L, MI, opers.getID(), MI.operands_begin() + StartIdx,
579 const unsigned StartIdx = opers.getVarIdx(); recordStatepoint() local
H A DMachineOutliner.cpp606 for (const unsigned &StartIdx : RS.StartIndices) { in findCandidates() local
628 unsigned EndIdx = StartIdx + StringLen - 1; in findCandidates()
630 StartIdx <= CandidatesForRepeatedSeq.back().getEndIdx()) { in findCandidates()
633 LLVM_DEBUG(dbgs() << " .. DISCARD candidate @ [" << StartIdx << ", " in findCandidates()
647 MachineBasicBlock::iterator StartIt = Mapper.InstrList[StartIdx]; in findCandidates()
650 CandidatesForRepeatedSeq.emplace_back(StartIdx, StringLen, StartIt, EndIt, in findCandidates()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp59 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()
350 for (unsigned StartIdx : RepeatedSubstringStarts) in advance() local
351 RS.StartIndices.push_back(StartIdx); in advance()
H A DSuffixTreeNode.cpp19 unsigned SuffixTreeNode::getStartIdx() const { return StartIdx; } in getStartIdx()
20 void SuffixTreeNode::incrementStartIdx(unsigned Inc) { StartIdx += Inc; } in incrementStartIdx()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineOutliner.h40 unsigned StartIdx = 0;
123 unsigned getStartIdx() const { return StartIdx; } in getStartIdx()
126 unsigned getEndIdx() const { return StartIdx + Len - 1; } in getEndIdx()
199 Candidate(unsigned StartIdx, unsigned Len, in Candidate()
203 : StartIdx(StartIdx), Len(Len), FirstInst(FirstInst), LastInst(LastInst),
H A DRegisterBankInfo.h53 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 DCallingConvLower.h367 for (unsigned StartIdx = 0; StartIdx <= Regs.size() - RegsRequired; in AllocateRegBlock() local
368 ++StartIdx) { in AllocateRegBlock()
372 if (isAllocated(Regs[StartIdx + BlockIdx])) { in AllocateRegBlock()
380 MarkAllocated(Regs[StartIdx + BlockIdx]); in AllocateRegBlock()
382 return Regs[StartIdx]; in AllocateRegBlock()
H A DStackMaps.h140 unsigned getNextScratchIdx(unsigned StartIdx = 0) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ExpandImm.cpp155 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 DAArch64GenRegisterBankInfo.def15 /* StartIdx, Length, RegBank */
130 return Map.StartIdx == ValStartIdx && Map.Length == ValLength &&
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DIRSimilarityIdentifier.cpp427 IRSimilarityCandidate::IRSimilarityCandidate(unsigned StartIdx, unsigned Len, in IRSimilarityCandidate() argument
430 : StartIdx(StartIdx), Len(Len) { in IRSimilarityCandidate()
434 assert(StartIdx + Len > StartIdx && in IRSimilarityCandidate()
458 for (unsigned Loc = StartIdx; Loc < StartIdx + Len; Loc++, ID++) { in IRSimilarityCandidate()
906 return X.StartIdx <= Y.getEndIdx() && Y.StartIdx >= X.StartIdx; in overlap()
979 for (const unsigned &StartIdx : RS.StartIndices) { in createCandidatesFromSuffixTree() local
980 unsigned EndIdx = StartIdx + StringLen - 1; in createCandidatesFromSuffixTree()
984 for (unsigned CurrIdx = StartIdx; CurrIdx <= EndIdx; CurrIdx++) { in createCandidatesFromSuffixTree()
1001 std::advance(StartIt, StartIdx); in createCandidatesFromSuffixTree()
1005 CandsForRepSubstring.emplace_back(StartIdx, StringLen, *StartIt, *EndIt); in createCandidatesFromSuffixTree()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIRSimilarityIdentifier.h657 unsigned StartIdx = 0;
684 /// \param StartIdx - The starting location of the region.
688 IRSimilarityCandidate(unsigned StartIdx, unsigned Len,
931 unsigned getStartIdx() const { return StartIdx; } in getStartIdx()
934 unsigned getEndIdx() const { return StartIdx + Len - 1; } in getEndIdx()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelMatcherEmitter.cpp170 unsigned StartIdx, raw_ostream &OS);
428 unsigned StartIdx = CurrentIdx; in EmitMatcher() local
466 return CurrentIdx - StartIdx + 1; in EmitMatcher()
577 unsigned StartIdx = CurrentIdx; in EmitMatcher() local
639 return CurrentIdx - StartIdx + 1; in EmitMatcher()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86GenRegisterBankInfo.def15 /* StartIdx, Length, RegBank */
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCISelDAGToDAG.cpp1547 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 DPPCGenRegisterBankInfo.def16 /* StartIdx, Length, RegBank */
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenSchedule.cpp1340 bool IsRead, unsigned StartIdx);
1575 const SmallVectorImpl<unsigned> &RWSeq, bool IsRead, unsigned StartIdx) { in substituteVariantOperand() argument
1583 for (unsigned TransIdx = StartIdx, TransEnd = TransVec.size(); in substituteVariantOperand()
1615 unsigned StartIdx = TransVec.size(); in substituteVariants() local
1623 for (std::vector<PredTransition>::iterator I = TransVec.begin() + StartIdx, in substituteVariants()
1629 substituteVariantOperand(WriteSequence, /*IsRead=*/false, StartIdx); in substituteVariants()
1634 for (std::vector<PredTransition>::iterator I = TransVec.begin() + StartIdx, in substituteVariants()
1639 Subst |= substituteVariantOperand(ReadSequence, /*IsRead=*/true, StartIdx); in substituteVariants()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopIdiomVectorize.cpp245 Value *StartIdx = nullptr; in recognizeByteCompare() local
248 StartIdx = PN->getIncomingValue(0); in recognizeByteCompare()
251 StartIdx = PN->getIncomingValue(1); in recognizeByteCompare()
371 transformByteCompare(GEPA, GEPB, PN, MaxLen, Index, StartIdx, /*IncIdx=*/true, in recognizeByteCompare()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIOptimizeExecMaskingPreRA.cpp321 SlotIndex StartIdx = LIS->getInstructionIndex(SaveExecMI); in optimizeElseBranch() local
325 if (RegUnit.find(StartIdx) != std::prev(RegUnit.find(EndIdx))) in optimizeElseBranch()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DInlineAsmLowering.cpp305 unsigned StartIdx = Inst->getNumOperands(); in lowerInlineAsm() local
385 unsigned InstFlagIdx = StartIdx; in lowerInlineAsm()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DIROutliner.cpp2366 unsigned StartIdx = IRSC->getStartIdx(); in isCompatibleWithAlreadyOutlinedCode() local
2371 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in isCompatibleWithAlreadyOutlinedCode()
2424 unsigned StartIdx = IRSC.getStartIdx(); in pruneIncompatibleRegions() local
2428 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in pruneIncompatibleRegions()
2463 if (CurrentEndIdx != 0 && StartIdx <= CurrentEndIdx) in pruneIncompatibleRegions()
2969 unsigned StartIdx = OS->Candidate->getStartIdx(); in doOutline() local
2971 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in doOutline()

123