HomeSort by: relevance | last modified time | path
    Searched defs:StartIdx (Results 1 - 17 of 17) sorted by relevancy

  /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/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/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),
  /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/lib/CodeGen/GlobalISel/
InlineAsmLowering.cpp 360 unsigned StartIdx = Inst->getNumOperands();
437 unsigned InstFlagIdx = StartIdx;
LegalizerHelper.cpp 249 const int StartIdx = Regs.size();
253 Regs[StartIdx + I] = MI.getOperand(I).getReg();
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
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,
RegAllocGreedy.cpp 2166 SlotIndex StartIdx =
2184 // StartIdx and after StopIdx.
2187 Matrix->getLiveUnions()[*Units] .find(StartIdx);
2211 LiveRange::const_iterator I = LR.find(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) {
  /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/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/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);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp 3662 int StartIdx[2] = { -1, -1 }; // StartIdx to extract from
3679 (StartIdx[Input] >= 0 && StartIdx[Input] != NewStartIdx))
3681 // Make sure we always update StartIdx as we use it to track if all
3683 StartIdx[Input] = NewStartIdx;
3686 if (StartIdx[0] < 0 && StartIdx[1] < 0) {
3694 if (StartIdx[Input] < 0)
3698 DAG.getVectorIdxConstant(StartIdx[Input], DL))
    [all...]
DAGCombiner.cpp 17105 size_t StartIdx = 0;
17106 while ((StartIdx + 1 < StoreNodes.size()) &&
17107 StoreNodes[StartIdx].OffsetFromBase + ElementSizeBytes !=
17108 StoreNodes[StartIdx + 1].OffsetFromBase)
17109 ++StartIdx;
17112 if (StartIdx + 1 >= StoreNodes.size())
17116 if (StartIdx)
17117 StoreNodes.erase(StoreNodes.begin(), StoreNodes.begin() + StartIdx);

Completed in 71 milliseconds