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 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713
|
// OpenVPN -- An application to securely tunnel IP networks
// over a single port, with support for SSL/TLS-based
// session authentication and key exchange,
// packet encryption, packet authentication, and
// packet compression.
//
// Copyright (C) 2012-2022 OpenVPN Inc.
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License Version 3
// as published by the Free Software Foundation.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program in the COPYING file.
// If not, see <http://www.gnu.org/licenses/>.
// General-purpose options parser, used to parse the OpenVPN configuration
// file as well as the server-pushed options list. Note that these classes
// don't get into the interpretation or typing of options -- they only care
// about parsing the options into lists of strings, and then presenting the
// complete configuration file as a list of options.
//
// The parser understands the general grammar of OpenVPN configuration
// files including:
//
// 1. option/argument parsing, quoting, escaping, and comments,
// 2. inline directives such as
// <ca>
// ...
// </ca>
// 3. and meta-directives such as those used by OpenVPN Access Server such as:
// # OVPN_ACCESS_SERVER_USERNAME=test
//
// The basic organization of the parser is as follows:
//
// Option -- a list of strings, where the first string is the
// option/directive name, and subsequent strings are arguments.
//
// OptionList -- a list of Options that also contains a map for
// optimal lookup of specific options
#ifndef OPENVPN_COMMON_OPTIONS_H
#define OPENVPN_COMMON_OPTIONS_H
#include <string>
#include <sstream>
#include <vector>
#include <algorithm> // for std::sort, std::min
#include <utility> // for std::move
#include <type_traits> // for std::is_nothrow_move_constructible
#include <unordered_map>
#include <cstdint> // for std::uint64_t
#include <openvpn/common/rc.hpp>
#include <openvpn/common/size.hpp>
#include <openvpn/common/number.hpp>
#include <openvpn/common/hexstr.hpp>
#include <openvpn/common/string.hpp>
#include <openvpn/common/split.hpp>
#include <openvpn/common/splitlines.hpp>
#include <openvpn/common/unicode.hpp>
#include <openvpn/common/option_error.hpp>
namespace openvpn {
class Option
{
public:
OPENVPN_UNTAGGED_EXCEPTION(RejectedException);
enum
{
MULTILINE = 0x8000000,
};
// Validate string by size and multiline status.
// OR max_len with MULTILINE to allow multiline string.
// Return values:
enum validate_status
{
STATUS_GOOD,
STATUS_MULTILINE,
STATUS_LENGTH,
};
// Options for render methods
enum render_flags
{
RENDER_TRUNC_64 = (1 << 0), // truncate option after 64 chars
RENDER_PASS_FMT = (1 << 1), // pass \r\n\t
RENDER_NUMBER = (1 << 2), // number lines
RENDER_BRACKET = (1 << 3), // quote options using []
RENDER_UNUSED = (1 << 4), // only show unused options
};
Option()
{
static_assert(std::is_nothrow_move_constructible<Option>::value, "class Option not noexcept move constructable");
}
template <typename T, typename... Args>
explicit Option(T first, Args... args)
{
reserve(1 + sizeof...(args));
from_list(std::move(first), std::forward<Args>(args)...);
}
static validate_status validate(const std::string &str, const size_t max_len)
{
const size_t pos = str.find_first_of("\r\n");
const size_t len = max_len & ((size_t)MULTILINE - 1); // NOTE -- use smallest flag value here
if (pos != std::string::npos && !(max_len & MULTILINE))
return STATUS_MULTILINE;
else if (len > 0 && Unicode::utf8_length(str) > len)
return STATUS_LENGTH;
else
return STATUS_GOOD;
}
static const char *validate_status_description(const validate_status status)
{
switch (status)
{
case STATUS_GOOD:
return "good";
case STATUS_MULTILINE:
return "multiline";
case STATUS_LENGTH:
return "too long";
default:
return "unknown";
}
}
void min_args(const size_t n) const
{
const size_t s = data.size();
if (s < n)
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, err_ref() << " must have at least " << (n - 1) << " arguments");
}
void exact_args(const size_t n) const
{
const size_t s = data.size();
if (s != n)
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, err_ref() << " must have exactly " << n << " arguments");
}
void validate_arg(const size_t index, const size_t max_len) const
{
if (max_len > 0 && index < data.size())
{
const validate_status status = validate(data[index], max_len);
if (status != STATUS_GOOD)
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, err_ref() << " is " << validate_status_description(status));
}
}
bool is_multiline() const
{
if (data.size() == 2)
{
const std::string &str = data[1];
const size_t pos = str.find_first_of("\r\n");
return pos != std::string::npos;
}
else
return false;
}
static void validate_string(const std::string &name, const std::string &str, const size_t max_len)
{
const validate_status status = validate(str, max_len);
if (status != STATUS_GOOD)
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, name << " is " << validate_status_description(status));
}
std::string printable_directive() const
{
try
{
if (data.size() > 0)
return Unicode::utf8_printable(data[0], 32);
else
return "";
}
catch (const std::exception &)
{
return "[DIRECTIVE]";
}
}
const std::string &get(const size_t index, const size_t max_len) const
{
min_args(index + 1);
validate_arg(index, max_len);
return data[index];
}
std::string get_optional(const size_t index, const size_t max_len) const
{
validate_arg(index, max_len);
if (index < data.size())
return data[index];
else
return "";
}
std::string get_default(const size_t index, const size_t max_len, const std::string &default_value) const
{
validate_arg(index, max_len);
if (index < data.size())
return data[index];
else
return default_value;
}
const std::string *get_ptr(const size_t index, const size_t max_len) const
{
validate_arg(index, max_len);
if (index < data.size())
return &data[index];
else
return nullptr;
}
template <typename T>
T get_num(const size_t idx) const
{
typedef typename std::remove_const<T>::type T_nonconst;
T_nonconst n(0); // we shouldn't need to initialize here, but some compilers complain "may be used uninitialized in this function"
const std::string &numstr = get(idx, 64);
if (numstr.length() >= 2 && numstr[0] == '0' && numstr[1] == 'x')
{
if (!parse_hex_number(numstr.substr(2), n))
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, err_ref() << '[' << idx << "] expecting a hex number");
}
else if (!parse_number<T_nonconst>(numstr, n))
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, err_ref() << '[' << idx << "] must be a number");
return n;
}
template <typename T>
T get_num(const size_t idx, const T default_value) const
{
if (size() > idx)
return get_num<T>(idx);
else
return default_value;
}
template <typename T>
T get_num(const size_t idx, const T default_value, const T min_value, const T max_value) const
{
const T ret = get_num<T>(idx, default_value);
if (ret != default_value && (ret < min_value || ret > max_value))
range_error(idx, min_value, max_value);
return ret;
}
template <typename T>
T get_num(const size_t idx, const T min_value, const T max_value) const
{
const T ret = get_num<T>(idx);
if (ret < min_value || ret > max_value)
range_error(idx, min_value, max_value);
return ret;
}
std::string render(const unsigned int flags) const
{
std::ostringstream out;
size_t max_len_flags = (flags & RENDER_TRUNC_64) ? 64 : 0;
if (flags & RENDER_PASS_FMT)
max_len_flags |= Unicode::UTF8_PASS_FMT;
bool first = true;
for (std::vector<std::string>::const_iterator i = data.begin(); i != data.end(); ++i)
{
if (!first)
out << ' ';
if (flags & RENDER_BRACKET)
out << '[';
out << Unicode::utf8_printable(*i, max_len_flags);
if (flags & RENDER_BRACKET)
out << ']';
first = false;
}
return out.str();
}
static void escape_string(std::ostream &out, const std::string &term, const bool must_quote)
{
if (must_quote)
out << '\"';
for (std::string::const_iterator j = term.begin(); j != term.end(); ++j)
{
const char c = *j;
if (c == '\"' || c == '\\')
out << '\\';
out << c;
}
if (must_quote)
out << '\"';
}
// Render the option args into a string format such that it could be parsed back to
// the equivalent option args.
std::string escape(const bool csv) const
{
std::ostringstream out;
bool more = false;
for (std::vector<std::string>::const_iterator i = data.begin(); i != data.end(); ++i)
{
const std::string &term = *i;
const bool must_quote = must_quote_string(term, csv);
if (more)
out << ' ';
escape_string(out, term, must_quote);
more = true;
}
return out.str();
}
void clear()
{
data.clear();
touched_ = touchedState::NOT_TOUCHED;
warn_only_if_unknown_ = false;
meta_ = false;
}
// delegate to data
size_t size() const
{
return data.size();
}
bool empty() const
{
return data.empty();
}
void push_back(const std::string &item)
{
data.push_back(item);
}
void push_back(std::string &&item)
{
data.push_back(std::move(item));
}
void reserve(const size_t n)
{
data.reserve(n);
}
void resize(const size_t n)
{
data.resize(n);
}
// raw references to data
const std::string &ref(const size_t i) const
{
return data[i];
}
std::string &ref(const size_t i)
{
return data[i];
}
// equality
bool operator==(const Option &other) const
{
return data == other.data;
}
bool operator!=(const Option &other) const
{
return data != other.data;
}
// remove first n elements
void remove_first(const size_t n_elements)
{
const size_t n = std::min(data.size(), n_elements);
if (n)
data.erase(data.begin(), data.begin() + n);
}
/**
* indicate that this option was processed
*
* @param lightly an option of the same name has been used
*/
void touch(bool lightly = false) const
{
// Note that we violate constness here, which is done
// because the touched bit is considered to be option metadata.
if (lightly)
{
if (touched_ != touchedState::TOUCHED)
touched_ = touchedState::OPTION_OF_SAME_NAME_TOUCHED;
}
else
{
touched_ = touchedState::TOUCHED;
}
}
void enableWarnOnly()
{
warn_only_if_unknown_ = true;
}
bool warnonlyunknown() const
{
return warn_only_if_unknown_;
}
// was this option processed?
bool touched() const
{
return touched_ == touchedState::TOUCHED;
}
// was an option of the same name (or this option see \c touched)
// touched
bool touched_lightly() const
{
return touched_ == touchedState::OPTION_OF_SAME_NAME_TOUCHED;
}
// refer to the option when constructing an error message
std::string err_ref() const
{
std::string ret = "option";
if (data.size())
{
ret += " '";
ret += printable_directive();
ret += '\'';
}
return ret;
}
/**
* Marks this option as parsed from a meta options like
* # OVPN_ACCESS_SERVER_USERNAME=username
*/
void set_meta(bool value = true)
{
meta_ = value;
}
/**
* This option has been parsed from a meta options like
* # OVPN_ACCESS_SERVER_USERNAME=username
* @return
*/
bool meta() const
{
return meta_;
}
private:
void from_list(std::string arg)
{
push_back(std::move(arg));
}
void from_list(const char *arg)
{
push_back(std::string(arg));
}
void from_list(std::vector<std::string> arg)
{
data.insert(data.end(), arg.begin(), arg.end());
}
template <typename T, typename... Args>
void from_list(T first, Args... args)
{
from_list(std::move(first));
from_list(std::forward<Args>(args)...);
}
template <typename T>
void range_error(const size_t idx, const T min_value, const T max_value) const
{
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, err_ref() << '[' << idx << "] must be in the range [" << min_value << ',' << max_value << ']');
}
bool must_quote_string(const std::string &str, const bool csv) const
{
for (const auto c : str)
{
if (string::is_space(c))
return true;
if (csv && c == ',')
return true;
}
return false;
}
/** Indicates that this option was used/consumed */
enum class touchedState
{
/* Option was never used */
NOT_TOUCHED,
/** Indicates that another option with the same name
* was considered. Ie, the option was not used because
* another option with same overrode it */
OPTION_OF_SAME_NAME_TOUCHED,
/** Option has be used */
TOUCHED
};
volatile mutable touchedState touched_ = touchedState::NOT_TOUCHED;
bool warn_only_if_unknown_ = false;
bool meta_ = false;
std::vector<std::string> data;
};
class OptionList : public std::vector<Option>, public RCCopyable<thread_unsafe_refcount>
{
public:
typedef RCPtr<OptionList> Ptr;
typedef std::vector<unsigned int> IndexList;
typedef std::unordered_map<std::string, IndexList> IndexMap;
typedef std::pair<std::string, IndexList> IndexPair;
static bool is_comment(const char c)
{
return c == '#' || c == ';';
}
// standard lex filter that doesn't understand end-of-line comments
typedef StandardLex Lex;
// special lex filter that recognizes end-of-line comments
class LexComment : public LexQuoteMixin
{
public:
LexComment() = default;
void put(char c)
{
if (in_comment)
{
ch = -1;
}
else if (backslash)
{
ch = c;
backslash = false;
}
else if (c == '\\')
{
backslash = true;
ch = -1;
}
else if (handle_quote(c))
{
ch = -1;
}
else if (is_comment(c) && !in_quote())
{
in_comment = true;
ch = -1;
}
else
{
ch = c;
}
}
bool available() const
{
return ch != -1;
}
int get() const
{
return ch;
}
void reset()
{
ch = -1;
}
private:
bool in_comment = false;
bool backslash = false;
int ch = -1;
};
class Limits
{
public:
Limits(const std::string &error_message,
const std::uint64_t max_bytes_arg,
const size_t extra_bytes_per_opt_arg,
const size_t extra_bytes_per_term_arg,
const size_t max_line_len_arg,
const size_t max_directive_len_arg)
: bytes(0),
max_bytes(max_bytes_arg),
extra_bytes_per_opt(extra_bytes_per_opt_arg),
extra_bytes_per_term(extra_bytes_per_term_arg),
max_line_len(max_line_len_arg),
max_directive_len(max_directive_len_arg),
err(error_message)
{
}
void add_bytes(const size_t n)
{
bytes += n;
check_overflow();
}
void add_string(const std::string &str)
{
bytes += str.length();
check_overflow();
}
void add_term()
{
bytes += extra_bytes_per_term;
check_overflow();
}
void add_opt()
{
bytes += extra_bytes_per_opt;
check_overflow();
}
size_t get_max_line_len() const
{
return max_line_len;
}
std::uint64_t get_bytes() const
{
return bytes;
}
void validate_directive(const Option &opt)
{
opt.validate_arg(0, max_directive_len);
}
private:
void check_overflow()
{
if (bytes >= max_bytes)
error();
}
void error()
{
throw option_error(ERR_INVALID_CONFIG, err);
}
std::uint64_t bytes;
const std::uint64_t max_bytes;
const size_t extra_bytes_per_opt;
const size_t extra_bytes_per_term;
const size_t max_line_len;
const size_t max_directive_len;
const std::string err;
};
// Used by extend() to optionally control which options are copied.
struct FilterBase : public RC<thread_unsafe_refcount>
{
typedef RCPtr<FilterBase> Ptr;
virtual bool filter(const Option &opt) = 0;
};
class KeyValue : public RC<thread_unsafe_refcount>
{
public:
typedef RCPtr<KeyValue> Ptr;
KeyValue()
: key_priority(0)
{
}
KeyValue(const std::string &key_arg, const std::string &value_arg, const int key_priority_arg = 0)
: key(key_arg), value(value_arg), key_priority(key_priority_arg)
{
}
size_t combined_length() const
{
return key.length() + value.length();
}
Option convert_to_option(Limits *lim, const std::string &meta_prefix) const
{
bool newline_present = false;
Option opt;
const std::string unesc_value = unescape(value, newline_present);
if (string::starts_with(key, meta_prefix))
{
opt.push_back(std::string(key, meta_prefix.length()));
opt.set_meta();
}
else
{
opt.push_back(key);
}
if (newline_present || singular_arg(key))
opt.push_back(unesc_value);
else if (unesc_value != "NOARGS")
Split::by_space_void<Option, Lex, SpaceMatch, Limits>(opt, unesc_value, lim);
return opt;
}
void split_priority()
{
// look for usage such as: remote.7
const size_t dp = key.find_last_of(".");
if (dp != std::string::npos)
{
const size_t tp = dp + 1;
if (tp < key.length())
{
const char *tail = key.c_str() + tp;
try
{
key_priority = parse_number_throw<int>(tail, "option priority");
key = key.substr(0, dp);
}
catch (const number_parse_exception &)
{
;
}
}
}
}
static bool compare(const Ptr &a, const Ptr &b)
{
const int cmp = a->key.compare(b->key);
if (cmp < 0)
return true;
else if (cmp > 0)
return false;
else
return a->key_priority < b->key_priority;
}
std::string key;
std::string value;
int key_priority;
private:
static std::string unescape(const std::string &value, bool &newline_present)
{
std::string ret;
ret.reserve(value.length());
bool bs = false;
for (size_t i = 0; i < value.length(); ++i)
{
const char c = value[i];
if (bs)
{
if (c == 'n')
{
ret += '\n';
newline_present = true;
}
else if (c == '\\')
ret += '\\';
else
{
ret += '\\';
ret += c;
}
bs = false;
}
else
{
if (c == '\\')
bs = true;
else
ret += c;
}
}
if (bs)
ret += '\\';
return ret;
}
static bool singular_arg(const std::string &key)
{
bool upper = false;
bool lower = false;
for (size_t i = 0; i < key.length(); ++i)
{
const char c = key[i];
if (c >= 'a' && c <= 'z')
lower = true;
else if (c >= 'A' && c <= 'Z')
upper = true;
}
return upper && !lower;
}
};
struct KeyValueList : public std::vector<KeyValue::Ptr>
{
void preprocess()
{
split_priority();
sort();
}
void split_priority()
{
for (iterator i = begin(); i != end(); ++i)
{
KeyValue &kv = **i;
kv.split_priority();
}
}
void sort()
{
std::sort(begin(), end(), KeyValue::compare);
}
};
OptionList()
{
}
template <typename T, typename... Args>
explicit OptionList(T first, Args... args)
{
reserve(1 + sizeof...(args));
from_list(std::move(first), std::forward<Args>(args)...);
update_map();
}
static OptionList parse_from_csv_static(const std::string &str, Limits *lim)
{
OptionList ret;
ret.parse_from_csv(str, lim);
ret.update_map();
return ret;
}
static OptionList parse_from_csv_static_nomap(const std::string &str, Limits *lim)
{
OptionList ret;
ret.parse_from_csv(str, lim);
return ret;
}
static OptionList parse_from_config_static(const std::string &str, Limits *lim)
{
OptionList ret;
ret.parse_from_config(str, lim);
ret.update_map();
return ret;
}
static OptionList::Ptr parse_from_config_static_ptr(const std::string &str, Limits *lim)
{
OptionList::Ptr ret = new OptionList();
ret->parse_from_config(str, lim);
ret->update_map();
return ret;
}
static OptionList parse_from_argv_static(const std::vector<std::string> &argv)
{
OptionList ret;
ret.parse_from_argv(argv);
ret.update_map();
return ret;
}
void clear()
{
std::vector<Option>::clear();
map_.clear();
}
// caller should call update_map() after this function
void parse_from_csv(const std::string &str, Limits *lim)
{
if (lim)
lim->add_string(str);
std::vector<std::string> list = Split::by_char<std::vector<std::string>, Lex, Limits>(str, ',', 0, ~0, lim);
for (std::vector<std::string>::const_iterator i = list.begin(); i != list.end(); ++i)
{
const Option opt = Split::by_space<Option, Lex, SpaceMatch, Limits>(*i, lim);
if (opt.size())
{
if (lim)
{
lim->add_opt();
lim->validate_directive(opt);
}
push_back(std::move(opt));
}
}
}
// caller should call update_map() after this function
void parse_from_argv(const std::vector<std::string> &argv)
{
Option opt;
for (auto &arg : argv)
{
std::string a = arg;
if (string::starts_with(a, "--"))
{
if (!opt.empty())
{
push_back(std::move(opt));
opt.clear();
}
a = a.substr(2);
}
if (!a.empty())
opt.push_back(a);
}
if (!opt.empty())
push_back(std::move(opt));
}
// caller should call update_map() after this function
void parse_from_peer_info(const std::string &str, Limits *lim)
{
if (lim)
lim->add_string(str);
SplitLines in(str, 0);
while (in(true))
{
const std::string &line = in.line_ref();
Option opt;
opt.reserve(2);
Split::by_char_void<Option, NullLex, Limits>(opt, line, '=', 0, 1, lim);
if (opt.size())
{
if (lim)
{
lim->add_opt();
lim->validate_directive(opt);
}
push_back(std::move(opt));
}
}
}
// caller may want to call list.preprocess() before this function
// caller should call update_map() after this function
void parse_from_key_value_list(const KeyValueList &list, const std::string &meta_tag, Limits *lim)
{
const std::string meta_prefix = meta_tag + "_";
for (KeyValueList::const_iterator i = list.begin(); i != list.end(); ++i)
{
const KeyValue &kv = **i;
if (lim)
lim->add_bytes(kv.combined_length());
Option opt = kv.convert_to_option(lim, meta_prefix);
if (lim)
{
lim->add_opt();
lim->validate_directive(opt);
}
push_back(std::move(opt));
}
}
static Option parse_option_from_line(const std::string &line, Limits *lim)
{
return Split::by_space<Option, LexComment, SpaceMatch, Limits>(line, lim);
}
// caller should call update_map() after this function
void parse_from_config(const std::string &str, Limits *lim)
{
if (lim)
lim->add_string(str);
SplitLines in(str, lim ? lim->get_max_line_len() : 0);
int line_num = 0;
bool in_multiline = false;
Option multiline;
while (in(true))
{
++line_num;
if (in.line_overflow())
line_too_long(line_num);
const std::string &line = in.line_ref();
if (in_multiline)
{
if (is_close_tag(line, multiline.ref(0)))
{
if (lim)
{
lim->add_opt();
lim->validate_directive(multiline);
}
multiline.set_meta(true);
push_back(std::move(multiline));
multiline.clear();
in_multiline = false;
}
else
{
std::string &mref = multiline.ref(1);
mref += line;
mref += '\n';
}
}
else if (!ignore_line(line))
{
Option opt = parse_option_from_line(line, lim);
if (opt.size())
{
if (is_open_tag(opt.ref(0)))
{
if (opt.size() > 1)
extraneous_err(line_num, "option", opt);
untag_open_tag(opt.ref(0));
opt.push_back("");
multiline = std::move(opt);
in_multiline = true;
}
else
{
if (lim)
{
lim->add_opt();
lim->validate_directive(opt);
}
push_back(std::move(opt));
}
}
}
}
if (in_multiline)
not_closed_out_err("option", multiline);
}
// caller should call update_map() after this function
void parse_meta_from_config(const std::string &str, const std::string &tag, Limits *lim)
{
SplitLines in(str, lim ? lim->get_max_line_len() : 0);
int line_num = 0;
bool in_multiline = false;
Option multiline;
const std::string prefix = tag + "_";
while (in(true))
{
++line_num;
if (in.line_overflow())
line_too_long(line_num);
std::string &line = in.line_ref();
if (string::starts_with(line, "# "))
{
line = std::string(line, 2);
if (in_multiline)
{
if (is_close_meta_tag(line, prefix, multiline.ref(0)))
{
if (lim)
{
lim->add_opt();
lim->validate_directive(multiline);
}
multiline.set_meta(true);
push_back(std::move(multiline));
multiline.clear();
in_multiline = false;
}
else
{
std::string &mref = multiline.ref(1);
mref += line;
mref += '\n';
}
}
else if (string::starts_with(line, prefix))
{
Option opt = Split::by_char<Option, NullLex, Limits>(std::string(line, prefix.length()), '=', 0, 1, lim);
if (opt.size())
{
if (is_open_meta_tag(opt.ref(0)))
{
if (opt.size() > 1)
extraneous_err(line_num, "meta option", opt);
untag_open_meta_tag(opt.ref(0));
opt.push_back("");
multiline = std::move(opt);
in_multiline = true;
}
else
{
if (lim)
{
lim->add_opt();
lim->validate_directive(opt);
}
opt.set_meta(true);
push_back(std::move(opt));
}
}
}
}
}
if (in_multiline)
not_closed_out_err("meta option", multiline);
}
// Append elements in other to self,
// caller should call update_map() after this function.
void extend(const OptionList &other, FilterBase *filt = nullptr)
{
reserve(size() + other.size());
for (const auto &opt : other)
{
if (!filt || filt->filter(opt))
{
push_back(opt);
opt.touch();
}
}
}
// Append elements in other to self,
// consumes other,
// caller should call update_map() after this function.
void extend(OptionList &&other, FilterBase *filt = nullptr)
{
reserve(size() + other.size());
for (auto &opt : other)
{
if (!filt || filt->filter(opt))
push_back(std::move(opt));
}
}
// Append elements in other having given name to self,
// caller should call update_map() after this function.
// Return the number of elements processed.
unsigned int extend(const OptionList &other, const std::string &name)
{
IndexMap::const_iterator oi = other.map().find(name);
unsigned int count = 0;
if (oi != other.map().end())
for (IndexList::const_iterator i = oi->second.begin(); i != oi->second.end(); ++i)
{
const Option &opt = other[*i];
push_back(opt);
opt.touch();
++count;
}
return count;
}
// Append to self only those elements in other that do not exist
// in self, caller should call update_map() after this function.
// Caller should also consider calling update_map() before this function,
// to ensure that lookups on this->map will see up-to-date data.
void extend_nonexistent(const OptionList &other)
{
for (std::vector<Option>::const_iterator i = other.begin(); i != other.end(); ++i)
{
const Option &opt = *i;
if (!opt.empty() && map().find(opt.ref(0)) == map().end())
{
push_back(opt);
opt.touch();
}
}
}
// Get the last instance of an option, or return nullptr if option
// doesn't exist.
const Option *get_ptr(const std::string &name) const
{
IndexMap::const_iterator e = map_.find(name);
if (e != map_.end())
{
const size_t size = e->second.size();
if (size)
{
for (const auto &optidx : e->second)
{
(*this)[optidx].touch(true);
}
const Option *ret = &((*this)[e->second[size - 1]]);
ret->touch();
return ret;
}
}
return nullptr;
}
// Get an option, return nullptr if option doesn't exist, or
// throw an error if more than one instance exists.
const Option *get_unique_ptr(const std::string &name) const
{
IndexMap::const_iterator e = map_.find(name);
if (e != map_.end() && !e->second.empty())
{
if (e->second.size() == 1)
{
const Option *ret = &((*this)[e->second[0]]);
ret->touch();
return ret;
}
else
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_CONFIG, "more than one instance of option '" << name << '\'');
}
else
return nullptr;
}
// Get an option, throw an error if more than one instance exists and the instances
// are not exact duplicates of one other.
const Option *get_consistent(const std::string &name) const
{
IndexMap::const_iterator e = map_.find(name);
if (e != map_.end() && !e->second.empty())
{
const Option *first = &((*this)[e->second[0]]);
first->touch();
if (e->second.size() >= 2)
{
for (size_t i = 1; i < e->second.size(); ++i)
{
const Option *other = &(*this)[e->second[i]];
other->touch();
if (*other != *first)
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, "more than one instance of option '" << name << "' with inconsistent argument(s)");
}
}
return first;
}
else
return nullptr;
}
// Get option, throw error if not found
// If multiple options of the same name exist, return
// the last one.
const Option &get(const std::string &name) const
{
const Option *o = get_ptr(name);
if (o)
return *o;
else
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_CONFIG, "option '" << name << "' not found");
}
// Get the list of options having the same name (by index),
// throw an exception if option is not found.
const IndexList &get_index(const std::string &name) const
{
IndexMap::const_iterator e = map_.find(name);
if (e != map_.end() && !e->second.empty())
return e->second;
else
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_CONFIG, "option '" << name << "' not found");
}
// Get the list of options having the same name (by index),
// return nullptr is option is not found.
const IndexList *get_index_ptr(const std::string &name) const
{
IndexMap::const_iterator e = map_.find(name);
if (e != map_.end() && !e->second.empty())
return &e->second;
else
return nullptr;
}
// Concatenate all one-arg directives of a given name, in index order.
std::string cat(const std::string &name) const
{
std::string ret;
const OptionList::IndexList *il = get_index_ptr(name);
if (il)
{
size_t size = 0;
OptionList::IndexList::const_iterator i;
for (i = il->begin(); i != il->end(); ++i)
{
const Option &o = (*this)[*i];
if (o.size() == 2)
size += o.ref(1).length() + 1;
else
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, "option '" << name << "' (" << o.size() << ") must have exactly one parameter");
}
ret.reserve(size);
for (i = il->begin(); i != il->end(); ++i)
{
const Option &o = (*this)[*i];
if (o.size() >= 2)
{
o.touch();
ret += o.ref(1);
string::add_trailing(ret, '\n');
}
}
}
return ret;
}
// Return true if option exists, but raise an exception if multiple
// instances of the option exist.
bool exists_unique(const std::string &name) const
{
return get_unique_ptr(name) != nullptr;
}
// Return true if one or more instances of a given option exist.
bool exists(const std::string &name) const
{
return get_ptr(name) != nullptr;
}
// Convenience method that gets a particular argument index within an option,
// while raising an exception if option doesn't exist or if argument index
// is out-of-bounds.
const std::string &get(const std::string &name, size_t index, const size_t max_len) const
{
const Option &o = get(name);
return o.get(index, max_len);
}
// Convenience method that gets a particular argument index within an option,
// while returning the empty string if option doesn't exist, and raising an
// exception if argument index is out-of-bounds.
std::string get_optional(const std::string &name, size_t index, const size_t max_len) const
{
const Option *o = get_ptr(name);
if (o)
return o->get(index, max_len);
else
return "";
}
// Like get_optional(), but return "" if argument index is out-of-bounds.
std::string get_optional_relaxed(const std::string &name, size_t index, const size_t max_len) const
{
const Option *o = get_ptr(name);
if (o)
return o->get_optional(index, max_len);
else
return "";
}
// Like get_optional(), but return "" if exception is thrown.
std::string get_optional_noexcept(const std::string &name, size_t index, const size_t max_len) const
{
try
{
return get_optional(name, index, max_len);
}
catch (const std::exception &)
{
return "";
}
}
// Return raw C string to option data or nullptr if option doesn't exist.
const char *get_c_str(const std::string &name, size_t index, const size_t max_len) const
{
const Option *o = get_ptr(name);
if (o)
return o->get(index, max_len).c_str();
else
return nullptr;
}
// Convenience method that gets a particular argument index within an option,
// while returning a default string if option doesn't exist, and raising an
// exception if argument index is out-of-bounds.
std::string get_default(const std::string &name,
size_t index,
const size_t max_len,
const std::string &default_value) const
{
const Option *o = get_ptr(name);
if (o)
return o->get(index, max_len);
else
return default_value;
}
// Like get_default(), but return default_value if argument index is out-of-bounds.
std::string get_default_relaxed(const std::string &name,
size_t index,
const size_t max_len,
const std::string &default_value) const
{
const Option *o = get_ptr(name);
if (o)
{
const std::string *s = o->get_ptr(index, max_len);
if (s)
return *s;
}
return default_value;
}
template <typename T>
T get_num(const std::string &name, const size_t idx, const T default_value) const
{
typedef typename std::remove_const<T>::type T_nonconst;
T_nonconst n = default_value;
const Option *o = get_ptr(name);
if (o)
n = o->get_num<T>(idx, default_value);
return n;
}
template <typename T>
T get_num(const std::string &name,
const size_t idx,
const T default_value,
const T min_value,
const T max_value) const
{
typedef typename std::remove_const<T>::type T_nonconst;
T_nonconst n = default_value;
const Option *o = get_ptr(name);
if (o)
n = o->get_num<T>(idx, default_value, min_value, max_value);
return n;
}
template <typename T>
T get_num(const std::string &name, const size_t idx, const T min_value, const T max_value) const
{
const Option &o = get(name);
return o.get_num<T>(idx, min_value, max_value);
}
template <typename T>
T get_num(const std::string &name, const size_t idx) const
{
const Option &o = get(name);
return o.get_num<T>(idx);
}
// Touch an option, if it exists.
void touch(const std::string &name) const
{
const Option *o = get_ptr(name);
if (o)
o->touch();
}
// Render object as a string.
// flags should be given as Option::render_flags.
std::string render(const unsigned int flags) const
{
std::ostringstream out;
for (size_t i = 0; i < size(); ++i)
{
const Option &o = (*this)[i];
if (!(flags & Option::RENDER_UNUSED) || !o.touched())
{
if (flags & Option::RENDER_NUMBER)
out << i << ' ';
out << o.render(flags) << std::endl;
}
}
return out.str();
}
std::string render_csv() const
{
std::string ret;
bool first = true;
for (auto &e : *this)
{
if (!first)
ret += ',';
ret += e.escape(true);
first = false;
}
return ret;
}
// Render contents of hash map used to locate options after underlying option list
// has been modified.
std::string render_map() const
{
std::ostringstream out;
for (IndexMap::const_iterator i = map_.begin(); i != map_.end(); ++i)
{
out << i->first << " [";
for (IndexList::const_iterator j = i->second.begin(); j != i->second.end(); ++j)
out << ' ' << *j;
out << " ]" << std::endl;
}
return out.str();
}
// Return number of unused options based on the notion that
// all used options have been touched.
size_t n_unused(bool ignore_meta = false) const
{
size_t n = 0;
for (std::vector<Option>::const_iterator i = begin(); i != end(); ++i)
{
const Option &opt = *i;
if (!opt.touched() && !(opt.meta() && ignore_meta))
++n;
}
return n;
}
// Return number of unused meta options based on the notion that
// all used options have been touched.
size_t meta_unused() const
{
size_t n = 0;
for (std::vector<Option>::const_iterator i = begin(); i != end(); ++i)
{
const Option &opt = *i;
if (opt.meta() && !opt.touched())
++n;
}
return n;
}
void show_unused_options(const char *title = nullptr) const
{
// show unused options
if (n_unused())
{
if (!title)
title = "NOTE: Unused Options";
OPENVPN_LOG_NTNL(title << std::endl
<< render(Option::RENDER_TRUNC_64 | Option::RENDER_NUMBER | Option::RENDER_BRACKET | Option::RENDER_UNUSED));
}
}
// Add item to underlying option list while updating map as well.
void add_item(const Option &opt)
{
if (!opt.empty())
{
const size_t i = size();
push_back(opt);
map_[opt.ref(0)].push_back((unsigned int)i);
}
}
// Return hash map used to locate options.
const IndexMap &map() const
{
return map_;
}
// Rebuild hash map used to locate options after underlying option list
// has been modified.
void update_map()
{
map_.clear();
for (size_t i = 0; i < size(); ++i)
{
const Option &opt = (*this)[i];
if (!opt.empty())
map_[opt.ref(0)].push_back((unsigned int)i);
}
}
// return true if line is blank or a comment
static bool ignore_line(const std::string &line)
{
for (std::string::const_iterator i = line.begin(); i != line.end(); ++i)
{
const char c = *i;
if (!SpaceMatch::is_space(c))
return is_comment(c);
}
return true;
}
// multiline tagging
// return true if string is a tag, e.g. "<ca>"
static bool is_open_tag(const std::string &str)
{
const size_t n = str.length();
return n >= 3 && str[0] == '<' && str[1] != '/' && str[n - 1] == '>';
}
// return true if string is a close tag, e.g. "</ca>"
static bool is_close_tag(const std::string &str, const std::string &tag)
{
const size_t n = str.length();
return n >= 4 && str[0] == '<' && str[1] == '/' && str.substr(2, n - 3) == tag && str[n - 1] == '>';
}
// remove <> chars from open tag
static void untag_open_tag(std::string &str)
{
const size_t n = str.length();
if (n >= 3)
str = str.substr(1, n - 2);
}
// detect multiline breakout attempt (return true)
static bool detect_multiline_breakout_nothrow(const std::string &opt, const std::string &tag)
{
std::string line;
for (auto &c : opt)
{
if (c == '\n' || c == '\r')
line.clear();
else
{
line += c;
if (tag.empty())
{
if (line.length() >= 2
&& line[0] == '<'
&& line[1] == '/')
return true;
}
else if (is_close_tag(line, tag))
return true;
}
}
return false;
}
// detect multiline breakout attempt
static void detect_multiline_breakout(const std::string &opt, const std::string &tag)
{
if (detect_multiline_breakout_nothrow(opt, tag))
throw option_error(ERR_INVALID_CONFIG, "multiline breakout detected");
}
private:
// multiline tagging (meta)
// return true if string is a meta tag, e.g. WEB_CA_BUNDLE_START
static bool is_open_meta_tag(const std::string &str)
{
return string::ends_with(str, "_START");
}
// return true if string is a tag, e.g. WEB_CA_BUNDLE_STOP
static bool is_close_meta_tag(const std::string &str, const std::string &prefix, const std::string &tag)
{
return prefix + tag + "_STOP" == str;
}
// remove trailing "_START" from open tag
static void untag_open_meta_tag(std::string &str)
{
const size_t n = str.length();
if (n >= 6)
str = std::string(str, 0, n - 6);
}
static void extraneous_err(const int line_num, const char *type, const Option &opt)
{
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, "line " << line_num << ": " << type << " <" << opt.printable_directive() << "> is followed by extraneous text");
}
static void not_closed_out_err(const char *type, const Option &opt)
{
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, type << " <" << opt.printable_directive() << "> was not properly closed out");
}
static void line_too_long(const int line_num)
{
OPENVPN_THROW_ARG1(option_error, ERR_INVALID_OPTION_VAL, "line " << line_num << " is too long");
}
void from_list(Option opt)
{
push_back(std::move(opt));
}
template <typename T, typename... Args>
void from_list(T first, Args... args)
{
from_list(std::move(first));
from_list(std::forward<Args>(args)...);
}
IndexMap map_;
};
} // namespace openvpn
#endif // OPENVPN_COMMON_OPTIONS_H
|