// ==UserScript==// @name         Rain Classroom PDF Direct Download// @name:zh-CN   雨课堂课件PDF下载工具// @namespace    https://www.pizyds.com/// @version      1.3.2// @description  Automatic generation of direct download PDF on Rain Classroom// @description:zh-CN 在雨课堂页面自动生成PDF版本课件提供下载// @author       PillarsZhang// @homepage     https://www.pizyds.com/rain-classroom-pdf-direct-download// @supportURL   https://www.pizyds.com/rain-classroom-pdf-direct-download// @license      MIT// @match        https://*.yuketang.cn/*// @icon         https://www.yuketang.cn/static/images/favicon.ico// @require      https://lib.baomitu.com/jspdf/2.4.0/jspdf.umd.min.js#sha256=e6b6bfd150b911d1e05904a7e03f86265c9c83bfa18e7082b27630aa6330fb92// @require      https://lib.baomitu.com/html2canvas/0.5.0-beta4/html2canvas.min.js#sha256=c3aff5074bb0929477b97d18530de4db3cc79eaeb10cd7556472c8773f3157a2// @require      https://lib.baomitu.com/jquery/3.6.0/jquery.min.js#sha256=ff1523fb7389539c84c65aba19260648793bb4f5e29329d2ee8804bc37a3fe6e// @grant        GM_getValue// @grant        GM_setValue// ==/UserScript==/* eslint-disable *//* spell-checker: disable */// @[ The code below is generated by webpack ]// @[ 下面的代码由 webpack 生成 ]// @[ You can find all source codes in GitHub repo ]// @[ 你可以在 GitHub 仓库中找到所有源代码 ]// @[ https://github.com/PillarsZhang/Rain-Classroom-PDF-Direct-Download ]/******/ (() => { // webpackBootstrap/******/ 	var __webpack_modules__ = ({/***/ 3518:/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {"use strict";// ESM COMPAT FLAG__webpack_require__.r(__webpack_exports__);// EXPORTS__webpack_require__.d(__webpack_exports__, {"afterMain": () => (/* reexport */ afterMain),"afterRead": () => (/* reexport */ afterRead),"afterWrite": () => (/* reexport */ afterWrite),"applyStyles": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_applyStyles),"arrow": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_arrow),"auto": () => (/* reexport */ auto),"basePlacements": () => (/* reexport */ basePlacements),"beforeMain": () => (/* reexport */ beforeMain),"beforeRead": () => (/* reexport */ beforeRead),"beforeWrite": () => (/* reexport */ beforeWrite),"bottom": () => (/* reexport */ bottom),"clippingParents": () => (/* reexport */ clippingParents),"computeStyles": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_computeStyles),"createPopper": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_popper_createPopper),"createPopperBase": () => (/* reexport */ createPopper),"createPopperLite": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_popper_lite_createPopper),"detectOverflow": () => (/* reexport */ detectOverflow),"end": () => (/* reexport */ end),"eventListeners": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_eventListeners),"flip": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_flip),"hide": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_hide),"left": () => (/* reexport */ left),"main": () => (/* reexport */ main),"modifierPhases": () => (/* reexport */ modifierPhases),"offset": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_offset),"placements": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_enums_placements),"popper": () => (/* reexport */ popper),"popperGenerator": () => (/* reexport */ popperGenerator),"popperOffsets": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_popperOffsets),"preventOverflow": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_modifiers_preventOverflow),"read": () => (/* reexport */ read),"reference": () => (/* reexport */ reference),"right": () => (/* reexport */ right),"start": () => (/* reexport */ start),"top": () => (/* reexport */ PRPU_node_modules_popperjs_core_lib_enums_top),"variationPlacements": () => (/* reexport */ variationPlacements),"viewport": () => (/* reexport */ viewport),"write": () => (/* reexport */ write)});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\enums.jsvar PRPU_node_modules_popperjs_core_lib_enums_top = 'top';var bottom = 'bottom';var right = 'right';var left = 'left';var auto = 'auto';var basePlacements = [PRPU_node_modules_popperjs_core_lib_enums_top, bottom, right, left];var start = 'start';var end = 'end';var clippingParents = 'clippingParents';var viewport = 'viewport';var popper = 'popper';var reference = 'reference';var variationPlacements = /*#__PURE__*/basePlacements.reduce(function (acc, placement) {return acc.concat([placement + "-" + start, placement + "-" + end]);}, []);var PRPU_node_modules_popperjs_core_lib_enums_placements = /*#__PURE__*/[].concat(basePlacements, [auto]).reduce(function (acc, placement) {return acc.concat([placement, placement + "-" + start, placement + "-" + end]);}, []); // modifiers that need to read the DOMvar beforeRead = 'beforeRead';var read = 'read';var afterRead = 'afterRead'; // pure-logic modifiersvar beforeMain = 'beforeMain';var main = 'main';var afterMain = 'afterMain'; // modifier with the purpose to write to the DOM (or write into a framework state)var beforeWrite = 'beforeWrite';var write = 'write';var afterWrite = 'afterWrite';var modifierPhases = [beforeRead, read, afterRead, beforeMain, main, afterMain, beforeWrite, write, afterWrite];;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getNodeName.jsfunction getNodeName(element) {return element ? (element.nodeName || '').toLowerCase() : null;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getWindow.jsfunction getWindow(node) {if (node == null) {return window;}if (node.toString() !== '[object Window]') {var ownerDocument = node.ownerDocument;return ownerDocument ? ownerDocument.defaultView || window : window;}return node;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\instanceOf.jsfunction isElement(node) {var OwnElement = getWindow(node).Element;return node instanceof OwnElement || node instanceof Element;}function isHTMLElement(node) {var OwnElement = getWindow(node).HTMLElement;return node instanceof OwnElement || node instanceof HTMLElement;}function isShadowRoot(node) {// IE 11 has no ShadowRootif (typeof ShadowRoot === 'undefined') {return false;}var OwnElement = getWindow(node).ShadowRoot;return node instanceof OwnElement || node instanceof ShadowRoot;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\applyStyles.js// This modifier takes the styles prepared by the `computeStyles` modifier// and applies them to the HTMLElements such as popper and arrowfunction applyStyles(_ref) {var state = _ref.state;Object.keys(state.elements).forEach(function (name) {var style = state.styles[name] || {};var attributes = state.attributes[name] || {};var element = state.elements[name]; // arrow is optional + virtual elementsif (!isHTMLElement(element) || !getNodeName(element)) {return;} // Flow doesn't support to extend this property, but it's the most// effective way to apply styles to an HTMLElement// $FlowFixMe[cannot-write]Object.assign(element.style, style);Object.keys(attributes).forEach(function (name) {var value = attributes[name];if (value === false) {element.removeAttribute(name);} else {element.setAttribute(name, value === true ? '' : value);}});});}function effect(_ref2) {var state = _ref2.state;var initialStyles = {popper: {position: state.options.strategy,left: '0',top: '0',margin: '0'},arrow: {position: 'absolute'},reference: {}};Object.assign(state.elements.popper.style, initialStyles.popper);state.styles = initialStyles;if (state.elements.arrow) {Object.assign(state.elements.arrow.style, initialStyles.arrow);}return function () {Object.keys(state.elements).forEach(function (name) {var element = state.elements[name];var attributes = state.attributes[name] || {};var styleProperties = Object.keys(state.styles.hasOwnProperty(name) ? state.styles[name] : initialStyles[name]); // Set all values to an empty string to unset themvar style = styleProperties.reduce(function (style, property) {style[property] = '';return style;}, {}); // arrow is optional + virtual elementsif (!isHTMLElement(element) || !getNodeName(element)) {return;}Object.assign(element.style, style);Object.keys(attributes).forEach(function (attribute) {element.removeAttribute(attribute);});});};} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_applyStyles = ({name: 'applyStyles',enabled: true,phase: 'write',fn: applyStyles,effect: effect,requires: ['computeStyles']});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getBasePlacement.jsfunction getBasePlacement(placement) {return placement.split('-')[0];};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getBoundingClientRect.jsfunction getBoundingClientRect(element) {var rect = element.getBoundingClientRect();return {width: rect.width,height: rect.height,top: rect.top,right: rect.right,bottom: rect.bottom,left: rect.left,x: rect.left,y: rect.top};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getLayoutRect.js// Returns the layout rect of an element relative to its offsetParent. Layout// means it doesn't take into account transforms.function getLayoutRect(element) {var clientRect = getBoundingClientRect(element); // Use the clientRect sizes if it's not been transformed.// Fixes https://github.com/popperjs/popper-core/issues/1223var width = element.offsetWidth;var height = element.offsetHeight;if (Math.abs(clientRect.width - width) <= 1) {width = clientRect.width;}if (Math.abs(clientRect.height - height) <= 1) {height = clientRect.height;}return {x: element.offsetLeft,y: element.offsetTop,width: width,height: height};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\contains.jsfunction contains(parent, child) {var rootNode = child.getRootNode && child.getRootNode(); // First, attempt with faster native methodif (parent.contains(child)) {return true;} // then fallback to custom implementation with Shadow DOM supportelse if (rootNode && isShadowRoot(rootNode)) {var next = child;do {if (next && parent.isSameNode(next)) {return true;} // $FlowFixMe[prop-missing]: need a better way to handle this...next = next.parentNode || next.host;} while (next);} // Give up, the r###lt is falsereturn false;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getComputedStyle.jsfunction getComputedStyle(element) {return getWindow(element).getComputedStyle(element);};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\isTableElement.jsfunction isTableElement(element) {return ['table', 'td', 'th'].indexOf(getNodeName(element)) >= 0;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getDocumentElement.jsfunction getDocumentElement(element) {// $FlowFixMe[incompatible-return]: assume body is always availablereturn ((isElement(element) ? element.ownerDocument : // $FlowFixMe[prop-missing]element.document) || window.document).documentElement;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getParentNode.jsfunction getParentNode(element) {if (getNodeName(element) === 'html') {return element;}return (// this is a quicker (but less type safe) way to save quite some bytes from the bundle// $FlowFixMe[incompatible-return]// $FlowFixMe[prop-missing]element.assignedSlot || // step into the shadow DOM of the parent of a slotted nodeelement.parentNode || ( // DOM Element detectedisShadowRoot(element) ? element.host : null) || // ShadowRoot detected// $FlowFixMe[incompatible-call]: HTMLElement is a NodegetDocumentElement(element) // fallback);};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getOffsetParent.jsfunction getTrueOffsetParent(element) {if (!isHTMLElement(element) || // https://github.com/popperjs/popper-core/issues/837getComputedStyle(element).position === 'fixed') {return null;}return element.offsetParent;} // `.offsetParent` reports `null` for fixed elements, while absolute elements// return the containing blockfunction getContainingBlock(element) {var isFirefox = navigator.userAgent.toLowerCase().indexOf('firefox') !== -1;var isIE = navigator.userAgent.indexOf('Trident') !== -1;if (isIE && isHTMLElement(element)) {// In IE 9, 10 and 11 fixed elements containing block is always established by the viewportvar elementCss = getComputedStyle(element);if (elementCss.position === 'fixed') {return null;}}var currentNode = getParentNode(element);while (isHTMLElement(currentNode) && ['html', 'body'].indexOf(getNodeName(currentNode)) < 0) {var css = getComputedStyle(currentNode); // This is non-exhaustive but covers the most common CSS properties that// create a containing block.// https://developer.mozilla.org/en-US/docs/Web/CSS/Containing_block#identifying_the_containing_blockif (css.transform !== 'none' || css.perspective !== 'none' || css.contain === 'paint' || ['transform', 'perspective'].indexOf(css.willChange) !== -1 || isFirefox && css.willChange === 'filter' || isFirefox && css.filter && css.filter !== 'none') {return currentNode;} else {currentNode = currentNode.parentNode;}}return null;} // Gets the closest ancestor positioned element. Handles some edge cases,// such as table ancestors and cross browser bugs.function getOffsetParent(element) {var window = getWindow(element);var offsetParent = getTrueOffsetParent(element);while (offsetParent && isTableElement(offsetParent) && getComputedStyle(offsetParent).position === 'static') {offsetParent = getTrueOffsetParent(offsetParent);}if (offsetParent && (getNodeName(offsetParent) === 'html' || getNodeName(offsetParent) === 'body' && getComputedStyle(offsetParent).position === 'static')) {return window;}return offsetParent || getContainingBlock(element) || window;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getMainAxisFromPlacement.jsfunction getMainAxisFromPlacement(placement) {return ['top', 'bottom'].indexOf(placement) >= 0 ? 'x' : 'y';};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\math.jsvar PRPU_node_modules_popperjs_core_lib_utils_math_max = Math.max;var PRPU_node_modules_popperjs_core_lib_utils_math_min = Math.min;var round = Math.round;;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\within.jsfunction within(min, value, max) {return PRPU_node_modules_popperjs_core_lib_utils_math_max(min, PRPU_node_modules_popperjs_core_lib_utils_math_min(value, max));};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getFreshSideObject.jsfunction getFreshSideObject() {return {top: 0,right: 0,bottom: 0,left: 0};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\mergePaddingObject.jsfunction mergePaddingObject(paddingObject) {return Object.assign({}, getFreshSideObject(), paddingObject);};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\expandToHashMap.jsfunction expandToHashMap(value, keys) {return keys.reduce(function (hashMap, key) {hashMap[key] = value;return hashMap;}, {});};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\arrow.js// eslint-disable-next-line import/no-unused-modulesvar toPaddingObject = function toPaddingObject(padding, state) {padding = typeof padding === 'function' ? padding(Object.assign({}, state.rects, {placement: state.placement})) : padding;return mergePaddingObject(typeof padding !== 'number' ? padding : expandToHashMap(padding, basePlacements));};function arrow(_ref) {var _state$modifiersData$;var state = _ref.state,name = _ref.name,options = _ref.options;var arrowElement = state.elements.arrow;var popperOffsets = state.modifiersData.popperOffsets;var basePlacement = getBasePlacement(state.placement);var axis = getMainAxisFromPlacement(basePlacement);var isVertical = [left, right].indexOf(basePlacement) >= 0;var len = isVertical ? 'height' : 'width';if (!arrowElement || !popperOffsets) {return;}var paddingObject = toPaddingObject(options.padding, state);var arrowRect = getLayoutRect(arrowElement);var minProp = axis === 'y' ? PRPU_node_modules_popperjs_core_lib_enums_top : left;var maxProp = axis === 'y' ? bottom : right;var endDiff = state.rects.reference[len] + state.rects.reference[axis] - popperOffsets[axis] - state.rects.popper[len];var startDiff = popperOffsets[axis] - state.rects.reference[axis];var arrowOffsetParent = getOffsetParent(arrowElement);var clientSize = arrowOffsetParent ? axis === 'y' ? arrowOffsetParent.clientHeight || 0 : arrowOffsetParent.clientWidth || 0 : 0;var centerToReference = endDiff / 2 - startDiff / 2; // Make sure the arrow doesn't overflow the popper if the center point is// outside of the popper boundsvar min = paddingObject[minProp];var max = clientSize - arrowRect[len] - paddingObject[maxProp];var center = clientSize / 2 - arrowRect[len] / 2 + centerToReference;var offset = within(min, center, max); // Prevents breaking syntax highlighting...var axisProp = axis;state.modifiersData[name] = (_state$modifiersData$ = {}, _state$modifiersData$[axisProp] = offset, _state$modifiersData$.centerOffset = offset - center, _state$modifiersData$);}function PRPU_node_modules_popperjs_core_lib_modifiers_arrow_effect(_ref2) {var state = _ref2.state,options = _ref2.options;var _options$element = options.element,arrowElement = _options$element === void 0 ? '[data-popper-arrow]' : _options$element;if (arrowElement == null) {return;} // CSS selectorif (typeof arrowElement === 'string') {arrowElement = state.elements.popper.querySelector(arrowElement);if (!arrowElement) {return;}}if (false) {}if (!contains(state.elements.popper, arrowElement)) {if (false) {}return;}state.elements.arrow = arrowElement;} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_arrow = ({name: 'arrow',enabled: true,phase: 'main',fn: arrow,effect: PRPU_node_modules_popperjs_core_lib_modifiers_arrow_effect,requires: ['popperOffsets'],requiresIfExists: ['preventOverflow']});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\computeStyles.js// eslint-disable-next-line import/no-unused-modulesvar unsetSides = {top: 'auto',right: 'auto',bottom: 'auto',left: 'auto'}; // Round the offsets to the nearest suitable subpixel based on the DPR.// Zooming can change the DPR, but it seems to report a value that will// cleanly divide the values into the appropriate subpixels.function roundOffsetsByDPR(_ref) {var x = _ref.x,y = _ref.y;var win = window;var dpr = win.devicePixelRatio || 1;return {x: round(round(x * dpr) / dpr) || 0,y: round(round(y * dpr) / dpr) || 0};}function mapToStyles(_ref2) {var _Object$assign2;var popper = _ref2.popper,popperRect = _ref2.popperRect,placement = _ref2.placement,offsets = _ref2.offsets,position = _ref2.position,gpuAcceleration = _ref2.gpuAcceleration,adaptive = _ref2.adaptive,roundOffsets = _ref2.roundOffsets;var _ref3 = roundOffsets === true ? roundOffsetsByDPR(offsets) : typeof roundOffsets === 'function' ? roundOffsets(offsets) : offsets,_ref3$x = _ref3.x,x = _ref3$x === void 0 ? 0 : _ref3$x,_ref3$y = _ref3.y,y = _ref3$y === void 0 ? 0 : _ref3$y;var hasX = offsets.hasOwnProperty('x');var hasY = offsets.hasOwnProperty('y');var sideX = left;var sideY = PRPU_node_modules_popperjs_core_lib_enums_top;var win = window;if (adaptive) {var offsetParent = getOffsetParent(popper);var heightProp = 'clientHeight';var widthProp = 'clientWidth';if (offsetParent === getWindow(popper)) {offsetParent = getDocumentElement(popper);if (getComputedStyle(offsetParent).position !== 'static') {heightProp = 'scrollHeight';widthProp = 'scrollWidth';}} // $FlowFixMe[incompatible-cast]: force type refinement, we compare offsetParent with window above, but Flow doesn't detect itoffsetParent = offsetParent;if (placement === PRPU_node_modules_popperjs_core_lib_enums_top) {sideY = bottom; // $FlowFixMe[prop-missing]y -= offsetParent[heightProp] - popperRect.height;y *= gpuAcceleration ? 1 : -1;}if (placement === left) {sideX = right; // $FlowFixMe[prop-missing]x -= offsetParent[widthProp] - popperRect.width;x *= gpuAcceleration ? 1 : -1;}}var commonStyles = Object.assign({position: position}, adaptive && unsetSides);if (gpuAcceleration) {var _Object$assign;return Object.assign({}, commonStyles, (_Object$assign = {}, _Object$assign[sideY] = hasY ? '0' : '', _Object$assign[sideX] = hasX ? '0' : '', _Object$assign.transform = (win.devicePixelRatio || 1) < 2 ? "translate(" + x + "px, " + y + "px)" : "translate3d(" + x + "px, " + y + "px, 0)", _Object$assign));}return Object.assign({}, commonStyles, (_Object$assign2 = {}, _Object$assign2[sideY] = hasY ? y + "px" : '', _Object$assign2[sideX] = hasX ? x + "px" : '', _Object$assign2.transform = '', _Object$assign2));}function computeStyles(_ref4) {var state = _ref4.state,options = _ref4.options;var _options$gpuAccelerat = options.gpuAcceleration,gpuAcceleration = _options$gpuAccelerat === void 0 ? true : _options$gpuAccelerat,_options$adaptive = options.adaptive,adaptive = _options$adaptive === void 0 ? true : _options$adaptive,_options$roundOffsets = options.roundOffsets,roundOffsets = _options$roundOffsets === void 0 ? true : _options$roundOffsets;if (false) { var transitionProperty; }var commonStyles = {placement: getBasePlacement(state.placement),popper: state.elements.popper,popperRect: state.rects.popper,gpuAcceleration: gpuAcceleration};if (state.modifiersData.popperOffsets != null) {state.styles.popper = Object.assign({}, state.styles.popper, mapToStyles(Object.assign({}, commonStyles, {offsets: state.modifiersData.popperOffsets,position: state.options.strategy,adaptive: adaptive,roundOffsets: roundOffsets})));}if (state.modifiersData.arrow != null) {state.styles.arrow = Object.assign({}, state.styles.arrow, mapToStyles(Object.assign({}, commonStyles, {offsets: state.modifiersData.arrow,position: 'absolute',adaptive: false,roundOffsets: roundOffsets})));}state.attributes.popper = Object.assign({}, state.attributes.popper, {'data-popper-placement': state.placement});} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_computeStyles = ({name: 'computeStyles',enabled: true,phase: 'beforeWrite',fn: computeStyles,data: {}});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\eventListeners.js// eslint-disable-next-line import/no-unused-modulesvar passive = {passive: true};function PRPU_node_modules_popperjs_core_lib_modifiers_eventListeners_effect(_ref) {var state = _ref.state,instance = _ref.instance,options = _ref.options;var _options$scroll = options.scroll,scroll = _options$scroll === void 0 ? true : _options$scroll,_options$resize = options.resize,resize = _options$resize === void 0 ? true : _options$resize;var window = getWindow(state.elements.popper);var scrollParents = [].concat(state.scrollParents.reference, state.scrollParents.popper);if (scroll) {scrollParents.forEach(function (scrollParent) {scrollParent.addEventListener('scroll', instance.update, passive);});}if (resize) {window.addEventListener('resize', instance.update, passive);}return function () {if (scroll) {scrollParents.forEach(function (scrollParent) {scrollParent.removeEventListener('scroll', instance.update, passive);});}if (resize) {window.removeEventListener('resize', instance.update, passive);}};} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_eventListeners = ({name: 'eventListeners',enabled: true,phase: 'write',fn: function fn() {},effect: PRPU_node_modules_popperjs_core_lib_modifiers_eventListeners_effect,data: {}});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getOppositePlacement.jsvar hash = {left: 'right',right: 'left',bottom: 'top',top: 'bottom'};function getOppositePlacement(placement) {return placement.replace(/left|right|bottom|top/g, function (matched) {return hash[matched];});};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getOppositeVariationPlacement.jsvar PRPU_node_modules_popperjs_core_lib_utils_getOppositeVariationPlacement_hash = {start: 'end',end: 'start'};function getOppositeVariationPlacement(placement) {return placement.replace(/start|end/g, function (matched) {return PRPU_node_modules_popperjs_core_lib_utils_getOppositeVariationPlacement_hash[matched];});};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getWindowScroll.jsfunction getWindowScroll(node) {var win = getWindow(node);var scrollLeft = win.pageXOffset;var scrollTop = win.pageYOffset;return {scrollLeft: scrollLeft,scrollTop: scrollTop};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getWindowScrollBarX.jsfunction getWindowScrollBarX(element) {// If <html> has a CSS width greater than the viewport, then this will be// incorrect for RTL.// Popper 1 is broken in this case and never had a bug report so let's assume// it's not an issue. I don't think anyone ever specifies width on <html>// anyway.// Browsers where the left scrollbar doesn't cause an issue report `0` for// this (e.g. Edge 2019, IE11, Safari)return getBoundingClientRect(getDocumentElement(element)).left + getWindowScroll(element).scrollLeft;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getViewportRect.jsfunction getViewportRect(element) {var win = getWindow(element);var html = getDocumentElement(element);var visualViewport = win.visualViewport;var width = html.clientWidth;var height = html.clientHeight;var x = 0;var y = 0; // NB: This isn't supported on iOS <= 12. If the keyboard is open, the popper// can be obscured underneath it.// Also, `html.clientHeight` adds the bottom bar height in Safari iOS, even// if it isn't open, so if this isn't available, the popper will be detected// to overflow the bottom of the screen too early.if (visualViewport) {width = visualViewport.width;height = visualViewport.height; // Uses Layout Viewport (like Chrome; Safari does not currently)// In Chrome, it returns a value very close to 0 (+/-) but contains rounding// errors due to floating point numbers, so we need to check precision.// Safari returns a number <= 0, usually < -1 when pinch-zoomed// Feature detection fails in mobile emulation mode in Chrome.// Math.abs(win.innerWidth / visualViewport.scale - visualViewport.width) <// 0.001// Fallback here: "Not Safari" userAgentif (!/^((?!chrome|android).)*safari/i.test(navigator.userAgent)) {x = visualViewport.offsetLeft;y = visualViewport.offsetTop;}}return {width: width,height: height,x: x + getWindowScrollBarX(element),y: y};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getDocumentRect.js// Gets the entire size of the scrollable document area, even extending outside// of the `<html>` and `<body>` rect bounds if horizontally scrollablefunction getDocumentRect(element) {var _element$ownerDocumen;var html = getDocumentElement(element);var winScroll = getWindowScroll(element);var body = (_element$ownerDocumen = element.ownerDocument) == null ? void 0 : _element$ownerDocumen.body;var width = PRPU_node_modules_popperjs_core_lib_utils_math_max(html.scrollWidth, html.clientWidth, body ? body.scrollWidth : 0, body ? body.clientWidth : 0);var height = PRPU_node_modules_popperjs_core_lib_utils_math_max(html.scrollHeight, html.clientHeight, body ? body.scrollHeight : 0, body ? body.clientHeight : 0);var x = -winScroll.scrollLeft + getWindowScrollBarX(element);var y = -winScroll.scrollTop;if (getComputedStyle(body || html).direction === 'rtl') {x += PRPU_node_modules_popperjs_core_lib_utils_math_max(html.clientWidth, body ? body.clientWidth : 0) - width;}return {width: width,height: height,x: x,y: y};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\isScrollParent.jsfunction isScrollParent(element) {// Firefox wants us to check `-x` and `-y` variations as wellvar _getComputedStyle = getComputedStyle(element),overflow = _getComputedStyle.overflow,overflowX = _getComputedStyle.overflowX,overflowY = _getComputedStyle.overflowY;return /auto|scroll|overlay|hidden/.test(overflow + overflowY + overflowX);};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getScrollParent.jsfunction getScrollParent(node) {if (['html', 'body', '#document'].indexOf(getNodeName(node)) >= 0) {// $FlowFixMe[incompatible-return]: assume body is always availablereturn node.ownerDocument.body;}if (isHTMLElement(node) && isScrollParent(node)) {return node;}return getScrollParent(getParentNode(node));};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\listScrollParents.js/*given a DOM element, return the list of all scroll parents, up the list of ancesorsuntil we get to the top window object. This list is what we attach scroll listenersto, because if any of these parent elements scroll, we'll need to re-calculate thereference element's position.*/function listScrollParents(element, list) {var _element$ownerDocumen;if (list === void 0) {list = [];}var scrollParent = getScrollParent(element);var isBody = scrollParent === ((_element$ownerDocumen = element.ownerDocument) == null ? void 0 : _element$ownerDocumen.body);var win = getWindow(scrollParent);var target = isBody ? [win].concat(win.visualViewport || [], isScrollParent(scrollParent) ? scrollParent : []) : scrollParent;var updatedList = list.concat(target);return isBody ? updatedList : // $FlowFixMe[incompatible-call]: isBody tells us target will be an HTMLElement hereupdatedList.concat(listScrollParents(getParentNode(target)));};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\rectToClientRect.jsfunction rectToClientRect(rect) {return Object.assign({}, rect, {left: rect.x,top: rect.y,right: rect.x + rect.width,bottom: rect.y + rect.height});};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getClippingRect.jsfunction getInnerBoundingClientRect(element) {var rect = getBoundingClientRect(element);rect.top = rect.top + element.clientTop;rect.left = rect.left + element.clientLeft;rect.bottom = rect.top + element.clientHeight;rect.right = rect.left + element.clientWidth;rect.width = element.clientWidth;rect.height = element.clientHeight;rect.x = rect.left;rect.y = rect.top;return rect;}function getClientRectFromMixedType(element, clippingParent) {return clippingParent === viewport ? rectToClientRect(getViewportRect(element)) : isHTMLElement(clippingParent) ? getInnerBoundingClientRect(clippingParent) : rectToClientRect(getDocumentRect(getDocumentElement(element)));} // A "clipping parent" is an overflowable container with the characteristic of// clipping (or hiding) overflowing elements with a position different from// `initial`function getClippingParents(element) {var clippingParents = listScrollParents(getParentNode(element));var canEscapeClipping = ['absolute', 'fixed'].indexOf(getComputedStyle(element).position) >= 0;var clipperElement = canEscapeClipping && isHTMLElement(element) ? getOffsetParent(element) : element;if (!isElement(clipperElement)) {return [];} // $FlowFixMe[incompatible-return]: https://github.com/facebook/flow/issues/1414return clippingParents.filter(function (clippingParent) {return isElement(clippingParent) && contains(clippingParent, clipperElement) && getNodeName(clippingParent) !== 'body';});} // Gets the maximum area that the element is visible in due to any number of// clipping parentsfunction getClippingRect(element, boundary, rootBoundary) {var mainClippingParents = boundary === 'clippingParents' ? getClippingParents(element) : [].concat(boundary);var clippingParents = [].concat(mainClippingParents, [rootBoundary]);var firstClippingParent = clippingParents[0];var clippingRect = clippingParents.reduce(function (accRect, clippingParent) {var rect = getClientRectFromMixedType(element, clippingParent);accRect.top = PRPU_node_modules_popperjs_core_lib_utils_math_max(rect.top, accRect.top);accRect.right = PRPU_node_modules_popperjs_core_lib_utils_math_min(rect.right, accRect.right);accRect.bottom = PRPU_node_modules_popperjs_core_lib_utils_math_min(rect.bottom, accRect.bottom);accRect.left = PRPU_node_modules_popperjs_core_lib_utils_math_max(rect.left, accRect.left);return accRect;}, getClientRectFromMixedType(element, firstClippingParent));clippingRect.width = clippingRect.right - clippingRect.left;clippingRect.height = clippingRect.bottom - clippingRect.top;clippingRect.x = clippingRect.left;clippingRect.y = clippingRect.top;return clippingRect;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getVariation.jsfunction getVariation(placement) {return placement.split('-')[1];};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\computeOffsets.jsfunction computeOffsets(_ref) {var reference = _ref.reference,element = _ref.element,placement = _ref.placement;var basePlacement = placement ? getBasePlacement(placement) : null;var variation = placement ? getVariation(placement) : null;var commonX = reference.x + reference.width / 2 - element.width / 2;var commonY = reference.y + reference.height / 2 - element.height / 2;var offsets;switch (basePlacement) {case PRPU_node_modules_popperjs_core_lib_enums_top:offsets = {x: commonX,y: reference.y - element.height};break;case bottom:offsets = {x: commonX,y: reference.y + reference.height};break;case right:offsets = {x: reference.x + reference.width,y: commonY};break;case left:offsets = {x: reference.x - element.width,y: commonY};break;default:offsets = {x: reference.x,y: reference.y};}var mainAxis = basePlacement ? getMainAxisFromPlacement(basePlacement) : null;if (mainAxis != null) {var len = mainAxis === 'y' ? 'height' : 'width';switch (variation) {case start:offsets[mainAxis] = offsets[mainAxis] - (reference[len] / 2 - element[len] / 2);break;case end:offsets[mainAxis] = offsets[mainAxis] + (reference[len] / 2 - element[len] / 2);break;default:}}return offsets;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\detectOverflow.js// eslint-disable-next-line import/no-unused-modulesfunction detectOverflow(state, options) {if (options === void 0) {options = {};}var _options = options,_options$placement = _options.placement,placement = _options$placement === void 0 ? state.placement : _options$placement,_options$boundary = _options.boundary,boundary = _options$boundary === void 0 ? clippingParents : _options$boundary,_options$rootBoundary = _options.rootBoundary,rootBoundary = _options$rootBoundary === void 0 ? viewport : _options$rootBoundary,_options$elementConte = _options.elementContext,elementContext = _options$elementConte === void 0 ? popper : _options$elementConte,_options$altBoundary = _options.altBoundary,altBoundary = _options$altBoundary === void 0 ? false : _options$altBoundary,_options$padding = _options.padding,padding = _options$padding === void 0 ? 0 : _options$padding;var paddingObject = mergePaddingObject(typeof padding !== 'number' ? padding : expandToHashMap(padding, basePlacements));var altContext = elementContext === popper ? reference : popper;var referenceElement = state.elements.reference;var popperRect = state.rects.popper;var element = state.elements[altBoundary ? altContext : elementContext];var clippingClientRect = getClippingRect(isElement(element) ? element : element.contextElement || getDocumentElement(state.elements.popper), boundary, rootBoundary);var referenceClientRect = getBoundingClientRect(referenceElement);var popperOffsets = computeOffsets({reference: referenceClientRect,element: popperRect,strategy: 'absolute',placement: placement});var popperClientRect = rectToClientRect(Object.assign({}, popperRect, popperOffsets));var elementClientRect = elementContext === popper ? popperClientRect : referenceClientRect; // positive = overflowing the clipping rect// 0 or negative = within the clipping rectvar overflowOffsets = {top: clippingClientRect.top - elementClientRect.top + paddingObject.top,bottom: elementClientRect.bottom - clippingClientRect.bottom + paddingObject.bottom,left: clippingClientRect.left - elementClientRect.left + paddingObject.left,right: elementClientRect.right - clippingClientRect.right + paddingObject.right};var offsetData = state.modifiersData.offset; // Offsets can be applied only to the popper elementif (elementContext === popper && offsetData) {var offset = offsetData[placement];Object.keys(overflowOffsets).forEach(function (key) {var multiply = [right, bottom].indexOf(key) >= 0 ? 1 : -1;var axis = [PRPU_node_modules_popperjs_core_lib_enums_top, bottom].indexOf(key) >= 0 ? 'y' : 'x';overflowOffsets[key] += offset[axis] * multiply;});}return overflowOffsets;};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\computeAutoPlacement.jsfunction computeAutoPlacement(state, options) {if (options === void 0) {options = {};}var _options = options,placement = _options.placement,boundary = _options.boundary,rootBoundary = _options.rootBoundary,padding = _options.padding,flipVariations = _options.flipVariations,_options$allowedAutoP = _options.allowedAutoPlacements,allowedAutoPlacements = _options$allowedAutoP === void 0 ? PRPU_node_modules_popperjs_core_lib_enums_placements : _options$allowedAutoP;var variation = getVariation(placement);var placements = variation ? flipVariations ? variationPlacements : variationPlacements.filter(function (placement) {return getVariation(placement) === variation;}) : basePlacements;var allowedPlacements = placements.filter(function (placement) {return allowedAutoPlacements.indexOf(placement) >= 0;});if (allowedPlacements.length === 0) {allowedPlacements = placements;if (false) {}} // $FlowFixMe[incompatible-type]: Flow seems to have problems with two array unions...var overflows = allowedPlacements.reduce(function (acc, placement) {acc[placement] = detectOverflow(state, {placement: placement,boundary: boundary,rootBoundary: rootBoundary,padding: padding})[getBasePlacement(placement)];return acc;}, {});return Object.keys(overflows).sort(function (a, b) {return overflows[a] - overflows[b];});};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\flip.js// eslint-disable-next-line import/no-unused-modulesfunction getExpandedFallbackPlacements(placement) {if (getBasePlacement(placement) === auto) {return [];}var oppositePlacement = getOppositePlacement(placement);return [getOppositeVariationPlacement(placement), oppositePlacement, getOppositeVariationPlacement(oppositePlacement)];}function flip(_ref) {var state = _ref.state,options = _ref.options,name = _ref.name;if (state.modifiersData[name]._skip) {return;}var _options$mainAxis = options.mainAxis,checkMainAxis = _options$mainAxis === void 0 ? true : _options$mainAxis,_options$altAxis = options.altAxis,checkAltAxis = _options$altAxis === void 0 ? true : _options$altAxis,specifiedFallbackPlacements = options.fallbackPlacements,padding = options.padding,boundary = options.boundary,rootBoundary = options.rootBoundary,altBoundary = options.altBoundary,_options$flipVariatio = options.flipVariations,flipVariations = _options$flipVariatio === void 0 ? true : _options$flipVariatio,allowedAutoPlacements = options.allowedAutoPlacements;var preferredPlacement = state.options.placement;var basePlacement = getBasePlacement(preferredPlacement);var isBasePlacement = basePlacement === preferredPlacement;var fallbackPlacements = specifiedFallbackPlacements || (isBasePlacement || !flipVariations ? [getOppositePlacement(preferredPlacement)] : getExpandedFallbackPlacements(preferredPlacement));var placements = [preferredPlacement].concat(fallbackPlacements).reduce(function (acc, placement) {return acc.concat(getBasePlacement(placement) === auto ? computeAutoPlacement(state, {placement: placement,boundary: boundary,rootBoundary: rootBoundary,padding: padding,flipVariations: flipVariations,allowedAutoPlacements: allowedAutoPlacements}) : placement);}, []);var referenceRect = state.rects.reference;var popperRect = state.rects.popper;var checksMap = new Map();var makeFallbackChecks = true;var firstFittingPlacement = placements[0];for (var i = 0; i < placements.length; i++) {var placement = placements[i];var _basePlacement = getBasePlacement(placement);var isStartVariation = getVariation(placement) === start;var isVertical = [PRPU_node_modules_popperjs_core_lib_enums_top, bottom].indexOf(_basePlacement) >= 0;var len = isVertical ? 'width' : 'height';var overflow = detectOverflow(state, {placement: placement,boundary: boundary,rootBoundary: rootBoundary,altBoundary: altBoundary,padding: padding});var mainVariationSide = isVertical ? isStartVariation ? right : left : isStartVariation ? bottom : PRPU_node_modules_popperjs_core_lib_enums_top;if (referenceRect[len] > popperRect[len]) {mainVariationSide = getOppositePlacement(mainVariationSide);}var altVariationSide = getOppositePlacement(mainVariationSide);var checks = [];if (checkMainAxis) {checks.push(overflow[_basePlacement] <= 0);}if (checkAltAxis) {checks.push(overflow[mainVariationSide] <= 0, overflow[altVariationSide] <= 0);}if (checks.every(function (check) {return check;})) {firstFittingPlacement = placement;makeFallbackChecks = false;break;}checksMap.set(placement, checks);}if (makeFallbackChecks) {// `2` may be desired in some cases – research latervar numberOfChecks = flipVariations ? 3 : 1;var _loop = function _loop(_i) {var fittingPlacement = placements.find(function (placement) {var checks = checksMap.get(placement);if (checks) {return checks.slice(0, _i).every(function (check) {return check;});}});if (fittingPlacement) {firstFittingPlacement = fittingPlacement;return "break";}};for (var _i = numberOfChecks; _i > 0; _i--) {var _ret = _loop(_i);if (_ret === "break") break;}}if (state.placement !== firstFittingPlacement) {state.modifiersData[name]._skip = true;state.placement = firstFittingPlacement;state.reset = true;}} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_flip = ({name: 'flip',enabled: true,phase: 'main',fn: flip,requiresIfExists: ['offset'],data: {_skip: false}});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\hide.jsfunction getSideOffsets(overflow, rect, preventedOffsets) {if (preventedOffsets === void 0) {preventedOffsets = {x: 0,y: 0};}return {top: overflow.top - rect.height - preventedOffsets.y,right: overflow.right - rect.width + preventedOffsets.x,bottom: overflow.bottom - rect.height + preventedOffsets.y,left: overflow.left - rect.width - preventedOffsets.x};}function isAnySideFullyClipped(overflow) {return [PRPU_node_modules_popperjs_core_lib_enums_top, right, bottom, left].some(function (side) {return overflow[side] >= 0;});}function hide(_ref) {var state = _ref.state,name = _ref.name;var referenceRect = state.rects.reference;var popperRect = state.rects.popper;var preventedOffsets = state.modifiersData.preventOverflow;var referenceOverflow = detectOverflow(state, {elementContext: 'reference'});var popperAltOverflow = detectOverflow(state, {altBoundary: true});var referenceClippingOffsets = getSideOffsets(referenceOverflow, referenceRect);var popperEscapeOffsets = getSideOffsets(popperAltOverflow, popperRect, preventedOffsets);var isReferenceHidden = isAnySideFullyClipped(referenceClippingOffsets);var hasPopperEscaped = isAnySideFullyClipped(popperEscapeOffsets);state.modifiersData[name] = {referenceClippingOffsets: referenceClippingOffsets,popperEscapeOffsets: popperEscapeOffsets,isReferenceHidden: isReferenceHidden,hasPopperEscaped: hasPopperEscaped};state.attributes.popper = Object.assign({}, state.attributes.popper, {'data-popper-reference-hidden': isReferenceHidden,'data-popper-escaped': hasPopperEscaped});} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_hide = ({name: 'hide',enabled: true,phase: 'main',requiresIfExists: ['preventOverflow'],fn: hide});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\offset.jsfunction distanceAndSkiddingToXY(placement, rects, offset) {var basePlacement = getBasePlacement(placement);var invertDistance = [left, PRPU_node_modules_popperjs_core_lib_enums_top].indexOf(basePlacement) >= 0 ? -1 : 1;var _ref = typeof offset === 'function' ? offset(Object.assign({}, rects, {placement: placement})) : offset,skidding = _ref[0],distance = _ref[1];skidding = skidding || 0;distance = (distance || 0) * invertDistance;return [left, right].indexOf(basePlacement) >= 0 ? {x: distance,y: skidding} : {x: skidding,y: distance};}function offset(_ref2) {var state = _ref2.state,options = _ref2.options,name = _ref2.name;var _options$offset = options.offset,offset = _options$offset === void 0 ? [0, 0] : _options$offset;var data = PRPU_node_modules_popperjs_core_lib_enums_placements.reduce(function (acc, placement) {acc[placement] = distanceAndSkiddingToXY(placement, state.rects, offset);return acc;}, {});var _data$state$placement = data[state.placement],x = _data$state$placement.x,y = _data$state$placement.y;if (state.modifiersData.popperOffsets != null) {state.modifiersData.popperOffsets.x += x;state.modifiersData.popperOffsets.y += y;}state.modifiersData[name] = data;} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_offset = ({name: 'offset',enabled: true,phase: 'main',requires: ['popperOffsets'],fn: offset});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\popperOffsets.jsfunction popperOffsets(_ref) {var state = _ref.state,name = _ref.name;// Offsets are the actual position the popper needs to have to be// properly positioned near its reference element// This is the most basic placement, and will be adjusted by// the modifiers in the next stepstate.modifiersData[name] = computeOffsets({reference: state.rects.reference,element: state.rects.popper,strategy: 'absolute',placement: state.placement});} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_popperOffsets = ({name: 'popperOffsets',enabled: true,phase: 'read',fn: popperOffsets,data: {}});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\getAltAxis.jsfunction getAltAxis(axis) {return axis === 'x' ? 'y' : 'x';};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\preventOverflow.jsfunction preventOverflow(_ref) {var state = _ref.state,options = _ref.options,name = _ref.name;var _options$mainAxis = options.mainAxis,checkMainAxis = _options$mainAxis === void 0 ? true : _options$mainAxis,_options$altAxis = options.altAxis,checkAltAxis = _options$altAxis === void 0 ? false : _options$altAxis,boundary = options.boundary,rootBoundary = options.rootBoundary,altBoundary = options.altBoundary,padding = options.padding,_options$tether = options.tether,tether = _options$tether === void 0 ? true : _options$tether,_options$tetherOffset = options.tetherOffset,tetherOffset = _options$tetherOffset === void 0 ? 0 : _options$tetherOffset;var overflow = detectOverflow(state, {boundary: boundary,rootBoundary: rootBoundary,padding: padding,altBoundary: altBoundary});var basePlacement = getBasePlacement(state.placement);var variation = getVariation(state.placement);var isBasePlacement = !variation;var mainAxis = getMainAxisFromPlacement(basePlacement);var altAxis = getAltAxis(mainAxis);var popperOffsets = state.modifiersData.popperOffsets;var referenceRect = state.rects.reference;var popperRect = state.rects.popper;var tetherOffsetValue = typeof tetherOffset === 'function' ? tetherOffset(Object.assign({}, state.rects, {placement: state.placement})) : tetherOffset;var data = {x: 0,y: 0};if (!popperOffsets) {return;}if (checkMainAxis || checkAltAxis) {var mainSide = mainAxis === 'y' ? PRPU_node_modules_popperjs_core_lib_enums_top : left;var altSide = mainAxis === 'y' ? bottom : right;var len = mainAxis === 'y' ? 'height' : 'width';var offset = popperOffsets[mainAxis];var min = popperOffsets[mainAxis] + overflow[mainSide];var max = popperOffsets[mainAxis] - overflow[altSide];var additive = tether ? -popperRect[len] / 2 : 0;var minLen = variation === start ? referenceRect[len] : popperRect[len];var maxLen = variation === start ? -popperRect[len] : -referenceRect[len]; // We need to include the arrow in the calculation so the arrow doesn't go// outside the reference boundsvar arrowElement = state.elements.arrow;var arrowRect = tether && arrowElement ? getLayoutRect(arrowElement) : {width: 0,height: 0};var arrowPaddingObject = state.modifiersData['arrow#persistent'] ? state.modifiersData['arrow#persistent'].padding : getFreshSideObject();var arrowPaddingMin = arrowPaddingObject[mainSide];var arrowPaddingMax = arrowPaddingObject[altSide]; // If the reference length is smaller than the arrow length, we don't want// to include its full size in the calculation. If the reference is small// and near the edge of a boundary, the popper can overflow even if the// reference is not overflowing as well (e.g. virtual elements with no// width or height)var arrowLen = within(0, referenceRect[len], arrowRect[len]);var minOffset = isBasePlacement ? referenceRect[len] / 2 - additive - arrowLen - arrowPaddingMin - tetherOffsetValue : minLen - arrowLen - arrowPaddingMin - tetherOffsetValue;var maxOffset = isBasePlacement ? -referenceRect[len] / 2 + additive + arrowLen + arrowPaddingMax + tetherOffsetValue : maxLen + arrowLen + arrowPaddingMax + tetherOffsetValue;var arrowOffsetParent = state.elements.arrow && getOffsetParent(state.elements.arrow);var clientOffset = arrowOffsetParent ? mainAxis === 'y' ? arrowOffsetParent.clientTop || 0 : arrowOffsetParent.clientLeft || 0 : 0;var offsetModifierValue = state.modifiersData.offset ? state.modifiersData.offset[state.placement][mainAxis] : 0;var tetherMin = popperOffsets[mainAxis] + minOffset - offsetModifierValue - clientOffset;var tetherMax = popperOffsets[mainAxis] + maxOffset - offsetModifierValue;if (checkMainAxis) {var preventedOffset = within(tether ? PRPU_node_modules_popperjs_core_lib_utils_math_min(min, tetherMin) : min, offset, tether ? PRPU_node_modules_popperjs_core_lib_utils_math_max(max, tetherMax) : max);popperOffsets[mainAxis] = preventedOffset;data[mainAxis] = preventedOffset - offset;}if (checkAltAxis) {var _mainSide = mainAxis === 'x' ? PRPU_node_modules_popperjs_core_lib_enums_top : left;var _altSide = mainAxis === 'x' ? bottom : right;var _offset = popperOffsets[altAxis];var _min = _offset + overflow[_mainSide];var _max = _offset - overflow[_altSide];var _preventedOffset = within(tether ? PRPU_node_modules_popperjs_core_lib_utils_math_min(_min, tetherMin) : _min, _offset, tether ? PRPU_node_modules_popperjs_core_lib_utils_math_max(_max, tetherMax) : _max);popperOffsets[altAxis] = _preventedOffset;data[altAxis] = _preventedOffset - _offset;}}state.modifiersData[name] = data;} // eslint-disable-next-line import/no-unused-modules/* harmony default export */ const PRPU_node_modules_popperjs_core_lib_modifiers_preventOverflow = ({name: 'preventOverflow',enabled: true,phase: 'main',fn: preventOverflow,requiresIfExists: ['offset']});;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\modifiers\index.js;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getHTMLElementScroll.jsfunction getHTMLElementScroll(element) {return {scrollLeft: element.scrollLeft,scrollTop: element.scrollTop};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getNodeScroll.jsfunction getNodeScroll(node) {if (node === getWindow(node) || !isHTMLElement(node)) {return getWindowScroll(node);} else {return getHTMLElementScroll(node);}};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\dom-utils\getCompositeRect.js// Returns the composite rect of an element relative to its offsetParent.// Composite means it takes into account transforms as well as layout.function getCompositeRect(elementOrVirtualElement, offsetParent, isFixed) {if (isFixed === void 0) {isFixed = false;}var documentElement = getDocumentElement(offsetParent);var rect = getBoundingClientRect(elementOrVirtualElement);var isOffsetParentAnElement = isHTMLElement(offsetParent);var scroll = {scrollLeft: 0,scrollTop: 0};var offsets = {x: 0,y: 0};if (isOffsetParentAnElement || !isOffsetParentAnElement && !isFixed) {if (getNodeName(offsetParent) !== 'body' || // https://github.com/popperjs/popper-core/issues/1078isScrollParent(documentElement)) {scroll = getNodeScroll(offsetParent);}if (isHTMLElement(offsetParent)) {offsets = getBoundingClientRect(offsetParent);offsets.x += offsetParent.clientLeft;offsets.y += offsetParent.clientTop;} else if (documentElement) {offsets.x = getWindowScrollBarX(documentElement);}}return {x: rect.left + scroll.scrollLeft - offsets.x,y: rect.top + scroll.scrollTop - offsets.y,width: rect.width,height: rect.height};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\orderModifiers.js// source: https://stackoverflow.com/questions/49875255function order(modifiers) {var map = new Map();var visited = new Set();var r###lt = [];modifiers.forEach(function (modifier) {map.set(modifier.name, modifier);}); // On visiting object, check for its dependencies and visit them recursivelyfunction sort(modifier) {visited.add(modifier.name);var requires = [].concat(modifier.requires || [], modifier.requiresIfExists || []);requires.forEach(function (dep) {if (!visited.has(dep)) {var depModifier = map.get(dep);if (depModifier) {sort(depModifier);}}});r###lt.push(modifier);}modifiers.forEach(function (modifier) {if (!visited.has(modifier.name)) {// check for visited objectsort(modifier);}});return r###lt;}function orderModifiers(modifiers) {// order based on dependenciesvar orderedModifiers = order(modifiers); // order based on phasereturn modifierPhases.reduce(function (acc, phase) {return acc.concat(orderedModifiers.filter(function (modifier) {return modifier.phase === phase;}));}, []);};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\debounce.jsfunction debounce(fn) {var pending;return function () {if (!pending) {pending = new Promise(function (resolve) {Promise.resolve().then(function () {pending = undefined;resolve(fn());});});}return pending;};};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\utils\mergeByName.jsfunction mergeByName(modifiers) {var merged = modifiers.reduce(function (merged, current) {var existing = merged[current.name];merged[current.name] = existing ? Object.assign({}, existing, current, {options: Object.assign({}, existing.options, current.options),data: Object.assign({}, existing.data, current.data)}) : current;return merged;}, {}); // IE11 does not support Object.valuesreturn Object.keys(merged).map(function (key) {return merged[key];});};// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\createPopper.jsvar INVALID_ELEMENT_ERROR = 'Popper: Invalid reference or popper argument provided. They must be either a DOM element or virtual element.';var INFINITE_LOOP_ERROR = 'Popper: An infinite loop in the modifiers cycle has been detected! The cycle has been interrupted to prevent a browser crash.';var DEFAULT_OPTIONS = {placement: 'bottom',modifiers: [],strategy: 'absolute'};function areValidElements() {for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {args[_key] = arguments[_key];}return !args.some(function (element) {return !(element && typeof element.getBoundingClientRect === 'function');});}function popperGenerator(generatorOptions) {if (generatorOptions === void 0) {generatorOptions = {};}var _generatorOptions = generatorOptions,_generatorOptions$def = _generatorOptions.defaultModifiers,defaultModifiers = _generatorOptions$def === void 0 ? [] : _generatorOptions$def,_generatorOptions$def2 = _generatorOptions.defaultOptions,defaultOptions = _generatorOptions$def2 === void 0 ? DEFAULT_OPTIONS : _generatorOptions$def2;return function createPopper(reference, popper, options) {if (options === void 0) {options = defaultOptions;}var state = {placement: 'bottom',orderedModifiers: [],options: Object.assign({}, DEFAULT_OPTIONS, defaultOptions),modifiersData: {},elements: {reference: reference,popper: popper},attributes: {},styles: {}};var effectCleanupFns = [];var isDestroyed = false;var instance = {state: state,setOptions: function setOptions(options) {cleanupModifierEffects();state.options = Object.assign({}, defaultOptions, state.options, options);state.scrollParents = {reference: isElement(reference) ? listScrollParents(reference) : reference.contextElement ? listScrollParents(reference.contextElement) : [],popper: listScrollParents(popper)}; // Orders the modifiers based on their dependencies and `phase`// propertiesvar orderedModifiers = orderModifiers(mergeByName([].concat(defaultModifiers, state.options.modifiers))); // Strip out disabled modifiersstate.orderedModifiers = orderedModifiers.filter(function (m) {return m.enabled;}); // Validate the provided modifiers so that the consumer will get warned// if one of the modifiers is invalid for any reasonif (false) { var _getComputedStyle, marginTop, marginRight, marginBottom, marginLeft, flipModifier, modifiers; }runModifierEffects();return instance.update();},// Sync update – it will always be executed, even if not necessary. This// is useful for low frequency updates where sync behavior simplifies the// logic.// For high frequency updates (e.g. `resize` and `scroll` events), always// prefer the async Popper#update methodforceUpdate: function forceUpdate() {if (isDestroyed) {return;}var _state$elements = state.elements,reference = _state$elements.reference,popper = _state$elements.popper; // Don't proceed if `reference` or `popper` are not valid elements// anymoreif (!areValidElements(reference, popper)) {if (false) {}return;} // Store the reference and popper rects to be read by modifiersstate.rects = {reference: getCompositeRect(reference, getOffsetParent(popper), state.options.strategy === 'fixed'),popper: getLayoutRect(popper)}; // Modifiers have the ability to reset the current update cycle. The// most common use case for this is the `flip` modifier changing the// placement, which then needs to re-run all the modifiers, because the// logic was previously ran for the previous placement and is therefore// stale/incorrectstate.reset = false;state.placement = state.options.placement; // On each update cycle, the `modifiersData` property for each modifier// is filled with the initial data specified by the modifier. This means// it doesn't persist and is fresh on each update.// To ensure persistent data, use `${name}#persistent`state.orderedModifiers.forEach(function (modifier) {return state.modifiersData[modifier.name] = Object.assign({}, modifier.data);});var __debug_loops__ = 0;for (var index = 0; index < state.orderedModifiers.length; index++) {if (false) {}if (state.reset === true) {state.reset = false;index = -1;continue;}var _state$orderedModifie = state.orderedModifiers[index],fn = _state$orderedModifie.fn,_state$orderedModifie2 = _state$orderedModifie.options,_options = _state$orderedModifie2 === void 0 ? {} : _state$orderedModifie2,name = _state$orderedModifie.name;if (typeof fn === 'function') {state = fn({state: state,options: _options,name: name,instance: instance}) || state;}}},// Async and optimistically optimized update – it will not be executed if// not necessary (debounced to run at most once-per-tick)update: debounce(function () {return new Promise(function (resolve) {instance.forceUpdate();resolve(state);});}),destroy: function destroy() {cleanupModifierEffects();isDestroyed = true;}};if (!areValidElements(reference, popper)) {if (false) {}return instance;}instance.setOptions(options).then(function (state) {if (!isDestroyed && options.onFirstUpdate) {options.onFirstUpdate(state);}}); // Modifiers have the ability to execute arbitrary code before the first// update cycle runs. They will be executed in the same order as the update// cycle. This is useful when a modifier adds some persistent data that// other modifiers need to use, but the modifier is run after the dependent// one.function runModifierEffects() {state.orderedModifiers.forEach(function (_ref3) {var name = _ref3.name,_ref3$options = _ref3.options,options = _ref3$options === void 0 ? {} : _ref3$options,effect = _ref3.effect;if (typeof effect === 'function') {var cleanupFn = effect({state: state,name: name,instance: instance,options: options});var noopFn = function noopFn() {};effectCleanupFns.push(cleanupFn || noopFn);}});}function cleanupModifierEffects() {effectCleanupFns.forEach(function (fn) {return fn();});effectCleanupFns = [];}return instance;};}var createPopper = /*#__PURE__*/popperGenerator(); // eslint-disable-next-line import/no-unused-modules;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\popper.jsvar defaultModifiers = [PRPU_node_modules_popperjs_core_lib_modifiers_eventListeners, PRPU_node_modules_popperjs_core_lib_modifiers_popperOffsets, PRPU_node_modules_popperjs_core_lib_modifiers_computeStyles, PRPU_node_modules_popperjs_core_lib_modifiers_applyStyles, PRPU_node_modules_popperjs_core_lib_modifiers_offset, PRPU_node_modules_popperjs_core_lib_modifiers_flip, PRPU_node_modules_popperjs_core_lib_modifiers_preventOverflow, PRPU_node_modules_popperjs_core_lib_modifiers_arrow, PRPU_node_modules_popperjs_core_lib_modifiers_hide];var PRPU_node_modules_popperjs_core_lib_popper_createPopper = /*#__PURE__*/popperGenerator({defaultModifiers: defaultModifiers}); // eslint-disable-next-line import/no-unused-modules// eslint-disable-next-line import/no-unused-modules// eslint-disable-next-line import/no-unused-modules;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\popper-lite.jsvar PRPU_node_modules_popperjs_core_lib_popper_lite_defaultModifiers = [PRPU_node_modules_popperjs_core_lib_modifiers_eventListeners, PRPU_node_modules_popperjs_core_lib_modifiers_popperOffsets, PRPU_node_modules_popperjs_core_lib_modifiers_computeStyles, PRPU_node_modules_popperjs_core_lib_modifiers_applyStyles];var PRPU_node_modules_popperjs_core_lib_popper_lite_createPopper = /*#__PURE__*/popperGenerator({defaultModifiers: PRPU_node_modules_popperjs_core_lib_popper_lite_defaultModifiers}); // eslint-disable-next-line import/no-unused-modules;// CONCATENATED MODULE: PRPS\node_modules\@popperjs\core\lib\index.js// eslint-disable-next-line import/no-unused-modules// eslint-disable-next-line import/no-unused-modules// eslint-disable-next-line import/no-unused-modules/***/ }),/***/ 9856:/***/ ((module) => {"use strict";module.exports = "<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"16\" height=\"16\" fill=\"currentColor\" class=\"bi bi-arrow-return-left\" viewBox=\"0 0 16 16\">\n  <path fill-rule=\"evenodd\" d=\"M14.5 1.5a.5.5 0 0 1 .5.5v4.8a2.5 2.5 0 0 1-2.5 2.5H2.707l3.347 3.346a.5.5 0 0 1-.708.708l-4.2-4.2a.5.5 0 0 1 0-.708l4-4a.5.5 0 1 1 .708.708L2.707 8.3H12.5A1.5 1.5 0 0 0 14 6.8V2a.5.5 0 0 1 .5-.5z\"/>\n</svg>";/***/ }),/***/ 376:/***/ ((module) => {"use strict";module.exports = "<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"16\" height=\"16\" fill=\"currentColor\" class=\"bi bi-code-slash\" viewBox=\"0 0 16 16\">\n  <path d=\"M10.478 1.647a.5.5 0 1 0-.956-.294l-4 13a.5.5 0 0 0 .956.294l4-13zM4.854 4.146a.5.5 0 0 1 0 .708L1.707 8l3.147 3.146a.5.5 0 0 1-.708.708l-3.5-3.5a.5.5 0 0 1 0-.708l3.5-3.5a.5.5 0 0 1 .708 0zm6.292 0a.5.5 0 0 0 0 .708L14.293 8l-3.147 3.146a.5.5 0 0 0 .708.708l3.5-3.5a.5.5 0 0 0 0-.708l-3.5-3.5a.5.5 0 0 0-.708 0z\"/>\n</svg>";/***/ }),/***/ 5154:/***/ ((module) => {"use strict";module.exports = "<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"16\" height=\"16\" fill=\"currentColor\" class=\"bi bi-file-earmark-pdf\" viewBox=\"0 0 16 16\">\n  <path d=\"M14 14V4.5L9.5 0H4a2 2 0 0 0-2 2v12a2 2 0 0 0 2 2h8a2 2 0 0 0 2-2zM9.5 3A1.5 1.5 0 0 0 11 4.5h2V14a1 1 0 0 1-1 1H4a1 1 0 0 1-1-1V2a1 1 0 0 1 1-1h5.5v2z\"/>\n  <path d=\"M4.603 14.087a.81.81 0 0 1-.438-.42c-.195-.388-.13-.776.08-1.102.198-.307.526-.568.897-.787a7.68 7.68 0 0 1 1.482-.645 19.697 19.697 0 0 0 1.062-2.227 7.269 7.269 0 0 1-.43-1.295c-.086-.4-.119-.796-.046-1.136.075-.354.274-.672.65-.823.192-.077.4-.12.602-.077a.7.7 0 0 1 .477.365c.088.164.12.356.127.538.007.188-.012.396-.047.614-.084.51-.27 1.134-.52 1.794a10.954 10.954 0 0 0 .98 1.686 5.753 5.753 0 0 1 1.334.05c.364.066.734.195.96.465.12.144.193.32.2.518.007.192-.047.382-.138.563a1.04 1.04 0 0 1-.354.416.856.856 0 0 1-.51.138c-.331-.014-.654-.196-.933-.417a5.712 5.712 0 0 1-.911-.95 11.651 11.651 0 0 0-1.997.406 11.307 11.307 0 0 1-1.02 1.51c-.292.35-.609.656-.927.787a.793.793 0 0 1-.58.029zm1.379-1.901c-.166.076-.32.156-.459.238-.328.194-.541.383-.647.547-.094.145-.096.25-.04.361.01.022.02.036.026.044a.266.266 0 0 0 .035-.012c.137-.056.355-.235.635-.572a8.18 8.18 0 0 0 .45-.606zm1.64-1.33a12.71 12.71 0 0 1 1.01-.193 11.744 11.744 0 0 1-.51-.858 20.801 20.801 0 0 1-.5 1.05zm2.446.45c.15.163.296.3.435.41.24.19.407.253.498.256a.107.107 0 0 0 .07-.015.307.307 0 0 0 .094-.125.436.436 0 0 0 .059-.2.095.095 0 0 0-.026-.063c-.052-.062-.2-.152-.518-.209a3.876 3.876 0 0 0-.612-.053zM8.078 7.8a6.7 6.7 0 0 0 .2-.828c.031-.188.043-.343.038-.465a.613.613 0 0 0-.032-.198.517.517 0 0 0-.145.04c-.087.035-.158.106-.196.283-.04.192-.03.469.046.822.024.111.054.227.09.346z\"/>\n</svg>";/***/ }),/***/ 1984:/***/ ((module) => {"use strict";module.exports = "<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"16\" height=\"16\" fill=\"currentColor\" class=\"bi bi-gear-fill\" viewBox=\"0 0 16 16\">\n  <path d=\"M9.405 1.05c-.413-1.4-2.397-1.4-2.81 0l-.1.34a1.464 1.464 0 0 1-2.105.872l-.31-.17c-1.283-.698-2.686.705-1.987 1.987l.169.311c.446.82.023 1.841-.872 2.105l-.34.1c-1.4.413-1.4 2.397 0 2.81l.34.1a1.464 1.464 0 0 1 .872 2.105l-.17.31c-.698 1.283.705 2.686 1.987 1.987l.311-.169a1.464 1.464 0 0 1 2.105.872l.1.34c.413 1.4 2.397 1.4 2.81 0l.1-.34a1.464 1.464 0 0 1 2.105-.872l.31.17c1.283.698 2.686-.705 1.987-1.987l-.169-.311a1.464 1.464 0 0 1 .872-2.105l.34-.1c1.4-.413 1.4-2.397 0-2.81l-.34-.1a1.464 1.464 0 0 1-.872-2.105l.17-.31c.698-1.283-.705-2.686-1.987-1.987l-.311.169a1.464 1.464 0 0 1-2.105-.872l-.1-.34zM8 10.93a2.929 2.929 0 1 1 0-5.86 2.929 2.929 0 0 1 0 5.858z\"/>\n</svg>";/***/ }),/***/ 1739:/***/ ((module) => {"use strict";module.exports = "<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"16\" height=\"16\" fill=\"currentColor\" class=\"bi bi-github\" viewBox=\"0 0 16 16\">\n  <path d=\"M8 0C3.58 0 0 3.58 0 8c0 3.54 2.29 6.53 5.47 7.59.4.07.55-.17.55-.38 0-.19-.01-.82-.01-1.49-2.01.37-2.53-.49-2.69-.94-.09-.23-.48-.94-.82-1.13-.28-.15-.68-.52-.01-.53.63-.01 1.08.58 1.23.82.72 1.21 1.87.87 2.33.66.07-.52.28-.87.51-1.07-1.78-.2-3.64-.89-3.64-3.95 0-.87.31-1.59.82-2.15-.08-.2-.36-1.02.08-2.12 0 0 .67-.21 2.2.82.64-.18 1.32-.27 2-.27.68 0 1.36.09 2 .27 1.53-1.04 2.2-.82 2.2-.82.44 1.1.16 1.92.08 2.12.51.56.82 1.27.82 2.15 0 3.07-1.87 3.75-3.65 3.95.29.25.54.73.54 1.48 0 1.07-.01 1.93-.01 2.2 0 .21.15.46.55.38A8.012 8.012 0 0 0 16 8c0-4.42-3.58-8-8-8z\"/>\n</svg>";/***/ }),/***/ 7185:/***/ ((module) => {"use strict";module.exports = "<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"16\" height=\"16\" fill=\"currentColor\" class=\"bi bi-house\" viewBox=\"0 0 16 16\">\n  <path fill-rule=\"evenodd\" d=\"M2 13.5V7h1v6.5a.5.5 0 0 0 .5.5h9a.5.5 0 0 0 .5-.5V7h1v6.5a1.5 1.5 0 0 1-1.5 1.5h-9A1.5 1.5 0 0 1 2 13.5zm11-11V6l-2-2V2.5a.5.5 0 0 1 .5-.5h1a.5.5 0 0 1 .5.5z\"/>\n  <path fill-rule=\"evenodd\" d=\"M7.293 1.5a1 1 0 0 1 1.414 0l6.647 6.646a.5.5 0 0 1-.708.708L8 2.207 1.354 8.854a.5.5 0 1 1-.708-.708L7.293 1.5z\"/>\n</svg>";/***/ }),/***/ 4762:/***/ (function(module, __unused_webpack_exports, __webpack_require__) {/*!* Bootstrap base-component.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory(__webpack_require__(2252), __webpack_require__(983), __webpack_require__(4955)) :0;}(this, (function (Data, SelectorEngine, EventHandler) { 'use strict';function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }var Data__default = /*#__PURE__*/_interopDefaultLegacy(Data);var SelectorEngine__default = /*#__PURE__*/_interopDefaultLegacy(SelectorEngine);var EventHandler__default = /*#__PURE__*/_interopDefaultLegacy(EventHandler);const MILLISECONDS_MULTIPLIER = 1000;const TRANSITION_END = 'transitionend'; // Shoutout AngusCroll (https://goo.gl/pxwQGp)const getTransitionDurationFromElement = element => {if (!element) {return 0;} // Get transition-duration of the elementlet {transitionDuration,transitionDelay} = window.getComputedStyle(element);const floatTransitionDuration = Number.parseFloat(transitionDuration);const floatTransitionDelay = Number.parseFloat(transitionDelay); // Return 0 if element or transition duration is not foundif (!floatTransitionDuration && !floatTransitionDelay) {return 0;} // If multiple durations are defined, take the firsttransitionDuration = transitionDuration.split(',')[0];transitionDelay = transitionDelay.split(',')[0];return (Number.parseFloat(transitionDuration) + Number.parseFloat(transitionDelay)) * MILLISECONDS_MULTIPLIER;};const triggerTransitionEnd = element => {element.dispatchEvent(new Event(TRANSITION_END));};const isElement = obj => {if (!obj || typeof obj !== 'object') {return false;}if (typeof obj.jquery !== 'undefined') {obj = obj[0];}return typeof obj.nodeType !== 'undefined';};const getElement = obj => {if (isElement(obj)) {// it's a jQuery object or a node elementreturn obj.jquery ? obj[0] : obj;}if (typeof obj === 'string' && obj.length > 0) {return SelectorEngine__default['default'].findOne(obj);}return null;};const execute = callback => {if (typeof callback === 'function') {callback();}};const executeAfterTransition = (callback, transitionElement, waitForTransition = true) => {if (!waitForTransition) {execute(callback);return;}const durationPadding = 5;const emulatedDuration = getTransitionDurationFromElement(transitionElement) + durationPadding;let called = false;const handler = ({target}) => {if (target !== transitionElement) {return;}called = true;transitionElement.removeEventListener(TRANSITION_END, handler);execute(callback);};transitionElement.addEventListener(TRANSITION_END, handler);setTimeout(() => {if (!called) {triggerTransitionEnd(transitionElement);}}, emulatedDuration);};/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): base-component.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*//*** ------------------------------------------------------------------------* Constants* ------------------------------------------------------------------------*/const VERSION = '5.0.2';class BaseComponent {constructor(element) {element = getElement(element);if (!element) {return;}this._element = element;Data__default['default'].set(this._element, this.constructor.DATA_KEY, this);}dispose() {Data__default['default'].remove(this._element, this.constructor.DATA_KEY);EventHandler__default['default'].off(this._element, this.constructor.EVENT_KEY);Object.getOwnPropertyNames(this).forEach(propertyName => {this[propertyName] = null;});}_queueCallback(callback, element, isAnimated = true) {executeAfterTransition(callback, element, isAnimated);}/** Static */static getInstance(element) {return Data__default['default'].get(element, this.DATA_KEY);}static getOrCreateInstance(element, config = {}) {return this.getInstance(element) || new this(element, typeof config === 'object' ? config : null);}static get VERSION() {return VERSION;}static get NAME() {throw new Error('You have to implement the static method "NAME", for each component!');}static get DATA_KEY() {return `bs.${this.NAME}`;}static get EVENT_KEY() {return `.${this.DATA_KEY}`;}}return BaseComponent;})));//# sourceMappingURL=base-component.js.map/***/ }),/***/ 2252:/***/ (function(module) {/*!* Bootstrap data.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory() :0;}(this, (function () { 'use strict';/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): dom/data.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*//*** ------------------------------------------------------------------------* Constants* ------------------------------------------------------------------------*/const elementMap = new Map();var data = {set(element, key, instance) {if (!elementMap.has(element)) {elementMap.set(element, new Map());}const instanceMap = elementMap.get(element); // make it clear we only want one instance per element// can be removed later when multiple key/instances are fine to be usedif (!instanceMap.has(key) && instanceMap.size !== 0) {// eslint-disable-next-line no-consoleconsole.error(`Bootstrap doesn't allow more than one instance per element. Bound instance: ${Array.from(instanceMap.keys())[0]}.`);return;}instanceMap.set(key, instance);},get(element, key) {if (elementMap.has(element)) {return elementMap.get(element).get(key) || null;}return null;},remove(element, key) {if (!elementMap.has(element)) {return;}const instanceMap = elementMap.get(element);instanceMap.delete(key); // free up element references if there are no instances left for an elementif (instanceMap.size === 0) {elementMap.delete(element);}}};return data;})));//# sourceMappingURL=data.js.map/***/ }),/***/ 4955:/***/ (function(module) {/*!* Bootstrap event-handler.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory() :0;}(this, (function () { 'use strict';const getjQuery = () => {const {jQuery} = window;if (jQuery && !document.body.hasAttribute('data-bs-no-jquery')) {return jQuery;}return null;};/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): dom/event-handler.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*//*** ------------------------------------------------------------------------* Constants* ------------------------------------------------------------------------*/const namespaceRegex = /[^.]*(?=\..*)\.|.*/;const stripNameRegex = /\..*/;const stripUidRegex = /::\d+$/;const eventRegistry = {}; // Events storagelet uidEvent = 1;const customEvents = {mouseenter: 'mouseover',mouseleave: 'mouseout'};const customEventsRegex = /^(mouseenter|mouseleave)/i;const nativeEvents = new Set(['click', 'dblclick', 'mouseup', 'mousedown', 'contextmenu', 'mousewheel', 'DOMMouseScroll', 'mouseover', 'mouseout', 'mousemove', 'selectstart', 'selectend', 'keydown', 'keypress', 'keyup', 'orientationchange', 'touchstart', 'touchmove', 'touchend', 'touchcancel', 'pointerdown', 'pointermove', 'pointerup', 'pointerleave', 'pointercancel', 'gesturestart', 'gesturechange', 'gestureend', 'focus', 'blur', 'change', 'reset', 'select', 'submit', 'focusin', 'focusout', 'load', 'unload', 'beforeunload', 'resize', 'move', 'DOMContentLoaded', 'readystatechange', 'error', 'abort', 'scroll']);/*** ------------------------------------------------------------------------* Private methods* ------------------------------------------------------------------------*/function getUidEvent(element, uid) {return uid && `${uid}::${uidEvent++}` || element.uidEvent || uidEvent++;}function getEvent(element) {const uid = getUidEvent(element);element.uidEvent = uid;eventRegistry[uid] = eventRegistry[uid] || {};return eventRegistry[uid];}function bootstrapHandler(element, fn) {return function handler(event) {event.delegateTarget = element;if (handler.oneOff) {EventHandler.off(element, event.type, fn);}return fn.apply(element, [event]);};}function bootstrapDelegationHandler(element, selector, fn) {return function handler(event) {const domElements = element.querySelectorAll(selector);for (let {target} = event; target && target !== this; target = target.parentNode) {for (let i = domElements.length; i--;) {if (domElements[i] === target) {event.delegateTarget = target;if (handler.oneOff) {// eslint-disable-next-line unicorn/consistent-destructuringEventHandler.off(element, event.type, selector, fn);}return fn.apply(target, [event]);}}} // To please ESLintreturn null;};}function findHandler(events, handler, delegationSelector = null) {const uidEventList = Object.keys(events);for (let i = 0, len = uidEventList.length; i < len; i++) {const event = events[uidEventList[i]];if (event.originalHandler === handler && event.delegationSelector === delegationSelector) {return event;}}return null;}function normalizeParams(originalTypeEvent, handler, delegationFn) {const delegation = typeof handler === 'string';const originalHandler = delegation ? delegationFn : handler;let typeEvent = getTypeEvent(originalTypeEvent);const isNative = nativeEvents.has(typeEvent);if (!isNative) {typeEvent = originalTypeEvent;}return [delegation, originalHandler, typeEvent];}function addHandler(element, originalTypeEvent, handler, delegationFn, oneOff) {if (typeof originalTypeEvent !== 'string' || !element) {return;}if (!handler) {handler = delegationFn;delegationFn = null;} // in case of mouseenter or mouseleave wrap the handler within a function that checks for its DOM position// this prevents the handler from being dispatched the same way as mouseover or mouseout doesif (customEventsRegex.test(originalTypeEvent)) {const wrapFn = fn => {return function (event) {if (!event.relatedTarget || event.relatedTarget !== event.delegateTarget && !event.delegateTarget.contains(event.relatedTarget)) {return fn.call(this, event);}};};if (delegationFn) {delegationFn = wrapFn(delegationFn);} else {handler = wrapFn(handler);}}const [delegation, originalHandler, typeEvent] = normalizeParams(originalTypeEvent, handler, delegationFn);const events = getEvent(element);const handlers = events[typeEvent] || (events[typeEvent] = {});const previousFn = findHandler(handlers, originalHandler, delegation ? handler : null);if (previousFn) {previousFn.oneOff = previousFn.oneOff && oneOff;return;}const uid = getUidEvent(originalHandler, originalTypeEvent.replace(namespaceRegex, ''));const fn = delegation ? bootstrapDelegationHandler(element, handler, delegationFn) : bootstrapHandler(element, handler);fn.delegationSelector = delegation ? handler : null;fn.originalHandler = originalHandler;fn.oneOff = oneOff;fn.uidEvent = uid;handlers[uid] = fn;element.addEventListener(typeEvent, fn, delegation);}function removeHandler(element, events, typeEvent, handler, delegationSelector) {const fn = findHandler(events[typeEvent], handler, delegationSelector);if (!fn) {return;}element.removeEventListener(typeEvent, fn, Boolean(delegationSelector));delete events[typeEvent][fn.uidEvent];}function removeNamespacedHandlers(element, events, typeEvent, namespace) {const storeElementEvent = events[typeEvent] || {};Object.keys(storeElementEvent).forEach(handlerKey => {if (handlerKey.includes(namespace)) {const event = storeElementEvent[handlerKey];removeHandler(element, events, typeEvent, event.originalHandler, event.delegationSelector);}});}function getTypeEvent(event) {// allow to get the native events from namespaced events ('click.bs.button' --> 'click')event = event.replace(stripNameRegex, '');return customEvents[event] || event;}const EventHandler = {on(element, event, handler, delegationFn) {addHandler(element, event, handler, delegationFn, false);},one(element, event, handler, delegationFn) {addHandler(element, event, handler, delegationFn, true);},off(element, originalTypeEvent, handler, delegationFn) {if (typeof originalTypeEvent !== 'string' || !element) {return;}const [delegation, originalHandler, typeEvent] = normalizeParams(originalTypeEvent, handler, delegationFn);const inNamespace = typeEvent !== originalTypeEvent;const events = getEvent(element);const isNamespace = originalTypeEvent.startsWith('.');if (typeof originalHandler !== 'undefined') {// Simplest case: handler is passed, remove that listener ONLY.if (!events || !events[typeEvent]) {return;}removeHandler(element, events, typeEvent, originalHandler, delegation ? handler : null);return;}if (isNamespace) {Object.keys(events).forEach(elementEvent => {removeNamespacedHandlers(element, events, elementEvent, originalTypeEvent.slice(1));});}const storeElementEvent = events[typeEvent] || {};Object.keys(storeElementEvent).forEach(keyHandlers => {const handlerKey = keyHandlers.replace(stripUidRegex, '');if (!inNamespace || originalTypeEvent.includes(handlerKey)) {const event = storeElementEvent[keyHandlers];removeHandler(element, events, typeEvent, event.originalHandler, event.delegationSelector);}});},trigger(element, event, args) {if (typeof event !== 'string' || !element) {return null;}const $ = getjQuery();const typeEvent = getTypeEvent(event);const inNamespace = event !== typeEvent;const isNative = nativeEvents.has(typeEvent);let jQueryEvent;let bubbles = true;let nativeDispatch = true;let defaultPrevented = false;let evt = null;if (inNamespace && $) {jQueryEvent = $.Event(event, args);$(element).trigger(jQueryEvent);bubbles = !jQueryEvent.isPropagationStopped();nativeDispatch = !jQueryEvent.isImmediatePropagationStopped();defaultPrevented = jQueryEvent.isDefaultPrevented();}if (isNative) {evt = document.createEvent('HTMLEvents');evt.initEvent(typeEvent, bubbles, true);} else {evt = new CustomEvent(event, {bubbles,cancelable: true});} // merge custom information in our eventif (typeof args !== 'undefined') {Object.keys(args).forEach(key => {Object.defineProperty(evt, key, {get() {return args[key];}});});}if (defaultPrevented) {evt.preventDefault();}if (nativeDispatch) {element.dispatchEvent(evt);}if (evt.defaultPrevented && typeof jQueryEvent !== 'undefined') {jQueryEvent.preventDefault();}return evt;}};return EventHandler;})));//# sourceMappingURL=event-handler.js.map/***/ }),/***/ 301:/***/ (function(module) {/*!* Bootstrap manipulator.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory() :0;}(this, (function () { 'use strict';/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): dom/manipulator.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*/function normalizeData(val) {if (val === 'true') {return true;}if (val === 'false') {return false;}if (val === Number(val).toString()) {return Number(val);}if (val === '' || val === 'null') {return null;}return val;}function normalizeDataKey(key) {return key.replace(/[A-Z]/g, chr => `-${chr.toLowerCase()}`);}const Manipulator = {setDataAttribute(element, key, value) {element.setAttribute(`data-bs-${normalizeDataKey(key)}`, value);},removeDataAttribute(element, key) {element.removeAttribute(`data-bs-${normalizeDataKey(key)}`);},getDataAttributes(element) {if (!element) {return {};}const attributes = {};Object.keys(element.dataset).filter(key => key.startsWith('bs')).forEach(key => {let pureKey = key.replace(/^bs/, '');pureKey = pureKey.charAt(0).toLowerCase() + pureKey.slice(1, pureKey.length);attributes[pureKey] = normalizeData(element.dataset[key]);});return attributes;},getDataAttribute(element, key) {return normalizeData(element.getAttribute(`data-bs-${normalizeDataKey(key)}`));},offset(element) {const rect = element.getBoundingClientRect();return {top: rect.top + document.body.scrollTop,left: rect.left + document.body.scrollLeft};},position(element) {return {top: element.offsetTop,left: element.offsetLeft};}};return Manipulator;})));//# sourceMappingURL=manipulator.js.map/***/ }),/***/ 983:/***/ (function(module) {/*!* Bootstrap selector-engine.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory() :0;}(this, (function () { 'use strict';/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): dom/selector-engine.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*//*** ------------------------------------------------------------------------* Constants* ------------------------------------------------------------------------*/const NODE_TEXT = 3;const SelectorEngine = {find(selector, element = document.documentElement) {return [].concat(...Element.prototype.querySelectorAll.call(element, selector));},findOne(selector, element = document.documentElement) {return Element.prototype.querySelector.call(element, selector);},children(element, selector) {return [].concat(...element.children).filter(child => child.matches(selector));},parents(element, selector) {const parents = [];let ancestor = element.parentNode;while (ancestor && ancestor.nodeType === Node.ELEMENT_NODE && ancestor.nodeType !== NODE_TEXT) {if (ancestor.matches(selector)) {parents.push(ancestor);}ancestor = ancestor.parentNode;}return parents;},prev(element, selector) {let previous = element.previousElementSibling;while (previous) {if (previous.matches(selector)) {return [previous];}previous = previous.previousElementSibling;}return [];},next(element, selector) {let next = element.nextElementSibling;while (next) {if (next.matches(selector)) {return [next];}next = next.nextElementSibling;}return [];}};return SelectorEngine;})));//# sourceMappingURL=selector-engine.js.map/***/ }),/***/ 6960:/***/ (function(module, __unused_webpack_exports, __webpack_require__) {/*!* Bootstrap popover.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory(__webpack_require__(983), __webpack_require__(3632)) :0;}(this, (function (SelectorEngine, Tooltip) { 'use strict';function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }var SelectorEngine__default = /*#__PURE__*/_interopDefaultLegacy(SelectorEngine);var Tooltip__default = /*#__PURE__*/_interopDefaultLegacy(Tooltip);const getjQuery = () => {const {jQuery} = window;if (jQuery && !document.body.hasAttribute('data-bs-no-jquery')) {return jQuery;}return null;};const DOMContentLoadedCallbacks = [];const onDOMContentLoaded = callback => {if (document.readyState === 'loading') {// add listener on the first call when the document is in loading stateif (!DOMContentLoadedCallbacks.length) {document.addEventListener('DOMContentLoaded', () => {DOMContentLoadedCallbacks.forEach(callback => callback());});}DOMContentLoadedCallbacks.push(callback);} else {callback();}};const defineJQueryPlugin = plugin => {onDOMContentLoaded(() => {const $ = getjQuery();/* istanbul ignore if */if ($) {const name = plugin.NAME;const JQUERY_NO_CONFLICT = $.fn[name];$.fn[name] = plugin.jQueryInterface;$.fn[name].Constructor = plugin;$.fn[name].noConflict = () => {$.fn[name] = JQUERY_NO_CONFLICT;return plugin.jQueryInterface;};}});};/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): popover.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*//*** ------------------------------------------------------------------------* Constants* ------------------------------------------------------------------------*/const NAME = 'popover';const DATA_KEY = 'bs.popover';const EVENT_KEY = `.${DATA_KEY}`;const CLASS_PREFIX = 'bs-popover';const BSCLS_PREFIX_REGEX = new RegExp(`(^|\\s)${CLASS_PREFIX}\\S+`, 'g');const Default = { ...Tooltip__default['default'].Default,placement: 'right',offset: [0, 8],trigger: 'click',content: '',template: '<div class="popover" role="tooltip">' + '<div class="popover-arrow"></div>' + '<h3 class="popover-header"></h3>' + '<div class="popover-body"></div>' + '</div>'};const DefaultType = { ...Tooltip__default['default'].DefaultType,content: '(string|element|function)'};const Event = {HIDE: `hide${EVENT_KEY}`,HIDDEN: `hidden${EVENT_KEY}`,SHOW: `show${EVENT_KEY}`,SHOWN: `shown${EVENT_KEY}`,INSERTED: `inserted${EVENT_KEY}`,CLICK: `click${EVENT_KEY}`,FOCUSIN: `focusin${EVENT_KEY}`,FOCUSOUT: `focusout${EVENT_KEY}`,MOUSEENTER: `mouseenter${EVENT_KEY}`,MOUSELEAVE: `mouseleave${EVENT_KEY}`};const CLASS_NAME_FADE = 'fade';const CLASS_NAME_SHOW = 'show';const SELECTOR_TITLE = '.popover-header';const SELECTOR_CONTENT = '.popover-body';/*** ------------------------------------------------------------------------* Class Definition* ------------------------------------------------------------------------*/class Popover extends Tooltip__default['default'] {// Gettersstatic get Default() {return Default;}static get NAME() {return NAME;}static get Event() {return Event;}static get DefaultType() {return DefaultType;} // OverridesisWithContent() {return this.getTitle() || this._getContent();}getTipElement() {if (this.tip) {return this.tip;}this.tip = super.getTipElement();if (!this.getTitle()) {SelectorEngine__default['default'].findOne(SELECTOR_TITLE, this.tip).remove();}if (!this._getContent()) {SelectorEngine__default['default'].findOne(SELECTOR_CONTENT, this.tip).remove();}return this.tip;}setContent() {const tip = this.getTipElement(); // we use append for html objects to maintain js eventsthis.setElementContent(SelectorEngine__default['default'].findOne(SELECTOR_TITLE, tip), this.getTitle());let content = this._getContent();if (typeof content === 'function') {content = content.call(this._element);}this.setElementContent(SelectorEngine__default['default'].findOne(SELECTOR_CONTENT, tip), content);tip.classList.remove(CLASS_NAME_FADE, CLASS_NAME_SHOW);} // Private_addAttachmentClass(attachment) {this.getTipElement().classList.add(`${CLASS_PREFIX}-${this.updateAttachment(attachment)}`);}_getContent() {return this._element.getAttribute('data-bs-content') || this._config.content;}_cleanTipClass() {const tip = this.getTipElement();const tabClass = tip.getAttribute('class').match(BSCLS_PREFIX_REGEX);if (tabClass !== null && tabClass.length > 0) {tabClass.map(token => token.trim()).forEach(tClass => tip.classList.remove(tClass));}} // Staticstatic jQueryInterface(config) {return this.each(function () {const data = Popover.getOrCreateInstance(this, config);if (typeof config === 'string') {if (typeof data[config] === 'undefined') {throw new TypeError(`No method named "${config}"`);}data[config]();}});}}/*** ------------------------------------------------------------------------* jQuery* ------------------------------------------------------------------------* add .Popover to jQuery only if jQuery is present*/defineJQueryPlugin(Popover);return Popover;})));//# sourceMappingURL=popover.js.map/***/ }),/***/ 3632:/***/ (function(module, __unused_webpack_exports, __webpack_require__) {/*!* Bootstrap tooltip.js v5.0.2 (https://getbootstrap.com/)* Copyright 2011-2021 The Bootstrap Authors (https://github.com/twbs/bootstrap/graphs/contributors)* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)*/(function (global, factory) {true ? module.exports = factory(__webpack_require__(3518), __webpack_require__(983), __webpack_require__(2252), __webpack_require__(4955), __webpack_require__(301), __webpack_require__(4762)) :0;}(this, (function (Popper, SelectorEngine, Data, EventHandler, Manipulator, BaseComponent) { 'use strict';function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }function _interopNamespace(e) {if (e && e.__esModule) return e;var n = Object.create(null);if (e) {Object.keys(e).forEach(function (k) {if (k !== 'default') {var d = Object.getOwnPropertyDescriptor(e, k);Object.defineProperty(n, k, d.get ? d : {enumerable: true,get: function () {return e[k];}});}});}n['default'] = e;return Object.freeze(n);}var Popper__namespace = /*#__PURE__*/_interopNamespace(Popper);var SelectorEngine__default = /*#__PURE__*/_interopDefaultLegacy(SelectorEngine);var Data__default = /*#__PURE__*/_interopDefaultLegacy(Data);var EventHandler__default = /*#__PURE__*/_interopDefaultLegacy(EventHandler);var Manipulator__default = /*#__PURE__*/_interopDefaultLegacy(Manipulator);var BaseComponent__default = /*#__PURE__*/_interopDefaultLegacy(BaseComponent);/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): util/index.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*/const MAX_UID = 1000000;const toType = obj => {if (obj === null || obj === undefined) {return `${obj}`;}return {}.toString.call(obj).match(/\s([a-z]+)/i)[1].toLowerCase();};/*** --------------------------------------------------------------------------* Public Util Api* --------------------------------------------------------------------------*/const getUID = prefix => {do {prefix += Math.floor(Math.random() * MAX_UID);} while (document.getElementById(prefix));return prefix;};const isElement = obj => {if (!obj || typeof obj !== 'object') {return false;}if (typeof obj.jquery !== 'undefined') {obj = obj[0];}return typeof obj.nodeType !== 'undefined';};const getElement = obj => {if (isElement(obj)) {// it's a jQuery object or a node elementreturn obj.jquery ? obj[0] : obj;}if (typeof obj === 'string' && obj.length > 0) {return SelectorEngine__default['default'].findOne(obj);}return null;};const typeCheckConfig = (componentName, config, configTypes) => {Object.keys(configTypes).forEach(property => {const expectedTypes = configTypes[property];const value = config[property];const valueType = value && isElement(value) ? 'element' : toType(value);if (!new RegExp(expectedTypes).test(valueType)) {throw new TypeError(`${componentName.toUpperCase()}: Option "${property}" provided type "${valueType}" but expected type "${expectedTypes}".`);}});};const findShadowRoot = element => {if (!document.documentElement.attachShadow) {return null;} // Can find the shadow root otherwise it'll return the documentif (typeof element.getRootNode === 'function') {const root = element.getRootNode();return root instanceof ShadowRoot ? root : null;}if (element instanceof ShadowRoot) {return element;} // when we don't find a shadow rootif (!element.parentNode) {return null;}return findShadowRoot(element.parentNode);};const noop = () => {};const getjQuery = () => {const {jQuery} = window;if (jQuery && !document.body.hasAttribute('data-bs-no-jquery')) {return jQuery;}return null;};const DOMContentLoadedCallbacks = [];const onDOMContentLoaded = callback => {if (document.readyState === 'loading') {// add listener on the first call when the document is in loading stateif (!DOMContentLoadedCallbacks.length) {document.addEventListener('DOMContentLoaded', () => {DOMContentLoadedCallbacks.forEach(callback => callback());});}DOMContentLoadedCallbacks.push(callback);} else {callback();}};const isRTL = () => document.documentElement.dir === 'rtl';const defineJQueryPlugin = plugin => {onDOMContentLoaded(() => {const $ = getjQuery();/* istanbul ignore if */if ($) {const name = plugin.NAME;const JQUERY_NO_CONFLICT = $.fn[name];$.fn[name] = plugin.jQueryInterface;$.fn[name].Constructor = plugin;$.fn[name].noConflict = () => {$.fn[name] = JQUERY_NO_CONFLICT;return plugin.jQueryInterface;};}});};/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): util/sanitizer.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*/const uriAttrs = new Set(['background', 'cite', 'href', 'itemtype', 'longdesc', 'poster', 'src', 'xlink:href']);const ARIA_ATTRIBUTE_PATTERN = /^aria-[\w-]*$/i;/*** A pattern that recognizes a commonly useful subset of URLs that are safe.** Shoutout to Angular 7 https://github.com/angular/angular/blob/7.2.4/packages/core/src/sanitization/url_sanitizer.ts*/const SAFE_URL_PATTERN = /^(?:(?:https?|mailto|ftp|tel|file):|[^#&/:?]*(?:[#/?]|$))/i;/*** A pattern that matches safe data URLs. Only matches image, video and audio types.** Shoutout to Angular 7 https://github.com/angular/angular/blob/7.2.4/packages/core/src/sanitization/url_sanitizer.ts*/const DATA_URL_PATTERN = /^data:(?:image\/(?:bmp|gif|jpeg|jpg|png|tiff|webp)|video\/(?:mpeg|mp4|ogg|webm)|audio\/(?:mp3|oga|ogg|opus));base64,[\d+/a-z]+=*$/i;const allowedAttribute = (attr, allowedAttributeList) => {const attrName = attr.nodeName.toLowerCase();if (allowedAttributeList.includes(attrName)) {if (uriAttrs.has(attrName)) {return Boolean(SAFE_URL_PATTERN.test(attr.nodeValue) || DATA_URL_PATTERN.test(attr.nodeValue));}return true;}const regExp = allowedAttributeList.filter(attrRegex => attrRegex instanceof RegExp); // Check if a regular expression validates the attribute.for (let i = 0, len = regExp.length; i < len; i++) {if (regExp[i].test(attrName)) {return true;}}return false;};const DefaultAllowlist = {// Global attributes allowed on any supplied element below.'*': ['class', 'dir', 'id', 'lang', 'role', ARIA_ATTRIBUTE_PATTERN],a: ['target', 'href', 'title', 'rel'],area: [],b: [],br: [],col: [],code: [],div: [],em: [],hr: [],h1: [],h2: [],h3: [],h4: [],h5: [],h6: [],i: [],img: ['src', 'srcset', 'alt', 'title', 'width', 'height'],li: [],ol: [],p: [],pre: [],s: [],small: [],span: [],sub: [],sup: [],strong: [],u: [],ul: []};function sanitizeHtml(unsafeHtml, allowList, sanitizeFn) {if (!unsafeHtml.length) {return unsafeHtml;}if (sanitizeFn && typeof sanitizeFn === 'function') {return sanitizeFn(unsafeHtml);}const domParser = new window.DOMParser();const createdDocument = domParser.parseFromString(unsafeHtml, 'text/html');const allowlistKeys = Object.keys(allowList);const elements = [].concat(...createdDocument.body.querySelectorAll('*'));for (let i = 0, len = elements.length; i < len; i++) {const el = elements[i];const elName = el.nodeName.toLowerCase();if (!allowlistKeys.includes(elName)) {el.remove();continue;}const attributeList = [].concat(...el.attributes);const allowedAttributes = [].concat(allowList['*'] || [], allowList[elName] || []);attributeList.forEach(attr => {if (!allowedAttribute(attr, allowedAttributes)) {el.removeAttribute(attr.nodeName);}});}return createdDocument.body.innerHTML;}/*** --------------------------------------------------------------------------* Bootstrap (v5.0.2): tooltip.js* Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE)* --------------------------------------------------------------------------*//*** ------------------------------------------------------------------------* Constants* ------------------------------------------------------------------------*/const NAME = 'tooltip';const DATA_KEY = 'bs.tooltip';const EVENT_KEY = `.${DATA_KEY}`;const CLASS_PREFIX = 'bs-tooltip';const BSCLS_PREFIX_REGEX = new RegExp(`(^|\\s)${CLASS_PREFIX}\\S+`, 'g');const DISALLOWED_ATTRIBUTES = new Set(['sanitize', 'allowList', 'sanitizeFn']);const DefaultType = {animation: 'boolean',template: 'string',title: '(string|element|function)',trigger: 'string',delay: '(number|object)',html: 'boolean',selector: '(string|boolean)',placement: '(string|function)',offset: '(array|string|function)',container: '(string|element|boolean)',fallbackPlacements: 'array',boundary: '(string|element)',customClass: '(string|function)',sanitize: 'boolean',sanitizeFn: '(null|function)',allowList: 'object',popperConfig: '(null|object|function)'};const AttachmentMap = {AUTO: 'auto',TOP: 'top',RIGHT: isRTL() ? 'left' : 'right',BOTTOM: 'bottom',LEFT: isRTL() ? 'right' : 'left'};const Default = {animation: true,template: '<div class="tooltip" role="tooltip">' + '<div class="tooltip-arrow"></div>' + '<div class="tooltip-inner"></div>' + '</div>',trigger: 'hover focus',title: '',delay: 0,html: false,selector: false,placement: 'top',offset: [0, 0],container: false,fallbackPlacements: ['top', 'right', 'bottom', 'left'],boundary: 'clippingParents',customClass: '',sanitize: true,sanitizeFn: null,allowList: DefaultAllowlist,popperConfig: null};const Event = {HIDE: `hide${EVENT_KEY}`,HIDDEN: `hidden${EVENT_KEY}`,SHOW: `show${EVENT_KEY}`,SHOWN: `shown${EVENT_KEY}`,INSERTED: `inserted${EVENT_KEY}`,CLICK: `click${EVENT_KEY}`,FOCUSIN: `focusin${EVENT_KEY}`,FOCUSOUT: `focusout${EVENT_KEY}`,MOUSEENTER: `mouseenter${EVENT_KEY}`,MOUSELEAVE: `mouseleave${EVENT_KEY}`};const CLASS_NAME_FADE = 'fade';const CLASS_NAME_MODAL = 'modal';const CLASS_NAME_SHOW = 'show';const HOVER_STATE_SHOW = 'show';const HOVER_STATE_OUT = 'out';const SELECTOR_TOOLTIP_INNER = '.tooltip-inner';const TRIGGER_HOVER = 'hover';const TRIGGER_FOCUS = 'focus';const TRIGGER_CLICK = 'click';const TRIGGER_MANUAL = 'manual';/*** ------------------------------------------------------------------------* Class Definition* ------------------------------------------------------------------------*/class Tooltip extends BaseComponent__default['default'] {constructor(element, config) {if (typeof Popper__namespace === 'undefined') {throw new TypeError('Bootstrap\'s tooltips require Popper (https://popper.js.org)');}super(element); // privatethis._isEnabled = true;this._timeout = 0;this._hoverState = '';this._activeTrigger = {};this._popper = null; // Protectedthis._config = this._getConfig(config);this.tip = null;this._setListeners();} // Gettersstatic get Default() {return Default;}static get NAME() {return NAME;}static get Event() {return Event;}static get DefaultType() {return DefaultType;} // Publicenable() {this._isEnabled = true;}disable() {this._isEnabled = false;}toggleEnabled() {this._isEnabled = !this._isEnabled;}toggle(event) {if (!this._isEnabled) {return;}if (event) {const context = this._initializeOnDelegatedTarget(event);context._activeTrigger.click = !context._activeTrigger.click;if (context._isWithActiveTrigger()) {context._enter(null, context);} else {context._leave(null, context);}} else {if (this.getTipElement().classList.contains(CLASS_NAME_SHOW)) {this._leave(null, this);return;}this._enter(null, this);}}dispose() {clearTimeout(this._timeout);EventHandler__default['default'].off(this._element.closest(`.${CLASS_NAME_MODAL}`), 'hide.bs.modal', this._hideModalHandler);if (this.tip) {this.tip.remove();}if (this._popper) {this._popper.destroy();}super.dispose();}show() {if (this._element.style.display === 'none') {throw new Error('Please use show on visible elements');}if (!(this.isWithContent() && this._isEnabled)) {return;}const showEvent = EventHandler__default['default'].trigger(this._element, this.constructor.Event.SHOW);const shadowRoot = findShadowRoot(this._element);const isInTheDom = shadowRoot === null ? this._element.ownerDocument.documentElement.contains(this._element) : shadowRoot.contains(this._element);if (showEvent.defaultPrevented || !isInTheDom) {return;}const tip = this.getTipElement();const tipId = getUID(this.constructor.NAME);tip.setAttribute('id', tipId);this._element.setAttribute('aria-describedby', tipId);this.setContent();if (this._config.animation) {tip.classList.add(CLASS_NAME_FADE);}const placement = typeof this._config.placement === 'function' ? this._config.placement.call(this, tip, this._element) : this._config.placement;const attachment = this._getAttachment(placement);this._addAttachmentClass(attachment);const {container} = this._config;Data__default['default'].set(tip, this.constructor.DATA_KEY, this);if (!this._element.ownerDocument.documentElement.contains(this.tip)) {container.appendChild(tip);EventHandler__default['default'].trigger(this._element, this.constructor.Event.INSERTED);}if (this._popper) {this._popper.update();} else {this._popper = Popper__namespace.createPopper(this._element, tip, this._getPopperConfig(attachment));}tip.classList.add(CLASS_NAME_SHOW);const customClass = typeof this._config.customClass === 'function' ? this._config.customClass() : this._config.customClass;if (customClass) {tip.classList.add(...customClass.split(' '));} // If this is a touch-enabled device we add extra// empty mouseover listeners to the body's immediate children;// only needed because of broken event delegation on iOS// https://www.quirksmode.org/blog/archives/2014/02/mouse_event_bub.htmlif ('ontouchstart' in document.documentElement) {[].concat(...document.body.children).forEach(element => {EventHandler__default['default'].on(element, 'mouseover', noop);});}const complete = () => {const prevHoverState = this._hoverState;this._hoverState = null;EventHandler__default['default'].trigger(this._element, this.constructor.Event.SHOWN);if (prevHoverState === HOVER_STATE_OUT) {this._leave(null, this);}};const isAnimated = this.tip.classList.contains(CLASS_NAME_FADE);this._queueCallback(complete, this.tip, isAnimated);}hide() {if (!this._popper) {return;}const tip = this.getTipElement();const complete = () => {if (this._isWithActiveTrigger()) {return;}if (this._hoverState !== HOVER_STATE_SHOW) {tip.remove();}this._cleanTipClass();this._element.removeAttribute('aria-describedby');EventHandler__default['default'].trigger(this._element, this.constructor.Event.HIDDEN);if (this._popper) {this._popper.destroy();this._popper = null;}};const hideEvent = EventHandler__default['default'].trigger(this._element, this.constructor.Event.HIDE);if (hideEvent.defaultPrevented) {return;}tip.classList.remove(CLASS_NAME_SHOW); // If this is a touch-enabled device we remove the extra// empty mouseover listeners we added for iOS supportif ('ontouchstart' in document.documentElement) {[].concat(...document.body.children).forEach(element => EventHandler__default['default'].off(element, 'mouseover', noop));}this._activeTrigger[TRIGGER_CLICK] = false;this._activeTrigger[TRIGGER_FOCUS] = false;this._activeTrigger[TRIGGER_HOVER] = false;const isAnimated = this.tip.classList.contains(CLASS_NAME_FADE);this._queueCallback(complete, this.tip, isAnimated);this._hoverState = '';}update() {if (this._popper !== null) {this._popper.update();}} // ProtectedisWithContent() {return Boolean(this.getTitle());}getTipElement() {if (this.tip) {return this.tip;}const element = document.createElement('div');element.innerHTML = this._config.template;this.tip = element.children[0];return this.tip;}setContent() {const tip = this.getTipElement();this.setElementContent(SelectorEngine__default['default'].findOne(SELECTOR_TOOLTIP_INNER, tip), this.getTitle());tip.classList.remove(CLASS_NAME_FADE, CLASS_NAME_SHOW);}setElementContent(element, content) {if (element === null) {return;}if (isElement(content)) {content = getElement(content); // content is a DOM node or a jQueryif (this._config.html) {if (content.parentNode !== element) {element.innerHTML = '';element.appendChild(content);}} else {element.textContent = content.textContent;}return;}if (this._config.html) {if (this._config.sanitize) {content = sanitizeHtml(content, this._config.allowList, this._config.sanitizeFn);}element.innerHTML = content;} else {element.textContent = content;}}getTitle() {let title = this._element.getAttribute('data-bs-original-title');if (!title) {title = typeof this._config.title === 'function' ? this._config.title.call(this._element) : this._config.title;}return title;}updateAttachment(attachment) {if (attachment === 'right') {return 'end';}if (attachment === 'left') {return 'start';}return attachment;} // Private_initializeOnDelegatedTarget(event, context) {const dataKey = this.constructor.DATA_KEY;context = context || Data__default['default'].get(event.delegateTarget, dataKey);if (!context) {context = new this.constructor(event.delegateTarget, this._getDelegateConfig());Data__default['default'].set(event.delegateTarget, dataKey, context);}return context;}_getOffset() {const {offset} = this._config;if (typeof offset === 'string') {return offset.split(',').map(val => Number.parseInt(val, 10));}if (typeof offset === 'function') {return popperData => offset(popperData, this._element);}return offset;}_getPopperConfig(attachment) {const defaultBsPopperConfig = {placement: attachment,modifiers: [{name: 'flip',options: {fallbackPlacements: this._config.fallbackPlacements}}, {name: 'offset',options: {offset: this._getOffset()}}, {name: 'preventOverflow',options: {boundary: this._config.boundary}}, {name: 'arrow',options: {element: `.${this.constructor.NAME}-arrow`}}, {name: 'onChange',enabled: true,phase: 'afterWrite',fn: data => this._handlePopperPlacementChange(data)}],onFirstUpdate: data => {if (data.options.placement !== data.placement) {this._handlePopperPlacementChange(data);}}};return { ...defaultBsPopperConfig,...(typeof this._config.popperConfig === 'function' ? this._config.popperConfig(defaultBsPopperConfig) : this._config.popperConfig)};}_addAttachmentClass(attachment) {this.getTipElement().classList.add(`${CLASS_PREFIX}-${this.updateAttachment(attachment)}`);}_getAttachment(placement) {return AttachmentMap[placement.toUpperCase()];}_setListeners() {const triggers = this._config.trigger.split(' ');triggers.forEach(trigger => {if (trigger === 'click') {EventHandler__default['default'].on(this._element, this.constructor.Event.CLICK, this._config.selector, event => this.toggle(event));} else if (trigger !== TRIGGER_MANUAL) {const eventIn = trigger === TRIGGER_HOVER ? this.constructor.Event.MOUSEENTER : this.constructor.Event.FOCUSIN;const eventOut = trigger === TRIGGER_HOVER ? this.constructor.Event.MOUSELEAVE : this.constructor.Event.FOCUSOUT;EventHandler__default['default'].on(this._element, eventIn, this._config.selector, event => this._enter(event));EventHandler__default['default'].on(this._element, eventOut, this._config.selector, event => this._leave(event));}});this._hideModalHandler = () => {if (this._element) {this.hide();}};EventHandler__default['default'].on(this._element.closest(`.${CLASS_NAME_MODAL}`), 'hide.bs.modal', this._hideModalHandler);if (this._config.selector) {this._config = { ...this._config,trigger: 'manual',selector: ''};} else {this._fixTitle();}}_fixTitle() {const title = this._element.getAttribute('title');const originalTitleType = typeof this._element.getAttribute('data-bs-original-title');if (title || originalTitleType !== 'string') {this._element.setAttribute('data-bs-original-title', title || '');if (title && !this._element.getAttribute('aria-label') && !this._element.textContent) {this._element.setAttribute('aria-label', title);}this._element.setAttribute('title', '');}}_enter(event, context) {context = this._initializeOnDelegatedTarget(event, context);if (event) {context._activeTrigger[event.type === 'focusin' ? TRIGGER_FOCUS : TRIGGER_HOVER] = true;}if (context.getTipElement().classList.contains(CLASS_NAME_SHOW) || context._hoverState === HOVER_STATE_SHOW) {context._hoverState = HOVER_STATE_SHOW;return;}clearTimeout(context._timeout);context._hoverState = HOVER_STATE_SHOW;if (!context._config.delay || !context._config.delay.show) {context.show();return;}context._timeout = setTimeout(() => {if (context._hoverState === HOVER_STATE_SHOW) {context.show();}}, context._config.delay.show);}_leave(event, context) {context = this._initializeOnDelegatedTarget(event, context);if (event) {context._activeTrigger[event.type === 'focusout' ? TRIGGER_FOCUS : TRIGGER_HOVER] = context._element.contains(event.relatedTarget);}if (context._isWithActiveTrigger()) {return;}clearTimeout(context._timeout);context._hoverState = HOVER_STATE_OUT;if (!context._config.delay || !context._config.delay.hide) {context.hide();return;}context._timeout = setTimeout(() => {if (context._hoverState === HOVER_STATE_OUT) {context.hide();}}, context._config.delay.hide);}_isWithActiveTrigger() {for (const trigger in this._activeTrigger) {if (this._activeTrigger[trigger]) {return true;}}return false;}_getConfig(config) {const dataAttributes = Manipulator__default['default'].getDataAttributes(this._element);Object.keys(dataAttributes).forEach(dataAttr => {if (DISALLOWED_ATTRIBUTES.has(dataAttr)) {delete dataAttributes[dataAttr];}});config = { ...this.constructor.Default,...dataAttributes,...(typeof config === 'object' && config ? config : {})};config.container = config.container === false ? document.body : getElement(config.container);if (typeof config.delay === 'number') {config.delay = {show: config.delay,hide: config.delay};}if (typeof config.title === 'number') {config.title = config.title.toString();}if (typeof config.content === 'number') {config.content = config.content.toString();}typeCheckConfig(NAME, config, this.constructor.DefaultType);if (config.sanitize) {config.template = sanitizeHtml(config.template, config.allowList, config.sanitizeFn);}return config;}_getDelegateConfig() {const config = {};if (this._config) {for (const key in this._config) {if (this.constructor.Default[key] !== this._config[key]) {config[key] = this._config[key];}}}return config;}_cleanTipClass() {const tip = this.getTipElement();const tabClass = tip.getAttribute('class').match(BSCLS_PREFIX_REGEX);if (tabClass !== null && tabClass.length > 0) {tabClass.map(token => token.trim()).forEach(tClass => tip.classList.remove(tClass));}}_handlePopperPlacementChange(popperData) {const {state} = popperData;if (!state) {return;}this.tip = state.elements.popper;this._cleanTipClass();this._addAttachmentClass(this._getAttachment(state.placement));} // Staticstatic jQueryInterface(config) {return this.each(function () {const data = Tooltip.getOrCreateInstance(this, config);if (typeof config === 'string') {if (typeof data[config] === 'undefined') {throw new TypeError(`No method named "${config}"`);}data[config]();}});}}/*** ------------------------------------------------------------------------* jQuery* ------------------------------------------------------------------------* add .Tooltip to jQuery only if jQuery is present*/defineJQueryPlugin(Tooltip);return Tooltip;})));//# sourceMappingURL=tooltip.js.map/***/ }),/***/ 5324:/***/ ((module, __webpack_exports__, __webpack_require__) => {"use strict";/* harmony export */ __webpack_require__.d(__webpack_exports__, {/* harmony export */   "Z": () => (__WEBPACK_DEFAULT_EXPORT__)/* harmony export */ });/* harmony import */ var _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(718);/* harmony import */ var _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_0__);// Importsvar ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_0___default()(function(i){return i[1]});// Module___CSS_LOADER_EXPORT___.push([module.id, ".pizyds_rain .disabledField{pointer-events:none;opacity:.8}.pizyds_rain .pizyds_rain_button_field_type_1{right:110px !important}.pizyds_rain .rotating{-webkit-animation:rotation 2s infinite linear;animation:rotation 2s infinite linear}@-webkit-keyframes rotation{from{transform:rotate(0deg)}to{transform:rotate(359deg)}}@keyframes rotation{from{transform:rotate(0deg)}to{transform:rotate(359deg)}}.pizyds_rain .noselect{-webkit-touch-callout:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.pizyds_rain #pizyds_rain_answer_font_size_default{cursor:pointer}.pizyds_rain #pizyds_rain_answer_font_size_show{display:inline-block;width:20px}.pizyds_rain .no-text-decoration{text-decoration:none !important}.pizyds_rain .inherit-color{color:inherit !important}.pizyds_rain .footer-span{text-align:center;display:block;opacity:.5}.pizyds_rain .footer-span a{text-decoration:none !important;color:inherit !important}.pizyds_rain #pizyds_rain_footer_field{padding-top:10px}.pizyds_rain #pizyds_rain_header_message{color:red}.pizyds_rain :root{--bs-blue: #0d6efd;--bs-indigo: #6610f2;--bs-purple: #6f42c1;--bs-pink: #d63384;--bs-red: #dc3545;--bs-orange: #fd7e14;--bs-yellow: #ffc107;--bs-green: #198754;--bs-teal: #20c997;--bs-cyan: #0dcaf0;--bs-white: #fff;--bs-gray: #6c757d;--bs-gray-dark: #343a40;--bs-primary: #0d6efd;--bs-secondary: #6c757d;--bs-success: #198754;--bs-info: #0dcaf0;--bs-warning: #ffc107;--bs-danger: #dc3545;--bs-light: #f8f9fa;--bs-dark: #212529;--bs-font-sans-serif: system-ui, -apple-system, \"Segoe UI\", Roboto, \"Helvetica Neue\", Arial, \"Noto Sans\", \"Liberation Sans\", sans-serif, \"Apple Color Emoji\", \"Segoe UI Emoji\", \"Segoe UI Symbol\", \"Noto Color Emoji\";--bs-font-monospace: SFMono-Regular, Menlo, Monaco, Consolas, \"Liberation Mono\", \"Courier New\", monospace;--bs-gradient: linear-gradient(180deg, rgba(255, 255, 255, 0.15), rgba(255, 255, 255, 0))}.pizyds_rain *,.pizyds_rain *::before,.pizyds_rain *::after{box-sizing:border-box}@media(prefers-reduced-motion: no-preference){.pizyds_rain :root{scroll-behavior:smooth}}.pizyds_rain body{margin:0;font-family:var(--bs-font-sans-serif);font-size:1rem;font-weight:400;line-height:1.5;color:#212529;background-color:#fff;-webkit-text-size-adjust:100%;-webkit-tap-highlight-color:rgba(0,0,0,0)}.pizyds_rain hr{margin:1rem 0;color:inherit;background-color:currentColor;border:0;opacity:.25}.pizyds_rain hr:not([size]){height:1px}.pizyds_rain h6,.pizyds_rain .h6,.pizyds_rain h5,.pizyds_rain .h5,.pizyds_rain h4,.pizyds_rain .h4,.pizyds_rain h3,.pizyds_rain .h3,.pizyds_rain h2,.pizyds_rain .h2,.pizyds_rain h1,.pizyds_rain .h1{margin-top:0;margin-bottom:.5rem;font-weight:500;line-height:1.2}.pizyds_rain h1,.pizyds_rain .h1{font-size:calc(1.375rem + 1.5vw)}@media(min-width: 1200px){.pizyds_rain h1,.pizyds_rain .h1{font-size:2.5rem}}.pizyds_rain h2,.pizyds_rain .h2{font-size:calc(1.325rem + 0.9vw)}@media(min-width: 1200px){.pizyds_rain h2,.pizyds_rain .h2{font-size:2rem}}.pizyds_rain h3,.pizyds_rain .h3{font-size:calc(1.3rem + 0.6vw)}@media(min-width: 1200px){.pizyds_rain h3,.pizyds_rain .h3{font-size:1.75rem}}.pizyds_rain h4,.pizyds_rain .h4{font-size:calc(1.275rem + 0.3vw)}@media(min-width: 1200px){.pizyds_rain h4,.pizyds_rain .h4{font-size:1.5rem}}.pizyds_rain h5,.pizyds_rain .h5{font-size:1.25rem}.pizyds_rain h6,.pizyds_rain .h6{font-size:1rem}.pizyds_rain p{margin-top:0;margin-bottom:1rem}.pizyds_rain abbr[title],.pizyds_rain abbr[data-bs-original-title]{-webkit-text-decoration:underline dotted;text-decoration:underline dotted;cursor:help;-webkit-text-decoration-skip-ink:none;text-decoration-skip-ink:none}.pizyds_rain address{margin-bottom:1rem;font-style:normal;line-height:inherit}.pizyds_rain ol,.pizyds_rain ul{padding-left:2rem}.pizyds_rain ol,.pizyds_rain ul,.pizyds_rain dl{margin-top:0;margin-bottom:1rem}.pizyds_rain ol ol,.pizyds_rain ul ul,.pizyds_rain ol ul,.pizyds_rain ul ol{margin-bottom:0}.pizyds_rain dt{font-weight:700}.pizyds_rain dd{margin-bottom:.5rem;margin-left:0}.pizyds_rain blockquote{margin:0 0 1rem}.pizyds_rain b,.pizyds_rain strong{font-weight:bolder}.pizyds_rain small,.pizyds_rain .small{font-size:0.875em}.pizyds_rain mark,.pizyds_rain .mark{padding:.2em;background-color:#fcf8e3}.pizyds_rain sub,.pizyds_rain sup{position:relative;font-size:0.75em;line-height:0;vertical-align:baseline}.pizyds_rain sub{bottom:-0.25em}.pizyds_rain sup{top:-0.5em}.pizyds_rain a{color:#0d6efd;text-decoration:underline}.pizyds_rain a:hover{color:#0a58ca}.pizyds_rain a:not([href]):not([class]),.pizyds_rain a:not([href]):not([class]):hover{color:inherit;text-decoration:none}.pizyds_rain pre,.pizyds_rain code,.pizyds_rain kbd,.pizyds_rain samp{font-family:var(--bs-font-monospace);font-size:1em;direction:ltr /* rtl:ignore */;unicode-bidi:bidi-override}.pizyds_rain pre{display:block;margin-top:0;margin-bottom:1rem;overflow:auto;font-size:0.875em}.pizyds_rain pre code{font-size:inherit;color:inherit;word-break:normal}.pizyds_rain code{font-size:0.875em;color:#d63384;word-wrap:break-word}a>.pizyds_rain code{color:inherit}.pizyds_rain kbd{padding:.2rem .4rem;font-size:0.875em;color:#fff;background-color:#212529;border-radius:.2rem}.pizyds_rain kbd kbd{padding:0;font-size:1em;font-weight:700}.pizyds_rain figure{margin:0 0 1rem}.pizyds_rain img,.pizyds_rain svg{vertical-align:middle}.pizyds_rain table{caption-side:bottom;border-collapse:collapse}.pizyds_rain caption{padding-top:.5rem;padding-bottom:.5rem;color:#6c757d;text-align:left}.pizyds_rain th{text-align:inherit;text-align:-webkit-match-parent}.pizyds_rain thead,.pizyds_rain tbody,.pizyds_rain tfoot,.pizyds_rain tr,.pizyds_rain td,.pizyds_rain th{border-color:inherit;border-style:solid;border-width:0}.pizyds_rain label{display:inline-block}.pizyds_rain button{border-radius:0}.pizyds_rain button:focus:not(:focus-visible){outline:0}.pizyds_rain input,.pizyds_rain button,.pizyds_rain select,.pizyds_rain optgroup,.pizyds_rain textarea{margin:0;font-family:inherit;font-size:inherit;line-height:inherit}.pizyds_rain button,.pizyds_rain select{text-transform:none}.pizyds_rain [role=button]{cursor:pointer}.pizyds_rain select{word-wrap:normal}.pizyds_rain select:disabled{opacity:1}.pizyds_rain [list]::-webkit-calendar-picker-indicator{display:none}.pizyds_rain button,.pizyds_rain [type=button],.pizyds_rain [type=reset],.pizyds_rain [type=submit]{-webkit-appearance:button}.pizyds_rain button:not(:disabled),.pizyds_rain [type=button]:not(:disabled),.pizyds_rain [type=reset]:not(:disabled),.pizyds_rain [type=submit]:not(:disabled){cursor:pointer}.pizyds_rain ::-moz-focus-inner{padding:0;border-style:none}.pizyds_rain textarea{resize:vertical}.pizyds_rain fieldset{min-width:0;padding:0;margin:0;border:0}.pizyds_rain legend{float:left;width:100%;padding:0;margin-bottom:.5rem;font-size:calc(1.275rem + 0.3vw);line-height:inherit}@media(min-width: 1200px){.pizyds_rain legend{font-size:1.5rem}}.pizyds_rain legend+*{clear:left}.pizyds_rain ::-webkit-datetime-edit-fields-wrapper,.pizyds_rain ::-webkit-datetime-edit-text,.pizyds_rain ::-webkit-datetime-edit-minute,.pizyds_rain ::-webkit-datetime-edit-hour-field,.pizyds_rain ::-webkit-datetime-edit-day-field,.pizyds_rain ::-webkit-datetime-edit-month-field,.pizyds_rain ::-webkit-datetime-edit-year-field{padding:0}.pizyds_rain ::-webkit-inner-spin-button{height:auto}.pizyds_rain [type=search]{outline-offset:-2px;-webkit-appearance:textfield}.pizyds_rain ::-webkit-search-decoration{-webkit-appearance:none}.pizyds_rain ::-webkit-color-swatch-wrapper{padding:0}.pizyds_rain ::file-selector-button{font:inherit}.pizyds_rain ::-webkit-file-upload-button{font:inherit;-webkit-appearance:button}.pizyds_rain output{display:inline-block}.pizyds_rain iframe{border:0}.pizyds_rain summary{display:list-item;cursor:pointer}.pizyds_rain progress{vertical-align:baseline}.pizyds_rain [hidden]{display:none !important}.pizyds_rain .lead{font-size:1.25rem;font-weight:300}.pizyds_rain .display-1{font-size:calc(1.625rem + 4.5vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.pizyds_rain .display-1{font-size:5rem}}.pizyds_rain .display-2{font-size:calc(1.575rem + 3.9vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.pizyds_rain .display-2{font-size:4.5rem}}.pizyds_rain .display-3{font-size:calc(1.525rem + 3.3vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.pizyds_rain .display-3{font-size:4rem}}.pizyds_rain .display-4{font-size:calc(1.475rem + 2.7vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.pizyds_rain .display-4{font-size:3.5rem}}.pizyds_rain .display-5{font-size:calc(1.425rem + 2.1vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.pizyds_rain .display-5{font-size:3rem}}.pizyds_rain .display-6{font-size:calc(1.375rem + 1.5vw);font-weight:300;line-height:1.2}@media(min-width: 1200px){.pizyds_rain .display-6{font-size:2.5rem}}.pizyds_rain .list-unstyled{padding-left:0;list-style:none}.pizyds_rain .list-inline{padding-left:0;list-style:none}.pizyds_rain .list-inline-item{display:inline-block}.pizyds_rain .list-inline-item:not(:last-child){margin-right:.5rem}.pizyds_rain .initialism{font-size:0.875em;text-transform:uppercase}.pizyds_rain .blockquote{margin-bottom:1rem;font-size:1.25rem}.pizyds_rain .blockquote>:last-child{margin-bottom:0}.pizyds_rain .blockquote-footer{margin-top:-1rem;margin-bottom:1rem;font-size:0.875em;color:#6c757d}.pizyds_rain .blockquote-footer::before{content:\"— \"}.pizyds_rain .popover{position:absolute;top:0;left:0 /* rtl:ignore */;z-index:1070;display:block;max-width:276px;font-family:var(--bs-font-sans-serif);font-style:normal;font-weight:400;line-height:1.5;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;letter-spacing:normal;word-break:normal;word-spacing:normal;white-space:normal;line-break:auto;font-size:0.875rem;word-wrap:break-word;background-color:#fff;background-clip:padding-box;border:1px solid rgba(0,0,0,.2);border-radius:.3rem}.pizyds_rain .popover .popover-arrow{position:absolute;display:block;width:1rem;height:.5rem}.pizyds_rain .popover .popover-arrow::before,.pizyds_rain .popover .popover-arrow::after{position:absolute;display:block;content:\"\";border-color:transparent;border-style:solid}.pizyds_rain .bs-popover-top>.popover-arrow,.pizyds_rain .bs-popover-auto[data-popper-placement^=top]>.popover-arrow{bottom:calc(-0.5rem - 1px)}.pizyds_rain .bs-popover-top>.popover-arrow::before,.pizyds_rain .bs-popover-auto[data-popper-placement^=top]>.popover-arrow::before{bottom:0;border-width:.5rem .5rem 0;border-top-color:rgba(0,0,0,.25)}.pizyds_rain .bs-popover-top>.popover-arrow::after,.pizyds_rain .bs-popover-auto[data-popper-placement^=top]>.popover-arrow::after{bottom:1px;border-width:.5rem .5rem 0;border-top-color:#fff}.pizyds_rain .bs-popover-end>.popover-arrow,.pizyds_rain .bs-popover-auto[data-popper-placement^=right]>.popover-arrow{left:calc(-0.5rem - 1px);width:.5rem;height:1rem}.pizyds_rain .bs-popover-end>.popover-arrow::before,.pizyds_rain .bs-popover-auto[data-popper-placement^=right]>.popover-arrow::before{left:0;border-width:.5rem .5rem .5rem 0;border-right-color:rgba(0,0,0,.25)}.pizyds_rain .bs-popover-end>.popover-arrow::after,.pizyds_rain .bs-popover-auto[data-popper-placement^=right]>.popover-arrow::after{left:1px;border-width:.5rem .5rem .5rem 0;border-right-color:#fff}.pizyds_rain .bs-popover-bottom>.popover-arrow,.pizyds_rain .bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow{top:calc(-0.5rem - 1px)}.pizyds_rain .bs-popover-bottom>.popover-arrow::before,.pizyds_rain .bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow::before{top:0;border-width:0 .5rem .5rem .5rem;border-bottom-color:rgba(0,0,0,.25)}.pizyds_rain .bs-popover-bottom>.popover-arrow::after,.pizyds_rain .bs-popover-auto[data-popper-placement^=bottom]>.popover-arrow::after{top:1px;border-width:0 .5rem .5rem .5rem;border-bottom-color:#fff}.pizyds_rain .bs-popover-bottom .popover-header::before,.pizyds_rain .bs-popover-auto[data-popper-placement^=bottom] .popover-header::before{position:absolute;top:0;left:50%;display:block;width:1rem;margin-left:-0.5rem;content:\"\";border-bottom:1px solid #f0f0f0}.pizyds_rain .bs-popover-start>.popover-arrow,.pizyds_rain .bs-popover-auto[data-popper-placement^=left]>.popover-arrow{right:calc(-0.5rem - 1px);width:.5rem;height:1rem}.pizyds_rain .bs-popover-start>.popover-arrow::before,.pizyds_rain .bs-popover-auto[data-popper-placement^=left]>.popover-arrow::before{right:0;border-width:.5rem 0 .5rem .5rem;border-left-color:rgba(0,0,0,.25)}.pizyds_rain .bs-popover-start>.popover-arrow::after,.pizyds_rain .bs-popover-auto[data-popper-placement^=left]>.popover-arrow::after{right:1px;border-width:.5rem 0 .5rem .5rem;border-left-color:#fff}.pizyds_rain .popover-header{padding:.5rem 1rem;margin-bottom:0;font-size:1rem;background-color:#f0f0f0;border-bottom:1px solid rgba(0,0,0,.2);border-top-left-radius:calc(0.3rem - 1px);border-top-right-radius:calc(0.3rem - 1px)}.pizyds_rain .popover-header:empty{display:none}.pizyds_rain .popover-body{padding:1rem 1rem;color:#212529}.pizyds_rain .form-label{margin-bottom:.5rem}.pizyds_rain .col-form-label{padding-top:calc(0.375rem + 1px);padding-bottom:calc(0.375rem + 1px);margin-bottom:0;font-size:inherit;line-height:1.5}.pizyds_rain .col-form-label-lg{padding-top:calc(0.5rem + 1px);padding-bottom:calc(0.5rem + 1px);font-size:1.25rem}.pizyds_rain .col-form-label-sm{padding-top:calc(0.25rem + 1px);padding-bottom:calc(0.25rem + 1px);font-size:0.875rem}.pizyds_rain .form-text{margin-top:.25rem;font-size:0.875em;color:#6c757d}.pizyds_rain .form-control{display:block;width:100%;padding:.375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:#212529;background-color:#fff;background-clip:padding-box;border:1px solid #ced4da;-webkit-appearance:none;-moz-appearance:none;appearance:none;border-radius:.25rem;transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-control{transition:none}}.pizyds_rain .form-control[type=file]{overflow:hidden}.pizyds_rain .form-control[type=file]:not(:disabled):not([readonly]){cursor:pointer}.pizyds_rain .form-control:focus{color:#212529;background-color:#fff;border-color:#86b7fe;outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.pizyds_rain .form-control::-webkit-date-and-time-value{height:1.5em}.pizyds_rain .form-control::-moz-placeholder{color:#6c757d;opacity:1}.pizyds_rain .form-control:-ms-input-placeholder{color:#6c757d;opacity:1}.pizyds_rain .form-control::placeholder{color:#6c757d;opacity:1}.pizyds_rain .form-control:disabled,.pizyds_rain .form-control[readonly]{background-color:#e9ecef;opacity:1}.pizyds_rain .form-control::file-selector-button{padding:.375rem .75rem;margin:-0.375rem -0.75rem;-webkit-margin-end:.75rem;margin-inline-end:.75rem;color:#212529;background-color:#e9ecef;pointer-events:none;border-color:inherit;border-style:solid;border-width:0;border-inline-end-width:1px;border-radius:0;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-control::file-selector-button{transition:none}}.pizyds_rain .form-control:hover:not(:disabled):not([readonly])::file-selector-button{background-color:#dde0e3}.pizyds_rain .form-control::-webkit-file-upload-button{padding:.375rem .75rem;margin:-0.375rem -0.75rem;-webkit-margin-end:.75rem;margin-inline-end:.75rem;color:#212529;background-color:#e9ecef;pointer-events:none;border-color:inherit;border-style:solid;border-width:0;border-inline-end-width:1px;border-radius:0;-webkit-transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;transition:color .15s ease-in-out,background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-control::-webkit-file-upload-button{-webkit-transition:none;transition:none}}.pizyds_rain .form-control:hover:not(:disabled):not([readonly])::-webkit-file-upload-button{background-color:#dde0e3}.pizyds_rain .form-control-plaintext{display:block;width:100%;padding:.375rem 0;margin-bottom:0;line-height:1.5;color:#212529;background-color:transparent;border:solid transparent;border-width:1px 0}.pizyds_rain .form-control-plaintext.form-control-sm,.pizyds_rain .form-control-plaintext.form-control-lg{padding-right:0;padding-left:0}.pizyds_rain .form-control-sm{min-height:calc(1.5em + (0.5rem + 2px));padding:.25rem .5rem;font-size:0.875rem;border-radius:.2rem}.pizyds_rain .form-control-sm::file-selector-button{padding:.25rem .5rem;margin:-0.25rem -0.5rem;-webkit-margin-end:.5rem;margin-inline-end:.5rem}.pizyds_rain .form-control-sm::-webkit-file-upload-button{padding:.25rem .5rem;margin:-0.25rem -0.5rem;-webkit-margin-end:.5rem;margin-inline-end:.5rem}.pizyds_rain .form-control-lg{min-height:calc(1.5em + (1rem + 2px));padding:.5rem 1rem;font-size:1.25rem;border-radius:.3rem}.pizyds_rain .form-control-lg::file-selector-button{padding:.5rem 1rem;margin:-0.5rem -1rem;-webkit-margin-end:1rem;margin-inline-end:1rem}.pizyds_rain .form-control-lg::-webkit-file-upload-button{padding:.5rem 1rem;margin:-0.5rem -1rem;-webkit-margin-end:1rem;margin-inline-end:1rem}.pizyds_rain textarea.form-control{min-height:calc(1.5em + (0.75rem + 2px))}.pizyds_rain textarea.form-control-sm{min-height:calc(1.5em + (0.5rem + 2px))}.pizyds_rain textarea.form-control-lg{min-height:calc(1.5em + (1rem + 2px))}.pizyds_rain .form-control-color{max-width:3rem;height:auto;padding:.375rem}.pizyds_rain .form-control-color:not(:disabled):not([readonly]){cursor:pointer}.pizyds_rain .form-control-color::-moz-color-swatch{height:1.5em;border-radius:.25rem}.pizyds_rain .form-control-color::-webkit-color-swatch{height:1.5em;border-radius:.25rem}.pizyds_rain .form-select{display:block;width:100%;padding:.375rem 2.25rem .375rem .75rem;-moz-padding-start:calc(0.75rem - 3px);font-size:1rem;font-weight:400;line-height:1.5;color:#212529;background-color:#fff;background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3e%3cpath fill='none' stroke='%23343a40' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='M2 5l6 6 6-6'/%3e%3c/svg%3e\");background-repeat:no-repeat;background-position:right .75rem center;background-size:16px 12px;border:1px solid #ced4da;border-radius:.25rem;transition:border-color .15s ease-in-out,box-shadow .15s ease-in-out;-webkit-appearance:none;-moz-appearance:none;appearance:none}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-select{transition:none}}.pizyds_rain .form-select:focus{border-color:#86b7fe;outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.pizyds_rain .form-select[multiple],.pizyds_rain .form-select[size]:not([size=\"1\"]){padding-right:.75rem;background-image:none}.pizyds_rain .form-select:disabled{background-color:#e9ecef}.pizyds_rain .form-select:-moz-focusring{color:transparent;text-shadow:0 0 0 #212529}.pizyds_rain .form-select-sm{padding-top:.25rem;padding-bottom:.25rem;padding-left:.5rem;font-size:0.875rem}.pizyds_rain .form-select-lg{padding-top:.5rem;padding-bottom:.5rem;padding-left:1rem;font-size:1.25rem}.pizyds_rain .form-check{display:block;min-height:1.5rem;padding-left:1.5em;margin-bottom:.125rem}.pizyds_rain .form-check .form-check-input{float:left;margin-left:-1.5em}.pizyds_rain .form-check-input{width:1em;height:1em;margin-top:.25em;vertical-align:top;background-color:#fff;background-repeat:no-repeat;background-position:center;background-size:contain;border:1px solid rgba(0,0,0,.25);-webkit-appearance:none;-moz-appearance:none;appearance:none;-webkit-print-color-adjust:exact;color-adjust:exact}.pizyds_rain .form-check-input[type=checkbox]{border-radius:.25em}.pizyds_rain .form-check-input[type=radio]{border-radius:50%}.pizyds_rain .form-check-input:active{filter:brightness(90%)}.pizyds_rain .form-check-input:focus{border-color:#86b7fe;outline:0;box-shadow:0 0 0 .25rem rgba(13,110,253,.25)}.pizyds_rain .form-check-input:checked{background-color:#0d6efd;border-color:#0d6efd}.pizyds_rain .form-check-input:checked[type=checkbox]{background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3e%3cpath fill='none' stroke='%23fff' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='M6 10l3 3l6-6'/%3e%3c/svg%3e\")}.pizyds_rain .form-check-input:checked[type=radio]{background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='2' fill='%23fff'/%3e%3c/svg%3e\")}.pizyds_rain .form-check-input[type=checkbox]:indeterminate{background-color:#0d6efd;border-color:#0d6efd;background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 20 20'%3e%3cpath fill='none' stroke='%23fff' stroke-linecap='round' stroke-linejoin='round' stroke-width='3' d='M6 10h8'/%3e%3c/svg%3e\")}.pizyds_rain .form-check-input:disabled{pointer-events:none;filter:none;opacity:.5}.pizyds_rain .form-check-input[disabled]~.form-check-label,.pizyds_rain .form-check-input:disabled~.form-check-label{opacity:.5}.pizyds_rain .form-switch{padding-left:2.5em}.pizyds_rain .form-switch .form-check-input{width:2em;margin-left:-2.5em;background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='rgba%280, 0, 0, 0.25%29'/%3e%3c/svg%3e\");background-position:left center;border-radius:2em;transition:background-position .15s ease-in-out}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-switch .form-check-input{transition:none}}.pizyds_rain .form-switch .form-check-input:focus{background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='%2386b7fe'/%3e%3c/svg%3e\")}.pizyds_rain .form-switch .form-check-input:checked{background-position:right center;background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='-4 -4 8 8'%3e%3ccircle r='3' fill='%23fff'/%3e%3c/svg%3e\")}.pizyds_rain .form-check-inline{display:inline-block;margin-right:1rem}.pizyds_rain .btn-check{position:absolute;clip:rect(0, 0, 0, 0);pointer-events:none}.pizyds_rain .btn-check[disabled]+.btn,.pizyds_rain .btn-check:disabled+.btn{pointer-events:none;filter:none;opacity:.65}.pizyds_rain .form-range{width:100%;height:1.5rem;padding:0;background-color:transparent;-webkit-appearance:none;-moz-appearance:none;appearance:none}.pizyds_rain .form-range:focus{outline:0}.pizyds_rain .form-range:focus::-webkit-slider-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .25rem rgba(13,110,253,.25)}.pizyds_rain .form-range:focus::-moz-range-thumb{box-shadow:0 0 0 1px #fff,0 0 0 .25rem rgba(13,110,253,.25)}.pizyds_rain .form-range::-moz-focus-outer{border:0}.pizyds_rain .form-range::-webkit-slider-thumb{width:1rem;height:1rem;margin-top:-0.25rem;background-color:#0d6efd;border:0;border-radius:1rem;-webkit-transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;-webkit-appearance:none;appearance:none}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-range::-webkit-slider-thumb{-webkit-transition:none;transition:none}}.pizyds_rain .form-range::-webkit-slider-thumb:active{background-color:#b6d4fe}.pizyds_rain .form-range::-webkit-slider-runnable-track{width:100%;height:.5rem;color:transparent;cursor:pointer;background-color:#dee2e6;border-color:transparent;border-radius:1rem}.pizyds_rain .form-range::-moz-range-thumb{width:1rem;height:1rem;background-color:#0d6efd;border:0;border-radius:1rem;-moz-transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;transition:background-color .15s ease-in-out,border-color .15s ease-in-out,box-shadow .15s ease-in-out;-moz-appearance:none;appearance:none}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-range::-moz-range-thumb{-moz-transition:none;transition:none}}.pizyds_rain .form-range::-moz-range-thumb:active{background-color:#b6d4fe}.pizyds_rain .form-range::-moz-range-track{width:100%;height:.5rem;color:transparent;cursor:pointer;background-color:#dee2e6;border-color:transparent;border-radius:1rem}.pizyds_rain .form-range:disabled{pointer-events:none}.pizyds_rain .form-range:disabled::-webkit-slider-thumb{background-color:#adb5bd}.pizyds_rain .form-range:disabled::-moz-range-thumb{background-color:#adb5bd}.pizyds_rain .form-floating{position:relative}.pizyds_rain .form-floating>.form-control,.pizyds_rain .form-floating>.form-select{height:calc(3.5rem + 2px);line-height:1.25}.pizyds_rain .form-floating>label{position:absolute;top:0;left:0;height:100%;padding:1rem .75rem;pointer-events:none;border:1px solid transparent;transform-origin:0 0;transition:opacity .1s ease-in-out,transform .1s ease-in-out}@media(prefers-reduced-motion: reduce){.pizyds_rain .form-floating>label{transition:none}}.pizyds_rain .form-floating>.form-control{padding:1rem .75rem}.pizyds_rain .form-floating>.form-control::-moz-placeholder{color:transparent}.pizyds_rain .form-floating>.form-control:-ms-input-placeholder{color:transparent}.pizyds_rain .form-floating>.form-control::placeholder{color:transparent}.pizyds_rain .form-floating>.form-control:not(:-moz-placeholder-shown){padding-top:1.625rem;padding-bottom:.625rem}.pizyds_rain .form-floating>.form-control:not(:-ms-input-placeholder){padding-top:1.625rem;padding-bottom:.625rem}.pizyds_rain .form-floating>.form-control:focus,.pizyds_rain .form-floating>.form-control:not(:placeholder-shown){padding-top:1.625rem;padding-bottom:.625rem}.pizyds_rain .form-floating>.form-control:-webkit-autofill{padding-top:1.625rem;padding-bottom:.625rem}.pizyds_rain .form-floating>.form-select{padding-top:1.625rem;padding-bottom:.625rem}.pizyds_rain .form-floating>.form-control:not(:-moz-placeholder-shown)~label{opacity:.65;transform:scale(0.85) translateY(-0.5rem) translateX(0.15rem)}.pizyds_rain .form-floating>.form-control:not(:-ms-input-placeholder)~label{opacity:.65;transform:scale(0.85) translateY(-0.5rem) translateX(0.15rem)}.pizyds_rain .form-floating>.form-control:focus~label,.pizyds_rain .form-floating>.form-control:not(:placeholder-shown)~label,.pizyds_rain .form-floating>.form-select~label{opacity:.65;transform:scale(0.85) translateY(-0.5rem) translateX(0.15rem)}.pizyds_rain .form-floating>.form-control:-webkit-autofill~label{opacity:.65;transform:scale(0.85) translateY(-0.5rem) translateX(0.15rem)}.pizyds_rain .input-group{position:relative;display:flex;flex-wrap:wrap;align-items:stretch;width:100%}.pizyds_rain .input-group>.form-control,.pizyds_rain .input-group>.form-select{position:relative;flex:1 1 auto;width:1%;min-width:0}.pizyds_rain .input-group>.form-control:focus,.pizyds_rain .input-group>.form-select:focus{z-index:3}.pizyds_rain .input-group .btn{position:relative;z-index:2}.pizyds_rain .input-group .btn:focus{z-index:3}.pizyds_rain .input-group-text{display:flex;align-items:center;padding:.375rem .75rem;font-size:1rem;font-weight:400;line-height:1.5;color:#212529;text-align:center;white-space:nowrap;background-color:#e9ecef;border:1px solid #ced4da;border-radius:.25rem}.pizyds_rain .input-group-lg>.form-control,.pizyds_rain .input-group-lg>.form-select,.pizyds_rain .input-group-lg>.input-group-text,.pizyds_rain .input-group-lg>.btn{padding:.5rem 1rem;font-size:1.25rem;border-radius:.3rem}.pizyds_rain .input-group-sm>.form-control,.pizyds_rain .input-group-sm>.form-select,.pizyds_rain .input-group-sm>.input-group-text,.pizyds_rain .input-group-sm>.btn{padding:.25rem .5rem;font-size:0.875rem;border-radius:.2rem}.pizyds_rain .input-group-lg>.form-select,.pizyds_rain .input-group-sm>.form-select{padding-right:3rem}.pizyds_rain .input-group:not(.has-validation)>:not(:last-child):not(.dropdown-toggle):not(.dropdown-menu),.pizyds_rain .input-group:not(.has-validation)>.dropdown-toggle:nth-last-child(n+3){border-top-right-radius:0;border-bottom-right-radius:0}.pizyds_rain .input-group.has-validation>:nth-last-child(n+3):not(.dropdown-toggle):not(.dropdown-menu),.pizyds_rain .input-group.has-validation>.dropdown-toggle:nth-last-child(n+4){border-top-right-radius:0;border-bottom-right-radius:0}.pizyds_rain .input-group>:not(:first-child):not(.dropdown-menu):not(.valid-tooltip):not(.valid-feedback):not(.invalid-tooltip):not(.invalid-feedback){margin-left:-1px;border-top-left-radius:0;border-bottom-left-radius:0}.pizyds_rain .valid-feedback{display:none;width:100%;margin-top:.25rem;font-size:0.875em;color:#198754}.pizyds_rain .valid-tooltip{position:absolute;top:100%;z-index:5;display:none;max-width:100%;padding:.25rem .5rem;margin-top:.1rem;font-size:0.875rem;color:#fff;background-color:rgba(25,135,84,.9);border-radius:.25rem}.was-validated .pizyds_rain:valid~.valid-feedback,.was-validated .pizyds_rain:valid~.valid-tooltip,.pizyds_rain.is-valid~.valid-feedback,.pizyds_rain.is-valid~.valid-tooltip{display:block}.was-validated .pizyds_rain .form-control:valid,.pizyds_rain .form-control.is-valid{border-color:#198754;padding-right:calc(1.5em + 0.75rem);background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%23198754' d='M2.3 6.73L.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e\");background-repeat:no-repeat;background-position:right calc(0.375em + 0.1875rem) center;background-size:calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .pizyds_rain .form-control:valid:focus,.pizyds_rain .form-control.is-valid:focus{border-color:#198754;box-shadow:0 0 0 .25rem rgba(25,135,84,.25)}.was-validated .pizyds_rain textarea.form-control:valid,.pizyds_rain textarea.form-control.is-valid{padding-right:calc(1.5em + 0.75rem);background-position:top calc(0.375em + 0.1875rem) right calc(0.375em + 0.1875rem)}.was-validated .pizyds_rain .form-select:valid,.pizyds_rain .form-select.is-valid{border-color:#198754}.was-validated .pizyds_rain .form-select:valid:not([multiple]):not([size]),.was-validated .pizyds_rain .form-select:valid:not([multiple])[size=\"1\"],.pizyds_rain .form-select.is-valid:not([multiple]):not([size]),.pizyds_rain .form-select.is-valid:not([multiple])[size=\"1\"]{padding-right:4.125rem;background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3e%3cpath fill='none' stroke='%23343a40' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='M2 5l6 6 6-6'/%3e%3c/svg%3e\"),url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 8 8'%3e%3cpath fill='%23198754' d='M2.3 6.73L.6 4.53c-.4-1.04.46-1.4 1.1-.8l1.1 1.4 3.4-3.8c.6-.63 1.6-.27 1.2.7l-4 4.6c-.43.5-.8.4-1.1.1z'/%3e%3c/svg%3e\");background-position:right .75rem center,center right 2.25rem;background-size:16px 12px,calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .pizyds_rain .form-select:valid:focus,.pizyds_rain .form-select.is-valid:focus{border-color:#198754;box-shadow:0 0 0 .25rem rgba(25,135,84,.25)}.was-validated .pizyds_rain .form-check-input:valid,.pizyds_rain .form-check-input.is-valid{border-color:#198754}.was-validated .pizyds_rain .form-check-input:valid:checked,.pizyds_rain .form-check-input.is-valid:checked{background-color:#198754}.was-validated .pizyds_rain .form-check-input:valid:focus,.pizyds_rain .form-check-input.is-valid:focus{box-shadow:0 0 0 .25rem rgba(25,135,84,.25)}.was-validated .pizyds_rain .form-check-input:valid~.form-check-label,.pizyds_rain .form-check-input.is-valid~.form-check-label{color:#198754}.pizyds_rain .form-check-inline .form-check-input~.valid-feedback{margin-left:.5em}.was-validated .pizyds_rain .input-group .form-control:valid,.pizyds_rain .input-group .form-control.is-valid,.was-validated .pizyds_rain .input-group .form-select:valid,.pizyds_rain .input-group .form-select.is-valid{z-index:1}.was-validated .pizyds_rain .input-group .form-control:valid:focus,.pizyds_rain .input-group .form-control.is-valid:focus,.was-validated .pizyds_rain .input-group .form-select:valid:focus,.pizyds_rain .input-group .form-select.is-valid:focus{z-index:3}.pizyds_rain .invalid-feedback{display:none;width:100%;margin-top:.25rem;font-size:0.875em;color:#dc3545}.pizyds_rain .invalid-tooltip{position:absolute;top:100%;z-index:5;display:none;max-width:100%;padding:.25rem .5rem;margin-top:.1rem;font-size:0.875rem;color:#fff;background-color:rgba(220,53,69,.9);border-radius:.25rem}.was-validated .pizyds_rain:invalid~.invalid-feedback,.was-validated .pizyds_rain:invalid~.invalid-tooltip,.pizyds_rain.is-invalid~.invalid-feedback,.pizyds_rain.is-invalid~.invalid-tooltip{display:block}.was-validated .pizyds_rain .form-control:invalid,.pizyds_rain .form-control.is-invalid{border-color:#dc3545;padding-right:calc(1.5em + 0.75rem);background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 12 12' width='12' height='12' fill='none' stroke='%23dc3545'%3e%3ccircle cx='6' cy='6' r='4.5'/%3e%3cpath stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/%3e%3ccircle cx='6' cy='8.2' r='.6' fill='%23dc3545' stroke='none'/%3e%3c/svg%3e\");background-repeat:no-repeat;background-position:right calc(0.375em + 0.1875rem) center;background-size:calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .pizyds_rain .form-control:invalid:focus,.pizyds_rain .form-control.is-invalid:focus{border-color:#dc3545;box-shadow:0 0 0 .25rem rgba(220,53,69,.25)}.was-validated .pizyds_rain textarea.form-control:invalid,.pizyds_rain textarea.form-control.is-invalid{padding-right:calc(1.5em + 0.75rem);background-position:top calc(0.375em + 0.1875rem) right calc(0.375em + 0.1875rem)}.was-validated .pizyds_rain .form-select:invalid,.pizyds_rain .form-select.is-invalid{border-color:#dc3545}.was-validated .pizyds_rain .form-select:invalid:not([multiple]):not([size]),.was-validated .pizyds_rain .form-select:invalid:not([multiple])[size=\"1\"],.pizyds_rain .form-select.is-invalid:not([multiple]):not([size]),.pizyds_rain .form-select.is-invalid:not([multiple])[size=\"1\"]{padding-right:4.125rem;background-image:url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 16 16'%3e%3cpath fill='none' stroke='%23343a40' stroke-linecap='round' stroke-linejoin='round' stroke-width='2' d='M2 5l6 6 6-6'/%3e%3c/svg%3e\"),url(\"data:image/svg+xml,%3csvg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 12 12' width='12' height='12' fill='none' stroke='%23dc3545'%3e%3ccircle cx='6' cy='6' r='4.5'/%3e%3cpath stroke-linejoin='round' d='M5.8 3.6h.4L6 6.5z'/%3e%3ccircle cx='6' cy='8.2' r='.6' fill='%23dc3545' stroke='none'/%3e%3c/svg%3e\");background-position:right .75rem center,center right 2.25rem;background-size:16px 12px,calc(0.75em + 0.375rem) calc(0.75em + 0.375rem)}.was-validated .pizyds_rain .form-select:invalid:focus,.pizyds_rain .form-select.is-invalid:focus{border-color:#dc3545;box-shadow:0 0 0 .25rem rgba(220,53,69,.25)}.was-validated .pizyds_rain .form-check-input:invalid,.pizyds_rain .form-check-input.is-invalid{border-color:#dc3545}.was-validated .pizyds_rain .form-check-input:invalid:checked,.pizyds_rain .form-check-input.is-invalid:checked{background-color:#dc3545}.was-validated .pizyds_rain .form-check-input:invalid:focus,.pizyds_rain .form-check-input.is-invalid:focus{box-shadow:0 0 0 .25rem rgba(220,53,69,.25)}.was-validated .pizyds_rain .form-check-input:invalid~.form-check-label,.pizyds_rain .form-check-input.is-invalid~.form-check-label{color:#dc3545}.pizyds_rain .form-check-inline .form-check-input~.invalid-feedback{margin-left:.5em}.was-validated .pizyds_rain .input-group .form-control:invalid,.pizyds_rain .input-group .form-control.is-invalid,.was-validated .pizyds_rain .input-group .form-select:invalid,.pizyds_rain .input-group .form-select.is-invalid{z-index:2}.was-validated .pizyds_rain .input-group .form-control:invalid:focus,.pizyds_rain .input-group .form-control.is-invalid:focus,.was-validated .pizyds_rain .input-group .form-select:invalid:focus,.pizyds_rain .input-group .form-select.is-invalid:focus{z-index:3}", ""]);// Exports/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (___CSS_LOADER_EXPORT___);/***/ }),/***/ 718:/***/ ((module) => {"use strict";/*MIT License http://www.opensource.org/licenses/mit-license.phpAuthor Tobias Koppers @sokra*/// css base code, injected by the css-loader// eslint-disable-next-line func-namesmodule.exports = function (cssWithMappingToString) {var list = []; // return the list of modules as css stringlist.toString = function toString() {return this.map(function (item) {var content = cssWithMappingToString(item);if (item[2]) {return "@media ".concat(item[2], " {").concat(content, "}");}return content;}).join("");}; // import a list of modules into the list// eslint-disable-next-line func-nameslist.i = function (modules, mediaQuery, dedupe) {if (typeof modules === "string") {// eslint-disable-next-line no-param-reassignmodules = [[null, modules, ""]];}var alreadyImportedModules = {};if (dedupe) {for (var i = 0; i < this.length; i++) {// eslint-disable-next-line prefer-destructuringvar id = this[i][0];if (id != null) {alreadyImportedModules[id] = true;}}}for (var _i = 0; _i < modules.length; _i++) {var item = [].concat(modules[_i]);if (dedupe && alreadyImportedModules[item[0]]) {// eslint-disable-next-line no-continuecontinue;}if (mediaQuery) {if (!item[2]) {item[2] = mediaQuery;} else {item[2] = "".concat(mediaQuery, " and ").concat(item[2]);}}list.push(item);}};return list;};/***/ }),/***/ 8056:/***/ ((module) => {(function(f){if(true){module.exports=f()}else { var g; }})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=undefined;if(!f&&c)return require(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=undefined,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){/** EJS Embedded JavaScript templates* Copyright 2112 Matthew Eernisse ([email protected])** Licensed under the Apache License, Version 2.0 (the "License");* you may not use this file except in compliance with the License.* You may obtain a copy of the License at**         http://www.apache.org/licenses/LICENSE-2.0** Unless required by applicable law or agreed to in writing, software* distributed under the License is distributed on an "AS IS" BASIS,* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.* See the License for the specific language ###erning permissions and* limitations under the License.**/'use strict';/*** @file Embedded JavaScript templating engine. {@link http://ejs.co}* @author Matthew Eernisse <[email protected]>* @author Tiancheng "Timothy" Gu <[email protected]>* @project EJS* @license {@link http://www.apache.org/licenses/LICENSE-2.0 Apache License, Version 2.0}*//*** EJS internal functions.** Technically this "module" lies in the same file as {@link module:ejs}, for* the sake of organization all the private functions re grouped into this* module.** @module ejs-internal* @private*//*** Embedded JavaScript templating engine.** @module ejs* @public*/var fs = require('fs');var path = require('path');var utils = require('./utils');var scopeOptionWarned = false;/** @type {string} */var _VERSION_STRING = require('../package.json').version;var _DEFAULT_OPEN_DELIMITER = '<';var _DEFAULT_CLOSE_DELIMITER = '>';var _DEFAULT_DELIMITER = '%';var _DEFAULT_LOCALS_NAME = 'locals';var _NAME = 'ejs';var _REGEX_STRING = '(<%%|%%>|<%=|<%-|<%_|<%#|<%|%>|-%>|_%>)';var _OPTS_PASSABLE_WITH_DATA = ['delimiter', 'scope', 'context', 'debug', 'compileDebug','client', '_with', 'rmWhitespace', 'strict', 'filename', 'async'];// We don't allow 'cache' option to be passed in the data obj for// the normal `render` call, but this is where Express 2 & 3 put it// so we make an exception for `renderFile`var _OPTS_PASSABLE_WITH_DATA_EXPRESS = _OPTS_PASSABLE_WITH_DATA.concat('cache');var _BOM = /^\uFEFF/;/*** EJS template function cache. This can be a LRU object from lru-cache NPM* module. By default, it is {@link module:utils.cache}, a simple in-process* cache that grows continuously.** @type {Cache}*/exports.cache = utils.cache;/*** Custom file loader. Useful for template preprocessing or restricting access* to a certain part of the filesystem.** @type {fileLoader}*/exports.fileLoader = fs.readFileSync;/*** Name of the object containing the locals.** This variable is overridden by {@link Options}`.localsName` if it is not* `undefined`.** @type {String}* @public*/exports.localsName = _DEFAULT_LOCALS_NAME;/*** Promise implementation -- defaults to the native implementation if available* This is mostly just for testability** @type {PromiseConstructorLike}* @public*/exports.promiseImpl = (new Function('return this;'))().Promise;/*** Get the path to the included file from the parent file path and the* specified path.** @param {String}  name     specified path* @param {String}  filename parent file path* @param {Boolean} [isDir=false] whether the parent file path is a directory* @return {String}*/exports.resolveInclude = function(name, filename, isDir) {var dirname = path.dirname;var extname = path.extname;var resolve = path.resolve;var includePath = resolve(isDir ? filename : dirname(filename), name);var ext = extname(name);if (!ext) {includePath += '.ejs';}return includePath;};/*** Try to resolve file path on multiple directories** @param  {String}        name  specified path* @param  {Array<String>} paths list of possible parent directory paths* @return {String}*/function resolvePaths(name, paths) {var filePath;if (paths.some(function (v) {filePath = exports.resolveInclude(name, v, true);return fs.existsSync(filePath);})) {return filePath;}}/*** Get the path to the included file by Options** @param  {String}  path    specified path* @param  {Options} options compilation options* @return {String}*/function getIncludePath(path, options) {var includePath;var filePath;var views = options.views;var match = /^[A-Za-z]+:\\|^\//.exec(path);// Abs pathif (match && match.length) {path = path.replace(/^\/*/, '');if (Array.isArray(options.root)) {includePath = resolvePaths(path, options.root);} else {includePath = exports.resolveInclude(path, options.root || '/', true);}}// Relative pathselse {// Look relative to a passed filename firstif (options.filename) {filePath = exports.resolveInclude(path, options.filename);if (fs.existsSync(filePath)) {includePath = filePath;}}// Then look in any views directoriesif (!includePath && Array.isArray(views)) {includePath = resolvePaths(path, views);}if (!includePath && typeof options.includer !== 'function') {throw new Error('Could not find the include file "' +options.escapeFunction(path) + '"');}}return includePath;}/*** Get the template from a string or a file, either compiled on-the-fly or* read from cache (if enabled), and cache the template if needed.** If `template` is not set, the file specified in `options.filename` will be* read.** If `options.cache` is true, this function reads the file from* `options.filename` so it must be set prior to calling this function.** @memberof module:ejs-internal* @param {Options} options   compilation options* @param {String} [template] template source* @return {(TemplateFunction|ClientFunction)}* Depending on the value of `options.client`, either type might be returned.* @static*/function handleCache(options, template) {var func;var filename = options.filename;var hasTemplate = arguments.length > 1;if (options.cache) {if (!filename) {throw new Error('cache option requires a filename');}func = exports.cache.get(filename);if (func) {return func;}if (!hasTemplate) {template = fileLoader(filename).toString().replace(_BOM, '');}}else if (!hasTemplate) {// istanbul ignore if: should not happen at allif (!filename) {throw new Error('Internal EJS error: no file name or template '+ 'provided');}template = fileLoader(filename).toString().replace(_BOM, '');}func = exports.compile(template, options);if (options.cache) {exports.cache.set(filename, func);}return func;}/*** Try calling handleCache with the given options and data and call the* callback with the r###lt. If an error occurs, call the callback with* the error. Used by renderFile().** @memberof module:ejs-internal* @param {Options} options    compilation options* @param {Object} data        template data* @param {RenderFileCallback} cb callback* @static*/function tryHandleCache(options, data, cb) {var r###lt;if (!cb) {if (typeof exports.promiseImpl == 'function') {return new exports.promiseImpl(function (resolve, reject) {try {r###lt = handleCache(options)(data);resolve(r###lt);}catch (err) {reject(err);}});}else {throw new Error('Please provide a callback function');}}else {try {r###lt = handleCache(options)(data);}catch (err) {return cb(err);}cb(null, r###lt);}}/*** fileLoader is independent** @param {String} filePath ejs file path.* @return {String} The contents of the specified file.* @static*/function fileLoader(filePath){return exports.fileLoader(filePath);}/*** Get the template function.** If `options.cache` is `true`, then the template is cached.** @memberof module:ejs-internal* @param {String}  path    path for the specified file* @param {Options} options compilation options* @return {(TemplateFunction|ClientFunction)}* Depending on the value of `options.client`, either type might be returned* @static*/function includeFile(path, options) {var opts = utils.shallowCopy({}, options);opts.filename = getIncludePath(path, opts);if (typeof options.includer === 'function') {var includerR###lt = options.includer(path, opts.filename);if (includerR###lt) {if (includerR###lt.filename) {opts.filename = includerR###lt.filename;}if (includerR###lt.template) {return handleCache(opts, includerR###lt.template);}}}return handleCache(opts);}/*** Re-throw the given `err` in context to the `str` of ejs, `filename`, and* `lineno`.** @implements {RethrowCallback}* @memberof module:ejs-internal* @param {Error}  err      Error object* @param {String} str      EJS source* @param {String} flnm     file name of the EJS file* @param {Number} lineno   line number of the error* @param {EscapeCallback} esc* @static*/function rethrow(err, str, flnm, lineno, esc) {var lines = str.split('\n');var start = Math.max(lineno - 3, 0);var end = Math.min(lines.length, lineno + 3);var filename = esc(flnm);// Error contextvar context = lines.slice(start, end).map(function (line, i){var curr = i + start + 1;return (curr == lineno ? ' >> ' : '    ')+ curr+ '| '+ line;}).join('\n');// Alter exception messageerr.path = filename;err.message = (filename || 'ejs') + ':'+ lineno + '\n'+ context + '\n\n'+ err.message;throw err;}function stripSemi(str){return str.replace(/;(\s*$)/, '$1');}/*** Compile the given `str` of ejs into a template function.** @param {String}  template EJS template** @param {Options} [opts] compilation options** @return {(TemplateFunction|ClientFunction)}* Depending on the value of `opts.client`, either type might be returned.* Note that the return type of the function also depends on the value of `opts.async`.* @public*/exports.compile = function compile(template, opts) {var templ;// v1 compat// 'scope' is 'context'// FIXME: Remove this in a future versionif (opts && opts.scope) {if (!scopeOptionWarned){console.warn('`scope` option is deprecated and will be removed in EJS 3');scopeOptionWarned = true;}if (!opts.context) {opts.context = opts.scope;}delete opts.scope;}templ = new Template(template, opts);return templ.compile();};/*** Render the given `template` of ejs.** If you would like to include options but not data, you need to explicitly* call this function with `data` being an empty object or `null`.** @param {String}   template EJS template* @param {Object}  [data={}] template data* @param {Options} [opts={}] compilation and rendering options* @return {(String|Promise<String>)}* Return value type depends on `opts.async`.* @public*/exports.render = function (template, d, o) {var data = d || {};var opts = o || {};// No options object -- if there are optiony names// in the data, copy them to optionsif (arguments.length == 2) {utils.shallowCopyFromList(opts, data, _OPTS_PASSABLE_WITH_DATA);}return handleCache(opts, template)(data);};/*** Render an EJS file at the given `path` and callback `cb(err, str)`.** If you would like to include options but not data, you need to explicitly* call this function with `data` being an empty object or `null`.** @param {String}             path     path to the EJS file* @param {Object}            [data={}] template data* @param {Options}           [opts={}] compilation and rendering options* @param {RenderFileCallback} cb callback* @public*/exports.renderFile = function () {var args = Array.prototype.slice.call(arguments);var filename = args.shift();var cb;var opts = {filename: filename};var data;var viewOpts;// Do we have a callback?if (typeof arguments[arguments.length - 1] == 'function') {cb = args.pop();}// Do we have data/opts?if (args.length) {// Should always have data objdata = args.shift();// Normal passed opts (data obj + opts obj)if (args.length) {// Use shallowCopy so we don't pollute passed in opts obj with new valsutils.shallowCopy(opts, args.pop());}// Special casing for Express (settings + opts-in-data)else {// Express 3 and 4if (data.settings) {// Pull a few things from known locationsif (data.settings.views) {opts.views = data.settings.views;}if (data.settings['view cache']) {opts.cache = true;}// Undocumented after Express 2, but still usable, esp. for// items that are unsafe to be passed along with data, like `root`viewOpts = data.settings['view options'];if (viewOpts) {utils.shallowCopy(opts, viewOpts);}}// Express 2 and lower, values set in app.locals, or people who just// want to pass options in their data. NOTE: These values will override// anything previously set in settings  or settings['view options']utils.shallowCopyFromList(opts, data, _OPTS_PASSABLE_WITH_DATA_EXPRESS);}opts.filename = filename;}else {data = {};}return tryHandleCache(opts, data, cb);};/*** Clear intermediate JavaScript cache. Calls {@link Cache#reset}.* @public*//*** EJS template class* @public*/exports.Template = Template;exports.clearCache = function () {exports.cache.reset();};function Template(text, opts) {opts = opts || {};var options = {};this.templateText = text;/** @type {string | null} */this.mode = null;this.truncate = false;this.currentLine = 1;this.source = '';options.client = opts.client || false;options.escapeFunction = opts.escape || opts.escapeFunction || utils.escapeXML;options.compileDebug = opts.compileDebug !== false;options.debug = !!opts.debug;options.filename = opts.filename;options.openDelimiter = opts.openDelimiter || exports.openDelimiter || _DEFAULT_OPEN_DELIMITER;options.closeDelimiter = opts.closeDelimiter || exports.closeDelimiter || _DEFAULT_CLOSE_DELIMITER;options.delimiter = opts.delimiter || exports.delimiter || _DEFAULT_DELIMITER;options.strict = opts.strict || false;options.context = opts.context;options.cache = opts.cache || false;options.rmWhitespace = opts.rmWhitespace;options.root = opts.root;options.includer = opts.includer;options.outputFunctionName = opts.outputFunctionName;options.localsName = opts.localsName || exports.localsName || _DEFAULT_LOCALS_NAME;options.views = opts.views;options.async = opts.async;options.destructuredLocals = opts.destructuredLocals;options.legacyInclude = typeof opts.legacyInclude != 'undefined' ? !!opts.legacyInclude : true;if (options.strict) {options._with = false;}else {options._with = typeof opts._with != 'undefined' ? opts._with : true;}this.opts = options;this.regex = this.createRegex();}Template.modes = {EVAL: 'eval',ESCAPED: 'escaped',RAW: 'raw',COMMENT: 'comment',LITERAL: 'literal'};Template.prototype = {createRegex: function () {var str = _REGEX_STRING;var delim = utils.escapeRegExpChars(this.opts.delimiter);var open = utils.escapeRegExpChars(this.opts.openDelimiter);var close = utils.escapeRegExpChars(this.opts.closeDelimiter);str = str.replace(/%/g, delim).replace(/</g, open).replace(/>/g, close);return new RegExp(str);},compile: function () {/** @type {string} */var src;/** @type {ClientFunction} */var fn;var opts = this.opts;var prepended = '';var appended = '';/** @type {EscapeCallback} */var escapeFn = opts.escapeFunction;/** @type {FunctionConstructor} */var ctor;/** @type {string} */var sanitizedFilename = opts.filename ? JSON.stringify(opts.filename) : 'undefined';if (!this.source) {this.generateSource();prepended +='  var __output = "";\n' +'  function __append(s) { if (s !== undefined && s !== null) __output += s }\n';if (opts.outputFunctionName) {prepended += '  var ' + opts.outputFunctionName + ' = __append;' + '\n';}if (opts.destructuredLocals && opts.destructuredLocals.length) {var destructuring = '  var __locals = (' + opts.localsName + ' || {}),\n';for (var i = 0; i < opts.destructuredLocals.length; i++) {var name = opts.destructuredLocals[i];if (i > 0) {destructuring += ',\n  ';}destructuring += name + ' = __locals.' + name;}prepended += destructuring + ';\n';}if (opts._with !== false) {prepended +=  '  with (' + opts.localsName + ' || {}) {' + '\n';appended += '  }' + '\n';}appended += '  return __output;' + '\n';this.source = prepended + this.source + appended;}if (opts.compileDebug) {src = 'var __line = 1' + '\n'+ '  , __lines = ' + JSON.stringify(this.templateText) + '\n'+ '  , __filename = ' + sanitizedFilename + ';' + '\n'+ 'try {' + '\n'+ this.source+ '} catch (e) {' + '\n'+ '  rethrow(e, __lines, __filename, __line, escapeFn);' + '\n'+ '}' + '\n';}else {src = this.source;}if (opts.client) {src = 'escapeFn = escapeFn || ' + escapeFn.toString() + ';' + '\n' + src;if (opts.compileDebug) {src = 'rethrow = rethrow || ' + rethrow.toString() + ';' + '\n' + src;}}if (opts.strict) {src = '"use strict";\n' + src;}if (opts.debug) {console.log(src);}if (opts.compileDebug && opts.filename) {src = src + '\n'+ '//# sourceURL=' + sanitizedFilename + '\n';}try {if (opts.async) {// Have to use generated function for this, since in envs without support,// it breaks in parsingtry {ctor = (new Function('return (async function(){}).constructor;'))();}catch(e) {if (e instanceof SyntaxError) {throw new Error('This environment does not support async/await');}else {throw e;}}}else {ctor = Function;}fn = new ctor(opts.localsName + ', escapeFn, include, rethrow', src);}catch(e) {// istanbul ignore elseif (e instanceof SyntaxError) {if (opts.filename) {e.message += ' in ' + opts.filename;}e.message += ' while compiling ejs\n\n';e.message += 'If the above error is not helpful, you may want to try EJS-Lint:\n';e.message += 'https://github.com/RyanZim/EJS-Lint';if (!opts.async) {e.message += '\n';e.message += 'Or, if you meant to create an async function, pass `async: true` as an option.';}}throw e;}// Return a callable function which will execute the function// created by the source-code, with the passed data as locals// Adds a local `include` function which allows full recursive includevar returnedFn = opts.client ? fn : function anonymous(data) {var include = function (path, includeData) {var d = utils.shallowCopy({}, data);if (includeData) {d = utils.shallowCopy(d, includeData);}return includeFile(path, opts)(d);};return fn.apply(opts.context, [data || {}, escapeFn, include, rethrow]);};if (opts.filename && typeof Object.defineProperty === 'function') {var filename = opts.filename;var basename = path.basename(filename, path.extname(filename));try {Object.defineProperty(returnedFn, 'name', {value: basename,writable: false,enumerable: false,configurable: true});} catch (e) {/* ignore */}}return returnedFn;},generateSource: function () {var opts = this.opts;if (opts.rmWhitespace) {// Have to use two separate replace here as `^` and `$` operators don't// work well with `\r` and empty lines don't work well with the `m` flag.this.templateText =this.templateText.replace(/[\r\n]+/g, '\n').replace(/^\s+|\s+$/gm, '');}// Slurp spaces and tabs before <%_ and after _%>this.templateText =this.templateText.replace(/[ \t]*<%_/gm, '<%_').replace(/_%>[ \t]*/gm, '_%>');var self = this;var matches = this.parseTemplateText();var d = this.opts.delimiter;var o = this.opts.openDelimiter;var c = this.opts.closeDelimiter;if (matches && matches.length) {matches.forEach(function (line, index) {var closing;// If this is an opening tag, check for closing tags// FIXME: May end up with some false positives here// Better to store modes as k/v with openDelimiter + delimiter as key// Then this can simply check against the mapif ( line.indexOf(o + d) === 0        // If it is a tag&& line.indexOf(o + d + d) !== 0) { // and is not escapedclosing = matches[index + 2];if (!(closing == d + c || closing == '-' + d + c || closing == '_' + d + c)) {throw new Error('Could not find matching close tag for "' + line + '".');}}self.scanLine(line);});}},parseTemplateText: function () {var str = this.templateText;var pat = this.regex;var r###lt = pat.exec(str);var arr = [];var firstPos;while (r###lt) {firstPos = r###lt.index;if (firstPos !== 0) {arr.push(str.substring(0, firstPos));str = str.slice(firstPos);}arr.push(r###lt[0]);str = str.slice(r###lt[0].length);r###lt = pat.exec(str);}if (str) {arr.push(str);}return arr;},_addOutput: function (line) {if (this.truncate) {// Only replace single leading linebreak in the line after// -%> tag -- this is the single, trailing linebreak// after the tag that the truncation mode replaces// Handle Win / Unix / old Mac linebreaks -- do the \r\n// combo first in the regex-orline = line.replace(/^(?:\r\n|\r|\n)/, '');this.truncate = false;}if (!line) {return line;}// Preserve literal slashesline = line.replace(/\\/g, '\\\\');// Convert linebreaksline = line.replace(/\n/g, '\\n');line = line.replace(/\r/g, '\\r');// Escape double-quotes// - this will be the delimiter during executionline = line.replace(/"/g, '\\"');this.source += '    ; __append("' + line + '")' + '\n';},scanLine: function (line) {var self = this;var d = this.opts.delimiter;var o = this.opts.openDelimiter;var c = this.opts.closeDelimiter;var newLineCount = 0;newLineCount = (line.split('\n').length - 1);switch (line) {case o + d:case o + d + '_':this.mode = Template.modes.EVAL;break;case o + d + '=':this.mode = Template.modes.ESCAPED;break;case o + d + '-':this.mode = Template.modes.RAW;break;case o + d + '#':this.mode = Template.modes.COMMENT;break;case o + d + d:this.mode = Template.modes.LITERAL;this.source += '    ; __append("' + line.replace(o + d + d, o + d) + '")' + '\n';break;case d + d + c:this.mode = Template.modes.LITERAL;this.source += '    ; __append("' + line.replace(d + d + c, d + c) + '")' + '\n';break;case d + c:case '-' + d + c:case '_' + d + c:if (this.mode == Template.modes.LITERAL) {this._addOutput(line);}this.mode = null;this.truncate = line.indexOf('-') === 0 || line.indexOf('_') === 0;break;default:// In script mode, depends on type of tagif (this.mode) {// If '//' is found without a line break, add a line break.switch (this.mode) {case Template.modes.EVAL:case Template.modes.ESCAPED:case Template.modes.RAW:if (line.lastIndexOf('//') > line.lastIndexOf('\n')) {line += '\n';}}switch (this.mode) {// Just executing codecase Template.modes.EVAL:this.source += '    ; ' + line + '\n';break;// Exec, esc, and outputcase Template.modes.ESCAPED:this.source += '    ; __append(escapeFn(' + stripSemi(line) + '))' + '\n';break;// Exec and outputcase Template.modes.RAW:this.source += '    ; __append(' + stripSemi(line) + ')' + '\n';break;case Template.modes.COMMENT:// Do nothingbreak;// Literal <%% mode, append as raw outputcase Template.modes.LITERAL:this._addOutput(line);break;}}// In string mode, just add the outputelse {this._addOutput(line);}}if (self.opts.compileDebug && newLineCount) {this.currentLine += newLineCount;this.source += '    ; __line = ' + this.currentLine + '\n';}}};/*** Escape characters reserved in XML.** This is simply an export of {@link module:utils.escapeXML}.** If `markup` is `undefined` or `null`, the empty string is returned.** @param {String} markup Input string* @return {String} Escaped string* @public* @func* */exports.escapeXML = utils.escapeXML;/*** Express.js support.** This is an alias for {@link module:ejs.renderFile}, in order to support* Express.js out-of-the-box.** @func*/exports.__express = exports.renderFile;/*** Version of EJS.** @readonly* @type {String}* @public*/exports.VERSION = _VERSION_STRING;/*** Name for detection of EJS.** @readonly* @type {String}* @public*/exports.name = _NAME;/* istanbul ignore if */if (typeof window != 'undefined') {window.ejs = exports;}},{"../package.json":6,"./utils":2,"fs":3,"path":4}],2:[function(require,module,exports){/** EJS Embedded JavaScript templates* Copyright 2112 Matthew Eernisse ([email protected])** Licensed under the Apache License, Version 2.0 (the "License");* you may not use this file except in compliance with the License.* You may obtain a copy of the License at**         http://www.apache.org/licenses/LICENSE-2.0** Unless required by applicable law or agreed to in writing, software* distributed under the License is distributed on an "AS IS" BASIS,* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.* See the License for the specific language ###erning permissions and* limitations under the License.**//*** Private utility functions* @module utils* @private*/'use strict';var regExpChars = /[|\\{}()[\]^$+*?.]/g;/*** Escape characters reserved in regular expressions.** If `string` is `undefined` or `null`, the empty string is returned.** @param {String} string Input string* @return {String} Escaped string* @static* @private*/exports.escapeRegExpChars = function (string) {// istanbul ignore ifif (!string) {return '';}return String(string).replace(regExpChars, '\\$&');};var _ENCODE_HTML_RULES = {'&': '&amp;','<': '&lt;','>': '&gt;','"': '&#34;',"'": '&#39;'};var _MATCH_HTML = /[&<>'"]/g;function encode_char(c) {return _ENCODE_HTML_RULES[c] || c;}/*** Stringified version of constants used by {@link module:utils.escapeXML}.** It is used in the process of generating {@link ClientFunction}s.** @readonly* @type {String}*/var escapeFuncStr ='var _ENCODE_HTML_RULES = {\n'+ '      "&": "&amp;"\n'+ '    , "<": "&lt;"\n'+ '    , ">": "&gt;"\n'+ '    , \'"\': "&#34;"\n'+ '    , "\'": "&#39;"\n'+ '    }\n'+ '  , _MATCH_HTML = /[&<>\'"]/g;\n'+ 'function encode_char(c) {\n'+ '  return _ENCODE_HTML_RULES[c] || c;\n'+ '};\n';/*** Escape characters reserved in XML.** If `markup` is `undefined` or `null`, the empty string is returned.** @implements {EscapeCallback}* @param {String} markup Input string* @return {String} Escaped string* @static* @private*/exports.escapeXML = function (markup) {return markup == undefined? '': String(markup).replace(_MATCH_HTML, encode_char);};exports.escapeXML.toString = function () {return Function.prototype.toString.call(this) + ';\n' + escapeFuncStr;};/*** Naive copy of properties from one object to another.* Does not recurse into non-scalar properties* Does not check to see if the property has a value before copying** @param  {Object} to   Destination object* @param  {Object} from Source object* @return {Object}      Destination object* @static* @private*/exports.shallowCopy = function (to, from) {from = from || {};for (var p in from) {to[p] = from[p];}return to;};/*** Naive copy of a list of key names, from one object to another.* Only copies property if it is actually defined* Does not recurse into non-scalar properties** @param  {Object} to   Destination object* @param  {Object} from Source object* @param  {Array} list List of properties to copy* @return {Object}      Destination object* @static* @private*/exports.shallowCopyFromList = function (to, from, list) {for (var i = 0; i < list.length; i++) {var p = list[i];if (typeof from[p] != 'undefined') {to[p] = from[p];}}return to;};/*** Simple in-process cache implementation. Does not implement limits of any* sort.** @implements {Cache}* @static* @private*/exports.cache = {_data: {},set: function (key, val) {this._data[key] = val;},get: function (key) {return this._data[key];},remove: function (key) {delete this._data[key];},reset: function () {this._data = {};}};/*** Transforms hyphen case variable into camel case.** @param {String} string Hyphen case string* @return {String} Camel case string* @static* @private*/exports.hyphenToCamel = function (str) {return str.replace(/-[a-z]/g, function (match) { return match[1].toUpperCase(); });};},{}],3:[function(require,module,exports){},{}],4:[function(require,module,exports){(function (process){// .dirname, .basename, and .extname methods are extracted from Node.js v8.11.1,// backported and transplited with Babel, with backwards-compat fixes// 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.// resolves . and .. elements in a path array with directory names there// must be no slashes, empty elements, or device names (c:\) in the array// (so also no leading and trailing slashes - it does not distinguish// relative and absolute paths)function normalizeArray(parts, allowAboveRoot) {// if the path tries to go above the root, `up` ends up > 0var up = 0;for (var i = parts.length - 1; i >= 0; i--) {var last = parts[i];if (last === '.') {parts.splice(i, 1);} else if (last === '..') {parts.splice(i, 1);up++;} else if (up) {parts.splice(i, 1);up--;}}// if the path is allowed to go above the root, restore leading ..sif (allowAboveRoot) {for (; up--; up) {parts.unshift('..');}}return parts;}// path.resolve([from ...], to)// posix versionexports.resolve = function() {var resolvedPath = '',resolvedAbsolute = false;for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {var path = (i >= 0) ? arguments[i] : process.cwd();// Skip empty and invalid entriesif (typeof path !== 'string') {throw new TypeError('Arguments to path.resolve must be strings');} else if (!path) {continue;}resolvedPath = path + '/' + resolvedPath;resolvedAbsolute = path.charAt(0) === '/';}// At this point the path should be resolved to a full absolute path, but// handle relative paths to be safe (might happen when process.cwd() fails)// Normalize the pathresolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {return !!p;}), !resolvedAbsolute).join('/');return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';};// path.normalize(path)// posix versionexports.normalize = function(path) {var isAbsolute = exports.isAbsolute(path),trailingSlash = substr(path, -1) === '/';// Normalize the pathpath = normalizeArray(filter(path.split('/'), function(p) {return !!p;}), !isAbsolute).join('/');if (!path && !isAbsolute) {path = '.';}if (path && trailingSlash) {path += '/';}return (isAbsolute ? '/' : '') + path;};// posix versionexports.isAbsolute = function(path) {return path.charAt(0) === '/';};// posix versionexports.join = function() {var paths = Array.prototype.slice.call(arguments, 0);return exports.normalize(filter(paths, function(p, index) {if (typeof p !== 'string') {throw new TypeError('Arguments to path.join must be strings');}return p;}).join('/'));};// path.relative(from, to)// posix versionexports.relative = function(from, to) {from = exports.resolve(from).substr(1);to = exports.resolve(to).substr(1);function trim(arr) {var start = 0;for (; start < arr.length; start++) {if (arr[start] !== '') break;}var end = arr.length - 1;for (; end >= 0; end--) {if (arr[end] !== '') break;}if (start > end) return [];return arr.slice(start, end - start + 1);}var fromParts = trim(from.split('/'));var toParts = trim(to.split('/'));var length = Math.min(fromParts.length, toParts.length);var samePartsLength = length;for (var i = 0; i < length; i++) {if (fromParts[i] !== toParts[i]) {samePartsLength = i;break;}}var outputParts = [];for (var i = samePartsLength; i < fromParts.length; i++) {outputParts.push('..');}outputParts = outputParts.concat(toParts.slice(samePartsLength));return outputParts.join('/');};exports.sep = '/';exports.delimiter = ':';exports.dirname = function (path) {if (typeof path !== 'string') path = path + '';if (path.length === 0) return '.';var code = path.charCodeAt(0);var hasRoot = code === 47 /*/*/;var end = -1;var matchedSlash = true;for (var i = path.length - 1; i >= 1; --i) {code = path.charCodeAt(i);if (code === 47 /*/*/) {if (!matchedSlash) {end = i;break;}} else {// We saw the first non-path separatormatchedSlash = false;}}if (end === -1) return hasRoot ? '/' : '.';if (hasRoot && end === 1) {// return '//';// Backwards-compat fix:return '/';}return path.slice(0, end);};function basename(path) {if (typeof path !== 'string') path = path + '';var start = 0;var end = -1;var matchedSlash = true;var i;for (i = path.length - 1; i >= 0; --i) {if (path.charCodeAt(i) === 47 /*/*/) {// If we reached a path separator that was not part of a set of path// separators at the end of the string, stop nowif (!matchedSlash) {start = i + 1;break;}} else if (end === -1) {// We saw the first non-path separator, mark this as the end of our// path componentmatchedSlash = false;end = i + 1;}}if (end === -1) return '';return path.slice(start, end);}// Uses a mixed approach for backwards-compatibility, as ext behavior changed// in new Node.js versions, so only basename() above is backported hereexports.basename = function (path, ext) {var f = basename(path);if (ext && f.substr(-1 * ext.length) === ext) {f = f.substr(0, f.length - ext.length);}return f;};exports.extname = function (path) {if (typeof path !== 'string') path = path + '';var startDot = -1;var startPart = 0;var end = -1;var matchedSlash = true;// Track the state of characters (if any) we see before our first dot and// after any path separator we findvar preDotState = 0;for (var i = path.length - 1; i >= 0; --i) {var code = path.charCodeAt(i);if (code === 47 /*/*/) {// If we reached a path separator that was not part of a set of path// separators at the end of the string, stop nowif (!matchedSlash) {startPart = i + 1;break;}continue;}if (end === -1) {// We saw the first non-path separator, mark this as the end of our// extensionmatchedSlash = false;end = i + 1;}if (code === 46 /*.*/) {// If this is our first dot, mark it as the start of our extensionif (startDot === -1)startDot = i;else if (preDotState !== 1)preDotState = 1;} else if (startDot !== -1) {// We saw a non-dot and non-path separator before our dot, so we should// have a good chance at having a non-empty extensionpreDotState = -1;}}if (startDot === -1 || end === -1 ||// We saw a non-dot character immediately before the dotpreDotState === 0 ||// The (right-most) trimmed path component is exactly '..'preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {return '';}return path.slice(startDot, end);};function filter (xs, f) {if (xs.filter) return xs.filter(f);var res = [];for (var i = 0; i < xs.length; i++) {if (f(xs[i], i, xs)) res.push(xs[i]);}return res;}// String.prototype.substr - negative index don't work in IE8var substr =  true? function (str, start, len) { return str.substr(start, len) }: 0;}).call(this,require('_process'))},{"_process":5}],5:[function(require,module,exports){// shim for using process in browservar process = module.exports = {};// cached from whatever global is present so that test runners that stub it// don't break things.  But we need to wrap it in a try catch in case it is// wrapped in strict mode code which doesn't define any globals.  It's inside a// function because try/catches deoptimize in certain engines.var cachedSetTimeout;var cachedClearTimeout;function defaultSetTimout() {throw new Error('setTimeout has not been defined');}function defaultClearTimeout () {throw new Error('clearTimeout has not been defined');}(function () {try {if (typeof setTimeout === 'function') {cachedSetTimeout = setTimeout;} else {cachedSetTimeout = defaultSetTimout;}} catch (e) {cachedSetTimeout = defaultSetTimout;}try {if (typeof clearTimeout === 'function') {cachedClearTimeout = clearTimeout;} else {cachedClearTimeout = defaultClearTimeout;}} catch (e) {cachedClearTimeout = defaultClearTimeout;}} ())function runTimeout(fun) {if (cachedSetTimeout === setTimeout) {//normal enviroments in sane situationsreturn setTimeout(fun, 0);}// if setTimeout wasn't available but was latter definedif ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {cachedSetTimeout = setTimeout;return setTimeout(fun, 0);}try {// when when somebody has screwed with setTimeout but no I.E. maddnessreturn cachedSetTimeout(fun, 0);} catch(e){try {// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normallyreturn cachedSetTimeout.call(null, fun, 0);} catch(e){// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global errorreturn cachedSetTimeout.call(this, fun, 0);}}}function runClearTimeout(marker) {if (cachedClearTimeout === clearTimeout) {//normal enviroments in sane situationsreturn clearTimeout(marker);}// if clearTimeout wasn't available but was latter definedif ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {cachedClearTimeout = clearTimeout;return clearTimeout(marker);}try {// when when somebody has screwed with setTimeout but no I.E. maddnessreturn cachedClearTimeout(marker);} catch (e){try {// When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normallyreturn cachedClearTimeout.call(null, marker);} catch (e){// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.// Some versions of I.E. have different rules for clearTimeout vs setTimeoutreturn cachedClearTimeout.call(this, marker);}}}var queue = [];var draining = false;var currentQueue;var queueIndex = -1;function cleanUpNextTick() {if (!draining || !currentQueue) {return;}draining = false;if (currentQueue.length) {queue = currentQueue.concat(queue);} else {queueIndex = -1;}if (queue.length) {drainQueue();}}function drainQueue() {if (draining) {return;}var timeout = runTimeout(cleanUpNextTick);draining = true;var len = queue.length;while(len) {currentQueue = queue;queue = [];while (++queueIndex < len) {if (currentQueue) {currentQueue[queueIndex].run();}}queueIndex = -1;len = queue.length;}currentQueue = null;draining = false;runClearTimeout(timeout);}process.nextTick = function (fun) {var args = new Array(arguments.length - 1);if (arguments.length > 1) {for (var i = 1; i < arguments.length; i++) {args[i - 1] = arguments[i];}}queue.push(new Item(fun, args));if (queue.length === 1 && !draining) {runTimeout(drainQueue);}};// v8 likes predictible objectsfunction Item(fun, array) {this.fun = fun;this.array = array;}Item.prototype.run = function () {this.fun.apply(null, this.array);};process.title = 'browser';process.browser = true;process.env = {};process.argv = [];process.version = ''; // empty string to avoid regexp issuesprocess.versions = {};function noop() {}process.on = noop;process.addListener = noop;process.once = noop;process.off = noop;process.removeListener = noop;process.removeAllListeners = noop;process.emit = noop;process.prependListener = noop;process.prependOnceListener = noop;process.listeners = function (name) { return [] }process.binding = function (name) {throw new Error('process.binding is not supported');};process.cwd = function () { return '/' };process.chdir = function (dir) {throw new Error('process.chdir is not supported');};process.umask = function() { return 0; };},{}],6:[function(require,module,exports){module.exports={"name": "ejs","description": "Embedded JavaScript templates","keywords": ["template","engine","ejs"],"version": "3.1.6","author": "Matthew Eernisse <[email protected]> (http://fleegix.org)","license": "Apache-2.0","bin": {"ejs": "./bin/cli.js"},"main": "./lib/ejs.js","jsdelivr": "ejs.min.js","unpkg": "ejs.min.js","repository": {"type": "git","url": "git://github.com/mde/ejs.git"},"bugs": "https://github.com/mde/ejs/issues","homepage": "https://github.com/mde/ejs","dependencies": {"jake": "^10.6.1"},"devDependencies": {"browserify": "^16.5.1","eslint": "^6.8.0","git-directory-deploy": "^1.5.1","jsdoc": "^3.6.4","lru-cache": "^4.0.1","mocha": "^7.1.1","uglify-js": "^3.3.16"},"engines": {"node": ">=0.10.0"},"scripts": {"test": "mocha"}}},{}]},{},[1])(1)});/***/ }),/***/ 8680:/***/ ((module) => {"use strict";module.exports = {AES_STANDARD: 'AES-CBC',RSA_STANDARD: 'RSA-OAEP',DEFAULT_MESSAGE_DIGEST: 'sha256',DEFAULT_AES_KEY_SIZE: 256,DEFAULT_AES_IV_SIZE: 32};/***/ }),/***/ 3307:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {"use strict";function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(source).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }var helpers = __webpack_require__(7098);var forge = __webpack_require__(1632);var pki = forge.pki,rsa = forge.rsa;var _require = __webpack_require__(8680),DEFAULT_MESSAGE_DIGEST = _require.DEFAULT_MESSAGE_DIGEST,DEFAULT_AES_KEY_SIZE = _require.DEFAULT_AES_KEY_SIZE,DEFAULT_AES_IV_SIZE = _require.DEFAULT_AES_IV_SIZE,AES_STANDARD = _require.AES_STANDARD,RSA_STANDARD = _require.RSA_STANDARD;var Crypt =/*#__PURE__*/function () {function Crypt() {var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};_classCallCheck(this, Crypt);this.options = _objectSpread({md: DEFAULT_MESSAGE_DIGEST,aesKeySize: DEFAULT_AES_KEY_SIZE,aesIvSize: DEFAULT_AES_IV_SIZE,aesStandard: AES_STANDARD,rsaStandard: RSA_STANDARD,entropy: undefined}, options); // Add some entropy if availableif (this.options.entropy) {this._entropy(this.options.entropy);}}/*** Returns message digest by type** @param {String} messageDigest Message digest type as string** @return {Object} Initialized message digest* @method*/_createClass(Crypt, [{key: "_getMessageDigest",value: function _getMessageDigest(messageDigest) {switch (messageDigest) {case 'sha1':return forge.md.sha1.create();case 'sha256':return forge.md.sha256.create();case 'sha384':return forge.md.sha384.create();case 'sha512':return forge.md.sha512.create();case 'md5':return forge.md.md5.create();default:console.warn("Message digest \"".concat(this.options.md, "\" not found. Using default message digest \"sha1\" instead"));return forge.md.sha1.create();}}/*** Parses hybrid-crypto-js signature** @param {String} _signature Signature string. Either JSON formatted string (>= hybrid-crypto-js 0.2.1) or plain signature** @return {Object} Parsed signature* @method*/}, {key: "_parseSignature",value: function _parseSignature(_signature) {// Try parsing signature string. This works if// signature is generated with hybrid-crypto-js// versions >= 0.2.1.try {return JSON.parse(_signature);} catch (e) {// Fallback to old signature type. This works// with signatures generated with hybrid-cryto-js// versions <= 0.2.0return {signature: _signature,md: 'sha1',v: helpers.version()};}}/*** Returns fingerprint for any public key** @param {Object} publicKey Forge public key object** @return {String} Public key's fingerprint* @method*/}, {key: "fingerprint",value: function fingerprint(publicKey) {return pki.getPublicKeyFingerprint(publicKey, {encoding: 'hex',delimiter: ':'});}/*** Signs a message** @param {String} privateKey Private key in PEM format* @param {String} message Message to sign** @return {String} Signature and meta data as a JSON formatted string* @method*/}, {key: "signature",value: function signature(privateKey, message) {// Create SHA-1 checksumvar checkSum = this._getMessageDigest(this.options.md);checkSum.update(message, 'utf8'); // Accept both PEMs and forge private key objectsif (typeof privateKey === 'string') privateKey = pki.privateKeyFromPem(privateKey);var signature = privateKey.sign(checkSum);var signature64 = forge.util.encode64(signature); // Return signature in JSON formatreturn JSON.stringify({signature: signature64,md: this.options.md});}/*** Verifies a message** @param {String} publicKey Public key in PEM format* @param {String} _signature Signature in JSON string format* @param {String} decrypted Decrypted message** @return {Boolean} Tells whether verification were successful or not* @method*/}, {key: "verify",value: function verify(publicKey, _signature, decrypted) {// Return false if no signature is definedif (!_signature) return false; // Parse signature object into actual signature and message digest typevar _this$_parseSignature = this._parseSignature(_signature),signature = _this$_parseSignature.signature,md = _this$_parseSignature.md; // Create SHA-1 checksumvar checkSum = this._getMessageDigest(md);checkSum.update(decrypted, 'utf8'); // Base64 decode signaturesignature = forge.util.decode64(signature); // Accept both PEMs and forge private key objectsif (typeof publicKey === 'string') publicKey = pki.publicKeyFromPem(publicKey); // Verify signaturereturn publicKey.verify(checkSum.digest().getBytes(), signature);}/*** Encrypts a message using public RSA key and optional signature** @param {String[]} publicKeys Public keys in PEM format* @param {String} message Message to encrypt* @param {String} signature Optional signature** @return {String} Encrypted message and metadata as a JSON formatted string* @method*/}, {key: "encrypt",value: function encrypt(publicKeys, message, signature) {var _this = this;// Generate flat array of keyspublicKeys = helpers.toArray(publicKeys); // Map PEM keys to forge public key objectspublicKeys = publicKeys.map(function (key) {return typeof key === 'string' ? pki.publicKeyFromPem(key) : key;}); // Generate random keysvar iv = forge.random.getBytesSync(this.options.aesIvSize);var key = forge.random.getBytesSync(this.options.aesKeySize / 8); // Encrypt random key with all of the public keysvar encryptedKeys = {};publicKeys.forEach(function (publicKey) {var encryptedKey = publicKey.encrypt(key, _this.options.rsaStandard);var fingerprint = _this.fingerprint(publicKey);encryptedKeys[fingerprint] = forge.util.encode64(encryptedKey);}); // Create buffer and ciphervar buffer = forge.util.createBuffer(message, 'utf8');var cipher = forge.cipher.createCipher(this.options.aesStandard, key); // Actual encryptioncipher.start({iv: iv});cipher.update(buffer);cipher.finish(); // Attach encrypted message int payloadvar payload = {};payload.v = helpers.version();payload.iv = forge.util.encode64(iv);payload.keys = encryptedKeys;payload.cipher = forge.util.encode64(cipher.output.data);payload.signature = signature;payload.tag = cipher.mode.tag && forge.util.encode64(cipher.mode.tag.getBytes()); // Return encrypted messagereturn JSON.stringify(payload);}/*** Decrypts a message using private RSA key** @param {String} privateKey Private key in PEM format* @param {String} encrypted Message to decrypt** @return {Object} Decrypted message and metadata as a JSON object* @method*/}, {key: "decrypt",value: function decrypt(privateKey, encrypted) {// Validate encrypted messagethis._validate(encrypted); // Parse encrypted string to JSONvar payload = JSON.parse(encrypted); // Accept both PEMs and forge private key objects// Cast PEM to forge private key objectif (typeof privateKey === 'string') privateKey = pki.privateKeyFromPem(privateKey); // Get key fingerprintvar fingerprint = this.fingerprint(privateKey); // Get encrypted keys and encrypted message from the payloadvar encryptedKey = payload.keys[fingerprint]; // Log error if key wasn't foundif (!encryptedKey) throw "RSA fingerprint doesn't match with any of the encrypted message's fingerprints"; // Get bytes of encrypted AES key, initialization vector and ciphervar keyBytes = forge.util.decode64(encryptedKey);var iv = forge.util.decode64(payload.iv);var cipher = forge.util.decode64(payload.cipher);var tag = payload.tag && forge.util.decode64(payload.tag); // Use RSA to decrypt AES keyvar key = privateKey.decrypt(keyBytes, this.options.rsaStandard); // Create buffer and deciphervar buffer = forge.util.createBuffer(cipher);var decipher = forge.cipher.createDecipher(this.options.aesStandard, key); // Actual decryptiondecipher.start({iv: iv,tag: tag});decipher.update(buffer);decipher.finish(); // Return utf-8 encoded bytesvar bytes = decipher.output.getBytes();var decrypted = forge.util.decodeUtf8(bytes);var output = {};output.message = decrypted;output.signature = payload.signature;return output;}/*** Validates encrypted message** @param {String} encrypted Encrypted message** @method*/}, {key: "_validate",value: function _validate(encrypted) {var p = JSON.parse(encrypted);if ( // Check required properties!(p.hasOwnProperty('v') && p.hasOwnProperty('iv') && p.hasOwnProperty('keys') && p.hasOwnProperty('cipher'))) throw 'Encrypted message is not valid';}/*** Private function to add more entropy** @param {String|Number} input Something random** @method*/}, {key: "_entropy",value: function _entropy(input) {var inputString = String(input);var bytes = forge.util.encodeUtf8(inputString);forge.random.collect(bytes);}}]);return Crypt;}();module.exports = Crypt;/***/ }),/***/ 7098:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {"use strict";var pkg = __webpack_require__(7371);module.exports = {version: function version() {return "".concat(pkg.name, "_").concat(pkg.version);},toArray: function toArray(obj) {return Array.isArray(obj) ? obj : [obj];}};/***/ }),/***/ 7900:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {"use strict";var Crypt = __webpack_require__(3307);var RSA = __webpack_require__(5474);module.exports = {Crypt: Crypt,RSA: RSA};/***/ }),/***/ 5474:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {"use strict";function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(source, true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(source).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }var forge = __webpack_require__(1632);var pki = forge.pki;var RSA =/*#__PURE__*/function () {function RSA() {var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};_classCallCheck(this, RSA);this.options = _objectSpread({keySize: 4096,entropy: undefined}, options);if (this.options.entropy) {this._entropy(this.options.entropy);}}/*** Generates RSA keypair** @param {function} callback Function that gets called when keys are generated* @param {int} [keySize=4096] Integer that determines the RSA key size** @example* rsa.generateKeyPair(keys => console.log(keys), ####);** @method*/_createClass(RSA, [{key: "generateKeyPair",value: function generateKeyPair(callback, keySize) {// Generate key pair using forgepki.rsa.generateKeyPair({bits: keySize || this.options.keySize,workers: -1}, function (err, keyPair) {// Cast key pair to PEM formatkeyPair.publicKey = pki.publicKeyToPem(keyPair.publicKey);keyPair.privateKey = pki.privateKeyToPem(keyPair.privateKey);callback(keyPair);});}/*** Generates RSA keypair** @param {int} [keySize=4096] Integer that determines the RSA key size** @example* rsa.generateKeyPair(####).then(keys => console.log(keys));** @return {Promise} Promise that gets resolved when generation is ready* @method*/}, {key: "generateKeyPairAsync",value: function generateKeyPairAsync(keySize) {var _this = this;return new Promise(function (resolve) {_this.generateKeyPair(resolve, keySize);});}/*** Private function to add more entropy** @param {String|Number} input Something random** @method*/}, {key: "_entropy",value: function _entropy(input) {var inputString = String(input);var bytes = forge.util.encodeUtf8(inputString);forge.random.collect(bytes);}}]);return RSA;}();module.exports = RSA;/***/ }),/***/ 8315:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Advanced Encryption Standard (AES) implementation.** This implementation is based on the public domain library 'jscrypto' which* was written by:** Emily Stark ([email protected])* Mike Hamburg ([email protected])* Dan Boneh ([email protected])** Parts of this code are based on the OpenSSL implementation of AES:* http://www.openssl.org** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(9671);__webpack_require__(3982);__webpack_require__(2365);/* AES API */module.exports = forge.aes = forge.aes || {};/*** Deprecated. Instead, use:** var cipher = forge.cipher.createCipher('AES-<mode>', key);* cipher.start({iv: iv});** Creates an AES cipher object to encrypt data using the given symmetric key.* The output will be stored in the 'output' member of the returned cipher.** The key and iv may be given as a string of bytes, an array of bytes,* a byte buffer, or an array of 32-bit words.** @param key the symmetric key to use.* @param iv the initialization vector to use.* @param output the buffer to write to, null to create one.* @param mode the cipher mode to use (default: 'CBC').** @return the cipher.*/forge.aes.startEncrypting = function(key, iv, output, mode) {var cipher = _createCipher({key: key,output: output,decrypt: false,mode: mode});cipher.start(iv);return cipher;};/*** Deprecated. Instead, use:** var cipher = forge.cipher.createCipher('AES-<mode>', key);** Creates an AES cipher object to encrypt data using the given symmetric key.** The key may be given as a string of bytes, an array of bytes, a* byte buffer, or an array of 32-bit words.** @param key the symmetric key to use.* @param mode the cipher mode to use (default: 'CBC').** @return the cipher.*/forge.aes.createEncryptionCipher = function(key, mode) {return _createCipher({key: key,output: null,decrypt: false,mode: mode});};/*** Deprecated. Instead, use:** var decipher = forge.cipher.createDecipher('AES-<mode>', key);* decipher.start({iv: iv});** Creates an AES cipher object to decrypt data using the given symmetric key.* The output will be stored in the 'output' member of the returned cipher.** The key and iv may be given as a string of bytes, an array of bytes,* a byte buffer, or an array of 32-bit words.** @param key the symmetric key to use.* @param iv the initialization vector to use.* @param output the buffer to write to, null to create one.* @param mode the cipher mode to use (default: 'CBC').** @return the cipher.*/forge.aes.startDecrypting = function(key, iv, output, mode) {var cipher = _createCipher({key: key,output: output,decrypt: true,mode: mode});cipher.start(iv);return cipher;};/*** Deprecated. Instead, use:** var decipher = forge.cipher.createDecipher('AES-<mode>', key);** Creates an AES cipher object to decrypt data using the given symmetric key.** The key may be given as a string of bytes, an array of bytes, a* byte buffer, or an array of 32-bit words.** @param key the symmetric key to use.* @param mode the cipher mode to use (default: 'CBC').** @return the cipher.*/forge.aes.createDecryptionCipher = function(key, mode) {return _createCipher({key: key,output: null,decrypt: true,mode: mode});};/*** Creates a new AES cipher algorithm object.** @param name the name of the algorithm.* @param mode the mode factory function.** @return the AES algorithm object.*/forge.aes.Algorithm = function(name, mode) {if(!init) {initialize();}var self = this;self.name = name;self.mode = new mode({blockSize: 16,cipher: {encrypt: function(inBlock, outBlock) {return _updateBlock(self._w, inBlock, outBlock, false);},decrypt: function(inBlock, outBlock) {return _updateBlock(self._w, inBlock, outBlock, true);}}});self._init = false;};/*** Initializes this AES algorithm by expanding its key.** @param options the options to use.*          key the key to use with this algorithm.*          decrypt true if the algorithm should be initialized for decryption,*            false for encryption.*/forge.aes.Algorithm.prototype.initialize = function(options) {if(this._init) {return;}var key = options.key;var tmp;/* Note: The key may be a string of bytes, an array of bytes, a bytebuffer, or an array of 32-bit integers. If the key is in bytes, thenit must be 16, 24, or 32 bytes in length. If it is in 32-bitintegers, it must be 4, 6, or 8 integers long. */if(typeof key === 'string' &&(key.length === 16 || key.length === 24 || key.length === 32)) {// convert key string into byte bufferkey = forge.util.createBuffer(key);} else if(forge.util.isArray(key) &&(key.length === 16 || key.length === 24 || key.length === 32)) {// convert key integer array into byte buffertmp = key;key = forge.util.createBuffer();for(var i = 0; i < tmp.length; ++i) {key.putByte(tmp[i]);}}// convert key byte buffer into 32-bit integer arrayif(!forge.util.isArray(key)) {tmp = key;key = [];// key lengths of 16, 24, 32 bytes allowedvar len = tmp.length();if(len === 16 || len === 24 || len === 32) {len = len >>> 2;for(var i = 0; i < len; ++i) {key.push(tmp.getInt32());}}}// key must be an array of 32-bit integers by nowif(!forge.util.isArray(key) ||!(key.length === 4 || key.length === 6 || key.length === 8)) {throw new Error('Invalid key parameter.');}// encryption operation is always used for these modesvar mode = this.mode.name;var encryptOp = (['CFB', 'OFB', 'CTR', 'GCM'].indexOf(mode) !== -1);// do key expansionthis._w = _expandKey(key, options.decrypt && !encryptOp);this._init = true;};/*** Expands a key. Typically only used for testing.** @param key the symmetric key to expand, as an array of 32-bit words.* @param decrypt true to expand for decryption, false for encryption.** @return the expanded key.*/forge.aes._expandKey = function(key, decrypt) {if(!init) {initialize();}return _expandKey(key, decrypt);};/*** Updates a single block. Typically only used for testing.** @param w the expanded key to use.* @param input an array of block-size 32-bit words.* @param output an array of block-size 32-bit words.* @param decrypt true to decrypt, false to encrypt.*/forge.aes._updateBlock = _updateBlock;/** Register AES algorithms **/registerAlgorithm('AES-ECB', forge.cipher.modes.ecb);registerAlgorithm('AES-CBC', forge.cipher.modes.cbc);registerAlgorithm('AES-CFB', forge.cipher.modes.cfb);registerAlgorithm('AES-OFB', forge.cipher.modes.ofb);registerAlgorithm('AES-CTR', forge.cipher.modes.ctr);registerAlgorithm('AES-GCM', forge.cipher.modes.gcm);function registerAlgorithm(name, mode) {var factory = function() {return new forge.aes.Algorithm(name, mode);};forge.cipher.registerAlgorithm(name, factory);}/** AES implementation **/var init = false; // not yet initializedvar Nb = 4;       // number of words comprising the state (AES = 4)var sbox;         // non-linear substitution table used in key expansionvar isbox;        // inversion of sboxvar rcon;         // round constant word arrayvar mix;          // mix-columns tablevar imix;         // inverse mix-columns table/*** Performs initialization, ie: precomputes tables to optimize for speed.** One way to understand how AES works is to imagine that 'addition' and* 'multiplication' are interfaces that require certain mathematical* properties to hold true (ie: they are associative) but they might have* different implementations and produce different kinds of r###lts ...* provided that their mathematical properties remain true. AES defines* its own methods of addition and multiplication but keeps some important* properties the same, ie: associativity and distributivity. The* explanation below tries to shed some light on how AES defines addition* and multiplication of bytes and 32-bit words in order to perform its* encryption and decryption algorithms.** The basics:** The AES algorithm views bytes as binary representations of polynomials* that have either 1 or 0 as the coefficients. It defines the addition* or subtraction of two bytes as the XOR operation. It also defines the* multiplication of two bytes as a finite field referred to as GF(2^8)* (Note: 'GF' means "Galois Field" which is a field that contains a finite* number of elements so GF(2^8) has 256 elements).** This means that any two bytes can be represented as binary polynomials;* when they multiplied together and modularly reduced by an irreducible* polynomial of the 8th degree, the r###lts are the field GF(2^8). The* specific irreducible polynomial that AES uses in hexadecimal is 0x11b.* This multiplication is associative with 0x01 as the identity:** (b * 0x01 = GF(b, 0x01) = b).** The operation GF(b, 0x02) can be performed at the byte level by left* shifting b once and then XOR'ing it (to perform the modular reduction)* with 0x11b if b is >= 128. Repeated application of the multiplication* of 0x02 can be used to implement the multiplication of any two bytes.** For instance, multiplying 0x57 and 0x13, denoted as GF(0x57, 0x13), can* be performed by factoring 0x13 into 0x01, 0x02, and 0x10. Then these* factors can each be multiplied by 0x57 and then added together. To do* the multiplication, values for 0x57 multiplied by each of these 3 factors* can be precomputed and stored in a table. To add them, the values from* the table are XOR'd together.** AES also defines addition and multiplication of words, that is 4-byte* numbers represented as polynomials of 3 degrees where the coefficients* are the values of the bytes.** The word [a0, a1, a2, a3] is a polynomial a3x^3 + a2x^2 + a1x + a0.** Addition is performed by XOR'ing like powers of x. Multiplication* is performed in two steps, the first is an algebriac expansion as* you would do normally (where addition is XOR). But the r###lt is* a polynomial larger than 3 degrees and thus it cannot fit in a word. So* next the r###lt is modularly reduced by an AES-specific polynomial of* degree 4 which will always produce a polynomial of less than 4 degrees* such that it will fit in a word. In AES, this polynomial is x^4 + 1.** The modular product of two polynomials 'a' and 'b' is thus:** d(x) = d3x^3 + d2x^2 + d1x + d0* with* d0 = GF(a0, b0) ^ GF(a3, b1) ^ GF(a2, b2) ^ GF(a1, b3)* d1 = GF(a1, b0) ^ GF(a0, b1) ^ GF(a3, b2) ^ GF(a2, b3)* d2 = GF(a2, b0) ^ GF(a1, b1) ^ GF(a0, b2) ^ GF(a3, b3)* d3 = GF(a3, b0) ^ GF(a2, b1) ^ GF(a1, b2) ^ GF(a0, b3)** As a matrix:** [d0] = [a0 a3 a2 a1][b0]* [d1]   [a1 a0 a3 a2][b1]* [d2]   [a2 a1 a0 a3][b2]* [d3]   [a3 a2 a1 a0][b3]** Special polynomials defined by AES (0x02 == {02}):* a(x)    = {03}x^3 + {01}x^2 + {01}x + {02}* a^-1(x) = {0b}x^3 + {0d}x^2 + {09}x + {0e}.** These polynomials are used in the MixColumns() and InverseMixColumns()* operations, respectively, to cause each element in the state to affect* the output (referred to as diffusing).** RotWord() uses: a0 = a1 = a2 = {00} and a3 = {01}, which is the* polynomial x3.** The ShiftRows() method modifies the last 3 rows in the state (where* the state is 4 words with 4 bytes per word) by shifting bytes cyclically.* The 1st byte in the second row is moved to the end of the row. The 1st* and 2nd bytes in the third row are moved to the end of the row. The 1st,* 2nd, and 3rd bytes are moved in the fourth row.** More details on how AES arithmetic works:** In the polynomial representation of binary numbers, XOR performs addition* and subtraction and multiplication in GF(2^8) denoted as GF(a, b)* corresponds with the multiplication of polynomials modulo an irreducible* polynomial of degree 8. In other words, for AES, GF(a, b) will multiply* polynomial 'a' with polynomial 'b' and then do a modular reduction by* an AES-specific irreducible polynomial of degree 8.** A polynomial is irreducible if its only divisors are one and itself. For* the AES algorithm, this irreducible polynomial is:** m(x) = x^8 + x^4 + x^3 + x + 1,** or {01}{1b} in hexadecimal notation, where each coefficient is a bit:* 100011011 = 283 = 0x11b.** For example, GF(0x57, 0x83) = 0xc1 because** 0x57 = 87  = 01010111 = x^6 + x^4 + x^2 + x + 1* 0x85 = 131 = 10000101 = x^7 + x + 1** (x^6 + x^4 + x^2 + x + 1) * (x^7 + x + 1)* =  x^13 + x^11 + x^9 + x^8 + x^7 +*    x^7 + x^5 + x^3 + x^2 + x +*    x^6 + x^4 + x^2 + x + 1* =  x^13 + x^11 + x^9 + x^8 + x^6 + x^5 + x^4 + x^3 + 1 = y*    y modulo (x^8 + x^4 + x^3 + x + 1)* =  x^7 + x^6 + 1.** The modular reduction by m(x) guarantees the r###lt will be a binary* polynomial of less than degree 8, so that it can fit in a byte.** The operation to multiply a binary polynomial b with x (the polynomial* x in binary representation is 00000010) is:** b_7x^8 + b_6x^7 + b_5x^6 + b_4x^5 + b_3x^4 + b_2x^3 + b_1x^2 + b_0x^1** To get GF(b, x) we must reduce that by m(x). If b_7 is 0 (that is the* most significant bit is 0 in b) then the r###lt is already reduced. If* it is 1, then we can reduce it by subtracting m(x) via an XOR.** It follows that multiplication by x (00000010 or 0x02) can be implemented* by performing a left shift followed by a conditional bitwise XOR with* 0x1b. This operation on bytes is denoted by xtime(). Multiplication by* higher powers of x can be implemented by repeated application of xtime().** By adding intermediate r###lts, multiplication by any constant can be* implemented. For instance:** GF(0x57, 0x13) = 0xfe because:** xtime(b) = (b & 128) ? (b << 1 ^ 0x11b) : (b << 1)** Note: We XOR with 0x11b instead of 0x1b because in javascript our* datatype for b can be larger than 1 byte, so a left shift will not* automatically eliminate bits that overflow a byte ... by XOR'ing the* overflow bit with 1 (the extra one from 0x11b) we zero it out.** GF(0x57, 0x02) = xtime(0x57) = 0xae* GF(0x57, 0x04) = xtime(0xae) = 0x47* GF(0x57, 0x08) = xtime(0x47) = 0x8e* GF(0x57, 0x10) = xtime(0x8e) = 0x07** GF(0x57, 0x13) = GF(0x57, (0x01 ^ 0x02 ^ 0x10))** And by the distributive property (since XOR is addition and GF() is* multiplication):** = GF(0x57, 0x01) ^ GF(0x57, 0x02) ^ GF(0x57, 0x10)* = 0x57 ^ 0xae ^ 0x07* = 0xfe.*/function initialize() {init = true;/* Populate the Rcon table. These are the values given by[x^(i-1),{00},{00},{00}] where x^(i-1) are powers of x (and x = 0x02)in the field of GF(2^8), where i starts at 1.rcon[0] = [0x00, 0x00, 0x00, 0x00]rcon[1] = [0x01, 0x00, 0x00, 0x00] 2^(1-1) = 2^0 = 1rcon[2] = [0x02, 0x00, 0x00, 0x00] 2^(2-1) = 2^1 = 2...rcon[9]  = [0x1B, 0x00, 0x00, 0x00] 2^(9-1)  = 2^8 = 0x1Brcon[10] = [0x36, 0x00, 0x00, 0x00] 2^(10-1) = 2^9 = 0x36We only store the first byte because it is the only one used.*/rcon = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1B, 0x36];// compute xtime table which maps i onto GF(i, 0x02)var xtime = new Array(256);for(var i = 0; i < 128; ++i) {xtime[i] = i << 1;xtime[i + 128] = (i + 128) << 1 ^ 0x11B;}// compute all other tablessbox = new Array(256);isbox = new Array(256);mix = new Array(4);imix = new Array(4);for(var i = 0; i < 4; ++i) {mix[i] = new Array(256);imix[i] = new Array(256);}var e = 0, ei = 0, e2, e4, e8, sx, sx2, me, ime;for(var i = 0; i < 256; ++i) {/* We need to generate the SubBytes() sbox and isbox tables so thatwe can perform byte substitutions. This requires us to traverseall of the elements in GF, find their multiplicative inverses,and apply to each the following affine transformation:bi' = bi ^ b(i + 4) mod 8 ^ b(i + 5) mod 8 ^ b(i + 6) mod 8 ^b(i + 7) mod 8 ^ cifor 0 <= i < 8, where bi is the ith bit of the byte, and ci is theith bit of a byte c with the value {63} or {01100011}.It is possible to traverse every possible value in a Galois fieldusing what is referred to as a 'generator'. There are manygenerators (128 out of 256): 3,5,6,9,11,82 to name a few. To fullytraverse GF we iterate 255 times, multiplying by our generatoreach time.On each iteration we can determine the multiplicative inverse forthe current element.Suppose there is an element in GF 'e'. For a given generator 'g',e = g^x. The multiplicative inverse of e is g^(255 - x). It turnsout that if use the inverse of a generator as another generatorit will produce all of the corresponding multiplicative inversesat the same time. For this reason, we choose 5 as our inversegenerator because it only requires 2 multiplies and 1 add and itsinverse, 82, requires relatively few operations as well.In order to apply the affine transformation, the multiplicativeinverse 'ei' of 'e' can be repeatedly XOR'd (4 times) with abit-cycling of 'ei'. To do this 'ei' is first stored in 's' and'x'. Then 's' is left shifted and the high bit of 's' is made thelow bit. The r###lting value is stored in 's'. Then 'x' is XOR'dwith 's' and stored in 'x'. On each subsequent iteration the sameoperation is performed. When 4 iterations are complete, 'x' isXOR'd with 'c' (0x63) and the transformed value is stored in 'x'.For example:s = 01000001x = 01000001iteration 1: s = 10000010, x ^= siteration 2: s = 00000101, x ^= siteration 3: s = 00001010, x ^= siteration 4: s = 00010100, x ^= sx ^= 0x63This can be done with a loop where s = (s << 1) | (s >> 7). However,it can also be done by using a single 16-bit (in this case 32-bit)number 'sx'. Since XOR is an associative operation, we can set 'sx'to 'ei' and then XOR it with 'sx' left-shifted 1,2,3, and 4 times.The most significant bits will flow into the high 8 bit positionsand be correctly XOR'd with one another. All that remains will beto cycle the high 8 bits by XOR'ing them all with the lower 8 bitsafterwards.At the same time we're populating sbox and isbox we can precomputethe multiplication we'll need to do to do MixColumns() later.*/// apply affine transformationsx = ei ^ (ei << 1) ^ (ei << 2) ^ (ei << 3) ^ (ei << 4);sx = (sx >> 8) ^ (sx & 255) ^ 0x63;// update tablessbox[e] = sx;isbox[sx] = e;/* Mixing columns is done using matrix multiplication. The columnsthat are to be mixed are each a single word in the current state.The state has Nb columns (4 columns). Therefore each column is a4 byte word. So to mix the columns in a single column 'c' whereits rows are r0, r1, r2, and r3, we use the following matrixmultiplication:[2 3 1 1]*[r0,c]=[r'0,c][1 2 3 1] [r1,c] [r'1,c][1 1 2 3] [r2,c] [r'2,c][3 1 1 2] [r3,c] [r'3,c]r0, r1, r2, and r3 are each 1 byte of one of the words in thestate (a column). To do matrix multiplication for each mixedcolumn c' we multiply the corresponding row from the left matrixwith the corresponding column from the right matrix. In total, weget 4 equations:r0,c' = 2*r0,c + 3*r1,c + 1*r2,c + 1*r3,cr1,c' = 1*r0,c + 2*r1,c + 3*r2,c + 1*r3,cr2,c' = 1*r0,c + 1*r1,c + 2*r2,c + 3*r3,cr3,c' = 3*r0,c + 1*r1,c + 1*r2,c + 2*r3,cAs usual, the multiplication is as previously defined and theaddition is XOR. In order to optimize mixing columns we can storethe multiplication r###lts in tables. If you think of the wholecolumn as a word (it might help to visualize by mentally rotatingthe equations above by counterclockwise 90 degrees) then you cansee that it would be useful to map the multiplications performed oneach byte (r0, r1, r2, r3) onto a word as well. For instance, wecould map 2*r0,1*r0,1*r0,3*r0 onto a word by storing 2*r0 in thehighest 8 bits and 3*r0 in the lowest 8 bits (with the other tworespectively in the middle). This means that a table can beconstructed that uses r0 as an index to the word. We can do thesame with r1, r2, and r3, creating a total of 4 tables.To construct a full c', we can just look up each byte of c intheir respective tables and XOR the r###lts together.Also, to build each table we only have to calculate the wordfor 2,1,1,3 for every byte ... which we can do on each iterationof this loop since we will iterate over every byte. After we havecalculated 2,1,1,3 we can get the r###lts for the other tablesby cycling the byte at the end to the beginning. For instancewe can take the r###lt of table 2,1,1,3 and produce table 3,2,1,1by moving the right most byte to the left most position just likehow you can imagine the 3 moved out of 2,1,1,3 and to the frontto produce 3,2,1,1.There is another optimization in that the same multiples ofthe current element we need in order to advance our generatorto the next iteration can be reused in performing the 2,1,1,3calculation. We also calculate the inverse mix column tables,with e,9,d,b being the inverse of 2,1,1,3.When we're done, and we need to actually mix columns, the firstbyte of each state word should be put through mix[0] (2,1,1,3),the second through mix[1] (3,2,1,1) and so forth. Then they shouldbe XOR'd together to produce the fully mixed column.*/// calculate mix and imix table valuessx2 = xtime[sx];e2 = xtime[e];e4 = xtime[e2];e8 = xtime[e4];me =(sx2 << 24) ^  // 2(sx << 16) ^   // 1(sx << 8) ^    // 1(sx ^ sx2);    // 3ime =(e2 ^ e4 ^ e8) << 24 ^  // E (14)(e ^ e8) << 16 ^        // 9(e ^ e4 ^ e8) << 8 ^    // D (13)(e ^ e2 ^ e8);          // B (11)// produce each of the mix tables by rotating the 2,1,1,3 valuefor(var n = 0; n < 4; ++n) {mix[n][e] = me;imix[n][sx] = ime;// cycle the right most byte to the left most position// ie: 2,1,1,3 becomes 3,2,1,1me = me << 24 | me >>> 8;ime = ime << 24 | ime >>> 8;}// get next element and inverseif(e === 0) {// 1 is the inverse of 1e = ei = 1;} else {// e = 2e + 2*2*2*(10e)) = multiply e by 82 (chosen generator)// ei = ei + 2*2*ei = multiply ei by 5 (inverse generator)e = e2 ^ xtime[xtime[xtime[e2 ^ e8]]];ei ^= xtime[xtime[ei]];}}}/*** Generates a key schedule using the AES key expansion algorithm.** The AES algorithm takes the Cipher Key, K, and performs a Key Expansion* routine to generate a key schedule. The Key Expansion generates a total* of Nb*(Nr + 1) words: the algorithm requires an initial set of Nb words,* and each of the Nr rounds requires Nb words of key data. The r###lting* key schedule consists of a linear array of 4-byte words, denoted [wi ],* with i in the range 0 <= i < Nb(Nr + 1).** KeyExpansion(byte key[4*Nk], word w[Nb*(Nr+1)], Nk)* AES-128 (Nb=4, Nk=4, Nr=10)* AES-192 (Nb=4, Nk=6, Nr=12)* AES-256 (Nb=4, Nk=8, Nr=14)* Note: Nr=Nk+6.** Nb is the number of columns (32-bit words) comprising the State (or* number of bytes in a block). For AES, Nb=4.** @param key the key to schedule (as an array of 32-bit words).* @param decrypt true to modify the key schedule to decrypt, false not to.** @return the generated key schedule.*/function _expandKey(key, decrypt) {// copy the key's words to initialize the key schedulevar w = key.slice(0);/* RotWord() will rotate a word, moving the first byte to the lastbyte's position (shifting the other bytes left).We will be getting the value of Rcon at i / Nk. 'i' will iteratefrom Nk to (Nb * Nr+1). Nk = 4 (4 byte key), Nb = 4 (4 words ina block), Nr = Nk + 6 (10). Therefore 'i' will iterate from4 to 44 (exclusive). Each time we iterate 4 times, i / Nk willincrease by 1. We use a counter iNk to keep track of this.*/// go through the rounds expanding the keyvar temp, iNk = 1;var Nk = w.length;var Nr1 = Nk + 6 + 1;var end = Nb * Nr1;for(var i = Nk; i < end; ++i) {temp = w[i - 1];if(i % Nk === 0) {// temp = SubWord(RotWord(temp)) ^ Rcon[i / Nk]temp =sbox[temp >>> 16 & 255] << 24 ^sbox[temp >>> 8 & 255] << 16 ^sbox[temp & 255] << 8 ^sbox[temp >>> 24] ^ (rcon[iNk] << 24);iNk++;} else if(Nk > 6 && (i % Nk === 4)) {// temp = SubWord(temp)temp =sbox[temp >>> 24] << 24 ^sbox[temp >>> 16 & 255] << 16 ^sbox[temp >>> 8 & 255] << 8 ^sbox[temp & 255];}w[i] = w[i - Nk] ^ temp;}/* When we are updating a cipher block we always use the code path forencryption whether we are decrypting or not (to shorten code andsimplify the generation of look up tables). However, because thereare differences in the decryption algorithm, other than just swappingin different look up tables, we must transform our key schedule toaccount for these changes:1. The decryption algorithm gets its key rounds in reverse order.2. The decryption algorithm adds the round key before mixing columnsinstead of afterwards.We don't need to modify our key schedule to handle the first case,we can just traverse the key schedule in reverse order when decrypting.The second case requires a little work.The tables we built for performing rounds will take an input and thenperform SubBytes() and MixColumns() or, for the decrypt version,InvSubBytes() and InvMixColumns(). But the decrypt algorithm requiresus to AddRoundKey() before InvMixColumns(). This means we'll need toapply some transformations to the round key to inverse-mix its columnsso they'll be correct for moving AddRoundKey() to after the state hashad its columns inverse-mixed.To inverse-mix the columns of the state when we're decrypting we use alookup table that will apply InvSubBytes() and InvMixColumns() at thesame time. However, the round key's bytes are not inverse-substitutedin the decryption algorithm. To get around this problem, we can firstsubstitute the bytes in the round key so that when we apply thetransformation via the InvSubBytes()+InvMixColumns() table, it willundo our substitution leaving us with the original value that wewant -- and then inverse-mix that value.This change will correctly alter our key schedule so that we can XOReach round key with our already transformed decryption state. Thisallows us to use the same code path as the encryption algorithm.We make one more change to the decryption key. Since the decryptionalgorithm runs in reverse from the encryption algorithm, we reversethe order of the round keys to avoid having to iterate over the keyschedule backwards when running the encryption algorithm later indecryption mode. In addition to reversing the order of the round keys,we also swap each round key's 2nd and 4th rows. See the commentssection where rounds are performed for more details about why this isdone. These changes are done inline with the other substitutiondescribed above.*/if(decrypt) {var tmp;var m0 = imix[0];var m1 = imix[1];var m2 = imix[2];var m3 = imix[3];var wnew = w.slice(0);end = w.length;for(var i = 0, wi = end - Nb; i < end; i += Nb, wi -= Nb) {// do not sub the first or last round key (round keys are Nb// words) as no column mixing is performed before they are added,// but do change the key orderif(i === 0 || i === (end - Nb)) {wnew[i] = w[wi];wnew[i + 1] = w[wi + 3];wnew[i + 2] = w[wi + 2];wnew[i + 3] = w[wi + 1];} else {// substitute each round key byte because the inverse-mix// table will inverse-substitute it (effectively cancel the// substitution because round key bytes aren't sub'd in// decryption mode) and swap indexes 3 and 1for(var n = 0; n < Nb; ++n) {tmp = w[wi + n];wnew[i + (3&-n)] =m0[sbox[tmp >>> 24]] ^m1[sbox[tmp >>> 16 & 255]] ^m2[sbox[tmp >>> 8 & 255]] ^m3[sbox[tmp & 255]];}}}w = wnew;}return w;}/*** Updates a single block (16 bytes) using AES. The update will either* encrypt or decrypt the block.** @param w the key schedule.* @param input the input block (an array of 32-bit words).* @param output the updated output block.* @param decrypt true to decrypt the block, false to encrypt it.*/function _updateBlock(w, input, output, decrypt) {/*Cipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)])beginbyte state[4,Nb]state = inAddRoundKey(state, w[0, Nb-1])for round = 1 step 1 to Nr-1SubBytes(state)ShiftRows(state)MixColumns(state)AddRoundKey(state, w[round*Nb, (round+1)*Nb-1])end forSubBytes(state)ShiftRows(state)AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])out = stateendInvCipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)])beginbyte state[4,Nb]state = inAddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])for round = Nr-1 step -1 downto 1InvShiftRows(state)InvSubBytes(state)AddRoundKey(state, w[round*Nb, (round+1)*Nb-1])InvMixColumns(state)end forInvShiftRows(state)InvSubBytes(state)AddRoundKey(state, w[0, Nb-1])out = stateend*/// Encrypt: AddRoundKey(state, w[0, Nb-1])// Decrypt: AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])var Nr = w.length / 4 - 1;var m0, m1, m2, m3, sub;if(decrypt) {m0 = imix[0];m1 = imix[1];m2 = imix[2];m3 = imix[3];sub = isbox;} else {m0 = mix[0];m1 = mix[1];m2 = mix[2];m3 = mix[3];sub = sbox;}var a, b, c, d, a2, b2, c2;a = input[0] ^ w[0];b = input[decrypt ? 3 : 1] ^ w[1];c = input[2] ^ w[2];d = input[decrypt ? 1 : 3] ^ w[3];var i = 3;/* In order to share code we follow the encryption algorithm when bothencrypting and decrypting. To account for the changes required in thedecryption algorithm, we use different lookup tables when decryptingand use a modified key schedule to account for the difference in theorder of transformations applied when performing rounds. We also getkey rounds in reverse order (relative to encryption). */for(var round = 1; round < Nr; ++round) {/* As described above, we'll be using table lookups to perform thecolumn mixing. Each column is stored as a word in the state (thearray 'input' has one column as a word at each index). In order tomix a column, we perform these transformations on each row in c,which is 1 byte in each word. The new column for c0 is c'0:m0      m1      m2      m3r0,c'0 = 2*r0,c0 + 3*r1,c0 + 1*r2,c0 + 1*r3,c0r1,c'0 = 1*r0,c0 + 2*r1,c0 + 3*r2,c0 + 1*r3,c0r2,c'0 = 1*r0,c0 + 1*r1,c0 + 2*r2,c0 + 3*r3,c0r3,c'0 = 3*r0,c0 + 1*r1,c0 + 1*r2,c0 + 2*r3,c0So using mix tables where c0 is a word with r0 being its upper8 bits and r3 being its lower 8 bits:m0[c0 >> 24] will yield this word: [2*r0,1*r0,1*r0,3*r0]...m3[c0 & 255] will yield this word: [1*r3,1*r3,3*r3,2*r3]Therefore to mix the columns in each word in the state wedo the following (& 255 omitted for brevity):c'0,r0 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]c'0,r1 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]c'0,r2 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]c'0,r3 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]However, before mixing, the algorithm requires us to performShiftRows(). The ShiftRows() transformation cyclically shifts thelast 3 rows of the state over different offsets. The first row(r = 0) is not shifted.s'_r,c = s_r,(c + shift(r, Nb) mod Nbfor 0 < r < 4 and 0 <= c < Nb andshift(1, 4) = 1shift(2, 4) = 2shift(3, 4) = 3.This causes the first byte in r = 1 to be moved to the end ofthe row, the first 2 bytes in r = 2 to be moved to the end ofthe row, the first 3 bytes in r = 3 to be moved to the end ofthe row:r1: [c0 c1 c2 c3] => [c1 c2 c3 c0]r2: [c0 c1 c2 c3]    [c2 c3 c0 c1]r3: [c0 c1 c2 c3]    [c3 c0 c1 c2]We can make these substitutions inline with our column mixing togenerate an updated set of equations to produce each word in thestate (note the columns have changed positions):c0 c1 c2 c3 => c0 c1 c2 c3c0 c1 c2 c3    c1 c2 c3 c0  (cycled 1 byte)c0 c1 c2 c3    c2 c3 c0 c1  (cycled 2 bytes)c0 c1 c2 c3    c3 c0 c1 c2  (cycled 3 bytes)Therefore:c'0 = 2*r0,c0 + 3*r1,c1 + 1*r2,c2 + 1*r3,c3c'0 = 1*r0,c0 + 2*r1,c1 + 3*r2,c2 + 1*r3,c3c'0 = 1*r0,c0 + 1*r1,c1 + 2*r2,c2 + 3*r3,c3c'0 = 3*r0,c0 + 1*r1,c1 + 1*r2,c2 + 2*r3,c3c'1 = 2*r0,c1 + 3*r1,c2 + 1*r2,c3 + 1*r3,c0c'1 = 1*r0,c1 + 2*r1,c2 + 3*r2,c3 + 1*r3,c0c'1 = 1*r0,c1 + 1*r1,c2 + 2*r2,c3 + 3*r3,c0c'1 = 3*r0,c1 + 1*r1,c2 + 1*r2,c3 + 2*r3,c0... and so forth for c'2 and c'3. The important distinction isthat the columns are cycling, with c0 being used with the m0map when calculating c0, but c1 being used with the m0 map whencalculating c1 ... and so forth.When performing the inverse we transform the mirror image andskip the bottom row, instead of the top one, and move upwards:c3 c2 c1 c0 => c0 c3 c2 c1  (cycled 3 bytes) *same as encryptionc3 c2 c1 c0    c1 c0 c3 c2  (cycled 2 bytes)c3 c2 c1 c0    c2 c1 c0 c3  (cycled 1 byte)  *same as encryptionc3 c2 c1 c0    c3 c2 c1 c0If you compare the r###lting matrices for ShiftRows()+MixColumns()and for InvShiftRows()+InvMixColumns() the 2nd and 4th columns aredifferent (in encrypt mode vs. decrypt mode). So in order to usethe same code to handle both encryption and decryption, we willneed to do some mapping.If in encryption mode we let a=c0, b=c1, c=c2, d=c3, and r<N> bea row number in the state, then the r###lting matrix in encryptionmode for applying the above transformations would be:r1: a b c dr2: b c d ar3: c d a br4: d a b cIf we did the same in decryption mode we would get:r1: a d c br2: b a d cr3: c b a dr4: d c b aIf instead we swap d and b (set b=c3 and d=c1), then we get:r1: a b c dr2: d a b cr3: c d a br4: b c d aNow the 1st and 3rd rows are the same as the encryption matrix. Allwe need to do then to make the mapping exactly the same is to swapthe 2nd and 4th rows when in decryption mode. To do this withouthaving to do it on each iteration, we swapped the 2nd and 4th rowsin the decryption key schedule. We also have to do the swap abovewhen we first pull in the input and when we set the final output. */a2 =m0[a >>> 24] ^m1[b >>> 16 & 255] ^m2[c >>> 8 & 255] ^m3[d & 255] ^ w[++i];b2 =m0[b >>> 24] ^m1[c >>> 16 & 255] ^m2[d >>> 8 & 255] ^m3[a & 255] ^ w[++i];c2 =m0[c >>> 24] ^m1[d >>> 16 & 255] ^m2[a >>> 8 & 255] ^m3[b & 255] ^ w[++i];d =m0[d >>> 24] ^m1[a >>> 16 & 255] ^m2[b >>> 8 & 255] ^m3[c & 255] ^ w[++i];a = a2;b = b2;c = c2;}/*Encrypt:SubBytes(state)ShiftRows(state)AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])Decrypt:InvShiftRows(state)InvSubBytes(state)AddRoundKey(state, w[0, Nb-1])*/// Note: rows are shifted inlineoutput[0] =(sub[a >>> 24] << 24) ^(sub[b >>> 16 & 255] << 16) ^(sub[c >>> 8 & 255] << 8) ^(sub[d & 255]) ^ w[++i];output[decrypt ? 3 : 1] =(sub[b >>> 24] << 24) ^(sub[c >>> 16 & 255] << 16) ^(sub[d >>> 8 & 255] << 8) ^(sub[a & 255]) ^ w[++i];output[2] =(sub[c >>> 24] << 24) ^(sub[d >>> 16 & 255] << 16) ^(sub[a >>> 8 & 255] << 8) ^(sub[b & 255]) ^ w[++i];output[decrypt ? 1 : 3] =(sub[d >>> 24] << 24) ^(sub[a >>> 16 & 255] << 16) ^(sub[b >>> 8 & 255] << 8) ^(sub[c & 255]) ^ w[++i];}/*** Deprecated. Instead, use:** forge.cipher.createCipher('AES-<mode>', key);* forge.cipher.createDecipher('AES-<mode>', key);** Creates a deprecated AES cipher object. This object's mode will default to* CBC (cipher-block-chaining).** The key and iv may be given as a string of bytes, an array of bytes, a* byte buffer, or an array of 32-bit words.** @param options the options to use.*          key the symmetric key to use.*          output the buffer to write to.*          decrypt true for decryption, false for encryption.*          mode the cipher mode to use (default: 'CBC').** @return the cipher.*/function _createCipher(options) {options = options || {};var mode = (options.mode || 'CBC').toUpperCase();var algorithm = 'AES-' + mode;var cipher;if(options.decrypt) {cipher = forge.cipher.createDecipher(algorithm, options.key);} else {cipher = forge.cipher.createCipher(algorithm, options.key);}// backwards compatible start APIvar start = cipher.start;cipher.start = function(iv, options) {// backwards compatibility: support second arg as output buffervar output = null;if(options instanceof forge.util.ByteBuffer) {output = options;options = {};}options = options || {};options.output = output;options.iv = iv;start.call(cipher, options);};return cipher;}/***/ }),/***/ 3444:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** A Javascript implementation of AES Cipher Suites for TLS.** @author Dave Longley** Copyright (c) 2009-2015 Digital Bazaar, Inc.**/var forge = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(4545);var tls = module.exports = forge.tls;/*** Supported cipher suites.*/tls.CipherSuites['TLS_RSA_WITH_AES_128_CBC_SHA'] = {id: [0x00, 0x2f],name: 'TLS_RSA_WITH_AES_128_CBC_SHA',initSecurityParameters: function(sp) {sp.bulk_cipher_algorithm = tls.BulkCipherAlgorithm.aes;sp.cipher_type = tls.CipherType.block;sp.enc_key_length = 16;sp.block_length = 16;sp.fixed_iv_length = 16;sp.record_iv_length = 16;sp.mac_algorithm = tls.MACAlgorithm.hmac_sha1;sp.mac_length = 20;sp.mac_key_length = 20;},initConnectionState: initConnectionState};tls.CipherSuites['TLS_RSA_WITH_AES_256_CBC_SHA'] = {id: [0x00, 0x35],name: 'TLS_RSA_WITH_AES_256_CBC_SHA',initSecurityParameters: function(sp) {sp.bulk_cipher_algorithm = tls.BulkCipherAlgorithm.aes;sp.cipher_type = tls.CipherType.block;sp.enc_key_length = 32;sp.block_length = 16;sp.fixed_iv_length = 16;sp.record_iv_length = 16;sp.mac_algorithm = tls.MACAlgorithm.hmac_sha1;sp.mac_length = 20;sp.mac_key_length = 20;},initConnectionState: initConnectionState};function initConnectionState(state, c, sp) {var client = (c.entity === forge.tls.ConnectionEnd.client);// cipher setupstate.read.cipherState = {init: false,cipher: forge.cipher.createDecipher('AES-CBC', client ?sp.keys.server_write_key : sp.keys.client_write_key),iv: client ? sp.keys.server_write_IV : sp.keys.client_write_IV};state.write.cipherState = {init: false,cipher: forge.cipher.createCipher('AES-CBC', client ?sp.keys.client_write_key : sp.keys.server_write_key),iv: client ? sp.keys.client_write_IV : sp.keys.server_write_IV};state.read.cipherFunction = decrypt_aes_cbc_sha1;state.write.cipherFunction = encrypt_aes_cbc_sha1;// MAC setupstate.read.macLength = state.write.macLength = sp.mac_length;state.read.macFunction = state.write.macFunction = tls.hmac_sha1;}/*** Encrypts the TLSCompressed record into a TLSCipherText record using AES* in CBC mode.** @param record the TLSCompressed record to encrypt.* @param s the ConnectionState to use.** @return true on success, false on failure.*/function encrypt_aes_cbc_sha1(record, s) {var rval = false;// append MAC to fragment, update sequence numbervar mac = s.macFunction(s.macKey, s.sequenceNumber, record);record.fragment.putBytes(mac);s.updateSequenceNumber();// TLS 1.1+ use an explicit IV every time to protect against CBC attacksvar iv;if(record.version.minor === tls.Versions.TLS_1_0.minor) {// use the pre-generated IV when initializing for TLS 1.0, otherwise use// the residue from the previous encryptioniv = s.cipherState.init ? null : s.cipherState.iv;} else {iv = forge.random.getBytesSync(16);}s.cipherState.init = true;// start ciphervar cipher = s.cipherState.cipher;cipher.start({iv: iv});// TLS 1.1+ write IV into outputif(record.version.minor >= tls.Versions.TLS_1_1.minor) {cipher.output.putBytes(iv);}// do encryption (default padding is appropriate)cipher.update(record.fragment);if(cipher.finish(encrypt_aes_cbc_sha1_padding)) {// set record fragment to encrypted outputrecord.fragment = cipher.output;record.length = record.fragment.length();rval = true;}return rval;}/*** Handles padding for aes_cbc_sha1 in encrypt mode.** @param blockSize the block size.* @param input the input buffer.* @param decrypt true in decrypt mode, false in encrypt mode.** @return true on success, false on failure.*/function encrypt_aes_cbc_sha1_padding(blockSize, input, decrypt) {/* The encrypted data length (TLSCiphertext.length) is one more than the sumof SecurityParameters.block_length, TLSCompressed.length,SecurityParameters.mac_length, and padding_length.The padding may be any length up to 255 bytes long, as long as it r###lts inthe TLSCiphertext.length being an integral multiple of the block length.Lengths longer than necessary might be desirable to frustrate attacks on aprotocol based on analysis of the lengths of exchanged messages. Each uint8in the padding data vector must be filled with the padding length value.The padding length should be such that the total size of theGenericBlockCipher structure is a multiple of the cipher's block length.Legal values range from zero to 255, inclusive. This length specifies thelength of the padding field exclusive of the padding_length field itself.This is slightly different from PKCS#7 because the padding value is 1less than the actual number of padding bytes if you include thepadding_length uint8 itself as a padding byte. */if(!decrypt) {// get the number of padding bytes required to reach the blockSize and// subtract 1 for the padding value (to make room for the padding_length// uint8)var padding = blockSize - (input.length() % blockSize);input.fillWithByte(padding - 1, padding);}return true;}/*** Handles padding for aes_cbc_sha1 in decrypt mode.** @param blockSize the block size.* @param output the output buffer.* @param decrypt true in decrypt mode, false in encrypt mode.** @return true on success, false on failure.*/function decrypt_aes_cbc_sha1_padding(blockSize, output, decrypt) {var rval = true;if(decrypt) {/* The last byte in the output specifies the number of padding bytes notincluding itself. Each of the padding bytes has the same value as thatlast byte (known as the padding_length). Here we check all paddingbytes to ensure they have the value of padding_length even if one ofthem is bad in order to ward-off timing attacks. */var len = output.length();var paddingLength = output.last();for(var i = len - 1 - paddingLength; i < len - 1; ++i) {rval = rval && (output.at(i) == paddingLength);}if(rval) {// trim off padding bytes and last padding length byteoutput.truncate(paddingLength + 1);}}return rval;}/*** Decrypts a TLSCipherText record into a TLSCompressed record using* AES in CBC mode.** @param record the TLSCipherText record to decrypt.* @param s the ConnectionState to use.** @return true on success, false on failure.*/function decrypt_aes_cbc_sha1(record, s) {var rval = false;var iv;if(record.version.minor === tls.Versions.TLS_1_0.minor) {// use pre-generated IV when initializing for TLS 1.0, otherwise use the// residue from the previous decryptioniv = s.cipherState.init ? null : s.cipherState.iv;} else {// TLS 1.1+ use an explicit IV every time to protect against CBC attacks// that is appended to the record fragmentiv = record.fragment.getBytes(16);}s.cipherState.init = true;// start ciphervar cipher = s.cipherState.cipher;cipher.start({iv: iv});// do decryptioncipher.update(record.fragment);rval = cipher.finish(decrypt_aes_cbc_sha1_padding);// even if decryption fails, keep going to minimize timing attacks// decrypted data:// first (len - 20) bytes = application data// last 20 bytes          = MACvar macLen = s.macLength;// create a random MAC to check against should the mac length check fail// Note: do this regardless of the failure to keep timing consistentvar mac = forge.random.getBytesSync(macLen);// get fragment and macvar len = cipher.output.length();if(len >= macLen) {record.fragment = cipher.output.getBytes(len - macLen);mac = cipher.output.getBytes(macLen);} else {// bad data, but get bytes anyway to try to keep timing consistentrecord.fragment = cipher.output.getBytes();}record.fragment = forge.util.createBuffer(record.fragment);record.length = record.fragment.length();// see if data integrity checks out, update sequence numbervar mac2 = s.macFunction(s.macKey, s.sequenceNumber, record);s.updateSequenceNumber();rval = compareMacs(s.macKey, mac, mac2) && rval;return rval;}/*** Safely compare two MACs. This function will compare two MACs in a way* that protects against timing attacks.** TODO: Expose elsewhere as a utility API.** See: https://www.nccgroup.trust/us/about-us/newsroom-and-events/blog/2011/february/double-hmac-verification/** @param key the MAC key to use.* @param mac1 as a binary-encoded string of bytes.* @param mac2 as a binary-encoded string of bytes.** @return true if the MACs are the same, false if not.*/function compareMacs(key, mac1, mac2) {var hmac = forge.hmac.create();hmac.start('SHA1', key);hmac.update(mac1);mac1 = hmac.digest().getBytes();hmac.start(null, null);hmac.update(mac2);mac2 = hmac.digest().getBytes();return mac1 === mac2;}/***/ }),/***/ 1598:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of Abstract Syntax Notation Number One.** @author Dave Longley** Copyright (c) 2010-2015 Digital Bazaar, Inc.** An API for storing data using the Abstract Syntax Notation Number One* format using DER (Distinguished Encoding Rules) encoding. This encoding is* commonly used to store data for PKI, i.e. X.509 Certificates, and this* implementation exists for that purpose.** Abstract Syntax Notation Number One (ASN.1) is used to define the abstract* syntax of information without restricting the way the information is encoded* for transmission. It provides a standard that allows for open systems* communication. ASN.1 defines the syntax of information data and a number of* simple data types as well as a notation for describing them and specifying* values for them.** The RSA algorithm creates public and private keys that are often stored in* X.509 or PKCS#X formats -- which use ASN.1 (encoded in DER format). This* class provides the most basic functionality required to store and load DSA* keys that are encoded according to ASN.1.** The most common binary encodings for ASN.1 are BER (Basic Encoding Rules)* and DER (Distinguished Encoding Rules). DER is just a subset of BER that* has stricter requirements for how data must be encoded.** Each ASN.1 structure has a tag (a byte identifying the ASN.1 structure type)* and a byte array for the value of this ASN1 structure which may be data or a* list of ASN.1 structures.** Each ASN.1 structure using BER is (Tag-Length-Value):** | byte 0 | bytes X | bytes Y |* |--------|---------|----------* |  tag   | length  |  value  |** ASN.1 allows for tags to be of "High-tag-number form" which allows a tag to* be two or more octets, but that is not supported by this class. A tag is* only 1 byte. Bits 1-5 give the tag number (ie the data type within a* particular 'class'), 6 indicates whether or not the ASN.1 value is* constructed from other ASN.1 values, and bits 7 and 8 give the 'class'. If* bits 7 and 8 are both zero, the class is UNIVERSAL. If only bit 7 is set,* then the class is APPLICATION. If only bit 8 is set, then the class is* CONTEXT_SPECIFIC. If both bits 7 and 8 are set, then the class is PRIVATE.* The tag numbers for the data types for the class UNIVERSAL are listed below:** UNIVERSAL 0 Reserved for use by the encoding rules* UNIVERSAL 1 Boolean type* UNIVERSAL 2 Integer type* UNIVERSAL 3 Bitstring type* UNIVERSAL 4 Octetstring type* UNIVERSAL 5 Null type* UNIVERSAL 6 Object identifier type* UNIVERSAL 7 Object descriptor type* UNIVERSAL 8 External type and Instance-of type* UNIVERSAL 9 Real type* UNIVERSAL 10 Enumerated type* UNIVERSAL 11 Embedded-pdv type* UNIVERSAL 12 UTF8String type* UNIVERSAL 13 Relative object identifier type* UNIVERSAL 14-15 Reserved for future editions* UNIVERSAL 16 Sequence and Sequence-of types* UNIVERSAL 17 Set and Set-of types* UNIVERSAL 18-22, 25-30 Character string types* UNIVERSAL 23-24 Time types** The length of an ASN.1 structure is specified after the tag identifier.* There is a definite form and an indefinite form. The indefinite form may* be used if the encoding is constructed and not all immediately available.* The indefinite form is encoded using a length byte with only the 8th bit* set. The end of the constructed object is marked using end-of-contents* octets (two zero bytes).** The definite form looks like this:** The length may take up 1 or more bytes, it depends on the length of the* value of the ASN.1 structure. DER encoding requires that if the ASN.1* structure has a value that has a length greater than 127, more than 1 byte* will be used to store its length, otherwise just one byte will be used.* This is strict.** In the case that the length of the ASN.1 value is less than 127, 1 octet* (byte) is used to store the "short form" length. The 8th bit has a value of* 0 indicating the length is "short form" and not "long form" and bits 7-1* give the length of the data. (The 8th bit is the left-most, most significant* bit: also known as big endian or network format).** In the case that the length of the ASN.1 value is greater than 127, 2 to* 127 octets (bytes) are used to store the "long form" length. The first* byte's 8th bit is set to 1 to indicate the length is "long form." Bits 7-1* give the number of additional octets. All following octets are in base 256* with the most significant digit first (typical big-endian binary unsigned* integer storage). So, for instance, if the length of a value was 257, the* first byte would be set to:** 10000010 = 130 = 0x82.** This indicates there are 2 octets (base 256) for the length. The second and* third bytes (the octets just mentioned) would store the length in base 256:** octet 2: 00000001 = 1 * 256^1 = 256* octet 3: 00000001 = 1 * 256^0 = 1* total = 257** The algorithm for converting a js integer value of 257 to base-256 is:** var value = 257;* var bytes = [];* bytes[0] = (value >>> 8) & 0xFF; // most significant byte first* bytes[1] = value & 0xFF;        // least significant byte last** On the ASN.1 UNIVERSAL Object Identifier (OID) type:** An OID can be written like: "value1.value2.value3...valueN"** The DER encoding rules:** The first byte has the value 40 * value1 + value2.* The following bytes, if any, encode the remaining values. Each value is* encoded in base 128, most significant digit first (big endian), with as* few digits as possible, and the most significant bit of each byte set* to 1 except the last in each value's encoding. For example: Given the* OID "1.2.840.113549", its DER encoding is (remember each byte except the* last one in each encoding is OR'd with 0x80):** byte 1: 40 * 1 + 2 = 42 = 0x2A.* bytes 2-3: 128 * 6 + 72 = 840 = 6 72 = 6 72 = 0x0648 = 0x8648* bytes 4-6: 16384 * 6 + 128 * 119 + 13 = 6 119 13 = 0x06770D = 0x86F70D** The final value is: 0x2A864886F70D.* The full OID (including ASN.1 tag and length of 6 bytes) is:* 0x06062A864886F70D*/var forge = __webpack_require__(7009);__webpack_require__(2365);__webpack_require__(1692);/* ASN.1 API */var asn1 = module.exports = forge.asn1 = forge.asn1 || {};/*** ASN.1 classes.*/asn1.Class = {UNIVERSAL:        0x00,APPLICATION:      0x40,CONTEXT_SPECIFIC: 0x80,PRIVATE:          0xC0};/*** ASN.1 types. Not all types are supported by this implementation, only* those necessary to implement a simple PKI are implemented.*/asn1.Type = {NONE:             0,BOOLEAN:          1,INTEGER:          2,BITSTRING:        3,OCTETSTRING:      4,NULL:             5,OID:              6,ODESC:            7,EXTERNAL:         8,REAL:             9,ENUMERATED:      10,EMBEDDED:        11,UTF8:            12,ROID:            13,SEQUENCE:        16,SET:             17,PRINTABLESTRING: 19,IA5STRING:       22,UTCTIME:         23,GENERALIZEDTIME: 24,BMPSTRING:       30};/*** Creates a new asn1 object.** @param tagClass the tag class for the object.* @param type the data type (tag number) for the object.* @param constructed true if the asn1 object is in constructed form.* @param value the value for the object, if it is not constructed.* @param [options] the options to use:*          [bitStringContents] the plain BIT STRING content including padding*            byte.** @return the asn1 object.*/asn1.create = function(tagClass, type, constructed, value, options) {/* An asn1 object has a tagClass, a type, a constructed flag, and avalue. The value's type depends on the constructed flag. Ifconstructed, it will contain a list of other asn1 objects. If not,it will contain the ASN.1 value as an array of bytes formattedaccording to the ASN.1 data type. */// remove undefined valuesif(forge.util.isArray(value)) {var tmp = [];for(var i = 0; i < value.length; ++i) {if(value[i] !== undefined) {tmp.push(value[i]);}}value = tmp;}var obj = {tagClass: tagClass,type: type,constructed: constructed,composed: constructed || forge.util.isArray(value),value: value};if(options && 'bitStringContents' in options) {// TODO: copy byte buffer if it's a buffer not a stringobj.bitStringContents = options.bitStringContents;// TODO: add readonly flag to avoid this overhead// save copy to detect changesobj.original = asn1.copy(obj);}return obj;};/*** Copies an asn1 object.** @param obj the asn1 object.* @param [options] copy options:*          [excludeBitStringContents] true to not copy bitStringContents** @return the a copy of the asn1 object.*/asn1.copy = function(obj, options) {var copy;if(forge.util.isArray(obj)) {copy = [];for(var i = 0; i < obj.length; ++i) {copy.push(asn1.copy(obj[i], options));}return copy;}if(typeof obj === 'string') {// TODO: copy byte buffer if it's a buffer not a stringreturn obj;}copy = {tagClass: obj.tagClass,type: obj.type,constructed: obj.constructed,composed: obj.composed,value: asn1.copy(obj.value, options)};if(options && !options.excludeBitStringContents) {// TODO: copy byte buffer if it's a buffer not a stringcopy.bitStringContents = obj.bitStringContents;}return copy;};/*** Compares asn1 objects for equality.** Note this function does not run in constant time.** @param obj1 the first asn1 object.* @param obj2 the second asn1 object.* @param [options] compare options:*          [includeBitStringContents] true to compare bitStringContents** @return true if the asn1 objects are equal.*/asn1.equals = function(obj1, obj2, options) {if(forge.util.isArray(obj1)) {if(!forge.util.isArray(obj2)) {return false;}if(obj1.length !== obj2.length) {return false;}for(var i = 0; i < obj1.length; ++i) {if(!asn1.equals(obj1[i], obj2[i])) {return false;}}return true;}if(typeof obj1 !== typeof obj2) {return false;}if(typeof obj1 === 'string') {return obj1 === obj2;}var equal = obj1.tagClass === obj2.tagClass &&obj1.type === obj2.type &&obj1.constructed === obj2.constructed &&obj1.composed === obj2.composed &&asn1.equals(obj1.value, obj2.value);if(options && options.includeBitStringContents) {equal = equal && (obj1.bitStringContents === obj2.bitStringContents);}return equal;};/*** Gets the length of a BER-encoded ASN.1 value.** In case the length is not specified, undefined is returned.** @param b the BER-encoded ASN.1 byte buffer, starting with the first*          length byte.** @return the length of the BER-encoded ASN.1 value or undefined.*/asn1.getBerValueLength = function(b) {// TODO: move this function and related DER/BER functions to a der.js// file; better abstract ASN.1 away from der/ber.var b2 = b.getByte();if(b2 === 0x80) {return undefined;}// see if the length is "short form" or "long form" (bit 8 set)var length;var longForm = b2 & 0x80;if(!longForm) {// length is just the first bytelength = b2;} else {// the number of bytes the length is specified in bits 7 through 1// and each length byte is in big-endian base-256length = b.getInt((b2 & 0x7F) << 3);}return length;};/*** Check if the byte buffer has enough bytes. Throws an Error if not.** @param bytes the byte buffer to parse from.* @param remaining the bytes remaining in the current parsing state.* @param n the number of bytes the buffer must have.*/function _checkBufferLength(bytes, remaining, n) {if(n > remaining) {var error = new Error('Too few bytes to parse DER.');error.available = bytes.length();error.remaining = remaining;error.requested = n;throw error;}}/*** Gets the length of a BER-encoded ASN.1 value.** In case the length is not specified, undefined is returned.** @param bytes the byte buffer to parse from.* @param remaining the bytes remaining in the current parsing state.** @return the length of the BER-encoded ASN.1 value or undefined.*/var _getValueLength = function(bytes, remaining) {// TODO: move this function and related DER/BER functions to a der.js// file; better abstract ASN.1 away from der/ber.// fromDer already checked that this byte existsvar b2 = bytes.getByte();remaining--;if(b2 === 0x80) {return undefined;}// see if the length is "short form" or "long form" (bit 8 set)var length;var longForm = b2 & 0x80;if(!longForm) {// length is just the first bytelength = b2;} else {// the number of bytes the length is specified in bits 7 through 1// and each length byte is in big-endian base-256var longFormBytes = b2 & 0x7F;_checkBufferLength(bytes, remaining, longFormBytes);length = bytes.getInt(longFormBytes << 3);}// FIXME: this will only happen for 32 bit getInt with high bit setif(length < 0) {throw new Error('Negative length: ' + length);}return length;};/*** Parses an asn1 object from a byte buffer in DER format.** @param bytes the byte buffer to parse from.* @param [strict] true to be strict when checking value lengths, false to*          allow truncated values (default: true).* @param [options] object with options or boolean strict flag*          [strict] true to be strict when checking value lengths, false to*            allow truncated values (default: true).*          [decodeBitStrings] true to attempt to decode the content of*            BIT STRINGs (not OCTET STRINGs) using strict mode. Note that*            without schema support to understand the data context this can*            erroneously decode values that happen to be valid ASN.1. This*            flag will be deprecated or removed as soon as schema support is*            available. (default: true)** @return the parsed asn1 object.*/asn1.fromDer = function(bytes, options) {if(options === undefined) {options = {strict: true,decodeBitStrings: true};}if(typeof options === 'boolean') {options = {strict: options,decodeBitStrings: true};}if(!('strict' in options)) {options.strict = true;}if(!('decodeBitStrings' in options)) {options.decodeBitStrings = true;}// wrap in buffer if neededif(typeof bytes === 'string') {bytes = forge.util.createBuffer(bytes);}return _fromDer(bytes, bytes.length(), 0, options);};/*** Internal function to parse an asn1 object from a byte buffer in DER format.** @param bytes the byte buffer to parse from.* @param remaining the number of bytes remaining for this chunk.* @param depth the current parsing depth.* @param options object with same options as fromDer().** @return the parsed asn1 object.*/function _fromDer(bytes, remaining, depth, options) {// temporary storage for consumption calculationsvar start;// minimum length for ASN.1 DER structure is 2_checkBufferLength(bytes, remaining, 2);// get the first bytevar b1 = bytes.getByte();// consumed one byteremaining--;// get the tag classvar tagClass = (b1 & 0xC0);// get the type (bits 1-5)var type = b1 & 0x1F;// get the variable value length and adjust remaining bytesstart = bytes.length();var length = _getValueLength(bytes, remaining);remaining -= start - bytes.length();// ensure there are enough bytes to get the valueif(length !== undefined && length > remaining) {if(options.strict) {var error = new Error('Too few bytes to read ASN.1 value.');error.available = bytes.length();error.remaining = remaining;error.requested = length;throw error;}// Note: be lenient with truncated values and use remaining state byteslength = remaining;}// value storagevar value;// possible BIT STRING contents storagevar bitStringContents;// constructed flag is bit 6 (32 = 0x20) of the first bytevar constructed = ((b1 & 0x20) === 0x20);if(constructed) {// parse child asn1 objects from the valuevalue = [];if(length === undefined) {// asn1 object of indefinite length, read until end tagfor(;;) {_checkBufferLength(bytes, remaining, 2);if(bytes.bytes(2) === String.fromCharCode(0, 0)) {bytes.getBytes(2);remaining -= 2;break;}start = bytes.length();value.push(_fromDer(bytes, remaining, depth + 1, options));remaining -= start - bytes.length();}} else {// parsing asn1 object of definite lengthwhile(length > 0) {start = bytes.length();value.push(_fromDer(bytes, length, depth + 1, options));remaining -= start - bytes.length();length -= start - bytes.length();}}}// if a BIT STRING, save the contents including paddingif(value === undefined && tagClass === asn1.Class.UNIVERSAL &&type === asn1.Type.BITSTRING) {bitStringContents = bytes.bytes(length);}// determine if a non-constructed value should be decoded as a composed// value that contains other ASN.1 objects. BIT STRINGs (and OCTET STRINGs)// can be used this way.if(value === undefined && options.decodeBitStrings &&tagClass === asn1.Class.UNIVERSAL &&// FIXME: OCTET STRINGs not yet supported here// .. other parts of forge expect to decode OCTET STRINGs manually(type === asn1.Type.BITSTRING /*|| type === asn1.Type.OCTETSTRING*/) &&length > 1) {// save read positionvar savedRead = bytes.read;var savedRemaining = remaining;var unused = 0;if(type === asn1.Type.BITSTRING) {/* The first octet gives the number of bits by which the length of thebit string is less than the next multiple of eight (this is calledthe "number of unused bits").The second and following octets give the value of the bit stringconverted to an octet string. */_checkBufferLength(bytes, remaining, 1);unused = bytes.getByte();remaining--;}// if all bits are used, maybe the BIT/OCTET STRING holds ASN.1 objsif(unused === 0) {try {// attempt to parse child asn1 object from the value// (stored in array to signal composed value)start = bytes.length();var subOptions = {// enforce strict mode to avoid parsing ASN.1 from plain dataverbose: options.verbose,strict: true,decodeBitStrings: true};var composed = _fromDer(bytes, remaining, depth + 1, subOptions);var used = start - bytes.length();remaining -= used;if(type == asn1.Type.BITSTRING) {used++;}// if the data all decoded and the class indicates UNIVERSAL or// CONTEXT_SPECIFIC then assume we've got an encapsulated ASN.1 objectvar tc = composed.tagClass;if(used === length &&(tc === asn1.Class.UNIVERSAL || tc === asn1.Class.CONTEXT_SPECIFIC)) {value = [composed];}} catch(ex) {}}if(value === undefined) {// restore read positionbytes.read = savedRead;remaining = savedRemaining;}}if(value === undefined) {// asn1 not constructed or composed, get raw value// TODO: do DER to OID conversion and vice-versa in .toDer?if(length === undefined) {if(options.strict) {throw new Error('Non-constructed ASN.1 object of indefinite length.');}// be lenient and use remaining state byteslength = remaining;}if(type === asn1.Type.BMPSTRING) {value = '';for(; length > 0; length -= 2) {_checkBufferLength(bytes, remaining, 2);value += String.fromCharCode(bytes.getInt16());remaining -= 2;}} else {value = bytes.getBytes(length);}}// add BIT STRING contents if availablevar asn1Options = bitStringContents === undefined ? null : {bitStringContents: bitStringContents};// create and return asn1 objectreturn asn1.create(tagClass, type, constructed, value, asn1Options);}/*** Converts the given asn1 object to a buffer of bytes in DER format.** @param asn1 the asn1 object to convert to bytes.** @return the buffer of bytes.*/asn1.toDer = function(obj) {var bytes = forge.util.createBuffer();// build the first bytevar b1 = obj.tagClass | obj.type;// for storing the ASN.1 valuevar value = forge.util.createBuffer();// use BIT STRING contents if available and data not changedvar useBitStringContents = false;if('bitStringContents' in obj) {useBitStringContents = true;if(obj.original) {useBitStringContents = asn1.equals(obj, obj.original);}}if(useBitStringContents) {value.putBytes(obj.bitStringContents);} else if(obj.composed) {// if composed, use each child asn1 object's DER bytes as value// turn on 6th bit (0x20 = 32) to indicate asn1 is constructed// from other asn1 objectsif(obj.constructed) {b1 |= 0x20;} else {// type is a bit string, add unused bits of 0x00value.putByte(0x00);}// add all of the child DER bytes togetherfor(var i = 0; i < obj.value.length; ++i) {if(obj.value[i] !== undefined) {value.putBuffer(asn1.toDer(obj.value[i]));}}} else {// use asn1.value directlyif(obj.type === asn1.Type.BMPSTRING) {for(var i = 0; i < obj.value.length; ++i) {value.putInt16(obj.value.charCodeAt(i));}} else {// ensure integer is minimally-encoded// TODO: should all leading bytes be stripped vs just one?// .. ex '00 00 01' => '01'?if(obj.type === asn1.Type.INTEGER &&obj.value.length > 1 &&// leading 0x00 for positive integer((obj.value.charCodeAt(0) === 0 &&(obj.value.charCodeAt(1) & 0x80) === 0) ||// leading 0xFF for negative integer(obj.value.charCodeAt(0) === 0xFF &&(obj.value.charCodeAt(1) & 0x80) === 0x80))) {value.putBytes(obj.value.substr(1));} else {value.putBytes(obj.value);}}}// add tag bytebytes.putByte(b1);// use "short form" encodingif(value.length() <= 127) {// one byte describes the length// bit 8 = 0 and bits 7-1 = lengthbytes.putByte(value.length() & 0x7F);} else {// use "long form" encoding// 2 to 127 bytes describe the length// first byte: bit 8 = 1 and bits 7-1 = # of additional bytes// other bytes: length in base 256, big-endianvar len = value.length();var lenBytes = '';do {lenBytes += String.fromCharCode(len & 0xFF);len = len >>> 8;} while(len > 0);// set first byte to # bytes used to store the length and turn on// bit 8 to indicate long-form length is usedbytes.putByte(lenBytes.length | 0x80);// concatenate length bytes in reverse since they were generated// little endian and we need big endianfor(var i = lenBytes.length - 1; i >= 0; --i) {bytes.putByte(lenBytes.charCodeAt(i));}}// concatenate value bytesbytes.putBuffer(value);return bytes;};/*** Converts an OID dot-separated string to a byte buffer. The byte buffer* contains only the DER-encoded value, not any tag or length bytes.** @param oid the OID dot-separated string.** @return the byte buffer.*/asn1.oidToDer = function(oid) {// split OID into individual valuesvar values = oid.split('.');var bytes = forge.util.createBuffer();// first byte is 40 * value1 + value2bytes.putByte(40 * parseInt(values[0], 10) + parseInt(values[1], 10));// other bytes are each value in base 128 with 8th bit set except for// the last byte for each valuevar last, valueBytes, value, b;for(var i = 2; i < values.length; ++i) {// produce value bytes in reverse because we don't know how many// bytes it will take to store the valuelast = true;valueBytes = [];value = parseInt(values[i], 10);do {b = value & 0x7F;value = value >>> 7;// if value is not last, then turn on 8th bitif(!last) {b |= 0x80;}valueBytes.push(b);last = false;} while(value > 0);// add value bytes in reverse (needs to be in big endian)for(var n = valueBytes.length - 1; n >= 0; --n) {bytes.putByte(valueBytes[n]);}}return bytes;};/*** Converts a DER-encoded byte buffer to an OID dot-separated string. The* byte buffer should contain only the DER-encoded value, not any tag or* length bytes.** @param bytes the byte buffer.** @return the OID dot-separated string.*/asn1.derToOid = function(bytes) {var oid;// wrap in buffer if neededif(typeof bytes === 'string') {bytes = forge.util.createBuffer(bytes);}// first byte is 40 * value1 + value2var b = bytes.getByte();oid = Math.floor(b / 40) + '.' + (b % 40);// other bytes are each value in base 128 with 8th bit set except for// the last byte for each valuevar value = 0;while(bytes.length() > 0) {b = bytes.getByte();value = value << 7;// not the last byte for the valueif(b & 0x80) {value += b & 0x7F;} else {// last byteoid += '.' + (value + b);value = 0;}}return oid;};/*** Converts a UTCTime value to a date.** Note: GeneralizedTime has 4 digits for the year and is used for X.509* dates past 2049. Parsing that structure hasn't been implemented yet.** @param utc the UTCTime value to convert.** @return the date.*/asn1.utcTimeToDate = function(utc) {/* The following formats can be used:YYMMDDhhmmZYYMMDDhhmm+hh'mm'YYMMDDhhmm-hh'mm'YYMMDDhhmmssZYYMMDDhhmmss+hh'mm'YYMMDDhhmmss-hh'mm'Where:YY is the least significant two digits of the yearMM is the month (01 to 12)DD is the day (01 to 31)hh is the hour (00 to 23)mm are the minutes (00 to 59)ss are the seconds (00 to 59)Z indicates that local time is GMT, + indicates that local time islater than GMT, and - indicates that local time is earlier than GMThh' is the absolute value of the offset from GMT in hoursmm' is the absolute value of the offset from GMT in minutes */var date = new Date();// if YY >= 50 use 19xx, if YY < 50 use 20xxvar year = parseInt(utc.substr(0, 2), 10);year = (year >= 50) ? 1900 + year : 2000 + year;var MM = parseInt(utc.substr(2, 2), 10) - 1; // use 0-11 for monthvar DD = parseInt(utc.substr(4, 2), 10);var hh = parseInt(utc.substr(6, 2), 10);var mm = parseInt(utc.substr(8, 2), 10);var ss = 0;// not just YYMMDDhhmmZif(utc.length > 11) {// get character after minutesvar c = utc.charAt(10);var end = 10;// see if seconds are presentif(c !== '+' && c !== '-') {// get secondsss = parseInt(utc.substr(10, 2), 10);end += 2;}}// update datedate.setUTCFullYear(year, MM, DD);date.setUTCHours(hh, mm, ss, 0);if(end) {// get +/- after end of timec = utc.charAt(end);if(c === '+' || c === '-') {// get hours+minutes offsetvar hhoffset = parseInt(utc.substr(end + 1, 2), 10);var mmoffset = parseInt(utc.substr(end + 4, 2), 10);// calculate offset in millisecondsvar offset = hhoffset * 60 + mmoffset;offset *= 60000;// apply offsetif(c === '+') {date.setTime(+date - offset);} else {date.setTime(+date + offset);}}}return date;};/*** Converts a GeneralizedTime value to a date.** @param gentime the GeneralizedTime value to convert.** @return the date.*/asn1.generalizedTimeToDate = function(gentime) {/* The following formats can be used:YYYYMMDDHHMMSSYYYYMMDDHHMMSS.fffYYYYMMDDHHMMSSZYYYYMMDDHHMMSS.fffZYYYYMMDDHHMMSS+hh'mm'YYYYMMDDHHMMSS.fff+hh'mm'YYYYMMDDHHMMSS-hh'mm'YYYYMMDDHHMMSS.fff-hh'mm'Where:YYYY is the yearMM is the month (01 to 12)DD is the day (01 to 31)hh is the hour (00 to 23)mm are the minutes (00 to 59)ss are the seconds (00 to 59).fff is the second fraction, accurate to three decimal placesZ indicates that local time is GMT, + indicates that local time islater than GMT, and - indicates that local time is earlier than GMThh' is the absolute value of the offset from GMT in hoursmm' is the absolute value of the offset from GMT in minutes */var date = new Date();var YYYY = parseInt(gentime.substr(0, 4), 10);var MM = parseInt(gentime.substr(4, 2), 10) - 1; // use 0-11 for monthvar DD = parseInt(gentime.substr(6, 2), 10);var hh = parseInt(gentime.substr(8, 2), 10);var mm = parseInt(gentime.substr(10, 2), 10);var ss = parseInt(gentime.substr(12, 2), 10);var fff = 0;var offset = 0;var isUTC = false;if(gentime.charAt(gentime.length - 1) === 'Z') {isUTC = true;}var end = gentime.length - 5, c = gentime.charAt(end);if(c === '+' || c === '-') {// get hours+minutes offsetvar hhoffset = parseInt(gentime.substr(end + 1, 2), 10);var mmoffset = parseInt(gentime.substr(end + 4, 2), 10);// calculate offset in millisecondsoffset = hhoffset * 60 + mmoffset;offset *= 60000;// apply offsetif(c === '+') {offset *= -1;}isUTC = true;}// check for second fractionif(gentime.charAt(14) === '.') {fff = parseFloat(gentime.substr(14), 10) * 1000;}if(isUTC) {date.setUTCFullYear(YYYY, MM, DD);date.setUTCHours(hh, mm, ss, fff);// apply offsetdate.setTime(+date + offset);} else {date.setFullYear(YYYY, MM, DD);date.setHours(hh, mm, ss, fff);}return date;};/*** Converts a date to a UTCTime value.** Note: GeneralizedTime has 4 digits for the year and is used for X.509* dates past 2049. Converting to a GeneralizedTime hasn't been* implemented yet.** @param date the date to convert.** @return the UTCTime value.*/asn1.dateToUtcTime = function(date) {// TODO: validate; currently assumes proper formatif(typeof date === 'string') {return date;}var rval = '';// create format YYMMDDhhmmssZvar format = [];format.push(('' + date.getUTCFullYear()).substr(2));format.push('' + (date.getUTCMonth() + 1));format.push('' + date.getUTCDate());format.push('' + date.getUTCHours());format.push('' + date.getUTCMinutes());format.push('' + date.getUTCSeconds());// ensure 2 digits are used for each format entryfor(var i = 0; i < format.length; ++i) {if(format[i].length < 2) {rval += '0';}rval += format[i];}rval += 'Z';return rval;};/*** Converts a date to a GeneralizedTime value.** @param date the date to convert.** @return the GeneralizedTime value as a string.*/asn1.dateToGeneralizedTime = function(date) {// TODO: validate; currently assumes proper formatif(typeof date === 'string') {return date;}var rval = '';// create format YYYYMMDDHHMMSSZvar format = [];format.push('' + date.getUTCFullYear());format.push('' + (date.getUTCMonth() + 1));format.push('' + date.getUTCDate());format.push('' + date.getUTCHours());format.push('' + date.getUTCMinutes());format.push('' + date.getUTCSeconds());// ensure 2 digits are used for each format entryfor(var i = 0; i < format.length; ++i) {if(format[i].length < 2) {rval += '0';}rval += format[i];}rval += 'Z';return rval;};/*** Converts a javascript integer to a DER-encoded byte buffer to be used* as the value for an INTEGER type.** @param x the integer.** @return the byte buffer.*/asn1.integerToDer = function(x) {var rval = forge.util.createBuffer();if(x >= -0x80 && x < 0x80) {return rval.putSignedInt(x, 8);}if(x >= -0x8000 && x < 0x8000) {return rval.putSignedInt(x, 16);}if(x >= -0x800000 && x < 0x800000) {return rval.putSignedInt(x, 24);}if(x >= -0x80000000 && x < 0x80000000) {return rval.putSignedInt(x, 32);}var error = new Error('Integer too large; max is 32-bits.');error.integer = x;throw error;};/*** Converts a DER-encoded byte buffer to a javascript integer. This is* typically used to decode the value of an INTEGER type.** @param bytes the byte buffer.** @return the integer.*/asn1.derToInteger = function(bytes) {// wrap in buffer if neededif(typeof bytes === 'string') {bytes = forge.util.createBuffer(bytes);}var n = bytes.length() * 8;if(n > 32) {throw new Error('Integer too large; max is 32-bits.');}return bytes.getSignedInt(n);};/*** Validates that the given ASN.1 object is at least a super set of the* given ASN.1 structure. Only tag classes and types are checked. An* optional map may also be provided to capture ASN.1 values while the* structure is checked.** To capture an ASN.1 value, set an object in the validator's 'capture'* parameter to the key to use in the capture map. To capture the full* ASN.1 object, specify 'captureAsn1'. To capture BIT STRING bytes, including* the leading unused bits counter byte, specify 'captureBitStringContents'.* To capture BIT STRING bytes, without the leading unused bits counter byte,* specify 'captureBitStringValue'.** Objects in the validator may set a field 'optional' to true to indicate* that it isn't necessary to pass validation.** @param obj the ASN.1 object to validate.* @param v the ASN.1 structure validator.* @param capture an optional map to capture values in.* @param errors an optional array for storing validation errors.** @return true on success, false on failure.*/asn1.validate = function(obj, v, capture, errors) {var rval = false;// ensure tag class and type are the same if specifiedif((obj.tagClass === v.tagClass || typeof(v.tagClass) === 'undefined') &&(obj.type === v.type || typeof(v.type) === 'undefined')) {// ensure constructed flag is the same if specifiedif(obj.constructed === v.constructed ||typeof(v.constructed) === 'undefined') {rval = true;// handle sub valuesif(v.value && forge.util.isArray(v.value)) {var j = 0;for(var i = 0; rval && i < v.value.length; ++i) {rval = v.value[i].optional || false;if(obj.value[j]) {rval = asn1.validate(obj.value[j], v.value[i], capture, errors);if(rval) {++j;} else if(v.value[i].optional) {rval = true;}}if(!rval && errors) {errors.push('[' + v.name + '] ' +'Tag class "' + v.tagClass + '", type "' +v.type + '" expected value length "' +v.value.length + '", got "' +obj.value.length + '"');}}}if(rval && capture) {if(v.capture) {capture[v.capture] = obj.value;}if(v.captureAsn1) {capture[v.captureAsn1] = obj;}if(v.captureBitStringContents && 'bitStringContents' in obj) {capture[v.captureBitStringContents] = obj.bitStringContents;}if(v.captureBitStringValue && 'bitStringContents' in obj) {var value;if(obj.bitStringContents.length < 2) {capture[v.captureBitStringValue] = '';} else {// FIXME: support unused bits with data shiftingvar unused = obj.bitStringContents.charCodeAt(0);if(unused !== 0) {throw new Error('captureBitStringValue only supported for zero unused bits');}capture[v.captureBitStringValue] = obj.bitStringContents.slice(1);}}}} else if(errors) {errors.push('[' + v.name + '] ' +'Expected constructed "' + v.constructed + '", got "' +obj.constructed + '"');}} else if(errors) {if(obj.tagClass !== v.tagClass) {errors.push('[' + v.name + '] ' +'Expected tag class "' + v.tagClass + '", got "' +obj.tagClass + '"');}if(obj.type !== v.type) {errors.push('[' + v.name + '] ' +'Expected type "' + v.type + '", got "' + obj.type + '"');}}return rval;};// regex for testing for non-latin charactersvar _nonLatinRegex = /[^\\u0000-\\u00ff]/;/*** Pretty prints an ASN.1 object to a string.** @param obj the object to write out.* @param level the level in the tree.* @param indentation the indentation to use.** @return the string.*/asn1.prettyPrint = function(obj, level, indentation) {var rval = '';// set default level and indentationlevel = level || 0;indentation = indentation || 2;// start new line for deep levelsif(level > 0) {rval += '\n';}// create indentvar indent = '';for(var i = 0; i < level * indentation; ++i) {indent += ' ';}// print class:typerval += indent + 'Tag: ';switch(obj.tagClass) {case asn1.Class.UNIVERSAL:rval += 'Universal:';break;case asn1.Class.APPLICATION:rval += 'Application:';break;case asn1.Class.CONTEXT_SPECIFIC:rval += 'Context-Specific:';break;case asn1.Class.PRIVATE:rval += 'Private:';break;}if(obj.tagClass === asn1.Class.UNIVERSAL) {rval += obj.type;// known typesswitch(obj.type) {case asn1.Type.NONE:rval += ' (None)';break;case asn1.Type.BOOLEAN:rval += ' (Boolean)';break;case asn1.Type.INTEGER:rval += ' (Integer)';break;case asn1.Type.BITSTRING:rval += ' (Bit string)';break;case asn1.Type.OCTETSTRING:rval += ' (Octet string)';break;case asn1.Type.NULL:rval += ' (Null)';break;case asn1.Type.OID:rval += ' (Object Identifier)';break;case asn1.Type.ODESC:rval += ' (Object Descriptor)';break;case asn1.Type.EXTERNAL:rval += ' (External or Instance of)';break;case asn1.Type.REAL:rval += ' (Real)';break;case asn1.Type.ENUMERATED:rval += ' (Enumerated)';break;case asn1.Type.EMBEDDED:rval += ' (Embedded PDV)';break;case asn1.Type.UTF8:rval += ' (UTF8)';break;case asn1.Type.ROID:rval += ' (Relative Object Identifier)';break;case asn1.Type.SEQUENCE:rval += ' (Sequence)';break;case asn1.Type.SET:rval += ' (Set)';break;case asn1.Type.PRINTABLESTRING:rval += ' (Printable String)';break;case asn1.Type.IA5String:rval += ' (IA5String (ASCII))';break;case asn1.Type.UTCTIME:rval += ' (UTC time)';break;case asn1.Type.GENERALIZEDTIME:rval += ' (Generalized time)';break;case asn1.Type.BMPSTRING:rval += ' (BMP String)';break;}} else {rval += obj.type;}rval += '\n';rval += indent + 'Constructed: ' + obj.constructed + '\n';if(obj.composed) {var subvalues = 0;var sub = '';for(var i = 0; i < obj.value.length; ++i) {if(obj.value[i] !== undefined) {subvalues += 1;sub += asn1.prettyPrint(obj.value[i], level + 1, indentation);if((i + 1) < obj.value.length) {sub += ',';}}}rval += indent + 'Sub values: ' + subvalues + sub;} else {rval += indent + 'Value: ';if(obj.type === asn1.Type.OID) {var oid = asn1.derToOid(obj.value);rval += oid;if(forge.pki && forge.pki.oids) {if(oid in forge.pki.oids) {rval += ' (' + forge.pki.oids[oid] + ') ';}}}if(obj.type === asn1.Type.INTEGER) {try {rval += asn1.derToInteger(obj.value);} catch(ex) {rval += '0x' + forge.util.bytesToHex(obj.value);}} else if(obj.type === asn1.Type.BITSTRING) {// TODO: shift bits as needed to display without paddingif(obj.value.length > 1) {// remove unused bits fieldrval += '0x' + forge.util.bytesToHex(obj.value.slice(1));} else {rval += '(none)';}// show unused bit countif(obj.value.length > 0) {var unused = obj.value.charCodeAt(0);if(unused == 1) {rval += ' (1 unused bit shown)';} else if(unused > 1) {rval += ' (' + unused + ' unused bits shown)';}}} else if(obj.type === asn1.Type.OCTETSTRING) {if(!_nonLatinRegex.test(obj.value)) {rval += '(' + obj.value + ') ';}rval += '0x' + forge.util.bytesToHex(obj.value);} else if(obj.type === asn1.Type.UTF8) {rval += forge.util.decodeUtf8(obj.value);} else if(obj.type === asn1.Type.PRINTABLESTRING ||obj.type === asn1.Type.IA5String) {rval += obj.value;} else if(_nonLatinRegex.test(obj.value)) {rval += '0x' + forge.util.bytesToHex(obj.value);} else if(obj.value.length === 0) {rval += '[null]';} else {rval += obj.value;}}return rval;};/***/ }),/***/ 5596:/***/ ((module) => {/*** Base-N/Base-X encoding/decoding functions.** Original implementation from base-x:* https://github.com/cryptocoinjs/base-x** Which is MIT licensed:** The MIT License (MIT)** Copyright base-x contributors (c) 2016** 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.*/var api = {};module.exports = api;// baseN alphabet indexesvar _reverseAlphabets = {};/*** BaseN-encodes a Uint8Array using the given alphabet.** @param input the Uint8Array to encode.* @param maxline the maximum number of encoded characters per line to use,*          defaults to none.** @return the baseN-encoded output string.*/api.encode = function(input, alphabet, maxline) {if(typeof alphabet !== 'string') {throw new TypeError('"alphabet" must be a string.');}if(maxline !== undefined && typeof maxline !== 'number') {throw new TypeError('"maxline" must be a number.');}var output = '';if(!(input instanceof Uint8Array)) {// assume forge byte bufferoutput = _encodeWithByteBuffer(input, alphabet);} else {var i = 0;var base = alphabet.length;var first = alphabet.charAt(0);var digits = [0];for(i = 0; i < input.length; ++i) {for(var j = 0, carry = input[i]; j < digits.length; ++j) {carry += digits[j] << 8;digits[j] = carry % base;carry = (carry / base) | 0;}while(carry > 0) {digits.push(carry % base);carry = (carry / base) | 0;}}// deal with leading zerosfor(i = 0; input[i] === 0 && i < input.length - 1; ++i) {output += first;}// convert digits to a stringfor(i = digits.length - 1; i >= 0; --i) {output += alphabet[digits[i]];}}if(maxline) {var regex = new RegExp('.{1,' + maxline + '}', 'g');output = output.match(regex).join('\r\n');}return output;};/*** Decodes a baseN-encoded (using the given alphabet) string to a* Uint8Array.** @param input the baseN-encoded input string.** @return the Uint8Array.*/api.decode = function(input, alphabet) {if(typeof input !== 'string') {throw new TypeError('"input" must be a string.');}if(typeof alphabet !== 'string') {throw new TypeError('"alphabet" must be a string.');}var table = _reverseAlphabets[alphabet];if(!table) {// compute reverse alphabettable = _reverseAlphabets[alphabet] = [];for(var i = 0; i < alphabet.length; ++i) {table[alphabet.charCodeAt(i)] = i;}}// remove whitespace charactersinput = input.replace(/\s/g, '');var base = alphabet.length;var first = alphabet.charAt(0);var bytes = [0];for(var i = 0; i < input.length; i++) {var value = table[input.charCodeAt(i)];if(value === undefined) {return;}for(var j = 0, carry = value; j < bytes.length; ++j) {carry += bytes[j] * base;bytes[j] = carry & 0xff;carry >>= 8;}while(carry > 0) {bytes.push(carry & 0xff);carry >>= 8;}}// deal with leading zerosfor(var k = 0; input[k] === first && k < input.length - 1; ++k) {bytes.push(0);}if(typeof Buffer !== 'undefined') {return Buffer.from(bytes.reverse());}return new Uint8Array(bytes.reverse());};function _encodeWithByteBuffer(input, alphabet) {var i = 0;var base = alphabet.length;var first = alphabet.charAt(0);var digits = [0];for(i = 0; i < input.length(); ++i) {for(var j = 0, carry = input.at(i); j < digits.length; ++j) {carry += digits[j] << 8;digits[j] = carry % base;carry = (carry / base) | 0;}while(carry > 0) {digits.push(carry % base);carry = (carry / base) | 0;}}var output = '';// deal with leading zerosfor(i = 0; input.at(i) === 0 && i < input.length() - 1; ++i) {output += first;}// convert digits to a stringfor(i = digits.length - 1; i >= 0; --i) {output += alphabet[digits[i]];}return output;}/***/ }),/***/ 9671:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Cipher base API.** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);module.exports = forge.cipher = forge.cipher || {};// registered algorithmsforge.cipher.algorithms = forge.cipher.algorithms || {};/*** Creates a cipher object that can be used to encrypt data using the given* algorithm and key. The algorithm may be provided as a string value for a* previously registered algorithm or it may be given as a cipher algorithm* API object.** @param algorithm the algorithm to use, either a string or an algorithm API*          object.* @param key the key to use, as a binary-encoded string of bytes or a*          byte buffer.** @return the cipher.*/forge.cipher.createCipher = function(algorithm, key) {var api = algorithm;if(typeof api === 'string') {api = forge.cipher.getAlgorithm(api);if(api) {api = api();}}if(!api) {throw new Error('Unsupported algorithm: ' + algorithm);}// assume block cipherreturn new forge.cipher.BlockCipher({algorithm: api,key: key,decrypt: false});};/*** Creates a decipher object that can be used to decrypt data using the given* algorithm and key. The algorithm may be provided as a string value for a* previously registered algorithm or it may be given as a cipher algorithm* API object.** @param algorithm the algorithm to use, either a string or an algorithm API*          object.* @param key the key to use, as a binary-encoded string of bytes or a*          byte buffer.** @return the cipher.*/forge.cipher.createDecipher = function(algorithm, key) {var api = algorithm;if(typeof api === 'string') {api = forge.cipher.getAlgorithm(api);if(api) {api = api();}}if(!api) {throw new Error('Unsupported algorithm: ' + algorithm);}// assume block cipherreturn new forge.cipher.BlockCipher({algorithm: api,key: key,decrypt: true});};/*** Registers an algorithm by name. If the name was already registered, the* algorithm API object will be overwritten.** @param name the name of the algorithm.* @param algorithm the algorithm API object.*/forge.cipher.registerAlgorithm = function(name, algorithm) {name = name.toUpperCase();forge.cipher.algorithms[name] = algorithm;};/*** Gets a registered algorithm by name.** @param name the name of the algorithm.** @return the algorithm, if found, null if not.*/forge.cipher.getAlgorithm = function(name) {name = name.toUpperCase();if(name in forge.cipher.algorithms) {return forge.cipher.algorithms[name];}return null;};var BlockCipher = forge.cipher.BlockCipher = function(options) {this.algorithm = options.algorithm;this.mode = this.algorithm.mode;this.blockSize = this.mode.blockSize;this._finish = false;this._input = null;this.output = null;this._op = options.decrypt ? this.mode.decrypt : this.mode.encrypt;this._decrypt = options.decrypt;this.algorithm.initialize(options);};/*** Starts or restarts the encryption or decryption process, whichever* was previously configured.** For non-GCM mode, the IV may be a binary-encoded string of bytes, an array* of bytes, a byte buffer, or an array of 32-bit integers. If the IV is in* bytes, then it must be Nb (16) bytes in length. If the IV is given in as* 32-bit integers, then it must be 4 integers long.** Note: an IV is not required or used in ECB mode.** For GCM-mode, the IV must be given as a binary-encoded string of bytes or* a byte buffer. The number of bytes should be 12 (96 bits) as recommended* by NIST SP-800-38D but another length may be given.** @param options the options to use:*          iv the initialization vector to use as a binary-encoded string of*            bytes, null to reuse the last ciphered block from a previous*            update() (this "residue" method is for legacy support only).*          additionalData additional authentication data as a binary-encoded*            string of bytes, for 'GCM' mode, (default: none).*          tagLength desired length of authentication tag, in bits, for*            'GCM' mode (0-128, default: 128).*          tag the authentication tag to check if decrypting, as a*             binary-encoded string of bytes.*          output the output the buffer to write to, null to create one.*/BlockCipher.prototype.start = function(options) {options = options || {};var opts = {};for(var key in options) {opts[key] = options[key];}opts.decrypt = this._decrypt;this._finish = false;this._input = forge.util.createBuffer();this.output = options.output || forge.util.createBuffer();this.mode.start(opts);};/*** Updates the next block according to the cipher mode.** @param input the buffer to read from.*/BlockCipher.prototype.update = function(input) {if(input) {// input given, so empty it into the input bufferthis._input.putBuffer(input);}// do cipher operation until it needs more input and not finishedwhile(!this._op.call(this.mode, this._input, this.output, this._finish) &&!this._finish) {}// free consumed memory from input bufferthis._input.compact();};/*** Finishes encrypting or decrypting.** @param pad a padding function to use in CBC mode, null for default,*          signature(blockSize, buffer, decrypt).** @return true if successful, false on error.*/BlockCipher.prototype.finish = function(pad) {// backwards-compatibility w/deprecated padding API// Note: will overwrite padding functions even after another start() callif(pad && (this.mode.name === 'ECB' || this.mode.name === 'CBC')) {this.mode.pad = function(input) {return pad(this.blockSize, input, false);};this.mode.unpad = function(output) {return pad(this.blockSize, output, true);};}// build options for padding and afterFinish functionsvar options = {};options.decrypt = this._decrypt;// get # of bytes that won't fill a blockoptions.overflow = this._input.length() % this.blockSize;if(!this._decrypt && this.mode.pad) {if(!this.mode.pad(this._input, options)) {return false;}}// do final updatethis._finish = true;this.update();if(this._decrypt && this.mode.unpad) {if(!this.mode.unpad(this.output, options)) {return false;}}if(this.mode.afterFinish) {if(!this.mode.afterFinish(this.output, options)) {return false;}}return true;};/***/ }),/***/ 3982:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Supported cipher modes.** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);forge.cipher = forge.cipher || {};// supported cipher modesvar modes = module.exports = forge.cipher.modes = forge.cipher.modes || {};/** Electronic codebook (ECB) (Don't use this; it's not secure) **/modes.ecb = function(options) {options = options || {};this.name = 'ECB';this.cipher = options.cipher;this.blockSize = options.blockSize || 16;this._ints = this.blockSize / 4;this._inBlock = new Array(this._ints);this._outBlock = new Array(this._ints);};modes.ecb.prototype.start = function(options) {};modes.ecb.prototype.encrypt = function(input, output, finish) {// not enough input to encryptif(input.length() < this.blockSize && !(finish && input.length() > 0)) {return true;}// get next blockfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = input.getInt32();}// encrypt blockthis.cipher.encrypt(this._inBlock, this._outBlock);// write outputfor(var i = 0; i < this._ints; ++i) {output.putInt32(this._outBlock[i]);}};modes.ecb.prototype.decrypt = function(input, output, finish) {// not enough input to decryptif(input.length() < this.blockSize && !(finish && input.length() > 0)) {return true;}// get next blockfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = input.getInt32();}// decrypt blockthis.cipher.decrypt(this._inBlock, this._outBlock);// write outputfor(var i = 0; i < this._ints; ++i) {output.putInt32(this._outBlock[i]);}};modes.ecb.prototype.pad = function(input, options) {// add PKCS#7 padding to block (each pad byte is the// value of the number of pad bytes)var padding = (input.length() === this.blockSize ?this.blockSize : (this.blockSize - input.length()));input.fillWithByte(padding, padding);return true;};modes.ecb.prototype.unpad = function(output, options) {// check for error: input data not a multiple of blockSizeif(options.overflow > 0) {return false;}// ensure padding byte count is validvar len = output.length();var count = output.at(len - 1);if(count > (this.blockSize << 2)) {return false;}// trim off padding bytesoutput.truncate(count);return true;};/** Cipher-block Chaining (CBC) **/modes.cbc = function(options) {options = options || {};this.name = 'CBC';this.cipher = options.cipher;this.blockSize = options.blockSize || 16;this._ints = this.blockSize / 4;this._inBlock = new Array(this._ints);this._outBlock = new Array(this._ints);};modes.cbc.prototype.start = function(options) {// Note: legacy support for using IV residue (has security flaws)// if IV is null, reuse block from previous processingif(options.iv === null) {// must have a previous blockif(!this._prev) {throw new Error('Invalid IV parameter.');}this._iv = this._prev.slice(0);} else if(!('iv' in options)) {throw new Error('Invalid IV parameter.');} else {// save IV as "previous" blockthis._iv = transformIV(options.iv);this._prev = this._iv.slice(0);}};modes.cbc.prototype.encrypt = function(input, output, finish) {// not enough input to encryptif(input.length() < this.blockSize && !(finish && input.length() > 0)) {return true;}// get next block// CBC XOR's IV (or previous block) with plaintextfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = this._prev[i] ^ input.getInt32();}// encrypt blockthis.cipher.encrypt(this._inBlock, this._outBlock);// write output, save previous blockfor(var i = 0; i < this._ints; ++i) {output.putInt32(this._outBlock[i]);}this._prev = this._outBlock;};modes.cbc.prototype.decrypt = function(input, output, finish) {// not enough input to decryptif(input.length() < this.blockSize && !(finish && input.length() > 0)) {return true;}// get next blockfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = input.getInt32();}// decrypt blockthis.cipher.decrypt(this._inBlock, this._outBlock);// write output, save previous ciphered block// CBC XOR's IV (or previous block) with ciphertextfor(var i = 0; i < this._ints; ++i) {output.putInt32(this._prev[i] ^ this._outBlock[i]);}this._prev = this._inBlock.slice(0);};modes.cbc.prototype.pad = function(input, options) {// add PKCS#7 padding to block (each pad byte is the// value of the number of pad bytes)var padding = (input.length() === this.blockSize ?this.blockSize : (this.blockSize - input.length()));input.fillWithByte(padding, padding);return true;};modes.cbc.prototype.unpad = function(output, options) {// check for error: input data not a multiple of blockSizeif(options.overflow > 0) {return false;}// ensure padding byte count is validvar len = output.length();var count = output.at(len - 1);if(count > (this.blockSize << 2)) {return false;}// trim off padding bytesoutput.truncate(count);return true;};/** Cipher feedback (CFB) **/modes.cfb = function(options) {options = options || {};this.name = 'CFB';this.cipher = options.cipher;this.blockSize = options.blockSize || 16;this._ints = this.blockSize / 4;this._inBlock = null;this._outBlock = new Array(this._ints);this._partialBlock = new Array(this._ints);this._partialOutput = forge.util.createBuffer();this._partialBytes = 0;};modes.cfb.prototype.start = function(options) {if(!('iv' in options)) {throw new Error('Invalid IV parameter.');}// use IV as first inputthis._iv = transformIV(options.iv);this._inBlock = this._iv.slice(0);this._partialBytes = 0;};modes.cfb.prototype.encrypt = function(input, output, finish) {// not enough input to encryptvar inputLength = input.length();if(inputLength === 0) {return true;}// encrypt blockthis.cipher.encrypt(this._inBlock, this._outBlock);// handle full blockif(this._partialBytes === 0 && inputLength >= this.blockSize) {// XOR input with output, write input as outputfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = input.getInt32() ^ this._outBlock[i];output.putInt32(this._inBlock[i]);}return;}// handle partial blockvar partialBytes = (this.blockSize - inputLength) % this.blockSize;if(partialBytes > 0) {partialBytes = this.blockSize - partialBytes;}// XOR input with output, write input as partial outputthis._partialOutput.clear();for(var i = 0; i < this._ints; ++i) {this._partialBlock[i] = input.getInt32() ^ this._outBlock[i];this._partialOutput.putInt32(this._partialBlock[i]);}if(partialBytes > 0) {// block still incomplete, restore input bufferinput.read -= this.blockSize;} else {// block complete, update input blockfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = this._partialBlock[i];}}// skip any previous partial bytesif(this._partialBytes > 0) {this._partialOutput.getBytes(this._partialBytes);}if(partialBytes > 0 && !finish) {output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes));this._partialBytes = partialBytes;return true;}output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes));this._partialBytes = 0;};modes.cfb.prototype.decrypt = function(input, output, finish) {// not enough input to decryptvar inputLength = input.length();if(inputLength === 0) {return true;}// encrypt block (CFB always uses encryption mode)this.cipher.encrypt(this._inBlock, this._outBlock);// handle full blockif(this._partialBytes === 0 && inputLength >= this.blockSize) {// XOR input with output, write input as outputfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = input.getInt32();output.putInt32(this._inBlock[i] ^ this._outBlock[i]);}return;}// handle partial blockvar partialBytes = (this.blockSize - inputLength) % this.blockSize;if(partialBytes > 0) {partialBytes = this.blockSize - partialBytes;}// XOR input with output, write input as partial outputthis._partialOutput.clear();for(var i = 0; i < this._ints; ++i) {this._partialBlock[i] = input.getInt32();this._partialOutput.putInt32(this._partialBlock[i] ^ this._outBlock[i]);}if(partialBytes > 0) {// block still incomplete, restore input bufferinput.read -= this.blockSize;} else {// block complete, update input blockfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = this._partialBlock[i];}}// skip any previous partial bytesif(this._partialBytes > 0) {this._partialOutput.getBytes(this._partialBytes);}if(partialBytes > 0 && !finish) {output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes));this._partialBytes = partialBytes;return true;}output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes));this._partialBytes = 0;};/** Output feedback (OFB) **/modes.ofb = function(options) {options = options || {};this.name = 'OFB';this.cipher = options.cipher;this.blockSize = options.blockSize || 16;this._ints = this.blockSize / 4;this._inBlock = null;this._outBlock = new Array(this._ints);this._partialOutput = forge.util.createBuffer();this._partialBytes = 0;};modes.ofb.prototype.start = function(options) {if(!('iv' in options)) {throw new Error('Invalid IV parameter.');}// use IV as first inputthis._iv = transformIV(options.iv);this._inBlock = this._iv.slice(0);this._partialBytes = 0;};modes.ofb.prototype.encrypt = function(input, output, finish) {// not enough input to encryptvar inputLength = input.length();if(input.length() === 0) {return true;}// encrypt block (OFB always uses encryption mode)this.cipher.encrypt(this._inBlock, this._outBlock);// handle full blockif(this._partialBytes === 0 && inputLength >= this.blockSize) {// XOR input with output and update next inputfor(var i = 0; i < this._ints; ++i) {output.putInt32(input.getInt32() ^ this._outBlock[i]);this._inBlock[i] = this._outBlock[i];}return;}// handle partial blockvar partialBytes = (this.blockSize - inputLength) % this.blockSize;if(partialBytes > 0) {partialBytes = this.blockSize - partialBytes;}// XOR input with outputthis._partialOutput.clear();for(var i = 0; i < this._ints; ++i) {this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);}if(partialBytes > 0) {// block still incomplete, restore input bufferinput.read -= this.blockSize;} else {// block complete, update input blockfor(var i = 0; i < this._ints; ++i) {this._inBlock[i] = this._outBlock[i];}}// skip any previous partial bytesif(this._partialBytes > 0) {this._partialOutput.getBytes(this._partialBytes);}if(partialBytes > 0 && !finish) {output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes));this._partialBytes = partialBytes;return true;}output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes));this._partialBytes = 0;};modes.ofb.prototype.decrypt = modes.ofb.prototype.encrypt;/** Counter (CTR) **/modes.ctr = function(options) {options = options || {};this.name = 'CTR';this.cipher = options.cipher;this.blockSize = options.blockSize || 16;this._ints = this.blockSize / 4;this._inBlock = null;this._outBlock = new Array(this._ints);this._partialOutput = forge.util.createBuffer();this._partialBytes = 0;};modes.ctr.prototype.start = function(options) {if(!('iv' in options)) {throw new Error('Invalid IV parameter.');}// use IV as first inputthis._iv = transformIV(options.iv);this._inBlock = this._iv.slice(0);this._partialBytes = 0;};modes.ctr.prototype.encrypt = function(input, output, finish) {// not enough input to encryptvar inputLength = input.length();if(inputLength === 0) {return true;}// encrypt block (CTR always uses encryption mode)this.cipher.encrypt(this._inBlock, this._outBlock);// handle full blockif(this._partialBytes === 0 && inputLength >= this.blockSize) {// XOR input with outputfor(var i = 0; i < this._ints; ++i) {output.putInt32(input.getInt32() ^ this._outBlock[i]);}} else {// handle partial blockvar partialBytes = (this.blockSize - inputLength) % this.blockSize;if(partialBytes > 0) {partialBytes = this.blockSize - partialBytes;}// XOR input with outputthis._partialOutput.clear();for(var i = 0; i < this._ints; ++i) {this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);}if(partialBytes > 0) {// block still incomplete, restore input bufferinput.read -= this.blockSize;}// skip any previous partial bytesif(this._partialBytes > 0) {this._partialOutput.getBytes(this._partialBytes);}if(partialBytes > 0 && !finish) {output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes));this._partialBytes = partialBytes;return true;}output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes));this._partialBytes = 0;}// block complete, increment counter (input block)inc32(this._inBlock);};modes.ctr.prototype.decrypt = modes.ctr.prototype.encrypt;/** Galois/Counter Mode (GCM) **/modes.gcm = function(options) {options = options || {};this.name = 'GCM';this.cipher = options.cipher;this.blockSize = options.blockSize || 16;this._ints = this.blockSize / 4;this._inBlock = new Array(this._ints);this._outBlock = new Array(this._ints);this._partialOutput = forge.util.createBuffer();this._partialBytes = 0;// R is actually this value concatenated with 120 more zero bits, but// we only XOR against R so the other zeros have no effect -- we just// apply this value to the first integer in a blockthis._R = 0xE1000000;};modes.gcm.prototype.start = function(options) {if(!('iv' in options)) {throw new Error('Invalid IV parameter.');}// ensure IV is a byte buffervar iv = forge.util.createBuffer(options.iv);// no ciphered data processed yetthis._cipherLength = 0;// default additional data is nonevar additionalData;if('additionalData' in options) {additionalData = forge.util.createBuffer(options.additionalData);} else {additionalData = forge.util.createBuffer();}// default tag length is 128 bitsif('tagLength' in options) {this._tagLength = options.tagLength;} else {this._tagLength = 128;}// if tag is given, ensure tag matches tag lengththis._tag = null;if(options.decrypt) {// save tag to check laterthis._tag = forge.util.createBuffer(options.tag).getBytes();if(this._tag.length !== (this._tagLength / 8)) {throw new Error('Authentication tag does not match tag length.');}}// create tmp storage for hash calculationthis._hashBlock = new Array(this._ints);// no tag generated yetthis.tag = null;// generate hash subkey// (apply block cipher to "zero" block)this._hashSubkey = new Array(this._ints);this.cipher.encrypt([0, 0, 0, 0], this._hashSubkey);// generate table M// use 4-bit tables (32 component decomposition of a 16 byte value)// 8-bit tables take more space and are known to have security// vulnerabilities (in native implementations)this.componentBits = 4;this._m = this.generateHashTable(this._hashSubkey, this.componentBits);// Note: support IV length different from 96 bits? (only supporting// 96 bits is recommended by NIST SP-800-38D)// generate J_0var ivLength = iv.length();if(ivLength === 12) {// 96-bit IVthis._j0 = [iv.getInt32(), iv.getInt32(), iv.getInt32(), 1];} else {// IV is NOT 96-bitsthis._j0 = [0, 0, 0, 0];while(iv.length() > 0) {this._j0 = this.ghash(this._hashSubkey, this._j0,[iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]);}this._j0 = this.ghash(this._hashSubkey, this._j0, [0, 0].concat(from64To32(ivLength * 8)));}// generate ICB (initial counter block)this._inBlock = this._j0.slice(0);inc32(this._inBlock);this._partialBytes = 0;// consume authentication dataadditionalData = forge.util.createBuffer(additionalData);// save additional data length as a BE 64-bit numberthis._aDataLength = from64To32(additionalData.length() * 8);// pad additional data to 128 bit (16 byte) block sizevar overflow = additionalData.length() % this.blockSize;if(overflow) {additionalData.fillWithByte(0, this.blockSize - overflow);}this._s = [0, 0, 0, 0];while(additionalData.length() > 0) {this._s = this.ghash(this._hashSubkey, this._s, [additionalData.getInt32(),additionalData.getInt32(),additionalData.getInt32(),additionalData.getInt32()]);}};modes.gcm.prototype.encrypt = function(input, output, finish) {// not enough input to encryptvar inputLength = input.length();if(inputLength === 0) {return true;}// encrypt blockthis.cipher.encrypt(this._inBlock, this._outBlock);// handle full blockif(this._partialBytes === 0 && inputLength >= this.blockSize) {// XOR input with outputfor(var i = 0; i < this._ints; ++i) {output.putInt32(this._outBlock[i] ^= input.getInt32());}this._cipherLength += this.blockSize;} else {// handle partial blockvar partialBytes = (this.blockSize - inputLength) % this.blockSize;if(partialBytes > 0) {partialBytes = this.blockSize - partialBytes;}// XOR input with outputthis._partialOutput.clear();for(var i = 0; i < this._ints; ++i) {this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);}if(partialBytes <= 0 || finish) {// handle overflow prior to hashingif(finish) {// get block overflowvar overflow = inputLength % this.blockSize;this._cipherLength += overflow;// truncate for hash functionthis._partialOutput.truncate(this.blockSize - overflow);} else {this._cipherLength += this.blockSize;}// get output block for hashingfor(var i = 0; i < this._ints; ++i) {this._outBlock[i] = this._partialOutput.getInt32();}this._partialOutput.read -= this.blockSize;}// skip any previous partial bytesif(this._partialBytes > 0) {this._partialOutput.getBytes(this._partialBytes);}if(partialBytes > 0 && !finish) {// block still incomplete, restore input buffer, get partial output,// and return earlyinput.read -= this.blockSize;output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes));this._partialBytes = partialBytes;return true;}output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes));this._partialBytes = 0;}// update hash block Sthis._s = this.ghash(this._hashSubkey, this._s, this._outBlock);// increment counter (input block)inc32(this._inBlock);};modes.gcm.prototype.decrypt = function(input, output, finish) {// not enough input to decryptvar inputLength = input.length();if(inputLength < this.blockSize && !(finish && inputLength > 0)) {return true;}// encrypt block (GCM always uses encryption mode)this.cipher.encrypt(this._inBlock, this._outBlock);// increment counter (input block)inc32(this._inBlock);// update hash block Sthis._hashBlock[0] = input.getInt32();this._hashBlock[1] = input.getInt32();this._hashBlock[2] = input.getInt32();this._hashBlock[3] = input.getInt32();this._s = this.ghash(this._hashSubkey, this._s, this._hashBlock);// XOR hash input with outputfor(var i = 0; i < this._ints; ++i) {output.putInt32(this._outBlock[i] ^ this._hashBlock[i]);}// increment cipher data lengthif(inputLength < this.blockSize) {this._cipherLength += inputLength % this.blockSize;} else {this._cipherLength += this.blockSize;}};modes.gcm.prototype.afterFinish = function(output, options) {var rval = true;// handle overflowif(options.decrypt && options.overflow) {output.truncate(this.blockSize - options.overflow);}// handle authentication tagthis.tag = forge.util.createBuffer();// concatenate additional data length with cipher lengthvar lengths = this._aDataLength.concat(from64To32(this._cipherLength * 8));// include lengths in hashthis._s = this.ghash(this._hashSubkey, this._s, lengths);// do GCTR(J_0, S)var tag = [];this.cipher.encrypt(this._j0, tag);for(var i = 0; i < this._ints; ++i) {this.tag.putInt32(this._s[i] ^ tag[i]);}// trim tag to lengththis.tag.truncate(this.tag.length() % (this._tagLength / 8));// check authentication tagif(options.decrypt && this.tag.bytes() !== this._tag) {rval = false;}return rval;};/*** See NIST SP-800-38D 6.3 (Algorithm 1). This function performs Galois* field multiplication. The field, GF(2^128), is defined by the polynomial:** x^128 + x^7 + x^2 + x + 1** Which is represented in little-endian binary form as: 11100001 (0xe1). When* the value of a coefficient is 1, a bit is set. The value R, is the* concatenation of this value and 120 zero bits, yielding a 128-bit value* which matches the block size.** This function will multiply two elements (vectors of bytes), X and Y, in* the field GF(2^128). The r###lt is initialized to zero. For each bit of* X (out of 128), x_i, if x_i is set, then the r###lt is multiplied (XOR'd)* by the current value of Y. For each bit, the value of Y will be raised by* a power of x (multiplied by the polynomial x). This can be achieved by* shifting Y once to the right. If the current value of Y, prior to being* multiplied by x, has 0 as its LSB, then it is a 127th degree polynomial.* Otherwise, we must divide by R after shifting to find the remainder.** @param x the first block to multiply by the second.* @param y the second block to multiply by the first.** @return the block r###lt of the multiplication.*/modes.gcm.prototype.multiply = function(x, y) {var z_i = [0, 0, 0, 0];var v_i = y.slice(0);// calculate Z_128 (block has 128 bits)for(var i = 0; i < 128; ++i) {// if x_i is 0, Z_{i+1} = Z_i (unchanged)// else Z_{i+1} = Z_i ^ V_i// get x_i by finding 32-bit int position, then left shift 1 by remaindervar x_i = x[(i / 32) | 0] & (1 << (31 - i % 32));if(x_i) {z_i[0] ^= v_i[0];z_i[1] ^= v_i[1];z_i[2] ^= v_i[2];z_i[3] ^= v_i[3];}// if LSB(V_i) is 1, V_i = V_i >> 1// else V_i = (V_i >> 1) ^ Rthis.pow(v_i, v_i);}return z_i;};modes.gcm.prototype.pow = function(x, out) {// if LSB(x) is 1, x = x >>> 1// else x = (x >>> 1) ^ Rvar lsb = x[3] & 1;// always do x >>> 1:// starting with the rightmost integer, shift each integer to the right// one bit, pulling in the bit from the integer to the left as its top// most bit (do this for the last 3 integers)for(var i = 3; i > 0; --i) {out[i] = (x[i] >>> 1) | ((x[i - 1] & 1) << 31);}// shift the first integer normallyout[0] = x[0] >>> 1;// if lsb was not set, then polynomial had a degree of 127 and doesn't// need to divided; otherwise, XOR with R to find the remainder; we only// need to XOR the first integer since R technically ends w/120 zero bitsif(lsb) {out[0] ^= this._R;}};modes.gcm.prototype.tableMultiply = function(x) {// assumes 4-bit tables are usedvar z = [0, 0, 0, 0];for(var i = 0; i < 32; ++i) {var idx = (i / 8) | 0;var x_i = (x[idx] >>> ((7 - (i % 8)) * 4)) & 0xF;var ah = this._m[i][x_i];z[0] ^= ah[0];z[1] ^= ah[1];z[2] ^= ah[2];z[3] ^= ah[3];}return z;};/*** A continuing version of the GHASH algorithm that operates on a single* block. The hash block, last hash value (Ym) and the new block to hash* are given.** @param h the hash block.* @param y the previous value for Ym, use [0, 0, 0, 0] for a new hash.* @param x the block to hash.** @return the hashed value (Ym).*/modes.gcm.prototype.ghash = function(h, y, x) {y[0] ^= x[0];y[1] ^= x[1];y[2] ^= x[2];y[3] ^= x[3];return this.tableMultiply(y);//return this.multiply(y, h);};/*** Precomputes a table for multiplying against the hash subkey. This* mechanism provides a substantial speed increase over multiplication* performed without a table. The table-based multiplication this table is* for solves X * H by multiplying each component of X by H and then* composing the r###lts together using XOR.** This function can be used to generate tables with different bit sizes* for the components, however, this implementation assumes there are* 32 components of X (which is a 16 byte vector), therefore each component* takes 4-bits (so the table is constructed with bits=4).** @param h the hash subkey.* @param bits the bit size for a component.*/modes.gcm.prototype.generateHashTable = function(h, bits) {// TODO: There are further optimizations that would use only the// first table M_0 (or some variant) along with a remainder table;// this can be explored in the futurevar multiplier = 8 / bits;var perInt = 4 * multiplier;var size = 16 * multiplier;var m = new Array(size);for(var i = 0; i < size; ++i) {var tmp = [0, 0, 0, 0];var idx = (i / perInt) | 0;var shft = ((perInt - 1 - (i % perInt)) * bits);tmp[idx] = (1 << (bits - 1)) << shft;m[i] = this.generat###bHashTable(this.multiply(tmp, h), bits);}return m;};/*** Generates a table for multiplying against the hash subkey for one* particular component (out of all possible component values).** @param mid the pre-multiplied value for the middle key of the table.* @param bits the bit size for a component.*/modes.gcm.prototype.generat###bHashTable = function(mid, bits) {// compute the table quickly by minimizing the number of// POW operations -- they only need to be performed for powers of 2,// all other entries can be composed from those powers using XORvar size = 1 << bits;var half = size >>> 1;var m = new Array(size);m[half] = mid.slice(0);var i = half >>> 1;while(i > 0) {// raise m0[2 * i] and store in m0[i]this.pow(m[2 * i], m[i] = []);i >>= 1;}i = 2;while(i < half) {for(var j = 1; j < i; ++j) {var m_i = m[i];var m_j = m[j];m[i + j] = [m_i[0] ^ m_j[0],m_i[1] ^ m_j[1],m_i[2] ^ m_j[2],m_i[3] ^ m_j[3]];}i *= 2;}m[0] = [0, 0, 0, 0];/* Note: We could avoid storing these by doing composition during multiplycalculate top half using composition by speed is preferred. */for(i = half + 1; i < size; ++i) {var c = m[i ^ half];m[i] = [mid[0] ^ c[0], mid[1] ^ c[1], mid[2] ^ c[2], mid[3] ^ c[3]];}return m;};/** Utility functions */function transformIV(iv) {if(typeof iv === 'string') {// convert iv string into byte bufferiv = forge.util.createBuffer(iv);}if(forge.util.isArray(iv) && iv.length > 4) {// convert iv byte array into byte buffervar tmp = iv;iv = forge.util.createBuffer();for(var i = 0; i < tmp.length; ++i) {iv.putByte(tmp[i]);}}if(!forge.util.isArray(iv)) {// convert iv byte buffer into 32-bit integer arrayiv = [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()];}return iv;}function inc32(block) {// increment last 32 bits of block onlyblock[block.length - 1] = (block[block.length - 1] + 1) & 0xFFFFFFFF;}function from64To32(num) {// convert 64-bit number to two BE Int32sreturn [(num / 0x100000000) | 0, num & 0xFFFFFFFF];}/***/ }),/***/ 5569:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Debugging support for web applications.** @author David I. Lehn <[email protected]>** Copyright 2008-2013 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);/* DEBUG API */module.exports = forge.debug = forge.debug || {};// Private storage for debugging.// Useful to expose data that is otherwise unviewable behind closures.// NOTE: remember that this can hold references to data and cause leaks!// format is "forge._debug.<modulename>.<dataname> = data"// Example:// (function() {//   var cat = 'forge.test.Test'; // debugging category//   var sState = {...}; // local state//   forge.debug.set(cat, 'sState', sState);// })();forge.debug.storage = {};/*** Gets debug data. Omit name for all cat data  Omit name and cat for* all data.** @param cat name of debugging category.* @param name name of data to get (optional).* @return object with requested debug data or undefined.*/forge.debug.get = function(cat, name) {var rval;if(typeof(cat) === 'undefined') {rval = forge.debug.storage;} else if(cat in forge.debug.storage) {if(typeof(name) === 'undefined') {rval = forge.debug.storage[cat];} else {rval = forge.debug.storage[cat][name];}}return rval;};/*** Sets debug data.** @param cat name of debugging category.* @param name name of data to set.* @param data data to set.*/forge.debug.set = function(cat, name, data) {if(!(cat in forge.debug.storage)) {forge.debug.storage[cat] = {};}forge.debug.storage[cat][name] = data;};/*** Clears debug data. Omit name for all cat data. Omit name and cat for* all data.** @param cat name of debugging category.* @param name name of data to clear or omit to clear entire category.*/forge.debug.clear = function(cat, name) {if(typeof(cat) === 'undefined') {forge.debug.storage = {};} else if(cat in forge.debug.storage) {if(typeof(name) === 'undefined') {delete forge.debug.storage[cat];} else {delete forge.debug.storage[cat][name];}}};/***/ }),/***/ 3436:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** DES (Data Encryption Standard) implementation.** This implementation supports DES as well as 3DES-EDE in ECB and CBC mode.* It is based on the BSD-licensed implementation by Paul Tero:** Paul Tero, July 2001* http://www.tero.co.uk/des/** Optimised for performance with large blocks by* Michael Hayworth, November 2001* http://www.netdealing.com** THIS SOFTWARE IS PROVIDED "AS IS" AND* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE* ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF* SUCH DAMAGE.** @author Stefan Siegl* @author Dave Longley** Copyright (c) 2012 Stefan Siegl <[email protected]>* Copyright (c) 2012-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(9671);__webpack_require__(3982);__webpack_require__(2365);/* DES API */module.exports = forge.des = forge.des || {};/*** Deprecated. Instead, use:** var cipher = forge.cipher.createCipher('DES-<mode>', key);* cipher.start({iv: iv});** Creates an DES cipher object to encrypt data using the given symmetric key.* The output will be stored in the 'output' member of the returned cipher.** The key and iv may be given as binary-encoded strings of bytes or* byte buffers.** @param key the symmetric key to use (64 or 192 bits).* @param iv the initialization vector to use.* @param output the buffer to write to, null to create one.* @param mode the cipher mode to use (default: 'CBC' if IV is*          given, 'ECB' if null).** @return the cipher.*/forge.des.startEncrypting = function(key, iv, output, mode) {var cipher = _createCipher({key: key,output: output,decrypt: false,mode: mode || (iv === null ? 'ECB' : 'CBC')});cipher.start(iv);return cipher;};/*** Deprecated. Instead, use:** var cipher = forge.cipher.createCipher('DES-<mode>', key);** Creates an DES cipher object to encrypt data using the given symmetric key.** The key may be given as a binary-encoded string of bytes or a byte buffer.** @param key the symmetric key to use (64 or 192 bits).* @param mode the cipher mode to use (default: 'CBC').** @return the cipher.*/forge.des.createEncryptionCipher = function(key, mode) {return _createCipher({key: key,output: null,decrypt: false,mode: mode});};/*** Deprecated. Instead, use:** var decipher = forge.cipher.createDecipher('DES-<mode>', key);* decipher.start({iv: iv});** Creates an DES cipher object to decrypt data using the given symmetric key.* The output will be stored in the 'output' member of the returned cipher.** The key and iv may be given as binary-encoded strings of bytes or* byte buffers.** @param key the symmetric key to use (64 or 192 bits).* @param iv the initialization vector to use.* @param output the buffer to write to, null to create one.* @param mode the cipher mode to use (default: 'CBC' if IV is*          given, 'ECB' if null).** @return the cipher.*/forge.des.startDecrypting = function(key, iv, output, mode) {var cipher = _createCipher({key: key,output: output,decrypt: true,mode: mode || (iv === null ? 'ECB' : 'CBC')});cipher.start(iv);return cipher;};/*** Deprecated. Instead, use:** var decipher = forge.cipher.createDecipher('DES-<mode>', key);** Creates an DES cipher object to decrypt data using the given symmetric key.** The key may be given as a binary-encoded string of bytes or a byte buffer.** @param key the symmetric key to use (64 or 192 bits).* @param mode the cipher mode to use (default: 'CBC').** @return the cipher.*/forge.des.createDecryptionCipher = function(key, mode) {return _createCipher({key: key,output: null,decrypt: true,mode: mode});};/*** Creates a new DES cipher algorithm object.** @param name the name of the algorithm.* @param mode the mode factory function.** @return the DES algorithm object.*/forge.des.Algorithm = function(name, mode) {var self = this;self.name = name;self.mode = new mode({blockSize: 8,cipher: {encrypt: function(inBlock, outBlock) {return _updateBlock(self._keys, inBlock, outBlock, false);},decrypt: function(inBlock, outBlock) {return _updateBlock(self._keys, inBlock, outBlock, true);}}});self._init = false;};/*** Initializes this DES algorithm by expanding its key.** @param options the options to use.*          key the key to use with this algorithm.*          decrypt true if the algorithm should be initialized for decryption,*            false for encryption.*/forge.des.Algorithm.prototype.initialize = function(options) {if(this._init) {return;}var key = forge.util.createBuffer(options.key);if(this.name.indexOf('3DES') === 0) {if(key.length() !== 24) {throw new Error('Invalid Triple-DES key size: ' + key.length() * 8);}}// do key expansion to 16 or 48 subkeys (single or triple DES)this._keys = _createKeys(key);this._init = true;};/** Register DES algorithms **/registerAlgorithm('DES-ECB', forge.cipher.modes.ecb);registerAlgorithm('DES-CBC', forge.cipher.modes.cbc);registerAlgorithm('DES-CFB', forge.cipher.modes.cfb);registerAlgorithm('DES-OFB', forge.cipher.modes.ofb);registerAlgorithm('DES-CTR', forge.cipher.modes.ctr);registerAlgorithm('3DES-ECB', forge.cipher.modes.ecb);registerAlgorithm('3DES-CBC', forge.cipher.modes.cbc);registerAlgorithm('3DES-CFB', forge.cipher.modes.cfb);registerAlgorithm('3DES-OFB', forge.cipher.modes.ofb);registerAlgorithm('3DES-CTR', forge.cipher.modes.ctr);function registerAlgorithm(name, mode) {var factory = function() {return new forge.des.Algorithm(name, mode);};forge.cipher.registerAlgorithm(name, factory);}/** DES implementation **/var spfunction1 = [0x1010400,0,0x10000,0x1010404,0x1010004,0x10404,0x4,0x10000,0x400,0x1010400,0x1010404,0x400,0x1000404,0x1010004,0x1000000,0x4,0x404,0x1000400,0x1000400,0x10400,0x10400,0x1010000,0x1010000,0x1000404,0x10004,0x1000004,0x1000004,0x10004,0,0x404,0x10404,0x1000000,0x10000,0x1010404,0x4,0x1010000,0x1010400,0x1000000,0x1000000,0x400,0x1010004,0x10000,0x10400,0x1000004,0x400,0x4,0x1000404,0x10404,0x1010404,0x10004,0x1010000,0x1000404,0x1000004,0x404,0x10404,0x1010400,0x404,0x1000400,0x1000400,0,0x10004,0x10400,0,0x1010004];var spfunction2 = [-0x7fef7fe0,-0x7fff8000,0x8000,0x108020,0x100000,0x20,-0x7fefffe0,-0x7fff7fe0,-0x7fffffe0,-0x7fef7fe0,-0x7fef8000,-0x80000000,-0x7fff8000,0x100000,0x20,-0x7fefffe0,0x108000,0x100020,-0x7fff7fe0,0,-0x80000000,0x8000,0x108020,-0x7ff00000,0x100020,-0x7fffffe0,0,0x108000,0x8020,-0x7fef8000,-0x7ff00000,0x8020,0,0x108020,-0x7fefffe0,0x100000,-0x7fff7fe0,-0x7ff00000,-0x7fef8000,0x8000,-0x7ff00000,-0x7fff8000,0x20,-0x7fef7fe0,0x108020,0x20,0x8000,-0x80000000,0x8020,-0x7fef8000,0x100000,-0x7fffffe0,0x100020,-0x7fff7fe0,-0x7fffffe0,0x100020,0x108000,0,-0x7fff8000,0x8020,-0x80000000,-0x7fefffe0,-0x7fef7fe0,0x108000];var spfunction3 = [0x208,0x8020200,0,0x8020008,0x8000200,0,0x20208,0x8000200,0x20008,0x8000008,0x8000008,0x20000,0x8020208,0x20008,0x8020000,0x208,0x8000000,0x8,0x8020200,0x200,0x20200,0x8020000,0x8020008,0x20208,0x8000208,0x20200,0x20000,0x8000208,0x8,0x8020208,0x200,0x8000000,0x8020200,0x8000000,0x20008,0x208,0x20000,0x8020200,0x8000200,0,0x200,0x20008,0x8020208,0x8000200,0x8000008,0x200,0,0x8020008,0x8000208,0x20000,0x8000000,0x8020208,0x8,0x20208,0x20200,0x8000008,0x8020000,0x8000208,0x208,0x8020000,0x20208,0x8,0x8020008,0x20200];var spfunction4 = [0x802001,0x2081,0x2081,0x80,0x802080,0x800081,0x800001,0x2001,0,0x802000,0x802000,0x802081,0x81,0,0x800080,0x800001,0x1,0x2000,0x800000,0x802001,0x80,0x800000,0x2001,0x2080,0x800081,0x1,0x2080,0x800080,0x2000,0x802080,0x802081,0x81,0x800080,0x800001,0x802000,0x802081,0x81,0,0,0x802000,0x2080,0x800080,0x800081,0x1,0x802001,0x2081,0x2081,0x80,0x802081,0x81,0x1,0x2000,0x800001,0x2001,0x802080,0x800081,0x2001,0x2080,0x800000,0x802001,0x80,0x800000,0x2000,0x802080];var spfunction5 = [0x100,0x2080100,0x2080000,0x42000100,0x80000,0x100,0x40000000,0x2080000,0x40080100,0x80000,0x2000100,0x40080100,0x42000100,0x42080000,0x80100,0x40000000,0x2000000,0x40080000,0x40080000,0,0x40000100,0x42080100,0x42080100,0x2000100,0x42080000,0x40000100,0,0x42000000,0x2080100,0x2000000,0x42000000,0x80100,0x80000,0x42000100,0x100,0x2000000,0x40000000,0x2080000,0x42000100,0x40080100,0x2000100,0x40000000,0x42080000,0x2080100,0x40080100,0x100,0x2000000,0x42080000,0x42080100,0x80100,0x42000000,0x42080100,0x2080000,0,0x40080000,0x42000000,0x80100,0x2000100,0x40000100,0x80000,0,0x40080000,0x2080100,0x40000100];var spfunction6 = [0x20000010,0x20400000,0x4000,0x20404010,0x20400000,0x10,0x20404010,0x400000,0x20004000,0x404010,0x400000,0x20000010,0x400010,0x20004000,0x20000000,0x4010,0,0x400010,0x20004010,0x4000,0x404000,0x20004010,0x10,0x20400010,0x20400010,0,0x404010,0x20404000,0x4010,0x404000,0x20404000,0x20000000,0x20004000,0x10,0x20400010,0x404000,0x20404010,0x400000,0x4010,0x20000010,0x400000,0x20004000,0x20000000,0x4010,0x20000010,0x20404010,0x404000,0x20400000,0x404010,0x20404000,0,0x20400010,0x10,0x4000,0x20400000,0x404010,0x4000,0x400010,0x20004010,0,0x20404000,0x20000000,0x400010,0x20004010];var spfunction7 = [0x200000,0x4200002,0x4000802,0,0x800,0x4000802,0x200802,0x4200800,0x4200802,0x200000,0,0x4000002,0x2,0x4000000,0x4200002,0x802,0x4000800,0x200802,0x200002,0x4000800,0x4000002,0x4200000,0x4200800,0x200002,0x4200000,0x800,0x802,0x4200802,0x200800,0x2,0x4000000,0x200800,0x4000000,0x200800,0x200000,0x4000802,0x4000802,0x4200002,0x4200002,0x2,0x200002,0x4000000,0x4000800,0x200000,0x4200800,0x802,0x200802,0x4200800,0x802,0x4000002,0x4200802,0x4200000,0x200800,0,0x2,0x4200802,0,0x200802,0x4200000,0x800,0x4000002,0x4000800,0x800,0x200002];var spfunction8 = [0x10001040,0x1000,0x40000,0x10041040,0x10000000,0x10001040,0x40,0x10000000,0x40040,0x10040000,0x10041040,0x41000,0x10041000,0x41040,0x1000,0x40,0x10040000,0x10000040,0x10001000,0x1040,0x41000,0x40040,0x10040040,0x10041000,0x1040,0,0,0x10040040,0x10000040,0x10001000,0x41040,0x40000,0x41040,0x40000,0x10041000,0x1000,0x40,0x10040040,0x1000,0x41040,0x10001000,0x40,0x10000040,0x10040000,0x10040040,0x10000000,0x40000,0x10001040,0,0x10041040,0x40040,0x10000040,0x10040000,0x10001000,0x10001040,0,0x10041040,0x41000,0x41000,0x1040,0x1040,0x40040,0x10000000,0x10041000];/*** Create necessary sub keys.** @param key the 64-bit or 192-bit key.** @return the expanded keys.*/function _createKeys(key) {var pc2bytes0  = [0,0x4,0x20000000,0x20000004,0x10000,0x10004,0x20010000,0x20010004,0x200,0x204,0x20000200,0x20000204,0x10200,0x10204,0x20010200,0x20010204],pc2bytes1  = [0,0x1,0x100000,0x100001,0x4000000,0x4000001,0x4100000,0x4100001,0x100,0x101,0x100100,0x100101,0x4000100,0x4000101,0x4100100,0x4100101],pc2bytes2  = [0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808,0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808],pc2bytes3  = [0,0x200000,0x8000000,0x8200000,0x2000,0x202000,0x8002000,0x8202000,0x20000,0x220000,0x8020000,0x8220000,0x22000,0x222000,0x8022000,0x8222000],pc2bytes4  = [0,0x40000,0x10,0x40010,0,0x40000,0x10,0x40010,0x1000,0x41000,0x1010,0x41010,0x1000,0x41000,0x1010,0x41010],pc2bytes5  = [0,0x400,0x20,0x420,0,0x400,0x20,0x420,0x2000000,0x2000400,0x2000020,0x2000420,0x2000000,0x2000400,0x2000020,0x2000420],pc2bytes6  = [0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002,0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002],pc2bytes7  = [0,0x10000,0x800,0x10800,0x20000000,0x20010000,0x20000800,0x20010800,0x20000,0x30000,0x20800,0x30800,0x20020000,0x20030000,0x20020800,0x20030800],pc2bytes8  = [0,0x40000,0,0x40000,0x2,0x40002,0x2,0x40002,0x2000000,0x2040000,0x2000000,0x2040000,0x2000002,0x2040002,0x2000002,0x2040002],pc2bytes9  = [0,0x10000000,0x8,0x10000008,0,0x10000000,0x8,0x10000008,0x400,0x10000400,0x408,0x10000408,0x400,0x10000400,0x408,0x10000408],pc2bytes10 = [0,0x20,0,0x20,0x100000,0x100020,0x100000,0x100020,0x2000,0x2020,0x2000,0x2020,0x102000,0x102020,0x102000,0x102020],pc2bytes11 = [0,0x1000000,0x200,0x1000200,0x200000,0x1200000,0x200200,0x1200200,0x4000000,0x5000000,0x4000200,0x5000200,0x4200000,0x5200000,0x4200200,0x5200200],pc2bytes12 = [0,0x1000,0x8000000,0x8001000,0x80000,0x81000,0x8080000,0x8081000,0x10,0x1010,0x8000010,0x8001010,0x80010,0x81010,0x8080010,0x8081010],pc2bytes13 = [0,0x4,0x100,0x104,0,0x4,0x100,0x104,0x1,0x5,0x101,0x105,0x1,0x5,0x101,0x105];// how many iterations (1 for des, 3 for triple des)// changed by Paul 16/6/2007 to use Triple DES for 9+ byte keysvar iterations = key.length() > 8 ? 3 : 1;// stores the return keysvar keys = [];// now define the left shifts which need to be donevar shifts = [0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0];var n = 0, tmp;for(var j = 0; j < iterations; j++) {var left = key.getInt32();var right = key.getInt32();tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;right ^= tmp;left ^= (tmp << 4);tmp = ((right >>> -16) ^ left) & 0x0000ffff;left ^= tmp;right ^= (tmp << -16);tmp = ((left >>> 2) ^ right) & 0x33333333;right ^= tmp;left ^= (tmp << 2);tmp = ((right >>> -16) ^ left) & 0x0000ffff;left ^= tmp;right ^= (tmp << -16);tmp = ((left >>> 1) ^ right) & 0x55555555;right ^= tmp;left ^= (tmp << 1);tmp = ((right >>> 8) ^ left) & 0x00ff00ff;left ^= tmp;right ^= (tmp << 8);tmp = ((left >>> 1) ^ right) & 0x55555555;right ^= tmp;left ^= (tmp << 1);// right needs to be shifted and OR'd with last four bits of lefttmp = (left << 8) | ((right >>> 20) & 0x000000f0);// left needs to be put upside downleft = ((right << 24) | ((right << 8) & 0xff0000) |((right >>> 8) & 0xff00) | ((right >>> 24) & 0xf0));right = tmp;// now go through and perform these shifts on the left and right keysfor(var i = 0; i < shifts.length; ++i) {//shift the keys either one or two bits to the leftif(shifts[i]) {left = (left << 2) | (left >>> 26);right = (right << 2) | (right >>> 26);} else {left = (left << 1) | (left >>> 27);right = (right << 1) | (right >>> 27);}left &= -0xf;right &= -0xf;// now apply PC-2, in such a way that E is easier when encrypting or// decrypting this conversion will look like PC-2 except only the last 6// bits of each byte are used rather than 48 consecutive bits and the// order of lines will be according to how the S selection functions will// be applied: S2, S4, S6, S8, S1, S3, S5, S7var lefttmp = (pc2bytes0[left >>> 28] | pc2bytes1[(left >>> 24) & 0xf] |pc2bytes2[(left >>> 20) & 0xf] | pc2bytes3[(left >>> 16) & 0xf] |pc2bytes4[(left >>> 12) & 0xf] | pc2bytes5[(left >>> 8) & 0xf] |pc2bytes6[(left >>> 4) & 0xf]);var righttmp = (pc2bytes7[right >>> 28] | pc2bytes8[(right >>> 24) & 0xf] |pc2bytes9[(right >>> 20) & 0xf] | pc2bytes10[(right >>> 16) & 0xf] |pc2bytes11[(right >>> 12) & 0xf] | pc2bytes12[(right >>> 8) & 0xf] |pc2bytes13[(right >>> 4) & 0xf]);tmp = ((righttmp >>> 16) ^ lefttmp) & 0x0000ffff;keys[n++] = lefttmp ^ tmp;keys[n++] = righttmp ^ (tmp << 16);}}return keys;}/*** Updates a single block (1 byte) using DES. The update will either* encrypt or decrypt the block.** @param keys the expanded keys.* @param input the input block (an array of 32-bit words).* @param output the updated output block.* @param decrypt true to decrypt the block, false to encrypt it.*/function _updateBlock(keys, input, output, decrypt) {// set up loops for single or triple DESvar iterations = keys.length === 32 ? 3 : 9;var looping;if(iterations === 3) {looping = decrypt ? [30, -2, -2] : [0, 32, 2];} else {looping = (decrypt ?[94, 62, -2, 32, 64, 2, 30, -2, -2] :[0, 32, 2, 62, 30, -2, 64, 96, 2]);}var tmp;var left = input[0];var right = input[1];// first each 64 bit chunk of the message must be permuted according to IPtmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;right ^= tmp;left ^= (tmp << 4);tmp = ((left >>> 16) ^ right) & 0x0000ffff;right ^= tmp;left ^= (tmp << 16);tmp = ((right >>> 2) ^ left) & 0x33333333;left ^= tmp;right ^= (tmp << 2);tmp = ((right >>> 8) ^ left) & 0x00ff00ff;left ^= tmp;right ^= (tmp << 8);tmp = ((left >>> 1) ^ right) & 0x55555555;right ^= tmp;left ^= (tmp << 1);// rotate left 1 bitleft = ((left << 1) | (left >>> 31));right = ((right << 1) | (right >>> 31));for(var j = 0; j < iterations; j += 3) {var endloop = looping[j + 1];var loopinc = looping[j + 2];// now go through and perform the encryption or decryptionfor(var i = looping[j]; i != endloop; i += loopinc) {var right1 = right ^ keys[i];var right2 = ((right >>> 4) | (right << 28)) ^ keys[i + 1];// passing these bytes through the S selection functionstmp = left;left = right;right = tmp ^ (spfunction2[(right1 >>> 24) & 0x3f] |spfunction4[(right1 >>> 16) & 0x3f] |spfunction6[(right1 >>>  8) & 0x3f] |spfunction8[right1 & 0x3f] |spfunction1[(right2 >>> 24) & 0x3f] |spfunction3[(right2 >>> 16) & 0x3f] |spfunction5[(right2 >>>  8) & 0x3f] |spfunction7[right2 & 0x3f]);}// unreverse left and righttmp = left;left = right;right = tmp;}// rotate right 1 bitleft = ((left >>> 1) | (left << 31));right = ((right >>> 1) | (right << 31));// now perform IP-1, which is IP in the opposite directiontmp = ((left >>> 1) ^ right) & 0x55555555;right ^= tmp;left ^= (tmp << 1);tmp = ((right >>> 8) ^ left) & 0x00ff00ff;left ^= tmp;right ^= (tmp << 8);tmp = ((right >>> 2) ^ left) & 0x33333333;left ^= tmp;right ^= (tmp << 2);tmp = ((left >>> 16) ^ right) & 0x0000ffff;right ^= tmp;left ^= (tmp << 16);tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;right ^= tmp;left ^= (tmp << 4);output[0] = left;output[1] = right;}/*** Deprecated. Instead, use:** forge.cipher.createCipher('DES-<mode>', key);* forge.cipher.createDecipher('DES-<mode>', key);** Creates a deprecated DES cipher object. This object's mode will default to* CBC (cipher-block-chaining).** The key may be given as a binary-encoded string of bytes or a byte buffer.** @param options the options to use.*          key the symmetric key to use (64 or 192 bits).*          output the buffer to write to.*          decrypt true for decryption, false for encryption.*          mode the cipher mode to use (default: 'CBC').** @return the cipher.*/function _createCipher(options) {options = options || {};var mode = (options.mode || 'CBC').toUpperCase();var algorithm = 'DES-' + mode;var cipher;if(options.decrypt) {cipher = forge.cipher.createDecipher(algorithm, options.key);} else {cipher = forge.cipher.createCipher(algorithm, options.key);}// backwards compatible start APIvar start = cipher.start;cipher.start = function(iv, options) {// backwards compatibility: support second arg as output buffervar output = null;if(options instanceof forge.util.ByteBuffer) {output = options;options = {};}options = options || {};options.output = output;options.iv = iv;start.call(cipher, options);};return cipher;}/***/ }),/***/ 1353:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** JavaScript implementation of Ed25519.** Copyright (c) 2017-2018 Digital Bazaar, Inc.** This implementation is based on the most excellent TweetNaCl which is* in the public domain. Many thanks to its contributors:** https://github.com/dchest/tweetnacl-js*/var forge = __webpack_require__(7009);__webpack_require__(8785);__webpack_require__(6660);__webpack_require__(5368);__webpack_require__(2365);if(typeof BigInteger === 'undefined') {var BigInteger = forge.jsbn.BigInteger;}var ByteBuffer = forge.util.ByteBuffer;var NativeBuffer = typeof Buffer === 'undefined' ? Uint8Array : Buffer;/** Ed25519 algorithms, see RFC 8032:* https://tools.ietf.org/html/rfc8032*/forge.pki = forge.pki || {};module.exports = forge.pki.ed25519 = forge.ed25519 = forge.ed25519 || {};var ed25519 = forge.ed25519;ed25519.constants = {};ed25519.constants.PUBLIC_KEY_BYTE_LENGTH = 32;ed25519.constants.PRIVATE_KEY_BYTE_LENGTH = 64;ed25519.constants.SEED_BYTE_LENGTH = 32;ed25519.constants.SIGN_BYTE_LENGTH = 64;ed25519.constants.HASH_BYTE_LENGTH = 64;ed25519.generateKeyPair = function(options) {options = options || {};var seed = options.seed;if(seed === undefined) {// generate seedseed = forge.random.getBytesSync(ed25519.constants.SEED_BYTE_LENGTH);} else if(typeof seed === 'string') {if(seed.length !== ed25519.constants.SEED_BYTE_LENGTH) {throw new TypeError('"seed" must be ' + ed25519.constants.SEED_BYTE_LENGTH +' bytes in length.');}} else if(!(seed instanceof Uint8Array)) {throw new TypeError('"seed" must be a node.js Buffer, Uint8Array, or a binary string.');}seed = messageToNativeBuffer({message: seed, encoding: 'binary'});var pk = new NativeBuffer(ed25519.constants.PUBLIC_KEY_BYTE_LENGTH);var sk = new NativeBuffer(ed25519.constants.PRIVATE_KEY_BYTE_LENGTH);for(var i = 0; i < 32; ++i) {sk[i] = seed[i];}crypto_sign_keypair(pk, sk);return {publicKey: pk, privateKey: sk};};ed25519.publicKeyFromPrivateKey = function(options) {options = options || {};var privateKey = messageToNativeBuffer({message: options.privateKey, encoding: 'binary'});if(privateKey.length !== ed25519.constants.PRIVATE_KEY_BYTE_LENGTH) {throw new TypeError('"options.privateKey" must have a byte length of ' +ed25519.constants.PRIVATE_KEY_BYTE_LENGTH);}var pk = new NativeBuffer(ed25519.constants.PUBLIC_KEY_BYTE_LENGTH);for(var i = 0; i < pk.length; ++i) {pk[i] = privateKey[32 + i];}return pk;};ed25519.sign = function(options) {options = options || {};var msg = messageToNativeBuffer(options);var privateKey = messageToNativeBuffer({message: options.privateKey,encoding: 'binary'});if(privateKey.length !== ed25519.constants.PRIVATE_KEY_BYTE_LENGTH) {throw new TypeError('"options.privateKey" must have a byte length of ' +ed25519.constants.PRIVATE_KEY_BYTE_LENGTH);}var signedMsg = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH + msg.length);crypto_sign(signedMsg, msg, msg.length, privateKey);var sig = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH);for(var i = 0; i < sig.length; ++i) {sig[i] = signedMsg[i];}return sig;};ed25519.verify = function(options) {options = options || {};var msg = messageToNativeBuffer(options);if(options.signature === undefined) {throw new TypeError('"options.signature" must be a node.js Buffer, a Uint8Array, a forge ' +'ByteBuffer, or a binary string.');}var sig = messageToNativeBuffer({message: options.signature,encoding: 'binary'});if(sig.length !== ed25519.constants.SIGN_BYTE_LENGTH) {throw new TypeError('"options.signature" must have a byte length of ' +ed25519.constants.SIGN_BYTE_LENGTH);}var publicKey = messageToNativeBuffer({message: options.publicKey,encoding: 'binary'});if(publicKey.length !== ed25519.constants.PUBLIC_KEY_BYTE_LENGTH) {throw new TypeError('"options.publicKey" must have a byte length of ' +ed25519.constants.PUBLIC_KEY_BYTE_LENGTH);}var sm = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH + msg.length);var m = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH + msg.length);var i;for(i = 0; i < ed25519.constants.SIGN_BYTE_LENGTH; ++i) {sm[i] = sig[i];}for(i = 0; i < msg.length; ++i) {sm[i + ed25519.constants.SIGN_BYTE_LENGTH] = msg[i];}return (crypto_sign_open(m, sm, sm.length, publicKey) >= 0);};function messageToNativeBuffer(options) {var message = options.message;if(message instanceof Uint8Array) {return message;}var encoding = options.encoding;if(message === undefined) {if(options.md) {// TODO: more rigorous validation that `md` is a MessageDigestmessage = options.md.digest().getBytes();encoding = 'binary';} else {throw new TypeError('"options.message" or "options.md" not specified.');}}if(typeof message === 'string' && !encoding) {throw new TypeError('"options.encoding" must be "binary" or "utf8".');}if(typeof message === 'string') {if(typeof Buffer !== 'undefined') {return Buffer.from(message, encoding);}message = new ByteBuffer(message, encoding);} else if(!(message instanceof ByteBuffer)) {throw new TypeError('"options.message" must be a node.js Buffer, a Uint8Array, a forge ' +'ByteBuffer, or a string with "options.encoding" specifying its ' +'encoding.');}// convert to native buffervar buffer = new NativeBuffer(message.length());for(var i = 0; i < buffer.length; ++i) {buffer[i] = message.at(i);}return buffer;}var gf0 = gf();var gf1 = gf([1]);var D = gf([0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070,0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]);var D2 = gf([0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0,0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]);var X = gf([0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c,0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]);var Y = gf([0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666,0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]);var L = new Float64Array([0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58,0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14,0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x10]);var I = gf([0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43,0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);// TODO: update forge buffer implementation to use `Buffer` or `Uint8Array`,// whichever is available, to improve performancefunction sha512(msg, msgLen) {// Note: `out` and `msg` are NativeBuffervar md = forge.md.sha512.create();var buffer = new ByteBuffer(msg);md.update(buffer.getBytes(msgLen), 'binary');var hash = md.digest().getBytes();if(typeof Buffer !== 'undefined') {return Buffer.from(hash, 'binary');}var out = new NativeBuffer(ed25519.constants.HASH_BYTE_LENGTH);for(var i = 0; i < 64; ++i) {out[i] = hash.charCodeAt(i);}return out;}function crypto_sign_keypair(pk, sk) {var p = [gf(), gf(), gf(), gf()];var i;var d = sha512(sk, 32);d[0] &= 248;d[31] &= 127;d[31] |= 64;scalarbase(p, d);pack(pk, p);for(i = 0; i < 32; ++i) {sk[i + 32] = pk[i];}return 0;}// Note: difference from C - smlen returned, not passed as argument.function crypto_sign(sm, m, n, sk) {var i, j, x = new Float64Array(64);var p = [gf(), gf(), gf(), gf()];var d = sha512(sk, 32);d[0] &= 248;d[31] &= 127;d[31] |= 64;var smlen = n + 64;for(i = 0; i < n; ++i) {sm[64 + i] = m[i];}for(i = 0; i < 32; ++i) {sm[32 + i] = d[32 + i];}var r = sha512(sm.subarray(32), n + 32);reduce(r);scalarbase(p, r);pack(sm, p);for(i = 32; i < 64; ++i) {sm[i] = sk[i];}var h = sha512(sm, n + 64);reduce(h);for(i = 32; i < 64; ++i) {x[i] = 0;}for(i = 0; i < 32; ++i) {x[i] = r[i];}for(i = 0; i < 32; ++i) {for(j = 0; j < 32; j++) {x[i + j] += h[i] * d[j];}}modL(sm.subarray(32), x);return smlen;}function crypto_sign_open(m, sm, n, pk) {var i, mlen;var t = new NativeBuffer(32);var p = [gf(), gf(), gf(), gf()],q = [gf(), gf(), gf(), gf()];mlen = -1;if(n < 64) {return -1;}if(unpackneg(q, pk)) {return -1;}for(i = 0; i < n; ++i) {m[i] = sm[i];}for(i = 0; i < 32; ++i) {m[i + 32] = pk[i];}var h = sha512(m, n);reduce(h);scalarmult(p, q, h);scalarbase(q, sm.subarray(32));add(p, q);pack(t, p);n -= 64;if(crypto_verify_32(sm, 0, t, 0)) {for(i = 0; i < n; ++i) {m[i] = 0;}return -1;}for(i = 0; i < n; ++i) {m[i] = sm[i + 64];}mlen = n;return mlen;}function modL(r, x) {var carry, i, j, k;for(i = 63; i >= 32; --i) {carry = 0;for(j = i - 32, k = i - 12; j < k; ++j) {x[j] += carry - 16 * x[i] * L[j - (i - 32)];carry = (x[j] + 128) >> 8;x[j] -= carry * 256;}x[j] += carry;x[i] = 0;}carry = 0;for(j = 0; j < 32; ++j) {x[j] += carry - (x[31] >> 4) * L[j];carry = x[j] >> 8;x[j] &= 255;}for(j = 0; j < 32; ++j) {x[j] -= carry * L[j];}for(i = 0; i < 32; ++i) {x[i + 1] += x[i] >> 8;r[i] = x[i] & 255;}}function reduce(r) {var x = new Float64Array(64);for(var i = 0; i < 64; ++i) {x[i] = r[i];r[i] = 0;}modL(r, x);}function add(p, q) {var a = gf(), b = gf(), c = gf(),d = gf(), e = gf(), f = gf(),g = gf(), h = gf(), t = gf();Z(a, p[1], p[0]);Z(t, q[1], q[0]);M(a, a, t);A(b, p[0], p[1]);A(t, q[0], q[1]);M(b, b, t);M(c, p[3], q[3]);M(c, c, D2);M(d, p[2], q[2]);A(d, d, d);Z(e, b, a);Z(f, d, c);A(g, d, c);A(h, b, a);M(p[0], e, f);M(p[1], h, g);M(p[2], g, f);M(p[3], e, h);}function cswap(p, q, b) {for(var i = 0; i < 4; ++i) {sel25519(p[i], q[i], b);}}function pack(r, p) {var tx = gf(), ty = gf(), zi = gf();inv25519(zi, p[2]);M(tx, p[0], zi);M(ty, p[1], zi);pack25519(r, ty);r[31] ^= par25519(tx) << 7;}function pack25519(o, n) {var i, j, b;var m = gf(), t = gf();for(i = 0; i < 16; ++i) {t[i] = n[i];}car25519(t);car25519(t);car25519(t);for(j = 0; j < 2; ++j) {m[0] = t[0] - 0xffed;for(i = 1; i < 15; ++i) {m[i] = t[i] - 0xffff - ((m[i - 1] >> 16) & 1);m[i-1] &= 0xffff;}m[15] = t[15] - 0x7fff - ((m[14] >> 16) & 1);b = (m[15] >> 16) & 1;m[14] &= 0xffff;sel25519(t, m, 1 - b);}for (i = 0; i < 16; i++) {o[2 * i] = t[i] & 0xff;o[2 * i + 1] = t[i] >> 8;}}function unpackneg(r, p) {var t = gf(), chk = gf(), num = gf(),den = gf(), den2 = gf(), den4 = gf(),den6 = gf();set25519(r[2], gf1);unpack25519(r[1], p);S(num, r[1]);M(den, num, D);Z(num, num, r[2]);A(den, r[2], den);S(den2, den);S(den4, den2);M(den6, den4, den2);M(t, den6, num);M(t, t, den);pow2523(t, t);M(t, t, num);M(t, t, den);M(t, t, den);M(r[0], t, den);S(chk, r[0]);M(chk, chk, den);if(neq25519(chk, num)) {M(r[0], r[0], I);}S(chk, r[0]);M(chk, chk, den);if(neq25519(chk, num)) {return -1;}if(par25519(r[0]) === (p[31] >> 7)) {Z(r[0], gf0, r[0]);}M(r[3], r[0], r[1]);return 0;}function unpack25519(o, n) {var i;for(i = 0; i < 16; ++i) {o[i] = n[2 * i] + (n[2 * i + 1] << 8);}o[15] &= 0x7fff;}function pow2523(o, i) {var c = gf();var a;for(a = 0; a < 16; ++a) {c[a] = i[a];}for(a = 250; a >= 0; --a) {S(c, c);if(a !== 1) {M(c, c, i);}}for(a = 0; a < 16; ++a) {o[a] = c[a];}}function neq25519(a, b) {var c = new NativeBuffer(32);var d = new NativeBuffer(32);pack25519(c, a);pack25519(d, b);return crypto_verify_32(c, 0, d, 0);}function crypto_verify_32(x, xi, y, yi) {return vn(x, xi, y, yi, 32);}function vn(x, xi, y, yi, n) {var i, d = 0;for(i = 0; i < n; ++i) {d |= x[xi + i] ^ y[yi + i];}return (1 & ((d - 1) >>> 8)) - 1;}function par25519(a) {var d = new NativeBuffer(32);pack25519(d, a);return d[0] & 1;}function scalarmult(p, q, s) {var b, i;set25519(p[0], gf0);set25519(p[1], gf1);set25519(p[2], gf1);set25519(p[3], gf0);for(i = 255; i >= 0; --i) {b = (s[(i / 8)|0] >> (i & 7)) & 1;cswap(p, q, b);add(q, p);add(p, p);cswap(p, q, b);}}function scalarbase(p, s) {var q = [gf(), gf(), gf(), gf()];set25519(q[0], X);set25519(q[1], Y);set25519(q[2], gf1);M(q[3], X, Y);scalarmult(p, q, s);}function set25519(r, a) {var i;for(i = 0; i < 16; i++) {r[i] = a[i] | 0;}}function inv25519(o, i) {var c = gf();var a;for(a = 0; a < 16; ++a) {c[a] = i[a];}for(a = 253; a >= 0; --a) {S(c, c);if(a !== 2 && a !== 4) {M(c, c, i);}}for(a = 0; a < 16; ++a) {o[a] = c[a];}}function car25519(o) {var i, v, c = 1;for(i = 0; i < 16; ++i) {v = o[i] + c + 65535;c = Math.floor(v / 65536);o[i] = v - c * 65536;}o[0] += c - 1 + 37 * (c - 1);}function sel25519(p, q, b) {var t, c = ~(b - 1);for(var i = 0; i < 16; ++i) {t = c & (p[i] ^ q[i]);p[i] ^= t;q[i] ^= t;}}function gf(init) {var i, r = new Float64Array(16);if(init) {for(i = 0; i < init.length; ++i) {r[i] = init[i];}}return r;}function A(o, a, b) {for(var i = 0; i < 16; ++i) {o[i] = a[i] + b[i];}}function Z(o, a, b) {for(var i = 0; i < 16; ++i) {o[i] = a[i] - b[i];}}function S(o, a) {M(o, a, a);}function M(o, a, b) {var v, c,t0 = 0,  t1 = 0,  t2 = 0,  t3 = 0,  t4 = 0,  t5 = 0,  t6 = 0,  t7 = 0,t8 = 0,  t9 = 0, t10 = 0, t11 = 0, t12 = 0, t13 = 0, t14 = 0, t15 = 0,t16 = 0, t17 = 0, t18 = 0, t19 = 0, t20 = 0, t21 = 0, t22 = 0, t23 = 0,t24 = 0, t25 = 0, t26 = 0, t27 = 0, t28 = 0, t29 = 0, t30 = 0,b0 = b[0],b1 = b[1],b2 = b[2],b3 = b[3],b4 = b[4],b5 = b[5],b6 = b[6],b7 = b[7],b8 = b[8],b9 = b[9],b10 = b[10],b11 = b[11],b12 = b[12],b13 = b[13],b14 = b[14],b15 = b[15];v = a[0];t0 += v * b0;t1 += v * b1;t2 += v * b2;t3 += v * b3;t4 += v * b4;t5 += v * b5;t6 += v * b6;t7 += v * b7;t8 += v * b8;t9 += v * b9;t10 += v * b10;t11 += v * b11;t12 += v * b12;t13 += v * b13;t14 += v * b14;t15 += v * b15;v = a[1];t1 += v * b0;t2 += v * b1;t3 += v * b2;t4 += v * b3;t5 += v * b4;t6 += v * b5;t7 += v * b6;t8 += v * b7;t9 += v * b8;t10 += v * b9;t11 += v * b10;t12 += v * b11;t13 += v * b12;t14 += v * b13;t15 += v * b14;t16 += v * b15;v = a[2];t2 += v * b0;t3 += v * b1;t4 += v * b2;t5 += v * b3;t6 += v * b4;t7 += v * b5;t8 += v * b6;t9 += v * b7;t10 += v * b8;t11 += v * b9;t12 += v * b10;t13 += v * b11;t14 += v * b12;t15 += v * b13;t16 += v * b14;t17 += v * b15;v = a[3];t3 += v * b0;t4 += v * b1;t5 += v * b2;t6 += v * b3;t7 += v * b4;t8 += v * b5;t9 += v * b6;t10 += v * b7;t11 += v * b8;t12 += v * b9;t13 += v * b10;t14 += v * b11;t15 += v * b12;t16 += v * b13;t17 += v * b14;t18 += v * b15;v = a[4];t4 += v * b0;t5 += v * b1;t6 += v * b2;t7 += v * b3;t8 += v * b4;t9 += v * b5;t10 += v * b6;t11 += v * b7;t12 += v * b8;t13 += v * b9;t14 += v * b10;t15 += v * b11;t16 += v * b12;t17 += v * b13;t18 += v * b14;t19 += v * b15;v = a[5];t5 += v * b0;t6 += v * b1;t7 += v * b2;t8 += v * b3;t9 += v * b4;t10 += v * b5;t11 += v * b6;t12 += v * b7;t13 += v * b8;t14 += v * b9;t15 += v * b10;t16 += v * b11;t17 += v * b12;t18 += v * b13;t19 += v * b14;t20 += v * b15;v = a[6];t6 += v * b0;t7 += v * b1;t8 += v * b2;t9 += v * b3;t10 += v * b4;t11 += v * b5;t12 += v * b6;t13 += v * b7;t14 += v * b8;t15 += v * b9;t16 += v * b10;t17 += v * b11;t18 += v * b12;t19 += v * b13;t20 += v * b14;t21 += v * b15;v = a[7];t7 += v * b0;t8 += v * b1;t9 += v * b2;t10 += v * b3;t11 += v * b4;t12 += v * b5;t13 += v * b6;t14 += v * b7;t15 += v * b8;t16 += v * b9;t17 += v * b10;t18 += v * b11;t19 += v * b12;t20 += v * b13;t21 += v * b14;t22 += v * b15;v = a[8];t8 += v * b0;t9 += v * b1;t10 += v * b2;t11 += v * b3;t12 += v * b4;t13 += v * b5;t14 += v * b6;t15 += v * b7;t16 += v * b8;t17 += v * b9;t18 += v * b10;t19 += v * b11;t20 += v * b12;t21 += v * b13;t22 += v * b14;t23 += v * b15;v = a[9];t9 += v * b0;t10 += v * b1;t11 += v * b2;t12 += v * b3;t13 += v * b4;t14 += v * b5;t15 += v * b6;t16 += v * b7;t17 += v * b8;t18 += v * b9;t19 += v * b10;t20 += v * b11;t21 += v * b12;t22 += v * b13;t23 += v * b14;t24 += v * b15;v = a[10];t10 += v * b0;t11 += v * b1;t12 += v * b2;t13 += v * b3;t14 += v * b4;t15 += v * b5;t16 += v * b6;t17 += v * b7;t18 += v * b8;t19 += v * b9;t20 += v * b10;t21 += v * b11;t22 += v * b12;t23 += v * b13;t24 += v * b14;t25 += v * b15;v = a[11];t11 += v * b0;t12 += v * b1;t13 += v * b2;t14 += v * b3;t15 += v * b4;t16 += v * b5;t17 += v * b6;t18 += v * b7;t19 += v * b8;t20 += v * b9;t21 += v * b10;t22 += v * b11;t23 += v * b12;t24 += v * b13;t25 += v * b14;t26 += v * b15;v = a[12];t12 += v * b0;t13 += v * b1;t14 += v * b2;t15 += v * b3;t16 += v * b4;t17 += v * b5;t18 += v * b6;t19 += v * b7;t20 += v * b8;t21 += v * b9;t22 += v * b10;t23 += v * b11;t24 += v * b12;t25 += v * b13;t26 += v * b14;t27 += v * b15;v = a[13];t13 += v * b0;t14 += v * b1;t15 += v * b2;t16 += v * b3;t17 += v * b4;t18 += v * b5;t19 += v * b6;t20 += v * b7;t21 += v * b8;t22 += v * b9;t23 += v * b10;t24 += v * b11;t25 += v * b12;t26 += v * b13;t27 += v * b14;t28 += v * b15;v = a[14];t14 += v * b0;t15 += v * b1;t16 += v * b2;t17 += v * b3;t18 += v * b4;t19 += v * b5;t20 += v * b6;t21 += v * b7;t22 += v * b8;t23 += v * b9;t24 += v * b10;t25 += v * b11;t26 += v * b12;t27 += v * b13;t28 += v * b14;t29 += v * b15;v = a[15];t15 += v * b0;t16 += v * b1;t17 += v * b2;t18 += v * b3;t19 += v * b4;t20 += v * b5;t21 += v * b6;t22 += v * b7;t23 += v * b8;t24 += v * b9;t25 += v * b10;t26 += v * b11;t27 += v * b12;t28 += v * b13;t29 += v * b14;t30 += v * b15;t0  += 38 * t16;t1  += 38 * t17;t2  += 38 * t18;t3  += 38 * t19;t4  += 38 * t20;t5  += 38 * t21;t6  += 38 * t22;t7  += 38 * t23;t8  += 38 * t24;t9  += 38 * t25;t10 += 38 * t26;t11 += 38 * t27;t12 += 38 * t28;t13 += 38 * t29;t14 += 38 * t30;// t15 left as is// first carc = 1;v =  t0 + c + 65535; c = Math.floor(v / 65536);  t0 = v - c * 65536;v =  t1 + c + 65535; c = Math.floor(v / 65536);  t1 = v - c * 65536;v =  t2 + c + 65535; c = Math.floor(v / 65536);  t2 = v - c * 65536;v =  t3 + c + 65535; c = Math.floor(v / 65536);  t3 = v - c * 65536;v =  t4 + c + 65535; c = Math.floor(v / 65536);  t4 = v - c * 65536;v =  t5 + c + 65535; c = Math.floor(v / 65536);  t5 = v - c * 65536;v =  t6 + c + 65535; c = Math.floor(v / 65536);  t6 = v - c * 65536;v =  t7 + c + 65535; c = Math.floor(v / 65536);  t7 = v - c * 65536;v =  t8 + c + 65535; c = Math.floor(v / 65536);  t8 = v - c * 65536;v =  t9 + c + 65535; c = Math.floor(v / 65536);  t9 = v - c * 65536;v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;t0 += c-1 + 37 * (c-1);// second carc = 1;v =  t0 + c + 65535; c = Math.floor(v / 65536);  t0 = v - c * 65536;v =  t1 + c + 65535; c = Math.floor(v / 65536);  t1 = v - c * 65536;v =  t2 + c + 65535; c = Math.floor(v / 65536);  t2 = v - c * 65536;v =  t3 + c + 65535; c = Math.floor(v / 65536);  t3 = v - c * 65536;v =  t4 + c + 65535; c = Math.floor(v / 65536);  t4 = v - c * 65536;v =  t5 + c + 65535; c = Math.floor(v / 65536);  t5 = v - c * 65536;v =  t6 + c + 65535; c = Math.floor(v / 65536);  t6 = v - c * 65536;v =  t7 + c + 65535; c = Math.floor(v / 65536);  t7 = v - c * 65536;v =  t8 + c + 65535; c = Math.floor(v / 65536);  t8 = v - c * 65536;v =  t9 + c + 65535; c = Math.floor(v / 65536);  t9 = v - c * 65536;v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;t0 += c-1 + 37 * (c-1);o[ 0] = t0;o[ 1] = t1;o[ 2] = t2;o[ 3] = t3;o[ 4] = t4;o[ 5] = t5;o[ 6] = t6;o[ 7] = t7;o[ 8] = t8;o[ 9] = t9;o[10] = t10;o[11] = t11;o[12] = t12;o[13] = t13;o[14] = t14;o[15] = t15;}/***/ }),/***/ 7009:/***/ ((module) => {/*** Node.js module for Forge.** @author Dave Longley** Copyright 2011-2016 Digital Bazaar, Inc.*/module.exports = {// default optionsoptions: {usePureJavaScript: false}};/***/ }),/***/ 6080:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Hash-based Message Authentication Code implementation. Requires a message* digest object that can be obtained, for example, from forge.md.sha1 or* forge.md.md5.** @author Dave Longley** Copyright (c) 2010-2012 Digital Bazaar, Inc. All rights reserved.*/var forge = __webpack_require__(7009);__webpack_require__(3605);__webpack_require__(2365);/* HMAC API */var hmac = module.exports = forge.hmac = forge.hmac || {};/*** Creates an HMAC object that uses the given message digest object.** @return an HMAC object.*/hmac.create = function() {// the hmac key to usevar _key = null;// the message digest to usevar _md = null;// the inner paddingvar _ipadding = null;// the outer paddingvar _opadding = null;// hmac contextvar ctx = {};/*** Starts or restarts the HMAC with the given key and message digest.** @param md the message digest to use, null to reuse the previous one,*           a string to use builtin 'sha1', 'md5', 'sha256'.* @param key the key to use as a string, array of bytes, byte buffer,*           or null to reuse the previous key.*/ctx.start = function(md, key) {if(md !== null) {if(typeof md === 'string') {// create builtin message digestmd = md.toLowerCase();if(md in forge.md.algorithms) {_md = forge.md.algorithms[md].create();} else {throw new Error('Unknown hash algorithm "' + md + '"');}} else {// store message digest_md = md;}}if(key === null) {// reuse previous keykey = _key;} else {if(typeof key === 'string') {// convert string into byte bufferkey = forge.util.createBuffer(key);} else if(forge.util.isArray(key)) {// convert byte array into byte buffervar tmp = key;key = forge.util.createBuffer();for(var i = 0; i < tmp.length; ++i) {key.putByte(tmp[i]);}}// if key is longer than blocksize, hash itvar keylen = key.length();if(keylen > _md.blockLength) {_md.start();_md.update(key.bytes());key = _md.digest();}// mix key into inner and outer padding// ipadding = [0x36 * blocksize] ^ key// opadding = [0x5C * blocksize] ^ key_ipadding = forge.util.createBuffer();_opadding = forge.util.createBuffer();keylen = key.length();for(var i = 0; i < keylen; ++i) {var tmp = key.at(i);_ipadding.putByte(0x36 ^ tmp);_opadding.putByte(0x5C ^ tmp);}// if key is shorter than blocksize, add additional paddingif(keylen < _md.blockLength) {var tmp = _md.blockLength - keylen;for(var i = 0; i < tmp; ++i) {_ipadding.putByte(0x36);_opadding.putByte(0x5C);}}_key = key;_ipadding = _ipadding.bytes();_opadding = _opadding.bytes();}// digest is done like so: hash(opadding | hash(ipadding | message))// prepare to do inner hash// hash(ipadding | message)_md.start();_md.update(_ipadding);};/*** Updates the HMAC with the given message bytes.** @param bytes the bytes to update with.*/ctx.update = function(bytes) {_md.update(bytes);};/*** Produces the Message Authentication Code (MAC).** @return a byte buffer containing the digest value.*/ctx.getMac = function() {// digest is done like so: hash(opadding | hash(ipadding | message))// here we do the outer hashingvar inner = _md.digest().bytes();_md.start();_md.update(_opadding);_md.update(inner);return _md.digest();};// alias for getMacctx.digest = ctx.getMac;return ctx;};/***/ }),/***/ 1632:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Node.js module for Forge.** @author Dave Longley** Copyright 2011-2016 Digital Bazaar, Inc.*/module.exports = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(3444);__webpack_require__(1598);__webpack_require__(9671);__webpack_require__(5569);__webpack_require__(3436);__webpack_require__(1353);__webpack_require__(6080);__webpack_require__(8517);__webpack_require__(9105);__webpack_require__(3676);__webpack_require__(6439);__webpack_require__(8322);__webpack_require__(2966);__webpack_require__(4188);__webpack_require__(1335);__webpack_require__(939);__webpack_require__(9727);__webpack_require__(4846);__webpack_require__(3858);__webpack_require__(3385);__webpack_require__(6660);__webpack_require__(6994);__webpack_require__(2635);__webpack_require__(7909);__webpack_require__(4545);__webpack_require__(2365);/***/ }),/***/ 8785:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {// Copyright (c) 2005  Tom Wu// All Rights Reserved.// See "LICENSE" for details.// Basic JavaScript BN library - subset useful for RSA encryption./*Licensing (LICENSE)-------------------This software is covered under the following copyright:*//** Copyright (c) 2003-2005  Tom Wu* All Rights Reserved.** 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" AND WITHOUT WARRANTY OF ANY KIND,* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.** IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,* INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER* R###LTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF* THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT* OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.** In addition, the following condition applies:** All redistributions must retain an intact copy of this copyright notice* and disclaimer.*//*Address all questions regarding this license to:Tom Wu[email protected]*/var forge = __webpack_require__(7009);module.exports = forge.jsbn = forge.jsbn || {};// Bits per digitvar dbits;// JavaScript engine analysisvar canary = 0xdeadbeefcafe;var j_lm = ((canary&0xffffff)==0xefcafe);// (public) Constructorfunction BigInteger(a,b,c) {this.data = [];if(a != null)if("number" == typeof a) this.fromNumber(a,b,c);else if(b == null && "string" != typeof a) this.fromString(a,256);else this.fromString(a,b);}forge.jsbn.BigInteger = BigInteger;// return new, unset BigIntegerfunction nbi() { return new BigInteger(null); }// am: Compute w_j += (x*this_i), propagate carries,// c is initial carry, returns final carry.// c < 3*dvalue, x < 2*dvalue, this_i < dvalue// We need to select the fastest one that works in this environment.// am1: use a single mult and divide to get the high bits,// max digit bits should be 26 because// max internal value = 2*dvalue^2-2*dvalue (< 2^53)function am1(i,x,w,j,c,n) {while(--n >= 0) {var v = x*this.data[i++]+w.data[j]+c;c = Math.floor(v/0x4000000);w.data[j++] = v&0x3ffffff;}return c;}// am2 avoids a big mult-and-extract completely.// Max digit bits should be <= 30 because we do bitwise ops// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)function am2(i,x,w,j,c,n) {var xl = x&0x7fff, xh = x>>15;while(--n >= 0) {var l = this.data[i]&0x7fff;var h = this.data[i++]>>15;var m = xh*l+h*xl;l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);w.data[j++] = l&0x3fffffff;}return c;}// Alternately, set max digit bits to 28 since some// browsers slow down when dealing with 32-bit numbers.function am3(i,x,w,j,c,n) {var xl = x&0x3fff, xh = x>>14;while(--n >= 0) {var l = this.data[i]&0x3fff;var h = this.data[i++]>>14;var m = xh*l+h*xl;l = xl*l+((m&0x3fff)<<14)+w.data[j]+c;c = (l>>28)+(m>>14)+xh*h;w.data[j++] = l&0xfffffff;}return c;}// node.js (no browser)if(typeof(navigator) === 'undefined'){BigInteger.prototype.am = am3;dbits = 28;} else if(j_lm && (navigator.appName == "Microsoft Internet Explorer")) {BigInteger.prototype.am = am2;dbits = 30;} else if(j_lm && (navigator.appName != "Netscape")) {BigInteger.prototype.am = am1;dbits = 26;} else { // Mozilla/Netscape seems to prefer am3BigInteger.prototype.am = am3;dbits = 28;}BigInteger.prototype.DB = dbits;BigInteger.prototype.DM = ((1<<dbits)-1);BigInteger.prototype.DV = (1<<dbits);var BI_FP = 52;BigInteger.prototype.FV = Math.pow(2,BI_FP);BigInteger.prototype.F1 = BI_FP-dbits;BigInteger.prototype.F2 = 2*dbits-BI_FP;// Digit conversionsvar BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";var BI_RC = new Array();var rr,vv;rr = "0".charCodeAt(0);for(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;rr = "a".charCodeAt(0);for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;rr = "A".charCodeAt(0);for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;function int2char(n) { return BI_RM.charAt(n); }function intAt(s,i) {var c = BI_RC[s.charCodeAt(i)];return (c==null)?-1:c;}// (protected) copy this to rfunction bnpCopyTo(r) {for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];r.t = this.t;r.s = this.s;}// (protected) set from integer value x, -DV <= x < DVfunction bnpFromInt(x) {this.t = 1;this.s = (x<0)?-1:0;if(x > 0) this.data[0] = x;else if(x < -1) this.data[0] = x+this.DV;else this.t = 0;}// return bigint initialized to valuefunction nbv(i) { var r = nbi(); r.fromInt(i); return r; }// (protected) set from string and radixfunction bnpFromString(s,b) {var k;if(b == 16) k = 4;else if(b == 8) k = 3;else if(b == 256) k = 8; // byte arrayelse if(b == 2) k = 1;else if(b == 32) k = 5;else if(b == 4) k = 2;else { this.fromRadix(s,b); return; }this.t = 0;this.s = 0;var i = s.length, mi = false, sh = 0;while(--i >= 0) {var x = (k==8)?s[i]&0xff:intAt(s,i);if(x < 0) {if(s.charAt(i) == "-") mi = true;continue;}mi = false;if(sh == 0)this.data[this.t++] = x;else if(sh+k > this.DB) {this.data[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;this.data[this.t++] = (x>>(this.DB-sh));} elsethis.data[this.t-1] |= x<<sh;sh += k;if(sh >= this.DB) sh -= this.DB;}if(k == 8 && (s[0]&0x80) != 0) {this.s = -1;if(sh > 0) this.data[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;}this.clamp();if(mi) BigInteger.ZERO.subTo(this,this);}// (protected) clamp off excess high wordsfunction bnpClamp() {var c = this.s&this.DM;while(this.t > 0 && this.data[this.t-1] == c) --this.t;}// (public) return string representation in given radixfunction bnToString(b) {if(this.s < 0) return "-"+this.negate().toString(b);var k;if(b == 16) k = 4;else if(b == 8) k = 3;else if(b == 2) k = 1;else if(b == 32) k = 5;else if(b == 4) k = 2;else return this.toRadix(b);var km = (1<<k)-1, d, m = false, r = "", i = this.t;var p = this.DB-(i*this.DB)%k;if(i-- > 0) {if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }while(i >= 0) {if(p < k) {d = (this.data[i]&((1<<p)-1))<<(k-p);d |= this.data[--i]>>(p+=this.DB-k);} else {d = (this.data[i]>>(p-=k))&km;if(p <= 0) { p += this.DB; --i; }}if(d > 0) m = true;if(m) r += int2char(d);}}return m?r:"0";}// (public) -thisfunction bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }// (public) |this|function bnAbs() { return (this.s<0)?this.negate():this; }// (public) return + if this > a, - if this < a, 0 if equalfunction bnCompareTo(a) {var r = this.s-a.s;if(r != 0) return r;var i = this.t;r = i-a.t;if(r != 0) return (this.s<0)?-r:r;while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;return 0;}// returns bit length of the integer xfunction nbits(x) {var r = 1, t;if((t=x>>>16) != 0) { x = t; r += 16; }if((t=x>>8) != 0) { x = t; r += 8; }if((t=x>>4) != 0) { x = t; r += 4; }if((t=x>>2) != 0) { x = t; r += 2; }if((t=x>>1) != 0) { x = t; r += 1; }return r;}// (public) return the number of bits in "this"function bnBitLength() {if(this.t <= 0) return 0;return this.DB*(this.t-1)+nbits(this.data[this.t-1]^(this.s&this.DM));}// (protected) r = this << n*DBfunction bnpDLShiftTo(n,r) {var i;for(i = this.t-1; i >= 0; --i) r.data[i+n] = this.data[i];for(i = n-1; i >= 0; --i) r.data[i] = 0;r.t = this.t+n;r.s = this.s;}// (protected) r = this >> n*DBfunction bnpDRShiftTo(n,r) {for(var i = n; i < this.t; ++i) r.data[i-n] = this.data[i];r.t = Math.max(this.t-n,0);r.s = this.s;}// (protected) r = this << nfunction bnpLShiftTo(n,r) {var bs = n%this.DB;var cbs = this.DB-bs;var bm = (1<<cbs)-1;var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;for(i = this.t-1; i >= 0; --i) {r.data[i+ds+1] = (this.data[i]>>cbs)|c;c = (this.data[i]&bm)<<bs;}for(i = ds-1; i >= 0; --i) r.data[i] = 0;r.data[ds] = c;r.t = this.t+ds+1;r.s = this.s;r.clamp();}// (protected) r = this >> nfunction bnpRShiftTo(n,r) {r.s = this.s;var ds = Math.floor(n/this.DB);if(ds >= this.t) { r.t = 0; return; }var bs = n%this.DB;var cbs = this.DB-bs;var bm = (1<<bs)-1;r.data[0] = this.data[ds]>>bs;for(var i = ds+1; i < this.t; ++i) {r.data[i-ds-1] |= (this.data[i]&bm)<<cbs;r.data[i-ds] = this.data[i]>>bs;}if(bs > 0) r.data[this.t-ds-1] |= (this.s&bm)<<cbs;r.t = this.t-ds;r.clamp();}// (protected) r = this - afunction bnpSubTo(a,r) {var i = 0, c = 0, m = Math.min(a.t,this.t);while(i < m) {c += this.data[i]-a.data[i];r.data[i++] = c&this.DM;c >>= this.DB;}if(a.t < this.t) {c -= a.s;while(i < this.t) {c += this.data[i];r.data[i++] = c&this.DM;c >>= this.DB;}c += this.s;} else {c += this.s;while(i < a.t) {c -= a.data[i];r.data[i++] = c&this.DM;c >>= this.DB;}c -= a.s;}r.s = (c<0)?-1:0;if(c < -1) r.data[i++] = this.DV+c;else if(c > 0) r.data[i++] = c;r.t = i;r.clamp();}// (protected) r = this * a, r != this,a (HAC 14.12)// "this" should be the larger one if appropriate.function bnpMultiplyTo(a,r) {var x = this.abs(), y = a.abs();var i = x.t;r.t = i+y.t;while(--i >= 0) r.data[i] = 0;for(i = 0; i < y.t; ++i) r.data[i+x.t] = x.am(0,y.data[i],r,i,0,x.t);r.s = 0;r.clamp();if(this.s != a.s) BigInteger.ZERO.subTo(r,r);}// (protected) r = this^2, r != this (HAC 14.16)function bnpSquareTo(r) {var x = this.abs();var i = r.t = 2*x.t;while(--i >= 0) r.data[i] = 0;for(i = 0; i < x.t-1; ++i) {var c = x.am(i,x.data[i],r,2*i,0,1);if((r.data[i+x.t]+=x.am(i+1,2*x.data[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {r.data[i+x.t] -= x.DV;r.data[i+x.t+1] = 1;}}if(r.t > 0) r.data[r.t-1] += x.am(i,x.data[i],r,2*i,0,1);r.s = 0;r.clamp();}// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)// r != q, this != m.  q or r may be null.function bnpDivRemTo(m,q,r) {var pm = m.abs();if(pm.t <= 0) return;var pt = this.abs();if(pt.t < pm.t) {if(q != null) q.fromInt(0);if(r != null) this.copyTo(r);return;}if(r == null) r = nbi();var y = nbi(), ts = this.s, ms = m.s;var nsh = this.DB-nbits(pm.data[pm.t-1]);	// normalize modulusif(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); } else { pm.copyTo(y); pt.copyTo(r); }var ys = y.t;var y0 = y.data[ys-1];if(y0 == 0) return;var yt = y0*(1<<this.F1)+((ys>1)?y.data[ys-2]>>this.F2:0);var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;var i = r.t, j = i-ys, t = (q==null)?nbi():q;y.dlShiftTo(j,t);if(r.compareTo(t) >= 0) {r.data[r.t++] = 1;r.subTo(t,r);}BigInteger.ONE.dlShiftTo(ys,t);t.subTo(y,y);	// "negative" y so we can replace sub with am laterwhile(y.t < ys) y.data[y.t++] = 0;while(--j >= 0) {// Estimate quotient digitvar qd = (r.data[--i]==y0)?this.DM:Math.floor(r.data[i]*d1+(r.data[i-1]+e)*d2);if((r.data[i]+=y.am(0,qd,r,j,0,ys)) < qd) {	// Try it outy.dlShiftTo(j,t);r.subTo(t,r);while(r.data[i] < --qd) r.subTo(t,r);}}if(q != null) {r.drShiftTo(ys,q);if(ts != ms) BigInteger.ZERO.subTo(q,q);}r.t = ys;r.clamp();if(nsh > 0) r.rShiftTo(nsh,r);	// Denormalize remainderif(ts < 0) BigInteger.ZERO.subTo(r,r);}// (public) this mod afunction bnMod(a) {var r = nbi();this.abs().divRemTo(a,null,r);if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);return r;}// Modular reduction using "classic" algorithmfunction Classic(m) { this.m = m; }function cConvert(x) {if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);else return x;}function cRevert(x) { return x; }function cReduce(x) { x.divRemTo(this.m,null,x); }function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }Classic.prototype.convert = cConvert;Classic.prototype.revert = cRevert;Classic.prototype.reduce = cReduce;Classic.prototype.mulTo = cMulTo;Classic.prototype.sqrTo = cSqrTo;// (protected) return "-1/this % 2^DB"; useful for Mont. reduction// justification://         xy == 1 (mod m)//         xy =  1+km//   xy(2-xy) = (1+km)(1-km)// x[y(2-xy)] = 1-k^2m^2// x[y(2-xy)] == 1 (mod m^2)// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.// JS multiply "overflows" differently from C/C++, so care is needed here.function bnpInvDigit() {if(this.t < 1) return 0;var x = this.data[0];if((x&1) == 0) return 0;var y = x&3;		// y == 1/x mod 2^2y = (y*(2-(x&0xf)*y))&0xf;	// y == 1/x mod 2^4y = (y*(2-(x&0xff)*y))&0xff;	// y == 1/x mod 2^8y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;	// y == 1/x mod 2^16// last step - calculate inverse mod DV directly;// assumes 16 < DB <= 32 and assumes ability to handle 48-bit intsy = (y*(2-x*y%this.DV))%this.DV;		// y == 1/x mod 2^dbits// we really want the negative inverse, and -DV < y < DVreturn (y>0)?this.DV-y:-y;}// Montgomery reductionfunction Montgomery(m) {this.m = m;this.mp = m.invDigit();this.mpl = this.mp&0x7fff;this.mph = this.mp>>15;this.um = (1<<(m.DB-15))-1;this.mt2 = 2*m.t;}// xR mod mfunction montConvert(x) {var r = nbi();x.abs().dlShiftTo(this.m.t,r);r.divRemTo(this.m,null,r);if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);return r;}// x/R mod mfunction montRevert(x) {var r = nbi();x.copyTo(r);this.reduce(r);return r;}// x = x/R mod m (HAC 14.32)function montReduce(x) {while(x.t <= this.mt2)	// pad x so am has enough room laterx.data[x.t++] = 0;for(var i = 0; i < this.m.t; ++i) {// faster way of calculating u0 = x.data[i]*mp mod DVvar j = x.data[i]&0x7fff;var u0 = (j*this.mpl+(((j*this.mph+(x.data[i]>>15)*this.mpl)&this.um)<<15))&x.DM;// use am to combine the multiply-shift-add into one callj = i+this.m.t;x.data[j] += this.m.am(0,u0,x,i,0,this.m.t);// propagate carrywhile(x.data[j] >= x.DV) { x.data[j] -= x.DV; x.data[++j]++; }}x.clamp();x.drShiftTo(this.m.t,x);if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);}// r = "x^2/R mod m"; x != rfunction montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }// r = "xy/R mod m"; x,y != rfunction montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }Montgomery.prototype.convert = montConvert;Montgomery.prototype.revert = montRevert;Montgomery.prototype.reduce = montReduce;Montgomery.prototype.mulTo = montMulTo;Montgomery.prototype.sqrTo = montSqrTo;// (protected) true iff this is evenfunction bnpIsEven() { return ((this.t>0)?(this.data[0]&1):this.s) == 0; }// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)function bnpExp(e,z) {if(e > 0xffffffff || e < 1) return BigInteger.ONE;var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;g.copyTo(r);while(--i >= 0) {z.sqrTo(r,r2);if((e&(1<<i)) > 0) z.mulTo(r2,g,r);else { var t = r; r = r2; r2 = t; }}return z.revert(r);}// (public) this^e % m, 0 <= e < 2^32function bnModPowInt(e,m) {var z;if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);return this.exp(e,z);}// protectedBigInteger.prototype.copyTo = bnpCopyTo;BigInteger.prototype.fromInt = bnpFromInt;BigInteger.prototype.fromString = bnpFromString;BigInteger.prototype.clamp = bnpClamp;BigInteger.prototype.dlShiftTo = bnpDLShiftTo;BigInteger.prototype.drShiftTo = bnpDRShiftTo;BigInteger.prototype.lShiftTo = bnpLShiftTo;BigInteger.prototype.rShiftTo = bnpRShiftTo;BigInteger.prototype.subTo = bnpSubTo;BigInteger.prototype.multiplyTo = bnpMultiplyTo;BigInteger.prototype.squareTo = bnpSquareTo;BigInteger.prototype.divRemTo = bnpDivRemTo;BigInteger.prototype.invDigit = bnpInvDigit;BigInteger.prototype.isEven = bnpIsEven;BigInteger.prototype.exp = bnpExp;// publicBigInteger.prototype.toString = bnToString;BigInteger.prototype.negate = bnNegate;BigInteger.prototype.abs = bnAbs;BigInteger.prototype.compareTo = bnCompareTo;BigInteger.prototype.bitLength = bnBitLength;BigInteger.prototype.mod = bnMod;BigInteger.prototype.modPowInt = bnModPowInt;// "constants"BigInteger.ZERO = nbv(0);BigInteger.ONE = nbv(1);// jsbn2 lib//Copyright (c) 2005-2009  Tom Wu//All Rights Reserved.//See "LICENSE" for details (See jsbn.js for LICENSE).//Extended JavaScript BN functions, required for RSA private ops.//Version 1.1: new BigInteger("0", 10) returns "proper" zero//(public)function bnClone() { var r = nbi(); this.copyTo(r); return r; }//(public) return value as integerfunction bnIntValue() {if(this.s < 0) {if(this.t == 1) return this.data[0]-this.DV;else if(this.t == 0) return -1;} else if(this.t == 1) return this.data[0];else if(this.t == 0) return 0;// assumes 16 < DB < 32return ((this.data[1]&((1<<(32-this.DB))-1))<<this.DB)|this.data[0];}//(public) return value as bytefunction bnByteValue() { return (this.t==0)?this.s:(this.data[0]<<24)>>24; }//(public) return value as short (assumes DB>=16)function bnShortValue() { return (this.t==0)?this.s:(this.data[0]<<16)>>16; }//(protected) return x s.t. r^x < DVfunction bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }//(public) 0 if this == 0, 1 if this > 0function bnSigNum() {if(this.s < 0) return -1;else if(this.t <= 0 || (this.t == 1 && this.data[0] <= 0)) return 0;else return 1;}//(protected) convert to radix stringfunction bnpToRadix(b) {if(b == null) b = 10;if(this.signum() == 0 || b < 2 || b > 36) return "0";var cs = this.chunkSize(b);var a = Math.pow(b,cs);var d = nbv(a), y = nbi(), z = nbi(), r = "";this.divRemTo(d,y,z);while(y.signum() > 0) {r = (a+z.intValue()).toString(b).substr(1) + r;y.divRemTo(d,y,z);}return z.intValue().toString(b) + r;}//(protected) convert from radix stringfunction bnpFromRadix(s,b) {this.fromInt(0);if(b == null) b = 10;var cs = this.chunkSize(b);var d = Math.pow(b,cs), mi = false, j = 0, w = 0;for(var i = 0; i < s.length; ++i) {var x = intAt(s,i);if(x < 0) {if(s.charAt(i) == "-" && this.signum() == 0) mi = true;continue;}w = b*w+x;if(++j >= cs) {this.dMultiply(d);this.dAddOffset(w,0);j = 0;w = 0;}}if(j > 0) {this.dMultiply(Math.pow(b,j));this.dAddOffset(w,0);}if(mi) BigInteger.ZERO.subTo(this,this);}//(protected) alternate constructorfunction bnpFromNumber(a,b,c) {if("number" == typeof b) {// new BigInteger(int,int,RNG)if(a < 2) this.fromInt(1);else {this.fromNumber(a,c);if(!this.testBit(a-1))  // force MSB setthis.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);if(this.isEven()) this.dAddOffset(1,0); // force oddwhile(!this.isProbablePrime(b)) {this.dAddOffset(2,0);if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);}}} else {// new BigInteger(int,RNG)var x = new Array(), t = a&7;x.length = (a>>3)+1;b.nextBytes(x);if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;this.fromString(x,256);}}//(public) convert to bigendian byte arrayfunction bnToByteArray() {var i = this.t, r = new Array();r[0] = this.s;var p = this.DB-(i*this.DB)%8, d, k = 0;if(i-- > 0) {if(p < this.DB && (d = this.data[i]>>p) != (this.s&this.DM)>>p)r[k++] = d|(this.s<<(this.DB-p));while(i >= 0) {if(p < 8) {d = (this.data[i]&((1<<p)-1))<<(8-p);d |= this.data[--i]>>(p+=this.DB-8);} else {d = (this.data[i]>>(p-=8))&0xff;if(p <= 0) { p += this.DB; --i; }}if((d&0x80) != 0) d |= -256;if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;if(k > 0 || d != this.s) r[k++] = d;}}return r;}function bnEquals(a) { return(this.compareTo(a)==0); }function bnMin(a) { return(this.compareTo(a)<0)?this:a; }function bnMax(a) { return(this.compareTo(a)>0)?this:a; }//(protected) r = this op a (bitwise)function bnpBitwiseTo(a,op,r) {var i, f, m = Math.min(a.t,this.t);for(i = 0; i < m; ++i) r.data[i] = op(this.data[i],a.data[i]);if(a.t < this.t) {f = a.s&this.DM;for(i = m; i < this.t; ++i) r.data[i] = op(this.data[i],f);r.t = this.t;} else {f = this.s&this.DM;for(i = m; i < a.t; ++i) r.data[i] = op(f,a.data[i]);r.t = a.t;}r.s = op(this.s,a.s);r.clamp();}//(public) this & afunction op_and(x,y) { return x&y; }function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }//(public) this | afunction op_or(x,y) { return x|y; }function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }//(public) this ^ afunction op_xor(x,y) { return x^y; }function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }//(public) this & ~afunction op_andnot(x,y) { return x&~y; }function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }//(public) ~thisfunction bnNot() {var r = nbi();for(var i = 0; i < this.t; ++i) r.data[i] = this.DM&~this.data[i];r.t = this.t;r.s = ~this.s;return r;}//(public) this << nfunction bnShiftLeft(n) {var r = nbi();if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);return r;}//(public) this >> nfunction bnShiftRight(n) {var r = nbi();if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);return r;}//return index of lowest 1-bit in x, x < 2^31function lbit(x) {if(x == 0) return -1;var r = 0;if((x&0xffff) == 0) { x >>= 16; r += 16; }if((x&0xff) == 0) { x >>= 8; r += 8; }if((x&0xf) == 0) { x >>= 4; r += 4; }if((x&3) == 0) { x >>= 2; r += 2; }if((x&1) == 0) ++r;return r;}//(public) returns index of lowest 1-bit (or -1 if none)function bnGetLowestSetBit() {for(var i = 0; i < this.t; ++i)if(this.data[i] != 0) return i*this.DB+lbit(this.data[i]);if(this.s < 0) return this.t*this.DB;return -1;}//return number of 1 bits in xfunction cbit(x) {var r = 0;while(x != 0) { x &= x-1; ++r; }return r;}//(public) return number of set bitsfunction bnBitCount() {var r = 0, x = this.s&this.DM;for(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);return r;}//(public) true iff nth bit is setfunction bnTestBit(n) {var j = Math.floor(n/this.DB);if(j >= this.t) return(this.s!=0);return((this.data[j]&(1<<(n%this.DB)))!=0);}//(protected) this op (1<<n)function bnpChangeBit(n,op) {var r = BigInteger.ONE.shiftLeft(n);this.bitwiseTo(r,op,r);return r;}//(public) this | (1<<n)function bnSetBit(n) { return this.changeBit(n,op_or); }//(public) this & ~(1<<n)function bnClearBit(n) { return this.changeBit(n,op_andnot); }//(public) this ^ (1<<n)function bnFlipBit(n) { return this.changeBit(n,op_xor); }//(protected) r = this + afunction bnpAddTo(a,r) {var i = 0, c = 0, m = Math.min(a.t,this.t);while(i < m) {c += this.data[i]+a.data[i];r.data[i++] = c&this.DM;c >>= this.DB;}if(a.t < this.t) {c += a.s;while(i < this.t) {c += this.data[i];r.data[i++] = c&this.DM;c >>= this.DB;}c += this.s;} else {c += this.s;while(i < a.t) {c += a.data[i];r.data[i++] = c&this.DM;c >>= this.DB;}c += a.s;}r.s = (c<0)?-1:0;if(c > 0) r.data[i++] = c;else if(c < -1) r.data[i++] = this.DV+c;r.t = i;r.clamp();}//(public) this + afunction bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }//(public) this - afunction bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }//(public) this * afunction bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }//(public) this / afunction bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }//(public) this % afunction bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }//(public) [this/a,this%a]function bnDivideAndRemainder(a) {var q = nbi(), r = nbi();this.divRemTo(a,q,r);return new Array(q,r);}//(protected) this *= n, this >= 0, 1 < n < DVfunction bnpDMultiply(n) {this.data[this.t] = this.am(0,n-1,this,0,0,this.t);++this.t;this.clamp();}//(protected) this += n << w words, this >= 0function bnpDAddOffset(n,w) {if(n == 0) return;while(this.t <= w) this.data[this.t++] = 0;this.data[w] += n;while(this.data[w] >= this.DV) {this.data[w] -= this.DV;if(++w >= this.t) this.data[this.t++] = 0;++this.data[w];}}//A "null" reducerfunction NullExp() {}function nNop(x) { return x; }function nMulTo(x,y,r) { x.multiplyTo(y,r); }function nSqrTo(x,r) { x.squareTo(r); }NullExp.prototype.convert = nNop;NullExp.prototype.revert = nNop;NullExp.prototype.mulTo = nMulTo;NullExp.prototype.sqrTo = nSqrTo;//(public) this^efunction bnPow(e) { return this.exp(e,new NullExp()); }//(protected) r = lower n words of "this * a", a.t <= n//"this" should be the larger one if appropriate.function bnpMultiplyLowerTo(a,n,r) {var i = Math.min(this.t+a.t,n);r.s = 0; // assumes a,this >= 0r.t = i;while(i > 0) r.data[--i] = 0;var j;for(j = r.t-this.t; i < j; ++i) r.data[i+this.t] = this.am(0,a.data[i],r,i,0,this.t);for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a.data[i],r,i,0,n-i);r.clamp();}//(protected) r = "this * a" without lower n words, n > 0//"this" should be the larger one if appropriate.function bnpMultiplyUpperTo(a,n,r) {--n;var i = r.t = this.t+a.t-n;r.s = 0; // assumes a,this >= 0while(--i >= 0) r.data[i] = 0;for(i = Math.max(n-this.t,0); i < a.t; ++i)r.data[this.t+i-n] = this.am(n-i,a.data[i],r,0,0,this.t+i-n);r.clamp();r.drShiftTo(1,r);}//Barrett modular reductionfunction Barrett(m) {// setup Barrettthis.r2 = nbi();this.q3 = nbi();BigInteger.ONE.dlShiftTo(2*m.t,this.r2);this.mu = this.r2.divide(m);this.m = m;}function barrettConvert(x) {if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);else if(x.compareTo(this.m) < 0) return x;else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }}function barrettRevert(x) { return x; }//x = x mod m (HAC 14.42)function barrettReduce(x) {x.drShiftTo(this.m.t-1,this.r2);if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);x.subTo(this.r2,x);while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);}//r = x^2 mod m; x != rfunction barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }//r = x*y mod m; x,y != rfunction barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }Barrett.prototype.convert = barrettConvert;Barrett.prototype.revert = barrettRevert;Barrett.prototype.reduce = barrettReduce;Barrett.prototype.mulTo = barrettMulTo;Barrett.prototype.sqrTo = barrettSqrTo;//(public) this^e % m (HAC 14.85)function bnModPow(e,m) {var i = e.bitLength(), k, r = nbv(1), z;if(i <= 0) return r;else if(i < 18) k = 1;else if(i < 48) k = 3;else if(i < 144) k = 4;else if(i < 768) k = 5;else k = 6;if(i < 8)z = new Classic(m);else if(m.isEven())z = new Barrett(m);elsez = new Montgomery(m);// precomputationvar g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;g[1] = z.convert(this);if(k > 1) {var g2 = nbi();z.sqrTo(g[1],g2);while(n <= km) {g[n] = nbi();z.mulTo(g2,g[n-2],g[n]);n += 2;}}var j = e.t-1, w, is1 = true, r2 = nbi(), t;i = nbits(e.data[j])-1;while(j >= 0) {if(i >= k1) w = (e.data[j]>>(i-k1))&km;else {w = (e.data[j]&((1<<(i+1))-1))<<(k1-i);if(j > 0) w |= e.data[j-1]>>(this.DB+i-k1);}n = k;while((w&1) == 0) { w >>= 1; --n; }if((i -= n) < 0) { i += this.DB; --j; }if(is1) {  // ret == 1, don't bother squaring or multiplying itg[w].copyTo(r);is1 = false;} else {while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }z.mulTo(r2,g[w],r);}while(j >= 0 && (e.data[j]&(1<<i)) == 0) {z.sqrTo(r,r2); t = r; r = r2; r2 = t;if(--i < 0) { i = this.DB-1; --j; }}}return z.revert(r);}//(public) ###(this,a) (HAC 14.54)function bn###(a) {var x = (this.s<0)?this.negate():this.clone();var y = (a.s<0)?a.negate():a.clone();if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }var i = x.getLowestSetBit(), g = y.getLowestSetBit();if(g < 0) return x;if(i < g) g = i;if(g > 0) {x.rShiftTo(g,x);y.rShiftTo(g,y);}while(x.signum() > 0) {if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);if(x.compareTo(y) >= 0) {x.subTo(y,x);x.rShiftTo(1,x);} else {y.subTo(x,y);y.rShiftTo(1,y);}}if(g > 0) y.lShiftTo(g,y);return y;}//(protected) this % n, n < 2^26function bnpModInt(n) {if(n <= 0) return 0;var d = this.DV%n, r = (this.s<0)?n-1:0;if(this.t > 0)if(d == 0) r = this.data[0]%n;else for(var i = this.t-1; i >= 0; --i) r = (d*r+this.data[i])%n;return r;}//(public) 1/this % m (HAC 14.61)function bnModInverse(m) {var ac = m.isEven();if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;var u = m.clone(), v = this.clone();var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);while(u.signum() != 0) {while(u.isEven()) {u.rShiftTo(1,u);if(ac) {if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }a.rShiftTo(1,a);} else if(!b.isEven()) b.subTo(m,b);b.rShiftTo(1,b);}while(v.isEven()) {v.rShiftTo(1,v);if(ac) {if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }c.rShiftTo(1,c);} else if(!d.isEven()) d.subTo(m,d);d.rShiftTo(1,d);}if(u.compareTo(v) >= 0) {u.subTo(v,u);if(ac) a.subTo(c,a);b.subTo(d,b);} else {v.subTo(u,v);if(ac) c.subTo(a,c);d.subTo(b,d);}}if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;if(d.compareTo(m) >= 0) return d.subtract(m);if(d.signum() < 0) d.addTo(m,d); else return d;if(d.signum() < 0) return d.add(m); else return d;}var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509];var lplim = (1<<26)/lowprimes[lowprimes.length-1];//(public) test primality with certainty >= 1-.5^tfunction bnIsProbablePrime(t) {var i, x = this.abs();if(x.t == 1 && x.data[0] <= lowprimes[lowprimes.length-1]) {for(i = 0; i < lowprimes.length; ++i)if(x.data[0] == lowprimes[i]) return true;return false;}if(x.isEven()) return false;i = 1;while(i < lowprimes.length) {var m = lowprimes[i], j = i+1;while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];m = x.modInt(m);while(i < j) if(m%lowprimes[i++] == 0) return false;}return x.millerRabin(t);}//(protected) true if probably prime (HAC 4.24, Miller-Rabin)function bnpMillerRabin(t) {var n1 = this.subtract(BigInteger.ONE);var k = n1.getLowestSetBit();if(k <= 0) return false;var r = n1.shiftRight(k);var prng = bnGetPrng();var a;for(var i = 0; i < t; ++i) {// select witness 'a' at random from between 1 and n1do {a = new BigInteger(this.bitLength(), prng);}while(a.compareTo(BigInteger.ONE) <= 0 || a.compareTo(n1) >= 0);var y = a.modPow(r,this);if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {var j = 1;while(j++ < k && y.compareTo(n1) != 0) {y = y.modPowInt(2,this);if(y.compareTo(BigInteger.ONE) == 0) return false;}if(y.compareTo(n1) != 0) return false;}}return true;}// get pseudo random number generatorfunction bnGetPrng() {// create prng with api that matches BigInteger secure randomreturn {// x is an array to fill with bytesnextBytes: function(x) {for(var i = 0; i < x.length; ++i) {x[i] = Math.floor(Math.random() * 0x0100);}}};}//protectedBigInteger.prototype.chunkSize = bnpChunkSize;BigInteger.prototype.toRadix = bnpToRadix;BigInteger.prototype.fromRadix = bnpFromRadix;BigInteger.prototype.fromNumber = bnpFromNumber;BigInteger.prototype.bitwiseTo = bnpBitwiseTo;BigInteger.prototype.changeBit = bnpChangeBit;BigInteger.prototype.addTo = bnpAddTo;BigInteger.prototype.dMultiply = bnpDMultiply;BigInteger.prototype.dAddOffset = bnpDAddOffset;BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;BigInteger.prototype.modInt = bnpModInt;BigInteger.prototype.millerRabin = bnpMillerRabin;//publicBigInteger.prototype.clone = bnClone;BigInteger.prototype.intValue = bnIntValue;BigInteger.prototype.byteValue = bnByteValue;BigInteger.prototype.shortValue = bnShortValue;BigInteger.prototype.signum = bnSigNum;BigInteger.prototype.toByteArray = bnToByteArray;BigInteger.prototype.equals = bnEquals;BigInteger.prototype.min = bnMin;BigInteger.prototype.max = bnMax;BigInteger.prototype.and = bnAnd;BigInteger.prototype.or = bnOr;BigInteger.prototype.xor = bnXor;BigInteger.prototype.andNot = bnAndNot;BigInteger.prototype.not = bnNot;BigInteger.prototype.shiftLeft = bnShiftLeft;BigInteger.prototype.shiftRight = bnShiftRight;BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;BigInteger.prototype.bitCount = bnBitCount;BigInteger.prototype.testBit = bnTestBit;BigInteger.prototype.setBit = bnSetBit;BigInteger.prototype.clearBit = bnClearBit;BigInteger.prototype.flipBit = bnFlipBit;BigInteger.prototype.add = bnAdd;BigInteger.prototype.subtract = bnSubtract;BigInteger.prototype.multiply = bnMultiply;BigInteger.prototype.divide = bnDivide;BigInteger.prototype.remainder = bnRemainder;BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;BigInteger.prototype.modPow = bnModPow;BigInteger.prototype.modInverse = bnModInverse;BigInteger.prototype.pow = bnPow;BigInteger.prototype.### = bn###;BigInteger.prototype.isProbablePrime = bnIsProbablePrime;//BigInteger interfaces not implemented in jsbn://BigInteger(int signum, byte[] magnitude)//double doubleValue()//float floatValue()//int hashCode()//long longValue()//static BigInteger valueOf(long val)/***/ }),/***/ 8517:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of RSA-KEM.** @author Lautaro Cozzani Rodriguez* @author Dave Longley** Copyright (c) 2014 Lautaro Cozzani <[email protected]>* Copyright (c) 2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);__webpack_require__(6660);__webpack_require__(8785);module.exports = forge.kem = forge.kem || {};var BigInteger = forge.jsbn.BigInteger;/*** The API for the RSA Key Encapsulation Mechanism (RSA-KEM) from ISO 18033-2.*/forge.kem.rsa = {};/*** Creates an RSA KEM API object for generating a secret asymmetric key.** The symmetric key may be generated via a call to 'encrypt', which will* produce a ciphertext to be transmitted to the recipient and a key to be* kept secret. The ciphertext is a parameter to be passed to 'decrypt' which* will produce the same secret key for the recipient to use to decrypt a* message that was encrypted with the secret key.** @param kdf the KDF API to use (eg: new forge.kem.kdf1()).* @param options the options to use.*          [prng] a custom crypto-secure pseudo-random number generator to use,*            that must define "getBytesSync".*/forge.kem.rsa.create = function(kdf, options) {options = options || {};var prng = options.prng || forge.random;var kem = {};/*** Generates a secret key and its encapsulation.** @param publicKey the RSA public key to encrypt with.* @param keyLength the length, in bytes, of the secret key to generate.** @return an object with:*   encapsulation: the ciphertext for generating the secret key, as a*     binary-encoded string of bytes.*   key: the secret key to use for encrypting a message.*/kem.encrypt = function(publicKey, keyLength) {// generate a random r where 1 < r < nvar byteLength = Math.ceil(publicKey.n.bitLength() / 8);var r;do {r = new BigInteger(forge.util.bytesToHex(prng.getBytesSync(byteLength)),16).mod(publicKey.n);} while(r.compareTo(BigInteger.ONE) <= 0);// prepend r with zerosr = forge.util.hexToBytes(r.toString(16));var zeros = byteLength - r.length;if(zeros > 0) {r = forge.util.fillString(String.fromCharCode(0), zeros) + r;}// encrypt the randomvar encapsulation = publicKey.encrypt(r, 'NONE');// generate the secret keyvar key = kdf.generate(r, keyLength);return {encapsulation: encapsulation, key: key};};/*** Decrypts an encapsulated secret key.** @param privateKey the RSA private key to decrypt with.* @param encapsulation the ciphertext for generating the secret key, as*          a binary-encoded string of bytes.* @param keyLength the length, in bytes, of the secret key to generate.** @return the secret key as a binary-encoded string of bytes.*/kem.decrypt = function(privateKey, encapsulation, keyLength) {// decrypt the encapsulation and generate the secret keyvar r = privateKey.decrypt(encapsulation, 'NONE');return kdf.generate(r, keyLength);};return kem;};// TODO: add forge.kem.kdf.create('KDF1', {md: ..., ...}) API?/*** Creates a key derivation API object that implements KDF1 per ISO 18033-2.** @param md the hash API to use.* @param [digestLength] an optional digest length that must be positive and*          less than or equal to md.digestLength.** @return a KDF1 API object.*/forge.kem.kdf1 = function(md, digestLength) {_createKDF(this, md, 0, digestLength || md.digestLength);};/*** Creates a key derivation API object that implements KDF2 per ISO 18033-2.** @param md the hash API to use.* @param [digestLength] an optional digest length that must be positive and*          less than or equal to md.digestLength.** @return a KDF2 API object.*/forge.kem.kdf2 = function(md, digestLength) {_createKDF(this, md, 1, digestLength || md.digestLength);};/*** Creates a KDF1 or KDF2 API object.** @param md the hash API to use.* @param counterStart the starting index for the counter.* @param digestLength the digest length to use.** @return the KDF API object.*/function _createKDF(kdf, md, counterStart, digestLength) {/*** Generate a key of the specified length.** @param x the binary-encoded byte string to generate a key from.* @param length the number of bytes to generate (the size of the key).** @return the key as a binary-encoded string.*/kdf.generate = function(x, length) {var key = new forge.util.ByteBuffer();// run counter from counterStart to ceil(length / Hash.len)var k = Math.ceil(length / digestLength) + counterStart;var c = new forge.util.ByteBuffer();for(var i = counterStart; i < k; ++i) {// I2OSP(i, 4): convert counter to an octet string of 4 octetsc.putInt32(i);// digest 'x' and the counter and add the r###lt to the keymd.start();md.update(x + c.getBytes());var hash = md.digest();key.putBytes(hash.getBytes(digestLength));}// truncate to the correct key lengthkey.truncate(key.length() - length);return key.getBytes();};}/***/ }),/***/ 9105:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Cross-browser support for logging in a web application.** @author David I. Lehn <[email protected]>** Copyright (c) 2008-2013 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);/* LOG API */module.exports = forge.log = forge.log || {};/*** Application logging system.** Each logger level available as it's own function of the form:*   forge.log.level(category, args...)* The category is an arbitrary string, and the args are the same as* Firebug's console.log API. By default the call will be output as:*   'LEVEL [category] <args[0]>, args[1], ...'* This enables proper % formatting via the first argument.* Each category is enabled by default but can be enabled or disabled with* the setCategoryEnabled() function.*/// list of known levelsforge.log.levels = ['none', 'error', 'warning', 'info', 'debug', 'verbose', 'max'];// info on the levels indexed by name://   index: level index//   name: uppercased display namevar sLevelInfo = {};// list of loggersvar sLoggers = [];/*** Standard console logger. If no console support is enabled this will* remain null. Check before using.*/var sConsoleLogger = null;// logger flags/*** Lock the level at the current value. Used in cases where user config may* set the level such that only critical messages are seen but more verbose* messages are needed for debugging or other purposes.*/forge.log.LEVEL_LOCKED = (1 << 1);/*** Always call log function. By default, the logging system will check the* message level against logger.level before calling the log function. This* flag allows the function to do its own check.*/forge.log.NO_LEVEL_CHECK = (1 << 2);/*** Perform message interpolation with the passed arguments. "%" style* fields in log messages will be replaced by arguments as needed. Some* loggers, such as Firebug, may do this automatically. The original log* message will be available as 'message' and the interpolated version will* be available as 'fullMessage'.*/forge.log.INTERPOLATE = (1 << 3);// setup each log levelfor(var i = 0; i < forge.log.levels.length; ++i) {var level = forge.log.levels[i];sLevelInfo[level] = {index: i,name: level.toUpperCase()};}/*** Message logger. Will dispatch a message to registered loggers as needed.** @param message message object*/forge.log.logMessage = function(message) {var messageLevelIndex = sLevelInfo[message.level].index;for(var i = 0; i < sLoggers.length; ++i) {var logger = sLoggers[i];if(logger.flags & forge.log.NO_LEVEL_CHECK) {logger.f(message);} else {// get logger levelvar loggerLevelIndex = sLevelInfo[logger.level].index;// check levelif(messageLevelIndex <= loggerLevelIndex) {// message critical enough, call loggerlogger.f(logger, message);}}}};/*** Sets the 'standard' key on a message object to:* "LEVEL [category] " + message** @param message a message log object*/forge.log.prepareStandard = function(message) {if(!('standard' in message)) {message.standard =sLevelInfo[message.level].name +//' ' + +message.timestamp +' [' + message.category + '] ' +message.message;}};/*** Sets the 'full' key on a message object to the original message* interpolated via % formatting with the message arguments.** @param message a message log object.*/forge.log.prepareFull = function(message) {if(!('full' in message)) {// copy args and insert message at the frontvar args = [message.message];args = args.concat([] || 0);// format the messagemessage.full = forge.util.format.apply(this, args);}};/*** Applies both preparseStandard() and prepareFull() to a message object and* store r###lt in 'standardFull'.** @param message a message log object.*/forge.log.prepareStandardFull = function(message) {if(!('standardFull' in message)) {// FIXME implement 'standardFull' loggingforge.log.prepareStandard(message);message.standardFull = message.standard;}};// create log level functionsif(true) {// levels for which we want functionsvar levels = ['error', 'warning', 'info', 'debug', 'verbose'];for(var i = 0; i < levels.length; ++i) {// wrap in a function to ensure proper level var is passed(function(level) {// create function for this levelforge.log[level] = function(category, message/*, args...*/) {// convert arguments to real array, remove category and messagevar args = Array.prototype.slice.call(arguments).slice(2);// create message object// Note: interpolation and standard formatting is done lazilyvar msg = {timestamp: new Date(),level: level,category: category,message: message,'arguments': args/*standard*//*full*//*fullMessage*/};// process this messageforge.log.logMessage(msg);};})(levels[i]);}}/*** Creates a new logger with specified custom logging function.** The logging function has a signature of:*   function(logger, message)* logger: current logger* message: object:*   level: level id*   category: category*   message: string message*   arguments: Array of extra arguments*   fullMessage: interpolated message and arguments if INTERPOLATE flag set** @param logFunction a logging function which takes a log message object*          as a parameter.** @return a logger object.*/forge.log.makeLogger = function(logFunction) {var logger = {flags: 0,f: logFunction};forge.log.setLevel(logger, 'none');return logger;};/*** Sets the current log level on a logger.** @param logger the target logger.* @param level the new maximum log level as a string.** @return true if set, false if not.*/forge.log.setLevel = function(logger, level) {var rval = false;if(logger && !(logger.flags & forge.log.LEVEL_LOCKED)) {for(var i = 0; i < forge.log.levels.length; ++i) {var aValidLevel = forge.log.levels[i];if(level == aValidLevel) {// set levellogger.level = level;rval = true;break;}}}return rval;};/*** Locks the log level at its current value.** @param logger the target logger.* @param lock boolean lock value, default to true.*/forge.log.lock = function(logger, lock) {if(typeof lock === 'undefined' || lock) {logger.flags |= forge.log.LEVEL_LOCKED;} else {logger.flags &= ~forge.log.LEVEL_LOCKED;}};/*** Adds a logger.** @param logger the logger object.*/forge.log.addLogger = function(logger) {sLoggers.push(logger);};// setup the console logger if possible, else create fake console.logif(typeof(console) !== 'undefined' && 'log' in console) {var logger;if(console.error && console.warn && console.info && console.debug) {// looks like Firebug-style logging is available// level handlers mapvar levelHandlers = {error: console.error,warning: console.warn,info: console.info,debug: console.debug,verbose: console.debug};var f = function(logger, message) {forge.log.prepareStandard(message);var handler = levelHandlers[message.level];// prepend standard message and concat argsvar args = [message.standard];args = args.concat(message['arguments'].slice());// apply to low-level console functionhandler.apply(console, args);};logger = forge.log.makeLogger(f);} else {// only appear to have basic console.logvar f = function(logger, message) {forge.log.prepareStandardFull(message);console.log(message.standardFull);};logger = forge.log.makeLogger(f);}forge.log.setLevel(logger, 'debug');forge.log.addLogger(logger);sConsoleLogger = logger;} else {// define fake console.log to avoid potential script errors on// browsers that do not have console loggingconsole = {log: function() {}};}/** Check for logging control query vars.** console.level=<level-name>* Set's the console log level by name.  Useful to override defaults and* allow more verbose logging before a user config is loaded.** console.lock=<true|false>* Lock the console log level at whatever level it is set at.  This is run* after console.level is processed.  Useful to force a level of verbosity* that could otherwise be limited by a user config.*/if(sConsoleLogger !== null) {var query = forge.util.getQueryVariables();if('console.level' in query) {// set with last valueforge.log.setLevel(sConsoleLogger, query['console.level'].slice(-1)[0]);}if('console.lock' in query) {// set with last valuevar lock = query['console.lock'].slice(-1)[0];if(lock == 'true') {forge.log.lock(sConsoleLogger);}}}// provide public access to console loggerforge.log.consoleLogger = sConsoleLogger;/***/ }),/***/ 3676:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Node.js module for all known Forge message digests.** @author Dave Longley** Copyright 2011-2017 Digital Bazaar, Inc.*/module.exports = __webpack_require__(3605);__webpack_require__(5400);__webpack_require__(7499);__webpack_require__(9166);__webpack_require__(5368);/***/ }),/***/ 3605:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Node.js module for Forge message digests.** @author Dave Longley** Copyright 2011-2017 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);module.exports = forge.md = forge.md || {};forge.md.algorithms = forge.md.algorithms || {};/***/ }),/***/ 5400:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Message Digest Algorithm 5 with 128-bit digest (MD5) implementation.** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(3605);__webpack_require__(2365);var md5 = module.exports = forge.md5 = forge.md5 || {};forge.md.md5 = forge.md.algorithms.md5 = md5;/*** Creates an MD5 message digest object.** @return a message digest object.*/md5.create = function() {// do initialization as necessaryif(!_initialized) {_init();}// MD5 state contains four 32-bit integersvar _state = null;// input buffervar _input = forge.util.createBuffer();// used for word storagevar _w = new Array(16);// message digest objectvar md = {algorithm: 'md5',blockLength: 64,digestLength: 16,// 56-bit length of message so far (does not including padding)messageLength: 0,// true message lengthfullMessageLength: null,// size of message length in bytesmessageLengthSize: 8};/*** Starts the digest.** @return this digest object.*/md.start = function() {// up to 56-bit message length for conveniencemd.messageLength = 0;// full message length (set md.messageLength64 for backwards-compatibility)md.fullMessageLength = md.messageLength64 = [];var int32s = md.messageLengthSize / 4;for(var i = 0; i < int32s; ++i) {md.fullMessageLength.push(0);}_input = forge.util.createBuffer();_state = {h0: 0x67452301,h1: 0xEFCDAB89,h2: 0x98BADCFE,h3: 0x10325476};return md;};// start digest automatically for first timemd.start();/*** Updates the digest with the given message input. The given input can* treated as raw input (no encoding will be applied) or an encoding of* 'utf8' maybe given to encode the input using UTF-8.** @param msg the message input to update with.* @param encoding the encoding to use (default: 'raw', other: 'utf8').** @return this digest object.*/md.update = function(msg, encoding) {if(encoding === 'utf8') {msg = forge.util.encodeUtf8(msg);}// update message lengthvar len = msg.length;md.messageLength += len;len = [(len / 0x100000000) >>> 0, len >>> 0];for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {md.fullMessageLength[i] += len[1];len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;len[0] = (len[1] / 0x100000000) >>> 0;}// add bytes to input buffer_input.putBytes(msg);// process bytes_update(_state, _w, _input);// compact input buffer every 2K or if emptyif(_input.read > 2048 || _input.length() === 0) {_input.compact();}return md;};/*** Produces the digest.** @return a byte buffer containing the digest value.*/md.digest = function() {/* Note: Here we copy the remaining bytes in the input buffer andadd the appropriate MD5 padding. Then we do the final updateon a copy of the state so that if the user wants to getintermediate digests they can do so. *//* Determine the number of bytes that must be added to the messageto ensure its length is congruent to 448 mod 512. In other words,the data to be digested must be a multiple of 512 bits (or 128 bytes).This data includes the message, some padding, and the length of themessage. Since the length of the message will be encoded as 8 bytes (64bits), that means that the last segment of the data must have 56 bytes(448 bits) of message and padding. Therefore, the length of the messageplus the padding must be congruent to 448 mod 512 because512 - 128 = 448.In order to fill up the message length it must be filled withpadding that begins with 1 bit followed by all 0 bits. Paddingmust *always* be present, so if the message length is alreadycongruent to 448 mod 512, then 512 padding bits must be added. */var finalBlock = forge.util.createBuffer();finalBlock.putBytes(_input.bytes());// compute remaining size to be digested (include message length size)var remaining = (md.fullMessageLength[md.fullMessageLength.length - 1] +md.messageLengthSize);// add padding for overflow blockSize - overflow// _padding starts with 1 byte with first bit is set (byte value 128), then// there may be up to (blockSize - 1) other pad bytesvar overflow = remaining & (md.blockLength - 1);finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));// serialize message length in bits in little-endian order; since length// is stored in bytes we multiply by 8 and add carryvar bits, carry = 0;for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {bits = md.fullMessageLength[i] * 8 + carry;carry = (bits / 0x100000000) >>> 0;finalBlock.putInt32Le(bits >>> 0);}var s2 = {h0: _state.h0,h1: _state.h1,h2: _state.h2,h3: _state.h3};_update(s2, _w, finalBlock);var rval = forge.util.createBuffer();rval.putInt32Le(s2.h0);rval.putInt32Le(s2.h1);rval.putInt32Le(s2.h2);rval.putInt32Le(s2.h3);return rval;};return md;};// padding, constant tables for calculating md5var _padding = null;var _g = null;var _r = null;var _k = null;var _initialized = false;/*** Initializes the constant tables.*/function _init() {// create padding_padding = String.fromCharCode(128);_padding += forge.util.fillString(String.fromCharCode(0x00), 64);// g values_g = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12,5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2,0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9];// rounds table_r = [7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21];// get the r###lt of abs(sin(i + 1)) as a 32-bit integer_k = new Array(64);for(var i = 0; i < 64; ++i) {_k[i] = Math.floor(Math.abs(Math.sin(i + 1)) * 0x100000000);}// now initialized_initialized = true;}/*** Updates an MD5 state with the given byte buffer.** @param s the MD5 state to update.* @param w the array to use to store words.* @param bytes the byte buffer to update with.*/function _update(s, w, bytes) {// consume 512 bit (64 byte) chunksvar t, a, b, c, d, f, r, i;var len = bytes.length();while(len >= 64) {// initialize hash value for this chunka = s.h0;b = s.h1;c = s.h2;d = s.h3;// round 1for(i = 0; i < 16; ++i) {w[i] = bytes.getInt32Le();f = d ^ (b & (c ^ d));t = (a + f + _k[i] + w[i]);r = _r[i];a = d;d = c;c = b;b += (t << r) | (t >>> (32 - r));}// round 2for(; i < 32; ++i) {f = c ^ (d & (b ^ c));t = (a + f + _k[i] + w[_g[i]]);r = _r[i];a = d;d = c;c = b;b += (t << r) | (t >>> (32 - r));}// round 3for(; i < 48; ++i) {f = b ^ c ^ d;t = (a + f + _k[i] + w[_g[i]]);r = _r[i];a = d;d = c;c = b;b += (t << r) | (t >>> (32 - r));}// round 4for(; i < 64; ++i) {f = c ^ (b | ~d);t = (a + f + _k[i] + w[_g[i]]);r = _r[i];a = d;d = c;c = b;b += (t << r) | (t >>> (32 - r));}// update hash states.h0 = (s.h0 + a) | 0;s.h1 = (s.h1 + b) | 0;s.h2 = (s.h2 + c) | 0;s.h3 = (s.h3 + d) | 0;len -= 64;}}/***/ }),/***/ 6222:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Node.js module for Forge mask generation functions.** @author Stefan Siegl** Copyright 2012 Stefan Siegl <[email protected]>*/var forge = __webpack_require__(7009);__webpack_require__(6439);module.exports = forge.mgf = forge.mgf || {};forge.mgf.mgf1 = forge.mgf1;/***/ }),/***/ 6439:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of mask generation function MGF1.** @author Stefan Siegl* @author Dave Longley** Copyright (c) 2012 Stefan Siegl <[email protected]>* Copyright (c) 2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);forge.mgf = forge.mgf || {};var mgf1 = module.exports = forge.mgf.mgf1 = forge.mgf1 = forge.mgf1 || {};/*** Creates a MGF1 mask generation function object.** @param md the message digest API to use (eg: forge.md.sha1.create()).** @return a mask generation function object.*/mgf1.create = function(md) {var mgf = {/*** Generate mask of specified length.** @param {String} seed The seed for mask generation.* @param maskLen Number of bytes to generate.* @return {String} The generated mask.*/generate: function(seed, maskLen) {/* 2. Let T be the empty octet string. */var t = new forge.util.ByteBuffer();/* 3. For counter from 0 to ceil(maskLen / hLen), do the following: */var len = Math.ceil(maskLen / md.digestLength);for(var i = 0; i < len; i++) {/* a. Convert counter to an octet string C of length 4 octets */var c = new forge.util.ByteBuffer();c.putInt32(i);/* b. Concatenate the hash of the seed mgfSeed and C to the octet* string T: */md.start();md.update(seed + c.getBytes());t.putBuffer(md.digest());}/* Output the leading maskLen octets of T as the octet string mask. */t.truncate(t.length() - maskLen);return t.getBytes();}};return mgf;};/***/ }),/***/ 1692:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Object IDs for ASN.1.** @author Dave Longley** Copyright (c) 2010-2013 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);forge.pki = forge.pki || {};var oids = module.exports = forge.pki.oids = forge.oids = forge.oids || {};// set id to name mapping and name to id mappingfunction _IN(id, name) {oids[id] = name;oids[name] = id;}// set id to name mapping onlyfunction _I_(id, name) {oids[id] = name;}// algorithm OIDs_IN('1.2.840.113549.1.1.1', 'rsaEncryption');// Note: md2 & md4 not implemented//_IN('1.2.840.113549.1.1.2', 'md2WithRSAEncryption');//_IN('1.2.840.113549.1.1.3', 'md4WithRSAEncryption');_IN('1.2.840.113549.1.1.4', 'md5WithRSAEncryption');_IN('1.2.840.113549.1.1.5', 'sha1WithRSAEncryption');_IN('1.2.840.113549.1.1.7', 'RSAES-OAEP');_IN('1.2.840.113549.1.1.8', 'mgf1');_IN('1.2.840.113549.1.1.9', 'pSpecified');_IN('1.2.840.113549.1.1.10', 'RSASSA-PSS');_IN('1.2.840.113549.1.1.11', 'sha256WithRSAEncryption');_IN('1.2.840.113549.1.1.12', 'sha384WithRSAEncryption');_IN('1.2.840.113549.1.1.13', 'sha512WithRSAEncryption');_IN('1.2.840.10040.4.3', 'dsa-with-sha1');_IN('1.3.14.3.2.7', 'desCBC');_IN('1.3.14.3.2.26', 'sha1');_IN('2.16.840.1.101.3.4.2.1', 'sha256');_IN('2.16.840.1.101.3.4.2.2', 'sha384');_IN('2.16.840.1.101.3.4.2.3', 'sha512');_IN('1.2.840.113549.2.5', 'md5');// pkcs#7 content types_IN('1.2.840.113549.1.7.1', 'data');_IN('1.2.840.113549.1.7.2', 'signedData');_IN('1.2.840.113549.1.7.3', 'envelopedData');_IN('1.2.840.113549.1.7.4', 'signedAndEnvelopedData');_IN('1.2.840.113549.1.7.5', 'digestedData');_IN('1.2.840.113549.1.7.6', 'encryptedData');// pkcs#9 oids_IN('1.2.840.113549.1.9.1', 'emailAddress');_IN('1.2.840.113549.1.9.2', 'unstructuredName');_IN('1.2.840.113549.1.9.3', 'contentType');_IN('1.2.840.113549.1.9.4', 'messageDigest');_IN('1.2.840.113549.1.9.5', 'signingTime');_IN('1.2.840.113549.1.9.6', 'counterSignature');_IN('1.2.840.113549.1.9.7', 'challengePassword');_IN('1.2.840.113549.1.9.8', 'unstructuredAddress');_IN('1.2.840.113549.1.9.14', 'extensionRequest');_IN('1.2.840.113549.1.9.20', 'friendlyName');_IN('1.2.840.113549.1.9.21', 'localKeyId');_IN('1.2.840.113549.1.9.22.1', 'x509Certificate');// pkcs#12 safe bags_IN('1.2.840.113549.1.12.10.1.1', 'keyBag');_IN('1.2.840.113549.1.12.10.1.2', 'pkcs8ShroudedKeyBag');_IN('1.2.840.113549.1.12.10.1.3', 'certBag');_IN('1.2.840.113549.1.12.10.1.4', 'crlBag');_IN('1.2.840.113549.1.12.10.1.5', 'secretBag');_IN('1.2.840.113549.1.12.10.1.6', 'safeContentsBag');// password-based-encryption for pkcs#12_IN('1.2.840.113549.1.5.13', 'pkcs5PBES2');_IN('1.2.840.113549.1.5.12', 'pkcs5PBKDF2');_IN('1.2.840.113549.1.12.1.1', 'pbeWithSHAAnd128BitRC4');_IN('1.2.840.113549.1.12.1.2', 'pbeWithSHAAnd40BitRC4');_IN('1.2.840.113549.1.12.1.3', 'pbeWithSHAAnd3-KeyTripleDES-CBC');_IN('1.2.840.113549.1.12.1.4', 'pbeWithSHAAnd2-KeyTripleDES-CBC');_IN('1.2.840.113549.1.12.1.5', 'pbeWithSHAAnd128BitRC2-CBC');_IN('1.2.840.113549.1.12.1.6', 'pbewithSHAAnd40BitRC2-CBC');// hmac OIDs_IN('1.2.840.113549.2.7', 'hmacWithSHA1');_IN('1.2.840.113549.2.8', 'hmacWithSHA224');_IN('1.2.840.113549.2.9', 'hmacWithSHA256');_IN('1.2.840.113549.2.10', 'hmacWithSHA384');_IN('1.2.840.113549.2.11', 'hmacWithSHA512');// symmetric key algorithm oids_IN('1.2.840.113549.3.7', 'des-EDE3-CBC');_IN('2.16.840.1.101.3.4.1.2', 'aes128-CBC');_IN('2.16.840.1.101.3.4.1.22', 'aes192-CBC');_IN('2.16.840.1.101.3.4.1.42', 'aes256-CBC');// certificate issuer/subject OIDs_IN('2.5.4.3', 'commonName');_IN('2.5.4.5', 'serialName');_IN('2.5.4.6', 'countryName');_IN('2.5.4.7', 'localityName');_IN('2.5.4.8', 'stateOrProvinceName');_IN('2.5.4.10', 'organizationName');_IN('2.5.4.11', 'organizationalUnitName');_IN('2.5.4.13', 'description');// X.509 extension OIDs_IN('2.16.840.1.113730.1.1', 'nsCertType');_IN('2.16.840.1.113730.1.13', 'nsComment'); // deprecated in theory; still widely used_I_('2.5.29.1', 'authorityKeyIdentifier'); // deprecated, use .35_I_('2.5.29.2', 'keyAttributes'); // obsolete use .37 or .15_I_('2.5.29.3', 'certificatePolicies'); // deprecated, use .32_I_('2.5.29.4', 'keyUsageRestriction'); // obsolete use .37 or .15_I_('2.5.29.5', 'policyMapping'); // deprecated use .33_I_('2.5.29.6', 'subtreesConstraint'); // obsolete use .30_I_('2.5.29.7', 'subjectAltName'); // deprecated use .17_I_('2.5.29.8', 'issuerAltName'); // deprecated use .18_I_('2.5.29.9', 'subjectDirectoryAttributes');_I_('2.5.29.10', 'basicConstraints'); // deprecated use .19_I_('2.5.29.11', 'nameConstraints'); // deprecated use .30_I_('2.5.29.12', 'policyConstraints'); // deprecated use .36_I_('2.5.29.13', 'basicConstraints'); // deprecated use .19_IN('2.5.29.14', 'subjectKeyIdentifier');_IN('2.5.29.15', 'keyUsage');_I_('2.5.29.16', 'privateKeyUsagePeriod');_IN('2.5.29.17', 'subjectAltName');_IN('2.5.29.18', 'issuerAltName');_IN('2.5.29.19', 'basicConstraints');_I_('2.5.29.20', 'cRLNumber');_I_('2.5.29.21', 'cRLReason');_I_('2.5.29.22', 'expirationDate');_I_('2.5.29.23', 'instructionCode');_I_('2.5.29.24', 'invalidityDate');_I_('2.5.29.25', 'cRLDistributionPoints'); // deprecated use .31_I_('2.5.29.26', 'issuingDistributionPoint'); // deprecated use .28_I_('2.5.29.27', 'deltaCRLIndicator');_I_('2.5.29.28', 'issuingDistributionPoint');_I_('2.5.29.29', 'certificateIssuer');_I_('2.5.29.30', 'nameConstraints');_IN('2.5.29.31', 'cRLDistributionPoints');_IN('2.5.29.32', 'certificatePolicies');_I_('2.5.29.33', 'policyMappings');_I_('2.5.29.34', 'policyConstraints'); // deprecated use .36_IN('2.5.29.35', 'authorityKeyIdentifier');_I_('2.5.29.36', 'policyConstraints');_IN('2.5.29.37', 'extKeyUsage');_I_('2.5.29.46', 'freshestCRL');_I_('2.5.29.54', 'inhibitAnyPolicy');// extKeyUsage purposes_IN('1.3.6.1.4.1.11129.2.4.2', 'timestampList');_IN('1.3.6.1.5.5.7.1.1', 'authorityInfoAccess');_IN('1.3.6.1.5.5.7.3.1', 'serverAuth');_IN('1.3.6.1.5.5.7.3.2', 'clientAuth');_IN('1.3.6.1.5.5.7.3.3', 'codeSigning');_IN('1.3.6.1.5.5.7.3.4', 'emailProtection');_IN('1.3.6.1.5.5.7.3.8', 'timeStamping');/***/ }),/***/ 2079:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Password-based encryption functions.** @author Dave Longley* @author Stefan Siegl <[email protected]>** Copyright (c) 2010-2013 Digital Bazaar, Inc.* Copyright (c) 2012 Stefan Siegl <[email protected]>** An EncryptedPrivateKeyInfo:** EncryptedPrivateKeyInfo ::= SEQUENCE {*   encryptionAlgorithm  EncryptionAlgorithmIdentifier,*   encryptedData        EncryptedData }** EncryptionAlgorithmIdentifier ::= AlgorithmIdentifier** EncryptedData ::= OCTET STRING*/var forge = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(1598);__webpack_require__(3436);__webpack_require__(3605);__webpack_require__(1692);__webpack_require__(8322);__webpack_require__(2966);__webpack_require__(6660);__webpack_require__(6994);__webpack_require__(524);__webpack_require__(2365);if(typeof BigInteger === 'undefined') {var BigInteger = forge.jsbn.BigInteger;}// shortcut for asn.1 APIvar asn1 = forge.asn1;/* Password-based encryption implementation. */var pki = forge.pki = forge.pki || {};module.exports = pki.pbe = forge.pbe = forge.pbe || {};var oids = pki.oids;// validator for an EncryptedPrivateKeyInfo structure// Note: Currently only works w/algorithm paramsvar encryptedPrivateKeyValidator = {name: 'EncryptedPrivateKeyInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'EncryptedPrivateKeyInfo.encryptionAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'AlgorithmIdentifier.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'encryptionOid'}, {name: 'AlgorithmIdentifier.parameters',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'encryptionParams'}]}, {// encryptedDataname: 'EncryptedPrivateKeyInfo.encryptedData',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'encryptedData'}]};// validator for a PBES2Algorithms structure// Note: Currently only works w/PBKDF2 + AES encryption schemesvar PBES2AlgorithmsValidator = {name: 'PBES2Algorithms',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'PBES2Algorithms.keyDerivationFunc',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'PBES2Algorithms.keyDerivationFunc.oid',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'kdfOid'}, {name: 'PBES2Algorithms.params',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'PBES2Algorithms.params.salt',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'kdfSalt'}, {name: 'PBES2Algorithms.params.iterationCount',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'kdfIterationCount'}, {name: 'PBES2Algorithms.params.keyLength',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,optional: true,capture: 'keyLength'}, {// prfname: 'PBES2Algorithms.params.prf',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,optional: true,value: [{name: 'PBES2Algorithms.params.prf.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'prfOid'}]}]}]}, {name: 'PBES2Algorithms.encryptionScheme',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'PBES2Algorithms.encryptionScheme.oid',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'encOid'}, {name: 'PBES2Algorithms.encryptionScheme.iv',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'encIv'}]}]};var pkcs12PbeParamsValidator = {name: 'pkcs-12PbeParams',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'pkcs-12PbeParams.salt',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'salt'}, {name: 'pkcs-12PbeParams.iterations',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'iterations'}]};/*** Encrypts a ASN.1 PrivateKeyInfo object, producing an EncryptedPrivateKeyInfo.** PBES2Algorithms ALGORITHM-IDENTIFIER ::=*   { {PBES2-params IDENTIFIED BY id-PBES2}, ...}** id-PBES2 OBJECT IDENTIFIER ::= {pkcs-5 13}** PBES2-params ::= SEQUENCE {*   keyDerivationFunc AlgorithmIdentifier {{PBES2-KDFs}},*   encryptionScheme AlgorithmIdentifier {{PBES2-Encs}}* }** PBES2-KDFs ALGORITHM-IDENTIFIER ::=*   { {PBKDF2-params IDENTIFIED BY id-PBKDF2}, ... }** PBES2-Encs ALGORITHM-IDENTIFIER ::= { ... }** PBKDF2-params ::= SEQUENCE {*   salt CHOICE {*     specified OCTET STRING,*     otherSource AlgorithmIdentifier {{PBKDF2-SaltSources}}*   },*   iterationCount INTEGER (1..MAX),*   keyLength INTEGER (1..MAX) OPTIONAL,*   prf AlgorithmIdentifier {{PBKDF2-PRFs}} DEFAULT algid-hmacWithSHA1* }** @param obj the ASN.1 PrivateKeyInfo object.* @param password the password to encrypt with.* @param options:*          algorithm the encryption algorithm to use*            ('aes128', 'aes192', 'aes256', '3des'), defaults to 'aes128'.*          count the iteration count to use.*          saltSize the salt size to use.*          prfAlgorithm the PRF message digest algorithm to use*            ('sha1', 'sha224', 'sha256', 'sha384', 'sha512')** @return the ASN.1 EncryptedPrivateKeyInfo.*/pki.encryptPrivateKeyInfo = function(obj, password, options) {// set default optionsoptions = options || {};options.saltSize = options.saltSize || 8;options.count = options.count || 2048;options.algorithm = options.algorithm || 'aes128';options.prfAlgorithm = options.prfAlgorithm || 'sha1';// generate PBE paramsvar salt = forge.random.getBytesSync(options.saltSize);var count = options.count;var countBytes = asn1.integerToDer(count);var dkLen;var encryptionAlgorithm;var encryptedData;if(options.algorithm.indexOf('aes') === 0 || options.algorithm === 'des') {// do PBES2var ivLen, encOid, cipherFn;switch(options.algorithm) {case 'aes128':dkLen = 16;ivLen = 16;encOid = oids['aes128-CBC'];cipherFn = forge.aes.createEncryptionCipher;break;case 'aes192':dkLen = 24;ivLen = 16;encOid = oids['aes192-CBC'];cipherFn = forge.aes.createEncryptionCipher;break;case 'aes256':dkLen = 32;ivLen = 16;encOid = oids['aes256-CBC'];cipherFn = forge.aes.createEncryptionCipher;break;case 'des':dkLen = 8;ivLen = 8;encOid = oids['desCBC'];cipherFn = forge.des.createEncryptionCipher;break;default:var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.');error.algorithm = options.algorithm;throw error;}// get PRF message digestvar prfAlgorithm = 'hmacWith' + options.prfAlgorithm.toUpperCase();var md = prfAlgorithmToMessageDigest(prfAlgorithm);// encrypt private key using pbe SHA-1 and AES/DESvar dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen, md);var iv = forge.random.getBytesSync(ivLen);var cipher = cipherFn(dk);cipher.start(iv);cipher.update(asn1.toDer(obj));cipher.finish();encryptedData = cipher.output.getBytes();// get PBKDF2-paramsvar params = createPbkdf2Params(salt, countBytes, dkLen, prfAlgorithm);encryptionAlgorithm = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(oids['pkcs5PBES2']).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// keyDerivationFuncasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(oids['pkcs5PBKDF2']).getBytes()),// PBKDF2-paramsparams]),// encryptionSchemeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(encOid).getBytes()),// ivasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, iv)])])]);} else if(options.algorithm === '3des') {// Do PKCS12 PBEdkLen = 24;var saltBytes = new forge.util.ByteBuffer(salt);var dk = pki.pbe.generatePkcs12Key(password, saltBytes, 1, count, dkLen);var iv = pki.pbe.generatePkcs12Key(password, saltBytes, 2, count, dkLen);var cipher = forge.des.createEncryptionCipher(dk);cipher.start(iv);cipher.update(asn1.toDer(obj));cipher.finish();encryptedData = cipher.output.getBytes();encryptionAlgorithm = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(oids['pbeWithSHAAnd3-KeyTripleDES-CBC']).getBytes()),// pkcs-12PbeParamsasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// saltasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt),// iteration countasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,countBytes.getBytes())])]);} else {var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.');error.algorithm = options.algorithm;throw error;}// EncryptedPrivateKeyInfovar rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// encryptionAlgorithmencryptionAlgorithm,// encryptedDataasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, encryptedData)]);return rval;};/*** Decrypts a ASN.1 PrivateKeyInfo object.** @param obj the ASN.1 EncryptedPrivateKeyInfo object.* @param password the password to decrypt with.** @return the ASN.1 PrivateKeyInfo on success, null on failure.*/pki.decryptPrivateKeyInfo = function(obj, password) {var rval = null;// get PBE paramsvar capture = {};var errors = [];if(!asn1.validate(obj, encryptedPrivateKeyValidator, capture, errors)) {var error = new Error('Cannot read encrypted private key. ' +'ASN.1 object is not a supported EncryptedPrivateKeyInfo.');error.errors = errors;throw error;}// get ciphervar oid = asn1.derToOid(capture.encryptionOid);var cipher = pki.pbe.getCipher(oid, capture.encryptionParams, password);// get encrypted datavar encrypted = forge.util.createBuffer(capture.encryptedData);cipher.update(encrypted);if(cipher.finish()) {rval = asn1.fromDer(cipher.output);}return rval;};/*** Converts a EncryptedPrivateKeyInfo to PEM format.** @param epki the EncryptedPrivateKeyInfo.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted encrypted private key.*/pki.encryptedPrivateKeyToPem = function(epki, maxline) {// convert to DER, then PEM-encodevar msg = {type: 'ENCRYPTED PRIVATE KEY',body: asn1.toDer(epki).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/*** Converts a PEM-encoded EncryptedPrivateKeyInfo to ASN.1 format. Decryption* is not performed.** @param pem the EncryptedPrivateKeyInfo in PEM-format.** @return the ASN.1 EncryptedPrivateKeyInfo.*/pki.encryptedPrivateKeyFromPem = function(pem) {var msg = forge.pem.decode(pem)[0];if(msg.type !== 'ENCRYPTED PRIVATE KEY') {var error = new Error('Could not convert encrypted private key from PEM; ' +'PEM header type is "ENCRYPTED PRIVATE KEY".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert encrypted private key from PEM; ' +'PEM is encrypted.');}// convert DER to ASN.1 objectreturn asn1.fromDer(msg.body);};/*** Encrypts an RSA private key. By default, the key will be wrapped in* a PrivateKeyInfo and encrypted to produce a PKCS#8 EncryptedPrivateKeyInfo.* This is the standard, preferred way to encrypt a private key.** To produce a non-standard PEM-encrypted private key that uses encapsulated* headers to indicate the encryption algorithm (old-style non-PKCS#8 OpenSSL* private key encryption), set the 'legacy' option to true. Note: Using this* option will cause the iteration count to be forced to 1.** Note: The 'des' algorithm is supported, but it is not considered to be* secure because it only uses a single 56-bit key. If possible, it is highly* recommended that a different algorithm be used.** @param rsaKey the RSA key to encrypt.* @param password the password to use.* @param options:*          algorithm: the encryption algorithm to use*            ('aes128', 'aes192', 'aes256', '3des', 'des').*          count: the iteration count to use.*          saltSize: the salt size to use.*          legacy: output an old non-PKCS#8 PEM-encrypted+encapsulated*            headers (DEK-Info) private key.** @return the PEM-encoded ASN.1 EncryptedPrivateKeyInfo.*/pki.encryptRsaPrivateKey = function(rsaKey, password, options) {// standard PKCS#8options = options || {};if(!options.legacy) {// encrypt PrivateKeyInfovar rval = pki.wrapRsaPrivateKey(pki.privateKeyToAsn1(rsaKey));rval = pki.encryptPrivateKeyInfo(rval, password, options);return pki.encryptedPrivateKeyToPem(rval);}// legacy non-PKCS#8var algorithm;var iv;var dkLen;var cipherFn;switch(options.algorithm) {case 'aes128':algorithm = 'AES-128-CBC';dkLen = 16;iv = forge.random.getBytesSync(16);cipherFn = forge.aes.createEncryptionCipher;break;case 'aes192':algorithm = 'AES-192-CBC';dkLen = 24;iv = forge.random.getBytesSync(16);cipherFn = forge.aes.createEncryptionCipher;break;case 'aes256':algorithm = 'AES-256-CBC';dkLen = 32;iv = forge.random.getBytesSync(16);cipherFn = forge.aes.createEncryptionCipher;break;case '3des':algorithm = 'DES-EDE3-CBC';dkLen = 24;iv = forge.random.getBytesSync(8);cipherFn = forge.des.createEncryptionCipher;break;case 'des':algorithm = 'DES-CBC';dkLen = 8;iv = forge.random.getBytesSync(8);cipherFn = forge.des.createEncryptionCipher;break;default:var error = new Error('Could not encrypt RSA private key; unsupported ' +'encryption algorithm "' + options.algorithm + '".');error.algorithm = options.algorithm;throw error;}// encrypt private key using OpenSSL legacy key derivationvar dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen);var cipher = cipherFn(dk);cipher.start(iv);cipher.update(asn1.toDer(pki.privateKeyToAsn1(rsaKey)));cipher.finish();var msg = {type: 'RSA PRIVATE KEY',procType: {version: '4',type: 'ENCRYPTED'},dekInfo: {algorithm: algorithm,parameters: forge.util.bytesToHex(iv).toUpperCase()},body: cipher.output.getBytes()};return forge.pem.encode(msg);};/*** Decrypts an RSA private key.** @param pem the PEM-formatted EncryptedPrivateKeyInfo to decrypt.* @param password the password to use.** @return the RSA key on success, null on failure.*/pki.decryptRsaPrivateKey = function(pem, password) {var rval = null;var msg = forge.pem.decode(pem)[0];if(msg.type !== 'ENCRYPTED PRIVATE KEY' &&msg.type !== 'PRIVATE KEY' &&msg.type !== 'RSA PRIVATE KEY') {var error = new Error('Could not convert private key from PEM; PEM header type ' +'is not "ENCRYPTED PRIVATE KEY", "PRIVATE KEY", or "RSA PRIVATE KEY".');error.headerType = error;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {var dkLen;var cipherFn;switch(msg.dekInfo.algorithm) {case 'DES-CBC':dkLen = 8;cipherFn = forge.des.createDecryptionCipher;break;case 'DES-EDE3-CBC':dkLen = 24;cipherFn = forge.des.createDecryptionCipher;break;case 'AES-128-CBC':dkLen = 16;cipherFn = forge.aes.createDecryptionCipher;break;case 'AES-192-CBC':dkLen = 24;cipherFn = forge.aes.createDecryptionCipher;break;case 'AES-256-CBC':dkLen = 32;cipherFn = forge.aes.createDecryptionCipher;break;case 'RC2-40-CBC':dkLen = 5;cipherFn = function(key) {return forge.rc2.createDecryptionCipher(key, 40);};break;case 'RC2-64-CBC':dkLen = 8;cipherFn = function(key) {return forge.rc2.createDecryptionCipher(key, 64);};break;case 'RC2-128-CBC':dkLen = 16;cipherFn = function(key) {return forge.rc2.createDecryptionCipher(key, 128);};break;default:var error = new Error('Could not decrypt private key; unsupported ' +'encryption algorithm "' + msg.dekInfo.algorithm + '".');error.algorithm = msg.dekInfo.algorithm;throw error;}// use OpenSSL legacy key derivationvar iv = forge.util.hexToBytes(msg.dekInfo.parameters);var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen);var cipher = cipherFn(dk);cipher.start(iv);cipher.update(forge.util.createBuffer(msg.body));if(cipher.finish()) {rval = cipher.output.getBytes();} else {return rval;}} else {rval = msg.body;}if(msg.type === 'ENCRYPTED PRIVATE KEY') {rval = pki.decryptPrivateKeyInfo(asn1.fromDer(rval), password);} else {// decryption already performed aboverval = asn1.fromDer(rval);}if(rval !== null) {rval = pki.privateKeyFromAsn1(rval);}return rval;};/*** Derives a PKCS#12 key.** @param password the password to derive the key material from, null or*          undefined for none.* @param salt the salt, as a ByteBuffer, to use.* @param id the PKCS#12 ID byte (1 = key material, 2 = IV, 3 = MAC).* @param iter the iteration count.* @param n the number of bytes to derive from the password.* @param md the message digest to use, defaults to SHA-1.** @return a ByteBuffer with the bytes derived from the password.*/pki.pbe.generatePkcs12Key = function(password, salt, id, iter, n, md) {var j, l;if(typeof md === 'undefined' || md === null) {if(!('sha1' in forge.md)) {throw new Error('"sha1" hash algorithm unavailable.');}md = forge.md.sha1.create();}var u = md.digestLength;var v = md.blockLength;var r###lt = new forge.util.ByteBuffer();/* Convert password to Unicode byte buffer + trailing 0-byte. */var passBuf = new forge.util.ByteBuffer();if(password !== null && password !== undefined) {for(l = 0; l < password.length; l++) {passBuf.putInt16(password.charCodeAt(l));}passBuf.putInt16(0);}/* Length of salt and password in BYTES. */var p = passBuf.length();var s = salt.length();/* 1. Construct a string, D (the "diversifier"), by concatenatingv copies of ID. */var D = new forge.util.ByteBuffer();D.fillWithByte(id, v);/* 2. Concatenate copies of the salt together to create a string S of lengthv * ceil(s / v) bytes (the final copy of the salt may be trunactedto create S).Note that if the salt is the empty string, then so is S. */var Slen = v * Math.ceil(s / v);var S = new forge.util.ByteBuffer();for(l = 0; l < Slen; l++) {S.putByte(salt.at(l % s));}/* 3. Concatenate copies of the password together to create a string P oflength v * ceil(p / v) bytes (the final copy of the password may betruncated to create P).Note that if the password is the empty string, then so is P. */var Plen = v * Math.ceil(p / v);var P = new forge.util.ByteBuffer();for(l = 0; l < Plen; l++) {P.putByte(passBuf.at(l % p));}/* 4. Set I=S||P to be the concatenation of S and P. */var I = S;I.putBuffer(P);/* 5. Set c=ceil(n / u). */var c = Math.ceil(n / u);/* 6. For i=1, 2, ..., c, do the following: */for(var i = 1; i <= c; i++) {/* a) Set Ai=H^r(D||I). (l.e. the rth hash of D||I, H(H(H(...H(D||I)))) */var buf = new forge.util.ByteBuffer();buf.putBytes(D.bytes());buf.putBytes(I.bytes());for(var round = 0; round < iter; round++) {md.start();md.update(buf.getBytes());buf = md.digest();}/* b) Concatenate copies of Ai to create a string B of length v bytes (thefinal copy of Ai may be truncated to create B). */var B = new forge.util.ByteBuffer();for(l = 0; l < v; l++) {B.putByte(buf.at(l % u));}/* c) Treating I as a concatenation I0, I1, ..., Ik-1 of v-byte blocks,where k=ceil(s / v) + ceil(p / v), modify I by settingIj=(Ij+B+1) mod 2v for each j.  */var k = Math.ceil(s / v) + Math.ceil(p / v);var Inew = new forge.util.ByteBuffer();for(j = 0; j < k; j++) {var chunk = new forge.util.ByteBuffer(I.getBytes(v));var x = 0x1ff;for(l = B.length() - 1; l >= 0; l--) {x = x >> 8;x += B.at(l) + chunk.at(l);chunk.setAt(l, x & 0xff);}Inew.putBuffer(chunk);}I = Inew;/* Add Ai to A. */r###lt.putBuffer(buf);}r###lt.truncate(r###lt.length() - n);return r###lt;};/*** Get new Forge cipher object instance.** @param oid the OID (in string notation).* @param params the ASN.1 params object.* @param password the password to decrypt with.** @return new cipher object instance.*/pki.pbe.getCipher = function(oid, params, password) {switch(oid) {case pki.oids['pkcs5PBES2']:return pki.pbe.getCipherForPBES2(oid, params, password);case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']:case pki.oids['pbewithSHAAnd40BitRC2-CBC']:return pki.pbe.getCipherForPKCS12PBE(oid, params, password);default:var error = new Error('Cannot read encrypted PBE data block. Unsupported OID.');error.oid = oid;error.supportedOids = ['pkcs5PBES2','pbeWithSHAAnd3-KeyTripleDES-CBC','pbewithSHAAnd40BitRC2-CBC'];throw error;}};/*** Get new Forge cipher object instance according to PBES2 params block.** The returned cipher instance is already started using the IV* from PBES2 parameter block.** @param oid the PKCS#5 PBKDF2 OID (in string notation).* @param params the ASN.1 PBES2-params object.* @param password the password to decrypt with.** @return new cipher object instance.*/pki.pbe.getCipherForPBES2 = function(oid, params, password) {// get PBE paramsvar capture = {};var errors = [];if(!asn1.validate(params, PBES2AlgorithmsValidator, capture, errors)) {var error = new Error('Cannot read password-based-encryption algorithm ' +'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.');error.errors = errors;throw error;}// check oidsoid = asn1.derToOid(capture.kdfOid);if(oid !== pki.oids['pkcs5PBKDF2']) {var error = new Error('Cannot read encrypted private key. ' +'Unsupported key derivation function OID.');error.oid = oid;error.supportedOids = ['pkcs5PBKDF2'];throw error;}oid = asn1.derToOid(capture.encOid);if(oid !== pki.oids['aes128-CBC'] &&oid !== pki.oids['aes192-CBC'] &&oid !== pki.oids['aes256-CBC'] &&oid !== pki.oids['des-EDE3-CBC'] &&oid !== pki.oids['desCBC']) {var error = new Error('Cannot read encrypted private key. ' +'Unsupported encryption scheme OID.');error.oid = oid;error.supportedOids = ['aes128-CBC', 'aes192-CBC', 'aes256-CBC', 'des-EDE3-CBC', 'desCBC'];throw error;}// set PBE paramsvar salt = capture.kdfSalt;var count = forge.util.createBuffer(capture.kdfIterationCount);count = count.getInt(count.length() << 3);var dkLen;var cipherFn;switch(pki.oids[oid]) {case 'aes128-CBC':dkLen = 16;cipherFn = forge.aes.createDecryptionCipher;break;case 'aes192-CBC':dkLen = 24;cipherFn = forge.aes.createDecryptionCipher;break;case 'aes256-CBC':dkLen = 32;cipherFn = forge.aes.createDecryptionCipher;break;case 'des-EDE3-CBC':dkLen = 24;cipherFn = forge.des.createDecryptionCipher;break;case 'desCBC':dkLen = 8;cipherFn = forge.des.createDecryptionCipher;break;}// get PRF message digestvar md = prfOidToMessageDigest(capture.prfOid);// decrypt private key using pbe with chosen PRF and AES/DESvar dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen, md);var iv = capture.encIv;var cipher = cipherFn(dk);cipher.start(iv);return cipher;};/*** Get new Forge cipher object instance for PKCS#12 PBE.** The returned cipher instance is already started using the key & IV* derived from the provided password and PKCS#12 PBE salt.** @param oid The PKCS#12 PBE OID (in string notation).* @param params The ASN.1 PKCS#12 PBE-params object.* @param password The password to decrypt with.** @return the new cipher object instance.*/pki.pbe.getCipherForPKCS12PBE = function(oid, params, password) {// get PBE paramsvar capture = {};var errors = [];if(!asn1.validate(params, pkcs12PbeParamsValidator, capture, errors)) {var error = new Error('Cannot read password-based-encryption algorithm ' +'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.');error.errors = errors;throw error;}var salt = forge.util.createBuffer(capture.salt);var count = forge.util.createBuffer(capture.iterations);count = count.getInt(count.length() << 3);var dkLen, dIvLen, cipherFn;switch(oid) {case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']:dkLen = 24;dIvLen = 8;cipherFn = forge.des.startDecrypting;break;case pki.oids['pbewithSHAAnd40BitRC2-CBC']:dkLen = 5;dIvLen = 8;cipherFn = function(key, iv) {var cipher = forge.rc2.createDecryptionCipher(key, 40);cipher.start(iv, null);return cipher;};break;default:var error = new Error('Cannot read PKCS #12 PBE data block. Unsupported OID.');error.oid = oid;throw error;}// get PRF message digestvar md = prfOidToMessageDigest(capture.prfOid);var key = pki.pbe.generatePkcs12Key(password, salt, 1, count, dkLen, md);md.start();var iv = pki.pbe.generatePkcs12Key(password, salt, 2, count, dIvLen, md);return cipherFn(key, iv);};/*** OpenSSL's legacy key derivation function.** See: http://www.openssl.org/docs/crypto/EVP_BytesToKey.html** @param password the password to derive the key from.* @param salt the salt to use, null for none.* @param dkLen the number of bytes needed for the derived key.* @param [options] the options to use:*          [md] an optional message digest object to use.*/pki.pbe.opensslDeriveBytes = function(password, salt, dkLen, md) {if(typeof md === 'undefined' || md === null) {if(!('md5' in forge.md)) {throw new Error('"md5" hash algorithm unavailable.');}md = forge.md.md5.create();}if(salt === null) {salt = '';}var digests = [hash(md, password + salt)];for(var length = 16, i = 1; length < dkLen; ++i, length += 16) {digests.push(hash(md, digests[i - 1] + password + salt));}return digests.join('').substr(0, dkLen);};function hash(md, bytes) {return md.start().update(bytes).digest().getBytes();}function prfOidToMessageDigest(prfOid) {// get PRF algorithm, default to SHA-1var prfAlgorithm;if(!prfOid) {prfAlgorithm = 'hmacWithSHA1';} else {prfAlgorithm = pki.oids[asn1.derToOid(prfOid)];if(!prfAlgorithm) {var error = new Error('Unsupported PRF OID.');error.oid = prfOid;error.supported = ['hmacWithSHA1', 'hmacWithSHA224', 'hmacWithSHA256', 'hmacWithSHA384','hmacWithSHA512'];throw error;}}return prfAlgorithmToMessageDigest(prfAlgorithm);}function prfAlgorithmToMessageDigest(prfAlgorithm) {var factory = forge.md;switch(prfAlgorithm) {case 'hmacWithSHA224':factory = forge.md.sha512;case 'hmacWithSHA1':case 'hmacWithSHA256':case 'hmacWithSHA384':case 'hmacWithSHA512':prfAlgorithm = prfAlgorithm.substr(8).toLowerCase();break;default:var error = new Error('Unsupported PRF algorithm.');error.algorithm = prfAlgorithm;error.supported = ['hmacWithSHA1', 'hmacWithSHA224', 'hmacWithSHA256', 'hmacWithSHA384','hmacWithSHA512'];throw error;}if(!factory || !(prfAlgorithm in factory)) {throw new Error('Unknown hash algorithm: ' + prfAlgorithm);}return factory[prfAlgorithm].create();}function createPbkdf2Params(salt, countBytes, dkLen, prfAlgorithm) {var params = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// saltasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt),// iteration countasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,countBytes.getBytes())]);// when PRF algorithm is not SHA-1 default, add key length and PRF algorithmif(prfAlgorithm !== 'hmacWithSHA1') {params.value.push(// key lengthasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,forge.util.hexToBytes(dkLen.toString(16))),// AlgorithmIdentifierasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids[prfAlgorithm]).getBytes()),// parameters (null)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]));}return params;}/***/ }),/***/ 8322:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Password-Based Key-Derivation Function #2 implementation.** See RFC 2898 for details.** @author Dave Longley** Copyright (c) 2010-2013 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(6080);__webpack_require__(3605);__webpack_require__(2365);var pkcs5 = forge.pkcs5 = forge.pkcs5 || {};var crypto;if(forge.util.isNodejs && !forge.options.usePureJavaScript) {crypto = __webpack_require__(7418);}/*** Derives a key from a password.** @param p the password as a binary-encoded string of bytes.* @param s the salt as a binary-encoded string of bytes.* @param c the iteration count, a positive integer.* @param dkLen the intended length, in bytes, of the derived key,*          (max: 2^32 - 1) * hash length of the PRF.* @param [md] the message digest (or algorithm identifier as a string) to use*          in the PRF, defaults to SHA-1.* @param [callback(err, key)] presence triggers asynchronous version, called*          once the operation completes.** @return the derived key, as a binary-encoded string of bytes, for the*           synchronous version (if no callback is specified).*/module.exports = forge.pbkdf2 = pkcs5.pbkdf2 = function(p, s, c, dkLen, md, callback) {if(typeof md === 'function') {callback = md;md = null;}// use native implementation if possible and not disabled, note that// some node versions only support SHA-1, others allow digest to be changedif(forge.util.isNodejs && !forge.options.usePureJavaScript &&crypto.pbkdf2 && (md === null || typeof md !== 'object') &&(crypto.pbkdf2Sync.length > 4 || (!md || md === 'sha1'))) {if(typeof md !== 'string') {// default prf to SHA-1md = 'sha1';}p = Buffer.from(p, 'binary');s = Buffer.from(s, 'binary');if(!callback) {if(crypto.pbkdf2Sync.length === 4) {return crypto.pbkdf2Sync(p, s, c, dkLen).toString('binary');}return crypto.pbkdf2Sync(p, s, c, dkLen, md).toString('binary');}if(crypto.pbkdf2Sync.length === 4) {return crypto.pbkdf2(p, s, c, dkLen, function(err, key) {if(err) {return callback(err);}callback(null, key.toString('binary'));});}return crypto.pbkdf2(p, s, c, dkLen, md, function(err, key) {if(err) {return callback(err);}callback(null, key.toString('binary'));});}if(typeof md === 'undefined' || md === null) {// default prf to SHA-1md = 'sha1';}if(typeof md === 'string') {if(!(md in forge.md.algorithms)) {throw new Error('Unknown hash algorithm: ' + md);}md = forge.md[md].create();}var hLen = md.digestLength;/* 1. If dkLen > (2^32 - 1) * hLen, output "derived key too long" andstop. */if(dkLen > (0xFFFFFFFF * hLen)) {var err = new Error('Derived key is too long.');if(callback) {return callback(err);}throw err;}/* 2. Let len be the number of hLen-octet blocks in the derived key,rounding up, and let r be the number of octets in the lastblock:len = CEIL(dkLen / hLen),r = dkLen - (len - 1) * hLen. */var len = Math.ceil(dkLen / hLen);var r = dkLen - (len - 1) * hLen;/* 3. For each block of the derived key apply the function F definedbelow to the password P, the salt S, the iteration count c, andthe block index to compute the block:T_1 = F(P, S, c, 1),T_2 = F(P, S, c, 2),...T_len = F(P, S, c, len),where the function F is defined as the exclusive-or sum of thefirst c iterates of the underlying pseudorandom function PRFapplied to the password P and the concatenation of the salt Sand the block index i:F(P, S, c, i) = u_1 XOR u_2 XOR ... XOR u_cwhereu_1 = PRF(P, S || INT(i)),u_2 = PRF(P, u_1),...u_c = PRF(P, u_{c-1}).Here, INT(i) is a four-octet encoding of the integer i, mostsignificant octet first. */var prf = forge.hmac.create();prf.start(md, p);var dk = '';var xor, u_c, u_c1;// sync versionif(!callback) {for(var i = 1; i <= len; ++i) {// PRF(P, S || INT(i)) (first iteration)prf.start(null, null);prf.update(s);prf.update(forge.util.int32ToBytes(i));xor = u_c1 = prf.digest().getBytes();// PRF(P, u_{c-1}) (other iterations)for(var j = 2; j <= c; ++j) {prf.start(null, null);prf.update(u_c1);u_c = prf.digest().getBytes();// F(p, s, c, i)xor = forge.util.xorBytes(xor, u_c, hLen);u_c1 = u_c;}/* 4. Concatenate the blocks and extract the first dkLen octets toproduce a derived key DK:DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */dk += (i < len) ? xor : xor.substr(0, r);}/* 5. Output the derived key DK. */return dk;}// async versionvar i = 1, j;function outer() {if(i > len) {// donereturn callback(null, dk);}// PRF(P, S || INT(i)) (first iteration)prf.start(null, null);prf.update(s);prf.update(forge.util.int32ToBytes(i));xor = u_c1 = prf.digest().getBytes();// PRF(P, u_{c-1}) (other iterations)j = 2;inner();}function inner() {if(j <= c) {prf.start(null, null);prf.update(u_c1);u_c = prf.digest().getBytes();// F(p, s, c, i)xor = forge.util.xorBytes(xor, u_c, hLen);u_c1 = u_c;++j;return forge.util.setImmediate(inner);}/* 4. Concatenate the blocks and extract the first dkLen octets toproduce a derived key DK:DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */dk += (i < len) ? xor : xor.substr(0, r);++i;outer();}outer();};/***/ }),/***/ 2966:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of basic PEM (Privacy Enhanced Mail) algorithms.** See: RFC 1421.** @author Dave Longley** Copyright (c) 2013-2014 Digital Bazaar, Inc.** A Forge PEM object has the following fields:** type: identifies the type of message (eg: "RSA PRIVATE KEY").** procType: identifies the type of processing performed on the message,*   it has two subfields: version and type, eg: 4,ENCRYPTED.** contentDomain: identifies the type of content in the message, typically*   only uses the value: "RFC822".** dekInfo: identifies the message encryption algorithm and mode and includes*   any parameters for the algorithm, it has two subfields: algorithm and*   parameters, eg: DES-CBC,F8143EDE5960C597.** headers: contains all other PEM encapsulated headers -- where order is*   significant (for pairing data like recipient ID + key info).** body: the binary-encoded body.*/var forge = __webpack_require__(7009);__webpack_require__(2365);// shortcut for pem APIvar pem = module.exports = forge.pem = forge.pem || {};/*** Encodes (serializes) the given PEM object.** @param msg the PEM message object to encode.* @param options the options to use:*          maxline the maximum characters per line for the body, (default: 64).** @return the PEM-formatted string.*/pem.encode = function(msg, options) {options = options || {};var rval = '-----BEGIN ' + msg.type + '-----\r\n';// encode special headersvar header;if(msg.procType) {header = {name: 'Proc-Type',values: [String(msg.procType.version), msg.procType.type]};rval += foldHeader(header);}if(msg.contentDomain) {header = {name: 'Content-Domain', values: [msg.contentDomain]};rval += foldHeader(header);}if(msg.dekInfo) {header = {name: 'DEK-Info', values: [msg.dekInfo.algorithm]};if(msg.dekInfo.parameters) {header.values.push(msg.dekInfo.parameters);}rval += foldHeader(header);}if(msg.headers) {// encode all other headersfor(var i = 0; i < msg.headers.length; ++i) {rval += foldHeader(msg.headers[i]);}}// terminate headerif(msg.procType) {rval += '\r\n';}// add bodyrval += forge.util.encode64(msg.body, options.maxline || 64) + '\r\n';rval += '-----END ' + msg.type + '-----\r\n';return rval;};/*** Decodes (deserializes) all PEM messages found in the given string.** @param str the PEM-formatted string to decode.** @return the PEM message objects in an array.*/pem.decode = function(str) {var rval = [];// split string into PEM messages (be lenient w/EOF on BEGIN line)var rMessage = /\s*-----BEGIN ([A-Z0-9- ]+)-----\r?\n?([\x21-\x7e\s]+?(?:\r?\n\r?\n))?([:A-Za-z0-9+\/=\s]+?)-----END \1-----/g;var rHeader = /([\x21-\x7e]+):\s*([\x21-\x7e\s^:]+)/;var rCRLF = /\r?\n/;var match;while(true) {match = rMessage.exec(str);if(!match) {break;}var msg = {type: match[1],procType: null,contentDomain: null,dekInfo: null,headers: [],body: forge.util.decode64(match[3])};rval.push(msg);// no headersif(!match[2]) {continue;}// parse headersvar lines = match[2].split(rCRLF);var li = 0;while(match && li < lines.length) {// get line, trim any rhs whitespacevar line = lines[li].replace(/\s+$/, '');// RFC2822 unfold any following folded linesfor(var nl = li + 1; nl < lines.length; ++nl) {var next = lines[nl];if(!/\s/.test(next[0])) {break;}line += next;li = nl;}// parse headermatch = line.match(rHeader);if(match) {var header = {name: match[1], values: []};var values = match[2].split(',');for(var vi = 0; vi < values.length; ++vi) {header.values.push(ltrim(values[vi]));}// Proc-Type must be the first headerif(!msg.procType) {if(header.name !== 'Proc-Type') {throw new Error('Invalid PEM formatted message. The first ' +'encapsulated header must be "Proc-Type".');} else if(header.values.length !== 2) {throw new Error('Invalid PEM formatted message. The "Proc-Type" ' +'header must have two subfields.');}msg.procType = {version: values[0], type: values[1]};} else if(!msg.contentDomain && header.name === 'Content-Domain') {// special-case Content-Domainmsg.contentDomain = values[0] || '';} else if(!msg.dekInfo && header.name === 'DEK-Info') {// special-case DEK-Infoif(header.values.length === 0) {throw new Error('Invalid PEM formatted message. The "DEK-Info" ' +'header must have at least one subfield.');}msg.dekInfo = {algorithm: values[0], parameters: values[1] || null};} else {msg.headers.push(header);}}++li;}if(msg.procType === 'ENCRYPTED' && !msg.dekInfo) {throw new Error('Invalid PEM formatted message. The "DEK-Info" ' +'header must be present if "Proc-Type" is "ENCRYPTED".');}}if(rval.length === 0) {throw new Error('Invalid PEM formatted message.');}return rval;};function foldHeader(header) {var rval = header.name + ': ';// ensure values with CRLF are foldedvar values = [];var insertSpace = function(match, $1) {return ' ' + $1;};for(var i = 0; i < header.values.length; ++i) {values.push(header.values[i].replace(/^(\S+\r\n)/, insertSpace));}rval += values.join(',') + '\r\n';// do foldingvar length = 0;var candidate = -1;for(var i = 0; i < rval.length; ++i, ++length) {if(length > 65 && candidate !== -1) {var insert = rval[candidate];if(insert === ',') {++candidate;rval = rval.substr(0, candidate) + '\r\n ' + rval.substr(candidate);} else {rval = rval.substr(0, candidate) +'\r\n' + insert + rval.substr(candidate + 1);}length = (i - candidate - 1);candidate = -1;++i;} else if(rval[i] === ' ' || rval[i] === '\t' || rval[i] === ',') {candidate = i;}}return rval;}function ltrim(str) {return str.replace(/^\s+/, '');}/***/ }),/***/ 4188:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Partial implementation of PKCS#1 v2.2: RSA-OEAP** Modified but based on the following MIT and BSD licensed code:** https://github.com/kjur/jsjws/blob/master/rsa.js:** The 'jsjws'(JSON Web Signature JavaScript Library) License** Copyright (c) 2012 Kenji Urushima** 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.** http://webrsa.cvs.sourceforge.net/viewvc/webrsa/Client/RSAES-OAEP.js?content-type=text%2Fplain:** RSAES-OAEP.js* $Id: RSAES-OAEP.js,v 1.1.1.1 2003/03/19 15:37:20 ellispritchard Exp $* JavaScript Implementation of PKCS #1 v2.1 RSA CRYPTOGRAPHY STANDARD (RSA Laboratories, June 14, 2002)* Copyright (C) Ellis Pritchard, Guardian Unlimited 2003.* Contact: [email protected]* Distributed under the BSD License.** Official documentation: http://www.rsa.com/rsalabs/node.asp?id=2125** @author Evan Jones (http://evanjones.ca/)* @author Dave Longley** Copyright (c) 2013-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);__webpack_require__(6660);__webpack_require__(7499);// shortcut for PKCS#1 APIvar pkcs1 = module.exports = forge.pkcs1 = forge.pkcs1 || {};/*** Encode the given RSAES-OAEP message (M) using key, with optional label (L)* and seed.** This method does not perform RSA encryption, it only encodes the message* using RSAES-OAEP.** @param key the RSA key to use.* @param message the message to encode.* @param options the options to use:*          label an optional label to use.*          seed the seed to use.*          md the message digest object to use, undefined for SHA-1.*          mgf1 optional mgf1 parameters:*            md the message digest object to use for MGF1.** @return the encoded message bytes.*/pkcs1.encode_rsa_oaep = function(key, message, options) {// parse argumentsvar label;var seed;var md;var mgf1Md;// legacy args (label, seed, md)if(typeof options === 'string') {label = options;seed = arguments[3] || undefined;md = arguments[4] || undefined;} else if(options) {label = options.label || undefined;seed = options.seed || undefined;md = options.md || undefined;if(options.mgf1 && options.mgf1.md) {mgf1Md = options.mgf1.md;}}// default OAEP to SHA-1 message digestif(!md) {md = forge.md.sha1.create();} else {md.start();}// default MGF-1 to same as OAEPif(!mgf1Md) {mgf1Md = md;}// compute length in bytes and check outputvar keyLength = Math.ceil(key.n.bitLength() / 8);var maxLength = keyLength - 2 * md.digestLength - 2;if(message.length > maxLength) {var error = new Error('RSAES-OAEP input message length is too long.');error.length = message.length;error.maxLength = maxLength;throw error;}if(!label) {label = '';}md.update(label, 'raw');var lHash = md.digest();var PS = '';var PS_length = maxLength - message.length;for(var i = 0; i < PS_length; i++) {PS += '\x00';}var DB = lHash.getBytes() + PS + '\x01' + message;if(!seed) {seed = forge.random.getBytes(md.digestLength);} else if(seed.length !== md.digestLength) {var error = new Error('Invalid RSAES-OAEP seed. The seed length must ' +'match the digest length.');error.seedLength = seed.length;error.digestLength = md.digestLength;throw error;}var dbMask = rsa_mgf1(seed, keyLength - md.digestLength - 1, mgf1Md);var maskedDB = forge.util.xorBytes(DB, dbMask, DB.length);var seedMask = rsa_mgf1(maskedDB, md.digestLength, mgf1Md);var maskedSeed = forge.util.xorBytes(seed, seedMask, seed.length);// return encoded messagereturn '\x00' + maskedSeed + maskedDB;};/*** Decode the given RSAES-OAEP encoded message (EM) using key, with optional* label (L).** This method does not perform RSA decryption, it only decodes the message* using RSAES-OAEP.** @param key the RSA key to use.* @param em the encoded message to decode.* @param options the options to use:*          label an optional label to use.*          md the message digest object to use for OAEP, undefined for SHA-1.*          mgf1 optional mgf1 parameters:*            md the message digest object to use for MGF1.** @return the decoded message bytes.*/pkcs1.decode_rsa_oaep = function(key, em, options) {// parse argsvar label;var md;var mgf1Md;// legacy argsif(typeof options === 'string') {label = options;md = arguments[3] || undefined;} else if(options) {label = options.label || undefined;md = options.md || undefined;if(options.mgf1 && options.mgf1.md) {mgf1Md = options.mgf1.md;}}// compute length in bytesvar keyLength = Math.ceil(key.n.bitLength() / 8);if(em.length !== keyLength) {var error = new Error('RSAES-OAEP encoded message length is invalid.');error.length = em.length;error.expectedLength = keyLength;throw error;}// default OAEP to SHA-1 message digestif(md === undefined) {md = forge.md.sha1.create();} else {md.start();}// default MGF-1 to same as OAEPif(!mgf1Md) {mgf1Md = md;}if(keyLength < 2 * md.digestLength + 2) {throw new Error('RSAES-OAEP key is too short for the hash function.');}if(!label) {label = '';}md.update(label, 'raw');var lHash = md.digest().getBytes();// split the message into its partsvar y = em.charAt(0);var maskedSeed = em.substring(1, md.digestLength + 1);var maskedDB = em.substring(1 + md.digestLength);var seedMask = rsa_mgf1(maskedDB, md.digestLength, mgf1Md);var seed = forge.util.xorBytes(maskedSeed, seedMask, maskedSeed.length);var dbMask = rsa_mgf1(seed, keyLength - md.digestLength - 1, mgf1Md);var db = forge.util.xorBytes(maskedDB, dbMask, maskedDB.length);var lHashPrime = db.substring(0, md.digestLength);// constant time check that all values match what is expectedvar error = (y !== '\x00');// constant time check lHash vs lHashPrimefor(var i = 0; i < md.digestLength; ++i) {error |= (lHash.charAt(i) !== lHashPrime.charAt(i));}// "constant time" find the 0x1 byte separating the padding (zeros) from the// message// TODO: It must be possible to do this in a better/smarter way?var in_ps = 1;var index = md.digestLength;for(var j = md.digestLength; j < db.length; j++) {var code = db.charCodeAt(j);var is_0 = (code & 0x1) ^ 0x1;// non-zero if not 0 or 1 in the ps sectionvar error_mask = in_ps ? 0xfffe : 0x0000;error |= (code & error_mask);// latch in_ps to zero after we find 0x1in_ps = in_ps & is_0;index += in_ps;}if(error || db.charCodeAt(index) !== 0x1) {throw new Error('Invalid RSAES-OAEP padding.');}return db.substring(index + 1);};function rsa_mgf1(seed, maskLength, hash) {// default to SHA-1 message digestif(!hash) {hash = forge.md.sha1.create();}var t = '';var count = Math.ceil(maskLength / hash.digestLength);for(var i = 0; i < count; ++i) {var c = String.fromCharCode((i >> 24) & 0xFF, (i >> 16) & 0xFF, (i >> 8) & 0xFF, i & 0xFF);hash.start();hash.update(seed + c);t += hash.digest().getBytes();}return t.substring(0, maskLength);}/***/ }),/***/ 1335:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of PKCS#12.** @author Dave Longley* @author Stefan Siegl <[email protected]>** Copyright (c) 2010-2014 Digital Bazaar, Inc.* Copyright (c) 2012 Stefan Siegl <[email protected]>** The ASN.1 representation of PKCS#12 is as follows* (see ftp://ftp.rsasecurity.com/pub/pkcs/pkcs-12/pkcs-12-tc1.pdf for details)** PFX ::= SEQUENCE {*   version  INTEGER {v3(3)}(v3,...),*   authSafe ContentInfo,*   macData  MacData OPTIONAL* }** MacData ::= SEQUENCE {*   mac DigestInfo,*   macSalt OCTET STRING,*   iterations INTEGER DEFAULT 1* }* Note: The iterations default is for historical reasons and its use is* deprecated. A higher value, like ####, is recommended.** DigestInfo is defined in PKCS#7 as follows:** DigestInfo ::= SEQUENCE {*   digestAlgorithm DigestAlgorithmIdentifier,*   digest Digest* }** DigestAlgorithmIdentifier ::= AlgorithmIdentifier** The AlgorithmIdentifier contains an Object Identifier (OID) and parameters* for the algorithm, if any. In the case of SHA1 there is none.** AlgorithmIdentifer ::= SEQUENCE {*    algorithm OBJECT IDENTIFIER,*    parameters ANY DEFINED BY algorithm OPTIONAL* }** Digest ::= OCTET STRING*** ContentInfo ::= SEQUENCE {*   contentType ContentType,*   content     [0] EXPLICIT ANY DEFINED BY contentType OPTIONAL* }** ContentType ::= OBJECT IDENTIFIER** AuthenticatedSafe ::= SEQUENCE OF ContentInfo* -- Data if unencrypted* -- EncryptedData if password-encrypted* -- EnvelopedData if public key-encrypted*** SafeContents ::= SEQUENCE OF SafeBag** SafeBag ::= SEQUENCE {*   bagId     BAG-TYPE.&id ({PKCS12BagSet})*   bagValue  [0] EXPLICIT BAG-TYPE.&Type({PKCS12BagSet}{@bagId}),*   bagAttributes SET OF PKCS12Attribute OPTIONAL* }** PKCS12Attribute ::= SEQUENCE {*   attrId ATTRIBUTE.&id ({PKCS12AttrSet}),*   attrValues SET OF ATTRIBUTE.&Type ({PKCS12AttrSet}{@attrId})* } -- This type is compatible with the X.500 type 'Attribute'** PKCS12AttrSet ATTRIBUTE ::= {*   friendlyName | -- from PKCS #9*   localKeyId, -- from PKCS #9*   ... -- Other attributes are allowed* }** CertBag ::= SEQUENCE {*   certId    BAG-TYPE.&id   ({CertTypes}),*   certValue [0] EXPLICIT BAG-TYPE.&Type ({CertTypes}{@certId})* }** x509Certificate BAG-TYPE ::= {OCTET STRING IDENTIFIED BY {certTypes 1}}*   -- DER-encoded X.509 certificate stored in OCTET STRING** sdsiCertificate BAG-TYPE ::= {IA5String IDENTIFIED BY {certTypes 2}}* -- Base64-encoded SDSI certificate stored in IA5String** CertTypes BAG-TYPE ::= {*   x509Certificate |*   sdsiCertificate,*   ... -- For future extensions* }*/var forge = __webpack_require__(7009);__webpack_require__(1598);__webpack_require__(6080);__webpack_require__(1692);__webpack_require__(393);__webpack_require__(2079);__webpack_require__(6660);__webpack_require__(524);__webpack_require__(7499);__webpack_require__(2365);__webpack_require__(256);// shortcut for asn.1 & PKI APIvar asn1 = forge.asn1;var pki = forge.pki;// shortcut for PKCS#12 APIvar p12 = module.exports = forge.pkcs12 = forge.pkcs12 || {};var contentInfoValidator = {name: 'ContentInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,  // a ContentInfoconstructed: true,value: [{name: 'ContentInfo.contentType',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'contentType'}, {name: 'ContentInfo.content',tagClass: asn1.Class.CONTEXT_SPECIFIC,constructed: true,captureAsn1: 'content'}]};var pfxValidator = {name: 'PFX',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'PFX.version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'version'},contentInfoValidator, {name: 'PFX.macData',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,optional: true,captureAsn1: 'mac',value: [{name: 'PFX.macData.mac',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,  // DigestInfoconstructed: true,value: [{name: 'PFX.macData.mac.digestAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,  // DigestAlgorithmIdentifierconstructed: true,value: [{name: 'PFX.macData.mac.digestAlgorithm.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'macAlgorithm'}, {name: 'PFX.macData.mac.digestAlgorithm.parameters',tagClass: asn1.Class.UNIVERSAL,captureAsn1: 'macAlgorithmParameters'}]}, {name: 'PFX.macData.mac.digest',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'macDigest'}]}, {name: 'PFX.macData.macSalt',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'macSalt'}, {name: 'PFX.macData.iterations',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,optional: true,capture: 'macIterations'}]}]};var safeBagValidator = {name: 'SafeBag',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'SafeBag.bagId',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'bagId'}, {name: 'SafeBag.bagValue',tagClass: asn1.Class.CONTEXT_SPECIFIC,constructed: true,captureAsn1: 'bagValue'}, {name: 'SafeBag.bagAttributes',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SET,constructed: true,optional: true,capture: 'bagAttributes'}]};var attributeValidator = {name: 'Attribute',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'Attribute.attrId',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'oid'}, {name: 'Attribute.attrValues',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SET,constructed: true,capture: 'values'}]};var certBagValidator = {name: 'CertBag',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'CertBag.certId',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'certId'}, {name: 'CertBag.certValue',tagClass: asn1.Class.CONTEXT_SPECIFIC,constructed: true,/* So far we only support X.509 certificates (which are wrapped inan OCTET STRING, hence hard code that here). */value: [{name: 'CertBag.certValue[0]',tagClass: asn1.Class.UNIVERSAL,type: asn1.Class.OCTETSTRING,constructed: false,capture: 'cert'}]}]};/*** Search SafeContents structure for bags with matching attributes.** The search can optionally be narrowed by a certain bag type.** @param safeContents the SafeContents structure to search in.* @param attrName the name of the attribute to compare against.* @param attrValue the attribute value to search for.* @param [bagType] bag type to narrow search by.** @return an array of matching bags.*/function _getBagsByAttribute(safeContents, attrName, attrValue, bagType) {var r###lt = [];for(var i = 0; i < safeContents.length; i++) {for(var j = 0; j < safeContents[i].safeBags.length; j++) {var bag = safeContents[i].safeBags[j];if(bagType !== undefined && bag.type !== bagType) {continue;}// only filter by bag type, no attribute specifiedif(attrName === null) {r###lt.push(bag);continue;}if(bag.attributes[attrName] !== undefined &&bag.attributes[attrName].indexOf(attrValue) >= 0) {r###lt.push(bag);}}}return r###lt;}/*** Converts a PKCS#12 PFX in ASN.1 notation into a PFX object.** @param obj The PKCS#12 PFX in ASN.1 notation.* @param strict true to use strict DER decoding, false not to (default: true).* @param {String} password Password to decrypt with (optional).** @return PKCS#12 PFX object.*/p12.pkcs12FromAsn1 = function(obj, strict, password) {// handle argsif(typeof strict === 'string') {password = strict;strict = true;} else if(strict === undefined) {strict = true;}// validate PFX and capture datavar capture = {};var errors = [];if(!asn1.validate(obj, pfxValidator, capture, errors)) {var error = new Error('Cannot read PKCS#12 PFX. ' +'ASN.1 object is not an PKCS#12 PFX.');error.errors = error;throw error;}var pfx = {version: capture.version.charCodeAt(0),safeContents: [],/*** Gets bags with matching attributes.** @param filter the attributes to filter by:*          [localKeyId] the localKeyId to search for.*          [localKeyIdHex] the localKeyId in hex to search for.*          [friendlyName] the friendly name to search for.*          [bagType] bag type to narrow each attribute search by.** @return a map of attribute type to an array of matching bags or, if no*           attribute was given but a bag type, the map key will be the*           bag type.*/getBags: function(filter) {var rval = {};var localKeyId;if('localKeyId' in filter) {localKeyId = filter.localKeyId;} else if('localKeyIdHex' in filter) {localKeyId = forge.util.hexToBytes(filter.localKeyIdHex);}// filter on bagType onlyif(localKeyId === undefined && !('friendlyName' in filter) &&'bagType' in filter) {rval[filter.bagType] = _getBagsByAttribute(pfx.safeContents, null, null, filter.bagType);}if(localKeyId !== undefined) {rval.localKeyId = _getBagsByAttribute(pfx.safeContents, 'localKeyId',localKeyId, filter.bagType);}if('friendlyName' in filter) {rval.friendlyName = _getBagsByAttribute(pfx.safeContents, 'friendlyName',filter.friendlyName, filter.bagType);}return rval;},/*** DEPRECATED: use getBags() instead.** Get bags with matching friendlyName attribute.** @param friendlyName the friendly name to search for.* @param [bagType] bag type to narrow search by.** @return an array of bags with matching friendlyName attribute.*/getBagsByFriendlyName: function(friendlyName, bagType) {return _getBagsByAttribute(pfx.safeContents, 'friendlyName', friendlyName, bagType);},/*** DEPRECATED: use getBags() instead.** Get bags with matching localKeyId attribute.** @param localKeyId the localKeyId to search for.* @param [bagType] bag type to narrow search by.** @return an array of bags with matching localKeyId attribute.*/getBagsByLocalKeyId: function(localKeyId, bagType) {return _getBagsByAttribute(pfx.safeContents, 'localKeyId', localKeyId, bagType);}};if(capture.version.charCodeAt(0) !== 3) {var error = new Error('PKCS#12 PFX of version other than 3 not supported.');error.version = capture.version.charCodeAt(0);throw error;}if(asn1.derToOid(capture.contentType) !== pki.oids.data) {var error = new Error('Only PKCS#12 PFX in password integrity mode supported.');error.oid = asn1.derToOid(capture.contentType);throw error;}var data = capture.content.value[0];if(data.tagClass !== asn1.Class.UNIVERSAL ||data.type !== asn1.Type.OCTETSTRING) {throw new Error('PKCS#12 authSafe content data is not an OCTET STRING.');}data = _decodePkcs7Data(data);// check for MACif(capture.mac) {var md = null;var macKeyBytes = 0;var macAlgorithm = asn1.derToOid(capture.macAlgorithm);switch(macAlgorithm) {case pki.oids.sha1:md = forge.md.sha1.create();macKeyBytes = 20;break;case pki.oids.sha256:md = forge.md.sha256.create();macKeyBytes = 32;break;case pki.oids.sha384:md = forge.md.sha384.create();macKeyBytes = 48;break;case pki.oids.sha512:md = forge.md.sha512.create();macKeyBytes = 64;break;case pki.oids.md5:md = forge.md.md5.create();macKeyBytes = 16;break;}if(md === null) {throw new Error('PKCS#12 uses unsupported MAC algorithm: ' + macAlgorithm);}// verify MAC (iterations default to 1)var macSalt = new forge.util.ByteBuffer(capture.macSalt);var macIterations = (('macIterations' in capture) ?parseInt(forge.util.bytesToHex(capture.macIterations), 16) : 1);var macKey = p12.generateKey(password, macSalt, 3, macIterations, macKeyBytes, md);var mac = forge.hmac.create();mac.start(md, macKey);mac.update(data.value);var macValue = mac.getMac();if(macValue.getBytes() !== capture.macDigest) {throw new Error('PKCS#12 MAC could not be verified. Invalid password?');}}_decodeAuthenticatedSafe(pfx, data.value, strict, password);return pfx;};/*** Decodes PKCS#7 Data. PKCS#7 (RFC 2315) defines "Data" as an OCTET STRING,* but it is sometimes an OCTET STRING that is composed/constructed of chunks,* each its own OCTET STRING. This is BER-encoding vs. DER-encoding. This* function transforms this corner-case into the usual simple,* non-composed/constructed OCTET STRING.** This function may be moved to ASN.1 at some point to better deal with* more BER-encoding issues, should they arise.** @param data the ASN.1 Data object to transform.*/function _decodePkcs7Data(data) {// handle special case of "chunked" data content: an octet string composed// of other octet stringsif(data.composed || data.constructed) {var value = forge.util.createBuffer();for(var i = 0; i < data.value.length; ++i) {value.putBytes(data.value[i].value);}data.composed = data.constructed = false;data.value = value.getBytes();}return data;}/*** Decode PKCS#12 AuthenticatedSafe (BER encoded) into PFX object.** The AuthenticatedSafe is a BER-encoded SEQUENCE OF ContentInfo.** @param pfx The PKCS#12 PFX object to fill.* @param {String} authSafe BER-encoded AuthenticatedSafe.* @param strict true to use strict DER decoding, false not to.* @param {String} password Password to decrypt with (optional).*/function _decodeAuthenticatedSafe(pfx, authSafe, strict, password) {authSafe = asn1.fromDer(authSafe, strict);  /* actually it's BER encoded */if(authSafe.tagClass !== asn1.Class.UNIVERSAL ||authSafe.type !== asn1.Type.SEQUENCE ||authSafe.constructed !== true) {throw new Error('PKCS#12 AuthenticatedSafe expected to be a ' +'SEQUENCE OF ContentInfo');}for(var i = 0; i < authSafe.value.length; i++) {var contentInfo = authSafe.value[i];// validate contentInfo and capture datavar capture = {};var errors = [];if(!asn1.validate(contentInfo, contentInfoValidator, capture, errors)) {var error = new Error('Cannot read ContentInfo.');error.errors = errors;throw error;}var obj = {encrypted: false};var safeContents = null;var data = capture.content.value[0];switch(asn1.derToOid(capture.contentType)) {case pki.oids.data:if(data.tagClass !== asn1.Class.UNIVERSAL ||data.type !== asn1.Type.OCTETSTRING) {throw new Error('PKCS#12 SafeContents Data is not an OCTET STRING.');}safeContents = _decodePkcs7Data(data).value;break;case pki.oids.encryptedData:safeContents = _decryptSafeContents(data, password);obj.encrypted = true;break;default:var error = new Error('Unsupported PKCS#12 contentType.');error.contentType = asn1.derToOid(capture.contentType);throw error;}obj.safeBags = _decodeSafeContents(safeContents, strict, password);pfx.safeContents.push(obj);}}/*** Decrypt PKCS#7 EncryptedData structure.** @param data ASN.1 encoded EncryptedContentInfo object.* @param password The user-provided password.** @return The decrypted SafeContents (ASN.1 object).*/function _decryptSafeContents(data, password) {var capture = {};var errors = [];if(!asn1.validate(data, forge.pkcs7.asn1.encryptedDataValidator, capture, errors)) {var error = new Error('Cannot read EncryptedContentInfo.');error.errors = errors;throw error;}var oid = asn1.derToOid(capture.contentType);if(oid !== pki.oids.data) {var error = new Error('PKCS#12 EncryptedContentInfo ContentType is not Data.');error.oid = oid;throw error;}// get cipheroid = asn1.derToOid(capture.encAlgorithm);var cipher = pki.pbe.getCipher(oid, capture.encParameter, password);// get encrypted datavar encryptedContentAsn1 = _decodePkcs7Data(capture.encryptedContentAsn1);var encrypted = forge.util.createBuffer(encryptedContentAsn1.value);cipher.update(encrypted);if(!cipher.finish()) {throw new Error('Failed to decrypt PKCS#12 SafeContents.');}return cipher.output.getBytes();}/*** Decode PKCS#12 SafeContents (BER-encoded) into array of Bag objects.** The safeContents is a BER-encoded SEQUENCE OF SafeBag.** @param {String} safeContents BER-encoded safeContents.* @param strict true to use strict DER decoding, false not to.* @param {String} password Password to decrypt with (optional).** @return {Array} Array of Bag objects.*/function _decodeSafeContents(safeContents, strict, password) {// if strict and no safe contents, return empty safesif(!strict && safeContents.length === 0) {return [];}// actually it's BER-encodedsafeContents = asn1.fromDer(safeContents, strict);if(safeContents.tagClass !== asn1.Class.UNIVERSAL ||safeContents.type !== asn1.Type.SEQUENCE ||safeContents.constructed !== true) {throw new Error('PKCS#12 SafeContents expected to be a SEQUENCE OF SafeBag.');}var res = [];for(var i = 0; i < safeContents.value.length; i++) {var safeBag = safeContents.value[i];// validate SafeBag and capture datavar capture = {};var errors = [];if(!asn1.validate(safeBag, safeBagValidator, capture, errors)) {var error = new Error('Cannot read SafeBag.');error.errors = errors;throw error;}/* Create bag object and push to r###lt array. */var bag = {type: asn1.derToOid(capture.bagId),attributes: _decodeBagAttributes(capture.bagAttributes)};res.push(bag);var validator, decoder;var bagAsn1 = capture.bagValue.value[0];switch(bag.type) {case pki.oids.pkcs8ShroudedKeyBag:/* bagAsn1 has a EncryptedPrivateKeyInfo, which we need to decrypt.Afterwards we can handle it like a keyBag,which is a PrivateKeyInfo. */bagAsn1 = pki.decryptPrivateKeyInfo(bagAsn1, password);if(bagAsn1 === null) {throw new Error('Unable to decrypt PKCS#8 ShroudedKeyBag, wrong password?');}/* fall through */case pki.oids.keyBag:/* A PKCS#12 keyBag is a simple PrivateKeyInfo as understood by ourPKI module, hence we don't have to do validation/capturing here,just pass what we already got. */try {bag.key = pki.privateKeyFromAsn1(bagAsn1);} catch(e) {// ignore unknown key type, pass asn1 valuebag.key = null;bag.asn1 = bagAsn1;}continue;  /* Nothing more to do. */case pki.oids.certBag:/* A PKCS#12 certBag can wrap both X.509 and sdsi certificates.Therefore put the SafeBag content through another validator tocapture the fields.  Afterwards check & store the r###lts. */validator = certBagValidator;decoder = function() {if(asn1.derToOid(capture.certId) !== pki.oids.x509Certificate) {var error = new Error('Unsupported certificate type, only X.509 supported.');error.oid = asn1.derToOid(capture.certId);throw error;}// true=produce cert hashvar certAsn1 = asn1.fromDer(capture.cert, strict);try {bag.cert = pki.certificateFromAsn1(certAsn1, true);} catch(e) {// ignore unknown cert type, pass asn1 valuebag.cert = null;bag.asn1 = certAsn1;}};break;default:var error = new Error('Unsupported PKCS#12 SafeBag type.');error.oid = bag.type;throw error;}/* Validate SafeBag value (i.e. CertBag, etc.) and capture data if needed. */if(validator !== undefined &&!asn1.validate(bagAsn1, validator, capture, errors)) {var error = new Error('Cannot read PKCS#12 ' + validator.name);error.errors = errors;throw error;}/* Call decoder function from above to store the r###lts. */decoder();}return res;}/*** Decode PKCS#12 SET OF PKCS12Attribute into JavaScript object.** @param attributes SET OF PKCS12Attribute (ASN.1 object).** @return the decoded attributes.*/function _decodeBagAttributes(attributes) {var decodedAttrs = {};if(attributes !== undefined) {for(var i = 0; i < attributes.length; ++i) {var capture = {};var errors = [];if(!asn1.validate(attributes[i], attributeValidator, capture, errors)) {var error = new Error('Cannot read PKCS#12 BagAttribute.');error.errors = errors;throw error;}var oid = asn1.derToOid(capture.oid);if(pki.oids[oid] === undefined) {// unsupported attribute type, ignore.continue;}decodedAttrs[pki.oids[oid]] = [];for(var j = 0; j < capture.values.length; ++j) {decodedAttrs[pki.oids[oid]].push(capture.values[j].value);}}}return decodedAttrs;}/*** Wraps a private key and certificate in a PKCS#12 PFX wrapper. If a* password is provided then the private key will be encrypted.** An entire certificate chain may also be included. To do this, pass* an array for the "cert" parameter where the first certificate is* the one that is paired with the private key and each subsequent one* verifies the previous one. The certificates may be in PEM format or* have been already parsed by Forge.** @todo implement password-based-encryption for the whole package** @param key the private key.* @param cert the certificate (may be an array of certificates in order*          to specify a certificate chain).* @param password the password to use, null for none.* @param options:*          algorithm the encryption algorithm to use*            ('aes128', 'aes192', 'aes256', '3des'), defaults to 'aes128'.*          count the iteration count to use.*          saltSize the salt size to use.*          useMac true to include a MAC, false not to, defaults to true.*          localKeyId the local key ID to use, in hex.*          friendlyName the friendly name to use.*          generateLocalKeyId true to generate a random local key ID,*            false not to, defaults to true.** @return the PKCS#12 PFX ASN.1 object.*/p12.toPkcs12Asn1 = function(key, cert, password, options) {// set default optionsoptions = options || {};options.saltSize = options.saltSize || 8;options.count = options.count || 2048;options.algorithm = options.algorithm || options.encAlgorithm || 'aes128';if(!('useMac' in options)) {options.useMac = true;}if(!('localKeyId' in options)) {options.localKeyId = null;}if(!('generateLocalKeyId' in options)) {options.generateLocalKeyId = true;}var localKeyId = options.localKeyId;var bagAttrs;if(localKeyId !== null) {localKeyId = forge.util.hexToBytes(localKeyId);} else if(options.generateLocalKeyId) {// use SHA-1 of paired cert, if availableif(cert) {var pairedCert = forge.util.isArray(cert) ? cert[0] : cert;if(typeof pairedCert === 'string') {pairedCert = pki.certificateFromPem(pairedCert);}var sha1 = forge.md.sha1.create();sha1.update(asn1.toDer(pki.certificateToAsn1(pairedCert)).getBytes());localKeyId = sha1.digest().getBytes();} else {// FIXME: consider using SHA-1 of public key (which can be generated// from private key components), see: cert.generat###bjectKeyIdentifier// generate random byteslocalKeyId = forge.random.getBytes(20);}}var attrs = [];if(localKeyId !== null) {attrs.push(// localKeyIDasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// attrIdasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.localKeyId).getBytes()),// attrValuesasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,localKeyId)])]));}if('friendlyName' in options) {attrs.push(// friendlyNameasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// attrIdasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.friendlyName).getBytes()),// attrValuesasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BMPSTRING, false,options.friendlyName)])]));}if(attrs.length > 0) {bagAttrs = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, attrs);}// collect contents for AuthenticatedSafevar contents = [];// create safe bag(s) for certificate chainvar chain = [];if(cert !== null) {if(forge.util.isArray(cert)) {chain = cert;} else {chain = [cert];}}var certSafeBags = [];for(var i = 0; i < chain.length; ++i) {// convert cert from PEM as necessarycert = chain[i];if(typeof cert === 'string') {cert = pki.certificateFromPem(cert);}// SafeBagvar certBagAttrs = (i === 0) ? bagAttrs : undefined;var certAsn1 = pki.certificateToAsn1(cert);var certSafeBag =asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// bagIdasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.certBag).getBytes()),// bagValueasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [// CertBagasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// certIdasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.x509Certificate).getBytes()),// certValue (x509Certificate)asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,asn1.toDer(certAsn1).getBytes())])])]),// bagAttributes (OPTIONAL)certBagAttrs]);certSafeBags.push(certSafeBag);}if(certSafeBags.length > 0) {// SafeContentsvar certSafeContents = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, certSafeBags);// ContentInfovar certCI =// PKCS#7 ContentInfoasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// contentTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,// OID for the content type is 'data'asn1.oidToDer(pki.oids.data).getBytes()),// contentasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,asn1.toDer(certSafeContents).getBytes())])]);contents.push(certCI);}// create safe contents for private keyvar keyBag = null;if(key !== null) {// SafeBagvar pkAsn1 = pki.wrapRsaPrivateKey(pki.privateKeyToAsn1(key));if(password === null) {// no encryptionkeyBag = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// bagIdasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.keyBag).getBytes()),// bagValueasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [// PrivateKeyInfopkAsn1]),// bagAttributes (OPTIONAL)bagAttrs]);} else {// encrypted PrivateKeyInfokeyBag = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// bagIdasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.pkcs8ShroudedKeyBag).getBytes()),// bagValueasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [// EncryptedPrivateKeyInfopki.encryptPrivateKeyInfo(pkAsn1, password, options)]),// bagAttributes (OPTIONAL)bagAttrs]);}// SafeContentsvar keySafeContents =asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [keyBag]);// ContentInfovar keyCI =// PKCS#7 ContentInfoasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// contentTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,// OID for the content type is 'data'asn1.oidToDer(pki.oids.data).getBytes()),// contentasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,asn1.toDer(keySafeContents).getBytes())])]);contents.push(keyCI);}// create AuthenticatedSafe by stringing together the contentsvar safe = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, contents);var macData;if(options.useMac) {// MacDatavar sha1 = forge.md.sha1.create();var macSalt = new forge.util.ByteBuffer(forge.random.getBytes(options.saltSize));var count = options.count;// 160-bit keyvar key = p12.generateKey(password, macSalt, 3, count, 20);var mac = forge.hmac.create();mac.start(sha1, key);mac.update(asn1.toDer(safe).getBytes());var macValue = mac.getMac();macData = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// mac DigestInfoasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// digestAlgorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithm = SHA-1asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.sha1).getBytes()),// parameters = Nullasn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]),// digestasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING,false, macValue.getBytes())]),// macSalt OCTET STRINGasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, macSalt.getBytes()),// iterations INTEGER (XXX: Only support count < 65536)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(count).getBytes())]);}// PFXreturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// version (3)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(3).getBytes()),// PKCS#7 ContentInfoasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// contentTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,// OID for the content type is 'data'asn1.oidToDer(pki.oids.data).getBytes()),// contentasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,asn1.toDer(safe).getBytes())])]),macData]);};/*** Derives a PKCS#12 key.** @param password the password to derive the key material from, null or*          undefined for none.* @param salt the salt, as a ByteBuffer, to use.* @param id the PKCS#12 ID byte (1 = key material, 2 = IV, 3 = MAC).* @param iter the iteration count.* @param n the number of bytes to derive from the password.* @param md the message digest to use, defaults to SHA-1.** @return a ByteBuffer with the bytes derived from the password.*/p12.generateKey = forge.pbe.generatePkcs12Key;/***/ }),/***/ 939:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of PKCS#7 v1.5.** @author Stefan Siegl* @author Dave Longley** Copyright (c) 2012 Stefan Siegl <[email protected]>* Copyright (c) 2012-2015 Digital Bazaar, Inc.** Currently this implementation only supports ContentType of EnvelopedData,* EncryptedData, or SignedData at the root level. The top level elements may* contain only a ContentInfo of ContentType Data, i.e. plain data. Further* nesting is not (yet) supported.** The Forge validators for PKCS #7's ASN.1 structures are available from* a separate file pkcs7asn1.js, since those are referenced from other* PKCS standards like PKCS #12.*/var forge = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(1598);__webpack_require__(3436);__webpack_require__(1692);__webpack_require__(2966);__webpack_require__(393);__webpack_require__(6660);__webpack_require__(2365);__webpack_require__(256);// shortcut for ASN.1 APIvar asn1 = forge.asn1;// shortcut for PKCS#7 APIvar p7 = module.exports = forge.pkcs7 = forge.pkcs7 || {};/*** Converts a PKCS#7 message from PEM format.** @param pem the PEM-formatted PKCS#7 message.** @return the PKCS#7 message.*/p7.messageFromPem = function(pem) {var msg = forge.pem.decode(pem)[0];if(msg.type !== 'PKCS7') {var error = new Error('Could not convert PKCS#7 message from PEM; PEM ' +'header type is not "PKCS#7".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert PKCS#7 message from PEM; PEM is encrypted.');}// convert DER to ASN.1 objectvar obj = asn1.fromDer(msg.body);return p7.messageFromAsn1(obj);};/*** Converts a PKCS#7 message to PEM format.** @param msg The PKCS#7 message object* @param maxline The maximum characters per line, defaults to 64.** @return The PEM-formatted PKCS#7 message.*/p7.messageToPem = function(msg, maxline) {// convert to ASN.1, then DER, then PEM-encodevar pemObj = {type: 'PKCS7',body: asn1.toDer(msg.toAsn1()).getBytes()};return forge.pem.encode(pemObj, {maxline: maxline});};/*** Converts a PKCS#7 message from an ASN.1 object.** @param obj the ASN.1 representation of a ContentInfo.** @return the PKCS#7 message.*/p7.messageFromAsn1 = function(obj) {// validate root level ContentInfo and capture datavar capture = {};var errors = [];if(!asn1.validate(obj, p7.asn1.contentInfoValidator, capture, errors)) {var error = new Error('Cannot read PKCS#7 message. ' +'ASN.1 object is not an PKCS#7 ContentInfo.');error.errors = errors;throw error;}var contentType = asn1.derToOid(capture.contentType);var msg;switch(contentType) {case forge.pki.oids.envelopedData:msg = p7.createEnvelopedData();break;case forge.pki.oids.encryptedData:msg = p7.createEncryptedData();break;case forge.pki.oids.signedData:msg = p7.createSignedData();break;default:throw new Error('Cannot read PKCS#7 message. ContentType with OID ' +contentType + ' is not (yet) supported.');}msg.fromAsn1(capture.content.value[0]);return msg;};p7.createSignedData = function() {var msg = null;msg = {type: forge.pki.oids.signedData,version: 1,certificates: [],crls: [],// TODO: add json-formatted signer stuff here?signers: [],// populated during sign()digestAlgorithmIdentifiers: [],contentInfo: null,signerInfos: [],fromAsn1: function(obj) {// validate SignedData content block and capture data._fromAsn1(msg, obj, p7.asn1.signedDataValidator);msg.certificates = [];msg.crls = [];msg.digestAlgorithmIdentifiers = [];msg.contentInfo = null;msg.signerInfos = [];if(msg.rawCapture.certificates) {var certs = msg.rawCapture.certificates.value;for(var i = 0; i < certs.length; ++i) {msg.certificates.push(forge.pki.certificateFromAsn1(certs[i]));}}// TODO: parse crls},toAsn1: function() {// degenerate case with no contentif(!msg.contentInfo) {msg.sign();}var certs = [];for(var i = 0; i < msg.certificates.length; ++i) {certs.push(forge.pki.certificateToAsn1(msg.certificates[i]));}var crls = [];// TODO: implement CRLs// [0] SignedDatavar signedData = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// Versionasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(msg.version).getBytes()),// DigestAlgorithmIdentifiersasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,msg.digestAlgorithmIdentifiers),// ContentInfomsg.contentInfo])]);if(certs.length > 0) {// [0] IMPLICIT ExtendedCertificatesAndCertificates OPTIONALsignedData.value[0].value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, certs));}if(crls.length > 0) {// [1] IMPLICIT CertificateRevocationLists OPTIONALsignedData.value[0].value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, crls));}// SignerInfossignedData.value[0].value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,msg.signerInfos));// ContentInforeturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// ContentTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(msg.type).getBytes()),// [0] SignedDatasignedData]);},/*** Add (another) entity to list of signers.** Note: If authenticatedAttributes are provided, then, per RFC 2315,* they must include at least two attributes: content type and* message digest. The message digest attribute value will be* auto-calculated during signing and will be ignored if provided.** Here's an example of providing these two attributes:** forge.pkcs7.createSignedData();* p7.addSigner({*   issuer: cert.issuer.attributes,*   serialNumber: cert.serialNumber,*   key: privateKey,*   digestAlgorithm: forge.pki.oids.sha1,*   authenticatedAttributes: [{*     type: forge.pki.oids.contentType,*     value: forge.pki.oids.data*   }, {*     type: forge.pki.oids.messageDigest*   }]* });** TODO: Support [subjectKeyIdentifier] as signer's ID.** @param signer the signer information:*          key the signer's private key.*          [certificate] a certificate containing the public key*            associated with the signer's private key; use this option as*            an alternative to specifying signer.issuer and*            signer.serialNumber.*          [issuer] the issuer attributes (eg: cert.issuer.attributes).*          [serialNumber] the signer's certificate's serial number in*           hexadecimal (eg: cert.serialNumber).*          [digestAlgorithm] the message digest OID, as a string, to use*            (eg: forge.pki.oids.sha1).*          [authenticatedAttributes] an optional array of attributes*            to also sign along with the content.*/addSigner: function(signer) {var issuer = signer.issuer;var serialNumber = signer.serialNumber;if(signer.certificate) {var cert = signer.certificate;if(typeof cert === 'string') {cert = forge.pki.certificateFromPem(cert);}issuer = cert.issuer.attributes;serialNumber = cert.serialNumber;}var key = signer.key;if(!key) {throw new Error('Could not add PKCS#7 signer; no private key specified.');}if(typeof key === 'string') {key = forge.pki.privateKeyFromPem(key);}// ensure OID known for digest algorithmvar digestAlgorithm = signer.digestAlgorithm || forge.pki.oids.sha1;switch(digestAlgorithm) {case forge.pki.oids.sha1:case forge.pki.oids.sha256:case forge.pki.oids.sha384:case forge.pki.oids.sha512:case forge.pki.oids.md5:break;default:throw new Error('Could not add PKCS#7 signer; unknown message digest algorithm: ' +digestAlgorithm);}// if authenticatedAttributes is present, then the attributes// must contain at least PKCS #9 content-type and message-digestvar authenticatedAttributes = signer.authenticatedAttributes || [];if(authenticatedAttributes.length > 0) {var contentType = false;var messageDigest = false;for(var i = 0; i < authenticatedAttributes.length; ++i) {var attr = authenticatedAttributes[i];if(!contentType && attr.type === forge.pki.oids.contentType) {contentType = true;if(messageDigest) {break;}continue;}if(!messageDigest && attr.type === forge.pki.oids.messageDigest) {messageDigest = true;if(contentType) {break;}continue;}}if(!contentType || !messageDigest) {throw new Error('Invalid signer.authenticatedAttributes. If ' +'signer.authenticatedAttributes is specified, then it must ' +'contain at least two attributes, PKCS #9 content-type and ' +'PKCS #9 message-digest.');}}msg.signers.push({key: key,version: 1,issuer: issuer,serialNumber: serialNumber,digestAlgorithm: digestAlgorithm,signatureAlgorithm: forge.pki.oids.rsaEncryption,signature: null,authenticatedAttributes: authenticatedAttributes,unauthenticatedAttributes: []});},/*** Signs the content.* @param options Options to apply when signing:*    [detached] boolean. If signing should be done in detached mode. Defaults to false.*/sign: function(options) {options = options || {};// auto-generate content infoif(typeof msg.content !== 'object' || msg.contentInfo === null) {// use Data ContentInfomsg.contentInfo = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// ContentTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(forge.pki.oids.data).getBytes())]);// add actual content, if presentif('content' in msg) {var content;if(msg.content instanceof forge.util.ByteBuffer) {content = msg.content.bytes();} else if(typeof msg.content === 'string') {content = forge.util.encodeUtf8(msg.content);}if (options.detached) {msg.detachedContent = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, content);} else {msg.contentInfo.value.push(// [0] EXPLICIT contentasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,content)]));}}}// no signers, return early (degenerate case for certificate container)if(msg.signers.length === 0) {return;}// generate digest algorithm identifiersvar mds = addDigestAlgorithmIds();// generate signerInfosaddSignerInfos(mds);},verify: function() {throw new Error('PKCS#7 signature verification not yet implemented.');},/*** Add a certificate.** @param cert the certificate to add.*/addCertificate: function(cert) {// convert from PEMif(typeof cert === 'string') {cert = forge.pki.certificateFromPem(cert);}msg.certificates.push(cert);},/*** Add a certificate revokation list.** @param crl the certificate revokation list to add.*/addCertificateRevokationList: function(crl) {throw new Error('PKCS#7 CRL support not yet implemented.');}};return msg;function addDigestAlgorithmIds() {var mds = {};for(var i = 0; i < msg.signers.length; ++i) {var signer = msg.signers[i];var oid = signer.digestAlgorithm;if(!(oid in mds)) {// content digestmds[oid] = forge.md[forge.pki.oids[oid]].create();}if(signer.authenticatedAttributes.length === 0) {// no custom attributes to digest; use content message digestsigner.md = mds[oid];} else {// custom attributes to be digested; use own message digest// TODO: optimize to just copy message digest state if that// feature is ever supported with message digestssigner.md = forge.md[forge.pki.oids[oid]].create();}}// add unique digest algorithm identifiersmsg.digestAlgorithmIdentifiers = [];for(var oid in mds) {msg.digestAlgorithmIdentifiers.push(// AlgorithmIdentifierasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(oid).getBytes()),// parameters (null)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]));}return mds;}function addSignerInfos(mds) {var content;if (msg.detachedContent) {// Signature has been made in detached mode.content = msg.detachedContent;} else {// Note: ContentInfo is a SEQUENCE with 2 values, second value is// the content field and is optional for a ContentInfo but required here// since signers are present// get ContentInfo contentcontent = msg.contentInfo.value[1];// skip [0] EXPLICIT content wrappercontent = content.value[0];}if(!content) {throw new Error('Could not sign PKCS#7 message; there is no content to sign.');}// get ContentInfo content typevar contentType = asn1.derToOid(msg.contentInfo.value[0].value);// serialize contentvar bytes = asn1.toDer(content);// skip identifier and length per RFC 2315 9.3// skip identifier (1 byte)bytes.getByte();// read and discard length bytesasn1.getBerValueLength(bytes);bytes = bytes.getBytes();// digest content DER value bytesfor(var oid in mds) {mds[oid].start().update(bytes);}// sign contentvar signingTime = new Date();for(var i = 0; i < msg.signers.length; ++i) {var signer = msg.signers[i];if(signer.authenticatedAttributes.length === 0) {// if ContentInfo content type is not "Data", then// authenticatedAttributes must be present per RFC 2315if(contentType !== forge.pki.oids.data) {throw new Error('Invalid signer; authenticatedAttributes must be present ' +'when the ContentInfo content type is not PKCS#7 Data.');}} else {// process authenticated attributes// [0] IMPLICITsigner.authenticatedAttributesAsn1 = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, []);// per RFC 2315, attributes are to be digested using a SET container// not the above [0] IMPLICIT containervar attrsAsn1 = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, []);for(var ai = 0; ai < signer.authenticatedAttributes.length; ++ai) {var attr = signer.authenticatedAttributes[ai];if(attr.type === forge.pki.oids.messageDigest) {// use content message digest as valueattr.value = mds[signer.digestAlgorithm].digest();} else if(attr.type === forge.pki.oids.signingTime) {// auto-populate signing time if not already setif(!attr.value) {attr.value = signingTime;}}// convert to ASN.1 and push onto Attributes SET (for signing) and// onto authenticatedAttributesAsn1 to complete SignedData ASN.1// TODO: optimize away duplicationattrsAsn1.value.push(_attributeToAsn1(attr));signer.authenticatedAttributesAsn1.value.push(_attributeToAsn1(attr));}// DER-serialize and digest SET OF attributes onlybytes = asn1.toDer(attrsAsn1).getBytes();signer.md.start().update(bytes);}// sign digestsigner.signature = signer.key.sign(signer.md, 'RSASSA-PKCS1-V1_5');}// add signer infomsg.signerInfos = _signersToAsn1(msg.signers);}};/*** Creates an empty PKCS#7 message of type EncryptedData.** @return the message.*/p7.createEncryptedData = function() {var msg = null;msg = {type: forge.pki.oids.encryptedData,version: 0,encryptedContent: {algorithm: forge.pki.oids['aes256-CBC']},/*** Reads an EncryptedData content block (in ASN.1 format)** @param obj The ASN.1 representation of the EncryptedData content block*/fromAsn1: function(obj) {// Validate EncryptedData content block and capture data._fromAsn1(msg, obj, p7.asn1.encryptedDataValidator);},/*** Decrypt encrypted content** @param key The (symmetric) key as a byte buffer*/decrypt: function(key) {if(key !== undefined) {msg.encryptedContent.key = key;}_decryptContent(msg);}};return msg;};/*** Creates an empty PKCS#7 message of type EnvelopedData.** @return the message.*/p7.createEnvelopedData = function() {var msg = null;msg = {type: forge.pki.oids.envelopedData,version: 0,recipients: [],encryptedContent: {algorithm: forge.pki.oids['aes256-CBC']},/*** Reads an EnvelopedData content block (in ASN.1 format)** @param obj the ASN.1 representation of the EnvelopedData content block.*/fromAsn1: function(obj) {// validate EnvelopedData content block and capture datavar capture = _fromAsn1(msg, obj, p7.asn1.envelopedDataValidator);msg.recipients = _recipientsFromAsn1(capture.recipientInfos.value);},toAsn1: function() {// ContentInforeturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// ContentTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(msg.type).getBytes()),// [0] EnvelopedDataasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// Versionasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(msg.version).getBytes()),// RecipientInfosasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,_recipientsToAsn1(msg.recipients)),// EncryptedContentInfoasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true,_encryptedContentToAsn1(msg.encryptedContent))])])]);},/*** Find recipient by X.509 certificate's issuer.** @param cert the certificate with the issuer to look for.** @return the recipient object.*/findRecipient: function(cert) {var sAttr = cert.issuer.attributes;for(var i = 0; i < msg.recipients.length; ++i) {var r = msg.recipients[i];var rAttr = r.issuer;if(r.serialNumber !== cert.serialNumber) {continue;}if(rAttr.length !== sAttr.length) {continue;}var match = true;for(var j = 0; j < sAttr.length; ++j) {if(rAttr[j].type !== sAttr[j].type ||rAttr[j].value !== sAttr[j].value) {match = false;break;}}if(match) {return r;}}return null;},/*** Decrypt enveloped content** @param recipient The recipient object related to the private key* @param privKey The (RSA) private key object*/decrypt: function(recipient, privKey) {if(msg.encryptedContent.key === undefined && recipient !== undefined &&privKey !== undefined) {switch(recipient.encryptedContent.algorithm) {case forge.pki.oids.rsaEncryption:case forge.pki.oids.desCBC:var key = privKey.decrypt(recipient.encryptedContent.content);msg.encryptedContent.key = forge.util.createBuffer(key);break;default:throw new Error('Unsupported asymmetric cipher, ' +'OID ' + recipient.encryptedContent.algorithm);}}_decryptContent(msg);},/*** Add (another) entity to list of recipients.** @param cert The certificate of the entity to add.*/addRecipient: function(cert) {msg.recipients.push({version: 0,issuer: cert.issuer.attributes,serialNumber: cert.serialNumber,encryptedContent: {// We simply assume rsaEncryption here, since forge.pki only// supports RSA so far.  If the PKI module supports other// ciphers one day, we need to modify this one as well.algorithm: forge.pki.oids.rsaEncryption,key: cert.publicKey}});},/*** Encrypt enveloped content.** This function supports two optional arguments, cipher and key, which* can be used to influence symmetric encryption.  Unless cipher is* provided, the cipher specified in encryptedContent.algorithm is used* (defaults to AES-256-CBC).  If no key is provided, encryptedContent.key* is (re-)used.  If that one's not set, a random key will be generated* automatically.** @param [key] The key to be used for symmetric encryption.* @param [cipher] The OID of the symmetric cipher to use.*/encrypt: function(key, cipher) {// Part 1: Symmetric encryptionif(msg.encryptedContent.content === undefined) {cipher = cipher || msg.encryptedContent.algorithm;key = key || msg.encryptedContent.key;var keyLen, ivLen, ciphFn;switch(cipher) {case forge.pki.oids['aes128-CBC']:keyLen = 16;ivLen = 16;ciphFn = forge.aes.createEncryptionCipher;break;case forge.pki.oids['aes192-CBC']:keyLen = 24;ivLen = 16;ciphFn = forge.aes.createEncryptionCipher;break;case forge.pki.oids['aes256-CBC']:keyLen = 32;ivLen = 16;ciphFn = forge.aes.createEncryptionCipher;break;case forge.pki.oids['des-EDE3-CBC']:keyLen = 24;ivLen = 8;ciphFn = forge.des.createEncryptionCipher;break;default:throw new Error('Unsupported symmetric cipher, OID ' + cipher);}if(key === undefined) {key = forge.util.createBuffer(forge.random.getBytes(keyLen));} else if(key.length() != keyLen) {throw new Error('Symmetric key has wrong length; ' +'got ' + key.length() + ' bytes, expected ' + keyLen + '.');}// Keep a copy of the key & IV in the object, so the caller can// use it for whatever reason.msg.encryptedContent.algorithm = cipher;msg.encryptedContent.key = key;msg.encryptedContent.parameter = forge.util.createBuffer(forge.random.getBytes(ivLen));var ciph = ciphFn(key);ciph.start(msg.encryptedContent.parameter.copy());ciph.update(msg.content);// The finish function does PKCS#7 padding by default, therefore// no action required by us.if(!ciph.finish()) {throw new Error('Symmetric encryption failed.');}msg.encryptedContent.content = ciph.output;}// Part 2: asymmetric encryption for each recipientfor(var i = 0; i < msg.recipients.length; ++i) {var recipient = msg.recipients[i];// Nothing to do, encryption already done.if(recipient.encryptedContent.content !== undefined) {continue;}switch(recipient.encryptedContent.algorithm) {case forge.pki.oids.rsaEncryption:recipient.encryptedContent.content =recipient.encryptedContent.key.encrypt(msg.encryptedContent.key.data);break;default:throw new Error('Unsupported asymmetric cipher, OID ' +recipient.encryptedContent.algorithm);}}}};return msg;};/*** Converts a single recipient from an ASN.1 object.** @param obj the ASN.1 RecipientInfo.** @return the recipient object.*/function _recipientFromAsn1(obj) {// validate EnvelopedData content block and capture datavar capture = {};var errors = [];if(!asn1.validate(obj, p7.asn1.recipientInfoValidator, capture, errors)) {var error = new Error('Cannot read PKCS#7 RecipientInfo. ' +'ASN.1 object is not an PKCS#7 RecipientInfo.');error.errors = errors;throw error;}return {version: capture.version.charCodeAt(0),issuer: forge.pki.RDNAttributesAsArray(capture.issuer),serialNumber: forge.util.createBuffer(capture.serial).toHex(),encryptedContent: {algorithm: asn1.derToOid(capture.encAlgorithm),parameter: capture.encParameter.value,content: capture.encKey}};}/*** Converts a single recipient object to an ASN.1 object.** @param obj the recipient object.** @return the ASN.1 RecipientInfo.*/function _recipientToAsn1(obj) {return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// Versionasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(obj.version).getBytes()),// IssuerAndSerialNumberasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// Nameforge.pki.distinguishedNameToAsn1({attributes: obj.issuer}),// Serialasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,forge.util.hexToBytes(obj.serialNumber))]),// KeyEncryptionAlgorithmIdentifierasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// Algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(obj.encryptedContent.algorithm).getBytes()),// Parameter, force NULL, only RSA supported for now.asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]),// EncryptedKeyasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,obj.encryptedContent.content)]);}/*** Map a set of RecipientInfo ASN.1 objects to recipient objects.** @param infos an array of ASN.1 representations RecipientInfo (i.e. SET OF).** @return an array of recipient objects.*/function _recipientsFromAsn1(infos) {var ret = [];for(var i = 0; i < infos.length; ++i) {ret.push(_recipientFromAsn1(infos[i]));}return ret;}/*** Map an array of recipient objects to ASN.1 RecipientInfo objects.** @param recipients an array of recipientInfo objects.** @return an array of ASN.1 RecipientInfos.*/function _recipientsToAsn1(recipients) {var ret = [];for(var i = 0; i < recipients.length; ++i) {ret.push(_recipientToAsn1(recipients[i]));}return ret;}/*** Converts a single signer from an ASN.1 object.** @param obj the ASN.1 representation of a SignerInfo.** @return the signer object.*/function _signerFromAsn1(obj) {// validate EnvelopedData content block and capture datavar capture = {};var errors = [];if(!asn1.validate(obj, p7.asn1.signerInfoValidator, capture, errors)) {var error = new Error('Cannot read PKCS#7 SignerInfo. ' +'ASN.1 object is not an PKCS#7 SignerInfo.');error.errors = errors;throw error;}var rval = {version: capture.version.charCodeAt(0),issuer: forge.pki.RDNAttributesAsArray(capture.issuer),serialNumber: forge.util.createBuffer(capture.serial).toHex(),digestAlgorithm: asn1.derToOid(capture.digestAlgorithm),signatureAlgorithm: asn1.derToOid(capture.signatureAlgorithm),signature: capture.signature,authenticatedAttributes: [],unauthenticatedAttributes: []};// TODO: convert attributesvar authenticatedAttributes = capture.authenticatedAttributes || [];var unauthenticatedAttributes = capture.unauthenticatedAttributes || [];return rval;}/*** Converts a single signerInfo object to an ASN.1 object.** @param obj the signerInfo object.** @return the ASN.1 representation of a SignerInfo.*/function _signerToAsn1(obj) {// SignerInfovar rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// versionasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(obj.version).getBytes()),// issuerAndSerialNumberasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// nameforge.pki.distinguishedNameToAsn1({attributes: obj.issuer}),// serialasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,forge.util.hexToBytes(obj.serialNumber))]),// digestAlgorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(obj.digestAlgorithm).getBytes()),// parameters (null)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')])]);// authenticatedAttributes (OPTIONAL)if(obj.authenticatedAttributesAsn1) {// add ASN.1 previously generated during signingrval.value.push(obj.authenticatedAttributesAsn1);}// digestEncryptionAlgorithmrval.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(obj.signatureAlgorithm).getBytes()),// parameters (null)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]));// encryptedDigestrval.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, obj.signature));// unauthenticatedAttributes (OPTIONAL)if(obj.unauthenticatedAttributes.length > 0) {// [1] IMPLICITvar attrsAsn1 = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, []);for(var i = 0; i < obj.unauthenticatedAttributes.length; ++i) {var attr = obj.unauthenticatedAttributes[i];attrsAsn1.values.push(_attributeToAsn1(attr));}rval.value.push(attrsAsn1);}return rval;}/*** Map a set of SignerInfo ASN.1 objects to an array of signer objects.** @param signerInfoAsn1s an array of ASN.1 SignerInfos (i.e. SET OF).** @return an array of signers objects.*/function _signersFromAsn1(signerInfoAsn1s) {var ret = [];for(var i = 0; i < signerInfoAsn1s.length; ++i) {ret.push(_signerFromAsn1(signerInfoAsn1s[i]));}return ret;}/*** Map an array of signer objects to ASN.1 objects.** @param signers an array of signer objects.** @return an array of ASN.1 SignerInfos.*/function _signersToAsn1(signers) {var ret = [];for(var i = 0; i < signers.length; ++i) {ret.push(_signerToAsn1(signers[i]));}return ret;}/*** Convert an attribute object to an ASN.1 Attribute.** @param attr the attribute object.** @return the ASN.1 Attribute.*/function _attributeToAsn1(attr) {var value;// TODO: generalize to support more attributesif(attr.type === forge.pki.oids.contentType) {value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(attr.value).getBytes());} else if(attr.type === forge.pki.oids.messageDigest) {value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,attr.value.bytes());} else if(attr.type === forge.pki.oids.signingTime) {/* Note per RFC 2985: Dates between 1 January 1950 and 31 December 2049(inclusive) MUST be encoded as UTCTime. Any dates with year valuesbefore 1950 or after 2049 MUST be encoded as GeneralizedTime. [Further,]UTCTime values MUST be expressed in Greenwich Mean Time (Zulu) and MUSTinclude seconds (i.e., times are YYMMDDHHMMSSZ), even where thenumber of seconds is zero.  Midnight (GMT) must be represented as"YYMMDD000000Z". */// TODO: make these module-level constantsvar jan_1_1950 = new Date('1950-01-01T00:00:00Z');var jan_1_2050 = new Date('2050-01-01T00:00:00Z');var date = attr.value;if(typeof date === 'string') {// try to parse datevar timestamp = Date.parse(date);if(!isNaN(timestamp)) {date = new Date(timestamp);} else if(date.length === 13) {// YYMMDDHHMMSSZ (13 chars for UTCTime)date = asn1.utcTimeToDate(date);} else {// assume generalized timedate = asn1.generalizedTimeToDate(date);}}if(date >= jan_1_1950 && date < jan_1_2050) {value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,asn1.dateToUtcTime(date));} else {value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.GENERALIZEDTIME, false,asn1.dateToGeneralizedTime(date));}}// TODO: expose as common API call// create a RelativeDistinguishedName set// each value in the set is an AttributeTypeAndValue first// containing the type (an OID) and second the valuereturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// AttributeTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(attr.type).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [// AttributeValuevalue])]);}/*** Map messages encrypted content to ASN.1 objects.** @param ec The encryptedContent object of the message.** @return ASN.1 representation of the encryptedContent object (SEQUENCE).*/function _encryptedContentToAsn1(ec) {return [// ContentType, always Data for the momentasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(forge.pki.oids.data).getBytes()),// ContentEncryptionAlgorithmIdentifierasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// Algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(ec.algorithm).getBytes()),// Parameters (IV)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,ec.parameter.getBytes())]),// [0] EncryptedContentasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,ec.content.getBytes())])];}/*** Reads the "common part" of an PKCS#7 content block (in ASN.1 format)** This function reads the "common part" of the PKCS#7 content blocks* EncryptedData and EnvelopedData, i.e. version number and symmetrically* encrypted content block.** The r###lt of the ASN.1 validate and capture process is returned* to allow the caller to extract further data, e.g. the list of recipients* in case of a EnvelopedData object.** @param msg the PKCS#7 object to read the data to.* @param obj the ASN.1 representation of the content block.* @param validator the ASN.1 structure validator object to use.** @return the value map captured by validator object.*/function _fromAsn1(msg, obj, validator) {var capture = {};var errors = [];if(!asn1.validate(obj, validator, capture, errors)) {var error = new Error('Cannot read PKCS#7 message. ' +'ASN.1 object is not a supported PKCS#7 message.');error.errors = error;throw error;}// Check contentType, so far we only support (raw) Data.var contentType = asn1.derToOid(capture.contentType);if(contentType !== forge.pki.oids.data) {throw new Error('Unsupported PKCS#7 message. ' +'Only wrapped ContentType Data supported.');}if(capture.encryptedContent) {var content = '';if(forge.util.isArray(capture.encryptedContent)) {for(var i = 0; i < capture.encryptedContent.length; ++i) {if(capture.encryptedContent[i].type !== asn1.Type.OCTETSTRING) {throw new Error('Malformed PKCS#7 message, expecting encrypted ' +'content constructed of only OCTET STRING objects.');}content += capture.encryptedContent[i].value;}} else {content = capture.encryptedContent;}msg.encryptedContent = {algorithm: asn1.derToOid(capture.encAlgorithm),parameter: forge.util.createBuffer(capture.encParameter.value),content: forge.util.createBuffer(content)};}if(capture.content) {var content = '';if(forge.util.isArray(capture.content)) {for(var i = 0; i < capture.content.length; ++i) {if(capture.content[i].type !== asn1.Type.OCTETSTRING) {throw new Error('Malformed PKCS#7 message, expecting ' +'content constructed of only OCTET STRING objects.');}content += capture.content[i].value;}} else {content = capture.content;}msg.content = forge.util.createBuffer(content);}msg.version = capture.version.charCodeAt(0);msg.rawCapture = capture;return capture;}/*** Decrypt the symmetrically encrypted content block of the PKCS#7 message.** Decryption is skipped in case the PKCS#7 message object already has a* (decrypted) content attribute.  The algorithm, key and cipher parameters* (probably the iv) are taken from the encryptedContent attribute of the* message object.** @param The PKCS#7 message object.*/function _decryptContent(msg) {if(msg.encryptedContent.key === undefined) {throw new Error('Symmetric key not available.');}if(msg.content === undefined) {var ciph;switch(msg.encryptedContent.algorithm) {case forge.pki.oids['aes128-CBC']:case forge.pki.oids['aes192-CBC']:case forge.pki.oids['aes256-CBC']:ciph = forge.aes.createDecryptionCipher(msg.encryptedContent.key);break;case forge.pki.oids['desCBC']:case forge.pki.oids['des-EDE3-CBC']:ciph = forge.des.createDecryptionCipher(msg.encryptedContent.key);break;default:throw new Error('Unsupported symmetric cipher, OID ' +msg.encryptedContent.algorithm);}ciph.start(msg.encryptedContent.parameter);ciph.update(msg.encryptedContent.content);if(!ciph.finish()) {throw new Error('Symmetric decryption failed.');}msg.content = ciph.output;}}/***/ }),/***/ 393:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of ASN.1 validators for PKCS#7 v1.5.** @author Dave Longley* @author Stefan Siegl** Copyright (c) 2012-2015 Digital Bazaar, Inc.* Copyright (c) 2012 Stefan Siegl <[email protected]>** The ASN.1 representation of PKCS#7 is as follows* (see RFC #2315 for details, http://www.ietf.org/rfc/rfc2315.txt):** A PKCS#7 message consists of a ContentInfo on root level, which may* contain any number of further ContentInfo nested into it.** ContentInfo ::= SEQUENCE {*   contentType                ContentType,*   content               [0]  EXPLICIT ANY DEFINED BY contentType OPTIONAL* }** ContentType ::= OBJECT IDENTIFIER** EnvelopedData ::= SEQUENCE {*   version                    Version,*   recipientInfos             RecipientInfos,*   encryptedContentInfo       EncryptedContentInfo* }** EncryptedData ::= SEQUENCE {*   version                    Version,*   encryptedContentInfo       EncryptedContentInfo* }** id-signedData OBJECT IDENTIFIER ::= { iso(1) member-body(2)*   us(840) rsadsi(113549) pkcs(1) pkcs7(7) 2 }** SignedData ::= SEQUENCE {*   version           INTEGER,*   digestAlgorithms  DigestAlgorithmIdentifiers,*   contentInfo       ContentInfo,*   certificates      [0] IMPLICIT Certificates OPTIONAL,*   crls              [1] IMPLICIT CertificateRevocationLists OPTIONAL,*   signerInfos       SignerInfos* }** SignerInfos ::= SET OF SignerInfo** SignerInfo ::= SEQUENCE {*   version                    Version,*   issuerAndSerialNumber      IssuerAndSerialNumber,*   digestAlgorithm            DigestAlgorithmIdentifier,*   authenticatedAttributes    [0] IMPLICIT Attributes OPTIONAL,*   digestEncryptionAlgorithm  DigestEncryptionAlgorithmIdentifier,*   encryptedDigest            EncryptedDigest,*   unauthenticatedAttributes  [1] IMPLICIT Attributes OPTIONAL* }** EncryptedDigest ::= OCTET STRING** Attributes ::= SET OF Attribute** Attribute ::= SEQUENCE {*   attrType    OBJECT IDENTIFIER,*   attrValues  SET OF AttributeValue* }** AttributeValue ::= ANY** Version ::= INTEGER** RecipientInfos ::= SET OF RecipientInfo** EncryptedContentInfo ::= SEQUENCE {*   contentType                 ContentType,*   contentEncryptionAlgorithm  ContentEncryptionAlgorithmIdentifier,*   encryptedContent       [0]  IMPLICIT EncryptedContent OPTIONAL* }** ContentEncryptionAlgorithmIdentifier ::= AlgorithmIdentifier** The AlgorithmIdentifier contains an Object Identifier (OID) and parameters* for the algorithm, if any. In the case of AES and DES3, there is only one,* the IV.** AlgorithmIdentifer ::= SEQUENCE {*    algorithm OBJECT IDENTIFIER,*    parameters ANY DEFINED BY algorithm OPTIONAL* }** EncryptedContent ::= OCTET STRING** RecipientInfo ::= SEQUENCE {*   version                     Version,*   issuerAndSerialNumber       IssuerAndSerialNumber,*   keyEncryptionAlgorithm      KeyEncryptionAlgorithmIdentifier,*   encryptedKey                EncryptedKey* }** IssuerAndSerialNumber ::= SEQUENCE {*   issuer                      Name,*   serialNumber                CertificateSerialNumber* }** CertificateSerialNumber ::= INTEGER** KeyEncryptionAlgorithmIdentifier ::= AlgorithmIdentifier** EncryptedKey ::= OCTET STRING*/var forge = __webpack_require__(7009);__webpack_require__(1598);__webpack_require__(2365);// shortcut for ASN.1 APIvar asn1 = forge.asn1;// shortcut for PKCS#7 APIvar p7v = module.exports = forge.pkcs7asn1 = forge.pkcs7asn1 || {};forge.pkcs7 = forge.pkcs7 || {};forge.pkcs7.asn1 = p7v;var contentInfoValidator = {name: 'ContentInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'ContentInfo.ContentType',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'contentType'}, {name: 'ContentInfo.content',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,constructed: true,optional: true,captureAsn1: 'content'}]};p7v.contentInfoValidator = contentInfoValidator;var encryptedContentInfoValidator = {name: 'EncryptedContentInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'EncryptedContentInfo.contentType',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'contentType'}, {name: 'EncryptedContentInfo.contentEncryptionAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'EncryptedContentInfo.contentEncryptionAlgorithm.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'encAlgorithm'}, {name: 'EncryptedContentInfo.contentEncryptionAlgorithm.parameter',tagClass: asn1.Class.UNIVERSAL,captureAsn1: 'encParameter'}]}, {name: 'EncryptedContentInfo.encryptedContent',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,/* The PKCS#7 structure output by OpenSSL somewhat differs from what* other implementations do generate.** OpenSSL generates a structure like this:* SEQUENCE {*    ...*    [0]*       26 DA 67 D2 17 9C 45 3C B1 2A A8 59 2F 29 33 38*       C3 C3 DF 86 71 74 7A 19 9F 40 D0 29 BE 85 90 45*       ...* }** Whereas other implementations (and this PKCS#7 module) generate:* SEQUENCE {*    ...*    [0] {*       OCTET STRING*          26 DA 67 D2 17 9C 45 3C B1 2A A8 59 2F 29 33 38*          C3 C3 DF 86 71 74 7A 19 9F 40 D0 29 BE 85 90 45*          ...*    }* }** In order to support both, we just capture the context specific* field here.  The OCTET STRING bit is removed below.*/capture: 'encryptedContent',captureAsn1: 'encryptedContentAsn1'}]};p7v.envelopedDataValidator = {name: 'EnvelopedData',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'EnvelopedData.Version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'version'}, {name: 'EnvelopedData.RecipientInfos',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SET,constructed: true,captureAsn1: 'recipientInfos'}].concat(encryptedContentInfoValidator)};p7v.encryptedDataValidator = {name: 'EncryptedData',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'EncryptedData.Version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'version'}].concat(encryptedContentInfoValidator)};var signerValidator = {name: 'SignerInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'SignerInfo.version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false}, {name: 'SignerInfo.issuerAndSerialNumber',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'SignerInfo.issuerAndSerialNumber.issuer',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'issuer'}, {name: 'SignerInfo.issuerAndSerialNumber.serialNumber',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'serial'}]}, {name: 'SignerInfo.digestAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'SignerInfo.digestAlgorithm.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'digestAlgorithm'}, {name: 'SignerInfo.digestAlgorithm.parameter',tagClass: asn1.Class.UNIVERSAL,constructed: false,captureAsn1: 'digestParameter',optional: true}]}, {name: 'SignerInfo.authenticatedAttributes',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,constructed: true,optional: true,capture: 'authenticatedAttributes'}, {name: 'SignerInfo.digestEncryptionAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,capture: 'signatureAlgorithm'}, {name: 'SignerInfo.encryptedDigest',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'signature'}, {name: 'SignerInfo.unauthenticatedAttributes',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 1,constructed: true,optional: true,capture: 'unauthenticatedAttributes'}]};p7v.signedDataValidator = {name: 'SignedData',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'SignedData.Version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'version'}, {name: 'SignedData.DigestAlgorithms',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SET,constructed: true,captureAsn1: 'digestAlgorithms'},contentInfoValidator,{name: 'SignedData.Certificates',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,optional: true,captureAsn1: 'certificates'}, {name: 'SignedData.CertificateRevocationLists',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 1,optional: true,captureAsn1: 'crls'}, {name: 'SignedData.SignerInfos',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SET,capture: 'signerInfos',optional: true,value: [signerValidator]}]};p7v.recipientInfoValidator = {name: 'RecipientInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'RecipientInfo.version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'version'}, {name: 'RecipientInfo.issuerAndSerial',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'RecipientInfo.issuerAndSerial.issuer',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'issuer'}, {name: 'RecipientInfo.issuerAndSerial.serialNumber',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'serial'}]}, {name: 'RecipientInfo.keyEncryptionAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'RecipientInfo.keyEncryptionAlgorithm.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'encAlgorithm'}, {name: 'RecipientInfo.keyEncryptionAlgorithm.parameter',tagClass: asn1.Class.UNIVERSAL,constructed: false,captureAsn1: 'encParameter'}]}, {name: 'RecipientInfo.encryptedKey',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'encKey'}]};/***/ }),/***/ 9727:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of a basic Public Key Infrastructure, including* support for RSA public and private keys.** @author Dave Longley** Copyright (c) 2010-2013 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(1598);__webpack_require__(1692);__webpack_require__(2079);__webpack_require__(2966);__webpack_require__(8322);__webpack_require__(1335);__webpack_require__(3385);__webpack_require__(524);__webpack_require__(2365);__webpack_require__(256);// shortcut for asn.1 APIvar asn1 = forge.asn1;/* Public Key Infrastructure (PKI) implementation. */var pki = module.exports = forge.pki = forge.pki || {};/*** NOTE: THIS METHOD IS DEPRECATED. Use pem.decode() instead.** Converts PEM-formatted data to DER.** @param pem the PEM-formatted data.** @return the DER-formatted data.*/pki.pemToDer = function(pem) {var msg = forge.pem.decode(pem)[0];if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert PEM to DER; PEM is encrypted.');}return forge.util.createBuffer(msg.body);};/*** Converts an RSA private key from PEM format.** @param pem the PEM-formatted private key.** @return the private key.*/pki.privateKeyFromPem = function(pem) {var msg = forge.pem.decode(pem)[0];if(msg.type !== 'PRIVATE KEY' && msg.type !== 'RSA PRIVATE KEY') {var error = new Error('Could not convert private key from PEM; PEM ' +'header type is not "PRIVATE KEY" or "RSA PRIVATE KEY".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert private key from PEM; PEM is encrypted.');}// convert DER to ASN.1 objectvar obj = asn1.fromDer(msg.body);return pki.privateKeyFromAsn1(obj);};/*** Converts an RSA private key to PEM format.** @param key the private key.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted private key.*/pki.privateKeyToPem = function(key, maxline) {// convert to ASN.1, then DER, then PEM-encodevar msg = {type: 'RSA PRIVATE KEY',body: asn1.toDer(pki.privateKeyToAsn1(key)).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/*** Converts a PrivateKeyInfo to PEM format.** @param pki the PrivateKeyInfo.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted private key.*/pki.privateKeyInfoToPem = function(pki, maxline) {// convert to DER, then PEM-encodevar msg = {type: 'PRIVATE KEY',body: asn1.toDer(pki).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/***/ }),/***/ 4846:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Prime number generation API.** @author Dave Longley** Copyright (c) 2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);__webpack_require__(8785);__webpack_require__(6660);(function() {// forge.prime already definedif(forge.prime) {module.exports = forge.prime;return;}/* PRIME API */var prime = module.exports = forge.prime = forge.prime || {};var BigInteger = forge.jsbn.BigInteger;// primes are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29var ###_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];var THIRTY = new BigInteger(null);THIRTY.fromInt(30);var op_or = function(x, y) {return x|y;};/*** Generates a random probable prime with the given number of bits.** Alternative algorithms can be specified by name as a string or as an* object with custom options like so:** {*   name: 'PRIMEINC',*   options: {*     maxBlockTime: <the maximum amount of time to block the main*       thread before allowing I/O other JS to run>,*     millerRabinTests: <the number of miller-rabin tests to run>,*     workerScript: <the worker script URL>,*     workers: <the number of web workers (if supported) to use,*       -1 to use estimated cores minus one>.*     workLoad: the size of the work load, ie: number of possible prime*       numbers for each web worker to check per work assignment,*       (default: 100).*   }* }** @param bits the number of bits for the prime number.* @param options the options to use.*          [algorithm] the algorithm to use (default: 'PRIMEINC').*          [prng] a custom crypto-secure pseudo-random number generator to use,*            that must define "getBytesSync".** @return callback(err, num) called once the operation completes.*/prime.generateProbablePrime = function(bits, options, callback) {if(typeof options === 'function') {callback = options;options = {};}options = options || {};// default to PRIMEINC algorithmvar algorithm = options.algorithm || 'PRIMEINC';if(typeof algorithm === 'string') {algorithm = {name: algorithm};}algorithm.options = algorithm.options || {};// create prng with api that matches BigInteger secure randomvar prng = options.prng || forge.random;var rng = {// x is an array to fill with bytesnextBytes: function(x) {var b = prng.getBytesSync(x.length);for(var i = 0; i < x.length; ++i) {x[i] = b.charCodeAt(i);}}};if(algorithm.name === 'PRIMEINC') {return primeincFindPrime(bits, rng, algorithm.options, callback);}throw new Error('Invalid prime generation algorithm: ' + algorithm.name);};function primeincFindPrime(bits, rng, options, callback) {if('workers' in options) {return primeincFindPrimeWithWorkers(bits, rng, options, callback);}return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);}function primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {// initialize random numbervar num = generateRandom(bits, rng);/* Note: All primes are of the form 30k+i for i < 30 and ###(30, i)=1. Thenumber we are given is always aligned at 30k + 1. Each time the number isdetermined not to be prime we add to get to the next 'i', eg: if the numberwas at 30k + 1 we add 6. */var deltaIdx = 0;// get required number of MR testsvar mrTests = getMillerRabinTests(num.bitLength());if('millerRabinTests' in options) {mrTests = options.millerRabinTests;}// find prime nearest to 'num' for maxBlockTime ms// 10 ms gives 5ms of leeway for other calculations before dropping// below 60fps (1000/60 == 16.67), but in reality, the number will// likely be higher due to an 'atomic' big int modPowvar maxBlockTime = 10;if('maxBlockTime' in options) {maxBlockTime = options.maxBlockTime;}_primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);}function _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback) {var start = +new Date();do {// overflow, regenerate random numberif(num.bitLength() > bits) {num = generateRandom(bits, rng);}// do primality testif(num.isProbablePrime(mrTests)) {return callback(null, num);}// get next potential primenum.dAddOffset(###_30_DELTA[deltaIdx++ % 8], 0);} while(maxBlockTime < 0 || (+new Date() - start < maxBlockTime));// keep trying laterforge.util.setImmediate(function() {_primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);});}// NOTE: This algorithm is indeterminate in nature because workers// run in parallel looking at different segments of numbers. Even if this// algorithm is run twice with the same input from a predictable RNG, it// may produce different outputs.function primeincFindPrimeWithWorkers(bits, rng, options, callback) {// web workers unavailableif(typeof Worker === 'undefined') {return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);}// initialize random numbervar num = generateRandom(bits, rng);// use web workers to generate keysvar numWorkers = options.workers;var workLoad = options.workLoad || 100;var range = workLoad * 30 / 8;var workerScript = options.workerScript || 'forge/prime.worker.js';if(numWorkers === -1) {return forge.util.estimateCores(function(err, cores) {if(err) {// default to 2cores = 2;}numWorkers = cores - 1;generate();});}generate();function generate() {// require at least 1 workernumWorkers = Math.max(1, numWorkers);// TODO: consider optimizing by starting workers outside getPrime() ...// note that in order to clean up they will have to be made internally// asynchronous which may actually be slower// start workers immediatelyvar workers = [];for(var i = 0; i < numWorkers; ++i) {// FIXME: fix path or use blob URLsworkers[i] = new Worker(workerScript);}var running = numWorkers;// listen for requests from workers and assign ranges to find primefor(var i = 0; i < numWorkers; ++i) {workers[i].addEventListener('message', workerMessage);}/* Note: The distribution of random numbers is unknown. Therefore, eachweb worker is continuously allocated a range of numbers to check for arandom number until one is found.Every 30 numbers will be checked just 8 times, because prime numbershave the form:30k+i, for i < 30 and ###(30, i)=1 (there are 8 values of i for this)Therefore, if we want a web worker to run N checks before asking fora new range of numbers, each range must contain N*30/8 numbers.For 100 checks (workLoad), this is a range of 375. */var found = false;function workerMessage(e) {// ignore message, prime already foundif(found) {return;}--running;var data = e.data;if(data.found) {// terminate all workersfor(var i = 0; i < workers.length; ++i) {workers[i].terminate();}found = true;return callback(null, new BigInteger(data.prime, 16));}// overflow, regenerate random numberif(num.bitLength() > bits) {num = generateRandom(bits, rng);}// assign new range to checkvar hex = num.toString(16);// start prime searche.target.postMessage({hex: hex,workLoad: workLoad});num.dAddOffset(range, 0);}}}/*** Generates a random number using the given number of bits and RNG.** @param bits the number of bits for the number.* @param rng the random number generator to use.** @return the random number.*/function generateRandom(bits, rng) {var num = new BigInteger(bits, rng);// force MSB setvar bits1 = bits - 1;if(!num.testBit(bits1)) {num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);}// align number on 30k+1 boundarynum.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);return num;}/*** Returns the required number of Miller-Rabin tests to generate a* prime with an error probability of (1/2)^80.** See Handbook of Applied Cryptography Chapter 4, Table 4.4.** @param bits the bit size.** @return the required number of iterations.*/function getMillerRabinTests(bits) {if(bits <= 100) return 27;if(bits <= 150) return 18;if(bits <= 200) return 15;if(bits <= 250) return 12;if(bits <= 300) return 9;if(bits <= 350) return 8;if(bits <= 400) return 7;if(bits <= 500) return 6;if(bits <= 600) return 5;if(bits <= 800) return 4;if(bits <= 1250) return 3;return 2;}})();/***/ }),/***/ 3858:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** A javascript implementation of a cryptographically-secure* Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed* here though the use of SHA-256 is not enforced; when generating an* a PRNG context, the hashing algorithm and block cipher used for* the generator are specified via a plugin.** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(2365);var _crypto = null;if(forge.util.isNodejs && !forge.options.usePureJavaScript &&!process.versions['node-webkit']) {_crypto = __webpack_require__(7418);}/* PRNG API */var prng = module.exports = forge.prng = forge.prng || {};/*** Creates a new PRNG context.** A PRNG plugin must be passed in that will provide:** 1. A function that initializes the key and seed of a PRNG context. It*   will be given a 16 byte key and a 16 byte seed. Any key expansion*   or transformation of the seed from a byte string into an array of*   integers (or similar) should be performed.* 2. The cryptographic function used by the generator. It takes a key and*   a seed.* 3. A seed increment function. It takes the seed and returns seed + 1.* 4. An api to create a message digest.** For an example, see random.js.** @param plugin the PRNG plugin to use.*/prng.create = function(plugin) {var ctx = {plugin: plugin,key: null,seed: null,time: null,// number of reseeds so farreseeds: 0,// amount of data generated so fargenerated: 0,// no initial key byteskeyBytes: ''};// create 32 entropy pools (each is a message digest)var md = plugin.md;var pools = new Array(32);for(var i = 0; i < 32; ++i) {pools[i] = md.create();}ctx.pools = pools;// entropy pools are written to cyclically, starting at index 0ctx.pool = 0;/*** Generates random bytes. The bytes may be generated synchronously or* asynchronously. Web workers must use the asynchronous interface or* else the behavior is undefined.** @param count the number of random bytes to generate.* @param [callback(err, bytes)] called once the operation completes.** @return count random bytes as a string.*/ctx.generate = function(count, callback) {// do synchronouslyif(!callback) {return ctx.generateSync(count);}// simple generator using counter-based CBCvar cipher = ctx.plugin.cipher;var increment = ctx.plugin.increment;var formatKey = ctx.plugin.formatKey;var formatSeed = ctx.plugin.formatSeed;var b = forge.util.createBuffer();// paranoid deviation from Fortuna:// reset key for every request to protect previously// generated random bytes should the key be discovered;// there is no 100ms based reseeding because of this// forced reseed for every `generate` callctx.key = null;generate();function generate(err) {if(err) {return callback(err);}// sufficient bytes generatedif(b.length() >= count) {return callback(null, b.getBytes(count));}// if amount of data generated is greater than 1 MiB, trigger reseedif(ctx.generated > 0xfffff) {ctx.key = null;}if(ctx.key === null) {// prevent stack overflowreturn forge.util.nextTick(function() {_reseed(generate);});}// generate the random bytesvar bytes = cipher(ctx.key, ctx.seed);ctx.generated += bytes.length;b.putBytes(bytes);// generate bytes for a new key and seedctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));forge.util.setImmediate(generate);}};/*** Generates random bytes synchronously.** @param count the number of random bytes to generate.** @return count random bytes as a string.*/ctx.generateSync = function(count) {// simple generator using counter-based CBCvar cipher = ctx.plugin.cipher;var increment = ctx.plugin.increment;var formatKey = ctx.plugin.formatKey;var formatSeed = ctx.plugin.formatSeed;// paranoid deviation from Fortuna:// reset key for every request to protect previously// generated random bytes should the key be discovered;// there is no 100ms based reseeding because of this// forced reseed for every `generateSync` callctx.key = null;var b = forge.util.createBuffer();while(b.length() < count) {// if amount of data generated is greater than 1 MiB, trigger reseedif(ctx.generated > 0xfffff) {ctx.key = null;}if(ctx.key === null) {_reseedSync();}// generate the random bytesvar bytes = cipher(ctx.key, ctx.seed);ctx.generated += bytes.length;b.putBytes(bytes);// generate bytes for a new key and seedctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));}return b.getBytes(count);};/*** Private function that asynchronously reseeds a generator.** @param callback(err) called once the operation completes.*/function _reseed(callback) {if(ctx.pools[0].messageLength >= 32) {_seed();return callback();}// not enough seed data...var needed = (32 - ctx.pools[0].messageLength) << 5;ctx.seedFile(needed, function(err, bytes) {if(err) {return callback(err);}ctx.collect(bytes);_seed();callback();});}/*** Private function that synchronously reseeds a generator.*/function _reseedSync() {if(ctx.pools[0].messageLength >= 32) {return _seed();}// not enough seed data...var needed = (32 - ctx.pools[0].messageLength) << 5;ctx.collect(ctx.seedFileSync(needed));_seed();}/*** Private function that seeds a generator once enough bytes are available.*/function _seed() {// update reseed countctx.reseeds = (ctx.reseeds === 0xffffffff) ? 0 : ctx.reseeds + 1;// goal is to update `key` via:// key = hash(key + s)//   where 's' is all collected entropy from selected pools, then...// create a plugin-based message digestvar md = ctx.plugin.md.create();// consume current key bytesmd.update(ctx.keyBytes);// digest the entropy of pools whose index k meet the// condition 'n mod 2^k == 0' where n is the number of reseedsvar _2powK = 1;for(var k = 0; k < 32; ++k) {if(ctx.reseeds % _2powK === 0) {md.update(ctx.pools[k].digest().getBytes());ctx.pools[k].start();}_2powK = _2powK << 1;}// get digest for key bytesctx.keyBytes = md.digest().getBytes();// paranoid deviation from Fortuna:// update `seed` via `seed = hash(key)`// instead of initializing to zero once and only// ever incrementing itmd.start();md.update(ctx.keyBytes);var seedBytes = md.digest().getBytes();// update statectx.key = ctx.plugin.formatKey(ctx.keyBytes);ctx.seed = ctx.plugin.formatSeed(seedBytes);ctx.generated = 0;}/*** The built-in default seedFile. This seedFile is used when entropy* is needed immediately.** @param needed the number of bytes that are needed.** @return the random bytes.*/function defaultSeedFile(needed) {// use window.crypto.getRandomValues strong source of entropy if availablevar getRandomValues = null;var globalScope = forge.util.globalScope;var _crypto = globalScope.crypto || globalScope.msCrypto;if(_crypto && _crypto.getRandomValues) {getRandomValues = function(arr) {return _crypto.getRandomValues(arr);};}var b = forge.util.createBuffer();if(getRandomValues) {while(b.length() < needed) {// max byte length is 65536 before QuotaExceededError is thrown// http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValuesvar count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);var entropy = new Uint32Array(Math.floor(count));try {getRandomValues(entropy);for(var i = 0; i < entropy.length; ++i) {b.putInt32(entropy[i]);}} catch(e) {/* only ignore QuotaExceededError */if(!(typeof QuotaExceededError !== 'undefined' &&e instanceof QuotaExceededError)) {throw e;}}}}// be sad and add some weak random dataif(b.length() < needed) {/* Draws from Park-Miller "minimal standard" 31 bit PRNG,implemented with David G. Carta's optimization: with 32 bit mathand without division (Public Domain). */var hi, lo, next;var seed = Math.floor(Math.random() * 0x010000);while(b.length() < needed) {lo = 16807 * (seed & 0xFFFF);hi = 16807 * (seed >> 16);lo += (hi & 0x7FFF) << 16;lo += hi >> 15;lo = (lo & 0x7FFFFFFF) + (lo >> 31);seed = lo & 0xFFFFFFFF;// consume lower 3 bytes of seedfor(var i = 0; i < 3; ++i) {// throw in more pseudo randomnext = seed >>> (i << 3);next ^= Math.floor(Math.random() * 0x0100);b.putByte(String.fromCharCode(next & 0xFF));}}}return b.getBytes(needed);}// initialize seed file APIsif(_crypto) {// use nodejs async APIctx.seedFile = function(needed, callback) {_crypto.randomBytes(needed, function(err, bytes) {if(err) {return callback(err);}callback(null, bytes.toString());});};// use nodejs sync APIctx.seedFileSync = function(needed) {return _crypto.randomBytes(needed).toString();};} else {ctx.seedFile = function(needed, callback) {try {callback(null, defaultSeedFile(needed));} catch(e) {callback(e);}};ctx.seedFileSync = defaultSeedFile;}/*** Adds entropy to a prng ctx's accumulator.** @param bytes the bytes of entropy as a string.*/ctx.collect = function(bytes) {// iterate over pools distributing entropy cyclicallyvar count = bytes.length;for(var i = 0; i < count; ++i) {ctx.pools[ctx.pool].update(bytes.substr(i, 1));ctx.pool = (ctx.pool === 31) ? 0 : ctx.pool + 1;}};/*** Collects an integer of n bits.** @param i the integer entropy.* @param n the number of bits in the integer.*/ctx.collectInt = function(i, n) {var bytes = '';for(var x = 0; x < n; x += 8) {bytes += String.fromCharCode((i >> x) & 0xFF);}ctx.collect(bytes);};/*** Registers a Web Worker to receive immediate entropy from the main thread.* This method is required until Web Workers can access the native crypto* API. This method should be called twice for each created worker, once in* the main thread, and once in the worker itself.** @param worker the worker to register.*/ctx.registerWorker = function(worker) {// worker receives random bytesif(worker === self) {ctx.seedFile = function(needed, callback) {function listener(e) {var data = e.data;if(data.forge && data.forge.prng) {self.removeEventListener('message', listener);callback(data.forge.prng.err, data.forge.prng.bytes);}}self.addEventListener('message', listener);self.postMessage({forge: {prng: {needed: needed}}});};} else {// main thread sends random bytes upon requestvar listener = function(e) {var data = e.data;if(data.forge && data.forge.prng) {ctx.seedFile(data.forge.prng.needed, function(err, bytes) {worker.postMessage({forge: {prng: {err: err, bytes: bytes}}});});}};// TODO: do we need to remove the event listener when the worker dies?worker.addEventListener('message', listener);}};return ctx;};/***/ }),/***/ 3385:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of PKCS#1 PSS signature padding.** @author Stefan Siegl** Copyright (c) 2012 Stefan Siegl <[email protected]>*/var forge = __webpack_require__(7009);__webpack_require__(6660);__webpack_require__(2365);// shortcut for PSS APIvar pss = module.exports = forge.pss = forge.pss || {};/*** Creates a PSS signature scheme object.** There are several ways to provide a salt for encoding:** 1. Specify the saltLength only and the built-in PRNG will generate it.* 2. Specify the saltLength and a custom PRNG with 'getBytesSync' defined that*   will be used.* 3. Specify the salt itself as a forge.util.ByteBuffer.** @param options the options to use:*          md the message digest object to use, a forge md instance.*          mgf the mask generation function to use, a forge mgf instance.*          [saltLength] the length of the salt in octets.*          [prng] the pseudo-random number generator to use to produce a salt.*          [salt] the salt to use when encoding.** @return a signature scheme object.*/pss.create = function(options) {// backwards compatibility w/legacy args: hash, mgf, sLenif(arguments.length === 3) {options = {md: arguments[0],mgf: arguments[1],saltLength: arguments[2]};}var hash = options.md;var mgf = options.mgf;var hLen = hash.digestLength;var salt_ = options.salt || null;if(typeof salt_ === 'string') {// assume binary-encoded stringsalt_ = forge.util.createBuffer(salt_);}var sLen;if('saltLength' in options) {sLen = options.saltLength;} else if(salt_ !== null) {sLen = salt_.length();} else {throw new Error('Salt length not specified or specific salt not given.');}if(salt_ !== null && salt_.length() !== sLen) {throw new Error('Given salt length does not match length of given salt.');}var prng = options.prng || forge.random;var pssobj = {};/*** Encodes a PSS signature.** This function implements EMSA-PSS-ENCODE as per RFC 3447, section 9.1.1.** @param md the message digest object with the hash to sign.* @param modsBits the length of the RSA modulus in bits.** @return the encoded message as a binary-encoded string of length*           ceil((modBits - 1) / 8).*/pssobj.encode = function(md, modBits) {var i;var emBits = modBits - 1;var emLen = Math.ceil(emBits / 8);/* 2. Let mHash = Hash(M), an octet string of length hLen. */var mHash = md.digest().getBytes();/* 3. If emLen < hLen + sLen + 2, output "encoding error" and stop. */if(emLen < hLen + sLen + 2) {throw new Error('Message is too long to encrypt.');}/* 4. Generate a random octet string salt of length sLen; if sLen = 0,*    then salt is the empty string. */var salt;if(salt_ === null) {salt = prng.getBytesSync(sLen);} else {salt = salt_.bytes();}/* 5. Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt; */var m_ = new forge.util.ByteBuffer();m_.fillWithByte(0, 8);m_.putBytes(mHash);m_.putBytes(salt);/* 6. Let H = Hash(M'), an octet string of length hLen. */hash.start();hash.update(m_.getBytes());var h = hash.digest().getBytes();/* 7. Generate an octet string PS consisting of emLen - sLen - hLen - 2*    zero octets.  The length of PS may be 0. */var ps = new forge.util.ByteBuffer();ps.fillWithByte(0, emLen - sLen - hLen - 2);/* 8. Let DB = PS || 0x01 || salt; DB is an octet string of length*    emLen - hLen - 1. */ps.putByte(0x01);ps.putBytes(salt);var db = ps.getBytes();/* 9. Let dbMask = MGF(H, emLen - hLen - 1). */var maskLen = emLen - hLen - 1;var dbMask = mgf.generate(h, maskLen);/* 10. Let maskedDB = DB \xor dbMask. */var maskedDB = '';for(i = 0; i < maskLen; i++) {maskedDB += String.fromCharCode(db.charCodeAt(i) ^ dbMask.charCodeAt(i));}/* 11. Set the leftmost 8emLen - emBits bits of the leftmost octet in*     maskedDB to zero. */var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;maskedDB = String.fromCharCode(maskedDB.charCodeAt(0) & ~mask) +maskedDB.substr(1);/* 12. Let EM = maskedDB || H || 0xbc.* 13. Output EM. */return maskedDB + h + String.fromCharCode(0xbc);};/*** Verifies a PSS signature.** This function implements EMSA-PSS-VERIFY as per RFC 3447, section 9.1.2.** @param mHash the message digest hash, as a binary-encoded string, to*         compare against the signature.* @param em the encoded message, as a binary-encoded string*          (RSA decryption r###lt).* @param modsBits the length of the RSA modulus in bits.** @return true if the signature was verified, false if not.*/pssobj.verify = function(mHash, em, modBits) {var i;var emBits = modBits - 1;var emLen = Math.ceil(emBits / 8);/* c. Convert the message representative m to an encoded message EM*    of length emLen = ceil((modBits - 1) / 8) octets, where modBits*    is the length in bits of the RSA modulus n */em = em.substr(-emLen);/* 3. If emLen < hLen + sLen + 2, output "inconsistent" and stop. */if(emLen < hLen + sLen + 2) {throw new Error('Inconsistent parameters to PSS signature verification.');}/* 4. If the rightmost octet of EM does not have hexadecimal value*    0xbc, output "inconsistent" and stop. */if(em.charCodeAt(emLen - 1) !== 0xbc) {throw new Error('Encoded message does not end in 0xBC.');}/* 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and*    let H be the next hLen octets. */var maskLen = emLen - hLen - 1;var maskedDB = em.substr(0, maskLen);var h = em.substr(maskLen, hLen);/* 6. If the leftmost 8emLen - emBits bits of the leftmost octet in*    maskedDB are not all equal to zero, output "inconsistent" and stop. */var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;if((maskedDB.charCodeAt(0) & mask) !== 0) {throw new Error('Bits beyond keysize not zero as expected.');}/* 7. Let dbMask = MGF(H, emLen - hLen - 1). */var dbMask = mgf.generate(h, maskLen);/* 8. Let DB = maskedDB \xor dbMask. */var db = '';for(i = 0; i < maskLen; i++) {db += String.fromCharCode(maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i));}/* 9. Set the leftmost 8emLen - emBits bits of the leftmost octet* in DB to zero. */db = String.fromCharCode(db.charCodeAt(0) & ~mask) + db.substr(1);/* 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero* or if the octet at position emLen - hLen - sLen - 1 (the leftmost* position is "position 1") does not have hexadecimal value 0x01,* output "inconsistent" and stop. */var checkLen = emLen - hLen - sLen - 2;for(i = 0; i < checkLen; i++) {if(db.charCodeAt(i) !== 0x00) {throw new Error('Leftmost octets not zero as expected');}}if(db.charCodeAt(checkLen) !== 0x01) {throw new Error('Inconsistent PSS signature, 0x01 marker not found');}/* 11. Let salt be the last sLen octets of DB. */var salt = db.substr(-sLen);/* 12.  Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt */var m_ = new forge.util.ByteBuffer();m_.fillWithByte(0, 8);m_.putBytes(mHash);m_.putBytes(salt);/* 13. Let H' = Hash(M'), an octet string of length hLen. */hash.start();hash.update(m_.getBytes());var h_ = hash.digest().getBytes();/* 14. If H = H', output "consistent." Otherwise, output "inconsistent." */return h === h_;};return pssobj;};/***/ }),/***/ 6660:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** An API for getting cryptographically-secure random bytes. The bytes are* generated using the Fortuna algorithm devised by Bruce Schneier and* Niels Ferguson.** Getting strong random bytes is not yet easy to do in javascript. The only* truish random entropy that can be collected is from the mouse, keyboard, or* from timing with respect to page loads, etc. This generator makes a poor* attempt at providing random bytes when those sources haven't yet provided* enough entropy to initially seed or to reseed the PRNG.** @author Dave Longley** Copyright (c) 2009-2014 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(9166);__webpack_require__(3858);__webpack_require__(2365);(function() {// forge.random already definedif(forge.random && forge.random.getBytes) {module.exports = forge.random;return;}(function(jQuery) {// the default prng plugin, uses AES-128var prng_aes = {};var _prng_aes_output = new Array(4);var _prng_aes_buffer = forge.util.createBuffer();prng_aes.formatKey = function(key) {// convert the key into 32-bit integersvar tmp = forge.util.createBuffer(key);key = new Array(4);key[0] = tmp.getInt32();key[1] = tmp.getInt32();key[2] = tmp.getInt32();key[3] = tmp.getInt32();// return the expanded keyreturn forge.aes._expandKey(key, false);};prng_aes.formatSeed = function(seed) {// convert seed into 32-bit integersvar tmp = forge.util.createBuffer(seed);seed = new Array(4);seed[0] = tmp.getInt32();seed[1] = tmp.getInt32();seed[2] = tmp.getInt32();seed[3] = tmp.getInt32();return seed;};prng_aes.cipher = function(key, seed) {forge.aes._updateBlock(key, seed, _prng_aes_output, false);_prng_aes_buffer.putInt32(_prng_aes_output[0]);_prng_aes_buffer.putInt32(_prng_aes_output[1]);_prng_aes_buffer.putInt32(_prng_aes_output[2]);_prng_aes_buffer.putInt32(_prng_aes_output[3]);return _prng_aes_buffer.getBytes();};prng_aes.increment = function(seed) {// FIXME: do we care about carry or signed issues?++seed[3];return seed;};prng_aes.md = forge.md.sha256;/*** Creates a new PRNG.*/function spawnPrng() {var ctx = forge.prng.create(prng_aes);/*** Gets random bytes. If a native secure crypto API is unavailable, this* method tries to make the bytes more unpredictable by drawing from data that* can be collected from the user of the browser, eg: mouse movement.** If a callback is given, this method will be called asynchronously.** @param count the number of random bytes to get.* @param [callback(err, bytes)] called once the operation completes.** @return the random bytes in a string.*/ctx.getBytes = function(count, callback) {return ctx.generate(count, callback);};/*** Gets random bytes asynchronously. If a native secure crypto API is* unavailable, this method tries to make the bytes more unpredictable by* drawing from data that can be collected from the user of the browser,* eg: mouse movement.** @param count the number of random bytes to get.** @return the random bytes in a string.*/ctx.getBytesSync = function(count) {return ctx.generate(count);};return ctx;}// create default prng contextvar _ctx = spawnPrng();// add other sources of entropy only if window.crypto.getRandomValues is not// available -- otherwise this source will be automatically used by the prngvar getRandomValues = null;var globalScope = forge.util.globalScope;var _crypto = globalScope.crypto || globalScope.msCrypto;if(_crypto && _crypto.getRandomValues) {getRandomValues = function(arr) {return _crypto.getRandomValues(arr);};}if(forge.options.usePureJavaScript ||(!forge.util.isNodejs && !getRandomValues)) {// if this is a web worker, do not use weak entropy, instead register to// receive strong entropy asynchronously from the main threadif(typeof window === 'undefined' || window.document === undefined) {// FIXME:}// get load time entropy_ctx.collectInt(+new Date(), 32);// add some entropy from navigator objectif(typeof(navigator) !== 'undefined') {var _navBytes = '';for(var key in navigator) {try {if(typeof(navigator[key]) == 'string') {_navBytes += navigator[key];}} catch(e) {/* Some navigator keys might not be accessible, e.g. the geolocationattribute throws an exception if touched in Mozilla chrome://context.Silently ignore this and just don't use this as a source ofentropy. */}}_ctx.collect(_navBytes);_navBytes = null;}// add mouse and keyboard collectors if jquery is availableif(jQuery) {// set up mouse entropy capturejQuery().mousemove(function(e) {// add mouse coords_ctx.collectInt(e.clientX, 16);_ctx.collectInt(e.clientY, 16);});// set up keyboard entropy capturejQuery().keypress(function(e) {_ctx.collectInt(e.charCode, 8);});}}/* Random API */if(!forge.random) {forge.random = _ctx;} else {// extend forge.random with _ctxfor(var key in _ctx) {forge.random[key] = _ctx[key];}}// expose spawn PRNGforge.random.createInstance = spawnPrng;module.exports = forge.random;})(typeof(jQuery) !== 'undefined' ? jQuery : null);})();/***/ }),/***/ 6994:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** RC2 implementation.** @author Stefan Siegl** Copyright (c) 2012 Stefan Siegl <[email protected]>** Information on the RC2 cipher is available from RFC #2268,* http://www.ietf.org/rfc/rfc2268.txt*/var forge = __webpack_require__(7009);__webpack_require__(2365);var piTable = [0xd9, 0x78, 0xf9, 0xc4, 0x19, 0xdd, 0xb5, 0xed, 0x28, 0xe9, 0xfd, 0x79, 0x4a, 0xa0, 0xd8, 0x9d,0xc6, 0x7e, 0x37, 0x83, 0x2b, 0x76, 0x53, 0x8e, 0x62, 0x4c, 0x64, 0x88, 0x44, 0x8b, 0xfb, 0xa2,0x17, 0x9a, 0x59, 0xf5, 0x87, 0xb3, 0x4f, 0x13, 0x61, 0x45, 0x6d, 0x8d, 0x09, 0x81, 0x7d, 0x32,0xbd, 0x8f, 0x40, 0xeb, 0x86, 0xb7, 0x7b, 0x0b, 0xf0, 0x95, 0x21, 0x22, 0x5c, 0x6b, 0x4e, 0x82,0x54, 0xd6, 0x65, 0x93, 0xce, 0x60, 0xb2, 0x1c, 0x73, 0x56, 0xc0, 0x14, 0xa7, 0x8c, 0xf1, 0xdc,0x12, 0x75, 0xca, 0x1f, 0x3b, 0xbe, 0xe4, 0xd1, 0x42, 0x3d, 0xd4, 0x30, 0xa3, 0x3c, 0xb6, 0x26,0x6f, 0xbf, 0x0e, 0xda, 0x46, 0x69, 0x07, 0x57, 0x27, 0xf2, 0x1d, 0x9b, 0xbc, 0x94, 0x43, 0x03,0xf8, 0x11, 0xc7, 0xf6, 0x90, 0xef, 0x3e, 0xe7, 0x06, 0xc3, 0xd5, 0x2f, 0xc8, 0x66, 0x1e, 0xd7,0x08, 0xe8, 0xea, 0xde, 0x80, 0x52, 0xee, 0xf7, 0x84, 0xaa, 0x72, 0xac, 0x35, 0x4d, 0x6a, 0x2a,0x96, 0x1a, 0xd2, 0x71, 0x5a, 0x15, 0x49, 0x74, 0x4b, 0x9f, 0xd0, 0x5e, 0x04, 0x18, 0xa4, 0xec,0xc2, 0xe0, 0x41, 0x6e, 0x0f, 0x51, 0xcb, 0xcc, 0x24, 0x91, 0xaf, 0x50, 0xa1, 0xf4, 0x70, 0x39,0x99, 0x7c, 0x3a, 0x85, 0x23, 0xb8, 0xb4, 0x7a, 0xfc, 0x02, 0x36, 0x5b, 0x25, 0x55, 0x97, 0x31,0x2d, 0x5d, 0xfa, 0x98, 0xe3, 0x8a, 0x92, 0xae, 0x05, 0xdf, 0x29, 0x10, 0x67, 0x6c, 0xba, 0xc9,0xd3, 0x00, 0xe6, 0xcf, 0xe1, 0x9e, 0xa8, 0x2c, 0x63, 0x16, 0x01, 0x3f, 0x58, 0xe2, 0x89, 0xa9,0x0d, 0x38, 0x34, 0x1b, 0xab, 0x33, 0xff, 0xb0, 0xbb, 0x48, 0x0c, 0x5f, 0xb9, 0xb1, 0xcd, 0x2e,0xc5, 0xf3, 0xdb, 0x47, 0xe5, 0xa5, 0x9c, 0x77, 0x0a, 0xa6, 0x20, 0x68, 0xfe, 0x7f, 0xc1, 0xad];var s = [1, 2, 3, 5];/*** Rotate a word left by given number of bits.** Bits that are shifted out on the left are put back in on the right* hand side.** @param word The word to shift left.* @param bits The number of bits to shift by.* @return The rotated word.*/var rol = function(word, bits) {return ((word << bits) & 0xffff) | ((word & 0xffff) >> (16 - bits));};/*** Rotate a word right by given number of bits.** Bits that are shifted out on the right are put back in on the left* hand side.** @param word The word to shift right.* @param bits The number of bits to shift by.* @return The rotated word.*/var ror = function(word, bits) {return ((word & 0xffff) >> bits) | ((word << (16 - bits)) & 0xffff);};/* RC2 API */module.exports = forge.rc2 = forge.rc2 || {};/*** Perform RC2 key expansion as per RFC #2268, section 2.** @param key variable-length user key (between 1 and 128 bytes)* @param effKeyBits number of effective key bits (default: 128)* @return the expanded RC2 key (ByteBuffer of 128 bytes)*/forge.rc2.expandKey = function(key, effKeyBits) {if(typeof key === 'string') {key = forge.util.createBuffer(key);}effKeyBits = effKeyBits || 128;/* introduce variables that match the names used in RFC #2268 */var L = key;var T = key.length();var T1 = effKeyBits;var T8 = Math.ceil(T1 / 8);var TM = 0xff >> (T1 & 0x07);var i;for(i = T; i < 128; i++) {L.putByte(piTable[(L.at(i - 1) + L.at(i - T)) & 0xff]);}L.setAt(128 - T8, piTable[L.at(128 - T8) & TM]);for(i = 127 - T8; i >= 0; i--) {L.setAt(i, piTable[L.at(i + 1) ^ L.at(i + T8)]);}return L;};/*** Creates a RC2 cipher object.** @param key the symmetric key to use (as base for key generation).* @param bits the number of effective key bits.* @param encrypt false for decryption, true for encryption.** @return the cipher.*/var createCipher = function(key, bits, encrypt) {var _finish = false, _input = null, _output = null, _iv = null;var mixRound, mashRound;var i, j, K = [];/* Expand key and fill into K[] Array */key = forge.rc2.expandKey(key, bits);for(i = 0; i < 64; i++) {K.push(key.getInt16Le());}if(encrypt) {/*** Perform one mixing round "in place".** @param R Array of four words to perform mixing on.*/mixRound = function(R) {for(i = 0; i < 4; i++) {R[i] += K[j] + (R[(i + 3) % 4] & R[(i + 2) % 4]) +((~R[(i + 3) % 4]) & R[(i + 1) % 4]);R[i] = rol(R[i], s[i]);j++;}};/*** Perform one mashing round "in place".** @param R Array of four words to perform mashing on.*/mashRound = function(R) {for(i = 0; i < 4; i++) {R[i] += K[R[(i + 3) % 4] & 63];}};} else {/*** Perform one r-mixing round "in place".** @param R Array of four words to perform mixing on.*/mixRound = function(R) {for(i = 3; i >= 0; i--) {R[i] = ror(R[i], s[i]);R[i] -= K[j] + (R[(i + 3) % 4] & R[(i + 2) % 4]) +((~R[(i + 3) % 4]) & R[(i + 1) % 4]);j--;}};/*** Perform one r-mashing round "in place".** @param R Array of four words to perform mashing on.*/mashRound = function(R) {for(i = 3; i >= 0; i--) {R[i] -= K[R[(i + 3) % 4] & 63];}};}/*** Run the specified cipher execution plan.** This function takes four words from the input buffer, applies the IV on* it (if requested) and runs the provided execution plan.** The plan must be put together in form of a array of arrays.  Where the* outer one is simply a list of steps to perform and the inner one needs* to have two elements: the first one telling how many rounds to perform,* the second one telling what to do (i.e. the function to call).** @param {Array} plan The plan to execute.*/var runPlan = function(plan) {var R = [];/* Get data from input buffer and fill the four words into R */for(i = 0; i < 4; i++) {var val = _input.getInt16Le();if(_iv !== null) {if(encrypt) {/* We're encrypting, apply the IV first. */val ^= _iv.getInt16Le();} else {/* We're decryption, keep cipher text for next block. */_iv.putInt16Le(val);}}R.push(val & 0xffff);}/* Reset global "j" variable as per spec. */j = encrypt ? 0 : 63;/* Run execution plan. */for(var ptr = 0; ptr < plan.length; ptr++) {for(var ctr = 0; ctr < plan[ptr][0]; ctr++) {plan[ptr][1](R);}}/* Write back r###lt to output buffer. */for(i = 0; i < 4; i++) {if(_iv !== null) {if(encrypt) {/* We're encrypting in CBC-mode, feed back encrypted bytes intoIV buffer to carry it forward to next block. */_iv.putInt16Le(R[i]);} else {R[i] ^= _iv.getInt16Le();}}_output.putInt16Le(R[i]);}};/* Create cipher object */var cipher = null;cipher = {/*** Starts or restarts the encryption or decryption process, whichever* was previously configured.** To use the cipher in CBC mode, iv may be given either as a string* of bytes, or as a byte buffer.  For ECB mode, give null as iv.** @param iv the initialization vector to use, null for ECB mode.* @param output the output the buffer to write to, null to create one.*/start: function(iv, output) {if(iv) {/* CBC mode */if(typeof iv === 'string') {iv = forge.util.createBuffer(iv);}}_finish = false;_input = forge.util.createBuffer();_output = output || new forge.util.createBuffer();_iv = iv;cipher.output = _output;},/*** Updates the next block.** @param input the buffer to read from.*/update: function(input) {if(!_finish) {// not finishing, so fill the input buffer with more input_input.putBuffer(input);}while(_input.length() >= 8) {runPlan([[ 5, mixRound ],[ 1, mashRound ],[ 6, mixRound ],[ 1, mashRound ],[ 5, mixRound ]]);}},/*** Finishes encrypting or decrypting.** @param pad a padding function to use, null for PKCS#7 padding,*           signature(blockSize, buffer, decrypt).** @return true if successful, false on error.*/finish: function(pad) {var rval = true;if(encrypt) {if(pad) {rval = pad(8, _input, !encrypt);} else {// add PKCS#7 padding to block (each pad byte is the// value of the number of pad bytes)var padding = (_input.length() === 8) ? 8 : (8 - _input.length());_input.fillWithByte(padding, padding);}}if(rval) {// do final update_finish = true;cipher.update();}if(!encrypt) {// check for error: input data not a multiple of block sizerval = (_input.length() === 0);if(rval) {if(pad) {rval = pad(8, _output, !encrypt);} else {// ensure padding byte count is validvar len = _output.length();var count = _output.at(len - 1);if(count > len) {rval = false;} else {// trim off padding bytes_output.truncate(count);}}}}return rval;}};return cipher;};/*** Creates an RC2 cipher object to encrypt data in ECB or CBC mode using the* given symmetric key. The output will be stored in the 'output' member* of the returned cipher.** The key and iv may be given as a string of bytes or a byte buffer.* The cipher is initialized to use 128 effective key bits.** @param key the symmetric key to use.* @param iv the initialization vector to use.* @param output the buffer to write to, null to create one.** @return the cipher.*/forge.rc2.startEncrypting = function(key, iv, output) {var cipher = forge.rc2.createEncryptionCipher(key, 128);cipher.start(iv, output);return cipher;};/*** Creates an RC2 cipher object to encrypt data in ECB or CBC mode using the* given symmetric key.** The key may be given as a string of bytes or a byte buffer.** To start encrypting call start() on the cipher with an iv and optional* output buffer.** @param key the symmetric key to use.** @return the cipher.*/forge.rc2.createEncryptionCipher = function(key, bits) {return createCipher(key, bits, true);};/*** Creates an RC2 cipher object to decrypt data in ECB or CBC mode using the* given symmetric key. The output will be stored in the 'output' member* of the returned cipher.** The key and iv may be given as a string of bytes or a byte buffer.* The cipher is initialized to use 128 effective key bits.** @param key the symmetric key to use.* @param iv the initialization vector to use.* @param output the buffer to write to, null to create one.** @return the cipher.*/forge.rc2.startDecrypting = function(key, iv, output) {var cipher = forge.rc2.createDecryptionCipher(key, 128);cipher.start(iv, output);return cipher;};/*** Creates an RC2 cipher object to decrypt data in ECB or CBC mode using the* given symmetric key.** The key may be given as a string of bytes or a byte buffer.** To start decrypting call start() on the cipher with an iv and optional* output buffer.** @param key the symmetric key to use.** @return the cipher.*/forge.rc2.createDecryptionCipher = function(key, bits) {return createCipher(key, bits, false);};/***/ }),/***/ 524:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of basic RSA algorithms.** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.** The only algorithm currently supported for PKI is RSA.** An RSA key is often stored in ASN.1 DER format. The SubjectPublicKeyInfo* ASN.1 structure is composed of an algorithm of type AlgorithmIdentifier* and a subjectPublicKey of type bit string.** The AlgorithmIdentifier contains an Object Identifier (OID) and parameters* for the algorithm, if any. In the case of RSA, there aren't any.** SubjectPublicKeyInfo ::= SEQUENCE {*   algorithm AlgorithmIdentifier,*   subjectPublicKey BIT STRING* }** AlgorithmIdentifer ::= SEQUENCE {*   algorithm OBJECT IDENTIFIER,*   parameters ANY DEFINED BY algorithm OPTIONAL* }** For an RSA public key, the subjectPublicKey is:** RSAPublicKey ::= SEQUENCE {*   modulus            INTEGER,    -- n*   publicExponent     INTEGER     -- e* }** PrivateKeyInfo ::= SEQUENCE {*   version                   Version,*   privateKeyAlgorithm       PrivateKeyAlgorithmIdentifier,*   privateKey                PrivateKey,*   attributes           [0]  IMPLICIT Attributes OPTIONAL* }** Version ::= INTEGER* PrivateKeyAlgorithmIdentifier ::= AlgorithmIdentifier* PrivateKey ::= OCTET STRING* Attributes ::= SET OF Attribute** An RSA private key as the following structure:** RSAPrivateKey ::= SEQUENCE {*   version Version,*   modulus INTEGER, -- n*   publicExponent INTEGER, -- e*   privateExponent INTEGER, -- d*   prime1 INTEGER, -- p*   prime2 INTEGER, -- q*   exponent1 INTEGER, -- d mod (p-1)*   exponent2 INTEGER, -- d mod (q-1)*   coefficient INTEGER -- (inverse of q) mod p* }** Version ::= INTEGER** The OID for the RSA key algorithm is: 1.2.840.113549.1.1.1*/var forge = __webpack_require__(7009);__webpack_require__(1598);__webpack_require__(8785);__webpack_require__(1692);__webpack_require__(4188);__webpack_require__(4846);__webpack_require__(6660);__webpack_require__(2365);if(typeof BigInteger === 'undefined') {var BigInteger = forge.jsbn.BigInteger;}var _crypto = forge.util.isNodejs ? __webpack_require__(7418) : null;// shortcut for asn.1 APIvar asn1 = forge.asn1;// shortcut for util APIvar util = forge.util;/** RSA encryption and decryption, see RFC 2313.*/forge.pki = forge.pki || {};module.exports = forge.pki.rsa = forge.rsa = forge.rsa || {};var pki = forge.pki;// for finding primes, which are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29var ###_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];// validator for a PrivateKeyInfo structurevar privateKeyValidator = {// PrivateKeyInfoname: 'PrivateKeyInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{// Version (INTEGER)name: 'PrivateKeyInfo.version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyVersion'}, {// privateKeyAlgorithmname: 'PrivateKeyInfo.privateKeyAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'AlgorithmIdentifier.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'privateKeyOid'}]}, {// PrivateKeyname: 'PrivateKeyInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OCTETSTRING,constructed: false,capture: 'privateKey'}]};// validator for an RSA private keyvar rsaPrivateKeyValidator = {// RSAPrivateKeyname: 'RSAPrivateKey',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{// Version (INTEGER)name: 'RSAPrivateKey.version',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyVersion'}, {// modulus (n)name: 'RSAPrivateKey.modulus',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyModulus'}, {// publicExponent (e)name: 'RSAPrivateKey.publicExponent',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyPublicExponent'}, {// privateExponent (d)name: 'RSAPrivateKey.privateExponent',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyPrivateExponent'}, {// prime1 (p)name: 'RSAPrivateKey.prime1',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyPrime1'}, {// prime2 (q)name: 'RSAPrivateKey.prime2',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyPrime2'}, {// exponent1 (d mod (p-1))name: 'RSAPrivateKey.exponent1',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyExponent1'}, {// exponent2 (d mod (q-1))name: 'RSAPrivateKey.exponent2',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyExponent2'}, {// coefficient ((inverse of q) mod p)name: 'RSAPrivateKey.coefficient',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'privateKeyCoefficient'}]};// validator for an RSA public keyvar rsaPublicKeyValidator = {// RSAPublicKeyname: 'RSAPublicKey',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{// modulus (n)name: 'RSAPublicKey.modulus',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'publicKeyModulus'}, {// publicExponent (e)name: 'RSAPublicKey.exponent',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'publicKeyExponent'}]};// validator for an SubjectPublicKeyInfo structure// Note: Currently only works with an RSA public keyvar publicKeyValidator = forge.pki.rsa.publicKeyValidator = {name: 'SubjectPublicKeyInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'subjectPublicKeyInfo',value: [{name: 'SubjectPublicKeyInfo.AlgorithmIdentifier',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'AlgorithmIdentifier.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'publicKeyOid'}]}, {// subjectPublicKeyname: 'SubjectPublicKeyInfo.subjectPublicKey',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.BITSTRING,constructed: false,value: [{// RSAPublicKeyname: 'SubjectPublicKeyInfo.subjectPublicKey.RSAPublicKey',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,optional: true,captureAsn1: 'rsaPublicKey'}]}]};/*** Wrap digest in DigestInfo object.** This function implements EMSA-PKCS1-v1_5-ENCODE as per RFC 3447.** DigestInfo ::= SEQUENCE {*   digestAlgorithm DigestAlgorithmIdentifier,*   digest Digest* }** DigestAlgorithmIdentifier ::= AlgorithmIdentifier* Digest ::= OCTET STRING** @param md the message digest object with the hash to sign.** @return the encoded message (ready for RSA encrytion)*/var emsaPkcs1v15encode = function(md) {// get the oid for the algorithmvar oid;if(md.algorithm in pki.oids) {oid = pki.oids[md.algorithm];} else {var error = new Error('Unknown message digest algorithm.');error.algorithm = md.algorithm;throw error;}var oidBytes = asn1.oidToDer(oid).getBytes();// create the digest infovar digestInfo = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);var digestAlgorithm = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);digestAlgorithm.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, oidBytes));digestAlgorithm.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, ''));var digest = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING,false, md.digest().getBytes());digestInfo.value.push(digestAlgorithm);digestInfo.value.push(digest);// encode digest inforeturn asn1.toDer(digestInfo).getBytes();};/*** Performs x^c mod n (RSA encryption or decryption operation).** @param x the number to raise and mod.* @param key the key to use.* @param pub true if the key is public, false if private.** @return the r###lt of x^c mod n.*/var _modPow = function(x, key, pub) {if(pub) {return x.modPow(key.e, key.n);}if(!key.p || !key.q) {// allow calculation without CRT params (slow)return x.modPow(key.d, key.n);}// pre-compute dP, dQ, and qInv if necessaryif(!key.dP) {key.dP = key.d.mod(key.p.subtract(BigInteger.ONE));}if(!key.dQ) {key.dQ = key.d.mod(key.q.subtract(BigInteger.ONE));}if(!key.qInv) {key.qInv = key.q.modInverse(key.p);}/* Chinese remainder theorem (CRT) states:Suppose n1, n2, ..., nk are positive integers which are pairwisecoprime (n1 and n2 have no common factors other than 1). For anyintegers x1, x2, ..., xk there exists an integer x solving thesystem of simultaneous congruences (where ~= means modularlycongruent so a ~= b mod n means a mod n = b mod n):x ~= x1 mod n1x ~= x2 mod n2...x ~= xk mod nkThis system of congruences has a single simultaneous solution xbetween 0 and n - 1. Furthermore, each xk solution and x itselfis congruent modulo the product n = n1*n2*...*nk.So x1 mod n = x2 mod n = xk mod n = x mod n.The single simultaneous solution x can be solved with the followingequation:x = sum(xi*ri*si) mod n where ri = n/ni and si = ri^-1 mod ni.Where x is less than n, xi = x mod ni.For RSA we are only concerned with k = 2. The modulus n = pq, wherep and q are coprime. The RSA decryption algorithm is:y = x^d mod nGiven the above:x1 = x^d mod pr1 = n/p = qs1 = q^-1 mod px2 = x^d mod qr2 = n/q = ps2 = p^-1 mod qSo y = (x1r1s1 + x2r2s2) mod n= ((x^d mod p)q(q^-1 mod p) + (x^d mod q)p(p^-1 mod q)) mod nAccording to Fermat's Little Theorem, if the modulus P is prime,for any integer A not evenly divisible by P, A^(P-1) ~= 1 mod P.Since A is not divisible by P it follows that if:N ~= M mod (P - 1), then A^N mod P = A^M mod P. Therefore:A^N mod P = A^(M mod (P - 1)) mod P. (The latter takes less effortto calculate). In order to calculate x^d mod p more quickly theexponent d mod (p - 1) is stored in the RSA private key (the sameis done for x^d mod q). These values are referred to as dP and dQrespectively. Therefore we now have:y = ((x^dP mod p)q(q^-1 mod p) + (x^dQ mod q)p(p^-1 mod q)) mod nSince we'll be reducing x^dP by modulo p (same for q) we can alsoreduce x by p (and q respectively) before hand. Therefore, letxp = ((x mod p)^dP mod p), andxq = ((x mod q)^dQ mod q), yielding:y = (xp*q*(q^-1 mod p) + xq*p*(p^-1 mod q)) mod nThis can be further reduced to a simple algorithm that onlyrequires 1 inverse (the q inverse is used) to be used and stored.The algorithm is called Garner's algorithm. If qInv is theinverse of q, we simply calculate:y = (qInv*(xp - xq) mod p) * q + xqHowever, there are two further complications. First, we need toensure that xp > xq to prevent signed BigIntegers from being usedso we add p until this is true (since we will be mod'ing withp anyway). Then, there is a known timing attack on algorithmsusing the CRT. To mitigate this risk, "cryptographic blinding"should be used. This requires simply generating a random number rbetween 0 and n-1 and its inverse and multiplying x by r^e beforecalculating y and then multiplying y by r^-1 afterwards. Note thatr must be coprime with n (###(r, n) === 1) in order to have aninverse.*/// cryptographic blindingvar r;do {r = new BigInteger(forge.util.bytesToHex(forge.random.getBytes(key.n.bitLength() / 8)),16);} while(r.compareTo(key.n) >= 0 || !r.###(key.n).equals(BigInteger.ONE));x = x.multiply(r.modPow(key.e, key.n)).mod(key.n);// calculate xp and xqvar xp = x.mod(key.p).modPow(key.dP, key.p);var xq = x.mod(key.q).modPow(key.dQ, key.q);// xp must be larger than xq to avoid signed bit usagewhile(xp.compareTo(xq) < 0) {xp = xp.add(key.p);}// do last stepvar y = xp.subtract(xq).multiply(key.qInv).mod(key.p).multiply(key.q).add(xq);// remove effect of random for cryptographic blindingy = y.multiply(r.modInverse(key.n)).mod(key.n);return y;};/*** NOTE: THIS METHOD IS DEPRECATED, use 'sign' on a private key object or* 'encrypt' on a public key object instead.** Performs RSA encryption.** The parameter bt controls whether to put padding bytes before the* message passed in. Set bt to either true or false to disable padding* completely (in order to handle e.g. EMSA-PSS encoding seperately before),* signaling whether the encryption operation is a public key operation* (i.e. encrypting data) or not, i.e. private key operation (data signing).** For PKCS#1 v1.5 padding pass in the block type to use, i.e. either 0x01* (for signing) or 0x02 (for encryption). The key operation mode (private* or public) is derived from this flag in that case).** @param m the message to encrypt as a byte string.* @param key the RSA key to use.* @param bt for PKCS#1 v1.5 padding, the block type to use*   (0x01 for private key, 0x02 for public),*   to disable padding: true = public key, false = private key.** @return the encrypted bytes as a string.*/pki.rsa.encrypt = function(m, key, bt) {var pub = bt;var eb;// get the length of the modulus in bytesvar k = Math.ceil(key.n.bitLength() / 8);if(bt !== false && bt !== true) {// legacy, default to PKCS#1 v1.5 paddingpub = (bt === 0x02);eb = _encodePkcs1_v1_5(m, key, bt);} else {eb = forge.util.createBuffer();eb.putBytes(m);}// load encryption block as big integer 'x'// FIXME: hex conversion inefficient, get BigInteger w/byte stringsvar x = new BigInteger(eb.toHex(), 16);// do RSA encryptionvar y = _modPow(x, key, pub);// convert y into the encrypted data byte string, if y is shorter in// bytes than k, then prepend zero bytes to fill up ed// FIXME: hex conversion inefficient, get BigInteger w/byte stringsvar yhex = y.toString(16);var ed = forge.util.createBuffer();var zeros = k - Math.ceil(yhex.length / 2);while(zeros > 0) {ed.putByte(0x00);--zeros;}ed.putBytes(forge.util.hexToBytes(yhex));return ed.getBytes();};/*** NOTE: THIS METHOD IS DEPRECATED, use 'decrypt' on a private key object or* 'verify' on a public key object instead.** Performs RSA decryption.** The parameter ml controls whether to apply PKCS#1 v1.5 padding* or not.  Set ml = false to disable padding removal completely* (in order to handle e.g. EMSA-PSS later on) and simply pass back* the RSA encryption block.** @param ed the encrypted data to decrypt in as a byte string.* @param key the RSA key to use.* @param pub true for a public key operation, false for private.* @param ml the message length, if known, false to disable padding.** @return the decrypted message as a byte string.*/pki.rsa.decrypt = function(ed, key, pub, ml) {// get the length of the modulus in bytesvar k = Math.ceil(key.n.bitLength() / 8);// error if the length of the encrypted data ED is not kif(ed.length !== k) {var error = new Error('Encrypted message length is invalid.');error.length = ed.length;error.expected = k;throw error;}// convert encrypted data into a big integer// FIXME: hex conversion inefficient, get BigInteger w/byte stringsvar y = new BigInteger(forge.util.createBuffer(ed).toHex(), 16);// y must be less than the modulus or it wasn't the r###lt of// a previous mod operation (encryption) using that modulusif(y.compareTo(key.n) >= 0) {throw new Error('Encrypted message is invalid.');}// do RSA decryptionvar x = _modPow(y, key, pub);// create the encryption block, if x is shorter in bytes than k, then// prepend zero bytes to fill up eb// FIXME: hex conversion inefficient, get BigInteger w/byte stringsvar xhex = x.toString(16);var eb = forge.util.createBuffer();var zeros = k - Math.ceil(xhex.length / 2);while(zeros > 0) {eb.putByte(0x00);--zeros;}eb.putBytes(forge.util.hexToBytes(xhex));if(ml !== false) {// legacy, default to PKCS#1 v1.5 paddingreturn _decodePkcs1_v1_5(eb.getBytes(), key, pub);}// return messagereturn eb.getBytes();};/*** Creates an RSA key-pair generation state object. It is used to allow* key-generation to be performed in steps. It also allows for a UI to* display progress updates.** @param bits the size for the private key in bits, defaults to 2048.* @param e the public exponent to use, defaults to 65537 (0x10001).* @param [options] the options to use.*          prng a custom crypto-secure pseudo-random number generator to use,*            that must define "getBytesSync".*          algorithm the algorithm to use (default: 'PRIMEINC').** @return the state object to use to generate the key-pair.*/pki.rsa.createKeyPairGenerationState = function(bits, e, options) {// TODO: migrate step-based prime generation code to forge.prime// set default bitsif(typeof(bits) === 'string') {bits = parseInt(bits, 10);}bits = bits || 2048;// create prng with api that matches BigInteger secure randomoptions = options || {};var prng = options.prng || forge.random;var rng = {// x is an array to fill with bytesnextBytes: function(x) {var b = prng.getBytesSync(x.length);for(var i = 0; i < x.length; ++i) {x[i] = b.charCodeAt(i);}}};var algorithm = options.algorithm || 'PRIMEINC';// create PRIMEINC algorithm statevar rval;if(algorithm === 'PRIMEINC') {rval = {algorithm: algorithm,state: 0,bits: bits,rng: rng,eInt: e || 65537,e: new BigInteger(null),p: null,q: null,qBits: bits >> 1,pBits: bits - (bits >> 1),pqState: 0,num: null,keys: null};rval.e.fromInt(rval.eInt);} else {throw new Error('Invalid key generation algorithm: ' + algorithm);}return rval;};/*** Attempts to runs the key-generation algorithm for at most n seconds* (approximately) using the given state. When key-generation has completed,* the keys will be stored in state.keys.** To use this function to update a UI while generating a key or to prevent* causing browser lockups/warnings, set "n" to a value other than 0. A* simple pattern for generating a key and showing a progress indicator is:** var state = pki.rsa.createKeyPairGenerationState(2048);* var step = function() {*   // step key-generation, run algorithm for 100 ms, repeat*   if(!forge.pki.rsa.stepKeyPairGenerationState(state, 100)) {*     setTimeout(step, 1);*   } else {*     // key-generation complete*     // TODO: turn off progress indicator here*     // TODO: use the generated key-pair in "state.keys"*   }* };* // TODO: turn on progress indicator here* setTimeout(step, 0);** @param state the state to use.* @param n the maximum number of milliseconds to run the algorithm for, 0*          to run the algorithm to completion.** @return true if the key-generation completed, false if not.*/pki.rsa.stepKeyPairGenerationState = function(state, n) {// set default algorithm if not setif(!('algorithm' in state)) {state.algorithm = 'PRIMEINC';}// TODO: migrate step-based prime generation code to forge.prime// TODO: abstract as PRIMEINC algorithm// do key generation (based on Tom Wu's rsa.js, see jsbn.js license)// with some minor optimizations and designed to run in steps// local state varsvar THIRTY = new BigInteger(null);THIRTY.fromInt(30);var deltaIdx = 0;var op_or = function(x, y) {return x | y;};// keep stepping until time limit is reached or donevar t1 = +new Date();var t2;var total = 0;while(state.keys === null && (n <= 0 || total < n)) {// generate p or qif(state.state === 0) {/* Note: All primes are of the form:30k+i, for i < 30 and ###(30, i)=1, where there are 8 values for iWhen we generate a random number, we always align it at 30k + 1. Eachtime the number is determined not to be prime we add to get to thenext 'i', eg: if the number was at 30k + 1 we add 6. */var bits = (state.p === null) ? state.pBits : state.qBits;var bits1 = bits - 1;// get a random numberif(state.pqState === 0) {state.num = new BigInteger(bits, state.rng);// force MSB setif(!state.num.testBit(bits1)) {state.num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, state.num);}// align number on 30k+1 boundarystate.num.dAddOffset(31 - state.num.mod(THIRTY).byteValue(), 0);deltaIdx = 0;++state.pqState;} else if(state.pqState === 1) {// try to make the number a primeif(state.num.bitLength() > bits) {// overflow, try againstate.pqState = 0;// do primality test} else if(state.num.isProbablePrime(_getMillerRabinTests(state.num.bitLength()))) {++state.pqState;} else {// get next potential primestate.num.dAddOffset(###_30_DELTA[deltaIdx++ % 8], 0);}} else if(state.pqState === 2) {// ensure number is coprime with estate.pqState =(state.num.subtract(BigInteger.ONE).###(state.e).compareTo(BigInteger.ONE) === 0) ? 3 : 0;} else if(state.pqState === 3) {// store p or qstate.pqState = 0;if(state.p === null) {state.p = state.num;} else {state.q = state.num;}// advance state if both p and q are readyif(state.p !== null && state.q !== null) {++state.state;}state.num = null;}} else if(state.state === 1) {// ensure p is larger than q (swap them if not)if(state.p.compareTo(state.q) < 0) {state.num = state.p;state.p = state.q;state.q = state.num;}++state.state;} else if(state.state === 2) {// compute phi: (p - 1)(q - 1) (Euler's totient function)state.p1 = state.p.subtract(BigInteger.ONE);state.q1 = state.q.subtract(BigInteger.ONE);state.phi = state.p1.multiply(state.q1);++state.state;} else if(state.state === 3) {// ensure e and phi are coprimeif(state.phi.###(state.e).compareTo(BigInteger.ONE) === 0) {// phi and e are coprime, advance++state.state;} else {// phi and e aren't coprime, so generate a new p and qstate.p = null;state.q = null;state.state = 0;}} else if(state.state === 4) {// create n, ensure n is has the right number of bitsstate.n = state.p.multiply(state.q);// ensure n is right number of bitsif(state.n.bitLength() === state.bits) {// success, advance++state.state;} else {// failed, get new qstate.q = null;state.state = 0;}} else if(state.state === 5) {// set keysvar d = state.e.modInverse(state.phi);state.keys = {privateKey: pki.rsa.setPrivateKey(state.n, state.e, d, state.p, state.q,d.mod(state.p1), d.mod(state.q1),state.q.modInverse(state.p)),publicKey: pki.rsa.setPublicKey(state.n, state.e)};}// update timingt2 = +new Date();total += t2 - t1;t1 = t2;}return state.keys !== null;};/*** Generates an RSA public-private key pair in a single call.** To generate a key-pair in steps (to allow for progress updates and to* prevent blocking or warnings in slow browsers) then use the key-pair* generation state functions.** To generate a key-pair asynchronously (either through web-workers, if* available, or by breaking up the work on the main thread), pass a* callback function.** @param [bits] the size for the private key in bits, defaults to 2048.* @param [e] the public exponent to use, defaults to 65537.* @param [options] options for key-pair generation, if given then 'bits'*            and 'e' must *not* be given:*          bits the size for the private key in bits, (default: 2048).*          e the public exponent to use, (default: 65537 (0x10001)).*          workerScript the worker script URL.*          workers the number of web workers (if supported) to use,*            (default: 2).*          workLoad the size of the work load, ie: number of possible prime*            numbers for each web worker to check per work assignment,*            (default: 100).*          prng a custom crypto-secure pseudo-random number generator to use,*            that must define "getBytesSync". Disables use of native APIs.*          algorithm the algorithm to use (default: 'PRIMEINC').* @param [callback(err, keypair)] called once the operation completes.** @return an object with privateKey and publicKey properties.*/pki.rsa.generateKeyPair = function(bits, e, options, callback) {// (bits), (options), (callback)if(arguments.length === 1) {if(typeof bits === 'object') {options = bits;bits = undefined;} else if(typeof bits === 'function') {callback = bits;bits = undefined;}} else if(arguments.length === 2) {// (bits, e), (bits, options), (bits, callback), (options, callback)if(typeof bits === 'number') {if(typeof e === 'function') {callback = e;e = undefined;} else if(typeof e !== 'number') {options = e;e = undefined;}} else {options = bits;callback = e;bits = undefined;e = undefined;}} else if(arguments.length === 3) {// (bits, e, options), (bits, e, callback), (bits, options, callback)if(typeof e === 'number') {if(typeof options === 'function') {callback = options;options = undefined;}} else {callback = options;options = e;e = undefined;}}options = options || {};if(bits === undefined) {bits = options.bits || 2048;}if(e === undefined) {e = options.e || 0x10001;}// use native code if permitted, available, and parameters are acceptableif(!forge.options.usePureJavaScript && !options.prng &&bits >= 256 && bits <= 16384 && (e === 0x10001 || e === 3)) {if(callback) {// try native asyncif(_detectNodeCrypto('generateKeyPair')) {return _crypto.generateKeyPair('rsa', {modulusLength: bits,publicExponent: e,publicKeyEncoding: {type: 'spki',format: 'pem'},privateKeyEncoding: {type: 'pkcs8',format: 'pem'}}, function(err, pub, priv) {if(err) {return callback(err);}callback(null, {privateKey: pki.privateKeyFromPem(priv),publicKey: pki.publicKeyFromPem(pub)});});}if(_detectSubtleCrypto('generateKey') &&_detectSubtleCrypto('exportKey')) {// use standard native generateKeyreturn util.globalScope.crypto.subtle.generateKey({name: 'RSASSA-PKCS1-v1_5',modulusLength: bits,publicExponent: _intToUint8Array(e),hash: {name: 'SHA-256'}}, true /* key can be exported*/, ['sign', 'verify']).then(function(pair) {return util.globalScope.crypto.subtle.exportKey('pkcs8', pair.privateKey);// avoiding catch(function(err) {...}) to support IE <= 8}).then(undefined, function(err) {callback(err);}).then(function(pkcs8) {if(pkcs8) {var privateKey = pki.privateKeyFromAsn1(asn1.fromDer(forge.util.createBuffer(pkcs8)));callback(null, {privateKey: privateKey,publicKey: pki.setRsaPublicKey(privateKey.n, privateKey.e)});}});}if(_detectSubtleMsCrypto('generateKey') &&_detectSubtleMsCrypto('exportKey')) {var genOp = util.globalScope.msCrypto.subtle.generateKey({name: 'RSASSA-PKCS1-v1_5',modulusLength: bits,publicExponent: _intToUint8Array(e),hash: {name: 'SHA-256'}}, true /* key can be exported*/, ['sign', 'verify']);genOp.oncomplete = function(e) {var pair = e.target.r###lt;var exportOp = util.globalScope.msCrypto.subtle.exportKey('pkcs8', pair.privateKey);exportOp.oncomplete = function(e) {var pkcs8 = e.target.r###lt;var privateKey = pki.privateKeyFromAsn1(asn1.fromDer(forge.util.createBuffer(pkcs8)));callback(null, {privateKey: privateKey,publicKey: pki.setRsaPublicKey(privateKey.n, privateKey.e)});};exportOp.onerror = function(err) {callback(err);};};genOp.onerror = function(err) {callback(err);};return;}} else {// try native syncif(_detectNodeCrypto('generateKeyPairSync')) {var keypair = _crypto.generateKeyPairSync('rsa', {modulusLength: bits,publicExponent: e,publicKeyEncoding: {type: 'spki',format: 'pem'},privateKeyEncoding: {type: 'pkcs8',format: 'pem'}});return {privateKey: pki.privateKeyFromPem(keypair.privateKey),publicKey: pki.publicKeyFromPem(keypair.publicKey)};}}}// use JavaScript implementationvar state = pki.rsa.createKeyPairGenerationState(bits, e, options);if(!callback) {pki.rsa.stepKeyPairGenerationState(state, 0);return state.keys;}_generateKeyPair(state, options, callback);};/*** Sets an RSA public key from BigIntegers modulus and exponent.** @param n the modulus.* @param e the exponent.** @return the public key.*/pki.setRsaPublicKey = pki.rsa.setPublicKey = function(n, e) {var key = {n: n,e: e};/*** Encrypts the given data with this public key. Newer applications* should use the 'RSA-OAEP' decryption scheme, 'RSAES-PKCS1-V1_5' is for* legacy applications.** @param data the byte string to encrypt.* @param scheme the encryption scheme to use:*          'RSAES-PKCS1-V1_5' (default),*          'RSA-OAEP',*          'RAW', 'NONE', or null to perform raw RSA encryption,*          an object with an 'encode' property set to a function*          with the signature 'function(data, key)' that returns*          a binary-encoded string representing the encoded data.* @param schemeOptions any scheme-specific options.** @return the encrypted byte string.*/key.encrypt = function(data, scheme, schemeOptions) {if(typeof scheme === 'string') {scheme = scheme.toUpperCase();} else if(scheme === undefined) {scheme = 'RSAES-PKCS1-V1_5';}if(scheme === 'RSAES-PKCS1-V1_5') {scheme = {encode: function(m, key, pub) {return _encodePkcs1_v1_5(m, key, 0x02).getBytes();}};} else if(scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') {scheme = {encode: function(m, key) {return forge.pkcs1.encode_rsa_oaep(key, m, schemeOptions);}};} else if(['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) {scheme = {encode: function(e) {return e;}};} else if(typeof scheme === 'string') {throw new Error('Unsupported encryption scheme: "' + scheme + '".');}// do scheme-based encoding then rsa encryptionvar e = scheme.encode(data, key, true);return pki.rsa.encrypt(e, key, true);};/*** Verifies the given signature against the given digest.** PKCS#1 supports multiple (currently two) signature schemes:* RSASSA-PKCS1-V1_5 and RSASSA-PSS.** By default this implementation uses the "old scheme", i.e.* RSASSA-PKCS1-V1_5, in which case once RSA-decrypted, the* signature is an OCTET STRING that holds a DigestInfo.** DigestInfo ::= SEQUENCE {*   digestAlgorithm DigestAlgorithmIdentifier,*   digest Digest* }* DigestAlgorithmIdentifier ::= AlgorithmIdentifier* Digest ::= OCTET STRING** To perform PSS signature verification, provide an instance* of Forge PSS object as the scheme parameter.** @param digest the message digest hash to compare against the signature,*          as a binary-encoded string.* @param signature the signature to verify, as a binary-encoded string.* @param scheme signature verification scheme to use:*          'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5,*          a Forge PSS object for RSASSA-PSS,*          'NONE' or null for none, DigestInfo will not be expected, but*            PKCS#1 v1.5 padding will still be used.** @return true if the signature was verified, false if not.*/key.verify = function(digest, signature, scheme) {if(typeof scheme === 'string') {scheme = scheme.toUpperCase();} else if(scheme === undefined) {scheme = 'RSASSA-PKCS1-V1_5';}if(scheme === 'RSASSA-PKCS1-V1_5') {scheme = {verify: function(digest, d) {// remove paddingd = _decodePkcs1_v1_5(d, key, true);// d is ASN.1 BER-encoded DigestInfovar obj = asn1.fromDer(d);// compare the given digest to the decrypted onereturn digest === obj.value[1].value;}};} else if(scheme === 'NONE' || scheme === 'NULL' || scheme === null) {scheme = {verify: function(digest, d) {// remove paddingd = _decodePkcs1_v1_5(d, key, true);return digest === d;}};}// do rsa decryption w/o any decoding, then verify -- which does decodingvar d = pki.rsa.decrypt(signature, key, true, false);return scheme.verify(digest, d, key.n.bitLength());};return key;};/*** Sets an RSA private key from BigIntegers modulus, exponent, primes,* prime exponents, and modular multiplicative inverse.** @param n the modulus.* @param e the public exponent.* @param d the private exponent ((inverse of e) mod n).* @param p the first prime.* @param q the second prime.* @param dP exponent1 (d mod (p-1)).* @param dQ exponent2 (d mod (q-1)).* @param qInv ((inverse of q) mod p)** @return the private key.*/pki.setRsaPrivateKey = pki.rsa.setPrivateKey = function(n, e, d, p, q, dP, dQ, qInv) {var key = {n: n,e: e,d: d,p: p,q: q,dP: dP,dQ: dQ,qInv: qInv};/*** Decrypts the given data with this private key. The decryption scheme* must match the one used to encrypt the data.** @param data the byte string to decrypt.* @param scheme the decryption scheme to use:*          'RSAES-PKCS1-V1_5' (default),*          'RSA-OAEP',*          'RAW', 'NONE', or null to perform raw RSA decryption.* @param schemeOptions any scheme-specific options.** @return the decrypted byte string.*/key.decrypt = function(data, scheme, schemeOptions) {if(typeof scheme === 'string') {scheme = scheme.toUpperCase();} else if(scheme === undefined) {scheme = 'RSAES-PKCS1-V1_5';}// do rsa decryption w/o any decodingvar d = pki.rsa.decrypt(data, key, false, false);if(scheme === 'RSAES-PKCS1-V1_5') {scheme = {decode: _decodePkcs1_v1_5};} else if(scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') {scheme = {decode: function(d, key) {return forge.pkcs1.decode_rsa_oaep(key, d, schemeOptions);}};} else if(['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) {scheme = {decode: function(d) {return d;}};} else {throw new Error('Unsupported encryption scheme: "' + scheme + '".');}// decode according to schemereturn scheme.decode(d, key, false);};/*** Signs the given digest, producing a signature.** PKCS#1 supports multiple (currently two) signature schemes:* RSASSA-PKCS1-V1_5 and RSASSA-PSS.** By default this implementation uses the "old scheme", i.e.* RSASSA-PKCS1-V1_5. In order to generate a PSS signature, provide* an instance of Forge PSS object as the scheme parameter.** @param md the message digest object with the hash to sign.* @param scheme the signature scheme to use:*          'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5,*          a Forge PSS object for RSASSA-PSS,*          'NONE' or null for none, DigestInfo will not be used but*            PKCS#1 v1.5 padding will still be used.** @return the signature as a byte string.*/key.sign = function(md, scheme) {/* Note: The internal implementation of RSA operations is beingtransitioned away from a PKCS#1 v1.5 hard-coded scheme. Some legacycode like the use of an encoding block identifier 'bt' will eventuallybe removed. */// private key operationvar bt = false;if(typeof scheme === 'string') {scheme = scheme.toUpperCase();}if(scheme === undefined || scheme === 'RSASSA-PKCS1-V1_5') {scheme = {encode: emsaPkcs1v15encode};bt = 0x01;} else if(scheme === 'NONE' || scheme === 'NULL' || scheme === null) {scheme = {encode: function() {return md;}};bt = 0x01;}// encode and then encryptvar d = scheme.encode(md, key.n.bitLength());return pki.rsa.encrypt(d, key, bt);};return key;};/*** Wraps an RSAPrivateKey ASN.1 object in an ASN.1 PrivateKeyInfo object.** @param rsaKey the ASN.1 RSAPrivateKey.** @return the ASN.1 PrivateKeyInfo.*/pki.wrapRsaPrivateKey = function(rsaKey) {// PrivateKeyInforeturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// version (0)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(0).getBytes()),// privateKeyAlgorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.rsaEncryption).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]),// PrivateKeyasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,asn1.toDer(rsaKey).getBytes())]);};/*** Converts a private key from an ASN.1 object.** @param obj the ASN.1 representation of a PrivateKeyInfo containing an*          RSAPrivateKey or an RSAPrivateKey.** @return the private key.*/pki.privateKeyFromAsn1 = function(obj) {// get PrivateKeyInfovar capture = {};var errors = [];if(asn1.validate(obj, privateKeyValidator, capture, errors)) {obj = asn1.fromDer(forge.util.createBuffer(capture.privateKey));}// get RSAPrivateKeycapture = {};errors = [];if(!asn1.validate(obj, rsaPrivateKeyValidator, capture, errors)) {var error = new Error('Cannot read private key. ' +'ASN.1 object does not contain an RSAPrivateKey.');error.errors = errors;throw error;}// Note: Version is currently ignored.// capture.privateKeyVersion// FIXME: inefficient, get a BigInteger that uses byte stringsvar n, e, d, p, q, dP, dQ, qInv;n = forge.util.createBuffer(capture.privateKeyModulus).toHex();e = forge.util.createBuffer(capture.privateKeyPublicExponent).toHex();d = forge.util.createBuffer(capture.privateKeyPrivateExponent).toHex();p = forge.util.createBuffer(capture.privateKeyPrime1).toHex();q = forge.util.createBuffer(capture.privateKeyPrime2).toHex();dP = forge.util.createBuffer(capture.privateKeyExponent1).toHex();dQ = forge.util.createBuffer(capture.privateKeyExponent2).toHex();qInv = forge.util.createBuffer(capture.privateKeyCoefficient).toHex();// set private keyreturn pki.setRsaPrivateKey(new BigInteger(n, 16),new BigInteger(e, 16),new BigInteger(d, 16),new BigInteger(p, 16),new BigInteger(q, 16),new BigInteger(dP, 16),new BigInteger(dQ, 16),new BigInteger(qInv, 16));};/*** Converts a private key to an ASN.1 RSAPrivateKey.** @param key the private key.** @return the ASN.1 representation of an RSAPrivateKey.*/pki.privateKeyToAsn1 = pki.privateKeyToRSAPrivateKey = function(key) {// RSAPrivateKeyreturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// version (0 = only 2 primes, 1 multiple primes)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(0).getBytes()),// modulus (n)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.n)),// publicExponent (e)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.e)),// privateExponent (d)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.d)),// privateKeyPrime1 (p)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.p)),// privateKeyPrime2 (q)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.q)),// privateKeyExponent1 (dP)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.dP)),// privateKeyExponent2 (dQ)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.dQ)),// coefficient (qInv)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.qInv))]);};/*** Converts a public key from an ASN.1 SubjectPublicKeyInfo or RSAPublicKey.** @param obj the asn1 representation of a SubjectPublicKeyInfo or RSAPublicKey.** @return the public key.*/pki.publicKeyFromAsn1 = function(obj) {// get SubjectPublicKeyInfovar capture = {};var errors = [];if(asn1.validate(obj, publicKeyValidator, capture, errors)) {// get oidvar oid = asn1.derToOid(capture.publicKeyOid);if(oid !== pki.oids.rsaEncryption) {var error = new Error('Cannot read public key. Unknown OID.');error.oid = oid;throw error;}obj = capture.rsaPublicKey;}// get RSA paramserrors = [];if(!asn1.validate(obj, rsaPublicKeyValidator, capture, errors)) {var error = new Error('Cannot read public key. ' +'ASN.1 object does not contain an RSAPublicKey.');error.errors = errors;throw error;}// FIXME: inefficient, get a BigInteger that uses byte stringsvar n = forge.util.createBuffer(capture.publicKeyModulus).toHex();var e = forge.util.createBuffer(capture.publicKeyExponent).toHex();// set public keyreturn pki.setRsaPublicKey(new BigInteger(n, 16),new BigInteger(e, 16));};/*** Converts a public key to an ASN.1 SubjectPublicKeyInfo.** @param key the public key.** @return the asn1 representation of a SubjectPublicKeyInfo.*/pki.publicKeyToAsn1 = pki.publicKeyToSubjectPublicKeyInfo = function(key) {// SubjectPublicKeyInforeturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// AlgorithmIdentifierasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(pki.oids.rsaEncryption).getBytes()),// parameters (null)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]),// subjectPublicKeyasn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, [pki.publicKeyToRSAPublicKey(key)])]);};/*** Converts a public key to an ASN.1 RSAPublicKey.** @param key the public key.** @return the asn1 representation of a RSAPublicKey.*/pki.publicKeyToRSAPublicKey = function(key) {// RSAPublicKeyreturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// modulus (n)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.n)),// publicExponent (e)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,_bnToBytes(key.e))]);};/*** Encodes a message using PKCS#1 v1.5 padding.** @param m the message to encode.* @param key the RSA key to use.* @param bt the block type to use, i.e. either 0x01 (for signing) or 0x02*          (for encryption).** @return the padded byte buffer.*/function _encodePkcs1_v1_5(m, key, bt) {var eb = forge.util.createBuffer();// get the length of the modulus in bytesvar k = Math.ceil(key.n.bitLength() / 8);/* use PKCS#1 v1.5 padding */if(m.length > (k - 11)) {var error = new Error('Message is too long for PKCS#1 v1.5 padding.');error.length = m.length;error.max = k - 11;throw error;}/* A block type BT, a padding string PS, and the data D shall beformatted into an octet string EB, the encryption block:EB = 00 || BT || PS || 00 || DThe block type BT shall be a single octet indicating the structure ofthe encryption block. For this version of the document it shall havevalue 00, 01, or 02. For a private-key operation, the block typeshall be 00 or 01. For a public-key operation, it shall be 02.The padding string PS shall consist of k-3-||D|| octets. For blocktype 00, the octets shall have value 00; for block type 01, theyshall have value FF; and for block type 02, they shall bepseudorandomly generated and nonzero. This makes the length of theencryption block EB equal to k. */// build the encryption blockeb.putByte(0x00);eb.putByte(bt);// create the paddingvar padNum = k - 3 - m.length;var padByte;// private key opif(bt === 0x00 || bt === 0x01) {padByte = (bt === 0x00) ? 0x00 : 0xFF;for(var i = 0; i < padNum; ++i) {eb.putByte(padByte);}} else {// public key op// pad with random non-zero valueswhile(padNum > 0) {var numZeros = 0;var padBytes = forge.random.getBytes(padNum);for(var i = 0; i < padNum; ++i) {padByte = padBytes.charCodeAt(i);if(padByte === 0) {++numZeros;} else {eb.putByte(padByte);}}padNum = numZeros;}}// zero followed by messageeb.putByte(0x00);eb.putBytes(m);return eb;}/*** Decodes a message using PKCS#1 v1.5 padding.** @param em the message to decode.* @param key the RSA key to use.* @param pub true if the key is a public key, false if it is private.* @param ml the message length, if specified.** @return the decoded bytes.*/function _decodePkcs1_v1_5(em, key, pub, ml) {// get the length of the modulus in bytesvar k = Math.ceil(key.n.bitLength() / 8);/* It is an error if any of the following conditions occurs:1. The encryption block EB cannot be parsed unambiguously.2. The padding string PS consists of fewer than eight octetsor is inconsisent with the block type BT.3. The decryption process is a public-key operation and the blocktype BT is not 00 or 01, or the decryption process is aprivate-key operation and the block type is not 02.*/// parse the encryption blockvar eb = forge.util.createBuffer(em);var first = eb.getByte();var bt = eb.getByte();if(first !== 0x00 ||(pub && bt !== 0x00 && bt !== 0x01) ||(!pub && bt != 0x02) ||(pub && bt === 0x00 && typeof(ml) === 'undefined')) {throw new Error('Encryption block is invalid.');}var padNum = 0;if(bt === 0x00) {// check all padding bytes for 0x00padNum = k - 3 - ml;for(var i = 0; i < padNum; ++i) {if(eb.getByte() !== 0x00) {throw new Error('Encryption block is invalid.');}}} else if(bt === 0x01) {// find the first byte that isn't 0xFF, should be after all paddingpadNum = 0;while(eb.length() > 1) {if(eb.getByte() !== 0xFF) {--eb.read;break;}++padNum;}} else if(bt === 0x02) {// look for 0x00 bytepadNum = 0;while(eb.length() > 1) {if(eb.getByte() === 0x00) {--eb.read;break;}++padNum;}}// zero must be 0x00 and padNum must be (k - 3 - message length)var zero = eb.getByte();if(zero !== 0x00 || padNum !== (k - 3 - eb.length())) {throw new Error('Encryption block is invalid.');}return eb.getBytes();}/*** Runs the key-generation algorithm asynchronously, either in the background* via Web Workers, or using the main thread and setImmediate.** @param state the key-pair generation state.* @param [options] options for key-pair generation:*          workerScript the worker script URL.*          workers the number of web workers (if supported) to use,*            (default: 2, -1 to use estimated cores minus one).*          workLoad the size of the work load, ie: number of possible prime*            numbers for each web worker to check per work assignment,*            (default: 100).* @param callback(err, keypair) called once the operation completes.*/function _generateKeyPair(state, options, callback) {if(typeof options === 'function') {callback = options;options = {};}options = options || {};var opts = {algorithm: {name: options.algorithm || 'PRIMEINC',options: {workers: options.workers || 2,workLoad: options.workLoad || 100,workerScript: options.workerScript}}};if('prng' in options) {opts.prng = options.prng;}generate();function generate() {// find p and then q (done in series to simplify)getPrime(state.pBits, function(err, num) {if(err) {return callback(err);}state.p = num;if(state.q !== null) {return finish(err, state.q);}getPrime(state.qBits, finish);});}function getPrime(bits, callback) {forge.prime.generateProbablePrime(bits, opts, callback);}function finish(err, num) {if(err) {return callback(err);}// set qstate.q = num;// ensure p is larger than q (swap them if not)if(state.p.compareTo(state.q) < 0) {var tmp = state.p;state.p = state.q;state.q = tmp;}// ensure p is coprime with eif(state.p.subtract(BigInteger.ONE).###(state.e).compareTo(BigInteger.ONE) !== 0) {state.p = null;generate();return;}// ensure q is coprime with eif(state.q.subtract(BigInteger.ONE).###(state.e).compareTo(BigInteger.ONE) !== 0) {state.q = null;getPrime(state.qBits, finish);return;}// compute phi: (p - 1)(q - 1) (Euler's totient function)state.p1 = state.p.subtract(BigInteger.ONE);state.q1 = state.q.subtract(BigInteger.ONE);state.phi = state.p1.multiply(state.q1);// ensure e and phi are coprimeif(state.phi.###(state.e).compareTo(BigInteger.ONE) !== 0) {// phi and e aren't coprime, so generate a new p and qstate.p = state.q = null;generate();return;}// create n, ensure n is has the right number of bitsstate.n = state.p.multiply(state.q);if(state.n.bitLength() !== state.bits) {// failed, get new qstate.q = null;getPrime(state.qBits, finish);return;}// set keysvar d = state.e.modInverse(state.phi);state.keys = {privateKey: pki.rsa.setPrivateKey(state.n, state.e, d, state.p, state.q,d.mod(state.p1), d.mod(state.q1),state.q.modInverse(state.p)),publicKey: pki.rsa.setPublicKey(state.n, state.e)};callback(null, state.keys);}}/*** Converts a positive BigInteger into 2's-complement big-endian bytes.** @param b the big integer to convert.** @return the bytes.*/function _bnToBytes(b) {// prepend 0x00 if first byte >= 0x80var hex = b.toString(16);if(hex[0] >= '8') {hex = '00' + hex;}var bytes = forge.util.hexToBytes(hex);// ensure integer is minimally-encodedif(bytes.length > 1 &&// leading 0x00 for positive integer((bytes.charCodeAt(0) === 0 &&(bytes.charCodeAt(1) & 0x80) === 0) ||// leading 0xFF for negative integer(bytes.charCodeAt(0) === 0xFF &&(bytes.charCodeAt(1) & 0x80) === 0x80))) {return bytes.substr(1);}return bytes;}/*** Returns the required number of Miller-Rabin tests to generate a* prime with an error probability of (1/2)^80.** See Handbook of Applied Cryptography Chapter 4, Table 4.4.** @param bits the bit size.** @return the required number of iterations.*/function _getMillerRabinTests(bits) {if(bits <= 100) return 27;if(bits <= 150) return 18;if(bits <= 200) return 15;if(bits <= 250) return 12;if(bits <= 300) return 9;if(bits <= 350) return 8;if(bits <= 400) return 7;if(bits <= 500) return 6;if(bits <= 600) return 5;if(bits <= 800) return 4;if(bits <= 1250) return 3;return 2;}/*** Performs feature detection on the Node crypto interface.** @param fn the feature (function) to detect.** @return true if detected, false if not.*/function _detectNodeCrypto(fn) {return forge.util.isNodejs && typeof _crypto[fn] === 'function';}/*** Performs feature detection on the SubtleCrypto interface.** @param fn the feature (function) to detect.** @return true if detected, false if not.*/function _detectSubtleCrypto(fn) {return (typeof util.globalScope !== 'undefined' &&typeof util.globalScope.crypto === 'object' &&typeof util.globalScope.crypto.subtle === 'object' &&typeof util.globalScope.crypto.subtle[fn] === 'function');}/*** Performs feature detection on the deprecated Microsoft Internet Explorer* outdated SubtleCrypto interface. This function should only be used after* checking for the modern, standard SubtleCrypto interface.** @param fn the feature (function) to detect.** @return true if detected, false if not.*/function _detectSubtleMsCrypto(fn) {return (typeof util.globalScope !== 'undefined' &&typeof util.globalScope.msCrypto === 'object' &&typeof util.globalScope.msCrypto.subtle === 'object' &&typeof util.globalScope.msCrypto.subtle[fn] === 'function');}function _intToUint8Array(x) {var bytes = forge.util.hexToBytes(x.toString(16));var buffer = new Uint8Array(bytes.length);for(var i = 0; i < bytes.length; ++i) {buffer[i] = bytes.charCodeAt(i);}return buffer;}function _privateKeyFromJwk(jwk) {if(jwk.kty !== 'RSA') {throw new Error('Unsupported key algorithm "' + jwk.kty + '"; algorithm must be "RSA".');}return pki.setRsaPrivateKey(_base64ToBigInt(jwk.n),_base64ToBigInt(jwk.e),_base64ToBigInt(jwk.d),_base64ToBigInt(jwk.p),_base64ToBigInt(jwk.q),_base64ToBigInt(jwk.dp),_base64ToBigInt(jwk.dq),_base64ToBigInt(jwk.qi));}function _publicKeyFromJwk(jwk) {if(jwk.kty !== 'RSA') {throw new Error('Key algorithm must be "RSA".');}return pki.setRsaPublicKey(_base64ToBigInt(jwk.n),_base64ToBigInt(jwk.e));}function _base64ToBigInt(b64) {return new BigInteger(forge.util.bytesToHex(forge.util.decode64(b64)), 16);}/***/ }),/***/ 7499:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Secure Hash Algorithm with 160-bit digest (SHA-1) implementation.** @author Dave Longley** Copyright (c) 2010-2015 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(3605);__webpack_require__(2365);var sha1 = module.exports = forge.sha1 = forge.sha1 || {};forge.md.sha1 = forge.md.algorithms.sha1 = sha1;/*** Creates a SHA-1 message digest object.** @return a message digest object.*/sha1.create = function() {// do initialization as necessaryif(!_initialized) {_init();}// SHA-1 state contains five 32-bit integersvar _state = null;// input buffervar _input = forge.util.createBuffer();// used for word storagevar _w = new Array(80);// message digest objectvar md = {algorithm: 'sha1',blockLength: 64,digestLength: 20,// 56-bit length of message so far (does not including padding)messageLength: 0,// true message lengthfullMessageLength: null,// size of message length in bytesmessageLengthSize: 8};/*** Starts the digest.** @return this digest object.*/md.start = function() {// up to 56-bit message length for conveniencemd.messageLength = 0;// full message length (set md.messageLength64 for backwards-compatibility)md.fullMessageLength = md.messageLength64 = [];var int32s = md.messageLengthSize / 4;for(var i = 0; i < int32s; ++i) {md.fullMessageLength.push(0);}_input = forge.util.createBuffer();_state = {h0: 0x67452301,h1: 0xEFCDAB89,h2: 0x98BADCFE,h3: 0x10325476,h4: 0xC3D2E1F0};return md;};// start digest automatically for first timemd.start();/*** Updates the digest with the given message input. The given input can* treated as raw input (no encoding will be applied) or an encoding of* 'utf8' maybe given to encode the input using UTF-8.** @param msg the message input to update with.* @param encoding the encoding to use (default: 'raw', other: 'utf8').** @return this digest object.*/md.update = function(msg, encoding) {if(encoding === 'utf8') {msg = forge.util.encodeUtf8(msg);}// update message lengthvar len = msg.length;md.messageLength += len;len = [(len / 0x100000000) >>> 0, len >>> 0];for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {md.fullMessageLength[i] += len[1];len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;len[0] = ((len[1] / 0x100000000) >>> 0);}// add bytes to input buffer_input.putBytes(msg);// process bytes_update(_state, _w, _input);// compact input buffer every 2K or if emptyif(_input.read > 2048 || _input.length() === 0) {_input.compact();}return md;};/*** Produces the digest.** @return a byte buffer containing the digest value.*/md.digest = function() {/* Note: Here we copy the remaining bytes in the input buffer andadd the appropriate SHA-1 padding. Then we do the final updateon a copy of the state so that if the user wants to getintermediate digests they can do so. *//* Determine the number of bytes that must be added to the messageto ensure its length is congruent to 448 mod 512. In other words,the data to be digested must be a multiple of 512 bits (or 128 bytes).This data includes the message, some padding, and the length of themessage. Since the length of the message will be encoded as 8 bytes (64bits), that means that the last segment of the data must have 56 bytes(448 bits) of message and padding. Therefore, the length of the messageplus the padding must be congruent to 448 mod 512 because512 - 128 = 448.In order to fill up the message length it must be filled withpadding that begins with 1 bit followed by all 0 bits. Paddingmust *always* be present, so if the message length is alreadycongruent to 448 mod 512, then 512 padding bits must be added. */var finalBlock = forge.util.createBuffer();finalBlock.putBytes(_input.bytes());// compute remaining size to be digested (include message length size)var remaining = (md.fullMessageLength[md.fullMessageLength.length - 1] +md.messageLengthSize);// add padding for overflow blockSize - overflow// _padding starts with 1 byte with first bit is set (byte value 128), then// there may be up to (blockSize - 1) other pad bytesvar overflow = remaining & (md.blockLength - 1);finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));// serialize message length in bits in big-endian order; since length// is stored in bytes we multiply by 8 and add carry from next intvar next, carry;var bits = md.fullMessageLength[0] * 8;for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {next = md.fullMessageLength[i + 1] * 8;carry = (next / 0x100000000) >>> 0;bits += carry;finalBlock.putInt32(bits >>> 0);bits = next >>> 0;}finalBlock.putInt32(bits);var s2 = {h0: _state.h0,h1: _state.h1,h2: _state.h2,h3: _state.h3,h4: _state.h4};_update(s2, _w, finalBlock);var rval = forge.util.createBuffer();rval.putInt32(s2.h0);rval.putInt32(s2.h1);rval.putInt32(s2.h2);rval.putInt32(s2.h3);rval.putInt32(s2.h4);return rval;};return md;};// sha-1 padding bytes not initialized yetvar _padding = null;var _initialized = false;/*** Initializes the constant tables.*/function _init() {// create padding_padding = String.fromCharCode(128);_padding += forge.util.fillString(String.fromCharCode(0x00), 64);// now initialized_initialized = true;}/*** Updates a SHA-1 state with the given byte buffer.** @param s the SHA-1 state to update.* @param w the array to use to store words.* @param bytes the byte buffer to update with.*/function _update(s, w, bytes) {// consume 512 bit (64 byte) chunksvar t, a, b, c, d, e, f, i;var len = bytes.length();while(len >= 64) {// the w array will be populated with sixteen 32-bit big-endian words// and then extended into 80 32-bit words according to SHA-1 algorithm// and for 32-79 using Max Locktyukhin's optimization// initialize hash value for this chunka = s.h0;b = s.h1;c = s.h2;d = s.h3;e = s.h4;// round 1for(i = 0; i < 16; ++i) {t = bytes.getInt32();w[i] = t;f = d ^ (b & (c ^ d));t = ((a << 5) | (a >>> 27)) + f + e + 0x5A827999 + t;e = d;d = c;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bugc = ((b << 30) | (b >>> 2)) >>> 0;b = a;a = t;}for(; i < 20; ++i) {t = (w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);t = (t << 1) | (t >>> 31);w[i] = t;f = d ^ (b & (c ^ d));t = ((a << 5) | (a >>> 27)) + f + e + 0x5A827999 + t;e = d;d = c;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bugc = ((b << 30) | (b >>> 2)) >>> 0;b = a;a = t;}// round 2for(; i < 32; ++i) {t = (w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);t = (t << 1) | (t >>> 31);w[i] = t;f = b ^ c ^ d;t = ((a << 5) | (a >>> 27)) + f + e + 0x6ED9EBA1 + t;e = d;d = c;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bugc = ((b << 30) | (b >>> 2)) >>> 0;b = a;a = t;}for(; i < 40; ++i) {t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);t = (t << 2) | (t >>> 30);w[i] = t;f = b ^ c ^ d;t = ((a << 5) | (a >>> 27)) + f + e + 0x6ED9EBA1 + t;e = d;d = c;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bugc = ((b << 30) | (b >>> 2)) >>> 0;b = a;a = t;}// round 3for(; i < 60; ++i) {t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);t = (t << 2) | (t >>> 30);w[i] = t;f = (b & c) | (d & (b ^ c));t = ((a << 5) | (a >>> 27)) + f + e + 0x8F1BBCDC + t;e = d;d = c;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bugc = ((b << 30) | (b >>> 2)) >>> 0;b = a;a = t;}// round 4for(; i < 80; ++i) {t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);t = (t << 2) | (t >>> 30);w[i] = t;f = b ^ c ^ d;t = ((a << 5) | (a >>> 27)) + f + e + 0xCA62C1D6 + t;e = d;d = c;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bugc = ((b << 30) | (b >>> 2)) >>> 0;b = a;a = t;}// update hash states.h0 = (s.h0 + a) | 0;s.h1 = (s.h1 + b) | 0;s.h2 = (s.h2 + c) | 0;s.h3 = (s.h3 + d) | 0;s.h4 = (s.h4 + e) | 0;len -= 64;}}/***/ }),/***/ 9166:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Secure Hash Algorithm with 256-bit digest (SHA-256) implementation.** See FIPS 180-2 for details.** @author Dave Longley** Copyright (c) 2010-2015 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(3605);__webpack_require__(2365);var sha256 = module.exports = forge.sha256 = forge.sha256 || {};forge.md.sha256 = forge.md.algorithms.sha256 = sha256;/*** Creates a SHA-256 message digest object.** @return a message digest object.*/sha256.create = function() {// do initialization as necessaryif(!_initialized) {_init();}// SHA-256 state contains eight 32-bit integersvar _state = null;// input buffervar _input = forge.util.createBuffer();// used for word storagevar _w = new Array(64);// message digest objectvar md = {algorithm: 'sha256',blockLength: 64,digestLength: 32,// 56-bit length of message so far (does not including padding)messageLength: 0,// true message lengthfullMessageLength: null,// size of message length in bytesmessageLengthSize: 8};/*** Starts the digest.** @return this digest object.*/md.start = function() {// up to 56-bit message length for conveniencemd.messageLength = 0;// full message length (set md.messageLength64 for backwards-compatibility)md.fullMessageLength = md.messageLength64 = [];var int32s = md.messageLengthSize / 4;for(var i = 0; i < int32s; ++i) {md.fullMessageLength.push(0);}_input = forge.util.createBuffer();_state = {h0: 0x6A09E667,h1: 0xBB67AE85,h2: 0x3C6EF372,h3: 0xA54FF53A,h4: 0x510E527F,h5: 0x9B05688C,h6: 0x1F83D9AB,h7: 0x5BE0CD19};return md;};// start digest automatically for first timemd.start();/*** Updates the digest with the given message input. The given input can* treated as raw input (no encoding will be applied) or an encoding of* 'utf8' maybe given to encode the input using UTF-8.** @param msg the message input to update with.* @param encoding the encoding to use (default: 'raw', other: 'utf8').** @return this digest object.*/md.update = function(msg, encoding) {if(encoding === 'utf8') {msg = forge.util.encodeUtf8(msg);}// update message lengthvar len = msg.length;md.messageLength += len;len = [(len / 0x100000000) >>> 0, len >>> 0];for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {md.fullMessageLength[i] += len[1];len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;len[0] = ((len[1] / 0x100000000) >>> 0);}// add bytes to input buffer_input.putBytes(msg);// process bytes_update(_state, _w, _input);// compact input buffer every 2K or if emptyif(_input.read > 2048 || _input.length() === 0) {_input.compact();}return md;};/*** Produces the digest.** @return a byte buffer containing the digest value.*/md.digest = function() {/* Note: Here we copy the remaining bytes in the input buffer andadd the appropriate SHA-256 padding. Then we do the final updateon a copy of the state so that if the user wants to getintermediate digests they can do so. *//* Determine the number of bytes that must be added to the messageto ensure its length is congruent to 448 mod 512. In other words,the data to be digested must be a multiple of 512 bits (or 128 bytes).This data includes the message, some padding, and the length of themessage. Since the length of the message will be encoded as 8 bytes (64bits), that means that the last segment of the data must have 56 bytes(448 bits) of message and padding. Therefore, the length of the messageplus the padding must be congruent to 448 mod 512 because512 - 128 = 448.In order to fill up the message length it must be filled withpadding that begins with 1 bit followed by all 0 bits. Paddingmust *always* be present, so if the message length is alreadycongruent to 448 mod 512, then 512 padding bits must be added. */var finalBlock = forge.util.createBuffer();finalBlock.putBytes(_input.bytes());// compute remaining size to be digested (include message length size)var remaining = (md.fullMessageLength[md.fullMessageLength.length - 1] +md.messageLengthSize);// add padding for overflow blockSize - overflow// _padding starts with 1 byte with first bit is set (byte value 128), then// there may be up to (blockSize - 1) other pad bytesvar overflow = remaining & (md.blockLength - 1);finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));// serialize message length in bits in big-endian order; since length// is stored in bytes we multiply by 8 and add carry from next intvar next, carry;var bits = md.fullMessageLength[0] * 8;for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {next = md.fullMessageLength[i + 1] * 8;carry = (next / 0x100000000) >>> 0;bits += carry;finalBlock.putInt32(bits >>> 0);bits = next >>> 0;}finalBlock.putInt32(bits);var s2 = {h0: _state.h0,h1: _state.h1,h2: _state.h2,h3: _state.h3,h4: _state.h4,h5: _state.h5,h6: _state.h6,h7: _state.h7};_update(s2, _w, finalBlock);var rval = forge.util.createBuffer();rval.putInt32(s2.h0);rval.putInt32(s2.h1);rval.putInt32(s2.h2);rval.putInt32(s2.h3);rval.putInt32(s2.h4);rval.putInt32(s2.h5);rval.putInt32(s2.h6);rval.putInt32(s2.h7);return rval;};return md;};// sha-256 padding bytes not initialized yetvar _padding = null;var _initialized = false;// table of constantsvar _k = null;/*** Initializes the constant tables.*/function _init() {// create padding_padding = String.fromCharCode(128);_padding += forge.util.fillString(String.fromCharCode(0x00), 64);// create K table for SHA-256_k = [0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2];// now initialized_initialized = true;}/*** Updates a SHA-256 state with the given byte buffer.** @param s the SHA-256 state to update.* @param w the array to use to store words.* @param bytes the byte buffer to update with.*/function _update(s, w, bytes) {// consume 512 bit (64 byte) chunksvar t1, t2, s0, s1, ch, maj, i, a, b, c, d, e, f, g, h;var len = bytes.length();while(len >= 64) {// the w array will be populated with sixteen 32-bit big-endian words// and then extended into 64 32-bit words according to SHA-256for(i = 0; i < 16; ++i) {w[i] = bytes.getInt32();}for(; i < 64; ++i) {// XOR word 2 words ago rot right 17, rot right 19, shft right 10t1 = w[i - 2];t1 =((t1 >>> 17) | (t1 << 15)) ^((t1 >>> 19) | (t1 << 13)) ^(t1 >>> 10);// XOR word 15 words ago rot right 7, rot right 18, shft right 3t2 = w[i - 15];t2 =((t2 >>> 7) | (t2 << 25)) ^((t2 >>> 18) | (t2 << 14)) ^(t2 >>> 3);// sum(t1, word 7 ago, t2, word 16 ago) modulo 2^32w[i] = (t1 + w[i - 7] + t2 + w[i - 16]) | 0;}// initialize hash value for this chunka = s.h0;b = s.h1;c = s.h2;d = s.h3;e = s.h4;f = s.h5;g = s.h6;h = s.h7;// round functionfor(i = 0; i < 64; ++i) {// Sum1(e)s1 =((e >>> 6) | (e << 26)) ^((e >>> 11) | (e << 21)) ^((e >>> 25) | (e << 7));// Ch(e, f, g) (optimized the same way as SHA-1)ch = g ^ (e & (f ^ g));// Sum0(a)s0 =((a >>> 2) | (a << 30)) ^((a >>> 13) | (a << 19)) ^((a >>> 22) | (a << 10));// Maj(a, b, c) (optimized the same way as SHA-1)maj = (a & b) | (c & (a ^ b));// main algorithmt1 = h + s1 + ch + _k[i] + w[i];t2 = s0 + maj;h = g;g = f;f = e;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bug// can't truncate with `| 0`e = (d + t1) >>> 0;d = c;c = b;b = a;// `>>> 0` necessary to avoid iOS/Safari 10 optimization bug// can't truncate with `| 0`a = (t1 + t2) >>> 0;}// update hash states.h0 = (s.h0 + a) | 0;s.h1 = (s.h1 + b) | 0;s.h2 = (s.h2 + c) | 0;s.h3 = (s.h3 + d) | 0;s.h4 = (s.h4 + e) | 0;s.h5 = (s.h5 + f) | 0;s.h6 = (s.h6 + g) | 0;s.h7 = (s.h7 + h) | 0;len -= 64;}}/***/ }),/***/ 5368:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Secure Hash Algorithm with a ####-bit block size implementation.** This includes: SHA-512, SHA-384, SHA-512/224, and SHA-512/256. For* SHA-256 (block size 512 bits), see sha256.js.** See FIPS 180-4 for details.** @author Dave Longley** Copyright (c) 2014-2015 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(3605);__webpack_require__(2365);var sha512 = module.exports = forge.sha512 = forge.sha512 || {};// SHA-512forge.md.sha512 = forge.md.algorithms.sha512 = sha512;// SHA-384var sha384 = forge.sha384 = forge.sha512.sha384 = forge.sha512.sha384 || {};sha384.create = function() {return sha512.create('SHA-384');};forge.md.sha384 = forge.md.algorithms.sha384 = sha384;// SHA-512/256forge.sha512.sha256 = forge.sha512.sha256 || {create: function() {return sha512.create('SHA-512/256');}};forge.md['sha512/256'] = forge.md.algorithms['sha512/256'] =forge.sha512.sha256;// SHA-512/224forge.sha512.sha224 = forge.sha512.sha224 || {create: function() {return sha512.create('SHA-512/224');}};forge.md['sha512/224'] = forge.md.algorithms['sha512/224'] =forge.sha512.sha224;/*** Creates a SHA-2 message digest object.** @param algorithm the algorithm to use (SHA-512, SHA-384, SHA-512/224,*          SHA-512/256).** @return a message digest object.*/sha512.create = function(algorithm) {// do initialization as necessaryif(!_initialized) {_init();}if(typeof algorithm === 'undefined') {algorithm = 'SHA-512';}if(!(algorithm in _states)) {throw new Error('Invalid SHA-512 algorithm: ' + algorithm);}// SHA-512 state contains eight 64-bit integers (each as two 32-bit ints)var _state = _states[algorithm];var _h = null;// input buffervar _input = forge.util.createBuffer();// used for 64-bit word storagevar _w = new Array(80);for(var wi = 0; wi < 80; ++wi) {_w[wi] = new Array(2);}// determine digest length by algorithm name (default)var digestLength = 64;switch(algorithm) {case 'SHA-384':digestLength = 48;break;case 'SHA-512/256':digestLength = 32;break;case 'SHA-512/224':digestLength = 28;break;}// message digest objectvar md = {// SHA-512 => sha512algorithm: algorithm.replace('-', '').toLowerCase(),blockLength: 128,digestLength: digestLength,// 56-bit length of message so far (does not including padding)messageLength: 0,// true message lengthfullMessageLength: null,// size of message length in bytesmessageLengthSize: 16};/*** Starts the digest.** @return this digest object.*/md.start = function() {// up to 56-bit message length for conveniencemd.messageLength = 0;// full message length (set md.messageLength128 for backwards-compatibility)md.fullMessageLength = md.messageLength128 = [];var int32s = md.messageLengthSize / 4;for(var i = 0; i < int32s; ++i) {md.fullMessageLength.push(0);}_input = forge.util.createBuffer();_h = new Array(_state.length);for(var i = 0; i < _state.length; ++i) {_h[i] = _state[i].slice(0);}return md;};// start digest automatically for first timemd.start();/*** Updates the digest with the given message input. The given input can* treated as raw input (no encoding will be applied) or an encoding of* 'utf8' maybe given to encode the input using UTF-8.** @param msg the message input to update with.* @param encoding the encoding to use (default: 'raw', other: 'utf8').** @return this digest object.*/md.update = function(msg, encoding) {if(encoding === 'utf8') {msg = forge.util.encodeUtf8(msg);}// update message lengthvar len = msg.length;md.messageLength += len;len = [(len / 0x100000000) >>> 0, len >>> 0];for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {md.fullMessageLength[i] += len[1];len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;len[0] = ((len[1] / 0x100000000) >>> 0);}// add bytes to input buffer_input.putBytes(msg);// process bytes_update(_h, _w, _input);// compact input buffer every 2K or if emptyif(_input.read > 2048 || _input.length() === 0) {_input.compact();}return md;};/*** Produces the digest.** @return a byte buffer containing the digest value.*/md.digest = function() {/* Note: Here we copy the remaining bytes in the input buffer andadd the appropriate SHA-512 padding. Then we do the final updateon a copy of the state so that if the user wants to getintermediate digests they can do so. *//* Determine the number of bytes that must be added to the messageto ensure its length is congruent to 896 mod ####. In other words,the data to be digested must be a multiple of #### bits (or 128 bytes).This data includes the message, some padding, and the length of themessage. Since the length of the message will be encoded as 16 bytes (128bits), that means that the last segment of the data must have 112 bytes(896 bits) of message and padding. Therefore, the length of the messageplus the padding must be congruent to 896 mod #### because#### - 128 = 896.In order to fill up the message length it must be filled withpadding that begins with 1 bit followed by all 0 bits. Paddingmust *always* be present, so if the message length is alreadycongruent to 896 mod ####, then #### padding bits must be added. */var finalBlock = forge.util.createBuffer();finalBlock.putBytes(_input.bytes());// compute remaining size to be digested (include message length size)var remaining = (md.fullMessageLength[md.fullMessageLength.length - 1] +md.messageLengthSize);// add padding for overflow blockSize - overflow// _padding starts with 1 byte with first bit is set (byte value 128), then// there may be up to (blockSize - 1) other pad bytesvar overflow = remaining & (md.blockLength - 1);finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));// serialize message length in bits in big-endian order; since length// is stored in bytes we multiply by 8 and add carry from next intvar next, carry;var bits = md.fullMessageLength[0] * 8;for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {next = md.fullMessageLength[i + 1] * 8;carry = (next / 0x100000000) >>> 0;bits += carry;finalBlock.putInt32(bits >>> 0);bits = next >>> 0;}finalBlock.putInt32(bits);var h = new Array(_h.length);for(var i = 0; i < _h.length; ++i) {h[i] = _h[i].slice(0);}_update(h, _w, finalBlock);var rval = forge.util.createBuffer();var hlen;if(algorithm === 'SHA-512') {hlen = h.length;} else if(algorithm === 'SHA-384') {hlen = h.length - 2;} else {hlen = h.length - 4;}for(var i = 0; i < hlen; ++i) {rval.putInt32(h[i][0]);if(i !== hlen - 1 || algorithm !== 'SHA-512/224') {rval.putInt32(h[i][1]);}}return rval;};return md;};// sha-512 padding bytes not initialized yetvar _padding = null;var _initialized = false;// table of constantsvar _k = null;// initial hash statesvar _states = null;/*** Initializes the constant tables.*/function _init() {// create padding_padding = String.fromCharCode(128);_padding += forge.util.fillString(String.fromCharCode(0x00), 128);// create K table for SHA-512_k = [[0x428a2f98, 0xd728ae22], [0x71374491, 0x23ef65cd],[0xb5c0fbcf, 0xec4d3b2f], [0xe9b5dba5, 0x8189dbbc],[0x3956c25b, 0xf348b538], [0x59f111f1, 0xb605d019],[0x923f82a4, 0xaf194f9b], [0xab1c5ed5, 0xda6d8118],[0xd807aa98, 0xa3030242], [0x12835b01, 0x45706fbe],[0x243185be, 0x4ee4b28c], [0x550c7dc3, 0xd5ffb4e2],[0x72be5d74, 0xf27b896f], [0x80deb1fe, 0x3b1696b1],[0x9bdc06a7, 0x25c71235], [0xc19bf174, 0xcf692694],[0xe49b69c1, 0x9ef14ad2], [0xefbe4786, 0x384f25e3],[0x0fc19dc6, 0x8b8cd5b5], [0x240ca1cc, 0x77ac9c65],[0x2de92c6f, 0x592b0275], [0x4a7484aa, 0x6ea6e483],[0x5cb0a9dc, 0xbd41fbd4], [0x76f988da, 0x831153b5],[0x983e5152, 0xee66dfab], [0xa831c66d, 0x2db43210],[0xb00327c8, 0x98fb213f], [0xbf597fc7, 0xbeef0ee4],[0xc6e00bf3, 0x3da88fc2], [0xd5a79147, 0x930aa725],[0x06ca6351, 0xe003826f], [0x14292967, 0x0a0e6e70],[0x27b70a85, 0x46d22ffc], [0x2e1b2138, 0x5c26c926],[0x4d2c6dfc, 0x5ac42aed], [0x53380d13, 0x9d95b3df],[0x650a7354, 0x8baf63de], [0x766a0abb, 0x3c77b2a8],[0x81c2c92e, 0x47edaee6], [0x92722c85, 0x1482353b],[0xa2bfe8a1, 0x4cf10364], [0xa81a664b, 0xbc423001],[0xc24b8b70, 0xd0f89791], [0xc76c51a3, 0x0654be30],[0xd192e819, 0xd6ef5218], [0xd6990624, 0x5565a910],[0xf40e3585, 0x5771202a], [0x106aa070, 0x32bbd1b8],[0x19a4c116, 0xb8d2d0c8], [0x1e376c08, 0x5141ab53],[0x2748774c, 0xdf8eeb99], [0x34b0bcb5, 0xe19b48a8],[0x391c0cb3, 0xc5c95a63], [0x4ed8aa4a, 0xe3418acb],[0x5b9cca4f, 0x7763e373], [0x682e6ff3, 0xd6b2b8a3],[0x748f82ee, 0x5defb2fc], [0x78a5636f, 0x43172f60],[0x84c87814, 0xa1f0ab72], [0x8cc70208, 0x1a6439ec],[0x90befffa, 0x23631e28], [0xa4506ceb, 0xde82bde9],[0xbef9a3f7, 0xb2c67915], [0xc67178f2, 0xe372532b],[0xca273ece, 0xea26619c], [0xd186b8c7, 0x21c0c207],[0xeada7dd6, 0xcde0eb1e], [0xf57d4f7f, 0xee6ed178],[0x06f067aa, 0x72176fba], [0x0a637dc5, 0xa2c898a6],[0x113f9804, 0xbef90dae], [0x1b710b35, 0x131c471b],[0x28db77f5, 0x23047d84], [0x32caab7b, 0x40c72493],[0x3c9ebe0a, 0x15c9bebc], [0x431d67c4, 0x9c100d4c],[0x4cc5d4be, 0xcb3e42b6], [0x597f299c, 0xfc657e2a],[0x5fcb6fab, 0x3ad6faec], [0x6c44198c, 0x4a475817]];// initial hash states_states = {};_states['SHA-512'] = [[0x6a09e667, 0xf3bcc908],[0xbb67ae85, 0x84caa73b],[0x3c6ef372, 0xfe94f82b],[0xa54ff53a, 0x5f1d36f1],[0x510e527f, 0xade682d1],[0x9b05688c, 0x2b3e6c1f],[0x1f83d9ab, 0xfb41bd6b],[0x5be0cd19, 0x137e2179]];_states['SHA-384'] = [[0xcbbb9d5d, 0xc1059ed8],[0x629a292a, 0x367cd507],[0x9159015a, 0x3070dd17],[0x152fecd8, 0xf70e5939],[0x67332667, 0xffc00b31],[0x8eb44a87, 0x68581511],[0xdb0c2e0d, 0x64f98fa7],[0x47b5481d, 0xbefa4fa4]];_states['SHA-512/256'] = [[0x22312194, 0xFC2BF72C],[0x9F555FA3, 0xC84C64C2],[0x2393B86B, 0x6F53B151],[0x96387719, 0x5940EABD],[0x96283EE2, 0xA88EFFE3],[0xBE5E1E25, 0x53863992],[0x2B0199FC, 0x2C85B8AA],[0x0EB72DDC, 0x81C52CA2]];_states['SHA-512/224'] = [[0x8C3D37C8, 0x19544DA2],[0x73E19966, 0x89DCD4D6],[0x1DFAB7AE, 0x32FF9C82],[0x679DD514, 0x582F9FCF],[0x0F6D2B69, 0x7BD44DA8],[0x77E36F73, 0x04C48942],[0x3F9D85A8, 0x6A1D36C8],[0x1112E6AD, 0x91D692A1]];// now initialized_initialized = true;}/*** Updates a SHA-512 state with the given byte buffer.** @param s the SHA-512 state to update.* @param w the array to use to store words.* @param bytes the byte buffer to update with.*/function _update(s, w, bytes) {// consume 512 bit (128 byte) chunksvar t1_hi, t1_lo;var t2_hi, t2_lo;var s0_hi, s0_lo;var s1_hi, s1_lo;var ch_hi, ch_lo;var maj_hi, maj_lo;var a_hi, a_lo;var b_hi, b_lo;var c_hi, c_lo;var d_hi, d_lo;var e_hi, e_lo;var f_hi, f_lo;var g_hi, g_lo;var h_hi, h_lo;var i, hi, lo, w2, w7, w15, w16;var len = bytes.length();while(len >= 128) {// the w array will be populated with sixteen 64-bit big-endian words// and then extended into 64 64-bit words according to SHA-512for(i = 0; i < 16; ++i) {w[i][0] = bytes.getInt32() >>> 0;w[i][1] = bytes.getInt32() >>> 0;}for(; i < 80; ++i) {// for word 2 words ago: ROTR 19(x) ^ ROTR 61(x) ^ SHR 6(x)w2 = w[i - 2];hi = w2[0];lo = w2[1];// high bitst1_hi = (((hi >>> 19) | (lo << 13)) ^ // ROTR 19((lo >>> 29) | (hi << 3)) ^ // ROTR 61/(swap + ROTR 29)(hi >>> 6)) >>> 0; // SHR 6// low bitst1_lo = (((hi << 13) | (lo >>> 19)) ^ // ROTR 19((lo << 3) | (hi >>> 29)) ^ // ROTR 61/(swap + ROTR 29)((hi << 26) | (lo >>> 6))) >>> 0; // SHR 6// for word 15 words ago: ROTR 1(x) ^ ROTR 8(x) ^ SHR 7(x)w15 = w[i - 15];hi = w15[0];lo = w15[1];// high bitst2_hi = (((hi >>> 1) | (lo << 31)) ^ // ROTR 1((hi >>> 8) | (lo << 24)) ^ // ROTR 8(hi >>> 7)) >>> 0; // SHR 7// low bitst2_lo = (((hi << 31) | (lo >>> 1)) ^ // ROTR 1((hi << 24) | (lo >>> 8)) ^ // ROTR 8((hi << 25) | (lo >>> 7))) >>> 0; // SHR 7// sum(t1, word 7 ago, t2, word 16 ago) modulo 2^64 (carry lo overflow)w7 = w[i - 7];w16 = w[i - 16];lo = (t1_lo + w7[1] + t2_lo + w16[1]);w[i][0] = (t1_hi + w7[0] + t2_hi + w16[0] +((lo / 0x100000000) >>> 0)) >>> 0;w[i][1] = lo >>> 0;}// initialize hash value for this chunka_hi = s[0][0];a_lo = s[0][1];b_hi = s[1][0];b_lo = s[1][1];c_hi = s[2][0];c_lo = s[2][1];d_hi = s[3][0];d_lo = s[3][1];e_hi = s[4][0];e_lo = s[4][1];f_hi = s[5][0];f_lo = s[5][1];g_hi = s[6][0];g_lo = s[6][1];h_hi = s[7][0];h_lo = s[7][1];// round functionfor(i = 0; i < 80; ++i) {// Sum1(e) = ROTR 14(e) ^ ROTR 18(e) ^ ROTR 41(e)s1_hi = (((e_hi >>> 14) | (e_lo << 18)) ^ // ROTR 14((e_hi >>> 18) | (e_lo << 14)) ^ // ROTR 18((e_lo >>> 9) | (e_hi << 23))) >>> 0; // ROTR 41/(swap + ROTR 9)s1_lo = (((e_hi << 18) | (e_lo >>> 14)) ^ // ROTR 14((e_hi << 14) | (e_lo >>> 18)) ^ // ROTR 18((e_lo << 23) | (e_hi >>> 9))) >>> 0; // ROTR 41/(swap + ROTR 9)// Ch(e, f, g) (optimized the same way as SHA-1)ch_hi = (g_hi ^ (e_hi & (f_hi ^ g_hi))) >>> 0;ch_lo = (g_lo ^ (e_lo & (f_lo ^ g_lo))) >>> 0;// Sum0(a) = ROTR 28(a) ^ ROTR 34(a) ^ ROTR 39(a)s0_hi = (((a_hi >>> 28) | (a_lo << 4)) ^ // ROTR 28((a_lo >>> 2) | (a_hi << 30)) ^ // ROTR 34/(swap + ROTR 2)((a_lo >>> 7) | (a_hi << 25))) >>> 0; // ROTR 39/(swap + ROTR 7)s0_lo = (((a_hi << 4) | (a_lo >>> 28)) ^ // ROTR 28((a_lo << 30) | (a_hi >>> 2)) ^ // ROTR 34/(swap + ROTR 2)((a_lo << 25) | (a_hi >>> 7))) >>> 0; // ROTR 39/(swap + ROTR 7)// Maj(a, b, c) (optimized the same way as SHA-1)maj_hi = ((a_hi & b_hi) | (c_hi & (a_hi ^ b_hi))) >>> 0;maj_lo = ((a_lo & b_lo) | (c_lo & (a_lo ^ b_lo))) >>> 0;// main algorithm// t1 = (h + s1 + ch + _k[i] + _w[i]) modulo 2^64 (carry lo overflow)lo = (h_lo + s1_lo + ch_lo + _k[i][1] + w[i][1]);t1_hi = (h_hi + s1_hi + ch_hi + _k[i][0] + w[i][0] +((lo / 0x100000000) >>> 0)) >>> 0;t1_lo = lo >>> 0;// t2 = s0 + maj modulo 2^64 (carry lo overflow)lo = s0_lo + maj_lo;t2_hi = (s0_hi + maj_hi + ((lo / 0x100000000) >>> 0)) >>> 0;t2_lo = lo >>> 0;h_hi = g_hi;h_lo = g_lo;g_hi = f_hi;g_lo = f_lo;f_hi = e_hi;f_lo = e_lo;// e = (d + t1) modulo 2^64 (carry lo overflow)lo = d_lo + t1_lo;e_hi = (d_hi + t1_hi + ((lo / 0x100000000) >>> 0)) >>> 0;e_lo = lo >>> 0;d_hi = c_hi;d_lo = c_lo;c_hi = b_hi;c_lo = b_lo;b_hi = a_hi;b_lo = a_lo;// a = (t1 + t2) modulo 2^64 (carry lo overflow)lo = t1_lo + t2_lo;a_hi = (t1_hi + t2_hi + ((lo / 0x100000000) >>> 0)) >>> 0;a_lo = lo >>> 0;}// update hash state (additional modulo 2^64)lo = s[0][1] + a_lo;s[0][0] = (s[0][0] + a_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[0][1] = lo >>> 0;lo = s[1][1] + b_lo;s[1][0] = (s[1][0] + b_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[1][1] = lo >>> 0;lo = s[2][1] + c_lo;s[2][0] = (s[2][0] + c_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[2][1] = lo >>> 0;lo = s[3][1] + d_lo;s[3][0] = (s[3][0] + d_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[3][1] = lo >>> 0;lo = s[4][1] + e_lo;s[4][0] = (s[4][0] + e_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[4][1] = lo >>> 0;lo = s[5][1] + f_lo;s[5][0] = (s[5][0] + f_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[5][1] = lo >>> 0;lo = s[6][1] + g_lo;s[6][0] = (s[6][0] + g_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[6][1] = lo >>> 0;lo = s[7][1] + h_lo;s[7][0] = (s[7][0] + h_hi + ((lo / 0x100000000) >>> 0)) >>> 0;s[7][1] = lo >>> 0;len -= 128;}}/***/ }),/***/ 2635:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Functions to output keys in SSH-friendly formats.** This is part of the Forge project which may be used under the terms of* either the BSD License or the GNU General Public License (GPL) Version 2.** See: https://github.com/digitalbazaar/forge/blob/cbebca3780658703d925b61b2caffb1d263a6c1d/LICENSE** @author https://github.com/shellac*/var forge = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(6080);__webpack_require__(5400);__webpack_require__(7499);__webpack_require__(2365);var ssh = module.exports = forge.ssh = forge.ssh || {};/*** Encodes (and optionally encrypts) a private RSA key as a Putty PPK file.** @param privateKey the key.* @param passphrase a passphrase to protect the key (falsy for no encryption).* @param comment a comment to include in the key file.** @return the PPK file as a string.*/ssh.privateKeyToPutty = function(privateKey, passphrase, comment) {comment = comment || '';passphrase = passphrase || '';var algorithm = 'ssh-rsa';var encryptionAlgorithm = (passphrase === '') ? 'none' : 'aes256-cbc';var ppk = 'PuTTY-User-Key-File-2: ' + algorithm + '\r\n';ppk += 'Encryption: ' + encryptionAlgorithm + '\r\n';ppk += 'Comment: ' + comment + '\r\n';// public key into buffer for ppkvar pubbuffer = forge.util.createBuffer();_addStringToBuffer(pubbuffer, algorithm);_addBigIntegerToBuffer(pubbuffer, privateKey.e);_addBigIntegerToBuffer(pubbuffer, privateKey.n);// write public keyvar pub = forge.util.encode64(pubbuffer.bytes(), 64);var length = Math.floor(pub.length / 66) + 1; // 66 = 64 + \r\nppk += 'Public-Lines: ' + length + '\r\n';ppk += pub;// private key into a buffervar privbuffer = forge.util.createBuffer();_addBigIntegerToBuffer(privbuffer, privateKey.d);_addBigIntegerToBuffer(privbuffer, privateKey.p);_addBigIntegerToBuffer(privbuffer, privateKey.q);_addBigIntegerToBuffer(privbuffer, privateKey.qInv);// optionally encrypt the private keyvar priv;if(!passphrase) {// use the unencrypted bufferpriv = forge.util.encode64(privbuffer.bytes(), 64);} else {// encrypt RSA key using passphrasevar encLen = privbuffer.length() + 16 - 1;encLen -= encLen % 16;// pad private key with sha1-d data -- needs to be a multiple of 16var padding = _sha1(privbuffer.bytes());padding.truncate(padding.length() - encLen + privbuffer.length());privbuffer.putBuffer(padding);var aeskey = forge.util.createBuffer();aeskey.putBuffer(_sha1('\x00\x00\x00\x00', passphrase));aeskey.putBuffer(_sha1('\x00\x00\x00\x01', passphrase));// encrypt some bytes using CBC mode// key is 40 bytes, so truncate *by* 8 bytesvar cipher = forge.aes.createEncryptionCipher(aeskey.truncate(8), 'CBC');cipher.start(forge.util.createBuffer().fillWithByte(0, 16));cipher.update(privbuffer.copy());cipher.finish();var encrypted = cipher.output;// Note: this appears to differ from Putty -- is forge wrong, or putty?// due to padding we finish as an exact multiple of 16encrypted.truncate(16); // all paddingpriv = forge.util.encode64(encrypted.bytes(), 64);}// output private keylength = Math.floor(priv.length / 66) + 1; // 64 + \r\nppk += '\r\nPrivate-Lines: ' + length + '\r\n';ppk += priv;// MACvar mackey = _sha1('putty-private-key-file-mac-key', passphrase);var macbuffer = forge.util.createBuffer();_addStringToBuffer(macbuffer, algorithm);_addStringToBuffer(macbuffer, encryptionAlgorithm);_addStringToBuffer(macbuffer, comment);macbuffer.putInt32(pubbuffer.length());macbuffer.putBuffer(pubbuffer);macbuffer.putInt32(privbuffer.length());macbuffer.putBuffer(privbuffer);var hmac = forge.hmac.create();hmac.start('sha1', mackey);hmac.update(macbuffer.bytes());ppk += '\r\nPrivate-MAC: ' + hmac.digest().toHex() + '\r\n';return ppk;};/*** Encodes a public RSA key as an OpenSSH file.** @param key the key.* @param comment a comment.** @return the public key in OpenSSH format.*/ssh.publicKeyToOpenSSH = function(key, comment) {var type = 'ssh-rsa';comment = comment || '';var buffer = forge.util.createBuffer();_addStringToBuffer(buffer, type);_addBigIntegerToBuffer(buffer, key.e);_addBigIntegerToBuffer(buffer, key.n);return type + ' ' + forge.util.encode64(buffer.bytes()) + ' ' + comment;};/*** Encodes a private RSA key as an OpenSSH file.** @param key the key.* @param passphrase a passphrase to protect the key (falsy for no encryption).** @return the public key in OpenSSH format.*/ssh.privateKeyToOpenSSH = function(privateKey, passphrase) {if(!passphrase) {return forge.pki.privateKeyToPem(privateKey);}// OpenSSH private key is just a legacy format, it seemsreturn forge.pki.encryptRsaPrivateKey(privateKey, passphrase,{legacy: true, algorithm: 'aes128'});};/*** Gets the SSH fingerprint for the given public key.** @param options the options to use.*          [md] the message digest object to use (defaults to forge.md.md5).*          [encoding] an alternative output encoding, such as 'hex'*            (defaults to none, outputs a byte buffer).*          [delimiter] the delimiter to use between bytes for 'hex' encoded*            output, eg: ':' (defaults to none).** @return the fingerprint as a byte buffer or other encoding based on options.*/ssh.getPublicKeyFingerprint = function(key, options) {options = options || {};var md = options.md || forge.md.md5.create();var type = 'ssh-rsa';var buffer = forge.util.createBuffer();_addStringToBuffer(buffer, type);_addBigIntegerToBuffer(buffer, key.e);_addBigIntegerToBuffer(buffer, key.n);// hash public key bytesmd.start();md.update(buffer.getBytes());var digest = md.digest();if(options.encoding === 'hex') {var hex = digest.toHex();if(options.delimiter) {return hex.match(/.{2}/g).join(options.delimiter);}return hex;} else if(options.encoding === 'binary') {return digest.getBytes();} else if(options.encoding) {throw new Error('Unknown encoding "' + options.encoding + '".');}return digest;};/*** Adds len(val) then val to a buffer.** @param buffer the buffer to add to.* @param val a big integer.*/function _addBigIntegerToBuffer(buffer, val) {var hexVal = val.toString(16);// ensure 2s complement +veif(hexVal[0] >= '8') {hexVal = '00' + hexVal;}var bytes = forge.util.hexToBytes(hexVal);buffer.putInt32(bytes.length);buffer.putBytes(bytes);}/*** Adds len(val) then val to a buffer.** @param buffer the buffer to add to.* @param val a string.*/function _addStringToBuffer(buffer, val) {buffer.putInt32(val.length);buffer.putString(val);}/*** Hashes the arguments into one value using SHA-1.** @return the sha1 hash of the provided arguments.*/function _sha1() {var sha = forge.md.sha1.create();var num = arguments.length;for (var i = 0; i < num; ++i) {sha.update(arguments[i]);}return sha.digest();}/***/ }),/***/ 7909:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Support for concurrent task management and synchronization in web* applications.** @author Dave Longley* @author David I. Lehn <[email protected]>** Copyright (c) 2009-2013 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);__webpack_require__(5569);__webpack_require__(9105);__webpack_require__(2365);// logging categoryvar cat = 'forge.task';// verbose level// 0: off, 1: a little, 2: a whole lot// Verbose debug logging is surrounded by a level check to avoid the// performance issues with even calling the logging code regardless if it// is actually logged.  For performance reasons this should not be set to 2// for production use.// ex: if(sVL >= 2) forge.log.verbose(....)var sVL = 0;// track tasks for debuggingvar sTasks = {};var sNextTaskId = 0;// debug accessforge.debug.set(cat, 'tasks', sTasks);// a map of task type to task queuevar sTaskQueues = {};// debug accessforge.debug.set(cat, 'queues', sTaskQueues);// name for unnamed tasksvar sNoTaskName = '?';// maximum number of doNext() recursions before a context swap occurs// FIXME: might need to tweak this based on the browservar sMaxRecursions = 30;// time slice for doing tasks before a context swap occurs// FIXME: might need to tweak this based on the browservar sTimeSlice = 20;/*** Task states.** READY: ready to start processing* RUNNING: task or a subtask is running* BLOCKED: task is waiting to acquire N permits to continue* SLEEPING: task is sleeping for a period of time* DONE: task is done* ERROR: task has an error*/var READY = 'ready';var RUNNING = 'running';var BLOCKED = 'blocked';var SLEEPING = 'sleeping';var DONE = 'done';var ERROR = 'error';/*** Task actions.  Used to control state transitions.** STOP: stop processing* START: start processing tasks* BLOCK: block task from continuing until 1 or more permits are released* UNBLOCK: release one or more permits* SLEEP: sleep for a period of time* WAKEUP: wakeup early from SLEEPING state* CANCEL: cancel further tasks* FAIL: a failure occured*/var STOP = 'stop';var START = 'start';var BLOCK = 'block';var UNBLOCK = 'unblock';var SLEEP = 'sleep';var WAKEUP = 'wakeup';var CANCEL = 'cancel';var FAIL = 'fail';/*** State transition table.** nextState = sStateTable[currentState][action]*/var sStateTable = {};sStateTable[READY] = {};sStateTable[READY][STOP] = READY;sStateTable[READY][START] = RUNNING;sStateTable[READY][CANCEL] = DONE;sStateTable[READY][FAIL] = ERROR;sStateTable[RUNNING] = {};sStateTable[RUNNING][STOP] = READY;sStateTable[RUNNING][START] = RUNNING;sStateTable[RUNNING][BLOCK] = BLOCKED;sStateTable[RUNNING][UNBLOCK] = RUNNING;sStateTable[RUNNING][SLEEP] = SLEEPING;sStateTable[RUNNING][WAKEUP] = RUNNING;sStateTable[RUNNING][CANCEL] = DONE;sStateTable[RUNNING][FAIL] = ERROR;sStateTable[BLOCKED] = {};sStateTable[BLOCKED][STOP] = BLOCKED;sStateTable[BLOCKED][START] = BLOCKED;sStateTable[BLOCKED][BLOCK] = BLOCKED;sStateTable[BLOCKED][UNBLOCK] = BLOCKED;sStateTable[BLOCKED][SLEEP] = BLOCKED;sStateTable[BLOCKED][WAKEUP] = BLOCKED;sStateTable[BLOCKED][CANCEL] = DONE;sStateTable[BLOCKED][FAIL] = ERROR;sStateTable[SLEEPING] = {};sStateTable[SLEEPING][STOP] = SLEEPING;sStateTable[SLEEPING][START] = SLEEPING;sStateTable[SLEEPING][BLOCK] = SLEEPING;sStateTable[SLEEPING][UNBLOCK] = SLEEPING;sStateTable[SLEEPING][SLEEP] = SLEEPING;sStateTable[SLEEPING][WAKEUP] = SLEEPING;sStateTable[SLEEPING][CANCEL] = DONE;sStateTable[SLEEPING][FAIL] = ERROR;sStateTable[DONE] = {};sStateTable[DONE][STOP] = DONE;sStateTable[DONE][START] = DONE;sStateTable[DONE][BLOCK] = DONE;sStateTable[DONE][UNBLOCK] = DONE;sStateTable[DONE][SLEEP] = DONE;sStateTable[DONE][WAKEUP] = DONE;sStateTable[DONE][CANCEL] = DONE;sStateTable[DONE][FAIL] = ERROR;sStateTable[ERROR] = {};sStateTable[ERROR][STOP] = ERROR;sStateTable[ERROR][START] = ERROR;sStateTable[ERROR][BLOCK] = ERROR;sStateTable[ERROR][UNBLOCK] = ERROR;sStateTable[ERROR][SLEEP] = ERROR;sStateTable[ERROR][WAKEUP] = ERROR;sStateTable[ERROR][CANCEL] = ERROR;sStateTable[ERROR][FAIL] = ERROR;/*** Creates a new task.** @param options options for this task*   run: the run function for the task (required)*   name: the run function for the task (optional)*   parent: parent of this task (optional)** @return the empty task.*/var Task = function(options) {// task idthis.id = -1;// task namethis.name = options.name || sNoTaskName;// task has no parentthis.parent = options.parent || null;// save run functionthis.run = options.run;// create a queue of subtasks to runthis.subtasks = [];// error flagthis.error = false;// state of the taskthis.state = READY;// number of times the task has been blocked (also the number// of permits needed to be released to continue running)this.blocks = 0;// timeout id when sleepingthis.timeoutId = null;// no swap time yetthis.swapTime = null;// no user datathis.userData = null;// initialize task// FIXME: deal with overflowthis.id = sNextTaskId++;sTasks[this.id] = this;if(sVL >= 1) {forge.log.verbose(cat, '[%s][%s] init', this.id, this.name, this);}};/*** Logs debug information on this task and the system state.*/Task.prototype.debug = function(msg) {msg = msg || '';forge.log.debug(cat, msg,'[%s][%s] task:', this.id, this.name, this,'subtasks:', this.subtasks.length,'queue:', sTaskQueues);};/*** Adds a subtask to run after task.doNext() or task.fail() is called.** @param name human readable name for this task (optional).* @param subrun a function to run that takes the current task as*          its first parameter.** @return the current task (useful for chaining next() calls).*/Task.prototype.next = function(name, subrun) {// juggle parameters if it looks like no name is givenif(typeof(name) === 'function') {subrun = name;// inherit parent's namename = this.name;}// create subtask, set parent to this task, propagate callbacksvar subtask = new Task({run: subrun,name: name,parent: this});// start subtasks runningsubtask.state = RUNNING;subtask.type = this.type;subtask.successCallback = this.successCallback || null;subtask.failureCallback = this.failureCallback || null;// queue a new subtaskthis.subtasks.push(subtask);return this;};/*** Adds subtasks to run in parallel after task.doNext() or task.fail()* is called.** @param name human readable name for this task (optional).* @param subrun functions to run that take the current task as*          their first parameter.** @return the current task (useful for chaining next() calls).*/Task.prototype.parallel = function(name, subrun) {// juggle parameters if it looks like no name is givenif(forge.util.isArray(name)) {subrun = name;// inherit parent's namename = this.name;}// Wrap parallel tasks in a regular task so they are started at the// proper time.return this.next(name, function(task) {// block waiting for subtasksvar ptask = task;ptask.block(subrun.length);// we pass the iterator from the loop below as a parameter// to a function because it is otherwise included in the// closure and changes as the loop changes -- causing i// to always be set to its highest valuevar startParallelTask = function(pname, pi) {forge.task.start({type: pname,run: function(task) {subrun[pi](task);},success: function(task) {ptask.unblock();},failure: function(task) {ptask.unblock();}});};for(var i = 0; i < subrun.length; i++) {// Type must be unique so task starts in parallel://    name + private string + task id + sub-task index// start tasks in parallel and unblock when the finishvar pname = name + '__parallel-' + task.id + '-' + i;var pi = i;startParallelTask(pname, pi);}});};/*** Stops a running task.*/Task.prototype.stop = function() {this.state = sStateTable[this.state][STOP];};/*** Starts running a task.*/Task.prototype.start = function() {this.error = false;this.state = sStateTable[this.state][START];// try to restartif(this.state === RUNNING) {this.start = new Date();this.run(this);runNext(this, 0);}};/*** Blocks a task until it one or more permits have been released. The* task will not r###me until the requested number of permits have* been released with call(s) to unblock().** @param n number of permits to wait for(default: 1).*/Task.prototype.block = function(n) {n = typeof(n) === 'undefined' ? 1 : n;this.blocks += n;if(this.blocks > 0) {this.state = sStateTable[this.state][BLOCK];}};/*** Releases a permit to unblock a task. If a task was blocked by* requesting N permits via block(), then it will only continue* running once enough permits have been released via unblock() calls.** If multiple processes need to synchronize with a single task then* use a condition variable (see forge.task.createCondition). It is* an error to unblock a task more times than it has been blocked.** @param n number of permits to release (default: 1).** @return the current block count (task is unblocked when count is 0)*/Task.prototype.unblock = function(n) {n = typeof(n) === 'undefined' ? 1 : n;this.blocks -= n;if(this.blocks === 0 && this.state !== DONE) {this.state = RUNNING;runNext(this, 0);}return this.blocks;};/*** Sleep for a period of time before r###ming tasks.** @param n number of milliseconds to sleep (default: 0).*/Task.prototype.sleep = function(n) {n = typeof(n) === 'undefined' ? 0 : n;this.state = sStateTable[this.state][SLEEP];var self = this;this.timeoutId = setTimeout(function() {self.timeoutId = null;self.state = RUNNING;runNext(self, 0);}, n);};/*** Waits on a condition variable until notified. The next task will* not be scheduled until notification. A condition variable can be* created with forge.task.createCondition().** Once cond.notify() is called, the task will continue.** @param cond the condition variable to wait on.*/Task.prototype.wait = function(cond) {cond.wait(this);};/*** If sleeping, wakeup and continue running tasks.*/Task.prototype.wakeup = function() {if(this.state === SLEEPING) {cancelTimeout(this.timeoutId);this.timeoutId = null;this.state = RUNNING;runNext(this, 0);}};/*** Cancel all remaining subtasks of this task.*/Task.prototype.cancel = function() {this.state = sStateTable[this.state][CANCEL];// remove permits neededthis.permitsNeeded = 0;// cancel timeoutsif(this.timeoutId !== null) {cancelTimeout(this.timeoutId);this.timeoutId = null;}// remove subtasksthis.subtasks = [];};/*** Finishes this task with failure and sets error flag. The entire* task will be aborted unless the next task that should execute* is passed as a parameter. This allows levels of subtasks to be* skipped. For instance, to abort only this tasks's subtasks, then* call fail(task.parent). To abort this task's subtasks and its* parent's subtasks, call fail(task.parent.parent). To abort* all tasks and simply call the task callback, call fail() or* fail(null).** The task callback (success or failure) will always, eventually, be* called.** @param next the task to continue at, or null to abort entirely.*/Task.prototype.fail = function(next) {// set error flagthis.error = true;// finish taskfinish(this, true);if(next) {// propagate task infonext.error = this.error;next.swapTime = this.swapTime;next.userData = this.userData;// do next task as specifiedrunNext(next, 0);} else {if(this.parent !== null) {// finish root task (ensures it is removed from task queue)var parent = this.parent;while(parent.parent !== null) {// propagate task infoparent.error = this.error;parent.swapTime = this.swapTime;parent.userData = this.userData;parent = parent.parent;}finish(parent, true);}// call failure callback if one existsif(this.failureCallback) {this.failureCallback(this);}}};/*** Asynchronously start a task.** @param task the task to start.*/var start = function(task) {task.error = false;task.state = sStateTable[task.state][START];setTimeout(function() {if(task.state === RUNNING) {task.swapTime = +new Date();task.run(task);runNext(task, 0);}}, 0);};/*** Run the next subtask or finish this task.** @param task the task to process.* @param recurse the recursion count.*/var runNext = function(task, recurse) {// get time since last context swap (ms), if enough time has passed set// swap to true to indicate that doNext was performed asynchronously// also, if recurse is too high do asynchronouslyvar swap =(recurse > sMaxRecursions) ||(+new Date() - task.swapTime) > sTimeSlice;var doNext = function(recurse) {recurse++;if(task.state === RUNNING) {if(swap) {// update swap timetask.swapTime = +new Date();}if(task.subtasks.length > 0) {// run next subtaskvar subtask = task.subtasks.shift();subtask.error = task.error;subtask.swapTime = task.swapTime;subtask.userData = task.userData;subtask.run(subtask);if(!subtask.error) {runNext(subtask, recurse);}} else {finish(task);if(!task.error) {// chain back up and run parentif(task.parent !== null) {// propagate task infotask.parent.error = task.error;task.parent.swapTime = task.swapTime;task.parent.userData = task.userData;// no subtasks left, call run next subtask on parentrunNext(task.parent, recurse);}}}}};if(swap) {// we're swapping, so run asynchronouslysetTimeout(doNext, 0);} else {// not swapping, so run synchronouslydoNext(recurse);}};/*** Finishes a task and looks for the next task in the queue to start.** @param task the task to finish.* @param suppressCallbacks true to suppress callbacks.*/var finish = function(task, suppressCallbacks) {// subtask is now donetask.state = DONE;delete sTasks[task.id];if(sVL >= 1) {forge.log.verbose(cat, '[%s][%s] finish',task.id, task.name, task);}// only do queue processing for root tasksif(task.parent === null) {// report error if queue is missingif(!(task.type in sTaskQueues)) {forge.log.error(cat,'[%s][%s] task queue missing [%s]',task.id, task.name, task.type);} else if(sTaskQueues[task.type].length === 0) {// report error if queue is emptyforge.log.error(cat,'[%s][%s] task queue empty [%s]',task.id, task.name, task.type);} else if(sTaskQueues[task.type][0] !== task) {// report error if this task isn't the first in the queueforge.log.error(cat,'[%s][%s] task not first in queue [%s]',task.id, task.name, task.type);} else {// remove ourselves from the queuesTaskQueues[task.type].shift();// clean up queue if it is emptyif(sTaskQueues[task.type].length === 0) {if(sVL >= 1) {forge.log.verbose(cat, '[%s][%s] delete queue [%s]',task.id, task.name, task.type);}/* Note: Only a task can delete a queue of its own type. Thisis used as a way to synchronize tasks. If a queue for a certaintask type exists, then a task of that type is running.*/delete sTaskQueues[task.type];} else {// dequeue the next task and start itif(sVL >= 1) {forge.log.verbose(cat,'[%s][%s] queue start next [%s] remain:%s',task.id, task.name, task.type,sTaskQueues[task.type].length);}sTaskQueues[task.type][0].start();}}if(!suppressCallbacks) {// call final callback if one existsif(task.error && task.failureCallback) {task.failureCallback(task);} else if(!task.error && task.successCallback) {task.successCallback(task);}}}};/* Tasks API */module.exports = forge.task = forge.task || {};/*** Starts a new task that will run the passed function asynchronously.** In order to finish the task, either task.doNext() or task.fail()* *must* be called.** The task must have a type (a string identifier) that can be used to* synchronize it with other tasks of the same type. That type can also* be used to cancel tasks that haven't started yet.** To start a task, the following object must be provided as a parameter* (each function takes a task object as its first parameter):** {*   type: the type of task.*   run: the function to run to execute the task.*   success: a callback to call when the task succeeds (optional).*   failure: a callback to call when the task fails (optional).* }** @param options the object as described above.*/forge.task.start = function(options) {// create a new taskvar task = new Task({run: options.run,name: options.name || sNoTaskName});task.type = options.type;task.successCallback = options.success || null;task.failureCallback = options.failure || null;// append the task onto the appropriate queueif(!(task.type in sTaskQueues)) {if(sVL >= 1) {forge.log.verbose(cat, '[%s][%s] create queue [%s]',task.id, task.name, task.type);}// create the queue with the new tasksTaskQueues[task.type] = [task];start(task);} else {// push the task onto the queue, it will be run after a task// with the same type completessTaskQueues[options.type].push(task);}};/*** Cancels all tasks of the given type that haven't started yet.** @param type the type of task to cancel.*/forge.task.cancel = function(type) {// find the task queueif(type in sTaskQueues) {// empty all but the current task from the queuesTaskQueues[type] = [sTaskQueues[type][0]];}};/*** Creates a condition variable to synchronize tasks. To make a task wait* on the condition variable, call task.wait(condition). To notify all* tasks that are waiting, call condition.notify().** @return the condition variable.*/forge.task.createCondition = function() {var cond = {// all tasks that are blockedtasks: {}};/*** Causes the given task to block until notify is called. If the task* is already waiting on this condition then this is a no-op.** @param task the task to cause to wait.*/cond.wait = function(task) {// only block onceif(!(task.id in cond.tasks)) {task.block();cond.tasks[task.id] = task;}};/*** Notifies all waiting tasks to wake up.*/cond.notify = function() {// since unblock() will run the next task from here, make sure to// clear the condition's blocked task list before unblockingvar tmp = cond.tasks;cond.tasks = {};for(var id in tmp) {tmp[id].unblock();}};return cond;};/***/ }),/***/ 4545:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** A Javascript implementation of Transport Layer Security (TLS).** @author Dave Longley** Copyright (c) 2009-2014 Digital Bazaar, Inc.** The TLS Handshake Protocol involves the following steps:** - Exchange hello messages to agree on algorithms, exchange random values,* and check for session r###mption.** - Exchange the necessary cryptographic parameters to allow the client and* server to agree on a premaster secret.** - Exchange certificates and cryptographic information to allow the client* and server to authenticate themselves.** - Generate a master secret from the premaster secret and exchanged random* values.** - Provide security parameters to the record layer.** - Allow the client and server to verify that their peer has calculated the* same security parameters and that the handshake occurred without tampering* by an attacker.** Up to 4 different messages may be sent during a key exchange. The server* certificate, the server key exchange, the client certificate, and the* client key exchange.** A typical handshake (from the client's perspective).** 1. Client sends ClientHello.* 2. Client receives ServerHello.* 3. Client receives optional Certificate.* 4. Client receives optional ServerKeyExchange.* 5. Client receives ServerHelloDone.* 6. Client sends optional Certificate.* 7. Client sends ClientKeyExchange.* 8. Client sends optional CertificateVerify.* 9. Client sends ChangeCipherSpec.* 10. Client sends Finished.* 11. Client receives ChangeCipherSpec.* 12. Client receives Finished.* 13. Client sends/receives application data.** To reuse an existing session:** 1. Client sends ClientHello with session ID for reuse.* 2. Client receives ServerHello with same session ID if reusing.* 3. Client receives ChangeCipherSpec message if reusing.* 4. Client receives Finished.* 5. Client sends ChangeCipherSpec.* 6. Client sends Finished.** Note: Client ignores HelloRequest if in the middle of a handshake.** Record Layer:** The record layer fragments information blocks into TLSPlaintext records* carrying data in chunks of 2^14 bytes or less. Client message boundaries are* not preserved in the record layer (i.e., multiple client messages of the* same ContentType MAY be coalesced into a single TLSPlaintext record, or a* single message MAY be fragmented across several records).** struct {*   uint8 major;*   uint8 minor;* } ProtocolVersion;** struct {*   ContentType type;*   ProtocolVersion version;*   uint16 length;*   opaque fragment[TLSPlaintext.length];* } TLSPlaintext;** type:*   The higher-level protocol used to process the enclosed fragment.** version:*   The version of the protocol being employed. TLS Version 1.2 uses version*   {3, 3}. TLS Version 1.0 uses version {3, 1}. Note that a client that*   supports multiple versions of TLS may not know what version will be*   employed before it receives the ServerHello.** length:*   The length (in bytes) of the following TLSPlaintext.fragment. The length*   MUST NOT exceed 2^14 = 16384 bytes.** fragment:*   The application data. This data is transparent and treated as an*   independent block to be dealt with by the higher-level protocol specified*   by the type field.** Implementations MUST NOT send zero-length fragments of Handshake, Alert, or* ChangeCipherSpec content types. Zero-length fragments of Application data* MAY be sent as they are potentially useful as a traffic analysis* countermeasure.** Note: Data of different TLS record layer content types MAY be interleaved.* Application data is generally of lower precedence for transmission than* other content types. However, records MUST be delivered to the network in* the same order as they are protected by the record layer. Recipients MUST* receive and process interleaved application layer traffic during handshakes* subsequent to the first one on a connection.** struct {*   ContentType type;       // same as TLSPlaintext.type*   ProtocolVersion version;// same as TLSPlaintext.version*   uint16 length;*   opaque fragment[TLSCompressed.length];* } TLSCompressed;** length:*   The length (in bytes) of the following TLSCompressed.fragment.*   The length MUST NOT exceed 2^14 + ####.** fragment:*   The compressed form of TLSPlaintext.fragment.** Note: A CompressionMethod.null operation is an identity operation; no fields* are altered. In this implementation, since no compression is supported,* uncompressed records are always the same as compressed records.** Encryption Information:** The encryption and MAC functions translate a TLSCompressed structure into a* TLSCiphertext. The decryption functions reverse the process. The MAC of the* record also includes a sequence number so that missing, extra, or repeated* messages are detectable.** struct {*   ContentType type;*   ProtocolVersion version;*   uint16 length;*   select (SecurityParameters.cipher_type) {*     case stream: GenericStreamCipher;*     case block:  GenericBlockCipher;*     case aead:   GenericAEADCipher;*   } fragment;* } TLSCiphertext;** type:*   The type field is identical to TLSCompressed.type.** version:*   The version field is identical to TLSCompressed.version.** length:*   The length (in bytes) of the following TLSCiphertext.fragment.*   The length MUST NOT exceed 2^14 + 2048.** fragment:*   The encrypted form of TLSCompressed.fragment, with the MAC.** Note: Only CBC Block Ciphers are supported by this implementation.** The TLSCompressed.fragment structures are converted to/from block* TLSCiphertext.fragment structures.** struct {*   opaque IV[SecurityParameters.record_iv_length];*   block-ciphered struct {*     opaque content[TLSCompressed.length];*     opaque MAC[SecurityParameters.mac_length];*     uint8 padding[GenericBlockCipher.padding_length];*     uint8 padding_length;*   };* } GenericBlockCipher;** The MAC is generated as described in Section 6.2.3.1.** IV:*   The Initialization Vector (IV) SHOULD be chosen at random, and MUST be*   unpredictable. Note that in versions of TLS prior to 1.1, there was no*   IV field, and the last ciphertext block of the previous record (the "CBC*   residue") was used as the IV. This was changed to prevent the attacks*   described in [CBCATT]. For block ciphers, the IV length is of length*   SecurityParameters.record_iv_length, which is equal to the*   SecurityParameters.block_size.** padding:*   Padding that is added to force the length of the plaintext to be an*   integral multiple of the block cipher's block length. The padding MAY be*   any length up to 255 bytes, as long as it r###lts in the*   TLSCiphertext.length being an integral multiple of the block length.*   Lengths longer than necessary might be desirable to frustrate attacks on*   a protocol that are based on analysis of the lengths of exchanged*   messages. Each uint8 in the padding data vector MUST be filled with the*   padding length value. The receiver MUST check this padding and MUST use*   the bad_record_mac alert to indicate padding errors.** padding_length:*   The padding length MUST be such that the total size of the*   GenericBlockCipher structure is a multiple of the cipher's block length.*   Legal values range from zero to 255, inclusive. This length specifies the*   length of the padding field exclusive of the padding_length field itself.** The encrypted data length (TLSCiphertext.length) is one more than the sum of* SecurityParameters.block_length, TLSCompressed.length,* SecurityParameters.mac_length, and padding_length.** Example: If the block length is 8 bytes, the content length* (TLSCompressed.length) is 61 bytes, and the MAC length is 20 bytes, then the* length before padding is 82 bytes (this does not include the IV. Thus, the* padding length modulo 8 must be equal to 6 in order to make the total length* an even multiple of 8 bytes (the block length). The padding length can be* 6, 14, 22, and so on, through 254. If the padding length were the minimum* necessary, 6, the padding would be 6 bytes, each containing the value 6.* Thus, the last 8 octets of the GenericBlockCipher before block encryption* would be xx 06 06 06 06 06 06 06, where xx is the last octet of the MAC.** Note: With block ciphers in CBC mode (Cipher Block Chaining), it is critical* that the entire plaintext of the record be known before any ciphertext is* transmitted. Otherwise, it is possible for the attacker to mount the attack* described in [CBCATT].** Implementation note: Canvel et al. [CBCTIME] have demonstrated a timing* attack on CBC padding based on the time required to compute the MAC. In* order to defend against this attack, implementations MUST ensure that* record processing time is essentially the same whether or not the padding* is correct. In general, the best way to do this is to compute the MAC even* if the padding is incorrect, and only then reject the packet. For instance,* if the pad appears to be incorrect, the implementation might assume a* zero-length pad and then compute the MAC. This leaves a small timing* channel, since MAC performance depends, to some extent, on the size of the* data fragment, but it is not believed to be large enough to be exploitable,* due to the large block size of existing MACs and the small size of the* timing signal.*/var forge = __webpack_require__(7009);__webpack_require__(1598);__webpack_require__(6080);__webpack_require__(5400);__webpack_require__(2966);__webpack_require__(9727);__webpack_require__(6660);__webpack_require__(7499);__webpack_require__(2365);/*** Generates pseudo random bytes by mixing the r###lt of two hash functions,* MD5 and SHA-1.** prf_TLS1(secret, label, seed) =*   P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed);** Each P_hash function functions as follows:** P_hash(secret, seed) = HMAC_hash(secret, A(1) + seed) +*                        HMAC_hash(secret, A(2) + seed) +*                        HMAC_hash(secret, A(3) + seed) + ...* A() is defined as:*   A(0) = seed*   A(i) = HMAC_hash(secret, A(i-1))** The '+' operator denotes concatenation.** As many iterations A(N) as are needed are performed to generate enough* pseudo random byte output. If an iteration creates more data than is* necessary, then it is truncated.** Therefore:* A(1) = HMAC_hash(secret, A(0))*      = HMAC_hash(secret, seed)* A(2) = HMAC_hash(secret, A(1))*      = HMAC_hash(secret, HMAC_hash(secret, seed))** Therefore:* P_hash(secret, seed) =*   HMAC_hash(secret, HMAC_hash(secret, A(0)) + seed) +*   HMAC_hash(secret, HMAC_hash(secret, A(1)) + seed) +*   ...** Therefore:* P_hash(secret, seed) =*   HMAC_hash(secret, HMAC_hash(secret, seed) + seed) +*   HMAC_hash(secret, HMAC_hash(secret, HMAC_hash(secret, seed)) + seed) +*   ...** @param secret the secret to use.* @param label the label to use.* @param seed the seed value to use.* @param length the number of bytes to generate.** @return the pseudo random bytes in a byte buffer.*/var prf_TLS1 = function(secret, label, seed, length) {var rval = forge.util.createBuffer();/* For TLS 1.0, the secret is split in half, into two secrets of equallength. If the secret has an odd length then the last byte of the firsthalf will be the same as the first byte of the second. The length of thetwo secrets is half of the secret rounded up. */var idx = (secret.length >> 1);var slen = idx + (secret.length & 1);var s1 = secret.substr(0, slen);var s2 = secret.substr(idx, slen);var ai = forge.util.createBuffer();var hmac = forge.hmac.create();seed = label + seed;// determine the number of iterations that must be performed to generate// enough output bytes, md5 creates 16 byte hashes, sha1 creates 20var md5itr = Math.ceil(length / 16);var sha1itr = Math.ceil(length / 20);// do md5 iterationshmac.start('MD5', s1);var md5bytes = forge.util.createBuffer();ai.putBytes(seed);for(var i = 0; i < md5itr; ++i) {// HMAC_hash(secret, A(i-1))hmac.start(null, null);hmac.update(ai.getBytes());ai.putBuffer(hmac.digest());// HMAC_hash(secret, A(i) + seed)hmac.start(null, null);hmac.update(ai.bytes() + seed);md5bytes.putBuffer(hmac.digest());}// do sha1 iterationshmac.start('SHA1', s2);var sha1bytes = forge.util.createBuffer();ai.clear();ai.putBytes(seed);for(var i = 0; i < sha1itr; ++i) {// HMAC_hash(secret, A(i-1))hmac.start(null, null);hmac.update(ai.getBytes());ai.putBuffer(hmac.digest());// HMAC_hash(secret, A(i) + seed)hmac.start(null, null);hmac.update(ai.bytes() + seed);sha1bytes.putBuffer(hmac.digest());}// XOR the md5 bytes with the sha1 bytesrval.putBytes(forge.util.xorBytes(md5bytes.getBytes(), sha1bytes.getBytes(), length));return rval;};/*** Generates pseudo random bytes using a SHA256 algorithm. For TLS 1.2.** @param secret the secret to use.* @param label the label to use.* @param seed the seed value to use.* @param length the number of bytes to generate.** @return the pseudo random bytes in a byte buffer.*/var prf_sha256 = function(secret, label, seed, length) {// FIXME: implement me for TLS 1.2};/*** Gets a MAC for a record using the SHA-1 hash algorithm.** @param key the mac key.* @param state the sequence number (array of two 32-bit integers).* @param record the record.** @return the sha-1 hash (20 bytes) for the given record.*/var hmac_sha1 = function(key, seqNum, record) {/* MAC is computed like so:HMAC_hash(key, seqNum +TLSCompressed.type +TLSCompressed.version +TLSCompressed.length +TLSCompressed.fragment)*/var hmac = forge.hmac.create();hmac.start('SHA1', key);var b = forge.util.createBuffer();b.putInt32(seqNum[0]);b.putInt32(seqNum[1]);b.putByte(record.type);b.putByte(record.version.major);b.putByte(record.version.minor);b.putInt16(record.length);b.putBytes(record.fragment.bytes());hmac.update(b.getBytes());return hmac.digest().getBytes();};/*** Compresses the TLSPlaintext record into a TLSCompressed record using the* deflate algorithm.** @param c the TLS connection.* @param record the TLSPlaintext record to compress.* @param s the ConnectionState to use.** @return true on success, false on failure.*/var deflate = function(c, record, s) {var rval = false;try {var bytes = c.deflate(record.fragment.getBytes());record.fragment = forge.util.createBuffer(bytes);record.length = bytes.length;rval = true;} catch(ex) {// deflate error, fail out}return rval;};/*** Decompresses the TLSCompressed record into a TLSPlaintext record using the* deflate algorithm.** @param c the TLS connection.* @param record the TLSCompressed record to decompress.* @param s the ConnectionState to use.** @return true on success, false on failure.*/var inflate = function(c, record, s) {var rval = false;try {var bytes = c.inflate(record.fragment.getBytes());record.fragment = forge.util.createBuffer(bytes);record.length = bytes.length;rval = true;} catch(ex) {// inflate error, fail out}return rval;};/*** Reads a TLS variable-length vector from a byte buffer.** Variable-length vectors are defined by specifying a subrange of legal* lengths, inclusively, using the notation <floor..ceiling>. When these are* encoded, the actual length precedes the vector's contents in the byte* stream. The length will be in the form of a number consuming as many bytes* as required to hold the vector's specified maximum (ceiling) length. A* variable-length vector with an actual length field of zero is referred to* as an empty vector.** @param b the byte buffer.* @param lenBytes the number of bytes required to store the length.** @return the r###lting byte buffer.*/var readVector = function(b, lenBytes) {var len = 0;switch(lenBytes) {case 1:len = b.getByte();break;case 2:len = b.getInt16();break;case 3:len = b.getInt24();break;case 4:len = b.getInt32();break;}// read vector bytes into a new bufferreturn forge.util.createBuffer(b.getBytes(len));};/*** Writes a TLS variable-length vector to a byte buffer.** @param b the byte buffer.* @param lenBytes the number of bytes required to store the length.* @param v the byte buffer vector.*/var writeVector = function(b, lenBytes, v) {// encode length at the start of the vector, where the number of bytes for// the length is the maximum number of bytes it would take to encode the// vector's ceilingb.putInt(v.length(), lenBytes << 3);b.putBuffer(v);};/*** The tls implementation.*/var tls = {};/*** Version: TLS 1.2 = 3.3, TLS 1.1 = 3.2, TLS 1.0 = 3.1. Both TLS 1.1 and* TLS 1.2 were still too new (ie: openSSL didn't implement them) at the time* of this implementation so TLS 1.0 was implemented instead.*/tls.Versions = {TLS_1_0: {major: 3, minor: 1},TLS_1_1: {major: 3, minor: 2},TLS_1_2: {major: 3, minor: 3}};tls.SupportedVersions = [tls.Versions.TLS_1_1,tls.Versions.TLS_1_0];tls.Version = tls.SupportedVersions[0];/*** Maximum fragment size. True maximum is 16384, but we fragment before that* to allow for unusual small increases during compression.*/tls.MaxFragment = 16384 - ####;/*** Whether this entity is considered the "client" or "server".* enum { server, client } ConnectionEnd;*/tls.ConnectionEnd = {server: 0,client: 1};/*** Pseudo-random function algorithm used to generate keys from the master* secret.* enum { tls_prf_sha256 } PRFAlgorithm;*/tls.PRFAlgorithm = {tls_prf_sha256: 0};/*** Bulk encryption algorithms.* enum { null, rc4, des3, aes } BulkCipherAlgorithm;*/tls.BulkCipherAlgorithm = {none: null,rc4: 0,des3: 1,aes: 2};/*** Cipher types.* enum { stream, block, aead } CipherType;*/tls.CipherType = {stream: 0,block: 1,aead: 2};/*** MAC (Message Authentication Code) algorithms.* enum { null, hmac_md5, hmac_sha1, hmac_sha256,*   hmac_sha384, hmac_sha512} MACAlgorithm;*/tls.MACAlgorithm = {none: null,hmac_md5: 0,hmac_sha1: 1,hmac_sha256: 2,hmac_sha384: 3,hmac_sha512: 4};/*** Compression algorithms.* enum { null(0), deflate(1), (255) } CompressionMethod;*/tls.CompressionMethod = {none: 0,deflate: 1};/*** TLS record content types.* enum {*   change_cipher_spec(20), alert(21), handshake(22),*   application_data(23), (255)* } ContentType;*/tls.ContentType = {change_cipher_spec: 20,alert: 21,handshake: 22,application_data: 23,heartbeat: 24};/*** TLS handshake types.* enum {*   hello_request(0), client_hello(1), server_hello(2),*   certificate(11), server_key_exchange (12),*   certificate_request(13), server_hello_done(14),*   certificate_verify(15), client_key_exchange(16),*   finished(20), (255)* } HandshakeType;*/tls.HandshakeType = {hello_request: 0,client_hello: 1,server_hello: 2,certificate: 11,server_key_exchange: 12,certificate_request: 13,server_hello_done: 14,certificate_verify: 15,client_key_exchange: 16,finished: 20};/*** TLS Alert Protocol.** enum { warning(1), fatal(2), (255) } AlertLevel;** enum {*   close_notify(0),*   unexpected_message(10),*   bad_record_mac(20),*   decryption_failed(21),*   record_overflow(22),*   decompression_failure(30),*   handshake_failure(40),*   bad_certificate(42),*   unsupported_certificate(43),*   certificate_revoked(44),*   certificate_expired(45),*   certificate_unknown(46),*   illegal_parameter(47),*   unknown_ca(48),*   access_denied(49),*   decode_error(50),*   decrypt_error(51),*   export_restriction(60),*   protocol_version(70),*   insufficient_security(71),*   internal_error(80),*   user_canceled(90),*   no_renegotiation(100),*   (255)* } AlertDescription;** struct {*   AlertLevel level;*   AlertDescription description;* } Alert;*/tls.Alert = {};tls.Alert.Level = {warning: 1,fatal: 2};tls.Alert.Description = {close_notify: 0,unexpected_message: 10,bad_record_mac: 20,decryption_failed: 21,record_overflow: 22,decompression_failure: 30,handshake_failure: 40,bad_certificate: 42,unsupported_certificate: 43,certificate_revoked: 44,certificate_expired: 45,certificate_unknown: 46,illegal_parameter: 47,unknown_ca: 48,access_denied: 49,decode_error: 50,decrypt_error: 51,export_restriction: 60,protocol_version: 70,insufficient_security: 71,internal_error: 80,user_canceled: 90,no_renegotiation: 100};/*** TLS Heartbeat Message types.* enum {*   heartbeat_request(1),*   heartbeat_response(2),*   (255)* } HeartbeatMessageType;*/tls.HeartbeatMessageType = {heartbeat_request: 1,heartbeat_response: 2};/*** Supported cipher suites.*/tls.CipherSuites = {};/*** Gets a supported cipher suite from its 2 byte ID.** @param twoBytes two bytes in a string.** @return the matching supported cipher suite or null.*/tls.getCipherSuite = function(twoBytes) {var rval = null;for(var key in tls.CipherSuites) {var cs = tls.CipherSuites[key];if(cs.id[0] === twoBytes.charCodeAt(0) &&cs.id[1] === twoBytes.charCodeAt(1)) {rval = cs;break;}}return rval;};/*** Called when an unexpected record is encountered.** @param c the connection.* @param record the record.*/tls.handleUnexpected = function(c, record) {// if connection is client and closed, ignore unexpected messagesvar ignore = (!c.open && c.entity === tls.ConnectionEnd.client);if(!ignore) {c.error(c, {message: 'Unexpected message. Received TLS record out of order.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.unexpected_message}});}};/*** Called when a client receives a HelloRequest record.** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleHelloRequest = function(c, record, length) {// ignore renegotiation requests from the server during a handshake, but// if handshaking, send a warning alert that renegotation is deniedif(!c.handshaking && c.handshakes > 0) {// send alert warningtls.queue(c, tls.createAlert(c, {level: tls.Alert.Level.warning,description: tls.Alert.Description.no_renegotiation}));tls.flush(c);}// continuec.process();};/*** Parses a hello message from a ClientHello or ServerHello record.** @param record the record to parse.** @return the parsed message.*/tls.parseHelloMessage = function(c, record, length) {var msg = null;var client = (c.entity === tls.ConnectionEnd.client);// minimum of 38 bytes in messageif(length < 38) {c.error(c, {message: client ?'Invalid ServerHello message. Message too short.' :'Invalid ClientHello message. Message too short.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.illegal_parameter}});} else {// use 'remaining' to calculate # of remaining bytes in the messagevar b = record.fragment;var remaining = b.length();msg = {version: {major: b.getByte(),minor: b.getByte()},random: forge.util.createBuffer(b.getBytes(32)),session_id: readVector(b, 1),extensions: []};if(client) {msg.cipher_suite = b.getBytes(2);msg.compression_method = b.getByte();} else {msg.cipher_suites = readVector(b, 2);msg.compression_methods = readVector(b, 1);}// read extensions if there are any bytes left in the messageremaining = length - (remaining - b.length());if(remaining > 0) {// parse extensionsvar exts = readVector(b, 2);while(exts.length() > 0) {msg.extensions.push({type: [exts.getByte(), exts.getByte()],data: readVector(exts, 2)});}// TODO: make extension support modularif(!client) {for(var i = 0; i < msg.extensions.length; ++i) {var ext = msg.extensions[i];// support SNI extensionif(ext.type[0] === 0x00 && ext.type[1] === 0x00) {// get server name listvar snl = readVector(ext.data, 2);while(snl.length() > 0) {// read server name typevar snType = snl.getByte();// only HostName type (0x00) is known, break out if// another type is detectedif(snType !== 0x00) {break;}// add host name to server name listc.session.extensions.server_name.serverNameList.push(readVector(snl, 2).getBytes());}}}}}// version already set, do not allow version changeif(c.session.version) {if(msg.version.major !== c.session.version.major ||msg.version.minor !== c.session.version.minor) {return c.error(c, {message: 'TLS version change is disallowed during renegotiation.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.protocol_version}});}}// get the chosen (ServerHello) cipher suiteif(client) {// FIXME: should be checking configured acceptable cipher suitesc.session.cipherSuite = tls.getCipherSuite(msg.cipher_suite);} else {// get a supported preferred (ClientHello) cipher suite// choose the first supported cipher suitevar tmp = forge.util.createBuffer(msg.cipher_suites.bytes());while(tmp.length() > 0) {// FIXME: should be checking configured acceptable suites// cipher suites take up 2 bytesc.session.cipherSuite = tls.getCipherSuite(tmp.getBytes(2));if(c.session.cipherSuite !== null) {break;}}}// cipher suite not supportedif(c.session.cipherSuite === null) {return c.error(c, {message: 'No cipher suites in common.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.handshake_failure},cipherSuite: forge.util.bytesToHex(msg.cipher_suite)});}// TODO: handle compression methodsif(client) {c.session.compressionMethod = msg.compression_method;} else {// no compressionc.session.compressionMethod = tls.CompressionMethod.none;}}return msg;};/*** Creates security parameters for the given connection based on the given* hello message.** @param c the TLS connection.* @param msg the hello message.*/tls.createSecurityParameters = function(c, msg) {/* Note: security params are from TLS 1.2, some values like prf_algorithmare ignored for TLS 1.0/1.1 and the builtin as specified in the spec isused. */// TODO: handle other options from server when more supported// get client and server randomsvar client = (c.entity === tls.ConnectionEnd.client);var msgRandom = msg.random.bytes();var cRandom = client ? c.session.sp.client_random : msgRandom;var sRandom = client ? msgRandom : tls.createRandom().getBytes();// create new security parametersc.session.sp = {entity: c.entity,prf_algorithm: tls.PRFAlgorithm.tls_prf_sha256,bulk_cipher_algorithm: null,cipher_type: null,enc_key_length: null,block_length: null,fixed_iv_length: null,record_iv_length: null,mac_algorithm: null,mac_length: null,mac_key_length: null,compression_algorithm: c.session.compressionMethod,pre_master_secret: null,master_secret: null,client_random: cRandom,server_random: sRandom};};/*** Called when a client receives a ServerHello record.** When a ServerHello message will be sent:*   The server will send this message in response to a client hello message*   when it was able to find an acceptable set of algorithms. If it cannot*   find such a match, it will respond with a handshake failure alert.** uint24 length;* struct {*   ProtocolVersion server_version;*   Random random;*   SessionID session_id;*   CipherSuite cipher_suite;*   CompressionMethod compression_method;*   select(extensions_present) {*     case false:*       struct {};*     case true:*       Extension extensions<0..2^16-1>;*   };* } ServerHello;** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleServerHello = function(c, record, length) {var msg = tls.parseHelloMessage(c, record, length);if(c.fail) {return;}// ensure server version is compatibleif(msg.version.minor <= c.version.minor) {c.version.minor = msg.version.minor;} else {return c.error(c, {message: 'Incompatible TLS version.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.protocol_version}});}// indicate session version has been setc.session.version = c.version;// get the session ID from the messagevar sessionId = msg.session_id.bytes();// if the session ID is not blank and matches the cached one, r###me// the sessionif(sessionId.length > 0 && sessionId === c.session.id) {// r###ming session, expect a ChangeCipherSpec nextc.expect = SCC;c.session.r###ming = true;// get new server randomc.session.sp.server_random = msg.random.bytes();} else {// not r###ming, expect a server Certificate message nextc.expect = SCE;c.session.r###ming = false;// create new security parameterstls.createSecurityParameters(c, msg);}// set new session IDc.session.id = sessionId;// continuec.process();};/*** Called when a server receives a ClientHello record.** When a ClientHello message will be sent:*   When a client first connects to a server it is required to send the*   client hello as its first message. The client can also send a client*   hello in response to a hello request or on its own initiative in order*   to renegotiate the security parameters in an existing connection.** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleClientHello = function(c, record, length) {var msg = tls.parseHelloMessage(c, record, length);if(c.fail) {return;}// get the session ID from the messagevar sessionId = msg.session_id.bytes();// see if the given session ID is in the cachevar session = null;if(c.sessionCache) {session = c.sessionCache.getSession(sessionId);if(session === null) {// session ID not foundsessionId = '';} else if(session.version.major !== msg.version.major ||session.version.minor > msg.version.minor) {// if session version is incompatible with client version, do not r###mesession = null;sessionId = '';}}// no session found to r###me, generate a new session IDif(sessionId.length === 0) {sessionId = forge.random.getBytes(32);}// update sessionc.session.id = sessionId;c.session.clientHelloVersion = msg.version;c.session.sp = {};if(session) {// use version and security parameters from r###med sessionc.version = c.session.version = session.version;c.session.sp = session.sp;} else {// use highest compatible minor versionvar version;for(var i = 1; i < tls.SupportedVersions.length; ++i) {version = tls.SupportedVersions[i];if(version.minor <= msg.version.minor) {break;}}c.version = {major: version.major, minor: version.minor};c.session.version = c.version;}// if a session is set, r###me itif(session !== null) {// r###ming session, expect a ChangeCipherSpec nextc.expect = CCC;c.session.r###ming = true;// get new client randomc.session.sp.client_random = msg.random.bytes();} else {// not r###ming, expect a Certificate or ClientKeyExchangec.expect = (c.verifyClient !== false) ? CCE : CKE;c.session.r###ming = false;// create new security parameterstls.createSecurityParameters(c, msg);}// connection now openc.open = true;// queue server hellotls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createServerHello(c)}));if(c.session.r###ming) {// queue change cipher spec messagetls.queue(c, tls.createRecord(c, {type: tls.ContentType.change_cipher_spec,data: tls.createChangeCipherSpec()}));// create pending statec.state.pending = tls.createConnectionState(c);// change current write state to pending write statec.state.current.write = c.state.pending.write;// queue finishedtls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createFinished(c)}));} else {// queue server certificatetls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createCertificate(c)}));if(!c.fail) {// queue server key exchangetls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createServerKeyExchange(c)}));// request client certificate if setif(c.verifyClient !== false) {// queue certificate requesttls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createCertificateRequest(c)}));}// queue server hello donetls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createServerHelloDone(c)}));}}// send recordstls.flush(c);// continuec.process();};/*** Called when a client receives a Certificate record.** When this message will be sent:*   The server must send a certificate whenever the agreed-upon key exchange*   method is not an anonymous one. This message will always immediately*   follow the server hello message.** Meaning of this message:*   The certificate type must be appropriate for the selected cipher suite's*   key exchange algorithm, and is generally an X.509v3 certificate. It must*   contain a key which matches the key exchange method, as follows. Unless*   otherwise specified, the signing algorithm for the certificate must be*   the same as the algorithm for the certificate key. Unless otherwise*   specified, the public key may be of any length.** opaque ASN.1Cert<1..2^24-1>;* struct {*   ASN.1Cert certificate_list<1..2^24-1>;* } Certificate;** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleCertificate = function(c, record, length) {// minimum of 3 bytes in messageif(length < 3) {return c.error(c, {message: 'Invalid Certificate message. Message too short.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.illegal_parameter}});}var b = record.fragment;var msg = {certificate_list: readVector(b, 3)};/* The sender's certificate will be first in the list (chain), eachsubsequent one that follows will certify the previous one, but rootcertificates (self-signed) that specify the certificate authority maybe omitted under the assumption that clients must already possess it. */var cert, asn1;var certs = [];try {while(msg.certificate_list.length() > 0) {// each entry in msg.certificate_list is a vector with 3 len bytescert = readVector(msg.certificate_list, 3);asn1 = forge.asn1.fromDer(cert);cert = forge.pki.certificateFromAsn1(asn1, true);certs.push(cert);}} catch(ex) {return c.error(c, {message: 'Could not parse certificate list.',cause: ex,send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.bad_certificate}});}// ensure at least 1 certificate was provided if in client-mode// or if verifyClient was set to true to require a certificate// (as opposed to 'optional')var client = (c.entity === tls.ConnectionEnd.client);if((client || c.verifyClient === true) && certs.length === 0) {// error, no certificatec.error(c, {message: client ?'No server certificate provided.' :'No client certificate provided.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.illegal_parameter}});} else if(certs.length === 0) {// no certs to verify// expect a ServerKeyExchange or ClientKeyExchange message nextc.expect = client ? SKE : CKE;} else {// save certificate in sessionif(client) {c.session.serverCertificate = certs[0];} else {c.session.clientCertificate = certs[0];}if(tls.verifyCertificateChain(c, certs)) {// expect a ServerKeyExchange or ClientKeyExchange message nextc.expect = client ? SKE : CKE;}}// continuec.process();};/*** Called when a client receives a ServerKeyExchange record.** When this message will be sent:*   This message will be sent immediately after the server certificate*   message (or the server hello message, if this is an anonymous*   negotiation).**   The server key exchange message is sent by the server only when the*   server certificate message (if sent) does not contain enough data to*   allow the client to exchange a premaster secret.** Meaning of this message:*   This message conveys cryptographic information to allow the client to*   communicate the premaster secret: either an RSA public key to encrypt*   the premaster secret with, or a Diffie-Hellman public key with which the*   client can complete a key exchange (with the r###lt being the premaster*   secret.)** enum {*   dhe_dss, dhe_rsa, dh_anon, rsa, dh_dss, dh_rsa* } KeyExchangeAlgorithm;** struct {*   opaque dh_p<1..2^16-1>;*   opaque dh_g<1..2^16-1>;*   opaque dh_Ys<1..2^16-1>;* } ServerDHParams;** struct {*   select(KeyExchangeAlgorithm) {*     case dh_anon:*       ServerDHParams params;*     case dhe_dss:*     case dhe_rsa:*       ServerDHParams params;*       digitally-signed struct {*         opaque client_random[32];*         opaque server_random[32];*         ServerDHParams params;*       } signed_params;*     case rsa:*     case dh_dss:*     case dh_rsa:*       struct {};*   };* } ServerKeyExchange;** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleServerKeyExchange = function(c, record, length) {// this implementation only supports RSA, no Diffie-Hellman support// so any length > 0 is invalidif(length > 0) {return c.error(c, {message: 'Invalid key parameters. Only RSA is supported.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.unsupported_certificate}});}// expect an optional CertificateRequest message nextc.expect = SCR;// continuec.process();};/*** Called when a client receives a ClientKeyExchange record.** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleClientKeyExchange = function(c, record, length) {// this implementation only supports RSA, no Diffie-Hellman support// so any length < 48 is invalidif(length < 48) {return c.error(c, {message: 'Invalid key parameters. Only RSA is supported.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.unsupported_certificate}});}var b = record.fragment;var msg = {enc_pre_master_secret: readVector(b, 2).getBytes()};// do rsa decryptionvar privateKey = null;if(c.getPrivateKey) {try {privateKey = c.getPrivateKey(c, c.session.serverCertificate);privateKey = forge.pki.privateKeyFromPem(privateKey);} catch(ex) {c.error(c, {message: 'Could not get private key.',cause: ex,send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.internal_error}});}}if(privateKey === null) {return c.error(c, {message: 'No private key set.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.internal_error}});}try {// decrypt 48-byte pre-master secretvar sp = c.session.sp;sp.pre_master_secret = privateKey.decrypt(msg.enc_pre_master_secret);// ensure client hello version matches first 2 bytesvar version = c.session.clientHelloVersion;if(version.major !== sp.pre_master_secret.charCodeAt(0) ||version.minor !== sp.pre_master_secret.charCodeAt(1)) {// error, do not send alert (see BLEI attack below)throw new Error('TLS version rollback attack detected.');}} catch(ex) {/* Note: Daniel Bleichenbacher [BLEI] can be used to attack aTLS server which is using PKCS#1 encoded RSA, so instead offailing here, we generate 48 random bytes and use that asthe pre-master secret. */sp.pre_master_secret = forge.random.getBytes(48);}// expect a CertificateVerify message if a Certificate was received that// does not have fixed Diffie-Hellman params, otherwise expect// ChangeCipherSpecc.expect = CCC;if(c.session.clientCertificate !== null) {// only RSA support, so expect CertificateVerify// TODO: support Diffie-Hellmanc.expect = CCV;}// continuec.process();};/*** Called when a client receives a CertificateRequest record.** When this message will be sent:*   A non-anonymous server can optionally request a certificate from the*   client, if appropriate for the selected cipher suite. This message, if*   sent, will immediately follow the Server Key Exchange message (if it is*   sent; otherwise, the Server Certificate message).** enum {*   rsa_sign(1), dss_sign(2), rsa_fixed_dh(3), dss_fixed_dh(4),*   rsa_ephemeral_dh_RESERVED(5), dss_ephemeral_dh_RESERVED(6),*   fortezza_dms_RESERVED(20), (255)* } ClientCertificateType;** opaque DistinguishedName<1..2^16-1>;** struct {*   ClientCertificateType certificate_types<1..2^8-1>;*   SignatureAndHashAlgorithm supported_signature_algorithms<2^16-1>;*   DistinguishedName certificate_authorities<0..2^16-1>;* } CertificateRequest;** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleCertificateRequest = function(c, record, length) {// minimum of 3 bytes in messageif(length < 3) {return c.error(c, {message: 'Invalid CertificateRequest. Message too short.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.illegal_parameter}});}// TODO: TLS 1.2+ has different format including// SignatureAndHashAlgorithm after cert typesvar b = record.fragment;var msg = {certificate_types: readVector(b, 1),certificate_authorities: readVector(b, 2)};// save certificate request in sessionc.session.certificateRequest = msg;// expect a ServerHelloDone message nextc.expect = SHD;// continuec.process();};/*** Called when a server receives a CertificateVerify record.** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleCertificateVerify = function(c, record, length) {if(length < 2) {return c.error(c, {message: 'Invalid CertificateVerify. Message too short.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.illegal_parameter}});}// rewind to get full bytes for message so it can be manually// digested below (special case for CertificateVerify messages because// they must be digested *after* handling as opposed to all others)var b = record.fragment;b.read -= 4;var msgBytes = b.bytes();b.read += 4;var msg = {signature: readVector(b, 2).getBytes()};// TODO: add support for DSA// generate data to verifyvar verify = forge.util.createBuffer();verify.putBuffer(c.session.md5.digest());verify.putBuffer(c.session.sha1.digest());verify = verify.getBytes();try {var cert = c.session.clientCertificate;/*b = forge.pki.rsa.decrypt(msg.signature, cert.publicKey, true, verify.length);if(b !== verify) {*/if(!cert.publicKey.verify(verify, msg.signature, 'NONE')) {throw new Error('CertificateVerify signature does not match.');}// digest message now that it has been handledc.session.md5.update(msgBytes);c.session.sha1.update(msgBytes);} catch(ex) {return c.error(c, {message: 'Bad signature in CertificateVerify.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.handshake_failure}});}// expect ChangeCipherSpecc.expect = CCC;// continuec.process();};/*** Called when a client receives a ServerHelloDone record.** When this message will be sent:*   The server hello done message is sent by the server to indicate the end*   of the server hello and associated messages. After sending this message*   the server will wait for a client response.** Meaning of this message:*   This message means that the server is done sending messages to support*   the key exchange, and the client can proceed with its phase of the key*   exchange.**   Upon receipt of the server hello done message the client should verify*   that the server provided a valid certificate if required and check that*   the server hello parameters are acceptable.** struct {} ServerHelloDone;** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleServerHelloDone = function(c, record, length) {// len must be 0 bytesif(length > 0) {return c.error(c, {message: 'Invalid ServerHelloDone message. Invalid length.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.record_overflow}});}if(c.serverCertificate === null) {// no server certificate was providedvar error = {message: 'No server certificate provided. Not enough security.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.insufficient_security}};// call application callbackvar depth = 0;var ret = c.verify(c, error.alert.description, depth, []);if(ret !== true) {// check for custom alert infoif(ret || ret === 0) {// set custom message and alert descriptionif(typeof ret === 'object' && !forge.util.isArray(ret)) {if(ret.message) {error.message = ret.message;}if(ret.alert) {error.alert.description = ret.alert;}} else if(typeof ret === 'number') {// set custom alert descriptionerror.alert.description = ret;}}// send errorreturn c.error(c, error);}}// create client certificate message if requestedif(c.session.certificateRequest !== null) {record = tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createCertificate(c)});tls.queue(c, record);}// create client key exchange messagerecord = tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createClientKeyExchange(c)});tls.queue(c, record);// expect no messages until the following callback has been calledc.expect = SER;// create callback to handle client signature (for client-certs)var callback = function(c, signature) {if(c.session.certificateRequest !== null &&c.session.clientCertificate !== null) {// create certificate verify messagetls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createCertificateVerify(c, signature)}));}// create change cipher spec messagetls.queue(c, tls.createRecord(c, {type: tls.ContentType.change_cipher_spec,data: tls.createChangeCipherSpec()}));// create pending statec.state.pending = tls.createConnectionState(c);// change current write state to pending write statec.state.current.write = c.state.pending.write;// create finished messagetls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createFinished(c)}));// expect a server ChangeCipherSpec message nextc.expect = SCC;// send recordstls.flush(c);// continuec.process();};// if there is no certificate request or no client certificate, do// callback immediatelyif(c.session.certificateRequest === null ||c.session.clientCertificate === null) {return callback(c, null);}// otherwise get the client signaturetls.getClientSignature(c, callback);};/*** Called when a ChangeCipherSpec record is received.** @param c the connection.* @param record the record.*/tls.handleChangeCipherSpec = function(c, record) {if(record.fragment.getByte() !== 0x01) {return c.error(c, {message: 'Invalid ChangeCipherSpec message received.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.illegal_parameter}});}// create pending state if:// 1. R###ming session in client mode OR// 2. NOT r###ming session in server modevar client = (c.entity === tls.ConnectionEnd.client);if((c.session.r###ming && client) || (!c.session.r###ming && !client)) {c.state.pending = tls.createConnectionState(c);}// change current read state to pending read statec.state.current.read = c.state.pending.read;// clear pending state if:// 1. NOT r###ming session in client mode OR// 2. r###ming a session in server modeif((!c.session.r###ming && client) || (c.session.r###ming && !client)) {c.state.pending = null;}// expect a Finished record nextc.expect = client ? SFI : CFI;// continuec.process();};/*** Called when a Finished record is received.** When this message will be sent:*   A finished message is always sent immediately after a change*   cipher spec message to verify that the key exchange and*   authentication processes were successful. It is essential that a*   change cipher spec message be received between the other*   handshake messages and the Finished message.** Meaning of this message:*   The finished message is the first protected with the just-*   negotiated algorithms, keys, and secrets. Recipients of finished*   messages must verify that the contents are correct.  Once a side*   has sent its Finished message and received and validated the*   Finished message from its peer, it may begin to send and receive*   application data over the connection.** struct {*   opaque verify_data[verify_data_length];* } Finished;** verify_data*   PRF(master_secret, finished_label, Hash(handshake_messages))*     [0..verify_data_length-1];** finished_label*   For Finished messages sent by the client, the string*   "client finished". For Finished messages sent by the server, the*   string "server finished".** verify_data_length depends on the cipher suite. If it is not specified* by the cipher suite, then it is 12. Versions of TLS < 1.2 always used* 12 bytes.** @param c the connection.* @param record the record.* @param length the length of the handshake message.*/tls.handleFinished = function(c, record, length) {// rewind to get full bytes for message so it can be manually// digested below (special case for Finished messages because they// must be digested *after* handling as opposed to all others)var b = record.fragment;b.read -= 4;var msgBytes = b.bytes();b.read += 4;// message contains only verify_datavar vd = record.fragment.getBytes();// ensure verify data is correctb = forge.util.createBuffer();b.putBuffer(c.session.md5.digest());b.putBuffer(c.session.sha1.digest());// set label based on entity typevar client = (c.entity === tls.ConnectionEnd.client);var label = client ? 'server finished' : 'client finished';// TODO: determine prf function and verify length for TLS 1.2var sp = c.session.sp;var vdl = 12;var prf = prf_TLS1;b = prf(sp.master_secret, label, b.getBytes(), vdl);if(b.getBytes() !== vd) {return c.error(c, {message: 'Invalid verify_data in Finished message.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.decrypt_error}});}// digest finished message now that it has been handledc.session.md5.update(msgBytes);c.session.sha1.update(msgBytes);// r###ming session as client or NOT r###ming session as serverif((c.session.r###ming && client) || (!c.session.r###ming && !client)) {// create change cipher spec messagetls.queue(c, tls.createRecord(c, {type: tls.ContentType.change_cipher_spec,data: tls.createChangeCipherSpec()}));// change current write state to pending write state, clear pendingc.state.current.write = c.state.pending.write;c.state.pending = null;// create finished messagetls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createFinished(c)}));}// expect application data nextc.expect = client ? SAD : CAD;// handshake completec.handshaking = false;++c.handshakes;// save access to peer certificatec.peerCertificate = client ?c.session.serverCertificate : c.session.clientCertificate;// send recordstls.flush(c);// now connectedc.isConnected = true;c.connected(c);// continuec.process();};/*** Called when an Alert record is received.** @param c the connection.* @param record the record.*/tls.handleAlert = function(c, record) {// read alertvar b = record.fragment;var alert = {level: b.getByte(),description: b.getByte()};// TODO: consider using a table?// get appropriate messagevar msg;switch(alert.description) {case tls.Alert.Description.close_notify:msg = 'Connection closed.';break;case tls.Alert.Description.unexpected_message:msg = 'Unexpected message.';break;case tls.Alert.Description.bad_record_mac:msg = 'Bad record MAC.';break;case tls.Alert.Description.decryption_failed:msg = 'Decryption failed.';break;case tls.Alert.Description.record_overflow:msg = 'Record overflow.';break;case tls.Alert.Description.decompression_failure:msg = 'Decompression failed.';break;case tls.Alert.Description.handshake_failure:msg = 'Handshake failure.';break;case tls.Alert.Description.bad_certificate:msg = 'Bad certificate.';break;case tls.Alert.Description.unsupported_certificate:msg = 'Unsupported certificate.';break;case tls.Alert.Description.certificate_revoked:msg = 'Certificate revoked.';break;case tls.Alert.Description.certificate_expired:msg = 'Certificate expired.';break;case tls.Alert.Description.certificate_unknown:msg = 'Certificate unknown.';break;case tls.Alert.Description.illegal_parameter:msg = 'Illegal parameter.';break;case tls.Alert.Description.unknown_ca:msg = 'Unknown certificate authority.';break;case tls.Alert.Description.access_denied:msg = 'Access denied.';break;case tls.Alert.Description.decode_error:msg = 'Decode error.';break;case tls.Alert.Description.decrypt_error:msg = 'Decrypt error.';break;case tls.Alert.Description.export_restriction:msg = 'Export restriction.';break;case tls.Alert.Description.protocol_version:msg = 'Unsupported protocol version.';break;case tls.Alert.Description.insufficient_security:msg = 'Insufficient security.';break;case tls.Alert.Description.internal_error:msg = 'Internal error.';break;case tls.Alert.Description.user_canceled:msg = 'User canceled.';break;case tls.Alert.Description.no_renegotiation:msg = 'Renegotiation not supported.';break;default:msg = 'Unknown error.';break;}// close connection on close_notify, not an errorif(alert.description === tls.Alert.Description.close_notify) {return c.close();}// call error handlerc.error(c, {message: msg,send: false,// origin is the opposite endorigin: (c.entity === tls.ConnectionEnd.client) ? 'server' : 'client',alert: alert});// continuec.process();};/*** Called when a Handshake record is received.** @param c the connection.* @param record the record.*/tls.handleHandshake = function(c, record) {// get the handshake type and message lengthvar b = record.fragment;var type = b.getByte();var length = b.getInt24();// see if the record fragment doesn't yet contain the full messageif(length > b.length()) {// cache the record, clear its fragment, and reset the buffer read// pointer before the type and length were readc.fragmented = record;record.fragment = forge.util.createBuffer();b.read -= 4;// continuereturn c.process();}// full message now available, clear cache, reset read pointer to// before type and lengthc.fragmented = null;b.read -= 4;// save the handshake bytes for digestion after handler is found// (include type and length of handshake msg)var bytes = b.bytes(length + 4);// restore read pointerb.read += 4;// handle expected messageif(type in hsTable[c.entity][c.expect]) {// initialize server sessionif(c.entity === tls.ConnectionEnd.server && !c.open && !c.fail) {c.handshaking = true;c.session = {version: null,extensions: {server_name: {serverNameList: []}},cipherSuite: null,compressionMethod: null,serverCertificate: null,clientCertificate: null,md5: forge.md.md5.create(),sha1: forge.md.sha1.create()};}/* Update handshake messages digest. Finished and CertificateVerifymessages are not digested here. They can't be digested as part ofthe verify_data that they contain. These messages are manuallydigested in their handlers. HelloRequest messages are simply neverincluded in the handshake message digest according to spec. */if(type !== tls.HandshakeType.hello_request &&type !== tls.HandshakeType.certificate_verify &&type !== tls.HandshakeType.finished) {c.session.md5.update(bytes);c.session.sha1.update(bytes);}// handle specific handshake type recordhsTable[c.entity][c.expect][type](c, record, length);} else {// unexpected recordtls.handleUnexpected(c, record);}};/*** Called when an ApplicationData record is received.** @param c the connection.* @param record the record.*/tls.handleApplicationData = function(c, record) {// buffer data, notify that its readyc.data.putBuffer(record.fragment);c.dataReady(c);// continuec.process();};/*** Called when a Heartbeat record is received.** @param c the connection.* @param record the record.*/tls.handleHeartbeat = function(c, record) {// get the heartbeat type and payloadvar b = record.fragment;var type = b.getByte();var length = b.getInt16();var payload = b.getBytes(length);if(type === tls.HeartbeatMessageType.heartbeat_request) {// discard request during handshake or if length is too largeif(c.handshaking || length > payload.length) {// continuereturn c.process();}// retransmit payloadtls.queue(c, tls.createRecord(c, {type: tls.ContentType.heartbeat,data: tls.createHeartbeat(tls.HeartbeatMessageType.heartbeat_response, payload)}));tls.flush(c);} else if(type === tls.HeartbeatMessageType.heartbeat_response) {// check payload against expected payload, discard heartbeat if no matchif(payload !== c.expectedHeartbeatPayload) {// continuereturn c.process();}// notify that a valid heartbeat was receivedif(c.heartbeatReceived) {c.heartbeatReceived(c, forge.util.createBuffer(payload));}}// continuec.process();};/*** The transistional state tables for receiving TLS records. It maps the* current TLS engine state and a received record to a function to handle the* record and update the state.** For instance, if the current state is SHE, then the TLS engine is expecting* a ServerHello record. Once a record is received, the handler function is* looked up using the state SHE and the record's content type.** The r###lting function will either be an error handler or a record handler.* The function will take whatever action is appropriate and update the state* for the next record.** The states are all based on possible server record types. Note that the* client will never specifically expect to receive a HelloRequest or an alert* from the server so there is no state that reflects this. These messages may* occur at any time.** There are two tables for mapping states because there is a second tier of* types for handshake messages. Once a record with a content type of handshake* is received, the handshake record handler will look up the handshake type in* the secondary map to get its appropriate handler.** Valid message orders are as follows:** =======================FULL HANDSHAKE======================* Client                                               Server** ClientHello                  -------->*                                                 ServerHello*                                                Certificate**                                          ServerKeyExchange**                                         CertificateRequest**                              <--------      ServerHelloDone* Certificate** ClientKeyExchange* CertificateVerify** [ChangeCipherSpec]* Finished                     -------->*                                          [ChangeCipherSpec]*                              <--------             Finished* Application Data             <------->     Application Data** =====================SESSION R###MPTION=====================* Client                                                Server** ClientHello                   -------->*                                                  ServerHello*                                           [ChangeCipherSpec]*                               <--------             Finished* [ChangeCipherSpec]* Finished                      -------->* Application Data              <------->     Application Data*/// client expect states (indicate which records are expected to be received)var SHE = 0; // rcv server hellovar SCE = 1; // rcv server certificatevar SKE = 2; // rcv server key exchangevar SCR = 3; // rcv certificate requestvar SHD = 4; // rcv server hello donevar SCC = 5; // rcv change cipher specvar SFI = 6; // rcv finishedvar SAD = 7; // rcv application datavar SER = 8; // not expecting any messages at this point// server expect statesvar CHE = 0; // rcv client hellovar CCE = 1; // rcv client certificatevar CKE = 2; // rcv client key exchangevar CCV = 3; // rcv certificate verifyvar CCC = 4; // rcv change cipher specvar CFI = 5; // rcv finishedvar CAD = 6; // rcv application datavar CER = 7; // not expecting any messages at this point// map client current expect state and content type to functionvar __ = tls.handleUnexpected;var R0 = tls.handleChangeCipherSpec;var R1 = tls.handleAlert;var R2 = tls.handleHandshake;var R3 = tls.handleApplicationData;var R4 = tls.handleHeartbeat;var ctTable = [];ctTable[tls.ConnectionEnd.client] = [//      CC,AL,HS,AD,HB/*SHE*/[__,R1,R2,__,R4],/*SCE*/[__,R1,R2,__,R4],/*SKE*/[__,R1,R2,__,R4],/*SCR*/[__,R1,R2,__,R4],/*SHD*/[__,R1,R2,__,R4],/*SCC*/[R0,R1,__,__,R4],/*SFI*/[__,R1,R2,__,R4],/*SAD*/[__,R1,R2,R3,R4],/*SER*/[__,R1,R2,__,R4]];// map server current expect state and content type to functionctTable[tls.ConnectionEnd.server] = [//      CC,AL,HS,AD/*CHE*/[__,R1,R2,__,R4],/*CCE*/[__,R1,R2,__,R4],/*CKE*/[__,R1,R2,__,R4],/*CCV*/[__,R1,R2,__,R4],/*CCC*/[R0,R1,__,__,R4],/*CFI*/[__,R1,R2,__,R4],/*CAD*/[__,R1,R2,R3,R4],/*CER*/[__,R1,R2,__,R4]];// map client current expect state and handshake type to functionvar H0 = tls.handleHelloRequest;var H1 = tls.handleServerHello;var H2 = tls.handleCertificate;var H3 = tls.handleServerKeyExchange;var H4 = tls.handleCertificateRequest;var H5 = tls.handleServerHelloDone;var H6 = tls.handleFinished;var hsTable = [];hsTable[tls.ConnectionEnd.client] = [//      HR,01,SH,03,04,05,06,07,08,09,10,SC,SK,CR,HD,15,CK,17,18,19,FI/*SHE*/[__,__,H1,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],/*SCE*/[H0,__,__,__,__,__,__,__,__,__,__,H2,H3,H4,H5,__,__,__,__,__,__],/*SKE*/[H0,__,__,__,__,__,__,__,__,__,__,__,H3,H4,H5,__,__,__,__,__,__],/*SCR*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,H4,H5,__,__,__,__,__,__],/*SHD*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,H5,__,__,__,__,__,__],/*SCC*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],/*SFI*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H6],/*SAD*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],/*SER*/[H0,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__]];// map server current expect state and handshake type to function// Note: CAD[CH] does not map to FB because renegotation is prohibitedvar H7 = tls.handleClientHello;var H8 = tls.handleClientKeyExchange;var H9 = tls.handleCertificateVerify;hsTable[tls.ConnectionEnd.server] = [//      01,CH,02,03,04,05,06,07,08,09,10,CC,12,13,14,CV,CK,17,18,19,FI/*CHE*/[__,H7,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],/*CCE*/[__,__,__,__,__,__,__,__,__,__,__,H2,__,__,__,__,__,__,__,__,__],/*CKE*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H8,__,__,__,__],/*CCV*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H9,__,__,__,__,__],/*CCC*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],/*CFI*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,H6],/*CAD*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__],/*CER*/[__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__,__]];/*** Generates the master_secret and keys using the given security parameters.** The security parameters for a TLS connection state are defined as such:** struct {*   ConnectionEnd          entity;*   PRFAlgorithm           prf_algorithm;*   BulkCipherAlgorithm    bulk_cipher_algorithm;*   CipherType             cipher_type;*   uint8                  enc_key_length;*   uint8                  block_length;*   uint8                  fixed_iv_length;*   uint8                  record_iv_length;*   MACAlgorithm           mac_algorithm;*   uint8                  mac_length;*   uint8                  mac_key_length;*   CompressionMethod      compression_algorithm;*   opaque                 master_secret[48];*   opaque                 client_random[32];*   opaque                 server_random[32];* } SecurityParameters;** Note that this definition is from TLS 1.2. In TLS 1.0 some of these* parameters are ignored because, for instance, the PRFAlgorithm is a* builtin-fixed algorithm combining iterations of MD5 and SHA-1 in TLS 1.0.** The Record Protocol requires an algorithm to generate keys required by the* current connection state.** The master secret is expanded into a sequence of secure bytes, which is then* split to a client write MAC key, a server write MAC key, a client write* encryption key, and a server write encryption key. In TLS 1.0 a client write* IV and server write IV are also generated. Each of these is generated from* the byte sequence in that order. Unused values are empty. In TLS 1.2, some* AEAD ciphers may additionally require a client write IV and a server write* IV (see Section 6.2.3.3).** When keys, MAC keys, and IVs are generated, the master secret is used as an* entropy source.** To generate the key material, compute:** master_secret = PRF(pre_master_secret, "master secret",*                     ClientHello.random + ServerHello.random)** key_block = PRF(SecurityParameters.master_secret,*                 "key expansion",*                 SecurityParameters.server_random +*                 SecurityParameters.client_random);** until enough output has been generated. Then, the key_block is* partitioned as follows:** client_write_MAC_key[SecurityParameters.mac_key_length]* server_write_MAC_key[SecurityParameters.mac_key_length]* client_write_key[SecurityParameters.enc_key_length]* server_write_key[SecurityParameters.enc_key_length]* client_write_IV[SecurityParameters.fixed_iv_length]* server_write_IV[SecurityParameters.fixed_iv_length]** In TLS 1.2, the client_write_IV and server_write_IV are only generated for* implicit nonce techniques as described in Section 3.2.1 of [AEAD]. This* implementation uses TLS 1.0 so IVs are generated.** Implementation note: The currently defined cipher suite which requires the* most material is AES_256_CBC_SHA256. It requires 2 x 32 byte keys and 2 x 32* byte MAC keys, for a total 128 bytes of key material. In TLS 1.0 it also* requires 2 x 16 byte IVs, so it actually takes 160 bytes of key material.** @param c the connection.* @param sp the security parameters to use.** @return the security keys.*/tls.generateKeys = function(c, sp) {// TLS_RSA_WITH_AES_128_CBC_SHA (required to be compliant with TLS 1.2) &// TLS_RSA_WITH_AES_256_CBC_SHA are the only cipher suites implemented// at present// TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA is required to be compliant with// TLS 1.0 but we don't care right now because AES is better and we have// an implementation for it// TODO: TLS 1.2 implementation/*// determine the PRFvar prf;switch(sp.prf_algorithm) {case tls.PRFAlgorithm.tls_prf_sha256:prf = prf_sha256;break;default:// should never happenthrow new Error('Invalid PRF');}*/// TLS 1.0/1.1 implementationvar prf = prf_TLS1;// concatenate server and client randomvar random = sp.client_random + sp.server_random;// only create master secret if session is newif(!c.session.r###ming) {// create master secret, clean up pre-master secretsp.master_secret = prf(sp.pre_master_secret, 'master secret', random, 48).bytes();sp.pre_master_secret = null;}// generate the amount of key material neededrandom = sp.server_random + sp.client_random;var length = 2 * sp.mac_key_length + 2 * sp.enc_key_length;// include IV for TLS/1.0var tls10 = (c.version.major === tls.Versions.TLS_1_0.major &&c.version.minor === tls.Versions.TLS_1_0.minor);if(tls10) {length += 2 * sp.fixed_iv_length;}var km = prf(sp.master_secret, 'key expansion', random, length);// split the key material into the MAC and encryption keysvar rval = {client_write_MAC_key: km.getBytes(sp.mac_key_length),server_write_MAC_key: km.getBytes(sp.mac_key_length),client_write_key: km.getBytes(sp.enc_key_length),server_write_key: km.getBytes(sp.enc_key_length)};// include TLS 1.0 IVsif(tls10) {rval.client_write_IV = km.getBytes(sp.fixed_iv_length);rval.server_write_IV = km.getBytes(sp.fixed_iv_length);}return rval;};/*** Creates a new initialized TLS connection state. A connection state has* a read mode and a write mode.** compression state:*   The current state of the compression algorithm.** cipher state:*   The current state of the encryption algorithm. This will consist of the*   scheduled key for that connection. For stream ciphers, this will also*   contain whatever state information is necessary to allow the stream to*   continue to encrypt or decrypt data.** MAC key:*   The MAC key for the connection.** sequence number:*   Each connection state contains a sequence number, which is maintained*   separately for read and write states. The sequence number MUST be set to*   zero whenever a connection state is made the active state. Sequence*   numbers are of type uint64 and may not exceed 2^64-1. Sequence numbers do*   not wrap. If a TLS implementation would need to wrap a sequence number,*   it must renegotiate instead. A sequence number is incremented after each*   record: specifically, the first record transmitted under a particular*   connection state MUST use sequence number 0.** @param c the connection.** @return the new initialized TLS connection state.*/tls.createConnectionState = function(c) {var client = (c.entity === tls.ConnectionEnd.client);var createMode = function() {var mode = {// two 32-bit numbers, first is most significantsequenceNumber: [0, 0],macKey: null,macLength: 0,macFunction: null,cipherState: null,cipherFunction: function(record) {return true;},compressionState: null,compressFunction: function(record) {return true;},updateSequenceNumber: function() {if(mode.sequenceNumber[1] === 0xFFFFFFFF) {mode.sequenceNumber[1] = 0;++mode.sequenceNumber[0];} else {++mode.sequenceNumber[1];}}};return mode;};var state = {read: createMode(),write: createMode()};// update function in read mode will decrypt then decompress a recordstate.read.update = function(c, record) {if(!state.read.cipherFunction(record, state.read)) {c.error(c, {message: 'Could not decrypt record or bad MAC.',send: true,alert: {level: tls.Alert.Level.fatal,// doesn't matter if decryption failed or MAC was// invalid, return the same error so as not to reveal// which one occurreddescription: tls.Alert.Description.bad_record_mac}});} else if(!state.read.compressFunction(c, record, state.read)) {c.error(c, {message: 'Could not decompress record.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.decompression_failure}});}return !c.fail;};// update function in write mode will compress then encrypt a recordstate.write.update = function(c, record) {if(!state.write.compressFunction(c, record, state.write)) {// error, but do not send alert since it would require// compression as wellc.error(c, {message: 'Could not compress record.',send: false,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.internal_error}});} else if(!state.write.cipherFunction(record, state.write)) {// error, but do not send alert since it would require// encryption as wellc.error(c, {message: 'Could not encrypt record.',send: false,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.internal_error}});}return !c.fail;};// handle security parametersif(c.session) {var sp = c.session.sp;c.session.cipherSuite.initSecurityParameters(sp);// generate keyssp.keys = tls.generateKeys(c, sp);state.read.macKey = client ?sp.keys.server_write_MAC_key : sp.keys.client_write_MAC_key;state.write.macKey = client ?sp.keys.client_write_MAC_key : sp.keys.server_write_MAC_key;// cipher suite setupc.session.cipherSuite.initConnectionState(state, c, sp);// compression setupswitch(sp.compression_algorithm) {case tls.CompressionMethod.none:break;case tls.CompressionMethod.deflate:state.read.compressFunction = inflate;state.write.compressFunction = deflate;break;default:throw new Error('Unsupported compression algorithm.');}}return state;};/*** Creates a Random structure.** struct {*   uint32 gmt_unix_time;*   opaque random_bytes[28];* } Random;** gmt_unix_time:*   The current time and date in standard UNIX 32-bit format (seconds since*   the midnight starting Jan 1, 1970, UTC, ignoring leap seconds) according*   to the sender's internal clock. Clocks are not required to be set*   correctly by the basic TLS protocol; higher-level or application*   protocols may define additional requirements. Note that, for historical*   reasons, the data element is named using GMT, the predecessor of the*   current worldwide time base, UTC.* random_bytes:*   28 bytes generated by a secure random number generator.** @return the Random structure as a byte array.*/tls.createRandom = function() {// get UTC millisecondsvar d = new Date();var utc = +d + d.getTimezoneOffset() * 60000;var rval = forge.util.createBuffer();rval.putInt32(utc);rval.putBytes(forge.random.getBytes(28));return rval;};/*** Creates a TLS record with the given type and data.** @param c the connection.* @param options:*   type: the record type.*   data: the plain text data in a byte buffer.** @return the created record.*/tls.createRecord = function(c, options) {if(!options.data) {return null;}var record = {type: options.type,version: {major: c.version.major,minor: c.version.minor},length: options.data.length(),fragment: options.data};return record;};/*** Creates a TLS alert record.** @param c the connection.* @param alert:*   level: the TLS alert level.*   description: the TLS alert description.** @return the created alert record.*/tls.createAlert = function(c, alert) {var b = forge.util.createBuffer();b.putByte(alert.level);b.putByte(alert.description);return tls.createRecord(c, {type: tls.ContentType.alert,data: b});};/* The structure of a TLS handshake message.** struct {*    HandshakeType msg_type;    // handshake type*    uint24 length;             // bytes in message*    select(HandshakeType) {*       case hello_request:       HelloRequest;*       case client_hello:        ClientHello;*       case server_hello:        ServerHello;*       case certificate:         Certificate;*       case server_key_exchange: ServerKeyExchange;*       case certificate_request: CertificateRequest;*       case server_hello_done:   ServerHelloDone;*       case certificate_verify:  CertificateVerify;*       case client_key_exchange: ClientKeyExchange;*       case finished:            Finished;*    } body;* } Handshake;*//*** Creates a ClientHello message.** opaque SessionID<0..32>;* enum { null(0), deflate(1), (255) } CompressionMethod;* uint8 CipherSuite[2];** struct {*   ProtocolVersion client_version;*   Random random;*   SessionID session_id;*   CipherSuite cipher_suites<2..2^16-2>;*   CompressionMethod compression_methods<1..2^8-1>;*   select(extensions_present) {*     case false:*       struct {};*     case true:*       Extension extensions<0..2^16-1>;*   };* } ClientHello;** The extension format for extended client hellos and server hellos is:** struct {*   ExtensionType extension_type;*   opaque extension_data<0..2^16-1>;* } Extension;** Here:** - "extension_type" identifies the particular extension type.* - "extension_data" contains information specific to the particular* extension type.** The extension types defined in this document are:** enum {*   server_name(0), max_fragment_length(1),*   client_certificate_url(2), trusted_ca_keys(3),*   truncated_hmac(4), status_request(5), (65535)* } ExtensionType;** @param c the connection.** @return the ClientHello byte buffer.*/tls.createClientHello = function(c) {// save hello versionc.session.clientHelloVersion = {major: c.version.major,minor: c.version.minor};// create supported cipher suitesvar cipherSuites = forge.util.createBuffer();for(var i = 0; i < c.cipherSuites.length; ++i) {var cs = c.cipherSuites[i];cipherSuites.putByte(cs.id[0]);cipherSuites.putByte(cs.id[1]);}var cSuites = cipherSuites.length();// create supported compression methods, null always supported, but// also support deflate if connection has inflate and deflate methodsvar compressionMethods = forge.util.createBuffer();compressionMethods.putByte(tls.CompressionMethod.none);// FIXME: deflate support disabled until issues with raw deflate data// without zlib headers are resolved/*if(c.inflate !== null && c.deflate !== null) {compressionMethods.putByte(tls.CompressionMethod.deflate);}*/var cMethods = compressionMethods.length();// create TLS SNI (server name indication) extension if virtual host// has been specified, see RFC 3546var extensions = forge.util.createBuffer();if(c.virtualHost) {// create extension structvar ext = forge.util.createBuffer();ext.putByte(0x00); // type server_name (ExtensionType is 2 bytes)ext.putByte(0x00);/* In order to provide the server name, clients MAY include an* extension of type "server_name" in the (extended) client hello.* The "extension_data" field of this extension SHALL contain* "ServerNameList" where:** struct {*   NameType name_type;*   select(name_type) {*     case host_name: HostName;*   } name;* } ServerName;** enum {*   host_name(0), (255)* } NameType;** opaque HostName<1..2^16-1>;** struct {*   ServerName server_name_list<1..2^16-1>* } ServerNameList;*/var serverName = forge.util.createBuffer();serverName.putByte(0x00); // type host_namewriteVector(serverName, 2, forge.util.createBuffer(c.virtualHost));// ServerNameList is in extension_datavar snList = forge.util.createBuffer();writeVector(snList, 2, serverName);writeVector(ext, 2, snList);extensions.putBuffer(ext);}var extLength = extensions.length();if(extLength > 0) {// add extension vector lengthextLength += 2;}// determine length of the handshake message// cipher suites and compression methods size will need to be// updated if more get added to the listvar sessionId = c.session.id;var length =sessionId.length + 1 + // session ID vector2 +                    // version (major + minor)4 + 28 +               // random time and random bytes2 + cSuites +          // cipher suites vector1 + cMethods +         // compression methods vectorextLength;             // extensions vector// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.client_hello);rval.putInt24(length);                     // handshake lengthrval.putByte(c.version.major);             // major versionrval.putByte(c.version.minor);             // minor versionrval.putBytes(c.session.sp.client_random); // random time + byteswriteVector(rval, 1, forge.util.createBuffer(sessionId));writeVector(rval, 2, cipherSuites);writeVector(rval, 1, compressionMethods);if(extLength > 0) {writeVector(rval, 2, extensions);}return rval;};/*** Creates a ServerHello message.** @param c the connection.** @return the ServerHello byte buffer.*/tls.createServerHello = function(c) {// determine length of the handshake messagevar sessionId = c.session.id;var length =sessionId.length + 1 + // session ID vector2 +                    // version (major + minor)4 + 28 +               // random time and random bytes2 +                    // chosen cipher suite1;                     // chosen compression method// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.server_hello);rval.putInt24(length);                     // handshake lengthrval.putByte(c.version.major);             // major versionrval.putByte(c.version.minor);             // minor versionrval.putBytes(c.session.sp.server_random); // random time + byteswriteVector(rval, 1, forge.util.createBuffer(sessionId));rval.putByte(c.session.cipherSuite.id[0]);rval.putByte(c.session.cipherSuite.id[1]);rval.putByte(c.session.compressionMethod);return rval;};/*** Creates a Certificate message.** When this message will be sent:*   This is the first message the client can send after receiving a server*   hello done message and the first message the server can send after*   sending a ServerHello. This client message is only sent if the server*   requests a certificate. If no suitable certificate is available, the*   client should send a certificate message containing no certificates. If*   client authentication is required by the server for the handshake to*   continue, it may respond with a fatal handshake failure alert.** opaque ASN.1Cert<1..2^24-1>;** struct {*   ASN.1Cert certificate_list<0..2^24-1>;* } Certificate;** @param c the connection.** @return the Certificate byte buffer.*/tls.createCertificate = function(c) {// TODO: check certificate request to ensure types are supported// get a certificate (a certificate as a PEM string)var client = (c.entity === tls.ConnectionEnd.client);var cert = null;if(c.getCertificate) {var hint;if(client) {hint = c.session.certificateRequest;} else {hint = c.session.extensions.server_name.serverNameList;}cert = c.getCertificate(c, hint);}// buffer to hold certificate listvar certList = forge.util.createBuffer();if(cert !== null) {try {// normalize cert to a chain of certificatesif(!forge.util.isArray(cert)) {cert = [cert];}var asn1 = null;for(var i = 0; i < cert.length; ++i) {var msg = forge.pem.decode(cert[i])[0];if(msg.type !== 'CERTIFICATE' &&msg.type !== 'X509 CERTIFICATE' &&msg.type !== 'TRUSTED CERTIFICATE') {var error = new Error('Could not convert certificate from PEM; PEM ' +'header type is not "CERTIFICATE", "X509 CERTIFICATE", or ' +'"TRUSTED CERTIFICATE".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert certificate from PEM; PEM is encrypted.');}var der = forge.util.createBuffer(msg.body);if(asn1 === null) {asn1 = forge.asn1.fromDer(der.bytes(), false);}// certificate entry is itself a vector with 3 length bytesvar certBuffer = forge.util.createBuffer();writeVector(certBuffer, 3, der);// add cert vector to cert list vectorcertList.putBuffer(certBuffer);}// save certificatecert = forge.pki.certificateFromAsn1(asn1);if(client) {c.session.clientCertificate = cert;} else {c.session.serverCertificate = cert;}} catch(ex) {return c.error(c, {message: 'Could not send certificate list.',cause: ex,send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.bad_certificate}});}}// determine length of the handshake messagevar length = 3 + certList.length(); // cert list vector// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.certificate);rval.putInt24(length);writeVector(rval, 3, certList);return rval;};/*** Creates a ClientKeyExchange message.** When this message will be sent:*   This message is always sent by the client. It will immediately follow the*   client certificate message, if it is sent. Otherwise it will be the first*   message sent by the client after it receives the server hello done*   message.** Meaning of this message:*   With this message, the premaster secret is set, either though direct*   transmission of the RSA-encrypted secret, or by the transmission of*   Diffie-Hellman parameters which will allow each side to agree upon the*   same premaster secret. When the key exchange method is DH_RSA or DH_DSS,*   client certification has been requested, and the client was able to*   respond with a certificate which contained a Diffie-Hellman public key*   whose parameters (group and generator) matched those specified by the*   server in its certificate, this message will not contain any data.** Meaning of this message:*   If RSA is being used for key agreement and authentication, the client*   generates a 48-byte premaster secret, encrypts it using the public key*   from the server's certificate or the temporary RSA key provided in a*   server key exchange message, and sends the r###lt in an encrypted*   premaster secret message. This structure is a variant of the client*   key exchange message, not a message in itself.** struct {*   select(KeyExchangeAlgorithm) {*     case rsa: EncryptedPreMasterSecret;*     case diffie_hellman: ClientDiffieHellmanPublic;*   } exchange_keys;* } ClientKeyExchange;** struct {*   ProtocolVersion client_version;*   opaque random[46];* } PreMasterSecret;** struct {*   public-key-encrypted PreMasterSecret pre_master_secret;* } EncryptedPreMasterSecret;** A public-key-encrypted element is encoded as a vector <0..2^16-1>.** @param c the connection.** @return the ClientKeyExchange byte buffer.*/tls.createClientKeyExchange = function(c) {// create buffer to encryptvar b = forge.util.createBuffer();// add highest client-supported protocol to help server avoid version// rollback attacksb.putByte(c.session.clientHelloVersion.major);b.putByte(c.session.clientHelloVersion.minor);// generate and add 46 random bytesb.putBytes(forge.random.getBytes(46));// save pre-master secretvar sp = c.session.sp;sp.pre_master_secret = b.getBytes();// RSA-encrypt the pre-master secretvar key = c.session.serverCertificate.publicKey;b = key.encrypt(sp.pre_master_secret);/* Note: The encrypted pre-master secret will be stored in apublic-key-encrypted opaque vector that has the length prefixed using2 bytes, so include those 2 bytes in the handshake message length. Thisis done as a minor optimization instead of calling writeVector(). */// determine length of the handshake messagevar length = b.length + 2;// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.client_key_exchange);rval.putInt24(length);// add vector length bytesrval.putInt16(b.length);rval.putBytes(b);return rval;};/*** Creates a ServerKeyExchange message.** @param c the connection.** @return the ServerKeyExchange byte buffer.*/tls.createServerKeyExchange = function(c) {// this implementation only supports RSA, no Diffie-Hellman support,// so this record is empty// determine length of the handshake messagevar length = 0;// build record fragmentvar rval = forge.util.createBuffer();if(length > 0) {rval.putByte(tls.HandshakeType.server_key_exchange);rval.putInt24(length);}return rval;};/*** Gets the signed data used to verify a client-side certificate. See* tls.createCertificateVerify() for details.** @param c the connection.* @param callback the callback to call once the signed data is ready.*/tls.getClientSignature = function(c, callback) {// generate data to RSA encryptvar b = forge.util.createBuffer();b.putBuffer(c.session.md5.digest());b.putBuffer(c.session.sha1.digest());b = b.getBytes();// create default signing function as necessaryc.getSignature = c.getSignature || function(c, b, callback) {// do rsa encryption, call callbackvar privateKey = null;if(c.getPrivateKey) {try {privateKey = c.getPrivateKey(c, c.session.clientCertificate);privateKey = forge.pki.privateKeyFromPem(privateKey);} catch(ex) {c.error(c, {message: 'Could not get private key.',cause: ex,send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.internal_error}});}}if(privateKey === null) {c.error(c, {message: 'No private key set.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.internal_error}});} else {b = privateKey.sign(b, null);}callback(c, b);};// get client signaturec.getSignature(c, b, callback);};/*** Creates a CertificateVerify message.** Meaning of this message:*   This structure conveys the client's Diffie-Hellman public value*   (Yc) if it was not already included in the client's certificate.*   The encoding used for Yc is determined by the enumerated*   PublicValueEncoding. This structure is a variant of the client*   key exchange message, not a message in itself.** When this message will be sent:*   This message is used to provide explicit verification of a client*   certificate. This message is only sent following a client*   certificate that has signing capability (i.e. all certificates*   except those containing fixed Diffie-Hellman parameters). When*   sent, it will immediately follow the client key exchange message.** struct {*   Signature signature;* } CertificateVerify;** CertificateVerify.signature.md5_hash*   MD5(handshake_messages);** Certificate.signature.sha_hash*   SHA(handshake_messages);** Here handshake_messages refers to all handshake messages sent or* received starting at client hello up to but not including this* message, including the type and length fields of the handshake* messages.** select(SignatureAlgorithm) {*   case anonymous: struct { };*   case rsa:*     digitally-signed struct {*       opaque md5_hash[16];*       opaque sha_hash[20];*     };*   case dsa:*     digitally-signed struct {*       opaque sha_hash[20];*     };* } Signature;** In digital signing, one-way hash functions are used as input for a* signing algorithm. A digitally-signed element is encoded as an opaque* vector <0..2^16-1>, where the length is specified by the signing* algorithm and key.** In RSA signing, a 36-byte structure of two hashes (one SHA and one* MD5) is signed (encrypted with the private key). It is encoded with* PKCS #1 block type 0 or type 1 as described in [PKCS1].** In DSS, the 20 bytes of the SHA hash are run directly through the* Digital Signing Algorithm with no additional hashing.** @param c the connection.* @param signature the signature to include in the message.** @return the CertificateVerify byte buffer.*/tls.createCertificateVerify = function(c, signature) {/* Note: The signature will be stored in a "digitally-signed" opaquevector that has the length prefixed using 2 bytes, so include those2 bytes in the handshake message length. This is done as a minoroptimization instead of calling writeVector(). */// determine length of the handshake messagevar length = signature.length + 2;// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.certificate_verify);rval.putInt24(length);// add vector length bytesrval.putInt16(signature.length);rval.putBytes(signature);return rval;};/*** Creates a CertificateRequest message.** @param c the connection.** @return the CertificateRequest byte buffer.*/tls.createCertificateRequest = function(c) {// TODO: support other certificate typesvar certTypes = forge.util.createBuffer();// common RSA certificate typecertTypes.putByte(0x01);// add distinguished names from CA storevar cAs = forge.util.createBuffer();for(var key in c.caStore.certs) {var cert = c.caStore.certs[key];var dn = forge.pki.distinguishedNameToAsn1(cert.subject);var byteBuffer = forge.asn1.toDer(dn);cAs.putInt16(byteBuffer.length());cAs.putBuffer(byteBuffer);}// TODO: TLS 1.2+ has a different format// determine length of the handshake messagevar length =1 + certTypes.length() +2 + cAs.length();// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.certificate_request);rval.putInt24(length);writeVector(rval, 1, certTypes);writeVector(rval, 2, cAs);return rval;};/*** Creates a ServerHelloDone message.** @param c the connection.** @return the ServerHelloDone byte buffer.*/tls.createServerHelloDone = function(c) {// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.server_hello_done);rval.putInt24(0);return rval;};/*** Creates a ChangeCipherSpec message.** The change cipher spec protocol exists to signal transitions in* ciphering strategies. The protocol consists of a single message,* which is encrypted and compressed under the current (not the pending)* connection state. The message consists of a single byte of value 1.** struct {*   enum { change_cipher_spec(1), (255) } type;* } ChangeCipherSpec;** @return the ChangeCipherSpec byte buffer.*/tls.createChangeCipherSpec = function() {var rval = forge.util.createBuffer();rval.putByte(0x01);return rval;};/*** Creates a Finished message.** struct {*   opaque verify_data[12];* } Finished;** verify_data*   PRF(master_secret, finished_label, MD5(handshake_messages) +*   SHA-1(handshake_messages)) [0..11];** finished_label*   For Finished messages sent by the client, the string "client*   finished". For Finished messages sent by the server, the*   string "server finished".** handshake_messages*   All of the data from all handshake messages up to but not*   including this message. This is only data visible at the*   handshake layer and does not include record layer headers.*   This is the concatenation of all the Handshake structures as*   defined in 7.4 exchanged thus far.** @param c the connection.** @return the Finished byte buffer.*/tls.createFinished = function(c) {// generate verify_datavar b = forge.util.createBuffer();b.putBuffer(c.session.md5.digest());b.putBuffer(c.session.sha1.digest());// TODO: determine prf function and verify length for TLS 1.2var client = (c.entity === tls.ConnectionEnd.client);var sp = c.session.sp;var vdl = 12;var prf = prf_TLS1;var label = client ? 'client finished' : 'server finished';b = prf(sp.master_secret, label, b.getBytes(), vdl);// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(tls.HandshakeType.finished);rval.putInt24(b.length());rval.putBuffer(b);return rval;};/*** Creates a HeartbeatMessage (See RFC 6520).** struct {*   HeartbeatMessageType type;*   uint16 payload_length;*   opaque payload[HeartbeatMessage.payload_length];*   opaque padding[padding_length];* } HeartbeatMessage;** The total length of a HeartbeatMessage MUST NOT exceed 2^14 or* max_fragment_length when negotiated as defined in [RFC6066].** type: The message type, either heartbeat_request or heartbeat_response.** payload_length: The length of the payload.** payload: The payload consists of arbitrary content.** padding: The padding is random content that MUST be ignored by the*   receiver. The length of a HeartbeatMessage is TLSPlaintext.length*   for TLS and DTLSPlaintext.length for DTLS. Furthermore, the*   length of the type field is 1 byte, and the length of the*   payload_length is 2. Therefore, the padding_length is*   TLSPlaintext.length - payload_length - 3 for TLS and*   DTLSPlaintext.length - payload_length - 3 for DTLS. The*   padding_length MUST be at least 16.** The sender of a HeartbeatMessage MUST use a random padding of at* least 16 bytes. The padding of a received HeartbeatMessage message* MUST be ignored.** If the payload_length of a received HeartbeatMessage is too large,* the received HeartbeatMessage MUST be discarded silently.** @param c the connection.* @param type the tls.HeartbeatMessageType.* @param payload the heartbeat data to send as the payload.* @param [payloadLength] the payload length to use, defaults to the*          actual payload length.** @return the HeartbeatRequest byte buffer.*/tls.createHeartbeat = function(type, payload, payloadLength) {if(typeof payloadLength === 'undefined') {payloadLength = payload.length;}// build record fragmentvar rval = forge.util.createBuffer();rval.putByte(type);               // heartbeat message typerval.putInt16(payloadLength);     // payload lengthrval.putBytes(payload);           // payload// paddingvar plaintextLength = rval.length();var paddingLength = Math.max(16, plaintextLength - payloadLength - 3);rval.putBytes(forge.random.getBytes(paddingLength));return rval;};/*** Fragments, compresses, encrypts, and queues a record for delivery.** @param c the connection.* @param record the record to queue.*/tls.queue = function(c, record) {// error during record creationif(!record) {return;}if(record.fragment.length() === 0) {if(record.type === tls.ContentType.handshake ||record.type === tls.ContentType.alert ||record.type === tls.ContentType.change_cipher_spec) {// Empty handshake, alert of change cipher spec messages are not allowed per the TLS specification and should not be sent.return;}}// if the record is a handshake record, update handshake hashesif(record.type === tls.ContentType.handshake) {var bytes = record.fragment.bytes();c.session.md5.update(bytes);c.session.sha1.update(bytes);bytes = null;}// handle record fragmentationvar records;if(record.fragment.length() <= tls.MaxFragment) {records = [record];} else {// fragment data as long as it is too longrecords = [];var data = record.fragment.bytes();while(data.length > tls.MaxFragment) {records.push(tls.createRecord(c, {type: record.type,data: forge.util.createBuffer(data.slice(0, tls.MaxFragment))}));data = data.slice(tls.MaxFragment);}// add last recordif(data.length > 0) {records.push(tls.createRecord(c, {type: record.type,data: forge.util.createBuffer(data)}));}}// compress and encrypt all fragmented recordsfor(var i = 0; i < records.length && !c.fail; ++i) {// update the record using current write statevar rec = records[i];var s = c.state.current.write;if(s.update(c, rec)) {// store recordc.records.push(rec);}}};/*** Flushes all queued records to the output buffer and calls the* tlsDataReady() handler on the given connection.** @param c the connection.** @return true on success, false on failure.*/tls.flush = function(c) {for(var i = 0; i < c.records.length; ++i) {var record = c.records[i];// add record header and fragmentc.tlsData.putByte(record.type);c.tlsData.putByte(record.version.major);c.tlsData.putByte(record.version.minor);c.tlsData.putInt16(record.fragment.length());c.tlsData.putBuffer(c.records[i].fragment);}c.records = [];return c.tlsDataReady(c);};/*** Maps a pki.certificateError to a tls.Alert.Description.** @param error the error to map.** @return the alert description.*/var _certErrorToAlertDesc = function(error) {switch(error) {case true:return true;case forge.pki.certificateError.bad_certificate:return tls.Alert.Description.bad_certificate;case forge.pki.certificateError.unsupported_certificate:return tls.Alert.Description.unsupported_certificate;case forge.pki.certificateError.certificate_revoked:return tls.Alert.Description.certificate_revoked;case forge.pki.certificateError.certificate_expired:return tls.Alert.Description.certificate_expired;case forge.pki.certificateError.certificate_unknown:return tls.Alert.Description.certificate_unknown;case forge.pki.certificateError.unknown_ca:return tls.Alert.Description.unknown_ca;default:return tls.Alert.Description.bad_certificate;}};/*** Maps a tls.Alert.Description to a pki.certificateError.** @param desc the alert description.** @return the certificate error.*/var _alertDescToCertError = function(desc) {switch(desc) {case true:return true;case tls.Alert.Description.bad_certificate:return forge.pki.certificateError.bad_certificate;case tls.Alert.Description.unsupported_certificate:return forge.pki.certificateError.unsupported_certificate;case tls.Alert.Description.certificate_revoked:return forge.pki.certificateError.certificate_revoked;case tls.Alert.Description.certificate_expired:return forge.pki.certificateError.certificate_expired;case tls.Alert.Description.certificate_unknown:return forge.pki.certificateError.certificate_unknown;case tls.Alert.Description.unknown_ca:return forge.pki.certificateError.unknown_ca;default:return forge.pki.certificateError.bad_certificate;}};/*** Verifies a certificate chain against the given connection's* Certificate Authority store.** @param c the TLS connection.* @param chain the certificate chain to verify, with the root or highest*          authority at the end.** @return true if successful, false if not.*/tls.verifyCertificateChain = function(c, chain) {try {// Make a copy of c.verifyOptions so that we can modify options.verify// without modifying c.verifyOptions.var options = {};for (var key in c.verifyOptions) {options[key] = c.verifyOptions[key];}options.verify = function(vfd, depth, chain) {// convert pki.certificateError to tls alert descriptionvar desc = _certErrorToAlertDesc(vfd);// call application callbackvar ret = c.verify(c, vfd, depth, chain);if(ret !== true) {if(typeof ret === 'object' && !forge.util.isArray(ret)) {// throw custom errorvar error = new Error('The application rejected the certificate.');error.send = true;error.alert = {level: tls.Alert.Level.fatal,description: tls.Alert.Description.bad_certificate};if(ret.message) {error.message = ret.message;}if(ret.alert) {error.alert.description = ret.alert;}throw error;}// convert tls alert description to pki.certificateErrorif(ret !== vfd) {ret = _alertDescToCertError(ret);}}return ret;};// verify chainforge.pki.verifyCertificateChain(c.caStore, chain, options);} catch(ex) {// build tls error if not already customizedvar err = ex;if(typeof err !== 'object' || forge.util.isArray(err)) {err = {send: true,alert: {level: tls.Alert.Level.fatal,description: _certErrorToAlertDesc(ex)}};}if(!('send' in err)) {err.send = true;}if(!('alert' in err)) {err.alert = {level: tls.Alert.Level.fatal,description: _certErrorToAlertDesc(err.error)};}// send errorc.error(c, err);}return !c.fail;};/*** Creates a new TLS session cache.** @param cache optional map of session ID to cached session.* @param capacity the maximum size for the cache (default: 100).** @return the new TLS session cache.*/tls.createSessionCache = function(cache, capacity) {var rval = null;// assume input is already a session cache objectif(cache && cache.getSession && cache.setSession && cache.order) {rval = cache;} else {// create cacherval = {};rval.cache = cache || {};rval.capacity = Math.max(capacity || 100, 1);rval.order = [];// store order for sessions, delete session overflowfor(var key in cache) {if(rval.order.length <= capacity) {rval.order.push(key);} else {delete cache[key];}}// get a session from a session ID (or get any session)rval.getSession = function(sessionId) {var session = null;var key = null;// if session ID provided, use itif(sessionId) {key = forge.util.bytesToHex(sessionId);} else if(rval.order.length > 0) {// get first session from cachekey = rval.order[0];}if(key !== null && key in rval.cache) {// get cached session and remove from cachesession = rval.cache[key];delete rval.cache[key];for(var i in rval.order) {if(rval.order[i] === key) {rval.order.splice(i, 1);break;}}}return session;};// set a session in the cacherval.setSession = function(sessionId, session) {// remove session from cache if at capacityif(rval.order.length === rval.capacity) {var key = rval.order.shift();delete rval.cache[key];}// add session to cachevar key = forge.util.bytesToHex(sessionId);rval.order.push(key);rval.cache[key] = session;};}return rval;};/*** Creates a new TLS connection.** See public createConnection() docs for more details.** @param options the options for this connection.** @return the new TLS connection.*/tls.createConnection = function(options) {var caStore = null;if(options.caStore) {// if CA store is an array, convert it to a CA store objectif(forge.util.isArray(options.caStore)) {caStore = forge.pki.createCaStore(options.caStore);} else {caStore = options.caStore;}} else {// create empty CA storecaStore = forge.pki.createCaStore();}// setup default cipher suitesvar cipherSuites = options.cipherSuites || null;if(cipherSuites === null) {cipherSuites = [];for(var key in tls.CipherSuites) {cipherSuites.push(tls.CipherSuites[key]);}}// set default entityvar entity = (options.server || false) ?tls.ConnectionEnd.server : tls.ConnectionEnd.client;// create session cache if requestedvar sessionCache = options.sessionCache ?tls.createSessionCache(options.sessionCache) : null;// create TLS connectionvar c = {version: {major: tls.Version.major, minor: tls.Version.minor},entity: entity,sessionId: options.sessionId,caStore: caStore,sessionCache: sessionCache,cipherSuites: cipherSuites,connected: options.connected,virtualHost: options.virtualHost || null,verifyClient: options.verifyClient || false,verify: options.verify || function(cn, vfd, dpth, cts) {return vfd;},verifyOptions: options.verifyOptions || {},getCertificate: options.getCertificate || null,getPrivateKey: options.getPrivateKey || null,getSignature: options.getSignature || null,input: forge.util.createBuffer(),tlsData: forge.util.createBuffer(),data: forge.util.createBuffer(),tlsDataReady: options.tlsDataReady,dataReady: options.dataReady,heartbeatReceived: options.heartbeatReceived,closed: options.closed,error: function(c, ex) {// set origin if not setex.origin = ex.origin ||((c.entity === tls.ConnectionEnd.client) ? 'client' : 'server');// send TLS alertif(ex.send) {tls.queue(c, tls.createAlert(c, ex.alert));tls.flush(c);}// error is fatal by defaultvar fatal = (ex.fatal !== false);if(fatal) {// set fail flagc.fail = true;}// call error handler firstoptions.error(c, ex);if(fatal) {// fatal error, close connection, do not clear failc.close(false);}},deflate: options.deflate || null,inflate: options.inflate || null};/*** Resets a closed TLS connection for reuse. Called in c.close().** @param clearFail true to clear the fail flag (default: true).*/c.reset = function(clearFail) {c.version = {major: tls.Version.major, minor: tls.Version.minor};c.record = null;c.session = null;c.peerCertificate = null;c.state = {pending: null,current: null};c.expect = (c.entity === tls.ConnectionEnd.client) ? SHE : CHE;c.fragmented = null;c.records = [];c.open = false;c.handshakes = 0;c.handshaking = false;c.isConnected = false;c.fail = !(clearFail || typeof(clearFail) === 'undefined');c.input.clear();c.tlsData.clear();c.data.clear();c.state.current = tls.createConnectionState(c);};// do initial reset of connectionc.reset();/*** Updates the current TLS engine state based on the given record.** @param c the TLS connection.* @param record the TLS record to act on.*/var _update = function(c, record) {// get record handler (align type in table by subtracting lowest)var aligned = record.type - tls.ContentType.change_cipher_spec;var handlers = ctTable[c.entity][c.expect];if(aligned in handlers) {handlers[aligned](c, record);} else {// unexpected recordtls.handleUnexpected(c, record);}};/*** Reads the record header and initializes the next record on the given* connection.** @param c the TLS connection with the next record.** @return 0 if the input data could be processed, otherwise the*         number of bytes required for data to be processed.*/var _readRecordHeader = function(c) {var rval = 0;// get input buffer and its lengthvar b = c.input;var len = b.length();// need at least 5 bytes to initialize a recordif(len < 5) {rval = 5 - len;} else {// enough bytes for header// initialize recordc.record = {type: b.getByte(),version: {major: b.getByte(),minor: b.getByte()},length: b.getInt16(),fragment: forge.util.createBuffer(),ready: false};// check record versionvar compatibleVersion = (c.record.version.major === c.version.major);if(compatibleVersion && c.session && c.session.version) {// session version already set, require same minor versioncompatibleVersion = (c.record.version.minor === c.version.minor);}if(!compatibleVersion) {c.error(c, {message: 'Incompatible TLS version.',send: true,alert: {level: tls.Alert.Level.fatal,description: tls.Alert.Description.protocol_version}});}}return rval;};/*** Reads the next record's contents and appends its message to any* previously fragmented message.** @param c the TLS connection with the next record.** @return 0 if the input data could be processed, otherwise the*         number of bytes required for data to be processed.*/var _readRecord = function(c) {var rval = 0;// ensure there is enough input data to get the entire recordvar b = c.input;var len = b.length();if(len < c.record.length) {// not enough data yet, return how much is requiredrval = c.record.length - len;} else {// there is enough data to parse the pending record// fill record fragment and compact input bufferc.record.fragment.putBytes(b.getBytes(c.record.length));b.compact();// update record using current read statevar s = c.state.current.read;if(s.update(c, c.record)) {// see if there is a previously fragmented message that the// new record's message fragment should be appended toif(c.fragmented !== null) {// if the record type matches a previously fragmented// record, append the record fragment to itif(c.fragmented.type === c.record.type) {// concatenate record fragmentsc.fragmented.fragment.putBuffer(c.record.fragment);c.record = c.fragmented;} else {// error, invalid fragmented recordc.error(c, {message: 'Invalid fragmented record.',send: true,alert: {level: tls.Alert.Level.fatal,description:tls.Alert.Description.unexpected_message}});}}// record is now readyc.record.ready = true;}}return rval;};/*** Performs a handshake using the TLS Handshake Protocol, as a client.** This method should only be called if the connection is in client mode.** @param sessionId the session ID to use, null to start a new one.*/c.handshake = function(sessionId) {// error to call this in non-client modeif(c.entity !== tls.ConnectionEnd.client) {// not fatal errorc.error(c, {message: 'Cannot initiate handshake as a server.',fatal: false});} else if(c.handshaking) {// handshake is already in progress, fail but not fatal errorc.error(c, {message: 'Handshake already in progress.',fatal: false});} else {// clear fail flag on reuseif(c.fail && !c.open && c.handshakes === 0) {c.fail = false;}// now handshakingc.handshaking = true;// default to blank (new session)sessionId = sessionId || '';// if a session ID was specified, try to find it in the cachevar session = null;if(sessionId.length > 0) {if(c.sessionCache) {session = c.sessionCache.getSession(sessionId);}// matching session not found in cache, clear session IDif(session === null) {sessionId = '';}}// no session given, grab a session from the cache, if availableif(sessionId.length === 0 && c.sessionCache) {session = c.sessionCache.getSession();if(session !== null) {sessionId = session.id;}}// set up sessionc.session = {id: sessionId,version: null,cipherSuite: null,compressionMethod: null,serverCertificate: null,certificateRequest: null,clientCertificate: null,sp: {},md5: forge.md.md5.create(),sha1: forge.md.sha1.create()};// use existing session informationif(session) {// only update version on connection, session version not yet setc.version = session.version;c.session.sp = session.sp;}// generate new client randomc.session.sp.client_random = tls.createRandom().getBytes();// connection now openc.open = true;// send hellotls.queue(c, tls.createRecord(c, {type: tls.ContentType.handshake,data: tls.createClientHello(c)}));tls.flush(c);}};/*** Called when TLS protocol data has been received from somewhere and should* be processed by the TLS engine.** @param data the TLS protocol data, as a string, to process.** @return 0 if the data could be processed, otherwise the number of bytes*         required for data to be processed.*/c.process = function(data) {var rval = 0;// buffer input dataif(data) {c.input.putBytes(data);}// process next record if no failure, process will be called after// each record is handled (since handling can be asynchronous)if(!c.fail) {// reset record if ready and now emptyif(c.record !== null &&c.record.ready && c.record.fragment.isEmpty()) {c.record = null;}// if there is no pending record, try to read record headerif(c.record === null) {rval = _readRecordHeader(c);}// read the next record (if record not yet ready)if(!c.fail && c.record !== null && !c.record.ready) {rval = _readRecord(c);}// record ready to be handled, update engine stateif(!c.fail && c.record !== null && c.record.ready) {_update(c, c.record);}}return rval;};/*** Requests that application data be packaged into a TLS record. The* tlsDataReady handler will be called when the TLS record(s) have been* prepared.** @param data the application data, as a raw 'binary' encoded string, to*          be sent; to send utf-16/utf-8 string data, use the return value*          of util.encodeUtf8(str).** @return true on success, false on failure.*/c.prepare = function(data) {tls.queue(c, tls.createRecord(c, {type: tls.ContentType.application_data,data: forge.util.createBuffer(data)}));return tls.flush(c);};/*** Requests that a heartbeat request be packaged into a TLS record for* transmission. The tlsDataReady handler will be called when TLS record(s)* have been prepared.** When a heartbeat response has been received, the heartbeatReceived* handler will be called with the matching payload. This handler can* be used to clear a retransmission timer, etc.** @param payload the heartbeat data to send as the payload in the message.* @param [payloadLength] the payload length to use, defaults to the*          actual payload length.** @return true on success, false on failure.*/c.prepareHeartbeatRequest = function(payload, payloadLength) {if(payload instanceof forge.util.ByteBuffer) {payload = payload.bytes();}if(typeof payloadLength === 'undefined') {payloadLength = payload.length;}c.expectedHeartbeatPayload = payload;tls.queue(c, tls.createRecord(c, {type: tls.ContentType.heartbeat,data: tls.createHeartbeat(tls.HeartbeatMessageType.heartbeat_request, payload, payloadLength)}));return tls.flush(c);};/*** Closes the connection (sends a close_notify alert).** @param clearFail true to clear the fail flag (default: true).*/c.close = function(clearFail) {// save session if connection didn't failif(!c.fail && c.sessionCache && c.session) {// only need to preserve session ID, version, and security paramsvar session = {id: c.session.id,version: c.session.version,sp: c.session.sp};session.sp.keys = null;c.sessionCache.setSession(session.id, session);}if(c.open) {// connection no longer open, clear inputc.open = false;c.input.clear();// if connected or handshaking, send an alertif(c.isConnected || c.handshaking) {c.isConnected = c.handshaking = false;// send close_notify alerttls.queue(c, tls.createAlert(c, {level: tls.Alert.Level.warning,description: tls.Alert.Description.close_notify}));tls.flush(c);}// call handlerc.closed(c);}// reset TLS connection, do not clear fail flagc.reset(clearFail);};return c;};/* TLS API */module.exports = forge.tls = forge.tls || {};// expose non-functionsfor(var key in tls) {if(typeof tls[key] !== 'function') {forge.tls[key] = tls[key];}}// expose prf_tls1 for testingforge.tls.prf_tls1 = prf_TLS1;// expose sha1 hmac methodforge.tls.hmac_sha1 = hmac_sha1;// expose session cache creationforge.tls.createSessionCache = tls.createSessionCache;/*** Creates a new TLS connection. This does not make any assumptions about the* transport layer that TLS is working on top of, ie: it does not assume there* is a TCP/IP connection or establish one. A TLS connection is totally* abstracted away from the layer is runs on top of, it merely establishes a* secure channel between a client" and a "server".** A TLS connection contains 4 connection states: pending read and write, and* current read and write.** At initialization, the current read and write states will be null. Only once* the security parameters have been set and the keys have been generated can* the pending states be converted into current states. Current states will be* updated for each record processed.** A custom certificate verify callback may be provided to check information* like the common name on the server's certificate. It will be called for* every certificate in the chain. It has the following signature:** variable func(c, certs, index, preVerify)* Where:* c         The TLS connection* verified  Set to true if certificate was verified, otherwise the alert*           tls.Alert.Description for why the certificate failed.* depth     The current index in the chain, where 0 is the server's cert.* certs     The certificate chain, *NOTE* if the server was anonymous then*           the chain will be empty.** The function returns true on success and on failure either the appropriate* tls.Alert.Description or an object with 'alert' set to the appropriate* tls.Alert.Description and 'message' set to a custom error message. If true* is not returned then the connection will abort using, in order of* availability, first the returned alert description, second the preVerify* alert description, and lastly the default 'bad_certificate'.** There are three callbacks that can be used to make use of client-side* certificates where each takes the TLS connection as the first parameter:** getCertificate(conn, hint)*   The second parameter is a hint as to which certificate should be*   returned. If the connection entity is a client, then the hint will be*   the CertificateRequest message from the server that is part of the*   TLS protocol. If the connection entity is a server, then it will be*   the servername list provided via an SNI extension the ClientHello, if*   one was provided (empty array if not). The hint can be examined to*   determine which certificate to use (advanced). Most implementations*   will just return a certificate. The return value must be a*   PEM-formatted certificate or an array of PEM-formatted certificates*   that constitute a certificate chain, with the first in the array/chain*   being the client's certificate.* getPrivateKey(conn, certificate)*   The second parameter is an forge.pki X.509 certificate object that*   is associated with the requested private key. The return value must*   be a PEM-formatted private key.* getSignature(conn, bytes, callback)*   This callback can be used instead of getPrivateKey if the private key*   is not directly accessible in javascript or should not be. For*   instance, a secure external web service could provide the signature*   in exchange for appropriate credentials. The second parameter is a*   string of bytes to be signed that are part of the TLS protocol. These*   bytes are used to verify that the private key for the previously*   provided client-side certificate is accessible to the client. The*   callback is a function that takes 2 parameters, the TLS connection*   and the RSA encrypted (signed) bytes as a string. This callback must*   be called once the signature is ready.** @param options the options for this connection:*   server: true if the connection is server-side, false for client.*   sessionId: a session ID to reuse, null for a new connection.*   caStore: an array of certificates to trust.*   sessionCache: a session cache to use.*   cipherSuites: an optional array of cipher suites to use,*     see tls.CipherSuites.*   connected: function(conn) called when the first handshake completes.*   virtualHost: the virtual server name to use in a TLS SNI extension.*   verifyClient: true to require a client certificate in server mode,*     'optional' to request one, false not to (default: false).*   verify: a handler used to custom verify certificates in the chain.*   verifyOptions: an object with options for the certificate chain validation.*     See documentation of pki.verifyCertificateChain for possible options.*     verifyOptions.verify is ignored. If you wish to specify a verify handler*     use the verify key.*   getCertificate: an optional callback used to get a certificate or*     a chain of certificates (as an array).*   getPrivateKey: an optional callback used to get a private key.*   getSignature: an optional callback used to get a signature.*   tlsDataReady: function(conn) called when TLS protocol data has been*     prepared and is ready to be used (typically sent over a socket*     connection to its destination), read from conn.tlsData buffer.*   dataReady: function(conn) called when application data has*     been parsed from a TLS record and should be consumed by the*     application, read from conn.data buffer.*   closed: function(conn) called when the connection has been closed.*   error: function(conn, error) called when there was an error.*   deflate: function(inBytes) if provided, will deflate TLS records using*     the deflate algorithm if the server supports it.*   inflate: function(inBytes) if provided, will inflate TLS records using*     the deflate algorithm if the server supports it.** @return the new TLS connection.*/forge.tls.createConnection = tls.createConnection;/***/ }),/***/ 2365:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Utility functions for web applications.** @author Dave Longley** Copyright (c) 2010-2018 Digital Bazaar, Inc.*/var forge = __webpack_require__(7009);var baseN = __webpack_require__(5596);/* Utilities API */var util = module.exports = forge.util = forge.util || {};// define setImmediate and nextTick(function() {// use native nextTick (unless we're in webpack)// webpack (or better node-libs-browser polyfill) sets process.browser.// this way we can detect webpack properlyif(typeof process !== 'undefined' && process.nextTick && !process.browser) {util.nextTick = process.nextTick;if(typeof setImmediate === 'function') {util.setImmediate = setImmediate;} else {// polyfill setImmediate with nextTick, older versions of node// (those w/o setImmediate) won't totally starve IOutil.setImmediate = util.nextTick;}return;}// polyfill nextTick with native setImmediateif(typeof setImmediate === 'function') {util.setImmediate = function() { return setImmediate.apply(undefined, arguments); };util.nextTick = function(callback) {return setImmediate(callback);};return;}/* Note: A polyfill upgrade pattern is used here to allow combiningpolyfills. For example, MutationObserver is fast, but blocks UI updates,so it needs to allow UI updates periodically, so it falls back onpostMessage or setTimeout. */// polyfill with setTimeoututil.setImmediate = function(callback) {setTimeout(callback, 0);};// upgrade polyfill to use postMessageif(typeof window !== 'undefined' &&typeof window.postMessage === 'function') {var msg = 'forge.setImmediate';var callbacks = [];util.setImmediate = function(callback) {callbacks.push(callback);// only send message when one hasn't been sent in// the current turn of the event loopif(callbacks.length === 1) {window.postMessage(msg, '*');}};function handler(event) {if(event.source === window && event.data === msg) {event.stopPropagation();var copy = callbacks.slice();callbacks.length = 0;copy.forEach(function(callback) {callback();});}}window.addEventListener('message', handler, true);}// upgrade polyfill to use MutationObserverif(typeof MutationObserver !== 'undefined') {// polyfill with MutationObservervar now = Date.now();var attr = true;var div = document.createElement('div');var callbacks = [];new MutationObserver(function() {var copy = callbacks.slice();callbacks.length = 0;copy.forEach(function(callback) {callback();});}).observe(div, {attributes: true});var oldSetImmediate = util.setImmediate;util.setImmediate = function(callback) {if(Date.now() - now > 15) {now = Date.now();oldSetImmediate(callback);} else {callbacks.push(callback);// only trigger observer when it hasn't been triggered in// the current turn of the event loopif(callbacks.length === 1) {div.setAttribute('a', attr = !attr);}}};}util.nextTick = util.setImmediate;})();// check if running under Node.jsutil.isNodejs =typeof process !== 'undefined' && process.versions && process.versions.node;// 'self' will also work in Web Workers (instance of WorkerGlobalScope) while// it will point to `window` in the main thread.// To remain compatible with older browsers, we fall back to 'window' if 'self'// is not available.util.globalScope = (function() {if(util.isNodejs) {return __webpack_require__.g;}return typeof self === 'undefined' ? window : self;})();// define isArrayutil.isArray = Array.isArray || function(x) {return Object.prototype.toString.call(x) === '[object Array]';};// define isArrayBufferutil.isArrayBuffer = function(x) {return typeof ArrayBuffer !== 'undefined' && x instanceof ArrayBuffer;};// define isArrayBufferViewutil.isArrayBufferView = function(x) {return x && util.isArrayBuffer(x.buffer) && x.byteLength !== undefined;};/*** Ensure a bits param is 8, 16, 24, or 32. Used to validate input for* algorithms where bit manipulation, JavaScript limitations, and/or algorithm* design only allow for byte operations of a limited size.** @param n number of bits.** Throw Error if n invalid.*/function _checkBitsParam(n) {if(!(n === 8 || n === 16 || n === 24 || n === 32)) {throw new Error('Only 8, 16, 24, or 32 bits supported: ' + n);}}// TODO: set ByteBuffer to best available backingutil.ByteBuffer = ByteStringBuffer;/** Buffer w/BinaryString backing *//*** Constructor for a binary string backed byte buffer.** @param [b] the bytes to wrap (either encoded as string, one byte per*          character, or as an ArrayBuffer or Typed Array).*/function ByteStringBuffer(b) {// TODO: update to match DataBuffer API// the data in this bufferthis.data = '';// the pointer for reading from this bufferthis.read = 0;if(typeof b === 'string') {this.data = b;} else if(util.isArrayBuffer(b) || util.isArrayBufferView(b)) {if(typeof Buffer !== 'undefined' && b instanceof Buffer) {this.data = b.toString('binary');} else {// convert native buffer to forge buffer// FIXME: support native buffers internally insteadvar arr = new Uint8Array(b);try {this.data = String.fromCharCode.apply(null, arr);} catch(e) {for(var i = 0; i < arr.length; ++i) {this.putByte(arr[i]);}}}} else if(b instanceof ByteStringBuffer ||(typeof b === 'object' && typeof b.data === 'string' &&typeof b.read === 'number')) {// copy existing bufferthis.data = b.data;this.read = b.read;}// used for v8 optimizationthis._constructedStringLength = 0;}util.ByteStringBuffer = ByteStringBuffer;/* Note: This is an optimization for V8-based browsers. When V8 concatenatesa string, the strings are only joined logically using a "cons string" or"constructed/concatenated string". These containers keep references to oneanother and can r###lt in very large memory usage. For example, if a 2MBstring is constructed by concatenating 4 bytes together at a time, thememory usage will be ~44MB; so ~22x increase. The strings are only joinedtogether when an operation requiring their joining takes place, such assubstr(). This function is called when adding data to this buffer to ensurethese types of strings are periodically joined to reduce the memoryfootprint. */var _MAX_CONSTRUCTED_STRING_LENGTH = 4096;util.ByteStringBuffer.prototype._optimizeConstructedString = function(x) {this._constructedStringLength += x;if(this._constructedStringLength > _MAX_CONSTRUCTED_STRING_LENGTH) {// this substr() should cause the constructed string to jointhis.data.substr(0, 1);this._constructedStringLength = 0;}};/*** Gets the number of bytes in this buffer.** @return the number of bytes in this buffer.*/util.ByteStringBuffer.prototype.length = function() {return this.data.length - this.read;};/*** Gets whether or not this buffer is empty.** @return true if this buffer is empty, false if not.*/util.ByteStringBuffer.prototype.isEmpty = function() {return this.length() <= 0;};/*** Puts a byte in this buffer.** @param b the byte to put.** @return this buffer.*/util.ByteStringBuffer.prototype.putByte = function(b) {return this.putBytes(String.fromCharCode(b));};/*** Puts a byte in this buffer N times.** @param b the byte to put.* @param n the number of bytes of value b to put.** @return this buffer.*/util.ByteStringBuffer.prototype.fillWithByte = function(b, n) {b = String.fromCharCode(b);var d = this.data;while(n > 0) {if(n & 1) {d += b;}n >>>= 1;if(n > 0) {b += b;}}this.data = d;this._optimizeConstructedString(n);return this;};/*** Puts bytes in this buffer.** @param bytes the bytes (as a UTF-8 encoded string) to put.** @return this buffer.*/util.ByteStringBuffer.prototype.putBytes = function(bytes) {this.data += bytes;this._optimizeConstructedString(bytes.length);return this;};/*** Puts a UTF-16 encoded string into this buffer.** @param str the string to put.** @return this buffer.*/util.ByteStringBuffer.prototype.putString = function(str) {return this.putBytes(util.encodeUtf8(str));};/*** Puts a 16-bit integer in this buffer in big-endian order.** @param i the 16-bit integer.** @return this buffer.*/util.ByteStringBuffer.prototype.putInt16 = function(i) {return this.putBytes(String.fromCharCode(i >> 8 & 0xFF) +String.fromCharCode(i & 0xFF));};/*** Puts a 24-bit integer in this buffer in big-endian order.** @param i the 24-bit integer.** @return this buffer.*/util.ByteStringBuffer.prototype.putInt24 = function(i) {return this.putBytes(String.fromCharCode(i >> 16 & 0xFF) +String.fromCharCode(i >> 8 & 0xFF) +String.fromCharCode(i & 0xFF));};/*** Puts a 32-bit integer in this buffer in big-endian order.** @param i the 32-bit integer.** @return this buffer.*/util.ByteStringBuffer.prototype.putInt32 = function(i) {return this.putBytes(String.fromCharCode(i >> 24 & 0xFF) +String.fromCharCode(i >> 16 & 0xFF) +String.fromCharCode(i >> 8 & 0xFF) +String.fromCharCode(i & 0xFF));};/*** Puts a 16-bit integer in this buffer in little-endian order.** @param i the 16-bit integer.** @return this buffer.*/util.ByteStringBuffer.prototype.putInt16Le = function(i) {return this.putBytes(String.fromCharCode(i & 0xFF) +String.fromCharCode(i >> 8 & 0xFF));};/*** Puts a 24-bit integer in this buffer in little-endian order.** @param i the 24-bit integer.** @return this buffer.*/util.ByteStringBuffer.prototype.putInt24Le = function(i) {return this.putBytes(String.fromCharCode(i & 0xFF) +String.fromCharCode(i >> 8 & 0xFF) +String.fromCharCode(i >> 16 & 0xFF));};/*** Puts a 32-bit integer in this buffer in little-endian order.** @param i the 32-bit integer.** @return this buffer.*/util.ByteStringBuffer.prototype.putInt32Le = function(i) {return this.putBytes(String.fromCharCode(i & 0xFF) +String.fromCharCode(i >> 8 & 0xFF) +String.fromCharCode(i >> 16 & 0xFF) +String.fromCharCode(i >> 24 & 0xFF));};/*** Puts an n-bit integer in this buffer in big-endian order.** @param i the n-bit integer.* @param n the number of bits in the integer (8, 16, 24, or 32).** @return this buffer.*/util.ByteStringBuffer.prototype.putInt = function(i, n) {_checkBitsParam(n);var bytes = '';do {n -= 8;bytes += String.fromCharCode((i >> n) & 0xFF);} while(n > 0);return this.putBytes(bytes);};/*** Puts a signed n-bit integer in this buffer in big-endian order. Two's* complement representation is used.** @param i the n-bit integer.* @param n the number of bits in the integer (8, 16, 24, or 32).** @return this buffer.*/util.ByteStringBuffer.prototype.putSignedInt = function(i, n) {// putInt checks nif(i < 0) {i += 2 << (n - 1);}return this.putInt(i, n);};/*** Puts the given buffer into this buffer.** @param buffer the buffer to put into this one.** @return this buffer.*/util.ByteStringBuffer.prototype.putBuffer = function(buffer) {return this.putBytes(buffer.getBytes());};/*** Gets a byte from this buffer and advances the read pointer by 1.** @return the byte.*/util.ByteStringBuffer.prototype.getByte = function() {return this.data.charCodeAt(this.read++);};/*** Gets a uint16 from this buffer in big-endian order and advances the read* pointer by 2.** @return the uint16.*/util.ByteStringBuffer.prototype.getInt16 = function() {var rval = (this.data.charCodeAt(this.read) << 8 ^this.data.charCodeAt(this.read + 1));this.read += 2;return rval;};/*** Gets a uint24 from this buffer in big-endian order and advances the read* pointer by 3.** @return the uint24.*/util.ByteStringBuffer.prototype.getInt24 = function() {var rval = (this.data.charCodeAt(this.read) << 16 ^this.data.charCodeAt(this.read + 1) << 8 ^this.data.charCodeAt(this.read + 2));this.read += 3;return rval;};/*** Gets a uint32 from this buffer in big-endian order and advances the read* pointer by 4.** @return the word.*/util.ByteStringBuffer.prototype.getInt32 = function() {var rval = (this.data.charCodeAt(this.read) << 24 ^this.data.charCodeAt(this.read + 1) << 16 ^this.data.charCodeAt(this.read + 2) << 8 ^this.data.charCodeAt(this.read + 3));this.read += 4;return rval;};/*** Gets a uint16 from this buffer in little-endian order and advances the read* pointer by 2.** @return the uint16.*/util.ByteStringBuffer.prototype.getInt16Le = function() {var rval = (this.data.charCodeAt(this.read) ^this.data.charCodeAt(this.read + 1) << 8);this.read += 2;return rval;};/*** Gets a uint24 from this buffer in little-endian order and advances the read* pointer by 3.** @return the uint24.*/util.ByteStringBuffer.prototype.getInt24Le = function() {var rval = (this.data.charCodeAt(this.read) ^this.data.charCodeAt(this.read + 1) << 8 ^this.data.charCodeAt(this.read + 2) << 16);this.read += 3;return rval;};/*** Gets a uint32 from this buffer in little-endian order and advances the read* pointer by 4.** @return the word.*/util.ByteStringBuffer.prototype.getInt32Le = function() {var rval = (this.data.charCodeAt(this.read) ^this.data.charCodeAt(this.read + 1) << 8 ^this.data.charCodeAt(this.read + 2) << 16 ^this.data.charCodeAt(this.read + 3) << 24);this.read += 4;return rval;};/*** Gets an n-bit integer from this buffer in big-endian order and advances the* read pointer by ceil(n/8).** @param n the number of bits in the integer (8, 16, 24, or 32).** @return the integer.*/util.ByteStringBuffer.prototype.getInt = function(n) {_checkBitsParam(n);var rval = 0;do {// TODO: Use (rval * 0x100) if adding support for 33 to 53 bits.rval = (rval << 8) + this.data.charCodeAt(this.read++);n -= 8;} while(n > 0);return rval;};/*** Gets a signed n-bit integer from this buffer in big-endian order, using* two's complement, and advances the read pointer by n/8.** @param n the number of bits in the integer (8, 16, 24, or 32).** @return the integer.*/util.ByteStringBuffer.prototype.getSignedInt = function(n) {// getInt checks nvar x = this.getInt(n);var max = 2 << (n - 2);if(x >= max) {x -= max << 1;}return x;};/*** Reads bytes out into a UTF-8 string and clears them from the buffer.** @param count the number of bytes to read, undefined or null for all.** @return a UTF-8 string of bytes.*/util.ByteStringBuffer.prototype.getBytes = function(count) {var rval;if(count) {// read count bytescount = Math.min(this.length(), count);rval = this.data.slice(this.read, this.read + count);this.read += count;} else if(count === 0) {rval = '';} else {// read all bytes, optimize to only copy when neededrval = (this.read === 0) ? this.data : this.data.slice(this.read);this.clear();}return rval;};/*** Gets a UTF-8 encoded string of the bytes from this buffer without modifying* the read pointer.** @param count the number of bytes to get, omit to get all.** @return a string full of UTF-8 encoded characters.*/util.ByteStringBuffer.prototype.bytes = function(count) {return (typeof(count) === 'undefined' ?this.data.slice(this.read) :this.data.slice(this.read, this.read + count));};/*** Gets a byte at the given index without modifying the read pointer.** @param i the byte index.** @return the byte.*/util.ByteStringBuffer.prototype.at = function(i) {return this.data.charCodeAt(this.read + i);};/*** Puts a byte at the given index without modifying the read pointer.** @param i the byte index.* @param b the byte to put.** @return this buffer.*/util.ByteStringBuffer.prototype.setAt = function(i, b) {this.data = this.data.substr(0, this.read + i) +String.fromCharCode(b) +this.data.substr(this.read + i + 1);return this;};/*** Gets the last byte without modifying the read pointer.** @return the last byte.*/util.ByteStringBuffer.prototype.last = function() {return this.data.charCodeAt(this.data.length - 1);};/*** Creates a copy of this buffer.** @return the copy.*/util.ByteStringBuffer.prototype.copy = function() {var c = util.createBuffer(this.data);c.read = this.read;return c;};/*** Compacts this buffer.** @return this buffer.*/util.ByteStringBuffer.prototype.compact = function() {if(this.read > 0) {this.data = this.data.slice(this.read);this.read = 0;}return this;};/*** Clears this buffer.** @return this buffer.*/util.ByteStringBuffer.prototype.clear = function() {this.data = '';this.read = 0;return this;};/*** Shortens this buffer by triming bytes off of the end of this buffer.** @param count the number of bytes to trim off.** @return this buffer.*/util.ByteStringBuffer.prototype.truncate = function(count) {var len = Math.max(0, this.length() - count);this.data = this.data.substr(this.read, len);this.read = 0;return this;};/*** Converts this buffer to a hexadecimal string.** @return a hexadecimal string.*/util.ByteStringBuffer.prototype.toHex = function() {var rval = '';for(var i = this.read; i < this.data.length; ++i) {var b = this.data.charCodeAt(i);if(b < 16) {rval += '0';}rval += b.toString(16);}return rval;};/*** Converts this buffer to a UTF-16 string (standard JavaScript string).** @return a UTF-16 string.*/util.ByteStringBuffer.prototype.toString = function() {return util.decodeUtf8(this.bytes());};/** End Buffer w/BinaryString backing *//** Buffer w/UInt8Array backing *//*** FIXME: Experimental. Do not use yet.** Constructor for an ArrayBuffer-backed byte buffer.** The buffer may be constructed from a string, an ArrayBuffer, DataView, or a* TypedArray.** If a string is given, its encoding should be provided as an option,* otherwise it will default to 'binary'. A 'binary' string is encoded such* that each character is one byte in length and size.** If an ArrayBuffer, DataView, or TypedArray is given, it will be used* *directly* without any copying. Note that, if a write to the buffer requires* more space, the buffer will allocate a new backing ArrayBuffer to* accommodate. The starting read and write offsets for the buffer may be* given as options.** @param [b] the initial bytes for this buffer.* @param options the options to use:*          [readOffset] the starting read offset to use (default: 0).*          [writeOffset] the starting write offset to use (default: the*            length of the first parameter).*          [growSize] the minimum amount, in bytes, to grow the buffer by to*            accommodate writes (default: ####).*          [encoding] the encoding ('binary', 'utf8', 'utf16', 'hex') for the*            first parameter, if it is a string (default: 'binary').*/function DataBuffer(b, options) {// default optionsoptions = options || {};// pointers for read from/write to bufferthis.read = options.readOffset || 0;this.growSize = options.growSize || ####;var isArrayBuffer = util.isArrayBuffer(b);var isArrayBufferView = util.isArrayBufferView(b);if(isArrayBuffer || isArrayBufferView) {// use ArrayBuffer directlyif(isArrayBuffer) {this.data = new DataView(b);} else {// TODO: adjust read/write offset based on the type of view// or specify that this must be done in the options ... that the// offsets are byte-basedthis.data = new DataView(b.buffer, b.byteOffset, b.byteLength);}this.write = ('writeOffset' in options ?options.writeOffset : this.data.byteLength);return;}// initialize to empty array buffer and add any given bytes using putBytesthis.data = new DataView(new ArrayBuffer(0));this.write = 0;if(b !== null && b !== undefined) {this.putBytes(b);}if('writeOffset' in options) {this.write = options.writeOffset;}}util.DataBuffer = DataBuffer;/*** Gets the number of bytes in this buffer.** @return the number of bytes in this buffer.*/util.DataBuffer.prototype.length = function() {return this.write - this.read;};/*** Gets whether or not this buffer is empty.** @return true if this buffer is empty, false if not.*/util.DataBuffer.prototype.isEmpty = function() {return this.length() <= 0;};/*** Ensures this buffer has enough empty space to accommodate the given number* of bytes. An optional parameter may be given that indicates a minimum* amount to grow the buffer if necessary. If the parameter is not given,* the buffer will be grown by some previously-specified default amount* or heuristic.** @param amount the number of bytes to accommodate.* @param [growSize] the minimum amount, in bytes, to grow the buffer by if*          necessary.*/util.DataBuffer.prototype.accommodate = function(amount, growSize) {if(this.length() >= amount) {return this;}growSize = Math.max(growSize || this.growSize, amount);// grow buffervar src = new Uint8Array(this.data.buffer, this.data.byteOffset, this.data.byteLength);var dst = new Uint8Array(this.length() + growSize);dst.set(src);this.data = new DataView(dst.buffer);return this;};/*** Puts a byte in this buffer.** @param b the byte to put.** @return this buffer.*/util.DataBuffer.prototype.putByte = function(b) {this.accommodate(1);this.data.setUint8(this.write++, b);return this;};/*** Puts a byte in this buffer N times.** @param b the byte to put.* @param n the number of bytes of value b to put.** @return this buffer.*/util.DataBuffer.prototype.fillWithByte = function(b, n) {this.accommodate(n);for(var i = 0; i < n; ++i) {this.data.setUint8(b);}return this;};/*** Puts bytes in this buffer. The bytes may be given as a string, an* ArrayBuffer, a DataView, or a TypedArray.** @param bytes the bytes to put.* @param [encoding] the encoding for the first parameter ('binary', 'utf8',*          'utf16', 'hex'), if it is a string (default: 'binary').** @return this buffer.*/util.DataBuffer.prototype.putBytes = function(bytes, encoding) {if(util.isArrayBufferView(bytes)) {var src = new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);var len = src.byteLength - src.byteOffset;this.accommodate(len);var dst = new Uint8Array(this.data.buffer, this.write);dst.set(src);this.write += len;return this;}if(util.isArrayBuffer(bytes)) {var src = new Uint8Array(bytes);this.accommodate(src.byteLength);var dst = new Uint8Array(this.data.buffer);dst.set(src, this.write);this.write += src.byteLength;return this;}// bytes is a util.DataBuffer or equivalentif(bytes instanceof util.DataBuffer ||(typeof bytes === 'object' &&typeof bytes.read === 'number' && typeof bytes.write === 'number' &&util.isArrayBufferView(bytes.data))) {var src = new Uint8Array(bytes.data.byteLength, bytes.read, bytes.length());this.accommodate(src.byteLength);var dst = new Uint8Array(bytes.data.byteLength, this.write);dst.set(src);this.write += src.byteLength;return this;}if(bytes instanceof util.ByteStringBuffer) {// copy binary string and process as the same as a string parameter belowbytes = bytes.data;encoding = 'binary';}// string conversionencoding = encoding || 'binary';if(typeof bytes === 'string') {var view;// decode from stringif(encoding === 'hex') {this.accommodate(Math.ceil(bytes.length / 2));view = new Uint8Array(this.data.buffer, this.write);this.write += util.binary.hex.decode(bytes, view, this.write);return this;}if(encoding === 'base64') {this.accommodate(Math.ceil(bytes.length / 4) * 3);view = new Uint8Array(this.data.buffer, this.write);this.write += util.binary.base64.decode(bytes, view, this.write);return this;}// encode text as UTF-8 bytesif(encoding === 'utf8') {// encode as UTF-8 then decode string as raw binarybytes = util.encodeUtf8(bytes);encoding = 'binary';}// decode string as raw binaryif(encoding === 'binary' || encoding === 'raw') {// one byte per characterthis.accommodate(bytes.length);view = new Uint8Array(this.data.buffer, this.write);this.write += util.binary.raw.decode(view);return this;}// encode text as UTF-16 bytesif(encoding === 'utf16') {// two bytes per characterthis.accommodate(bytes.length * 2);view = new Uint16Array(this.data.buffer, this.write);this.write += util.text.utf16.encode(view);return this;}throw new Error('Invalid encoding: ' + encoding);}throw Error('Invalid parameter: ' + bytes);};/*** Puts the given buffer into this buffer.** @param buffer the buffer to put into this one.** @return this buffer.*/util.DataBuffer.prototype.putBuffer = function(buffer) {this.putBytes(buffer);buffer.clear();return this;};/*** Puts a string into this buffer.** @param str the string to put.* @param [encoding] the encoding for the string (default: 'utf16').** @return this buffer.*/util.DataBuffer.prototype.putString = function(str) {return this.putBytes(str, 'utf16');};/*** Puts a 16-bit integer in this buffer in big-endian order.** @param i the 16-bit integer.** @return this buffer.*/util.DataBuffer.prototype.putInt16 = function(i) {this.accommodate(2);this.data.setInt16(this.write, i);this.write += 2;return this;};/*** Puts a 24-bit integer in this buffer in big-endian order.** @param i the 24-bit integer.** @return this buffer.*/util.DataBuffer.prototype.putInt24 = function(i) {this.accommodate(3);this.data.setInt16(this.write, i >> 8 & 0xFFFF);this.data.setInt8(this.write, i >> 16 & 0xFF);this.write += 3;return this;};/*** Puts a 32-bit integer in this buffer in big-endian order.** @param i the 32-bit integer.** @return this buffer.*/util.DataBuffer.prototype.putInt32 = function(i) {this.accommodate(4);this.data.setInt32(this.write, i);this.write += 4;return this;};/*** Puts a 16-bit integer in this buffer in little-endian order.** @param i the 16-bit integer.** @return this buffer.*/util.DataBuffer.prototype.putInt16Le = function(i) {this.accommodate(2);this.data.setInt16(this.write, i, true);this.write += 2;return this;};/*** Puts a 24-bit integer in this buffer in little-endian order.** @param i the 24-bit integer.** @return this buffer.*/util.DataBuffer.prototype.putInt24Le = function(i) {this.accommodate(3);this.data.setInt8(this.write, i >> 16 & 0xFF);this.data.setInt16(this.write, i >> 8 & 0xFFFF, true);this.write += 3;return this;};/*** Puts a 32-bit integer in this buffer in little-endian order.** @param i the 32-bit integer.** @return this buffer.*/util.DataBuffer.prototype.putInt32Le = function(i) {this.accommodate(4);this.data.setInt32(this.write, i, true);this.write += 4;return this;};/*** Puts an n-bit integer in this buffer in big-endian order.** @param i the n-bit integer.* @param n the number of bits in the integer (8, 16, 24, or 32).** @return this buffer.*/util.DataBuffer.prototype.putInt = function(i, n) {_checkBitsParam(n);this.accommodate(n / 8);do {n -= 8;this.data.setInt8(this.write++, (i >> n) & 0xFF);} while(n > 0);return this;};/*** Puts a signed n-bit integer in this buffer in big-endian order. Two's* complement representation is used.** @param i the n-bit integer.* @param n the number of bits in the integer.** @return this buffer.*/util.DataBuffer.prototype.putSignedInt = function(i, n) {_checkBitsParam(n);this.accommodate(n / 8);if(i < 0) {i += 2 << (n - 1);}return this.putInt(i, n);};/*** Gets a byte from this buffer and advances the read pointer by 1.** @return the byte.*/util.DataBuffer.prototype.getByte = function() {return this.data.getInt8(this.read++);};/*** Gets a uint16 from this buffer in big-endian order and advances the read* pointer by 2.** @return the uint16.*/util.DataBuffer.prototype.getInt16 = function() {var rval = this.data.getInt16(this.read);this.read += 2;return rval;};/*** Gets a uint24 from this buffer in big-endian order and advances the read* pointer by 3.** @return the uint24.*/util.DataBuffer.prototype.getInt24 = function() {var rval = (this.data.getInt16(this.read) << 8 ^this.data.getInt8(this.read + 2));this.read += 3;return rval;};/*** Gets a uint32 from this buffer in big-endian order and advances the read* pointer by 4.** @return the word.*/util.DataBuffer.prototype.getInt32 = function() {var rval = this.data.getInt32(this.read);this.read += 4;return rval;};/*** Gets a uint16 from this buffer in little-endian order and advances the read* pointer by 2.** @return the uint16.*/util.DataBuffer.prototype.getInt16Le = function() {var rval = this.data.getInt16(this.read, true);this.read += 2;return rval;};/*** Gets a uint24 from this buffer in little-endian order and advances the read* pointer by 3.** @return the uint24.*/util.DataBuffer.prototype.getInt24Le = function() {var rval = (this.data.getInt8(this.read) ^this.data.getInt16(this.read + 1, true) << 8);this.read += 3;return rval;};/*** Gets a uint32 from this buffer in little-endian order and advances the read* pointer by 4.** @return the word.*/util.DataBuffer.prototype.getInt32Le = function() {var rval = this.data.getInt32(this.read, true);this.read += 4;return rval;};/*** Gets an n-bit integer from this buffer in big-endian order and advances the* read pointer by n/8.** @param n the number of bits in the integer (8, 16, 24, or 32).** @return the integer.*/util.DataBuffer.prototype.getInt = function(n) {_checkBitsParam(n);var rval = 0;do {// TODO: Use (rval * 0x100) if adding support for 33 to 53 bits.rval = (rval << 8) + this.data.getInt8(this.read++);n -= 8;} while(n > 0);return rval;};/*** Gets a signed n-bit integer from this buffer in big-endian order, using* two's complement, and advances the read pointer by n/8.** @param n the number of bits in the integer (8, 16, 24, or 32).** @return the integer.*/util.DataBuffer.prototype.getSignedInt = function(n) {// getInt checks nvar x = this.getInt(n);var max = 2 << (n - 2);if(x >= max) {x -= max << 1;}return x;};/*** Reads bytes out into a UTF-8 string and clears them from the buffer.** @param count the number of bytes to read, undefined or null for all.** @return a UTF-8 string of bytes.*/util.DataBuffer.prototype.getBytes = function(count) {// TODO: deprecate this method, it is poorly named and// this.toString('binary') replaces it// add a toTypedArray()/toArrayBuffer() functionvar rval;if(count) {// read count bytescount = Math.min(this.length(), count);rval = this.data.slice(this.read, this.read + count);this.read += count;} else if(count === 0) {rval = '';} else {// read all bytes, optimize to only copy when neededrval = (this.read === 0) ? this.data : this.data.slice(this.read);this.clear();}return rval;};/*** Gets a UTF-8 encoded string of the bytes from this buffer without modifying* the read pointer.** @param count the number of bytes to get, omit to get all.** @return a string full of UTF-8 encoded characters.*/util.DataBuffer.prototype.bytes = function(count) {// TODO: deprecate this method, it is poorly named, add "getString()"return (typeof(count) === 'undefined' ?this.data.slice(this.read) :this.data.slice(this.read, this.read + count));};/*** Gets a byte at the given index without modifying the read pointer.** @param i the byte index.** @return the byte.*/util.DataBuffer.prototype.at = function(i) {return this.data.getUint8(this.read + i);};/*** Puts a byte at the given index without modifying the read pointer.** @param i the byte index.* @param b the byte to put.** @return this buffer.*/util.DataBuffer.prototype.setAt = function(i, b) {this.data.setUint8(i, b);return this;};/*** Gets the last byte without modifying the read pointer.** @return the last byte.*/util.DataBuffer.prototype.last = function() {return this.data.getUint8(this.write - 1);};/*** Creates a copy of this buffer.** @return the copy.*/util.DataBuffer.prototype.copy = function() {return new util.DataBuffer(this);};/*** Compacts this buffer.** @return this buffer.*/util.DataBuffer.prototype.compact = function() {if(this.read > 0) {var src = new Uint8Array(this.data.buffer, this.read);var dst = new Uint8Array(src.byteLength);dst.set(src);this.data = new DataView(dst);this.write -= this.read;this.read = 0;}return this;};/*** Clears this buffer.** @return this buffer.*/util.DataBuffer.prototype.clear = function() {this.data = new DataView(new ArrayBuffer(0));this.read = this.write = 0;return this;};/*** Shortens this buffer by triming bytes off of the end of this buffer.** @param count the number of bytes to trim off.** @return this buffer.*/util.DataBuffer.prototype.truncate = function(count) {this.write = Math.max(0, this.length() - count);this.read = Math.min(this.read, this.write);return this;};/*** Converts this buffer to a hexadecimal string.** @return a hexadecimal string.*/util.DataBuffer.prototype.toHex = function() {var rval = '';for(var i = this.read; i < this.data.byteLength; ++i) {var b = this.data.getUint8(i);if(b < 16) {rval += '0';}rval += b.toString(16);}return rval;};/*** Converts this buffer to a string, using the given encoding. If no* encoding is given, 'utf8' (UTF-8) is used.** @param [encoding] the encoding to use: 'binary', 'utf8', 'utf16', 'hex',*          'base64' (default: 'utf8').** @return a string representation of the bytes in this buffer.*/util.DataBuffer.prototype.toString = function(encoding) {var view = new Uint8Array(this.data, this.read, this.length());encoding = encoding || 'utf8';// encode to stringif(encoding === 'binary' || encoding === 'raw') {return util.binary.raw.encode(view);}if(encoding === 'hex') {return util.binary.hex.encode(view);}if(encoding === 'base64') {return util.binary.base64.encode(view);}// decode to textif(encoding === 'utf8') {return util.text.utf8.decode(view);}if(encoding === 'utf16') {return util.text.utf16.decode(view);}throw new Error('Invalid encoding: ' + encoding);};/** End Buffer w/UInt8Array backing *//*** Creates a buffer that stores bytes. A value may be given to put into the* buffer that is either a string of bytes or a UTF-16 string that will* be encoded using UTF-8 (to do the latter, specify 'utf8' as the encoding).** @param [input] the bytes to wrap (as a string) or a UTF-16 string to encode*          as UTF-8.* @param [encoding] (default: 'raw', other: 'utf8').*/util.createBuffer = function(input, encoding) {// TODO: deprecate, use new ByteBuffer() insteadencoding = encoding || 'raw';if(input !== undefined && encoding === 'utf8') {input = util.encodeUtf8(input);}return new util.ByteBuffer(input);};/*** Fills a string with a particular value. If you want the string to be a byte* string, pass in String.fromCharCode(theByte).** @param c the character to fill the string with, use String.fromCharCode*          to fill the string with a byte value.* @param n the number of characters of value c to fill with.** @return the filled string.*/util.fillString = function(c, n) {var s = '';while(n > 0) {if(n & 1) {s += c;}n >>>= 1;if(n > 0) {c += c;}}return s;};/*** Performs a per byte XOR between two byte strings and returns the r###lt as a* string of bytes.** @param s1 first string of bytes.* @param s2 second string of bytes.* @param n the number of bytes to XOR.** @return the XOR'd r###lt.*/util.xorBytes = function(s1, s2, n) {var s3 = '';var b = '';var t = '';var i = 0;var c = 0;for(; n > 0; --n, ++i) {b = s1.charCodeAt(i) ^ s2.charCodeAt(i);if(c >= 10) {s3 += t;t = '';c = 0;}t += String.fromCharCode(b);++c;}s3 += t;return s3;};/*** Converts a hex string into a 'binary' encoded string of bytes.** @param hex the hexadecimal string to convert.** @return the binary-encoded string of bytes.*/util.hexToBytes = function(hex) {// TODO: deprecate: "Deprecated. Use util.binary.hex.decode instead."var rval = '';var i = 0;if(hex.length & 1 == 1) {// odd number of characters, convert first character alonei = 1;rval += String.fromCharCode(parseInt(hex[0], 16));}// convert 2 characters (1 byte) at a timefor(; i < hex.length; i += 2) {rval += String.fromCharCode(parseInt(hex.substr(i, 2), 16));}return rval;};/*** Converts a 'binary' encoded string of bytes to hex.** @param bytes the byte string to convert.** @return the string of hexadecimal characters.*/util.bytesToHex = function(bytes) {// TODO: deprecate: "Deprecated. Use util.binary.hex.encode instead."return util.createBuffer(bytes).toHex();};/*** Converts an 32-bit integer to 4-big-endian byte string.** @param i the integer.** @return the byte string.*/util.int32ToBytes = function(i) {return (String.fromCharCode(i >> 24 & 0xFF) +String.fromCharCode(i >> 16 & 0xFF) +String.fromCharCode(i >> 8 & 0xFF) +String.fromCharCode(i & 0xFF));};// base64 characters, reverse mappingvar _base64 ='ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';var _base64Idx = [/*43 -43 = 0*//*'+',  1,  2,  3,'/' */62, -1, -1, -1, 63,/*'0','1','2','3','4','5','6','7','8','9' */52, 53, 54, 55, 56, 57, 58, 59, 60, 61,/*15, 16, 17,'=', 19, 20, 21 */-1, -1, -1, 64, -1, -1, -1,/*65 - 43 = 22*//*'A','B','C','D','E','F','G','H','I','J','K','L','M', */0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12,/*'N','O','P','Q','R','S','T','U','V','W','X','Y','Z' */13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,/*91 - 43 = 48 *//*48, 49, 50, 51, 52, 53 */-1, -1, -1, -1, -1, -1,/*97 - 43 = 54*//*'a','b','c','d','e','f','g','h','i','j','k','l','m' */26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38,/*'n','o','p','q','r','s','t','u','v','w','x','y','z' */39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51];// base58 characters (Bitcoin alphabet)var _base58 = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';/*** Base64 encodes a 'binary' encoded string of bytes.** @param input the binary encoded string of bytes to base64-encode.* @param maxline the maximum number of encoded characters per line to use,*          defaults to none.** @return the base64-encoded output.*/util.encode64 = function(input, maxline) {// TODO: deprecate: "Deprecated. Use util.binary.base64.encode instead."var line = '';var output = '';var chr1, chr2, chr3;var i = 0;while(i < input.length) {chr1 = input.charCodeAt(i++);chr2 = input.charCodeAt(i++);chr3 = input.charCodeAt(i++);// encode 4 character groupline += _base64.charAt(chr1 >> 2);line += _base64.charAt(((chr1 & 3) << 4) | (chr2 >> 4));if(isNaN(chr2)) {line += '==';} else {line += _base64.charAt(((chr2 & 15) << 2) | (chr3 >> 6));line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);}if(maxline && line.length > maxline) {output += line.substr(0, maxline) + '\r\n';line = line.substr(maxline);}}output += line;return output;};/*** Base64 decodes a string into a 'binary' encoded string of bytes.** @param input the base64-encoded input.** @return the binary encoded string.*/util.decode64 = function(input) {// TODO: deprecate: "Deprecated. Use util.binary.base64.decode instead."// remove all non-base64 charactersinput = input.replace(/[^A-Za-z0-9\+\/\=]/g, '');var output = '';var enc1, enc2, enc3, enc4;var i = 0;while(i < input.length) {enc1 = _base64Idx[input.charCodeAt(i++) - 43];enc2 = _base64Idx[input.charCodeAt(i++) - 43];enc3 = _base64Idx[input.charCodeAt(i++) - 43];enc4 = _base64Idx[input.charCodeAt(i++) - 43];output += String.fromCharCode((enc1 << 2) | (enc2 >> 4));if(enc3 !== 64) {// decoded at least 2 bytesoutput += String.fromCharCode(((enc2 & 15) << 4) | (enc3 >> 2));if(enc4 !== 64) {// decoded 3 bytesoutput += String.fromCharCode(((enc3 & 3) << 6) | enc4);}}}return output;};/*** UTF-8 encodes the given UTF-16 encoded string (a standard JavaScript* string). Non-ASCII characters will be encoded as multiple bytes according* to UTF-8.** @param str the string to encode.** @return the UTF-8 encoded string.*/util.encodeUtf8 = function(str) {return unescape(encodeURIComponent(str));};/*** Decodes a UTF-8 encoded string into a UTF-16 string.** @param str the string to decode.** @return the UTF-16 encoded string (standard JavaScript string).*/util.decodeUtf8 = function(str) {return decodeURIComponent(escape(str));};// binary encoding/decoding tools// FIXME: Experimental. Do not use yet.util.binary = {raw: {},hex: {},base64: {},base58: {},baseN : {encode: baseN.encode,decode: baseN.decode}};/*** Encodes a Uint8Array as a binary-encoded string. This encoding uses* a value between 0 and 255 for each character.** @param bytes the Uint8Array to encode.** @return the binary-encoded string.*/util.binary.raw.encode = function(bytes) {return String.fromCharCode.apply(null, bytes);};/*** Decodes a binary-encoded string to a Uint8Array. This encoding uses* a value between 0 and 255 for each character.** @param str the binary-encoded string to decode.* @param [output] an optional Uint8Array to write the output to; if it*          is too small, an exception will be thrown.* @param [offset] the start offset for writing to the output (default: 0).** @return the Uint8Array or the number of bytes written if output was given.*/util.binary.raw.decode = function(str, output, offset) {var out = output;if(!out) {out = new Uint8Array(str.length);}offset = offset || 0;var j = offset;for(var i = 0; i < str.length; ++i) {out[j++] = str.charCodeAt(i);}return output ? (j - offset) : out;};/*** Encodes a 'binary' string, ArrayBuffer, DataView, TypedArray, or* ByteBuffer as a string of hexadecimal characters.** @param bytes the bytes to convert.** @return the string of hexadecimal characters.*/util.binary.hex.encode = util.bytesToHex;/*** Decodes a hex-encoded string to a Uint8Array.** @param hex the hexadecimal string to convert.* @param [output] an optional Uint8Array to write the output to; if it*          is too small, an exception will be thrown.* @param [offset] the start offset for writing to the output (default: 0).** @return the Uint8Array or the number of bytes written if output was given.*/util.binary.hex.decode = function(hex, output, offset) {var out = output;if(!out) {out = new Uint8Array(Math.ceil(hex.length / 2));}offset = offset || 0;var i = 0, j = offset;if(hex.length & 1) {// odd number of characters, convert first character alonei = 1;out[j++] = parseInt(hex[0], 16);}// convert 2 characters (1 byte) at a timefor(; i < hex.length; i += 2) {out[j++] = parseInt(hex.substr(i, 2), 16);}return output ? (j - offset) : out;};/*** Base64-encodes a Uint8Array.** @param input the Uint8Array to encode.* @param maxline the maximum number of encoded characters per line to use,*          defaults to none.** @return the base64-encoded output string.*/util.binary.base64.encode = function(input, maxline) {var line = '';var output = '';var chr1, chr2, chr3;var i = 0;while(i < input.byteLength) {chr1 = input[i++];chr2 = input[i++];chr3 = input[i++];// encode 4 character groupline += _base64.charAt(chr1 >> 2);line += _base64.charAt(((chr1 & 3) << 4) | (chr2 >> 4));if(isNaN(chr2)) {line += '==';} else {line += _base64.charAt(((chr2 & 15) << 2) | (chr3 >> 6));line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);}if(maxline && line.length > maxline) {output += line.substr(0, maxline) + '\r\n';line = line.substr(maxline);}}output += line;return output;};/*** Decodes a base64-encoded string to a Uint8Array.** @param input the base64-encoded input string.* @param [output] an optional Uint8Array to write the output to; if it*          is too small, an exception will be thrown.* @param [offset] the start offset for writing to the output (default: 0).** @return the Uint8Array or the number of bytes written if output was given.*/util.binary.base64.decode = function(input, output, offset) {var out = output;if(!out) {out = new Uint8Array(Math.ceil(input.length / 4) * 3);}// remove all non-base64 charactersinput = input.replace(/[^A-Za-z0-9\+\/\=]/g, '');offset = offset || 0;var enc1, enc2, enc3, enc4;var i = 0, j = offset;while(i < input.length) {enc1 = _base64Idx[input.charCodeAt(i++) - 43];enc2 = _base64Idx[input.charCodeAt(i++) - 43];enc3 = _base64Idx[input.charCodeAt(i++) - 43];enc4 = _base64Idx[input.charCodeAt(i++) - 43];out[j++] = (enc1 << 2) | (enc2 >> 4);if(enc3 !== 64) {// decoded at least 2 bytesout[j++] = ((enc2 & 15) << 4) | (enc3 >> 2);if(enc4 !== 64) {// decoded 3 bytesout[j++] = ((enc3 & 3) << 6) | enc4;}}}// make sure r###lt is the exact decoded lengthreturn output ? (j - offset) : out.subarray(0, j);};// add support for base58 encoding/decoding with Bitcoin alphabetutil.binary.base58.encode = function(input, maxline) {return util.binary.baseN.encode(input, _base58, maxline);};util.binary.base58.decode = function(input, maxline) {return util.binary.baseN.decode(input, _base58, maxline);};// text encoding/decoding tools// FIXME: Experimental. Do not use yet.util.text = {utf8: {},utf16: {}};/*** Encodes the given string as UTF-8 in a Uint8Array.** @param str the string to encode.* @param [output] an optional Uint8Array to write the output to; if it*          is too small, an exception will be thrown.* @param [offset] the start offset for writing to the output (default: 0).** @return the Uint8Array or the number of bytes written if output was given.*/util.text.utf8.encode = function(str, output, offset) {str = util.encodeUtf8(str);var out = output;if(!out) {out = new Uint8Array(str.length);}offset = offset || 0;var j = offset;for(var i = 0; i < str.length; ++i) {out[j++] = str.charCodeAt(i);}return output ? (j - offset) : out;};/*** Decodes the UTF-8 contents from a Uint8Array.** @param bytes the Uint8Array to decode.** @return the r###lting string.*/util.text.utf8.decode = function(bytes) {return util.decodeUtf8(String.fromCharCode.apply(null, bytes));};/*** Encodes the given string as UTF-16 in a Uint8Array.** @param str the string to encode.* @param [output] an optional Uint8Array to write the output to; if it*          is too small, an exception will be thrown.* @param [offset] the start offset for writing to the output (default: 0).** @return the Uint8Array or the number of bytes written if output was given.*/util.text.utf16.encode = function(str, output, offset) {var out = output;if(!out) {out = new Uint8Array(str.length * 2);}var view = new Uint16Array(out.buffer);offset = offset || 0;var j = offset;var k = offset;for(var i = 0; i < str.length; ++i) {view[k++] = str.charCodeAt(i);j += 2;}return output ? (j - offset) : out;};/*** Decodes the UTF-16 contents from a Uint8Array.** @param bytes the Uint8Array to decode.** @return the r###lting string.*/util.text.utf16.decode = function(bytes) {return String.fromCharCode.apply(null, new Uint16Array(bytes.buffer));};/*** Deflates the given data using a flash interface.** @param api the flash interface.* @param bytes the data.* @param raw true to return only raw deflate data, false to include zlib*          header and trailer.** @return the deflated data as a string.*/util.deflate = function(api, bytes, raw) {bytes = util.decode64(api.deflate(util.encode64(bytes)).rval);// strip zlib header and trailer if necessaryif(raw) {// zlib header is 2 bytes (CMF,FLG) where FLG indicates that// there is a 4-byte DICT (alder-32) block before the data if// its 5th bit is setvar start = 2;var flg = bytes.charCodeAt(1);if(flg & 0x20) {start = 6;}// zlib trailer is 4 bytes of adler-32bytes = bytes.substring(start, bytes.length - 4);}return bytes;};/*** Inflates the given data using a flash interface.** @param api the flash interface.* @param bytes the data.* @param raw true if the incoming data has no zlib header or trailer and is*          raw DEFLATE data.** @return the inflated data as a string, null on error.*/util.inflate = function(api, bytes, raw) {// TODO: add zlib header and trailer if necessary/possiblevar rval = api.inflate(util.encode64(bytes)).rval;return (rval === null) ? null : util.decode64(rval);};/*** Sets a storage object.** @param api the storage interface.* @param id the storage ID to use.* @param obj the storage object, null to remove.*/var _setStorageObject = function(api, id, obj) {if(!api) {throw new Error('WebStorage not available.');}var rval;if(obj === null) {rval = api.removeItem(id);} else {// json-encode and base64-encode objectobj = util.encode64(JSON.stringify(obj));rval = api.setItem(id, obj);}// handle potential flash errorif(typeof(rval) !== 'undefined' && rval.rval !== true) {var error = new Error(rval.error.message);error.id = rval.error.id;error.name = rval.error.name;throw error;}};/*** Gets a storage object.** @param api the storage interface.* @param id the storage ID to use.** @return the storage object entry or null if none exists.*/var _getStorageObject = function(api, id) {if(!api) {throw new Error('WebStorage not available.');}// get the existing entryvar rval = api.getItem(id);/* Note: We check api.init because we can't do (api == localStorage)on IE because of "Class doesn't support Automation" exception. Onlythe flash api has an init method so this works too, but we need abetter solution in the future. */// flash returns item wrapped in an object, handle special caseif(api.init) {if(rval.rval === null) {if(rval.error) {var error = new Error(rval.error.message);error.id = rval.error.id;error.name = rval.error.name;throw error;}// no error, but also no itemrval = null;} else {rval = rval.rval;}}// handle decodingif(rval !== null) {// base64-decode and json-decode datarval = JSON.parse(util.decode64(rval));}return rval;};/*** Stores an item in local storage.** @param api the storage interface.* @param id the storage ID to use.* @param key the key for the item.* @param data the data for the item (any javascript object/primitive).*/var _setItem = function(api, id, key, data) {// get storage objectvar obj = _getStorageObject(api, id);if(obj === null) {// create a new storage objectobj = {};}// update keyobj[key] = data;// set storage object_setStorageObject(api, id, obj);};/*** Gets an item from local storage.** @param api the storage interface.* @param id the storage ID to use.* @param key the key for the item.** @return the item.*/var _getItem = function(api, id, key) {// get storage objectvar rval = _getStorageObject(api, id);if(rval !== null) {// return data at keyrval = (key in rval) ? rval[key] : null;}return rval;};/*** Removes an item from local storage.** @param api the storage interface.* @param id the storage ID to use.* @param key the key for the item.*/var _removeItem = function(api, id, key) {// get storage objectvar obj = _getStorageObject(api, id);if(obj !== null && key in obj) {// remove keydelete obj[key];// see if entry has no keys remainingvar empty = true;for(var prop in obj) {empty = false;break;}if(empty) {// remove entry entirely if no keys are leftobj = null;}// set storage object_setStorageObject(api, id, obj);}};/*** Clears the local disk storage identified by the given ID.** @param api the storage interface.* @param id the storage ID to use.*/var _clearItems = function(api, id) {_setStorageObject(api, id, null);};/*** Calls a storage function.** @param func the function to call.* @param args the arguments for the function.* @param location the location argument.** @return the return value from the function.*/var _callStorageFunction = function(func, args, location) {var rval = null;// default storage typesif(typeof(location) === 'undefined') {location = ['web', 'flash'];}// apply storage types in order of preferencevar type;var done = false;var exception = null;for(var idx in location) {type = location[idx];try {if(type === 'flash' || type === 'both') {if(args[0] === null) {throw new Error('Flash local storage not available.');}rval = func.apply(this, args);done = (type === 'flash');}if(type === 'web' || type === 'both') {args[0] = localStorage;rval = func.apply(this, args);done = true;}} catch(ex) {exception = ex;}if(done) {break;}}if(!done) {throw exception;}return rval;};/*** Stores an item on local disk.** The available types of local storage include 'flash', 'web', and 'both'.** The type 'flash' refers to flash local storage (SharedObject). In order* to use flash local storage, the 'api' parameter must be valid. The type* 'web' refers to WebStorage, if supported by the browser. The type 'both'* refers to storing using both 'flash' and 'web', not just one or the* other.** The location array should list the storage types to use in order of* preference:** ['flash']: flash only storage* ['web']: web only storage* ['both']: try to store in both* ['flash','web']: store in flash first, but if not available, 'web'* ['web','flash']: store in web first, but if not available, 'flash'** The location array defaults to: ['web', 'flash']** @param api the flash interface, null to use only WebStorage.* @param id the storage ID to use.* @param key the key for the item.* @param data the data for the item (any javascript object/primitive).* @param location an array with the preferred types of storage to use.*/util.setItem = function(api, id, key, data, location) {_callStorageFunction(_setItem, arguments, location);};/*** Gets an item on local disk.** Set setItem() for details on storage types.** @param api the flash interface, null to use only WebStorage.* @param id the storage ID to use.* @param key the key for the item.* @param location an array with the preferred types of storage to use.** @return the item.*/util.getItem = function(api, id, key, location) {return _callStorageFunction(_getItem, arguments, location);};/*** Removes an item on local disk.** Set setItem() for details on storage types.** @param api the flash interface.* @param id the storage ID to use.* @param key the key for the item.* @param location an array with the preferred types of storage to use.*/util.removeItem = function(api, id, key, location) {_callStorageFunction(_removeItem, arguments, location);};/*** Clears the local disk storage identified by the given ID.** Set setItem() for details on storage types.** @param api the flash interface if flash is available.* @param id the storage ID to use.* @param location an array with the preferred types of storage to use.*/util.clearItems = function(api, id, location) {_callStorageFunction(_clearItems, arguments, location);};/*** Parses the scheme, host, and port from an http(s) url.** @param str the url string.** @return the parsed url object or null if the url is invalid.*/util.parseUrl = function(str) {// FIXME: this regex looks a bit brokenvar regex = /^(https?):\/\/([^:&^\/]*):?(\d*)(.*)$/g;regex.lastIndex = 0;var m = regex.exec(str);var url = (m === null) ? null : {full: str,scheme: m[1],host: m[2],port: m[3],path: m[4]};if(url) {url.fullHost = url.host;if(url.port) {if(url.port !== 80 && url.scheme === 'http') {url.fullHost += ':' + url.port;} else if(url.port !== 443 && url.scheme === 'https') {url.fullHost += ':' + url.port;}} else if(url.scheme === 'http') {url.port = 80;} else if(url.scheme === 'https') {url.port = 443;}url.full = url.scheme + '://' + url.fullHost;}return url;};/* Storage for query variables */var _queryVariables = null;/*** Returns the window location query variables. Query is parsed on the first* call and the same object is returned on subsequent calls. The mapping* is from keys to an array of values. Parameters without values will have* an object key set but no value added to the value array. Values are* unescaped.** ...?k1=v1&k2=v2:* {*   "k1": ["v1"],*   "k2": ["v2"]* }** ...?k1=v1&k1=v2:* {*   "k1": ["v1", "v2"]* }** ...?k1=v1&k2:* {*   "k1": ["v1"],*   "k2": []* }** ...?k1=v1&k1:* {*   "k1": ["v1"]* }** ...?k1&k1:* {*   "k1": []* }** @param query the query string to parse (optional, default to cached*          r###lts from parsing window location search query).** @return object mapping keys to variables.*/util.getQueryVariables = function(query) {var parse = function(q) {var rval = {};var kvpairs = q.split('&');for(var i = 0; i < kvpairs.length; i++) {var pos = kvpairs[i].indexOf('=');var key;var val;if(pos > 0) {key = kvpairs[i].substring(0, pos);val = kvpairs[i].substring(pos + 1);} else {key = kvpairs[i];val = null;}if(!(key in rval)) {rval[key] = [];}// disallow overriding object prototype keysif(!(key in Object.prototype) && val !== null) {rval[key].push(unescape(val));}}return rval;};var rval;if(typeof(query) === 'undefined') {// set cached variables if neededif(_queryVariables === null) {if(typeof(window) !== 'undefined' && window.location && window.location.search) {// parse window search query_queryVariables = parse(window.location.search.substring(1));} else {// no query variables available_queryVariables = {};}}rval = _queryVariables;} else {// parse given queryrval = parse(query);}return rval;};/*** Parses a fragment into a path and query. This method will take a URI* fragment and break it up as if it were the main URI. For example:*    /bar/baz?a=1&b=2* r###lts in:*    {*       path: ["bar", "baz"],*       query: {"k1": ["v1"], "k2": ["v2"]}*    }** @return object with a path array and query object.*/util.parseFragment = function(fragment) {// default to whole fragmentvar fp = fragment;var fq = '';// split into path and query if possible at the first '?'var pos = fragment.indexOf('?');if(pos > 0) {fp = fragment.substring(0, pos);fq = fragment.substring(pos + 1);}// split path based on '/' and ignore first element if emptyvar path = fp.split('/');if(path.length > 0 && path[0] === '') {path.shift();}// convert query into objectvar query = (fq === '') ? {} : util.getQueryVariables(fq);return {pathString: fp,queryString: fq,path: path,query: query};};/*** Makes a request out of a URI-like request string. This is intended to* be used where a fragment id (after a URI '#') is parsed as a URI with* path and query parts. The string should have a path beginning and* delimited by '/' and optional query parameters following a '?'. The* query should be a standard URL set of key value pairs delimited by* '&'. For backwards compatibility the initial '/' on the path is not* required. The request object has the following API, (fully described* in the method code):*    {*       path: <the path string part>.*       query: <the query string part>,*       getPath(i): get part or all of the split path array,*       getQuery(k, i): get part or all of a query key array,*       getQueryLast(k, _default): get last element of a query key array.*    }** @return object with request parameters.*/util.makeRequest = function(reqString) {var frag = util.parseFragment(reqString);var req = {// full path stringpath: frag.pathString,// full query stringquery: frag.queryString,/*** Get path or element in path.** @param i optional path index.** @return path or part of path if i provided.*/getPath: function(i) {return (typeof(i) === 'undefined') ? frag.path : frag.path[i];},/*** Get query, values for a key, or value for a key index.** @param k optional query key.* @param i optional query key index.** @return query, values for a key, or value for a key index.*/getQuery: function(k, i) {var rval;if(typeof(k) === 'undefined') {rval = frag.query;} else {rval = frag.query[k];if(rval && typeof(i) !== 'undefined') {rval = rval[i];}}return rval;},getQueryLast: function(k, _default) {var rval;var vals = req.getQuery(k);if(vals) {rval = vals[vals.length - 1];} else {rval = _default;}return rval;}};return req;};/*** Makes a URI out of a path, an object with query parameters, and a* fragment. Uses jQuery.param() internally for query string creation.* If the path is an array, it will be joined with '/'.** @param path string path or array of strings.* @param query object with query parameters. (optional)* @param fragment fragment string. (optional)** @return string object with request parameters.*/util.makeLink = function(path, query, fragment) {// join path parts if neededpath = jQuery.isArray(path) ? path.join('/') : path;var qstr = jQuery.param(query || {});fragment = fragment || '';return path +((qstr.length > 0) ? ('?' + qstr) : '') +((fragment.length > 0) ? ('#' + fragment) : '');};/*** Follows a path of keys deep into an object hierarchy and set a value.* If a key does not exist or it's value is not an object, create an* object in it's place. This can be destructive to a object tree if* leaf nodes are given as non-final path keys.* Used to avoid exceptions from missing parts of the path.** @param object the starting object.* @param keys an array of string keys.* @param value the value to set.*/util.setPath = function(object, keys, value) {// need to start at an objectif(typeof(object) === 'object' && object !== null) {var i = 0;var len = keys.length;while(i < len) {var next = keys[i++];if(i == len) {// lastobject[next] = value;} else {// morevar hasNext = (next in object);if(!hasNext ||(hasNext && typeof(object[next]) !== 'object') ||(hasNext && object[next] === null)) {object[next] = {};}object = object[next];}}}};/*** Follows a path of keys deep into an object hierarchy and return a value.* If a key does not exist, create an object in it's place.* Used to avoid exceptions from missing parts of the path.** @param object the starting object.* @param keys an array of string keys.* @param _default value to return if path not found.** @return the value at the path if found, else default if given, else*         undefined.*/util.getPath = function(object, keys, _default) {var i = 0;var len = keys.length;var hasNext = true;while(hasNext && i < len &&typeof(object) === 'object' && object !== null) {var next = keys[i++];hasNext = next in object;if(hasNext) {object = object[next];}}return (hasNext ? object : _default);};/*** Follow a path of keys deep into an object hierarchy and delete the* last one. If a key does not exist, do nothing.* Used to avoid exceptions from missing parts of the path.** @param object the starting object.* @param keys an array of string keys.*/util.deletePath = function(object, keys) {// need to start at an objectif(typeof(object) === 'object' && object !== null) {var i = 0;var len = keys.length;while(i < len) {var next = keys[i++];if(i == len) {// lastdelete object[next];} else {// moreif(!(next in object) ||(typeof(object[next]) !== 'object') ||(object[next] === null)) {break;}object = object[next];}}}};/*** Check if an object is empty.** Taken from:* http://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object-from-json/679937#679937** @param object the object to check.*/util.isEmpty = function(obj) {for(var prop in obj) {if(obj.hasOwnProperty(prop)) {return false;}}return true;};/*** Format with simple printf-style interpolation.** %%: literal '%'* %s,%o: convert next argument into a string.** @param format the string to format.* @param ... arguments to interpolate into the format string.*/util.format = function(format) {var re = /%./g;// current matchvar match;// current partvar part;// current arg indexvar argi = 0;// collected parts to recombine latervar parts = [];// last index foundvar last = 0;// loop while matches remainwhile((match = re.exec(format))) {part = format.substring(last, re.lastIndex - 2);// don't add empty strings (ie, parts between %s%s)if(part.length > 0) {parts.push(part);}last = re.lastIndex;// switch on % codevar code = match[0][1];switch(code) {case 's':case 'o':// check if enough arguments were givenif(argi < arguments.length) {parts.push(arguments[argi++ + 1]);} else {parts.push('<?>');}break;// FIXME: do proper formating for numbers, etc//case 'f'://case 'd':case '%':parts.push('%');break;default:parts.push('<%' + code + '?>');}}// add trailing part of format stringparts.push(format.substring(last));return parts.join('');};/*** Formats a number.** http://snipplr.com/view/5945/javascript-numberformat--ported-from-php/*/util.formatNumber = function(number, decimals, dec_point, thousands_sep) {// http://kevin.vanzonneveld.net// +   original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)// +   improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)// +     bugfix by: Michael White (http://crestidg.com)// +     bugfix by: Benjamin Lupton// +     bugfix by: Allan Jensen (http://www.winternet.no)// +    revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)// *     example 1: number_format(1234.5678, 2, '.', '');// *     returns 1: 1234.57var n = number, c = isNaN(decimals = Math.abs(decimals)) ? 2 : decimals;var d = dec_point === undefined ? ',' : dec_point;var t = thousands_sep === undefined ?'.' : thousands_sep, s = n < 0 ? '-' : '';var i = parseInt((n = Math.abs(+n || 0).toFixed(c)), 10) + '';var j = (i.length > 3) ? i.length % 3 : 0;return s + (j ? i.substr(0, j) + t : '') +i.substr(j).replace(/(\d{3})(?=\d)/g, '$1' + t) +(c ? d + Math.abs(n - i).toFixed(c).slice(2) : '');};/*** Formats a byte size.** http://snipplr.com/view/5949/format-humanize-file-byte-size-presentation-in-javascript/*/util.formatSize = function(size) {if(size >= 1073741824) {size = util.formatNumber(size / 1073741824, 2, '.', '') + ' GiB';} else if(size >= 1048576) {size = util.formatNumber(size / 1048576, 2, '.', '') + ' MiB';} else if(size >= ####) {size = util.formatNumber(size / ####, 0) + ' KiB';} else {size = util.formatNumber(size, 0) + ' bytes';}return size;};/*** Converts an IPv4 or IPv6 string representation into bytes (in network order).** @param ip the IPv4 or IPv6 address to convert.** @return the 4-byte IPv6 or 16-byte IPv6 address or null if the address can't*         be parsed.*/util.bytesFromIP = function(ip) {if(ip.indexOf('.') !== -1) {return util.bytesFromIPv4(ip);}if(ip.indexOf(':') !== -1) {return util.bytesFromIPv6(ip);}return null;};/*** Converts an IPv4 string representation into bytes (in network order).** @param ip the IPv4 address to convert.** @return the 4-byte address or null if the address can't be parsed.*/util.bytesFromIPv4 = function(ip) {ip = ip.split('.');if(ip.length !== 4) {return null;}var b = util.createBuffer();for(var i = 0; i < ip.length; ++i) {var num = parseInt(ip[i], 10);if(isNaN(num)) {return null;}b.putByte(num);}return b.getBytes();};/*** Converts an IPv6 string representation into bytes (in network order).** @param ip the IPv6 address to convert.** @return the 16-byte address or null if the address can't be parsed.*/util.bytesFromIPv6 = function(ip) {var blanks = 0;ip = ip.split(':').filter(function(e) {if(e.length === 0) ++blanks;return true;});var zeros = (8 - ip.length + blanks) * 2;var b = util.createBuffer();for(var i = 0; i < 8; ++i) {if(!ip[i] || ip[i].length === 0) {b.fillWithByte(0, zeros);zeros = 0;continue;}var bytes = util.hexToBytes(ip[i]);if(bytes.length < 2) {b.putByte(0);}b.putBytes(bytes);}return b.getBytes();};/*** Converts 4-bytes into an IPv4 string representation or 16-bytes into* an IPv6 string representation. The bytes must be in network order.** @param bytes the bytes to convert.** @return the IPv4 or IPv6 string representation if 4 or 16 bytes,*         respectively, are given, otherwise null.*/util.bytesToIP = function(bytes) {if(bytes.length === 4) {return util.bytesToIPv4(bytes);}if(bytes.length === 16) {return util.bytesToIPv6(bytes);}return null;};/*** Converts 4-bytes into an IPv4 string representation. The bytes must be* in network order.** @param bytes the bytes to convert.** @return the IPv4 string representation or null for an invalid # of bytes.*/util.bytesToIPv4 = function(bytes) {if(bytes.length !== 4) {return null;}var ip = [];for(var i = 0; i < bytes.length; ++i) {ip.push(bytes.charCodeAt(i));}return ip.join('.');};/*** Converts 16-bytes into an IPv16 string representation. The bytes must be* in network order.** @param bytes the bytes to convert.** @return the IPv16 string representation or null for an invalid # of bytes.*/util.bytesToIPv6 = function(bytes) {if(bytes.length !== 16) {return null;}var ip = [];var zeroGroups = [];var zeroMaxGroup = 0;for(var i = 0; i < bytes.length; i += 2) {var hex = util.bytesToHex(bytes[i] + bytes[i + 1]);// canonicalize zero representationwhile(hex[0] === '0' && hex !== '0') {hex = hex.substr(1);}if(hex === '0') {var last = zeroGroups[zeroGroups.length - 1];var idx = ip.length;if(!last || idx !== last.end + 1) {zeroGroups.push({start: idx, end: idx});} else {last.end = idx;if((last.end - last.start) >(zeroGroups[zeroMaxGroup].end - zeroGroups[zeroMaxGroup].start)) {zeroMaxGroup = zeroGroups.length - 1;}}}ip.push(hex);}if(zeroGroups.length > 0) {var group = zeroGroups[zeroMaxGroup];// only shorten group of length > 0if(group.end - group.start > 0) {ip.splice(group.start, group.end - group.start + 1, '');if(group.start === 0) {ip.unshift('');}if(group.end === 7) {ip.push('');}}}return ip.join(':');};/*** Estimates the number of processes that can be run concurrently. If* creating Web Workers, keep in mind that the main JavaScript process needs* its own core.** @param options the options to use:*          update true to force an update (not use the cached value).* @param callback(err, max) called once the operation completes.*/util.estimateCores = function(options, callback) {if(typeof options === 'function') {callback = options;options = {};}options = options || {};if('cores' in util && !options.update) {return callback(null, util.cores);}if(typeof navigator !== 'undefined' &&'hardwareConcurrency' in navigator &&navigator.hardwareConcurrency > 0) {util.cores = navigator.hardwareConcurrency;return callback(null, util.cores);}if(typeof Worker === 'undefined') {// workers not availableutil.cores = 1;return callback(null, util.cores);}if(typeof Blob === 'undefined') {// can't estimate, default to 2util.cores = 2;return callback(null, util.cores);}// create worker concurrency estimation code as blobvar blobUrl = URL.createObjectURL(new Blob(['(',function() {self.addEventListener('message', function(e) {// run worker for 4 msvar st = Date.now();var et = st + 4;while(Date.now() < et);self.postMessage({st: st, et: et});});}.toString(),')()'], {type: 'application/javascript'}));// take 5 samples using 16 workerssample([], 5, 16);function sample(max, samples, numWorkers) {if(samples === 0) {// get overlap averagevar avg = Math.floor(max.reduce(function(avg, x) {return avg + x;}, 0) / max.length);util.cores = Math.max(1, avg);URL.revokeObjectURL(blobUrl);return callback(null, util.cores);}map(numWorkers, function(err, r###lts) {max.push(reduce(numWorkers, r###lts));sample(max, samples - 1, numWorkers);});}function map(numWorkers, callback) {var workers = [];var r###lts = [];for(var i = 0; i < numWorkers; ++i) {var worker = new Worker(blobUrl);worker.addEventListener('message', function(e) {r###lts.push(e.data);if(r###lts.length === numWorkers) {for(var i = 0; i < numWorkers; ++i) {workers[i].terminate();}callback(null, r###lts);}});workers.push(worker);}for(var i = 0; i < numWorkers; ++i) {workers[i].postMessage(i);}}function reduce(numWorkers, r###lts) {// find overlapping time windowsvar overlaps = [];for(var n = 0; n < numWorkers; ++n) {var r1 = r###lts[n];var overlap = overlaps[n] = [];for(var i = 0; i < numWorkers; ++i) {if(n === i) {continue;}var r2 = r###lts[i];if((r1.st > r2.st && r1.st < r2.et) ||(r2.st > r1.st && r2.st < r1.et)) {overlap.push(i);}}}// get maximum overlaps ... don't include overlapping worker itself// as the main JS process was also being scheduled during the work and// would have to be subtracted from the estimate anywayreturn overlaps.reduce(function(max, overlap) {return Math.max(max, overlap.length);}, 0);}};/***/ }),/***/ 256:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {/*** Javascript implementation of X.509 and related components (such as* Certification Signing Requests) of a Public Key Infrastructure.** @author Dave Longley** Copyright (c) 2010-2014 Digital Bazaar, Inc.** The ASN.1 representation of an X.509v3 certificate is as follows* (see RFC 2459):** Certificate ::= SEQUENCE {*   tbsCertificate       TBSCertificate,*   signatureAlgorithm   AlgorithmIdentifier,*   signatureValue       BIT STRING* }** TBSCertificate ::= SEQUENCE {*   version         [0]  EXPLICIT Version DEFAULT v1,*   serialNumber         CertificateSerialNumber,*   signature            AlgorithmIdentifier,*   issuer               Name,*   validity             Validity,*   subject              Name,*   subjectPublicKeyInfo SubjectPublicKeyInfo,*   issuerUniqueID  [1]  IMPLICIT UniqueIdentifier OPTIONAL,*                        -- If present, version shall be v2 or v3*   subjectUniqueID [2]  IMPLICIT UniqueIdentifier OPTIONAL,*                        -- If present, version shall be v2 or v3*   extensions      [3]  EXPLICIT Extensions OPTIONAL*                        -- If present, version shall be v3* }** Version ::= INTEGER  { v1(0), v2(1), v3(2) }** CertificateSerialNumber ::= INTEGER** Name ::= CHOICE {*   // only one possible choice for now*   RDNSequence* }** RDNSequence ::= SEQUENCE OF RelativeDistinguishedName** RelativeDistinguishedName ::= SET OF AttributeTypeAndValue** AttributeTypeAndValue ::= SEQUENCE {*   type     AttributeType,*   value    AttributeValue* }* AttributeType ::= OBJECT IDENTIFIER* AttributeValue ::= ANY DEFINED BY AttributeType** Validity ::= SEQUENCE {*   notBefore      Time,*   notAfter       Time* }** Time ::= CHOICE {*   utcTime        UTCTime,*   generalTime    GeneralizedTime* }** UniqueIdentifier ::= BIT STRING** SubjectPublicKeyInfo ::= SEQUENCE {*   algorithm            AlgorithmIdentifier,*   subjectPublicKey     BIT STRING* }** Extensions ::= SEQUENCE SIZE (1..MAX) OF Extension** Extension ::= SEQUENCE {*   extnID      OBJECT IDENTIFIER,*   critical    BOOLEAN DEFAULT FALSE,*   extnValue   OCTET STRING* }** The only key algorithm currently supported for PKI is RSA.** RSASSA-PSS signatures are described in RFC 3447 and RFC 4055.** PKCS#10 v1.7 describes certificate signing requests:** CertificationRequestInfo:** CertificationRequestInfo ::= SEQUENCE {*   version       INTEGER { v1(0) } (v1,...),*   subject       Name,*   subjectPKInfo SubjectPublicKeyInfo{{ PKInfoAlgorithms }},*   attributes    [0] Attributes{{ CRIAttributes }}* }** Attributes { ATTRIBUTE:IOSet } ::= SET OF Attribute{{ IOSet }}** CRIAttributes  ATTRIBUTE  ::= {*   ... -- add any locally defined attributes here -- }** Attribute { ATTRIBUTE:IOSet } ::= SEQUENCE {*   type   ATTRIBUTE.&id({IOSet}),*   values SET SIZE(1..MAX) OF ATTRIBUTE.&Type({IOSet}{@type})* }** CertificationRequest ::= SEQUENCE {*   certificationRequestInfo CertificationRequestInfo,*   signatureAlgorithm AlgorithmIdentifier{{ SignatureAlgorithms }},*   signature          BIT STRING* }*/var forge = __webpack_require__(7009);__webpack_require__(8315);__webpack_require__(1598);__webpack_require__(3436);__webpack_require__(3605);__webpack_require__(6222);__webpack_require__(1692);__webpack_require__(2966);__webpack_require__(3385);__webpack_require__(524);__webpack_require__(2365);// shortcut for asn.1 APIvar asn1 = forge.asn1;/* Public Key Infrastructure (PKI) implementation. */var pki = module.exports = forge.pki = forge.pki || {};var oids = pki.oids;// short name OID mappingsvar _shortNames = {};_shortNames['CN'] = oids['commonName'];_shortNames['commonName'] = 'CN';_shortNames['C'] = oids['countryName'];_shortNames['countryName'] = 'C';_shortNames['L'] = oids['localityName'];_shortNames['localityName'] = 'L';_shortNames['ST'] = oids['stateOrProvinceName'];_shortNames['stateOrProvinceName'] = 'ST';_shortNames['O'] = oids['organizationName'];_shortNames['organizationName'] = 'O';_shortNames['OU'] = oids['organizationalUnitName'];_shortNames['organizationalUnitName'] = 'OU';_shortNames['E'] = oids['emailAddress'];_shortNames['emailAddress'] = 'E';// validator for an SubjectPublicKeyInfo structure// Note: Currently only works with an RSA public keyvar publicKeyValidator = forge.pki.rsa.publicKeyValidator;// validator for an X.509v3 certificatevar x509CertificateValidator = {name: 'Certificate',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'Certificate.TBSCertificate',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'tbsCertificate',value: [{name: 'Certificate.TBSCertificate.version',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,constructed: true,optional: true,value: [{name: 'Certificate.TBSCertificate.version.integer',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'certVersion'}]}, {name: 'Certificate.TBSCertificate.serialNumber',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'certSerialNumber'}, {name: 'Certificate.TBSCertificate.signature',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'Certificate.TBSCertificate.signature.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'certinfoSignatureOid'}, {name: 'Certificate.TBSCertificate.signature.parameters',tagClass: asn1.Class.UNIVERSAL,optional: true,captureAsn1: 'certinfoSignatureParams'}]}, {name: 'Certificate.TBSCertificate.issuer',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'certIssuer'}, {name: 'Certificate.TBSCertificate.validity',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,// Note: UTC and generalized times may both appear so the capture// names are based on their detected order, the names used below// are only for the common case, which validity time really means// "notBefore" and which means "notAfter" will be determined by ordervalue: [{// notBefore (Time) (UTC time case)name: 'Certificate.TBSCertificate.validity.notBefore (utc)',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.UTCTIME,constructed: false,optional: true,capture: 'certValidity1UTCTime'}, {// notBefore (Time) (generalized time case)name: 'Certificate.TBSCertificate.validity.notBefore (generalized)',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.GENERALIZEDTIME,constructed: false,optional: true,capture: 'certValidity2GeneralizedTime'}, {// notAfter (Time) (only UTC time is supported)name: 'Certificate.TBSCertificate.validity.notAfter (utc)',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.UTCTIME,constructed: false,optional: true,capture: 'certValidity3UTCTime'}, {// notAfter (Time) (only UTC time is supported)name: 'Certificate.TBSCertificate.validity.notAfter (generalized)',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.GENERALIZEDTIME,constructed: false,optional: true,capture: 'certValidity4GeneralizedTime'}]}, {// Name (subject) (RDNSequence)name: 'Certificate.TBSCertificate.subject',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'certSubject'},// SubjectPublicKeyInfopublicKeyValidator,{// issuerUniqueID (optional)name: 'Certificate.TBSCertificate.issuerUniqueID',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 1,constructed: true,optional: true,value: [{name: 'Certificate.TBSCertificate.issuerUniqueID.id',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.BITSTRING,constructed: false,// TODO: support arbitrary bit length idscaptureBitStringValue: 'certIssuerUniqueId'}]}, {// subjectUniqueID (optional)name: 'Certificate.TBSCertificate.subjectUniqueID',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 2,constructed: true,optional: true,value: [{name: 'Certificate.TBSCertificate.subjectUniqueID.id',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.BITSTRING,constructed: false,// TODO: support arbitrary bit length idscaptureBitStringValue: 'certSubjectUniqueId'}]}, {// Extensions (optional)name: 'Certificate.TBSCertificate.extensions',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 3,constructed: true,captureAsn1: 'certExtensions',optional: true}]}, {// AlgorithmIdentifier (signature algorithm)name: 'Certificate.signatureAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{// algorithmname: 'Certificate.signatureAlgorithm.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'certSignatureOid'}, {name: 'Certificate.TBSCertificate.signature.parameters',tagClass: asn1.Class.UNIVERSAL,optional: true,captureAsn1: 'certSignatureParams'}]}, {// SignatureValuename: 'Certificate.signatureValue',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.BITSTRING,constructed: false,captureBitStringValue: 'certSignature'}]};var rsassaPssParameterValidator = {name: 'rsapss',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'rsapss.hashAlgorithm',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,constructed: true,value: [{name: 'rsapss.hashAlgorithm.AlgorithmIdentifier',tagClass: asn1.Class.UNIVERSAL,type: asn1.Class.SEQUENCE,constructed: true,optional: true,value: [{name: 'rsapss.hashAlgorithm.AlgorithmIdentifier.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'hashOid'/* parameter block omitted, for SHA1 NULL anyhow. */}]}]}, {name: 'rsapss.maskGenAlgorithm',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 1,constructed: true,value: [{name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier',tagClass: asn1.Class.UNIVERSAL,type: asn1.Class.SEQUENCE,constructed: true,optional: true,value: [{name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'maskGenOid'}, {name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.params',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.params.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'maskGenHashOid'/* parameter block omitted, for SHA1 NULL anyhow. */}]}]}]}, {name: 'rsapss.saltLength',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 2,optional: true,value: [{name: 'rsapss.saltLength.saltLength',tagClass: asn1.Class.UNIVERSAL,type: asn1.Class.INTEGER,constructed: false,capture: 'saltLength'}]}, {name: 'rsapss.trailerField',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 3,optional: true,value: [{name: 'rsapss.trailer.trailer',tagClass: asn1.Class.UNIVERSAL,type: asn1.Class.INTEGER,constructed: false,capture: 'trailer'}]}]};// validator for a CertificationRequestInfo structurevar certificationRequestInfoValidator = {name: 'CertificationRequestInfo',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'certificationRequestInfo',value: [{name: 'CertificationRequestInfo.integer',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.INTEGER,constructed: false,capture: 'certificationRequestInfoVersion'}, {// Name (subject) (RDNSequence)name: 'CertificationRequestInfo.subject',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'certificationRequestInfoSubject'},// SubjectPublicKeyInfopublicKeyValidator,{name: 'CertificationRequestInfo.attributes',tagClass: asn1.Class.CONTEXT_SPECIFIC,type: 0,constructed: true,optional: true,capture: 'certificationRequestInfoAttributes',value: [{name: 'CertificationRequestInfo.attributes',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{name: 'CertificationRequestInfo.attributes.type',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false}, {name: 'CertificationRequestInfo.attributes.value',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SET,constructed: true}]}]}]};// validator for a CertificationRequest structurevar certificationRequestValidator = {name: 'CertificationRequest',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,captureAsn1: 'csr',value: [certificationRequestInfoValidator, {// AlgorithmIdentifier (signature algorithm)name: 'CertificationRequest.signatureAlgorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.SEQUENCE,constructed: true,value: [{// algorithmname: 'CertificationRequest.signatureAlgorithm.algorithm',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.OID,constructed: false,capture: 'csrSignatureOid'}, {name: 'CertificationRequest.signatureAlgorithm.parameters',tagClass: asn1.Class.UNIVERSAL,optional: true,captureAsn1: 'csrSignatureParams'}]}, {// signaturename: 'CertificationRequest.signature',tagClass: asn1.Class.UNIVERSAL,type: asn1.Type.BITSTRING,constructed: false,captureBitStringValue: 'csrSignature'}]};/*** Converts an RDNSequence of ASN.1 DER-encoded RelativeDistinguishedName* sets into an array with objects that have type and value properties.** @param rdn the RDNSequence to convert.* @param md a message digest to append type and value to if provided.*/pki.RDNAttributesAsArray = function(rdn, md) {var rval = [];// each value in 'rdn' in is a SET of RelativeDistinguishedNamevar set, attr, obj;for(var si = 0; si < rdn.value.length; ++si) {// get the RelativeDistinguishedName setset = rdn.value[si];// each value in the SET is an AttributeTypeAndValue sequence// containing first a type (an OID) and second a value (defined by// the OID)for(var i = 0; i < set.value.length; ++i) {obj = {};attr = set.value[i];obj.type = asn1.derToOid(attr.value[0].value);obj.value = attr.value[1].value;obj.valueTagClass = attr.value[1].type;// if the OID is known, get its name and short nameif(obj.type in oids) {obj.name = oids[obj.type];if(obj.name in _shortNames) {obj.shortName = _shortNames[obj.name];}}if(md) {md.update(obj.type);md.update(obj.value);}rval.push(obj);}}return rval;};/*** Converts ASN.1 CRIAttributes into an array with objects that have type and* value properties.** @param attributes the CRIAttributes to convert.*/pki.CRIAttributesAsArray = function(attributes) {var rval = [];// each value in 'attributes' in is a SEQUENCE with an OID and a SETfor(var si = 0; si < attributes.length; ++si) {// get the attribute sequencevar seq = attributes[si];// each value in the SEQUENCE containing first a type (an OID) and// second a set of values (defined by the OID)var type = asn1.derToOid(seq.value[0].value);var values = seq.value[1].value;for(var vi = 0; vi < values.length; ++vi) {var obj = {};obj.type = type;obj.value = values[vi].value;obj.valueTagClass = values[vi].type;// if the OID is known, get its name and short nameif(obj.type in oids) {obj.name = oids[obj.type];if(obj.name in _shortNames) {obj.shortName = _shortNames[obj.name];}}// parse extensionsif(obj.type === oids.extensionRequest) {obj.extensions = [];for(var ei = 0; ei < obj.value.length; ++ei) {obj.extensions.push(pki.certificateExtensionFromAsn1(obj.value[ei]));}}rval.push(obj);}}return rval;};/*** Gets an issuer or subject attribute from its name, type, or short name.** @param obj the issuer or subject object.* @param options a short name string or an object with:*          shortName the short name for the attribute.*          name the name for the attribute.*          type the type for the attribute.** @return the attribute.*/function _getAttribute(obj, options) {if(typeof options === 'string') {options = {shortName: options};}var rval = null;var attr;for(var i = 0; rval === null && i < obj.attributes.length; ++i) {attr = obj.attributes[i];if(options.type && options.type === attr.type) {rval = attr;} else if(options.name && options.name === attr.name) {rval = attr;} else if(options.shortName && options.shortName === attr.shortName) {rval = attr;}}return rval;}/*** Converts signature parameters from ASN.1 structure.** Currently only RSASSA-PSS supported.  The PKCS#1 v1.5 signature scheme had* no parameters.** RSASSA-PSS-params  ::=  SEQUENCE  {*   hashAlgorithm      [0] HashAlgorithm DEFAULT*                             sha1Identifier,*   maskGenAlgorithm   [1] MaskGenAlgorithm DEFAULT*                             mgf1SHA1Identifier,*   saltLength         [2] INTEGER DEFAULT 20,*   trailerField       [3] INTEGER DEFAULT 1* }** HashAlgorithm  ::=  AlgorithmIdentifier** MaskGenAlgorithm  ::=  AlgorithmIdentifier** AlgorithmIdentifer ::= SEQUENCE {*   algorithm OBJECT IDENTIFIER,*   parameters ANY DEFINED BY algorithm OPTIONAL* }** @param oid The OID specifying the signature algorithm* @param obj The ASN.1 structure holding the parameters* @param fillDefaults Whether to use return default values where omitted* @return signature parameter object*/var _readSignatureParameters = function(oid, obj, fillDefaults) {var params = {};if(oid !== oids['RSASSA-PSS']) {return params;}if(fillDefaults) {params = {hash: {algorithmOid: oids['sha1']},mgf: {algorithmOid: oids['mgf1'],hash: {algorithmOid: oids['sha1']}},saltLength: 20};}var capture = {};var errors = [];if(!asn1.validate(obj, rsassaPssParameterValidator, capture, errors)) {var error = new Error('Cannot read RSASSA-PSS parameter block.');error.errors = errors;throw error;}if(capture.hashOid !== undefined) {params.hash = params.hash || {};params.hash.algorithmOid = asn1.derToOid(capture.hashOid);}if(capture.maskGenOid !== undefined) {params.mgf = params.mgf || {};params.mgf.algorithmOid = asn1.derToOid(capture.maskGenOid);params.mgf.hash = params.mgf.hash || {};params.mgf.hash.algorithmOid = asn1.derToOid(capture.maskGenHashOid);}if(capture.saltLength !== undefined) {params.saltLength = capture.saltLength.charCodeAt(0);}return params;};/*** Converts an X.509 certificate from PEM format.** Note: If the certificate is to be verified then compute hash should* be set to true. This will scan the TBSCertificate part of the ASN.1* object while it is converted so it doesn't need to be converted back* to ASN.1-DER-encoding later.** @param pem the PEM-formatted certificate.* @param computeHash true to compute the hash for verification.* @param strict true to be strict when checking ASN.1 value lengths, false to*          allow truncated values (default: true).** @return the certificate.*/pki.certificateFromPem = function(pem, computeHash, strict) {var msg = forge.pem.decode(pem)[0];if(msg.type !== 'CERTIFICATE' &&msg.type !== 'X509 CERTIFICATE' &&msg.type !== 'TRUSTED CERTIFICATE') {var error = new Error('Could not convert certificate from PEM; PEM header type ' +'is not "CERTIFICATE", "X509 CERTIFICATE", or "TRUSTED CERTIFICATE".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert certificate from PEM; PEM is encrypted.');}// convert DER to ASN.1 objectvar obj = asn1.fromDer(msg.body, strict);return pki.certificateFromAsn1(obj, computeHash);};/*** Converts an X.509 certificate to PEM format.** @param cert the certificate.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted certificate.*/pki.certificateToPem = function(cert, maxline) {// convert to ASN.1, then DER, then PEM-encodevar msg = {type: 'CERTIFICATE',body: asn1.toDer(pki.certificateToAsn1(cert)).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/*** Converts an RSA public key from PEM format.** @param pem the PEM-formatted public key.** @return the public key.*/pki.publicKeyFromPem = function(pem) {var msg = forge.pem.decode(pem)[0];if(msg.type !== 'PUBLIC KEY' && msg.type !== 'RSA PUBLIC KEY') {var error = new Error('Could not convert public key from PEM; PEM header ' +'type is not "PUBLIC KEY" or "RSA PUBLIC KEY".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert public key from PEM; PEM is encrypted.');}// convert DER to ASN.1 objectvar obj = asn1.fromDer(msg.body);return pki.publicKeyFromAsn1(obj);};/*** Converts an RSA public key to PEM format (using a SubjectPublicKeyInfo).** @param key the public key.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted public key.*/pki.publicKeyToPem = function(key, maxline) {// convert to ASN.1, then DER, then PEM-encodevar msg = {type: 'PUBLIC KEY',body: asn1.toDer(pki.publicKeyToAsn1(key)).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/*** Converts an RSA public key to PEM format (using an RSAPublicKey).** @param key the public key.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted public key.*/pki.publicKeyToRSAPublicKeyPem = function(key, maxline) {// convert to ASN.1, then DER, then PEM-encodevar msg = {type: 'RSA PUBLIC KEY',body: asn1.toDer(pki.publicKeyToRSAPublicKey(key)).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/*** Gets a fingerprint for the given public key.** @param options the options to use.*          [md] the message digest object to use (defaults to forge.md.sha1).*          [type] the type of fingerprint, such as 'RSAPublicKey',*            'SubjectPublicKeyInfo' (defaults to 'RSAPublicKey').*          [encoding] an alternative output encoding, such as 'hex'*            (defaults to none, outputs a byte buffer).*          [delimiter] the delimiter to use between bytes for 'hex' encoded*            output, eg: ':' (defaults to none).** @return the fingerprint as a byte buffer or other encoding based on options.*/pki.getPublicKeyFingerprint = function(key, options) {options = options || {};var md = options.md || forge.md.sha1.create();var type = options.type || 'RSAPublicKey';var bytes;switch(type) {case 'RSAPublicKey':bytes = asn1.toDer(pki.publicKeyToRSAPublicKey(key)).getBytes();break;case 'SubjectPublicKeyInfo':bytes = asn1.toDer(pki.publicKeyToAsn1(key)).getBytes();break;default:throw new Error('Unknown fingerprint type "' + options.type + '".');}// hash public key bytesmd.start();md.update(bytes);var digest = md.digest();if(options.encoding === 'hex') {var hex = digest.toHex();if(options.delimiter) {return hex.match(/.{2}/g).join(options.delimiter);}return hex;} else if(options.encoding === 'binary') {return digest.getBytes();} else if(options.encoding) {throw new Error('Unknown encoding "' + options.encoding + '".');}return digest;};/*** Converts a PKCS#10 certification request (CSR) from PEM format.** Note: If the certification request is to be verified then compute hash* should be set to true. This will scan the CertificationRequestInfo part of* the ASN.1 object while it is converted so it doesn't need to be converted* back to ASN.1-DER-encoding later.** @param pem the PEM-formatted certificate.* @param computeHash true to compute the hash for verification.* @param strict true to be strict when checking ASN.1 value lengths, false to*          allow truncated values (default: true).** @return the certification request (CSR).*/pki.certificationRequestFromPem = function(pem, computeHash, strict) {var msg = forge.pem.decode(pem)[0];if(msg.type !== 'CERTIFICATE REQUEST') {var error = new Error('Could not convert certification request from PEM; ' +'PEM header type is not "CERTIFICATE REQUEST".');error.headerType = msg.type;throw error;}if(msg.procType && msg.procType.type === 'ENCRYPTED') {throw new Error('Could not convert certification request from PEM; ' +'PEM is encrypted.');}// convert DER to ASN.1 objectvar obj = asn1.fromDer(msg.body, strict);return pki.certificationRequestFromAsn1(obj, computeHash);};/*** Converts a PKCS#10 certification request (CSR) to PEM format.** @param csr the certification request.* @param maxline the maximum characters per line, defaults to 64.** @return the PEM-formatted certification request.*/pki.certificationRequestToPem = function(csr, maxline) {// convert to ASN.1, then DER, then PEM-encodevar msg = {type: 'CERTIFICATE REQUEST',body: asn1.toDer(pki.certificationRequestToAsn1(csr)).getBytes()};return forge.pem.encode(msg, {maxline: maxline});};/*** Creates an empty X.509v3 RSA certificate.** @return the certificate.*/pki.createCertificate = function() {var cert = {};cert.version = 0x02;cert.serialNumber = '00';cert.signatureOid = null;cert.signature = null;cert.siginfo = {};cert.siginfo.algorithmOid = null;cert.validity = {};cert.validity.notBefore = new Date();cert.validity.notAfter = new Date();cert.issuer = {};cert.issuer.getField = function(sn) {return _getAttribute(cert.issuer, sn);};cert.issuer.addField = function(attr) {_fillMissingFields([attr]);cert.issuer.attributes.push(attr);};cert.issuer.attributes = [];cert.issuer.hash = null;cert.subject = {};cert.subject.getField = function(sn) {return _getAttribute(cert.subject, sn);};cert.subject.addField = function(attr) {_fillMissingFields([attr]);cert.subject.attributes.push(attr);};cert.subject.attributes = [];cert.subject.hash = null;cert.extensions = [];cert.publicKey = null;cert.md = null;/*** Sets the subject of this certificate.** @param attrs the array of subject attributes to use.* @param uniqueId an optional a unique ID to use.*/cert.setSubject = function(attrs, uniqueId) {// set new attributes, clear hash_fillMissingFields(attrs);cert.subject.attributes = attrs;delete cert.subject.uniqueId;if(uniqueId) {// TODO: support arbitrary bit length idscert.subject.uniqueId = uniqueId;}cert.subject.hash = null;};/*** Sets the issuer of this certificate.** @param attrs the array of issuer attributes to use.* @param uniqueId an optional a unique ID to use.*/cert.setIssuer = function(attrs, uniqueId) {// set new attributes, clear hash_fillMissingFields(attrs);cert.issuer.attributes = attrs;delete cert.issuer.uniqueId;if(uniqueId) {// TODO: support arbitrary bit length idscert.issuer.uniqueId = uniqueId;}cert.issuer.hash = null;};/*** Sets the extensions of this certificate.** @param exts the array of extensions to use.*/cert.setExtensions = function(exts) {for(var i = 0; i < exts.length; ++i) {_fillMissingExtensionFields(exts[i], {cert: cert});}// set new extensionscert.extensions = exts;};/*** Gets an extension by its name or id.** @param options the name to use or an object with:*          name the name to use.*          id the id to use.** @return the extension or null if not found.*/cert.getExtension = function(options) {if(typeof options === 'string') {options = {name: options};}var rval = null;var ext;for(var i = 0; rval === null && i < cert.extensions.length; ++i) {ext = cert.extensions[i];if(options.id && ext.id === options.id) {rval = ext;} else if(options.name && ext.name === options.name) {rval = ext;}}return rval;};/*** Signs this certificate using the given private key.** @param key the private key to sign with.* @param md the message digest object to use (defaults to forge.md.sha1).*/cert.sign = function(key, md) {// TODO: get signature OID from private keycert.md = md || forge.md.sha1.create();var algorithmOid = oids[cert.md.algorithm + 'WithRSAEncryption'];if(!algorithmOid) {var error = new Error('Could not compute certificate digest. ' +'Unknown message digest algorithm OID.');error.algorithm = cert.md.algorithm;throw error;}cert.signatureOid = cert.siginfo.algorithmOid = algorithmOid;// get TBSCertificate, convert to DERcert.tbsCertificate = pki.getTBSCertificate(cert);var bytes = asn1.toDer(cert.tbsCertificate);// digest and signcert.md.update(bytes.getBytes());cert.signature = key.sign(cert.md);};/*** Attempts verify the signature on the passed certificate using this* certificate's public key.** @param child the certificate to verify.** @return true if verified, false if not.*/cert.verify = function(child) {var rval = false;if(!cert.issued(child)) {var issuer = child.issuer;var subject = cert.subject;var error = new Error('The parent certificate did not issue the given child ' +'certificate; the child certificate\'s issuer does not match the ' +'parent\'s subject.');error.expectedIssuer = issuer.attributes;error.actualIssuer = subject.attributes;throw error;}var md = child.md;if(md === null) {// check signature OID for supported signature typesif(child.signatureOid in oids) {var oid = oids[child.signatureOid];switch(oid) {case 'sha1WithRSAEncryption':md = forge.md.sha1.create();break;case 'md5WithRSAEncryption':md = forge.md.md5.create();break;case 'sha256WithRSAEncryption':md = forge.md.sha256.create();break;case 'sha384WithRSAEncryption':md = forge.md.sha384.create();break;case 'sha512WithRSAEncryption':md = forge.md.sha512.create();break;case 'RSASSA-PSS':md = forge.md.sha256.create();break;}}if(md === null) {var error = new Error('Could not compute certificate digest. ' +'Unknown signature OID.');error.signatureOid = child.signatureOid;throw error;}// produce DER formatted TBSCertificate and digest itvar tbsCertificate = child.tbsCertificate || pki.getTBSCertificate(child);var bytes = asn1.toDer(tbsCertificate);md.update(bytes.getBytes());}if(md !== null) {var scheme;switch(child.signatureOid) {case oids.sha1WithRSAEncryption:scheme = undefined; /* use PKCS#1 v1.5 padding scheme */break;case oids['RSASSA-PSS']:var hash, mgf;/* initialize mgf */hash = oids[child.signatureParameters.mgf.hash.algorithmOid];if(hash === undefined || forge.md[hash] === undefined) {var error = new Error('Unsupported MGF hash function.');error.oid = child.signatureParameters.mgf.hash.algorithmOid;error.name = hash;throw error;}mgf = oids[child.signatureParameters.mgf.algorithmOid];if(mgf === undefined || forge.mgf[mgf] === undefined) {var error = new Error('Unsupported MGF function.');error.oid = child.signatureParameters.mgf.algorithmOid;error.name = mgf;throw error;}mgf = forge.mgf[mgf].create(forge.md[hash].create());/* initialize hash function */hash = oids[child.signatureParameters.hash.algorithmOid];if(hash === undefined || forge.md[hash] === undefined) {throw {message: 'Unsupported RSASSA-PSS hash function.',oid: child.signatureParameters.hash.algorithmOid,name: hash};}scheme = forge.pss.create(forge.md[hash].create(), mgf,child.signatureParameters.saltLength);break;}// verify signature on cert using public keyrval = cert.publicKey.verify(md.digest().getBytes(), child.signature, scheme);}return rval;};/*** Returns true if this certificate's issuer matches the passed* certificate's subject. Note that no signature check is performed.** @param parent the certificate to check.** @return true if this certificate's issuer matches the passed certificate's*         subject.*/cert.isIssuer = function(parent) {var rval = false;var i = cert.issuer;var s = parent.subject;// compare hashes if presentif(i.hash && s.hash) {rval = (i.hash === s.hash);} else if(i.attributes.length === s.attributes.length) {// all attributes are the same so issuer matches subjectrval = true;var iattr, sattr;for(var n = 0; rval && n < i.attributes.length; ++n) {iattr = i.attributes[n];sattr = s.attributes[n];if(iattr.type !== sattr.type || iattr.value !== sattr.value) {// attribute mismatchrval = false;}}}return rval;};/*** Returns true if this certificate's subject matches the issuer of the* given certificate). Note that not signature check is performed.** @param child the certificate to check.** @return true if this certificate's subject matches the passed*         certificate's issuer.*/cert.issued = function(child) {return child.isIssuer(cert);};/*** Generates the subjectKeyIdentifier for this certificate as byte buffer.** @return the subjectKeyIdentifier for this certificate as byte buffer.*/cert.generat###bjectKeyIdentifier = function() {/* See: 4.2.1.2 section of the the RFC3280, keyIdentifier is either:(1) The keyIdentifier is composed of the 160-bit SHA-1 hash of thevalue of the BIT STRING subjectPublicKey (excluding the tag,length, and number of unused bits).(2) The keyIdentifier is composed of a four bit type field withthe value 0100 followed by the least significant 60 bits of theSHA-1 hash of the value of the BIT STRING subjectPublicKey(excluding the tag, length, and number of unused bit string bits).*/// skipping the tag, length, and number of unused bits is the same// as just using the RSAPublicKey (for RSA keys, which are the// only ones supported)return pki.getPublicKeyFingerprint(cert.publicKey, {type: 'RSAPublicKey'});};/*** Verifies the subjectKeyIdentifier extension value for this certificate* against its public key. If no extension is found, false will be* returned.** @return true if verified, false if not.*/cert.verifySubjectKeyIdentifier = function() {var oid = oids['subjectKeyIdentifier'];for(var i = 0; i < cert.extensions.length; ++i) {var ext = cert.extensions[i];if(ext.id === oid) {var ski = cert.generat###bjectKeyIdentifier().getBytes();return (forge.util.hexToBytes(ext.subjectKeyIdentifier) === ski);}}return false;};return cert;};/*** Converts an X.509v3 RSA certificate from an ASN.1 object.** Note: If the certificate is to be verified then compute hash should* be set to true. There is currently no implementation for converting* a certificate back to ASN.1 so the TBSCertificate part of the ASN.1* object needs to be scanned before the cert object is created.** @param obj the asn1 representation of an X.509v3 RSA certificate.* @param computeHash true to compute the hash for verification.** @return the certificate.*/pki.certificateFromAsn1 = function(obj, computeHash) {// validate certificate and capture datavar capture = {};var errors = [];if(!asn1.validate(obj, x509CertificateValidator, capture, errors)) {var error = new Error('Cannot read X.509 certificate. ' +'ASN.1 object is not an X509v3 Certificate.');error.errors = errors;throw error;}// get oidvar oid = asn1.derToOid(capture.publicKeyOid);if(oid !== pki.oids.rsaEncryption) {throw new Error('Cannot read public key. OID is not RSA.');}// create certificatevar cert = pki.createCertificate();cert.version = capture.certVersion ?capture.certVersion.charCodeAt(0) : 0;var serial = forge.util.createBuffer(capture.certSerialNumber);cert.serialNumber = serial.toHex();cert.signatureOid = forge.asn1.derToOid(capture.certSignatureOid);cert.signatureParameters = _readSignatureParameters(cert.signatureOid, capture.certSignatureParams, true);cert.siginfo.algorithmOid = forge.asn1.derToOid(capture.certinfoSignatureOid);cert.siginfo.parameters = _readSignatureParameters(cert.siginfo.algorithmOid,capture.certinfoSignatureParams, false);cert.signature = capture.certSignature;var validity = [];if(capture.certValidity1UTCTime !== undefined) {validity.push(asn1.utcTimeToDate(capture.certValidity1UTCTime));}if(capture.certValidity2GeneralizedTime !== undefined) {validity.push(asn1.generalizedTimeToDate(capture.certValidity2GeneralizedTime));}if(capture.certValidity3UTCTime !== undefined) {validity.push(asn1.utcTimeToDate(capture.certValidity3UTCTime));}if(capture.certValidity4GeneralizedTime !== undefined) {validity.push(asn1.generalizedTimeToDate(capture.certValidity4GeneralizedTime));}if(validity.length > 2) {throw new Error('Cannot read notBefore/notAfter validity times; more ' +'than two times were provided in the certificate.');}if(validity.length < 2) {throw new Error('Cannot read notBefore/notAfter validity times; they ' +'were not provided as either UTCTime or GeneralizedTime.');}cert.validity.notBefore = validity[0];cert.validity.notAfter = validity[1];// keep TBSCertificate to preserve signature when exportingcert.tbsCertificate = capture.tbsCertificate;if(computeHash) {// check signature OID for supported signature typescert.md = null;if(cert.signatureOid in oids) {var oid = oids[cert.signatureOid];switch(oid) {case 'sha1WithRSAEncryption':cert.md = forge.md.sha1.create();break;case 'md5WithRSAEncryption':cert.md = forge.md.md5.create();break;case 'sha256WithRSAEncryption':cert.md = forge.md.sha256.create();break;case 'sha384WithRSAEncryption':cert.md = forge.md.sha384.create();break;case 'sha512WithRSAEncryption':cert.md = forge.md.sha512.create();break;case 'RSASSA-PSS':cert.md = forge.md.sha256.create();break;}}if(cert.md === null) {var error = new Error('Could not compute certificate digest. ' +'Unknown signature OID.');error.signatureOid = cert.signatureOid;throw error;}// produce DER formatted TBSCertificate and digest itvar bytes = asn1.toDer(cert.tbsCertificate);cert.md.update(bytes.getBytes());}// handle issuer, build issuer message digestvar imd = forge.md.sha1.create();cert.issuer.getField = function(sn) {return _getAttribute(cert.issuer, sn);};cert.issuer.addField = function(attr) {_fillMissingFields([attr]);cert.issuer.attributes.push(attr);};cert.issuer.attributes = pki.RDNAttributesAsArray(capture.certIssuer, imd);if(capture.certIssuerUniqueId) {cert.issuer.uniqueId = capture.certIssuerUniqueId;}cert.issuer.hash = imd.digest().toHex();// handle subject, build subject message digestvar smd = forge.md.sha1.create();cert.subject.getField = function(sn) {return _getAttribute(cert.subject, sn);};cert.subject.addField = function(attr) {_fillMissingFields([attr]);cert.subject.attributes.push(attr);};cert.subject.attributes = pki.RDNAttributesAsArray(capture.certSubject, smd);if(capture.certSubjectUniqueId) {cert.subject.uniqueId = capture.certSubjectUniqueId;}cert.subject.hash = smd.digest().toHex();// handle extensionsif(capture.certExtensions) {cert.extensions = pki.certificateExtensionsFromAsn1(capture.certExtensions);} else {cert.extensions = [];}// convert RSA public key from ASN.1cert.publicKey = pki.publicKeyFromAsn1(capture.subjectPublicKeyInfo);return cert;};/*** Converts an ASN.1 extensions object (with extension sequences as its* values) into an array of extension objects with types and values.** Supported extensions:** id-ce-keyUsage OBJECT IDENTIFIER ::=  { id-ce 15 }* KeyUsage ::= BIT STRING {*   digitalSignature        (0),*   nonRepudiation          (1),*   keyEncipherment         (2),*   dataEncipherment        (3),*   keyAgreement            (4),*   keyCertSign             (5),*   cRLSign                 (6),*   encipherOnly            (7),*   decipherOnly            (8)* }** id-ce-basicConstraints OBJECT IDENTIFIER ::=  { id-ce 19 }* BasicConstraints ::= SEQUENCE {*   cA                      BOOLEAN DEFAULT FALSE,*   pathLenConstraint       INTEGER (0..MAX) OPTIONAL* }** subjectAltName EXTENSION ::= {*   SYNTAX GeneralNames*   IDENTIFIED BY id-ce-subjectAltName* }** GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName** GeneralName ::= CHOICE {*   otherName      [0] INSTANCE OF OTHER-NAME,*   rfc822Name     [1] IA5String,*   dNSName        [2] IA5String,*   x400Address    [3] ORAddress,*   directoryName  [4] Name,*   ediPartyName   [5] EDIPartyName,*   uniformResourceIdentifier [6] IA5String,*   IPAddress      [7] OCTET STRING,*   registeredID   [8] OBJECT IDENTIFIER* }** OTHER-NAME ::= TYPE-IDENTIFIER** EDIPartyName ::= SEQUENCE {*   nameAssigner [0] DirectoryString {ub-name} OPTIONAL,*   partyName    [1] DirectoryString {ub-name}* }** @param exts the extensions ASN.1 with extension sequences to parse.** @return the array.*/pki.certificateExtensionsFromAsn1 = function(exts) {var rval = [];for(var i = 0; i < exts.value.length; ++i) {// get extension sequencevar extseq = exts.value[i];for(var ei = 0; ei < extseq.value.length; ++ei) {rval.push(pki.certificateExtensionFromAsn1(extseq.value[ei]));}}return rval;};/*** Parses a single certificate extension from ASN.1.** @param ext the extension in ASN.1 format.** @return the parsed extension as an object.*/pki.certificateExtensionFromAsn1 = function(ext) {// an extension has:// [0] extnID      OBJECT IDENTIFIER// [1] critical    BOOLEAN DEFAULT FALSE// [2] extnValue   OCTET STRINGvar e = {};e.id = asn1.derToOid(ext.value[0].value);e.critical = false;if(ext.value[1].type === asn1.Type.BOOLEAN) {e.critical = (ext.value[1].value.charCodeAt(0) !== 0x00);e.value = ext.value[2].value;} else {e.value = ext.value[1].value;}// if the oid is known, get its nameif(e.id in oids) {e.name = oids[e.id];// handle key usageif(e.name === 'keyUsage') {// get value as BIT STRINGvar ev = asn1.fromDer(e.value);var b2 = 0x00;var b3 = 0x00;if(ev.value.length > 1) {// skip first byte, just indicates unused bits which// will be padded with 0s anyway// get bytes with flag bitsb2 = ev.value.charCodeAt(1);b3 = ev.value.length > 2 ? ev.value.charCodeAt(2) : 0;}// set flagse.digitalSignature = (b2 & 0x80) === 0x80;e.nonRepudiation = (b2 & 0x40) === 0x40;e.keyEncipherment = (b2 & 0x20) === 0x20;e.dataEncipherment = (b2 & 0x10) === 0x10;e.keyAgreement = (b2 & 0x08) === 0x08;e.keyCertSign = (b2 & 0x04) === 0x04;e.cRLSign = (b2 & 0x02) === 0x02;e.encipherOnly = (b2 & 0x01) === 0x01;e.decipherOnly = (b3 & 0x80) === 0x80;} else if(e.name === 'basicConstraints') {// handle basic constraints// get value as SEQUENCEvar ev = asn1.fromDer(e.value);// get cA BOOLEAN flag (defaults to false)if(ev.value.length > 0 && ev.value[0].type === asn1.Type.BOOLEAN) {e.cA = (ev.value[0].value.charCodeAt(0) !== 0x00);} else {e.cA = false;}// get path length constraintvar value = null;if(ev.value.length > 0 && ev.value[0].type === asn1.Type.INTEGER) {value = ev.value[0].value;} else if(ev.value.length > 1) {value = ev.value[1].value;}if(value !== null) {e.pathLenConstraint = asn1.derToInteger(value);}} else if(e.name === 'extKeyUsage') {// handle extKeyUsage// value is a SEQUENCE of OIDsvar ev = asn1.fromDer(e.value);for(var vi = 0; vi < ev.value.length; ++vi) {var oid = asn1.derToOid(ev.value[vi].value);if(oid in oids) {e[oids[oid]] = true;} else {e[oid] = true;}}} else if(e.name === 'nsCertType') {// handle nsCertType// get value as BIT STRINGvar ev = asn1.fromDer(e.value);var b2 = 0x00;if(ev.value.length > 1) {// skip first byte, just indicates unused bits which// will be padded with 0s anyway// get bytes with flag bitsb2 = ev.value.charCodeAt(1);}// set flagse.client = (b2 & 0x80) === 0x80;e.server = (b2 & 0x40) === 0x40;e.email = (b2 & 0x20) === 0x20;e.objsign = (b2 & 0x10) === 0x10;e.reserved = (b2 & 0x08) === 0x08;e.sslCA = (b2 & 0x04) === 0x04;e.emailCA = (b2 & 0x02) === 0x02;e.objCA = (b2 & 0x01) === 0x01;} else if(e.name === 'subjectAltName' ||e.name === 'issuerAltName') {// handle subjectAltName/issuerAltNamee.altNames = [];// ev is a SYNTAX SEQUENCEvar gn;var ev = asn1.fromDer(e.value);for(var n = 0; n < ev.value.length; ++n) {// get GeneralNamegn = ev.value[n];var altName = {type: gn.type,value: gn.value};e.altNames.push(altName);// Note: Support for types 1,2,6,7,8switch(gn.type) {// rfc822Namecase 1:// dNSNamecase 2:// uniformResourceIdentifier (URI)case 6:break;// IPAddresscase 7:// convert to IPv4/IPv6 string representationaltName.ip = forge.util.bytesToIP(gn.value);break;// registeredIDcase 8:altName.oid = asn1.derToOid(gn.value);break;default:// unsupported}}} else if(e.name === 'subjectKeyIdentifier') {// value is an OCTETSTRING w/the hash of the key-type specific// public key structure (eg: RSAPublicKey)var ev = asn1.fromDer(e.value);e.subjectKeyIdentifier = forge.util.bytesToHex(ev.value);}}return e;};/*** Converts a PKCS#10 certification request (CSR) from an ASN.1 object.** Note: If the certification request is to be verified then compute hash* should be set to true. There is currently no implementation for converting* a certificate back to ASN.1 so the CertificationRequestInfo part of the* ASN.1 object needs to be scanned before the csr object is created.** @param obj the asn1 representation of a PKCS#10 certification request (CSR).* @param computeHash true to compute the hash for verification.** @return the certification request (CSR).*/pki.certificationRequestFromAsn1 = function(obj, computeHash) {// validate certification request and capture datavar capture = {};var errors = [];if(!asn1.validate(obj, certificationRequestValidator, capture, errors)) {var error = new Error('Cannot read PKCS#10 certificate request. ' +'ASN.1 object is not a PKCS#10 CertificationRequest.');error.errors = errors;throw error;}// get oidvar oid = asn1.derToOid(capture.publicKeyOid);if(oid !== pki.oids.rsaEncryption) {throw new Error('Cannot read public key. OID is not RSA.');}// create certification requestvar csr = pki.createCertificationRequest();csr.version = capture.csrVersion ? capture.csrVersion.charCodeAt(0) : 0;csr.signatureOid = forge.asn1.derToOid(capture.csrSignatureOid);csr.signatureParameters = _readSignatureParameters(csr.signatureOid, capture.csrSignatureParams, true);csr.siginfo.algorithmOid = forge.asn1.derToOid(capture.csrSignatureOid);csr.siginfo.parameters = _readSignatureParameters(csr.siginfo.algorithmOid, capture.csrSignatureParams, false);csr.signature = capture.csrSignature;// keep CertificationRequestInfo to preserve signature when exportingcsr.certificationRequestInfo = capture.certificationRequestInfo;if(computeHash) {// check signature OID for supported signature typescsr.md = null;if(csr.signatureOid in oids) {var oid = oids[csr.signatureOid];switch(oid) {case 'sha1WithRSAEncryption':csr.md = forge.md.sha1.create();break;case 'md5WithRSAEncryption':csr.md = forge.md.md5.create();break;case 'sha256WithRSAEncryption':csr.md = forge.md.sha256.create();break;case 'sha384WithRSAEncryption':csr.md = forge.md.sha384.create();break;case 'sha512WithRSAEncryption':csr.md = forge.md.sha512.create();break;case 'RSASSA-PSS':csr.md = forge.md.sha256.create();break;}}if(csr.md === null) {var error = new Error('Could not compute certification request digest. ' +'Unknown signature OID.');error.signatureOid = csr.signatureOid;throw error;}// produce DER formatted CertificationRequestInfo and digest itvar bytes = asn1.toDer(csr.certificationRequestInfo);csr.md.update(bytes.getBytes());}// handle subject, build subject message digestvar smd = forge.md.sha1.create();csr.subject.getField = function(sn) {return _getAttribute(csr.subject, sn);};csr.subject.addField = function(attr) {_fillMissingFields([attr]);csr.subject.attributes.push(attr);};csr.subject.attributes = pki.RDNAttributesAsArray(capture.certificationRequestInfoSubject, smd);csr.subject.hash = smd.digest().toHex();// convert RSA public key from ASN.1csr.publicKey = pki.publicKeyFromAsn1(capture.subjectPublicKeyInfo);// convert attributes from ASN.1csr.getAttribute = function(sn) {return _getAttribute(csr, sn);};csr.addAttribute = function(attr) {_fillMissingFields([attr]);csr.attributes.push(attr);};csr.attributes = pki.CRIAttributesAsArray(capture.certificationRequestInfoAttributes || []);return csr;};/*** Creates an empty certification request (a CSR or certificate signing* request). Once created, its public key and attributes can be set and then* it can be signed.** @return the empty certification request.*/pki.createCertificationRequest = function() {var csr = {};csr.version = 0x00;csr.signatureOid = null;csr.signature = null;csr.siginfo = {};csr.siginfo.algorithmOid = null;csr.subject = {};csr.subject.getField = function(sn) {return _getAttribute(csr.subject, sn);};csr.subject.addField = function(attr) {_fillMissingFields([attr]);csr.subject.attributes.push(attr);};csr.subject.attributes = [];csr.subject.hash = null;csr.publicKey = null;csr.attributes = [];csr.getAttribute = function(sn) {return _getAttribute(csr, sn);};csr.addAttribute = function(attr) {_fillMissingFields([attr]);csr.attributes.push(attr);};csr.md = null;/*** Sets the subject of this certification request.** @param attrs the array of subject attributes to use.*/csr.setSubject = function(attrs) {// set new attributes_fillMissingFields(attrs);csr.subject.attributes = attrs;csr.subject.hash = null;};/*** Sets the attributes of this certification request.** @param attrs the array of attributes to use.*/csr.setAttributes = function(attrs) {// set new attributes_fillMissingFields(attrs);csr.attributes = attrs;};/*** Signs this certification request using the given private key.** @param key the private key to sign with.* @param md the message digest object to use (defaults to forge.md.sha1).*/csr.sign = function(key, md) {// TODO: get signature OID from private keycsr.md = md || forge.md.sha1.create();var algorithmOid = oids[csr.md.algorithm + 'WithRSAEncryption'];if(!algorithmOid) {var error = new Error('Could not compute certification request digest. ' +'Unknown message digest algorithm OID.');error.algorithm = csr.md.algorithm;throw error;}csr.signatureOid = csr.siginfo.algorithmOid = algorithmOid;// get CertificationRequestInfo, convert to DERcsr.certificationRequestInfo = pki.getCertificationRequestInfo(csr);var bytes = asn1.toDer(csr.certificationRequestInfo);// digest and signcsr.md.update(bytes.getBytes());csr.signature = key.sign(csr.md);};/*** Attempts verify the signature on the passed certification request using* its public key.** A CSR that has been exported to a file in PEM format can be verified using* OpenSSL using this command:** openssl req -in <the-csr-pem-file> -verify -noout -text** @return true if verified, false if not.*/csr.verify = function() {var rval = false;var md = csr.md;if(md === null) {// check signature OID for supported signature typesif(csr.signatureOid in oids) {// TODO: create DRY `OID to md` functionvar oid = oids[csr.signatureOid];switch(oid) {case 'sha1WithRSAEncryption':md = forge.md.sha1.create();break;case 'md5WithRSAEncryption':md = forge.md.md5.create();break;case 'sha256WithRSAEncryption':md = forge.md.sha256.create();break;case 'sha384WithRSAEncryption':md = forge.md.sha384.create();break;case 'sha512WithRSAEncryption':md = forge.md.sha512.create();break;case 'RSASSA-PSS':md = forge.md.sha256.create();break;}}if(md === null) {var error = new Error('Could not compute certification request digest. ' +'Unknown signature OID.');error.signatureOid = csr.signatureOid;throw error;}// produce DER formatted CertificationRequestInfo and digest itvar cri = csr.certificationRequestInfo ||pki.getCertificationRequestInfo(csr);var bytes = asn1.toDer(cri);md.update(bytes.getBytes());}if(md !== null) {var scheme;switch(csr.signatureOid) {case oids.sha1WithRSAEncryption:/* use PKCS#1 v1.5 padding scheme */break;case oids['RSASSA-PSS']:var hash, mgf;/* initialize mgf */hash = oids[csr.signatureParameters.mgf.hash.algorithmOid];if(hash === undefined || forge.md[hash] === undefined) {var error = new Error('Unsupported MGF hash function.');error.oid = csr.signatureParameters.mgf.hash.algorithmOid;error.name = hash;throw error;}mgf = oids[csr.signatureParameters.mgf.algorithmOid];if(mgf === undefined || forge.mgf[mgf] === undefined) {var error = new Error('Unsupported MGF function.');error.oid = csr.signatureParameters.mgf.algorithmOid;error.name = mgf;throw error;}mgf = forge.mgf[mgf].create(forge.md[hash].create());/* initialize hash function */hash = oids[csr.signatureParameters.hash.algorithmOid];if(hash === undefined || forge.md[hash] === undefined) {var error = new Error('Unsupported RSASSA-PSS hash function.');error.oid = csr.signatureParameters.hash.algorithmOid;error.name = hash;throw error;}scheme = forge.pss.create(forge.md[hash].create(), mgf,csr.signatureParameters.saltLength);break;}// verify signature on csr using its public keyrval = csr.publicKey.verify(md.digest().getBytes(), csr.signature, scheme);}return rval;};return csr;};/*** Converts an X.509 subject or issuer to an ASN.1 RDNSequence.** @param obj the subject or issuer (distinguished name).** @return the ASN.1 RDNSequence.*/function _dnToAsn1(obj) {// create an empty RDNSequencevar rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);// iterate over attributesvar attr, set;var attrs = obj.attributes;for(var i = 0; i < attrs.length; ++i) {attr = attrs[i];var value = attr.value;// reuse tag class for attribute value if availablevar valueTagClass = asn1.Type.PRINTABLESTRING;if('valueTagClass' in attr) {valueTagClass = attr.valueTagClass;if(valueTagClass === asn1.Type.UTF8) {value = forge.util.encodeUtf8(value);}// FIXME: handle more encodings}// create a RelativeDistinguishedName set// each value in the set is an AttributeTypeAndValue first// containing the type (an OID) and second the valueset = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// AttributeTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(attr.type).getBytes()),// AttributeValueasn1.create(asn1.Class.UNIVERSAL, valueTagClass, false, value)])]);rval.value.push(set);}return rval;}/*** Gets all printable attributes (typically of an issuer or subject) in a* simplified JSON format for display.** @param attrs the attributes.** @return the JSON for display.*/function _getAttributesAsJson(attrs) {var rval = {};for(var i = 0; i < attrs.length; ++i) {var attr = attrs[i];if(attr.shortName && (attr.valueTagClass === asn1.Type.UTF8 ||attr.valueTagClass === asn1.Type.PRINTABLESTRING ||attr.valueTagClass === asn1.Type.IA5STRING)) {var value = attr.value;if(attr.valueTagClass === asn1.Type.UTF8) {value = forge.util.encodeUtf8(attr.value);}if(!(attr.shortName in rval)) {rval[attr.shortName] = value;} else if(forge.util.isArray(rval[attr.shortName])) {rval[attr.shortName].push(value);} else {rval[attr.shortName] = [rval[attr.shortName], value];}}}return rval;}/*** Fills in missing fields in attributes.** @param attrs the attributes to fill missing fields in.*/function _fillMissingFields(attrs) {var attr;for(var i = 0; i < attrs.length; ++i) {attr = attrs[i];// populate missing nameif(typeof attr.name === 'undefined') {if(attr.type && attr.type in pki.oids) {attr.name = pki.oids[attr.type];} else if(attr.shortName && attr.shortName in _shortNames) {attr.name = pki.oids[_shortNames[attr.shortName]];}}// populate missing type (OID)if(typeof attr.type === 'undefined') {if(attr.name && attr.name in pki.oids) {attr.type = pki.oids[attr.name];} else {var error = new Error('Attribute type not specified.');error.attribute = attr;throw error;}}// populate missing shortnameif(typeof attr.shortName === 'undefined') {if(attr.name && attr.name in _shortNames) {attr.shortName = _shortNames[attr.name];}}// convert extensions to valueif(attr.type === oids.extensionRequest) {attr.valueConstructed = true;attr.valueTagClass = asn1.Type.SEQUENCE;if(!attr.value && attr.extensions) {attr.value = [];for(var ei = 0; ei < attr.extensions.length; ++ei) {attr.value.push(pki.certificateExtensionToAsn1(_fillMissingExtensionFields(attr.extensions[ei])));}}}if(typeof attr.value === 'undefined') {var error = new Error('Attribute value not specified.');error.attribute = attr;throw error;}}}/*** Fills in missing fields in certificate extensions.** @param e the extension.* @param [options] the options to use.*          [cert] the certificate the extensions are for.** @return the extension.*/function _fillMissingExtensionFields(e, options) {options = options || {};// populate missing nameif(typeof e.name === 'undefined') {if(e.id && e.id in pki.oids) {e.name = pki.oids[e.id];}}// populate missing idif(typeof e.id === 'undefined') {if(e.name && e.name in pki.oids) {e.id = pki.oids[e.name];} else {var error = new Error('Extension ID not specified.');error.extension = e;throw error;}}if(typeof e.value !== 'undefined') {return e;}// handle missing value:// value is a BIT STRINGif(e.name === 'keyUsage') {// build flagsvar unused = 0;var b2 = 0x00;var b3 = 0x00;if(e.digitalSignature) {b2 |= 0x80;unused = 7;}if(e.nonRepudiation) {b2 |= 0x40;unused = 6;}if(e.keyEncipherment) {b2 |= 0x20;unused = 5;}if(e.dataEncipherment) {b2 |= 0x10;unused = 4;}if(e.keyAgreement) {b2 |= 0x08;unused = 3;}if(e.keyCertSign) {b2 |= 0x04;unused = 2;}if(e.cRLSign) {b2 |= 0x02;unused = 1;}if(e.encipherOnly) {b2 |= 0x01;unused = 0;}if(e.decipherOnly) {b3 |= 0x80;unused = 7;}// create bit stringvar value = String.fromCharCode(unused);if(b3 !== 0) {value += String.fromCharCode(b2) + String.fromCharCode(b3);} else if(b2 !== 0) {value += String.fromCharCode(b2);}e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, value);} else if(e.name === 'basicConstraints') {// basicConstraints is a SEQUENCEe.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);// cA BOOLEAN flag defaults to falseif(e.cA) {e.value.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BOOLEAN, false,String.fromCharCode(0xFF)));}if('pathLenConstraint' in e) {e.value.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(e.pathLenConstraint).getBytes()));}} else if(e.name === 'extKeyUsage') {// extKeyUsage is a SEQUENCE of OIDse.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);var seq = e.value.value;for(var key in e) {if(e[key] !== true) {continue;}// key is name in OID mapif(key in oids) {seq.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID,false, asn1.oidToDer(oids[key]).getBytes()));} else if(key.indexOf('.') !== -1) {// assume key is an OIDseq.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID,false, asn1.oidToDer(key).getBytes()));}}} else if(e.name === 'nsCertType') {// nsCertType is a BIT STRING// build flagsvar unused = 0;var b2 = 0x00;if(e.client) {b2 |= 0x80;unused = 7;}if(e.server) {b2 |= 0x40;unused = 6;}if(e.email) {b2 |= 0x20;unused = 5;}if(e.objsign) {b2 |= 0x10;unused = 4;}if(e.reserved) {b2 |= 0x08;unused = 3;}if(e.sslCA) {b2 |= 0x04;unused = 2;}if(e.emailCA) {b2 |= 0x02;unused = 1;}if(e.objCA) {b2 |= 0x01;unused = 0;}// create bit stringvar value = String.fromCharCode(unused);if(b2 !== 0) {value += String.fromCharCode(b2);}e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, value);} else if(e.name === 'subjectAltName' || e.name === 'issuerAltName') {// SYNTAX SEQUENCEe.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);var altName;for(var n = 0; n < e.altNames.length; ++n) {altName = e.altNames[n];var value = altName.value;// handle IPif(altName.type === 7 && altName.ip) {value = forge.util.bytesFromIP(altName.ip);if(value === null) {var error = new Error('Extension "ip" value is not a valid IPv4 or IPv6 address.');error.extension = e;throw error;}} else if(altName.type === 8) {// handle OIDif(altName.oid) {value = asn1.oidToDer(asn1.oidToDer(altName.oid));} else {// deprecated ... convert value to OIDvalue = asn1.oidToDer(value);}}e.value.value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, altName.type, false,value));}} else if(e.name === 'nsComment' && options.cert) {// sanity check value is ASCII (req'd) and not too bigif(!(/^[\x00-\x7F]*$/.test(e.comment)) ||(e.comment.length < 1) || (e.comment.length > 128)) {throw new Error('Invalid "nsComment" content.');}// IA5STRING opaque commente.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.IA5STRING, false, e.comment);} else if(e.name === 'subjectKeyIdentifier' && options.cert) {var ski = options.cert.generat###bjectKeyIdentifier();e.subjectKeyIdentifier = ski.toHex();// OCTETSTRING w/digeste.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, ski.getBytes());} else if(e.name === 'authorityKeyIdentifier' && options.cert) {// SYNTAX SEQUENCEe.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);var seq = e.value.value;if(e.keyIdentifier) {var keyIdentifier = (e.keyIdentifier === true ?options.cert.generat###bjectKeyIdentifier().getBytes() :e.keyIdentifier);seq.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, false, keyIdentifier));}if(e.authorityCertIssuer) {var authorityCertIssuer = [asn1.create(asn1.Class.CONTEXT_SPECIFIC, 4, true, [_dnToAsn1(e.authorityCertIssuer === true ?options.cert.issuer : e.authorityCertIssuer)])];seq.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, authorityCertIssuer));}if(e.serialNumber) {var serialNumber = forge.util.hexToBytes(e.serialNumber === true ?options.cert.serialNumber : e.serialNumber);seq.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, false, serialNumber));}} else if(e.name === 'cRLDistributionPoints') {e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);var seq = e.value.value;// Create sub SEQUENCE of DistributionPointNamevar subSeq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);// Create fullName CHOICEvar fullNameGeneralNames = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, []);var altName;for(var n = 0; n < e.altNames.length; ++n) {altName = e.altNames[n];var value = altName.value;// handle IPif(altName.type === 7 && altName.ip) {value = forge.util.bytesFromIP(altName.ip);if(value === null) {var error = new Error('Extension "ip" value is not a valid IPv4 or IPv6 address.');error.extension = e;throw error;}} else if(altName.type === 8) {// handle OIDif(altName.oid) {value = asn1.oidToDer(asn1.oidToDer(altName.oid));} else {// deprecated ... convert value to OIDvalue = asn1.oidToDer(value);}}fullNameGeneralNames.value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, altName.type, false,value));}// Add to the parent SEQUENCEsubSeq.value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [fullNameGeneralNames]));seq.push(subSeq);}// ensure value has been defined by nowif(typeof e.value === 'undefined') {var error = new Error('Extension value not specified.');error.extension = e;throw error;}return e;}/*** Convert signature parameters object to ASN.1** @param {String} oid Signature algorithm OID* @param params The signature parametrs object* @return ASN.1 object representing signature parameters*/function _signatureParametersToAsn1(oid, params) {switch(oid) {case oids['RSASSA-PSS']:var parts = [];if(params.hash.algorithmOid !== undefined) {parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(params.hash.algorithmOid).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')])]));}if(params.mgf.algorithmOid !== undefined) {parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(params.mgf.algorithmOid).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(params.mgf.hash.algorithmOid).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')])])]));}if(params.saltLength !== undefined) {parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(params.saltLength).getBytes())]));}return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, parts);default:return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '');}}/*** Converts a certification request's attributes to an ASN.1 set of* CRIAttributes.** @param csr certification request.** @return the ASN.1 set of CRIAttributes.*/function _CRIAttributesToAsn1(csr) {// create an empty context-specific containervar rval = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, []);// no attributes, return empty containerif(csr.attributes.length === 0) {return rval;}// each attribute has a sequence with a type and a set of valuesvar attrs = csr.attributes;for(var i = 0; i < attrs.length; ++i) {var attr = attrs[i];var value = attr.value;// reuse tag class for attribute value if availablevar valueTagClass = asn1.Type.UTF8;if('valueTagClass' in attr) {valueTagClass = attr.valueTagClass;}if(valueTagClass === asn1.Type.UTF8) {value = forge.util.encodeUtf8(value);}var valueConstructed = false;if('valueConstructed' in attr) {valueConstructed = attr.valueConstructed;}// FIXME: handle more encodings// create a RelativeDistinguishedName set// each value in the set is an AttributeTypeAndValue first// containing the type (an OID) and second the valuevar seq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// AttributeTypeasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(attr.type).getBytes()),asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [// AttributeValueasn1.create(asn1.Class.UNIVERSAL, valueTagClass, valueConstructed, value)])]);rval.value.push(seq);}return rval;}var jan_1_1950 = new Date('1950-01-01T00:00:00Z');var jan_1_2050 = new Date('2050-01-01T00:00:00Z');/*** Converts a Date object to ASN.1* Handles the different format before and after 1st January 2050** @param date date object.** @return the ASN.1 object representing the date.*/function _dateToAsn1(date) {if(date >= jan_1_1950 && date < jan_1_2050) {return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,asn1.dateToUtcTime(date));} else {return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.GENERALIZEDTIME, false,asn1.dateToGeneralizedTime(date));}}/*** Gets the ASN.1 TBSCertificate part of an X.509v3 certificate.** @param cert the certificate.** @return the asn1 TBSCertificate.*/pki.getTBSCertificate = function(cert) {// TBSCertificatevar notBefore = _dateToAsn1(cert.validity.notBefore);var notAfter = _dateToAsn1(cert.validity.notAfter);var tbs = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// versionasn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [// integerasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(cert.version).getBytes())]),// serialNumberasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,forge.util.hexToBytes(cert.serialNumber)),// signatureasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(cert.siginfo.algorithmOid).getBytes()),// parameters_signatureParametersToAsn1(cert.siginfo.algorithmOid, cert.siginfo.parameters)]),// issuer_dnToAsn1(cert.issuer),// validityasn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [notBefore,notAfter]),// subject_dnToAsn1(cert.subject),// SubjectPublicKeyInfopki.publicKeyToAsn1(cert.publicKey)]);if(cert.issuer.uniqueId) {// issuerUniqueID (optional)tbs.value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,// TODO: support arbitrary bit length idsString.fromCharCode(0x00) +cert.issuer.uniqueId)]));}if(cert.subject.uniqueId) {// subjectUniqueID (optional)tbs.value.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,// TODO: support arbitrary bit length idsString.fromCharCode(0x00) +cert.subject.uniqueId)]));}if(cert.extensions.length > 0) {// extensions (optional)tbs.value.push(pki.certificateExtensionsToAsn1(cert.extensions));}return tbs;};/*** Gets the ASN.1 CertificationRequestInfo part of a* PKCS#10 CertificationRequest.** @param csr the certification request.** @return the asn1 CertificationRequestInfo.*/pki.getCertificationRequestInfo = function(csr) {// CertificationRequestInfovar cri = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// versionasn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,asn1.integerToDer(csr.version).getBytes()),// subject_dnToAsn1(csr.subject),// SubjectPublicKeyInfopki.publicKeyToAsn1(csr.publicKey),// attributes_CRIAttributesToAsn1(csr)]);return cri;};/*** Converts a DistinguishedName (subject or issuer) to an ASN.1 object.** @param dn the DistinguishedName.** @return the asn1 representation of a DistinguishedName.*/pki.distinguishedNameToAsn1 = function(dn) {return _dnToAsn1(dn);};/*** Converts an X.509v3 RSA certificate to an ASN.1 object.** @param cert the certificate.** @return the asn1 representation of an X.509v3 RSA certificate.*/pki.certificateToAsn1 = function(cert) {// prefer cached TBSCertificate over generating onevar tbsCertificate = cert.tbsCertificate || pki.getTBSCertificate(cert);// Certificatereturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// TBSCertificatetbsCertificate,// AlgorithmIdentifier (signature algorithm)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(cert.signatureOid).getBytes()),// parameters_signatureParametersToAsn1(cert.signatureOid, cert.signatureParameters)]),// SignatureValueasn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,String.fromCharCode(0x00) + cert.signature)]);};/*** Converts X.509v3 certificate extensions to ASN.1.** @param exts the extensions to convert.** @return the extensions in ASN.1 format.*/pki.certificateExtensionsToAsn1 = function(exts) {// create top-level extension containervar rval = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 3, true, []);// create extension sequence (stores a sequence for each extension)var seq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);rval.value.push(seq);for(var i = 0; i < exts.length; ++i) {seq.value.push(pki.certificateExtensionToAsn1(exts[i]));}return rval;};/*** Converts a single certificate extension to ASN.1.** @param ext the extension to convert.** @return the extension in ASN.1 format.*/pki.certificateExtensionToAsn1 = function(ext) {// create a sequence for each extensionvar extseq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);// extnID (OID)extseq.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(ext.id).getBytes()));// critical defaults to falseif(ext.critical) {// critical BOOLEAN DEFAULT FALSEextseq.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BOOLEAN, false,String.fromCharCode(0xFF)));}var value = ext.value;if(typeof ext.value !== 'string') {// value is asn.1value = asn1.toDer(value).getBytes();}// extnValue (OCTET STRING)extseq.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, value));return extseq;};/*** Converts a PKCS#10 certification request to an ASN.1 object.** @param csr the certification request.** @return the asn1 representation of a certification request.*/pki.certificationRequestToAsn1 = function(csr) {// prefer cached CertificationRequestInfo over generating onevar cri = csr.certificationRequestInfo ||pki.getCertificationRequestInfo(csr);// Certificatereturn asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// CertificationRequestInfocri,// AlgorithmIdentifier (signature algorithm)asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithmasn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,asn1.oidToDer(csr.signatureOid).getBytes()),// parameters_signatureParametersToAsn1(csr.signatureOid, csr.signatureParameters)]),// signatureasn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,String.fromCharCode(0x00) + csr.signature)]);};/*** Creates a CA store.** @param certs an optional array of certificate objects or PEM-formatted*          certificate strings to add to the CA store.** @return the CA store.*/pki.createCaStore = function(certs) {// create CA storevar caStore = {// stored certificatescerts: {}};/*** Gets the certificate that issued the passed certificate or its* 'parent'.** @param cert the certificate to get the parent for.** @return the parent certificate or null if none was found.*/caStore.getIssuer = function(cert) {var rval = getBySubject(cert.issuer);// see if there are multiple matches/*if(forge.util.isArray(rval)) {// TODO: resolve multiple matches by checking// authorityKey/subjectKey/issuerUniqueID/other identifiers, etc.// FIXME: or alternatively do authority key mapping// if possible (X.509v1 certs can't work?)throw new Error('Resolving multiple issuer matches not implemented yet.');}*/return rval;};/*** Adds a trusted certificate to the store.** @param cert the certificate to add as a trusted certificate (either a*          pki.certificate object or a PEM-formatted certificate).*/caStore.addCertificate = function(cert) {// convert from pem if necessaryif(typeof cert === 'string') {cert = forge.pki.certificateFromPem(cert);}ensur###bjectHasHash(cert.subject);if(!caStore.hasCertificate(cert)) { // avoid duplicate certificates in storeif(cert.subject.hash in caStore.certs) {// subject hash already exists, append to arrayvar tmp = caStore.certs[cert.subject.hash];if(!forge.util.isArray(tmp)) {tmp = [tmp];}tmp.push(cert);caStore.certs[cert.subject.hash] = tmp;} else {caStore.certs[cert.subject.hash] = cert;}}};/*** Checks to see if the given certificate is in the store.** @param cert the certificate to check (either a pki.certificate or a*          PEM-formatted certificate).** @return true if the certificate is in the store, false if not.*/caStore.hasCertificate = function(cert) {// convert from pem if necessaryif(typeof cert === 'string') {cert = forge.pki.certificateFromPem(cert);}var match = getBySubject(cert.subject);if(!match) {return false;}if(!forge.util.isArray(match)) {match = [match];}// compare DER-encoding of certificatesvar der1 = asn1.toDer(pki.certificateToAsn1(cert)).getBytes();for(var i = 0; i < match.length; ++i) {var der2 = asn1.toDer(pki.certificateToAsn1(match[i])).getBytes();if(der1 === der2) {return true;}}return false;};/*** Lists all of the certificates kept in the store.** @return an array of all of the pki.certificate objects in the store.*/caStore.listAllCertificates = function() {var certList = [];for(var hash in caStore.certs) {if(caStore.certs.hasOwnProperty(hash)) {var value = caStore.certs[hash];if(!forge.util.isArray(value)) {certList.push(value);} else {for(var i = 0; i < value.length; ++i) {certList.push(value[i]);}}}}return certList;};/*** Removes a certificate from the store.** @param cert the certificate to remove (either a pki.certificate or a*          PEM-formatted certificate).** @return the certificate that was removed or null if the certificate*           wasn't in store.*/caStore.removeCertificate = function(cert) {var r###lt;// convert from pem if necessaryif(typeof cert === 'string') {cert = forge.pki.certificateFromPem(cert);}ensur###bjectHasHash(cert.subject);if(!caStore.hasCertificate(cert)) {return null;}var match = getBySubject(cert.subject);if(!forge.util.isArray(match)) {r###lt = caStore.certs[cert.subject.hash];delete caStore.certs[cert.subject.hash];return r###lt;}// compare DER-encoding of certificatesvar der1 = asn1.toDer(pki.certificateToAsn1(cert)).getBytes();for(var i = 0; i < match.length; ++i) {var der2 = asn1.toDer(pki.certificateToAsn1(match[i])).getBytes();if(der1 === der2) {r###lt = match[i];match.splice(i, 1);}}if(match.length === 0) {delete caStore.certs[cert.subject.hash];}return r###lt;};function getBySubject(subject) {ensur###bjectHasHash(subject);return caStore.certs[subject.hash] || null;}function ensur###bjectHasHash(subject) {// produce subject hash if it doesn't existif(!subject.hash) {var md = forge.md.sha1.create();subject.attributes = pki.RDNAttributesAsArray(_dnToAsn1(subject), md);subject.hash = md.digest().toHex();}}// auto-add passed in certsif(certs) {// parse PEM-formatted certificates as necessaryfor(var i = 0; i < certs.length; ++i) {var cert = certs[i];caStore.addCertificate(cert);}}return caStore;};/*** Certificate verification errors, based on TLS.*/pki.certificateError = {bad_certificate: 'forge.pki.BadCertificate',unsupported_certificate: 'forge.pki.UnsupportedCertificate',certificate_revoked: 'forge.pki.CertificateRevoked',certificate_expired: 'forge.pki.CertificateExpired',certificate_unknown: 'forge.pki.CertificateUnknown',unknown_ca: 'forge.pki.UnknownCertificateAuthority'};/*** Verifies a certificate chain against the given Certificate Authority store* with an optional custom verify callback.** @param caStore a certificate store to verify against.* @param chain the certificate chain to verify, with the root or highest*          authority at the end (an array of certificates).* @param options a callback to be called for every certificate in the chain or*                  an object with:*                  verify a callback to be called for every certificate in the*                    chain*                  validityCheckDate the date against which the certificate*                    validity period should be checked. Pass null to not check*                    the validity period. By default, the current date is used.** The verify callback has the following signature:** verified - Set to true if certificate was verified, otherwise the*   pki.certificateError for why the certificate failed.* depth - The current index in the chain, where 0 is the end point's cert.* certs - The certificate chain, *NOTE* an empty chain indicates an anonymous*   end point.** The function returns true on success and on failure either the appropriate* pki.certificateError or an object with 'error' set to the appropriate* pki.certificateError and 'message' set to a custom error message.** @return true if successful, error thrown if not.*/pki.verifyCertificateChain = function(caStore, chain, options) {/* From: RFC3280 - Internet X.509 Public Key Infrastructure CertificateSection 6: Certification Path ValidationSee inline parentheticals related to this particular implementation.The primary goal of path validation is to verify the binding betweena subject distinguished name or a subject alternative name and subjectpublic key, as represented in the end entity certificate, based on thepublic key of the trust anchor. This requires obtaining a sequence ofcertificates that support that binding. That sequence should be providedin the passed 'chain'. The trust anchor should be in the given CAstore. The 'end entity' certificate is the certificate provided by theend point (typically a server) and is the first in the chain.To meet this goal, the path validation process verifies, among otherthings, that a prospective certification path (a sequence of ncertificates or a 'chain') satisfies the following conditions:(a) for all x in {1, ..., n-1}, the subject of certificate x isthe issuer of certificate x+1;(b) certificate 1 is issued by the trust anchor;(c) certificate n is the certificate to be validated; and(d) for all x in {1, ..., n}, the certificate was valid at thetime in question.Note that here 'n' is index 0 in the chain and 1 is the last certificatein the chain and it must be signed by a certificate in the connection'sCA store.The path validation process also determines the set of certificatepolicies that are valid for this path, based on the certificate policiesextension, policy mapping extension, policy constraints extension, andinhibit any-policy extension.Note: Policy mapping extension not supported (Not Required).Note: If the certificate has an unsupported critical extension, then itmust be rejected.Note: A certificate is self-issued if the DNs that appear in the subjectand issuer fields are identical and are not empty.The path validation algorithm assumes the following seven inputs areprovided to the path processing logic. What this specific implementationwill use is provided parenthetically:(a) a prospective certification path of length n (the 'chain')(b) the current date/time: ('now').(c) user-initial-policy-set: A set of certificate policy identifiersnaming the policies that are acceptable to the certificate user.The user-initial-policy-set contains the special value any-policyif the user is not concerned about certificate policy(Not implemented. Any policy is accepted).(d) trust anchor information, describing a CA that serves as a trustanchor for the certification path. The trust anchor informationincludes:(1)  the trusted issuer name,(2)  the trusted public key algorithm,(3)  the trusted public key, and(4)  optionally, the trusted public key parameters associatedwith the public key.(Trust anchors are provided via certificates in the CA store).The trust anchor information may be provided to the path processingprocedure in the form of a self-signed certificate. The trusted anchorinformation is trusted because it was delivered to the path processingprocedure by some trustworthy out-of-band procedure. If the trustedpublic key algorithm requires parameters, then the parameters areprovided along with the trusted public key (No parameters used in thisimplementation).(e) initial-policy-mapping-inhibit, which indicates if policy mapping isallowed in the certification path.(Not implemented, no policy checking)(f) initial-explicit-policy, which indicates if the path must be validfor at least one of the certificate policies in the user-initial-policy-set.(Not implemented, no policy checking)(g) initial-any-policy-inhibit, which indicates whether theanyPolicy OID should be processed if it is included in acertificate.(Not implemented, so any policy is valid provided that it isnot marked as critical) *//* Basic Path Processing:For each certificate in the 'chain', the following is checked:1. The certificate validity period includes the current time.2. The certificate was signed by its parent (where the parent is eitherthe next in the chain or from the CA store). Allow processing tocontinue to the next step if no parent is found but the certificate isin the CA store.3. TODO: The certificate has not been revoked.4. The certificate issuer name matches the parent's subject name.5. TODO: If the certificate is self-issued and not the final certificatein the chain, skip this step, otherwise verify that the subject nameis within one of the permitted subtrees of X.500 distinguished namesand that each of the alternative names in the subjectAltName extension(critical or non-critical) is within one of the permitted subtrees forthat name type.6. TODO: If the certificate is self-issued and not the final certificatein the chain, skip this step, otherwise verify that the subject nameis not within one of the excluded subtrees for X.500 distinguishednames and none of the subjectAltName extension names are excluded forthat name type.7. The other steps in the algorithm for basic path processing involvehandling the policy extension which is not presently supported in thisimplementation. Instead, if a critical policy extension is found, thecertificate is rejected as not supported.8. If the certificate is not the first or if its the only certificate inthe chain (having no parent from the CA store or is self-signed) and ithas a critical key usage extension, verify that the keyCertSign bit isset. If the key usage extension exists, verify that the basicconstraints extension exists. If the basic constraints extension exists,verify that the cA flag is set. If pathLenConstraint is set, ensure thatthe number of certificates that precede in the chain (come earlierin the chain as implemented below), excluding the very first in thechain (typically the end-entity one), isn't greater than thepathLenConstraint. This constraint limits the number of intermediateCAs that may appear below a CA before only end-entity certificatesmay be issued. */// if a verify callback is passed as the third parameter, package it within// the options object. This is to support a legacy function signature that// expected the verify callback as the third parameter.if(typeof options === 'function') {options = {verify: options};}options = options || {};// copy cert chain references to another array to protect against changes// in verify callbackchain = chain.slice(0);var certs = chain.slice(0);var validityCheckDate = options.validityCheckDate;// if no validityCheckDate is specified, default to the current date. Make// sure to maintain the value null because it indicates that the validity// period should not be checked.if(typeof validityCheckDate === 'undefined') {validityCheckDate = new Date();}// verify each cert in the chain using its parent, where the parent// is either the next in the chain or from the CA storevar first = true;var error = null;var depth = 0;do {var cert = chain.shift();var parent = null;var selfSigned = false;if(validityCheckDate) {// 1. check valid timeif(validityCheckDate < cert.validity.notBefore ||validityCheckDate > cert.validity.notAfter) {error = {message: 'Certificate is not valid yet or has expired.',error: pki.certificateError.certificate_expired,notBefore: cert.validity.notBefore,notAfter: cert.validity.notAfter,// TODO: we might want to reconsider renaming 'now' to// 'validityCheckDate' should this API be changed in the future.now: validityCheckDate};}}// 2. verify with parent from chain or CA storeif(error === null) {parent = chain[0] || caStore.getIssuer(cert);if(parent === null) {// check for self-signed certif(cert.isIssuer(cert)) {selfSigned = true;parent = cert;}}if(parent) {// FIXME: current CA store implementation might have multiple// certificates where the issuer can't be determined from the// certificate (happens rarely with, eg: old certificates) so normalize// by always putting parents into an array// TODO: there's may be an extreme degenerate case currently uncovered// where an old intermediate certificate seems to have a matching parent// but none of the parents actually verify ... but the intermediate// is in the CA and it should pass this check; needs investigationvar parents = parent;if(!forge.util.isArray(parents)) {parents = [parents];}// try to verify with each possible parent (typically only one)var verified = false;while(!verified && parents.length > 0) {parent = parents.shift();try {verified = parent.verify(cert);} catch(ex) {// failure to verify, don't care why, try next one}}if(!verified) {error = {message: 'Certificate signature is invalid.',error: pki.certificateError.bad_certificate};}}if(error === null && (!parent || selfSigned) &&!caStore.hasCertificate(cert)) {// no parent issuer and certificate itself is not trustederror = {message: 'Certificate is not trusted.',error: pki.certificateError.unknown_ca};}}// TODO: 3. check revoked// 4. check for matching issuer/subjectif(error === null && parent && !cert.isIssuer(parent)) {// parent is not issuererror = {message: 'Certificate issuer is invalid.',error: pki.certificateError.bad_certificate};}// 5. TODO: check names with permitted names tree// 6. TODO: check names against excluded names tree// 7. check for unsupported critical extensionsif(error === null) {// supported extensionsvar se = {keyUsage: true,basicConstraints: true};for(var i = 0; error === null && i < cert.extensions.length; ++i) {var ext = cert.extensions[i];if(ext.critical && !(ext.name in se)) {error = {message:'Certificate has an unsupported critical extension.',error: pki.certificateError.unsupported_certificate};}}}// 8. check for CA if cert is not first or is the only certificate// remaining in chain with no parent or is self-signedif(error === null &&(!first || (chain.length === 0 && (!parent || selfSigned)))) {// first check keyUsage extension and then basic constraintsvar bcExt = cert.getExtension('basicConstraints');var keyUsageExt = cert.getExtension('keyUsage');if(keyUsageExt !== null) {// keyCertSign must be true and there must be a basic// constraints extensionif(!keyUsageExt.keyCertSign || bcExt === null) {// bad certificateerror = {message:'Certificate keyUsage or basicConstraints conflict ' +'or indicate that the certificate is not a CA. ' +'If the certificate is the only one in the chain or ' +'isn\'t the first then the certificate must be a ' +'valid CA.',error: pki.certificateError.bad_certificate};}}// basic constraints cA flag must be setif(error === null && bcExt !== null && !bcExt.cA) {// bad certificateerror = {message:'Certificate basicConstraints indicates the certificate ' +'is not a CA.',error: pki.certificateError.bad_certificate};}// if error is not null and keyUsage is available, then we know it// has keyCertSign and there is a basic constraints extension too,// which means we can check pathLenConstraint (if it exists)if(error === null && keyUsageExt !== null &&'pathLenConstraint' in bcExt) {// pathLen is the maximum # of intermediate CA certs that can be// found between the current certificate and the end-entity (depth 0)// certificate; this number does not include the end-entity (depth 0,// last in the chain) even if it happens to be a CA certificate itselfvar pathLen = depth - 1;if(pathLen > bcExt.pathLenConstraint) {// pathLenConstraint violated, bad certificateerror = {message:'Certificate basicConstraints pathLenConstraint violated.',error: pki.certificateError.bad_certificate};}}}// call application callbackvar vfd = (error === null) ? true : error.error;var ret = options.verify ? options.verify(vfd, depth, certs) : vfd;if(ret === true) {// clear any set errorerror = null;} else {// if passed basic tests, set default message and alertif(vfd === true) {error = {message: 'The application rejected the certificate.',error: pki.certificateError.bad_certificate};}// check for custom error infoif(ret || ret === 0) {// set custom message and errorif(typeof ret === 'object' && !forge.util.isArray(ret)) {if(ret.message) {error.message = ret.message;}if(ret.error) {error.error = ret.error;}} else if(typeof ret === 'string') {// set custom errorerror.error = ret;}}// throw errorthrow error;}// no longer first cert in chainfirst = false;++depth;} while(chain.length > 0);return true;};/***/ }),/***/ 7371:/***/ ((module) => {"use strict";module.exports = JSON.parse('{"name":"hybrid-crypto-js","version":"0.2.4","description":"Hybrid (RSA+AES) encryption and decryption toolkit for JavaScript","main":"lib/index.js","scripts":{"prepublish":"npm run build","webpack":"browserify lib/webpack.js -o web/hybrid-crypto.js","uglify":"uglifyjs web/hybrid-crypto.js -o web/hybrid-crypto.min.js","flow":"flow","babel":"babel src/ -d lib/","build":"npm run babel && npm run webpack && npm run uglify","test":"npm run babel && mocha -R spec"},"repository":{"type":"git","url":"https://github.com/juhoen/hybrid-crypto-js.git"},"keywords":["rsa","aes","rsa+aes","react","node","react-native"],"author":"Juho Enala <[email protected]>","license":"MIT","bugs":{"url":"https://github.com/juhoen/hybrid-crypto-js/issues"},"homepage":"https://github.com/juhoen/hybrid-crypto-js","dependencies":{"node-forge":"^0.8.5"},"devDependencies":{"@babel/cli":"^7.5.5","@babel/core":"^7.5.5","@babel/preset-env":"^7.5.5","@babel/preset-flow":"^7.0.0","babel-core":"^6.26.0","babel-preset-env":"1.6.0","babel-preset-es2015":"^6.24.1","babelify":"^8.0.0","browserify":"^16.5.0","chai":"^4.1.2","flow-bin":"^0.107.0","mocha":"^4.0.1","prettier":"^1.18.2","uglify-js":"^3.2.1"},"browserslist":"> 0.25%, not dead"}');/***/ }),/***/ 7776:/***/ ((module, exports) => {exports = module.exports = SemVervar debug/* istanbul ignore next */if (typeof process === 'object' &&process.env &&process.env.NODE_DEBUG &&/\bsemver\b/i.test(process.env.NODE_DEBUG)) {debug = function () {var args = Array.prototype.slice.call(arguments, 0)args.unshift('SEMVER')console.log.apply(console, args)}} else {debug = function () {}}// Note: this is the semver.org version of the spec that it implements// Not necessarily the package version of this code.exports.SEMVER_SPEC_VERSION = '2.0.0'var MAX_LENGTH = 256var MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||/* istanbul ignore next */ 9007199254740991// Max safe segment length for coercion.var MAX_SAFE_COMPONENT_LENGTH = 16// The actual regexps go on exports.revar re = exports.re = []var src = exports.src = []var t = exports.tokens = {}var R = 0function tok (n) {t[n] = R++}// The following Regular Expressions can be used for tokenizing,// validating, and parsing SemVer version strings.// ## Numeric Identifier// A single `0`, or a non-zero digit followed by zero or more digits.tok('NUMERICIDENTIFIER')src[t.NUMERICIDENTIFIER] = '0|[1-9]\\d*'tok('NUMERICIDENTIFIERLOOSE')src[t.NUMERICIDENTIFIERLOOSE] = '[0-9]+'// ## Non-numeric Identifier// Zero or more digits, followed by a letter or hyphen, and then zero or// more letters, digits, or hyphens.tok('NONNUMERICIDENTIFIER')src[t.NONNUMERICIDENTIFIER] = '\\d*[a-zA-Z-][a-zA-Z0-9-]*'// ## Main Version// Three dot-separated numeric identifiers.tok('MAINVERSION')src[t.MAINVERSION] = '(' + src[t.NUMERICIDENTIFIER] + ')\\.' +'(' + src[t.NUMERICIDENTIFIER] + ')\\.' +'(' + src[t.NUMERICIDENTIFIER] + ')'tok('MAINVERSIONLOOSE')src[t.MAINVERSIONLOOSE] = '(' + src[t.NUMERICIDENTIFIERLOOSE] + ')\\.' +'(' + src[t.NUMERICIDENTIFIERLOOSE] + ')\\.' +'(' + src[t.NUMERICIDENTIFIERLOOSE] + ')'// ## Pre-release Version Identifier// A numeric identifier, or a non-numeric identifier.tok('PRERELEASEIDENTIFIER')src[t.PRERELEASEIDENTIFIER] = '(?:' + src[t.NUMERICIDENTIFIER] +'|' + src[t.NONNUMERICIDENTIFIER] + ')'tok('PRERELEASEIDENTIFIERLOOSE')src[t.PRERELEASEIDENTIFIERLOOSE] = '(?:' + src[t.NUMERICIDENTIFIERLOOSE] +'|' + src[t.NONNUMERICIDENTIFIER] + ')'// ## Pre-release Version// Hyphen, followed by one or more dot-separated pre-release version// identifiers.tok('PRERELEASE')src[t.PRERELEASE] = '(?:-(' + src[t.PRERELEASEIDENTIFIER] +'(?:\\.' + src[t.PRERELEASEIDENTIFIER] + ')*))'tok('PRERELEASELOOSE')src[t.PRERELEASELOOSE] = '(?:-?(' + src[t.PRERELEASEIDENTIFIERLOOSE] +'(?:\\.' + src[t.PRERELEASEIDENTIFIERLOOSE] + ')*))'// ## Build Metadata Identifier// Any combination of digits, letters, or hyphens.tok('BUILDIDENTIFIER')src[t.BUILDIDENTIFIER] = '[0-9A-Za-z-]+'// ## Build Metadata// Plus sign, followed by one or more period-separated build metadata// identifiers.tok('BUILD')src[t.BUILD] = '(?:\\+(' + src[t.BUILDIDENTIFIER] +'(?:\\.' + src[t.BUILDIDENTIFIER] + ')*))'// ## Full Version String// A main version, followed optionally by a pre-release version and// build metadata.// Note that the only major, minor, patch, and pre-release sections of// the version string are capturing groups.  The build metadata is not a// capturing group, because it should not ever be used in version// comparison.tok('FULL')tok('FULLPLAIN')src[t.FULLPLAIN] = 'v?' + src[t.MAINVERSION] +src[t.PRERELEASE] + '?' +src[t.BUILD] + '?'src[t.FULL] = '^' + src[t.FULLPLAIN] + '$'// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty// common in the npm registry.tok('LOOSEPLAIN')src[t.LOOSEPLAIN] = '[v=\\s]*' + src[t.MAINVERSIONLOOSE] +src[t.PRERELEASELOOSE] + '?' +src[t.BUILD] + '?'tok('LOOSE')src[t.LOOSE] = '^' + src[t.LOOSEPLAIN] + '$'tok('GTLT')src[t.GTLT] = '((?:<|>)?=?)'// Something like "2.*" or "1.2.x".// Note that "x.x" is a valid xRange identifer, meaning "any version"// Only the first item is strictly required.tok('XRANGEIDENTIFIERLOOSE')src[t.XRANGEIDENTIFIERLOOSE] = src[t.NUMERICIDENTIFIERLOOSE] + '|x|X|\\*'tok('XRANGEIDENTIFIER')src[t.XRANGEIDENTIFIER] = src[t.NUMERICIDENTIFIER] + '|x|X|\\*'tok('XRANGEPLAIN')src[t.XRANGEPLAIN] = '[v=\\s]*(' + src[t.XRANGEIDENTIFIER] + ')' +'(?:\\.(' + src[t.XRANGEIDENTIFIER] + ')' +'(?:\\.(' + src[t.XRANGEIDENTIFIER] + ')' +'(?:' + src[t.PRERELEASE] + ')?' +src[t.BUILD] + '?' +')?)?'tok('XRANGEPLAINLOOSE')src[t.XRANGEPLAINLOOSE] = '[v=\\s]*(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' +'(?:\\.(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' +'(?:\\.(' + src[t.XRANGEIDENTIFIERLOOSE] + ')' +'(?:' + src[t.PRERELEASELOOSE] + ')?' +src[t.BUILD] + '?' +')?)?'tok('XRANGE')src[t.XRANGE] = '^' + src[t.GTLT] + '\\s*' + src[t.XRANGEPLAIN] + '$'tok('XRANGELOOSE')src[t.XRANGELOOSE] = '^' + src[t.GTLT] + '\\s*' + src[t.XRANGEPLAINLOOSE] + '$'// Coercion.// Extract anything that could conceivably be a part of a valid semvertok('COERCE')src[t.COERCE] = '(^|[^\\d])' +'(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '})' +'(?:\\.(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '}))?' +'(?:\\.(\\d{1,' + MAX_SAFE_COMPONENT_LENGTH + '}))?' +'(?:$|[^\\d])'tok('COERCERTL')re[t.COERCERTL] = new RegExp(src[t.COERCE], 'g')// Tilde ranges.// Meaning is "reasonably at or greater than"tok('LONETILDE')src[t.LONETILDE] = '(?:~>?)'tok('TILDETRIM')src[t.TILDETRIM] = '(\\s*)' + src[t.LONETILDE] + '\\s+'re[t.TILDETRIM] = new RegExp(src[t.TILDETRIM], 'g')var tildeTrimReplace = '$1~'tok('TILDE')src[t.TILDE] = '^' + src[t.LONETILDE] + src[t.XRANGEPLAIN] + '$'tok('TILDELOOSE')src[t.TILDELOOSE] = '^' + src[t.LONETILDE] + src[t.XRANGEPLAINLOOSE] + '$'// Caret ranges.// Meaning is "at least and backwards compatible with"tok('LONECARET')src[t.LONECARET] = '(?:\\^)'tok('CARETTRIM')src[t.CARETTRIM] = '(\\s*)' + src[t.LONECARET] + '\\s+'re[t.CARETTRIM] = new RegExp(src[t.CARETTRIM], 'g')var caretTrimReplace = '$1^'tok('CARET')src[t.CARET] = '^' + src[t.LONECARET] + src[t.XRANGEPLAIN] + '$'tok('CARETLOOSE')src[t.CARETLOOSE] = '^' + src[t.LONECARET] + src[t.XRANGEPLAINLOOSE] + '$'// A simple gt/lt/eq thing, or just "" to indicate "any version"tok('COMPARATORLOOSE')src[t.COMPARATORLOOSE] = '^' + src[t.GTLT] + '\\s*(' + src[t.LOOSEPLAIN] + ')$|^$'tok('COMPARATOR')src[t.COMPARATOR] = '^' + src[t.GTLT] + '\\s*(' + src[t.FULLPLAIN] + ')$|^$'// An expression to strip any whitespace between the gtlt and the thing// it modifies, so that `> 1.2.3` ==> `>1.2.3`tok('COMPARATORTRIM')src[t.COMPARATORTRIM] = '(\\s*)' + src[t.GTLT] +'\\s*(' + src[t.LOOSEPLAIN] + '|' + src[t.XRANGEPLAIN] + ')'// this one has to use the /g flagre[t.COMPARATORTRIM] = new RegExp(src[t.COMPARATORTRIM], 'g')var comparatorTrimReplace = '$1$2$3'// Something like `1.2.3 - 1.2.4`// Note that these all use the loose form, because they'll be// checked against either the strict or loose comparator form// later.tok('HYPHENRANGE')src[t.HYPHENRANGE] = '^\\s*(' + src[t.XRANGEPLAIN] + ')' +'\\s+-\\s+' +'(' + src[t.XRANGEPLAIN] + ')' +'\\s*$'tok('HYPHENRANGELOOSE')src[t.HYPHENRANGELOOSE] = '^\\s*(' + src[t.XRANGEPLAINLOOSE] + ')' +'\\s+-\\s+' +'(' + src[t.XRANGEPLAINLOOSE] + ')' +'\\s*$'// Star ranges basically just allow anything at all.tok('STAR')src[t.STAR] = '(<|>)?=?\\s*\\*'// Compile to actual regexp objects.// All are flag-free, unless they were created above with a flag.for (var i = 0; i < R; i++) {debug(i, src[i])if (!re[i]) {re[i] = new RegExp(src[i])}}exports.parse = parsefunction parse (version, options) {if (!options || typeof options !== 'object') {options = {loose: !!options,includePrerelease: false}}if (version instanceof SemVer) {return version}if (typeof version !== 'string') {return null}if (version.length > MAX_LENGTH) {return null}var r = options.loose ? re[t.LOOSE] : re[t.FULL]if (!r.test(version)) {return null}try {return new SemVer(version, options)} catch (er) {return null}}exports.valid = validfunction valid (version, options) {var v = parse(version, options)return v ? v.version : null}exports.clean = cleanfunction clean (version, options) {var s = parse(version.trim().replace(/^[=v]+/, ''), options)return s ? s.version : null}exports.SemVer = SemVerfunction SemVer (version, options) {if (!options || typeof options !== 'object') {options = {loose: !!options,includePrerelease: false}}if (version instanceof SemVer) {if (version.loose === options.loose) {return version} else {version = version.version}} else if (typeof version !== 'string') {throw new TypeError('Invalid Version: ' + version)}if (version.length > MAX_LENGTH) {throw new TypeError('version is longer than ' + MAX_LENGTH + ' characters')}if (!(this instanceof SemVer)) {return new SemVer(version, options)}debug('SemVer', version, options)this.options = optionsthis.loose = !!options.loosevar m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])if (!m) {throw new TypeError('Invalid Version: ' + version)}this.raw = version// these are actually numbersthis.major = +m[1]this.minor = +m[2]this.patch = +m[3]if (this.major > MAX_SAFE_INTEGER || this.major < 0) {throw new TypeError('Invalid major version')}if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {throw new TypeError('Invalid minor version')}if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {throw new TypeError('Invalid patch version')}// numberify any prerelease numeric idsif (!m[4]) {this.prerelease = []} else {this.prerelease = m[4].split('.').map(function (id) {if (/^[0-9]+$/.test(id)) {var num = +idif (num >= 0 && num < MAX_SAFE_INTEGER) {return num}}return id})}this.build = m[5] ? m[5].split('.') : []this.format()}SemVer.prototype.format = function () {this.version = this.major + '.' + this.minor + '.' + this.patchif (this.prerelease.length) {this.version += '-' + this.prerelease.join('.')}return this.version}SemVer.prototype.toString = function () {return this.version}SemVer.prototype.compare = function (other) {debug('SemVer.compare', this.version, this.options, other)if (!(other instanceof SemVer)) {other = new SemVer(other, this.options)}return this.compareMain(other) || this.comparePre(other)}SemVer.prototype.compareMain = function (other) {if (!(other instanceof SemVer)) {other = new SemVer(other, this.options)}return compareIdentifiers(this.major, other.major) ||compareIdentifiers(this.minor, other.minor) ||compareIdentifiers(this.patch, other.patch)}SemVer.prototype.comparePre = function (other) {if (!(other instanceof SemVer)) {other = new SemVer(other, this.options)}// NOT having a prerelease is > having oneif (this.prerelease.length && !other.prerelease.length) {return -1} else if (!this.prerelease.length && other.prerelease.length) {return 1} else if (!this.prerelease.length && !other.prerelease.length) {return 0}var i = 0do {var a = this.prerelease[i]var b = other.prerelease[i]debug('prerelease compare', i, a, b)if (a === undefined && b === undefined) {return 0} else if (b === undefined) {return 1} else if (a === undefined) {return -1} else if (a === b) {continue} else {return compareIdentifiers(a, b)}} while (++i)}SemVer.prototype.compareBuild = function (other) {if (!(other instanceof SemVer)) {other = new SemVer(other, this.options)}var i = 0do {var a = this.build[i]var b = other.build[i]debug('prerelease compare', i, a, b)if (a === undefined && b === undefined) {return 0} else if (b === undefined) {return 1} else if (a === undefined) {return -1} else if (a === b) {continue} else {return compareIdentifiers(a, b)}} while (++i)}// preminor will bump the version up to the next minor release, and immediately// down to pre-release. premajor and prepatch work the same way.SemVer.prototype.inc = function (release, identifier) {switch (release) {case 'premajor':this.prerelease.length = 0this.patch = 0this.minor = 0this.major++this.inc('pre', identifier)breakcase 'preminor':this.prerelease.length = 0this.patch = 0this.minor++this.inc('pre', identifier)breakcase 'prepatch':// If this is already a prerelease, it will bump to the next version// drop any prereleases that might already exist, since they are not// relevant at this point.this.prerelease.length = 0this.inc('patch', identifier)this.inc('pre', identifier)break// If the input is a non-prerelease version, this acts the same as// prepatch.case 'prerelease':if (this.prerelease.length === 0) {this.inc('patch', identifier)}this.inc('pre', identifier)breakcase 'major':// If this is a pre-major version, bump up to the same major version.// Otherwise increment major.// 1.0.0-5 bumps to 1.0.0// 1.1.0 bumps to 2.0.0if (this.minor !== 0 ||this.patch !== 0 ||this.prerelease.length === 0) {this.major++}this.minor = 0this.patch = 0this.prerelease = []breakcase 'minor':// If this is a pre-minor version, bump up to the same minor version.// Otherwise increment minor.// 1.2.0-5 bumps to 1.2.0// 1.2.1 bumps to 1.3.0if (this.patch !== 0 || this.prerelease.length === 0) {this.minor++}this.patch = 0this.prerelease = []breakcase 'patch':// If this is not a pre-release version, it will increment the patch.// If it is a pre-release it will bump up to the same patch version.// 1.2.0-5 patches to 1.2.0// 1.2.0 patches to 1.2.1if (this.prerelease.length === 0) {this.patch++}this.prerelease = []break// This probably shouldn't be used publicly.// 1.0.0 "pre" would become 1.0.0-0 which is the wrong direction.case 'pre':if (this.prerelease.length === 0) {this.prerelease = [0]} else {var i = this.prerelease.lengthwhile (--i >= 0) {if (typeof this.prerelease[i] === 'number') {this.prerelease[i]++i = -2}}if (i === -1) {// didn't increment anythingthis.prerelease.push(0)}}if (identifier) {// 1.2.0-beta.1 bumps to 1.2.0-beta.2,// 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0if (this.prerelease[0] === identifier) {if (isNaN(this.prerelease[1])) {this.prerelease = [identifier, 0]}} else {this.prerelease = [identifier, 0]}}breakdefault:throw new Error('invalid increment argument: ' + release)}this.format()this.raw = this.versionreturn this}exports.inc = incfunction inc (version, release, loose, identifier) {if (typeof (loose) === 'string') {identifier = looseloose = undefined}try {return new SemVer(version, loose).inc(release, identifier).version} catch (er) {return null}}exports.diff = difffunction diff (version1, version2) {if (eq(version1, version2)) {return null} else {var v1 = parse(version1)var v2 = parse(version2)var prefix = ''if (v1.prerelease.length || v2.prerelease.length) {prefix = 'pre'var defaultR###lt = 'prerelease'}for (var key in v1) {if (key === 'major' || key === 'minor' || key === 'patch') {if (v1[key] !== v2[key]) {return prefix + key}}}return defaultR###lt // may be undefined}}exports.compareIdentifiers = compareIdentifiersvar numeric = /^[0-9]+$/function compareIdentifiers (a, b) {var anum = numeric.test(a)var bnum = numeric.test(b)if (anum && bnum) {a = +ab = +b}return a === b ? 0: (anum && !bnum) ? -1: (bnum && !anum) ? 1: a < b ? -1: 1}exports.rcompareIdentifiers = rcompareIdentifiersfunction rcompareIdentifiers (a, b) {return compareIdentifiers(b, a)}exports.major = majorfunction major (a, loose) {return new SemVer(a, loose).major}exports.minor = minorfunction minor (a, loose) {return new SemVer(a, loose).minor}exports.patch = patchfunction patch (a, loose) {return new SemVer(a, loose).patch}exports.compare = comparefunction compare (a, b, loose) {return new SemVer(a, loose).compare(new SemVer(b, loose))}exports.compareLoose = compareLoosefunction compareLoose (a, b) {return compare(a, b, true)}exports.compareBuild = compareBuildfunction compareBuild (a, b, loose) {var versionA = new SemVer(a, loose)var versionB = new SemVer(b, loose)return versionA.compare(versionB) || versionA.compareBuild(versionB)}exports.rcompare = rcomparefunction rcompare (a, b, loose) {return compare(b, a, loose)}exports.sort = sortfunction sort (list, loose) {return list.sort(function (a, b) {return exports.compareBuild(a, b, loose)})}exports.rsort = rsortfunction rsort (list, loose) {return list.sort(function (a, b) {return exports.compareBuild(b, a, loose)})}exports.gt = gtfunction gt (a, b, loose) {return compare(a, b, loose) > 0}exports.lt = ltfunction lt (a, b, loose) {return compare(a, b, loose) < 0}exports.eq = eqfunction eq (a, b, loose) {return compare(a, b, loose) === 0}exports.neq = neqfunction neq (a, b, loose) {return compare(a, b, loose) !== 0}exports.gte = gtefunction gte (a, b, loose) {return compare(a, b, loose) >= 0}exports.lte = ltefunction lte (a, b, loose) {return compare(a, b, loose) <= 0}exports.cmp = cmpfunction cmp (a, op, b, loose) {switch (op) {case '===':if (typeof a === 'object')a = a.versionif (typeof b === 'object')b = b.versionreturn a === bcase '!==':if (typeof a === 'object')a = a.versionif (typeof b === 'object')b = b.versionreturn a !== bcase '':case '=':case '==':return eq(a, b, loose)case '!=':return neq(a, b, loose)case '>':return gt(a, b, loose)case '>=':return gte(a, b, loose)case '<':return lt(a, b, loose)case '<=':return lte(a, b, loose)default:throw new TypeError('Invalid operator: ' + op)}}exports.Comparator = Comparatorfunction Comparator (comp, options) {if (!options || typeof options !== 'object') {options = {loose: !!options,includePrerelease: false}}if (comp instanceof Comparator) {if (comp.loose === !!options.loose) {return comp} else {comp = comp.value}}if (!(this instanceof Comparator)) {return new Comparator(comp, options)}debug('comparator', comp, options)this.options = optionsthis.loose = !!options.loosethis.parse(comp)if (this.semver === ANY) {this.value = ''} else {this.value = this.operator + this.semver.version}debug('comp', this)}var ANY = {}Comparator.prototype.parse = function (comp) {var r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]var m = comp.match(r)if (!m) {throw new TypeError('Invalid comparator: ' + comp)}this.operator = m[1] !== undefined ? m[1] : ''if (this.operator === '=') {this.operator = ''}// if it literally is just '>' or '' then allow anything.if (!m[2]) {this.semver = ANY} else {this.semver = new SemVer(m[2], this.options.loose)}}Comparator.prototype.toString = function () {return this.value}Comparator.prototype.test = function (version) {debug('Comparator.test', version, this.options.loose)if (this.semver === ANY || version === ANY) {return true}if (typeof version === 'string') {try {version = new SemVer(version, this.options)} catch (er) {return false}}return cmp(version, this.operator, this.semver, this.options)}Comparator.prototype.intersects = function (comp, options) {if (!(comp instanceof Comparator)) {throw new TypeError('a Comparator is required')}if (!options || typeof options !== 'object') {options = {loose: !!options,includePrerelease: false}}var rangeTmpif (this.operator === '') {if (this.value === '') {return true}rangeTmp = new Range(comp.value, options)return satisfies(this.value, rangeTmp, options)} else if (comp.operator === '') {if (comp.value === '') {return true}rangeTmp = new Range(this.value, options)return satisfies(comp.semver, rangeTmp, options)}var sameDirectionIncreasing =(this.operator === '>=' || this.operator === '>') &&(comp.operator === '>=' || comp.operator === '>')var sameDirectionDecreasing =(this.operator === '<=' || this.operator === '<') &&(comp.operator === '<=' || comp.operator === '<')var sameSemVer = this.semver.version === comp.semver.versionvar differentDirectionsInclusive =(this.operator === '>=' || this.operator === '<=') &&(comp.operator === '>=' || comp.operator === '<=')var oppositeDirectionsLessThan =cmp(this.semver, '<', comp.semver, options) &&((this.operator === '>=' || this.operator === '>') &&(comp.operator === '<=' || comp.operator === '<'))var oppositeDirectionsGreaterThan =cmp(this.semver, '>', comp.semver, options) &&((this.operator === '<=' || this.operator === '<') &&(comp.operator === '>=' || comp.operator === '>'))return sameDirectionIncreasing || sameDirectionDecreasing ||(sameSemVer && differentDirectionsInclusive) ||oppositeDirectionsLessThan || oppositeDirectionsGreaterThan}exports.Range = Rangefunction Range (range, options) {if (!options || typeof options !== 'object') {options = {loose: !!options,includePrerelease: false}}if (range instanceof Range) {if (range.loose === !!options.loose &&range.includePrerelease === !!options.includePrerelease) {return range} else {return new Range(range.raw, options)}}if (range instanceof Comparator) {return new Range(range.value, options)}if (!(this instanceof Range)) {return new Range(range, options)}this.options = optionsthis.loose = !!options.loosethis.includePrerelease = !!options.includePrerelease// First, split based on boolean or ||this.raw = rangethis.set = range.split(/\s*\|\|\s*/).map(function (range) {return this.parseRange(range.trim())}, this).filter(function (c) {// throw out any that are not relevant for whatever reasonreturn c.length})if (!this.set.length) {throw new TypeError('Invalid SemVer Range: ' + range)}this.format()}Range.prototype.format = function () {this.range = this.set.map(function (comps) {return comps.join(' ').trim()}).join('||').trim()return this.range}Range.prototype.toString = function () {return this.range}Range.prototype.parseRange = function (range) {var loose = this.options.looserange = range.trim()// `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`var hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]range = range.replace(hr, hyphenReplace)debug('hyphen replace', range)// `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)debug('comparator trim', range, re[t.COMPARATORTRIM])// `~ 1.2.3` => `~1.2.3`range = range.replace(re[t.TILDETRIM], tildeTrimReplace)// `^ 1.2.3` => `^1.2.3`range = range.replace(re[t.CARETTRIM], caretTrimReplace)// normalize spacesrange = range.split(/\s+/).join(' ')// At this point, the range is completely trimmed and// ready to be split into comparators.var compRe = loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]var set = range.split(' ').map(function (comp) {return parseComparator(comp, this.options)}, this).join(' ').split(/\s+/)if (this.options.loose) {// in loose mode, throw out any that are not valid comparatorsset = set.filter(function (comp) {return !!comp.match(compRe)})}set = set.map(function (comp) {return new Comparator(comp, this.options)}, this)return set}Range.prototype.intersects = function (range, options) {if (!(range instanceof Range)) {throw new TypeError('a Range is required')}return this.set.some(function (thisComparators) {return (isSatisfiable(thisComparators, options) &&range.set.some(function (rangeComparators) {return (isSatisfiable(rangeComparators, options) &&thisComparators.every(function (thisComparator) {return rangeComparators.every(function (rangeComparator) {return thisComparator.intersects(rangeComparator, options)})}))}))})}// take a set of comparators and determine whether there// exists a version which can satisfy itfunction isSatisfiable (comparators, options) {var r###lt = truevar remainingComparators = comparators.slice()var testComparator = remainingComparators.pop()while (r###lt && remainingComparators.length) {r###lt = remainingComparators.every(function (otherComparator) {return testComparator.intersects(otherComparator, options)})testComparator = remainingComparators.pop()}return r###lt}// Mostly just for testing and legacy API reasonsexports.toComparators = toComparatorsfunction toComparators (range, options) {return new Range(range, options).set.map(function (comp) {return comp.map(function (c) {return c.value}).join(' ').trim().split(' ')})}// comprised of xranges, tildes, stars, and gtlt's at this point.// already replaced the hyphen ranges// turn into a set of JUST comparators.function parseComparator (comp, options) {debug('comp', comp, options)comp = replaceCarets(comp, options)debug('caret', comp)comp = replaceTildes(comp, options)debug('tildes', comp)comp = replaceXRanges(comp, options)debug('xrange', comp)comp = replaceStars(comp, options)debug('stars', comp)return comp}function isX (id) {return !id || id.toLowerCase() === 'x' || id === '*'}// ~, ~> --> * (any, kinda silly)// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0function replaceTildes (comp, options) {return comp.trim().split(/\s+/).map(function (comp) {return replaceTilde(comp, options)}).join(' ')}function replaceTilde (comp, options) {var r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]return comp.replace(r, function (_, M, m, p, pr) {debug('tilde', comp, _, M, m, p, pr)var retif (isX(M)) {ret = ''} else if (isX(m)) {ret = '>=' + M + '.0.0 <' + (+M + 1) + '.0.0'} else if (isX(p)) {// ~1.2 == >=1.2.0 <1.3.0ret = '>=' + M + '.' + m + '.0 <' + M + '.' + (+m + 1) + '.0'} else if (pr) {debug('replaceTilde pr', pr)ret = '>=' + M + '.' + m + '.' + p + '-' + pr +' <' + M + '.' + (+m + 1) + '.0'} else {// ~1.2.3 == >=1.2.3 <1.3.0ret = '>=' + M + '.' + m + '.' + p +' <' + M + '.' + (+m + 1) + '.0'}debug('tilde return', ret)return ret})}// ^ --> * (any, kinda silly)// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0// ^1.2.3 --> >=1.2.3 <2.0.0// ^1.2.0 --> >=1.2.0 <2.0.0function replaceCarets (comp, options) {return comp.trim().split(/\s+/).map(function (comp) {return replaceCaret(comp, options)}).join(' ')}function replaceCaret (comp, options) {debug('caret', comp, options)var r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]return comp.replace(r, function (_, M, m, p, pr) {debug('caret', comp, _, M, m, p, pr)var retif (isX(M)) {ret = ''} else if (isX(m)) {ret = '>=' + M + '.0.0 <' + (+M + 1) + '.0.0'} else if (isX(p)) {if (M === '0') {ret = '>=' + M + '.' + m + '.0 <' + M + '.' + (+m + 1) + '.0'} else {ret = '>=' + M + '.' + m + '.0 <' + (+M + 1) + '.0.0'}} else if (pr) {debug('replaceCaret pr', pr)if (M === '0') {if (m === '0') {ret = '>=' + M + '.' + m + '.' + p + '-' + pr +' <' + M + '.' + m + '.' + (+p + 1)} else {ret = '>=' + M + '.' + m + '.' + p + '-' + pr +' <' + M + '.' + (+m + 1) + '.0'}} else {ret = '>=' + M + '.' + m + '.' + p + '-' + pr +' <' + (+M + 1) + '.0.0'}} else {debug('no pr')if (M === '0') {if (m === '0') {ret = '>=' + M + '.' + m + '.' + p +' <' + M + '.' + m + '.' + (+p + 1)} else {ret = '>=' + M + '.' + m + '.' + p +' <' + M + '.' + (+m + 1) + '.0'}} else {ret = '>=' + M + '.' + m + '.' + p +' <' + (+M + 1) + '.0.0'}}debug('caret return', ret)return ret})}function replaceXRanges (comp, options) {debug('replaceXRanges', comp, options)return comp.split(/\s+/).map(function (comp) {return replaceXRange(comp, options)}).join(' ')}function replaceXRange (comp, options) {comp = comp.trim()var r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]return comp.replace(r, function (ret, gtlt, M, m, p, pr) {debug('xRange', comp, ret, gtlt, M, m, p, pr)var xM = isX(M)var xm = xM || isX(m)var xp = xm || isX(p)var anyX = xpif (gtlt === '=' && anyX) {gtlt = ''}// if we're including prereleases in the match, then we need// to fix this to -0, the lowest possible prerelease valuepr = options.includePrerelease ? '-0' : ''if (xM) {if (gtlt === '>' || gtlt === '<') {// nothing is allowedret = '<0.0.0-0'} else {// nothing is forbiddenret = '*'}} else if (gtlt && anyX) {// we know patch is an x, because we have any x at all.// replace X with 0if (xm) {m = 0}p = 0if (gtlt === '>') {// >1 => >=2.0.0// >1.2 => >=1.3.0// >1.2.3 => >= 1.2.4gtlt = '>='if (xm) {M = +M + 1m = 0p = 0} else {m = +m + 1p = 0}} else if (gtlt === '<=') {// <=0.7.x is actually <0.8.0, since any 0.7.x should// pass.  Similarly, <=7.x is actually <8.0.0, etc.gtlt = '<'if (xm) {M = +M + 1} else {m = +m + 1}}ret = gtlt + M + '.' + m + '.' + p + pr} else if (xm) {ret = '>=' + M + '.0.0' + pr + ' <' + (+M + 1) + '.0.0' + pr} else if (xp) {ret = '>=' + M + '.' + m + '.0' + pr +' <' + M + '.' + (+m + 1) + '.0' + pr}debug('xRange return', ret)return ret})}// Because * is AND-ed with everything else in the comparator,// and '' means "any version", just remove the *s entirely.function replaceStars (comp, options) {debug('replaceStars', comp, options)// Looseness is ignored here.  star is always as loose as it gets!return comp.trim().replace(re[t.STAR], '')}// This function is passed to string.replace(re[t.HYPHENRANGE])// M, m, patch, prerelease, build// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5// 1.2.3 - 3.4 => >=1.2.0 <3.5.0 Any 3.4.x will do// 1.2 - 3.4 => >=1.2.0 <3.5.0function hyphenReplace ($0,from, fM, fm, fp, fpr, fb,to, tM, tm, tp, tpr, tb) {if (isX(fM)) {from = ''} else if (isX(fm)) {from = '>=' + fM + '.0.0'} else if (isX(fp)) {from = '>=' + fM + '.' + fm + '.0'} else {from = '>=' + from}if (isX(tM)) {to = ''} else if (isX(tm)) {to = '<' + (+tM + 1) + '.0.0'} else if (isX(tp)) {to = '<' + tM + '.' + (+tm + 1) + '.0'} else if (tpr) {to = '<=' + tM + '.' + tm + '.' + tp + '-' + tpr} else {to = '<=' + to}return (from + ' ' + to).trim()}// if ANY of the sets match ALL of its comparators, then passRange.prototype.test = function (version) {if (!version) {return false}if (typeof version === 'string') {try {version = new SemVer(version, this.options)} catch (er) {return false}}for (var i = 0; i < this.set.length; i++) {if (testSet(this.set[i], version, this.options)) {return true}}return false}function testSet (set, version, options) {for (var i = 0; i < set.length; i++) {if (!set[i].test(version)) {return false}}if (version.prerelease.length && !options.includePrerelease) {// Find the set of versions that are allowed to have prereleases// For example, ^1.2.3-pr.1 d###gars to >=1.2.3-pr.1 <2.0.0// That should allow `1.2.3-pr.2` to pass.// However, `1.2.4-alpha.notready` should NOT be allowed,// even though it's within the range set by the comparators.for (i = 0; i < set.length; i++) {debug(set[i].semver)if (set[i].semver === ANY) {continue}if (set[i].semver.prerelease.length > 0) {var allowed = set[i].semverif (allowed.major === version.major &&allowed.minor === version.minor &&allowed.patch === version.patch) {return true}}}// Version has a -pre, but it's not one of the ones we like.return false}return true}exports.satisfies = satisfiesfunction satisfies (version, range, options) {try {range = new Range(range, options)} catch (er) {return false}return range.test(version)}exports.maxSatisfying = maxSatisfyingfunction maxSatisfying (versions, range, options) {var max = nullvar maxSV = nulltry {var rangeObj = new Range(range, options)} catch (er) {return null}versions.forEach(function (v) {if (rangeObj.test(v)) {// satisfies(v, range, options)if (!max || maxSV.compare(v) === -1) {// compare(max, v, true)max = vmaxSV = new SemVer(max, options)}}})return max}exports.minSatisfying = minSatisfyingfunction minSatisfying (versions, range, options) {var min = nullvar minSV = nulltry {var rangeObj = new Range(range, options)} catch (er) {return null}versions.forEach(function (v) {if (rangeObj.test(v)) {// satisfies(v, range, options)if (!min || minSV.compare(v) === 1) {// compare(min, v, true)min = vminSV = new SemVer(min, options)}}})return min}exports.minVersion = minVersionfunction minVersion (range, loose) {range = new Range(range, loose)var minver = new SemVer('0.0.0')if (range.test(minver)) {return minver}minver = new SemVer('0.0.0-0')if (range.test(minver)) {return minver}minver = nullfor (var i = 0; i < range.set.length; ++i) {var comparators = range.set[i]comparators.forEach(function (comparator) {// Clone to avoid manipulating the comparator's semver object.var compver = new SemVer(comparator.semver.version)switch (comparator.operator) {case '>':if (compver.prerelease.length === 0) {compver.patch++} else {compver.prerelease.push(0)}compver.raw = compver.format()/* fallthrough */case '':case '>=':if (!minver || gt(minver, compver)) {minver = compver}breakcase '<':case '<=':/* Ignore maximum versions */break/* istanbul ignore next */default:throw new Error('Unexpected operation: ' + comparator.operator)}})}if (minver && range.test(minver)) {return minver}return null}exports.validRange = validRangefunction validRange (range, options) {try {// Return '*' instead of '' so that truthiness works.// This will throw if it's invalid anywayreturn new Range(range, options).range || '*'} catch (er) {return null}}// Determine if version is less than all the versions possible in the rangeexports.ltr = ltrfunction ltr (version, range, options) {return outside(version, range, '<', options)}// Determine if version is greater than all the versions possible in the range.exports.gtr = gtrfunction gtr (version, range, options) {return outside(version, range, '>', options)}exports.outside = outsidefunction outside (version, range, hilo, options) {version = new SemVer(version, options)range = new Range(range, options)var gtfn, ltefn, ltfn, comp, ecompswitch (hilo) {case '>':gtfn = gtltefn = lteltfn = ltcomp = '>'ecomp = '>='breakcase '<':gtfn = ltltefn = gteltfn = gtcomp = '<'ecomp = '<='breakdefault:throw new TypeError('Must provide a hilo val of "<" or ">"')}// If it satisifes the range it is not outsideif (satisfies(version, range, options)) {return false}// From now on, variable terms are as if we're in "gtr" mode.// but note that everything is flipped for the "ltr" function.for (var i = 0; i < range.set.length; ++i) {var comparators = range.set[i]var high = nullvar low = nullcomparators.forEach(function (comparator) {if (comparator.semver === ANY) {comparator = new Comparator('>=0.0.0')}high = high || comparatorlow = low || comparatorif (gtfn(comparator.semver, high.semver, options)) {high = comparator} else if (ltfn(comparator.semver, low.semver, options)) {low = comparator}})// If the edge version comparator has a operator then our version// isn't outside itif (high.operator === comp || high.operator === ecomp) {return false}// If the lowest version comparator has an operator and our version// is less than it then it isn't higher than the rangeif ((!low.operator || low.operator === comp) &&ltefn(version, low.semver)) {return false} else if (low.operator === ecomp && ltfn(version, low.semver)) {return false}}return true}exports.prerelease = prereleasefunction prerelease (version, options) {var parsed = parse(version, options)return (parsed && parsed.prerelease.length) ? parsed.prerelease : null}exports.intersects = intersectsfunction intersects (r1, r2, options) {r1 = new Range(r1, options)r2 = new Range(r2, options)return r1.intersects(r2)}exports.coerce = coercefunction coerce (version, options) {if (version instanceof SemVer) {return version}if (typeof version === 'number') {version = String(version)}if (typeof version !== 'string') {return null}options = options || {}var match = nullif (!options.rtl) {match = version.match(re[t.COERCE])} else {// Find the right-most coercible string that does not share// a terminus with a more left-ward coercible string.// Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'//// Walk through the string checking with a /g regexp// Manually set the index so as to pick up overlapping matches.// Stop when we get a match that ends at the string end, since no// coercible string can be more right-ward without the same terminus.var nextwhile ((next = re[t.COERCERTL].exec(version)) &&(!match || match.index + match[0].length !== version.length)) {if (!match ||next.index + next[0].length !== match.index + match[0].length) {match = next}re[t.COERCERTL].lastIndex = next.index + next[1].length + next[2].length}// leave it in a clean statere[t.COERCERTL].lastIndex = -1}if (match === null) {return null}return parse(match[2] +'.' + (match[3] || '0') +'.' + (match[4] || '0'), options)}/***/ }),/***/ 316:/***/ ((module) => {"use strict";var memo = {};/* istanbul ignore next  */function getTarget(target) {if (typeof memo[target] === "undefined") {var styleTarget = document.querySelector(target); // Special case to return head of iframe instead of iframe itselfif (window.HTMLIFrameElement && styleTarget instanceof window.HTMLIFrameElement) {try {// This will throw an exception if access to iframe is blocked// due to cross-origin restrictionsstyleTarget = styleTarget.contentDocument.head;} catch (e) {// istanbul ignore nextstyleTarget = null;}}memo[target] = styleTarget;}return memo[target];}module.exports = getTarget;/***/ }),/***/ 2597:/***/ ((module) => {"use strict";var stylesInDom = [];function getIndexByIdentifier(identifier) {var r###lt = -1;for (var i = 0; i < stylesInDom.length; i++) {if (stylesInDom[i].identifier === identifier) {r###lt = i;break;}}return r###lt;}function modulesToDom(list, options) {var idCountMap = {};var identifiers = [];for (var i = 0; i < list.length; i++) {var item = list[i];var id = options.base ? item[0] + options.base : item[0];var count = idCountMap[id] || 0;var identifier = "".concat(id, " ").concat(count);idCountMap[id] = count + 1;var index = getIndexByIdentifier(identifier);var obj = {css: item[1],media: item[2],sourceMap: item[3]};if (index !== -1) {stylesInDom[index].references++;stylesInDom[index].updater(obj);} else {stylesInDom.push({identifier: identifier,updater: addStyle(obj, options),references: 1});}identifiers.push(identifier);}return identifiers;}function addStyle(obj, options) {var api = options.domAPI(options);api.update(obj);return function updateStyle(newObj) {if (newObj) {if (newObj.css === obj.css && newObj.media === obj.media && newObj.sourceMap === obj.sourceMap) {return;}api.update(obj = newObj);} else {api.remove();}};}module.exports = function (list, options) {options = options || {};list = list || [];var lastIdentifiers = modulesToDom(list, options);return function update(newList) {newList = newList || [];for (var i = 0; i < lastIdentifiers.length; i++) {var identifier = lastIdentifiers[i];var index = getIndexByIdentifier(identifier);stylesInDom[index].references--;}var newLastIdentifiers = modulesToDom(newList, options);for (var _i = 0; _i < lastIdentifiers.length; _i++) {var _identifier = lastIdentifiers[_i];var _index = getIndexByIdentifier(_identifier);if (stylesInDom[_index].references === 0) {stylesInDom[_index].updater();stylesInDom.splice(_index, 1);}}lastIdentifiers = newLastIdentifiers;};};/***/ }),/***/ 4667:/***/ ((module) => {"use strict";/* istanbul ignore next  */function insertStyleElement(options) {var style = document.createElement("style");options.setAttributes(style, options.attributes);options.insert(style);return style;}module.exports = insertStyleElement;/***/ }),/***/ 9774:/***/ ((module) => {"use strict";/* istanbul ignore next  */function apply(style, options, obj) {var css = obj.css;var media = obj.media;var sourceMap = obj.sourceMap;if (media) {style.setAttribute("media", media);} else {style.removeAttribute("media");}if (sourceMap && typeof btoa !== "undefined") {css += "\n/*# sourceMappingURL=data:application/json;base64,".concat(btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap)))), " */");} // For old IE/* istanbul ignore if  */options.styleTagTransform(css, style);}function removeStyleElement(style) {// istanbul ignore ifif (style.parentNode === null) {return false;}style.parentNode.removeChild(style);}/* istanbul ignore next  */function domAPI(options) {var style = options.insertStyleElement(options);return {update: function update(obj) {apply(style, options, obj);},remove: function remove() {removeStyleElement(style);}};}module.exports = domAPI;/***/ }),/***/ 1766:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {var v1 = __webpack_require__(2616);var v4 = __webpack_require__(7358);var uuid = v4;uuid.v1 = v1;uuid.v4 = v4;module.exports = uuid;/***/ }),/***/ 5594:/***/ ((module) => {/*** Convert array of 16 byte values to UUID string format of the form:* XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX*/var byteToHex = [];for (var i = 0; i < 256; ++i) {byteToHex[i] = (i + 0x100).toString(16).substr(1);}function bytesToUuid(buf, offset) {var i = offset || 0;var bth = byteToHex;// join used to fix memory issue caused by concatenation: https://bugs.chromium.org/p/v8/issues/detail?id=3175#c4return ([bth[buf[i++]], bth[buf[i++]],bth[buf[i++]], bth[buf[i++]], '-',bth[buf[i++]], bth[buf[i++]], '-',bth[buf[i++]], bth[buf[i++]], '-',bth[buf[i++]], bth[buf[i++]], '-',bth[buf[i++]], bth[buf[i++]],bth[buf[i++]], bth[buf[i++]],bth[buf[i++]], bth[buf[i++]]]).join('');}module.exports = bytesToUuid;/***/ }),/***/ 6880:/***/ ((module) => {// Unique ID creation requires a high quality random # generator.  In the// browser this is a little complicated due to unknown quality of Math.random()// and inconsistent support for the `crypto` API.  We do the best we can via// feature-detection// getRandomValues needs to be invoked in a context where "this" is a Crypto// implementation. Also, find the complete implementation of crypto on IE11.var getRandomValues = (typeof(crypto) != 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto)) ||(typeof(msCrypto) != 'undefined' && typeof window.msCrypto.getRandomValues == 'function' && msCrypto.getRandomValues.bind(msCrypto));if (getRandomValues) {// WHATWG crypto RNG - http://wiki.whatwg.org/wiki/Cryptovar rnds8 = new Uint8Array(16); // eslint-disable-line no-undefmodule.exports = function whatwgRNG() {getRandomValues(rnds8);return rnds8;};} else {// Math.random()-based (RNG)//// If all else fails, use Math.random().  It's fast, but is of unspecified// quality.var rnds = new Array(16);module.exports = function mathRNG() {for (var i = 0, r; i < 16; i++) {if ((i & 0x03) === 0) r = Math.random() * 0x100000000;rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;}return rnds;};}/***/ }),/***/ 2616:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {var rng = __webpack_require__(6880);var bytesToUuid = __webpack_require__(5594);// **`v1()` - Generate time-based UUID**//// Inspired by https://github.com/LiosK/UUID.js// and http://docs.python.org/library/uuid.htmlvar _nodeId;var _clockseq;// Previous uuid creation timevar _lastMSecs = 0;var _lastNSecs = 0;// See https://github.com/uuidjs/uuid for API detailsfunction v1(options, buf, offset) {var i = buf && offset || 0;var b = buf || [];options = options || {};var node = options.node || _nodeId;var clockseq = options.clockseq !== undefined ? options.clockseq : _clockseq;// node and clockseq need to be initialized to random values if they're not// specified.  We do this lazily to minimize issues related to insufficient// system entropy.  See #189if (node == null || clockseq == null) {var seedBytes = rng();if (node == null) {// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)node = _nodeId = [seedBytes[0] | 0x01,seedBytes[1], seedBytes[2], seedBytes[3], seedBytes[4], seedBytes[5]];}if (clockseq == null) {// Per 4.2.2, randomize (14 bit) clockseqclockseq = _clockseq = (seedBytes[6] << 8 | seedBytes[7]) & 0x3fff;}}// UUID timestamps are 100 nano-second units since the Gregorian epoch,// (1582-10-15 00:00).  JSNumbers aren't precise enough for this, so// time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'// (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.var msecs = options.msecs !== undefined ? options.msecs : new Date().getTime();// Per 4.2.1.2, use count of uuid's generated during the current clock// cycle to simulate higher resolution clockvar nsecs = options.nsecs !== undefined ? options.nsecs : _lastNSecs + 1;// Time since last uuid creation (in msecs)var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs)/10000;// Per 4.2.1.2, Bump clockseq on clock regressionif (dt < 0 && options.clockseq === undefined) {clockseq = clockseq + 1 & 0x3fff;}// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new// time intervalif ((dt < 0 || msecs > _lastMSecs) && options.nsecs === undefined) {nsecs = 0;}// Per 4.2.1.2 Throw error if too many uuids are requestedif (nsecs >= 10000) {throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');}_lastMSecs = msecs;_lastNSecs = nsecs;_clockseq = clockseq;// Per 4.1.4 - Convert from unix epoch to Gregorian epochmsecs += 12219292800000;// `time_low`var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;b[i++] = tl >>> 24 & 0xff;b[i++] = tl >>> 16 & 0xff;b[i++] = tl >>> 8 & 0xff;b[i++] = tl & 0xff;// `time_mid`var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;b[i++] = tmh >>> 8 & 0xff;b[i++] = tmh & 0xff;// `time_high_and_version`b[i++] = tmh >>> 24 & 0xf | 0x10; // include versionb[i++] = tmh >>> 16 & 0xff;// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)b[i++] = clockseq >>> 8 | 0x80;// `clock_seq_low`b[i++] = clockseq & 0xff;// `node`for (var n = 0; n < 6; ++n) {b[i + n] = node[n];}return buf ? buf : bytesToUuid(b);}module.exports = v1;/***/ }),/***/ 7358:/***/ ((module, __unused_webpack_exports, __webpack_require__) => {var rng = __webpack_require__(6880);var bytesToUuid = __webpack_require__(5594);function v4(options, buf, offset) {var i = buf && offset || 0;if (typeof(options) == 'string') {buf = options === 'binary' ? new Array(16) : null;options = null;}options = options || {};var rnds = options.random || (options.rng || rng)();// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`rnds[6] = (rnds[6] & 0x0f) | 0x40;rnds[8] = (rnds[8] & 0x3f) | 0x80;// Copy bytes to buffer, if providedif (buf) {for (var ii = 0; ii < 16; ++ii) {buf[i + ii] = rnds[ii];}}return buf || bytesToUuid(rnds);}module.exports = v4;/***/ }),/***/ 4391:/***/ ((module) => {"use strict";module.exports = "<div id=\"pizyds_rain_header_field\">\r\n    <p>\r\n        版本：<%= BUILD_VERSION %>&nbsp;&nbsp;|&nbsp;&nbsp;编译时间：<%= BUILD_TIME %><br/>\r\n        脚本开源维护中，欢迎&nbsp;<a href=\"https://www.pizyds.com/rain-classroom-pdf-direct-download/\" target=\"_blank\" class=\"no-text-decoration\">反馈问题</a><br/>\r\n    </p>\r\n    <p id=\"pizyds_rain_header_message\" class=\"text-emphasis\">\r\n        <%- HEADER_MESSAGE %>\r\n    </p>\r\n</div>\r\n\r\n<hr/>\r\n\r\n<div id=\"pizyds_rain_switch_field\">\r\n    <div class=\"form-check form-switch form-check-inline\">\r\n        <input class=\"form-check-input\" type=\"checkbox\" id=\"pizyds_rain_answer_switch\" <%= ANS_ENABLED ? \"checked\" : \"\" %>>\r\n        <label class=\"form-check-label\" for=\"pizyds_rain_answer_switch\" title=\"仅支持“课堂”类型的课件\">选择题答案</label>\r\n    </div>\r\n\r\n    <div class=\"form-check form-switch form-check-inline\">\r\n        <input class=\"form-check-input\" type=\"checkbox\" id=\"pizyds_rain_drm_switch\" <%= DRM_ENABLED ? \"checked\" : \"\" %> disabled>\r\n        <label class=\"form-check-label\" for=\"pizyds_rain_drm_switch\" title=\"默认不可更改，请查看帮助\">\r\n            DRM&nbsp;<a href=\"https://www.pizyds.com/rain-classroom-pdf-direct-download-pizyds-rain-drm/\" target=\"_blank\" class=\"no-text-decoration\">(&nbsp;?&nbsp;)</a>\r\n        </label>\r\n    </div>\r\n</div>\r\n\r\n<hr/>\r\n\r\n<div id=\"pizyds_rain_answer_font_size_field\" class=\"<%= ANS_ENABLED ? \"\" : \"disabledField\" %>\">\r\n    <label for=\"pizyds_rain_answer_font_size_range\" class=\"form-label\">\r\n        答案字号&nbsp;\r\n        <span id=\"pizyds_rain_answer_font_size_show\"><%= FONT_SIZE %></span>\r\n    </label>\r\n    <span id=\"pizyds_rain_answer_font_size_default\" title=\"复位\">\r\n        <%- DEFAULT_SVG %>\r\n    </span>\r\n    <input id=\"pizyds_rain_answer_font_size_range\" type=\"range\" class=\"form-range\" min=\"0\" max=\"80\" step=\"1\" value=\"<%= FONT_SIZE %>\" <%= ANS_ENABLED ? \"\" : \"disabled\" %>>\r\n</div>\r\n\r\n<div id=\"pizyds_rain_footer_field\">\r\n    <span class=\"footer-span\">\r\n        - &nbsp; \r\n        <a href=\"https://www.pizyds.com/rain-classroom-pdf-direct-download/\" target=\"_blank\" title=\"主页\">\r\n            <%- HOUSE_SVG %>\r\n        </a>\r\n        &nbsp; | &nbsp; \r\n        <a href=\"https://github.com/PillarsZhang/Rain-Classroom-PDF-Direct-Download\" target=\"_blank\" title=\"Github\">\r\n            <%- GITHUB_SVG %>\r\n        </a>\r\n        &nbsp; | &nbsp; \r\n        <a href=\"https://greasyfork.org/scripts/424050\" target=\"_blank\" title=\"Greasy Fork\">\r\n            <%- CODE_SVG %>\r\n        </a>\r\n        &nbsp; -\r\n    </span>\r\n</div>";/***/ }),/***/ 9666:/***/ ((module) => {"use strict";module.exports = "雨课堂课件PDF下载工具";/***/ }),/***/ 9351:/***/ ((module) => {"use strict";module.exports = "<span id=\"pizyds_rain_button_field\" class=\"<%= FIELD_CLASS %> <%= CLASS %> noselect\">\r\n    <span id=\"pizyds_rain_waiting\">\r\n        <span id=\"pizyds_rain_download_button\" title=\"点击下载PPT\">\r\n            <%- DOWNLOAD_BUTTON_ICON %> 下载课件\r\n        </span>\r\n        <span id=\"pizyds_rain_config_button\">\r\n            [ <%- CONFIG_BUTTON_ICON %> ]\r\n        </span>\r\n    </span>\r\n    <span id=\"pizyds_rain_running\" hidden>\r\n        <span title=\"运行中\">\r\n            <%- DOWNLOAD_BUTTON_ICON %> <span id=\"pizyds_rain_running_text\">运行中</span>\r\n        </span>\r\n        <span>\r\n            [ <%- RUNNING_BUTTON_ICON %> ]\r\n        </span>\r\n    </span>\r\n</span>";/***/ }),/***/ 7507:/***/ ((module) => {"use strict";module.exports = "-----BEGIN PUBLIC KEY-----\r\nMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAx2N75k3SL4PqTifrjSHj\r\n0CdMMoKwPgzb64Z6UuuTvn3vSn6l9tJ/9gRNZTrQ8B0aphtK3sAPUBuadcOplAap\r\nbJsuEizydGgvdNvKNlNL1OzSvrvjkHe5OxYzW+0A00U4l1zyzZJ0TW06cHpi8Pcq\r\nIRv3hNJ5nHXHnLudsxxQ4XiiSpvIs8fUuO6PAJkCPYFnH2fWUVo22xqwbQBSowot\r\njzLOwNugoq85aSPNBJZR9pQcerr3X7kowK+Ul6Hk9k+ZKL1pZ0NS1o/N/qFgD9Ow\r\nvr2vW8ylIAAb4B6vhPxOXkFKcIYiA+Kj+Ich7d3TNpeY5/nOCovp2xPQqCiplmGB\r\nKQIDAQAB\r\n-----END PUBLIC KEY-----\r\n";/***/ }),/***/ 7418:/***/ (() => {/* (ignored) *//***/ })/******/ 	});/************************************************************************//******/ 	// The module cache/******/ 	var __webpack_module_cache__ = {};/******//******/ 	// The require function/******/ 	function __webpack_require__(moduleId) {/******/ 		// Check if module is in cache/******/ 		var cachedModule = __webpack_module_cache__[moduleId];/******/ 		if (cachedModule !== undefined) {/******/ 			return cachedModule.exports;/******/ 		}/******/ 		// Create a new module (and put it into the cache)/******/ 		var module = __webpack_module_cache__[moduleId] = {/******/ 			id: moduleId,/******/ 			// no module.loaded needed/******/ 			exports: {}/******/ 		};/******//******/ 		// Execute the module function/******/ 		__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);/******//******/ 		// Return the exports of the module/******/ 		return module.exports;/******/ 	}/******//************************************************************************//******/ 	/* webpack/runtime/compat get default export *//******/ 	(() => {/******/ 		// getDefaultExport function for compatibility with non-harmony modules/******/ 		__webpack_require__.n = (module) => {/******/ 			var getter = module && module.__esModule ?/******/ 				() => (module['default']) :/******/ 				() => (module);/******/ 			__webpack_require__.d(getter, { a: getter });/******/ 			return getter;/******/ 		};/******/ 	})();/******//******/ 	/* webpack/runtime/define property getters *//******/ 	(() => {/******/ 		// define getter functions for harmony exports/******/ 		__webpack_require__.d = (exports, definition) => {/******/ 			for(var key in definition) {/******/ 				if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {/******/ 					Object.defineProperty(exports, key, { enumerable: true, get: definition[key] });/******/ 				}/******/ 			}/******/ 		};/******/ 	})();/******//******/ 	/* webpack/runtime/global *//******/ 	(() => {/******/ 		__webpack_require__.g = (function() {/******/ 			if (typeof globalThis === 'object') return globalThis;/******/ 			try {/******/ 				return this || new Function('return this')();/******/ 			} catch (e) {/******/ 				if (typeof window === 'object') return window;/******/ 			}/******/ 		})();/******/ 	})();/******//******/ 	/* webpack/runtime/hasOwnProperty shorthand *//******/ 	(() => {/******/ 		__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))/******/ 	})();/******//******/ 	/* webpack/runtime/make namespace object *//******/ 	(() => {/******/ 		// define __esModule on exports/******/ 		__webpack_require__.r = (exports) => {/******/ 			if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {/******/ 				Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });/******/ 			}/******/ 			Object.defineProperty(exports, '__esModule', { value: true });/******/ 		};/******/ 	})();/******//************************************************************************/var __webpack_exports__ = {};// This entry need to be wrapped in an IIFE because it need to be in strict mode.(() => {"use strict";;// CONCATENATED MODULE: PRPS\src\libs\common.js//运行环境配置var env_config = {_version: "0.0.0",log: {config: false}}autoGMValue(env_config, "env_config");//编译信息var build_info = {name: "rain-classroom-pdf-direct-download",version: "1.3.2",timestamp: 1654533197339,}//对自动添加客观题答案到PPT页面的配置var ans_config = {_enabled: true,_fontSize: 40,right: 30,up: 20,fontColor: "#000000",text: {enabled: "课件附答案",fontSize: "答案字号"}};autoGMValue(ans_config, "ans_config");var drm_config = {_enabled: true,text: {enabled: "DRM"}};autoGMValue(drm_config, "drm_config");//网址分类规则var url_match = [{reg: /https:\/\/.*\.yuketang\.cn\/v2\/web\/student\/.*/,type: 1},{reg: /https:\/\/.*\.yuketang\.cn\/v2\/web\/student-v3\/.*/,type: 1},{reg: /https:\/\/.*\.yuketang\.cn\/v2\/web\/studentCards\/.*/,type: 2}];env_config.log.config = true;function autoGMValue(obj, objName){for (let keyTemp in obj){if (keyTemp.startsWith('_')){let _key = keyTemp; //内置值let key = _key.substring(1); //操作值let $key = '$' + key; //默认值let GMValueName = `${objName}.${key}`;obj[$key] = obj[_key];Object.defineProperty(obj, key, {set: function(val) {this[_key] = val;GM_setValue(GMValueName, this[_key]);env_config.log.config && console.log(`雨课堂课件PDF下载工具：${this.text&&this.text[key]||GMValueName} - ${this[_key]}`);},get: function() {this[_key] = GM_getValue(GMValueName, this[_key]);return this[_key];},});refreshGMValue(obj, key);}}}function refreshGMValue(obj, key){obj[key] = obj[key].valueOf();}var time_object = {popover_can_hide: Date.now()}var update_info_list = {'1.3.1': `优化了生成速度、报错信息，修复了图片格式兼容、面板不刷新的Bug`,'1.3.2': `外部库依赖改为国内的 75CDN，增加校验参数与开发时的校验比对脚本`}var update_info = update_info_list[build_info.version] ?update_info_list[build_info.version] :'好像没有更新信息';// EXTERNAL MODULE: PRPS\node_modules\bootstrap-icons\icons\file-earmark-pdf.svgvar PRPU_node_modules_bootstrap_icons_icons_file_earmark_pdf = __webpack_require__(5154);// EXTERNAL MODULE: PRPS\node_modules\bootstrap-icons\icons\gear-fill.svgvar PRPU_node_modules_bootstrap_icons_icons_gear_fill = __webpack_require__(1984);;// CONCATENATED MODULE: external "jQuery"const external_jQuery_namespaceObject = jQuery;var external_jQuery_default = /*#__PURE__*/__webpack_require__.n(external_jQuery_namespaceObject);// EXTERNAL MODULE: PRPS\node_modules\semver\semver.jsvar PRPU_node_modules_semver_semver = __webpack_require__(7776);;// CONCATENATED MODULE: PRPS\src\libs\public.js//按钮文本刷新function refreshProcessStatus(processStatus){if (!processStatus){external_jQuery_default()("#pizyds_rain_running").attr("hidden", "");external_jQuery_default()("#pizyds_rain_waiting").removeAttr("hidden");} else{external_jQuery_default()("#pizyds_rain_running_text").html(processStatus);external_jQuery_default()("#pizyds_rain_waiting").attr("hidden", "");external_jQuery_default()("#pizyds_rain_running").removeAttr("hidden");}}//修改自：http://www.jsfun.cn/#textBecomeImg//js使用canvas将文字转换成ImageData对象function text2img(text, fontsize, fontcolor){var canvas = document.createElement('canvas');canvas.height = parseInt(fontsize * 1.2);var ctx = canvas.getContext('2d');ctx.clearRect(0, 0, canvas.width, canvas.height);ctx.fillStyle = fontcolor;ctx.font = fontsize + "px Arial";ctx.textBaseline = 'middle';ctx.fillText(text, 0, fontsize/2);canvas.width = ctx.measureText(text).width;ctx.fillStyle = fontcolor;ctx.font = fontsize + "px Arial";ctx.textBaseline = 'middle';ctx.fillText(text, 0, fontsize/2);var dta = ctx.getImageData(0, 0, canvas.width, canvas.height);dta.url = canvas.toDataURL();return dta;}//来自：https://www.cnblogs.com/ranyonsue/p/7596347.html//HTML删除节点function removeElement(_element){var _parentElement = _element.parentNode;if(_parentElement){_parentElement.removeChild(_element);}}//休眠var sleep = (time) => new Promise(reslove => setTimeout(reslove, time));/*** 调整 SVG 尺寸* @param {string} svg SVG 字符串* @param {number} width 宽度* @param {number} height 高度* @return {void}*/function adjustSVGSize(svg, width, height = null){var node = external_jQuery_default().parseHTML(svg)[0];var newHeight = height ? height : width / parseInt(external_jQuery_default()(node).attr("width")) * parseInt(external_jQuery_default()(node).attr("height"));var newWidth = width ? width : height / parseInt(external_jQuery_default()(node).attr("height")) * parseInt(external_jQuery_default()(node).attr("width"));external_jQuery_default()(node).attr("height", newHeight);external_jQuery_default()(node).attr("width", newWidth);return node.outerHTML;}/*** 给 SVG 添加 css* @param {string} svg SVG 字符串* @param {string} css css* @return {void}*/function addSVGClass(svg, css){var node = external_jQuery_default().parseHTML(svg)[0];external_jQuery_default()(node).addClass(css);return node.outerHTML;}function judgeVersionUpdate() {if (PRPU_node_modules_semver_semver.SemVer.neq(env_config.version, build_info.version)){if (PRPU_node_modules_semver_semver.SemVer.eq(env_config.version, "0.0.0")){return "new";} else if (PRPU_node_modules_semver_semver.SemVer.gt(env_config.version, build_info.version)){return "down";} else if (PRPU_node_modules_semver_semver.SemVer.lt(env_config.version, build_info.version)){return "up";}} else {return false;}}var textVersionUpdate = {"new": `感谢！新安装：${env_config.version} -> ${build_info.version}，更新内容：${update_info}`,"up": `感谢！已升级：${env_config.version} -> ${build_info.version}，更新内容：${update_info}`,"down": `啊？已降级：${env_config.version} -> ${build_info.version}`}function clearVersionUpdate () {if (judgeVersionUpdate()){env_config.version = build_info.version;return true;} else {return false;}}//https://stackoverflow.com/questions/52059596/loading-an-image-on-web-browser-using-promise/52060802/*** 将图片链接转化为HTMLImageElement对象* @param {string} url 图片链接* @return {HTMLImageElement} HTMLImageElement对象*/const url2HTMLImageElement = (url) => new Promise((resolve, reject) => {const img = new Image();img.addEventListener('load', () => resolve(img));img.addEventListener('error', (err) => reject(err));img.crossOrigin = "anonymous";img.src = url;});/*** 将图片链接转化为ImageData对象* @param {string} url 图片链接* @return {ImageData} ImageData对象*/async function url2ImgData(url){var img = await url2HTMLImageElement(url);var canvas = document.createElement('canvas');canvas.height = img.height;canvas.width = img.width;var ctx = canvas.getContext('2d');ctx.drawImage(img, 0, 0);var dta = ctx.getImageData(0, 0, canvas.width, canvas.height);dta.url = canvas.toDataURL();return dta;}var headerMessage = [];//控制面板信息刷新function refreshHeaderMessage(message, type = 'Info', show = true){var suffix = {'Warn': '具体请参考控制台报错信息','Info': ''}if (!message){headerMessage = []} else{time_object.popover_can_hide = Date.now() + 500;headerMessage.push(`[${type}] ${message} ${suffix[type]}`);show && external_jQuery_default()('#pizyds_rain_config_button').popover('show');}}function getHeaderMessage(){var temp = headerMessage.join('<br>');headerMessage = [];return temp}// EXTERNAL MODULE: PRPS\src\ejs\ejs_pizyds_rain_conf_panel.ejsvar PRPU_src_ejs_ejs_pizyds_rain_conf_panel = __webpack_require__(4391);// EXTERNAL MODULE: PRPS\src\ejs\ejs_pizyds_rain_conf_title.ejsvar PRPU_src_ejs_ejs_pizyds_rain_conf_title = __webpack_require__(9666);// EXTERNAL MODULE: PRPS\node_modules\ejs\ejs.jsvar PRPU_node_modules_ejs_ejs = __webpack_require__(8056);var PRPU_node_modules_ejs_ejs_default = /*#__PURE__*/__webpack_require__.n(PRPU_node_modules_ejs_ejs);// EXTERNAL MODULE: PRPS\node_modules\bootstrap\js\dist\popover.jsvar PRPU_node_modules_bootstrap_js_dist_popover = __webpack_require__(6960);// EXTERNAL MODULE: PRPS\node_modules\style-loader\dist\runtime\injectStylesIntoStyleTag.jsvar PRPU_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag = __webpack_require__(2597);var PRPU_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_default = /*#__PURE__*/__webpack_require__.n(PRPU_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag);// EXTERNAL MODULE: PRPS\node_modules\style-loader\dist\runtime\styleDomAPI.jsvar PRPU_node_modules_style_loader_dist_runtime_styleDomAPI = __webpack_require__(9774);var PRPU_node_modules_style_loader_dist_runtime_styleDomAPI_default = /*#__PURE__*/__webpack_require__.n(PRPU_node_modules_style_loader_dist_runtime_styleDomAPI);// EXTERNAL MODULE: PRPS\node_modules\style-loader\dist\runtime\getTarget.jsvar PRPU_node_modules_style_loader_dist_runtime_getTarget = __webpack_require__(316);var PRPU_node_modules_style_loader_dist_runtime_getTarget_default = /*#__PURE__*/__webpack_require__.n(PRPU_node_modules_style_loader_dist_runtime_getTarget);// EXTERNAL MODULE: PRPS\node_modules\style-loader\dist\runtime\insertStyleElement.jsvar PRPU_node_modules_style_loader_dist_runtime_insertStyleElement = __webpack_require__(4667);var PRPU_node_modules_style_loader_dist_runtime_insertStyleElement_default = /*#__PURE__*/__webpack_require__.n(PRPU_node_modules_style_loader_dist_runtime_insertStyleElement);// EXTERNAL MODULE: PRPS\node_modules\css-loader\dist\cjs.js!PRPS\node_modules\postcss-loader\dist\cjs.js!PRPS\node_modules\sass-loader\dist\cjs.js!PRPS\src\styles\css_pizyds_rain.scssvar PRPU_node_modules_css_loader_dist_cjs_js_PRPU_node_modules_postcss_loader_dist_cjs_js_PRPU_node_modules_sass_loader_dist_cjs_js_PRPU_src_styles_css_pizyds_rain = __webpack_require__(5324);;// CONCATENATED MODULE: PRPS\src\styles\css_pizyds_rain.scssvar options = {};options.styleTagTransform = function(css, style){if (style.styleSheet) {style.styleSheet.cssText = css;} else {while (style.firstChild) {style.removeChild(style.firstChild);}style.appendChild(document.createTextNode(css));}};options.setAttributes = function(style) {var nonce =true ? __webpack_require__.nc : 0;if (nonce) {style.setAttribute("nonce", nonce);}};options.insert = function(style){var target = PRPU_node_modules_style_loader_dist_runtime_getTarget_default()("head");if (!target) {throw new Error("Couldn't find a style target. This probably means that the value for the 'insert' parameter is invalid.");}target.appendChild(style);};options.domAPI = (PRPU_node_modules_style_loader_dist_runtime_styleDomAPI_default());options.insertStyleElement = (PRPU_node_modules_style_loader_dist_runtime_insertStyleElement_default());var update = PRPU_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_default()(PRPU_node_modules_css_loader_dist_cjs_js_PRPU_node_modules_postcss_loader_dist_cjs_js_PRPU_node_modules_sass_loader_dist_cjs_js_PRPU_src_styles_css_pizyds_rain/* default */.Z, options);/* harmony default export */ const PRPU_src_styles_css_pizyds_rain = (PRPU_node_modules_css_loader_dist_cjs_js_PRPU_node_modules_postcss_loader_dist_cjs_js_PRPU_node_modules_sass_loader_dist_cjs_js_PRPU_src_styles_css_pizyds_rain/* default */.Z && PRPU_node_modules_css_loader_dist_cjs_js_PRPU_node_modules_postcss_loader_dist_cjs_js_PRPU_node_modules_sass_loader_dist_cjs_js_PRPU_src_styles_css_pizyds_rain/* default.locals */.Z.locals ? PRPU_node_modules_css_loader_dist_cjs_js_PRPU_node_modules_postcss_loader_dist_cjs_js_PRPU_node_modules_sass_loader_dist_cjs_js_PRPU_src_styles_css_pizyds_rain/* default.locals */.Z.locals : undefined);// EXTERNAL MODULE: PRPS\node_modules\bootstrap-icons\icons\arrow-return-left.svgvar PRPU_node_modules_bootstrap_icons_icons_arrow_return_left = __webpack_require__(9856);// EXTERNAL MODULE: PRPS\node_modules\bootstrap-icons\icons\github.svgvar PRPU_node_modules_bootstrap_icons_icons_github = __webpack_require__(1739);// EXTERNAL MODULE: PRPS\node_modules\bootstrap-icons\icons\house.svgvar PRPU_node_modules_bootstrap_icons_icons_house = __webpack_require__(7185);// EXTERNAL MODULE: PRPS\node_modules\bootstrap-icons\icons\code-slash.svgvar PRPU_node_modules_bootstrap_icons_icons_code_slash = __webpack_require__(376);;// CONCATENATED MODULE: PRPS\src\libs\conf_panel.js/*** 悬浮窗注入* @param {Element} buttonEle 需要注入悬浮窗的按钮* @return {void}*//* harmony default export */ function PRPU_src_libs_conf_panel(buttonEle){var form_templ = PRPU_src_ejs_ejs_pizyds_rain_conf_panel;var form_html = () => PRPU_node_modules_ejs_ejs_default().render(form_templ, {BUILD_VERSION: build_info.version,BUILD_TIME: formatDate(new Date(build_info.timestamp)),ANS_ENABLED: ans_config.enabled,DRM_ENABLED: drm_config.enabled,FONT_SIZE: ans_config.fontSize,HEADER_MESSAGE: getHeaderMessage(),DEFAULT_SVG: adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_arrow_return_left, 12),HOUSE_SVG: adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_house, 12),GITHUB_SVG: adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_github, 12),CODE_SVG: adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_code_slash, 12)});var container = external_jQuery_default()(".pizyds_rain")[0];external_jQuery_default()(container).off();// eslint-disable-next-line no-unused-varsexternal_jQuery_default()(buttonEle).popover({title: PRPU_node_modules_ejs_ejs_default().render(PRPU_src_ejs_ejs_pizyds_rain_conf_title),container,content: form_html,html: true,sanitize: false,placement: "bottom",customClass: "pizyds_rain_conf_popover",trigger: "click",offset: [-80, 8]})external_jQuery_default()("html").off();external_jQuery_default()("html").on('click', function (e) {var popoverEle = external_jQuery_default()('.pizyds_rain_conf_popover')[0];if (time_object.popover_can_hide < Date.now() &&popoverEle &&!external_jQuery_default()(buttonEle).is(e.target) &&external_jQuery_default()(buttonEle).has(e.target).length == 0 &&!external_jQuery_default()(popoverEle).is(e.target) &&external_jQuery_default()(popoverEle).has(e.target).length == 0) {external_jQuery_default()(popoverEle).popover('hide');}});external_jQuery_default()(container).on('input change', "#pizyds_rain_answer_font_size_range", function(){external_jQuery_default()("#pizyds_rain_answer_font_size_show").html(this.value);})external_jQuery_default()(container).on('change', "#pizyds_rain_answer_font_size_range", function(){ans_config.fontSize = this.value;})external_jQuery_default()(container).on('change', "#pizyds_rain_answer_switch", function(){ans_config.enabled = this.checked;if (!ans_config.enabled) {external_jQuery_default()("#pizyds_rain_answer_font_size_field").addClass("disabledField").find('input').attr('disabled', '');} else{external_jQuery_default()("#pizyds_rain_answer_font_size_field").removeClass("disabledField").find('input').removeAttr('disabled');}})external_jQuery_default()(container).on('click', "#pizyds_rain_answer_font_size_default", function(){external_jQuery_default()("#pizyds_rain_answer_font_size_range").prop("value", ans_config.$fontSize).trigger("change");})external_jQuery_default()(container).on('change', "#pizyds_rain_drm_switch", function(){drm_config.enabled = this.checked;})//更新提示if (judgeVersionUpdate()){refreshHeaderMessage(textVersionUpdate[judgeVersionUpdate()]);clearVersionUpdate();}}/*** Date对象转yyyy-MM-dd* @param {Date} date Date对象* @return {string} yyyy-MM-dd*/function formatDate(date){var yyyy = (date.getFullYear()).toString().padStart(4, "0");var MM = (date.getMonth()+1).toString().padStart(2, "0");var dd = (date.getDate()).toString().padStart(2, "0");return [yyyy, MM, dd].join('-')};// CONCATENATED MODULE: PRPS\src\libs\get_url_slides.js/*** PPT图片链接提取* @param {HTMLElement} el_dialog 整体 dialog DOM 对象* @return {Array} 链接列表*/function get_url_slides(el_dialog){try{var el_swiper = el_dialog.getElementsByClassName("pptSwiper")[0];var el_slides = el_swiper.getElementsByClassName("swiper-slide");var url_slides = new Array(el_slides.length);for (let i = 0; i < el_slides.length; i++){url_slides[i] = el_slides[i].getElementsByTagName("img")[0].src;}console.groupCollapsed(`雨课堂课件PDF下载工具：提取到 ${url_slides.length} 页 PPT`);console.table(url_slides);console.groupEnd();return url_slides;} catch(err){return new Array();}};// CONCATENATED MODULE: PRPS\src\libs\image_process.js/*** 借助Canvas，进行图片下载与并转化为ImageData(RGBAData)* @param url_slides 图片链接列表* @return {Promise}*//* harmony default export */ function PRPU_src_libs_image_process(url_slides){var promiseList = new Array(url_slides.length);var finished_num = 0;var count_finished_num = (index) => {var processStatus = `${++finished_num}/${url_slides.length}`;refreshProcessStatus(`处理图片(${processStatus})`);console.log(`雨课堂课件PDF下载工具：${processStatus} - 第${index+1}页 - ${url_slides[index]}`);}for (let i = 0; i < url_slides.length; i++){promiseList[i] = url2ImgData(url_slides[i]).then(ImageData => {count_finished_num(i);return ImageData;}).catch(err => {console.error(err);refreshProcessStatus(false);refreshHeaderMessage(`图像处理出错（第${i+1}页：${url_slides[i]}）`, 'Warn');throw err;});}return Promise.all(promiseList);};// CONCATENATED MODULE: external "jspdf"const external_jspdf_namespaceObject = jspdf;// EXTERNAL MODULE: PRPS\src\key\rsa_2048_pub.pemvar PRPU_src_key_rsa_2048_pub = __webpack_require__(7507);// EXTERNAL MODULE: PRPS\node_modules\uuid\index.jsvar PRPU_node_modules_uuid_index = __webpack_require__(1766);// EXTERNAL MODULE: PRPS\node_modules\hybrid-crypto-js\lib\index.jsvar PRPU_node_modules_hybrid_crypto_js_lib_index = __webpack_require__(7900);;// CONCATENATED MODULE: PRPS\src\libs\rsa_drm.js// import hybridCrypto from 'hybrid-crypto-js/web/hybrid-crypto.js';//小众的库，CDN上对WEB的模块引出方式和NODE有一点不一样var crypt = new PRPU_node_modules_hybrid_crypto_js_lib_index.Crypt({ aesKeySize: 128 });/*** 生成 DRM 信息* @return {string}*/function generateUserID(){var drm_json = {build_info: build_info,page_info: {url: window.location.href, timestamp: Date.now()},user_profile: generateUserProfile(),salt: (0,PRPU_node_modules_uuid_index.v4)()};var drm_text = JSON.stringify(drm_json);var drm_rsa_json = crypt.encrypt(PRPU_src_key_rsa_2048_pub, drm_text);var drm_rsa_obj = JSON.parse(drm_rsa_json);var drm_rsa_obj_keys = {};drm_rsa_obj_keys.fingerprint = Object.keys(drm_rsa_obj.keys)[0];drm_rsa_obj_keys.key = drm_rsa_obj.keys[drm_rsa_obj_keys.fingerprint];var drm_pizyds_rain_arr = [drm_rsa_obj.iv,hexFingerprint2Base64(drm_rsa_obj_keys.fingerprint),drm_rsa_obj_keys.key,drm_rsa_obj.cipher];return drm_pizyds_rain_arr.join(":");}/*** 生成 DRM 中的用户信息* @return {string}*/function generateUserProfile(){var way_1 = JSON.parse(localStorage.getItem("user_profile"));var way_2 = JSON.parse(localStorage.getItem("vuex")) && JSON.parse(localStorage.getItem("vuex")).userInfo;var user_profile_raw = way_1 || way_2 || {};var user_profile_name_raw = user_profile_raw.name || user_profile_raw.nickname || '?';var user_profile_name = "";var user_profile_name_choose = randomIntFromInterval(0, user_profile_name_raw.length - 1);for (let i = 0; i < user_profile_name_raw.length; i++) {user_profile_name += (i == user_profile_name_choose) ? user_profile_name_raw[i] : '*';}var user_profile = {user_id: user_profile_raw.user_id || '?',school_number: user_profile_raw.school_number || '?',name: user_profile_name}return user_profile;}function hexFingerprint2Base64(hex){var keyHexs = hex.split(':');var uint8 = new Uint8Array(keyHexs.length);keyHexs.forEach((value, index) => uint8[index] = parseInt(value, 16));return window.btoa(String.fromCharCode.apply(null, uint8));}function randomIntFromInterval(min, max) {return Math.floor(Math.random() * (max - min + 1) + min)};// CONCATENATED MODULE: PRPS\src\libs\pdf_process.js/*** 借助jsPDF，进行PDF的生成* @param img_list 图片列表* @param filename 保存的文件名* @param answer_list 答案列表* @return {Promise}*//* harmony default export */ async function PRPU_src_libs_pdf_process(img_list, filename, answer_list){console.groupCollapsed("雨课堂课件PDF下载工具：生成PDF...");var doc = new external_jspdf_namespaceObject.jsPDF({orientation: "landscape",unit: "px",format: [img_list[0].width, img_list[0].height],hotfixes: ["px_scaling"]});injectXMP(doc, [img_list[0].width, img_list[0].height]);for (let i = 0; i < img_list.length; i++){i > 0 && doc.addPage([img_list[i].width, img_list[i].height], "landscape");await addPPT(i, doc, img_list, answer_list);refreshProcessStatus(`生成PDF(${i+1}/${img_list.length})`);await sleep(10);}console.groupEnd();doc.save(filename);console.log(`雨课堂课件PDF下载工具：完成下载`);console.log(`雨课堂课件PDF下载工具：https://www.pizyds.com/rain-classroom-pdf-direct-download/`);}/*** 附加 PPT 页面* @param {number} index* @param {jsPDF} doc jsPDF 对象* @param {Array} answer_list 答案列表* @return {Promise}*/async function addPPT(index, doc, img_list, answer_list){console.log(`雨课堂课件PDF下载工具：第 ${index+1} 页 - PPT`);doc.addImage({imageData: img_list[index].url,format: 'PNG',x: 0,y: 0,width: img_list[index].width,height: img_list[index].height,compression: 'FAST'});if (ans_config.enabled){let answer_item = answer_list.find(obj => obj.index == index);if (answer_item && answer_item.ans != "") {let answer_img = text2img(answer_item.ans, ans_config.fontSize, ans_config.fontColor);console.log(`雨课堂课件PDF下载工具：第 ${index+1} 页 - 答案 - ${answer_item.ans}`);doc.addImage({imageData: answer_img.url,format: 'PNG',x: img_list[index].width - answer_img.width - ans_config.right,y: ans_config.up,width: answer_img.width,height: answer_img.height,compression: 'FAST'});}}}/*** 注入 DRM 信息* @param {jsPDF} doc jsPDF 对象* @param {Array} size 当前 PPT 页面尺寸* @return {void}*/function injectXMP(doc, size){if (drm_config.enabled){console.log(`雨课堂课件PDF下载工具：注入数字版权信息`);var userID = generateUserID();var drmURL = "https://www.pizyds.com/rain-classroom-pdf-direct-download-pizyds-rain-drm/"doc.addMetadata(userID, drmURL);var drm_explain = `This file is automatically generated by the tampermonkey script "Rain Classroom PDF Direct Download", ` +`and injected with DRM information through RSA+AES hybrid encryption. Please respect the copyright of the PPT publisher.\n\n` +`For detailed information, please refer to:\n${drmURL}\n\nDRM information:`;doc.text(size[1]*0.1, size[1]*0.1, [drm_explain, userID], { baseline: "top", maxWidth: 1000});}};// CONCATENATED MODULE: PRPS\src\libs\get_html_slides.js/*** PPT HTML Class 标注（针对发布的“课件”类型）* @param el_dialog 整体 dialog DOM 对象* @return {Boolean}*/function get_html_slides(el_dialog){try{var el_swiper = el_dialog.getElementsByClassName("pptSwiper")[0];var el_slides = el_swiper.getElementsByClassName("swiper-slide");for (let i = 0; i < el_slides.length; i++){el_slides[i].classList.add("pizyds_el_slide");el_slides[i].getElementsByClassName("courseware heightPriority")[0].classList.add("pizyds_el_ppt");}console.log(`雨课堂课件PDF下载工具：提取到 ${el_slides.length} 页 PPT`);return true;} catch(err){console.error(err);return false;}};// CONCATENATED MODULE: external "html2canvas"const external_html2canvas_namespaceObject = html2canvas;var external_html2canvas_default = /*#__PURE__*/__webpack_require__.n(external_html2canvas_namespaceObject);;// CONCATENATED MODULE: PRPS\src\libs\html2canvas_hd.jsvar hd_sample_sacle = 4;var hd_output_sacle = 2;function oncloneFunction(clonedDocument, index, { c, pos }){//画布准备，高采样var el_ppts = clonedDocument.getElementsByClassName("pizyds_el_ppt");var el_ppt = el_ppts[index];el_ppt.style.transform = "translate3d(-50%, -50%, 0px)";pos.w = el_ppt.getBoundingClientRect();pos.o = { width: parseInt(el_ppt.style.width), height: parseInt(el_ppt.style.height) };pos.e = { width: pos.o.width * hd_sample_sacle, height: pos.o.height * hd_sample_sacle };console.log(pos);c.width = pos.e.width;c.height = pos.e.height;var ctx = c.getContext("2d");//ctx.imageSmoothingEnabled = false;ctx.scale(pos.e.width / pos.w.width, pos.e.height / pos.w.height);ctx.translate(- pos.w.left, - pos.w.top);var el_slides = clonedDocument.getElementsByClassName("pizyds_el_slide");el_slides = Array.from(el_slides);for (let i = 0; i < index; i++) removeElement(el_slides[i]);el_slides[index].style.opacity = 1;el_slides[index].style.transform = "translate3d(0px, 0px, 0px)";}async function render(index, { el_ppts, processStatus }){var c = document.createElement("canvas");var pos = { w: null, o: null, e: null };console.log(`雨课堂课件PDF下载工具：${processStatus} - 高采样`);var el_ppt = el_ppts[index];//html2canvasconsole.groupCollapsed(`雨课堂课件PDF下载工具：${processStatus} - html2canvas 日志`);return external_html2canvas_default()(el_ppt, {logging: true,useCORS: true,canvas:c,onclone: clonedDocument => oncloneFunction(clonedDocument, index, { c, pos })}).then(() => {console.groupEnd();//压缩尺寸，低采样console.log(`雨课堂课件PDF下载工具：${processStatus} - 低采样`);var c2 = document.createElement('canvas');c2.width = pos.o.width * hd_output_sacle;c2.height = pos.o.height * hd_output_sacle;var ctx2 = c2.getContext('2d');ctx2.drawImage(c, 0, 0, c2.width, c2.height);var dta = ctx2.getImageData(0, 0, c2.width, c2.height);dta.url = c2.toDataURL();return dta;}).catch(err => {console.error(err);refreshProcessStatus(false);refreshHeaderMessage(`HTML转高清Canvas出错（第${index+1}页）`, 'Warn');throw err;});}/*** HTML转高清Canvas，一大堆神奇操作驯服原版html2canvas* @return {Array} PPT 的 RAW 图片*//* harmony default export */ async function PRPU_src_libs_html2canvas_hd() {console.groupCollapsed("雨课堂课件PDF下载工具：HTML转高清Canvas...");var RGBAData_ppts = [];var el_ppts = document.getElementsByClassName("pizyds_el_ppt");refreshProcessStatus("转换HTML...");for (let i = 0; i < el_ppts.length; i++){var processStatus = `${i+1}/${el_ppts.length}`;refreshProcessStatus(`转换HTML(${processStatus})`);RGBAData_ppts[i] = await render(i, { el_ppts, processStatus });console.log(`雨课堂课件PDF下载工具：${processStatus} - 第${i+1}页 - size: ${RGBAData_ppts[i].data.length}, ${RGBAData_ppts[i].width}x${RGBAData_ppts[i].height}`);}console.groupEnd();console.log(`雨课堂课件PDF下载工具：完成转换`);return RGBAData_ppts;};// CONCATENATED MODULE: PRPS\src\libs\get_answers.js/*** 获取客观题答案* @param url_slides PPT URL 列表* @return {Array} 答案列表*/function get_answers(url_slides){var el_problem = document.getElementById("problem");var answer_list = [];if (el_problem){var el_exercises_info = el_problem.getElementsByClassName("exercises_info");for (let i = 0; i < el_exercises_info.length; i++){let el_url = el_exercises_info[i].querySelector(".img_box>img");let el_ans = el_exercises_info[i].querySelector(".answer_info>.correct_answer");var answer_item = { url: el_url ? el_url.src : "", ans: el_ans ? el_ans.innerText : "", index: -1 };answer_item.index = url_slides.indexOf(answer_item.url);answer_list.push(answer_item);}}console.groupCollapsed(`雨课堂课件PDF下载工具：提取到 ${answer_list.length} 项答案`);console.table(answer_list);console.groupEnd();return answer_list;};// CONCATENATED MODULE: PRPS\src\libs\download_process.js/*** 按钮触发PDF生成逻辑* @param el_dialog 整体 dialog DOM 对象* @param url_type URL 类型* @return {void}*//* harmony default export */ function PRPU_src_libs_download_process(el_dialog, url_type = 1){var type_fun = [{type: 0,fun: () => {console.log(`雨课堂课件PDF下载工具：PDF生成逻辑未知错误 - type ${url_type}`);return false;}},{type: 1,fun: () => {var url_slides = get_url_slides(el_dialog);if (url_slides.length > 0){refreshProcessStatus("处理图片...");console.groupCollapsed("雨课堂课件PDF下载工具：处理图片...");PRPU_src_libs_image_process(url_slides).then(async img_list => {console.groupEnd();refreshProcessStatus("生成PDF...");await sleep(200);var ppt_name = document.getElementsByClassName("ppt_name")[0].innerText;var filename = ppt_name + ".pdf";var answer_list = ans_config.enabled ? get_answers(url_slides): [];await PRPU_src_libs_pdf_process(img_list, filename, answer_list).catch(err => {console.error(err);refreshProcessStatus(false);refreshHeaderMessage("PDF生成出错", 'Warn');throw err;});refreshProcessStatus(false);})} else{refreshProcessStatus(false);refreshHeaderMessage("没有提取到图片", 'Warn');}}},{type: 2,fun: () => {var html_slides = get_html_slides(el_dialog);if (html_slides){refreshProcessStatus("处理HTML...");//HTML转图片PRPU_src_libs_html2canvas_hd().then(async img_list => {refreshProcessStatus("生成PDF...");await sleep(200);var ppt_name = document.getElementsByClassName("ppt_name")[0].innerText;var filename = ppt_name + ".pdf";var answer_list = [];await PRPU_src_libs_pdf_process(img_list, filename, answer_list).catch(err => {console.error(err);refreshProcessStatus(false);refreshHeaderMessage("PDF生成出错", 'Warn');throw err;});refreshProcessStatus(false);})} else{refreshProcessStatus(false);refreshHeaderMessage("没有提取到图片", 'Warn');}}}];return type_fun.find(value => value.type == url_type).fun();}// EXTERNAL MODULE: PRPS\src\ejs\ejs_pizyds_rain_download_button.ejsvar PRPU_src_ejs_ejs_pizyds_rain_download_button = __webpack_require__(9351);;// CONCATENATED MODULE: PRPS\src\libs\button_download.js/*** 按钮注入* @param el_dialog 整体 dialog DOM 对象* @param url_type URL 类型* @return {void}*/function button_download(el_dialog, url_type = 1){if (!data_on_type[url_type]){console.log(`雨课堂课件PDF下载工具：按钮注入未知错误 - type ${url_type}`);return false;}var el_header = header_on_type[url_type](el_dialog);if (!el_header){console.log(`雨课堂课件PDF下载工具：layout header 查找失败`);return false;}if (external_jQuery_default()(el_header).find("#pizyds_rain_button_field").length == 0){try {external_jQuery_default()(el_dialog).addClass("pizyds_rain"); //自定义CSS启用的条件var template = PRPU_node_modules_ejs_ejs_default().compile(PRPU_src_ejs_ejs_pizyds_rain_download_button);var data = Object.assign(data_on_type["base"], data_on_type[url_type]);var html = template(data);external_jQuery_default()(el_header).find(`.${data.CLASS}`).first().before(html);external_jQuery_default()("#pizyds_rain_download_button").off();external_jQuery_default()("#pizyds_rain_download_button").on("click", () => PRPU_src_libs_download_process(el_dialog, url_type));PRPU_src_libs_conf_panel(external_jQuery_default()("#pizyds_rain_config_button"));if (url_type == 2) refreshHeaderMessage('“课件”类型不支持添加选择题答案', 'Info', false);console.log(`雨课堂课件PDF下载工具：按钮注入成功 - type ${url_type}`);} catch (err) {return false;}}return true;}var data_on_type = {base: {CLASS: "",FIELD_CLASS: "",DOWNLOAD_BUTTON_ICON: adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_file_earmark_pdf, 14),CONFIG_BUTTON_ICON: adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_gear_fill, 14),RUNNING_BUTTON_ICON: addSVGClass(adjustSVGSize(PRPU_node_modules_bootstrap_icons_icons_gear_fill, 14), 'rotating')},1: {CLASS: "print",FIELD_CLASS: "pizyds_rain_button_field_type_1",},2: {CLASS: "button"}}var header_on_type = {1: (el_dialog) => external_jQuery_default()(el_dialog).find(".layout_header").first(),2: (el_dialog) => external_jQuery_default()(el_dialog).find(".layout-header").first()};// CONCATENATED MODULE: PRPS\src\index.jsvar realTimeSearchError = {count: () => {realTimeSearchError.num++;if (realTimeSearchError.num > realTimeSearchError.maxNum){clearInterval(realTimeSearchError.interval);realTimeSearchError.num = 0;console.log("雨课堂课件PDF下载工具：按钮注入超时，请重新刷新网页，或提交反馈");alert("雨课堂课件PDF下载工具：按钮注入超时，请重新刷新网页，或提交反馈");}},num: 0,maxNum: 25,interval: null}if (!checkFlagMeta()){addFlagMeta();console.log("雨课堂课件PDF下载工具：已载入");//实时查找PPT窗口realTimeSearchError.interval = setInterval(()=>{var url_type, el_dialog;(url_type = check_url()) && (el_dialog = find_basePPTDialog()) && !button_download(el_dialog, url_type) && realTimeSearchError.count();}, 200);}function addFlagMeta(){var flagMeta = document.createElement('meta');flagMeta.name = 'pizyds_rain';flagMeta.content = 'https://www.pizyds.com/rain-classroom-pdf-direct-download';document.head.appendChild(flagMeta);}function checkFlagMeta(){return document.head.querySelector("[name~=pizyds_rain]");}//更改为内部校验链接，因为大量ajax页面跳转的存在function check_url(){var url_found = url_match.find(value => value.reg.test(window.location.href));if (url_found){return url_found.type;} else{return false;}}//查找PPT窗口function find_basePPTDialog(){var el_dialogs = document.getElementsByClassName("basePPTDialog");if (el_dialogs.length == 1){return el_dialogs[0];} else{return false;}}})();/******/ })();