From owner-svn-src-head@FreeBSD.ORG Thu Oct 16 20:39:03 2008 Return-Path: Delivered-To: svn-src-head@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34]) by hub.freebsd.org (Postfix) with ESMTP id 49E001065687; Thu, 16 Oct 2008 20:39:03 +0000 (UTC) (envelope-from phk@FreeBSD.org) Received: from svn.freebsd.org (svn.freebsd.org [IPv6:2001:4f8:fff6::2c]) by mx1.freebsd.org (Postfix) with ESMTP id 219648FC1C; Thu, 16 Oct 2008 20:39:03 +0000 (UTC) (envelope-from phk@FreeBSD.org) Received: from svn.freebsd.org (localhost [127.0.0.1]) by svn.freebsd.org (8.14.3/8.14.3) with ESMTP id m9GKd34R070053; Thu, 16 Oct 2008 20:39:03 GMT (envelope-from phk@svn.freebsd.org) Received: (from phk@localhost) by svn.freebsd.org (8.14.3/8.14.3/Submit) id m9GKd21b070051; Thu, 16 Oct 2008 20:39:02 GMT (envelope-from phk@svn.freebsd.org) Message-Id: <200810162039.m9GKd21b070051@svn.freebsd.org> From: Poul-Henning Kamp Date: Thu, 16 Oct 2008 20:39:02 +0000 (UTC) To: src-committers@freebsd.org, svn-src-all@freebsd.org, svn-src-head@freebsd.org X-SVN-Group: head MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Cc: Subject: svn commit: r183960 - head/usr.bin/ministat X-BeenThere: svn-src-head@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: SVN commit messages for the src tree for head/-current List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 16 Oct 2008 20:39:03 -0000 Author: phk Date: Thu Oct 16 20:39:02 2008 New Revision: 183960 URL: http://svn.freebsd.org/changeset/base/183960 Log: Make ministat(1) vastly faster on huge datasets. Modified: head/usr.bin/ministat/Makefile head/usr.bin/ministat/ministat.c Modified: head/usr.bin/ministat/Makefile ============================================================================== --- head/usr.bin/ministat/Makefile Thu Oct 16 20:33:03 2008 (r183959) +++ head/usr.bin/ministat/Makefile Thu Oct 16 20:39:02 2008 (r183960) @@ -8,7 +8,7 @@ LDADD= -lm test: ${PROG} ./${PROG} < ${.CURDIR}/chameleon ./${PROG} ${.CURDIR}/chameleon - ./${PROG} ${.CURDIR}/chameleon ${.CURDIR}/iguana - ./${PROG} -c 80 ${.CURDIR}/chameleon ${.CURDIR}/iguana + ./${PROG} ${.CURDIR}/iguana ${.CURDIR}/chameleon + ./${PROG} -c 80 ${.CURDIR}/iguana ${.CURDIR}/chameleon ./${PROG} -s -c 80 ${.CURDIR}/chameleon ${.CURDIR}/iguana ./${PROG} -s -c 80 ${.CURDIR}/chameleon ${.CURDIR}/iguana ${.CURDIR}/iguana Modified: head/usr.bin/ministat/ministat.c ============================================================================== --- head/usr.bin/ministat/ministat.c Thu Oct 16 20:33:03 2008 (r183959) +++ head/usr.bin/ministat/ministat.c Thu Oct 16 20:39:02 2008 (r183960) @@ -131,11 +131,10 @@ double student [NSTUDENT + 1][NCONF] = { #define MAX_DS 8 static char symbol[MAX_DS] = { ' ', 'x', '+', '*', '%', '#', '@', 'O' }; -TAILQ_HEAD(pointlist, point); - struct dataset { char *name; - struct pointlist list; + double *points; + unsigned lpoints; double sy, syy; int n; }; @@ -146,51 +145,39 @@ NewSet(void) struct dataset *ds; ds = calloc(1, sizeof *ds); - TAILQ_INIT(&ds->list); + ds->lpoints = 100000; + ds->points = calloc(sizeof *ds->points, ds->lpoints); return(ds); } -struct point { - TAILQ_ENTRY(point) list; - double val; -}; - static void AddPoint(struct dataset *ds, double a) { - struct point *pp, *pp2; + double *dp; - pp = calloc(1, sizeof *pp); - pp->val = a; - - ds->n++; + if (ds->n >= ds->lpoints) { + dp = ds->points; + ds->lpoints *= 4; + ds->points = calloc(sizeof *ds->points, ds->lpoints); + memcpy(ds->points, dp, sizeof *dp * ds->n); + } + ds->points[ds->n++] = a; ds->sy += a; ds->syy += a * a; - if (TAILQ_EMPTY(&ds->list)) { - TAILQ_INSERT_HEAD(&ds->list, pp, list); - return; - } - TAILQ_FOREACH(pp2, &ds->list, list) { - if (pp->val < pp2->val) { - TAILQ_INSERT_BEFORE(pp2, pp, list); - return; - } - } - TAILQ_INSERT_TAIL(&ds->list, pp, list); } static double Min(struct dataset *ds) { - return (TAILQ_FIRST(&ds->list)->val); + return (ds->points[0]); } static double Max(struct dataset *ds) { - return(TAILQ_LAST(&ds->list, pointlist)->val); + return (ds->points[ds->n -1]); } static double @@ -206,23 +193,7 @@ Median(struct dataset *ds) int even, i; struct point *p1, *p2; - if ((ds->n % 2) == 1) { - i = (ds->n / 2) + 1; - even = 0; - } else { - i = ds->n / 2; - even = 1; - } - TAILQ_FOREACH(p1, &ds->list, list) { - --i; - if (i == 0) - break; - } - if (even) { - p2 = TAILQ_NEXT(p1, list); - return ((p2->val + p1->val) / 2); - } - return (p1->val); + return (ds->points[ds->n / 2]); } static double @@ -346,7 +317,7 @@ PlotSet(struct dataset *ds, int val) { struct plot *pl; struct point *pp; - int i, j, m, x; + int i, j, m, x, n; int bar; pl = &plot; @@ -370,8 +341,8 @@ PlotSet(struct dataset *ds, int val) m = 1; i = -1; j = 0; - TAILQ_FOREACH(pp, &ds->list, list) { - x = (pp->val - pl->x0) / pl->dx; + for (n = 0; n < ds->n; n++) { + x = (ds->points[n] - pl->x0) / pl->dx; if (x == i) { j++; if (j > m) @@ -389,8 +360,8 @@ PlotSet(struct dataset *ds, int val) } pl->height = m; i = -1; - TAILQ_FOREACH(pp, &ds->list, list) { - x = (pp->val - pl->x0) / pl->dx; + for (n = 0; n < ds->n; n++) { + x = (ds->points[n] - pl->x0) / pl->dx; if (x == i) { j++; } else { @@ -463,6 +434,19 @@ DumpPlot(void) putchar('\n'); } +static int +dbl_cmp(const void *a, const void *b) +{ + const double *aa = a; + const double *bb = b; + + if (*aa < *bb) + return (-1); + else if (*aa > *bb) + return (1); + else + return (0); +} static struct dataset * ReadSet(const char *n, int column, const char *delim) @@ -515,6 +499,7 @@ ReadSet(const char *n, int column, const "Dataset %s must contain at least 3 data points\n", n); exit (2); } + qsort(s->points, s->n, sizeof *s->points, dbl_cmp); return (s); }