Home
last modified time | relevance | path

Searched refs:MBS (Results 1 – 3 of 3) sorted by relevance

/petsc/src/vec/is/sf/impls/basic/
H A Dsfpack.c61 …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; \
[all …]
/petsc/src/vec/is/sf/impls/basic/kokkos/
H A Dsfkok.kokkos.cxx235 …const PetscInt M = EQ ? 1 : link->bs / BS, MBS = M * BS; /* If EQ, then MBS will be a compil… in Pack() local
246 PetscInt t = (iopt ? MapTidToIndex(iopt, tid) : (idx ? idx[tid] : start + tid)) * MBS; in Pack()
247 PetscInt s = tid * MBS; in Pack()
248 for (int i = 0; i < MBS; i++) buf[s + i] = data[t + i]; in Pack()
258 const PetscInt M = EQ ? 1 : link->bs / BS, MBS = M * BS; in UnpackAndOp() local
266 PetscInt t = (iopt ? MapTidToIndex(iopt, tid) : (idx ? idx[tid] : start + tid)) * MBS; in UnpackAndOp()
267 PetscInt s = tid * MBS; in UnpackAndOp()
268 for (int i = 0; i < MBS; i++) op(data[t + i], buf[s + i]); in UnpackAndOp()
278 const PetscInt M = EQ ? 1 : link->bs / BS, MBS = M * BS; in FetchAndOp() local
285 PetscInt r = (ropt ? MapTidToIndex(ropt, tid) : (idx ? idx[tid] : start + tid)) * MBS; in FetchAndOp()
[all …]
/petsc/src/vec/is/sf/impls/basic/cupm/
H A Dsfcupm_impl.hpp60 …const PetscInt MBS = M * BS; /* MBS=bs. We turn MBS into a compile-time const when EQ=… in d_Pack() local
63 PetscInt t = (opt ? MapTidToIndex(opt, tid) : (idx ? idx[tid] : start + tid)) * MBS; in d_Pack()
64 PetscInt s = tid * MBS; in d_Pack()
65 for (PetscInt i = 0; i < MBS; i++) buf[s + i] = data[t + i]; in d_Pack()
72 const PetscInt M = (EQ) ? 1 : bs / BS, MBS = M * BS; in d_UnpackAndOp() local
76 PetscInt t = (opt ? MapTidToIndex(opt, tid) : (idx ? idx[tid] : start + tid)) * MBS; in d_UnpackAndOp()
77 PetscInt s = tid * MBS; in d_UnpackAndOp()
78 for (PetscInt i = 0; i < MBS; i++) op(data[t + i], buf[s + i]); in d_UnpackAndOp()
85 const PetscInt M = (EQ) ? 1 : bs / BS, MBS = M * BS; in d_FetchAndOp() local
89 …Int r = (rootopt ? MapTidToIndex(rootopt, tid) : (rootidx ? rootidx[tid] : rootstart + tid)) * MBS; in d_FetchAndOp()
[all …]