Line data Source code
1 : /*
2 : * Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
3 : */
4 :
5 : #include <vector>
6 : #include <atomic>
7 :
8 : #include <tbb/spin_rw_mutex.h>
9 :
10 : #include <boost/bind/bind.hpp>
11 : #include <boost/foreach.hpp>
12 : #include <boost/dynamic_bitset.hpp>
13 : #include <boost/type_traits.hpp>
14 :
15 : #include "base/compiler.h"
16 : #include "base/logging.h"
17 : #include "base/task_annotations.h"
18 : #include "base/time_util.h"
19 : #include "db/db.h"
20 : #include "db/db_partition.h"
21 : #include "db/db_table.h"
22 : #include "db/db_table_partition.h"
23 : #include "db/db_table_walk_mgr.h"
24 : #include "db/db_types.h"
25 :
26 : class DBEntry;
27 : class DBEntryBase;
28 :
29 : using namespace std;
30 : using namespace boost::placeholders;
31 :
32 1281711 : DBRequest::DBRequest() : oper(static_cast<DBOperation>(0)) {
33 1281706 : }
34 :
35 1283225 : DBRequest::~DBRequest() {
36 : #if defined(__GNUC__)
37 : #if (__GNUC_PREREQ(4, 2) > 0)
38 : boost::has_virtual_destructor<DBRequestKey>::type key_has_destructor;
39 : boost::has_virtual_destructor<DBRequestData>::type data_has_destructor;
40 1283225 : assert(key_has_destructor && data_has_destructor);
41 : #endif
42 : #endif
43 1283245 : }
44 :
45 648546 : void DBRequest::Swap(DBRequest *rhs) {
46 648546 : swap(oper, rhs->oper);
47 648546 : swap(key, rhs->key);
48 648538 : swap(data, rhs->data);
49 648529 : }
50 :
51 : // we need copy to be able to resize vector of atomics
52 : // therefore we don't need the same value in both instances
53 : template<typename _Tp>
54 : struct AtomicWithCopy : public std::atomic<_Tp> {
55 : // Inherit constructors
56 : using std::atomic<_Tp>::atomic;
57 :
58 : // Bring in base class operators and methods
59 : using std::atomic<_Tp>::operator=;
60 : using std::atomic<_Tp>::load;
61 : using std::atomic<_Tp>::store;
62 :
63 : // Custom constructor to handle copy from another AtomicWithCopy (must perform a load/store)
64 1011444 : AtomicWithCopy(const AtomicWithCopy& other) : std::atomic<_Tp>(other.load()) {}
65 :
66 : // Custom assignment operator
67 792681 : AtomicWithCopy& operator=(const AtomicWithCopy& other) {
68 1585351 : this->store(other.load());
69 792668 : return *this;
70 : }
71 : };
72 :
73 : class DBTableBase::ListenerInfo {
74 : public:
75 : typedef vector<ChangeCallback> CallbackList;
76 : typedef vector<string> NameList;
77 : typedef vector<AtomicWithCopy<uint64_t>> StateCountList;
78 :
79 1530182 : explicit ListenerInfo(const string &table_name) :
80 1530182 : db_state_accounting_(true) {
81 1530102 : if (table_name.find("__ifmap_") != string::npos) {
82 : // TODO need to have unconditional DB state accounting
83 : // for now skipp DB State accounting for ifmap tables
84 1233151 : db_state_accounting_ = false;
85 : }
86 1530120 : }
87 :
88 793273 : DBTableBase::ListenerId Register(ChangeCallback callback,
89 : const string &name) {
90 793273 : tbb::spin_rw_mutex::scoped_lock write_lock(rw_mutex_, true);
91 793358 : size_t i = bmap_.find_first();
92 793105 : if (i == bmap_.npos) {
93 792613 : i = callbacks_.size();
94 792606 : callbacks_.push_back(callback);
95 792737 : names_.push_back(name);
96 792734 : state_count_.resize(i + 1);
97 792712 : state_count_[i] = AtomicWithCopy<uint64_t>(0);
98 : } else {
99 492 : bmap_.reset(i);
100 493 : if (bmap_.none()) {
101 342 : bmap_.clear();
102 : }
103 493 : callbacks_[i] = callback;
104 493 : names_[i] = name;
105 493 : state_count_[i] = 0;
106 : }
107 793381 : return i;
108 793481 : }
109 :
110 793389 : void Unregister(ListenerId listener) {
111 793389 : tbb::spin_rw_mutex::scoped_lock write_lock(rw_mutex_, true);
112 793390 : callbacks_[listener] = NULL;
113 793390 : names_[listener] = "";
114 : // During Unregister Listener should have cleaned up,
115 : // DB states from all the entries in this table.
116 793390 : assert(state_count_[listener] == 0);
117 793390 : if ((size_t) listener == callbacks_.size() - 1) {
118 1257372 : while (!callbacks_.empty() && callbacks_.back() == NULL) {
119 792768 : callbacks_.pop_back();
120 792768 : names_.pop_back();
121 792768 : state_count_.pop_back();
122 : }
123 464604 : if (bmap_.size() > callbacks_.size()) {
124 225810 : bmap_.resize(callbacks_.size());
125 : }
126 : } else {
127 328786 : if ((size_t) listener >= bmap_.size()) {
128 326784 : bmap_.resize(listener + 1);
129 : }
130 328786 : bmap_.set(listener);
131 : }
132 793390 : }
133 :
134 : // concurrency: called from DBPartition task.
135 2509834 : void RunNotify(DBTablePartBase *tpart, DBEntryBase *entry) {
136 2509834 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
137 2510356 : for (CallbackList::iterator iter = callbacks_.begin();
138 8687056 : iter != callbacks_.end(); ++iter) {
139 6176261 : if (*iter != NULL) {
140 6146379 : ChangeCallback cb = *iter;
141 6146135 : (cb)(tpart, entry);
142 6147648 : }
143 : }
144 2509645 : }
145 :
146 3841004 : void AddToDBStateCount(ListenerId listener, int count) {
147 3841004 : if (db_state_accounting_ && listener != DBTableBase::kInvalidId) {
148 3626557 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
149 3627832 : state_count_[listener] += count;
150 3628755 : }
151 3842645 : }
152 :
153 1293034 : uint64_t GetDBStateCount(ListenerId listener) {
154 1293034 : assert(db_state_accounting_ && listener != DBTableBase::kInvalidId);
155 1293064 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
156 2586699 : return state_count_[listener];
157 1293211 : }
158 :
159 6661 : void FillListeners(vector<ShowTableListener> *listeners) const {
160 6661 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
161 6703 : ListenerId id = 0;
162 6703 : for (CallbackList::const_iterator iter = callbacks_.begin();
163 16048 : iter != callbacks_.end(); ++iter, ++id) {
164 9374 : if (*iter != NULL) {
165 9366 : ShowTableListener item;
166 9355 : item.id = id;
167 9355 : item.name = names_[id];
168 9365 : item.state_count = state_count_[id];
169 9364 : listeners->push_back(item);
170 9351 : }
171 : }
172 6680 : }
173 :
174 3756575 : bool empty() const {
175 3756575 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
176 7513601 : return callbacks_.empty();
177 3756540 : }
178 :
179 10317 : size_t size() const {
180 10317 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
181 20634 : return (callbacks_.size() - bmap_.count());
182 10317 : }
183 :
184 : private:
185 : bool db_state_accounting_;
186 : CallbackList callbacks_;
187 : NameList names_;
188 : StateCountList state_count_;
189 : mutable tbb::spin_rw_mutex rw_mutex_;
190 : boost::dynamic_bitset<> bmap_; // free list.
191 : };
192 :
193 1530151 : DBTableBase::DBTableBase(DB *db, const string &name)
194 1530152 : : db_(db), name_(name), info_(new ListenerInfo(name)),
195 1530151 : enqueue_count_(0), input_count_(0), notify_count_(0) {
196 1530090 : walker_count_ = 0;
197 1530251 : walk_request_count_ = 0;
198 1530231 : walk_complete_count_ = 0;
199 1530243 : walk_cancel_count_ = 0;
200 1530245 : walk_again_count_ = 0;
201 1530248 : walk_count_ = 0;
202 1530226 : }
203 :
204 1530254 : DBTableBase::~DBTableBase() {
205 1530254 : }
206 :
207 793358 : DBTableBase::ListenerId DBTableBase::Register(ChangeCallback callback,
208 : const string &name) {
209 793358 : return info_->Register(callback, name);
210 : }
211 :
212 793390 : void DBTableBase::Unregister(ListenerId listener) {
213 793390 : info_->Unregister(listener);
214 : // If a table is marked for deletion, then we may trigger the deletion
215 : // process when the last client is removed
216 793389 : if (info_->empty())
217 360814 : RetryDelete();
218 793390 : }
219 :
220 647240 : bool DBTableBase::Enqueue(DBRequest *req) {
221 647240 : DBTablePartBase *tpart = GetTablePartition(req->key.get());
222 647231 : DBPartition *partition = db_->GetPartition(tpart->index());
223 647229 : enqueue_count_++;
224 647229 : return partition->EnqueueRequest(tpart, NULL, req);
225 : }
226 :
227 368288 : void DBTableBase::EnqueueRemove(DBEntryBase *db_entry) {
228 368288 : DBTablePartBase *tpart = GetTablePartition(db_entry);
229 368301 : DBPartition *partition = db_->GetPartition(tpart->index());
230 368294 : partition->EnqueueRemove(tpart, db_entry);
231 368392 : }
232 :
233 2509917 : void DBTableBase::RunNotify(DBTablePartBase *tpart, DBEntryBase *entry) {
234 2509917 : notify_count_++;
235 2509917 : info_->RunNotify(tpart, entry);
236 2510382 : }
237 :
238 3841640 : void DBTableBase::AddToDBStateCount(ListenerId listener, int count) {
239 3841640 : info_->AddToDBStateCount(listener, count);
240 3842668 : }
241 :
242 1293144 : uint64_t DBTableBase::GetDBStateCount(ListenerId listener) {
243 1293144 : return info_->GetDBStateCount(listener);
244 : }
245 :
246 288635 : bool DBTableBase::MayDelete() const {
247 288635 : if (HasListeners()) {
248 0 : return false;
249 : }
250 288635 : if (HasWalkers()) {
251 0 : return false;
252 : }
253 288635 : if (!empty()) {
254 0 : return false;
255 : }
256 :
257 288635 : return true;
258 : }
259 :
260 2963282 : bool DBTableBase::HasListeners() const {
261 2963282 : return !info_->empty();
262 : }
263 :
264 10317 : size_t DBTableBase::GetListenerCount() const {
265 10317 : return info_->size();
266 : }
267 :
268 6663 : void DBTableBase::FillListeners(vector<ShowTableListener> *listeners) const {
269 6663 : info_->FillListeners(listeners);
270 6708 : }
271 :
272 : class DBTable::WalkWorker : public Task {
273 : public:
274 : WalkWorker(TableWalker *walker, int db_partition_id);
275 :
276 : virtual bool Run();
277 :
278 0 : std::string Description() const { return "DBTable::WalkWorker"; }
279 :
280 : private:
281 : // Store the last visited node to continue walk
282 : std::unique_ptr<DBRequestKey> walk_ctx_;
283 :
284 : // Table partition for which this worker was created
285 : DBTablePartition *tbl_partition_;
286 :
287 : TableWalker *walker_;
288 : };
289 :
290 : class DBTable::TableWalker {
291 : public:
292 1530198 : TableWalker(DBTable *table) : table_(table) {
293 1530156 : pending_workers_ = 0;
294 1530245 : }
295 :
296 : void StartWalk();
297 :
298 1055310 : DBTable *table() {
299 1055310 : return table_;
300 : }
301 :
302 226355 : void ClearWalkWorks() {
303 226355 : worker_tasks_.clear();
304 226355 : }
305 :
306 : DBTable *table_;
307 : // check whether iteration is completed on all Table Partition
308 : std::atomic<uint16_t> pending_workers_;
309 : // For debugging purpose. Few of the tasks in this list could has finished
310 : // executing and destroyed. List of workers are useful in debugging with
311 : // gdb/gcore to see the current state of the walk and walk_context
312 : std::list<Task *> worker_tasks_;
313 : };
314 :
315 790588 : bool DBTable::WalkWorker::Run() {
316 790588 : int count = 0;
317 790588 : DBRequestKey *key_resume = walk_ctx_.get();
318 790562 : DBTable *table = walker_->table();
319 790553 : int max_walk_entry_count = table->GetWalkIterationToYield();
320 : DBEntry *entry;
321 :
322 790558 : if (key_resume != NULL) {
323 658228 : std::unique_ptr<const DBEntryBase> start;
324 658228 : start = table->AllocEntry(key_resume);
325 : // Find matching or next in sort order
326 658034 : entry = tbl_partition_->lower_bound(start.get());
327 658373 : } else {
328 132330 : entry = tbl_partition_->GetFirst();
329 : }
330 790436 : if (entry == NULL) {
331 655 : goto walk_done;
332 : }
333 :
334 1579519 : for (DBEntry *next = NULL; entry; entry = next) {
335 1447811 : next = tbl_partition_->GetNext(entry);
336 1447853 : if (count == max_walk_entry_count) {
337 : // store the context
338 658229 : walk_ctx_ = entry->GetDBRequestKey();
339 657417 : return false;
340 : }
341 :
342 : // Invoke walker function
343 789624 : bool more = table->InvokeWalkCb(tbl_partition_, entry);
344 789879 : if (!more) {
345 132 : break;
346 : }
347 :
348 789747 : db_walker_wait();
349 789738 : count++;
350 : }
351 :
352 131708 : walk_done:
353 : // Check whether all other walks on the table is completed
354 132495 : long num_walkers_on_tpart = walker_->pending_workers_.fetch_sub(1);
355 132495 : if (num_walkers_on_tpart == 1) {
356 107410 : table->WalkDone();
357 : }
358 132390 : return true;
359 : }
360 :
361 132390 : DBTable::WalkWorker::WalkWorker(TableWalker *walker, int db_partition_id)
362 132390 : : Task(walker->table()->GetWalkerTaskId(), db_partition_id), walker_(walker) {
363 132390 : tbl_partition_ = static_cast<DBTablePartition *>
364 132390 : (walker_->table()->GetTablePartition(db_partition_id));
365 132390 : }
366 :
367 226355 : void DBTable::TableWalker::StartWalk() {
368 226355 : CHECK_CONCURRENCY("db::Walker");
369 226355 : assert(pending_workers_ == 0);
370 739372 : for (int i = 0; i < table_->PartitionCount(); i++) {
371 : DBTablePartition *partition = static_cast<DBTablePartition *>(
372 513017 : table_->GetTablePartition(i));
373 513017 : if (!partition->size()) continue;
374 132390 : worker_tasks_.push_back(new WalkWorker(this, i));
375 132390 : pending_workers_++;
376 : }
377 226355 : if (pending_workers_ == 0) {
378 118945 : table_->WalkDone();
379 : } else {
380 107410 : TaskScheduler *scheduler = TaskScheduler::GetInstance();
381 239800 : for (auto *task : worker_tasks_) scheduler->Enqueue(task);
382 : }
383 226355 : }
384 :
385 : ///////////////////////////////////////////////////////////
386 : // Implementation of DBTable methods
387 : ///////////////////////////////////////////////////////////
388 1530141 : DBTable::DBTable(DB *db, const string &name)
389 : : DBTableBase(db, name),
390 1530220 : walker_(new TableWalker(this)),
391 3060244 : walker_task_id_(db->task_id()) {
392 :
393 : static bool init_ = false;
394 : static int iter_to_yield_env_ = 0;
395 :
396 1530061 : if (!init_) {
397 : // XXX To be used for testing purposes only.
398 160 : char *count_str = getenv("DB_ITERATION_TO_YIELD");
399 160 : if (count_str) {
400 160 : iter_to_yield_env_ = strtol(count_str, NULL, 0);
401 : } else {
402 0 : iter_to_yield_env_ = kIterationToYield;
403 : }
404 160 : init_ = true;
405 : }
406 1530061 : max_walk_iteration_to_yield_ = iter_to_yield_env_;
407 1530061 : }
408 :
409 1530254 : DBTable::~DBTable() {
410 1530254 : STLDeleteValues(&partitions_);
411 1530254 : }
412 :
413 1522062 : void DBTable::Init() {
414 3597322 : for (int i = 0; i < PartitionCount(); i++) {
415 2075406 : partitions_.push_back(AllocPartition(i));
416 : }
417 1521793 : }
418 :
419 2075308 : DBTablePartition *DBTable::AllocPartition(int index) {
420 2075308 : return new DBTablePartition(this, index);
421 : }
422 :
423 226355 : void DBTable::StartWalk() {
424 226355 : CHECK_CONCURRENCY("db::Walker");
425 226355 : incr_walk_count();
426 226355 : walker_->StartWalk();
427 226355 : }
428 :
429 212886 : DBEntry *DBTable::Add(const DBRequest *req) {
430 212886 : return AllocEntry(req->key.get()).release();
431 : }
432 :
433 1440 : void DBTable::Change(DBEntryBase *entry) {
434 1440 : DBTablePartBase *tpart = GetTablePartition(entry);
435 1440 : tpart->Notify(entry);
436 1440 : }
437 :
438 0 : bool DBTable::OnChange(DBEntry *entry, const DBRequest *req) {
439 0 : return true;
440 : }
441 :
442 0 : bool DBTable::Delete(DBEntry *entry, const DBRequest *req) {
443 0 : return true;
444 : }
445 :
446 1414613 : int DBTable::PartitionCount() const {
447 1414613 : return DB::PartitionCount();
448 : }
449 :
450 16179223 : static size_t HashToPartition(size_t hash) {
451 16179223 : return hash % DB::PartitionCount();
452 : }
453 :
454 19637233 : DBTablePartBase *DBTable::GetTablePartition(const int index) {
455 19637233 : return partitions_[index];
456 : }
457 :
458 24106 : const DBTablePartBase *DBTable::GetTablePartition(const int index) const {
459 24106 : return partitions_[index];
460 : }
461 :
462 708409 : DBTablePartBase *DBTable::GetTablePartition(const DBRequestKey *key) {
463 708409 : int id = HashToPartition(Hash(key));
464 708400 : return GetTablePartition(id);
465 : }
466 :
467 0 : const DBTablePartBase *DBTable::GetTablePartition(
468 : const DBRequestKey *key) const {
469 0 : int id = HashToPartition(Hash(key));
470 0 : return GetTablePartition(id);
471 : }
472 :
473 14981204 : DBTablePartBase *DBTable::GetTablePartition(const DBEntryBase *entry) {
474 14981204 : const DBEntry *gentry = static_cast<const DBEntry *>(entry);
475 14981204 : size_t id = HashToPartition(Hash(gentry));
476 14978907 : return GetTablePartition(id);
477 : }
478 :
479 24106 : const DBTablePartBase *DBTable::GetTablePartition(
480 : const DBEntryBase *entry) const {
481 24106 : const DBEntry *gentry = static_cast<const DBEntry *>(entry);
482 24106 : size_t id = HashToPartition(Hash(gentry));
483 24106 : return GetTablePartition(id);
484 : }
485 :
486 : // Find DB Entry without taking lock. Calling routine must ensure its
487 : // running in exclusion with DB task
488 98 : DBEntry *DBTable::FindNoLock(const DBEntry *entry) {
489 98 : size_t id = HashToPartition(Hash(entry));
490 : DBTablePartition *tbl_partition =
491 98 : static_cast<DBTablePartition *>(GetTablePartition(id));
492 98 : return tbl_partition->FindNoLock(entry);
493 : }
494 :
495 383301 : DBEntry *DBTable::Find(const DBEntry *entry) {
496 383301 : size_t id = HashToPartition(Hash(entry));
497 : DBTablePartition *tbl_partition =
498 383300 : static_cast<DBTablePartition *>(GetTablePartition(id));
499 383300 : return tbl_partition->Find(entry);
500 : }
501 :
502 0 : const DBEntry *DBTable::Find(const DBEntry *entry) const {
503 0 : return const_cast<DBTable *>(this)->Find(entry);
504 : }
505 :
506 : // Find DB Entry without taking lock. Calling routine must ensure its
507 : // running in exclusion with DB task
508 17 : DBEntry *DBTable::FindNoLock(const DBRequestKey *key) {
509 17 : int id = HashToPartition(Hash(key));
510 : DBTablePartition *tbl_partition =
511 17 : static_cast<DBTablePartition *>(GetTablePartition(id));
512 17 : return tbl_partition->FindNoLock(key);
513 : }
514 :
515 85255 : DBEntry *DBTable::Find(const DBRequestKey *key, int id) {
516 85255 : if (id == -1)
517 85227 : id = HashToPartition(Hash(key));
518 : DBTablePartition *tbl_partition =
519 85255 : static_cast<DBTablePartition *>(GetTablePartition(id));
520 85255 : return tbl_partition->Find(key);
521 : }
522 :
523 260 : const DBEntry *DBTable::Find(const DBRequestKey *key, int id) const {
524 260 : return const_cast<DBTable *>(this)->Find(key, id);
525 : }
526 :
527 : //
528 : // Concurrency: called from task that's mutually exclusive with db::DBTable
529 : // or db::IFMapTable as applicable.
530 : //
531 : // Calculate the size across all partitions.
532 : //
533 1885554 : size_t DBTable::Size() const {
534 1885554 : size_t total = 0;
535 1885554 : for (vector<DBTablePartition *>::const_iterator iter = partitions_.begin();
536 6978053 : iter != partitions_.end(); iter++) {
537 5092531 : total += (*iter)->size();
538 : }
539 1885555 : return total;
540 : }
541 :
542 1305 : void DBTable::Input(DBTablePartition *tbl_partition, DBClient *client,
543 : DBRequest *req) {
544 : DBRequestKey *key =
545 1305 : static_cast<DBRequestKey *>(req->key.get());
546 1305 : DBEntry *entry = NULL;
547 :
548 1305 : entry = tbl_partition->Find(key);
549 1305 : if (req->oper == DBRequest::DB_ENTRY_ADD_CHANGE) {
550 689 : if (entry) {
551 353 : if (OnChange(entry, req) || entry->IsDeleted()) {
552 : // The entry may currently be marked as deleted.
553 58 : entry->ClearDelete();
554 58 : tbl_partition->Change(entry);
555 : }
556 : } else {
557 336 : if ((entry = Add(req)) != NULL) {
558 336 : tbl_partition->Add(entry);
559 : }
560 : }
561 616 : } else if (req->oper == DBRequest::DB_ENTRY_DELETE) {
562 356 : if (entry) {
563 356 : if (Delete(entry, req)) {
564 356 : tbl_partition->Delete(entry);
565 : }
566 : }
567 260 : } else if (req->oper == DBRequest::DB_ENTRY_NOTIFY) {
568 260 : if (entry) {
569 260 : tbl_partition->Notify(entry);
570 : }
571 : } else {
572 0 : assert(0);
573 : }
574 1305 : }
575 :
576 3 : void DBTable::DBStateClear(DBTable *table, ListenerId id) {
577 3 : DBEntryBase *next = NULL;
578 :
579 6 : for (int i = 0; i < table->PartitionCount(); ++i) {
580 : DBTablePartition *partition = static_cast<DBTablePartition *>(
581 3 : table->GetTablePartition(i));
582 :
583 3 : for (DBEntryBase *entry = partition->GetFirst(); entry; entry = next) {
584 0 : next = partition->GetNext(entry);
585 0 : DBState *state = entry->GetState(table, id);
586 0 : if (state) {
587 0 : entry->ClearState(table, id);
588 0 : delete state;
589 : }
590 : }
591 : }
592 3 : }
593 :
594 : //
595 : // Callback for table walk triggered by NotifyAllEntries.
596 : //
597 129479 : bool DBTable::WalkCallback(DBTablePartBase *tpart, DBEntryBase *entry) {
598 129479 : tpart->Notify(entry);
599 129484 : return true;
600 : }
601 :
602 : //
603 : // Callback for completion of table walk triggered by NotifyAllEntries.
604 : //
605 61308 : void DBTable::WalkCompleteCallback(DBTableBase *tbl_base) {
606 61308 : walk_ref_.reset();
607 61308 : }
608 :
609 : //
610 : // Concurrency: called from task that's mutually exclusive with db::DBTable
611 : // or db::IFMapTable as applicable.
612 : //
613 : // Trigger notification of all entries to all listeners.
614 : // Should be used sparingly e.g. to handle significant configuration change.
615 : //
616 : // The walk callback just turns around and puts the DBentryBase on the change
617 : // list.
618 : //
619 : // If the walk is already running, it is allowed to complete and WalkAgain API
620 : // is invoked to trigger walk on current walk completion.
621 : //
622 63101 : void DBTable::NotifyAllEntries() {
623 63101 : CHECK_CONCURRENCY("bgp::Config", "bgp::ConfigHelper", "bgp::RTFilter",
624 : "db::DBTable");
625 :
626 63100 : if (empty())
627 1793 : return;
628 :
629 61308 : if (walk_ref_ == NULL) {
630 : walk_ref_ =
631 122616 : AllocWalker(boost::bind(&DBTable::WalkCallback, this, _1, _2),
632 61308 : boost::bind(&DBTable::WalkCompleteCallback, this, _2));
633 61308 : WalkTable(walk_ref_);
634 : } else {
635 0 : WalkAgain(walk_ref_);
636 : }
637 : }
638 :
639 219357 : DBTable::DBTableWalkRef DBTable::AllocWalker(WalkFn walk_fn,
640 : WalkCompleteFn walk_complete) {
641 219357 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
642 219357 : return walk_mgr->AllocWalker(this, walk_fn, walk_complete);
643 : }
644 :
645 157733 : void DBTable::ReleaseWalker(DBTable::DBTableWalkRef &walk) {
646 157733 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
647 157733 : walk_mgr->ReleaseWalker(walk);
648 157733 : return;
649 : }
650 :
651 226827 : void DBTable::WalkTable(DBTable::DBTableWalkRef walk) {
652 226827 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
653 226827 : walk_mgr->WalkTable(walk);
654 226827 : return;
655 : }
656 :
657 29297 : void DBTable::WalkAgain(DBTable::DBTableWalkRef walk) {
658 29297 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
659 29297 : walk_mgr->WalkAgain(walk);
660 29297 : return;
661 : }
662 :
663 789933 : bool DBTable::InvokeWalkCb(DBTablePartBase *part, DBEntryBase *entry) {
664 789933 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
665 789736 : return walk_mgr->InvokeWalkCb(part, entry);
666 : }
667 :
668 226355 : void DBTable::WalkDone() {
669 226355 : incr_walk_complete_count();
670 226355 : walker_->ClearWalkWorks();
671 226355 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
672 226355 : return walk_mgr->WalkDone();
673 : }
|
