Home
last modified time | relevance | path

Searched refs:stages (Results 1 – 4 of 4) sorted by relevance

/xnu-12377.1.9/tools/tests/affinity/
H A Dsets.c343 int stages = 2; in main() local
371 stages = atoi(optarg); in main()
372 if (stages >= WORKERS_MAX) { in main()
406 threads = sets * stages; in main()
409 sets, s_if_plural(sets), stages, affinity? "": "no ", in main()
426 stage_info = (stage_info_t *) malloc(sets * stages * sizeof(stage_info_t)); in main()
437 for (j = 0; j < stages; j++) { in main()
438 sp = &stage_info[(i * stages) + j]; in main()
452 for (j = 0; j < stages; j++) { in main()
462 sp->output = &lp->stage[(j + 1) % stages]->bufq; in main()
[all …]
H A Dpool.c319 int stages = 2; in main() local
344 stages = atoi(optarg); in main()
345 if (stages >= WORKERS_MAX) { in main()
379 threads = consumers * (stages - 1) + producers; in main()
383 stages - 1, s_if_plural(stages - 1), in main()
402 stage_info = (stage_info_t *) malloc(stages * sizeof(stage_info_t)); in main()
406 for (i = 0; i < stages; i++) { in main()
421 sp->output = &stage_info[(i + 1) % stages].bufq; in main()
456 for (i = 1; i < stages; i++) { in main()
/xnu-12377.1.9/tests/unit/
H A Dpanic_path_test.c73 STAILQ_HEAD(, kdp_output_stage) stages;
84 STAILQ_INIT(&stages);
85 STAILQ_INSERT_HEAD(&stages, &stage1, kos_next);
86 STAILQ_INSERT_TAIL(&stages, &stage2, kos_next);
/xnu-12377.1.9/makedefs/
H A DMakeInc.top23 # races, these aggregating stages for