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
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the SwiftASN1 open source project
//
// Copyright (c) 2019-2020 Apple Inc. and the SwiftASN1 project authors
// Licensed under Apache License v2.0
//
// See LICENSE.txt for license information
// See CONTRIBUTORS.txt for the list of SwiftASN1 project authors
//
// SPDX-License-Identifier: Apache-2.0
//
//===----------------------------------------------------------------------===//
/// ``DER`` defines a namespace that is used to store a number of helper methods and types
/// for DER encoding and decoding.
public enum DER {}
// MARK: - Parser Node
extension DER {
/// A ``ParserNode`` is a representation of a parsed ASN.1 TLV section.
///
/// A ``ParserNode`` may be primitive, or may be composed of other ``ParserNode``s.
/// In our representation, we keep track of this by storing a node "depth", which allows rapid forward and backward scans to hop over sections
/// we're uninterested in.
///
/// This type is not exposed to users of the API: it is only used internally for implementation of the user-level API.
@usableFromInline
struct ParserNode {
/// The identifier.
@usableFromInline
var identifier: ASN1Identifier
/// The depth of this node.
@usableFromInline
var depth: Int
/// Whether this node is constructed
@usableFromInline
var isConstructed: Bool
/// The encoded bytes for this complete ASN.1 object.
@usableFromInline
var encodedBytes: ArraySlice<UInt8>
/// The data bytes for this node, if it is primitive.
@usableFromInline
var dataBytes: ArraySlice<UInt8>?
@inlinable
init(
identifier: ASN1Identifier,
depth: Int,
isConstructed: Bool,
encodedBytes: ArraySlice<UInt8>,
dataBytes: ArraySlice<UInt8>? = nil
) {
self.identifier = identifier
self.depth = depth
self.isConstructed = isConstructed
self.encodedBytes = encodedBytes
self.dataBytes = dataBytes
}
}
}
extension DER.ParserNode: Hashable {}
extension DER.ParserNode: Sendable {}
extension DER.ParserNode: CustomStringConvertible {
@inlinable
var description: String {
return
"DER.ParserNode(identifier: \(self.identifier), depth: \(self.depth), dataBytes: \(self.dataBytes?.count ?? 0))"
}
}
// MARK: - Sequence, SequenceOf, Set and SetOf
extension DER {
/// Parse the node as an ASN.1 SEQUENCE.
///
/// The "child" elements in the sequence will be exposed as an iterator to `builder`.
///
/// - parameters:
/// - node: The ``ASN1Node`` to parse
/// - identifier: The ``ASN1Identifier`` that the SEQUENCE is expected to have.
/// - builder: A closure that will be called with the collection of nodes within the sequence.
@inlinable
public static func sequence<T>(
_ node: ASN1Node,
identifier: ASN1Identifier,
_ builder: (inout ASN1NodeCollection.Iterator) throws -> T
) throws -> T {
guard node.identifier == identifier, case .constructed(let nodes) = node.content else {
throw ASN1Error.unexpectedFieldType(node.identifier)
}
var iterator = nodes.makeIterator()
let result = try builder(&iterator)
guard iterator.next() == nil else {
throw ASN1Error.invalidASN1Object(reason: "Unconsumed sequence nodes")
}
return result
}
/// Parse the node as an ASN.1 SEQUENCE OF.
///
/// Constructs an array of `T` elements parsed from the sequence.
///
/// - parameters:
/// - of: An optional parameter to express the type to decode.
/// - identifier: The ``ASN1Identifier`` that the SEQUENCE OF is expected to have.
/// - rootNode: The ``ASN1Node`` to parse
/// - returns: An array of elements representing the elements in the sequence.
@inlinable
public static func sequence<T: DERParseable>(
of: T.Type = T.self,
identifier: ASN1Identifier,
rootNode: ASN1Node
) throws -> [T] {
guard rootNode.identifier == identifier, case .constructed(let nodes) = rootNode.content else {
throw ASN1Error.unexpectedFieldType(rootNode.identifier)
}
return try nodes.map { try T(derEncoded: $0) }
}
/// Parse the node as an ASN.1 SEQUENCE OF.
///
/// Constructs an array of `T` elements parsed from the sequence.
///
/// - parameters:
/// - of: An optional parameter to express the type to decode.
/// - identifier: The ``ASN1Identifier`` that the SEQUENCE OF is expected to have.
/// - nodes: An ``ASN1NodeCollection/Iterator`` of nodes to parse.
/// - returns: An array of elements representing the elements in the sequence.
@inlinable
public static func sequence<T: DERParseable>(
of: T.Type = T.self,
identifier: ASN1Identifier,
nodes: inout ASN1NodeCollection.Iterator
) throws -> [T] {
guard let node = nodes.next() else {
// Not present, throw.
throw ASN1Error.invalidASN1Object(
reason: "No sequence node available for \(T.self) and identifier \(identifier)"
)
}
return try sequence(of: T.self, identifier: identifier, rootNode: node)
}
/// Parse the node as an ASN.1 SET.
///
/// The "child" elements in the sequence will be exposed as an iterator to `builder`.
///
/// - parameters:
/// - node: The ``ASN1Node`` to parse
/// - identifier: The ``ASN1Identifier`` that the SET is expected to have.
/// - builder: A closure that will be called with the collection of nodes within the set.
@inlinable
public static func set<T>(
_ node: ASN1Node,
identifier: ASN1Identifier,
_ builder: (inout ASN1NodeCollection.Iterator) throws -> T
) throws -> T {
// Shhhh these two are secretly the same with identifier.
return try sequence(node, identifier: identifier, builder)
}
/// Parse the node as an ASN.1 SET OF.
///
/// Constructs an array of `T` elements parsed from the set.
///
/// - parameters:
/// - of: An optional parameter to express the type to decode.
/// - identifier: The ``ASN1Identifier`` that the SET OF is expected to have.
/// - nodes: An ``ASN1NodeCollection/Iterator`` of nodes to parse.
/// - returns: An array of elements representing the elements in the set.
@inlinable
public static func set<T: DERParseable>(
of: T.Type = T.self,
identifier: ASN1Identifier,
nodes: inout ASN1NodeCollection.Iterator
) throws -> [T] {
guard let node = nodes.next() else {
// Not present, throw.
throw ASN1Error.invalidASN1Object(
reason: "No set node available for \(T.self) and identifier \(identifier)"
)
}
return try Self.set(of: T.self, identifier: identifier, rootNode: node)
}
/// Parse the node as an ASN.1 SET OF.
///
/// Constructs an array of `T` elements parsed from the set.
///
/// - parameters:
/// - of: An optional parameter to express the type to decode.
/// - identifier: The ``ASN1Identifier`` that the SET OF is expected to have.
/// - rootNode: The ``ASN1Node`` to parse
/// - returns: An array of elements representing the elements in the sequence.
@inlinable
public static func set<T: DERParseable>(
of type: T.Type = T.self,
identifier: ASN1Identifier,
rootNode: ASN1Node
) throws -> [T] {
try self.lazySet(of: type, identifier: identifier, rootNode: rootNode).map { try $0.get() }
}
/// Parse the node as an ASN.1 SET OF lazily.
///
/// Constructs a Sequence of `T` elements that will be lazily parsed from the set.
///
/// - parameters:
/// - of: An optional parameter to express the type to decode.
/// - identifier: The ``ASN1Identifier`` that the SET OF is expected to have.
/// - rootNode: The ``ASN1Node`` to parse
/// - returns: A `Sequence` of elements representing the `Result` of parsing the elements in the sequence.
@inlinable
public static func lazySet<T: DERParseable>(
of: T.Type = T.self,
identifier: ASN1Identifier,
rootNode: ASN1Node
) throws -> LazySetOfSequence<T> {
guard rootNode.identifier == identifier, case .constructed(let nodes) = rootNode.content else {
throw ASN1Error.unexpectedFieldType(rootNode.identifier)
}
guard nodes.isOrderedAccordingToSetOfSemantics() else {
throw ASN1Error.invalidASN1Object(reason: "SET OF fields are not lexicographically ordered")
}
return .init(nodes.lazy.map { node in Result { try T(derEncoded: node) } })
}
public struct LazySetOfSequence<T>: Sequence {
public typealias Element = Result<T, Error>
@usableFromInline
typealias WrappedSequence = LazyMapSequence<LazySequence<(ASN1NodeCollection)>.Elements, Result<T, Error>>
public struct Iterator: IteratorProtocol {
@usableFromInline
var wrapped: WrappedSequence.Iterator
@inlinable
mutating public func next() -> Element? {
wrapped.next()
}
@inlinable
init(_ wrapped: WrappedSequence.Iterator) {
self.wrapped = wrapped
}
}
@usableFromInline
var wrapped: WrappedSequence
@inlinable
init(_ wrapped: WrappedSequence) {
self.wrapped = wrapped
}
@inlinable
public func makeIterator() -> Iterator {
.init(wrapped.makeIterator())
}
}
}
// MARK: - Optional explicitly tagged
extension DER {
/// Parses an optional explicitly tagged element.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - tagNumber: The number of the explicit tag.
/// - tagClass: The class of the explicit tag.
/// - builder: A closure that will be called with the node for the element, if the element is present.
///
/// - returns: The result of `builder` if the element was present, or `nil` if it was not.
@inlinable
public static func optionalExplicitlyTagged<T>(
_ nodes: inout ASN1NodeCollection.Iterator,
tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
_ builder: (ASN1Node) throws -> T
) throws -> T? {
var localNodesCopy = nodes
guard let node = localNodesCopy.next() else {
// Node not present, return nil.
return nil
}
let expectedNodeID = ASN1Identifier(tagWithNumber: tagNumber, tagClass: tagClass)
// assert(expectedNodeID.constructed)
guard node.identifier == expectedNodeID else {
// Node is a mismatch, with the wrong tag. Our optional isn't present.
return nil
}
// We have the right optional, so let's consume it.
nodes = localNodesCopy
// We expect a single child.
guard case .constructed(let nodes) = node.content else {
// This error is an internal parser error: the tag above is always constructed.
preconditionFailure("Explicit tags are always constructed")
}
var nodeIterator = nodes.makeIterator()
guard let child = nodeIterator.next(), nodeIterator.next() == nil else {
throw ASN1Error.invalidASN1Object(
reason: "Too many child nodes in optionally tagged node of \(T.self) with identifier \(expectedNodeID)"
)
}
return try builder(child)
}
}
// MARK: - Optional implicitly tagged
extension DER {
/// Parses an optional implicitly tagged element.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - tag: The implicit tag. Defaults to the default tag for the element.
///
/// - returns: The parsed element, if it was present, or `nil` if it was not.
@inlinable
public static func optionalImplicitlyTagged<T: DERImplicitlyTaggable>(
_ nodes: inout ASN1NodeCollection.Iterator,
tag: ASN1Identifier = T.defaultIdentifier
) throws -> T? {
var localNodesCopy = nodes
guard let node = localNodesCopy.next() else {
// Node not present, return nil.
return nil
}
guard node.identifier == tag else {
// Node is a mismatch, with the wrong tag. Our optional isn't present.
return nil
}
// We're good: pass the node on.
return try T(derEncoded: &nodes, withIdentifier: tag)
}
/// Parses an optional implicitly tagged element.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - tagNumber: The number of the explicit tag.
/// - tagClass: The class of the explicit tag.
/// - builder: A closure that will be called with the node for the element, if the element is present.
///
/// - returns: The result of `builder` if the element was present, or `nil` if it was not.
@inlinable
public static func optionalImplicitlyTagged<Result>(
_ nodes: inout ASN1NodeCollection.Iterator,
tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
_ builder: (ASN1Node) throws -> Result
) rethrows -> Result? {
var localNodesCopy = nodes
guard let node = localNodesCopy.next() else {
// Node not present, return nil.
return nil
}
let expectedNodeID = ASN1Identifier(tagWithNumber: tagNumber, tagClass: tagClass)
guard node.identifier == expectedNodeID else {
// Node is a mismatch, with the wrong tag. Our optional isn't present.
return nil
}
// We have the right optional, so let's consume it.
nodes = localNodesCopy
// We're good: pass the node on.
return try builder(node)
}
}
// MARK: - DEFAULT
extension DER {
/// Parses a value that is encoded with a DEFAULT.
///
/// Such a value is optional, and if absent will be replaced with its default.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - identifier: The implicit tag. Defaults to the default tag for the element.
/// - defaultValue: The default value to use if there was no encoded value.
/// - builder: A closure that will be called with the node for the element, if the element is present.
///
/// - returns: The parsed element, if it was present, or the default if it was not.
@inlinable
public static func decodeDefault<T: DERParseable & Equatable>(
_ nodes: inout ASN1NodeCollection.Iterator,
identifier: ASN1Identifier,
defaultValue: T,
_ builder: (ASN1Node) throws -> T
) throws -> T {
// A weird trick here: we only want to consume the next node _if_ it has the right tag. To achieve that,
// we work on a copy.
var localNodesCopy = nodes
guard let node = localNodesCopy.next() else {
// Whoops, nothing here.
return defaultValue
}
guard node.identifier == identifier else {
// Node is a mismatch, with the wrong identifier. Our optional isn't present.
return defaultValue
}
// We have the right optional, so let's consume it.
nodes = localNodesCopy
let parsed = try builder(node)
// DER forbids encoding DEFAULT values at their default state.
// We can lift this in BER.
guard parsed != defaultValue else {
throw ASN1Error.invalidASN1Object(
reason:
"DEFAULT for \(T.self) with identifier \(identifier) present in DER but encoded at default value \(defaultValue)"
)
}
return parsed
}
/// Parses a value that is encoded with a DEFAULT.
///
/// Such a value is optional, and if absent will be replaced with its default. This function is
/// a helper wrapper for ``decodeDefault(_:identifier:defaultValue:_:)`` that automatically invokes
/// ``DERParseable/init(derEncoded:)-7tumk`` on `T`.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - identifier: The implicit tag. Defaults to the default tag for the element.
/// - defaultValue: The default value to use if there was no encoded value.
///
/// - returns: The parsed element, if it was present, or the default if it was not.
@inlinable
public static func decodeDefault<T: DERParseable & Equatable>(
_ nodes: inout ASN1NodeCollection.Iterator,
identifier: ASN1Identifier,
defaultValue: T
) throws -> T {
return try Self.decodeDefault(&nodes, identifier: identifier, defaultValue: defaultValue) {
try T(derEncoded: $0)
}
}
/// Parses a value that is encoded with a DEFAULT.
///
/// Such a value is optional, and if absent will be replaced with its default. This function is
/// a helper wrapper for ``decodeDefault(_:identifier:defaultValue:_:)`` that automatically invokes
/// ``DERImplicitlyTaggable/init(derEncoded:withIdentifier:)-7e88k`` on `T` using ``DERImplicitlyTaggable/defaultIdentifier``.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - defaultValue: The default value to use if there was no encoded value.
///
/// - returns: The parsed element, if it was present, or the default if it was not.
@inlinable
public static func decodeDefault<T: DERImplicitlyTaggable & Equatable>(
_ nodes: inout ASN1NodeCollection.Iterator,
defaultValue: T
) throws -> T {
return try Self.decodeDefault(&nodes, identifier: T.defaultIdentifier, defaultValue: defaultValue)
}
/// Parses a value that is encoded with a DEFAULT and an explicit tag.
///
/// Such a value is optional, and if absent will be replaced with its default.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - tagNumber: The number of the explicit tag.
/// - tagClass: The class of the explicit tag.
/// - defaultValue: The default value to use if there was no encoded value.
/// - builder: A closure that will be called with the node for the element, if the element is present.
///
/// - returns: The parsed element, if it was present, or the default if it was not.
@inlinable
public static func decodeDefaultExplicitlyTagged<T: DERParseable & Equatable>(
_ nodes: inout ASN1NodeCollection.Iterator,
tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
defaultValue: T,
_ builder: (ASN1Node) throws -> T
) throws -> T {
guard let result = try optionalExplicitlyTagged(&nodes, tagNumber: tagNumber, tagClass: tagClass, builder)
else {
return defaultValue
}
guard result != defaultValue else {
// DER forbids encoding DEFAULT values at their default state.
// We can lift this in BER.
throw ASN1Error.invalidASN1Object(
reason:
"DEFAULT for \(T.self) with tag number \(tagNumber) and class \(tagClass) present in DER but encoded at default value \(defaultValue)"
)
}
return result
}
/// Parses a value that is encoded with a DEFAULT and an explicit tag.
///
/// Such a value is optional, and if absent will be replaced with its default. This function is
/// a helper wrapper for ``decodeDefaultExplicitlyTagged(_:tagNumber:tagClass:defaultValue:_:)`` that automatically invokes
/// ``DERParseable/init(derEncoded:)-7tumk`` on `T`.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - tagNumber: The number of the explicit tag.
/// - tagClass: The class of the explicit tag.
/// - defaultValue: The default value to use if there was no encoded value.
///
/// - returns: The parsed element, if it was present, or the default if it was not.
@inlinable
public static func decodeDefaultExplicitlyTagged<T: DERParseable & Equatable>(
_ nodes: inout ASN1NodeCollection.Iterator,
tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
defaultValue: T
) throws -> T {
return try Self.decodeDefaultExplicitlyTagged(
&nodes,
tagNumber: tagNumber,
tagClass: tagClass,
defaultValue: defaultValue
) {
try T(derEncoded: $0)
}
}
}
// MARK: - Ordinary, explicit tagging
extension DER {
/// Parses an explicitly tagged element.
///
/// - parameters:
/// - nodes: The ``ASN1NodeCollection/Iterator`` to parse this element out of.
/// - tagNumber: The number of the explicit tag.
/// - tagClass: The class of the explicit tag.
/// - builder: A closure that will be called with the node for the element.
///
/// - returns: The result of `builder`.
@inlinable
public static func explicitlyTagged<T>(
_ nodes: inout ASN1NodeCollection.Iterator,
tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
_ builder: (ASN1Node) throws -> T
) throws -> T {
guard let node = nodes.next() else {
// Node not present, throw.
throw ASN1Error.invalidASN1Object(
reason:
"Explicitly tagged node for \(T.self) with tag number \(tagNumber) and class \(tagClass) not present"
)
}
return try self.explicitlyTagged(node, tagNumber: tagNumber, tagClass: tagClass, builder)
}
/// Parses an explicitly tagged element.
///
/// - parameters:
/// - node: The ``ASN1Node`` to parse this element out of.
/// - tagNumber: The number of the explicit tag.
/// - tagClass: The class of the explicit tag.
/// - builder: A closure that will be called with the node for the element.
///
/// - returns: The result of `builder`.
@inlinable
public static func explicitlyTagged<T>(
_ node: ASN1Node,
tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
_ builder: (ASN1Node) throws -> T
) throws -> T {
let expectedNodeID = ASN1Identifier(tagWithNumber: tagNumber, tagClass: tagClass)
guard node.identifier == expectedNodeID else {
// Node is a mismatch, with the wrong tag.
throw ASN1Error.unexpectedFieldType(node.identifier)
}
// We expect a single child.
guard case .constructed(let nodes) = node.content else {
throw ASN1Error.invalidASN1Object(reason: "Explicit tag \(expectedNodeID) for \(T.self) is primitive")
}
var nodeIterator = nodes.makeIterator()
guard let child = nodeIterator.next(), nodeIterator.next() == nil else {
throw ASN1Error.invalidASN1Object(
reason: "Invalid number of child nodes for explicit tag \(expectedNodeID) for \(T.self)"
)
}
return try builder(child)
}
}
// MARK: - Parsing
extension DER {
/// A parsed representation of ASN.1.
@usableFromInline
struct ParseResult {
@usableFromInline
static let _maximumNodeDepth = 50
@usableFromInline
var nodes: ArraySlice<ParserNode>
@inlinable
init(_ nodes: ArraySlice<ParserNode>) {
self.nodes = nodes
}
@inlinable
static func parse(_ data: ArraySlice<UInt8>) throws -> ParseResult {
var data = data
var nodes = [ParserNode]()
nodes.reserveCapacity(16)
try _parseNode(from: &data, depth: 1, into: &nodes)
guard data.count == 0 else {
throw ASN1Error.invalidASN1Object(reason: "Trailing unparsed data is present")
}
return ParseResult(nodes[...])
}
/// Parses a single ASN.1 node from the data and appends it to the buffer. This may recursively
/// call itself when there are child nodes for constructed nodes.
@inlinable
static func _parseNode(from data: inout ArraySlice<UInt8>, depth: Int, into nodes: inout [ParserNode]) throws {
guard depth <= ParseResult._maximumNodeDepth else {
// We defend ourselves against stack overflow by refusing to allocate more than 50 stack frames to
// the parsing.
throw ASN1Error.invalidASN1Object(reason: "Excessive stack depth was reached")
}
let originalData = data
guard let rawIdentifier = data.popFirst() else {
throw ASN1Error.truncatedASN1Field()
}
// Check whether the bottom 5 bits are set: if they are, this uses long-form encoding.
let constructed = (rawIdentifier & 0x20) != 0
let identifier: ASN1Identifier
if (rawIdentifier & 0x1f) == 0x1f {
let tagClass = ASN1Identifier.TagClass(topByteInWireFormat: rawIdentifier)
// Now we need to read a UInt from the array.
let tagNumber = try data.readUIntUsing8BitBytesASN1Discipline()
// We need a check here: this number needs to be greater than or equal to 0x1f, or it should have been encoded as short form.
guard tagNumber >= 0x1f else {
throw ASN1Error.invalidASN1Object(
reason: "ASN.1 tag incorrectly encoded in long form: \(tagNumber)"
)
}
identifier = ASN1Identifier(tagWithNumber: tagNumber, tagClass: tagClass)
} else {
identifier = ASN1Identifier(shortIdentifier: rawIdentifier)
}
guard let wideLength = try data._readASN1Length() else {
throw ASN1Error.truncatedASN1Field()
}
// UInt is sometimes too large for us!
guard let length = Int(exactly: wideLength) else {
throw ASN1Error.invalidASN1Object(reason: "Excessively large field: \(wideLength)")
}
var subData = data.prefix(length)
data = data.dropFirst(length)
guard subData.count == length else {
throw ASN1Error.truncatedASN1Field()
}
let encodedBytes = originalData[..<subData.endIndex]
if constructed {
nodes.append(
ParserNode(
identifier: identifier,
depth: depth,
isConstructed: true,
encodedBytes: encodedBytes,
dataBytes: nil
)
)
while subData.count > 0 {
try _parseNode(from: &subData, depth: depth + 1, into: &nodes)
}
} else {
nodes.append(
ParserNode(
identifier: identifier,
depth: depth,
isConstructed: false,
encodedBytes: encodedBytes,
dataBytes: subData
)
)
}
}
}
}
extension DER.ParseResult: Hashable {}
extension DER {
/// Parses an array of bytes as DER-encoded ASN.1 bytes.
///
/// This function does not produce a complete decoded representation. Instead it produces a tree of ``ASN1Node`` objects,
/// each representing a single ASN.1 object. The leaves of the tree are primitive ASN.1 objects, and the intermediate nodes are
/// constructed.
///
/// In general this function is not called by users directly. Prefer using ``DERParseable/init(derEncoded:)-i2rf``, which encapsulates
/// the use of this function and immediately returns a strongly typed, fully-parsed object.
///
/// - parameters:
/// - data: The DER-encoded bytes to parse.
/// - returns: The root node in the ASN.1 tree.
@inlinable
public static func parse(_ data: [UInt8]) throws -> ASN1Node {
return try parse(data[...])
}
/// Parses an array of bytes as DER-encoded ASN.1 bytes.
///
/// This function does not produce a complete decoded representation. Instead it produces a tree of ``ASN1Node`` objects,
/// each representing a single ASN.1 object. The leaves of the tree are primitive ASN.1 objects, and the intermediate nodes are
/// constructed.
///
/// In general this function is not called by users directly. Prefer using ``DERParseable/init(derEncoded:)-8yeds``, which encapsulates
/// the use of this function and immediately returns a strongly typed, fully-parsed object.
///
/// - parameters:
/// - data: The DER-encoded bytes to parse.
/// - returns: The root node in the ASN.1 tree.
@inlinable
public static func parse(_ data: ArraySlice<UInt8>) throws -> ASN1Node {
var result = try ParseResult.parse(data)
// There will always be at least one node if the above didn't throw, so we can safely just removeFirst here.
let firstNode = result.nodes.removeFirst()
let rootNode: ASN1Node
if firstNode.isConstructed {
// We need to feed it the next set of nodes.
let nodeCollection = result.nodes.prefix { $0.depth > firstNode.depth }
result.nodes = result.nodes.dropFirst(nodeCollection.count)
rootNode = ASN1Node(
identifier: firstNode.identifier,
content: .constructed(.init(nodes: nodeCollection, depth: firstNode.depth)),
encodedBytes: firstNode.encodedBytes
)
} else {
rootNode = ASN1Node(
identifier: firstNode.identifier,
content: .primitive(firstNode.dataBytes!),
encodedBytes: firstNode.encodedBytes
)
}
precondition(result.nodes.count == 0, "ASN1ParseResult unexpectedly allowed multiple root nodes")
return rootNode
}
}
// MARK: - NodeCollection
/// Represents a collection of ASN.1 nodes contained in a constructed ASN.1 node.
///
/// Constructed ASN.1 nodes are made up of multiple child nodes. This object represents the collection of those child nodes.
/// It allows us to lazily construct the child nodes, potentially skipping over them when we don't care about them.
///
/// This type cannot be constructed directly, and is instead provided by helper functions such as ``DER/sequence(of:identifier:rootNode:)``.
public struct ASN1NodeCollection {
@usableFromInline var _nodes: ArraySlice<DER.ParserNode>
@usableFromInline var _depth: Int
@inlinable
init(nodes: ArraySlice<DER.ParserNode>, depth: Int) {
self._nodes = nodes
self._depth = depth
precondition(self._nodes.allSatisfy({ $0.depth > depth }))
if let firstDepth = self._nodes.first?.depth {
precondition(firstDepth == depth + 1)
}
}
}
extension ASN1NodeCollection: Hashable {}
extension ASN1NodeCollection: Sendable {}
extension ASN1NodeCollection: Sequence {
/// An iterator of ASN.1 nodes that are children of a specific constructed node.
public struct Iterator: IteratorProtocol {
// If it's necessary to add BER support in the future, this lower-level
// type may need to change.
@usableFromInline
var _nodes: ArraySlice<DER.ParserNode>
@usableFromInline
var _depth: Int
@inlinable
init(nodes: ArraySlice<DER.ParserNode>, depth: Int) {
self._nodes = nodes
self._depth = depth
}
@inlinable
public mutating func next() -> ASN1Node? {
guard let nextNode = self._nodes.popFirst() else {
return nil
}
assert(nextNode.depth == self._depth + 1)
guard nextNode.isConstructed else {
// There must be data bytes here, even if they're empty.
return ASN1Node(
identifier: nextNode.identifier,
content: .primitive(nextNode.dataBytes!),
encodedBytes: nextNode.encodedBytes
)
}
// We need to feed it the next set of nodes.
let nodeCollection = self._nodes.prefix { $0.depth > nextNode.depth }
self._nodes = self._nodes.dropFirst(nodeCollection.count)
return ASN1Node(
identifier: nextNode.identifier,
content: .constructed(.init(nodes: nodeCollection, depth: nextNode.depth)),
encodedBytes: nextNode.encodedBytes
)
}
}
@inlinable
public func makeIterator() -> Iterator {
return Iterator(nodes: self._nodes, depth: self._depth)
}
}
// MARK: - ASN1Node
/// An ``ASN1Node`` is a single entry in the ASN.1 representation of a data structure.
///
/// Conceptually, an ASN.1 data structure is rooted in a single node, which may itself contain zero or more
/// other nodes. ASN.1 nodes are either "constructed", meaning they contain other nodes, or "primitive", meaning they
/// store a base data type of some kind.
///
/// In this way, ASN.1 objects tend to form a "tree", where each object is represented by a single top-level constructed
/// node that contains other objects and primitives, eventually reaching the bottom which is made up of primitive objects.
public struct ASN1Node: Hashable, Sendable {
/// The tag for this ASN.1 node.
public var identifier: ASN1Identifier
/// The content of this ASN.1 node.
public var content: Content
/// The encoded bytes for this node.
///
/// This is principally intended for diagnostic purposes.
public var encodedBytes: ArraySlice<UInt8>
@inlinable
internal init(
identifier: ASN1Identifier,
content: ASN1Node.Content,
encodedBytes: ArraySlice<UInt8>
) {
self.identifier = identifier
self.content = content
self.encodedBytes = encodedBytes
}
}
// MARK: - ASN1Node.Content
extension ASN1Node {
/// The content of a single ``ASN1Node``.
public enum Content: Hashable, Sendable {
/// This ``ASN1Node`` is constructed, and has a number of child nodes.
case constructed(ASN1NodeCollection)
/// This ``ASN1Node`` is primitive, and is made up only of a collection of bytes.
case primitive(ArraySlice<UInt8>)
}
}
// MARK: - Serializing
extension DER {
/// An object that can serialize ASN.1 bytes.
///
/// ``Serializer`` is a copy-on-write value type.
public struct Serializer: Sendable {
@usableFromInline
var _serializedBytes: [UInt8]
/// The bytes that have been serialized by this serializer.
@inlinable
public var serializedBytes: [UInt8] {
self._serializedBytes
}
/// Construct a new serializer.
@inlinable
public init() {
// We allocate a 1kB array because that should cover us most of the time.
self._serializedBytes = []
self._serializedBytes.reserveCapacity(1024)
}
/// Appends a single, non-constructed node to the content.
///
/// This is a low-level operation that can be used to implement primitive ASN.1 types.
///
/// - parameters:
/// - identifier: The tag for this ASN.1 node
/// - contentWriter: A callback that will be invoked that allows users to write their bytes into the output stream.
@inlinable
public mutating func appendPrimitiveNode(
identifier: ASN1Identifier,
_ contentWriter: (inout [UInt8]) throws -> Void
) rethrows {
try self._appendNode(identifier: identifier, constructed: false) { try contentWriter(&$0._serializedBytes) }
}
/// Appends a single constructed node to the content.
///
/// This is an operation that can be used to implement constructed ASN.1 types. Most ASN.1 types are sequences and rely on using this function
/// to append their SEQUENCE node.
///
/// - parameters:
/// - identifier: The tag for this ASN.1 node
/// - contentWriter: A callback that will be invoked that allows users to write the objects contained within this constructed node.
@inlinable
public mutating func appendConstructedNode(
identifier: ASN1Identifier,
_ contentWriter: (inout Serializer) throws -> Void
) rethrows {
try self._appendNode(identifier: identifier, constructed: true, contentWriter)
}
/// Serializes a single node to the end of the byte stream.
///
/// - parameters:
/// node: The node to be serialized.
@inlinable
public mutating func serialize<T: DERSerializable>(_ node: T) throws {
try node.serialize(into: &self)
}
/// Serializes a single node to the end of the byte stream with an explicit ASN.1 tag.
///
/// This is a wrapper for ``DER/Serializer/serialize(_:explicitlyTaggedWithIdentifier:)`` that builds the ASN.1 tag
/// automatically.
///
/// - parameters:
/// node: The node to be serialized.
/// tagNumber: The number of the explicit tag.
/// tagClass: The number of the explicit tag.
@inlinable
public mutating func serialize<T: DERSerializable>(
_ node: T,
explicitlyTaggedWithTagNumber tagNumber: UInt,
tagClass: ASN1Identifier.TagClass
) throws {
let identifier = ASN1Identifier(tagWithNumber: tagNumber, tagClass: tagClass)
return try self.serialize(node, explicitlyTaggedWithIdentifier: identifier)
}
/// Serializes a single node to the end of the byte stream with an explicit ASN.1 tag.
///
/// - parameters:
/// node: The node to be serialized.
/// identifier: The explicit ASN.1 tag to apply.
@inlinable
public mutating func serialize<T: DERSerializable>(
_ node: T,
explicitlyTaggedWithIdentifier identifier: ASN1Identifier
) throws {
try self.appendConstructedNode(identifier: identifier) { coder in
try coder.serialize(node)
}
}
/// Serializes a single optional node to the end of the byte stream with an implicit ASN.1 tag.
///
/// If the node is `nil`, nothing is appended to the stream.
///
/// The node is appended with its default tag.
///
/// - parameters:
/// node: The node to be serialized.
@inlinable
public mutating func serializeOptionalImplicitlyTagged<T: DERSerializable>(_ node: T?) throws {
if let node = node {
try self.serialize(node)
}
}
/// Serializes a single optional node to the end of the byte stream with an implicit ASN.1 tag.
///
/// If the node is `nil`, nothing is appended to the stream.
///
/// - parameters:
/// node: The node to be serialized.
/// identifier: The implicit ASN.1 tag to apply.
@inlinable
public mutating func serializeOptionalImplicitlyTagged<T: DERImplicitlyTaggable>(
_ node: T?,
withIdentifier identifier: ASN1Identifier
) throws {
if let node = node {
try node.serialize(into: &self, withIdentifier: identifier)
}
}
/// Serializes an explicit ASN.1 tag using a custom builder to store the elements of the explicitly tagged node.
///
/// This is a helper version of ``DER/Serializer/serialize(_:explicitlyTaggedWithTagNumber:tagClass:)`` that allows users to avoid defining an object for the
/// explicit node.
///
/// - parameters:
/// tagNumber: The number of the explicit tag.
/// tagClass: The number of the explicit tag.
/// block: The block that will be invoked to encode the contents of the explicit tag.
@inlinable
public mutating func serialize(
explicitlyTaggedWithTagNumber tagNumber: UInt,
tagClass: ASN1Identifier.TagClass,
_ block: (inout Serializer) throws -> Void
) rethrows {
let identifier = ASN1Identifier(tagWithNumber: tagNumber, tagClass: tagClass)
try self.appendConstructedNode(identifier: identifier) { coder in
try block(&coder)
}
}
/// Serializes a SEQUENCE OF ASN.1 nodes.
///
/// - parameters:
/// - elements: The members of the ASN.1 SEQUENCE OF.
/// - identifier: The identifier to use for the SEQUENCE OF node. Defaults to ``ASN1Identifier/sequence``.
@inlinable
public mutating func serializeSequenceOf<Elements: Sequence>(
_ elements: Elements,
identifier: ASN1Identifier = .sequence
) throws where Elements.Element: DERSerializable {
try self.appendConstructedNode(identifier: identifier) { coder in
for element in elements {
try coder.serialize(element)
}
}
}
/// Serializes a SET OF ASN.1 nodes.
///
/// - parameters:
/// - elements: The members of the ASN.1 SET OF.
/// - identifier: The identifier to use for the SET OF node. Defaults to ``ASN1Identifier/set``.
@inlinable
public mutating func serializeSetOf<Elements: Sequence>(
_ elements: Elements,
identifier: ASN1Identifier = .set
) throws where Elements.Element: DERSerializable {
// We first serialize all elements into one intermediate Serializer and
// create ArraySlices of their binary DER representation.
var intermediateSerializer = DER.Serializer()
let serializedRanges = try elements.map { element in
let startIndex = intermediateSerializer.serializedBytes.endIndex
try intermediateSerializer.serialize(element)
let endIndex = intermediateSerializer.serializedBytes.endIndex
// It is important to first serialise all elements before we create `ArraySlice`s
// as we otherwise trigger CoW of `intermediateSerializer.serializedBytes`.
// We therefore just return a `Range` in the first iteration and
// get `ArraySlice`s during the sort and write operations on demand.
return startIndex..<endIndex
}
let serializedBytes = intermediateSerializer.serializedBytes
// Afterwards we sort the binary representation of each element lexicographically
let sortedRanges = serializedRanges.sorted { lhs, rhs in
asn1SetElementLessThan(serializedBytes[lhs], serializedBytes[rhs])
}
// We then only need to create a constructed node and append the binary representation in their sorted order
self.appendConstructedNode(identifier: identifier) { serializer in
for range in sortedRanges {
serializer.serializeRawBytes(serializedBytes[range])
}
}
}
/// Serializes a parsed ASN.1 node directly.
///
/// This is an extremely low-level helper function that can be used to re-serialize a parsed object when properly deserializing it was not
/// practical.
///
/// - parameters:
/// - node: The parsed node to serialize.
@inlinable
public mutating func serialize(_ node: ASN1Node) {
let identifier = node.identifier
let constructed: Bool
if case .constructed = node.content {
constructed = true
} else {
constructed = false
}
self._appendNode(identifier: identifier, constructed: constructed) { coder in
switch node.content {
case .constructed(let nodes):
for node in nodes {
coder.serialize(node)
}
case .primitive(let baseData):
coder.serializeRawBytes(baseData)
}
}
}
/// Serializes a sequence of raw bytes directly into the output stream.
///
/// This is an extremely low-level helper function that can be used to serialize a parsed object exactly as it was deserialized.
/// This can be used to enable perfect fidelity re-encoding where there are equally valid alternatives for serializing something
/// and your code makes default choices.
///
/// In general, users should avoid calling this function unless it's absolutely necessary to do so as a matter of implementation.
///
/// Users are required to ensure that `bytes` is well-formed DER. Failure to do so will lead to invalid output being produced.
///
/// - parameters:
/// - bytes: The raw bytes to serialize. These bytes must be well-formed DER.
@inlinable
public mutating func serializeRawBytes<Bytes: Sequence>(_ bytes: Bytes) where Bytes.Element == UInt8 {
self._serializedBytes.append(contentsOf: bytes)
}
// This is the base logical function that all other append methods are built on. This one has most of the logic, and doesn't
// police what we expect to happen in the content writer.
@inlinable
mutating func _appendNode(
identifier: ASN1Identifier,
constructed: Bool,
_ contentWriter: (inout Serializer) throws -> Void
) rethrows {
// This is a tricky game to play. We want to write the identifier and the length, but we don't know what the
// length is here. To get around that, we _assume_ the length will be one byte, and let the writer write their content.
// If it turns out to have been longer, we recalculate how many bytes we need and shuffle them in the buffer,
// before updating the length. Most of the time we'll be right: occasionally we'll be wrong and have to shuffle.
self._serializedBytes.writeIdentifier(identifier, constructed: constructed)
// Write a zero for the length.
self._serializedBytes.append(0)
// Save the indices and write.
let originalEndIndex = self._serializedBytes.endIndex
let lengthIndex = self._serializedBytes.index(before: originalEndIndex)
try contentWriter(&self)
let contentLength = self._serializedBytes.distance(
from: originalEndIndex,
to: self._serializedBytes.endIndex
)
let lengthBytesNeeded = contentLength._bytesNeededToEncode
if lengthBytesNeeded == 1 {
// We can just set this at the top, and we're done!
assert(contentLength <= 0x7F)
self._serializedBytes[lengthIndex] = UInt8(contentLength)
return
}
// Whoops, we need more than one byte to represent the length. That's annoying!
// To sort this out we want to "move" the memory to the right.
self._serializedBytes._moveRange(
offset: lengthBytesNeeded - 1,
range: originalEndIndex..<self._serializedBytes.endIndex
)
// Now we can write the length bytes back. We first write the number of length bytes
// we needed, setting the high bit. Then we write the bytes of the length.
self._serializedBytes[lengthIndex] = 0x80 | UInt8(lengthBytesNeeded - 1)
var writeIndex = lengthIndex
for shift in (0..<(lengthBytesNeeded - 1)).reversed() {
// Shift and mask the integer.
self._serializedBytes.formIndex(after: &writeIndex)
self._serializedBytes[writeIndex] = UInt8(truncatingIfNeeded: (contentLength >> (shift * 8)))
}
assert(writeIndex == self._serializedBytes.index(lengthIndex, offsetBy: lengthBytesNeeded - 1))
}
}
}
// MARK: - Helpers
/// Defines a type that can be parsed from a DER-encoded form.
///
/// Users implementing this type are expected to write the ASN.1 decoding code themselves. This approach is discussed in
/// depth in <doc:DecodingASN1>. When working with a type that may be implicitly tagged (which is most ASN.1 types),
/// users are recommended to implement ``DERImplicitlyTaggable`` instead.
public protocol DERParseable {
/// Initialize this object from a serialized DER representation.
///
/// This function is invoked by the parser with the root node for the ASN.1 object. Implementers are
/// expected to initialize themselves if possible, or to throw if they cannot.
///
/// - parameters:
/// - derEncoded: The ASN.1 node representing this object.
init(derEncoded: ASN1Node) throws
}
extension DERParseable {
/// Initialize this object as one element of a constructed ASN.1 object.
///
/// This is a helper function for parsing constructed ASN.1 objects. It delegates all its functionality
/// to ``DERParseable/init(derEncoded:)-7tumk``.
///
/// - parameters:
/// - derEncoded: The sequence of nodes that make up this object's parent. The first node in this collection
/// will be used to construct this object.
@inlinable
public init(derEncoded sequenceNodeIterator: inout ASN1NodeCollection.Iterator) throws {
guard let node = sequenceNodeIterator.next() else {
throw ASN1Error.invalidASN1Object(reason: "Unable to decode \(Self.self), no ASN.1 nodes to decode")
}
self = try .init(derEncoded: node)
}
/// Initialize this object from a serialized DER representation.
///
/// - parameters:
/// - derEncoded: The DER-encoded bytes representing this object.
@inlinable
public init(derEncoded: [UInt8]) throws {
self = try .init(derEncoded: DER.parse(derEncoded))
}
/// Initialize this object from a serialized DER representation.
///
/// - parameters:
/// - derEncoded: The DER-encoded bytes representing this object.
@inlinable
public init(derEncoded: ArraySlice<UInt8>) throws {
self = try .init(derEncoded: DER.parse(derEncoded))
}
}
/// Defines a type that can be serialized in DER-encoded form.
///
/// Users implementing this type are expected to write the ASN.1 serialization code themselves. This approach is discussed in
/// depth in <doc:DecodingASN1>. When working with a type that may be implicitly tagged (which is most ASN.1 types),
/// users are recommended to implement ``DERImplicitlyTaggable`` instead.
public protocol DERSerializable {
/// Serialize this object into DER-encoded ASN.1 form.
///
/// - parameters:
/// - coder: A serializer to be used to encode the object.
func serialize(into coder: inout DER.Serializer) throws
}
/// An ASN.1 node that can tolerate having an implicit tag.
///
/// Implicit tags prevent the decoder from being able to work out what the actual type of the object
/// is, as they replace the tags. This means some objects cannot be implicitly tagged. In particular,
/// CHOICE elements without explicit tags cannot be implicitly tagged.
///
/// Objects that _can_ be implicitly tagged should prefer to implement this protocol in preference to
/// ``DERSerializable`` and ``DERParseable``.
public protocol DERImplicitlyTaggable: DERParseable, DERSerializable {
/// The tag that the first node will use "by default" if the grammar omits
/// any more specific tag definition.
static var defaultIdentifier: ASN1Identifier { get }
/// Initialize this object from a serialized DER representation.
///
/// This function is invoked by the parser with the root node for the ASN.1 object. Implementers are
/// expected to initialize themselves if possible, or to throw if they cannot. The object is expected
/// to use the identifier `identifier`.
///
/// - parameters:
/// - derEncoded: The ASN.1 node representing this object.
/// - identifier: The ASN.1 identifier that `derEncoded` is expected to have.
init(derEncoded: ASN1Node, withIdentifier identifier: ASN1Identifier) throws
/// Serialize this object into DER-encoded ASN.1 form.
///
/// - parameters:
/// - coder: A serializer to be used to encode the object.
/// - identifier: The ASN.1 identifier that this object should use to represent itself.
func serialize(into coder: inout DER.Serializer, withIdentifier identifier: ASN1Identifier) throws
}
extension DERImplicitlyTaggable {
/// Initialize this object as one element of a constructed ASN.1 object.
///
/// This is a helper function for parsing constructed ASN.1 objects. It delegates all its functionality
/// to ``DERImplicitlyTaggable/init(derEncoded:withIdentifier:)-7e88k``.
///
/// - parameters:
/// - derEncoded: The sequence of nodes that make up this object's parent. The first node in this collection
/// will be used to construct this object.
/// - identifier: The ASN.1 identifier that `derEncoded` is expected to have.
@inlinable
public init(
derEncoded sequenceNodeIterator: inout ASN1NodeCollection.Iterator,
withIdentifier identifier: ASN1Identifier = Self.defaultIdentifier
) throws {
guard let node = sequenceNodeIterator.next() else {
throw ASN1Error.invalidASN1Object(reason: "Unable to decode \(Self.self), no ASN.1 nodes to decode")
}
self = try .init(derEncoded: node, withIdentifier: identifier)
}
/// Initialize this object from a serialized DER representation.
///
/// - parameters:
/// - derEncoded: The DER-encoded bytes representing this object.
/// - identifier: The ASN.1 identifier that `derEncoded` is expected to have.
@inlinable
public init(derEncoded: [UInt8], withIdentifier identifier: ASN1Identifier = Self.defaultIdentifier) throws {
self = try .init(derEncoded: DER.parse(derEncoded), withIdentifier: identifier)
}
/// Initialize this object from a serialized DER representation.
///
/// - parameters:
/// - derEncoded: The DER-encoded bytes representing this object.
/// - identifier: The ASN.1 identifier that `derEncoded` is expected to have.
@inlinable
public init(
derEncoded: ArraySlice<UInt8>,
withIdentifier identifier: ASN1Identifier = Self.defaultIdentifier
) throws {
self = try .init(derEncoded: DER.parse(derEncoded), withIdentifier: identifier)
}
@inlinable
public init(derEncoded: ASN1Node) throws {
try self.init(derEncoded: derEncoded, withIdentifier: Self.defaultIdentifier)
}
@inlinable
public func serialize(into coder: inout DER.Serializer) throws {
try self.serialize(into: &coder, withIdentifier: Self.defaultIdentifier)
}
}
extension ArraySlice where Element == UInt8 {
@inlinable
mutating func _readASN1Length() throws -> UInt? {
guard let firstByte = self.popFirst() else {
return nil
}
switch firstByte {
case 0x80:
// Indefinite form. Unsupported.
throw ASN1Error.unsupportedFieldLength(reason: "Indefinite form of field length not supported in DER.")
case let val where val & 0x80 == 0x80:
// Top bit is set, this is the long form. The remaining 7 bits of this octet
// determine how long the length field is.
let fieldLength = Int(val & 0x7F)
guard self.count >= fieldLength else {
return nil
}
// We need to read the length bytes
let lengthBytes = self.prefix(fieldLength)
self = self.dropFirst(fieldLength)
let length = try UInt(bigEndianBytes: lengthBytes)
// DER requires that we enforce that the length field was encoded in the minimum number of octets necessary.
let requiredBits = UInt.bitWidth - length.leadingZeroBitCount
switch requiredBits {
case 0...7:
// For 0 to 7 bits, the long form is unacceptable and we require the short.
throw ASN1Error.unsupportedFieldLength(
reason: "Field length encoded in long form, but DER requires \(length) to be encoded in short form"
)
case 8...:
// For 8 or more bits, fieldLength should be the minimum required.
let requiredBytes = (requiredBits + 7) / 8
if fieldLength > requiredBytes {
throw ASN1Error.unsupportedFieldLength(reason: "Field length encoded in excessive number of bytes")
}
default:
// This is not reachable, but we'll error anyway.
throw ASN1Error.unsupportedFieldLength(
reason: "Correctness error: computed required bits as \(requiredBits)"
)
}
return length
case let val:
// Short form, the length is only one 7-bit integer.
return UInt(val)
}
}
}
extension FixedWidthInteger {
@inlinable
internal init<Bytes: Collection>(bigEndianBytes bytes: Bytes) throws where Bytes.Element == UInt8 {
guard bytes.count <= (Self.bitWidth / 8) else {
throw ASN1Error.invalidASN1Object(reason: "Unable to treat \(bytes.count) bytes as a \(Self.self)")
}
self = 0
// Unchecked subtraction because bytes.count must be positive, so we can safely subtract 8 after the
// multiply. The same logic applies to the math in the loop. Finally, the multiply can be unchecked because
// we know that bytes.count is less than or equal to bitWidth / 8, so multiplying by 8 cannot possibly overflow.
var shift = (bytes.count &* 8) &- 8
var index = bytes.startIndex
while shift >= 0 {
self |= Self(truncatingIfNeeded: bytes[index]) << shift
bytes.formIndex(after: &index)
shift &-= 8
}
}
}
extension Array where Element == UInt8 {
@inlinable
mutating func _moveRange(offset: Int, range: Range<Index>) {
// We only bothered to implement this for positive offsets for now, the algorithm
// generalises.
precondition(offset > 0)
let distanceFromEndOfRangeToEndOfSelf = self.distance(from: range.endIndex, to: self.endIndex)
if distanceFromEndOfRangeToEndOfSelf < offset {
// We begin by writing some zeroes out to the size we need.
for _ in 0..<(offset - distanceFromEndOfRangeToEndOfSelf) {
self.append(0)
}
}
// Now we walk the range backwards, moving the elements.
for index in range.reversed() {
self[index + offset] = self[index]
}
}
}
extension Int {
@inlinable
var _bytesNeededToEncode: Int {
// ASN.1 lengths are in two forms. If we can store the length in 7 bits, we should:
// that requires only one byte. Otherwise, we need multiple bytes: work out how many,
// plus one for the length of the length bytes.
guard self <= 0x7F else {
// We need to work out how many bytes we need. There are many fancy bit-twiddling
// ways of doing this, but honestly we don't do this enough to need them, so we'll
// do it the easy way. This math is done on UInt because it makes the shift semantics clean.
// We save a branch here because we can never overflow this addition.
return UInt(self).neededBytes &+ 1
}
return 1
}
}
extension FixedWidthInteger {
// Bytes needed to store a given integer.
@inlinable
internal var neededBytes: Int {
let neededBits = self.bitWidth - self.leadingZeroBitCount
return (neededBits + 7) / 8
}
}
extension ASN1NodeCollection {
@inlinable
func isOrderedAccordingToSetOfSemantics() -> Bool {
var iterator = self.makeIterator()
guard let first = iterator.next() else {
return true
}
var previousElement = first
while let nextElement = iterator.next() {
guard asn1SetElementLessThanOrEqual(previousElement.encodedBytes, nextElement.encodedBytes) else {
return false
}
previousElement = nextElement
}
return true
}
}
@inlinable
func asn1SetElementLessThan(_ lhs: ArraySlice<UInt8>, _ rhs: ArraySlice<UInt8>) -> Bool {
for (leftByte, rightByte) in zip(lhs, rhs) {
if leftByte < rightByte {
// true means left comes before right
return true
} else if rightByte < leftByte {
// Right comes after left
return false
}
}
// We got to the end of the shorter element, so all current elements are equal.
// If lhs is shorter, it comes earlier, _unless_ all of rhs's trailing elements are zero.
let trailing = rhs.dropFirst(lhs.count)
if trailing.allSatisfy({ $0 == 0 }) {
// Must return false when the two elements are equal.
return false
}
return true
}
@inlinable
func asn1SetElementLessThanOrEqual(_ lhs: ArraySlice<UInt8>, _ rhs: ArraySlice<UInt8>) -> Bool {
// https://github.com/apple/swift/blob/43c5824be892967993f4d0111206764eceeffb67/stdlib/public/core/Comparable.swift#L202
!asn1SetElementLessThan(rhs, lhs)
}
|