Press n or j to go to the next uncovered block, b, p or k for the previous block.
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 | 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 5034x 5034x 5034x 5034x 5034x 5034x 43x 43x 473293x 473293x 473293x 456204x 456204x 456204x 473293x 43x 43x 43x 43x 43x 43x 43x 175x 175x 175x 37x 175x 148x 148x 148x 148x 148x 148x 148x 148x 27x 27x 27x 175x 43x 6398x 6398x 6398x 6398x 6398x 6396x 6396x 1x 6398x 43x 2174x 2174x 2174x 2173x 2174x 2172x 2174x 1x 2174x 2171x 2171x 2171x 2171x 2170x 2174x 55x 2174x 2115x 2115x 2115x 2115x 2169x 2174x 57x 2174x 2112x 2112x 2112x 2112x 2168x 2174x 2174x 2161x 2169x 1x 1x 1x 1x 2160x 2160x 2174x 43x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 196371x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 175x 175x 175x 175x 94x 1x 1x 93x 93x 81x 175x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 169750x 169750x 12052x 169750x 12024x 12024x 9324x 12024x 12024x 12024x 12024x 3x 3x 9321x 9321x 9321x 9347x 20x 47x 3x 3x 1x 1x 3x 12024x 47x 47x 47x 47x 47x 47x 43x 43x 43x 43x 43x 43x 43x 43x 43x 57x 57x 57x 57x 43x 43x 43x 43x 43x 43x 43x 43x 43x 522365x 522365x 56x 56x 43x 43x 43x 43x 43x 43x 43x 16652x 16652x 1354x 1354x 1354x 15273x 43x 43x 43x 43x 43x 43x 43x 489181x 489181x 43x 43x 43x 43x 43x 43x 43x 43x 16401x 16401x 43x 43x 43x 43x 131x 131x 131x 131x 43x 43x 43x 43x 489166x 489166x 97x 97x 489166x 310407x 310407x 310407x 310407x 310407x 310407x 310407x 178662x 489166x 43x 154151x 154151x 154151x 154151x 154151x 153799x 153799x 154151x 153799x 153799x 154151x 14x 14x 14x 153799x 153799x 153799x 154151x 43x 157699x 157699x 157699x 22483x 22483x 22243x 22243x 157699x 135216x 135216x 135216x 135215x 135216x 135216x 154141x 157699x 43x 2700x 2700x 2700x 1893x 2700x 807x 807x 807x 807x 2700x 2700x 2700x 2700x 2700x 2696x 2699x 1912x 2700x 784x 784x 784x 770x 770x 784x 14x 14x 784x 2693x 2693x 2700x 43x 9297x 9297x 9297x 9290x 9087x 9087x 9087x 9087x 9087x 9087x 9087x 9087x 203x 9297x 43x 9321x 9321x 9299x 3x 3x 9296x 9296x 21x 9321x 1x 1x 9321x 43x 43x 43x 43x 2254x 43x 43x 43x 100x 2x 2x 98x 99x 1x 1x 97x 99x 2x 2x 95x 95x 43x 43x 43x 85837x 85837x 43x 43x 43x 43x 17389x 17389x 17389x 17389x 17202x 17389x 12064x 12064x 43848x 41266x 41266x 43848x 17344x 5138x 5138x 17201x 17201x 17201x 17358x 194214x 194214x 3x 3x 3x 3x 3x 194211x 194211x 17198x 17198x 17358x 3x 3x 3x 3x 3x 17198x 17198x 43x 43x 638x 638x 638x 638x 638x 638x 638x 638x 638x 638x 43x 43x 43x 43x 43x 43x 43x 43x 43x 789x 43x 43x 43x 43x 43x 43x 43x 43x 90x 43x 43x 43x 43x 43x 43x 43x 43x 4x 43x 43x 43x 43x 43x 43x 43x 43x 16x 43x 43x 43x 43x 43x 43x 43x 43x 2x 2x 2x 2x 2x 43x 43x 43x 43x 43x 43x 43x 43x 2x 2x 2x 2x 2x 43x 43x 43x 43x 43x 43x 43x 43x 43x 1x 1x 1x 1x 1x 43x 43x 43x 43x 43x 43x 43x 43x 5x 5x 5x 5x 5x 43x 43x 206408x 206408x 206408x 206408x 182804x 182734x 16x 61x 59x 4x 206408x 3809x 3706x 64x 20x 36x 33x 33x 3x 206408x 204x 204x 204x 5x 206408x 41x 41x 41x 3x 206408x 6769x 6769x 1637x 19x 6769x 6769x 121x 4x 206408x 12483x 12483x 5x 206408x 290x 290x 290x 3x 206408x 206408x 43x 20907x 20907x 169x 165x 165x 4x 4x 4x 4x 4x 20738x 20738x 20738x 20757x 20715x 20757x 7481x 7481x 7470x 7470x 7481x 13245x 20907x 43x 43x 43x 43x 43x 43x 43x 43x 14x 14x 13x 14x 43x 43x 43x 43x 43x 3x 3x 2x 3x 43x 43x 43x 43x 2174x 43x 43x 43x 43x 43x 43x 43x 85522x 21554x 21554x 63968x 63968x 63968x 63968x 85522x 60259x 60259x 60252x 60252x 63961x 85522x 85522x 3754x 3754x 63961x 63961x 85486x 63058x 63058x 85486x 63050x 63050x 63050x 85467x 63038x 63038x 43x 43x 43x 139x 1x 1x 1x 138x 138x 139x 137x 137x 139x 135x 139x 43x 43x 43x 43x 43x 236x 236x 236x 236x 236x 236x 236x 236x 236x 235x 235x 235x 235x 235x 3x 3x 235x 235x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 235x 236x 43x 43x 43x 43x 56x 56x 56x 56x 56x 2x 2x 54x 55x 27x 27x 29x 26x 26x 22x 22x 29x 17x 17x 16x 16x 29x 12x 12x 15x 15x 29x 5x 5x 14x 14x 29x 11x 29x 9x 9x 9x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 1178x 1178x 1178x 1178x 29x 29x 1177x 19x 1147x 14x 14x 1176x 1176x 1176x 1177x 257x 257x 1176x 1176x 1176x 1177x 1126x 1126x 1126x 1177x 203x 203x 1126x 1177x 910x 910x 909x 909x 216x 1163x 210x 210x 210x 210x 6x 6x 6x 6x 1178x 43x 43x 1064x 43x 43x 43x 114x 43x 43x 43x 516x 43x 43x 43x 43x 43x 43x 43x 4952x 43x 43x 6306x 6306x 1592x 80x 80x 80x 1592x 92x 92x 92x 1592x 1592x 1592x 5x 5x 5x 1587x 1592x 6x 6x 1592x 1330x 1330x 1322x 1322x 1318x 1318x 1330x 2x 2x 1330x 6306x 4714x 4714x 6301x 6306x 310x 310x 6306x 5991x 5991x 5991x 17x 5991x 5971x 5971x 5983x 5991x 5991x 6194x 6194x 6305x 6019x 6019x 6019x 6019x 6019x 6018x 6018x 6305x 175x 175x 6x 6x 175x 6187x 6187x 6306x 43x 43x 1801x 1801x 13x 13x 1788x 1801x 21x 21x 21x 21x 21x 1796x 1767x 1767x 1767x 1767x 1767x 1266x 1767x 40x 40x 493x 453x 453x 453x 453x 1767x 1780x 1780x 1796x 458x 458x 458x 531x 448x 43x 43x 43x 26x 25x 25x 25x 25x 25x 1x 43x 43x 361845x 361845x 361845x 361845x 361845x 156206x 156206x 361845x 40x 40x 40x 212897x 196830x 196830x 361845x 361845x 43x 43x 186662x 186662x 186662x 186662x 186662x 43x 43x 43x 186633x 43x 43x 423x 423x 423x 423x 423x 43x 43x 116x 116x 116x 116x 116x 116x 116x 112x 112x 112x 112x 2x 43x 43x 43x 52x 52x 52x 52x 52x 52x 52x 47x 77x 77x 77x 47x 47x 2x 43x 43x 43x 6x 6x 6x 6x 6x 6x 6x 2x 4x 4x 4x 4x 4x 2x 2x 2x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 15x 1x 1x 1x 15x 13x 15x 15x 15x 15x 15x 2x 2x 2x 2x 2x 2x 2x 43x 43x 43x 672x 672x 672x 672x 672x 1x 1x 671x 671x 3773x 3773x 3773x 664x 664x 672x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 308x 308x 308x 308x 308x 1x 1x 307x 307x 307x 307x 308x 1582x 1582x 1582x 1582x 1582x 1549x 1549x 1549x 1582x 4x 4x 1582x 302x 302x 307x 14x 14x 14x 14x 288x 288x 308x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x 43x | // Copyright Joyent, Inc. and other Node contributors. // // Permission is hereby granted, free of charge, to any person obtaining a // copy of this software and associated documentation files (the // "Software"), to deal in the Software without restriction, including // without limitation the rights to use, copy, modify, merge, publish, // distribute, sublicense, and/or sell copies of the Software, and to permit // persons to whom the Software is furnished to do so, subject to the // following conditions: // // The above copyright notice and this permission notice shall be included // in all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE // USE OR OTHER DEALINGS IN THE SOFTWARE. 'use strict'; const { Array, ArrayFrom, ArrayIsArray, ArrayPrototypeForEach, ArrayPrototypeIndexOf, MathFloor, MathMin, MathTrunc, NumberIsNaN, NumberMAX_SAFE_INTEGER, NumberMIN_SAFE_INTEGER, ObjectCreate, ObjectDefineProperties, ObjectDefineProperty, ObjectSetPrototypeOf, RegExpPrototypeSymbolReplace, StringPrototypeCharCodeAt, StringPrototypeSlice, StringPrototypeToLowerCase, StringPrototypeTrim, SymbolSpecies, SymbolToPrimitive, TypedArrayPrototypeGetByteLength, TypedArrayPrototypeFill, TypedArrayPrototypeSet, Uint8Array, Uint8ArrayPrototype, } = primordials; const { byteLengthUtf8, compare: _compare, compareOffset, createFromString, fill: bindingFill, indexOfBuffer, indexOfNumber, indexOfString, swap16: _swap16, swap32: _swap32, swap64: _swap64, kMaxLength, kStringMaxLength } = internalBinding('buffer'); const { getOwnNonIndexProperties, propertyFilter: { ALL_PROPERTIES, ONLY_ENUMERABLE }, } = internalBinding('util'); const { customInspectSymbol, isInsideNodeModules, lazyDOMException, normalizeEncoding, kIsEncodingSymbol } = require('internal/util'); const { isAnyArrayBuffer, isArrayBufferView, isUint8Array } = require('internal/util/types'); const { inspect: utilInspect } = require('internal/util/inspect'); const { encodings } = internalBinding('string_decoder'); const { codes: { ERR_BUFFER_OUT_OF_BOUNDS, ERR_INVALID_ARG_TYPE, ERR_INVALID_ARG_VALUE, ERR_INVALID_BUFFER_SIZE, ERR_OUT_OF_RANGE, ERR_MISSING_ARGS, ERR_UNKNOWN_ENCODING }, genericNodeError, hideStackFrames, } = require('internal/errors'); const { validateArray, validateBuffer, validateNumber, validateInteger, validateString } = require('internal/validators'); // Provide validateInteger() but with kMaxLength as the default maximum value. const validateOffset = (value, name, min = 0, max = kMaxLength) => validateInteger(value, name, min, max); const { FastBuffer, markAsUntransferable, addBufferPrototypeMethods, createUnsafeBuffer } = require('internal/buffer'); const { Blob, resolveObjectURL, } = require('internal/blob'); FastBuffer.prototype.constructor = Buffer; Buffer.prototype = FastBuffer.prototype; addBufferPrototypeMethods(Buffer.prototype); const constants = ObjectDefineProperties({}, { MAX_LENGTH: { __proto__: null, value: kMaxLength, writable: false, enumerable: true }, MAX_STRING_LENGTH: { __proto__: null, value: kStringMaxLength, writable: false, enumerable: true } }); Buffer.poolSize = 8 * 1024; let poolSize, poolOffset, allocPool; const encodingsMap = ObjectCreate(null); for (let i = 0; i < encodings.length; ++i) encodingsMap[encodings[i]] = i; function createPool() { poolSize = Buffer.poolSize; allocPool = createUnsafeBuffer(poolSize).buffer; markAsUntransferable(allocPool); poolOffset = 0; } createPool(); function alignPool() { // Ensure aligned slices if (poolOffset & 0x7) { poolOffset |= 0x7; poolOffset++; } } let bufferWarningAlreadyEmitted = false; let nodeModulesCheckCounter = 0; const bufferWarning = 'Buffer() is deprecated due to security and usability ' + 'issues. Please use the Buffer.alloc(), ' + 'Buffer.allocUnsafe(), or Buffer.from() methods instead.'; function showFlaggedDeprecation() { if (bufferWarningAlreadyEmitted || ++nodeModulesCheckCounter > 10000 || (!require('internal/options').getOptionValue('--pending-deprecation') && isInsideNodeModules())) { // We don't emit a warning, because we either: // - Already did so, or // - Already checked too many times whether a call is coming // from node_modules and want to stop slowing down things, or // - We aren't running with `--pending-deprecation` enabled, // and the code is inside `node_modules`. return; } process.emitWarning(bufferWarning, 'DeprecationWarning', 'DEP0005'); bufferWarningAlreadyEmitted = true; } function toInteger(n, defaultVal) { n = +n; if (!NumberIsNaN(n) && n >= NumberMIN_SAFE_INTEGER && n <= NumberMAX_SAFE_INTEGER) { return ((n % 1) === 0 ? n : MathFloor(n)); } return defaultVal; } function _copy(source, target, targetStart, sourceStart, sourceEnd) { if (!isUint8Array(source)) throw new ERR_INVALID_ARG_TYPE('source', ['Buffer', 'Uint8Array'], source); if (!isUint8Array(target)) throw new ERR_INVALID_ARG_TYPE('target', ['Buffer', 'Uint8Array'], target); if (targetStart === undefined) { targetStart = 0; } else { targetStart = toInteger(targetStart, 0); if (targetStart < 0) throw new ERR_OUT_OF_RANGE('targetStart', '>= 0', targetStart); } if (sourceStart === undefined) { sourceStart = 0; } else { sourceStart = toInteger(sourceStart, 0); if (sourceStart < 0) throw new ERR_OUT_OF_RANGE('sourceStart', '>= 0', sourceStart); } if (sourceEnd === undefined) { sourceEnd = source.length; } else { sourceEnd = toInteger(sourceEnd, 0); if (sourceEnd < 0) throw new ERR_OUT_OF_RANGE('sourceEnd', '>= 0', sourceEnd); } if (targetStart >= target.length || sourceStart >= sourceEnd) return 0; if (sourceStart > source.length) { throw new ERR_OUT_OF_RANGE('sourceStart', `<= ${source.length}`, sourceStart); } return _copyActual(source, target, targetStart, sourceStart, sourceEnd); } function _copyActual(source, target, targetStart, sourceStart, sourceEnd) { if (sourceEnd - sourceStart > target.length - targetStart) sourceEnd = sourceStart + target.length - targetStart; let nb = sourceEnd - sourceStart; const sourceLen = source.length - sourceStart; if (nb > sourceLen) nb = sourceLen; if (sourceStart !== 0 || sourceEnd < source.length) source = new Uint8Array(source.buffer, source.byteOffset + sourceStart, nb); TypedArrayPrototypeSet(target, source, targetStart); return nb; } /** * The Buffer() constructor is deprecated in documentation and should not be * used moving forward. Rather, developers should use one of the three new * factory APIs: Buffer.from(), Buffer.allocUnsafe() or Buffer.alloc() based on * their specific needs. There is no runtime deprecation because of the extent * to which the Buffer constructor is used in the ecosystem currently -- a * runtime deprecation would introduce too much breakage at this time. It's not * likely that the Buffer constructors would ever actually be removed. * Deprecation Code: DEP0005 */ function Buffer(arg, encodingOrOffset, length) { showFlaggedDeprecation(); // Common case. if (typeof arg === 'number') { if (typeof encodingOrOffset === 'string') { throw new ERR_INVALID_ARG_TYPE('string', 'string', arg); } return Buffer.alloc(arg); } return Buffer.from(arg, encodingOrOffset, length); } ObjectDefineProperty(Buffer, SymbolSpecies, { __proto__: null, enumerable: false, configurable: true, get() { return FastBuffer; } }); /** * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError * if value is a number. * Buffer.from(str[, encoding]) * Buffer.from(array) * Buffer.from(buffer) * Buffer.from(arrayBuffer[, byteOffset[, length]]) */ Buffer.from = function from(value, encodingOrOffset, length) { if (typeof value === 'string') return fromString(value, encodingOrOffset); if (typeof value === 'object' && value !== null) { if (isAnyArrayBuffer(value)) return fromArrayBuffer(value, encodingOrOffset, length); const valueOf = value.valueOf && value.valueOf(); if (valueOf != null && valueOf !== value && (typeof valueOf === 'string' || typeof valueOf === 'object')) { return from(valueOf, encodingOrOffset, length); } const b = fromObject(value); if (b) return b; if (typeof value[SymbolToPrimitive] === 'function') { const primitive = value[SymbolToPrimitive]('string'); if (typeof primitive === 'string') { return fromString(primitive, encodingOrOffset); } } } throw new ERR_INVALID_ARG_TYPE( 'first argument', ['string', 'Buffer', 'ArrayBuffer', 'Array', 'Array-like Object'], value ); }; // Identical to the built-in %TypedArray%.of(), but avoids using the deprecated // Buffer() constructor. Must use arrow function syntax to avoid automatically // adding a `prototype` property and making the function a constructor. // // Refs: https://tc39.github.io/ecma262/#sec-%typedarray%.of // Refs: https://esdiscuss.org/topic/isconstructor#content-11 const of = (...items) => { const newObj = createUnsafeBuffer(items.length); for (let k = 0; k < items.length; k++) newObj[k] = items[k]; return newObj; }; Buffer.of = of; ObjectSetPrototypeOf(Buffer, Uint8Array); // The 'assertSize' method will remove itself from the callstack when an error // occurs. This is done simply to keep the internal details of the // implementation from bleeding out to users. const assertSize = hideStackFrames((size) => { validateNumber(size, 'size'); if (!(size >= 0 && size <= kMaxLength)) { throw new ERR_INVALID_ARG_VALUE.RangeError('size', size); } }); /** * Creates a new filled Buffer instance. * alloc(size[, fill[, encoding]]) */ Buffer.alloc = function alloc(size, fill, encoding) { assertSize(size); if (fill !== undefined && fill !== 0 && size > 0) { const buf = createUnsafeBuffer(size); return _fill(buf, fill, 0, buf.length, encoding); } return new FastBuffer(size); }; /** * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer * instance. If `--zero-fill-buffers` is set, will zero-fill the buffer. */ Buffer.allocUnsafe = function allocUnsafe(size) { assertSize(size); return allocate(size); }; /** * Equivalent to SlowBuffer(num), by default creates a non-zero-filled * Buffer instance that is not allocated off the pre-initialized pool. * If `--zero-fill-buffers` is set, will zero-fill the buffer. */ Buffer.allocUnsafeSlow = function allocUnsafeSlow(size) { assertSize(size); return createUnsafeBuffer(size); }; // If --zero-fill-buffers command line argument is set, a zero-filled // buffer is returned. function SlowBuffer(length) { assertSize(length); return createUnsafeBuffer(length); } ObjectSetPrototypeOf(SlowBuffer.prototype, Uint8ArrayPrototype); ObjectSetPrototypeOf(SlowBuffer, Uint8Array); function allocate(size) { if (size <= 0) { return new FastBuffer(); } if (size < (Buffer.poolSize >>> 1)) { if (size > (poolSize - poolOffset)) createPool(); const b = new FastBuffer(allocPool, poolOffset, size); poolOffset += size; alignPool(); return b; } return createUnsafeBuffer(size); } function fromStringFast(string, ops) { const length = ops.byteLength(string); if (length >= (Buffer.poolSize >>> 1)) return createFromString(string, ops.encodingVal); if (length > (poolSize - poolOffset)) createPool(); let b = new FastBuffer(allocPool, poolOffset, length); const actual = ops.write(b, string, 0, length); if (actual !== length) { // byteLength() may overestimate. That's a rare case, though. b = new FastBuffer(allocPool, poolOffset, actual); } poolOffset += actual; alignPool(); return b; } function fromString(string, encoding) { let ops; if (typeof encoding !== 'string' || encoding.length === 0) { if (string.length === 0) return new FastBuffer(); ops = encodingOps.utf8; encoding = undefined; } else { ops = getEncodingOps(encoding); if (ops === undefined) throw new ERR_UNKNOWN_ENCODING(encoding); if (string.length === 0) return new FastBuffer(); } return fromStringFast(string, ops); } function fromArrayBuffer(obj, byteOffset, length) { // Convert byteOffset to integer if (byteOffset === undefined) { byteOffset = 0; } else { byteOffset = +byteOffset; if (NumberIsNaN(byteOffset)) byteOffset = 0; } const maxLength = obj.byteLength - byteOffset; if (maxLength < 0) throw new ERR_BUFFER_OUT_OF_BOUNDS('offset'); if (length === undefined) { length = maxLength; } else { // Convert length to non-negative integer. length = +length; if (length > 0) { if (length > maxLength) throw new ERR_BUFFER_OUT_OF_BOUNDS('length'); } else { length = 0; } } return new FastBuffer(obj, byteOffset, length); } function fromArrayLike(obj) { if (obj.length <= 0) return new FastBuffer(); if (obj.length < (Buffer.poolSize >>> 1)) { if (obj.length > (poolSize - poolOffset)) createPool(); const b = new FastBuffer(allocPool, poolOffset, obj.length); TypedArrayPrototypeSet(b, obj, 0); poolOffset += obj.length; alignPool(); return b; } return new FastBuffer(obj); } function fromObject(obj) { if (obj.length !== undefined || isAnyArrayBuffer(obj.buffer)) { if (typeof obj.length !== 'number') { return new FastBuffer(); } return fromArrayLike(obj); } if (obj.type === 'Buffer' && ArrayIsArray(obj.data)) { return fromArrayLike(obj.data); } } // Static methods Buffer.isBuffer = function isBuffer(b) { return b instanceof Buffer; }; Buffer.compare = function compare(buf1, buf2) { if (!isUint8Array(buf1)) { throw new ERR_INVALID_ARG_TYPE('buf1', ['Buffer', 'Uint8Array'], buf1); } if (!isUint8Array(buf2)) { throw new ERR_INVALID_ARG_TYPE('buf2', ['Buffer', 'Uint8Array'], buf2); } if (buf1 === buf2) { return 0; } return _compare(buf1, buf2); }; Buffer.isEncoding = function isEncoding(encoding) { return typeof encoding === 'string' && encoding.length !== 0 && normalizeEncoding(encoding) !== undefined; }; Buffer[kIsEncodingSymbol] = Buffer.isEncoding; Buffer.concat = function concat(list, length) { validateArray(list, 'list'); if (list.length === 0) return new FastBuffer(); if (length === undefined) { length = 0; for (let i = 0; i < list.length; i++) { if (list[i].length) { length += list[i].length; } } } else { validateOffset(length, 'length'); } const buffer = Buffer.allocUnsafe(length); let pos = 0; for (let i = 0; i < list.length; i++) { const buf = list[i]; if (!isUint8Array(buf)) { // TODO(BridgeAR): This should not be of type ERR_INVALID_ARG_TYPE. // Instead, find the proper error code for this. throw new ERR_INVALID_ARG_TYPE( `list[${i}]`, ['Buffer', 'Uint8Array'], list[i]); } pos += _copyActual(buf, buffer, pos, 0, buf.length); } // Note: `length` is always equal to `buffer.length` at this point if (pos < length) { // Zero-fill the remaining bytes if the specified `length` was more than // the actual total length, i.e. if we have some remaining allocated bytes // there were not initialized. TypedArrayPrototypeFill(buffer, 0, pos, length); } return buffer; }; function base64ByteLength(str, bytes) { // Handle padding if (StringPrototypeCharCodeAt(str, bytes - 1) === 0x3D) bytes--; if (bytes > 1 && StringPrototypeCharCodeAt(str, bytes - 1) === 0x3D) bytes--; // Base64 ratio: 3/4 return (bytes * 3) >>> 2; } const encodingOps = { utf8: { encoding: 'utf8', encodingVal: encodingsMap.utf8, byteLength: byteLengthUtf8, write: (buf, string, offset, len) => buf.utf8Write(string, offset, len), slice: (buf, start, end) => buf.utf8Slice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfString(buf, val, byteOffset, encodingsMap.utf8, dir) }, ucs2: { encoding: 'ucs2', encodingVal: encodingsMap.utf16le, byteLength: (string) => string.length * 2, write: (buf, string, offset, len) => buf.ucs2Write(string, offset, len), slice: (buf, start, end) => buf.ucs2Slice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfString(buf, val, byteOffset, encodingsMap.utf16le, dir) }, utf16le: { encoding: 'utf16le', encodingVal: encodingsMap.utf16le, byteLength: (string) => string.length * 2, write: (buf, string, offset, len) => buf.ucs2Write(string, offset, len), slice: (buf, start, end) => buf.ucs2Slice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfString(buf, val, byteOffset, encodingsMap.utf16le, dir) }, latin1: { encoding: 'latin1', encodingVal: encodingsMap.latin1, byteLength: (string) => string.length, write: (buf, string, offset, len) => buf.latin1Write(string, offset, len), slice: (buf, start, end) => buf.latin1Slice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfString(buf, val, byteOffset, encodingsMap.latin1, dir) }, ascii: { encoding: 'ascii', encodingVal: encodingsMap.ascii, byteLength: (string) => string.length, write: (buf, string, offset, len) => buf.asciiWrite(string, offset, len), slice: (buf, start, end) => buf.asciiSlice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfBuffer(buf, fromStringFast(val, encodingOps.ascii), byteOffset, encodingsMap.ascii, dir) }, base64: { encoding: 'base64', encodingVal: encodingsMap.base64, byteLength: (string) => base64ByteLength(string, string.length), write: (buf, string, offset, len) => buf.base64Write(string, offset, len), slice: (buf, start, end) => buf.base64Slice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfBuffer(buf, fromStringFast(val, encodingOps.base64), byteOffset, encodingsMap.base64, dir) }, base64url: { encoding: 'base64url', encodingVal: encodingsMap.base64url, byteLength: (string) => base64ByteLength(string, string.length), write: (buf, string, offset, len) => buf.base64urlWrite(string, offset, len), slice: (buf, start, end) => buf.base64urlSlice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfBuffer(buf, fromStringFast(val, encodingOps.base64url), byteOffset, encodingsMap.base64url, dir) }, hex: { encoding: 'hex', encodingVal: encodingsMap.hex, byteLength: (string) => string.length >>> 1, write: (buf, string, offset, len) => buf.hexWrite(string, offset, len), slice: (buf, start, end) => buf.hexSlice(start, end), indexOf: (buf, val, byteOffset, dir) => indexOfBuffer(buf, fromStringFast(val, encodingOps.hex), byteOffset, encodingsMap.hex, dir) } }; function getEncodingOps(encoding) { encoding += ''; switch (encoding.length) { case 4: if (encoding === 'utf8') return encodingOps.utf8; if (encoding === 'ucs2') return encodingOps.ucs2; encoding = StringPrototypeToLowerCase(encoding); if (encoding === 'utf8') return encodingOps.utf8; if (encoding === 'ucs2') return encodingOps.ucs2; break; case 5: if (encoding === 'utf-8') return encodingOps.utf8; if (encoding === 'ascii') return encodingOps.ascii; if (encoding === 'ucs-2') return encodingOps.ucs2; encoding = StringPrototypeToLowerCase(encoding); if (encoding === 'utf-8') return encodingOps.utf8; if (encoding === 'ascii') return encodingOps.ascii; if (encoding === 'ucs-2') return encodingOps.ucs2; break; case 7: if (encoding === 'utf16le' || StringPrototypeToLowerCase(encoding) === 'utf16le') return encodingOps.utf16le; break; case 8: if (encoding === 'utf-16le' || StringPrototypeToLowerCase(encoding) === 'utf-16le') return encodingOps.utf16le; break; case 6: if (encoding === 'latin1' || encoding === 'binary') return encodingOps.latin1; if (encoding === 'base64') return encodingOps.base64; encoding = StringPrototypeToLowerCase(encoding); if (encoding === 'latin1' || encoding === 'binary') return encodingOps.latin1; if (encoding === 'base64') return encodingOps.base64; break; case 3: if (encoding === 'hex' || StringPrototypeToLowerCase(encoding) === 'hex') return encodingOps.hex; break; case 9: if (encoding === 'base64url' || StringPrototypeToLowerCase(encoding) === 'base64url') return encodingOps.base64url; break; } } function byteLength(string, encoding) { if (typeof string !== 'string') { if (isArrayBufferView(string) || isAnyArrayBuffer(string)) { return string.byteLength; } throw new ERR_INVALID_ARG_TYPE( 'string', ['string', 'Buffer', 'ArrayBuffer'], string ); } const len = string.length; if (len === 0) return 0; if (encoding) { const ops = getEncodingOps(encoding); if (ops) { return ops.byteLength(string); } } return byteLengthUtf8(string); } Buffer.byteLength = byteLength; // For backwards compatibility. ObjectDefineProperty(Buffer.prototype, 'parent', { __proto__: null, enumerable: true, get() { if (!(this instanceof Buffer)) return undefined; return this.buffer; } }); ObjectDefineProperty(Buffer.prototype, 'offset', { __proto__: null, enumerable: true, get() { if (!(this instanceof Buffer)) return undefined; return this.byteOffset; } }); Buffer.prototype.copy = function copy(target, targetStart, sourceStart, sourceEnd) { return _copy(this, target, targetStart, sourceStart, sourceEnd); }; // No need to verify that "buf.length <= MAX_UINT32" since it's a read-only // property of a typed array. // This behaves neither like String nor Uint8Array in that we set start/end // to their upper/lower bounds if the value passed is out of range. Buffer.prototype.toString = function toString(encoding, start, end) { if (arguments.length === 0) { return this.utf8Slice(0, this.length); } const len = this.length; if (start <= 0) start = 0; else if (start >= len) return ''; else start |= 0; if (end === undefined || end > len) end = len; else end |= 0; if (end <= start) return ''; if (encoding === undefined) return this.utf8Slice(start, end); const ops = getEncodingOps(encoding); if (ops === undefined) throw new ERR_UNKNOWN_ENCODING(encoding); return ops.slice(this, start, end); }; Buffer.prototype.equals = function equals(otherBuffer) { if (!isUint8Array(otherBuffer)) { throw new ERR_INVALID_ARG_TYPE( 'otherBuffer', ['Buffer', 'Uint8Array'], otherBuffer); } if (this === otherBuffer) return true; if (this.byteLength !== otherBuffer.byteLength) return false; return this.byteLength === 0 || _compare(this, otherBuffer) === 0; }; let INSPECT_MAX_BYTES = 50; // Override how buffers are presented by util.inspect(). Buffer.prototype[customInspectSymbol] = function inspect(recurseTimes, ctx) { const max = INSPECT_MAX_BYTES; const actualMax = MathMin(max, this.length); const remaining = this.length - max; let str = StringPrototypeTrim(RegExpPrototypeSymbolReplace( /(.{2})/g, this.hexSlice(0, actualMax), '$1 ')); if (remaining > 0) str += ` ... ${remaining} more byte${remaining > 1 ? 's' : ''}`; // Inspect special properties as well, if possible. if (ctx) { let extras = false; const filter = ctx.showHidden ? ALL_PROPERTIES : ONLY_ENUMERABLE; const obj = ObjectCreate(null); ArrayPrototypeForEach(getOwnNonIndexProperties(this, filter), (key) => { extras = true; obj[key] = this[key]; }); if (extras) { if (this.length !== 0) str += ', '; // '[Object: null prototype] {'.length === 26 // This is guarded with a test. str += StringPrototypeSlice(utilInspect(obj, { ...ctx, breakLength: Infinity, compact: true }), 27, -2); } } return `<${this.constructor.name} ${str}>`; }; Buffer.prototype.inspect = Buffer.prototype[customInspectSymbol]; Buffer.prototype.compare = function compare(target, targetStart, targetEnd, sourceStart, sourceEnd) { if (!isUint8Array(target)) { throw new ERR_INVALID_ARG_TYPE('target', ['Buffer', 'Uint8Array'], target); } if (arguments.length === 1) return _compare(this, target); if (targetStart === undefined) targetStart = 0; else validateOffset(targetStart, 'targetStart'); if (targetEnd === undefined) targetEnd = target.length; else validateOffset(targetEnd, 'targetEnd', 0, target.length); if (sourceStart === undefined) sourceStart = 0; else validateOffset(sourceStart, 'sourceStart'); if (sourceEnd === undefined) sourceEnd = this.length; else validateOffset(sourceEnd, 'sourceEnd', 0, this.length); if (sourceStart >= sourceEnd) return (targetStart >= targetEnd ? 0 : -1); if (targetStart >= targetEnd) return 1; return compareOffset(this, target, targetStart, sourceStart, targetEnd, sourceEnd); }; // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`, // OR the last index of `val` in `buffer` at offset <= `byteOffset`. // // Arguments: // - buffer - a Buffer to search // - val - a string, Buffer, or number // - byteOffset - an index into `buffer`; will be clamped to an int32 // - encoding - an optional encoding, relevant if val is a string // - dir - true for indexOf, false for lastIndexOf function bidirectionalIndexOf(buffer, val, byteOffset, encoding, dir) { validateBuffer(buffer); if (typeof byteOffset === 'string') { encoding = byteOffset; byteOffset = undefined; } else if (byteOffset > 0x7fffffff) { byteOffset = 0x7fffffff; } else if (byteOffset < -0x80000000) { byteOffset = -0x80000000; } // Coerce to Number. Values like null and [] become 0. byteOffset = +byteOffset; // If the offset is undefined, "foo", {}, coerces to NaN, search whole buffer. if (NumberIsNaN(byteOffset)) { byteOffset = dir ? 0 : (buffer.length || buffer.byteLength); } dir = !!dir; // Cast to bool. if (typeof val === 'number') return indexOfNumber(buffer, val >>> 0, byteOffset, dir); let ops; if (encoding === undefined) ops = encodingOps.utf8; else ops = getEncodingOps(encoding); if (typeof val === 'string') { if (ops === undefined) throw new ERR_UNKNOWN_ENCODING(encoding); return ops.indexOf(buffer, val, byteOffset, dir); } if (isUint8Array(val)) { const encodingVal = (ops === undefined ? encodingsMap.utf8 : ops.encodingVal); return indexOfBuffer(buffer, val, byteOffset, encodingVal, dir); } throw new ERR_INVALID_ARG_TYPE( 'value', ['number', 'string', 'Buffer', 'Uint8Array'], val ); } Buffer.prototype.indexOf = function indexOf(val, byteOffset, encoding) { return bidirectionalIndexOf(this, val, byteOffset, encoding, true); }; Buffer.prototype.lastIndexOf = function lastIndexOf(val, byteOffset, encoding) { return bidirectionalIndexOf(this, val, byteOffset, encoding, false); }; Buffer.prototype.includes = function includes(val, byteOffset, encoding) { return this.indexOf(val, byteOffset, encoding) !== -1; }; // Usage: // buffer.fill(number[, offset[, end]]) // buffer.fill(buffer[, offset[, end]]) // buffer.fill(string[, offset[, end]][, encoding]) Buffer.prototype.fill = function fill(value, offset, end, encoding) { return _fill(this, value, offset, end, encoding); }; function _fill(buf, value, offset, end, encoding) { if (typeof value === 'string') { if (offset === undefined || typeof offset === 'string') { encoding = offset; offset = 0; end = buf.length; } else if (typeof end === 'string') { encoding = end; end = buf.length; } const normalizedEncoding = normalizeEncoding(encoding); if (normalizedEncoding === undefined) { validateString(encoding, 'encoding'); throw new ERR_UNKNOWN_ENCODING(encoding); } if (value.length === 0) { // If value === '' default to zero. value = 0; } else if (value.length === 1) { // Fast path: If `value` fits into a single byte, use that numeric value. if (normalizedEncoding === 'utf8') { const code = StringPrototypeCharCodeAt(value, 0); if (code < 128) { value = code; } } else if (normalizedEncoding === 'latin1') { value = StringPrototypeCharCodeAt(value, 0); } } } else { encoding = undefined; } if (offset === undefined) { offset = 0; end = buf.length; } else { validateOffset(offset, 'offset'); // Invalid ranges are not set to a default, so can range check early. if (end === undefined) { end = buf.length; } else { validateOffset(end, 'end', 0, buf.length); } if (offset >= end) return buf; } if (typeof value === 'number') { // OOB check const byteLen = TypedArrayPrototypeGetByteLength(buf); const fillLength = end - offset; if (offset > end || fillLength + offset > byteLen) throw new ERR_BUFFER_OUT_OF_BOUNDS(); TypedArrayPrototypeFill(buf, value, offset, end); } else { const res = bindingFill(buf, value, offset, end, encoding); if (res < 0) { if (res === -1) throw new ERR_INVALID_ARG_VALUE('value', value); throw new ERR_BUFFER_OUT_OF_BOUNDS(); } } return buf; } Buffer.prototype.write = function write(string, offset, length, encoding) { // Buffer#write(string); if (offset === undefined) { return this.utf8Write(string, 0, this.length); } // Buffer#write(string, encoding) if (length === undefined && typeof offset === 'string') { encoding = offset; length = this.length; offset = 0; // Buffer#write(string, offset[, length][, encoding]) } else { validateOffset(offset, 'offset', 0, this.length); const remaining = this.length - offset; if (length === undefined) { length = remaining; } else if (typeof length === 'string') { encoding = length; length = remaining; } else { validateOffset(length, 'length', 0, this.length); if (length > remaining) length = remaining; } } if (!encoding) return this.utf8Write(string, offset, length); const ops = getEncodingOps(encoding); if (ops === undefined) throw new ERR_UNKNOWN_ENCODING(encoding); return ops.write(this, string, offset, length); }; Buffer.prototype.toJSON = function toJSON() { if (this.length > 0) { const data = new Array(this.length); for (let i = 0; i < this.length; ++i) data[i] = this[i]; return { type: 'Buffer', data }; } return { type: 'Buffer', data: [] }; }; function adjustOffset(offset, length) { // Use Math.trunc() to convert offset to an integer value that can be larger // than an Int32. Hence, don't use offset | 0 or similar techniques. offset = MathTrunc(offset); if (offset === 0) { return 0; } if (offset < 0) { offset += length; return offset > 0 ? offset : 0; } if (offset < length) { return offset; } return NumberIsNaN(offset) ? 0 : length; } Buffer.prototype.subarray = function subarray(start, end) { const srcLength = this.length; start = adjustOffset(start, srcLength); end = end !== undefined ? adjustOffset(end, srcLength) : srcLength; const newLength = end > start ? end - start : 0; return new FastBuffer(this.buffer, this.byteOffset + start, newLength); }; Buffer.prototype.slice = function slice(start, end) { return this.subarray(start, end); }; function swap(b, n, m) { const i = b[n]; b[n] = b[m]; b[m] = i; } Buffer.prototype.swap16 = function swap16() { // For Buffer.length < 128, it's generally faster to // do the swap in javascript. For larger buffers, // dropping down to the native code is faster. const len = this.length; if (len % 2 !== 0) throw new ERR_INVALID_BUFFER_SIZE('16-bits'); if (len < 128) { for (let i = 0; i < len; i += 2) swap(this, i, i + 1); return this; } return _swap16(this); }; Buffer.prototype.swap32 = function swap32() { // For Buffer.length < 192, it's generally faster to // do the swap in javascript. For larger buffers, // dropping down to the native code is faster. const len = this.length; if (len % 4 !== 0) throw new ERR_INVALID_BUFFER_SIZE('32-bits'); if (len < 192) { for (let i = 0; i < len; i += 4) { swap(this, i, i + 3); swap(this, i + 1, i + 2); } return this; } return _swap32(this); }; Buffer.prototype.swap64 = function swap64() { // For Buffer.length < 192, it's generally faster to // do the swap in javascript. For larger buffers, // dropping down to the native code is faster. const len = this.length; if (len % 8 !== 0) throw new ERR_INVALID_BUFFER_SIZE('64-bits'); if (len < 192) { for (let i = 0; i < len; i += 8) { swap(this, i, i + 7); swap(this, i + 1, i + 6); swap(this, i + 2, i + 5); swap(this, i + 3, i + 4); } return this; } return _swap64(this); }; Buffer.prototype.toLocaleString = Buffer.prototype.toString; let transcode; if (internalBinding('config').hasIntl) { const { icuErrName, transcode: _transcode } = internalBinding('icu'); // Transcodes the Buffer from one encoding to another, returning a new // Buffer instance. transcode = function transcode(source, fromEncoding, toEncoding) { if (!isUint8Array(source)) { throw new ERR_INVALID_ARG_TYPE('source', ['Buffer', 'Uint8Array'], source); } if (source.length === 0) return Buffer.alloc(0); fromEncoding = normalizeEncoding(fromEncoding) || fromEncoding; toEncoding = normalizeEncoding(toEncoding) || toEncoding; const result = _transcode(source, fromEncoding, toEncoding); if (typeof result !== 'number') return result; const code = icuErrName(result); const err = genericNodeError( `Unable to transcode Buffer [${code}]`, { code: code, errno: result } ); throw err; }; } function btoa(input) { // The implementation here has not been performance optimized in any way and // should not be. // Refs: https://github.com/nodejs/node/pull/38433#issuecomment-828426932 if (arguments.length === 0) { throw new ERR_MISSING_ARGS('input'); } input = `${input}`; for (let n = 0; n < input.length; n++) { if (input[n].charCodeAt(0) > 0xff) throw lazyDOMException('Invalid character', 'InvalidCharacterError'); } const buf = Buffer.from(input, 'latin1'); return buf.toString('base64'); } // Refs: https://infra.spec.whatwg.org/#forgiving-base64-decode const kForgivingBase64AllowedChars = [ // ASCII whitespace // Refs: https://infra.spec.whatwg.org/#ascii-whitespace 0x09, 0x0A, 0x0C, 0x0D, 0x20, // Uppercase letters ...ArrayFrom({ length: 26 }, (_, i) => StringPrototypeCharCodeAt('A') + i), // Lowercase letters ...ArrayFrom({ length: 26 }, (_, i) => StringPrototypeCharCodeAt('a') + i), // Decimal digits ...ArrayFrom({ length: 10 }, (_, i) => StringPrototypeCharCodeAt('0') + i), 0x2B, // + 0x2F, // / 0x3D, // = ]; function atob(input) { // The implementation here has not been performance optimized in any way and // should not be. // Refs: https://github.com/nodejs/node/pull/38433#issuecomment-828426932 if (arguments.length === 0) { throw new ERR_MISSING_ARGS('input'); } input = `${input}`; let nonAsciiWhitespaceCharCount = 0; for (let n = 0; n < input.length; n++) { const index = ArrayPrototypeIndexOf( kForgivingBase64AllowedChars, StringPrototypeCharCodeAt(input, n)); if (index > 4) { // The first 5 elements of `kForgivingBase64AllowedChars` are // ASCII whitespace char codes. nonAsciiWhitespaceCharCount++; } else if (index === -1) { throw lazyDOMException('Invalid character', 'InvalidCharacterError'); } } // See #3 - https://infra.spec.whatwg.org/#forgiving-base64 if (nonAsciiWhitespaceCharCount % 4 === 1) { throw lazyDOMException( 'The string to be decoded is not correctly encoded.', 'InvalidCharacterError'); } return Buffer.from(input, 'base64').toString('latin1'); } module.exports = { Blob, resolveObjectURL, Buffer, SlowBuffer, transcode, // Legacy kMaxLength, kStringMaxLength, btoa, atob, }; ObjectDefineProperties(module.exports, { constants: { __proto__: null, configurable: false, enumerable: true, value: constants }, INSPECT_MAX_BYTES: { __proto__: null, configurable: true, enumerable: true, get() { return INSPECT_MAX_BYTES; }, set(val) { INSPECT_MAX_BYTES = val; } } }); |