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
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665 | // Copyright (C) 2011-2024 Internet Systems Consortium, Inc. ("ISC")
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
#include <config.h>
#include <dhcp/dhcp4.h>
#include <dhcp/dhcp6.h>
#include <dhcp/libdhcp++.h>
#include <dhcp/option.h>
#include <dhcp/option_vendor.h>
#include <dhcp/option6_ia.h>
#include <dhcp/option6_iaaddr.h>
#include <dhcp/option_definition.h>
#include <dhcp/option_int_array.h>
#include <dhcp/option_vendor_class.h>
#include <dhcp/option_custom.h>
#include <dhcp/std_option_defs.h>
#include <dhcp/docsis3_option_defs.h>
#include <exceptions/exceptions.h>
#include <exceptions/isc_assert.h>
#include <util/buffer.h>
#include <util/io.h>
#include <boost/foreach.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <boost/lexical_cast.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <boost/shared_array.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <boost/shared_ptr.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <limits><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <list><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <unordered_map><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <vector><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
using namespace std;
using namespace isc::dhcp;
using namespace isc::util;
namespace isc {
namespace dhcp {
namespace {
/// @brief the option definitions and the respective space mapping
///
/// used for easier initialization of option definitions by space name
const OptionDefParamsEncapsulation OPTION_DEF_PARAMS[] = {
{ STANDARD_V4_OPTION_DEFINITIONS, STANDARD_V4_OPTION_DEFINITIONS_SIZE, DHCP4_OPTION_SPACE },
{ STANDARD_V6_OPTION_DEFINITIONS, STANDARD_V6_OPTION_DEFINITIONS_SIZE, DHCP6_OPTION_SPACE },
{ DOCSIS3_V4_OPTION_DEFINITIONS, DOCSIS3_V4_OPTION_DEFINITIONS_SIZE, DOCSIS3_V4_OPTION_SPACE },
{ DOCSIS3_V6_OPTION_DEFINITIONS, DOCSIS3_V6_OPTION_DEFINITIONS_SIZE, DOCSIS3_V6_OPTION_SPACE },
{ ISC_V6_OPTION_DEFINITIONS, ISC_V6_OPTION_DEFINITIONS_SIZE, ISC_V6_OPTION_SPACE },
{ MAPE_V6_OPTION_DEFINITIONS, MAPE_V6_OPTION_DEFINITIONS_SIZE, MAPE_V6_OPTION_SPACE },
{ MAPT_V6_OPTION_DEFINITIONS, MAPT_V6_OPTION_DEFINITIONS_SIZE, MAPT_V6_OPTION_SPACE },
{ LW_V6_OPTION_DEFINITIONS, LW_V6_OPTION_DEFINITIONS_SIZE, LW_V6_OPTION_SPACE },
{ V4V6_RULE_OPTION_DEFINITIONS, V4V6_RULE_OPTION_DEFINITIONS_SIZE, V4V6_RULE_OPTION_SPACE },
{ V4V6_BIND_OPTION_DEFINITIONS, V4V6_BIND_OPTION_DEFINITIONS_SIZE, V4V6_BIND_OPTION_SPACE },
{ V6_NTP_SERVER_DEFINITIONS, V6_NTP_SERVER_DEFINITIONS_SIZE, V6_NTP_SERVER_SPACE },
{ CABLELABS_CLIENT_CONF_DEFINITIONS, CABLELABS_CLIENT_CONF_DEFINITIONS_SIZE,
CABLELABS_CLIENT_CONF_SPACE },
{ LAST_RESORT_V4_OPTION_DEFINITIONS, LAST_RESORT_V4_OPTION_DEFINITIONS_SIZE, LAST_RESORT_V4_OPTION_SPACE },
{ DHCP_AGENT_OPTION_DEFINITIONS, DHCP_AGENT_OPTION_DEFINITIONS_SIZE, DHCP_AGENT_OPTION_SPACE },
{ NULL, 0, "" }
};
} // namespace
} // namespace dhcp
} // namespace isc
// static array with factories for options
map<unsigned short, Option::Factory*> LibDHCP::v4factories_;
// static array with factories for options
map<unsigned short, Option::Factory*> LibDHCP::v6factories_;
// Static container with option definitions grouped by option space.
OptionDefContainers LibDHCP::option_defs_;
// Static container with option definitions created in runtime.
StagedValue<OptionDefSpaceContainer> LibDHCP::runtime_option_defs_;
// Null container.
const OptionDefContainerPtr null_option_def_container_(new OptionDefContainer());
// Those two vendor classes are used for cable modems:
/// DOCSIS3.0 compatible cable modem
const char* isc::dhcp::DOCSIS3_CLASS_MODEM = "docsis3.0";
/// DOCSIS3.0 cable modem that has router built-in
const char* isc::dhcp::DOCSIS3_CLASS_EROUTER = "eRouter1.0";
// Let's keep it in .cc file. Moving it to .h would require including optionDefParams
// definitions there
void initOptionSpace(OptionDefContainerPtr& defs,
const OptionDefParams* params,
size_t params_size);
bool LibDHCP::initialized_ = LibDHCP::initOptionDefs();
const OptionDefContainerPtr
LibDHCP::getOptionDefs(const string& space) {
auto const& container = option_defs_.find(space);
if (container != option_defs_.end()) {
return (container->second);
}
return (null_option_def_container_);
}
const OptionDefContainerPtr
LibDHCP::getVendorOptionDefs(const Option::Universe u, const uint32_t vendor_id) {
if (Option::V4 == u) {
if (VENDOR_ID_CABLE_LABS == vendor_id) {
return getOptionDefs(DOCSIS3_V4_OPTION_SPACE);
}
} else if (Option::V6 == u) {
if (VENDOR_ID_CABLE_LABS == vendor_id) {
return getOptionDefs(DOCSIS3_V6_OPTION_SPACE);
} else if (ENTERPRISE_ID_ISC == vendor_id) {
return getOptionDefs(ISC_V6_OPTION_SPACE);
}
}
return (null_option_def_container_);
}
OptionDefinitionPtr
LibDHCP::getOptionDef(const string& space, const uint16_t code) {
const OptionDefContainerPtr& defs = getOptionDefs(space);
const OptionDefContainerTypeIndex& idx = defs->get<1>();
const OptionDefContainerTypeRange& range = idx.equal_range(code);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefinitionPtr
LibDHCP::getOptionDef(const string& space, const string& name) {
const OptionDefContainerPtr& defs = getOptionDefs(space);
const OptionDefContainerNameIndex& idx = defs->get<2>();
const OptionDefContainerNameRange& range = idx.equal_range(name);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefinitionPtr
LibDHCP::getVendorOptionDef(const Option::Universe u, const uint32_t vendor_id,
const string& name) {
const OptionDefContainerPtr& defs = getVendorOptionDefs(u, vendor_id);
if (!defs) {
return (OptionDefinitionPtr());
}
const OptionDefContainerNameIndex& idx = defs->get<2>();
const OptionDefContainerNameRange& range = idx.equal_range(name);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefinitionPtr
LibDHCP::getVendorOptionDef(const Option::Universe u, const uint32_t vendor_id,
const uint16_t code) {
const OptionDefContainerPtr& defs = getVendorOptionDefs(u, vendor_id);
if (!defs) {
// Weird universe or unknown vendor_id. We don't care. No definitions
// one way or another
// What is it anyway?
return (OptionDefinitionPtr());
}
const OptionDefContainerTypeIndex& idx = defs->get<1>();
const OptionDefContainerTypeRange& range = idx.equal_range(code);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefinitionPtr
LibDHCP::getRuntimeOptionDef(const string& space, const uint16_t code) {
OptionDefContainerPtr container = runtime_option_defs_.getValue().getItems(space);
const OptionDefContainerTypeIndex& index = container->get<1>();
const OptionDefContainerTypeRange& range = index.equal_range(code);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefinitionPtr
LibDHCP::getRuntimeOptionDef(const string& space, const string& name) {
OptionDefContainerPtr container = runtime_option_defs_.getValue().getItems(space);
const OptionDefContainerNameIndex& index = container->get<2>();
const OptionDefContainerNameRange& range = index.equal_range(name);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefContainerPtr
LibDHCP::getRuntimeOptionDefs(const string& space) {
return (runtime_option_defs_.getValue().getItems(space));
}
void
LibDHCP::setRuntimeOptionDefs(const OptionDefSpaceContainer& defs) {
OptionDefSpaceContainer defs_copy;
list<string> option_space_names = defs.getOptionSpaceNames();
for (auto const& name : option_space_names) {
OptionDefContainerPtr container = defs.getItems(name);
for (auto const& def : *container) {
OptionDefinitionPtr def_copy(new OptionDefinition(*def));
defs_copy.addItem(def_copy);
}
}
runtime_option_defs_ = defs_copy;
}
void
LibDHCP::clearRuntimeOptionDefs() {
runtime_option_defs_.reset();
}
void
LibDHCP::revertRuntimeOptionDefs() {
runtime_option_defs_.revert();
}
void
LibDHCP::commitRuntimeOptionDefs() {
runtime_option_defs_.commit();
}
OptionDefinitionPtr
LibDHCP::getLastResortOptionDef(const string& space, const uint16_t code) {
OptionDefContainerPtr container = getLastResortOptionDefs(space);
const OptionDefContainerTypeIndex& index = container->get<1>();
const OptionDefContainerTypeRange& range = index.equal_range(code);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefinitionPtr
LibDHCP::getLastResortOptionDef(const string& space, const string& name) {
OptionDefContainerPtr container = getLastResortOptionDefs(space);
const OptionDefContainerNameIndex& index = container->get<2>();
const OptionDefContainerNameRange& range = index.equal_range(name);
if (range.first != range.second) {
return (*range.first);
}
return (OptionDefinitionPtr());
}
OptionDefContainerPtr
LibDHCP::getLastResortOptionDefs(const string& space) {
if (space == DHCP4_OPTION_SPACE) {
return getOptionDefs(LAST_RESORT_V4_OPTION_SPACE);
}
return (null_option_def_container_);
}
bool
LibDHCP::shouldDeferOptionUnpack(const string& space, const uint16_t code) {
return ((space == DHCP4_OPTION_SPACE) &&
((code == DHO_VENDOR_ENCAPSULATED_OPTIONS) ||
((code >= 224) && (code <= 254))));
}
OptionPtr
LibDHCP::optionFactory(Option::Universe u,
uint16_t type,
const OptionBuffer& buf) {
FactoryMap::iterator it;
if (u == Option::V4) {
it = v4factories_.find(type);
if (it == v4factories_.end()) {
isc_throw(BadValue, "factory function not registered "
"for DHCP v4 option type " << type);
}
} else if (u == Option::V6) {
it = v6factories_.find(type);
if (it == v6factories_.end()) {
isc_throw(BadValue, "factory function not registered "
"for DHCPv6 option type " << type);
}
} else {
isc_throw(BadValue, "invalid universe specified (expected "
"Option::V4 or Option::V6");
}
return (it->second(u, type, buf));
}
size_t
LibDHCP::unpackOptions6(const OptionBuffer& buf, const string& option_space,
OptionCollection& options,
size_t* relay_msg_offset /* = 0 */,
size_t* relay_msg_len /* = 0 */) {
size_t offset = 0;
size_t length = buf.size();
size_t last_offset = 0;
// Get the list of standard option definitions.
const OptionDefContainerPtr& option_defs = LibDHCP::getOptionDefs(option_space);
// Runtime option definitions for non standard option space and if
// the definition doesn't exist within the standard option definitions.
const OptionDefContainerPtr& runtime_option_defs = LibDHCP::getRuntimeOptionDefs(option_space);
// @todo Once we implement other option spaces we should add else clause
// here and gather option definitions for them. For now leaving option_defs
// empty will imply creation of generic Option.
// Get the search indexes #1. It allows to search for option definitions
// using option code.
const OptionDefContainerTypeIndex& idx = option_defs->get<1>();
const OptionDefContainerTypeIndex& runtime_idx = runtime_option_defs->get<1>();
// The buffer being read comprises a set of options, each starting with
// a two-byte type code and a two-byte length field.
while (offset < length) {
// Save the current offset for backtracking
last_offset = offset;
// Check if there is room for another option
if (offset + 4 > length) {
// Still something but smaller than an option
return (last_offset);
}
// Parse the option header
uint16_t opt_type = readUint16(&buf[offset], 2);
offset += 2;
uint16_t opt_len = readUint16(&buf[offset], 2);
offset += 2;
if (offset + opt_len > length) {
// We peeked at the option header of the next option, but
// discovered that it would end up beyond buffer end, so
// the option is truncated. Hence we can't parse
// it. Therefore we revert back by those bytes (as if
// we never parsed them).
//
// @note it is the responsibility of the caller to throw
// an exception on partial parsing
return (last_offset);
}
if (opt_type == D6O_RELAY_MSG && relay_msg_offset && relay_msg_len) {
// remember offset of the beginning of the relay-msg option
*relay_msg_offset = offset;
*relay_msg_len = opt_len;
// do not create that relay-msg option
offset += opt_len;
continue;
}
if (opt_type == D6O_VENDOR_OPTS) {
if (offset + 4 > length) {
// Truncated vendor-option. We expect at least
// 4 bytes for the enterprise-id field. Let's roll back
// option code + option length (4 bytes) and return.
return (last_offset);
}
// Parse this as vendor option
OptionPtr vendor_opt(new OptionVendor(Option::V6, buf.begin() + offset,
buf.begin() + offset + opt_len));
options.insert(std::make_pair(opt_type, vendor_opt));
offset += opt_len;
continue;
}
// Get all definitions with the particular option code. Note
// that option code is non-unique within this container
// however at this point we expect to get one option
// definition with the particular code. If more are returned
// we report an error.
OptionDefContainerTypeRange range;
// Number of option definitions returned.
size_t num_defs = 0;
// We previously did the lookup only for dhcp6 option space, but with the
// addition of S46 options, we now do it for every space.
range = idx.equal_range(opt_type);
num_defs = std::distance(range.first, range.second);
// Standard option definitions do not include the definition for
// our option or we're searching for non-standard option. Try to
// find the definition among runtime option definitions.
if (num_defs == 0) {
range = runtime_idx.equal_range(opt_type);
num_defs = std::distance(range.first, range.second);
}
OptionPtr opt;
if (num_defs > 1) {
// Multiple options of the same code are not supported right now!
isc_throw(isc::Unexpected, "Internal error: multiple option"
" definitions for option type " << opt_type <<
" returned. Currently it is not supported to initialize"
" multiple option definitions for the same option code."
" This will be supported once support for option spaces"
" is implemented");
} else if (num_defs == 0) {
// @todo Don't crash if definition does not exist because
// only a few option definitions are initialized right
// now. In the future we will initialize definitions for
// all options and we will remove this elseif. For now,
// return generic option.
opt = OptionPtr(new Option(Option::V6, opt_type,
buf.begin() + offset,
buf.begin() + offset + opt_len));
} else {
try {
// The option definition has been found. Use it to create
// the option instance from the provided buffer chunk.
const OptionDefinitionPtr& def = *(range.first);
isc_throw_assert(def);
opt = def->optionFactory(Option::V6, opt_type,
buf.begin() + offset,
buf.begin() + offset + opt_len);
} catch (const SkipThisOptionError&) {
opt.reset();
} catch (const SkipRemainingOptionsError&) {
throw;
} catch (const std::exception& ex) {
isc_throw(OptionParseError, "opt_type: " << static_cast<uint16_t>(opt_type)
<< ", opt_len " << static_cast<uint16_t>(opt_len)
<< ", error: " << ex.what());
}
}
// add option to options
if (opt) {
options.insert(std::make_pair(opt_type, opt));
}
offset += opt_len;
}
last_offset = offset;
return (last_offset);
}
size_t
LibDHCP::unpackOptions4(const OptionBuffer& buf, const string& option_space,
OptionCollection& options, list<uint16_t>& deferred,
bool check) {
size_t offset = 0;
size_t last_offset = 0;
// Special case when option_space is dhcp4.
bool space_is_dhcp4 = (option_space == DHCP4_OPTION_SPACE);
// Get the list of standard option definitions.
const OptionDefContainerPtr& option_defs = LibDHCP::getOptionDefs(option_space);
// Runtime option definitions for non standard option space and if
// the definition doesn't exist within the standard option definitions.
const OptionDefContainerPtr& runtime_option_defs = LibDHCP::getRuntimeOptionDefs(option_space);
// Get the search indexes #1. It allows to search for option definitions
// using option code.
const OptionDefContainerTypeIndex& idx = option_defs->get<1>();
const OptionDefContainerTypeIndex& runtime_idx = runtime_option_defs->get<1>();
// Flexible PAD and END parsing.
bool flex_pad = (check && (runtime_idx.count(DHO_PAD) == 0));
bool flex_end = (check && (runtime_idx.count(DHO_END) == 0));
// The buffer being read comprises a set of options, each starting with
// a one-byte type code and a one-byte length field.
// Track seen options in a first pass.
vector<uint32_t> count(256, 0);
while (offset < buf.size()) {
// Get the option type
uint8_t opt_type = buf[offset++];
// DHO_END is a special, one octet long option
// Valid in dhcp4 space or when check is true and
// there is a sub-option configured for this code.
if ((opt_type == DHO_END) && (space_is_dhcp4 || flex_end)) {
// Done.
break;
}
// DHO_PAD is just a padding after DHO_END. Let's continue parsing
// in case we receive a message without DHO_END.
// Valid in dhcp4 space or when check is true and
// there is a sub-option configured for this code.
if ((opt_type == DHO_PAD) && (space_is_dhcp4 || flex_pad)) {
continue;
}
if (offset + 1 > buf.size()) {
// Error case.
break;
}
uint8_t opt_len = buf[offset++];
if (offset + opt_len > buf.size()) {
// Error case.
break;
}
// See below for this special case.
if (space_is_dhcp4 && opt_len == 0 && opt_type == DHO_HOST_NAME) {
continue;
}
offset += opt_len;
// Increment count.
count[opt_type] += 1;
}
// Fusing option buffers.
unordered_map<uint8_t, pair<OptionBuffer, uint32_t>> fused;
// Second pass.
offset = 0;
while (offset < buf.size()) {
// Save the current offset for backtracking
last_offset = offset;
// Get the option type
uint8_t opt_type = buf[offset++];
// DHO_END is a special, one octet long option
// Valid in dhcp4 space or when check is true and
// there is a sub-option configured for this code.
if ((opt_type == DHO_END) && (space_is_dhcp4 || flex_end)) {
// just return. Don't need to add DHO_END option
// Don't return offset because it makes this condition
// and partial parsing impossible to recognize.
return (last_offset);
}
// DHO_PAD is just a padding after DHO_END. Let's continue parsing
// in case we receive a message without DHO_END.
// Valid in dhcp4 space or when check is true and
// there is a sub-option configured for this code.
if ((opt_type == DHO_PAD) && (space_is_dhcp4 || flex_pad)) {
continue;
}
if (offset + 1 > buf.size()) {
// We peeked at the option header of the next option, but
// discovered that it would end up beyond buffer end, so
// the option is truncated. Hence we can't parse
// it. Therefore we revert back (as if we never parsed it).
//
// @note it is the responsibility of the caller to throw
// an exception on partial parsing
return (last_offset);
}
uint8_t opt_len = buf[offset++];
if (offset + opt_len > buf.size()) {
// We peeked at the option header of the next option, but
// discovered that it would end up beyond buffer end, so
// the option is truncated. Hence we can't parse
// it. Therefore we revert back (as if we never parsed it).
return (last_offset);
}
// While an empty Host Name option is non-RFC compliant, some clients
// do send it. In the spirit of being liberal, we'll just drop it,
// rather than the dropping the whole packet. We do not have a
// way to log this from here but meh... a PCAP will show it arriving,
// and we know we drop it.
if (space_is_dhcp4 && opt_len == 0 && opt_type == DHO_HOST_NAME) {
continue;
}
OptionBuffer obuf(buf.begin() + offset, buf.begin() + offset + opt_len);
offset += opt_len;
// Concatenate multiple instance of an option.
uint32_t opt_count = count[opt_type];
if (opt_count > 1) {
OptionBuffer& previous = fused[opt_type].first;
previous.insert(previous.end(), obuf.begin(), obuf.end());
uint32_t& already_seen = fused[opt_type].second;
++already_seen;
if (already_seen != opt_count) {
continue;
} else {
// last occurrence: build the option.
obuf = previous;
}
}
// Get all definitions with the particular option code. Note
// that option code is non-unique within this container
// however at this point we expect to get one option
// definition with the particular code. If more are returned
// we report an error.
OptionDefContainerTypeRange range;
// Number of option definitions returned.
size_t num_defs = 0;
// Previously we did the lookup only for "dhcp4" option space, but there
// may be standard options in other spaces (e.g. radius). So we now do
// the lookup for every space.
range = idx.equal_range(opt_type);
num_defs = std::distance(range.first, range.second);
// Standard option definitions do not include the definition for
// our option or we're searching for non-standard option. Try to
// find the definition among runtime option definitions.
if (num_defs == 0) {
range = runtime_idx.equal_range(opt_type);
num_defs = std::distance(range.first, range.second);
}
// Check if option unpacking must be deferred
if (shouldDeferOptionUnpack(option_space, opt_type)) {
num_defs = 0;
// Store deferred option only once.
bool found = false;
for (auto const& existing : deferred) {
if (existing == opt_type) {<--- Consider using std::any_of algorithm instead of a raw loop.
found = true;
break;
}
}
if (!found) {
deferred.push_back(opt_type);
}
}
if (space_is_dhcp4 &&
(opt_type == DHO_VIVSO_SUBOPTIONS ||
opt_type == DHO_VIVCO_SUBOPTIONS)) {
num_defs = 0;
}
OptionPtr opt;
if (num_defs > 1) {
// Multiple options of the same code are not supported right now!
isc_throw(isc::Unexpected, "Internal error: multiple option"
" definitions for option type " <<
static_cast<int>(opt_type) <<
" returned. Currently it is not supported to initialize"
" multiple option definitions for the same option code."
" This will be supported once support for option spaces"
" is implemented");
} else if (num_defs == 0) {
opt = OptionPtr(new Option(Option::V4, opt_type, obuf));
} else {
try {
// The option definition has been found. Use it to create
// the option instance from the provided buffer chunk.
const OptionDefinitionPtr& def = *(range.first);
isc_throw_assert(def);
opt = def->optionFactory(Option::V4, opt_type, obuf);
} catch (const SkipThisOptionError&) {
opt.reset();
} catch (const SkipRemainingOptionsError&) {
throw;
} catch (const std::exception& ex) {
isc_throw(OptionParseError, "opt_type: " << static_cast<uint16_t>(opt_type)
<< ", opt_len: " << static_cast<uint16_t>(opt_len)
<< ", error: " << ex.what());
}
}
// If we have the option, insert it
if (opt) {
options.insert(std::make_pair(opt_type, opt));
}
}
last_offset = offset;
return (last_offset);
}
namespace { // Anonymous namespace.
// VIVCO part of extendVendorOptions4.
void
extendVivco(OptionCollection& options) {
typedef vector<OpaqueDataTuple> TuplesCollection;
map<uint32_t, TuplesCollection> vendors_tuples;
auto const& range = options.equal_range(DHO_VIVCO_SUBOPTIONS);
BOOST_FOREACH(auto const& it, range) {
uint32_t offset = 0;
auto const& data = it.second->getData();
size_t size;
while ((size = data.size() - offset) != 0) {
if (size < sizeof(uint32_t)) {
options.erase(DHO_VIVCO_SUBOPTIONS);
isc_throw(SkipRemainingOptionsError,
"Truncated vendor-class information option"
<< ", length=" << size);
}
uint32_t vendor_id = readUint32(&data[offset], data.size());
offset += 4;
try {
// From OptionVendorClass::unpack.
OpaqueDataTuple tuple(OpaqueDataTuple::LENGTH_1_BYTE,
data.begin() + offset, data.end());
vendors_tuples[vendor_id].push_back(tuple);
offset += tuple.getTotalLength();
} catch (const OpaqueDataTupleError&) {
// Ignore this kind of error and continue.
break;
} catch (const isc::Exception&) {
options.erase(DHO_VIVCO_SUBOPTIONS);
throw;
}
}
}
if (vendors_tuples.empty()) {
return;
}
// Delete the initial option.
options.erase(DHO_VIVCO_SUBOPTIONS);
// Create a new instance of OptionVendor for each enterprise ID.
for (auto const& vendor : vendors_tuples) {
if (vendor.second.empty()) {
continue;
}
OptionVendorClassPtr vendor_opt(new OptionVendorClass(Option::V4,
vendor.first));
for (size_t i = 0; i < vendor.second.size(); ++i) {
if (i == 0) {
vendor_opt->setTuple(0, vendor.second[0]);
} else {
vendor_opt->addTuple(vendor.second[i]);
}
}
// Add the new instance of VendorOption with respective sub-options for
// this enterprise ID.
options.insert(std::make_pair(DHO_VIVCO_SUBOPTIONS, vendor_opt));
}
}
// VIVSO part of extendVendorOptions4.
void
extendVivso(OptionCollection& options) {
map<uint32_t, OptionCollection> vendors_data;
auto const& range = options.equal_range(DHO_VIVSO_SUBOPTIONS);
BOOST_FOREACH(auto const& it, range) {
uint32_t offset = 0;
auto const& data = it.second->getData();
size_t size;
while ((size = data.size() - offset) != 0) {
if (size < sizeof(uint32_t)) {
options.erase(DHO_VIVSO_SUBOPTIONS);
isc_throw(SkipRemainingOptionsError,
"Truncated vendor-specific information option"
<< ", length=" << size);
}
uint32_t vendor_id = readUint32(&data[offset], data.size());
offset += 4;
const OptionBuffer vendor_buffer(data.begin() + offset, data.end());
try {
offset += LibDHCP::unpackVendorOptions4(vendor_id, vendor_buffer,
vendors_data[vendor_id]);
} catch (const SkipThisOptionError&) {
// Ignore this kind of error and continue.
break;
} catch (const isc::Exception&) {
options.erase(DHO_VIVSO_SUBOPTIONS);
throw;
}
}
}
if (vendors_data.empty()) {
return;
}
// Delete the initial option.
options.erase(DHO_VIVSO_SUBOPTIONS);
// Create a new instance of OptionVendor for each enterprise ID.
for (auto const& vendor : vendors_data) {
OptionVendorPtr vendor_opt(new OptionVendor(Option::V4, vendor.first));
for (auto const& option : vendor.second) {
vendor_opt->addOption(option.second);
}
// Add the new instance of VendorOption with respective sub-options for
// this enterprise ID.
options.insert(std::make_pair(DHO_VIVSO_SUBOPTIONS, vendor_opt));
}
}
} // end of anonymous namespace.
void
LibDHCP::extendVendorOptions4(OptionCollection& options) {
extendVivco(options);
extendVivso(options);
}
size_t
LibDHCP::unpackVendorOptions6(const uint32_t vendor_id, const OptionBuffer& buf,
OptionCollection& options) {
size_t offset = 0;
size_t length = buf.size();
// Get the list of option definitions for this particular vendor-id
const OptionDefContainerPtr& option_defs =
LibDHCP::getVendorOptionDefs(Option::V6, vendor_id);
// Get the search index #1. It allows to search for option definitions
// using option code. If there's no such vendor-id space, we're out of luck
// anyway.
const OptionDefContainerTypeIndex* idx = NULL;
if (option_defs) {
idx = &(option_defs->get<1>());
}
// The buffer being read comprises a set of options, each starting with
// a two-byte type code and a two-byte length field.
while (offset < length) {
if (offset + 4 > length) {
isc_throw(SkipRemainingOptionsError,
"Vendor option parse failed: truncated header");
}
uint16_t opt_type = readUint16(&buf[offset], 2);
offset += 2;
uint16_t opt_len = readUint16(&buf[offset], 2);
offset += 2;
if (offset + opt_len > length) {
isc_throw(SkipRemainingOptionsError,
"Vendor option parse failed. Tried to parse "
<< offset + opt_len << " bytes from " << length
<< "-byte long buffer.");
}
OptionPtr opt;
opt.reset();
// If there is a definition for such a vendor option...
if (idx) {
// Get all definitions with the particular option
// code. Note that option code is non-unique within this
// container however at this point we expect to get one
// option definition with the particular code. If more are
// returned we report an error.
const OptionDefContainerTypeRange& range =
idx->equal_range(opt_type);
// Get the number of returned option definitions for the
// option code.
size_t num_defs = std::distance(range.first, range.second);
if (num_defs > 1) {
// Multiple options of the same code are not supported
// right now!
isc_throw(isc::Unexpected, "Internal error: multiple option"
" definitions for option type " << opt_type <<
" returned. Currently it is not supported to"
" initialize multiple option definitions for the"
" same option code. This will be supported once"
" support for option spaces is implemented");
} else if (num_defs == 1) {
// The option definition has been found. Use it to create
// the option instance from the provided buffer chunk.
const OptionDefinitionPtr& def = *(range.first);
isc_throw_assert(def);
opt = def->optionFactory(Option::V6, opt_type,
buf.begin() + offset,
buf.begin() + offset + opt_len);
}
}
// This can happen in one of 2 cases:
// 1. we do not have definitions for that vendor-space
// 2. we do have definitions, but that particular option was
// not defined
if (!opt) {
opt = OptionPtr(new Option(Option::V6, opt_type,
buf.begin() + offset,
buf.begin() + offset + opt_len));
}
// add option to options
if (opt) {
options.insert(std::make_pair(opt_type, opt));
}
offset += opt_len;
}
return (offset);
}
size_t
LibDHCP::unpackVendorOptions4(const uint32_t vendor_id, const OptionBuffer& buf,
OptionCollection& options) {
size_t offset = 0;
// Get the list of standard option definitions.
const OptionDefContainerPtr& option_defs =
LibDHCP::getVendorOptionDefs(Option::V4, vendor_id);
// Get the search index #1. It allows to search for option definitions
// using option code.
const OptionDefContainerTypeIndex* idx = NULL;
if (option_defs) {
idx = &(option_defs->get<1>());
}
// The buffer being read comprises a set of options, each starting with
// a one-byte type code and a one-byte length field.
while (offset < buf.size()) {
// Note that Vendor-Specific info option (RFC3925) has a
// different option format than Vendor-Spec info for
// DHCPv6. (there's additional layer of data-length)
uint8_t data_len = buf[offset++];
if (offset + data_len > buf.size()) {
// The option is truncated.
isc_throw(SkipRemainingOptionsError,
"Attempt to parse truncated vendor option");
}
uint8_t offset_end = offset + data_len;
// beginning of data-chunk parser
while (offset < offset_end) {
uint8_t opt_type = buf[offset++];
// No DHO_END or DHO_PAD in vendor options
if (offset + 1 > offset_end) {
// opt_type must be cast to integer so as it is not
// treated as unsigned char value (a number is
// presented in error message).
isc_throw(SkipRemainingOptionsError,
"Attempt to parse truncated vendor option "
<< static_cast<int>(opt_type));
}
uint8_t opt_len = buf[offset++];
if (offset + opt_len > offset_end) {
isc_throw(SkipRemainingOptionsError,
"Option parse failed. Tried to parse "
<< offset + opt_len << " bytes from " << buf.size()
<< "-byte long buffer.");
}
OptionPtr opt;
opt.reset();
if (idx) {
// Get all definitions with the particular option
// code. Note that option code is non-unique within
// this container however at this point we expect to
// get one option definition with the particular
// code. If more are returned we report an error.
const OptionDefContainerTypeRange& range =
idx->equal_range(opt_type);
// Get the number of returned option definitions for
// the option code.
size_t num_defs = std::distance(range.first, range.second);
if (num_defs > 1) {
// Multiple options of the same code are not
// supported right now!
isc_throw(isc::Unexpected, "Internal error: multiple"
" option definitions for option type "
<< opt_type << " returned. Currently it is"
" not supported to initialize multiple option"
" definitions for the same option code."
" This will be supported once support for"
" option spaces is implemented");
} else if (num_defs == 1) {
// The option definition has been found. Use it to create
// the option instance from the provided buffer chunk.
const OptionDefinitionPtr& def = *(range.first);
isc_throw_assert(def);
opt = def->optionFactory(Option::V4, opt_type,
buf.begin() + offset,
buf.begin() + offset + opt_len);
}
}
if (!opt) {
opt = OptionPtr(new Option(Option::V4, opt_type,
buf.begin() + offset,
buf.begin() + offset + opt_len));
}
options.insert(std::make_pair(opt_type, opt));
offset += opt_len;
} // end of data-chunk
break; // end of the vendor block.
}
return (offset);
}
void
LibDHCP::packOptions4(OutputBuffer& buf, const OptionCollection& options,
bool top, bool check) {
OptionCollection agent;
OptionPtr end;
// We only look for type when we're the top level
// call that starts packing for options for a packet.
// This way we avoid doing type logic in all ensuing
// recursive calls.
if (top) {
auto x = options.find(DHO_DHCP_MESSAGE_TYPE);
if (x != options.end()) {
x->second->pack(buf, check);
}
}
for (auto const& option : options) {
// TYPE is already done, RAI and END options must be last.
switch (option.first) {
case DHO_DHCP_MESSAGE_TYPE:
break;
case DHO_DHCP_AGENT_OPTIONS:
agent.insert(make_pair(DHO_DHCP_AGENT_OPTIONS, option.second));
break;
case DHO_END:
end = option.second;
break;
default:
option.second->pack(buf, check);
break;
}
}
// Add the RAI option if it exists.
for (auto const& option : agent) {
option.second->pack(buf, check);
}
// And at the end the END option.
if (end) {
end->pack(buf, check);
}
}
bool
LibDHCP::splitOptions4(OptionCollection& options,
ScopedOptionsCopyContainer& scoped_options,
uint32_t used) {
bool result = false;
// We need to loop until all options have been split.
uint32_t tries = 0;
for (;; tries++) {
// Let's not do this forever if there is a bug hiding here somewhere...
// 65535 times should be enough for any packet load...
if (tries == std::numeric_limits<uint16_t>::max()) {
isc_throw(Unexpected, "packet split failed after trying "
<< tries << " times.");
}
bool found = false;
// Make a copy of the options so we can safely iterate over the
// old container.
OptionCollection copy = options;
// Iterate over all options in the container.
for (auto const& option : options) {
OptionPtr candidate = option.second;
OptionCollection& sub_options = candidate->getMutableOptions();
// Split suboptions recursively, if any.
OptionCollection distinct_options;
bool updated = false;
bool found_suboptions = false;<--- The scope of the variable 'found_suboptions' can be reduced. [+]The scope of the variable 'found_suboptions' can be reduced. Warning: Be careful when fixing this message, especially when there are inner loops. Here is an example where cppcheck will write that the scope for 'i' can be reduced:<--- Variable 'found_suboptions' is assigned a value that is never used.
void f(int x)<--- Variable 'found_suboptions' is assigned a value that is never used.
{<--- Variable 'found_suboptions' is assigned a value that is never used.
int i = 0;<--- Variable 'found_suboptions' is assigned a value that is never used.
if (x) {<--- Variable 'found_suboptions' is assigned a value that is never used.
// it's safe to move 'int i = 0;' here<--- Variable 'found_suboptions' is assigned a value that is never used.
for (int n = 0; n < 10; ++n) {<--- Variable 'found_suboptions' is assigned a value that is never used.
// it is possible but not safe to move 'int i = 0;' here<--- Variable 'found_suboptions' is assigned a value that is never used.
do_something(&i);<--- Variable 'found_suboptions' is assigned a value that is never used.
}<--- Variable 'found_suboptions' is assigned a value that is never used.
}<--- Variable 'found_suboptions' is assigned a value that is never used.
}<--- Variable 'found_suboptions' is assigned a value that is never used.
When you see this message it is always safe to reduce the variable scope 1 level. <--- Variable 'found_suboptions' is assigned a value that is never used.
// There are 3 cases when the total size is larger than (255 - used):
// 1. option has no suboptions and has large data
// 2. option has large suboptions and has no data
// 3. option has both options and suboptions:
// 3.1. suboptions are large and data is large
// 3.2. suboptions are large and data is small
// 3.3. suboptions are small and data is large
// 3.4. suboptions are small and data is small but combined they are large
// All other combinations reside in total size smaller than (255 - used):
// 4. no split of any suboption or data:
// 4.1 option has no suboptions and has small data
// 4.2 option has small suboptions and has no data
// 4.3 option has both small suboptions and small data
// 4.4 option has no suboptions and has no data
if (sub_options.size()) {
// The 2. and 3. and 4.2 and 4.3 cases are handled here (the suboptions part).
ScopedOptionsCopyPtr candidate_scoped_options(new ScopedSubOptionsCopy(candidate));
found_suboptions = LibDHCP::splitOptions4(sub_options, scoped_options,
used + candidate->getHeaderLen());
// There are 3 cases here:
// 2. option has large suboptions and has no data
// 3. option has both options and suboptions:
// 3.1. suboptions are large and data is large so there is suboption splitting
// and found_suboptions is true
// 3.2. suboptions are large and data is small so there is suboption splitting
// and found_suboptions is true
// 3.3. suboptions are small and data is large so there is no suboption splitting
// and found_suboptions is false
// 3.4. suboptions are small and data is small so there is no suboption splitting
// and found_suboptions is false but combined they are large
// 4. no split of any suboption or data
// Also split if the overflow is caused by adding the suboptions
// to the option data.
if (found_suboptions || candidate->len() > (255 - used)) {
// The 2. and 3. cases are handled here (the suboptions part).
updated = true;
scoped_options.push_back(candidate_scoped_options);
// Erase the old options from the new container so that only
// the new options are present.
copy.erase(option.first);
result = true;
// If there are suboptions which have been split, one parent
// option will be created for each of the chunk of the
// suboptions. If the suboptions have not been split,
// but they cause overflow when added to the option data,
// one parent option will contain the option data and one
// parent option will be created for each suboption.
// This will guarantee that none of the options plus
// suboptions will have more than 255 bytes.
for (auto const& sub_option : candidate->getMutableOptions()) {
OptionPtr data_sub_option(new Option(candidate->getUniverse(),
candidate->getType(),
OptionBuffer(0)));
data_sub_option->addOption(sub_option.second);
distinct_options.insert(make_pair(candidate->getType(), data_sub_option));
}
}
}
// The 1. and 3. and 4. cases are handled here (the data part).
// Create a new option containing only data that needs to be split
// and no suboptions (which are inserted in completely separate
// options which are added at the end).
OptionPtr data_option(new Option(candidate->getUniverse(),
candidate->getType(),
OptionBuffer(candidate->getData().begin(),
candidate->getData().end())));
OutputBuffer buf(0);
data_option->pack(buf, false);
uint32_t header_len = candidate->getHeaderLen();
// At least 1 + header length bytes must be available.
if (used >= 255 - header_len) {
isc_throw(BadValue, "there is no space left to split option "
<< candidate->getType() << " after parent already used "
<< used);
}
// Maximum option buffer size is 255 - header size - buffer size
// already used by parent options.
uint8_t len = 255 - header_len - used;
// Current option size after split is the sum of the data and the
// header size. The suboptions are serialized in separate options.
// The header is duplicated in all new options, but the rest of the
// data must be split and serialized.
uint32_t size = buf.getLength() - header_len;
// Only split if data does not fit in the current option.
// There are 3 cases here:
// 1. option has no suboptions and has large data
// 3. option has both options and suboptions:
// 3.1. suboptions are large and data is large
// 3.2. suboptions are large and data is small
// 3.3. suboptions are small and data is large
// 3.4. suboptions are small and data is small but combined they are large
// 4. no split of any suboption or data
if (size > len) {
// The 1. and 3.1. and 3.3 cases are handled here (the data part).
// Erase the old option from the new container so that only new
// options are present.
if (!updated) {
updated = true;
// Erase the old options from the new container so that only
// the new options are present.
copy.erase(option.first);
result = true;
}
uint32_t offset = 0;
// Drain the option buffer in multiple new options until all
// data is serialized.
for (; offset != size;) {
// Adjust the data length of the new option if remaining
// data is less than the 255 - header size (for the last
// option).
if (size - offset < len) {
len = size - offset;
}
// Create new option with data starting from offset and
// containing truncated length.
const uint8_t* data = buf.getData();
data += header_len;
OptionPtr new_option(new Option(candidate->getUniverse(),
candidate->getType(),
OptionBuffer(data + offset,
data + offset + len)));
// Adjust the offset for remaining data to be written to the
// next new option.
offset += len;
// Add the new option to the new container.
copy.insert(make_pair(candidate->getType(), new_option));
}
} else if ((candidate->len() > (255 - used)) && size) {
// The 3.2 and 3.4 cases are handled here (the data part).
// Also split if the overflow is caused by adding the suboptions
// to the option data (which should be of non zero size).
// Add the new option to the new container.
copy.insert(make_pair(candidate->getType(), data_option));
}
if (updated) {
// Add the new options containing the split suboptions, if any,
// to the new container.
copy.insert(distinct_options.begin(), distinct_options.end());
// After all new options have been split and added, update the
// option container with the new container.
options = copy;
// Other options might need splitting, so we need to iterate
// again until no option needs splitting.
found = true;
break;
}
}
// No option needs splitting, so we can exit the loop.
if (!found) {
break;
}
}
return (result);
}
void
LibDHCP::packOptions6(OutputBuffer& buf, const OptionCollection& options) {
for (auto const& option : options) {
option.second->pack(buf);
}
}
void
LibDHCP::splitNtpServerOptions6(OptionCollection& options) {
pair<OptionCollection::const_iterator, OptionCollection::const_iterator>
range = options.equal_range(D6O_NTP_SERVER);
if (range.first == range.second) {
return;
}
auto const& ntp_servers = OptionCollection(range.first, range.second);
static_cast<void>(options.erase(range.first, range.second));
auto const& def = D6O_NTP_SERVER_DEF();
for (auto const& opt : ntp_servers) {
for (auto const& sub : opt.second->getOptions()) {
auto new_option(new OptionCustom(def, Option::V6));
new_option->addOption(sub.second);
options.insert(make_pair(D6O_NTP_SERVER, new_option));
}
}
}
void
LibDHCP::OptionFactoryRegister(Option::Universe u, uint16_t opt_type,
Option::Factory* factory) {
switch (u) {
case Option::V6:
{
if (v6factories_.find(opt_type) != v6factories_.end()) {
isc_throw(BadValue, "There is already DHCPv6 factory registered "
<< "for option type " << opt_type);
}
v6factories_[opt_type] = factory;
return;
}
case Option::V4:
{
// Option 0 is special (a one octet-long, equal 0) PAD option. It is never
// instantiated as an Option object, but rather consumed during packet parsing.
if (opt_type == 0) {
isc_throw(BadValue, "Cannot redefine PAD option (code=0)");
}
// Option 255 is never instantiated as an option object. It is special
// (a one-octet equal 255) option that is added at the end of all options
// during packet assembly. It is also silently consumed during packet parsing.
if (opt_type > 254) {
isc_throw(BadValue, "Too big option type for DHCPv4, only 0-254 allowed.");
}
if (v4factories_.find(opt_type) != v4factories_.end()) {
isc_throw(BadValue, "There is already DHCPv4 factory registered "
<< "for option type " << opt_type);
}
v4factories_[opt_type] = factory;
return;
}
default:
isc_throw(BadValue, "Invalid universe type specified.");
}
return;
}
bool
LibDHCP::initOptionDefs() {
for (uint32_t i = 0; OPTION_DEF_PARAMS[i].optionDefParams; ++i) {
string space = OPTION_DEF_PARAMS[i].space;
option_defs_[space] = OptionDefContainerPtr(new OptionDefContainer());
initOptionSpace(option_defs_[space],
OPTION_DEF_PARAMS[i].optionDefParams,
OPTION_DEF_PARAMS[i].size);
}
static_cast<void>(LibDHCP::DHO_DHCP_REQUESTED_ADDRESS_DEF());
static_cast<void>(LibDHCP::DHO_DHCP_SERVER_IDENTIFIER_DEF());
static_cast<void>(LibDHCP::DHO_DHCP_AGENT_OPTIONS_DEF());
static_cast<void>(LibDHCP::DHO_SUBNET_SELECTION_DEF());
static_cast<void>(LibDHCP::DHO_DOMAIN_SEARCH_DEF());
static_cast<void>(LibDHCP::DHO_STATUS_CODE_DEF());
static_cast<void>(LibDHCP::D6O_CLIENT_FQDN_DEF());
static_cast<void>(LibDHCP::D6O_LQ_QUERY_DEF());
static_cast<void>(LibDHCP::D6O_CLIENT_DATA_DEF());
static_cast<void>(LibDHCP::D6O_LQ_RELAY_DATA_DEF());
static_cast<void>(LibDHCP::D6O_NTP_SERVER_DEF());
static_cast<void>(LibDHCP::D6O_BOOTFILE_URL_DEF());
static_cast<void>(LibDHCP::D6O_RSOO_DEF());
return (true);
}
uint32_t
LibDHCP::optionSpaceToVendorId(const string& option_space) {
// 8 is a minimal length of "vendor-X" format
if ((option_space.size() < 8) || (option_space.substr(0,7) != "vendor-")) {
return (0);
}
int64_t check;
try {
// text after "vendor-", supposedly numbers only
string x = option_space.substr(7);
check = boost::lexical_cast<int64_t>(x);
} catch (const boost::bad_lexical_cast &) {
return (0);
}
if ((check < 0) || (check > std::numeric_limits<uint32_t>::max())) {
return (0);
}
// value is small enough to fit
return (static_cast<uint32_t>(check));
}
void
initOptionSpace(OptionDefContainerPtr& defs, const OptionDefParams* params,
size_t params_size) {
// Container holding vendor options is typically not initialized, as it
// is held in map of null pointers. We need to initialize here in this
// case.
if (!defs) {
defs.reset(new OptionDefContainer());
} else {
defs->clear();
}
for (size_t i = 0; i < params_size; ++i) {
string encapsulates(params[i].encapsulates);
if (!encapsulates.empty() && params[i].array) {
isc_throw(isc::BadValue, "invalid standard option definition: "
<< "option with code '" << params[i].code
<< "' may not encapsulate option space '"
<< encapsulates << "' because the definition"
<< " indicates that this option comprises an array"
<< " of values");
}
// Depending whether an option encapsulates an option space or not
// we pick different constructor to create an instance of the option
// definition.
OptionDefinitionPtr definition;
if (encapsulates.empty()) {
// Option does not encapsulate any option space.
definition.reset(new OptionDefinition(params[i].name,
params[i].code,
params[i].space,
params[i].type,
params[i].array));
} else {
// Option does encapsulate an option space.
definition.reset(new OptionDefinition(params[i].name,
params[i].code,
params[i].space,
params[i].type,
params[i].encapsulates));
}
for (size_t rec = 0; rec < params[i].records_size; ++rec) {
definition->addRecordField(params[i].records[rec]);
}
try {
definition->validate();
} catch (const isc::Exception&) {
// This is unlikely event that validation fails and may
// be only caused by programming error. To guarantee the
// data consistency we clear all option definitions that
// have been added so far and pass the exception forward.
defs->clear();
throw;
}
// option_defs is a multi-index container with no unique indexes
// so push_back can't fail).
static_cast<void>(defs->push_back(definition));
}
}
const OptionDefinition&
LibDHCP::DHO_DHCP_REQUESTED_ADDRESS_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP4_OPTION_SPACE, DHO_DHCP_REQUESTED_ADDRESS);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "dhcp-requested-address");
isc_throw_assert(def->getCode() == DHO_DHCP_REQUESTED_ADDRESS);
isc_throw_assert(def->getType() == OPT_IPV4_ADDRESS_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP4_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::DHO_DHCP_SERVER_IDENTIFIER_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP4_OPTION_SPACE, DHO_DHCP_SERVER_IDENTIFIER);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "dhcp-server-identifier");
isc_throw_assert(def->getCode() == DHO_DHCP_SERVER_IDENTIFIER);
isc_throw_assert(def->getType() == OPT_IPV4_ADDRESS_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP4_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::DHO_DHCP_AGENT_OPTIONS_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP4_OPTION_SPACE, DHO_DHCP_AGENT_OPTIONS);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "dhcp-agent-options");
isc_throw_assert(def->getCode() == DHO_DHCP_AGENT_OPTIONS);
isc_throw_assert(def->getType() == OPT_EMPTY_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace() == DHCP_AGENT_OPTION_SPACE);
isc_throw_assert(def->getOptionSpaceName() == DHCP4_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::DHO_SUBNET_SELECTION_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP4_OPTION_SPACE, DHO_SUBNET_SELECTION);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "subnet-selection");
isc_throw_assert(def->getCode() == DHO_SUBNET_SELECTION);
isc_throw_assert(def->getType() == OPT_IPV4_ADDRESS_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP4_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::DHO_DOMAIN_SEARCH_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP4_OPTION_SPACE, DHO_DOMAIN_SEARCH);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "domain-search");
isc_throw_assert(def->getCode() == DHO_DOMAIN_SEARCH);
isc_throw_assert(def->getType() == OPT_FQDN_TYPE);
isc_throw_assert(def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP4_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::DHO_STATUS_CODE_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP4_OPTION_SPACE, DHO_STATUS_CODE);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "status-code");
isc_throw_assert(def->getCode() == DHO_STATUS_CODE);
isc_throw_assert(def->getType() == OPT_RECORD_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP4_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_CLIENT_FQDN_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_CLIENT_FQDN);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "client-fqdn");
isc_throw_assert(def->getCode() == D6O_CLIENT_FQDN);
isc_throw_assert(def->getType() == OPT_RECORD_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_LQ_QUERY_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_LQ_QUERY);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "lq-query");
isc_throw_assert(def->getCode() == D6O_LQ_QUERY);
isc_throw_assert(def->getType() == OPT_RECORD_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace() == DHCP6_OPTION_SPACE);
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_CLIENT_DATA_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_CLIENT_DATA);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "client-data");
isc_throw_assert(def->getCode() == D6O_CLIENT_DATA);
isc_throw_assert(def->getType() == OPT_EMPTY_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace() == DHCP6_OPTION_SPACE);
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_LQ_RELAY_DATA_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_LQ_RELAY_DATA);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "lq-relay-data");
isc_throw_assert(def->getCode() == D6O_LQ_RELAY_DATA);
isc_throw_assert(def->getType() == OPT_RECORD_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_NTP_SERVER_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_NTP_SERVER);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "ntp-server");
isc_throw_assert(def->getCode() == D6O_NTP_SERVER);
isc_throw_assert(def->getType() == OPT_EMPTY_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace() == V6_NTP_SERVER_SPACE);
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_BOOTFILE_URL_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_BOOTFILE_URL);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "bootfile-url");
isc_throw_assert(def->getCode() == D6O_BOOTFILE_URL);
isc_throw_assert(def->getType() == OPT_STRING_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace().empty());
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
const OptionDefinition&
LibDHCP::D6O_RSOO_DEF() {
static OptionDefinitionPtr def =
LibDHCP::getOptionDef(DHCP6_OPTION_SPACE, D6O_RSOO);
static bool check_once(true);
if (check_once) {
isc_throw_assert(def);
isc_throw_assert(def->getName() == "rsoo");
isc_throw_assert(def->getCode() == D6O_RSOO);
isc_throw_assert(def->getType() == OPT_EMPTY_TYPE);
isc_throw_assert(!def->getArrayType());
isc_throw_assert(def->getEncapsulatedSpace() == "rsoo-opts");
isc_throw_assert(def->getOptionSpaceName() == DHCP6_OPTION_SPACE);
check_once = false;
}
return (*def);
}
|