annotate Wnn/jserver/mknode0.c @ 10:fc3022f61fc7

tiny clean up

/*
 *  $Id: mknode0.c,v 1.4 2002/05/12 22:51:16 hiroo Exp $
 */

/*
 * FreeWnn is a network-extensible Kana-to-Kanji conversion system.
 * This file is part of FreeWnn.
 * 
 * Copyright Kyoto University Research Institute for Mathematical Sciences
 *                 1987, 1988, 1989, 1990, 1991, 1992
 * Copyright OMRON Corporation. 1987, 1988, 1989, 1990, 1991, 1992, 1999
 * Copyright ASTEC, Inc. 1987, 1988, 1989, 1990, 1991, 1992
 * Copyright FreeWnn Project 1999, 2000, 2002
 *
 * Maintainer:  FreeWnn Project   <[e-mail]>
 *
 * 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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
#ifdef HAVE_CONFIG_H
#  include <config.h>
#endif

#include "commonhd.h"
#include "de_header.h"
#include "kaiseki.h"

static struct BZD *clrnd_sub ();
static void lnk_bzd (), lnk_ichbn ();
static int mknd_sub (), hyoka2 ();
void freebzd ();

static struct BZD *free_bzd_top = NULL;
static struct free_list *free_list_bzd = NULL;
static struct ICHBNP *free_ichbn_top = NULL;
static struct free_list *free_list_ichbn = NULL;

/************************************************/
/*        initialize link struct BZD            */
/************************************************/
int
init_bzd ()
{
  free_area (free_list_bzd);
  if (get_area (FIRST_BZD_KOSUU, sizeof (struct BZD), &free_list_bzd) < 0)
    return (-1);
  lnk_bzd (free_list_bzd);
  return (0);
}

/* free_bzd が 0 でない時に呼んだらあかんよ */
static void
lnk_bzd (list)
     struct free_list *list;
{
  register int n;
  register struct BZD *wk_ptr;

  free_bzd_top = wk_ptr = (struct BZD *) ((char *) list + sizeof (struct free_list));

  for (n = list->num - 1; n > 0; wk_ptr++, n--)
    wk_ptr->lnk_son = wk_ptr + 1;
  wk_ptr->lnk_son = 0;
}


/***********************************************/
/*       initialize link struct ICHBNP         */
/***********************************************/
int
init_ichbnp ()
{
  free_area (free_list_ichbn);
  if (get_area (FIRST_ICHBN_KOSUU, sizeof (struct ICHBNP), &free_list_ichbn) < 0)
    return (-1);
  lnk_ichbn (free_list_ichbn);
  return (0);
}

/* free_ichbn が 0 でない時に呼んだらあかんよ */
static void
lnk_ichbn (list)
     struct free_list *list;
{
  register int n;
  register struct ICHBNP *wk_ptr;

  free_ichbn_top = wk_ptr = (struct ICHBNP *) ((char *) list + sizeof (struct free_list));

  for (n = list->num - 1; n > 0; wk_ptr++, n--)
    wk_ptr->next_p = wk_ptr + 1;
  wk_ptr->next_p = 0;
}

/*********************************************************/
/*   struct BZD & ICHBNP   free area sakusei routine     */
/*********************************************************/
void
clr_node (bzd)
     register struct BZD *bzd;  /*clear node top pointer */
{
  register struct BZD *return_p;        /*clrnd_sub return pointer */

  return_p = clrnd_sub (bzd->lnk_son);
  if (return_p != 0)
    {
      freebzd (return_p);
    }
  freebzd (bzd);
}

static struct BZD *
clrnd_sub (bzd)
     register struct BZD *bzd;  /* node pointer */
{
  struct BZD *return_p;         /* clrnd_sub return pointer */

  if (bzd != 0)
    {
      return_p = clrnd_sub (bzd->lnk_son);
      if (return_p != 0)
        {
          freebzd (return_p);
        }
      return_p = clrnd_sub (bzd->lnk_br);
      if (return_p != 0)
        freebzd (return_p);
      return (bzd);
    }
  else
    return (0);
}

