| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| SuffixTree.cpp | 42 unsigned StartIdx, unsigned Edge) {
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!");
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr);
54 unsigned StartIdx,
57 assert(StartIdx <= EndIdx && "String can't start after it ends!");
58 assert(!(!Parent && StartIdx != EmptyIdx) &&
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root);
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) {
175 insertInternalNode(Active.Node, NextNode->StartIdx,
176 NextNode->StartIdx + Active.Len - 1, FirstChar)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| SuffixTree.h | 50 unsigned StartIdx = EmptyIdx;
93 bool isRoot() const { return StartIdx == EmptyIdx; }
106 return *EndIdx - StartIdx + 1;
109 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link)
110 : StartIdx(StartIdx), EndIdx(EndIdx), Link(Link) {}
193 /// \param StartIdx The start index of this node's associated string.
197 SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx,
203 /// \param StartIdx The start index of this node's associated string.
208 SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx,
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineOutliner.h | 41 unsigned StartIdx = 0;
92 unsigned getStartIdx() const { return StartIdx; }
95 unsigned getEndIdx() const { return StartIdx + Len - 1; }
121 Candidate(unsigned StartIdx, unsigned Len,
125 : StartIdx(StartIdx), Len(Len), FirstInst(FirstInst), LastInst(LastInst),
|
| CallingConvLower.h | 388 for (unsigned StartIdx = 0; StartIdx <= Regs.size() - RegsRequired;
389 ++StartIdx) {
393 if (isAllocated(Regs[StartIdx + BlockIdx])) {
401 MarkAllocated(Regs[StartIdx + BlockIdx]);
403 return Regs[StartIdx];
|
| StackMaps.h | 140 unsigned getNextScratchIdx(unsigned StartIdx = 0) const;
|
| FastISel.h | 553 const CallInst *CI, unsigned StartIdx);
|
| LiveInterval.h | 474 /// Attempt to extend a value defined after @p StartIdx to include @p Use.
475 /// Both @p StartIdx and @p Use should be in the same basic block. In case
483 /// @p StartIdx, and there is no intervening "undef", extend it to be live
485 /// segment before @p Use and there is no "undef" between @p StartIdx and
489 SlotIndex StartIdx, SlotIndex Kill);
494 /// at @p StartIdx, extend it to be live up to @p Use, and return the
496 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Kill);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| RegisterBankInfo.h | 43 /// The StartIdx and Length represent what region of the orginal
46 /// at StartIdx bit and spanning Length bits.
47 /// StartIdx is the number of bits from the less significant bits.
52 unsigned StartIdx;
56 /// from StartIdx to StartIdx + Length -1.
65 PartialMapping(unsigned StartIdx, unsigned Length,
67 : StartIdx(StartIdx), Length(Length), RegBank(&RegBank) {}
71 unsigned getHighBitIdx() const { return StartIdx + Length - 1;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| RegisterBankInfo.cpp | 267 static hash_code hashPartialMapping(unsigned StartIdx, unsigned Length,
269 return hash_combine(StartIdx, Length, RegBank ? RegBank->getID() : 0);
275 return hashPartialMapping(PartMapping.StartIdx, PartMapping.Length,
280 RegisterBankInfo::getPartialMapping(unsigned StartIdx, unsigned Length,
284 hash_code Hash = hashPartialMapping(StartIdx, Length, &RegBank);
292 PartMapping = std::make_unique<PartialMapping>(StartIdx, Length, RegBank);
297 RegisterBankInfo::getValueMapping(unsigned StartIdx, unsigned Length,
299 return getValueMapping(&getPartialMapping(StartIdx, Length, RegBank), 1);
521 assert((StartIdx <= getHighBitIdx()) && "Overflow, switch to APInt?");
528 OS << "[" << StartIdx << ", " << getHighBitIdx() << "], RegBank = "
[all...] |
| InlineAsmLowering.cpp | 360 unsigned StartIdx = Inst->getNumOperands();
437 unsigned InstFlagIdx = StartIdx;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64ExpandImm.cpp | 156 int StartIdx = NotSet;
165 StartIdx = Idx;
171 if (StartIdx == NotSet || EndIdx == NotSet)
182 if (StartIdx > EndIdx) {
183 std::swap(StartIdx, EndIdx);
198 if ((Idx < StartIdx || EndIdx < Idx) && Chunk != Outside) {
209 } else if (Idx > StartIdx && Idx < EndIdx && Chunk != Inside) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| IRSimilarityIdentifier.cpp | 277 IRSimilarityCandidate::IRSimilarityCandidate(unsigned StartIdx, unsigned Len,
280 : StartIdx(StartIdx), Len(Len) {
284 assert(StartIdx + Len > StartIdx &&
308 for (unsigned Loc = StartIdx; Loc < StartIdx + Len; Loc++, ID++) {
646 return X.StartIdx <= Y.getEndIdx() && Y.StartIdx >= X.StartIdx;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LiveInterval.cpp | 120 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Use) {
128 if (I->end <= StartIdx)
136 SlotIndex StartIdx, SlotIndex Use) {
142 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse));
144 if (I->end <= StartIdx)
145 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse));
565 SlotIndex StartIdx, SlotIndex Kill) {
568 return CalcLiveRangeUtilSet(this).extendInBlock(Undefs, StartIdx, Kill);
570 return CalcLiveRangeUtilVector(this).extendInBlock(Undefs, StartIdx, Kill);
573 VNInfo *LiveRange::extendInBlock(SlotIndex StartIdx, SlotIndex Kill)
[all...] |
| MachineOutliner.cpp | 524 for (const unsigned &StartIdx : RS.StartIndices) {
525 unsigned EndIdx = StartIdx + StringLen - 1;
547 if (llvm::all_of(CandidatesForRepeatedSeq, [&StartIdx,
549 return (EndIdx < C.getStartIdx() || StartIdx > C.getEndIdx());
555 MachineBasicBlock::iterator StartIt = Mapper.InstrList[StartIdx];
559 CandidatesForRepeatedSeq.emplace_back(StartIdx, StringLen, StartIt,
|
| StackMaps.cpp | 77 unsigned PatchPointOpers::getNextScratchIdx(unsigned StartIdx) const {
78 if (!StartIdx)
79 StartIdx = getVarIdx();
82 unsigned ScratchIdx = StartIdx, e = MI->getNumOperands();
559 const unsigned StartIdx = opers.getVarIdx();
560 recordStackMapOpers(L, MI, opers.getID(), MI.operands_begin() + StartIdx,
|
| TargetInstrInfo.cpp | 498 unsigned StartIdx = 0;
501 std::tie(NumDefs, StartIdx) = TII.getPatchpointUnfoldableRange(MI);
511 } else if (Op < StartIdx) {
523 for (unsigned i = 0; i < StartIdx; ++i)
527 for (unsigned i = StartIdx, e = MI.getNumOperands(); i < e; ++i) {
|
| LiveDebugVariables.cpp | 307 void insertDebugValue(MachineBasicBlock *MBB, SlotIndex StartIdx,
1556 void UserValue::insertDebugValue(MachineBasicBlock *MBB, SlotIndex StartIdx,
1567 findInsertLocation(MBB, StartIdx, LIS, BBSkipInstsMap);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Lex/ |
| HeaderSearch.h | 201 unsigned StartIdx = 0;
213 void reset(unsigned StartIdx) {
214 this->StartIdx = StartIdx;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| IRSimilarityIdentifier.h | 473 unsigned StartIdx = 0;
494 /// \param StartIdx - The starting location of the region.
498 IRSimilarityCandidate(unsigned StartIdx, unsigned Len,
567 unsigned getStartIdx() const { return StartIdx; }
570 unsigned getEndIdx() const { return StartIdx + Len - 1; }
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| DAGISelMatcherEmitter.cpp | 90 unsigned StartIdx, raw_ostream &OS);
381 unsigned StartIdx = CurrentIdx;
419 return CurrentIdx - StartIdx + 1;
511 unsigned StartIdx = CurrentIdx;
573 return CurrentIdx - StartIdx + 1;
|
| CodeGenSchedule.cpp | 1335 bool IsRead, unsigned StartIdx);
1570 // operand. StartIdx is an index into TransVec where partial results
1571 // starts. RWSeq must be applied to all transitions between StartIdx and the end
1574 const SmallVectorImpl<unsigned> &RWSeq, bool IsRead, unsigned StartIdx) {
1582 for (unsigned TransIdx = StartIdx, TransEnd = TransVec.size();
1614 unsigned StartIdx = TransVec.size();
1623 TransVec.begin() + StartIdx, E = TransVec.end(); I != E; ++I) {
1627 substituteVariantOperand(WriteSequence, /*IsRead=*/false, StartIdx);
1633 TransVec.begin() + StartIdx, E = TransVec.end(); I != E; ++I) {
1636 Subst |= substituteVariantOperand(ReadSequence, /*IsRead=*/true, StartIdx);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SIOptimizeExecMaskingPreRA.cpp | 282 SlotIndex StartIdx = LIS->getInstructionIndex(SaveExecMI);
286 if (RegUnit.find(StartIdx) != std::prev(RegUnit.find(EndIdx)))
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCISelDAGToDAG.cpp | 1385 unsigned StartIdx, EndIdx;
1398 : V(V), RLAmt(R), StartIdx(S), EndIdx(E), Repl32(false), Repl32CR(false),
1752 if (BitGroups[0].StartIdx == 0 &&
1778 VRI.FirstGroupStartIdx = std::min(VRI.FirstGroupStartIdx, BG.StartIdx);
1810 if (BG.StartIdx <= BG.EndIdx) {
1811 for (unsigned i = BG.StartIdx; i <= BG.EndIdx; ++i) {
1818 for (unsigned i = BG.StartIdx; i < Bits.size(); ++i) {
1850 if (BG.StartIdx < 32 && BG.EndIdx < 32) {
1861 << BG.StartIdx << ", " << BG.EndIdx << "]\n");
1873 I->StartIdx == (IP->EndIdx + 1) % 64 && I != IP)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| IROutliner.cpp | 1236 unsigned StartIdx = IRSC.getStartIdx();
1239 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++)
1259 if (CurrentEndIdx != 0 && StartIdx <= CurrentEndIdx)
1635 unsigned StartIdx = OS->Candidate->getStartIdx();
1637 for (unsigned Idx = StartIdx; Idx <= EndIdx; Idx++)
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineAddSub.cpp | 544 unsigned StartIdx = SimpVect.size();
564 if (StartIdx + 1 != SimpVect.size()) {
566 R = *SimpVect[StartIdx];
567 for (unsigned Idx = StartIdx + 1; Idx < SimpVect.size(); Idx++)
571 SimpVect.resize(StartIdx);
|
