Home
last modified time | relevance | path

Searched refs:nlim (Results 1 – 25 of 107) sorted by relevance

12345

/dports/science/plumed/plumed2-2.7.2/patches/gromacs-2020.6.diff/src/gromacs/mdlib/
H A Dexpanded.cpp86 for (i = 0; i < nlim; i++) in init_df_history_weights()
140 snew(nene, nlim); in GenerateWeightedGibbsProbabilities()
141 for (i = 0; i < nlim; i++) in GenerateWeightedGibbsProbabilities()
157 for (i = 0; i < nlim; i++) in GenerateWeightedGibbsProbabilities()
407 snew(p_k, nlim); in UpdateWeights()
449 snew(lam_dg, nlim); in UpdateWeights()
909 snew(propose, nlim); in ChooseNewLambda()
910 snew(accept, nlim); in ChooseNewLambda()
911 snew(remainder, nlim); in ChooseNewLambda()
1185 nlim = fep->n_lambda; in PrintFreeEnergyInfoToFile()
[all …]
H A Dexpanded.cpp.preplumed79 for (i = 0; i < nlim; i++)
133 snew(nene, nlim);
134 for (i = 0; i < nlim; i++)
150 for (i = 0; i < nlim; i++)
400 snew(p_k, nlim);
442 snew(lam_dg, nlim);
898 snew(propose, nlim);
899 snew(accept, nlim);
900 snew(remainder, nlim);
1174 nlim = fep->n_lambda;
[all …]
/dports/science/plumed/plumed2-2.7.2/patches/gromacs-2021.diff/src/gromacs/mdlib/
H A Dexpanded.cpp86 for (i = 0; i < nlim; i++) in init_df_history_weights()
140 snew(nene, nlim); in GenerateWeightedGibbsProbabilities()
141 for (i = 0; i < nlim; i++) in GenerateWeightedGibbsProbabilities()
157 for (i = 0; i < nlim; i++) in GenerateWeightedGibbsProbabilities()
407 snew(p_k, nlim); in UpdateWeights()
449 snew(lam_dg, nlim); in UpdateWeights()
909 snew(propose, nlim); in ChooseNewLambda()
910 snew(accept, nlim); in ChooseNewLambda()
911 snew(remainder, nlim); in ChooseNewLambda()
1185 nlim = fep->n_lambda; in PrintFreeEnergyInfoToFile()
[all …]
H A Dexpanded.cpp.preplumed79 for (i = 0; i < nlim; i++)
133 snew(nene, nlim);
134 for (i = 0; i < nlim; i++)
150 for (i = 0; i < nlim; i++)
400 snew(p_k, nlim);
442 snew(lam_dg, nlim);
898 snew(propose, nlim);
899 snew(accept, nlim);
900 snew(remainder, nlim);
1174 nlim = fep->n_lambda;
[all …]
/dports/science/gromacs/gromacs-2021.4/src/gromacs/mdlib/
H A Dexpanded.cpp79 for (i = 0; i < nlim; i++) in init_df_history_weights()
133 snew(nene, nlim); in GenerateWeightedGibbsProbabilities()
134 for (i = 0; i < nlim; i++) in GenerateWeightedGibbsProbabilities()
150 for (i = 0; i < nlim; i++) in GenerateWeightedGibbsProbabilities()
400 snew(p_k, nlim); in UpdateWeights()
442 snew(lam_dg, nlim); in UpdateWeights()
898 snew(propose, nlim); in ChooseNewLambda()
899 snew(accept, nlim); in ChooseNewLambda()
900 snew(remainder, nlim); in ChooseNewLambda()
1174 nlim = fep->n_lambda; in PrintFreeEnergyInfoToFile()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/system/lib/libc/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
57 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
67 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
71 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/devel/tinygo/tinygo-0.14.1/lib/wasi-libc/libc-top-half/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
57 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
67 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
71 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/devel/wasi-libc/wasi-libc-ad5133410f66b93a2381db5b542aad5e0964db96/libc-top-half/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
58 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
68 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
72 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/lang/zig/zig-0.9.0/lib/libc/wasi/libc-top-half/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
58 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
68 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
72 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/lang/zig/zig-0.9.0/lib/libc/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
58 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
68 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
72 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/lang/zig-devel/zig-0.9.0/lib/libc/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
58 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
68 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
72 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/lang/zig-devel/zig-0.9.0/lib/libc/wasi/libc-top-half/musl/src/passwd/
H A Dgetgrouplist.c14 int rv, nlim, ret = -1; in getgrouplist() local
26 nlim = *ngroups; in getgrouplist()
27 if (nlim >= 1) *groups++ = gid; in getgrouplist()
58 if (++n <= nlim) *groups++ = gr.gr_gid; in getgrouplist()
68 if(++n <= nlim) *groups++ = nscdbuf[i]; in getgrouplist()
72 ret = n > nlim ? -1 : n; in getgrouplist()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()
280 size_t nlim = 5; in gcc_sort_r() local
283 nlim = 3, size = ~size; in gcc_sort_r()
285 sort_r_ctx c = {data, cmp, base, n, size, nlim}; in gcc_sort_r()
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/powerpc/perf/
H A Dpower6-pmu.c363 int i, j, nlim; in p6_get_alternatives() local
369 nlim = p6_limited_pmc_event(event); in p6_get_alternatives()
381 nlim += p6_limited_pmc_event(aevent); in p6_get_alternatives()
415 ++nlim; in p6_get_alternatives()
422 ++nlim; in p6_get_alternatives()
438 if (!(flags & PPMU_LIMITED_PMC_OK) && nlim) { in p6_get_alternatives()
448 } else if ((flags & PPMU_LIMITED_PMC_REQD) && nlim < nalt) { in p6_get_alternatives()
H A Dpower5+-pmu.c277 int nlim; in power5p_get_alternatives() local
282 nlim = power5p_limited_pmc_event(event); in power5p_get_alternatives()
289 nlim += power5p_limited_pmc_event(ae); in power5p_get_alternatives()
313 ++nlim; in power5p_get_alternatives()
320 ++nlim; in power5p_get_alternatives()
331 if (!(flags & PPMU_LIMITED_PMC_OK) && nlim) { in power5p_get_alternatives()
341 } else if ((flags & PPMU_LIMITED_PMC_REQD) && nlim < nalt) { in power5p_get_alternatives()
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/powerpc/perf/
H A Dpower6-pmu.c363 int i, j, nlim; in p6_get_alternatives() local
369 nlim = p6_limited_pmc_event(event); in p6_get_alternatives()
381 nlim += p6_limited_pmc_event(aevent); in p6_get_alternatives()
415 ++nlim; in p6_get_alternatives()
422 ++nlim; in p6_get_alternatives()
438 if (!(flags & PPMU_LIMITED_PMC_OK) && nlim) { in p6_get_alternatives()
448 } else if ((flags & PPMU_LIMITED_PMC_REQD) && nlim < nalt) { in p6_get_alternatives()
H A Dpower5+-pmu.c277 int nlim; in power5p_get_alternatives() local
282 nlim = power5p_limited_pmc_event(event); in power5p_get_alternatives()
289 nlim += power5p_limited_pmc_event(ae); in power5p_get_alternatives()
313 ++nlim; in power5p_get_alternatives()
320 ++nlim; in power5p_get_alternatives()
331 if (!(flags & PPMU_LIMITED_PMC_OK) && nlim) { in power5p_get_alternatives()
341 } else if ((flags & PPMU_LIMITED_PMC_REQD) && nlim < nalt) { in power5p_get_alternatives()
/dports/multimedia/libv4l/linux-5.13-rc2/arch/powerpc/perf/
H A Dpower6-pmu.c363 int i, j, nlim; in p6_get_alternatives() local
369 nlim = p6_limited_pmc_event(event); in p6_get_alternatives()
381 nlim += p6_limited_pmc_event(aevent); in p6_get_alternatives()
415 ++nlim; in p6_get_alternatives()
422 ++nlim; in p6_get_alternatives()
438 if (!(flags & PPMU_LIMITED_PMC_OK) && nlim) { in p6_get_alternatives()
448 } else if ((flags & PPMU_LIMITED_PMC_REQD) && nlim < nalt) { in p6_get_alternatives()
H A Dpower5+-pmu.c277 int nlim; in power5p_get_alternatives() local
282 nlim = power5p_limited_pmc_event(event); in power5p_get_alternatives()
289 nlim += power5p_limited_pmc_event(ae); in power5p_get_alternatives()
313 ++nlim; in power5p_get_alternatives()
320 ++nlim; in power5p_get_alternatives()
331 if (!(flags & PPMU_LIMITED_PMC_OK) && nlim) { in power5p_get_alternatives()
341 } else if ((flags & PPMU_LIMITED_PMC_REQD) && nlim < nalt) { in power5p_get_alternatives()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dsort.cc58 size_t nlim; // limit for network sort member
70 size_t nlim; member
203 if (likely (n <= c->nlim)) in mergesort()
257 size_t nlim = 5; in gcc_qsort() local
260 nlim = 3, size = ~size; in gcc_qsort()
262 sort_ctx c = {cmp, base, n, size, nlim}; in gcc_qsort()

12345