void
freebzd (bzd)                   /* struct BZD o free_area e link */
     register struct BZD *bzd;  /* クリアするノードのポインタ */
{
  bzd->lnk_son = free_bzd_top;
  free_bzd_top = bzd;
  clr_sbn_node (bzd->sbn);
}

void
freeibsp (ichbnp_p)             /* struct ICHBNP o free_area e link  */
     struct ICHBNP *ichbnp_p;   /* BZD ni link shiteiru ICHBNP eno pointer */
{
  register struct ICHBNP *wk_ptr;

  if (ichbnp_p == 0)
    return;
  for (wk_ptr = ichbnp_p; wk_ptr->next_p != 0; wk_ptr = wk_ptr->next_p)
    ;
  wk_ptr->next_p = free_ichbn_top;
  free_ichbn_top = ichbnp_p;
}

/******************************************/
/* BZD area no kakutoku routine           */
/******************************************/
struct BZD *
getbzdsp ()
{
  register struct BZD *rtnptr;

  if (free_bzd_top == 0)
    {
      if (get_area (BZD_KOSUU, sizeof (struct BZD), &free_list_bzd) < 0)
        return ((struct BZD *) -1);
      lnk_bzd (free_list_bzd);
    }

  rtnptr = free_bzd_top;
  free_bzd_top = free_bzd_top->lnk_son;
  rtnptr->lnk_br = 0;
  rtnptr->lnk_son = 0;
  rtnptr->son_v = 0;
  return (rtnptr);
}

/******************************************/
/* ICHBNP area no kakutoku routine        */
/******************************************/
struct ICHBNP *
getibsp ()
{
  register struct ICHBNP *rtnptr;

  if (free_ichbn_top == 0)
    {
      if (get_area (ICHBN_KOSUU, sizeof (struct ICHBNP), &free_list_ichbn) < 0)
        return ((struct ICHBNP *) -1);
      lnk_ichbn (free_list_ichbn);
    }

  rtnptr = free_ichbn_top;
  free_ichbn_top = free_ichbn_top->next_p;
  rtnptr->next_p = 0;
  return (rtnptr);
}


/*******************************************/
/* ICHBNP table からのオフセットの取りだし */
/*******************************************/
struct fzkkouho *
getfzkoh_body (ichbnp_p, no)
     register struct ICHBNP *ichbnp_p;
     int no;                    /* table index 0 org */
{
  register int cnt, no1;

  no1 = no / FZKIBNO;
  for (cnt = 0; cnt < no1; cnt++)
    ichbnp_p = ichbnp_p->next_p;
  return (&(ichbnp_p->fzkib[no % FZKIBNO]));
}

struct fzkkouho *
getfzkoh1_body (ichbnp_p, no)
     register struct ICHBNP *ichbnp_p;
     register int no;           /* table index 0 org */
{
  register int cnt, no1;

  no1 = no / FZKIBNO;
  for (cnt = 0; cnt < no1; cnt++)
    ichbnp_p = ichbnp_p->next_p;
  return (&(ichbnp_p->fzkib1[no % FZKIBNO]));
}


/*********************************************/
/*            make_node routine              */
/*********************************************/
int
#ifdef  NO_FZK
mknode (ptr, yomi_eno, beginvect, endvect, mx_syo_bnst)
#else
mknode (ptr, yomi_eno, beginvect, fzkchar, endvect, mx_syo_bnst)
#endif                          /* NO_FZK */
     struct BZD *ptr;           /* struct BZD node top pointer */
     int yomi_eno;              /* kaiseki bunsyou end index (end char no tugi) */
     int beginvect;             /* 前端ベクタ(-1:文節先頭、-2:なんでも)品詞No. */
#ifndef NO_FZK
     w_char *fzkchar;
