/** * @file protoRouteTable.cpp * * @brief Class based on the ProtoTree Patricia tree to store routing table information. Uses the ProtoAddress class to store network routing addresses */ #include "protoRouteTable.h" #include "protoDebug.h" ProtoRouteTable::ProtoRouteTable() { } ProtoRouteTable::~ProtoRouteTable() { Destroy(); } void ProtoRouteTable::Destroy() { // First, get rid of entries contained in tree. Entry* next; while (NULL != (next = static_cast(tree.GetRoot()))) { tree.Remove(*next); delete next; } // Second, get rid of default_entry if (default_entry.IsValid()) default_entry.Clear(); } // end ProtoRouteTable::Destroy() bool ProtoRouteTable::GetRoute(const ProtoAddress& dst, unsigned int prefixSize, ProtoAddress& gw, unsigned int& ifIndex, int& metric) { if (0 == prefixSize) { gw = default_entry.gateway; ifIndex = default_entry.iface_index; metric = default_entry.metric; return true; } Entry* entry = GetEntry(dst, prefixSize); if (entry) { gw = entry->gateway; ifIndex = entry->iface_index; metric = entry->metric; return true; } else { return false; } } // end ProtoRouteTable::GetRoute() bool ProtoRouteTable::SetRoute(const ProtoAddress& dst, unsigned int prefixSize, const ProtoAddress& gw, unsigned int ifIndex, int metric) { if (0 == prefixSize) { default_entry.destination = dst; default_entry.gateway = gw; default_entry.iface_index = ifIndex; default_entry.metric = metric; return true; } Entry* entry = GetEntry(dst, prefixSize); // (TBD) allow for multiple routes to same dst/mask ??? if (NULL == entry) entry = CreateEntry(dst, prefixSize); if (entry) { entry->gateway = gw; entry->iface_index = ifIndex; entry->metric = metric; return true; } else { PLOG(PL_ERROR, "ProtoRouteTable::SetRoute() error creating entry\n"); return false; } } // end ProtoRouteTable::SetRoute() bool ProtoRouteTable::FindRoute(const ProtoAddress& dst, unsigned int prefixSize, ProtoAddress& gw, unsigned int& ifIndex, int& metric) { Entry* entry = FindRouteEntry(dst, prefixSize); if (entry) { gw = entry->gateway; ifIndex = entry->iface_index; metric = entry->metric; return true; } else { return false; } } // end ProtoRouteTable::FindRoute() bool ProtoRouteTable::DeleteRoute(const ProtoAddress& dst, unsigned int maskLen, const ProtoAddress* gw, unsigned int index) { Entry* entry = GetEntry(dst, maskLen); if (NULL != entry) { if (NULL != gw) { if(gw->IsValid() || entry->gateway.IsValid()) { //make sure at least one of this is valid if (!entry->gateway.HostIsEqual(*gw)) { PLOG(PL_ERROR, "ProtoRouteTable::DeleteRoute() non-matching gateway addr Provided GW=%s\n",gw->GetHostString()); PLOG(PL_ERROR, " Entry GW=%s\n",entry->gateway.GetHostString()); return false; } } } if ((0 != index) && (index != entry->iface_index)) { PLOG(PL_ERROR, "ProtoRouteTable::DeleteRoute() non-matching interface index\n"); return false; } DeleteEntry(entry); return true; } else { return false; } } // end ProtoRouteTable::DeleteRoute() ProtoRouteTable::Entry* ProtoRouteTable::CreateEntry(const ProtoAddress& dstAddr, unsigned int prefixSize) { if (!dstAddr.IsValid()) { PLOG(PL_ERROR, "ProtoRouteTable::CreateEntry() invalid destination addr\n"); return NULL; } Entry* entry = new Entry(dstAddr, prefixSize); if (NULL == entry) { PLOG(PL_ERROR, "ProtoRouteTable::CreateEntry() memory allocation error: %s\n", GetErrorString()); delete entry; return NULL; } // Bind the item and the entry if (tree.Insert(*entry)) { return entry; } else { PLOG(PL_ERROR, "ProtoRouteTable::CreateEntry() equivalent entry already exists?\n"); delete entry; return NULL; } } // end ProtoRouteTable::CreateEntry() ProtoRouteTable::Entry* ProtoRouteTable::GetEntry(const ProtoAddress& dstAddr, unsigned int prefixSize) const { if (0 == prefixSize) { if (default_entry.IsValid()) return (Entry*)&default_entry; else return NULL; } return (static_cast(tree.Find(dstAddr.GetRawHostAddress(), prefixSize))); } // end ProtoRouteTable::GetEntry() ProtoRouteTable::Entry* ProtoRouteTable::FindRouteEntry(const ProtoAddress& dstAddr, unsigned int prefixSize) const { if (0 == prefixSize) return GetDefaultEntry(); Entry* entry = static_cast(tree.FindPrefix(dstAddr.GetRawHostAddress(), prefixSize)); return (NULL != entry) ? entry : GetDefaultEntry(); } // end ProtoRouteTable::FindRouteEntry() void ProtoRouteTable::DeleteEntry(ProtoRouteTable::Entry* entry) { if (NULL == entry) return; if (&default_entry == entry) { default_entry.Clear(); return; } Entry* entryFound = static_cast(tree.Find(entry->GetDestination().GetRawHostAddress(), entry->GetPrefixSize())); if (entryFound == entry) { tree.Remove(*entry); delete entry; } else { PLOG(PL_ERROR, "ProtoRouteTable::DeleteEntry() invalid entry\n"); } } // end ProtoRouteTable::DeleteEntry() ProtoRouteTable::Entry::Entry() : prefix_size(0), iface_index(0), metric(-1) { destination.Invalidate(); gateway.Invalidate(); } ProtoRouteTable::Entry::~Entry() { } ProtoRouteTable::Entry::Entry(const ProtoAddress& dstAddr, unsigned int prefixSize) : iface_index(0), metric(-1) { destination = dstAddr; prefix_size = prefixSize; gateway.Invalidate(); } void ProtoRouteTable::Entry::Init(const ProtoAddress& dstAddr, unsigned int prefixSize) { destination = dstAddr; prefix_size = prefixSize; gateway.Invalidate(); iface_index = 0; metric = -1; } // end ProtoRouteTable::Entry::Init() ProtoRouteTable::Iterator::Iterator(ProtoRouteTable& theTable) : table(theTable), iterator(theTable.tree), default_pending(true) { } ProtoRouteTable::Entry* ProtoRouteTable::Iterator::GetNextEntry() { if (default_pending) { default_pending = false; Entry* entry = (Entry*)table.GetDefaultEntry(); if (entry) return entry; } return (static_cast(iterator.GetNextItem())); } // end ProtoRouteTable::Iterator::GetNextEntry()