Home
last modified time | relevance | path

Searched refs:howmany (Results 1 – 25 of 1339) sorted by relevance

12345678910>>...54

/dports/devel/ga/ga-5.8/ma/
H A Dtest-inquire.c78 int howmany; in print_inquire() local
82 howmany = MA_inquire_heap(MT_DBL); in print_inquire()
83 (void)printf("MA_inquire_heap(MT_DBL) = %d\n", howmany); in print_inquire()
84 howmany = MA_inquire_heap_check_stack(MT_DBL); in print_inquire()
85 (void)printf("MA_inquire_heap_check_stack(MT_DBL) = %d\n", howmany); in print_inquire()
86 howmany = MA_inquire_heap_no_partition(MT_DBL); in print_inquire()
87 (void)printf("MA_inquire_heap_no_partition(MT_DBL) = %d\n", howmany); in print_inquire()
89 howmany = MA_inquire_stack(MT_DBL); in print_inquire()
90 (void)printf("MA_inquire_stack(MT_DBL) = %d\n", howmany); in print_inquire()
91 howmany = MA_inquire_stack_check_heap(MT_DBL); in print_inquire()
[all …]
H A Dtest-coalesce.c23 int howmany; in main() local
41 howmany = MA_inquire_heap(MT_INT); in main()
42 (void)printf("MA_inquire_heap(MT_INT) = %d\n", howmany); in main()
45 MA_alloc_get(MT_INT, howmany/5, "heap0", &handle[0], &index[0]); in main()
46 MA_alloc_get(MT_INT, howmany/5, "heap1", &handle[1], &index[1]); in main()
47 MA_alloc_get(MT_INT, howmany/5, "heap2", &handle[2], &index[2]); in main()
48 MA_alloc_get(MT_INT, howmany/5, "heap3", &handle[3], &index[3]); in main()
55 MA_alloc_get(MT_INT, howmany/4, "heap4", &handle[4], &index[4]); in main()
59 MA_alloc_get(MT_INT, howmany/4, "heap4", &handle[4], &index[4]); in main()
/dports/math/fftw/fftw-2.1.5/threads/
H A Drfftwnd_threads.c252 int howmany = d->howmany; in r2c_overlap_howmany_thread() local
273 int howmany = d->howmany; in c2r_overlap_howmany_thread() local
294 int howmany = d->howmany; in r2c_howmany_thread() local
315 int howmany = d->howmany; in c2r_howmany_thread() local
349 int howmany = d->howmany; in r2c_hyperslab_howmany_thread() local
371 int howmany = d->howmany; in c2r_hyperslab_howmany_thread() local
401 int howmany = d->howmany; in fftw_howmany_thread() local
435 d.howmany = howmany; in rfftwnd_real2c_aux_howmany_threads()
470 d.howmany = howmany; in rfftwnd_real2c_aux_howmany_threads()
491 d.howmany = howmany; in rfftwnd_real2c_aux_howmany_threads()
[all …]
H A Dfftw_threads_test.c234 for (i = 0; i < n * howmany; ++i) in test_out_of_place()
239 for (i = 0; i < n * howmany; ++i) in test_out_of_place()
244 for (i = 0; i < howmany; ++i) { in test_out_of_place()
309 for (i = 0; i < n * howmany; ++i) in test_in_place()
314 for (i = 0; i < howmany; ++i) { in test_in_place()
328 int howmany, in test_out_of_place_both() argument
364 n, istride, howmany)); in test_in_place_both()
372 n, istride, howmany)); in test_in_place_both()
380 int istride, ostride, howmany; in test_correctness() local
395 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
[all …]
H A Drfftw_threads_test.c250 for (j = 1; j < howmany; ++j) in test_out_of_place()
327 for (j = 0; j < howmany; ++j) in test_out_of_place()
369 for (j = 1; j < howmany; ++j) in test_in_place()
437 for (j = 0; j < howmany; ++j) in test_in_place()
450 int howmany, in test_out_of_place_both() argument
486 n, istride, howmany)); in test_in_place_both()
494 n, istride, howmany)); in test_in_place_both()
519 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
525 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
619 if (istride == howmany) in testnd_out_of_place()
[all …]
/dports/math/fftw-float/fftw-2.1.5/threads/
H A Drfftwnd_threads.c252 int howmany = d->howmany; in r2c_overlap_howmany_thread() local
273 int howmany = d->howmany; in c2r_overlap_howmany_thread() local
294 int howmany = d->howmany; in r2c_howmany_thread() local
315 int howmany = d->howmany; in c2r_howmany_thread() local
349 int howmany = d->howmany; in r2c_hyperslab_howmany_thread() local
371 int howmany = d->howmany; in c2r_hyperslab_howmany_thread() local
401 int howmany = d->howmany; in fftw_howmany_thread() local
435 d.howmany = howmany; in rfftwnd_real2c_aux_howmany_threads()
470 d.howmany = howmany; in rfftwnd_real2c_aux_howmany_threads()
491 d.howmany = howmany; in rfftwnd_real2c_aux_howmany_threads()
[all …]
H A Dfftw_threads_test.c234 for (i = 0; i < n * howmany; ++i) in test_out_of_place()
239 for (i = 0; i < n * howmany; ++i) in test_out_of_place()
244 for (i = 0; i < howmany; ++i) { in test_out_of_place()
309 for (i = 0; i < n * howmany; ++i) in test_in_place()
314 for (i = 0; i < howmany; ++i) { in test_in_place()
328 int howmany, in test_out_of_place_both() argument
364 n, istride, howmany)); in test_in_place_both()
372 n, istride, howmany)); in test_in_place_both()
380 int istride, ostride, howmany; in test_correctness() local
395 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
[all …]
H A Drfftw_threads_test.c250 for (j = 1; j < howmany; ++j) in test_out_of_place()
327 for (j = 0; j < howmany; ++j) in test_out_of_place()
369 for (j = 1; j < howmany; ++j) in test_in_place()
437 for (j = 0; j < howmany; ++j) in test_in_place()
450 int howmany, in test_out_of_place_both() argument
486 n, istride, howmany)); in test_in_place_both()
494 n, istride, howmany)); in test_in_place_both()
519 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
525 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
619 if (istride == howmany) in testnd_out_of_place()
[all …]
/dports/devel/libnaji/libnaji-0.6.4.src/
H A Dnajio.c559 for (i=0; i<howmany; i++) in naji_lines_alloc()
573 for (i=0; i<howmany; i++) in naji_lines_free()
612 if (i >= howmany) in naji_lines_load()
676 unsigned long howmany; in lineback() local
679 howmany = howl(namein); in lineback()
683 howmany ++; in lineback()
737 for (i=0; i<howmany; i++) in naji_lines_random_print()
742 for (i=0; i<howmany; i++) in naji_lines_random_print()
753 unsigned long howmany; in rndlines() local
756 howmany = howl(namein); in rndlines()
[all …]
/dports/textproc/libxslt/libxslt-1.1.34/tests/XSLTMark/
H A Dtower.xsl17 <xsl:with-param name="howmany" select="."/>
29 <xsl:param name="howmany"/> parameter
30 <xsl:if test="$howmany > 0">
38 <xsl:with-param name="howmany" select="$howmany - 1"/>
42 …select="($source = 1) * ($height1 - $howmany) + ($target = 1) * ($height1 + 1) + ($spare = 1) * ($…
44 …select="($source = 2) * ($height2 - $howmany) + ($target = 2) * ($height2 + 1) + ($spare = 2) * ($…
46 …select="($source = 3) * ($height3 - $howmany) + ($target = 3) * ($height3 + 1) + ($spare = 3) * ($…
54 …select="($source = 1) * ($height1 - $howmany) + ($target = 1) * ($height1 + 1) + ($spare = 1) * ($…
56 …select="($source = 2) * ($height2 - $howmany) + ($target = 2) * ($height2 + 1) + ($spare = 2) * ($…
58 …select="($source = 3) * ($height3 - $howmany) + ($target = 3) * ($height3 + 1) + ($spare = 3) * ($…
[all …]
/dports/audio/ardour6/Ardour-6.8.0/libs/ardour/
H A Dthread_buffers.cc47 ThreadBuffers::ensure_buffers (ChanCount howmany, size_t custom) in ensure_buffers() argument
54 if (howmany.n_midi () < 1) { in ensure_buffers()
55 howmany.set_midi (1); in ensure_buffers()
61 size_t count = std::max (scratch_buffers->available ().get (*t), howmany.get (*t)); in ensure_buffers()
89 allocate_pan_automation_buffers (audio_buffer_size, howmany.n_audio (), false); in ensure_buffers()
93 ThreadBuffers::allocate_pan_automation_buffers (samplecnt_t nframes, uint32_t howmany, bool force) in allocate_pan_automation_buffers() argument
97 howmany = max (2U, howmany); in allocate_pan_automation_buffers()
99 if (!force && howmany <= npan_buffers) { in allocate_pan_automation_buffers()
111 pan_automation_buffer = new pan_t*[howmany]; in allocate_pan_automation_buffers()
113 for (uint32_t i = 0; i < howmany; ++i) { in allocate_pan_automation_buffers()
[all …]
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/twmc/
H A Dinitnets.c235 INT howmany ; in add_paths_to_cells() local
419 commonS->cap_match[HOWMANY] = howmany = 1 ;
421 howmany = ++commonS->cap_match[HOWMANY] ;
425 for( i = 0 ; i < howmany - 1 ; i++ ){
435 commonS->cap_match[howmany] = pinnum ;
452 commonS->res_match[HOWMANY] = howmany = 1 ;
454 howmany = ++commonS->res_match[HOWMANY] ;
458 for( i = 0 ; i < howmany - 1 ; i++ ){
468 commonS->res_match[howmany] = pinnum ;
504 (howmany+1) * sizeof(INT) ) ;
[all …]
/dports/devel/rpc2/rpc2-2.14/include/rpc2/
H A Dmulti.h88 #define ARG_MARSHALL(mode, type, name, object, howmany)\ argument
89 type *name##_ptrs[howmany] __attribute__((unused));\
90 type name##_bufs[howmany];\
92 memset(&name##_bufs, 0, sizeof(type) * howmany);\
99 #define ARG_MARSHALL_BS(mode, type, name, object, howmany, maxbslen)\ argument
100 type *name##_ptrs[howmany];\
101 type name##_bufs[howmany];\
102 char name##_data[maxbslen * howmany];\
104 for (int name##_local_i = 0; name##_local_i < howmany; name##_local_i++) {\
115 type *name##_ptrs[howmany];\
[all …]
/dports/www/crp/CRP/Chair/
H A DSpotProblems.php7 function spotSecondaryReviewers($howmany) argument
11 if ( $howmany == 0 ) {
26 . " HAVING COUNT(ReviewRequest.paperId)=$howmany "
33 … print "<tr> <th colspan=2> There are $count Papers With $howmany Assigned Secondary </th> </tr>";
49 function spotReviews($howmany, $finalized=0) argument
54 if ( $howmany == 0 ) {
75 . " HAVING COUNT(PaperReview.paperId)=$howmany "
82 … print "<tr> <th colspan=2> There are $count Papers With $howmany Finalized Reviews </th> </tr>";
84 print "<tr> <th colspan=2> There are $count Papers With $howmany Started Reviews </th> </tr>";
/dports/textproc/R-cran-stringi/stringi/src/
H A Dstri_common.cpp177 SEXP stri__vector_NA_strings(R_len_t howmany) in stri__vector_NA_strings() argument
179 if (howmany < 0) { in stri__vector_NA_strings()
181 howmany = 0; in stri__vector_NA_strings()
186 for (R_len_t i=0; i<howmany; ++i) in stri__vector_NA_strings()
202 SEXP stri__vector_NA_integers(R_len_t howmany) in stri__vector_NA_integers() argument
204 if (howmany < 0) { in stri__vector_NA_integers()
206 howmany = 0; in stri__vector_NA_integers()
211 for (R_len_t i=0; i<howmany; ++i) in stri__vector_NA_integers()
229 if (howmany < 0) { in stri__vector_empty_strings()
231 howmany = 0; in stri__vector_empty_strings()
[all …]
/dports/www/crp/CRP/PC/
H A DSpotMyProblems.php7 function spotSecondaryReviewers($howmany) argument
11 if ( $howmany == 0 ) {
30 . " HAVING COUNT(ReviewRequest.paperId)=$howmany "
36 print "<tr> <th colspan=2> Papers With $howmany Assigned Secondary </th> </tr>";
52 function spotReviews($howmany, $finalized, $table) argument
56 if ( $howmany == 0 ) {
82 . " HAVING COUNT(PaperReview.paperId)=$howmany "
92 print "<tr> <th colspan=2> Papers With $howmany Finalized $table Reviews </th> </tr>";
94 print "<tr> <th colspan=2> Papers With $howmany Started $table Reviews </th> </tr>";
/dports/devel/spdlog/spdlog-1.9.2/bench/
H A Dasync_bench.cpp32 void bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count);
73 int howmany = 1000000; in main() local
74 int queue_size = std::min(howmany + 2, 8192); in main()
88 howmany = atoi(argv[1]); in main()
106 spdlog::info("Messages : {:L}", howmany); in main()
123 bench_mt(howmany, std::move(logger), threads); in main()
139 bench_mt(howmany, std::move(logger), threads); in main()
152 void thread_fun(std::shared_ptr<spdlog::logger> logger, int howmany) in thread_fun() argument
154 for (int i = 0; i < howmany; i++) in thread_fun()
166 int msgs_per_thread = howmany / thread_count; in bench_mt()
[all …]
/dports/math/fftw-float/fftw-2.1.5/rfftw/
H A Drfftwnd.c302 int howmany, in rfftwnd_real2c_aux_howmany() argument
349 fftw(p->plans[cur_dim], howmany, in rfftwnd_real2c_aux_howmany()
355 int howmany, in rfftwnd_c2real_aux_howmany() argument
365 fftw(p->plans[cur_dim], howmany, in rfftwnd_c2real_aux_howmany()
457 rfftw_real2c_aux(p->plans[0], howmany, in rfftwnd_real_to_complex()
464 if (howmany > 1 && ostride > odist) in rfftwnd_real_to_complex()
465 rfftwnd_real2c_aux_howmany(p, 0, howmany, in rfftwnd_real_to_complex()
472 for (i = 0; i < howmany; ++i) in rfftwnd_real_to_complex()
532 rfftw_c2real_aux(p->plans[0], howmany, in rfftwnd_complex_to_real()
539 if (howmany > 1 && ostride > odist) in rfftwnd_complex_to_real()
[all …]
/dports/math/fftw/fftw-2.1.5/rfftw/
H A Drfftwnd.c302 int howmany, in rfftwnd_real2c_aux_howmany() argument
349 fftw(p->plans[cur_dim], howmany, in rfftwnd_real2c_aux_howmany()
355 int howmany, in rfftwnd_c2real_aux_howmany() argument
365 fftw(p->plans[cur_dim], howmany, in rfftwnd_c2real_aux_howmany()
457 rfftw_real2c_aux(p->plans[0], howmany, in rfftwnd_real_to_complex()
464 if (howmany > 1 && ostride > odist) in rfftwnd_real_to_complex()
465 rfftwnd_real2c_aux_howmany(p, 0, howmany, in rfftwnd_real_to_complex()
472 for (i = 0; i < howmany; ++i) in rfftwnd_real_to_complex()
532 rfftw_c2real_aux(p->plans[0], howmany, in rfftwnd_complex_to_real()
539 if (howmany > 1 && ostride > odist) in rfftwnd_complex_to_real()
[all …]
/dports/deskutils/flameshot/flameshot-0.10.2/external/spdlog/bench/
H A Dasync_bench.cpp32 void bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count);
73 int howmany = 1000000; in main() local
74 int queue_size = std::min(howmany + 2, 8192); in main()
88 howmany = atoi(argv[1]); in main()
124 bench_mt(howmany, std::move(logger), threads); in main()
140 bench_mt(howmany, std::move(logger), threads); in main()
153 void thread_fun(std::shared_ptr<spdlog::logger> logger, int howmany) in thread_fun() argument
155 for (int i = 0; i < howmany; i++) in thread_fun()
161 void bench_mt(int howmany, std::shared_ptr<spdlog::logger> logger, int thread_count) in bench_mt() argument
167 int msgs_per_thread = howmany / thread_count; in bench_mt()
[all …]
/dports/databases/p5-LMDB_File/LMDB_File-0.12/t/
H A D04-bigone.t16 my $howmany = 2_000_000;
30 for( my $i = 0; $i < $howmany; $i++ ) {
33 is($db->stat->{entries}, $howmany, '2M entries writen');
34 diag(sprintf "Writen %d in %g seconds", $howmany, Time::HiRes::tv_interval($t0))
42 for( my $i = 0; $i < $howmany; $i++ ) {
45 is($k, $howmany - 1, 'Last');
51 diag(sprintf "Readed %d in %g seconds", $howmany, Time::HiRes::tv_interval($t0))
53 is($c, ($howmany-1) * $howmany / 2, 'Sum OK');
/dports/math/sc/sc-7.16/
H A Dsort.c30 int howmany; variable
57 howmany = 2; in sortrange()
59 for (howmany = 0; criteria[cp]; howmany++) { in sortrange()
60 if (howmany > 1) in sortrange()
62 (howmany + 1) * (sizeof(struct sortcrit))); in sortrange()
65 sort[howmany].direction = 1; in sortrange()
68 sort[howmany].direction = -1; in sortrange()
76 sort[howmany].type = 0; in sortrange()
79 sort[howmany].type = 1; in sortrange()
93 sort[howmany].column = col; in sortrange()
[all …]
/dports/math/sc-im/sc-im-0.8.2/src/
H A Dsort.c67 int howmany; variable
103 howmany = 2; in sortrange()
105 howmany = 0; in sortrange()
107 if (howmany > 1) in sortrange()
112 sort[howmany].direction = 1; in sortrange()
115 sort[howmany].direction = -1; in sortrange()
123 sort[howmany].type = 0; in sortrange()
126 sort[howmany].type = 1; in sortrange()
140 sort[howmany].column = col; in sortrange()
146 howmany++; in sortrange()
[all …]
/dports/math/fftw-float/fftw-2.1.5/mpi/
H A Dfftw_mpi_test.c282 int howmany, fftw_direction dir, in test_out_of_place() argument
316 * sizeof(fftw_complex) * howmany); in test_in_place()
326 for (i = 0; i < n * howmany; ++i) { in test_in_place()
336 fftw_mpi(plan, howmany, in1, work); in test_in_place()
340 fftw(validated_plan, howmany, in2, howmany, 1, out2, howmany, 1); in test_in_place()
356 int howmany, in test_out_of_place_both() argument
370 n, istride, howmany)); in test_in_place_both()
378 n, istride, howmany)); in test_in_place_both()
385 int howmany; in test_correctness() local
398 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
[all …]
/dports/math/fftw/fftw-2.1.5/mpi/
H A Dfftw_mpi_test.c282 int howmany, fftw_direction dir, in test_out_of_place() argument
316 * sizeof(fftw_complex) * howmany); in test_in_place()
326 for (i = 0; i < n * howmany; ++i) { in test_in_place()
336 fftw_mpi(plan, howmany, in1, work); in test_in_place()
340 fftw(validated_plan, howmany, in2, howmany, 1, out2, howmany, 1); in test_in_place()
356 int howmany, in test_out_of_place_both() argument
370 n, istride, howmany)); in test_in_place_both()
378 n, istride, howmany)); in test_in_place_both()
385 int howmany; in test_correctness() local
398 for (howmany = 1; howmany <= MAX_HOWMANY; ++howmany) in test_correctness()
[all …]

12345678910>>...54