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     3908971 : void DBTablePartBase::Notify(DBEntryBase *entry) {
      18     3908971 :     if (entry->is_onlist()) {
      19     1405098 :         return;
      20             :     }
      21     2503825 :     entry->set_onlist();
      22     2508184 :     bool was_empty = change_list_.empty();
      23     2507938 :     change_list_.push_back(*entry);
      24     2508928 :     if (was_empty) {
      25     1340057 :         DB *db = parent()->database();
      26     1340019 :         DBPartition *partition = db->GetPartition(index_);
      27     1340004 :         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     1340111 : bool DBTablePartBase::RunNotify() {
      41     3850591 :     for (int i = 0; ((i < kMaxIterations) && !change_list_.empty()); ++i) {
      42     2510250 :         DBEntryBase *entry = &change_list_.front();
      43     2510138 :         change_list_.pop_front();
      44             : 
      45     2510032 :         parent()->RunNotify(this, entry);
      46     2510479 :         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     2972888 :         if (entry->IsDeleted() && entry->is_state_empty(this) &&
      57      462430 :             !entry->IsOnRemoveQ()) {
      58      462388 :             Remove(entry);
      59             :         }
      60             :     }
      61             : 
      62     1340137 :     if (!change_list_.empty()) {
      63          56 :         DB *db = parent()->database();
      64          43 :         DBPartition *partition = db->GetPartition(index_);
      65          43 :         partition->OnTableChange(this);
      66          43 :         return false;
      67             :     }
      68     1340146 :     return true;
      69             : }
      70             : 
      71     1149313 : void DBTablePartBase::Delete(DBEntryBase *entry) {
      72     1149313 :     if (parent_->HasListeners()) {
      73      851185 :         entry->MarkDelete();
      74      851134 :         Notify(entry);
      75             :     } else {
      76             :         // Remove from change_list
      77      298233 :         if (entry->is_onlist()) {
      78        1406 :             change_list_.erase(change_list_.iterator_to(*entry));
      79             :         }
      80      298232 :         Remove(entry);
      81             :     }
      82     1149271 : }
      83             : 
      84     2075569 : DBTablePartition::DBTablePartition(DBTable *table, int index)
      85     2075569 :     : DBTablePartBase(table, index) {
      86     2075488 : }
      87             : 
      88      648484 : void DBTablePartition::Process(DBClient *client, DBRequest *req) {
      89      648484 :     DBTable *table = static_cast<DBTable *>(parent());
      90      648487 :     table->incr_input_count();
      91      648468 :     table->Input(this, client, req);
      92      648466 : }
      93             : 
      94     1129052 : void DBTablePartition::Add(DBEntry *entry) {
      95     1129052 :     std::scoped_lock lock(mutex_);
      96     1129135 :     std::pair<Tree::iterator, bool> ret = tree_.insert(*entry);
      97     1128996 :     assert(ret.second);
      98     1128996 :     entry->set_table_partition(static_cast<DBTablePartBase *>(this));
      99     1128989 :     Notify(entry);
     100     1129048 :     parent()->AddRemoveCallback(entry, true);
     101     1129031 : }
     102             : 
     103      224151 : void DBTablePartition::Change(DBEntry *entry) {
     104      224151 :     std::scoped_lock lock(mutex_);
     105      224151 :     Notify(entry);
     106      224151 : }
     107             : 
     108     1128933 : void DBTablePartition::Remove(DBEntryBase *db_entry) {
     109     1128933 :     std::scoped_lock lock(mutex_);
     110     1129005 :     DBEntry *entry = static_cast<DBEntry *>(db_entry);
     111     1129005 :     parent()->AddRemoveCallback(entry, false);
     112             : 
     113     1128879 :     bool success = tree_.erase(*entry);
     114     1128751 :     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     1128751 :     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     1129135 :     if (tree_.empty())
     124      134483 :         table()->RetryDelete();
     125     1129017 : }
     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     2930419 : DBEntry *DBTablePartition::FindInternal(const DBEntry *entry) {
     145     2930419 :     Tree::iterator loc = tree_.find(*entry);
     146     5860429 :     if (loc != tree_.end()) {
     147     1371024 :         return loc.operator->();
     148             :     }
     149     1559154 :     return NULL;
     150             : }
     151             : 
     152       24106 : const DBEntry *DBTablePartition::FindInternal(const DBEntry *entry) const {
     153       24106 :     Tree::const_iterator loc = tree_.find(*entry);
     154       48212 :     if (loc != tree_.end()) {
     155       16730 :         return loc.operator->();
     156             :     }
     157        7376 :     return NULL;
     158             : }
     159             : 
     160          98 : DBEntry *DBTablePartition::FindNoLock(const DBEntry *entry) {
     161          98 :     CHECK_CONCURRENCY("db::DBTable", "db::IFMapTable",
     162             :         "Agent::FlowEvent", "Agent::FlowUpdate");
     163          98 :     return FindInternal(entry);
     164             : }
     165             : 
     166     2206736 : DBEntry *DBTablePartition::Find(const DBEntry *entry) {
     167     2206736 :     std::scoped_lock lock(mutex_);
     168     4414148 :     return FindInternal(entry);
     169     2206811 : }
     170             : 
     171       24106 : const DBEntry *DBTablePartition::Find(const DBEntry *entry) const {
     172       24106 :     std::scoped_lock lock(mutex_);
     173       48212 :     return FindInternal(entry);
     174       24106 : }
     175             : 
     176          17 : DBEntry *DBTablePartition::FindNoLock(const DBRequestKey *key) {
     177          17 :     CHECK_CONCURRENCY("db::DBTable", "db::IFMapTable",
     178             :         "Agent::FlowEvent", "Agent::FlowUpdate");
     179          17 :     DBTable *table = static_cast<DBTable *>(parent());
     180          17 :     std::unique_ptr<DBEntry> entry_ptr = table->AllocEntry(key);
     181          34 :     return FindInternal(entry_ptr.get());
     182          17 : }
     183             : 
     184      723300 : DBEntry *DBTablePartition::Find(const DBRequestKey *key) {
     185      723300 :     DBTable *table = static_cast<DBTable *>(parent());
     186      723300 :     std::unique_ptr<DBEntry> entry_ptr = table->AllocEntry(key);
     187      723300 :     std::scoped_lock lock(mutex_);
     188     1446600 :     return FindInternal(entry_ptr.get());
     189      723300 : }
     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      658182 : DBEntry *DBTablePartition::lower_bound(const DBEntryBase *key) {
     205      658182 :     const DBEntry *entry = static_cast<const DBEntry *>(key);
     206      658182 :     std::scoped_lock lock(mutex_);
     207             : 
     208      658538 :     Tree::iterator it = tree_.lower_bound(*entry);
     209     1316730 :     if (it != tree_.end()) {
     210      658280 :         return (it.operator->());
     211             :     }
     212          80 :     return NULL;
     213      658360 : }
     214             : 
     215     1377681 : DBEntry *DBTablePartition::GetFirst() {
     216     1377681 :     std::scoped_lock lock(mutex_);
     217     1377724 :     Tree::iterator it = tree_.begin();
     218     2755420 :     if (it == tree_.end()) {
     219     1206929 :         return NULL;
     220             :     }
     221      170776 :     return it.operator->();
     222     1377705 : }
     223             : 
     224             : // Returns the next entry (Doesn't search). Threaded walk
     225     1733734 : DBEntry *DBTablePartition::GetNext(const DBEntryBase *key) {
     226     1733734 :     const DBEntry *entry = static_cast<const DBEntry *>(key);
     227     1733734 :     std::scoped_lock lock(mutex_);
     228             : 
     229     1734160 :     Tree::const_iterator it = tree_.iterator_to(*entry);
     230     1733866 :     it++;
     231     3466613 :     if (it != tree_.end()) {
     232     1503764 :         return const_cast<DBEntry *>(it.operator->());
     233             :     }
     234      229394 :     return NULL;
     235     1733158 : }
     236             : 
     237      141832 : DBTable *DBTablePartition::table() {
     238      141832 :     return static_cast<DBTable *>(parent());
     239             : }