Home
last modified time | relevance | path

Searched refs:cur (Results 1 – 8 of 8) sorted by relevance

/petsc/src/mat/impls/composite/
H A Dmcomposite.c132 Mat_CompositeLink cur; in MatMult_Composite() local
143 cur = shell->head; in MatMult_Composite()
144 …PetscCheck(cur, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONGSTATE, "Must provide at least one matrix with … in MatMult_Composite()
152 for (cur = shell->head; cur; cur = cur->next) { in MatMult_Composite()
153 PetscCall(PetscObjectTypeCompare((PetscObject)cur->mat, MATMPIAIJ, &match)); in MatMult_Composite()
162 for (cur = shell->head; cur; cur = cur->next) { in MatMult_Composite()
163 PetscCall(MatMPIAIJGetSeqAIJ(cur->mat, NULL, &B, NULL)); in MatMult_Composite()
174 for (cur = shell->head; cur; cur = cur->next) { in MatMult_Composite()
175 PetscCall(MatMPIAIJGetSeqAIJ(cur->mat, NULL, &B, &garray)); in MatMult_Composite()
204 for (cur = shell->head, j = 0; cur; cur = cur->next, j++) { /* j-th matrix */ in MatMult_Composite()
[all …]
/petsc/src/ts/impls/implicit/glle/
H A Dglleadapt.c185 …scInt orders[], const PetscReal errors[], const PetscReal cost[], PetscInt cur, PetscReal h, Petsc… in TSGLLEAdaptChoose() argument
195 …PetscUseTypeMethod(adapt, choose, n, orders, errors, cost, cur, h, tleft, next_sc, next_h, finish); in TSGLLEAdaptChoose()
226 …scInt orders[], const PetscReal errors[], const PetscReal cost[], PetscInt cur, PetscReal h, Petsc… in TSGLLEAdaptChoose_None() argument
229 *next_sc = cur; in TSGLLEAdaptChoose_None()
254 …scInt orders[], const PetscReal errors[], const PetscReal cost[], PetscInt cur, PetscReal h, Petsc… in TSGLLEAdaptChoose_Size() argument
260 *next_sc = cur; in TSGLLEAdaptChoose_Size()
261 optimal = PetscPowReal((PetscReal)errors[cur], (PetscReal)-1. / (safe * orders[cur])); in TSGLLEAdaptChoose_Size()
295 …scInt orders[], const PetscReal errors[], const PetscReal cost[], PetscInt cur, PetscReal h, Petsc… in TSGLLEAdaptChoose_Both() argument
313 if (i == cur) PetscCall(PetscArraycpy(&current, &trial, 1)); in TSGLLEAdaptChoose_Both()
317 if (best.eff < 1.2 * current.eff || both->count_at_order < orders[cur] + 2) { in TSGLLEAdaptChoose_Both()
[all …]
H A Dglle.c793 PetscInt i, n, cur_p, cur, next_sc, candidates[64], orders[64]; in TSGLLEChooseNextScheme() local
797 cur = -1; in TSGLLEChooseNextScheme()
810 if (i == gl->current_scheme) cur = n; in TSGLLEChooseNextScheme()
813 …PetscCheck(cur >= 0 && gl->nschemes > cur, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Current scheme not fo… in TSGLLEChooseNextScheme()
814 …PetscCall(TSGLLEAdaptChoose(gl->adapt, n, orders, errors, costs, cur, h, tleft, &next_sc, next_h, … in TSGLLEChooseNextScheme()
/petsc/src/mat/graphops/color/utils/
H A Dweights.c145 PetscInt ncols, nxt, prv, cur; in MatColoringCreateSmallestLastWeights() local
240 cur = degb[i]; in MatColoringCreateSmallestLastWeights()
241 degrees[cur] = 0; in MatColoringCreateSmallestLastWeights()
242 degb[i] = llnext[cur]; in MatColoringCreateSmallestLastWeights()
244 ncols = Gi[cur + 1] - Gi[cur]; in MatColoringCreateSmallestLastWeights()
245 cols = &(Gj[Gi[cur]]); in MatColoringCreateSmallestLastWeights()
248 if (cols[j] != cur) { in MatColoringCreateSmallestLastWeights()
264 if (lweights[idx] <= lweights[cur]) lweights[idx] = lweights[cur] + 1; in MatColoringCreateSmallestLastWeights()
/petsc/src/sys/utils/
H A Dsortso.c136 PetscInt last = l, k = 1, mid, cur = l + 1; in PetscGallopSearchLeft_Private() local
147 if (PetscUnlikely(cur > r)) { in PetscGallopSearchLeft_Private()
148 cur = r; in PetscGallopSearchLeft_Private()
151 if ((*cmp)(x, (arr) + cur * size, ctx) < 0) break; in PetscGallopSearchLeft_Private()
152 last = cur; in PetscGallopSearchLeft_Private()
153 cur += (k <<= 1) + 1; in PetscGallopSearchLeft_Private()
157 while (cur > last + 1) { in PetscGallopSearchLeft_Private()
158 mid = last + ((cur - last) >> 1); in PetscGallopSearchLeft_Private()
160 cur = mid; in PetscGallopSearchLeft_Private()
165 *m = cur; in PetscGallopSearchLeft_Private()
[all …]
/petsc/src/vec/vec/impls/seq/kokkos/
H A Dveckok.kokkos.cxx345 PetscInt i, j, cur = 0, ngroup = nv / 8, rem = nv % 8, N = xin->map->n; in VecMultiDot_Private() local
353 for (j = 0; j < 8; j++) PetscCall(VecGetKokkosView(yin[cur + j], &yv[j])); in VecMultiDot_Private()
356 …<WorkTag>(exec, 0, N), mdot, Kokkos::subview(zv, Kokkos::pair<PetscInt, PetscInt>(cur, cur + 8)))); in VecMultiDot_Private()
358 for (j = 0; j < 8; j++) PetscCall(VecRestoreKokkosView(yin[cur + j], &yv[j])); in VecMultiDot_Private()
359 cur += 8; in VecMultiDot_Private()
363 for (j = 0; j < rem; j++) PetscCall(VecGetKokkosView(yin[cur + j], &yv[j])); in VecMultiDot_Private()
365 … results = Kokkos::subview(zv, Kokkos::pair<PetscInt, PetscInt>(cur, cur + rem)); in VecMultiDot_Private()
379 for (j = 0; j < rem; j++) PetscCall(VecRestoreKokkosView(yin[cur + j], &yv[j])); in VecMultiDot_Private()
792 PetscInt i, j, cur = 0, ngroup = nv / 8, rem = nv % 8, N = yin->map->n; in VecMAXPY_SeqKokkos() local
803 a[j] = alpha[cur + j]; in VecMAXPY_SeqKokkos()
[all …]
/petsc/src/mat/impls/aij/mpi/kokkos/
H A Dmpiaijkok.kokkos.cxx509 PetscInt cur = 0; in MatMPIAIJKokkosReduceBegin() local
510 while (cur < nz) { in MatMPIAIJKokkosReduceBegin()
511 PetscInt curColIdx = jbuf[cur]; in MatMPIAIJKokkosReduceBegin()
514 while (cur + dups < nz && jbuf[cur + dups] == curColIdx) dups++; in MatMPIAIJKokkosReduceBegin()
522 cur += dups; in MatMPIAIJKokkosReduceBegin()
567 PetscInt cur = 0; in MatMPIAIJKokkosReduceBegin() local
568 while (cur < nz) { in MatMPIAIJKokkosReduceBegin()
569 PetscInt curColIdx = jbuf[cur]; in MatMPIAIJKokkosReduceBegin()
572 while (cur + dups < nz && jbuf[cur + dups] == curColIdx) dups++; in MatMPIAIJKokkosReduceBegin()
586 cur += dups; in MatMPIAIJKokkosReduceBegin()
/petsc/src/sys/objects/
H A Daoptions.c100 PetscOptionItem cur = PetscOptionsObject->next; in PetscOptionItemCreate_Private() local
102 while (cur->next) cur = cur->next; in PetscOptionItemCreate_Private()
103 cur->next = *amsopt; in PetscOptionItemCreate_Private()