Initial import of svn+ssh:://svn.icir.org/bro/trunk/bro as of r7088

src/PrefixTable.h

@@ -0,0 +1,52 @@
+// $Id: PrefixTable.h 969 2005-01-04 06:36:21Z vern $
+
+#ifndef PREFIXTABLE_H
+#define PREFIXTABLE_H
+
+#include "Val.h"
+#include "net_util.h"
+
+extern "C" {
+	#include "patricia.h"
+}
+
+class PrefixTable {
+private:
+	struct iterator {
+		patricia_node_t* Xstack[PATRICIA_MAXBITS+1];
+		patricia_node_t** Xsp;
+		patricia_node_t* Xrn;
+		patricia_node_t* Xnode;
+	};
+
+public:
+	PrefixTable()	{ tree = New_Patricia(128); }
+	~PrefixTable()	{ Destroy_Patricia(tree, 0); }
+
+	// Addr in network byte order. If data is zero, acts like a set.
+	// Returns ptr to old data if already existing.
+	// For existing items without data, returns non-nil if found.
+	void* Insert(const_addr_type addr, int width, void* data = 0);
+
+	// Value may be addr or subnet.
+	void* Insert(const Val* value, void* data = 0);
+
+	// Returns nil if not found, pointer to data otherwise.
+	// For items without data, returns non-nil if found.
+	// If exact is false, performs exact rather than longest-prefix match.
+	void* Lookup(const_addr_type addr, int width, bool exact = false) const;
+	void* Lookup(const Val* value, bool exact = false) const;
+
+	// Returns pointer to data or nil if not found.
+	void* Remove(const_addr_type addr, int width);
+	void* Remove(const Val* value);
+
+	void Clear()	{ Clear_Patricia(tree, 0); }
+
+	iterator InitIterator();
+	void* GetNext(iterator* i);
+
+	patricia_tree_t* tree;
+};
+
+#endif