| /external/eigen/Eigen/src/Core/products/ |
| 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/llvm/lib/CodeGen/ |
| InterleavedAccessPass.cpp | 103 /// <Index, Index+Factor, ..., Index+(NumElts-1)*Factor>
105 unsigned &Index) {
107 for (Index = 0; Index < Factor; Index++) {
113 if (Mask[i] >= 0 && static_cast<unsigned>(Mask[i]) != Index + i * Factor)
126 /// <0, 2, 4, 6> (mask of index 0 to extract even elements)
127 /// <1, 3, 5, 7> (mask of index 1 to extract odd elements
[all...] |
| /external/eigen/Eigen/src/Core/ |
| 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 rowId, Index colId) const
107 EIGEN_STRONG_INLINE PacketScalar packet(Index rowId, Index colId) 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...] |
| /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/Object/ |
| MachOUniversal.h | 36 /// \brief Index of object in the universal binary.
37 uint32_t Index;
42 ObjectForArch(const MachOUniversalBinary *Parent, uint32_t Index);
46 Index = 0;
50 return (Parent == Other.Parent) && (Index == Other.Index);
53 ObjectForArch getNext() const { return ObjectForArch(Parent, Index + 1); }
|
| /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/llvm/lib/Target/X86/ |
| X86MachineFunctionInfo.h | 91 /// The frame index of a stack object containing the original frame pointer
122 void setRAIndex(int Index) { ReturnAddrIndex = Index; }
125 void setFAIndex(int Index) { FrameAddrIndex = Index; }
158 void setSEHFramePtrSaveIndex(int Index) { SEHFramePtrSaveIndex = Index; }
|
| /system/update_engine/payload_generator/ |
| tarjan.cc | 34 void TarjanAlgorithm::Execute(Vertex::Index vertex,
36 vector<Vertex::Index>* out) {
41 it->index = it->lowlink = kInvalidIndex;
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) {
50 CHECK_EQ((*graph)[vertex].index, kInvalidIndex);
51 (*graph)[vertex].index = index_;
57 Vertex::Index vertex_next = it->first;
58 if ((*graph)[vertex_next].index == kInvalidIndex) {
64 (*graph)[vertex_next].index);
67 if ((*graph)[vertex].lowlink == (*graph)[vertex].index) {
[all...] |
| cycle_breaker_unittest.cc | 50 const Vertex::Index n_a = counter++;
51 const Vertex::Index n_b = counter++;
52 const Vertex::Index n_c = counter++;
53 const Vertex::Index n_d = counter++;
54 const Vertex::Index n_e = counter++;
55 const Vertex::Index n_f = counter++;
56 const Vertex::Index n_g = counter++;
57 const Vertex::Index n_h = counter++;
98 pair<Vertex::Index, EdgeProperties> EdgeWithWeight(Vertex::Index dest
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 17 template <typename _MatrixType, typename _OrderingType = COLAMDOrdering<typename _MatrixType::Index> > class SparseLU;
47 * SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<Index> > solver;
73 class SparseLU : public internal::SparseLUImpl<typename _MatrixType::Scalar, typename _MatrixType::Index>
80 typedef typename MatrixType::Index Index;
81 typedef SparseMatrix<Scalar,ColMajor,Index> NCMatrix;
82 typedef internal::MappedSuperNodalMatrix<Scalar, Index> SCMatrix;
84 typedef Matrix<Index,Dynamic,1> IndexVector;
85 typedef PermutationMatrix<Dynamic, Dynamic, Index> PermutationType;
86 typedef internal::SparseLUImpl<Scalar, Index> Base
[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/eigen/Eigen/src/SparseCore/ |
| CompressedStorage.h | 27 typedef _Index 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)
120 /** \returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key *
[all...] |
| /external/eigen/blas/ |
| Rank2Update.h | 18 template<typename Scalar, typename Index, int UpLo>
21 static void run(Index size, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha)
24 for (Index i=0; i<size; ++i)
36 template<typename Scalar, typename Index, int UpLo>
39 static void run(Index size, Scalar* mat, const Scalar* u, const Scalar* v, Scalar alpha)
42 Index offset = 0;
43 for (Index i=0; i<size; ++i)
|
| /external/llvm/include/llvm/CodeGen/ |
| DwarfStringPoolEntry.h | 23 unsigned Index;
42 unsigned getIndex() const { return I->second.Index; }
|
| /external/eigen/test/ |
| block.cpp | 13 template<typename MatrixType, typename Index, typename Scalar>
15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) {
26 template<typename MatrixType, typename Index, typename Scalar>
28 block_real_only(const MatrixType &, Index, Index, Index, Index, const Scalar&)
[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...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 74 typedef typename MatrixType::Index Index;
100 HessenbergDecomposition(Index size = Size==Dynamic ? 2 : Size)
295 Index n = matA.rows();
297 for (Index i = 0; i<n-1; ++i)
300 Index remainingSize = n-i-1;
340 typedef typename MatrixType::Index Index;
357 Index n = result.rows();
362 Index rows() const { return m_hess.packedMatrix().rows();
[all...] |
| RealSchur.h | 67 typedef typename MatrixType::Index Index;
83 RealSchur(Index size = RowsAtCompileTime==Dynamic ? 1 : RowsAtCompileTime)
166 * \sa compute(const MatrixType&, bool, Index)
204 RealSchur& setMaxIterations(Index maxIters)
211 Index getMaxIterations()
232 Index m_maxIters;
237 Index findSmallSubdiagEntry(Index iu);
238 void splitOffTwoRows(Index iu, bool computeU, const Scalar& exshift)
[all...] |
