Searched refs:LastIdx (Results 1 - 4 of 4) sorted by relevance
/external/llvm/include/llvm/MC/ |
H A D | MCInstrItineraries.h | 185 unsigned LastIdx = Itineraries[ItinClassIndx].LastOperandCycle; local 186 if ((FirstIdx + OperandIdx) >= LastIdx)
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Reassociate.cpp | 1651 for (unsigned LastIdx = 0, Idx = 1, Size = Factors.size(); 1653 if (Factors[Idx].Power != Factors[LastIdx].Power) { 1654 LastIdx = Idx; 1662 InnerProduct.push_back(Factors[LastIdx].Base); 1666 } while (Idx < Size && Factors[Idx].Power == Factors[LastIdx].Power); 1670 Value *M = Factors[LastIdx].Base = buildMultiplyTree(Builder, InnerProduct); 1674 LastIdx = Idx;
|
/external/clang/tools/libclang/ |
H A D | CIndex.cpp | 5814 unsigned LastIdx = finished ? NextIdx-1 : NextIdx-2; 5815 assert(TokIdx <= LastIdx); 5817 SourceLocation::getFromRawEncoding(Tokens[LastIdx].int_data[1]); 5821 for (; TokIdx <= LastIdx; ++TokIdx)
|
/external/llvm/lib/Target/X86/ |
H A D | X86ISelLowering.cpp | 6084 /// in range [BaseIdx, LastIdx). 6087 unsigned BaseIdx, unsigned LastIdx, 6091 assert(BaseIdx * 2 <= LastIdx && "Invalid Indices in input!"); 6092 assert(VT.isVector() && VT.getVectorNumElements() >= LastIdx && 6098 unsigned NumElts = LastIdx - BaseIdx; 6085 isHorizontalBinOp(const BuildVectorSDNode *N, unsigned Opcode, SelectionDAG &DAG, unsigned BaseIdx, unsigned LastIdx, SDValue &V0, SDValue &V1) argument
|
Completed in 192 milliseconds