| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | SuffixTreeNode.h | 105 unsigned EndIdx = EmptyIdx;
152 SuffixTreeInternalNode(unsigned StartIdx, unsigned EndIdx, in SuffixTreeInternalNode()
154 : SuffixTreeNode(NodeKind::ST_Internal, StartIdx), EndIdx(EndIdx), in SuffixTreeInternalNode()
172 unsigned *EndIdx = nullptr; member
188 SuffixTreeLeafNode(unsigned StartIdx, unsigned *EndIdx) in SuffixTreeLeafNode()
189 : SuffixTreeNode(NodeKind::ST_Leaf, StartIdx), EndIdx(EndIdx) {} in SuffixTreeLeafNode()
|
| H A D | Automaton.h | 131 unsigned EndIdx = TransitionInfoIdx;
132 while (TransitionInfo[EndIdx].ToDfaState != 0) in transition()
133 ++EndIdx; in transition() local
135 EndIdx - TransitionInfoIdx); in transition()
|
| H A D | SuffixTree.h | 108 unsigned StartIdx, unsigned EndIdx,
134 unsigned extend(unsigned EndIdx, unsigned SuffixesToAdd);
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 69 unsigned StartIdx, unsigned EndIdx, in insertInternalNode() argument
71 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
75 SuffixTreeInternalNode(StartIdx, EndIdx, Root); in insertInternalNode()
179 unsigned SuffixTree::extend(unsigned EndIdx, unsigned SuffixesToAdd) { in extend() argument
187 Active.Idx = EndIdx; in extend()
190 assert(Active.Idx <= EndIdx && "Start index can't be after end index!"); in extend()
198 insertLeaf(*Active.Node, EndIdx, FirstChar); in extend()
228 unsigned LastChar = Str[EndIdx]; in extend()
264 insertLeaf(*SplitNode, EndIdx, LastChar); in extend()
285 Active.Idx = EndIdx - SuffixesToAdd + 1; in extend()
|
| H A D | SuffixTreeNode.cpp | 27 unsigned SuffixTreeInternalNode::getEndIdx() const { return EndIdx; } in getEndIdx()
35 assert(EndIdx && "EndIdx is empty?"); in getEndIdx()
36 return *EndIdx; in getEndIdx()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ExpandImm.cpp | 156 int EndIdx = NotSet; in trySequenceOfOnes() local
166 EndIdx = 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()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | LiveInterval.h | 630 auto Idx = R.begin(), EndIdx = R.end(); in findIndexesLiveAt() local
633 while (Idx != EndIdx && Seg != EndSeg) { in findIndexesLiveAt()
644 auto NotLessStart = std::lower_bound(Idx, EndIdx, Seg->start); in findIndexesLiveAt()
645 if (NotLessStart == EndIdx) in findIndexesLiveAt()
647 auto NotLessEnd = std::lower_bound(NotLessStart, EndIdx, Seg->end); in findIndexesLiveAt()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegisterBankInfo.cpp | 185 for (unsigned OpIdx = 0, EndIdx = MI.getNumOperands(); OpIdx != EndIdx; in getInstrMappingImpl() local
235 for (; OpIdx != EndIdx; ++OpIdx) { in getInstrMappingImpl()
445 EndIdx = OpdMapper.getInstrMapping().getNumOperands(); in applyDefaultMapping() local
446 OpIdx != EndIdx; ++OpIdx) { in applyDefaultMapping()
|
| H A D | StackFrameLayoutAnalysisPass.cpp | 229 for (int Idx = MFI.getObjectIndexBegin(), EndIdx = MFI.getObjectIndexEnd(); in emitStackFrameLayoutRemarks() local
230 Idx != EndIdx; ++Idx) { in emitStackFrameLayoutRemarks()
|
| H A D | LiveIntervals.cpp | 1579 const SlotIndex EndIdx, LiveRange &LR, in repairOldRegInRange() argument
1582 LiveInterval::iterator LII = LR.find(EndIdx); in repairOldRegInRange()
1584 if (LII != LR.end() && LII->start < EndIdx) { in repairOldRegInRange()
1675 SlotIndex EndIdx; in repairIntervalsInRange() local
1677 EndIdx = getMBBEndIdx(MBB).getPrevSlot(); in repairIntervalsInRange()
1679 EndIdx = getInstructionIndex(*End); in repairIntervalsInRange()
1733 repairOldRegInRange(Begin, End, EndIdx, S, Reg, S.LaneMask); in repairIntervalsInRange()
1736 repairOldRegInRange(Begin, End, EndIdx, LI, Reg); in repairIntervalsInRange()
|
| H A D | MachineOutliner.cpp | 628 unsigned EndIdx = StartIdx + StringLen - 1; in findCandidates() local
634 << EndIdx << "]; overlaps with candidate @ [" in findCandidates()
648 MachineBasicBlock::iterator EndIt = Mapper.InstrList[EndIdx]; in findCandidates()
|
| H A D | MIRPrinter.cpp | 436 const int EndIdx = MFI.getObjectIndexEnd(); in convertStackObjects() local
437 if (EndIdx > 0) in convertStackObjects()
438 StackObjectsIdx.reserve(EndIdx); in convertStackObjects()
440 for (int I = 0; I < EndIdx; ++I, ++ID) { in convertStackObjects()
|
| H A D | PostRASchedulerList.cpp | 157 void setEndIndex(unsigned EndIdx) { EndIndex = EndIdx; } in setEndIndex() argument
|
| H A D | FixupStatepointCallerSaved.cpp | 381 EndIdx = MI.getNumOperands(); in findRegistersToSpill() local
382 Idx < EndIdx; ++Idx) { in findRegistersToSpill()
|
| H A D | StackColoring.cpp | 883 SlotIndex EndIdx = Indexes->getMBBEndIdx(&MBB); in calculateLiveIntervals() local
885 Intervals[i]->addSegment(LiveInterval::Segment(Starts[i], EndIdx, VNI)); in calculateLiveIntervals()
|
| H A D | InlineSpiller.cpp | 613 EndIdx = MI.getNumOperands(); in canGuaranteeAssignmentAfterRemat() local
614 Idx < EndIdx; ++Idx) { in canGuaranteeAssignmentAfterRemat()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenRegisters.cpp | 1965 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size(); SubIdx != EndIdx; in pruneUnitSets() local
1969 for (; SuperIdx != EndIdx; ++SuperIdx) { in pruneUnitSets()
1990 if (SuperIdx == EndIdx) in pruneUnitSets()
2055 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeRegUnitSets() local
2063 SearchIdx != EndIdx; ++SearchIdx) { in computeRegUnitSets()
2227 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo() local
2232 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) in computeDerivedInfo() local
2239 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) { in computeDerivedInfo() local
|
| /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()
1926 BitGroups[BitGroups.size()-1].EndIdx == Bits.size()-1 && in collectBitGroups()
1930 BitGroups[BitGroups.size()-1].EndIdx = BitGroups[0].EndIdx; in collectBitGroups()
1983 if (BG.StartIdx <= BG.EndIdx) { in assignRepl32BitGroups()
1984 for (unsigned i = BG.StartIdx; i <= BG.EndIdx; ++i) { in assignRepl32BitGroups()
1997 for (unsigned i = 0; i <= BG.EndIdx; ++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 …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIOptimizeExecMaskingPreRA.cpp | 322 SlotIndex EndIdx = LIS->getInstructionIndex(*AndExecMI); in optimizeElseBranch() local
325 if (RegUnit.find(StartIdx) != std::prev(RegUnit.find(EndIdx))) in optimizeElseBranch()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | IROutliner.cpp | 2367 unsigned EndIdx = IRSC->getEndIdx(); in isCompatibleWithAlreadyOutlinedCode() local
2371 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in isCompatibleWithAlreadyOutlinedCode()
2425 unsigned EndIdx = IRSC.getEndIdx(); in pruneIncompatibleRegions() local
2428 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in pruneIncompatibleRegions()
2480 CurrentEndIdx = EndIdx; in pruneIncompatibleRegions()
2970 unsigned EndIdx = OS->Candidate->getEndIdx(); in doOutline() local
2971 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++) in doOutline()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 980 unsigned EndIdx = StartIdx + StringLen - 1; in createCandidatesFromSuffixTree() local
984 for (unsigned CurrIdx = StartIdx; CurrIdx <= EndIdx; CurrIdx++) { in createCandidatesFromSuffixTree()
1003 std::advance(EndIt, EndIdx); in createCandidatesFromSuffixTree()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineVectorOps.cpp | 2039 unsigned EndIdx = Mask.back(); in isShuffleExtractingFromLHS() local
2040 if (BegIdx > EndIdx || EndIdx >= LHSElems || EndIdx - BegIdx != MaskElems - 1) in isShuffleExtractingFromLHS()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | SubtargetEmitter.cpp | 1266 for (unsigned UseIdx = 0, EndIdx = Reads.size(); UseIdx != EndIdx; in GenSchedClassTables() local
|
| /freebsd/contrib/llvm-project/llvm/lib/MC/ |
| H A D | MCWin64EH.cpp | 1746 int EndIdx = CanTweakProlog ? 1 : 0; in getARMOffsetInProlog()
1747 for (int I = Epilog.size() - 1; I >= EndIdx; I--) { in getARMOffsetInProlog()
1737 int EndIdx = CanTweakProlog ? 1 : 0; getARMOffsetInProlog() local
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | CombinerHelper.cpp | 2229 for (unsigned Idx = 1, EndIdx = MI.getNumDefs(); Idx != EndIdx; ++Idx) { in matchCombineUnmergeWithDeadLanesToTrunc() local
2293 for (unsigned Idx = 1, EndIdx = MI.getNumDefs(); Idx != EndIdx; ++Idx) { in applyCombineUnmergeZExtToZExt() local
|