Home | History | Annotate | Download | only in tune

Lines Matching refs:choice

575 struct choice_t  *choice;
629 want_data |= ((choice[i].p->flag & FLAG_NODATA) == 0);
662 s->r = choice[i].r;
663 choice[i].time = speed_measure (choice[i].p->fun, s);
664 choice[i].no_time = (choice[i].time == -1.0);
665 if (! choice[i].no_time)
666 choice[i].time *= choice[i].scale;
668 /* Apply the effect of CMP_DIFFPREV, but the new choice[i].prev_time
672 t = choice[i].time;
675 if (choice[i].prev_time == -1.0)
676 choice[i].no_time = 1;
678 choice[i].time = choice[i].time - choice[i].prev_time;
680 choice[i].prev_time = t;
683 if (choice[i].no_time)
689 if (num_choices > 1 && (fastest == -1 || choice[i].time < fastest_time))
692 fastest_time = choice[i].time;
699 choice[i].time /= speed_cycletime;
703 choice[i].time /= speed_cycletime;
705 choice[i].time /= (speed_cycletime
713 choice[i].time /= speed_cycletime;
715 choice[i].time /= (speed_cycletime * SIZE_TO_DIVISOR(s->size));
720 if (choice[0].no_time || choice[0].time == 0.0)
721 choice[i].no_time = 1;
723 choice[i].time /= choice[0].time;
727 if (choice[0].no_time)
729 choice[i].no_time = 1;
732 choice[i].time -= choice[0].time;
752 choice[i].no_time ? 0.0
754 : choice[i].time);
766 if (choice[i].no_time)
781 decimals, choice[i].time, first_close);
912 fprintf (fp, " title \"%s\"", choice[i].name);
1038 "Choice %s bad: doesn't take a \".<r>\" parameter\n",
1055 "Choice %s bad: needs a \".<r>\" parameter\n",
1066 fprintf (stderr, "Choice %s unrecognised\n", s_orig);
1323 choice = (struct choice_t *) (*__gmp_allocate_func)
1324 ((argc - optind) * sizeof(choice[0]));
1329 choice[num_choices] = c;
1366 printf (" %*s", COLUMN_WIDTH, choice[i].name);