Searched refs:passes (Results 1 - 25 of 29) sorted by relevance

12

/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/conformance/interfaces/timer_settime/
H A D5-3.c36 int fails = 0, passes = 0; variable
41 passes += 1;
96 fails = NUMTESTS-passes;
98 printf("passes %d, fails %d\n", passes, fails);
/haiku-fatelf/src/tests/system/benchmarks/
H A Dmemspeed.c25 u_long size, passes, d, i, j; local
47 passes = LOOPSIZE/size;
51 for (i = 0; i < passes; i++)
66 passes = LOOPSIZE/size;
70 for (i = 0; i < passes; i++)
/haiku-fatelf/src/add-ons/print/drivers/pdf/source/
H A DStatusWindow.h65 StatusWindow(int32 passes, int32 pages, PrinterDriver *pd);
H A DPrinterDriver.cpp102 const int32 passes = 2; local
139 StatusWindow* statusWindow = new StatusWindow(passes, pfh.page_count, this);
144 for (fPass = 0; fPass < passes && status == B_OK && fPrinting; fPass++) {
H A DStatusWindow.cpp44 StatusWindow::StatusWindow(int32 passes, int32 pages, PrinterDriver *pd) argument
68 fPageStatus->SetMaxValue(pages * passes);
/haiku-fatelf/src/libs/print/libgutenprint/test/
H A Drun-weavetest21 passes='1,1,1 2,1,1 1,2,1 1,2,2 1,4,1 4,1,1 1,8,1 1,16,1 4,2,1 4,4,1 4,8,1 4,16,1 2,2,1 2,4,1 2,8,1 2,16,1 1,4,2 1,8,2 1,16,2 2,2,2 2,4,2 2,8,2 2,16,2 8,1,1 4,4,2 4,8,2 8,2,1 8,4,1 8,8,1 16,1,1 16,2,1 16,4,1'
97 for pass in $passes ; do
/haiku-fatelf/src/add-ons/translators/jpeg2000/libjasper/
H A Djpc_t1enc.c271 cblk->passes = jas_malloc(cblk->numpasses * sizeof(jpc_enc_pass_t));
272 assert(cblk->passes);
274 cblk->passes = 0;
276 endpasses = &cblk->passes[cblk->numpasses];
277 for (pass = cblk->passes; pass != endpasses; ++pass) {
280 pass->term = JPC_ISTERMINATED(pass - cblk->passes, 0, cblk->numpasses, (tcmpt->cblksty & JPC_COX_TERMALL) != 0, (tcmpt->cblksty & JPC_COX_LAZY) != 0);
281 pass->type = JPC_SEGTYPE(pass - cblk->passes, 0, (tcmpt->cblksty & JPC_COX_LAZY) != 0);
295 pass = cblk->passes;
310 passtype = (pass - cblk->passes + 2) % 3;
312 passtype = JPC_PASSTYPE(pass - cblk->passes
[all...]
H A Djpc_t2enc.c327 endpasses = &cblk->passes[cblk->numpasses];
414 endpasses = &cblk->passes[cblk->numpasses];
577 cblk->curpass = (cblk->numpasses > 0) ? cblk->passes : 0;
586 endpasses = &cblk->passes[cblk->numpasses];
587 for (pass = cblk->passes; pass != endpasses; ++pass) {
H A Djpc_enc.c1511 int dump_passes(jpc_enc_pass_t *passes, int numpasses, jpc_enc_cblk_t *cblk) argument
1519 pass = passes;
1570 endpasses = &cblk->passes[cblk->numpasses];
1571 pass2 = cblk->passes;
1575 for (pass1 = cblk->passes; pass1 != endpasses; ++pass1) {
1612 for (pass0 = cblk->passes; pass0 != endpasses; ++pass0) {
1614 fprintf(stderr, "pass %02d nmsedec=%lf dec=%lf end=%d %lf\n", pass0 - cblk->passes,
1662 for (passno = 0, pass = cblk->passes; passno <
1741 endpasses = &cblk->passes[cblk->numpasses];
1742 for (pass = cblk->passes; pas
[all...]
H A Djpc_enc.h349 /* The number of passes. */
353 jpc_enc_pass_t *passes; member in struct:__anon2822
355 /* The number of passes encoded so far. */
393 /* The saved number of encoded passes. */
/haiku-fatelf/src/add-ons/translators/icns/openjpeg/
H A Dtcd.c343 cblk->passes = (opj_tcd_pass_t*) opj_calloc(100, sizeof(opj_tcd_pass_t));
383 opj_free(prc->cblks.enc[cblkno].passes);
604 cblk->passes = (opj_tcd_pass_t*) opj_calloc(100, sizeof(opj_tcd_pass_t));
922 layer->len = cblk->passes[n - 1].rate;
925 layer->len = cblk->passes[n - 1].rate - cblk->passes[cblk->numpassesinlayers - 1].rate;
926 layer->data = cblk->data + cblk->passes[cblk->numpassesinlayers - 1].rate;
971 opj_tcd_pass_t *pass = &cblk->passes[passno];
976 dr = pass->rate - cblk->passes[n - 1].rate;
977 dd = pass->distortiondec - cblk->passes[
[all...]
H A Dtcd.h70 int numpasses; /* Number of passes in the layer */
82 opj_tcd_pass_t* passes; /* information about the passes */ member in struct:opj_tcd_cblk_enc
87 int numpassesinlayers; /* number of passes in the layer */
88 int totalpasses; /* total number of passes */
H A Dt2.c208 /* number of coding passes included */
213 opj_tcd_pass_t *pass = &cblk->passes[passno];
229 opj_tcd_pass_t *pass = &cblk->passes[passno];
468 /* number of coding passes */
H A Dt1.c1187 opj_tcd_pass_t *pass = &cblk->passes[passno];
1269 opj_tcd_pass_t *pass = &cblk->passes[passno];
1276 pass->len = pass->rate - (passno == 0 ? 0 : cblk->passes[passno - 1].rate);
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Dprint-weave.c62 stp_pass_t *passes; /* Circular list of pass numbers */ member in struct:stpi_softweave
75 int horizontal_weave; /* Number of horizontal passes required */
78 int vertical_subpasses; /* Number of passes per line (for better */
80 int vmod; /* Number of banks of passes */
131 * neighbouring rows in neighbouring passes, strategy 4 should be optimal,
761 * actually makes it fairly clear how to do this (it requires two passes
762 * with horizontal head movement between passes), and it is presumably
780 * position. However, if we want four passes, we have to effectively print
785 * The current algorithm is not completely general. The number of passes
788 * are a number of routines that are only coded up to 8 passes
1860 int passes; local
1920 int pass, passes, x; local
[all...]
/haiku-fatelf/src/bin/network/wget/src/
H A Dcookies.c773 int passes, passcnt;
781 passes = 1;
785 passes equals the number of dots. */
786 passes = count_char (host, '.');
799 if (++passcnt >= passes)
767 int passes, passcnt; local
/haiku-fatelf/src/libs/print/libgutenprint/src/testpattern/
H A Dtestpattern.c30 * it passes it directly to the dither engine, performing no color,
102 int passes = 0; variable
473 passes++;
543 fprintf(stderr, "%d pass, %d fail, %d skipped\n", passes, failures, skipped);
/haiku-fatelf/src/libs/print/libgutenprint/src/escputil/
H A Descputil.c389 printf(_("Alignment passes must be at least 1."));
1845 critical alignment. You must run all of the passes to correctly align your\n\
1846 printer. After running all the alignment passes, the alignment\n\
1850 After the passes are printed once more, you will be offered the\n\
1889 do_align_help(int passes, int choices) argument
1891 if (passes > 1)
1892 printf(gettext(new_align_help), passes, 1, choices, (choices + 1) / 2, choices); local
2035 "Unable to retrieve number of alignment passes for printer %s\n",
/haiku-fatelf/src/libs/ncurses/include/
H A DCaps309 bit_image_entwining bitwin num Yo - - ----- number of passes for each bit-image row
H A DCaps.aix4309 bit_image_entwining bitwin num Yo - - ----- number of passes for each bit-image row
H A DCaps.hpux11311 bit_image_entwining bitwin num Yo - - ----- number of passes for each bit-image row
H A DCaps.keys311 bit_image_entwining bitwin num Yo - - ----- number of passes for each bit-image row
/haiku-fatelf/src/bin/coreutils/lib/
H A Dvasnprintf.c4810 ISO C 99: the gl_SNPRINTF_DIRECTIVE_N test passes.
/haiku-fatelf/src/libs/print/libgutenprint/scripts/
H A Dltmain.sh1484 -no-suppress do not suppress compiler output for multiple passes
4992 passes="conv dlpreopen link"
5008 passes="conv scan dlopen dlpreopen link"
5010 *) passes="conv"
5014 for pass in $passes; do
/haiku-fatelf/src/bin/sharutils/doc/
H A Dtexinfo.tex4157 % that the text looks ok even though it passes the margin).

Completed in 193 milliseconds

12