Lines Matching refs:MBS
61 …const PetscInt MBS = M * BS; /* MBS=bs. We turn MBS into a compile time const when EQ=…
63 … if (!idx) PetscCall(PetscArraycpy(p, u + start * MBS, MBS * count)); /* idx[] are contiguous */ \
66 u2 = u + opt->start[r] * MBS; \
71 PetscCall(PetscArraycpy(p2, u2 + (X * Y * k + X * j) * MBS, opt->dx[r] * MBS)); \
72 p2 += opt->dx[r] * MBS; \
79 p[i * MBS + j * BS + k] = u[idx[i] * MBS + j * BS + k]; \
102 …const PetscInt MBS = M * BS; /* MBS=bs. We turn MBS into a compile time const when EQ=…
105 u += start * MBS; \
106 if (u != p) PetscCall(PetscArraycpy(u, p, count * MBS)); \
109 u2 = u + opt->start[r] * MBS; \
114 PetscCall(PetscArraycpy(u2 + (X * Y * k + X * j) * MBS, p, opt->dx[r] * MBS)); \
115 p += opt->dx[r] * MBS; \
121 for (k = 0; k < BS; k++) u[idx[i] * MBS + j * BS + k] = p[i * MBS + j * BS + k]; \
143 …const PetscInt MBS = M * BS; /* MBS=bs. We turn MBS into a compile time const when EQ=…
146 u += start * MBS; \
149 for (k = 0; k < BS; k++) OpApply(Op, u[i * MBS + j * BS + k], p[i * MBS + j * BS + k]); \
152 u2 = u + opt->start[r] * MBS; \
157 … for (i = 0; i < opt->dx[r] * MBS; i++) OpApply(Op, u2[(X * Y * k + X * j) * MBS + i], p[i]); \
158 p += opt->dx[r] * MBS; \
164 … for (k = 0; k < BS; k++) OpApply(Op, u[idx[i] * MBS + j * BS + k], p[i * MBS + j * BS + k]); \
175 const PetscInt MBS = M * BS; \
178 r = (!idx ? start + i : idx[i]) * MBS; \
179 l = i * MBS; \
197 const PetscInt MBS = M * BS; \
200 u += srcStart * MBS; \
203 u += srcOpt->start[0] * MBS; \
204 v += dstStart * MBS; \
209 … for (i = 0; i < srcOpt->dx[0] * MBS; i++) OpApply(Op, v[i], u[(X * Y * k + X * j) * MBS + i]); \
210 v += srcOpt->dx[0] * MBS; \
214 s = (!srcIdx ? srcStart + i : srcIdx[i]) * MBS; \
215 t = (!dstIdx ? dstStart + i : dstIdx[i]) * MBS; \
230 const PetscInt MBS = M * BS; \
233 r = (rootidx ? rootidx[i] : rootstart + i) * MBS; \
234 l = (leafidx ? leafidx[i] : leafstart + i) * MBS; \