trema 0.4.7 → 0.4.8

data/src/lib/hash_table.h

@@ -1,136 +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 Associations between keys and values so that given a key the
- * value can be found quickly.
- *
- * @code
- * // Create hash table.
- * table = create_hash( compare_string, hash_string );
- *
- * // Insert three key/value pairs.
- * insert_hash_entry( table, "alpha", &object_a );
- * insert_hash_entry( table, "bravo", &object_b );
- * insert_hash_entry( table, "charlie", &object_c );
- *
- * // Look up by a key = "alpha".
- * lookup_hash_entry( table, "alpha" ); // => object_a
- *
- * // Delete entire hash table.
- * delete_hash( table );
- * @endcode
- */
-
-
-#ifndef HASH_TABLE_H
-#define HASH_TABLE_H
-
-
-#include "doubly_linked_list.h"
-
-
-/**
- * The function is passed a key and should return a unsigned int hash
- * value.
- *
- * The hash values should be evenly distributed over a fairly large
- * range. The modulus is taken with the hash table size (a prime
- * number) to find the 'bucket' to place each key into. The function
- * should also be very fast, since it is called for each key lookup.
- *
- * @param key a key.
- * @return the hash value corresponding to the key.
- */
-typedef unsigned int ( *hash_function )( const void *key );
-
-/**
- * Specifies the type of a function used to test two values for
- * equality. The function should return true if both values are equal
- * and false otherwise.
- *
- * @param x a value.
- * @param y a value to compare with.
- * @return true if a = b; false otherwise.
- */
-typedef bool ( *compare_function )( const void *x, const void *y );
-
-
-/**
- * The hash_entry struct is an opaque data structure to represent a
- * key/value pair of hash_table.
- */
-typedef struct {
-  void *key;
-  void *value;
-} hash_entry;
-
-
-/**
- * The hash_table struct is an opaque data structure to represent a
- * hash_table. It should only be accessed via the following functions.
- */
-typedef struct {
-  unsigned int number_of_buckets;
-  compare_function compare;
-  hash_function hash;
-  unsigned int length;
-  dlist_element **buckets;
-  dlist_element *nonempty_bucket_index;
-} hash_table;
-
-
-/**
- * A hash_iterator structure represents an iterator that can be used
- * to iterate over the elements of a hash_table. hash_iterator
- * structures are typically allocated on the stack and then
- * initialized with init_hash_iterator().
- */
-typedef struct {
-  dlist_element **buckets;
-  dlist_element *bucket_index;
-  dlist_element *next_bucket_index;
-  dlist_element *element;
-} hash_iterator;
-
-
-hash_table *create_hash( const compare_function compare, const hash_function hash );
-hash_table *create_hash_with_size( const compare_function compare, const hash_function hash, unsigned int size );
-void *insert_hash_entry( hash_table *table, void *key, void *value );
-void *lookup_hash_entry( hash_table *table, const void *key );
-void *delete_hash_entry( hash_table *table, const void *key );
-void foreach_hash( hash_table * table, void function( void *key, void *value, void *user_data ), void *user_data );
-void init_hash_iterator( hash_table *table, hash_iterator *iter );
-hash_entry *iterate_hash_next( hash_iterator *iter );
-void delete_hash( hash_table *table );
-
-bool compare_atom( const void *x, const void *y );
-unsigned int hash_atom( const void *key );
-
-
-#endif // HASH_TABLE_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/icmp.h

