Lines Matching refs:child
129 fprintf(stderr, "\t-b <num>\tbreadth of child nodes\n");
130 fprintf(stderr, "\t-d <num>\tdepth of child nodes\n");
132 "\t-t <num>\ttimeout for child communication (in minutes)\n");
142 * Caculate the number of child nodes for a given breadth and depth tree.
166 * Register the child with the parent and then wait for all of the children
323 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",
350 printf("root child\n");
383 for (child = 0; child < breadth; child++) {
385 printf("thread %d making child %d, ptr=%p\n",
386 my_index, child,
387 &(info_p->threads[child]));
391 pthread_create(&(info_p->threads[child]), &attr,
400 &(info_p->threads[child]));
415 for (child = 0; child < breadth; child++) {
418 &(info_p->threads[child]));
422 pthread_join((info_p->threads[child]), &status))) {
432 printf("thread %d joined child %d ok\n",
433 my_index, child);
453 for (child = 0; child < breadth; child++) {
457 if (parent->child_ptrs[child] != info_p) {
466 child_ptrs[child]->
468 if (++parent->child_ptrs[child]->
479 child_ptrs[child]->
496 [child]->
637 printf("Successfully initialized child %d.\n", ind);
676 * Wait for the root child to exit.
