node_list.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_to_node_list( aodv_node_list_t** path,
                       const aodv_addr_t* addr,
                       uint32_t seq )
{
   aodv_node_list_t* head = NULL;
   aodv_node_list_t* tail = NULL;
   aodv_node_list_t* curr = NULL;

   curr = (aodv_node_list_t*) malloc( sizeof(aodv_node_list_t) );
   if ( NULL == curr )
   {
      return 0;
   }
   curr->node.data = NULL;
   curr->node.length = 0U;
   set_aodv_addr( &(curr->node), addr );
   curr->seq  = seq;

   if ( NULL == *path )
   {
      curr->next = curr;
      curr->prev = curr;
      *path = curr;
   }
   else
   {
      head = *path;
      tail = head->prev;
      curr->prev = tail;
      curr->next = head;
      tail->next = curr;
      head->prev = curr;
   }

   return 1;
}

void
free_aodv_node_list( aodv_node_list_t* head )
{
   aodv_node_list_t* curr;
   aodv_node_list_t* next;

   if ( NULL == head ) return;

   curr = head;
   do
   {
      next = curr->next;
      if ( NULL != curr->node.data ) free( curr->node.data );
      free( curr );
      curr = next;
   } while ( curr != head );
}

const aodv_node_list_t*
aodv_find_in_node_list( const aodv_node_list_t* nodes,
                        const aodv_addr_t* addr )
{
   const aodv_node_list_t* curr;
   if ( NULL == nodes ) return NULL;
   curr = nodes;
   do
   {
      if ( 0 == aodv_cmp_addr( &(curr->node), addr ) ) return curr;
      curr = curr->next;
   } while ( curr != nodes );
   return NULL;
}

---