X-Git-Url: http://sru.miketaylor.org.uk/?a=blobdiff_plain;f=rset%2Frset.c;h=d37203f0d374852e242ad8a7cfbeadd29dc7ade4;hb=863d336f803da454e03f39ee2225719fed05021e;hp=667bd1d98de2471d1891d5217f3e7e17a3c5438f;hpb=affd7e4168d70b94e015b777748b7eca1cd00ec0;p=idzebra-moved-to-github.git

diff --git a/rset/rset.c b/rset/rset.c
index 667bd1d..d37203f 100644
--- a/rset/rset.c
+++ b/rset/rset.c
@@ -1,34 +1,94 @@
-/*
- * Copyright (C) 1994, Index Data I/S 
- * All rights reserved.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Log: rset.c,v $
- * Revision 1.1  1994-11-04 13:21:28  quinn
- * Working.
- *
- */
+/* $Id: rset.c,v 1.25 2004-08-20 14:44:46 heikki Exp $
+   Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
+   Index Data Aps
 
-/* TODO: mem management */
+This file is part of the Zebra server.
 
-#include <util.h>
+Zebra is free software; you can redistribute it and/or modify it under
+the terms of the GNU General Public License as published by the Free
+Software Foundation; either version 2, or (at your option) any later
+version.
+
+Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
+WARRANTY; without even the implied warranty of MERCHANTABILITY or
+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.
+*/
+
+
+
+#include <stdio.h>
+#include <string.h>
+#include <zebrautl.h>
+#include <assert.h>
 
 #include <rset.h>
+/* #include <../index/index.h> */ /* for log_keydump. Debugging only */
+
+RSET rset_create(const struct rset_control *sel, void *parms)
+{
+    RSET rnew;
 
-RSET rset_create(const rset_control *sel, void *parms)
+    logf (LOG_DEBUG, "rs_create(%s)", sel->desc);
+    rnew = (RSET) xmalloc(sizeof(*rnew));
+    rnew->control = sel;
+    rnew->flags = 0;
+    rnew->count = 1;
+    rnew->buf = (*sel->f_create)(rnew, sel, parms);
+    return rnew;
+}
+
+void rset_delete (RSET rs)
 {
-    RSET new;
+    (rs->count)--;
+    if (!rs->count)
+    {
+        (*rs->control->f_delete)(rs);
+        xfree(rs);
+    }
+}
 
-    new = xmalloc(sizeof(*new));     /* make dynamic alloc scheme */
-    if (!(new->control = (*sel->f_create)(sel, parms)))
-    	return 0;
-    return new;
+RSET rset_dup (RSET rs)
+{
+    (rs->count)++;
+    return rs;
 }
 
-void rset_delete(RSET rs)
+void rset_default_pos (RSFD rfd, double *current, double *total)
+{ /* This should never really be needed, but it is still used in */
+  /* those rsets that we don't really plan to use, like isam-s */
+    assert(rfd);
+    assert(current);
+    assert(total);
+    *current=-1; /* signal that pos is not implemented */
+    *total=-1;
+} /* rset_default_pos */
+
+int rset_default_forward(RSET ct, RSFD rfd, void *buf, 
+                           int (*cmpfunc)(const void *p1, const void *p2), 
+                           const void *untilbuf)
 {
-    if (rs->is_open)
-    	rset_close(rs);
-    (*rs->control->f_delete)(rs->control);
-    xfree(rs);
+    int more=1;
+    int cmp=2;
+    logf (LOG_DEBUG, "rset_default_forward starting '%s' (ct=%p rfd=%p)",
+                    ct->control->desc, ct,rfd);
+    /* key_logdump(LOG_DEBUG, untilbuf); */
+    while ( (cmp==2) && (more))
+    {
+        logf (LOG_DEBUG, "rset_default_forward looping m=%d c=%d",more,cmp);
+        more=rset_read(ct, rfd, buf);
+        if (more)
+            cmp=(*cmpfunc)(untilbuf,buf);
+/*        if (more)
+            key_logdump(LOG_DEBUG,buf); */
+    }
+    logf (LOG_DEBUG, "rset_default_forward exiting m=%d c=%d",more,cmp);
+
+    return more;
 }
+