/* Generic vector interface routine * Copyright (C) 1997 Kunihiro Ishiguro * * This file is part of GNU Zebra. * * GNU 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. * * GNU 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 GNU Zebra; see the file COPYING.  If not, write to the Free * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA * 02111-1307, USA.   */#include <zebra.h>#include "vector.h"#include "memory.h"/* Initialize vector : allocate memory and return vector. */vectorvector_init (unsigned int size){  vector v = XCALLOC (MTYPE_VECTOR, sizeof (struct _vector));  /* allocate at least one slot */  if (size == 0)    size = 1;  v->alloced = size;  v->max = 0;  v->index = XCALLOC (MTYPE_VECTOR_INDEX, sizeof (void *) * size);  return v;}voidvector_only_wrapper_free (vector v){  XFREE (MTYPE_VECTOR, v);}voidvector_only_index_free (void *index){  XFREE (MTYPE_VECTOR_INDEX, index);}voidvector_free (vector v){  XFREE (MTYPE_VECTOR_INDEX, v->index);  XFREE (MTYPE_VECTOR, v);}vectorvector_copy (vector v){  unsigned int size;  vector new = XCALLOC (MTYPE_VECTOR, sizeof (struct _vector));  new->max = v->max;  new->alloced = v->alloced;  size = sizeof (void *) * (v->alloced);  new->index = XCALLOC (MTYPE_VECTOR_INDEX, size);  memcpy (new->index, v->index, size);  return new;}/* Check assigned index, and if it runs short double index pointer */voidvector_ensure (vector v, unsigned int num){  if (v->alloced > num)    return;  v->index = XREALLOC (MTYPE_VECTOR_INDEX, 		       v->index, sizeof (void *) * (v->alloced * 2));  memset (&v->index[v->alloced], 0, sizeof (void *) * v->alloced);  v->alloced *= 2;    if (v->alloced <= num)    vector_ensure (v, num);}/* This function only returns next empty slot index.  It dose not mean   the slot's index memory is assigned, please call vector_ensure()   after calling this function. */intvector_empty_slot (vector v){  unsigned int i;  if (v->max == 0)    return 0;  for (i = 0; i < v->max; i++)    if (v->index[i] == 0)      return i;  return i;}/* Set value to the smallest empty slot. */intvector_set (vector v, void *val){  unsigned int i;  i = vector_empty_slot (v);  vector_ensure (v, i);  v->index[i] = val;  if (v->max <= i)    v->max = i + 1;  return i;}/* Set value to specified index slot. */intvector_set_index (vector v, unsigned int i, void *val){  vector_ensure (v, i);  v->index[i] = val;  if (v->max <= i)    v->max = i + 1;  return i;}/* Look up vector.  */void *vector_lookup (vector v, unsigned int i){  if (i >= v->max)    return NULL;  return v->index[i];}/* Lookup vector, ensure it. */void *vector_lookup_ensure (vector v, unsigned int i){  vector_ensure (v, i);  return v->index[i];}/* Unset value at specified index slot. */voidvector_unset (vector v, unsigned int i){  if (i >= v->alloced)    return;  v->index[i] = NULL;  if (i + 1 == v->max)     {      v->max--;      while (i && v->index[--i] == NULL && v->max--) 	;				/* Is this ugly ? */    }}/* Count the number of not emplty slot. */unsigned intvector_count (vector v){  unsigned int i;  unsigned count = 0;  for (i = 0; i < v->max; i++)     if (v->index[i] != NULL)      count++;  return count;}