source: trunk/gsdl/src/mgpp/text/text.pass1.cpp@ 879

/**************************************************************************
 *
 * text.pass1.cpp -- Text compression (Pass 1)
 * Copyright (C) 1994  Neil Sharman, Gary Eddy and Alistair Moffat
 * Copyright (C) 1999  Rodger McNab
 *
 * This program 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 of the License, or
 * (at your option) any later version.
 *
 * This program 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 this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * $Id: text.pass1.cpp 856 2000-01-14 02:26:25Z sjboddie $
 *
 **************************************************************************/

#include "sysfuncs.h"

#include "memlib.h"
#include "messages.h"
#include "huffman.h"
#include "netorder.h"  /* [RPAP - Jan 97: Endian Ordering] */


#include "mg_files.h"
#include "mg.h"
#include "build.h"
#include "locallib.h"
#include "words.h"
#include "text.h"
#include "hash.h"
#include "local_strings.h"

#include "TextEl.h"


/*
   $Log$
   Revision 1.1  2000/01/14 02:26:23  sjboddie
   Rodgers new C++ mg

   Revision 1.1  1999/10/11 02:58:37  cs025
   Base install of MG-PP

   Revision 1.1  1999/08/10 21:18:25  sjboddie
   renamed mg-1.3d directory mg

   Revision 1.2  1998/12/17 09:12:54  rjmcnab

   Altered mg to process utf-8 encoded Unicode. The main changes
   are in the parsing of the input, the casefolding, and the stemming.

   Revision 1.1  1998/11/17 09:35:46  rjmcnab
   *** empty log message ***

   * Revision 1.4  1994/11/25  03:47:47  tes
   * Committing files before adding the merge stuff.
   *
   * Revision 1.3  1994/10/20  03:57:09  tes
   * I have rewritten the boolean query optimiser and abstracted out the
   * components of the boolean query.
   *
   * Revision 1.2  1994/09/20  04:42:13  tes
   * For version 1.1
   *
 */


#define POOL_SIZE 1024*1024
#define INITIAL_HASH_SIZE 7927







typedef struct hash_rec
  {
    unsigned long wcnt;     /* word frequency */
    unsigned long occurance_num;
    u_char *word;
  }
hash_rec;

typedef struct dict_data
  {
    hash_rec *HashTable;
    unsigned long HashSize;
    unsigned long HashUsed;
    unsigned long wordnum;
    unsigned long words_read;
    unsigned long bytes_diff;
    huff_data hd;
  }
dict_data;



static unsigned long longestDoc = 0;
static unsigned long occurance_num = 0;
static dict_data DictData[2];

static u_char *Pool;
static int PoolLeft;
static double inputbytes = 0; /* [RJM 07/97: 4G limit] */
static unsigned long MaxMemInUse = 0;
static unsigned long MemInUse = 0;
static compression_stats_header csh = {0, 0, 0.0}; /* [RJM 07/97: 4G limit] */


static void ChangeMem (int Change) {
  MemInUse += Change;
  if (MemInUse > MaxMemInUse) MaxMemInUse = MemInUse;
}


int init_text_1 (const TagInfo &/*tagInfo*/, char * /*FileName*/) {
  int which;
  
  if (!(Pool = (u_char *) Xmalloc (POOL_SIZE))) {
    Message ("Unable to allocate memory for pool");
    return (COMPERROR);
  }
  PoolLeft = POOL_SIZE;
  ChangeMem (POOL_SIZE);
  
  for (which = 1; which >= 0; which--) {
    u_char *word;
    hash_rec *ent;
    dict_data *dd = &DictData[which];
    
    dd->wordnum = 0;
    dd->words_read = 0;
    dd->bytes_diff = 0;
    dd->HashSize = INITIAL_HASH_SIZE;
    dd->HashUsed = 0;
    
    if (!(dd->HashTable = (hash_rec *) Xmalloc (sizeof (hash_rec) * dd->HashSize))) {
      Message ("Unable to allocate memory for table");
      return (COMPERROR);
    }
    ChangeMem (sizeof (hash_rec) * dd->HashSize);
    bzero ((char *) (dd->HashTable), sizeof (hash_rec) * dd->HashSize);

    word = Pool;
    *Pool++ = '\0';
    PoolLeft--;
    {
      register u_char *wptr;
      register int hsize = dd->HashSize;
      register unsigned long hashval, step;
      
      HASH (hashval, step, word, hsize);
      wptr = (dd->HashTable + hashval)->word;
      while (wptr) {
    hashval += step;
    if (hashval >= (unsigned long)hsize)
      hashval -= hsize;
    wptr = (dd->HashTable + hashval)->word;
      }
      ent = dd->HashTable + hashval;
    }
    ent->wcnt = 1;
    ent->word = word;
    dd->HashUsed = 1;
  }
  return (COMPALLOK);
}


