trema 0.4.7 → 0.4.8

data/src/lib/daemon.h

@@ -1,40 +0,0 @@
-/*
- * Daemon utility functions.
- *
- * Copyright (C) 2008-2013 NEC Corporation
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License, version 2, as
- * published by the Free Software Foundation.
- *
- * 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.,
- * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
- */
-
-
-#ifndef DAEMON_H
-#define DAEMON_H
-
-
-void daemonize( const char *home );
-void write_pid( const char *directory, const char *name );
-void unlink_pid( const char *directory, const char *name );
-pid_t read_pid( const char *directory, const char *name );
-void rename_pid( const char *directory, const char *old, const char *new );
-
-
-#endif // DAEMON_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/doubly_linked_list.c

@@ -1,284 +0,0 @@
-/*
- * Copyright (C) 2008-2013 NEC Corporation
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License, version 2, as
- * published by the Free Software Foundation.
- *
- * 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.,
- * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
- */
-
-
-#include <assert.h>
-#include <pthread.h>
-#include "doubly_linked_list.h"
-#include "wrapper.h"
-
-
-typedef struct private_dlist_element {
-  dlist_element public;
-  pthread_mutex_t *mutex;
-} private_dlist_element;
-
-
-static dlist_element *
-create_dlist_with_mutex( pthread_mutex_t *mutex ) {
-  private_dlist_element *element = xmalloc( sizeof( private_dlist_element ) );
-
-  element->public.data = NULL;
-  element->public.prev = NULL;
-  element->public.next = NULL;
-  element->mutex = mutex;
-
-  return ( dlist_element * ) element;
-}
-
-
-/**
- * Allocates space for one dlist_element.
- *
- * @return a pointer to the newly-allocated dlist_element.
- */
-dlist_element *
-create_dlist() {
-  private_dlist_element *element = ( private_dlist_element * ) create_dlist_with_mutex( NULL );
-
-  pthread_mutexattr_t attr;
-  pthread_mutexattr_init( &attr );
-  pthread_mutexattr_settype( &attr, PTHREAD_MUTEX_RECURSIVE_NP );
-  element->mutex = xmalloc( sizeof( pthread_mutex_t ) );
-  pthread_mutex_init( element->mutex, &attr );
-
-  return ( dlist_element * ) element;
-}
-
-
-/**
- * Inserts a new element into the list before the given position.
- *
- * @param element the list element before which the new element is inserted.
- * @param data the data for the new element.
- * @return a pointer to newly inserted element.
- */
-dlist_element *
-insert_before_dlist( dlist_element *element, void *data ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-  pthread_mutex_t *mutex = ( ( private_dlist_element * ) element )->mutex;
-
-  dlist_element *new_prev = create_dlist_with_mutex( mutex );
-
-  if ( element->prev ) {
-    dlist_element *old_prev = element->prev;
-    new_prev->prev = old_prev;
-    old_prev->next = new_prev;
-  }
-
-  element->prev = new_prev;
-  new_prev->next = element;
-  new_prev->data = data;
-
-  pthread_mutex_unlock( mutex );
-
-  return new_prev;
-}
-
-
-/**
- * Inserts a new element into the list after the given position.
- *
- * @param element the list element after which the new element is inserted.
- * @param data the data for the new element.
- * @return a pointer to newly inserted element.
- */
-dlist_element *
-insert_after_dlist( dlist_element *element, void *data ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-  pthread_mutex_t *mutex = ( ( private_dlist_element * ) element )->mutex;
-
-  dlist_element *new_next = create_dlist_with_mutex( mutex );
-
-  if ( element->next ) {
-    dlist_element *old_next = element->next;
-    new_next->next = old_next;
-    old_next->prev = new_next;
-  }
-
-  element->next = new_next;
-  new_next->prev = element;
-  new_next->data = data;
-
-  pthread_mutex_unlock( mutex );
-
-  return new_next;
-}
-
-
-/**
- * Gets the first element in a list.
- *
- * @param element a pointer to any of the element in the list.
- * @return the first element in the list.
- */
-dlist_element *
-get_first_element( dlist_element *element ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-
-  while ( element->prev != NULL ) {
-    element = element->prev;
-  }
-
-  pthread_mutex_unlock( ( ( private_dlist_element * ) element )->mutex );
-
-  return element;
-}
-
-
-/**
- * Gets the last element in a list.
- *
- * @param element a pointer to any of the element in the list.
- * @return the last element in the list.
- */
-dlist_element *
-get_last_element( dlist_element *element ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-
-  while ( element->next != NULL ) {
-    element = element->next;
-  }
-
-  pthread_mutex_unlock( ( ( private_dlist_element * ) element )->mutex );
-
-  return element;
-}
-
-
-/**
- * Finds the element in a list which contains the given data.
- *
- * @param element a pointer to any of the element in the list.
- * @param data the element data to find.
- * @return the found list element, or NULL if it is not found.
- */
-dlist_element *
-find_element( dlist_element *element, const void *data ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-
-  dlist_element *e = NULL;
-  for ( e = element; e; e = e->next ) {
-    if ( e->data == data ) {
-      pthread_mutex_unlock( ( ( private_dlist_element * ) element )->mutex );
-      return e;
-    }
-  }
-  for ( e = element->prev; e; e = e->prev ) {
-    if ( e->data == data ) {
-      pthread_mutex_unlock( ( ( private_dlist_element * ) element )->mutex );
-      return e;
-    }
-  }
-
-  pthread_mutex_unlock( ( ( private_dlist_element * ) element )->mutex );
-
-  return NULL;
-}
-
-
-/**
- * Removes an element from a list. If two elements contain the same
- * data, only the first is removed. If none of the elements contain
- * the data, the list is unchanged.
- *
- * @param element a element to remove.
- * @return true on success; false otherwise.
- */
-bool
-delete_dlist_element( dlist_element *element ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-  pthread_mutex_t *mutex = ( ( private_dlist_element * ) element )->mutex;
-
-  if ( element->prev != NULL ) {
-    element->prev->next = element->next;
-  }
-  if ( element->next != NULL ) {
-    element->next->prev = element->prev;
-  }
-  xfree( ( private_dlist_element * ) element );
-
-  pthread_mutex_unlock( mutex );
-
-  return true;
-}
-
-
-/**
- * Removes all elements from a list.
- *
- * @param element a pointer to any of the element in the list.
- * @return true on success; false otherwise.
- */
-bool
-delete_dlist( dlist_element *element ) {
-  if ( element == NULL ) {
-    die( "element must not be NULL" );
-  }
-
-  pthread_mutex_lock( ( ( private_dlist_element * ) element )->mutex );
-  pthread_mutex_t *mutex = ( ( private_dlist_element * ) element )->mutex;
-
-  dlist_element *e = NULL;
-
-  while ( element->prev != NULL ) {
-    element = element->prev;
-  }
-
-  for ( e = element; e != NULL; ) {
-    dlist_element *delete_me = e;
-    e = e->next;
-    xfree( ( private_dlist_element * ) delete_me );
-  }
-
-  pthread_mutex_unlock( mutex );
-  xfree( mutex );
-
-  return true;
-}
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/doubly_linked_list.h

