Lines Matching defs:done

244                done;            /* Connection closed */
322 int done = 0; /* number of requests we have done */
323 int doneka = 0; /* number of keep alive connections done */
377 if (done)
378 printf("Total of %d requests completed\n" , done);
391 if (done)
392 printf("Total of %d requests completed\n" , done);
836 printf("Complete requests: %d\n", done);
854 if (timetaken && done) {
856 (double) done / timetaken);
858 (double) concurrency * timetaken * 1000 / done);
860 (double) timetaken * 1000 / done);
871 if (done > 0) {
882 for (i = 0; i < done; i++) {
899 meancon = totalcon / done;
900 meantot = total / done;
901 meand = totald / done;
902 meanwait = totalwait / done;
905 for (i = 0; i < done; i++) {
918 sdtot = (done > 1) ? sqrt(sdtot / (done - 1)) : 0;
919 sdcon = (done > 1) ? sqrt(sdcon / (done - 1)) : 0;
920 sdd = (done > 1) ? sqrt(sdd / (done - 1)) : 0;
921 sdwait = (done > 1) ? sqrt(sdwait / (done - 1)) : 0;
928 qsort(stats, done, sizeof(struct data),
930 if ((done > 1) && (done % 2))
931 mediancon = (stats[done / 2].ctime + stats[done / 2 + 1].ctime) / 2;
933 mediancon = stats[done / 2].ctime;
935 qsort(stats, done, sizeof(struct data),
937 if ((done > 1) && (done % 2))
938 mediand = (stats[done / 2].time + stats[done / 2 + 1].time \
939 -stats[done / 2].ctime - stats[done / 2 + 1].ctime) / 2;
941 mediand = stats[done / 2].time - stats[done / 2].ctime;
943 qsort(stats, done, sizeof(struct data),
945 if ((done > 1) && (done % 2))
946 medianwait = (stats[done / 2].waittime + stats[done / 2 + 1].waittime) / 2;
948 medianwait = stats[done / 2].waittime;
950 qsort(stats, done, sizeof(struct data),
952 if ((done > 1) && (done % 2))
953 mediantot = (stats[done / 2].time + stats[done / 2 + 1].time) / 2;
955 mediantot = stats[done / 2].time;
1023 if (percentile && (done > 1)) {
1030 ap_round_ms(stats[done - 1].time));
1033 ap_round_ms(stats[(unsigned long)done * percs[i] / 100].time));
1048 t = ap_double_ms(stats[done - 1].time);
1050 t = ap_double_ms(stats[(unsigned long) (0.5 + (double)done * i / 100.0)].time);
1063 for (i = 0; i < done; i++) {
1120 trstring, tdstring, tdstring, done);
1151 trstring, tdstring, tdstring, (double) done / timetaken);
1173 for (i = 0; i < done; i++) {
1192 if (done > 0) { /* avoid division by zero (if 0 done) */
1201 trstring, tdstring, tdstring, mincon, tdstring, totalcon / done, tdstring, maxcon);
1207 (total / done) - (totalcon / done), tdstring, maxtot - maxcon);
1212 trstring, tdstring, tdstring, mintot, tdstring, total / done, tdstring, maxtot);
1360 if (done < requests) {
1361 struct data *s = &stats[done++];
1362 c->done = lasttime = apr_time_now();
1365 s->time = ap_max(0, c->done - c->start);
1367 if (heartbeatres && !(done % heartbeatres)) {
1368 fprintf(stderr, "Completed %d requests\n", done);
1628 if (done < requests) {
1629 struct data *s = &stats[done++];
1631 c->done = apr_time_now();
1634 s->time = ap_max(0, c->done - c->start);
1636 if (heartbeatres && !(done % heartbeatres)) {
1637 fprintf(stderr, "Completed %d requests\n", done);
1783 /* This only needs to be done once */
1857 * connection is done and we loop here endlessly calling
1910 } while (lasttime < stoptime && done < requests);
1913 fprintf(stderr, "Finished %d requests\n", done);
1915 printf("..done\n");