static int process_text_element (const u_char *s_in, int l_in) {
  const u_char *end = s_in + l_in - 1;
  
   /*
   ** Alternately parse off words and non-words from the input
   ** stream beginning with a non-word. Each token is then
   ** inserted into the set if it does not exist or has it's
   ** frequency count incremented if it does.
   */
  
  bool which = false; // non-word
  for (; s_in <= end; which = !which) {
    u_char Word[MAXWORDLEN + 1];
    dict_data *dd = &DictData[which];
    
    /* First parse a word or non-word out of the string */
    if (which) PARSE_WORD (Word, s_in, end);
    else PARSE_NON_WORD (Word, s_in, end);
    
    dd->wordnum++;
    inputbytes += *Word;
    dd->words_read++;
    
    /* Search the hash table for Word */
    {
      register unsigned long hashval, step;
      register int hsize = dd->HashSize;
      HASH (hashval, step, Word, hsize);
      for (;;) {
    register u_char *s1;
    register u_char *s2;
    register int len;
    register hash_rec *ent;
    ent = dd->HashTable + hashval;
    if (!ent->word) {
      int len = *Word + 1;
      if (len > PoolLeft) {
        if (!(Pool = (u_char *) Xmalloc (POOL_SIZE))) {
          Message ("Unable to allocate memory for pool");
          return (COMPERROR);
        }
        PoolLeft = POOL_SIZE;
        ChangeMem (POOL_SIZE);
      }
      ent->occurance_num = occurance_num++;
      ent->wcnt = 1;
      ent->word = Pool;
      memcpy (Pool, Word, len);
      Pool += len;
      PoolLeft -= len;
      dd->HashUsed++;
      dd->bytes_diff += Word[0];
      break;
    }
    
    /* Compare the words */
    s1 = Word;
    s2 = ent->word;
    len = *s1 + 1;
    for (; len; len--)
      if (*s1++ != *s2++) break;
    
    if (len) {
      hashval = (hashval + step);
      if (hashval >= (unsigned long)hsize) hashval -= hsize;
    } else {
      ent->wcnt++;
      break;
    }
      }
    }

    
    if (dd->HashUsed >= dd->HashSize >> 1) {
      hash_rec *ht;
      unsigned long size;
      unsigned long i;
      size = prime (dd->HashSize * 2);
      if (!(ht = (hash_rec *) Xmalloc (sizeof (hash_rec) * size))) {
    Message ("Unable to allocate memory for table");
    return (COMPERROR);
      }
      ChangeMem (sizeof (hash_rec) * size);
      bzero ((char *) ht, sizeof (hash_rec) * size);

      for (i = 0; i < dd->HashSize; i++)
    if (dd->HashTable[i].word) {
      register u_char *wptr;
      register unsigned long hashval, step;
      
      wptr = dd->HashTable[i].word;
      HASH (hashval, step, wptr, size);
      wptr = (ht + hashval)->word;
      while (wptr) {
        hashval += step;
        if (hashval >= size) hashval -= size;
        wptr = (ht + hashval)->word;
      }
      ht[hashval] = dd->HashTable[i];
    }
      Xfree (dd->HashTable);
      ChangeMem (-sizeof (hash_rec) * dd->HashSize);
      dd->HashTable = ht;
      dd->HashSize = size;
    }
  }

  return COMPALLOK;
}


