| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| programopt.c | 92 newInst[i].DstReg.Index = VERT_RESULT_HPOS;
95 newInst[i].SrcReg[0].Index = mvpRef[i];
98 newInst[i].SrcReg[1].Index = VERT_ATTRIB_POS;
164 newInst[0].DstReg.Index = hposTemp;
167 newInst[0].SrcReg[0].Index = VERT_ATTRIB_POS;
170 newInst[0].SrcReg[1].Index = mvpRef[0];
176 newInst[i].DstReg.Index = hposTemp;
179 newInst[i].SrcReg[0].Index = VERT_ATTRIB_POS;
182 newInst[i].SrcReg[1].Index = mvpRef[i];
185 newInst[i].SrcReg[2].Index = hposTemp
[all...] |
| /external/mesa3d/src/mesa/program/ |
| programopt.c | 92 newInst[i].DstReg.Index = VERT_RESULT_HPOS;
95 newInst[i].SrcReg[0].Index = mvpRef[i];
98 newInst[i].SrcReg[1].Index = VERT_ATTRIB_POS;
164 newInst[0].DstReg.Index = hposTemp;
167 newInst[0].SrcReg[0].Index = VERT_ATTRIB_POS;
170 newInst[0].SrcReg[1].Index = mvpRef[0];
176 newInst[i].DstReg.Index = hposTemp;
179 newInst[i].SrcReg[0].Index = VERT_ATTRIB_POS;
182 newInst[i].SrcReg[1].Index = mvpRef[i];
185 newInst[i].SrcReg[2].Index = hposTemp
[all...] |
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 43 typedef typename internal::traits<Derived>::Index Index;
49 inline Index rows() const { return derived().rows(); }
50 inline Index cols() const { return derived().cols(); }
51 inline Index outerStride() const { return derived().outerStride(); }
52 inline Index innerStride() const { return derived().innerStride(); }
54 inline Scalar coeff(Index row, Index col) const { return derived().coeff(row,col); }
55 inline Scalar& coeffRef(Index row, Index col) { return derived().coeffRef(row,col);
[all...] |
| SolveTriangular.h | 19 template<typename LhsScalar, typename RhsScalar, typename Index, int Side, int Mode, bool Conjugate, int StorageOrder>
22 template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder, int OtherStorageOrder>
71 triangular_solve_vector<LhsScalar, RhsScalar, typename Lhs::Index, Side, Mode, LhsProductTraits::NeedToConjugate,
85 typedef typename Rhs::Index Index;
93 const Index size = lhs.rows();
94 const Index othersize = Side==OnTheLeft? rhs.cols() : rhs.rows();
101 triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
111 template<typename Lhs, typename Rhs, int Mode, int Index, int Size,
112 bool Stop = Index==Size
[all...] |
| CwiseUnaryOp.h | 70 EIGEN_STRONG_INLINE Index rows() const { return m_xpr.rows(); }
71 EIGEN_STRONG_INLINE Index cols() const { return m_xpr.cols(); }
101 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const
107 EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const
112 EIGEN_STRONG_INLINE const Scalar coeff(Index index) const
114 return derived().functor()(derived().nestedExpression().coeff(index));
118 EIGEN_STRONG_INLINE PacketScalar packet(Index index) cons
[all...] |
| Reverse.h | 102 inline Index rows() const { return m_matrix.rows(); }
103 inline Index cols() const { return m_matrix.cols(); }
105 inline Index innerStride() const
110 inline Scalar& operator()(Index row, Index col)
116 inline Scalar& coeffRef(Index row, Index col)
122 inline CoeffReturnType coeff(Index row, Index col) const
128 inline CoeffReturnType coeff(Index index) cons
[all...] |
| Visitor.h | 44 typedef typename Derived::Index Index;
48 for(Index i = 1; i < mat.rows(); ++i)
50 for(Index j = 1; j < mat.cols(); ++j)
51 for(Index i = 0; i < mat.rows(); ++i)
64 * void init(const Scalar& value, Index i, Index j);
66 * void operator() (const Scalar& value, Index i, Index j);
73 * \sa minCoeff(Index*,Index*), maxCoeff(Index*,Index*), DenseBase::redux(
[all...] |
| Assign.h | 134 template<typename Derived1, typename Derived2, int Index, int Stop>
138 outer = Index / Derived1::InnerSizeAtCompileTime,
139 inner = Index % Derived1::InnerSizeAtCompileTime
145 assign_DefaultTraversal_CompleteUnrolling<Derived1, Derived2, Index+1, Stop>::run(dst, src);
155 template<typename Derived1, typename Derived2, int Index, int Stop>
160 dst.copyCoeffByOuterInner(outer, Index, src);
161 assign_DefaultTraversal_InnerUnrolling<Derived1, Derived2, Index+1, Stop>::run(dst, src, outer);
175 template<typename Derived1, typename Derived2, int Index, int Stop>
180 dst.copyCoeff(Index, src);
181 assign_LinearTraversal_CompleteUnrolling<Derived1, Derived2, Index+1, Stop>::run(dst, src)
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixVector.h | 30 template<typename Index, typename LhsScalar, bool ConjugateLhs, typename RhsScalar, bool ConjugateRhs, int Version>
31 struct general_matrix_vector_product<Index,LhsScalar,ColMajor,ConjugateLhs,RhsScalar,ConjugateRhs,Version>
52 Index rows, Index cols,
53 const LhsScalar* lhs, Index lhsStride,
54 const RhsScalar* rhs, Index rhsIncr,
55 ResScalar* res, Index
80 const Index columnsAtOnce = 4;
81 const Index peels = 2;
82 const Index LhsPacketAlignedMask = LhsPacketSize-1
[all...] |
| TriangularMatrixVector.h | 17 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder, int Version=Specialized>
20 template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int Version>
21 struct triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor,Version>
29 static EIGEN_DONT_INLINE void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride,
30 const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, ResScalar alpha)
32 static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH;
33 Index size = (std::min)(_rows,_cols)
[all...] |
| SelfadjointRank2Update.h | 21 template<typename Scalar, typename Index, typename UType, typename VType, int UpLo>
24 template<typename Scalar, typename Index, typename UType, typename VType>
25 struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Lower>
27 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, Scalar alpha)
29 const Index size = u.size();
30 for (Index i=0; i<size; ++i)
39 template<typename Scalar, typename Index, typename UType, typename VType>
40 struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Upper>
42 static void run(Scalar* mat, Index stride, const UType& u, const VType& v, Scalar alpha)
44 const Index size = u.size()
[all...] |
| TriangularSolverMatrix_MKL.h | 42 template <typename Index, int Mode, bool Conjugate, int TriStorageOrder> \
43 struct triangular_solve_matrix<EIGTYPE,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor> \
52 Index size, Index otherSize, \
53 const EIGTYPE* _tri, Index triStride, \
54 EIGTYPE* _other, Index otherStride, level3_blocking<EIGTYPE,EIGTYPE>& /*blocking*/) \
97 template <typename Index, int Mode, bool Conjugate, int TriStorageOrder> \
98 struct triangular_solve_matrix<EIGTYPE,Index,OnTheRight,Mode,Conjugate,TriStorageOrder,ColMajor> \
107 Index size, Index otherSize,
[all...] |
| GeneralMatrixMatrix.h | 21 typename Index,
24 struct general_matrix_matrix_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor>
28 Index rows, Index cols, Index depth,
29 const LhsScalar* lhs, Index lhsStride,
30 const RhsScalar* rhs, Index rhsStride,
31 ResScalar* res, Index resStride,
34 GemmParallelInfo<Index>* info = 0)
37 general_matrix_matrix_product<Index,
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tests.pas | 50 CheckEquals(0, Stream.Index);
55 CheckEquals(1, Stream.Index);
60 CheckEquals(2, Stream.Index);
65 CheckEquals(3, Stream.Index);
70 CheckEquals(4, Stream.Index);
75 CheckEquals(5, Stream.Index);
80 CheckEquals(6, Stream.Index);
85 CheckEquals(7, Stream.Index);
90 CheckEquals(8, Stream.Index);
95 CheckEquals(8, Stream.Index);
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| CompressedStorage.h | 27 typedef _Index Index;
55 memcpy(m_indices, other.m_indices, m_size * sizeof(Index));
93 void append(const Scalar& v, Index i)
95 Index id = static_cast<Index>(m_size);
108 inline Index& index(size_t i) { return m_indices[i]; } function in class:Eigen::internal::CompressedStorage
109 inline const Index& index(size_t i) const { return m_indices[i]; } function in class:Eigen::internal::CompressedStorage
111 static CompressedStorage Map(Index* indices, Scalar* values, size_t size
[all...] |
| SparseView.h | 21 typedef int Index;
44 inline Index rows() const { return m_matrix.rows(); }
45 inline Index cols() const { return m_matrix.cols(); }
47 inline Index innerSize() const { return m_matrix.innerSize(); }
48 inline Index outerSize() const { return m_matrix.outerSize(); }
61 InnerIterator(const SparseView& view, Index outer) :
|
| /external/eigen/unsupported/test/ |
| matrix_function.cpp | 26 MatrixType randomMatrixWithRealEivals(const typename MatrixType::Index size)
28 typedef typename MatrixType::Index Index;
32 for (Index i = 0; i < size; ++i) {
45 static MatrixType run(const typename MatrixType::Index size);
52 static MatrixType run(const typename MatrixType::Index size)
54 typedef typename MatrixType::Index Index;
57 Index i = 0;
59 Index randomInt = internal::random<Index>(-1, 1)
[all...] |
| /external/eigen/Eigen/src/misc/ |
| Solve.h | 38 typedef typename Base::Index Index;
44 inline Index rows() const { return m_dec.cols(); }
45 inline Index cols() const { return m_rhs.cols(); }
65 typedef typename MatrixType::Index Index; \
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 28 typedef typename MatrixType::Index Index;
127 for (Index row = 0; row < rows; row++) {
131 const Index& col = row;
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
157 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
162 for (Index i = 0; i < rrow - row - 1; i++) {
170 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
191 for (Index row = 0; row < rows; row++) {
195 for (Index col = llIt.col(); col < row; col++)
[all...] |
| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 71 uint8_t Index;
72 explicit Capacity(uint8_t idx) : Index(idx) {}
75 Capacity() : Index(0) {}
83 size_t getSize() const { return size_t(1u) << Index; }
86 unsigned getBucket() const { return Index; }
91 Capacity getNext() const { return Capacity(Index + 1); }
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitperl/VCSUtils_unittest/ |
| parseSvnDiffHeader.pl | 46 Index: WebKitTools/Scripts/VCSUtils.pm
56 Index: WebKitTools/Scripts/VCSUtils.pm
71 Index: WebKitTools/Scripts/webkitperl/VCSUtils_unittest/parseDiffHeader.pl
81 Index: WebKitTools/Scripts/webkitperl/VCSUtils_unittest/parseDiffHeader.pl
96 Index: WebKit.xcworkspace/xcshareddata/xcschemes/All Source (target WebProcess).xcscheme
106 Index: WebKit.xcworkspace/xcshareddata/xcschemes/All Source (target WebProcess).xcscheme
121 Index: index_path.py
131 Index: index_path.py
147 Index: index_path.py\r
157 Index: index_path.py\
[all...] |
| /external/clang/lib/Sema/ |
| TypeLocBuilder.h | 33 /// The index of the first occupied byte in the buffer.
34 size_t Index;
49 Index(InlineCapacity), NumBytesAtAlign4(0), NumBytesAtAlign8(0)
82 Index = Capacity;
109 size_t FullDataSize = Capacity - Index;
111 memcpy(DI->getTypeLoc().getOpaqueData(), &Buffer[Index], FullDataSize);
122 size_t FullDataSize = Capacity - Index;
124 memcpy(Mem, &Buffer[Index], FullDataSize);
145 return TypeLoc(T, &Buffer[Index]);
|
| /external/eigen/Eigen/src/Householder/ |
| BlockHouseholder.h | 24 typedef typename TriangularFactorType::Index Index;
26 const Index nbVecs = vectors.cols();
29 for(Index i = 0; i < nbVecs; i++)
31 Index rs = vectors.rows() - i;
48 typedef typename MatrixType::Index Index;
50 Index nbVecs = vectors.cols();
|
| HouseholderSequence.h | 63 typedef typename VectorsType::Index Index;
81 typedef typename VectorsType::Index Index;
82 static inline const EssentialVectorType essentialVector(const HouseholderSequenceType& h, Index k)
84 Index start = k+1+h.m_shift;
94 typedef typename VectorsType::Index Index;
95 static inline const EssentialVectorType essentialVector(const HouseholderSequenceType& h, Index k)
97 Index start = k+1+h.m_shift
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
| ANTLRxxxxStreamFixture.cs | 101 Assert.AreEqual(0, inputStream.Index);
104 Assert.AreEqual(1, inputStream.Index);
107 Assert.AreEqual(2, inputStream.Index);
109 while (inputStream.Index < inputStream.Count)
113 Assert.AreEqual(inputStream.Index, inputStream.Count);
124 while (inputStream.Index < inputStream.Count)
129 Assert.AreEqual(inputStream.Index, inputStream.Count);
140 Assert.AreEqual(0, inputStream.Index);
145 Assert.AreEqual(1, inputStream.Index);
150 Assert.AreEqual(2, inputStream.Index);
[all...] |
