Lines Matching defs:child
148 fprintf(stderr, "\t-b <num>\tbreadth of child nodes\n");
149 fprintf(stderr, "\t-d <num>\tdepth of child nodes\n");
151 "\t-t <num>\ttimeout for child communication (in minutes)\n");
161 * Caculate the number of child nodes for a given breadth and depth tree.
185 * Register the child with the parent and then wait for all of the children
325 int rc, child, my_index;
335 printf("non-root child calling synchronize_children\n");
340 printf("non-root child has been assigned index %d\n",
348 printf("root child\n");
374 for (child = 0; child < breadth; child++) {
376 pthread_create(&(info_p->threads[child]), &attr,
385 &(info_p->threads[child]));
398 for (child = 0; child < breadth; child++) {
401 &(info_p->threads[child]));
405 pthread_join((info_p->threads[child]), &status))) {
415 printf("thread %d joined child %d ok\n",
416 my_index, child);
421 info_p->sum += info_p->child_ptrs[child]->sum;
423 "thread %d adding child thread %d to sum = %ld",
425 info_p->child_ptrs[child]->index,
440 for (child = 0; child < breadth; child++) {
442 if (parent->child_ptrs[child] != info_p) {
451 child_ptrs[child]->
453 if (++parent->child_ptrs[child]->
464 child_ptrs[child]->
481 [child]->
611 printf("Successfully initialized child %d.\n", ind);
646 /* Wait for the root child to exit. */