add_interface.c

/* Copyright 2008 Michael Marsh, University of Maryland.
 *
 * This file is part of pydtn.
 *
 * pydtn 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 3 of the License, or
 * (at your option) any later version.
 *
 * pydtn 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 pydtn.  If not, see <http://www.gnu.org/licenses/>.
 *
 * The views and conclusions contained in the software and documentation
 * are those of the authors and should not be interpreted as representing
 * official policies, either expressed or implied, of the University
 * of Maryland.
 *
 * pydtn extends and embeds the Python interpreter, which is
 * Copyright 2001-2006 Python Software Foundation, All Rights Reserved,
 * and is released under the PSF License Agreement.
 *
 * RANLUX random number generation uses the Boost library,
 * Copyright 1994-2006 by various authors (details in individual files),
 * which is released under the Boost Software License, Version 1.0.
 */

#include "aodv.h"

int
aodv_add_interface( aodv_state_t* state, int iface )
{
   unsigned int i;
   unsigned int n;
   unsigned int l;
   int* temp;

   if ( NULL == state ) return 0;

   n = state->interfaces.nifaces;

   if ( 0 == state->interfaces.lifaces )
   {
      l = 2;
      state->interfaces.lifaces = l;
      state->interfaces.interfaces = (int*) calloc( l, sizeof(int) );
      if ( NULL == state->interfaces.interfaces )
      {
         return 0;
      }
   }
   else if ( state->interfaces.lifaces == n )
   {
      l = 2 * state->interfaces.lifaces;
      temp = (int*) calloc( l, sizeof(int) );
      if ( NULL == temp )
      {
         return 0;
      }
      for ( i = 0 ; i < n ; ++i )
      {
         temp[i] = state->interfaces.interfaces[i];
      }
      free(state->interfaces.interfaces);
      state->interfaces.interfaces = temp;
      state->interfaces.lifaces = l;
   }

   state->interfaces.interfaces[n] = iface;
   ++(state->interfaces.nifaces);

   return 1;
}

---