#endif /* NO_FZK */
     int endvect;               /* shuutan vector */
     int mx_syo_bnst;           /* 解析を止める小文節の数 */
{
  register int flg = 1;         /* call or nocall value */

  flg = mknd_sub (ptr, yomi_eno, beginvect,
#ifndef NO_FZK
                  fzkchar,
#endif /* NO_FZK */
                  endvect, flg, mx_syo_bnst);
  switch (flg)
    {
    case 1:
      ptr->kbcnt++;             /* new_node ga tsukurareta toki */
      return (1);
    case 0:
      return (0);               /* new_node ga tsukurarenakatta toki */
    default:
      return (-1);              /* free_area ga nakatta toki */
    }
}

static int
#ifdef  NO_FZK
mknd_sub (ptr, yomi_eno, beginvect, endvect, flg, mx_syo_bnst)
#else
mknd_sub (ptr, yomi_eno, beginvect, fzkchar, endvect, flg, mx_syo_bnst)
#endif                          /* NO_FZK */
     struct BZD *ptr;           /* struct BZD node pointer */
     int yomi_eno;              /* kaiseki bunsyou end index (end char no tugi) */
     int beginvect;             /* 前端ベクタ(-1:文節先頭、-2:なんでも)品詞No. */
#ifndef NO_FZK
     w_char *fzkchar;
#endif /* NO_FZK */
     int endvect;               /* shuutan vector */
     int flg;                   /* call or nocall value */
     int mx_syo_bnst;           /* 解析を止める小文節の数 */
{
  register int keep_v;          /* max 評価値 */
  register struct BZD *wk_ptr;  /* work pointer */

  if (ptr->lnk_son != 0)
    {
      for (wk_ptr = ptr->lnk_son, keep_v = 0; wk_ptr != 0; wk_ptr = wk_ptr->lnk_br)
        {
          switch (mknd_sub (wk_ptr, yomi_eno, beginvect,
#ifndef NO_FZK
                            fzkchar,
#endif /* NO_FZK */
                            endvect, flg, mx_syo_bnst))
            {
            case 1:
              if (flg == 1)
                {               /* 解析文節数 */
                  wk_ptr->kbcnt++;
                  /* brothers max hyoka value */
                  if (wk_ptr->son_v > keep_v)
                    keep_v = wk_ptr->son_v;
                  wk_ptr->son_v /= wk_ptr->kbcnt;
                }
              break;
            case 0:
              if (flg == 1)
                {
                  keep_v = wk_ptr->son_v;
                  flg = 0;
                }
              else
                {               /* brothers max hyoka value */
                  if (wk_ptr->son_v > keep_v)
                    keep_v = wk_ptr->son_v;
                }
              wk_ptr->son_v += wk_ptr->v_jc;
              break;
            default:
              return (-1);
            }
        }
      if (keep_v != 0)
        ptr->son_v = hyoka2 (keep_v, ptr->v_jc);
      return (flg);
    }
  else
    {
      if (ptr->j_c + 1 < yomi_eno)
        {
          if (flg == 1)
            {                   /* make new node */
              if (dbn_kai (ptr->j_c + 1, yomi_eno, beginvect,
#ifndef NO_FZK
                           fzkchar,
#endif /* NO_FZK */
                           endvect, WNN_VECT_NO, mx_syo_bnst, &(ptr->lnk_son)) < 0)
                return (-1);    /* ERROR */
              for (wk_ptr = ptr->lnk_son, keep_v = 0; wk_ptr != 0; wk_ptr = wk_ptr->lnk_br)
                {
                  if (wk_ptr->v_jc > keep_v)
                    keep_v = wk_ptr->v_jc;
                  /* brothers max hyoka value */
                }
              ptr->son_v = hyoka2 (keep_v, ptr->v_jc);
            }
          return (1);           /* make flg */
        }
      else
        return (0);             /* no make flg */
    }
}

/********************************************/
/*           bunsetsu hyoka kansuu          */
/********************************************/
static int
hyoka2 (max_v, par_v)
     int max_v;                 /* brothers max hyoka value */
     int par_v;                 /* parent hyoka value */
{
  return ((max_v + par_v));
}