Lines Matching defs:breadth
62 int breadth = 4;
108 breadth = atoi(optarg);
109 if (breadth <= 0)
161 * Caculate the number of child nodes for a given breadth and depth tree.
241 printf("expecting %d nodes\n", num_nodes(breadth, cdepth));
249 if (node_count == num_nodes(breadth, cdepth)) {
373 /* Create breadth children. */
374 for (child = 0; child < breadth; child++) {
398 for (child = 0; child < breadth; child++) {
438 if (breadth > 1) {
440 for (child = 0; child < breadth; child++) {
454 talk_count == (breadth - 1)) {
486 /* Wait until the breadth - 1 siblings have contacted us. */
494 if (info_p->talk_count < (breadth - 1)) {
547 if ((total = num_nodes(breadth, depth)) > MAXTHREADS) {
567 if ((child_info[ind].threads = malloc(breadth * sizeof(pthread_t))) ==
573 breadth * sizeof(pthread_t));
575 if ((child_info[ind].child_ptrs = malloc(breadth * sizeof(c_info *))) == NULL) {
580 breadth * sizeof(c_info *));
657 tst_resm(TINFO, "The sum of tree (breadth %d, depth %d) is %ld",
658 breadth, depth, child_info[0].sum);