ruby-radix 0.0.2

data/ext/radixlib.h

@@ -0,0 +1,161 @@
+/*
+ * Copyright (c) 1999-2000
+ * 
+ * The Regents of the University of Michigan ("The Regents") and
+ * Merit Network, Inc. All rights reserved.  Redistribution and use
+ * in source and binary forms, with or without modification, are
+ * permitted provided that the following conditions are met:
+ * 
+ * 1. Redistributions of source code must retain the above 
+ * copyright notice, this list of conditions and the 
+ * following disclaimer.
+ * 
+ * 2. Redistributions in binary form must reproduce the above 
+ * copyright notice, this list of conditions and the 
+ * following disclaimer in the documentation and/or other 
+ * materials provided with the distribution.
+ * 
+ * 3. All advertising materials mentioning features or use of 
+ * this software must display the following acknowledgement:
+ * 
+ *   This product includes software developed by the University of
+ *   Michigan, Merit Network, Inc., and their contributors.
+ * 
+ * 4. Neither the name of the University, Merit Network, nor the
+ * names of their contributors may be used to endorse or 
+ * promote products derived from this software without 
+ * specific prior written permission.
+ * 
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+ * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+ * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL TH E REGENTS
+ * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
+ * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HO WEVER CAUSED
+ * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
+ * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ */
+/*
+ * Portions Copyright (c) 2004,2005 Damien Miller <djm@mindrot.org>
+ *
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ */
+
+/* $Id: radix.h,v 1.9 2007/10/24 06:03:08 djm Exp $ */
+
+#ifndef _RADIX_H
+#define _RADIX_H
+
+#if defined(_MSC_VER)
+#include <winsock2.h>
+#include <ws2tcpip.h>
+#else
+# include <sys/types.h>
+# include <sys/socket.h>
+# include <netinet/in.h>
+# include <arpa/inet.h>
+# include <netdb.h>
+#endif
+
+#if defined(_MSC_VER)
+# define snprintf _snprintf
+typedef unsigned __int8		u_int8_t;
+typedef unsigned __int16	u_int16_t;
+typedef unsigned __int32	u_int32_t;
+const char *inet_ntop(int af, const void *src, char *dst, size_t size);
+size_t strlcpy(char *dst, const char *src, size_t size);
+#endif
+
+/*
+ * Originally from MRT include/mrt.h
+ * $MRTId: mrt.h,v 1.1.1.1 2000/08/14 18:46:10 labovit Exp $
+ */
+typedef struct _prefix_t {
+	u_int family;			/* AF_INET | AF_INET6 */
+	u_int bitlen;			/* same as mask? */
+	int ref_count;			/* reference count */
+	union {
+		struct in_addr sin;
+		struct in6_addr sin6;
+	} add;
+} prefix_t;
+
+void Deref_Prefix(prefix_t *prefix);
+
+/*
+ * Originally from MRT include/radix.h
+ * $MRTId: radix.h,v 1.1.1.1 2000/08/14 18:46:10 labovit Exp $
+ */
+typedef struct _radix_node_t {
+	u_int bit;			/* flag if this node used */
+	prefix_t *prefix;		/* who we are in radix tree */
+	struct _radix_node_t *l, *r;	/* left and right children */
+	struct _radix_node_t *parent;	/* may be used */
+	void *data;			/* pointer to data */
+} radix_node_t;
+
+typedef struct _radix_tree_t {
+	radix_node_t *head;
+	u_int maxbits;			/* for IP, 32 bit addresses */
+	int num_active_node;		/* for debug purpose */
+} radix_tree_t;
+
+/* Type of callback function */
+typedef void (*rdx_cb_t)(radix_node_t *, void *);
+
+radix_tree_t *New_Radix(void);
+void Destroy_Radix(radix_tree_t *radix, rdx_cb_t func, void *cbctx);
+radix_node_t *radix_lookup(radix_tree_t *radix, prefix_t *prefix);
+void radix_remove(radix_tree_t *radix, radix_node_t *node);
+radix_node_t *radix_search_exact(radix_tree_t *radix, prefix_t *prefix);
+radix_node_t *radix_search_best(radix_tree_t *radix, prefix_t *prefix);
+void radix_process(radix_tree_t *radix, rdx_cb_t func, void *cbctx);
+
+#define RADIX_MAXBITS 128
+
+#define RADIX_WALK(Xhead, Xnode) \
+	do { \
+		radix_node_t *Xstack[RADIX_MAXBITS+1]; \
+		radix_node_t **Xsp = Xstack; \
+		radix_node_t *Xrn = (Xhead); \
+		while ((Xnode = Xrn)) { \
+			if (Xnode->prefix)
+
+#define RADIX_WALK_END \
+			if (Xrn->l) { \
+				if (Xrn->r) { \
+					*Xsp++ = Xrn->r; \
+				} \
+				Xrn = Xrn->l; \
+			} else if (Xrn->r) { \
+				Xrn = Xrn->r; \
+			} else if (Xsp != Xstack) { \
+				Xrn = *(--Xsp); \
+			} else { \
+				Xrn = (radix_node_t *) 0; \
+			} \
+		} \
+	} while (0)
+
+/* Local additions */
+
+prefix_t *prefix_pton(const char *string, long len, const char **errmsg);
+prefix_t *prefix_from_blob(u_char *blob, int len, int prefixlen);
+const char *prefix_addr_ntop(prefix_t *prefix, char *buf, size_t len);
+const char *prefix_ntop(prefix_t *prefix, char *buf, size_t len);
+
+#endif /* _RADIX_H */

