Home
last modified time | relevance | path

Searched refs:numnbrs (Results 1 – 22 of 22) sorted by relevance

/dports/science/fastcap/fastcap-2.0wr/src/
H A DmulMats_old.c66 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
145 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
232 for(j = kid->numnbrs-1; j >= 0; j--) {
297 for(i=0; i < nc->numnbrs; i++) {
345 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
379 for(noffset = 0, l = -1; l < nc->numnbrs; l++) { /* lp on nc's nbrs */
385 for(m=0; m < nnbr->numnbrs; m++) {
388 ASSERT(m < nnbr->numnbrs);
441 for(l = 0; l < nc->numnbrs; l++) {
477 for(k=0; k < nc->numnbrs; k++) {
H A DmulMats.c66 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
147 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
234 for(j = kid->numnbrs-1; j >= 0; j--) {
299 for(i=0; i < nc->numnbrs; i++) {
344 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
372 for(noffset = 0, l = -1; l < nc->numnbrs; l++) { /* lp on nc's nbrs */
378 for(m=0; m < nnbr->numnbrs; m++) {
381 ASSERT(m < nnbr->numnbrs);
427 for(l = 0; l < nc->numnbrs; l++) {
463 for(k=0; k < nc->numnbrs; k++) {
H A DmulMats_mod.c66 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
145 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
232 for(j = kid->numnbrs-1; j >= 0; j--) {
297 for(i=0; i < nc->numnbrs; i++) {
340 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
368 for(noffset = 0, l = -1; l < nc->numnbrs; l++) { /* lp on nc's nbrs */
374 for(m=0; m < nnbr->numnbrs; m++) {
377 ASSERT(m < nnbr->numnbrs);
423 for(l = 0; l < nc->numnbrs; l++) {
459 for(k=0; k < nc->numnbrs; k++) {
H A DmulSetup.c733 int numnbrs; local
754 numnbrs = 0;
765 cstack[numnbrs++] = cubes[i][m][n][p];
770 nc->numnbrs = numnbrs;
771 if(nc->numnbrs > 0) CALLOC(nc->nbrs, numnbrs, cube*, ON, AMSC);
772 for(m=numnbrs-1; m >= 0; m--) nc->nbrs[m] = cstack[m];
959 for(i = 0; i < child->numnbrs; i++) {
973 int numnbr = (child->parent)->numnbrs; /* number of neighbors */
H A DmulStruct.h155 int numnbrs; /* Number of nonempty neighbors. */ member
H A DmulDisplay.c61 pc->numnbrs, pc->upnumvects, pc->directnumvects, pc->downnumvects);
73 pc->numnbrs, pc->upnumvects, pc->directnumvects, pc->downnumvects);
500 nn = nc->numnbrs;
567 nn = nc->numnbrs;
/dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/
H A DmulMats.c34 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
117 for(nummats=1, i=0; i < nextc->numnbrs; i++) {
210 for(j = kid->numnbrs-1; j >= 0; j--) {
278 for(i=0; i < nc->numnbrs; i++) {
323 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
351 for(noffset = 0, l = -1; l < nc->numnbrs; l++) { /* lp on nc's nbrs */
357 for(m=0; m < nnbr->numnbrs; m++) {
360 ASSERT(m < nnbr->numnbrs);
406 for(l = 0; l < nc->numnbrs; l++) {
442 for(k=0; k < nc->numnbrs; k++) {
H A DmulSetup.c907 int numnbrs; local
928 numnbrs = 0;
939 cstack[numnbrs++] = cubes[i][m][n][p];
944 nc->numnbrs = numnbrs;
945 if(nc->numnbrs > 0) CALLOC(nc->nbrs, numnbrs, cube*, ON, AMSC);
946 for(m=numnbrs-1; m >= 0; m--) nc->nbrs[m] = cstack[m];
1133 for(i = 0; i < child->numnbrs; i++) {
1148 int numnbr = (child->parent)->numnbrs; /* number of neighbors */
H A DnewPrecond_cube.c110 for(i=0; i < nc->numnbrs; i++) {
178 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
214 for(noffset = 0, l = -1; l < nc->numnbrs; l++) { /* lp on nc's nbrs */
220 for(m=0; m < nnbr->numnbrs; m++) {
223 ASSERT(m < nnbr->numnbrs);
267 for(l = 0; l < nc->numnbrs; l++) {
734 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
H A DPrecond.c137 for(i=0; i < nc->numnbrs; i++) {
211 k < nc->numnbrs && (indsys->precond_type == LOC
246 for(noffset = 0, l = -1; l < nc->numnbrs; l++) { /* lp on nc's nbrs */
252 for(m=0; m < nnbr->numnbrs; m++) {
255 ASSERT(m < nnbr->numnbrs);
839 for(k=0; k < nc->numnbrs; k++) { /* loop on neighbors of nc */
H A DmulStruct.h127 int numnbrs; /* Number of nonempty neighbors. */ member
H A DbigmeshPre.c120 for(p = -1; p < main_nc->numnbrs; p++) {
222 for(j = 0; j < nc->numnbrs; j++) {
H A DnewPrecond.c248 while(k < nc->numnbrs && nc->nbrs[k] != fillist[j].fc)
250 if (k < nc->numnbrs) {
/dports/science/lammps/lammps-stable_29Sep2021/src/QEQ/
H A Dfix_qeq.h89 int *numnbrs; member
H A Dfix_qeq.cpp100 H.numnbrs = nullptr; in FixQEq()
262 memory->create(H.numnbrs,n_cap,"qeq:H.numnbrs"); in allocate_matrix()
272 memory->destroy(H.numnbrs); in deallocate_matrix()
447 for (itr_j=A->firstnbr[i]; itr_j<A->firstnbr[i]+A->numnbrs[i]; itr_j++) { in sparse_matvec()
H A Dfix_qeq_point.cpp169 H.numnbrs[i] = m_fill - H.firstnbr[i]; in compute_H()
H A Dfix_qeq_slater.cpp215 H.numnbrs[i] = m_fill - H.firstnbr[i]; in compute_H()
372 for(itr_j=A->firstnbr[i]; itr_j<A->firstnbr[i]+A->numnbrs[i]; itr_j++) { in sparse_matvec()
H A Dfix_qeq_shielded.cpp232 H.numnbrs[i] = m_fill - H.firstnbr[i]; in compute_H()
/dports/science/lammps/lammps-stable_29Sep2021/src/REAXFF/
H A Dfix_qeq_reaxff.h86 int *numnbrs; member
H A Dfix_qeq_reaxff.cpp132 H.numnbrs = nullptr; in FixQEqReaxFF()
348 memory->create(H.numnbrs,n_cap,"qeq:H.numnbrs"); in allocate_matrix()
358 memory->destroy(H.numnbrs); in deallocate_matrix()
666 H.numnbrs[i] = m_fill - H.firstnbr[i]; in compute_H()
775 for (itr_j=A->firstnbr[i]; itr_j<A->firstnbr[i]+A->numnbrs[i]; itr_j++) { in sparse_matvec()
/dports/science/fasthenry/fasthenry-3.0wr/src/zbuf/
H A DmulStruct.h155 int numnbrs; /* Number of nonempty neighbors. */ member
/dports/science/lammps/lammps-stable_29Sep2021/src/OPENMP/
H A Dfix_qeq_reaxff_omp.cpp221 H.numnbrs[i] = mfill - H.firstnbr[i]; in compute_H()
520 for (itr_j=A->firstnbr[i]; itr_j<A->firstnbr[i]+A->numnbrs[i]; itr_j++) { in sparse_matvec()
863 for (itr_j=A->firstnbr[i]; itr_j<A->firstnbr[i]+A->numnbrs[i]; itr_j++) { in dual_sparse_matvec()
954 for (itr_j=A->firstnbr[i]; itr_j<A->firstnbr[i]+A->numnbrs[i]; itr_j++) { in dual_sparse_matvec()