X-Git-Url: http://git.indexdata.com/?p=idzebra-moved-to-github.git;a=blobdiff_plain;f=isamb%2Ftstisamb.c;h=be9823d3aa9ae95f45655fb9492a26e51863f6a6;hp=1a75c5d03e8ccf8a451053393c11145536463bf6;hb=89d3a004b7c651fd5673abfc192e1472dc4d4197;hpb=0efbb49dac8beff78bd761fd2da9e18e54797526 diff --git a/isamb/tstisamb.c b/isamb/tstisamb.c index 1a75c5d..be9823d 100644 --- a/isamb/tstisamb.c +++ b/isamb/tstisamb.c @@ -1,5 +1,5 @@ -/* $Id: tstisamb.c,v 1.21 2005-04-14 07:48:57 adam Exp $ - Copyright (C) 1995-2005 +/* $Id: tstisamb.c,v 1.28 2007-01-15 15:10:17 adam Exp $ + Copyright (C) 1995-2007 Index Data ApS This file is part of the Zebra server. @@ -15,11 +15,18 @@ FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with Zebra; see the file LICENSE.zebra. If not, write to the -Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA -02111-1307, USA. +along with this program; if not, write to the Free Software +Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + */ +#if HAVE_SYS_TIMES_H +#include +#endif +#if HAVE_SYS_TIME_H +#include +#endif + #include #include #include @@ -27,16 +34,18 @@ Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA #include #include +static int log_level = 0; + static void log_item(int level, const void *b, const char *txt) { int x; memcpy(&x, b, sizeof(int)); - yaz_log(YLOG_DEBUG, "%s %d", txt, x); + yaz_log(log_level, "%s %d", txt, x); } static void log_pr(const char *txt) { - yaz_log(YLOG_DEBUG, "%s", txt); + yaz_log(log_level, "%s", txt); } int compare_item(const void *a, const void *b) @@ -52,7 +61,7 @@ int compare_item(const void *a, const void *b) return 0; } -void *code_start() +void *code_start(void) { return 0; } @@ -72,8 +81,10 @@ void code_stop(void *p) } struct read_info { - int no; + int val; int step; + + int no; int max; int insertMode; }; @@ -85,12 +96,18 @@ int code_read(void *vp, char **dst, int *insertMode) if (ri->no >= ri->max) return 0; - x = ri->no; + ri->no++; + + x = ri->val; memcpy (*dst, &x, sizeof(int)); (*dst)+=sizeof(int); - ri->no = ri->no + ri->step; + ri->val = ri->val + ri->step; *insertMode = ri->insertMode; + +#if 0 + yaz_log(log_level, "%d %5d", ri->insertMode, x); +#endif return 1; } @@ -100,13 +117,15 @@ void tst_insert(ISAMB isb, int n) ISAM_P isamc_p; struct read_info ri; ISAMB_PP pp; - char key_buf[10]; + char key_buf[20]; int nerrs = 0; /* insert a number of entries */ ri.no = 0; - ri.step = 1; ri.max = n; + + ri.val = 0; + ri.step = 1; ri.insertMode = 1; isamc_i.clientData = &ri; @@ -118,26 +137,26 @@ void tst_insert(ISAMB isb, int n) /* read the entries */ pp = isamb_pp_open (isb, isamc_p, 1); - ri.no = 0; + ri.val = 0; while(isamb_pp_read (pp, key_buf)) { int x; memcpy (&x, key_buf, sizeof(int)); - if (x != ri.no) + if (x != ri.val) { yaz_log(YLOG_WARN, "isamb_pp_read. n=%d Got %d (expected %d)", - n, x, ri.no); + n, x, ri.val); nerrs++; } else if (nerrs) - yaz_log(YLOG_LOG, "isamb_pp_read. n=%d Got %d", + yaz_log(log_level, "isamb_pp_read. n=%d Got %d", n, x); - ri.no++; + ri.val++; } - if (ri.no != ri.max) + if (ri.val != ri.max) { - yaz_log(YLOG_WARN, "ri.max != ri.max (%d != %d)", ri.no, ri.max); + yaz_log(YLOG_WARN, "ri.max != ri.max (%d != %d)", ri.val, ri.max); nerrs++; } isamb_dump(isb, isamc_p, log_pr); @@ -147,8 +166,10 @@ void tst_insert(ISAMB isb, int n) exit(3); /* delete a number of entries (even ones) */ ri.no = 0; + ri.max = n - n/2; + + ri.val = 0; ri.step = 2; - ri.max = n; ri.insertMode = 0; isamc_i.clientData = &ri; @@ -157,9 +178,11 @@ void tst_insert(ISAMB isb, int n) isamb_merge (isb, &isamc_p , &isamc_i); /* delete a number of entries (odd ones) */ - ri.no = 1; + ri.no = 0; + ri.max = n/2; + + ri.val = 1; ri.step = 2; - ri.max = n; ri.insertMode = 0; isamc_i.clientData = &ri; @@ -169,7 +192,8 @@ void tst_insert(ISAMB isb, int n) if (isamc_p) { - yaz_log(YLOG_WARN, "isamb_merge did not return empty list"); + yaz_log(YLOG_WARN, "isamb_merge did not return empty list n=%d", + n); exit(3); } } @@ -183,9 +207,11 @@ void tst_forward(ISAMB isb, int n) ISAMB_PP pp; /* insert a number of entries */ + ri.val = 0; + ri.max = n; + ri.no = 0; ri.step = 1; - ri.max = n; ri.insertMode = 1; isamc_i.clientData = &ri; @@ -239,16 +265,20 @@ void tst_x(ISAMB isb) isamc_i.clientData = &ri; isamc_i.read_item = code_read; - ri.no = 1000; + ri.no = 0; + ri.max = 500; + + ri.val = 1000; ri.step = 1; - ri.max = 1500; ri.insertMode = 1; isamb_merge (isb, &isamb_p , &isamc_i); - ri.no = 1; - ri.step = 1; + ri.no = 0; ri.max = 500; + + ri.val = 1; + ri.step = 1; ri.insertMode = 1; isamb_merge (isb, &isamb_p , &isamc_i); @@ -266,8 +296,10 @@ void tst_append(ISAMB isb, int n) { /* insert a number of entries */ ri.no = 0; - ri.step = 1; ri.max = i + chunk; + + ri.val = 0; + ri.step = 1; ri.insertMode = 1; isamc_i.clientData = &ri; @@ -277,6 +309,227 @@ void tst_append(ISAMB isb, int n) } } + +struct random_read_info { + int max; + int idx; + int level; + int *delta; +}; + +int tst_random_read(void *vp, char **dst, int *insertMode) +{ + struct random_read_info *ri = (struct random_read_info *)vp; + int x; + + while(ri->idx < ri->max && ri->delta[ri->idx] == ri->level) + { + ri->idx++; + ri->level = 0; + } + if (ri->idx >= ri->max) + return 0; + + if (ri->delta[ri->idx] > 0) + { + ri->level++; + *insertMode = 1; + } + else + { + ri->level--; + *insertMode = 0; + } + x = ri->idx; + memcpy (*dst, &x, sizeof(int)); + (*dst)+=sizeof(int); + + yaz_log(YLOG_DEBUG, "%d %5d", *insertMode, x); + return 1; +} + +void tst_random(ISAMB isb, int n, int rounds, int max_dups) +{ + ISAM_P isamb_p = 0; + + int *freq = malloc(sizeof(int) * n); + int *delta = malloc(sizeof(int) * n); + int i, j; + for (i = 0; i