Lines Matching full:bval
80 #define BVAL (*edat[BNDX].eval.vint) /* # of childern per parent */
120 "BVAL", {
209 for (j = 0, listp = pinfo->list; j < BVAL; j++, listp++)
405 smp->list = (int *)(Pinfo *) (shmaddr + nodesum) + (BVAL * tval);
406 *smp->list = (tval - 1) / BVAL;
410 for (sibslot = *smp->list * BVAL + 1; listp < smp->list + BVAL;
443 for (i = 1, listp++; i < BVAL; i++, listp++) {
454 while (cldcnt < BVAL) {
502 pslot = (slot - 1) / BVAL; /* calculate parent node */
512 * of processes with Dval depth and Bval breadth. Each parent will spawn
513 * Bval children. Each child will store information about themselves
539 int semval; /* value of semaphore ( equals BVAL initially */
546 for (i = 1; i <= BVAL; i++) {
547 tval = (val * BVAL) + i;
584 else if (pid > 0 && i >= BVAL) { /* PARENT */
586 else if (pid > (pid_t) 0 && i >= BVAL) { /* PARENT */
700 semarg.val = BVAL; /* to fix problem with 4th arg of semctl in 64 bits MARIOG */
728 sizeof(Pinfo) * nodesum + (nodesum * BVAL * sizeof(int)),
729 sizeof(Pinfo) * nodesum + (nodesum * BVAL * sizeof(int)),
734 sizeof(Pinfo) * nodesum + (nodesum * BVAL * sizeof(int)),
766 + (sizeof(int) * BVAL * i)); */
769 (sizeof(int) * BVAL * i));
770 for (j = 0; j < BVAL; j++)
917 BVAL = atoi(optarg);
971 if (BVAL < 2) {
978 /* || BVAL > limits[DVAL])) { */
981 follows:\n\t\tdepth\tbreadth\ttotal\n", sumit(BVAL, DVAL));
1246 dprt("value of BVAL = %d, value of DVAL = %d\n", BVAL, DVAL);
1247 nodesum = sumit(BVAL, DVAL);
