Lines Matching refs:step
108 std::swap(a.step.p, b.step.p);
109 std::swap(a.step.buf[0], b.step.buf[0]);
110 std::swap(a.step.buf[1], b.step.buf[1]);
112 if( a.step.p == b.step.buf )
114 a.step.p = a.step.buf;
118 if( b.step.p == a.step.buf )
120 b.step.p = b.step.buf;
132 if( m.step.p != m.step.buf )
134 fastFree(m.step.p);
135 m.step.p = m.step.buf;
140 m.step.p = (size_t*)fastMalloc(_dims*sizeof(m.step.p[0]) + (_dims+1)*sizeof(m.size.p[0]));
141 m.size.p = (int*)(m.step.p + _dims) + 1;
160 m.step.p[i] = i < _dims-1 ? _steps[i] : esz;
163 m.step.p[i] = total;
175 m.step[1] = esz;
190 if( m.step[j]*m.size[j] < m.step[j-1] )
194 uint64 total = (uint64)m.step[0]*m.size[0];
221 temp_u = a->allocate(dims, size.p, type(), data, step.p, accessFlags, usageFlags);
226 setSize(hdr, dims, size.p, step.p);
267 u = a->allocate(dims, size, _type, 0, step.p, 0, usageFlags);
273 u = a0->allocate(dims, size, _type, 0, step.p, 0, usageFlags);
276 CV_Assert( step[dims-1] == (size_t)CV_ELEM_SIZE(flags) );
289 step[i] = m.step[i];
297 if( step.p != step.buf )
298 fastFree(step.p);
328 offset += step*_rowRange.start;
354 allocator(m.allocator), usageFlags(m.usageFlags), u(m.u), offset(m.offset + roi.y*m.step[0]), size(&rows)
369 step[0] = m.step[0]; step[1] = esz;
397 offset += r.start*step.p[i];
419 m.offset -= step[0]*d;
425 m.step[0] += (len > 1 ? esz : 0);
440 CV_Assert( dims <= 2 && step[0] > 0 );
448 ofs.y = (int)(delta1/step[0]);
449 ofs.x = (int)((delta1 - step[0]*ofs.y)/esz);
450 CV_DbgAssert( offset == (size_t)(ofs.y*step[0] + ofs.x*esz) );
453 wholeSize.height = (int)((delta2 - minstep)/step[0] + 1);
455 wholeSize.width = (int)((delta2 - step*(wholeSize.height-1))/esz);
462 CV_Assert( dims <= 2 && step[0] > 0 );
468 offset += (row1 - ofs.y)*step + (col1 - ofs.x)*esz;
471 if( esz*cols == step[0] || rows == 1 )
487 hdr.step[dims-1] = CV_ELEM_SIZE(hdr.flags);
519 hdr.step[0] = total_width * elemSize1();
530 hdr.step[1] = CV_ELEM_SIZE(hdr.flags);
554 (isContinuous() || step.p[1] == step.p[2]*size.p[2])))
580 Mat hdr(dims, size.p, type(), u->data + offset, step.p);
610 // offset = step[0]*ofs[0] + step[1]*ofs[1] + step[2]*ofs[2] + ...;
614 size_t s = step.p[i];
654 u->currAllocator->copy(u, dst.u, dims, sz, srcofs, step.p, dstofs, dst.step.p, false);
660 u->currAllocator->download(u, dst.ptr(), dims, sz, srcofs, step.p, dst.step.p);
