Line data    Source code

       1             : /*
       2             :  * Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
       3             :  */
       4             : 
       5             : #include "base/logging.h"
       6             : #include "base/task_annotations.h"
       7             : #include "base/time_util.h"
       8             : #include "db/db.h"
       9             : #include "db/db_entry.h"
      10             : #include "db/db_partition.h"
      11             : #include "db/db_table.h"
      12             : #include "db/db_table_partition.h"
      13             : 
      14             : using namespace std;
      15             : 
      16             : // concurrency: called from DBPartition task.
      17       24726 : void DBTablePartBase::Notify(DBEntryBase *entry) {
      18       24726 :     if (entry->is_onlist()) {
      19        8697 :         return;
      20             :     }
      21       16029 :     entry->set_onlist();
      22       16029 :     bool was_empty = change_list_.empty();
      23       16029 :     change_list_.push_back(*entry);
      24       16029 :     if (was_empty) {
      25        7630 :         DB *db = parent()->database();
      26        7630 :         DBPartition *partition = db->GetPartition(index_);
      27        7630 :         partition->OnTableChange(this);
      28             :     }
      29             : }
      30             : 
      31             : //
      32             : // Concurrency: called from db::DBTable/db::IFMapTable task.
      33             : //
      34             : // Evaluate concurrency issues with DBEntryBase::ClearState when making
      35             : // changes to this method. We expect that either this method or ClearState
      36             : // is responsible for removing the DBEntryBase when they run concurrently,
      37             : // assuming the DBEntryBase is eligible for removal. The dbstate_mutex is
      38             : // used for synchronization.
      39             : //
      40        7632 : bool DBTablePartBase::RunNotify() {
      41       23641 :     for (int i = 0; ((i < kMaxIterations) && !change_list_.empty()); ++i) {
      42       16009 :         DBEntryBase *entry = &change_list_.front();
      43       16009 :         change_list_.pop_front();
      44             : 
      45       16009 :         parent()->RunNotify(this, entry);
      46       16009 :         entry->clear_onlist();
      47             : 
      48             :         // If the entry is marked deleted and all DBStates are removed
      49             :         // and it's not already on the remove queue, it can be removed
      50             :         // from the tree right away.
      51             :         //
      52             :         // Note that IsOnRemoveQ must be called after is_state_empty as
      53             :         // synchronization with DBEntryBase::ClearState happens via the
      54             :         // call to is_state_empty, and ClearState can set the OnRemoveQ
      55             :         // bit in the entry.
      56       16988 :         if (entry->IsDeleted() && entry->is_state_empty(this) &&
      57         979 :             !entry->IsOnRemoveQ()) {
      58         979 :             Remove(entry);
      59             :         }
      60             :     }
      61             : 
      62        7632 :     if (!change_list_.empty()) {
      63           2 :         DB *db = parent()->database();
      64           2 :         DBPartition *partition = db->GetPartition(index_);
      65           2 :         partition->OnTableChange(this);
      66           2 :         return false;
      67             :     }
      68        7630 :     return true;
      69             : }
      70             : 
      71       10166 : void DBTablePartBase::Delete(DBEntryBase *entry) {
      72       10166 :     if (parent_->HasListeners()) {
      73        2476 :         entry->MarkDelete();
      74        2476 :         Notify(entry);
      75             :     } else {
      76             :         // Remove from change_list
      77        7690 :         if (entry->is_onlist()) {
      78          40 :             change_list_.erase(change_list_.iterator_to(*entry));
      79             :         }
      80        7690 :         Remove(entry);
      81             :     }
      82       10166 : }
      83             : 
      84       97473 : DBTablePartition::DBTablePartition(DBTable *table, int index)
      85       97473 :     : DBTablePartBase(table, index) {
      86       97473 : }
      87             : 
      88       17882 : void DBTablePartition::Process(DBClient *client, DBRequest *req) {
      89       17882 :     DBTable *table = static_cast<DBTable *>(parent());
      90       17882 :     table->incr_input_count();
      91       17882 :     table->Input(this, client, req);
      92       17882 : }
      93             : 
      94       10085 : void DBTablePartition::Add(DBEntry *entry) {
      95       10085 :     std::scoped_lock lock(mutex_);
      96       10085 :     std::pair<Tree::iterator, bool> ret = tree_.insert(*entry);
      97       10085 :     assert(ret.second);
      98       10085 :     entry->set_table_partition(static_cast<DBTablePartBase *>(this));
      99       10085 :     Notify(entry);
     100       10085 :     parent()->AddRemoveCallback(entry, true);
     101       10085 : }
     102             : 
     103        8194 : void DBTablePartition::Change(DBEntry *entry) {
     104        8194 :     std::scoped_lock lock(mutex_);
     105        8194 :     Notify(entry);
     106        8194 : }
     107             : 
     108       10085 : void DBTablePartition::Remove(DBEntryBase *db_entry) {
     109       10085 :     std::scoped_lock lock(mutex_);
     110       10085 :     DBEntry *entry = static_cast<DBEntry *>(db_entry);
     111       10085 :     parent()->AddRemoveCallback(entry, false);
     112             : 
     113       10084 :     bool success = tree_.erase(*entry);
     114       10085 :     if (!success) {
     115           0 :         LOG(FATAL, "ABORT: DB node erase failed for table " + parent()->name());
     116           0 :         LOG(FATAL, "Invalid node " + db_entry->ToString());
     117           0 :         abort();
     118             :     }
     119       10085 :     delete entry;
     120             : 
     121             :     // If a table is marked for deletion, then we may trigger the deletion
     122             :     // process when the last prefix is deleted
     123       10084 :     if (tree_.empty())
     124        2855 :         table()->RetryDelete();
     125       10085 : }
     126             : 
     127           0 : void DBTablePartition::AddWithoutAlloc(DBEntry *entry) {
     128           0 :     std::scoped_lock lock(mutex_);
     129           0 :     tree_.insert(*entry);
     130           0 :     entry->set_table_partition(static_cast<DBTablePartBase *>(this));
     131           0 :     Notify(entry);
     132           0 :     parent()->AddRemoveCallback(entry, true);
     133           0 : }
     134             : 
     135           0 : void DBTablePartition::RemoveWithoutDelete(DBEntry *entry) {
     136           0 :     std::scoped_lock lock(mutex_);
     137           0 :     bool success = tree_.erase(*entry);
     138           0 :     if (!success) {
     139           0 :         LOG(FATAL, "ABORT: DB node erase failed for table " + parent()->name());
     140           0 :         abort();
     141             :     }
     142           0 : }
     143             : 
     144       56494 : DBEntry *DBTablePartition::FindInternal(const DBEntry *entry) {
     145       56494 :     Tree::iterator loc = tree_.find(*entry);
     146      112990 :     if (loc != tree_.end()) {
     147       39389 :         return loc.operator->();
     148             :     }
     149       17106 :     return NULL;
     150             : }
     151             : 
     152           0 : const DBEntry *DBTablePartition::FindInternal(const DBEntry *entry) const {
     153           0 :     Tree::const_iterator loc = tree_.find(*entry);
     154           0 :     if (loc != tree_.end()) {
     155           0 :         return loc.operator->();
     156             :     }
     157           0 :     return NULL;
     158             : }
     159             : 
     160           0 : DBEntry *DBTablePartition::FindNoLock(const DBEntry *entry) {
     161           0 :     CHECK_CONCURRENCY("db::DBTable", "db::IFMapTable",
     162             :         "Agent::FlowEvent", "Agent::FlowUpdate");
     163           0 :     return FindInternal(entry);
     164             : }
     165             : 
     166       18176 : DBEntry *DBTablePartition::Find(const DBEntry *entry) {
     167       18176 :     std::scoped_lock lock(mutex_);
     168       36353 :     return FindInternal(entry);
     169       18177 : }
     170             : 
     171           0 : const DBEntry *DBTablePartition::Find(const DBEntry *entry) const {
     172           0 :     std::scoped_lock lock(mutex_);
     173           0 :     return FindInternal(entry);
     174           0 : }
     175             : 
     176           0 : DBEntry *DBTablePartition::FindNoLock(const DBRequestKey *key) {
     177           0 :     CHECK_CONCURRENCY("db::DBTable", "db::IFMapTable",
     178             :         "Agent::FlowEvent", "Agent::FlowUpdate");
     179           0 :     DBTable *table = static_cast<DBTable *>(parent());
     180           0 :     std::unique_ptr<DBEntry> entry_ptr = table->AllocEntry(key);
     181           0 :     return FindInternal(entry_ptr.get());
     182           0 : }
     183             : 
     184       38318 : DBEntry *DBTablePartition::Find(const DBRequestKey *key) {
     185       38318 :     DBTable *table = static_cast<DBTable *>(parent());
     186       38318 :     std::unique_ptr<DBEntry> entry_ptr = table->AllocEntry(key);
     187       38318 :     std::scoped_lock lock(mutex_);
     188       76636 :     return FindInternal(entry_ptr.get());
     189       38318 : }
     190             : 
     191           0 : DBEntry *DBTablePartition::FindNext(const DBRequestKey *key) {
     192           0 :     std::scoped_lock lock(mutex_);
     193           0 :     DBTable *table = static_cast<DBTable *>(parent());
     194           0 :     std::unique_ptr<DBEntry> entry_ptr = table->AllocEntry(key);
     195             : 
     196           0 :     Tree::iterator loc = tree_.upper_bound(*(entry_ptr.get()));
     197           0 :     if (loc != tree_.end()) {
     198           0 :         return loc.operator->();
     199             :     }
     200           0 :     return NULL;
     201           0 : }
     202             : 
     203             : // Returns the matching entry or next in lex order
     204         604 : DBEntry *DBTablePartition::lower_bound(const DBEntryBase *key) {
     205         604 :     const DBEntry *entry = static_cast<const DBEntry *>(key);
     206         604 :     std::scoped_lock lock(mutex_);
     207             : 
     208         604 :     Tree::iterator it = tree_.lower_bound(*entry);
     209        1208 :     if (it != tree_.end()) {
     210         602 :         return (it.operator->());
     211             :     }
     212           2 :     return NULL;
     213         604 : }
     214             : 
     215       91499 : DBEntry *DBTablePartition::GetFirst() {
     216       91499 :     std::scoped_lock lock(mutex_);
     217       91499 :     Tree::iterator it = tree_.begin();
     218      182998 :     if (it == tree_.end()) {
     219       88484 :         return NULL;
     220             :     }
     221        3015 :     return it.operator->();
     222       91499 : }
     223             : 
     224             : // Returns the next entry (Doesn't search). Threaded walk
     225       13087 : DBEntry *DBTablePartition::GetNext(const DBEntryBase *key) {
     226       13087 :     const DBEntry *entry = static_cast<const DBEntry *>(key);
     227       13087 :     std::scoped_lock lock(mutex_);
     228             : 
     229       13087 :     Tree::const_iterator it = tree_.iterator_to(*entry);
     230       13087 :     it++;
     231       26174 :     if (it != tree_.end()) {
     232        9842 :         return const_cast<DBEntry *>(it.operator->());
     233             :     }
     234        3245 :     return NULL;
     235       13087 : }
     236             : 
     237        8745 : DBTable *DBTablePartition::table() {
     238        8745 :     return static_cast<DBTable *>(parent());
     239             : }