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       15432 : void DBTablePartBase::Notify(DBEntryBase *entry) {
      18       15432 :     if (entry->is_onlist()) {
      19        5973 :         return;
      20             :     }
      21        9459 :     entry->set_onlist();
      22        9459 :     bool was_empty = change_list_.empty();
      23        9459 :     change_list_.push_back(*entry);
      24        9459 :     if (was_empty) {
      25        3698 :         DB *db = parent()->database();
      26        3698 :         DBPartition *partition = db->GetPartition(index_);
      27        3698 :         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        3700 : bool DBTablePartBase::RunNotify() {
      41       13131 :     for (int i = 0; ((i < kMaxIterations) && !change_list_.empty()); ++i) {
      42        9431 :         DBEntryBase *entry = &change_list_.front();
      43        9431 :         change_list_.pop_front();
      44             : 
      45        9431 :         parent()->RunNotify(this, entry);
      46        9431 :         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       10002 :         if (entry->IsDeleted() && entry->is_state_empty(this) &&
      57         571 :             !entry->IsOnRemoveQ()) {
      58         571 :             Remove(entry);
      59             :         }
      60             :     }
      61             : 
      62        3700 :     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        3698 :     return true;
      69             : }
      70             : 
      71        7004 : void DBTablePartBase::Delete(DBEntryBase *entry) {
      72        7004 :     if (parent_->HasListeners()) {
      73         757 :         entry->MarkDelete();
      74         757 :         Notify(entry);
      75             :     } else {
      76             :         // Remove from change_list
      77        6247 :         if (entry->is_onlist()) {
      78          56 :             change_list_.erase(change_list_.iterator_to(*entry));
      79             :         }
      80        6247 :         Remove(entry);
      81             :     }
      82        7004 : }
      83             : 
      84       35958 : DBTablePartition::DBTablePartition(DBTable *table, int index)
      85       35958 :     : DBTablePartBase(table, index) {
      86       35958 : }
      87             : 
      88        7229 : void DBTablePartition::Process(DBClient *client, DBRequest *req) {
      89        7229 :     DBTable *table = static_cast<DBTable *>(parent());
      90        7229 :     table->incr_input_count();
      91        7229 :     table->Input(this, client, req);
      92        7229 : }
      93             : 
      94        6995 : void DBTablePartition::Add(DBEntry *entry) {
      95        6995 :     std::scoped_lock lock(mutex_);
      96        6995 :     std::pair<Tree::iterator, bool> ret = tree_.insert(*entry);
      97        6995 :     assert(ret.second);
      98        6995 :     entry->set_table_partition(static_cast<DBTablePartBase *>(this));
      99        6995 :     Notify(entry);
     100        6995 :     parent()->AddRemoveCallback(entry, true);
     101        6995 : }
     102             : 
     103        5514 : void DBTablePartition::Change(DBEntry *entry) {
     104        5514 :     std::scoped_lock lock(mutex_);
     105        5514 :     Notify(entry);
     106        5514 : }
     107             : 
     108        6995 : void DBTablePartition::Remove(DBEntryBase *db_entry) {
     109        6995 :     std::scoped_lock lock(mutex_);
     110        6995 :     DBEntry *entry = static_cast<DBEntry *>(db_entry);
     111        6995 :     parent()->AddRemoveCallback(entry, false);
     112             : 
     113        6995 :     bool success = tree_.erase(*entry);
     114        6995 :     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        6995 :     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        6995 :     if (tree_.empty())
     124        1498 :         table()->RetryDelete();
     125        6995 : }
     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       21111 : DBEntry *DBTablePartition::FindInternal(const DBEntry *entry) {
     145       21111 :     Tree::iterator loc = tree_.find(*entry);
     146       42222 :     if (loc != tree_.end()) {
     147       10299 :         return loc.operator->();
     148             :     }
     149       10812 :     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       11723 : DBEntry *DBTablePartition::Find(const DBEntry *entry) {
     167       11723 :     std::scoped_lock lock(mutex_);
     168       23446 :     return FindInternal(entry);
     169       11723 : }
     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        9388 : DBEntry *DBTablePartition::Find(const DBRequestKey *key) {
     185        9388 :     DBTable *table = static_cast<DBTable *>(parent());
     186        9388 :     std::unique_ptr<DBEntry> entry_ptr = table->AllocEntry(key);
     187        9388 :     std::scoped_lock lock(mutex_);
     188       18776 :     return FindInternal(entry_ptr.get());
     189        9388 : }
     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         163 : DBEntry *DBTablePartition::lower_bound(const DBEntryBase *key) {
     205         163 :     const DBEntry *entry = static_cast<const DBEntry *>(key);
     206         163 :     std::scoped_lock lock(mutex_);
     207             : 
     208         163 :     Tree::iterator it = tree_.lower_bound(*entry);
     209         326 :     if (it != tree_.end()) {
     210         163 :         return (it.operator->());
     211             :     }
     212           0 :     return NULL;
     213         163 : }
     214             : 
     215       39266 : DBEntry *DBTablePartition::GetFirst() {
     216       39266 :     std::scoped_lock lock(mutex_);
     217       39266 :     Tree::iterator it = tree_.begin();
     218       78532 :     if (it == tree_.end()) {
     219       37266 :         return NULL;
     220             :     }
     221        2000 :     return it.operator->();
     222       39266 : }
     223             : 
     224             : // Returns the next entry (Doesn't search). Threaded walk
     225       10759 : DBEntry *DBTablePartition::GetNext(const DBEntryBase *key) {
     226       10759 :     const DBEntry *entry = static_cast<const DBEntry *>(key);
     227       10759 :     std::scoped_lock lock(mutex_);
     228             : 
     229       10759 :     Tree::const_iterator it = tree_.iterator_to(*entry);
     230       10759 :     it++;
     231       21518 :     if (it != tree_.end()) {
     232        8679 :         return const_cast<DBEntry *>(it.operator->());
     233             :     }
     234        2080 :     return NULL;
     235       10759 : }
     236             : 
     237        7422 : DBTable *DBTablePartition::table() {
     238        7422 :     return static_cast<DBTable *>(parent());
     239             : }