Logo Search packages:      
Sourcecode: ksh version File versions  Download package

dtrestore.c

/***********************************************************************
*                                                                      *
*               This software is part of the ast package               *
*          Copyright (c) 1985-2007 AT&T Intellectual Property          *
*                      and is licensed under the                       *
*                  Common Public License, Version 1.0                  *
*                    by AT&T Intellectual Property                     *
*                                                                      *
*                A copy of the License is available at                 *
*            http://www.opensource.org/licenses/cpl1.0.txt             *
*         (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9)         *
*                                                                      *
*              Information and Software Systems Research               *
*                            AT&T Research                             *
*                           Florham Park NJ                            *
*                                                                      *
*                 Glenn Fowler <gsf@research.att.com>                  *
*                  David Korn <dgk@research.att.com>                   *
*                   Phong Vo <kpv@research.att.com>                    *
*                                                                      *
***********************************************************************/
#include    "dthdr.h"

/*    Restore dictionary from given tree or list of elements.
**    There are two cases. If called from within, list is nil.
**    From without, list is not nil and data->size must be 0.
**
**    Written by Kiem-Phong Vo (5/25/96)
*/

#if __STD_C
int dtrestore(reg Dt_t* dt, reg Dtlink_t* list)
#else
int dtrestore(dt, list)
reg Dt_t*   dt;
reg Dtlink_t*     list;
#endif
{
      reg Dtlink_t      *t, **s, **ends;
      reg int           type;
      reg Dtsearch_f    searchf = dt->meth->searchf;

      type = dt->data->type&DT_FLATTEN;
      if(!list) /* restoring a flattened dictionary */
      {     if(!type)
                  return -1;
            list = dt->data->here;
      }
      else  /* restoring an extracted list of elements */
      {     if(dt->data->size != 0)
                  return -1;
            type = 0;
      }
      dt->data->type &= ~DT_FLATTEN;

      if(dt->data->type&(DT_SET|DT_BAG))
      {     dt->data->here = NIL(Dtlink_t*);
            if(type) /* restoring a flattened dictionary */
            {     for(ends = (s = dt->data->htab) + dt->data->ntab; s < ends; ++s)
                  {     if((t = *s) )
                        {     *s = list;
                              list = t->right;
                              t->right = NIL(Dtlink_t*);
                        }
                  }
            }
            else  /* restoring an extracted list of elements */
            {     dt->data->size = 0;
                  while(list)
                  {     t = list->right;
                        (*searchf)(dt,(Void_t*)list,DT_RENEW);
                        list = t;
                  }
            }
      }
      else
      {     if(dt->data->type&(DT_OSET|DT_OBAG))
                  dt->data->here = list;
            else /*if(dt->data->type&(DT_LIST|DT_STACK|DT_QUEUE))*/
            {     dt->data->here = NIL(Dtlink_t*);
                  dt->data->head = list;
            }
            if(!type)
                  dt->data->size = -1;
      }

      return 0;
}

Generated by  Doxygen 1.6.0   Back to index