| /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/deqp/framework/delibs/decpp/ |
| deArrayBuffer.hpp | 47 template <typename T, size_t Alignment = (sizeof(T) > 4 ? 4 : sizeof(T)), size_t Stride = sizeof(T)>
51 DE_STATIC_ASSERT(Stride >= sizeof(T));
76 template <typename T, size_t Alignment, size_t Stride>
77 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (void) throw()
83 template <typename T, size_t Alignment, size_t Stride>
84 ArrayBuffer<T,Alignment,Stride>::ArrayBuffer (size_t numElements)
90 // \note no need to allocate stride for the last element, sizeof(T) is enough. Also handles cases where sizeof(T) > Stride
91 const size_t storageSize = (numElements - 1) * Stride + sizeof(T);
102 template <typename T, size_t Alignment, size_t Stride>
[all...] |
| /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 | 502 static inline typename StridedConstMapType<Stride<Outer, Inner> >::type Map(const Scalar* data, const Stride<Outer, Inner>& stride)
503 { return typename StridedConstMapType<Stride<Outer, Inner> >::type(data, stride); }
505 static inline typename StridedMapType<Stride<Outer, Inner> >::type Map(Scalar* data, const Stride<Outer, Inner>& stride)
506 { return typename StridedMapType<Stride<Outer, Inner> >::type(data, stride); }
[all...] |
| /external/deqp/framework/randomshaders/ |
| rsgVariableValue.hpp | 73 template <int Stride>
87 template <int Stride>
97 ConstStridedValueAccess component (int compNdx) const { return ConstStridedValueAccess(getType().getElementType(), m_value + Stride*compNdx); }
98 ConstStridedValueAccess arrayElement (int elementNdx) const { return ConstStridedValueAccess(getType().getElementType(), m_value + Stride*getType().getElementScalarOffset(elementNdx)); }
99 ConstStridedValueAccess member (int memberNdx) const { return ConstStridedValueAccess(getType().getMembers()[memberNdx].getType(), m_value + Stride*getType().getMemberScalarOffset(memberNdx)); }
101 float asFloat (void) const { DE_STATIC_ASSERT(Stride == 1); return m_value->floatVal; }
102 int asInt (void) const { DE_STATIC_ASSERT(Stride == 1); return m_value->intVal; }
103 bool asBool (void) const { DE_STATIC_ASSERT(Stride == 1); return m_value->boolVal; }
104 Scalar asScalar (void) const { DE_STATIC_ASSERT(Stride == 1); return *m_value; }
106 float asFloat (int ndx) const { DE_ASSERT(de::inBounds(ndx, 0, Stride)); return m_value[ndx].floatVal;
[all...] |
| rsgProgramExecutor.cpp | 137 template <int Stride>
138 void interpolateVertexInput (StridedValueAccess<Stride> dst, int dstComp, const ConstValueRangeAccess valueRange, float x, float y)
150 template <int Stride>
151 void interpolateFragmentInput (StridedValueAccess<Stride> dst, int dstComp, ConstValueAccess vtx0, ConstValueAccess vtx1, ConstValueAccess vtx2, ConstValueAccess vtx3, float x, float y)
159 template <int Stride>
160 void copyVarying (ValueAccess dst, ConstStridedValueAccess<Stride> src, int compNdx)
|
| /external/ceres-solver/include/ceres/ |
| dynamic_autodiff_cost_function.h | 60 // default, controlled by the Stride template parameter) with each
62 // to experiment with the stride.
78 template <typename CostFunctor, int Stride = 4>
123 vector<Jet<double, Stride> > input_jets(num_parameters);
124 vector<Jet<double, Stride> > output_jets(num_residuals());
127 vector<Jet<double, Stride>* > jet_parameters(num_parameter_blocks,
128 static_cast<Jet<double, Stride>* >(NULL));
159 // When `num_active_parameters % Stride != 0` then it can be the case
160 // that `active_parameter_count < Stride` while parameter_cursor is less
172 // Evaluate all of the strides. Each stride is a chunk of the derivative t
[all...] |
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmspack.c | 97 register cmsUInt32Number Stride)
135 cmsUNUSED_PARAMETER(Stride);
144 register cmsUInt32Number Stride)
154 accum += T_EXTRA(info -> InputFormat) * Stride;
163 accum += Stride;
174 register cmsUInt32Number Stride)
184 cmsUNUSED_PARAMETER(Stride);
191 register cmsUInt32Number Stride)
201 cmsUNUSED_PARAMETER(Stride);
208 register cmsUInt32Number Stride)
[all...] |
| cmsxform.c | 191 cmsUInt32Number Size, cmsUInt32Number Stride)
196 p -> xform(p, InputBuffer, OutputBuffer, Size, Stride);
207 void* out, cmsUInt32Number Size, cmsUInt32Number Stride)
220 accum = p -> FromInputFloat(p, fIn, accum, Stride);
248 output = p -> ToOutputFloat(p, fOut, output, Stride);
258 cmsUInt32Number Stride)
271 accum = p -> FromInputFloat(p, fIn, accum, Stride);
272 output = p -> ToOutputFloat(p, fIn, output, Stride);
282 cmsUInt32Number Stride)
295 accum = p -> FromInput(p, wIn, accum, Stride);
[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 | 31 TEST(Vector, Stride) {
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
| omxVCM4P2_IDCT8x8blk_s.s | 70 ;// Stride RN 1 ;// destination stride in bytes
75 Stride RN 1
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
| omxVCM4P2_IDCT8x8blk_s.s | 70 ;// Stride RN 1 ;// destination stride in bytes
75 Stride RN 1
|
| /external/llvm/include/llvm/ADT/ |
| SparseSet.h | 206 const unsigned Stride = std::numeric_limits<SparseT>::max() + 1u;
207 for (unsigned i = Sparse[Idx], e = size(); i < e; i += Stride) {
212 // Stride is 0 when SparseT >= unsigned. We don't need to loop.
213 if (!Stride)
|
| /external/mesa3d/src/mesa/vbo/ |
| vbo_context.c | 64 cl->Stride = 0;
94 cl->Stride = 0;
141 cl->Stride = 0;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/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/Transforms/Scalar/ |
| StraightLineStrengthReduce.cpp | 93 Stride(nullptr), Ins(nullptr), Basis(nullptr) {}
96 : CandidateKind(CT), Base(B), Index(Idx), Stride(S), Ins(I),
100 // Note that Index and Stride of a GEP candidate do not necessarily have the
101 // same integer type. In that case, during rewriting, Stride will be
104 Value *Stride;
114 // <Base: a, Index: 1, Stride: b + 2>
118 // <Base: b, Index: 2, Stride: a + 1>
149 // share the same base and stride.
186 // A helper function that factors ArrayIdx to a product of a stride and a
232 // They share the same base, stride, and candidate kind
[all...] |
| LoopIdiomRecognize.cpp | 321 // Check to see if we have a constant stride.
335 // Make sure this is a strided store with a constant stride.
390 // Check to see if the stride matches the size of the store. If so, then we
393 unsigned Stride = getStoreStride(StoreEv);
395 if (StoreSize != Stride && StoreSize != -Stride)
398 bool NegStride = StoreSize == -Stride;
434 // Check to see if the stride matches the size of the memset. If so, then we
436 const SCEVConstant *Stride = dyn_cast<SCEVConstant>(Ev->getOperand(1));
438 // TODO: Could also handle negative stride here someday, that will require th
[all...] |
| /external/libavc/common/arm/ |
| ih264_default_weighted_pred_a9q.s | 63 @* Stride of the first input buffer
66 @* Stride of the second input buffer
69 @* Stride of the destination buffer
237 @* Stride of the first input buffer
240 @* Stride of the second input buffer
243 @* Stride of the destination buffer
|
| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 244 int Stride = 1;
246 Stride = -1;
275 Dst += Stride;
276 Src += Stride;
|
| /external/llvm/lib/Analysis/ |
| VectorUtils.cpp | 287 /// \brief Get the stride of a pointer access in a loop. Looks for symbolic
288 /// strides "a[i*stride]". Returns the symbolic stride, or null otherwise.
352 Value *Stride = U->getValue();
353 if (!Lp->isLoopInvariant(Stride))
359 Stride = getUniqueCastUse(Stride, Lp, StripedOffRecurrenceCast);
361 return Stride;
|
