Source: ../../bgp/bgp_trie.hh
|
|
|
|
// -*- c-basic-offset: 4; tab-width: 8; indent-tabs-mode: t -*-
// Copyright (c) 2001-2005 International Computer Science Institute
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the "Software")
// to deal in the Software without restriction, subject to the conditions
// listed in the XORP LICENSE file. These conditions include: you must
// preserve this copyright notice, and you cannot mention the copyright
// holders in advertising related to the Software without their permission.
// The Software is provided WITHOUT ANY WARRANTY, EXPRESS OR IMPLIED. This
// notice is a summary of the XORP LICENSE file; the license in that file is
// legally binding.
// $XORP: xorp/bgp/bgp_trie.hh,v 1.14 2005/03/25 02:52:39 pavlin Exp $
#ifndef __BGP_BGP_TRIE_HH__
#define __BGP_BGP_TRIE_HH__
#include "subnet_route.hh"
#include <map>
#include "libxorp/ref_trie.hh"
template <class A>
class Path_Att_Ptr_Cmp {
public:
bool operator() (const PathAttributeList<A> *a,
const PathAttributeList<A> *b) const {
return *a < *b;
}
};
template<class A>
class ChainedSubnetRoute : public SubnetRoute<A> {
public:
ChainedSubnetRoute(const IPNet<A> &net,
const PathAttributeList<A> *attributes) :
SubnetRoute<A>(net, attributes), _prev(0), _next(0) {}
ChainedSubnetRoute(const SubnetRoute<A>& route,
const ChainedSubnetRoute<A>* prev);
ChainedSubnetRoute(const ChainedSubnetRoute& csr);
const ChainedSubnetRoute<A> *prev() const { return _prev; }
const ChainedSubnetRoute<A> *next() const { return _next; }
bool unchain() const;
protected:
inline void set_next(const ChainedSubnetRoute<A> *next) const {
_next = next;
}
inline void set_prev(const ChainedSubnetRoute<A> *prev) const {
_prev = prev;
}
ChainedSubnetRoute& operator=(const ChainedSubnetRoute& csr); // Not impl.
private:
//The destructor is private because it's not supposed to be called
//directly. Instead, unref() should be used which will only delete
//the SubnetRoute when the reference count reaches zero.
friend class SubnetRoute<A>; //shut the compiler up.
~ChainedSubnetRoute() {}
// it looks odd to have these be mutable and the methods to set
// them be const, but that's because the chaining is really
// conceptually part of the container, not the payload. It these
// aren't mutable we can't modify the chaining and have the payload
// be const.
mutable const ChainedSubnetRoute<A> *_prev;
mutable const ChainedSubnetRoute<A> *_next;
};
/**
* Template specialization of the RefTrieNode, so that the payload is
* not immediately deleted unless the SubnetRoute reference count is
* zero.
*/
template<>
inline void
RefTrieNode<IPv4, const ChainedSubnetRoute<IPv4> >::delete_payload(const ChainedSubnetRoute<IPv4>* p)
{
p->unref();
}
template<>
inline void
RefTrieNode<IPv6, const ChainedSubnetRoute<IPv6> >::delete_payload(const ChainedSubnetRoute<IPv6>* p)
{
p->unref();
}
/**
* The BgpTrie is an augmented, specialized trie that allows us to
* lookup by network address or by path attribute list. We need this
* because we can't efficiently extract entries with the same path
* attribute list from a regular trie. Each set of nodes with the same
* path attribute pointer are linked together into a chain (a circular
* doubly-linked list). The BgpTrie holds a pointer to any one of
* those nodes.
*/
template<class A>
class BgpTrie : public RefTrie<A, const ChainedSubnetRoute<A> > {
public:
typedef IPNet<A> IPNet;
typedef ChainedSubnetRoute<A> ChainedSubnetRoute;
typedef map<const PathAttributeList<A> *,
const ChainedSubnetRoute*, Path_Att_Ptr_Cmp<A> > PathmapType;
typedef RefTrie<A, const ChainedSubnetRoute> RouteTrie;
typedef typename RouteTrie::iterator iterator;
BgpTrie();
~BgpTrie();
iterator insert(const IPNet& net, const SubnetRoute<A>& route);
void erase(const IPNet& net);
void delete_all_nodes();
const PathmapType& pathmap() const { return _pathmap; }
private:
PathmapType _pathmap;
};
#endif // __BGP_BGP_TRIE_HH__
Generated by: pavlin on possum.icir.org on Thu Mar 9 04:43:34 2006, using kdoc $.