@@ -1,72 +0,0 @@
-/*
- * ICMP header definitions
- *
- * 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 ICMP_H
-#define ICMP_H
-
-
-typedef struct icmp_header {
-  uint8_t type;
-  uint8_t code;
-  uint16_t csum;
-  union {
-    struct {
-      uint16_t ident;
-      uint16_t seq;
-    } echo;
-    uint32_t gateway;
-    uint32_t pad;
-  } icmp_data;
-} icmp_header_t;
-
-
-#define ICMP_TYPE_ECHOREP 0
-#define ICMP_TYPE_UNREACH 3
-#define ICMP_TYPE_SOURCEQUENCH 4
-#define ICMP_TYPE_REDIRECT 5
-#define ICMP_TYPE_ECHOREQ 8
-#define ICMP_TYPE_ROUTERADV 9
-#define ICMP_TYPE_ROUTERSOL 10
-#define ICMP_TYPE_TIMEEXCEED 11
-#define ICMP_TYPE_PARAMPROBLEM 12
-
-// ICMP codes for Destination Unreachable
-#define ICMP_CODE_NETUNREACH 0
-#define ICMP_CODE_HOSTUNREACH 1
-#define ICMP_CODE_PROTOUNREACH 2
-#define ICMP_CODE_PORTUNREACH 3
-#define ICMP_CODE_FRAGNEED 4
-#define ICMP_CODE_SRCROUTEFAIL 5
-#define ICMP_CODE_ADMINPROHIBIT 13
-
-// ICMP codes for Time Exceeded
-#define ICMP_CODE_TIMETOLIVE 0
-#define ICMP_CODE_FRAGREASM 1
-
-
-#endif // ICMP_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/igmp.h

@@ -1,48 +0,0 @@
-/*
- * IGMP header definitions
- *
- * Copyright (C) 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 IGMP_H
-#define IGMP_H
-
-
-typedef struct igmp_header {
-  uint8_t type;
-  uint8_t code;
-  uint16_t csum;
-  uint32_t group;
-} igmp_header_t;
-
-
-#define IGMP_TYPE_MEMBERSHIP_QUERY     0x11
-#define IGMP_TYPE_V1_MEMBERSHIP_REPORT 0x12
-#define IGMP_TYPE_V2_MEMBERSHIP_REPORT 0x16
-#define IGMP_TYPE_V2_LEAVE_GROUP       0x17
-#define IGMP_TYPE_V3_MEMBERSHIP_REPORT 0x22
-
-
-#endif // IGMP_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/ipv4.h

@@ -1,64 +0,0 @@
-/*
- * IPv4 header definitions
- *
- * 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 IPV4_H
-#define IPV4_H
-
-
-#include "buffer.h"
-
-
-typedef struct  {
-#if __BYTE_ORDER == __LITTLE_ENDIAN
-  uint8_t ihl:4;
-  uint8_t version:4;
-#elif __BYTE_ORDER == __BIG_ENDIAN
-  uint8_t version:4;
-  uint8_t ihl:4;
-#endif
-  uint8_t tos;
-  uint16_t tot_len;
-  uint16_t id;
-  uint16_t frag_off;
-  uint8_t ttl;
-  uint8_t protocol;
-  uint16_t csum;
-  uint32_t saddr;
-  uint32_t daddr;
-} ipv4_header_t;
-
-
-#define IPV4_ADDRLEN 4
-
-
-#define IPV4_IS_CLASSDE( _addr ) ( ( ( _addr ) & 0xe0000000UL ) == 0xe0000000UL )
-#define IPV4_IS_LOOPBACK( _addr ) ( ( ( _addr ) & 0xffffff00UL ) == 0x7f000000UL )
-#define IPV4_IS_LIMITEDBC( _addr ) ( ( _addr ) == 0xffffffffUL )
-
-
-#endif // IPV4_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/ipv6.h

@@ -1,46 +0,0 @@
-/*
- * IPv6 header definitions
- *
- * 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 IPV6_H
-#define IPV6_H
-
-
-#define IPV6_ADDRLEN 16
-
-
-typedef struct  {
-  uint32_t hdrctl;
-  uint16_t plen;
-  uint8_t nexthdr;
-  uint8_t hoplimit;
-  uint8_t saddr[ IPV6_ADDRLEN ];
-  uint8_t daddr[ IPV6_ADDRLEN ];
-} ipv6_header_t;
-
-
-#endif // IPV6_H
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */

data/src/lib/linked_list.c

