Lines Matching defs:stride
66 uint stride = 0;
67 while (!pst->is_task_claimed(/* reference */ stride)) {
68 process_stride(sp, mr, stride, n_strides, cl, ct,
90 jint stride, int n_strides,
99 // Find the first card address of the first chunk in the stride that is
107 if ((uintptr_t)stride >= start_chunk_stride_num) {
109 (stride - start_chunk_stride_num) *
112 // Go ahead to the next chunk group boundary, then to the requested stride.
114 (n_strides - start_chunk_stride_num + stride) *
122 // stride, we take care to avoid double scanning or missing a card
158 // Find the next chunk of the stride.