int process_text_1 (const TagInfo &/*tagInfo*/, const TextElArray &doc) {
  unsigned long textLen = 0;
  unsigned long docLen = 0;
  int retValue;

  // process each text element in this document
  TextElArray::const_iterator here = doc.begin();
  TextElArray::const_iterator end = doc.end();
  while (here != end) {
    textLen = (*here).text.size();
    docLen += textLen;

    retValue = process_text_element ((*here).text.begin(), textLen);
    if (retValue != COMPALLOK) return retValue;
    
    here++;
  }

  // get max document length
  if (docLen > longestDoc) longestDoc = docLen;

  // update header information
  csh.num_docs++;
  csh.num_bytes += docLen;
  
  return COMPALLOK;
}


static int PackHashTable (dict_data * dd) {
  int s, d;
  for (s = d = 0; (unsigned int)s < dd->HashSize; s++)
    if (dd->HashTable[s].word)
      dd->HashTable[d++] = dd->HashTable[s];
  
  ChangeMem (-sizeof (hash_rec) * dd->HashSize);
  ChangeMem (sizeof (hash_rec) * dd->HashUsed);
  
  if (!(dd->HashTable = (hash_rec *) Xrealloc (dd->HashTable,
               sizeof (hash_rec) * dd->HashUsed))) {
    Message ("Out of memory");
    return COMPERROR;
  }
  dd->HashSize = dd->HashUsed;
  return COMPALLOK;
}


static int ent_comp (const void *s1, const void *s2) {
  return casecompare (((hash_rec *) s1)->word, ((hash_rec *) s2)->word);
}


static void WriteHashTable (FILE * fp, dict_data * dd) {
  frags_stats_header fsh;
  u_long j = 0;
  u_char *curr;

  if (PackHashTable (dd) == COMPERROR) return;
  
  qsort (dd->HashTable, dd->HashUsed, sizeof (hash_rec), ent_comp);
  
  fsh.num_frags = dd->HashSize;
  fsh.mem_for_frags = dd->HashSize;
  for (j = 0; j < dd->HashSize; j++)
    fsh.mem_for_frags += dd->HashTable[j].word[0];
  
  /* [RPAP - Jan 97: Endian Ordering] */
  HTONUL(fsh.num_frags);
  HTONUL(fsh.mem_for_frags);
  
  fwrite (&fsh, sizeof (fsh), 1, fp);
  
  for (j = 0; j < dd->HashSize; j++) {
    curr = dd->HashTable[j].word;
    
    /* [RPAP - Jan 97: Endian Ordering] */
    HTONUL(dd->HashTable[j].wcnt);
    HTONUL(dd->HashTable[j].occurance_num);
    
    fwrite (&dd->HashTable[j].wcnt, sizeof (dd->HashTable[j].wcnt), 1, fp);
    fwrite (&dd->HashTable[j].occurance_num,
        sizeof (dd->HashTable[j].occurance_num), 1, fp);
    
    /* [RPAP - Jan 97: Endian Ordering] */
    NTOHUL(dd->HashTable[j].wcnt);
    NTOHUL(dd->HashTable[j].occurance_num);
    
    fwrite (curr, sizeof (u_char), curr[0] + 1, fp);
  }
}


int done_text_1 (const TagInfo &/*tagInfo*/, char *file_name) {
  char *temp_str;
  FILE *fp;
  
  if (!(fp = create_file (file_name, TEXT_STATS_DICT_SUFFIX, "wb",
              MAGIC_STATS_DICT, MG_MESSAGE)))  /* [RPAP - Feb 97: WIN32 Port] */
    return COMPERROR;
  
  temp_str = msg_prefix;
  msg_prefix = "text.pass1";
  
  /* [RPAP - Jan 97: Endian Ordering] */
  HTONUL(csh.num_docs);
  HTOND(csh.num_bytes); /* [RJM 07/97: 4G limit] */

  fwrite (&csh, sizeof (csh), 1, fp);

  /* [RPAP - Jan 97: Endian Ordering] */
  NTOHUL(csh.num_docs);
  NTOHD(csh.num_bytes); /* [RJM 07/97: 4G limit] */

  WriteHashTable (fp, &DictData[0]);
  WriteHashTable (fp, &DictData[1]);
  msg_prefix = temp_str;
  return COMPALLOK;
}