@@ -1,86 +0,0 @@
-/*
- * Copyright (C) 2008-2013 NEC Corporation
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License, version 2, as
- * published by the Free Software Foundation.
- *
- * 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.,
- * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
- */
-
-
-/**
- * @file
- *
- * @brief linked lists containing pointers to data, with the ability
- * to iterate over the list in both directions.
- *
- * Each element in the list contains a piece of data, together with
- * pointers which link to the previous and next elements in the
- * list. Using these pointers it is possible to move through the list
- * in both directions (unlike the linked-list which only allows
- * movement through the list in the forward direction).
- *
- * @code
- * // Create a doubly linked list ("alpha" <=> "bravo" <=> "charlie")
- * dlist_element *alpha = create_dlist();
- * dlist_element *bravo = insert_after_dlist( alpha, "bravo" );
- * dlist_element *charlie = insert_after_dlist( bravo, "charlie" );
- *
- * // Find element "charlie" from the list
- * find_element( alpha, "charlie" ); // => charlie
- * find_element( alpha, "delta" ); // => NULL
- *
- * // Delete element "bravo" from the list
- * delete_dlist_element( bravo ); // => true
- *
- * // Delete entire list
- * delete_dlist( alpha );
- * @endcode
- */
-
-
-#ifndef DOUBLY_LINKED_LIST_H
-#define DOUBLY_LINKED_LIST_H
-
-
-#include "bool.h"
-
-
-/**
- * The dlist_element struct is used for each element in a
- * doubly-linked list.
- */
-typedef struct dlist_element {
-  void *data; /**< Holds the element's data, which can be a pointer to any kind of data. */
-  struct dlist_element *prev; /**< Contains the link to the previous element in the list. */
-  struct dlist_element *next; /**< Contains the link to the next element in the list. */
-} dlist_element;
-
-
-dlist_element *create_dlist( void );
-dlist_element *insert_before_dlist( dlist_element *element, void *data );
-dlist_element *insert_after_dlist( dlist_element *element, void *data );
-dlist_element *get_first_element( dlist_element *element );
-dlist_element *get_last_element( dlist_element *element );
-dlist_element *find_element( dlist_element *element, const void *data );
-bool delete_dlist_element( dlist_element *element );
-bool delete_dlist( dlist_element *element );
-
-
-#endif // DOUBLY_LINKED_LIST_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/ether.c

@@ -1,47 +0,0 @@
-/*
- * Copyright (C) 2008-2013 NEC Corporation
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License, version 2, as
- * published by the Free Software Foundation.
- *
- * 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.,
- * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
- */
-
-
-#include <assert.h>
-#include "checks.h"
-#include "log.h"
-#include "packet_info.h"
-#include "wrapper.h"
-
-
-uint16_t
-fill_ether_padding( buffer *buf ) {
-  die_if_NULL( buf );
-  size_t padding_length = 0;
-
-  if ( buf->length + ETH_FCS_LENGTH < ETH_MINIMUM_LENGTH ) {
-    padding_length = ETH_MINIMUM_LENGTH - buf->length - ETH_FCS_LENGTH;
-    debug( "Adding %zu octets padding ( original frame length = %zu ).",
-           buf->length, padding_length );
-    void *padding = append_back_buffer( buf, padding_length );
-    memset( padding, 0, padding_length );
-  }
-  return ( uint16_t ) padding_length;
-}
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */