Added LICENSE.

[idzebra-moved-to-github.git] / dict / drdwr.c

diff --git a/dict/drdwr.c b/dict/drdwr.c
index 8a02d15..23ba730 100644 (file)
--- a/dict/drdwr.c
+++ b/dict/drdwr.c
@@ -1,10 +1,28 @@
 /*
- * Copyright (C) 1994, Index Data I/S 
+ * Copyright (C) 1994-1999, Index Data
  * All rights reserved.
  * Sebastian Hammer, Adam Dickmeiss
  *
  * $Log: drdwr.c,v $
- * Revision 1.6  1994-09-06 13:05:14  adam
+ * Revision 1.12  1999-05-18 20:00:33  adam
+ * Minor fix.
+ *
+ * Revision 1.11  1999/05/15 14:36:37  adam
+ * Updated dictionary. Implemented "compression" of dictionary.
+ *
+ * Revision 1.10  1999/02/02 14:50:21  adam
+ * Updated WIN32 code specific sections. Changed header.
+ *
+ * Revision 1.9  1997/09/09 13:38:01  adam
+ * Partial port to WIN95/NT.
+ *
+ * Revision 1.8  1995/01/24 11:25:11  adam
+ * Removed stupid assertion.
+ *
+ * Revision 1.7  1994/10/05  10:47:15  adam
+ * Function pr_lru is non-static now. No warning no more.
+ *
+ * Revision 1.6  1994/09/06  13:05:14  adam
  * Further development of insertion. Some special cases are
  * not properly handled yet! assert(0) are put here. The
  * binary search in each page definitely reduce usr CPU.
@@ -16,7 +34,9 @@
 
 #include <sys/types.h>
 #include <fcntl.h>
+#ifndef WIN32
 #include <unistd.h>
+#endif
 #include <string.h>
 #include <stdio.h>
 #include <stdlib.h>
@@ -24,7 +44,7 @@
 
 #include <dict.h>
 
-static void pr_lru (Dict_BFile bf)
+void dict_pr_lru (Dict_BFile bf)
 {
     struct Dict_file_block *p;
     for (p=bf->lru_back; p; p = p->lru_next)
@@ -78,7 +98,43 @@ void dict_bf_flush_blocks (Dict_BFile bf, int no_to_flush)
         p = bf->lru_back;
         if (p->dirty)
         {
-            bf_write (bf->bf, p->no, 0, 0, p->data);
+           if (!bf->compact_flag)
+               bf_write (bf->bf, p->no, 0, 0, p->data);
+           else
+           {
+               int effective_block = p->no / bf->block_size;
+               int effective_offset = p->no -
+                   effective_block * bf->block_size;
+               int remain = bf->block_size - effective_offset;
+
+               if (remain >= p->nbytes)
+               {
+                   bf_write (bf->bf, effective_block, effective_offset,
+                             p->nbytes, p->data);
+#if 0
+                   logf (LOG_LOG, "bf_write no=%d offset=%d size=%d",
+                         effective_block, effective_offset,
+                         p->nbytes);
+#endif
+                         
+               }
+               else
+               {
+#if 0
+                   logf (LOG_LOG, "bf_write1 no=%d offset=%d size=%d",
+                         effective_block, effective_offset,
+                         remain);
+#endif
+                   bf_write (bf->bf, effective_block, effective_offset,
+                             remain, p->data);
+#if 0
+                   logf (LOG_LOG, "bf_write2 no=%d offset=%d size=%d",
+                         effective_block+1, 0, p->nbytes - remain);
+#endif
+                   bf_write (bf->bf, effective_block+1, 0,
+                             p->nbytes - remain, (char*)p->data + remain);
+               }
+           }
         }
         release_block (bf, p);
     }
@@ -143,7 +199,6 @@ int dict_bf_readp (Dict_BFile bf, int no, void **bufp)
 {
     struct Dict_file_block *p;
     int i;
-    assert (no < 1000);
     if ((p = find_block (bf, no)))
     {
         *bufp = p->data;
@@ -153,7 +208,21 @@ int dict_bf_readp (Dict_BFile bf, int no, void **bufp)
     }
     bf->misses++;
     p = alloc_block (bf, no);
-    i = bf_read (bf->bf, no, 0, 0, p->data);
+
+    if (!bf->compact_flag)
+       i = bf_read (bf->bf, no, 0, 0, p->data);
+    else
+    {
+       int effective_block = no / bf->block_size;
+       int effective_offset = no - effective_block * bf->block_size;
+
+       i = bf_read (bf->bf, effective_block, effective_offset,
+                    bf->block_size - effective_offset, p->data);
+       if (i > 0 && effective_offset > 0)
+           i = bf_read (bf->bf, effective_block+1, 0, effective_offset,
+                        (char*) p->data + bf->block_size - effective_offset);
+       i = 1;
+    }
     if (i > 0)
     {
         *bufp = p->data;
@@ -164,7 +233,7 @@ int dict_bf_readp (Dict_BFile bf, int no, void **bufp)
     return i;
 }
 
-int dict_bf_newp (Dict_BFile dbf, int no, void **bufp)
+int dict_bf_newp (Dict_BFile dbf, int no, void **bufp, int nbytes)
 {
     struct Dict_file_block *p;
     if (!(p = find_block (dbf, no)))
@@ -174,9 +243,10 @@ int dict_bf_newp (Dict_BFile dbf, int no, void **bufp)
     *bufp = p->data;
     memset (p->data, 0, dbf->block_size);
     p->dirty = 1;
+    p->nbytes = nbytes;
 #if 0
     printf ("bf_newp of %d:", no);
-    pr_lru (dbf);
+    dict_pr_lru (dbf);
 #endif
     return 1;
 }