Line data    Source code

       1             : /*
       2             :  * Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
       3             :  */
       4             : 
       5             : #include "ifmap/ifmap_link_table.h"
       6             : 
       7             : #include <boost/bind/bind.hpp>
       8             : 
       9             : #include "db/db.h"
      10             : #include "db/db_graph.h"
      11             : #include "db/db_table_partition.h"
      12             : #include "ifmap/ifmap_link.h"
      13             : #include "ifmap/ifmap_log.h"
      14             : #include "ifmap/ifmap_log_types.h"
      15             : 
      16             : using namespace std;
      17             : using namespace boost::placeholders;
      18             : 
      19         605 : IFMapLinkTable::IFMapLinkTable(DB *db, const string &name, DBGraph *graph)
      20         605 :         : DBGraphTable(db, name, graph) {
      21         605 : }
      22             : 
      23           0 : void IFMapLinkTable::Input(DBTablePartition *partition, DBClient *client,
      24             :                            DBRequest *req) {
      25           0 :     assert(false);
      26             : }
      27             : 
      28       12445 : std::unique_ptr<DBEntry> IFMapLinkTable::AllocEntry(
      29             :         const DBRequestKey *key) const {
      30       12445 :     const RequestKey *rkey = static_cast<const RequestKey *>(key);
      31       12445 :     unique_ptr<DBEntry> entry(new IFMapLink(rkey->name));
      32       12445 :     return entry;
      33             : }
      34             : 
      35             : // Generate an unique name for the link node and it should
      36             : // be independent of the order in which the right and left nodes are specified
      37       12416 : std::string IFMapLinkTable::LinkKey(const string &metadata,
      38             :                                         IFMapNode *left, IFMapNode *right) {
      39       12416 :     ostringstream oss;
      40       12416 :     if (left->ToString() < right->ToString()) {
      41        5111 :         oss << metadata << "," << left->ToString() << "," << right->ToString();
      42             :     } else {
      43        7305 :         oss << metadata << "," << right->ToString() << "," << left->ToString();
      44             :     }
      45       24832 :     return oss.str();
      46       12416 : }
      47             : 
      48        5664 : IFMapLink *IFMapLinkTable::AddLink(IFMapNode *left, IFMapNode *right,
      49             :                              const string &metadata, uint64_t sequence_number,
      50             :                              const IFMapOrigin &origin) {
      51             :     DBTablePartition *partition =
      52        5664 :         static_cast<DBTablePartition *>(GetTablePartition(0));
      53             : 
      54        5664 :     string link_name = LinkKey(metadata, left, right);
      55        5664 :     IFMapLink *link = FindLink(link_name);
      56        5664 :     if (link) {
      57           4 :         assert(link->IsDeleted());
      58           4 :         link->SetLinkRevival(true);
      59           4 :         link->ClearDelete();
      60           4 :         link->set_last_change_at_to_now();
      61           4 :         partition->Change(link);
      62             :     } else {
      63        5660 :         link = new IFMapLink(link_name);
      64        5660 :         partition->Add(link);
      65             :     }
      66        5664 :     link->SetProperties(left, right, metadata, sequence_number, origin);
      67        5664 :     assert(dynamic_cast<IFMapNode *>(left));
      68        5664 :     assert(dynamic_cast<IFMapNode *>(right));
      69        5664 :     return link;
      70        5664 : }
      71             : 
      72        6720 : IFMapLink *IFMapLinkTable::FindLink(const string &metadata, IFMapNode *left, IFMapNode *right) {
      73        6720 :     string link_name = LinkKey(metadata, left, right);
      74       13440 :     return FindLink(link_name);
      75        6720 : }
      76             : 
      77       12445 : IFMapLink *IFMapLinkTable::FindLink(const string &name) {
      78             : 
      79             :     DBTablePartition *partition =
      80       12445 :         static_cast<DBTablePartition *>(GetTablePartition(0));
      81       12445 :     RequestKey key;
      82       12445 :     key.name = name;
      83       24890 :     return static_cast<IFMapLink *>(partition->Find(&key));
      84       12445 : }
      85             : 
      86           0 : IFMapLink *IFMapLinkTable::FindNextLink(const string &name) {
      87             : 
      88             :     DBTablePartition *partition =
      89           0 :         static_cast<DBTablePartition *>(GetTablePartition(0));
      90           0 :     RequestKey key;
      91           0 :     key.name = name;
      92           0 :     return static_cast<IFMapLink *>(partition->FindNext(&key));
      93           0 : }
      94             : 
      95         170 : void IFMapLinkTable::DeleteLink(IFMapLink *link) {
      96         170 :     DBGraphEdge *edge = static_cast<DBGraphEdge *>(link);
      97         170 :     graph()->Unlink(edge);
      98         170 :     link->set_last_change_at_to_now();
      99         170 :     link->ClearNodes();
     100             :     DBTablePartition *partition =
     101         170 :         static_cast<DBTablePartition *>(GetTablePartition(0));
     102         170 :     partition->Delete(edge);
     103         170 : }
     104             : 
     105         176 : void IFMapLinkTable::DeleteLink(IFMapLink *link, const IFMapOrigin &origin) {
     106         176 :     link->RemoveOriginInfo(origin.origin);
     107         176 :     if (link->is_origin_empty()) {
     108         170 :         DeleteLink(link);
     109             :     }
     110         176 : }
     111             : 
     112         605 : DBTable *IFMapLinkTable::CreateTable(DB *db, const string &name,
     113             :                                      DBGraph *graph) {
     114         605 :     IFMapLinkTable *table = new IFMapLinkTable(db, name, graph);
     115         605 :     table->Init();
     116         605 :     return table;
     117             : }
     118             : 
     119         605 : void IFMapLinkTable::Clear() {
     120             :     DBTablePartition *partition = static_cast<DBTablePartition *>(
     121         605 :         GetTablePartition(0));
     122             : 
     123         605 :     assert(!HasListeners());
     124         605 :     for (IFMapLink *link = static_cast<IFMapLink *>(partition->GetFirst()),
     125        6099 :                  *next = NULL; link != NULL; link = next) {
     126        5494 :         next = static_cast<IFMapLink *>(partition->GetNext(link));
     127        5494 :         if (link->IsDeleted()) {
     128           0 :             continue;
     129             :         }
     130        5494 :         graph()->Unlink(link);
     131        5494 :         partition->Delete(link);
     132             :     }
     133         605 : }
     134             : 
     135         605 : void IFMapLinkTable_Init(DB *db, DBGraph *graph) {
     136             :     DBTable *table =
     137         605 :             IFMapLinkTable::CreateTable(db, "__ifmap_metadata__.0", graph);
     138         605 :     db->AddTable(table);
     139         605 : }
     140             : 
     141         160 : void IFMapLinkTable_Clear(DB *db) {
     142             :     IFMapLinkTable *ltable = static_cast<IFMapLinkTable *>(
     143         160 :             db->FindTable("__ifmap_metadata__.0"));
     144         160 :     ltable->Clear();
     145         160 : }