Home
last modified time | relevance | path

Searched refs:EndIdx (Results 1 – 25 of 26) sorted by relevance

12

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Support/
DSuffixTree.cpp55 unsigned EndIdx, unsigned Edge) { in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
61 unsigned *E = new (InternalEndIdxAllocator) unsigned(EndIdx); in insertInternalNode()
97 unsigned SuffixTree::extend(unsigned EndIdx, unsigned SuffixesToAdd) { in extend() argument
105 Active.Idx = EndIdx; in extend()
108 assert(Active.Idx <= EndIdx && "Start index can't be after end index!"); in extend()
116 insertLeaf(*Active.Node, EndIdx, FirstChar); in extend()
144 unsigned LastChar = Str[EndIdx]; in extend()
180 insertLeaf(*SplitNode, EndIdx, LastChar); in extend()
201 Active.Idx = EndIdx - SuffixesToAdd + 1; in extend()
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/
DSuffixTree.h58 unsigned *EndIdx = nullptr; member
102 assert(*EndIdx != EmptyIdx && "EndIdx is undefined!"); in size()
106 return *EndIdx - StartIdx + 1; in size()
109 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link) in SuffixTreeNode()
110 : StartIdx(StartIdx), EndIdx(EndIdx), Link(Link) {} in SuffixTreeNode()
209 unsigned EndIdx, unsigned Edge);
229 unsigned extend(unsigned EndIdx, unsigned SuffixesToAdd);
DAutomaton.h133 unsigned EndIdx = TransitionInfoIdx; in transition() local
134 while (TransitionInfo[EndIdx].ToDfaState != 0) in transition()
135 ++EndIdx; in transition()
137 EndIdx - TransitionInfoIdx); in transition()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
DAArch64ExpandImm.cpp157 int EndIdx = NotSet; in trySequenceOfOnes() local
167 EndIdx = Idx; in trySequenceOfOnes()
171 if (StartIdx == NotSet || EndIdx == NotSet) in trySequenceOfOnes()
182 if (StartIdx > EndIdx) { in trySequenceOfOnes()
183 std::swap(StartIdx, EndIdx); in trySequenceOfOnes()
198 if ((Idx < StartIdx || EndIdx < Idx) && Chunk != Outside) { in trySequenceOfOnes()
209 } else if (Idx > StartIdx && Idx < EndIdx && Chunk != Inside) { in trySequenceOfOnes()
DAArch64InstrInfo.cpp1195 for (unsigned OpIdx = 0, EndIdx = Instr.getNumOperands(); OpIdx < EndIdx; in UpdateOperandRegClass() local
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
DLiveInterval.h621 auto Idx = R.begin(), EndIdx = R.end(); in findIndexesLiveAt() local
624 while (Idx != EndIdx && Seg != EndSeg) { in findIndexesLiveAt()
637 auto NotLessStart = std::lower_bound(Idx, EndIdx, Seg->start); in findIndexesLiveAt()
638 if (NotLessStart == EndIdx) in findIndexesLiveAt()
640 auto NotLessEnd = std::lower_bound(NotLessStart, EndIdx, Seg->end); in findIndexesLiveAt()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
DRegisterBankInfo.cpp183 for (unsigned OpIdx = 0, EndIdx = MI.getNumOperands(); OpIdx != EndIdx; in getInstrMappingImpl() local
233 for (; OpIdx != EndIdx; ++OpIdx) { in getInstrMappingImpl()
443 EndIdx = OpdMapper.getInstrMapping().getNumOperands(); in applyDefaultMapping() local
444 OpIdx != EndIdx; ++OpIdx) { in applyDefaultMapping()
DCombinerHelper.cpp2065 for (unsigned Idx = 1, EndIdx = SrcInstr->getNumOperands(); Idx != EndIdx; in matchCombineUnmergeMergeToPlainValues() local
2139 for (unsigned Idx = 1, EndIdx = MI.getNumDefs(); Idx != EndIdx; ++Idx) { in matchCombineUnmergeWithDeadLanesToTrunc() local
2219 for (unsigned Idx = 1, EndIdx = MI.getNumDefs(); Idx != EndIdx; ++Idx) { in applyCombineUnmergeZExtToZExt() local
/freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/
DCodeGenRegisters.cpp1843 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); in pruneUnitSets() local
1844 SubIdx != EndIdx; ++SubIdx) { in pruneUnitSets()
1847 for (; SuperIdx != EndIdx; ++SuperIdx) { in pruneUnitSets()
1868 if (SuperIdx == EndIdx) in pruneUnitSets()
1934 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeRegUnitSets() local
1942 SearchIdx != EndIdx; ++SearchIdx) { in computeRegUnitSets()
2116 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo() local
2121 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo() local
2128 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeDerivedInfo() local
DSubtargetEmitter.cpp1149 for (unsigned UseIdx = 0, EndIdx = Reads.size(); in GenSchedClassTables() local
1150 UseIdx != EndIdx; ++UseIdx) { in GenSchedClassTables()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
DPPCISelDAGToDAG.cpp1381 unsigned StartIdx, EndIdx; member
1394 : V(V), RLAmt(R), StartIdx(S), EndIdx(E), Repl32(false), Repl32CR(false), in BitGroup()
1749 BitGroups[BitGroups.size()-1].EndIdx == Bits.size()-1 && in collectBitGroups()
1753 BitGroups[BitGroups.size()-1].EndIdx = BitGroups[0].EndIdx; in collectBitGroups()
1806 if (BG.StartIdx <= BG.EndIdx) { in assignRepl32BitGroups()
1807 for (unsigned i = BG.StartIdx; i <= BG.EndIdx; ++i) { in assignRepl32BitGroups()
1820 for (unsigned i = 0; i <= BG.EndIdx; ++i) { in assignRepl32BitGroups()
1846 if (BG.StartIdx < 32 && BG.EndIdx < 32) { in assignRepl32BitGroups()
1857 << BG.StartIdx << ", " << BG.EndIdx << "]\n"); in assignRepl32BitGroups()
1869 I->StartIdx == (IP->EndIdx + 1) % 64 && I != IP) { in assignRepl32BitGroups()
[all …]
DPPCTargetTransformInfo.cpp774 for (int Idx = 0, EndIdx = PHI.getNumIncomingValues(); Idx < EndIdx; in isHardwareLoopProfitable() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DMachineOutliner.cpp525 unsigned EndIdx = StartIdx + StringLen - 1; in findCandidates() local
548 &EndIdx](const Candidate &C) { in findCandidates()
549 return (EndIdx < C.getStartIdx() || StartIdx > C.getEndIdx()); in findCandidates()
556 MachineBasicBlock::iterator EndIt = Mapper.InstrList[EndIdx]; in findCandidates()
DLiveIntervals.cpp1569 const SlotIndex EndIdx, LiveRange &LR, in repairOldRegInRange() argument
1572 LiveInterval::iterator LII = LR.find(EndIdx); in repairOldRegInRange()
1579 if (LII != LR.end() && LII->start < EndIdx) in repairOldRegInRange()
1673 SlotIndex EndIdx; in repairIntervalsInRange() local
1675 EndIdx = getMBBEndIdx(MBB).getPrevSlot(); in repairIntervalsInRange()
1677 EndIdx = getInstructionIndex(*End); in repairIntervalsInRange()
1706 repairOldRegInRange(Begin, End, EndIdx, S, Reg, S.LaneMask); in repairIntervalsInRange()
1708 repairOldRegInRange(Begin, End, EndIdx, LI, Reg); in repairIntervalsInRange()
DMIRPrinter.cpp418 const int EndIdx = MFI.getObjectIndexEnd(); in convertStackObjects() local
419 if (EndIdx > 0) in convertStackObjects()
420 StackObjectsIdx.reserve(EndIdx); in convertStackObjects()
422 for (int I = 0; I < EndIdx; ++I, ++ID) { in convertStackObjects()
DPostRASchedulerList.cpp159 void setEndIndex(unsigned EndIdx) { EndIndex = EndIdx; } in setEndIndex() argument
DFixupStatepointCallerSaved.cpp380 EndIdx = MI.getNumOperands(); in findRegistersToSpill() local
381 Idx < EndIdx; ++Idx) { in findRegistersToSpill()
DStackColoring.cpp912 SlotIndex EndIdx = Indexes->getMBBEndIdx(&MBB); in calculateLiveIntervals() local
914 Intervals[i]->addSegment(LiveInterval::Segment(Starts[i], EndIdx, VNI)); in calculateLiveIntervals()
DInlineSpiller.cpp566 EndIdx = MI.getNumOperands(); in canGuaranteeAssignmentAfterRemat() local
567 Idx < EndIdx; ++Idx) { in canGuaranteeAssignmentAfterRemat()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
DIRSimilarityIdentifier.cpp713 unsigned EndIdx = StartIdx + StringLen - 1; in createCandidatesFromSuffixTree() local
717 for (unsigned CurrIdx = StartIdx; CurrIdx <= EndIdx; CurrIdx++) { in createCandidatesFromSuffixTree()
736 std::advance(EndIt, EndIdx); in createCandidatesFromSuffixTree()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
DSIOptimizeExecMaskingPreRA.cpp283 SlotIndex EndIdx = LIS->getInstructionIndex(*AndExecMI); in optimizeElseBranch() local
286 if (RegUnit.find(StartIdx) != std::prev(RegUnit.find(EndIdx))) in optimizeElseBranch()
DAMDGPULegalizerInfo.cpp4161 auto EndIdx = Intr->VAddrEnd; in packImage16bitOpsToDwords() local
4163 for (unsigned I = Intr->VAddrStart; I < EndIdx; I++) { in packImage16bitOpsToDwords()
4179 if (((I + 1) >= EndIdx) || in packImage16bitOpsToDwords()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
DDWARFUnit.cpp781 for (size_t I = getDIEIndex(Die) + 1, EndIdx = DieArray.size(); I < EndIdx; in getSibling() local
824 for (size_t I = getDIEIndex(Die) + 1, EndIdx = DieArray.size(); I < EndIdx; in getLastChild() local
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
DIROutliner.cpp1317 unsigned EndIdx = IRSC.getEndIdx(); in pruneIncompatibleRegions() local
1319 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in pruneIncompatibleRegions()
1363 CurrentEndIdx = EndIdx; in pruneIncompatibleRegions()
1716 unsigned EndIdx = OS->Candidate->getEndIdx(); in doOutline() local
1717 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in doOutline()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
DInstCombineVectorOps.cpp1800 unsigned EndIdx = Mask.back(); in isShuffleExtractingFromLHS() local
1801 if (BegIdx > EndIdx || EndIdx >= LHSElems || EndIdx - BegIdx != MaskElems - 1) in isShuffleExtractingFromLHS()

12