| /external/eigen/doc/snippets/ |
| Map_general_stride.cpp | 3 cout << Map<MatrixXi, 0, Stride<Dynamic,2> >
4 (array, 3, 3, Stride<Dynamic,2>(8, 2))
|
| Tutorial_Map_rowmajor.cpp | 5 cout << "Row-major using stride:\n" <<
6 Map<Matrix<int,2,4>, Unaligned, Stride<1,4> >(array) << endl;
|
| /external/eigen/Eigen/src/Core/ |
| Stride.h | 15 /** \class Stride
22 * It holds two values: the inner stride and the outer stride.
24 * The inner stride is the pointer increment between two consecutive entries within a given row of a
27 * The outer stride is the pointer increment between two consecutive rows of a row-major matrix or
34 * \param _OuterStrideAtCompileTime the outer stride, or Dynamic if you want to specify it at runtime.
35 * \param _InnerStrideAtCompileTime the inner stride, or Dynamic if you want to specify it at runtime.
44 class Stride
54 Stride()
61 Stride(Index outerStride, Index innerStride
[all...] |
| PlainObjectBase.h | 481 static inline typename StridedConstMapType<Stride<Outer, Inner> >::type Map(const Scalar* data, const Stride<Outer, Inner>& stride)
482 { return typename StridedConstMapType<Stride<Outer, Inner> >::type(data, stride); }
484 static inline typename StridedMapType<Stride<Outer, Inner> >::type Map(Scalar* data, const Stride<Outer, Inner>& stride)
485 { return typename StridedMapType<Stride<Outer, Inner> >::type(data, stride); }
[all...] |
| /external/ceres-solver/include/ceres/ |
| dynamic_autodiff_cost_function.h | 60 // by the Stride template parameter) with each pass. There is a tradeoff with
61 // the size of the passes; you may want to experiment with the stride.
77 template <typename CostFunctor, int Stride = 4>
122 vector<Jet<double, Stride> > input_jets(num_parameters);
123 vector<Jet<double, Stride> > output_jets(num_residuals());
126 vector<Jet<double, Stride>* > jet_parameters(num_parameter_blocks,
127 static_cast<Jet<double, Stride>* >(NULL));
158 // When `num_active_parameters % Stride != 0` then it can be the case
159 // that `active_parameter_count < Stride` while parameter_cursor is less
171 // Evaluate all of the strides. Each stride is a chunk of the derivative t
[all...] |
| /external/eigen/test/ |
| mapstaticmethods.cpp | 55 PlainObjectType::Map(ptr, Stride<Dynamic, Dynamic>(i,j)).setZero();
56 PlainObjectType::MapAligned(ptr, Stride<2,Dynamic>(2,i)).setZero();
57 PlainObjectType::Map(const_ptr, Stride<Dynamic,3>(i,3)).sum();
58 PlainObjectType::MapAligned(const_ptr, Stride<Dynamic, Dynamic>(i,j)).sum();
60 PlainObjectType::Map(ptr, Stride<2,3>()).setZero();
61 PlainObjectType::MapAligned(ptr, Stride<3,4>()).setZero();
62 PlainObjectType::Map(const_ptr, Stride<2,4>()).sum();
63 PlainObjectType::MapAligned(const_ptr, Stride<5,3>()).sum();
101 PlainObjectType::Map(ptr, rows, cols, Stride<Dynamic, Dynamic>(i,j)).setZero();
102 PlainObjectType::MapAligned(ptr, rows, cols, Stride<2,Dynamic>(2,i)).setZero()
[all...] |
| mapstride.cpp | 67 // test no inner stride and some dynamic outer stride
80 // test no inner stride and an outer stride of +4. This is quite important as for fixed-size matrices,
99 // test both inner stride and outer stride
101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
| /external/ceres-solver/include/ceres/internal/ |
| eigen.h | 55 Eigen::Stride<Eigen::Dynamic, 1> > ColMajorMatrixRef;
59 Eigen::Stride<Eigen::Dynamic, 1> > ConstColMajorMatrixRef;
|
| /external/compiler-rt/lib/tsan/tests/unit/ |
| tsan_vector_test.cc | 32 TEST(Vector, Stride) {
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
| omxVCM4P2_IDCT8x8blk_s.s | 56 ;// Stride RN 1 ;// destination stride in bytes
61 Stride RN 1
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
| omxVCM4P2_IDCT8x8blk_s.s | 56 ;// Stride RN 1 ;// destination stride in bytes
61 Stride RN 1
|
| /external/chromium_org/third_party/mesa/src/src/mesa/vbo/ |
| vbo_context.c | 64 cl->Stride = 0;
94 cl->Stride = 0;
141 cl->Stride = 0;
|
| /external/llvm/include/llvm/ADT/ |
| SparseSet.h | 204 const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
205 for (unsigned i = Sparse[Idx], e = size(); i < e; i += Stride) {
210 // Stride is 0 when SparseT >= unsigned. We don't need to loop.
211 if (!Stride)
|
| SparseMultiSet.h | 360 const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
361 for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; i += Stride) {
367 // Stride is 0 when SparseT >= unsigned. We don't need to loop.
368 if (!Stride)
|
| /external/mesa3d/src/mesa/vbo/ |
| vbo_context.c | 64 cl->Stride = 0;
94 cl->Stride = 0;
141 cl->Stride = 0;
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| recon_altivec.asm | 16 .macro row_of16 Diff Pred Dst Stride
28 add \Dst, \Dst, \Stride ;# next dst
36 ;# r6 = int stride
56 .macro two_rows_of8 Diff Pred Dst Stride write_first_four_pels
70 stwux r0, \Dst, \Stride
75 stwux r0, \Dst, \Stride ;# advance dst to next row
84 ;# r6 = int stride
124 ;# r6 = int stride
|
| /external/ceres-solver/internal/ceres/ |
| dense_sparse_matrix.cc | 154 Eigen::Stride<Eigen::Dynamic, 1>(m_.rows(), 1));
164 Eigen::Stride<Eigen::Dynamic, 1>(m_.rows(), 1));
|
| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 249 int Stride = 1;
251 Stride = -1;
280 Dst += Stride;
281 Src += Stride;
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopIdiomRecognize.cpp | 792 // Check to see if the stride matches the size of the store. If so, then we
795 const SCEVConstant *Stride = dyn_cast<SCEVConstant>(StoreEv->getOperand(1));
797 if (Stride == 0 || StoreSize != Stride->getValue()->getValue()) {
798 // TODO: Could also handle negative stride here someday, that will require
801 if (0 && Stride && StoreSize == -Stride->getValue()->getValue()) {
802 dbgs() << "NEGATIVE STRIDE: " << *SI << "\n";
814 // If the stored value is a strided load in the same loop with the same stride
854 // Check to see if the stride matches the size of the memset. If so, then w
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeVectorOps.cpp | 492 unsigned Stride = SrcVT.getScalarType().getSizeInBits()/8;
497 Chain, BasePTR, LD->getPointerInfo().getWithOffset(Idx * Stride),
503 DAG.getIntPtrConstant(Stride));
547 // Store Stride in bytes
548 unsigned Stride = ScalarSize/8;
558 ST->getPointerInfo().getWithOffset(Idx*Stride), MemSclVT,
562 DAG.getIntPtrConstant(Stride));
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/api/ |
| armCOMM_IDCT_s.h | 117 Stride RN 1 ;// destination stride in bytes
134 ;// Stride = r1 = Stride between input lines
141 M_IDCT $outsize, $inscale, $stride
217 IF "$stride"="s"
218 M_STR Stride, pStride
440 IF "$stride"="s"
498 IF "$stride"="s"
622 IF "$stride"="s
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/api/ |
| armCOMM_IDCT_s.h | 117 Stride RN 1 ;// destination stride in bytes
134 ;// Stride = r1 = Stride between input lines
141 M_IDCT $outsize, $inscale, $stride
217 IF "$stride"="s"
218 M_STR Stride, pStride
446 IF "$stride"="s"
504 IF "$stride"="s"
628 IF "$stride"="s
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| nvprogram.c | 375 params[0] = array->Stride;
419 params[0] = (GLfloat) array->Stride;
463 params[0] = array->Stride;
|
| /external/mesa3d/src/mesa/main/ |
| nvprogram.c | 375 params[0] = array->Stride;
419 params[0] = (GLfloat) array->Stride;
463 params[0] = array->Stride;
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 111 template<int InnerStrideAtCompileTime, int OuterStrideAtCompileTime> class Stride;
112 template<typename MatrixType, int MapOptions=Unaligned, typename StrideType = Stride<0,0> > class Map;
|
