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 19610 : DBRequest::DBRequest() : oper(static_cast<DBOperation>(0)) {
33 19610 : }
34 :
35 20248 : 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 20248 : assert(key_has_destructor && data_has_destructor);
41 : #endif
42 : #endif
43 20248 : }
44 :
45 9786 : void DBRequest::Swap(DBRequest *rhs) {
46 9786 : swap(oper, rhs->oper);
47 9786 : swap(key, rhs->key);
48 9786 : swap(data, rhs->data);
49 9786 : }
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 4478 : AtomicWithCopy(const AtomicWithCopy& other) : std::atomic<_Tp>(other.load()) {}
65 :
66 : // Custom assignment operator
67 17175 : AtomicWithCopy& operator=(const AtomicWithCopy& other) {
68 34350 : this->store(other.load());
69 17175 : 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 89115 : explicit ListenerInfo(const string &table_name) :
80 89115 : db_state_accounting_(true) {
81 89115 : 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 85651 : db_state_accounting_ = false;
85 : }
86 89115 : }
87 :
88 17175 : DBTableBase::ListenerId Register(ChangeCallback callback,
89 : const string &name) {
90 17175 : tbb::spin_rw_mutex::scoped_lock write_lock(rw_mutex_, true);
91 17175 : size_t i = bmap_.find_first();
92 17175 : if (i == bmap_.npos) {
93 17175 : i = callbacks_.size();
94 17175 : callbacks_.push_back(callback);
95 17175 : names_.push_back(name);
96 17175 : state_count_.resize(i + 1);
97 17175 : state_count_[i] = AtomicWithCopy<uint64_t>(0);
98 : } else {
99 0 : bmap_.reset(i);
100 0 : if (bmap_.none()) {
101 0 : bmap_.clear();
102 : }
103 0 : callbacks_[i] = callback;
104 0 : names_[i] = name;
105 0 : state_count_[i] = 0;
106 : }
107 17175 : return i;
108 17175 : }
109 :
110 17143 : void Unregister(ListenerId listener) {
111 17143 : tbb::spin_rw_mutex::scoped_lock write_lock(rw_mutex_, true);
112 17143 : callbacks_[listener] = NULL;
113 17142 : names_[listener] = "";
114 : // During Unregister Listener should have cleaned up,
115 : // DB states from all the entries in this table.
116 17142 : assert(state_count_[listener] == 0);
117 17142 : if ((size_t) listener == callbacks_.size() - 1) {
118 33393 : while (!callbacks_.empty() && callbacks_.back() == NULL) {
119 17104 : callbacks_.pop_back();
120 17104 : names_.pop_back();
121 17104 : state_count_.pop_back();
122 : }
123 16290 : if (bmap_.size() > callbacks_.size()) {
124 777 : bmap_.resize(callbacks_.size());
125 : }
126 : } else {
127 853 : if ((size_t) listener >= bmap_.size()) {
128 785 : bmap_.resize(listener + 1);
129 : }
130 853 : bmap_.set(listener);
131 : }
132 17143 : }
133 :
134 : // concurrency: called from DBPartition task.
135 11368 : void RunNotify(DBTablePartBase *tpart, DBEntryBase *entry) {
136 11368 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
137 11368 : for (CallbackList::iterator iter = callbacks_.begin();
138 23125 : iter != callbacks_.end(); ++iter) {
139 11757 : if (*iter != NULL) {
140 11749 : ChangeCallback cb = *iter;
141 11749 : (cb)(tpart, entry);
142 11749 : }
143 : }
144 11368 : }
145 :
146 13215 : void AddToDBStateCount(ListenerId listener, int count) {
147 13215 : if (db_state_accounting_ && listener != DBTableBase::kInvalidId) {
148 1695 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
149 1696 : state_count_[listener] += count;
150 1696 : }
151 13215 : }
152 :
153 1906 : uint64_t GetDBStateCount(ListenerId listener) {
154 1906 : assert(db_state_accounting_ && listener != DBTableBase::kInvalidId);
155 1906 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
156 3812 : return state_count_[listener];
157 1906 : }
158 :
159 0 : void FillListeners(vector<ShowTableListener> *listeners) const {
160 0 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
161 0 : ListenerId id = 0;
162 0 : for (CallbackList::const_iterator iter = callbacks_.begin();
163 0 : iter != callbacks_.end(); ++iter, ++id) {
164 0 : if (*iter != NULL) {
165 0 : ShowTableListener item;
166 0 : item.id = id;
167 0 : item.name = names_[id];
168 0 : item.state_count = state_count_[id];
169 0 : listeners->push_back(item);
170 0 : }
171 : }
172 0 : }
173 :
174 115350 : bool empty() const {
175 115350 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
176 230700 : return callbacks_.empty();
177 115350 : }
178 :
179 0 : size_t size() const {
180 0 : tbb::spin_rw_mutex::scoped_lock read_lock(rw_mutex_, false);
181 0 : return (callbacks_.size() - bmap_.count());
182 0 : }
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 89115 : DBTableBase::DBTableBase(DB *db, const string &name)
194 89115 : : db_(db), name_(name), info_(new ListenerInfo(name)),
195 89115 : enqueue_count_(0), input_count_(0), notify_count_(0) {
196 89115 : walker_count_ = 0;
197 89115 : walk_request_count_ = 0;
198 89115 : walk_complete_count_ = 0;
199 89115 : walk_cancel_count_ = 0;
200 89115 : walk_again_count_ = 0;
201 89115 : walk_count_ = 0;
202 89115 : }
203 :
204 89115 : DBTableBase::~DBTableBase() {
205 89115 : }
206 :
207 17175 : DBTableBase::ListenerId DBTableBase::Register(ChangeCallback callback,
208 : const string &name) {
209 17175 : return info_->Register(callback, name);
210 : }
211 :
212 17143 : void DBTableBase::Unregister(ListenerId listener) {
213 17143 : 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 17143 : if (info_->empty())
217 15012 : RetryDelete();
218 17143 : }
219 :
220 9749 : bool DBTableBase::Enqueue(DBRequest *req) {
221 9749 : DBTablePartBase *tpart = GetTablePartition(req->key.get());
222 9748 : DBPartition *partition = db_->GetPartition(tpart->index());
223 9748 : enqueue_count_++;
224 9748 : return partition->EnqueueRequest(tpart, NULL, req);
225 : }
226 :
227 268 : void DBTableBase::EnqueueRemove(DBEntryBase *db_entry) {
228 268 : DBTablePartBase *tpart = GetTablePartition(db_entry);
229 268 : DBPartition *partition = db_->GetPartition(tpart->index());
230 268 : partition->EnqueueRemove(tpart, db_entry);
231 268 : }
232 :
233 11368 : void DBTableBase::RunNotify(DBTablePartBase *tpart, DBEntryBase *entry) {
234 11368 : notify_count_++;
235 11368 : info_->RunNotify(tpart, entry);
236 11368 : }
237 :
238 13215 : void DBTableBase::AddToDBStateCount(ListenerId listener, int count) {
239 13215 : info_->AddToDBStateCount(listener, count);
240 13215 : }
241 :
242 1906 : uint64_t DBTableBase::GetDBStateCount(ListenerId listener) {
243 1906 : return info_->GetDBStateCount(listener);
244 : }
245 :
246 3426 : bool DBTableBase::MayDelete() const {
247 3426 : if (HasListeners()) {
248 0 : return false;
249 : }
250 3426 : if (HasWalkers()) {
251 0 : return false;
252 : }
253 3426 : if (!empty()) {
254 0 : return false;
255 : }
256 :
257 3426 : return true;
258 : }
259 :
260 98207 : bool DBTableBase::HasListeners() const {
261 98207 : return !info_->empty();
262 : }
263 :
264 0 : size_t DBTableBase::GetListenerCount() const {
265 0 : return info_->size();
266 : }
267 :
268 0 : void DBTableBase::FillListeners(vector<ShowTableListener> *listeners) const {
269 0 : info_->FillListeners(listeners);
270 0 : }
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 89115 : TableWalker(DBTable *table) : table_(table) {
293 89115 : pending_workers_ = 0;
294 89115 : }
295 :
296 : void StartWalk();
297 :
298 419 : DBTable *table() {
299 419 : return table_;
300 : }
301 :
302 1234 : void ClearWalkWorks() {
303 1234 : worker_tasks_.clear();
304 1234 : }
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 209 : bool DBTable::WalkWorker::Run() {
316 209 : int count = 0;
317 209 : DBRequestKey *key_resume = walk_ctx_.get();
318 209 : DBTable *table = walker_->table();
319 209 : int max_walk_entry_count = table->GetWalkIterationToYield();
320 : DBEntry *entry;
321 :
322 209 : if (key_resume != NULL) {
323 104 : std::unique_ptr<const DBEntryBase> start;
324 104 : start = table->AllocEntry(key_resume);
325 : // Find matching or next in sort order
326 104 : entry = tbl_partition_->lower_bound(start.get());
327 104 : } else {
328 105 : entry = tbl_partition_->GetFirst();
329 : }
330 209 : if (entry == NULL) {
331 0 : goto walk_done;
332 : }
333 :
334 418 : for (DBEntry *next = NULL; entry; entry = next) {
335 313 : next = tbl_partition_->GetNext(entry);
336 313 : if (count == max_walk_entry_count) {
337 : // store the context
338 104 : walk_ctx_ = entry->GetDBRequestKey();
339 104 : return false;
340 : }
341 :
342 : // Invoke walker function
343 209 : bool more = table->InvokeWalkCb(tbl_partition_, entry);
344 209 : if (!more) {
345 0 : break;
346 : }
347 :
348 209 : db_walker_wait();
349 209 : count++;
350 : }
351 :
352 105 : walk_done:
353 : // Check whether all other walks on the table is completed
354 105 : long num_walkers_on_tpart = walker_->pending_workers_.fetch_sub(1);
355 105 : if (num_walkers_on_tpart == 1) {
356 105 : table->WalkDone();
357 : }
358 105 : return true;
359 : }
360 :
361 105 : DBTable::WalkWorker::WalkWorker(TableWalker *walker, int db_partition_id)
362 105 : : Task(walker->table()->GetWalkerTaskId(), db_partition_id), walker_(walker) {
363 105 : tbl_partition_ = static_cast<DBTablePartition *>
364 105 : (walker_->table()->GetTablePartition(db_partition_id));
365 105 : }
366 :
367 1234 : void DBTable::TableWalker::StartWalk() {
368 1234 : CHECK_CONCURRENCY("db::Walker");
369 1234 : assert(pending_workers_ == 0);
370 5582 : for (int i = 0; i < table_->PartitionCount(); i++) {
371 : DBTablePartition *partition = static_cast<DBTablePartition *>(
372 4348 : table_->GetTablePartition(i));
373 4348 : if (!partition->size()) continue;
374 105 : worker_tasks_.push_back(new WalkWorker(this, i));
375 105 : pending_workers_++;
376 : }
377 1234 : if (pending_workers_ == 0) {
378 1129 : table_->WalkDone();
379 : } else {
380 105 : TaskScheduler *scheduler = TaskScheduler::GetInstance();
381 210 : for (auto *task : worker_tasks_) scheduler->Enqueue(task);
382 : }
383 1234 : }
384 :
385 : ///////////////////////////////////////////////////////////
386 : // Implementation of DBTable methods
387 : ///////////////////////////////////////////////////////////
388 89115 : DBTable::DBTable(DB *db, const string &name)
389 : : DBTableBase(db, name),
390 89115 : walker_(new TableWalker(this)),
391 178230 : walker_task_id_(db->task_id()) {
392 :
393 : static bool init_ = false;
394 : static int iter_to_yield_env_ = 0;
395 :
396 89115 : if (!init_) {
397 : // XXX To be used for testing purposes only.
398 20 : char *count_str = getenv("DB_ITERATION_TO_YIELD");
399 20 : if (count_str) {
400 20 : iter_to_yield_env_ = strtol(count_str, NULL, 0);
401 : } else {
402 0 : iter_to_yield_env_ = kIterationToYield;
403 : }
404 20 : init_ = true;
405 : }
406 89115 : max_walk_iteration_to_yield_ = iter_to_yield_env_;
407 89115 : }
408 :
409 89115 : DBTable::~DBTable() {
410 89115 : STLDeleteValues(&partitions_);
411 89115 : }
412 :
413 89115 : void DBTable::Init() {
414 186210 : for (int i = 0; i < PartitionCount(); i++) {
415 97095 : partitions_.push_back(AllocPartition(i));
416 : }
417 89115 : }
418 :
419 97071 : DBTablePartition *DBTable::AllocPartition(int index) {
420 97071 : return new DBTablePartition(this, index);
421 : }
422 :
423 1234 : void DBTable::StartWalk() {
424 1234 : CHECK_CONCURRENCY("db::Walker");
425 1234 : incr_walk_count();
426 1234 : walker_->StartWalk();
427 1234 : }
428 :
429 70 : DBEntry *DBTable::Add(const DBRequest *req) {
430 70 : return AllocEntry(req->key.get()).release();
431 : }
432 :
433 1282 : void DBTable::Change(DBEntryBase *entry) {
434 1282 : DBTablePartBase *tpart = GetTablePartition(entry);
435 1282 : tpart->Notify(entry);
436 1282 : }
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 18490 : int DBTable::PartitionCount() const {
447 18490 : return DB::PartitionCount();
448 : }
449 :
450 68320 : static size_t HashToPartition(size_t hash) {
451 68320 : return hash % DB::PartitionCount();
452 : }
453 :
454 188186 : DBTablePartBase *DBTable::GetTablePartition(const int index) {
455 188186 : return partitions_[index];
456 : }
457 :
458 0 : const DBTablePartBase *DBTable::GetTablePartition(const int index) const {
459 0 : return partitions_[index];
460 : }
461 :
462 10383 : DBTablePartBase *DBTable::GetTablePartition(const DBRequestKey *key) {
463 10383 : int id = HashToPartition(Hash(key));
464 10383 : 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 41887 : DBTablePartBase *DBTable::GetTablePartition(const DBEntryBase *entry) {
474 41887 : const DBEntry *gentry = static_cast<const DBEntry *>(entry);
475 41887 : size_t id = HashToPartition(Hash(gentry));
476 41886 : return GetTablePartition(id);
477 : }
478 :
479 0 : const DBTablePartBase *DBTable::GetTablePartition(
480 : const DBEntryBase *entry) const {
481 0 : const DBEntry *gentry = static_cast<const DBEntry *>(entry);
482 0 : size_t id = HashToPartition(Hash(gentry));
483 0 : 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 4 : DBEntry *DBTable::FindNoLock(const DBEntry *entry) {
489 4 : size_t id = HashToPartition(Hash(entry));
490 : DBTablePartition *tbl_partition =
491 4 : static_cast<DBTablePartition *>(GetTablePartition(id));
492 4 : return tbl_partition->FindNoLock(entry);
493 : }
494 :
495 14512 : DBEntry *DBTable::Find(const DBEntry *entry) {
496 14512 : size_t id = HashToPartition(Hash(entry));
497 : DBTablePartition *tbl_partition =
498 14512 : static_cast<DBTablePartition *>(GetTablePartition(id));
499 14512 : 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 2 : DBEntry *DBTable::FindNoLock(const DBRequestKey *key) {
509 2 : int id = HashToPartition(Hash(key));
510 : DBTablePartition *tbl_partition =
511 2 : static_cast<DBTablePartition *>(GetTablePartition(id));
512 2 : return tbl_partition->FindNoLock(key);
513 : }
514 :
515 1534 : DBEntry *DBTable::Find(const DBRequestKey *key, int id) {
516 1534 : if (id == -1)
517 1534 : id = HashToPartition(Hash(key));
518 : DBTablePartition *tbl_partition =
519 1534 : static_cast<DBTablePartition *>(GetTablePartition(id));
520 1534 : return tbl_partition->Find(key);
521 : }
522 :
523 0 : const DBEntry *DBTable::Find(const DBRequestKey *key, int id) const {
524 0 : 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 11717 : size_t DBTable::Size() const {
534 11717 : size_t total = 0;
535 11717 : for (vector<DBTablePartition *>::const_iterator iter = partitions_.begin();
536 47476 : iter != partitions_.end(); iter++) {
537 35759 : total += (*iter)->size();
538 : }
539 11717 : return total;
540 : }
541 :
542 496 : void DBTable::Input(DBTablePartition *tbl_partition, DBClient *client,
543 : DBRequest *req) {
544 : DBRequestKey *key =
545 496 : static_cast<DBRequestKey *>(req->key.get());
546 496 : DBEntry *entry = NULL;
547 :
548 496 : entry = tbl_partition->Find(key);
549 496 : if (req->oper == DBRequest::DB_ENTRY_ADD_CHANGE) {
550 301 : if (entry) {
551 178 : if (OnChange(entry, req) || entry->IsDeleted()) {
552 : // The entry may currently be marked as deleted.
553 22 : entry->ClearDelete();
554 22 : tbl_partition->Change(entry);
555 : }
556 : } else {
557 123 : if ((entry = Add(req)) != NULL) {
558 123 : tbl_partition->Add(entry);
559 : }
560 : }
561 195 : } else if (req->oper == DBRequest::DB_ENTRY_DELETE) {
562 132 : if (entry) {
563 132 : if (Delete(entry, req)) {
564 132 : tbl_partition->Delete(entry);
565 : }
566 : }
567 63 : } else if (req->oper == DBRequest::DB_ENTRY_NOTIFY) {
568 63 : if (entry) {
569 63 : tbl_partition->Notify(entry);
570 : }
571 : } else {
572 0 : assert(0);
573 : }
574 496 : }
575 :
576 1 : void DBTable::DBStateClear(DBTable *table, ListenerId id) {
577 1 : DBEntryBase *next = NULL;
578 :
579 2 : for (int i = 0; i < table->PartitionCount(); ++i) {
580 : DBTablePartition *partition = static_cast<DBTablePartition *>(
581 1 : table->GetTablePartition(i));
582 :
583 1 : 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 1 : }
593 :
594 : //
595 : // Callback for table walk triggered by NotifyAllEntries.
596 : //
597 0 : bool DBTable::WalkCallback(DBTablePartBase *tpart, DBEntryBase *entry) {
598 0 : tpart->Notify(entry);
599 0 : return true;
600 : }
601 :
602 : //
603 : // Callback for completion of table walk triggered by NotifyAllEntries.
604 : //
605 0 : void DBTable::WalkCompleteCallback(DBTableBase *tbl_base) {
606 0 : walk_ref_.reset();
607 0 : }
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 0 : void DBTable::NotifyAllEntries() {
623 0 : CHECK_CONCURRENCY("bgp::Config", "bgp::ConfigHelper", "bgp::RTFilter",
624 : "db::DBTable");
625 :
626 0 : if (empty())
627 0 : return;
628 :
629 0 : if (walk_ref_ == NULL) {
630 : walk_ref_ =
631 0 : AllocWalker(boost::bind(&DBTable::WalkCallback, this, _1, _2),
632 0 : boost::bind(&DBTable::WalkCompleteCallback, this, _2));
633 0 : WalkTable(walk_ref_);
634 : } else {
635 0 : WalkAgain(walk_ref_);
636 : }
637 : }
638 :
639 1304 : DBTable::DBTableWalkRef DBTable::AllocWalker(WalkFn walk_fn,
640 : WalkCompleteFn walk_complete) {
641 1304 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
642 1304 : return walk_mgr->AllocWalker(this, walk_fn, walk_complete);
643 : }
644 :
645 1201 : void DBTable::ReleaseWalker(DBTable::DBTableWalkRef &walk) {
646 1201 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
647 1201 : walk_mgr->ReleaseWalker(walk);
648 1201 : return;
649 : }
650 :
651 1121 : void DBTable::WalkTable(DBTable::DBTableWalkRef walk) {
652 1121 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
653 1121 : walk_mgr->WalkTable(walk);
654 1121 : return;
655 : }
656 :
657 160 : void DBTable::WalkAgain(DBTable::DBTableWalkRef walk) {
658 160 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
659 160 : walk_mgr->WalkAgain(walk);
660 160 : return;
661 : }
662 :
663 209 : bool DBTable::InvokeWalkCb(DBTablePartBase *part, DBEntryBase *entry) {
664 209 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
665 209 : return walk_mgr->InvokeWalkCb(part, entry);
666 : }
667 :
668 1234 : void DBTable::WalkDone() {
669 1234 : incr_walk_complete_count();
670 1234 : walker_->ClearWalkWorks();
671 1234 : DBTableWalkMgr *walk_mgr = database()->GetWalkMgr();
672 1234 : return walk_mgr->WalkDone();
673 : }
|