data/lib/ruby-radix.rb

@@ -0,0 +1,6 @@
+$:.unshift(File.dirname(__FILE__)) unless
+  $:.include?(File.dirname(__FILE__)) || $:.include?(File.expand_path(File.dirname(__FILE__)))
+
+module RubyRadix
+  VERSION = '0.0.2'
+end

data/script/console

@@ -0,0 +1,10 @@
+#!/usr/bin/env ruby
+# File: script/console
+irb = RUBY_PLATFORM =~ /(:?mswin|mingw)/ ? 'irb.bat' : 'irb'
+
+libs =  " -r irb/completion"
+# Perhaps use a console_lib to store any extra methods I may want available in the cosole
+# libs << " -r #{File.dirname(__FILE__) + '/../lib/console_lib/console_logger.rb'}"
+libs <<  " -r #{File.dirname(__FILE__) + '/../lib/ruby-radix.rb'}"
+puts "Loading ruby-radix gem"
+exec "#{irb} #{libs} --simple-prompt"

data/script/destroy

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+APP_ROOT = File.expand_path(File.join(File.dirname(__FILE__), '..'))
+
+begin
+  require 'rubigen'
+rescue LoadError
+  require 'rubygems'
+  require 'rubigen'
+end
+require 'rubigen/scripts/destroy'
+
+ARGV.shift if ['--help', '-h'].include?(ARGV[0])
+RubiGen::Base.use_component_sources! [:rubygems, :newgem, :newgem_theme, :test_unit]
+RubiGen::Scripts::Destroy.new.run(ARGV)

data/script/generate

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+APP_ROOT = File.expand_path(File.join(File.dirname(__FILE__), '..'))
+
+begin
+  require 'rubigen'
+rescue LoadError
+  require 'rubygems'
+  require 'rubigen'
+end
+require 'rubigen/scripts/generate'
+
+ARGV.shift if ['--help', '-h'].include?(ARGV[0])
+RubiGen::Base.use_component_sources! [:rubygems, :newgem, :newgem_theme, :test_unit]
+RubiGen::Scripts::Generate.new.run(ARGV)

data/test/test_helper.rb

@@ -0,0 +1,3 @@
+require 'stringio'
+require 'test/unit'
+require File.dirname(__FILE__) + '/../lib/ruby-radix'

data/test/test_ruby-radix.rb

