X-Git-Url: http://git.indexdata.com/?p=idzebra-moved-to-github.git;a=blobdiff_plain;f=dict%2Fdrdwr.c;h=a77335fbea7a367b10a963450c1a8df1515f0566;hp=7ec304695aa0d7b2557812777edd4130a6b0207f;hb=6c9fcd3b5d3108702fa1ffc92dab4ab6060f9a19;hpb=1be0464201292e60fc8dcd3b922d9c4c4ac52d41 diff --git a/dict/drdwr.c b/dict/drdwr.c index 7ec3046..a77335f 100644 --- a/dict/drdwr.c +++ b/dict/drdwr.c @@ -1,25 +1,40 @@ -/* - * Copyright (C) 1994, Index Data I/S - * All rights reserved. - * Sebastian Hammer, Adam Dickmeiss - * - * $Log: drdwr.c,v $ - * Revision 1.5 1994-09-01 17:49:38 adam - * Removed stupid line. Work on insertion in dictionary. Not finished yet. - * - */ +/* $Id: drdwr.c,v 1.16 2005-01-15 19:38:21 adam Exp $ + Copyright (C) 1995-2005 + Index Data ApS + +This file is part of the Zebra server. + +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 #include +#ifndef WIN32 #include +#endif #include #include #include #include -#include +#include "dict-p.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) @@ -73,7 +88,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 + yaz_log (YLOG_LOG, "bf_write no=%d offset=%d size=%d", + effective_block, effective_offset, + p->nbytes); +#endif + + } + else + { +#if 0 + yaz_log (YLOG_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 + yaz_log (YLOG_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); } @@ -147,7 +198,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; @@ -158,7 +223,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))) @@ -168,9 +233,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; -#if 1 + p->nbytes = nbytes; +#if 0 printf ("bf_newp of %d:", no); - pr_lru (dbf); + dict_pr_lru (dbf); #endif return 1; }