@@ -1,244 +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 "linked_list.h"
-#include "wrapper.h"
-
-
-/**
- * Initializes a new list by passing the head of the list. Note that
- * the head element should be allocated on caller's stack or heap.
- *
- * @param list the head of the list.
- * @return true on success; false otherwise.
- */
-bool
-create_list( list_element **list ) {
-  if ( list == NULL ) {
-    die( "list must not be NULL" );
-  }
-
-  *list = NULL;
-  return true;
-}
-
-
-/**
- * Inserts a new element at the head of the list.
- *
- * @param head the head of the list. This will be updated to the new element.
- * @param data the data for the new element.
- * @return true on success; false otherwise.
- */
-bool
-insert_in_front( list_element **head, void *data ) {
-  if ( head == NULL ) {
-    die( "head must not be NULL" );
-  }
-
-  list_element *old_head = *head;
-  list_element *new_head = xmalloc( sizeof( list_element ) );
-
-  new_head->data = data;
-  *head = new_head;
-  ( *head )->next = old_head;
-  return true;
-}
-
-
-/**
- * Inserts a node before \e sibling containing \e data.
- *
- * @param head the head of the list.
- * @param sibling node to insert \e data before.
- * @param data data to put in the newly-inserted node.
- * @return true on success; false otherwise.
- */
-bool
-insert_before( list_element **head, const void *sibling, void *data ) {
-  if ( head == NULL ) {
-    die( "head must not be NULL" );
-  }
-
-  for ( list_element *e = *head; e->next != NULL; e = e->next ) {
-    if ( e->next->data == sibling ) {
-      list_element *new_element = xmalloc( sizeof( list_element ) );
-      new_element->next = e->next;
-      new_element->data = data;
-      e->next = new_element;
-      return true;
-    }
-  }
-
-  return false;
-}
-
-
-/**
- * Adds a new element on to the end of the list.
- *
- * @param head the head of the list.
- * @param data the data for the new element.
- * @return true on success; false otherwise.
- */
-bool
-append_to_tail( list_element **head, void *data ) {
-  if ( head == NULL ) {
-    die( "head must not be NULL" );
-  }
-
-  list_element *new_tail = xmalloc( sizeof( list_element ) );
-  new_tail->data = data;
-  new_tail->next = NULL;
-
-  if ( *head == NULL ) {
-    *head = new_tail;
-    return true;
-  }
-
-  list_element *e;
-  for ( e = *head; e->next != NULL; e = e->next );
-  e->next = new_tail;
-  return true;
-}
-
-
-/**
- * Gets the number of elements in a list.
- *
- * @param head the head of the list.
- * @return the number of elements in the list.
- */
-unsigned int
-list_length_of( const list_element *head ) {
-  if ( head == NULL ) {
-    return 0;
-  }
-  unsigned int length = 1;
-  for ( list_element *e = head->next; e; e = e->next, length++ );
-  return length;
-}
-
-
-/**
- * Calls a function for each element of a list.
- *
- * @param head the head of the list.
- * @param function the function to call with each element's data.
- * @param user_data user-data to pass to the function.
- */
-void
-iterate_list( list_element *head, void function( void *data, void *user_data ), void *user_data ) {
-  if ( function != NULL ) {
-    for ( list_element *e = head; e != NULL; e = e->next ) {
-      function( e->data, user_data );
-    }
-  }
-}
-
-
-/**
- * Finds an element in a list, using a supplied function to find the
- * desired element. It iterates over the list, calling the given
- * function which should return true when the desired element is found.
- *
- * @param head the head of the list.
- * @param function the function to call for each element. It should return true when the desired element is found.
- * @param user_data user-data passed to the function.
- * @return the found list element, or NULL if it is not found.
- */
-void *
-find_list_custom( list_element *head, bool function( void *data, void *user_data ), void *user_data ) {
-  if ( head == NULL ) {
-    die( "head must not be NULL" );
-  }
-  if ( function == NULL ) {
-    die( "function must not be NULL" );
-  }
-
-  void *data_found = NULL;
-  for ( list_element *e = head; e != NULL; e = e->next ) {
-    if ( function( e->data, user_data ) ) {
-      data_found = e->data;
-      break;
-    }
-  }
-  return data_found;
-}
-
-
-/**
- * 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 head the head of the list.
- * @param data the data of the element to remove.
- * @return true on success; false otherwise.
- */
-bool
-delete_element( list_element **head, const void *data ) {
-  if ( head == NULL ) {
-    die( "head must not be NULL" );
-  }
-
-  list_element *e = *head;
-
-  if ( e->data == data ) {
-    *head = e->next;
-    xfree( e );
-    return true;
-  }
-
-  for ( ; e->next != NULL; e = e->next ) {
-    if ( e->next->data == data ) {
-      list_element *delete_me = e->next;
-      e->next = e->next->next;
-      xfree( delete_me );
-      return true;
-    }
-  }
-
-  return false;
-}
-
-
-/**
- * Removes all elements from a list.
- *
- * @param head the head of the list.
- * @return true on success; false otherwise.
- */
-bool
-delete_list( list_element *head ) {
-  for ( list_element *e = head; e != NULL; ) {
-    list_element *delete_me = e;
-    e = e->next;
-    xfree( delete_me );
-  }
-  return true;
-}
-
-
-/*
- * Local variables:
- * c-basic-offset: 2
- * indent-tabs-mode: nil
- * End:
- */