@@ -0,0 +1,127 @@
+require File.dirname(__FILE__) + '/test_helper.rb'
+
+require 'radix'
+
+def int2ipaddr(val)
+  rstr = ""
+  rstr += sprintf("%d.", (val & 0xff000000) >> 24)
+  rstr += sprintf("%d.", (val & 0xff0000) >> 16)
+  rstr += sprintf("%d.", (val & 0xff00) >> 8)
+  rstr += sprintf("%d", val & 0xff)
+  rstr
+end
+
+class TestRubyRadix < Test::Unit::TestCase
+
+  def setup
+  end
+
+  def test_add
+    r = Radix.new
+    r.add("192.168.0.0", 24)
+    assert r.class == Radix
+  end
+
+  def test_store
+    r = Radix.new
+    r["172.31.0.0"] = "world!"
+    assert r["172.31.0.0/30"].msg == "world!"
+  end
+
+  def test_add_objects
+    r = Radix.new
+    r["192.168.0.0/24"] = ["Hello", "Radix", "Tree"]
+    r["172.31.0.0/30"] = {"Hello" => 123, "Radix" => "abc", :Tree => "def"}
+    assert r["192.168.0.0/24"].msg.class == Array
+    assert r["172.31.0.0/30"].msg.class == Hash
+    assert r["192.168.0.0/24"].msg[2] == "Tree"
+    assert r["172.31.0.0/30"].msg[:Tree] = "def"
+  end
+
+  def test_search_best
+    r = Radix.new
+    r["10.0.0.0/8"] = "message 1"
+    r["4.3.2.0/24"] = "message 2"
+    assert r.search_best("10.0.0.1").msg == "message 1"
+    assert r.search_best("11.0.0.1") == nil
+    assert r.search_best("4.3.2.0/24").msg == "message 2"
+  end
+
+  def test_search_exact
+    r = Radix.new
+    r["10.0.0.0/8"] = "message 1"
+    r["172.31.1.224/29"] = "message 2"
+    assert r.search_exact("10.0.0.0/8").msg == "message 1"
+    assert r.search_exact("10.0.0.0/24") == nil
+    assert r.search_exact("172.31.1.224/29").msg == "message 2"
+  end
+
+
+  def test_search_prefix
+    r = Radix.new
+    r["10.0.0.0/8"] = "next hop of 10.0.0.0/24 is 2.2.2.2"
+    node = r.search_best("10.0.1.2/32")
+    assert_match(/^next hop of 10\.0\.0\.0\/24 is 2\.2\.2\.2$/, node.msg)
+  end
+
+  def test_values
+    r = Radix.new
+    r["10.0.0.0/8"] = "message 1"
+    r["4.3.2.0/24"] = "message 2"
+    ret0 = r.values[0]
+    ret = ret0 + r.values[1]
+    assert ret.include? "message 1"
+    assert ret.include? "message 2"
+  end
+
+  def test_keys
+    r = Radix.new
+    r["10.0.0.0/8"] = "message 1"
+    r["4.3.2.0/24"] = "message 2"
+    ret1 = r.keys[0]
+    ret2 = r.keys[1]
+    ret = ret1 + " " + ret2
+    assert ret.include? "10.0.0.0/8"
+    assert ret.include? "4.3.2.0/24"
+  end
+
+  def test_length
+    r = Radix.new
+    r["10.0.0.0/8"] = "message 1"
+    r["4.3.2.0/24"] = "message 2"
+    assert r.length == 2
+  end
+
+  def test_clear
+    for i in 1..100
+      r = Radix.new
+      r[int2ipaddr(i)] = int2ipaddr(i)
+      r.clear
+      assert r.length == 0
+    end
+  end
+
+  def test_add10000
+    r = Radix.new
+    for i in 1..1000
+      r[int2ipaddr(i)] = int2ipaddr(i)
+    end
+    assert r.length == 1000
+    assert r[int2ipaddr(1000)].msg == int2ipaddr(1000)
+  end
+
+  def test_eachpair
+    r = Radix.new
+    r["10.0.0.0/8"] = "message 1"
+    r["4.3.2.0/24"] = "message 2"
+    r.each_pair do |k, v|
+      if (k == "1.2.3.4/32")
+        assert v == "message 1"
+      end
+      if (k == "4.3.2.1/32")
+        assert v == "message 2"
+      end
+    end
+  end
+
+end

metadata

@@ -0,0 +1,129 @@
+--- !ruby/object:Gem::Specification
+name: ruby-radix
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+  prerelease: 
+platform: ruby
+authors:
+- Takashi Sogabe
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-10-11 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rdoc
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.10'
+- !ruby/object:Gem::Dependency
+  name: newgem
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 1.5.3
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 1.5.3
+- !ruby/object:Gem::Dependency
+  name: hoe
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.0'
+description: ! 'ruby-radix is an implementation of a radix tree data structure for
+  the storage
+
+  and retrieval of IPv4 and IPv6 network prefixes.
+
+
+  The radix tree is the data structure most commonly used for routing table
+
+  lookups. It efficiently stores network prefixes of varying lengths and
+
+  allows fast lookups of containing networks.'
+email:
+- sogabe@iij.ad.jp
+executables: []
+extensions:
+- ext/extconf.rb
+extra_rdoc_files:
+- History.txt
+- Manifest.txt
+- PostInstall.txt
+- README.rdoc
+files:
+- History.txt
+- Manifest.txt
+- PostInstall.txt
+- README.rdoc
+- Rakefile
+- lib/ruby-radix.rb
+- script/console
+- script/destroy
+- script/generate
+- test/test_helper.rb
+- test/test_ruby-radix.rb
+- ext/radix.c
+- ext/radixlib.c
+- ext/radixlib.h
+- ext/extconf.rb
+- .gemtest
+homepage: http://github.com/iij/ruby-radix
+licenses: []
+post_install_message: PostInstall.txt
+rdoc_options:
+- --main
+- README.rdoc
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: ruby-radix
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: ruby-radix is an implementation of a radix tree data structure for the storage
+  and retrieval of IPv4 and IPv6 network prefixes
+test_files:
+- test/test_ruby-radix.rb
+- test/test_helper.rb