/
zebra_dplane.c
1141 lines (896 loc) · 25.3 KB
/
zebra_dplane.c
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
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Zebra dataplane layer.
* Copyright (c) 2018 Volta Networks, Inc.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "lib/libfrr.h"
#include "lib/debug.h"
#include "lib/frratomic.h"
#include "lib/frr_pthread.h"
#include "lib/memory.h"
#include "lib/queue.h"
#include "lib/zebra.h"
#include "zebra/zebra_memory.h"
#include "zebra/zserv.h"
#include "zebra/zebra_dplane.h"
#include "zebra/rt.h"
#include "zebra/debug.h"
/* Memory type for context blocks */
DEFINE_MTYPE(ZEBRA, DP_CTX, "Zebra DPlane Ctx")
DEFINE_MTYPE(ZEBRA, DP_PROV, "Zebra DPlane Provider")
#ifndef AOK
# define AOK 0
#endif
/* Default value for max queued incoming updates */
const uint32_t DPLANE_DEFAULT_MAX_QUEUED = 200;
/* Validation check macro for context blocks */
/* #define DPLANE_DEBUG 1 */
#ifdef DPLANE_DEBUG
# define DPLANE_CTX_VALID(p) \
assert((p) != NULL)
#else
# define DPLANE_CTX_VALID(p)
#endif /* DPLANE_DEBUG */
/*
* The context block used to exchange info about route updates across
* the boundary between the zebra main context (and pthread) and the
* dataplane layer (and pthread).
*/
struct zebra_dplane_ctx {
/* Operation code */
enum dplane_op_e zd_op;
/* Status on return */
enum zebra_dplane_result zd_status;
/* TODO -- internal/sub-operation status? */
enum zebra_dplane_result zd_remote_status;
enum zebra_dplane_result zd_kernel_status;
/* Dest and (optional) source prefixes */
struct prefix zd_dest;
struct prefix zd_src;
bool zd_is_update;
uint32_t zd_seq;
uint32_t zd_old_seq;
vrf_id_t zd_vrf_id;
uint32_t zd_table_id;
int zd_type;
int zd_old_type;
afi_t zd_afi;
safi_t zd_safi;
route_tag_t zd_tag;
route_tag_t zd_old_tag;
uint32_t zd_metric;
uint32_t zd_old_metric;
uint16_t zd_instance;
uint16_t zd_old_instance;
uint8_t zd_distance;
uint8_t zd_old_distance;
uint32_t zd_mtu;
uint32_t zd_nexthop_mtu;
/* Namespace info */
struct zebra_dplane_info zd_ns_info;
/* Nexthops */
struct nexthop_group zd_ng;
/* "Previous" nexthops, used only in route updates without netlink */
struct nexthop_group zd_old_ng;
/* TODO -- use fixed array of nexthops, to avoid mallocs? */
/* Embedded list linkage */
TAILQ_ENTRY(zebra_dplane_ctx) zd_q_entries;
};
/*
* Registration block for one dataplane provider.
*/
struct zebra_dplane_provider {
/* Name */
char dp_name[DPLANE_PROVIDER_NAMELEN + 1];
/* Priority, for ordering among providers */
uint8_t dp_priority;
/* Id value */
uint32_t dp_id;
dplane_provider_process_fp dp_fp;
dplane_provider_fini_fp dp_fini;
_Atomic uint32_t dp_in_counter;
_Atomic uint32_t dp_error_counter;
/* Embedded list linkage */
TAILQ_ENTRY(zebra_dplane_provider) dp_q_providers;
};
/*
* Globals
*/
static struct zebra_dplane_globals {
/* Mutex to control access to dataplane components */
pthread_mutex_t dg_mutex;
/* Results callback registered by zebra 'core' */
dplane_results_fp dg_results_cb;
/* Sentinel for beginning of shutdown */
volatile bool dg_is_shutdown;
/* Sentinel for end of shutdown */
volatile bool dg_run;
/* Route-update context queue inbound to the dataplane */
TAILQ_HEAD(zdg_ctx_q, zebra_dplane_ctx) dg_route_ctx_q;
/* Ordered list of providers */
TAILQ_HEAD(zdg_prov_q, zebra_dplane_provider) dg_providers_q;
/* Counter used to assign internal ids to providers */
uint32_t dg_provider_id;
/* Limit number of pending, unprocessed updates */
_Atomic uint32_t dg_max_queued_updates;
_Atomic uint32_t dg_routes_in;
_Atomic uint32_t dg_routes_queued;
_Atomic uint32_t dg_routes_queued_max;
_Atomic uint32_t dg_route_errors;
/* Event-delivery context 'master' for the dplane */
struct thread_master *dg_master;
/* Event/'thread' pointer for queued updates */
struct thread *dg_t_update;
/* Event pointer for pending shutdown check loop */
struct thread *dg_t_shutdown_check;
} zdplane_info;
/*
* Lock and unlock for interactions with the zebra 'core'
*/
#define DPLANE_LOCK() pthread_mutex_lock(&zdplane_info.dg_mutex)
#define DPLANE_UNLOCK() pthread_mutex_unlock(&zdplane_info.dg_mutex)
/* Prototypes */
static int dplane_route_process(struct thread *event);
/*
* Public APIs
*/
/*
* Allocate a dataplane update context
*/
static struct zebra_dplane_ctx *dplane_ctx_alloc(void)
{
struct zebra_dplane_ctx *p;
/* TODO -- just alloc'ing memory, but would like to maintain
* a pool
*/
p = XCALLOC(MTYPE_DP_CTX, sizeof(struct zebra_dplane_ctx));
return p;
}
/*
* Free a dataplane results context.
*/
static void dplane_ctx_free(struct zebra_dplane_ctx **pctx)
{
if (pctx) {
DPLANE_CTX_VALID(*pctx);
/* TODO -- just freeing memory, but would like to maintain
* a pool
*/
/* Free embedded nexthops */
if ((*pctx)->zd_ng.nexthop) {
/* This deals with recursive nexthops too */
nexthops_free((*pctx)->zd_ng.nexthop);
}
if ((*pctx)->zd_old_ng.nexthop) {
/* This deals with recursive nexthops too */
nexthops_free((*pctx)->zd_old_ng.nexthop);
}
XFREE(MTYPE_DP_CTX, *pctx);
*pctx = NULL;
}
}
/*
* Return a context block to the dplane module after processing
*/
void dplane_ctx_fini(struct zebra_dplane_ctx **pctx)
{
/* TODO -- enqueue for next provider; for now, just free */
dplane_ctx_free(pctx);
}
/* Enqueue a context block */
void dplane_ctx_enqueue_tail(struct dplane_ctx_q *q,
const struct zebra_dplane_ctx *ctx)
{
TAILQ_INSERT_TAIL(q, (struct zebra_dplane_ctx *)ctx, zd_q_entries);
}
/* Dequeue a context block from the head of a list */
void dplane_ctx_dequeue(struct dplane_ctx_q *q, struct zebra_dplane_ctx **ctxp)
{
struct zebra_dplane_ctx *ctx = TAILQ_FIRST(q);
if (ctx)
TAILQ_REMOVE(q, ctx, zd_q_entries);
*ctxp = ctx;
}
/*
* Accessors for information from the context object
*/
enum zebra_dplane_result dplane_ctx_get_status(
const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_status;
}
enum dplane_op_e dplane_ctx_get_op(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_op;
}
const char *dplane_op2str(enum dplane_op_e op)
{
const char *ret = "UNKNOWN";
switch (op) {
case DPLANE_OP_NONE:
ret = "NONE";
break;
/* Route update */
case DPLANE_OP_ROUTE_INSTALL:
ret = "ROUTE_INSTALL";
break;
case DPLANE_OP_ROUTE_UPDATE:
ret = "ROUTE_UPDATE";
break;
case DPLANE_OP_ROUTE_DELETE:
ret = "ROUTE_DELETE";
break;
};
return ret;
}
const char *dplane_res2str(enum zebra_dplane_result res)
{
const char *ret = "<Unknown>";
switch (res) {
case ZEBRA_DPLANE_REQUEST_FAILURE:
ret = "FAILURE";
break;
case ZEBRA_DPLANE_REQUEST_QUEUED:
ret = "QUEUED";
break;
case ZEBRA_DPLANE_REQUEST_SUCCESS:
ret = "SUCCESS";
break;
};
return ret;
}
const struct prefix *dplane_ctx_get_dest(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return &(ctx->zd_dest);
}
/* Source prefix is a little special - return NULL for "no src prefix" */
const struct prefix *dplane_ctx_get_src(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
if (ctx->zd_src.prefixlen == 0 &&
IN6_IS_ADDR_UNSPECIFIED(&(ctx->zd_src.u.prefix6))) {
return NULL;
} else {
return &(ctx->zd_src);
}
}
bool dplane_ctx_is_update(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_is_update;
}
uint32_t dplane_ctx_get_seq(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_seq;
}
uint32_t dplane_ctx_get_old_seq(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_old_seq;
}
vrf_id_t dplane_ctx_get_vrf(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_vrf_id;
}
int dplane_ctx_get_type(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_type;
}
int dplane_ctx_get_old_type(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_old_type;
}
afi_t dplane_ctx_get_afi(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_afi;
}
safi_t dplane_ctx_get_safi(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_safi;
}
uint32_t dplane_ctx_get_table(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_table_id;
}
route_tag_t dplane_ctx_get_tag(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_tag;
}
route_tag_t dplane_ctx_get_old_tag(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_old_tag;
}
uint16_t dplane_ctx_get_instance(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_instance;
}
uint16_t dplane_ctx_get_old_instance(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_instance;
}
uint32_t dplane_ctx_get_metric(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_metric;
}
uint32_t dplane_ctx_get_old_metric(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_old_metric;
}
uint32_t dplane_ctx_get_mtu(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_mtu;
}
uint32_t dplane_ctx_get_nh_mtu(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_nexthop_mtu;
}
uint8_t dplane_ctx_get_distance(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_distance;
}
uint8_t dplane_ctx_get_old_distance(const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return ctx->zd_old_distance;
}
const struct nexthop_group *dplane_ctx_get_ng(
const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return &(ctx->zd_ng);
}
const struct nexthop_group *dplane_ctx_get_old_ng(
const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return &(ctx->zd_old_ng);
}
const struct zebra_dplane_info *dplane_ctx_get_ns(
const struct zebra_dplane_ctx *ctx)
{
DPLANE_CTX_VALID(ctx);
return &(ctx->zd_ns_info);
}
/*
* End of dplane context accessors
*/
/*
* Retrieve the limit on the number of pending, unprocessed updates.
*/
uint32_t dplane_get_in_queue_limit(void)
{
return atomic_load_explicit(&zdplane_info.dg_max_queued_updates,
memory_order_relaxed);
}
/*
* Configure limit on the number of pending, queued updates.
*/
void dplane_set_in_queue_limit(uint32_t limit, bool set)
{
/* Reset to default on 'unset' */
if (!set)
limit = DPLANE_DEFAULT_MAX_QUEUED;
atomic_store_explicit(&zdplane_info.dg_max_queued_updates, limit,
memory_order_relaxed);
}
/*
* Retrieve the current queue depth of incoming, unprocessed updates
*/
uint32_t dplane_get_in_queue_len(void)
{
return atomic_load_explicit(&zdplane_info.dg_routes_queued,
memory_order_seq_cst);
}
/*
* Initialize a context block for a route update from zebra data structs.
*/
static int dplane_ctx_route_init(struct zebra_dplane_ctx *ctx,
enum dplane_op_e op,
struct route_node *rn,
struct route_entry *re)
{
int ret = EINVAL;
const struct route_table *table = NULL;
const rib_table_info_t *info;
const struct prefix *p, *src_p;
struct zebra_ns *zns;
struct zebra_vrf *zvrf;
struct nexthop *nexthop;
if (!ctx || !rn || !re)
goto done;
ctx->zd_op = op;
ctx->zd_type = re->type;
ctx->zd_old_type = re->type;
/* Prefixes: dest, and optional source */
srcdest_rnode_prefixes(rn, &p, &src_p);
prefix_copy(&(ctx->zd_dest), p);
if (src_p)
prefix_copy(&(ctx->zd_src), src_p);
else
memset(&(ctx->zd_src), 0, sizeof(ctx->zd_src));
ctx->zd_table_id = re->table;
ctx->zd_metric = re->metric;
ctx->zd_old_metric = re->metric;
ctx->zd_vrf_id = re->vrf_id;
ctx->zd_mtu = re->mtu;
ctx->zd_nexthop_mtu = re->nexthop_mtu;
ctx->zd_instance = re->instance;
ctx->zd_tag = re->tag;
ctx->zd_old_tag = re->tag;
ctx->zd_distance = re->distance;
table = srcdest_rnode_table(rn);
info = table->info;
ctx->zd_afi = info->afi;
ctx->zd_safi = info->safi;
/* Extract ns info - can't use pointers to 'core' structs */
zvrf = vrf_info_lookup(re->vrf_id);
zns = zvrf->zns;
zebra_dplane_info_from_zns(&(ctx->zd_ns_info), zns, true /*is_cmd*/);
#if defined(HAVE_NETLINK)
/* Increment message counter after copying to context struct - may need
* two messages in some 'update' cases.
*/
if (op == DPLANE_OP_ROUTE_UPDATE)
zns->netlink_cmd.seq += 2;
else
zns->netlink_cmd.seq++;
#endif /* NETLINK*/
/* Copy nexthops; recursive info is included too */
copy_nexthops(&(ctx->zd_ng.nexthop), re->ng.nexthop, NULL);
/* TODO -- maybe use array of nexthops to avoid allocs? */
/* Ensure that the dplane's nexthop flag is clear. */
for (ALL_NEXTHOPS(ctx->zd_ng, nexthop))
UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
/* Trying out the sequence number idea, so we can try to detect
* when a result is stale.
*/
re->dplane_sequence++;
ctx->zd_seq = re->dplane_sequence;
ret = AOK;
done:
return ret;
}
/*
* Enqueue a new route update,
* and ensure an event is active for the dataplane thread.
*/
static int dplane_route_enqueue(struct zebra_dplane_ctx *ctx)
{
int ret = EINVAL;
uint32_t high, curr;
/* Enqueue for processing by the dataplane thread */
DPLANE_LOCK();
{
TAILQ_INSERT_TAIL(&zdplane_info.dg_route_ctx_q, ctx,
zd_q_entries);
}
DPLANE_UNLOCK();
curr = atomic_add_fetch_explicit(
#ifdef __clang__
/* TODO -- issue with the clang atomic/intrinsics currently;
* casting away the 'Atomic'-ness of the variable works.
*/
(uint32_t *)&(zdplane_info.dg_routes_queued),
#else
&(zdplane_info.dg_routes_queued),
#endif
1, memory_order_seq_cst);
/* Maybe update high-water counter also */
high = atomic_load_explicit(&zdplane_info.dg_routes_queued_max,
memory_order_seq_cst);
while (high < curr) {
if (atomic_compare_exchange_weak_explicit(
&zdplane_info.dg_routes_queued_max,
&high, curr,
memory_order_seq_cst,
memory_order_seq_cst))
break;
}
/* Ensure that an event for the dataplane thread is active */
thread_add_event(zdplane_info.dg_master, dplane_route_process, NULL, 0,
&zdplane_info.dg_t_update);
ret = AOK;
return ret;
}
/*
* Attempt to dequeue a route-update block
*/
static struct zebra_dplane_ctx *dplane_route_dequeue(void)
{
struct zebra_dplane_ctx *ctx = NULL;
DPLANE_LOCK();
{
ctx = TAILQ_FIRST(&zdplane_info.dg_route_ctx_q);
if (ctx) {
TAILQ_REMOVE(&zdplane_info.dg_route_ctx_q,
ctx, zd_q_entries);
}
}
DPLANE_UNLOCK();
return ctx;
}
/*
* Utility that prepares a route update and enqueues it for processing
*/
static enum zebra_dplane_result
dplane_route_update_internal(struct route_node *rn,
struct route_entry *re,
struct route_entry *old_re,
enum dplane_op_e op)
{
enum zebra_dplane_result result = ZEBRA_DPLANE_REQUEST_FAILURE;
int ret = EINVAL;
struct zebra_dplane_ctx *ctx = NULL;
/* Obtain context block */
ctx = dplane_ctx_alloc();
if (ctx == NULL) {
ret = ENOMEM;
goto done;
}
/* Init context with info from zebra data structs */
ret = dplane_ctx_route_init(ctx, op, rn, re);
if (ret == AOK) {
/* Capture some extra info for update case
* where there's a different 'old' route.
*/
if ((op == DPLANE_OP_ROUTE_UPDATE) &&
old_re && (old_re != re)) {
ctx->zd_is_update = true;
old_re->dplane_sequence++;
ctx->zd_old_seq = old_re->dplane_sequence;
ctx->zd_old_tag = old_re->tag;
ctx->zd_old_type = old_re->type;
ctx->zd_old_instance = old_re->instance;
ctx->zd_old_distance = old_re->distance;
ctx->zd_old_metric = old_re->metric;
#ifndef HAVE_NETLINK
/* For bsd, capture previous re's nexthops too, sigh.
* We'll need these to do per-nexthop deletes.
*/
copy_nexthops(&(ctx->zd_old_ng.nexthop),
old_re->ng.nexthop, NULL);
#endif /* !HAVE_NETLINK */
}
/* Enqueue context for processing */
ret = dplane_route_enqueue(ctx);
}
done:
/* Update counter */
atomic_fetch_add_explicit(&zdplane_info.dg_routes_in, 1,
memory_order_relaxed);
if (ret == AOK)
result = ZEBRA_DPLANE_REQUEST_QUEUED;
else if (ctx) {
atomic_fetch_add_explicit(&zdplane_info.dg_route_errors, 1,
memory_order_relaxed);
dplane_ctx_free(&ctx);
}
return result;
}
/*
* Enqueue a route 'add' for the dataplane.
*/
enum zebra_dplane_result dplane_route_add(struct route_node *rn,
struct route_entry *re)
{
enum zebra_dplane_result ret = ZEBRA_DPLANE_REQUEST_FAILURE;
if (rn == NULL || re == NULL)
goto done;
ret = dplane_route_update_internal(rn, re, NULL,
DPLANE_OP_ROUTE_INSTALL);
done:
return ret;
}
/*
* Enqueue a route update for the dataplane.
*/
enum zebra_dplane_result dplane_route_update(struct route_node *rn,
struct route_entry *re,
struct route_entry *old_re)
{
enum zebra_dplane_result ret = ZEBRA_DPLANE_REQUEST_FAILURE;
if (rn == NULL || re == NULL)
goto done;
ret = dplane_route_update_internal(rn, re, old_re,
DPLANE_OP_ROUTE_UPDATE);
done:
return ret;
}
/*
* Enqueue a route removal for the dataplane.
*/
enum zebra_dplane_result dplane_route_delete(struct route_node *rn,
struct route_entry *re)
{
enum zebra_dplane_result ret = ZEBRA_DPLANE_REQUEST_FAILURE;
if (rn == NULL || re == NULL)
goto done;
ret = dplane_route_update_internal(rn, re, NULL,
DPLANE_OP_ROUTE_DELETE);
done:
return ret;
}
/*
* Event handler function for routing updates
*/
static int dplane_route_process(struct thread *event)
{
enum zebra_dplane_result res;
struct zebra_dplane_ctx *ctx;
while (1) {
/* Check for shutdown */
if (!zdplane_info.dg_run)
break;
/* TODO -- limit number of updates per cycle? */
ctx = dplane_route_dequeue();
if (ctx == NULL)
break;
/* Update counter */
atomic_fetch_sub_explicit(&zdplane_info.dg_routes_queued, 1,
memory_order_relaxed);
if (IS_ZEBRA_DEBUG_DPLANE_DETAIL) {
char dest_str[PREFIX_STRLEN];
prefix2str(dplane_ctx_get_dest(ctx),
dest_str, sizeof(dest_str));
zlog_debug("%u:%s Dplane route update ctx %p op %s",
dplane_ctx_get_vrf(ctx), dest_str,
ctx, dplane_op2str(dplane_ctx_get_op(ctx)));
}
/* TODO -- support series of providers */
/* Initially, just doing kernel-facing update here */
res = kernel_route_update(ctx);
if (res != ZEBRA_DPLANE_REQUEST_SUCCESS)
atomic_fetch_add_explicit(&zdplane_info.dg_route_errors,
1, memory_order_relaxed);
ctx->zd_status = res;
/* Enqueue result to zebra main context */
zdplane_info.dg_results_cb(ctx);
ctx = NULL;
}
return 0;
}
/*
* Handler for 'show dplane'
*/
int dplane_show_helper(struct vty *vty, bool detailed)
{
uint64_t queued, limit, queue_max, errs, incoming;
/* Using atomics because counters are being changed in different
* contexts.
*/
incoming = atomic_load_explicit(&zdplane_info.dg_routes_in,
memory_order_relaxed);
limit = atomic_load_explicit(&zdplane_info.dg_max_queued_updates,
memory_order_relaxed);
queued = atomic_load_explicit(&zdplane_info.dg_routes_queued,
memory_order_relaxed);
queue_max = atomic_load_explicit(&zdplane_info.dg_routes_queued_max,
memory_order_relaxed);
errs = atomic_load_explicit(&zdplane_info.dg_route_errors,
memory_order_relaxed);
vty_out(vty, "Route updates: %"PRIu64"\n", incoming);
vty_out(vty, "Route update errors: %"PRIu64"\n", errs);
vty_out(vty, "Route update queue limit: %"PRIu64"\n", limit);
vty_out(vty, "Route update queue depth: %"PRIu64"\n", queued);
vty_out(vty, "Route update queue max: %"PRIu64"\n", queue_max);
return CMD_SUCCESS;
}
/*
* Handler for 'show dplane providers'
*/
int dplane_show_provs_helper(struct vty *vty, bool detailed)
{
vty_out(vty, "Zebra dataplane providers:%s\n",
(detailed ? " (detailed)" : ""));
return CMD_SUCCESS;
}
/*
* Provider registration
*/
int dplane_provider_register(const char *name,
enum dplane_provider_prio_e prio,
dplane_provider_process_fp fp,
dplane_provider_fini_fp fini_fp)
{
int ret = 0;
struct zebra_dplane_provider *p, *last;
/* Validate */
if (fp == NULL) {
ret = EINVAL;
goto done;
}
if (prio <= DPLANE_PRIO_NONE ||
prio > DPLANE_PRIO_LAST) {
ret = EINVAL;
goto done;
}
/* Allocate and init new provider struct */
p = XCALLOC(MTYPE_DP_PROV, sizeof(struct zebra_dplane_provider));
if (p == NULL) {
ret = ENOMEM;
goto done;
}
strncpy(p->dp_name, name, DPLANE_PROVIDER_NAMELEN);
p->dp_name[DPLANE_PROVIDER_NAMELEN] = '\0'; /* Belt-and-suspenders */
p->dp_priority = prio;
p->dp_fp = fp;
p->dp_fini = fini_fp;
/* Lock the lock - the dplane pthread may be running */
DPLANE_LOCK();
p->dp_id = ++zdplane_info.dg_provider_id;
/* Insert into list ordered by priority */
TAILQ_FOREACH(last, &zdplane_info.dg_providers_q, dp_q_providers) {
if (last->dp_priority > p->dp_priority)
break;
}
if (last)
TAILQ_INSERT_BEFORE(last, p, dp_q_providers);
else
TAILQ_INSERT_TAIL(&zdplane_info.dg_providers_q, p,
dp_q_providers);
/* And unlock */
DPLANE_UNLOCK();
done:
return ret;
}
/*
* Zebra registers a results callback with the dataplane system
*/
int dplane_results_register(dplane_results_fp fp)
{
zdplane_info.dg_results_cb = fp;
return AOK;
}
/*
* Initialize the dataplane module during startup, internal/private version
*/
static void zebra_dplane_init_internal(struct zebra_t *zebra)
{
memset(&zdplane_info, 0, sizeof(zdplane_info));
pthread_mutex_init(&zdplane_info.dg_mutex, NULL);