/
bgp_peer_close.cc
630 lines (551 loc) · 21.1 KB
/
bgp_peer_close.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
/*
* Copyright (c) 2013 Juniper Networks, Inc. All rights reserved.
*/
#include "bgp/bgp_peer_close.h"
#include <boost/foreach.hpp>
#include <list>
#include "base/task_annotations.h"
#include "base/timer.h"
#include "bgp/bgp_log.h"
#include "bgp/bgp_membership.h"
#include "bgp/bgp_peer_types.h"
#include "bgp/bgp_route.h"
#include "bgp/bgp_server.h"
#include "bgp/routing-instance/routing_instance.h"
#include "net/community_type.h"
#define PEER_CLOSE_MANAGER_LOG(msg) \
BGP_LOG_PEER(Event, peer_close_->peer(), SandeshLevel::SYS_INFO, \
BGP_LOG_FLAG_ALL, BGP_PEER_DIR_NA, \
"PeerCloseManager: State " << GetStateName(state_) << \
", MembershipState: " << GetMembershipStateName(membership_state_) << \
", MembershipReqPending: " << membership_req_pending_ << \
", CloseAgain?: " << (close_again_ ? "Yes" : "No") << ": " << msg);
#define PEER_CLOSE_MANAGER_TABLE_LOG(msg) \
BGP_LOG_PEER_TABLE(peer_close_->peer(), SandeshLevel::SYS_INFO, \
BGP_LOG_FLAG_ALL, table, \
"PeerCloseManager: State " << GetStateName(state_) << \
", MembershipState: " << GetMembershipStateName(membership_state_) << \
", MembershipReqPending: " << membership_req_pending_ << \
", CloseAgain?: " << (close_again_ ? "Yes" : "No") << ": " << msg);
#define MOVE_TO_STATE(state) \
do { \
assert(state_ != state); \
PEER_CLOSE_MANAGER_LOG("Move to state " << GetStateName(state)); \
state_ = state; \
} while (false)
// Create an instance of PeerCloseManager with back reference to parent IPeer
PeerCloseManager::PeerCloseManager(IPeerClose *peer_close,
boost::asio::io_service &io_service) :
peer_close_(peer_close), stale_timer_(NULL), sweep_timer_(NULL),
stale_notify_timer_(NULL),
state_(NONE), close_again_(false), non_graceful_(false), gr_elapsed_(0),
llgr_elapsed_(0), membership_state_(MEMBERSHIP_NONE) {
stats_.init++;
membership_req_pending_ = 0;
stale_timer_ = TimerManager::CreateTimer(io_service,
"Graceful Restart StaleTimer",
TaskScheduler::GetInstance()->GetTaskId("bgp::Config"), 0);
sweep_timer_ = TimerManager::CreateTimer(io_service,
"Graceful Restart SweepTimer",
TaskScheduler::GetInstance()->GetTaskId("bgp::Config"), 0);
stale_notify_timer_ = TimerManager::CreateTimer(io_service,
"Graceful Restart StaleNotifyTimer",
TaskScheduler::GetInstance()->GetTaskId("bgp::Config"), 0);
}
// Create an instance of PeerCloseManager with back reference to parent IPeer
PeerCloseManager::PeerCloseManager(IPeerClose *peer_close) :
peer_close_(peer_close), stale_timer_(NULL), sweep_timer_(NULL),
stale_notify_timer_(NULL),
state_(NONE), close_again_(false), non_graceful_(false), gr_elapsed_(0),
llgr_elapsed_(0), membership_state_(MEMBERSHIP_NONE) {
stats_.init++;
membership_req_pending_ = 0;
if (peer_close->peer() && peer_close->peer()->server()) {
stale_timer_ = TimerManager::CreateTimer(
*peer_close->peer()->server()->ioservice(),
"Graceful Restart StaleTimer",
TaskScheduler::GetInstance()->GetTaskId("bgp::Config"), 0);
sweep_timer_ = TimerManager::CreateTimer(
*peer_close->peer()->server()->ioservice(),
"Graceful Restart SweepTimer",
TaskScheduler::GetInstance()->GetTaskId("bgp::Config"), 0);
stale_notify_timer_ = TimerManager::CreateTimer(
*peer_close->peer()->server()->ioservice(),
"Graceful Restart StaleNotifyTimer",
TaskScheduler::GetInstance()->GetTaskId("bgp::Config"), 0);
}
}
PeerCloseManager::~PeerCloseManager() {
TimerManager::DeleteTimer(stale_timer_);
TimerManager::DeleteTimer(sweep_timer_);
TimerManager::DeleteTimer(stale_notify_timer_);
}
std::string PeerCloseManager::GetStateName(State state) const {
switch (state) {
case NONE:
return "NONE";
case GR_TIMER:
return "GR_TIMER";
case STALE:
return "STALE";
case LLGR_STALE:
return "LLGR_STALE";
case LLGR_TIMER:
return "LLGR_TIMER";
case SWEEP:
return "SWEEP";
case DELETE:
return "DELETE";
}
assert(false);
return "";
}
std::string PeerCloseManager::GetMembershipStateName(
MembershipState state) const {
switch (state) {
case MEMBERSHIP_NONE:
return "NONE";
case MEMBERSHIP_IN_USE:
return "IN_USE";
case MEMBERSHIP_IN_WAIT:
return "IN_WAIT";
}
assert(false);
return "";
}
// Trigger closure of an IPeer
//
// Graceful close_state_: NONE
// RibIn Stale Marking and Ribout deletion close_state_: STALE
// StateMachine restart and GR timer start close_state_: GR_TIMER
//
// Peer IsReady() in GR timer callback (or via reception of all EoRs)
// RibIn Sweep and Ribout Generation close_state_: SWEEP
// MembershipRequestCallback close_state_: NONE
//
// Peer not IsReady() in GR timer callback
// If LLGR supported close_state_: LLGR_STALE
// RibIn Stale marking with LLGR_STALE community close_state_: LLGR_TIMER
//
// Peer not IsReady() in LLGR timer callback
// RibIn Delete close_state_: DELETE
// MembershipRequestCallback close_state_: NONE
//
// Peer IsReady() in LLGR timer callback (or via reception of all EoRs)
// RibIn Sweep close_state_: SWEEP
// MembershipRequestCallback close_state_: NONE
//
// If LLGR is not supported
// RibIn Delete close_state_: DELETE
// MembershipRequestCallback close_state_: NONE
//
// Close() call during any state other than NONE and DELETE
// Cancel GR timer and restart GR Closure all over again
//
// NonGraceful close_state_ = * (except DELETE)
// A. RibIn deletion and Ribout deletion close_state_ = DELETE
// B. MembershipRequestCallback => Peers delete/StateMachine restart
// close_state_ = NONE
//
// If Close is restarted, account for GR timer's elapsed time.
//
// Use non_graceful as true for non-graceful closure
void PeerCloseManager::Close(bool non_graceful) {
tbb::mutex::scoped_lock lock(mutex_);
// Note down non-graceful close trigger. Once non-graceful closure is
// triggered, it should remain so until close process is complete. Further
// graceful closure calls until then should remain non-graceful.
non_graceful_ |= non_graceful;
CloseInternal();
}
void PeerCloseManager::CloseInternal() {
stats_.close++;
// Ignore nested closures
if (close_again_) {
PEER_CLOSE_MANAGER_LOG("Nested close calls ignored");
return;
}
switch (state_) {
case NONE:
ProcessClosure();
break;
case GR_TIMER:
PEER_CLOSE_MANAGER_LOG("Nested close: Restart GR");
close_again_ = true;
stats_.nested++;
gr_elapsed_ += stale_timer_->GetElapsedTime();
CloseComplete();
break;
case LLGR_TIMER:
PEER_CLOSE_MANAGER_LOG("Nested close: Restart LLGR");
close_again_ = true;
stats_.nested++;
llgr_elapsed_ += stale_timer_->GetElapsedTime();
CloseComplete();
break;
case STALE:
case LLGR_STALE:
case SWEEP:
case DELETE:
PEER_CLOSE_MANAGER_LOG("Nested close");
close_again_ = true;
stats_.nested++;
break;
}
}
bool PeerCloseManager::GRTimerFired() const {
return stale_timer_->fired();
}
void PeerCloseManager::ProcessEORMarkerReceived(Address::Family family) {
if (GRTimerFired()) {
assert(state_ == GR_TIMER || state_ == LLGR_TIMER);
families_.erase(family);
return;
}
tbb::mutex::scoped_lock lock(mutex_);
if ((state_ == GR_TIMER || state_ == LLGR_TIMER) && !families_.empty()) {
families_.erase(family);
// Start the timer if all EORs have been received.
if (families_.empty())
StartRestartTimer(0);
}
}
// Process RibIn staling related activities during peer closure
// Return true if at least ome time is started, false otherwise
void PeerCloseManager::StartRestartTimer(int time) {
stale_timer_->Cancel();
PEER_CLOSE_MANAGER_LOG("GR Timer started to fire after " << time <<
" seconds");
stale_timer_->Start(time,
boost::bind(&PeerCloseManager::RestartTimerCallback, this));
}
bool PeerCloseManager::RestartTimerCallback() {
CHECK_CONCURRENCY("bgp::Config");
tbb::mutex::scoped_lock lock(mutex_);
PEER_CLOSE_MANAGER_LOG("GR Timer callback started");
if (state_ != GR_TIMER && state_ != LLGR_TIMER)
return false;
if (peer_close_->IsReady() && !families_.empty()) {
// Fake reception of all EORs.
for (IPeerClose::Families::iterator i = families_.begin(), next = i;
i != families_.end(); i = next) {
next++;
PEER_CLOSE_MANAGER_LOG("Simulate EoR reception for family " << *i);
peer_close_->ReceiveEndOfRIB(*i);
}
// Restart the timer to fire right away.
stale_timer_->Reschedule(0);
return true;
}
ProcessClosure();
return false;
}
// Route stale timer callback. If the peer has come back up, sweep routes for
// those address families that are still active. Delete the rest
void PeerCloseManager::ProcessClosure() {
// If the peer is back up and this address family is still supported,
// sweep old paths which may not have come back in the new session
switch (state_) {
case NONE:
if (non_graceful_ || !peer_close_->IsCloseGraceful()) {
MOVE_TO_STATE(DELETE);
stats_.deletes++;
} else {
MOVE_TO_STATE(STALE);
stats_.stale++;
StaleNotify();
return;
}
break;
case GR_TIMER:
if (peer_close_->IsReady()) {
MOVE_TO_STATE(SWEEP);
gr_elapsed_ = 0;
llgr_elapsed_ = 0;
stats_.sweep++;
break;
}
if (peer_close_->IsCloseLongLivedGraceful()) {
MOVE_TO_STATE(LLGR_STALE);
stats_.llgr_stale++;
peer_close_->LongLivedGracefulRestartStale();
break;
}
MOVE_TO_STATE(DELETE);
stats_.deletes++;
break;
case LLGR_TIMER:
if (peer_close_->IsReady()) {
MOVE_TO_STATE(SWEEP);
gr_elapsed_ = 0;
llgr_elapsed_ = 0;
stats_.sweep++;
break;
}
MOVE_TO_STATE(DELETE);
stats_.deletes++;
break;
case STALE:
case LLGR_STALE:
case SWEEP:
case DELETE:
assert(false);
return;
}
if (state_ == DELETE)
peer_close_->CustomClose();
MembershipRequestInternal();
}
void PeerCloseManager::CloseComplete() {
MOVE_TO_STATE(NONE);
stale_timer_->Cancel();
sweep_timer_->Cancel();
families_.clear();
stats_.init++;
// Nested closures trigger fresh GR
if (close_again_) {
close_again_ = false;
CloseInternal();
}
}
bool PeerCloseManager::ProcessSweepStateActions() {
CHECK_CONCURRENCY("bgp::Config");
assert(state_ == SWEEP);
// Notify clients to trigger sweep as appropriate.
peer_close_->GracefulRestartSweep();
CloseComplete();
return false;
}
void PeerCloseManager::TriggerSweepStateActions() {
PEER_CLOSE_MANAGER_LOG("Sweep Timer started to fire right away");
sweep_timer_->Cancel();
sweep_timer_->Start(0,
boost::bind(&PeerCloseManager::ProcessSweepStateActions, this));
}
bool PeerCloseManager::NotifyStaleEvent() {
CHECK_CONCURRENCY("bgp::Config");
peer_close_->GracefulRestartStale();
MembershipRequestInternal();
return false;
}
// Notify clients about entering Stale event. Do this through a timer callback
// off bgp::Config to solve concurrency issues in the client.
void PeerCloseManager::StaleNotify() {
PEER_CLOSE_MANAGER_LOG("Stale Notify Timer started to fire right away");
stale_notify_timer_->Cancel();
stale_notify_timer_->Start(0,
boost::bind(&PeerCloseManager::NotifyStaleEvent, this));
}
void PeerCloseManager::MembershipRequest() {
tbb::mutex::scoped_lock lock(mutex_);
MembershipRequestInternal();
}
bool PeerCloseManager::CanUseMembershipManager() const {
return peer_close_->peer()->CanUseMembershipManager();
}
BgpMembershipManager *PeerCloseManager::membership_mgr() const {
return peer_close_->peer()->server()->membership_mgr();
}
void PeerCloseManager::MembershipRequestInternal() {
assert(membership_state() != MEMBERSHIP_IN_USE);
// Pause if membership manager is not ready for usage.
if (!CanUseMembershipManager()) {
set_membership_state(MEMBERSHIP_IN_WAIT);
PEER_CLOSE_MANAGER_LOG("Wait for membership manager availability");
return;
}
set_membership_state(MEMBERSHIP_IN_USE);
assert(!membership_req_pending_);
membership_req_pending_++;
BgpMembershipManager *mgr = membership_mgr();
if (!mgr)
return;
std::list<BgpTable *> tables;
mgr->GetRegisteredRibs(peer_close_->peer(), &tables);
if (tables.empty()) {
assert(MembershipRequestCompleteCallbackInternal());
return;
}
// Account for extra increment above.
membership_req_pending_--;
BOOST_FOREACH(BgpTable *table, tables) {
membership_req_pending_++;
if (mgr->IsRegistered(peer_close_->peer(), table)) {
if (state_ == PeerCloseManager::DELETE) {
PEER_CLOSE_MANAGER_TABLE_LOG(
"MembershipManager::Unregister");
mgr->Unregister(peer_close_->peer(), table);
} else if (state_ == PeerCloseManager::SWEEP) {
PEER_CLOSE_MANAGER_TABLE_LOG("MembershipManager::WalkRibIn");
mgr->WalkRibIn(peer_close_->peer(), table);
} else {
PEER_CLOSE_MANAGER_TABLE_LOG(
"MembershipManager::UnregisterRibOut");
mgr->UnregisterRibOut(peer_close_->peer(), table);
}
} else {
assert(mgr->IsRibInRegistered(peer_close_->peer(), table));
if (state_ == PeerCloseManager::DELETE) {
PEER_CLOSE_MANAGER_TABLE_LOG(
"MembershipManager::UnregisterRibIn");
mgr->UnregisterRibIn(peer_close_->peer(), table);
} else {
PEER_CLOSE_MANAGER_TABLE_LOG("MembershipManager::WalkRibIn");
mgr->WalkRibIn(peer_close_->peer(), table);
}
}
}
}
// Concurrency: Runs in the context of the BGP peer rib membership task.
//
// Close process for this peer in terms of walking RibIns and RibOuts are
// complete. Do the final cleanups necessary and notify interested party
//
// Retrun true if we are done using membership manager, false otherwise.
bool PeerCloseManager::MembershipRequestCallback() {
tbb::mutex::scoped_lock lock(mutex_);
return MembershipRequestCompleteCallbackInternal();
}
bool PeerCloseManager::MembershipRequestCompleteCallbackInternal() {
assert(state_ == STALE || LLGR_STALE || state_ == SWEEP ||
state_ == DELETE);
assert(membership_state() == MEMBERSHIP_IN_USE);
assert(membership_req_pending_ > 0);
PEER_CLOSE_MANAGER_LOG("MembershipRequestCallback");
bool ret = false;
if (--membership_req_pending_)
return ret;
// Indicate to the caller that we are done using the membership manager.
ret = true;
set_membership_state(MEMBERSHIP_NONE);
if (state_ == DELETE) {
MOVE_TO_STATE(NONE);
peer_close_->Delete();
gr_elapsed_ = 0;
llgr_elapsed_ = 0;
stats_.init++;
close_again_ = false;
non_graceful_ = false;
return ret;
}
// Process nested closures.
if (close_again_) {
CloseComplete();
return ret;
}
// If any GR stale timer has to be launched, then to wait for some time
// hoping for the peer (and the paths) to come back up.
if (state_ == STALE) {
peer_close_->CloseComplete();
MOVE_TO_STATE(GR_TIMER);
peer_close_->GetGracefulRestartFamilies(&families_);
// Offset restart time with elapsed time during nested closures.
int time = peer_close_->GetGracefulRestartTime() * 1000;
time -= gr_elapsed_;
if (time < 0)
time = 0;
StartRestartTimer(time);
stats_.gr_timer++;
return ret;
}
// From LLGR_STALE state, switch to LLGR_TIMER state. Typically this would
// be a very long timer, and we expect to receive EORs before this timer
// expires.
if (state_ == LLGR_STALE) {
MOVE_TO_STATE(LLGR_TIMER);
peer_close_->GetGracefulRestartFamilies(&families_);
StartRestartTimer(1000 *
peer_close_->GetLongLivedGracefulRestartTime());
// Offset restart time with elapsed time during nested closures.
int time = peer_close_->GetLongLivedGracefulRestartTime() *1000;
time -= llgr_elapsed_;
if (time < 0)
time = 0;
StartRestartTimer(time);
stats_.llgr_timer++;
return ret;
}
TriggerSweepStateActions();
return ret;
}
void PeerCloseManager::FillCloseInfo(BgpNeighborResp *resp) const {
tbb::mutex::scoped_lock lock(mutex_);
PeerCloseInfo peer_close_info;
peer_close_info.state = GetStateName(state_);
peer_close_info.membership_state =
GetMembershipStateName(membership_state_);
peer_close_info.close_again = close_again_;
peer_close_info.non_graceful = non_graceful_;
peer_close_info.init = stats_.init;
peer_close_info.close = stats_.close;
peer_close_info.nested = stats_.nested;
peer_close_info.deletes = stats_.deletes;
peer_close_info.stale = stats_.stale;
peer_close_info.llgr_stale = stats_.llgr_stale;
peer_close_info.sweep = stats_.sweep;
peer_close_info.gr_timer = stats_.gr_timer;
peer_close_info.llgr_timer = stats_.llgr_timer;
resp->set_peer_close_info(peer_close_info);
}
bool PeerCloseManager::MembershipPathCallback(DBTablePartBase *root,
BgpRoute *rt, BgpPath *path) {
DBRequest::DBOperation oper;
BgpAttrPtr attrs;
BgpTable *table = static_cast<BgpTable *>(root->parent());
assert(table);
uint32_t stale = 0;
switch (state_) {
case NONE:
case GR_TIMER:
case LLGR_TIMER:
return false;
case SWEEP:
// Stale paths must be deleted.
if (!path->IsStale() && !path->IsLlgrStale())
return false;
path->ResetStale();
path->ResetLlgrStale();
oper = DBRequest::DB_ENTRY_DELETE;
attrs = NULL;
break;
case DELETE:
// This path must be deleted. Hence attr is not required.
oper = DBRequest::DB_ENTRY_DELETE;
attrs = NULL;
break;
case STALE:
// If path is already marked as stale, then there is no need to
// process again. This can happen if the session flips while in
// GR_TIMER state.
if (path->IsStale())
return false;
// This path must be marked for staling. Update the local
// preference and update the route accordingly.
oper = DBRequest::DB_ENTRY_ADD_CHANGE;
attrs = path->GetAttr();
stale = BgpPath::Stale;
break;
case LLGR_STALE:
// If the path has NO_LLGR community, DELETE it.
if (path->GetAttr()->community() &&
path->GetAttr()->community()->ContainsValue(
CommunityType::NoLlgr)) {
oper = DBRequest::DB_ENTRY_DELETE;
attrs = NULL;
break;
}
// If path is already marked as llgr_stale, then there is no
// need to process again. This can happen if the session flips
// while in LLGR_TIMER state.
if (path->IsLlgrStale())
return false;
attrs = path->GetAttr();
stale = BgpPath::LlgrStale;
oper = DBRequest::DB_ENTRY_ADD_CHANGE;
break;
}
// Feed the route modify/delete request to the table input process.
return table->InputCommon(root, rt, path, peer_close_->peer(), NULL, oper,
attrs, path->GetPathId(),
path->GetFlags() | stale, path->GetLabel());
}