235 …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()
286       PetscInt l = tid * MBS;  in FetchAndOp()
287       for (int i = 0; i < MBS; i++) leafbuf[l + i] = op(rootdata[r + i], leafbuf[l + i]);  in FetchAndOp()
296   const PetscInt       M = (EQ) ? 1 : link->bs / BS, MBS = M * BS;  in ScatterAndOp()  local
349       s *= MBS;  in ScatterAndOp()
350       t *= MBS;  in ScatterAndOp()
351       for (i = 0; i < MBS; i++) op(dst[t + i], src[s + i]);  in ScatterAndOp()
382   const PetscInt       M = (EQ) ? 1 : link->bs / BS, MBS = M * BS;  in FetchAndOpLocal()  local
392 … PetscInt r = (ropt ? MapTidToIndex(ropt, tid) : (rootidx ? rootidx[tid] : rootstart + tid)) * MBS;  in FetchAndOpLocal()
393 … PetscInt l = (lopt ? MapTidToIndex(lopt, tid) : (leafidx ? leafidx[tid] : leafstart + tid)) * MBS;  in FetchAndOpLocal()
394       for (int i = 0; i < MBS; i++) leafupdate[l + i] = op(rootdata[r + i], leafdata[l + i]);  in FetchAndOpLocal()