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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
|
/* Route map function.
Copyright (C) 1998, 1999 Kunihiro Ishiguro
This file is part of GNU Zebra.
GNU Zebra 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, or (at your option) any
later version.
GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the Free
Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
#include <zebra.h>
#include "linklist.h"
#include "memory.h"
#include "vector.h"
#include "prefix.h"
#include "routemap.h"
#include "command.h"
#include "log.h"
/* Vector for route match rules. */
static vector route_match_vec;
/* Vector for route set rules. */
static vector route_set_vec;
/* Route map rule. This rule has both `match' rule and `set' rule. */
struct route_map_rule
{
/* Rule type. */
struct route_map_rule_cmd *cmd;
/* For pretty printing. */
char *rule_str;
/* Pre-compiled match rule. */
void *value;
/* Linked list. */
struct route_map_rule *next;
struct route_map_rule *prev;
};
/* Making route map list. */
struct route_map_list
{
struct route_map *head;
struct route_map *tail;
void (*add_hook) (char *);
void (*delete_hook) (char *);
void (*event_hook) (route_map_event_t, char *);
};
/* Master list of route map. */
static struct route_map_list route_map_master = { NULL, NULL, NULL, NULL };
static void
route_map_rule_delete (struct route_map_rule_list *,
struct route_map_rule *);
static void
route_map_index_delete (struct route_map_index *, int);
/* New route map allocation. Please note route map's name must be
specified. */
static struct route_map *
route_map_new (char *name)
{
struct route_map *new;
new = XCALLOC (MTYPE_ROUTE_MAP, sizeof (struct route_map));
new->name = XSTRDUP (MTYPE_ROUTE_MAP_NAME, name);
return new;
}
/* Add new name to route_map. */
static struct route_map *
route_map_add (char *name)
{
struct route_map *map;
struct route_map_list *list;
map = route_map_new (name);
list = &route_map_master;
map->next = NULL;
map->prev = list->tail;
if (list->tail)
list->tail->next = map;
else
list->head = map;
list->tail = map;
/* Execute hook. */
if (route_map_master.add_hook)
(*route_map_master.add_hook) (name);
return map;
}
/* Route map delete from list. */
static void
route_map_delete (struct route_map *map)
{
struct route_map_list *list;
struct route_map_index *index;
char *name;
while ((index = map->head) != NULL)
route_map_index_delete (index, 0);
name = map->name;
list = &route_map_master;
if (map->next)
map->next->prev = map->prev;
else
list->tail = map->prev;
if (map->prev)
map->prev->next = map->next;
else
list->head = map->next;
XFREE (MTYPE_ROUTE_MAP, map);
/* Execute deletion hook. */
if (route_map_master.delete_hook)
(*route_map_master.delete_hook) (name);
if (name)
XFREE (MTYPE_ROUTE_MAP_NAME, name);
}
/* Lookup route map by route map name string. */
struct route_map *
route_map_lookup_by_name (char *name)
{
struct route_map *map;
for (map = route_map_master.head; map; map = map->next)
if (strcmp (map->name, name) == 0)
return map;
return NULL;
}
/* Lookup route map. If there isn't route map create one and return
it. */
struct route_map *
route_map_get (char *name)
{
struct route_map *map;
map = route_map_lookup_by_name (name);
if (map == NULL)
map = route_map_add (name);
return map;
}
/* Return route map's type string. */
const static char *
route_map_type_str (enum route_map_type type)
{
switch (type)
{
case RMAP_PERMIT:
return "permit";
break;
case RMAP_DENY:
return "deny";
break;
default:
return "";
break;
}
}
int
route_map_empty (struct route_map *map)
{
if (map->head == NULL && map->tail == NULL)
return 1;
else
return 0;
}
/* show route-map */
static void
vty_show_route_map_entry (struct vty *vty, struct route_map *map)
{
struct route_map_index *index;
struct route_map_rule *rule;
for (index = map->head; index; index = index->next)
{
vty_out (vty, "route-map %s, %s, sequence %d%s",
map->name, route_map_type_str (index->type),
index->pref, VTY_NEWLINE);
/* Match clauses */
vty_out (vty, " Match clauses:%s", VTY_NEWLINE);
for (rule = index->match_list.head; rule; rule = rule->next)
vty_out (vty, " %s %s%s",
rule->cmd->str, rule->rule_str, VTY_NEWLINE);
vty_out (vty, " Set clauses:%s", VTY_NEWLINE);
for (rule = index->set_list.head; rule; rule = rule->next)
vty_out (vty, " %s %s%s",
rule->cmd->str, rule->rule_str, VTY_NEWLINE);
vty_out (vty, " Action:%s", VTY_NEWLINE);
if (index->nextrm)
vty_out (vty, " Call %s%s", index->nextrm, VTY_NEWLINE);
else if (index->exitpolicy == RMAP_GOTO)
vty_out (vty, " Goto %d%s", index->nextpref, VTY_NEWLINE);
else if (index->exitpolicy == RMAP_NEXT)
{
vty_out (vty, " Goto next, (entry ");
if (index->next)
vty_out (vty, " %d)%s", index->next->pref, VTY_NEWLINE);
else
vty_out (vty, " undefined)%s", VTY_NEWLINE);
}
else if (index->exitpolicy == RMAP_EXIT)
vty_out (vty, " Exit routemap%s", VTY_NEWLINE);
}
}
int
vty_show_route_map (struct vty *vty, char *name)
{
struct route_map *map;
if (name)
{
map = route_map_lookup_by_name (name);
if (map)
{
vty_show_route_map_entry (vty, map);
return CMD_SUCCESS;
}
else
{
vty_out (vty, "%%route-map %s not found%s", name, VTY_NEWLINE);
return CMD_WARNING;
}
}
return CMD_SUCCESS;
}
/* New route map allocation. Please note route map's name must be
specified. */
struct route_map_index *
route_map_index_new ()
{
struct route_map_index *new;
new = XCALLOC (MTYPE_ROUTE_MAP_INDEX, sizeof (struct route_map_index));
new->exitpolicy = RMAP_EXIT; /* Default to Cisco-style */
return new;
}
/* Free route map index. */
static void
route_map_index_delete (struct route_map_index *index, int notify)
{
struct route_map_rule *rule;
/* Free route match. */
while ((rule = index->match_list.head) != NULL)
route_map_rule_delete (&index->match_list, rule);
/* Free route set. */
while ((rule = index->set_list.head) != NULL)
route_map_rule_delete (&index->set_list, rule);
/* Remove index from route map list. */
if (index->next)
index->next->prev = index->prev;
else
index->map->tail = index->prev;
if (index->prev)
index->prev->next = index->next;
else
index->map->head = index->next;
/* Free 'char *nextrm' if not NULL */
if (index->nextrm)
free (index->nextrm);
/* Execute event hook. */
if (route_map_master.event_hook && notify)
(*route_map_master.event_hook) (RMAP_EVENT_INDEX_DELETED,
index->map->name);
XFREE (MTYPE_ROUTE_MAP_INDEX, index);
}
/* Lookup index from route map. */
struct route_map_index *
route_map_index_lookup (struct route_map *map, enum route_map_type type,
int pref)
{
struct route_map_index *index;
for (index = map->head; index; index = index->next)
if ((index->type == type || type == RMAP_ANY)
&& index->pref == pref)
return index;
return NULL;
}
/* Add new index to route map. */
struct route_map_index *
route_map_index_add (struct route_map *map, enum route_map_type type,
int pref)
{
struct route_map_index *index;
struct route_map_index *point;
/* Allocate new route map inex. */
index = route_map_index_new ();
index->map = map;
index->type = type;
index->pref = pref;
/* Compare preference. */
for (point = map->head; point; point = point->next)
if (point->pref >= pref)
break;
if (map->head == NULL)
{
map->head = map->tail = index;
}
else if (point == NULL)
{
index->prev = map->tail;
map->tail->next = index;
map->tail = index;
}
else if (point == map->head)
{
index->next = map->head;
map->head->prev = index;
map->head = index;
}
else
{
index->next = point;
index->prev = point->prev;
if (point->prev)
point->prev->next = index;
point->prev = index;
}
/* Execute event hook. */
if (route_map_master.event_hook)
(*route_map_master.event_hook) (RMAP_EVENT_INDEX_ADDED,
map->name);
return index;
}
/* Get route map index. */
struct route_map_index *
route_map_index_get (struct route_map *map, enum route_map_type type,
int pref)
{
struct route_map_index *index;
index = route_map_index_lookup (map, RMAP_ANY, pref);
if (index && index->type != type)
{
/* Delete index from route map. */
route_map_index_delete (index, 1);
index = NULL;
}
if (index == NULL)
index = route_map_index_add (map, type, pref);
return index;
}
/* New route map rule */
struct route_map_rule *
route_map_rule_new ()
{
struct route_map_rule *new;
new = XCALLOC (MTYPE_ROUTE_MAP_RULE, sizeof (struct route_map_rule));
return new;
}
/* Install rule command to the match list. */
void
route_map_install_match (struct route_map_rule_cmd *cmd)
{
vector_set (route_match_vec, cmd);
}
/* Install rule command to the set list. */
void
route_map_install_set (struct route_map_rule_cmd *cmd)
{
vector_set (route_set_vec, cmd);
}
/* Lookup rule command from match list. */
struct route_map_rule_cmd *
route_map_lookup_match (char *name)
{
unsigned int i;
struct route_map_rule_cmd *rule;
for (i = 0; i < vector_max (route_match_vec); i++)
if ((rule = vector_slot (route_match_vec, i)) != NULL)
if (strcmp (rule->str, name) == 0)
return rule;
return NULL;
}
/* Lookup rule command from set list. */
struct route_map_rule_cmd *
route_map_lookup_set (char *name)
{
unsigned int i;
struct route_map_rule_cmd *rule;
for (i = 0; i < vector_max (route_set_vec); i++)
if ((rule = vector_slot (route_set_vec, i)) != NULL)
if (strcmp (rule->str, name) == 0)
return rule;
return NULL;
}
/* Add match and set rule to rule list. */
static void
route_map_rule_add (struct route_map_rule_list *list,
struct route_map_rule *rule)
{
rule->next = NULL;
rule->prev = list->tail;
if (list->tail)
list->tail->next = rule;
else
list->head = rule;
list->tail = rule;
}
/* Delete rule from rule list. */
static void
route_map_rule_delete (struct route_map_rule_list *list,
struct route_map_rule *rule)
{
if (rule->cmd->func_free)
(*rule->cmd->func_free) (rule->value);
if (rule->rule_str)
XFREE (MTYPE_ROUTE_MAP_RULE_STR, rule->rule_str);
if (rule->next)
rule->next->prev = rule->prev;
else
list->tail = rule->prev;
if (rule->prev)
rule->prev->next = rule->next;
else
list->head = rule->next;
XFREE (MTYPE_ROUTE_MAP_RULE, rule);
}
/* strcmp wrapper function which don't crush even argument is NULL. */
int
rulecmp (char *dst, char *src)
{
if (dst == NULL)
{
if (src == NULL)
return 0;
else
return 1;
}
else
{
if (src == NULL)
return 1;
else
return strcmp (dst, src);
}
return 1;
}
/* Add match statement to route map. */
int
route_map_add_match (struct route_map_index *index, char *match_name,
char *match_arg)
{
struct route_map_rule *rule;
struct route_map_rule *next;
struct route_map_rule_cmd *cmd;
void *compile;
int replaced = 0;
/* First lookup rule for add match statement. */
cmd = route_map_lookup_match (match_name);
if (cmd == NULL)
return RMAP_RULE_MISSING;
/* Next call compile function for this match statement. */
if (cmd->func_compile)
{
compile= (*cmd->func_compile)(match_arg);
if (compile == NULL)
return RMAP_COMPILE_ERROR;
}
else
compile = NULL;
/* If argument is completely same ignore it. */
for (rule = index->match_list.head; rule; rule = next)
{
next = rule->next;
if (rule->cmd == cmd)
{
route_map_rule_delete (&index->match_list, rule);
replaced = 1;
}
}
/* Add new route map match rule. */
rule = route_map_rule_new ();
rule->cmd = cmd;
rule->value = compile;
if (match_arg)
rule->rule_str = XSTRDUP (MTYPE_ROUTE_MAP_RULE_STR, match_arg);
else
rule->rule_str = NULL;
/* Add new route match rule to linked list. */
route_map_rule_add (&index->match_list, rule);
/* Execute event hook. */
if (route_map_master.event_hook)
(*route_map_master.event_hook) (replaced ?
RMAP_EVENT_MATCH_REPLACED:
RMAP_EVENT_MATCH_ADDED,
index->map->name);
return 0;
}
/* Delete specified route match rule. */
int
route_map_delete_match (struct route_map_index *index, char *match_name,
char *match_arg)
{
struct route_map_rule *rule;
struct route_map_rule_cmd *cmd;
cmd = route_map_lookup_match (match_name);
if (cmd == NULL)
return 1;
for (rule = index->match_list.head; rule; rule = rule->next)
if (rule->cmd == cmd &&
(rulecmp (rule->rule_str, match_arg) == 0 || match_arg == NULL))
{
route_map_rule_delete (&index->match_list, rule);
/* Execute event hook. */
if (route_map_master.event_hook)
(*route_map_master.event_hook) (RMAP_EVENT_MATCH_DELETED,
index->map->name);
return 0;
}
/* Can't find matched rule. */
return 1;
}
/* Add route-map set statement to the route map. */
int
route_map_add_set (struct route_map_index *index, char *set_name,
char *set_arg)
{
struct route_map_rule *rule;
struct route_map_rule *next;
struct route_map_rule_cmd *cmd;
void *compile;
int replaced = 0;
cmd = route_map_lookup_set (set_name);
if (cmd == NULL)
return RMAP_RULE_MISSING;
/* Next call compile function for this match statement. */
if (cmd->func_compile)
{
compile= (*cmd->func_compile)(set_arg);
if (compile == NULL)
return RMAP_COMPILE_ERROR;
}
else
compile = NULL;
/* Add by WJL. if old set command of same kind exist, delete it first
to ensure only one set command of same kind exist under a
route_map_index. */
for (rule = index->set_list.head; rule; rule = next)
{
next = rule->next;
if (rule->cmd == cmd)
{
route_map_rule_delete (&index->set_list, rule);
replaced = 1;
}
}
/* Add new route map match rule. */
rule = route_map_rule_new ();
rule->cmd = cmd;
rule->value = compile;
if (set_arg)
rule->rule_str = XSTRDUP (MTYPE_ROUTE_MAP_RULE_STR, set_arg);
else
rule->rule_str = NULL;
/* Add new route match rule to linked list. */
route_map_rule_add (&index->set_list, rule);
/* Execute event hook. */
if (route_map_master.event_hook)
(*route_map_master.event_hook) (replaced ?
RMAP_EVENT_SET_REPLACED:
RMAP_EVENT_SET_ADDED,
index->map->name);
return 0;
}
/* Delete route map set rule. */
int
route_map_delete_set (struct route_map_index *index, char *set_name,
char *set_arg)
{
struct route_map_rule *rule;
struct route_map_rule_cmd *cmd;
cmd = route_map_lookup_set (set_name);
if (cmd == NULL)
return 1;
for (rule = index->set_list.head; rule; rule = rule->next)
if ((rule->cmd == cmd) &&
(rulecmp (rule->rule_str, set_arg) == 0 || set_arg == NULL))
{
route_map_rule_delete (&index->set_list, rule);
/* Execute event hook. */
if (route_map_master.event_hook)
(*route_map_master.event_hook) (RMAP_EVENT_SET_DELETED,
index->map->name);
return 0;
}
/* Can't find matched rule. */
return 1;
}
/* Apply route map's each index to the object.
The matrix for a route-map looks like this:
(note, this includes the description for the "NEXT"
and "GOTO" frobs now
Match | No Match
|
permit action | cont
|
------------------+---------------
|
deny deny | cont
|
action)
-Apply Set statements, accept route
-If Call statement is present jump to the specified route-map, if it
denies the route we finish.
-If NEXT is specified, goto NEXT statement
-If GOTO is specified, goto the first clause where pref > nextpref
-If nothing is specified, do as Cisco and finish
deny)
-Route is denied by route-map.
cont)
-Goto Next index
If we get no matches after we've processed all updates, then the route
is dropped too.
Some notes on the new "CALL", "NEXT" and "GOTO"
call WORD - If this clause is matched, then the set statements
are executed and then we jump to route-map 'WORD'. If
this route-map denies the route, we finish, in other case we
do whatever the exit policy (EXIT, NEXT or GOTO) tells.
on-match next - If this clause is matched, then the set statements
are executed and then we drop through to the next clause
on-match goto n - If this clause is matched, then the set statments
are executed and then we goto the nth clause, or the
first clause greater than this. In order to ensure
route-maps *always* exit, you cannot jump backwards.
Sorry ;)
We need to make sure our route-map processing matches the above
*/
route_map_result_t
route_map_apply_match (struct route_map_rule_list *match_list,
struct prefix *prefix, route_map_object_t type,
void *object)
{
route_map_result_t ret = RMAP_NOMATCH;
struct route_map_rule *match;
/* Check all match rule and if there is no match rule, go to the
set statement. */
if (!match_list->head)
ret = RMAP_MATCH;
else
{
for (match = match_list->head; match; match = match->next)
{
/* Try each match statement in turn, If any do not return
RMAP_MATCH, return, otherwise continue on to next match
statement. All match statements must match for end-result
to be a match. */
ret = (*match->cmd->func_apply) (match->value, prefix,
type, object);
if (ret != RMAP_MATCH)
return ret;
}
}
return ret;
}
/* Apply route map to the object. */
route_map_result_t
route_map_apply (struct route_map *map, struct prefix *prefix,
route_map_object_t type, void *object)
{
static int recursion = 0;
int ret = 0;
struct route_map_index *index;
struct route_map_rule *set;
if (recursion > RMAP_RECURSION_LIMIT)
{
zlog (NULL, LOG_WARNING,
"route-map recursion limit (%d) reached, discarding route",
RMAP_RECURSION_LIMIT);
recursion = 0;
return RMAP_DENYMATCH;
}
if (map == NULL)
return RMAP_DENYMATCH;
for (index = map->head; index; index = index->next)
{
/* Apply this index. */
ret = route_map_apply_match (&index->match_list, prefix, type, object);
/* Now we apply the matrix from above */
if (ret == RMAP_NOMATCH)
/* 'cont' from matrix - continue to next route-map sequence */
continue;
else if (ret == RMAP_MATCH)
{
if (index->type == RMAP_PERMIT)
/* 'action' */
{
/* permit+match must execute sets */
for (set = index->set_list.head; set; set = set->next)
ret = (*set->cmd->func_apply) (set->value, prefix,
type, object);
/* Call another route-map if available */
if (index->nextrm)
{
struct route_map *nextrm =
route_map_lookup_by_name (index->nextrm);
if (nextrm) /* Target route-map found, jump to it */
{
recursion++;
ret = route_map_apply (nextrm, prefix, type, object);
recursion--;
}
/* If nextrm returned 'deny', finish. */
if (ret == RMAP_DENYMATCH)
return ret;
}
switch (index->exitpolicy)
{
case RMAP_EXIT:
return ret;
case RMAP_NEXT:
continue;
case RMAP_GOTO:
{
/* Find the next clause to jump to */
struct route_map_index *next = index->next;
int nextpref = index->nextpref;
while (next && next->pref < nextpref)
{
index = next;
next = next->next;
}
if (next == NULL)
{
/* No clauses match! */
return ret;
}
}
}
}
else if (index->type == RMAP_DENY)
/* 'deny' */
{
return RMAP_DENYMATCH;
}
}
}
/* Finally route-map does not match at all. */
return RMAP_DENYMATCH;
}
void
route_map_add_hook (void (*func) (char *))
{
route_map_master.add_hook = func;
}
void
route_map_delete_hook (void (*func) (char *))
{
route_map_master.delete_hook = func;
}
void
route_map_event_hook (void (*func) (route_map_event_t, char *))
{
route_map_master.event_hook = func;
}
void
route_map_init ()
{
/* Make vector for match and set. */
route_match_vec = vector_init (1);
route_set_vec = vector_init (1);
}
/* VTY related functions. */
DEFUN (route_map,
route_map_cmd,
"route-map WORD (deny|permit) <1-65535>",
"Create route-map or enter route-map command mode\n"
"Route map tag\n"
"Route map denies set operations\n"
"Route map permits set operations\n"
"Sequence to insert to/delete from existing route-map entry\n")
{
int permit;
unsigned long pref;
struct route_map *map;
struct route_map_index *index;
char *endptr = NULL;
/* Permit check. */
if (strncmp (argv[1], "permit", strlen (argv[1])) == 0)
permit = RMAP_PERMIT;
else if (strncmp (argv[1], "deny", strlen (argv[1])) == 0)
permit = RMAP_DENY;
else
{
vty_out (vty, "the third field must be [permit|deny]%s", VTY_NEWLINE);
return CMD_WARNING;
}
/* Preference check. */
pref = strtoul (argv[2], &endptr, 10);
if (pref == ULONG_MAX || *endptr != '\0')
{
vty_out (vty, "the fourth field must be positive integer%s",
VTY_NEWLINE);
return CMD_WARNING;
}
if (pref == 0 || pref > 65535)
{
vty_out (vty, "the fourth field must be <1-65535>%s", VTY_NEWLINE);
return CMD_WARNING;
}
/* Get route map. */
map = route_map_get (argv[0]);
index = route_map_index_get (map, permit, pref);
vty->index = index;
vty->node = RMAP_NODE;
return CMD_SUCCESS;
}
DEFUN (no_route_map_all,
no_route_map_all_cmd,
"no route-map WORD",
NO_STR
"Create route-map or enter route-map command mode\n"
"Route map tag\n")
{
struct route_map *map;
map = route_map_lookup_by_name (argv[0]);
if (map == NULL)
{
vty_out (vty, "%% Could not find route-map %s%s",
argv[0], VTY_NEWLINE);
return CMD_WARNING;
}
route_map_delete (map);
return CMD_SUCCESS;
}
DEFUN (no_route_map,
no_route_map_cmd,
"no route-map WORD (deny|permit) <1-65535>",
NO_STR
"Create route-map or enter route-map command mode\n"
"Route map tag\n"
"Route map denies set operations\n"
"Route map permits set operations\n"
"Sequence to insert to/delete from existing route-map entry\n")
{
int permit;
unsigned long pref;
struct route_map *map;
struct route_map_index *index;
char *endptr = NULL;
/* Permit check. */
if (strncmp (argv[1], "permit", strlen (argv[1])) == 0)
permit = RMAP_PERMIT;
else if (strncmp (argv[1], "deny", strlen (argv[1])) == 0)
permit = RMAP_DENY;
else
{
vty_out (vty, "the third field must be [permit|deny]%s", VTY_NEWLINE);
return CMD_WARNING;
}
/* Preference. */
pref = strtoul (argv[2], &endptr, 10);
if (pref == ULONG_MAX || *endptr != '\0')
{
vty_out (vty, "the fourth field must be positive integer%s",
VTY_NEWLINE);
return CMD_WARNING;
}
if (pref == 0 || pref > 65535)
{
vty_out (vty, "the fourth field must be <1-65535>%s", VTY_NEWLINE);
return CMD_WARNING;
}
/* Existence check. */
map = route_map_lookup_by_name (argv[0]);
if (map == NULL)
{
vty_out (vty, "%% Could not find route-map %s%s",
argv[0], VTY_NEWLINE);
return CMD_WARNING;
}
/* Lookup route map index. */
index = route_map_index_lookup (map, permit, pref);
if (index == NULL)
{
vty_out (vty, "%% Could not find route-map entry %s %s%s",
argv[0], argv[2], VTY_NEWLINE);
return CMD_WARNING;
}
/* Delete index from route map. */
route_map_index_delete (index, 1);
/* If this route rule is the last one, delete route map itself. */
if (route_map_empty (map))
route_map_delete (map);
return CMD_SUCCESS;
}
DEFUN (rmap_onmatch_next,
rmap_onmatch_next_cmd,
"on-match next",
"Exit policy on matches\n"
"Next clause\n")
{
struct route_map_index *index;
index = vty->index;
if (index)
index->exitpolicy = RMAP_NEXT;
return CMD_SUCCESS;
}
DEFUN (no_rmap_onmatch_next,
no_rmap_onmatch_next_cmd,
"no on-match next",
NO_STR
"Exit policy on matches\n"
"Next clause\n")
{
struct route_map_index *index;
index = vty->index;
if (index)
index->exitpolicy = RMAP_EXIT;
return CMD_SUCCESS;
}
DEFUN (rmap_onmatch_goto,
rmap_onmatch_goto_cmd,
"on-match goto <1-65535>",
"Exit policy on matches\n"
"Goto Clause number\n"
"Number\n")
{
struct route_map_index *index;
int d = 0;
if (argv[0])
d = atoi(argv[0]);
index = vty->index;
if (index)
{
if (d <= index->pref)
{
/* Can't allow you to do that, Dave */
vty_out (vty, "can't jump backwards in route-maps%s",
VTY_NEWLINE);
return CMD_WARNING;
}
else
{
index->exitpolicy = RMAP_GOTO;
index->nextpref = d;
}
}
return CMD_SUCCESS;
}
DEFUN (no_rmap_onmatch_goto,
no_rmap_onmatch_goto_cmd,
"no on-match goto",
NO_STR
"Exit policy on matches\n"
"Goto Clause number\n")
{
struct route_map_index *index;
index = vty->index;
if (index)
index->exitpolicy = RMAP_EXIT;
return CMD_SUCCESS;
}
/* Cisco/GNU Zebra compatible ALIASes for on-match next */
ALIAS (rmap_onmatch_goto,
rmap_continue_cmd,
"continue",
"Continue on a different entry within the route-map\n")
ALIAS (no_rmap_onmatch_goto,
no_rmap_continue_cmd,
"no continue",
NO_STR
"Continue on a different entry within the route-map\n")
/* GNU Zebra compatible */
ALIAS (rmap_onmatch_goto,
rmap_continue_seq_cmd,
"continue <1-65535>",
"Continue on a different entry within the route-map\n"
"Route-map entry sequence number\n")
ALIAS (no_rmap_onmatch_goto,
no_rmap_continue_seq,
"no continue <1-65535>",
NO_STR
"Continue on a different entry within the route-map\n"
"Route-map entry sequence number\n")
DEFUN (rmap_show,
rmap_show_cmd,
"show route-map",
SHOW_STR
"route-map information\n")
{
return vty_show_route_map (vty, NULL);
}
DEFUN (rmap_show_name,
rmap_show_name_cmd,
"show route-map WORD",
SHOW_STR
"route-map information\n"
"route-map name\n")
{
return vty_show_route_map (vty, argv[0]);
}
ALIAS (rmap_onmatch_goto,
rmap_continue_index_cmd,
"continue <1-65536>",
"Exit policy on matches\n"
"Goto Clause number\n")
DEFUN (rmap_call,
rmap_call_cmd,
"call WORD",
"Jump to another Route-Map after match+set\n"
"Target route-map name\n")
{
struct route_map_index *index;
index = vty->index;
if (index)
{
if (index->nextrm)
free (index->nextrm);
index->nextrm = strdup (argv[0]);
}
return CMD_SUCCESS;
}
DEFUN (no_rmap_call,
no_rmap_call_cmd,
"no call",
NO_STR
"Jump to another Route-Map after match+set\n")
{
struct route_map_index *index;
index = vty->index;
if (index->nextrm)
{
free (index->nextrm);
index->nextrm = NULL;
}
return CMD_SUCCESS;
}
/* Configuration write function. */
int
route_map_config_write (struct vty *vty)
{
struct route_map *map;
struct route_map_index *index;
struct route_map_rule *rule;
int first = 1;
int write = 0;
for (map = route_map_master.head; map; map = map->next)
for (index = map->head; index; index = index->next)
{
if (!first)
vty_out (vty, "!%s", VTY_NEWLINE);
else
first = 0;
vty_out (vty, "route-map %s %s %d%s",
map->name,
route_map_type_str (index->type),
index->pref, VTY_NEWLINE);
for (rule = index->match_list.head; rule; rule = rule->next)
vty_out (vty, " match %s %s%s", rule->cmd->str,
rule->rule_str ? rule->rule_str : "",
VTY_NEWLINE);
for (rule = index->set_list.head; rule; rule = rule->next)
vty_out (vty, " set %s %s%s", rule->cmd->str,
rule->rule_str ? rule->rule_str : "",
VTY_NEWLINE);
if (index->nextrm)
vty_out (vty, " call %s%s", index->nextrm, VTY_NEWLINE);
if (index->exitpolicy == RMAP_GOTO)
vty_out (vty, " on-match goto %d%s", index->nextpref, VTY_NEWLINE);
if (index->exitpolicy == RMAP_NEXT)
vty_out (vty," on-match next%s", VTY_NEWLINE);
write++;
}
return write;
}
/* Route map node structure. */
struct cmd_node rmap_node =
{
RMAP_NODE,
"%s(config-route-map)# ",
1
};
/* Initialization of route map vector. */
void
route_map_init_vty ()
{
/* Install route map top node. */
install_node (&rmap_node, route_map_config_write);
/* Install route map commands. */
install_default (RMAP_NODE);
install_element (CONFIG_NODE, &route_map_cmd);
install_element (CONFIG_NODE, &no_route_map_cmd);
install_element (CONFIG_NODE, &no_route_map_all_cmd);
/* Install the on-match stuff */
install_element (RMAP_NODE, &route_map_cmd);
install_element (RMAP_NODE, &rmap_onmatch_next_cmd);
install_element (RMAP_NODE, &no_rmap_onmatch_next_cmd);
install_element (RMAP_NODE, &rmap_onmatch_goto_cmd);
install_element (RMAP_NODE, &no_rmap_onmatch_goto_cmd);
/* Install the continue stuff (ALIAS of on-match). */
install_element (RMAP_NODE, &rmap_continue_cmd);
install_element (RMAP_NODE, &no_rmap_continue_cmd);
install_element (RMAP_NODE, &rmap_continue_index_cmd);
/* Install the call stuff. */
install_element (RMAP_NODE, &rmap_call_cmd);
install_element (RMAP_NODE, &no_rmap_call_cmd);
/* Install show command */
install_element (ENABLE_NODE, &rmap_show_cmd);
install_element (ENABLE_NODE, &rmap_show_name_cmd);
}
|