/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/ |
H A D | neigh_respa.cpp | 118 n = n_inner = 0; in respa_nsq_no_newton() 176 numneigh_inner[i] = n_inner; in respa_nsq_no_newton() 177 ipage_inner->vgot(n_inner); in respa_nsq_no_newton() 261 n = n_inner = 0; in respa_nsq_newton() 337 numneigh_inner[i] = n_inner; in respa_nsq_newton() 338 ipage_inner->vgot(n_inner); in respa_nsq_newton() 424 n = n_inner = 0; in respa_bin_no_newton() 492 ipage_inner->vgot(n_inner); in respa_bin_no_newton() 577 n = n_inner = 0; in respa_bin_newton() 686 ipage_inner->vgot(n_inner); in respa_bin_newton() [all …]
|
/dports/devel/R-cran-rlang/rlang/src/lib/ |
H A D | squash.c | 47 r_ssize n_inner; in atom_squash() local 51 n_inner = r_vec_length(maybe_unbox(inner, is_spliceable)); in atom_squash() 57 } else if (n_inner) { in atom_squash() 58 r_vec_poke_coerce_n(out, count, inner, 0, n_inner); in atom_squash() 63 r_vec_poke_n(out_names, count, nms, 0, n_inner); in atom_squash() 64 } else if (n_inner == 1 && r_has_name_at(outer, i)) { in atom_squash() 69 count += n_inner; in atom_squash() 128 r_ssize n_inner = info->recursive ? 1 : r_vec_length(inner); in update_info_inner() local 129 info->size += n_inner; in update_info_inner() 139 bool copy_outer = recursive || n_inner == 1; in update_info_inner() [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/src/ |
H A D | npair_half_respa_bin_newton.cpp | 39 int i,j,k,n,itype,jtype,ibin,n_inner,n_middle,imol,iatom,moltemplate; in build() local 88 n = n_inner = 0; in build() 143 if (which == 0) neighptr_inner[n_inner++] = j; in build() 144 else if (minchange) neighptr_inner[n_inner++] = j; in build() 145 else if (which > 0) neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 187 if (which == 0) neighptr_inner[n_inner++] = j; in build() 188 else if (minchange) neighptr_inner[n_inner++] = j; in build() 190 neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 213 numneigh_inner[i] = n_inner; in build() 214 ipage_inner->vgot(n_inner); in build()
|
H A D | npair_half_respa_bin_newtoff.cpp | 40 int i,j,k,n,itype,jtype,ibin,n_inner,n_middle,imol,iatom,moltemplate; in build() local 89 n = n_inner = 0; in build() 141 if (which == 0) neighptr_inner[n_inner++] = j; in build() 142 else if (minchange) neighptr_inner[n_inner++] = j; in build() 144 neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 167 numneigh_inner[i] = n_inner; in build() 168 ipage_inner->vgot(n_inner); in build()
|
H A D | npair_half_respa_bin_newton_tri.cpp | 40 int i,j,k,n,itype,jtype,ibin,n_inner,n_middle,imol,iatom,moltemplate; in build() local 89 n = n_inner = 0; in build() 149 if (which == 0) neighptr_inner[n_inner++] = j; in build() 150 else if (minchange) neighptr_inner[n_inner++] = j; in build() 152 neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 175 numneigh_inner[i] = n_inner; in build() 176 ipage_inner->vgot(n_inner); in build()
|
H A D | npair_half_respa_nsq_newtoff.cpp | 40 int i,j,n,itype,jtype,n_inner,n_middle,bitmask,imol,iatom,moltemplate; in build() local 93 n = n_inner = 0; in build() 139 if (which == 0) neighptr_inner[n_inner++] = j; in build() 140 else if (minchange) neighptr_inner[n_inner++] = j; in build() 141 else if (which > 0) neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 162 numneigh_inner[i] = n_inner; in build() 163 ipage_inner->vgot(n_inner); in build()
|
H A D | npair_half_respa_nsq_newton.cpp | 41 int i,j,n,itype,jtype,itag,jtag,n_inner,n_middle,bitmask; in build() local 95 n = n_inner = 0; in build() 158 if (which == 0) neighptr_inner[n_inner++] = j; in build() 159 else if (minchange) neighptr_inner[n_inner++] = j; in build() 160 else if (which > 0) neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 182 numneigh_inner[i] = n_inner; in build() 183 ipage_inner->vgot(n_inner); in build()
|
/dports/science/lammps/lammps-stable_29Sep2021/src/OPENMP/ |
H A D | npair_half_respa_bin_newton_omp.cpp | 55 int i,j,k,n,itype,jtype,ibin,n_inner,n_middle,imol,iatom; in build() local 106 n = n_inner = 0; in build() 161 if (which == 0) neighptr_inner[n_inner++] = j; in build() 162 else if (minchange) neighptr_inner[n_inner++] = j; in build() 163 else if (which > 0) neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 205 if (which == 0) neighptr_inner[n_inner++] = j; in build() 206 else if (minchange) neighptr_inner[n_inner++] = j; in build() 208 neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 231 numneigh_inner[i] = n_inner; in build() 232 ipage.vgot(n_inner); in build()
|
H A D | npair_half_respa_nsq_newtoff_omp.cpp | 57 int i,j,n,itype,jtype,n_inner,n_middle,imol,iatom; in build() local 110 n = n_inner = 0; in build() 156 if (which == 0) neighptr_inner[n_inner++] = j; in build() 157 else if (minchange) neighptr_inner[n_inner++] = j; in build() 158 else if (which > 0) neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 179 numneigh_inner[i] = n_inner; in build() 180 ipage.vgot(n_inner); in build()
|
H A D | npair_half_respa_bin_newtoff_omp.cpp | 56 int i,j,k,n,itype,jtype,ibin,n_inner,n_middle,imol,iatom; in build() local 107 n = n_inner = 0; in build() 159 if (which == 0) neighptr_inner[n_inner++] = j; in build() 160 else if (minchange) neighptr_inner[n_inner++] = j; in build() 162 neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 185 numneigh_inner[i] = n_inner; in build() 186 ipage.vgot(n_inner); in build()
|
H A D | npair_half_respa_nsq_newton_omp.cpp | 58 int i,j,n,itype,jtype,itag,jtag,n_inner,n_middle,imol,iatom; in build() local 111 n = n_inner = 0; in build() 174 if (which == 0) neighptr_inner[n_inner++] = j; in build() 175 else if (minchange) neighptr_inner[n_inner++] = j; in build() 176 else if (which > 0) neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 198 numneigh_inner[i] = n_inner; in build() 199 ipage.vgot(n_inner); in build()
|
H A D | npair_half_respa_bin_newton_tri_omp.cpp | 55 int i,j,k,n,itype,jtype,ibin,n_inner,n_middle,imol,iatom; in build() local 106 n = n_inner = 0; in build() 166 if (which == 0) neighptr_inner[n_inner++] = j; in build() 167 else if (minchange) neighptr_inner[n_inner++] = j; in build() 169 neighptr_inner[n_inner++] = j ^ (which << SBBITS); in build() 192 numneigh_inner[i] = n_inner; in build() 193 ipage_inner.vgot(n_inner); in build()
|
/dports/math/cppad/CppAD-20210000.8/test_more/deprecated/ |
H A D | omp_alloc.cpp | 56 size_t n_inner = 5; in omp_alloc_bytes() local 61 std::vector<void*> v_ptr(n_inner); in omp_alloc_bytes() 62 for( j = 0; j < n_inner; j++) in omp_alloc_bytes() 77 ok &= omp_alloc::inuse(thread) == n_inner*cap_bytes + static_inuse; in omp_alloc_bytes() 80 for(j = 0; j < n_inner; j++) in omp_alloc_bytes() 85 ok &= omp_alloc::available(thread) == n_inner * cap_bytes; in omp_alloc_bytes()
|
/dports/math/cppad/CppAD-20210000.8/example/utility/ |
H A D | thread_alloc.cpp | 52 size_t n_inner = 5; in raw_allocate() local 56 std::vector<void*> v_ptr(n_inner); in raw_allocate() 59 for(size_t j = 0; j < n_inner; j++) in raw_allocate() 75 ok &= thread_alloc::inuse(thread) == n_inner*cap_bytes + static_inuse; in raw_allocate() 78 for(size_t j = 0; j < n_inner; j++) in raw_allocate() 83 ok &= thread_alloc::available(thread) == n_inner * cap_bytes; in raw_allocate()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/testsuite/gcc.dg/analyzer/ |
H A D | single-field.c | 29 static void __analyzer_called_by_test_3 (struct nested n_inner) in __analyzer_called_by_test_3() argument 31 free (n_inner.f.ptr); in __analyzer_called_by_test_3() 32 free (n_inner.f.ptr); /* { dg-warning "double-'free' of 'n_outer.f.ptr'" } */ in __analyzer_called_by_test_3()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gcc.dg/analyzer/ |
H A D | single-field.c | 29 static void __analyzer_called_by_test_3 (struct nested n_inner) in __analyzer_called_by_test_3() argument 31 free (n_inner.f.ptr); in __analyzer_called_by_test_3() 32 free (n_inner.f.ptr); /* { dg-warning "double-'free' of 'n_outer.f.ptr'" } */ in __analyzer_called_by_test_3()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/gcc.dg/analyzer/ |
H A D | single-field.c | 29 static void __analyzer_called_by_test_3 (struct nested n_inner) in __analyzer_called_by_test_3() argument 31 free (n_inner.f.ptr); in __analyzer_called_by_test_3() 32 free (n_inner.f.ptr); /* { dg-warning "double-'free' of 'n_outer.f.ptr'" } */ in __analyzer_called_by_test_3()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gcc.dg/analyzer/ |
H A D | single-field.c | 29 static void __analyzer_called_by_test_3 (struct nested n_inner) in __analyzer_called_by_test_3() argument 31 free (n_inner.f.ptr); in __analyzer_called_by_test_3() 32 free (n_inner.f.ptr); /* { dg-warning "double-'free' of 'n_outer.f.ptr'" } */ in __analyzer_called_by_test_3()
|
/dports/math/libflame/libflame-5.2.0/src/base/flamec/main/ |
H A D | FLA_Obj.c | 49 obj->n_inner = 0; in FLA_Obj_nullify() 64 … datatype, FLA_Elemtype elemtype, dim_t m, dim_t n, dim_t m_inner, dim_t n_inner, dim_t rs, dim_t … in FLA_Obj_create_ext() argument 73 FLA_Obj_create_ext_check( datatype, elemtype, m, n, m_inner, n_inner, rs, cs, obj ); in FLA_Obj_create_ext() 81 obj->n_inner = n_inner; in FLA_Obj_create_ext() 92 obj->base->n_inner = n_inner; in FLA_Obj_create_ext() 373 obj->n_inner = n; in FLA_Obj_create_without_buffer() 384 obj->base->n_inner = n; in FLA_Obj_create_without_buffer() 663 exchange( obj->base->m_inner, obj->base->n_inner, temp ); in FLA_Obj_flip_base() 682 exchange( obj->m_inner, obj->n_inner, temp ); in FLA_Obj_flip_view()
|
/dports/math/suitesparse-config/SuiteSparse-5.10.1/UMFPACK/Source/ |
H A D | umfpack_get_numeric.c | 96 n_inner ; in UMFPACK_get_numeric() local 120 n_inner = MIN (n_row, n_col) ; in UMFPACK_get_numeric() 190 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 198 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 207 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 354 n_inner = MIN (n_row, n_col) ; in get_L() 367 for (row = 0 ; row < n_inner ; row++) in get_L() 373 for (row = n_inner ; row < n_row ; row++) in get_L() 474 ASSERT (Numeric->lnz + n_inner == lnz2) ; in get_L() 591 for (row = 0 ; row < n_inner ; row++) in get_L() [all …]
|
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/UMFPACK/Source/ |
H A D | umfpack_get_numeric.c | 96 n_inner ; in UMFPACK_get_numeric() local 120 n_inner = MIN (n_row, n_col) ; in UMFPACK_get_numeric() 190 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 198 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 207 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 354 n_inner = MIN (n_row, n_col) ; in get_L() 367 for (row = 0 ; row < n_inner ; row++) in get_L() 373 for (row = n_inner ; row < n_row ; row++) in get_L() 474 ASSERT (Numeric->lnz + n_inner == lnz2) ; in get_L() 591 for (row = 0 ; row < n_inner ; row++) in get_L() [all …]
|
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/UMFPACK/Source/ |
H A D | umfpack_get_numeric.c | 96 n_inner ; in UMFPACK_get_numeric() local 120 n_inner = MIN (n_row, n_col) ; in UMFPACK_get_numeric() 190 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 198 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 207 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 354 n_inner = MIN (n_row, n_col) ; in get_L() 367 for (row = 0 ; row < n_inner ; row++) in get_L() 373 for (row = n_inner ; row < n_row ; row++) in get_L() 474 ASSERT (Numeric->lnz + n_inner == lnz2) ; in get_L() 591 for (row = 0 ; row < n_inner ; row++) in get_L() [all …]
|
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/UMFPACK/Source/ |
H A D | umfpack_get_numeric.c | 96 n_inner ; in UMFPACK_get_numeric() local 120 n_inner = MIN (n_row, n_col) ; in UMFPACK_get_numeric() 190 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 198 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 207 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 354 n_inner = MIN (n_row, n_col) ; in get_L() 367 for (row = 0 ; row < n_inner ; row++) in get_L() 373 for (row = n_inner ; row < n_row ; row++) in get_L() 474 ASSERT (Numeric->lnz + n_inner == lnz2) ; in get_L() 591 for (row = 0 ; row < n_inner ; row++) in get_L() [all …]
|
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/UMFPACK/Source/ |
H A D | umfpack_get_numeric.c | 96 n_inner ; in UMFPACK_get_numeric() local 120 n_inner = MIN (n_row, n_col) ; in UMFPACK_get_numeric() 190 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 198 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 207 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 354 n_inner = MIN (n_row, n_col) ; in get_L() 367 for (row = 0 ; row < n_inner ; row++) in get_L() 373 for (row = n_inner ; row < n_row ; row++) in get_L() 474 ASSERT (Numeric->lnz + n_inner == lnz2) ; in get_L() 591 for (row = 0 ; row < n_inner ; row++) in get_L() [all …]
|
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/UMFPACK/Source/ |
H A D | umfpack_get_numeric.c | 96 n_inner ; in UMFPACK_get_numeric() local 120 n_inner = MIN (n_row, n_col) ; in UMFPACK_get_numeric() 190 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 198 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 207 for (k = 0 ; k < n_inner ; k++) in UMFPACK_get_numeric() 354 n_inner = MIN (n_row, n_col) ; in get_L() 367 for (row = 0 ; row < n_inner ; row++) in get_L() 373 for (row = n_inner ; row < n_row ; row++) in get_L() 474 ASSERT (Numeric->lnz + n_inner == lnz2) ; in get_L() 591 for (row = 0 ; row < n_inner ; row++) in get_L() [all …]
|