Lines Matching defs:sum
46 long sum; /* sum of childrens indexes plus our own */
165 int n, sum = 1, partial_exp = 1;
168 * The total number of children = sum ( b ** n )
171 * in this simplistic loop, we start sum at 1 (above) to compensate
176 sum += partial_exp;
179 return (sum);
210 info_p->sum = (long)my_index;
421 info_p->sum += info_p->child_ptrs[child]->sum;
423 "thread %d adding child thread %d to sum = %ld",
426 (long int)info_p->sum);
657 tst_resm(TINFO, "The sum of tree (breadth %d, depth %d) is %ld",
658 breadth, depth, child_info[0].sum);