Lines Matching defs:procs
94 int procs;
103 int create_pipes(int **p, int procs);
104 int create_daemons(int **p, pid_t *pids, int procs, int process_size);
280 create_daemons(int **p, pid_t *pids, int procs, int process_size)
291 handle_scheduler(getpid(), 0, procs-1);
292 for (i = 1; i < procs; ++i) {
298 handle_scheduler(getpid(), i, procs-1);
299 for (j = 0; j < procs; ++j) {
316 read(p[procs-1][0], &msg, sizeof(msg)) != sizeof(msg)) {
320 return procs;
324 create_pipes(int **p, int procs)
331 for (i = 0; i < procs; ++i) {
336 return procs;
343 int procs;
348 pState->p = (int**)malloc(pState->procs * (sizeof(int*) + 2 * sizeof(int)));
349 p = (int*)&pState->p[pState->procs];
350 for (i = 0; i < pState->procs; ++i) {
359 procs = create_pipes(pState->p, pState->procs);
360 if (procs < pState->procs) {
361 debug("procs < pState->procs");
373 for (i = 0; i < ts->procs; ++i) {
393 for (i = 1; pState->pids && i < pState->procs; ++i) {
420 if (++i == ts->procs) {
484 int procs;
488 ts->pids = (pid_t*)malloc(ts->procs * sizeof(pid_t));
491 bzero((void*)ts->pids, ts->procs * sizeof(pid_t));
492 procs = create_daemons(ts->p, ts->pids,
493 ts->procs, ts->process_size);
494 if (procs < ts->procs) {
551 for (i = 1; ts->pids && i < ts->procs; ++i) {
625 if (read(ts->p[ts->procs-1][0], &msg, sizeof(msg)) != sizeof(msg)) {