Home
last modified time | relevance | path

Searched refs:n_total (Results 1 – 25 of 297) sorted by relevance

12345678910>>...12

/dports/devel/liborcus/liborcus-0.16.1/src/parser/
H A Dparser_base.cpp106 int n_total = available_size(); in skip() local
108 while (n_total) in skip()
114 int n = std::min<int>(16, n_total); in skip()
128 n_total -= 16; in skip()
142 size_t n_total = available_size(); in skip_space_and_control() local
146 while (n_total) in skip_space_and_control()
156 r = std::min<size_t>(r, n_total); in skip_space_and_control()
168 n_total -= 32; in skip_space_and_control()
175 size_t n_total = available_size(); in skip_space_and_control()
177 while (n_total) in skip_space_and_control()
[all …]
/dports/lang/micropython/micropython-1.17/py/
H A Dobjboundmeth.c52 size_t n_total = n_args + 2 * n_kw; in mp_call_method_self_n_kw() local
55 args2 = mp_pystack_alloc(sizeof(mp_obj_t) * (1 + n_total)); in mp_call_method_self_n_kw()
58 if (n_total > 4) { in mp_call_method_self_n_kw()
60 args2 = m_new_maybe(mp_obj_t, 1 + n_total); in mp_call_method_self_n_kw()
65 args2 = alloca(sizeof(mp_obj_t) * (1 + n_total)); in mp_call_method_self_n_kw()
69 memcpy(args2 + 1, args, n_total * sizeof(mp_obj_t)); in mp_call_method_self_n_kw()
75 m_del(mp_obj_t, free_args2, 1 + n_total); in mp_call_method_self_n_kw()
H A Dobjclosure.c44 size_t n_total = self->n_closed + n_args + 2 * n_kw; in closure_call() local
45 if (n_total <= 5) { in closure_call()
53 mp_obj_t *args2 = m_new(mp_obj_t, n_total); in closure_call()
57 m_del(mp_obj_t, args2, n_total); in closure_call()
/dports/math/cppad/CppAD-20210000.8/example/multi_thread/bthread/
H A Da11c_bthread.cpp74 size_t i, j, n_total = 10; in a11c() local
75 float *a = new float[n_total]; in a11c()
76 float *b = new float[n_total]; in a11c()
77 for(i = 0; i < n_total; i++) in a11c()
89 size_t n = n_total / number_threads; in a11c()
99 n_tmp = n_total - j * n + 1; in a11c()
/dports/security/openvpn/openvpn-2.5.6/src/openvpn/
H A Dlzo.c61 if (ac->n_total > AC_MIN_BYTES in lzo_adaptive_compress_test()
62 && (ac->n_total - ac->n_comp) < (ac->n_total / (100 / AC_SAVE_PCT))) in lzo_adaptive_compress_test()
71 dmsg(D_COMP, "lzo_adaptive_compress_test: comp=%d total=%d", ac->n_comp, ac->n_total); in lzo_adaptive_compress_test()
72 ac->n_total = ac->n_comp = 0; in lzo_adaptive_compress_test()
80 ac->n_total = ac->n_comp = 0; in lzo_adaptive_compress_test()
94 lzo_adaptive_compress_data(struct lzo_adaptive_compress *ac, int n_total, int n_comp) in lzo_adaptive_compress_data() argument
96 ac->n_total += n_total; in lzo_adaptive_compress_data()
/dports/security/openvpn-devel/openvpn-0033811e0215af76f469d78912c95a2f59813454/src/openvpn/
H A Dlzo.c61 if (ac->n_total > AC_MIN_BYTES in lzo_adaptive_compress_test()
62 && (ac->n_total - ac->n_comp) < (ac->n_total / (100 / AC_SAVE_PCT))) in lzo_adaptive_compress_test()
71 dmsg(D_COMP, "lzo_adaptive_compress_test: comp=%d total=%d", ac->n_comp, ac->n_total); in lzo_adaptive_compress_test()
72 ac->n_total = ac->n_comp = 0; in lzo_adaptive_compress_test()
80 ac->n_total = ac->n_comp = 0; in lzo_adaptive_compress_test()
94 lzo_adaptive_compress_data(struct lzo_adaptive_compress *ac, int n_total, int n_comp) in lzo_adaptive_compress_data() argument
96 ac->n_total += n_total; in lzo_adaptive_compress_data()
/dports/security/openvpn-mbedtls/openvpn-2.5.6/src/openvpn/
H A Dlzo.c61 if (ac->n_total > AC_MIN_BYTES in lzo_adaptive_compress_test()
62 && (ac->n_total - ac->n_comp) < (ac->n_total / (100 / AC_SAVE_PCT))) in lzo_adaptive_compress_test()
71 dmsg(D_COMP, "lzo_adaptive_compress_test: comp=%d total=%d", ac->n_comp, ac->n_total); in lzo_adaptive_compress_test()
72 ac->n_total = ac->n_comp = 0; in lzo_adaptive_compress_test()
80 ac->n_total = ac->n_comp = 0; in lzo_adaptive_compress_test()
94 lzo_adaptive_compress_data(struct lzo_adaptive_compress *ac, int n_total, int n_comp) in lzo_adaptive_compress_data() argument
96 ac->n_total += n_total; in lzo_adaptive_compress_data()
/dports/math/cppad/CppAD-20210000.8/example/multi_thread/pthread/
H A Da11c_pthread.cpp74 int i, j, n_total = 10; in a11c() local
75 float *a = new float[size_t(n_total)]; in a11c()
76 float *b = new float[size_t(n_total)]; in a11c()
77 for(i = 0; i < n_total; i++) in a11c()
92 int n = n_total / n_thread; in a11c()
101 arg[j].n = n_total - j * n + 1; in a11c()
/dports/audio/ardour6/Ardour-6.8.0/libs/ardour/
H A Dbundle.cc84 Bundle::n_total () const in n_total() function in Bundle
93 assert (c < n_total()); in channel_ports()
106 assert (ch < n_total()); in add_port_to_channel()
124 assert (ch < n_total()); in remove_port_from_channel()
151 assert (ch < n_total()); in set_port()
202 assert (ch < n_total()); in port_attached_to_channel()
214 assert (ch < n_total()); in remove_channel()
278 assert (ch < n_total()); in channel_name()
291 assert (ch < n_total()); in set_channel_name()
410 assert (ch < n_total()); in remove_ports_from_channel()
[all …]
/dports/devel/ptmalloc2/ptmalloc2/
H A Dt-test2.c120 int n_total=0, n_total_max=N_TOTAL, n_running; variable
129 if(n_total >= n_total_max) { in my_end_thread()
132 printf("Creating thread #%d failed.\n", n_total); in my_end_thread()
134 n_total++; in my_end_thread()
135 if(n_total%N_TOTAL_PRINT == 0) in my_end_thread()
136 printf("n_total = %d\n", n_total); in my_end_thread()
206 for(n_running=n_total=n_thr; n_running>0;) { in main()
H A Dt-test1.c156 int n_total=0, n_total_max=N_TOTAL, n_running; variable
165 if(n_total >= n_total_max) { in my_end_thread()
168 printf("Creating thread #%d failed.\n", n_total); in my_end_thread()
170 n_total++; in my_end_thread()
171 if(n_total%N_TOTAL_PRINT == 0) in my_end_thread()
172 printf("n_total = %d\n", n_total); in my_end_thread()
267 for(n_running=n_total=n_thr; n_running>0;) { in main()
/dports/devel/ptmalloc/ptmalloc3/
H A Dt-test2.c120 int n_total=0, n_total_max=N_TOTAL, n_running; variable
129 if(n_total >= n_total_max) { in my_end_thread()
132 printf("Creating thread #%d failed.\n", n_total); in my_end_thread()
134 n_total++; in my_end_thread()
135 if(n_total%N_TOTAL_PRINT == 0) in my_end_thread()
136 printf("n_total = %d\n", n_total); in my_end_thread()
206 for(n_running=n_total=n_thr; n_running>0;) { in main()
H A Dt-test1.c156 int n_total=0, n_total_max=N_TOTAL, n_running; variable
165 if(n_total >= n_total_max) { in my_end_thread()
168 printf("Creating thread #%d failed.\n", n_total); in my_end_thread()
170 n_total++; in my_end_thread()
171 if(n_total%N_TOTAL_PRINT == 0) in my_end_thread()
172 printf("n_total = %d\n", n_total); in my_end_thread()
267 for(n_running=n_total=n_thr; n_running>0;) { in main()
/dports/math/octave-forge-stk/stk/inst/misc/test/
H A Dstk_runtests.m73 'n_total', 0, ...
92 res.n_total = res.n_total + nt;
104 fprintf ('*** --> passed %d/%d tests\n', res.n_pass, res.n_total);
124 function [n_pass, n_total, n_notest, n_files, n_dirs, err] ...
137 n_total = 0; variable
165 n_total = n_total + n; variable
196 fprintf (' --> passed %d/%d tests\n', n_pass, n_total);
205 n_total = n_total + n; variable
217 n_total = n_total + n; variable
/dports/lang/cjs/cjs-4.8.2/cjs/
H A Djsapi-util-args.h346 unsigned n_required = 0, n_total = 0; in gjs_parse_call_args() local
357 n_required = n_total; in gjs_parse_call_args()
363 n_total++; in gjs_parse_call_args()
368 n_required = n_total; in gjs_parse_call_args()
371 sizeof...(Args) / 2 == n_total)); in gjs_parse_call_args()
375 if (!ignore_trailing_args && args.length() > n_total) { in gjs_parse_call_args()
376 if (n_required == n_total) { in gjs_parse_call_args()
382 function_name, n_required, n_total - n_required, in gjs_parse_call_args()
/dports/lang/gjs/gjs-1.70.0/gjs/
H A Djsapi-util-args.h338 unsigned n_required = 0, n_total = 0; in gjs_parse_call_args() local
349 n_required = n_total; in gjs_parse_call_args()
355 n_total++; in gjs_parse_call_args()
360 n_required = n_total; in gjs_parse_call_args()
363 sizeof...(Args) / 2 == n_total)); in gjs_parse_call_args()
367 if (!ignore_trailing_args && args.length() > n_total) { in gjs_parse_call_args()
368 if (n_required == n_total) { in gjs_parse_call_args()
374 function_name, n_required, n_total - n_required, in gjs_parse_call_args()
/dports/games/shockolate/systemshock-0.8.2-43-ga9eb1b93/src/Libraries/adlmidi/
H A Dadlmidi_private.cpp39 size_t n_fourop[2] = {0, 0}, n_total[2] = {0, 0}; in adlRefreshNumCards() local
61 ++n_total[div]; in adlRefreshNumCards()
74 ++n_total[a / 128]; in adlRefreshNumCards()
91 else if((n_fourop[0] >= (n_total[0] * 7) / 8)) in adlRefreshNumCards()
/dports/science/libxc/libxc-5.0.0/maple/lda_exc/
H A Dlda_xc_1d_ehwlrg.mpl20 (params_a_a1 + params_a_a2*n_total(rs) + params_a_a3*n_total(rs)^2) * n_total(rs)^params_a_alpha:
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/
H A Dreciprocity.py64 n_total = len(pred) + len(succ)
68 if n_total == 0:
71 reciprocity = 2.0 * float(len(overlap)) / float(n_total)
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/crates/ide/src/
H A Dprime_caches.rs17 pub n_total: usize, field
40 let n_total = to_prime.len(); in prime_caches() localVariable
44 cb(PrimeCachesProgress { on_crate: crate_name, n_done, n_total }); in prime_caches()
/dports/misc/vxl/vxl-3.3.2/contrib/mul/clsfy/
H A Dclsfy_smo_base.cxx142 int n_total = 0; in error_rate() local
147 ++n_total; in error_rate()
149 return double(n_error)/double(n_total); in error_rate()
/dports/net-p2p/c-lightning/lightning-0.10.2/external/libwally-core/src/secp256k1/src/modules/rangeproof/
H A Dmain_impl.h168 …r* const* generator_blind, unsigned char* const* blinding_factor, size_t n_total, size_t n_inputs)… in secp256k1_pedersen_blind_generator_blind_sum() argument
174 ARG_CHECK(n_total == 0 || value != NULL); in secp256k1_pedersen_blind_generator_blind_sum()
175 ARG_CHECK(n_total == 0 || generator_blind != NULL); in secp256k1_pedersen_blind_generator_blind_sum()
176 ARG_CHECK(n_total == 0 || blinding_factor != NULL); in secp256k1_pedersen_blind_generator_blind_sum()
177 ARG_CHECK(n_total > n_inputs); in secp256k1_pedersen_blind_generator_blind_sum()
180 if (n_total == 0) { in secp256k1_pedersen_blind_generator_blind_sum()
185 for (i = 0; i < n_total; i++) { in secp256k1_pedersen_blind_generator_blind_sum()
215 secp256k1_scalar_get_b32(blinding_factor[n_total - 1], &tmp); in secp256k1_pedersen_blind_generator_blind_sum()
/dports/math/fftw-float/fftw-2.1.5/cilk/
H A Dtest_cilk.cilk249 long n_total, iter;
263 n_total = 1;
271 n_total *= dims[i];
311 a1 = malloc(n_total * 2 * sizeof(fftw_real));
312 a2 = malloc(n_total * 2 * sizeof(fftw_real) * istride);
317 a3 = malloc(n_total * 2 * sizeof(fftw_real) * ostride);
320 …printf("\nERROR: Out of memory (need at least %ld bytes)\n", (n_total * 2 + n_total * 4) * sizeof(…
323 for (i = 0; i < n_total; ++i) {
363 for (i = 0; i < n_total; ++i)
/dports/math/fftw/fftw-2.1.5/cilk/
H A Dtest_cilk.cilk249 long n_total, iter;
263 n_total = 1;
271 n_total *= dims[i];
311 a1 = malloc(n_total * 2 * sizeof(fftw_real));
312 a2 = malloc(n_total * 2 * sizeof(fftw_real) * istride);
317 a3 = malloc(n_total * 2 * sizeof(fftw_real) * ostride);
320 …printf("\nERROR: Out of memory (need at least %ld bytes)\n", (n_total * 2 + n_total * 4) * sizeof(…
323 for (i = 0; i < n_total; ++i) {
363 for (i = 0; i < n_total; ++i)
/dports/lang/python-legacy/Python-2.7.18/Objects/stringlib/
H A Dformatter.h310 Py_ssize_t *n_total) in calc_padding() argument
314 *n_total = nchars; in calc_padding()
316 *n_total = width; in calc_padding()
320 *n_total = nchars; in calc_padding()
326 *n_lpadding = *n_total - nchars; in calc_padding()
328 *n_lpadding = (*n_total - nchars) / 2; in calc_padding()
337 *n_rpadding = *n_total - nchars - *n_lpadding; in calc_padding()
752 Py_ssize_t n_total; in format_int_or_long_internal() local
899 result = STRINGLIB_NEW(NULL, n_total); in format_int_or_long_internal()
936 Py_ssize_t n_total; in format_float_internal() local
[all …]

12345678910>>...12