| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | SuffixTree.h | 54 /// Every leaf node must have its \p EndIdx incremented at the end of every
58 unsigned *EndIdx = nullptr; member in struct:llvm::SuffixTreeNode
102 assert(*EndIdx != EmptyIdx && "EndIdx is undefined!");
106 return *EndIdx - StartIdx + 1;
109 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link) argument
110 : StartIdx(StartIdx), EndIdx(EndIdx), Link(Link) {}
204 /// \param EndIdx The end index of this node's associated string.
209 unsigned EndIdx, unsigne
[all...] |
| H A D | Automaton.h | 133 unsigned EndIdx = TransitionInfoIdx; local
134 while (TransitionInfo[EndIdx].ToDfaState != 0)
135 ++EndIdx;
137 EndIdx - TransitionInfoIdx);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 55 unsigned EndIdx, unsigned Edge) {
57 assert(StartIdx <= EndIdx && "String can't start after it ends!");
61 unsigned *E = new (InternalEndIdxAllocator) unsigned(EndIdx);
97 unsigned SuffixTree::extend(unsigned EndIdx, unsigned SuffixesToAdd) { argument
105 Active.Idx = EndIdx;
108 assert(Active.Idx <= EndIdx && "Start index can't be after end index!");
116 insertLeaf(*Active.Node, EndIdx, FirstChar);
144 unsigned LastChar = Str[EndIdx];
180 insertLeaf(*SplitNode, EndIdx, LastChar);
201 Active.Idx = EndIdx
53 insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx, unsigned EndIdx, unsigned Edge) argument
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64ExpandImm.cpp | 158 int EndIdx = NotSet; local
168 EndIdx = 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) {
|
| H A D | AArch64InstrInfo.cpp | 1098 for (unsigned OpIdx = 0, EndIdx = Instr.getNumOperands(); OpIdx < EndIdx;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | FixupStatepointCallerSaved.cpp | 187 EndIdx = MI.getNumOperands();
188 Idx < EndIdx; ++Idx) {
|
| H A D | MachineOutliner.cpp | 530 unsigned EndIdx = StartIdx + StringLen - 1; local
554 [&StartIdx, &EndIdx](const Candidate &C) {
555 return (EndIdx < C.getStartIdx() || StartIdx > C.getEndIdx());
562 MachineBasicBlock::iterator EndIt = Mapper.InstrList[EndIdx];
|
| H A D | PostRASchedulerList.cpp | 159 void setEndIndex(unsigned EndIdx) { EndIndex = EndIdx; } argument
|
| H A D | StackColoring.cpp | 868 SlotIndex EndIdx = Indexes->getMBBEndIdx(&MBB); local
870 Intervals[i]->addSegment(LiveInterval::Segment(Starts[i], EndIdx, VNI));
|
| H A D | InlineSpiller.cpp | 546 EndIdx = MI.getNumOperands();
547 Idx < EndIdx; ++Idx) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCISelDAGToDAG.cpp | 1167 unsigned StartIdx, EndIdx; member in struct:__anon4268::BitPermutationSelector::BitGroup
1180 : V(V), RLAmt(R), StartIdx(S), EndIdx(E), Repl32(false), Repl32CR(false),
1533 BitGroups[BitGroups.size()-1].EndIdx == Bits.size()-1 &&
1537 BitGroups[BitGroups.size()-1].EndIdx = BitGroups[0].EndIdx;
1590 if (BG.StartIdx <= BG.EndIdx) {
1591 for (unsigned i = BG.StartIdx; i <= BG.EndIdx; ++i) {
1604 for (unsigned i = 0; i <= BG.EndIdx; ++i) {
1630 if (BG.StartIdx < 32 && BG.EndIdx < 32) {
1641 << BG.StartIdx << ", " << BG.EndIdx << "]\
[all...] |
| H A D | PPCTargetTransformInfo.cpp | 554 for (int Idx = 0, EndIdx = PHI.getNumIncomingValues(); Idx < EndIdx;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.cpp | 1847 for (unsigned SubIdx = 0, EndIdx = RegUnitSets.size();
1848 SubIdx != EndIdx; ++SubIdx) {
1851 for (; SuperIdx != EndIdx; ++SuperIdx) {
1872 if (SuperIdx == EndIdx)
1938 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx) {
1946 SearchIdx != EndIdx; ++SearchIdx) { local
2121 for (unsigned Idx = 0, EndIdx = RegUnitSets.size(); Idx != EndIdx; ++Idx)
2126 for (unsigned Idx = 0, EndIdx
[all...] |
| H A D | SubtargetEmitter.cpp | 1152 for (unsigned UseIdx = 0, EndIdx = Reads.size();
1153 UseIdx != EndIdx; ++UseIdx) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | LiveInterval.h | 621 auto Idx = R.begin(), EndIdx = R.end();
624 while (Idx != EndIdx && Seg != EndSeg) {
637 auto NotLessStart = std::lower_bound(Idx, EndIdx, Seg->start);
638 if (NotLessStart == EndIdx)
640 auto NotLessEnd = std::lower_bound(NotLessStart, EndIdx, Seg->end);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | RegisterBankInfo.cpp | 183 for (unsigned OpIdx = 0, EndIdx = MI.getNumOperands(); OpIdx != EndIdx;
233 for (; OpIdx != EndIdx; ++OpIdx) {
444 EndIdx = OpdMapper.getInstrMapping().getNumOperands();
445 OpIdx != EndIdx; ++OpIdx) {
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFUnit.cpp | 815 for (size_t I = getDIEIndex(Die) + 1, EndIdx = DieArray.size(); I < EndIdx;
858 for (size_t I = getDIEIndex(Die) + 1, EndIdx = DieArray.size(); I < EndIdx;
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineVectorOps.cpp | 1441 unsigned EndIdx = Mask.back(); local
1442 if (BegIdx > EndIdx || EndIdx >= LHSElems || EndIdx - BegIdx != MaskElems - 1)
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPULegalizerInfo.cpp | 3588 int AddrIdx, int DimIdx, int EndIdx,
3593 for (int I = AddrIdx; I < EndIdx; ++I) {
3606 if (((I + 1) >= EndIdx) ||
|
| H A D | SIISelLowering.cpp | 5773 unsigned DimIdx, unsigned EndIdx,
5776 for (unsigned I = DimIdx; I < EndIdx; I++) {
5784 if (((I + 1) >= EndIdx) ||
5770 packImageA16AddressToDwords(SelectionDAG &DAG, SDValue Op, MVT PackVectorVT, SmallVectorImpl<SDValue> &PackedAddrs, unsigned DimIdx, unsigned EndIdx, unsigned NumGradients) argument
|