@paulirish/trace_engine 0.0.28 → 0.0.30

package/models/trace/insights/RenderBlocking.js

@@ -3,10 +3,83 @@
 // found in the LICENSE file.
 import * as Handlers from '../handlers/handlers.js';
 import * as Helpers from '../helpers/helpers.js';
-import { InsightWarning } from './types.js';
+import { InsightWarning, } from './types.js';
+// Because of the way we detect blocking stylesheets, asynchronously loaded
+// CSS with link[rel=preload] and an onload handler (see https://github.com/filamentgroup/loadCSS)
+// can be falsely flagged as blocking. Therefore, ignore stylesheets that loaded fast enough
+// to possibly be non-blocking (and they have minimal impact anyway).
+const MINIMUM_WASTED_MS = 50;
 export function deps() {
     return ['NetworkRequests', 'PageLoadMetrics'];
 }
+/**
+ * Given a simulation's nodeTimings, return an object with the nodes/timing keyed by network URL
+ */
+function getNodesAndTimingByRequestId(nodeTimings) {
+    const requestIdToNode = new Map();
+    for (const [node, nodeTiming] of nodeTimings) {
+        if (node.type !== 'network') {
+            continue;
+        }
+        requestIdToNode.set(node.request.requestId, { node, nodeTiming });
+    }
+    return requestIdToNode;
+}
+function estimateSavingsWithGraphs(deferredIds, lanternContext) {
+    const simulator = lanternContext.simulator;
+    const fcpGraph = lanternContext.metrics.firstContentfulPaint.optimisticGraph;
+    const { nodeTimings } = lanternContext.simulator.simulate(fcpGraph);
+    const adjustedNodeTimings = new Map(nodeTimings);
+    const totalChildNetworkBytes = 0;
+    const minimalFCPGraph = fcpGraph.cloneWithRelationships(node => {
+        // If a node can be deferred, exclude it from the new FCP graph
+        const canDeferRequest = deferredIds.has(node.id);
+        return !canDeferRequest;
+    });
+    if (minimalFCPGraph.type !== 'network') {
+        throw new Error('minimalFCPGraph not a NetworkNode');
+    }
+    // Recalculate the "before" time based on our adjusted node timings.
+    const estimateBeforeInline = Math.max(...Array.from(Array.from(adjustedNodeTimings).map(timing => timing[1].endTime)));
+    // Add the inlined bytes to the HTML response
+    const originalTransferSize = minimalFCPGraph.request.transferSize;
+    const safeTransferSize = originalTransferSize || 0;
+    minimalFCPGraph.request.transferSize = safeTransferSize + totalChildNetworkBytes;
+    const estimateAfterInline = simulator.simulate(minimalFCPGraph).timeInMs;
+    minimalFCPGraph.request.transferSize = originalTransferSize;
+    return Math.round(Math.max(estimateBeforeInline - estimateAfterInline, 0));
+}
+function computeSavings(renderBlockingRequests, lanternContext) {
+    const nodesAndTimingsByRequestId = getNodesAndTimingByRequestId(lanternContext.metrics.firstContentfulPaint.optimisticEstimate.nodeTimings);
+    const metricSavings = { FCP: 0, LCP: 0 };
+    const requestIdToWastedMs = new Map();
+    const deferredNodeIds = new Set();
+    for (const resource of renderBlockingRequests) {
+        const nodeAndTiming = nodesAndTimingsByRequestId.get(resource.args.data.requestId);
+        if (!nodeAndTiming) {
+            continue;
+        }
+        const { node, nodeTiming } = nodeAndTiming;
+        // Mark this node and all its dependents as deferrable
+        node.traverse(node => deferredNodeIds.add(node.id));
+        // "wastedMs" is the download time of the network request, responseReceived - requestSent
+        const wastedMs = Math.round(nodeTiming.duration);
+        if (wastedMs < MINIMUM_WASTED_MS) {
+            continue;
+        }
+        requestIdToWastedMs.set(node.id, wastedMs);
+    }
+    if (requestIdToWastedMs.size) {
+        metricSavings.FCP = estimateSavingsWithGraphs(deferredNodeIds, lanternContext);
+        // In most cases, render blocking resources only affect LCP if LCP isn't an image.
+        // TODO(crbug.com/313905799): https://chromium-review.googlesource.com/c/devtools/devtools-frontend/+/5684935/comment/c85b06da_90b0c274/
+        // const lcpIsImage = ???
+        // if (!lcpIsImage) {
+        //   metricSavings.LCP = metricSavings.FCP;
+        // }
+    }
+    return { metricSavings, requestIdToWastedMs };
+}
 export function generateInsight(traceParsedData, context) {
     const firstPaintTs = traceParsedData.PageLoadMetrics.metricScoresByFrameId.get(context.frameId)
         ?.get(context.navigationId)
@@ -49,8 +122,10 @@ export function generateInsight(traceParsedData, context) {
         }
         renderBlockingRequests.push(req);
     }
+    const savings = context.lantern && computeSavings(renderBlockingRequests, context.lantern);
     return {
         renderBlockingRequests,
+        ...savings,
     };
 }
 //# sourceMappingURL=RenderBlocking.js.map

package/models/trace/insights/RenderBlocking.js.map

@@ -1 +1 @@
-{"version":3,"file":"RenderBlocking.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/insights/RenderBlocking.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAG7B,OAAO,KAAK,QAAQ,MAAM,yBAAyB,CAAC;AACpD,OAAO,KAAK,OAAO,MAAM,uBAAuB,CAAC;AAGjD,OAAO,EAAqB,cAAc,EAAmD,MAAM,YAAY,CAAC;AAEhH,MAAM,UAAU,IAAI;IAClB,OAAO,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,eAA0C,EAAE,OAAiC;IAE3G,MAAM,YAAY,GAAG,eAAe,CAAC,eAAe,CAAC,qBAAqB,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC;QACtE,EAAE,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC;QAC3B,EAAE,GAAG,iEAAsD;QAC3D,EAAE,KAAK,EAAE,EAAE,CAAC;IACrC,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,OAAO;YACL,sBAAsB,EAAE,EAAE;YAC1B,QAAQ,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC;SACjC,CAAC;IACJ,CAAC;IAED,MAAM,sBAAsB,GAAG,EAAE,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,eAAe,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;QACzD,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC;YAC5C,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,UAAU,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,yBAAyB,EAAE,CAAC;YAC9G,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,GAAG,YAAY,EAAE,CAAC;YAC1D,SAAS;QACX,CAAC;QAED,4GAA4G;QAC5G,0GAA0G;QAC1G,mGAAmG;QACnG,EAAE;QACF,qGAAqG;QACrG,qDAAqD;QACrD,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,yBAAyB,EAAE,CAAC;YAC/D,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;YACxC,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,wDAAyC,CAAC;YACrF,MAAM,gBAAgB,GAAG,QAAQ,IAAI,QAAQ,wDAA2C,CAAC;YACzF,IAAI,QAAQ,gEAA+C,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACjF,SAAS;YACX,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GACZ,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,GAAG,EAAE,OAAO,CAAC,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAC9G,IAAI,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC;YACjE,SAAS;QACX,CAAC;QAED,sBAAsB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,OAAO;QACL,sBAAsB;KACvB,CAAC;AACJ,CAAC","sourcesContent":["// Copyright 2024 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nimport * as Protocol from '../../../generated/protocol.js';\nimport * as Handlers from '../handlers/handlers.js';\nimport * as Helpers from '../helpers/helpers.js';\nimport type * as Types from '../types/types.js';\n\nimport {type InsightResult, InsightWarning, type NavigationInsightContext, type RequiredData} from './types.js';\n\nexport function deps(): ['NetworkRequests', 'PageLoadMetrics'] {\n  return ['NetworkRequests', 'PageLoadMetrics'];\n}\n\nexport function generateInsight(traceParsedData: RequiredData<typeof deps>, context: NavigationInsightContext):\n    InsightResult<{renderBlockingRequests: Types.TraceEvents.SyntheticNetworkRequest[]}> {\n  const firstPaintTs = traceParsedData.PageLoadMetrics.metricScoresByFrameId.get(context.frameId)\n                           ?.get(context.navigationId)\n                           ?.get(Handlers.ModelHandlers.PageLoadMetrics.MetricName.FP)\n                           ?.event?.ts;\n  if (!firstPaintTs) {\n    return {\n      renderBlockingRequests: [],\n      warnings: [InsightWarning.NO_FP],\n    };\n  }\n\n  const renderBlockingRequests = [];\n  for (const req of traceParsedData.NetworkRequests.byTime) {\n    if (req.args.data.frame !== context.frameId) {\n      continue;\n    }\n\n    if (req.args.data.renderBlocking !== 'blocking' && req.args.data.renderBlocking !== 'in_body_parser_blocking') {\n      continue;\n    }\n\n    if (req.args.data.syntheticData.finishTime > firstPaintTs) {\n      continue;\n    }\n\n    // If a resource is marked `in_body_parser_blocking` it should only be considered render blocking if it is a\n    // high enough priority. Some resources (e.g. scripts) are not marked as high priority if they are fetched\n    // after a non-preloaded image. (See \"early\" definition in https://web.dev/articles/fetch-priority)\n    //\n    // There are edge cases and exceptions (e.g. priority hints) but this gives us the best approximation\n    // of render blocking resources in the document body.\n    if (req.args.data.renderBlocking === 'in_body_parser_blocking') {\n      const priority = req.args.data.priority;\n      const isScript = req.args.data.resourceType === Protocol.Network.ResourceType.Script;\n      const isBlockingScript = isScript && priority === Protocol.Network.ResourcePriority.High;\n      if (priority !== Protocol.Network.ResourcePriority.VeryHigh && !isBlockingScript) {\n        continue;\n      }\n    }\n\n    const navigation =\n        Helpers.Trace.getNavigationForTraceEvent(req, context.frameId, traceParsedData.Meta.navigationsByFrameId);\n    if (navigation?.args.data?.navigationId !== context.navigationId) {\n      continue;\n    }\n\n    renderBlockingRequests.push(req);\n  }\n\n  return {\n    renderBlockingRequests,\n  };\n}\n"]}
+{"version":3,"file":"RenderBlocking.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/insights/RenderBlocking.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAG7B,OAAO,KAAK,QAAQ,MAAM,yBAAyB,CAAC;AACpD,OAAO,KAAK,OAAO,MAAM,uBAAuB,CAAC;AAIjD,OAAO,EAEL,cAAc,GAIf,MAAM,YAAY,CAAC;AAOpB,2EAA2E;AAC3E,kGAAkG;AAClG,4FAA4F;AAC5F,qEAAqE;AACrE,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B,MAAM,UAAU,IAAI;IAClB,OAAO,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED;;GAEG;AACH,SAAS,4BAA4B,CAAC,WAAqD;IAEzF,MAAM,eAAe,GACjB,IAAI,GAAG,EAAuF,CAAC;IAEnG,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,WAAW,EAAE,CAAC;QAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS;QACX,CAAC;QAED,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAC,IAAI,EAAE,UAAU,EAAC,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,SAAS,yBAAyB,CAAC,WAAwB,EAAE,cAA8B;IACzF,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC;IAC3C,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,oBAAoB,CAAC,eAAe,CAAC;IAC7E,MAAM,EAAC,WAAW,EAAC,GAAG,cAAc,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAClE,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAEjD,MAAM,sBAAsB,GAAG,CAAC,CAAC;IACjC,MAAM,eAAe,GAAG,QAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE;QAC7D,+DAA+D;QAC/D,MAAM,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAI,eAAe,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,oEAAoE;IACpE,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAC/C,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAC/D,CAAC,CAAC;IAEP,6CAA6C;IAC7C,MAAM,oBAAoB,GAAG,eAAe,CAAC,OAAO,CAAC,YAAY,CAAC;IAClE,MAAM,gBAAgB,GAAG,oBAAoB,IAAI,CAAC,CAAC;IACnD,eAAe,CAAC,OAAO,CAAC,YAAY,GAAG,gBAAgB,GAAG,sBAAsB,CAAC;IACjF,MAAM,mBAAmB,GAAG,SAAS,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,QAAQ,CAAC;IACzE,eAAe,CAAC,OAAO,CAAC,YAAY,GAAG,oBAAoB,CAAC;IAC5D,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,oBAAoB,GAAG,mBAAmB,EAAE,CAAC,CAAC,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,cAAc,CACnB,sBAAmE,EACnE,cAA8B;IAChC,MAAM,0BAA0B,GAC5B,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,oBAAoB,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;IAE7G,MAAM,aAAa,GAAG,EAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAC,CAAC;IACvC,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,KAAK,MAAM,QAAQ,IAAI,sBAAsB,EAAE,CAAC;QAC9C,MAAM,aAAa,GAAG,0BAA0B,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnF,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,SAAS;QACX,CAAC;QAED,MAAM,EAAC,IAAI,EAAE,UAAU,EAAC,GAAG,aAAa,CAAC;QAEzC,sDAAsD;QACtD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpD,yFAAyF;QACzF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,QAAQ,GAAG,iBAAiB,EAAE,CAAC;YACjC,SAAS;QACX,CAAC;QAED,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,mBAAmB,CAAC,IAAI,EAAE,CAAC;QAC7B,aAAa,CAAC,GAAG,GAAG,yBAAyB,CAAC,eAAe,EAAE,cAAc,CAAC,CAAC;QAE/E,kFAAkF;QAClF,wIAAwI;QACxI,yBAAyB;QACzB,qBAAqB;QACrB,2CAA2C;QAC3C,IAAI;IACN,CAAC;IAED,OAAO,EAAC,aAAa,EAAE,mBAAmB,EAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,eAAe,CAC3B,eAA0C,EAAE,OAAiC;IAC/E,MAAM,YAAY,GAAG,eAAe,CAAC,eAAe,CAAC,qBAAqB,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC;QACtE,EAAE,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC;QAC3B,EAAE,GAAG,iEAAsD;QAC3D,EAAE,KAAK,EAAE,EAAE,CAAC;IACrC,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,OAAO;YACL,sBAAsB,EAAE,EAAE;YAC1B,QAAQ,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC;SACjC,CAAC;IACJ,CAAC;IAED,MAAM,sBAAsB,GAAG,EAAE,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,eAAe,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;QACzD,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC;YAC5C,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,UAAU,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,yBAAyB,EAAE,CAAC;YAC9G,SAAS;QACX,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,GAAG,YAAY,EAAE,CAAC;YAC1D,SAAS;QACX,CAAC;QAED,4GAA4G;QAC5G,0GAA0G;QAC1G,mGAAmG;QACnG,EAAE;QACF,qGAAqG;QACrG,qDAAqD;QACrD,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,KAAK,yBAAyB,EAAE,CAAC;YAC/D,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;YACxC,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,wDAAyC,CAAC;YACrF,MAAM,gBAAgB,GAAG,QAAQ,IAAI,QAAQ,wDAA2C,CAAC;YACzF,IAAI,QAAQ,gEAA+C,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACjF,SAAS;YACX,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GACZ,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,GAAG,EAAE,OAAO,CAAC,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAC9G,IAAI,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC;YACjE,SAAS;QACX,CAAC;QAED,sBAAsB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,cAAc,CAAC,sBAAsB,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IAE3F,OAAO;QACL,sBAAsB;QACtB,GAAG,OAAO;KACX,CAAC;AACJ,CAAC","sourcesContent":["// Copyright 2024 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nimport * as Protocol from '../../../generated/protocol.js';\nimport * as Handlers from '../handlers/handlers.js';\nimport * as Helpers from '../helpers/helpers.js';\nimport type * as Lantern from '../lantern/lantern.js';\nimport type * as Types from '../types/types.js';\n\nimport {\n  type InsightResult,\n  InsightWarning,\n  type LanternContext,\n  type NavigationInsightContext,\n  type RequiredData,\n} from './types.js';\n\nexport type RenderBlockingInsightResult = InsightResult<{\n  renderBlockingRequests: Types.TraceEvents.SyntheticNetworkRequest[],\n  requestIdToWastedMs?: Map<string, number>,\n}>;\n\n// Because of the way we detect blocking stylesheets, asynchronously loaded\n// CSS with link[rel=preload] and an onload handler (see https://github.com/filamentgroup/loadCSS)\n// can be falsely flagged as blocking. Therefore, ignore stylesheets that loaded fast enough\n// to possibly be non-blocking (and they have minimal impact anyway).\nconst MINIMUM_WASTED_MS = 50;\n\nexport function deps(): ['NetworkRequests', 'PageLoadMetrics'] {\n  return ['NetworkRequests', 'PageLoadMetrics'];\n}\n\n/**\n * Given a simulation's nodeTimings, return an object with the nodes/timing keyed by network URL\n */\nfunction getNodesAndTimingByRequestId(nodeTimings: Lantern.Simulation.Result['nodeTimings']):\n    Map<string, {node: Lantern.Graph.Node, nodeTiming: Lantern.Types.Simulation.NodeTiming}> {\n  const requestIdToNode =\n      new Map<string, {node: Lantern.Graph.Node, nodeTiming: Lantern.Types.Simulation.NodeTiming}>();\n\n  for (const [node, nodeTiming] of nodeTimings) {\n    if (node.type !== 'network') {\n      continue;\n    }\n\n    requestIdToNode.set(node.request.requestId, {node, nodeTiming});\n  }\n\n  return requestIdToNode;\n}\n\nfunction estimateSavingsWithGraphs(deferredIds: Set<string>, lanternContext: LanternContext): number {\n  const simulator = lanternContext.simulator;\n  const fcpGraph = lanternContext.metrics.firstContentfulPaint.optimisticGraph;\n  const {nodeTimings} = lanternContext.simulator.simulate(fcpGraph);\n  const adjustedNodeTimings = new Map(nodeTimings);\n\n  const totalChildNetworkBytes = 0;\n  const minimalFCPGraph = fcpGraph.cloneWithRelationships(node => {\n    // If a node can be deferred, exclude it from the new FCP graph\n    const canDeferRequest = deferredIds.has(node.id);\n    return !canDeferRequest;\n  });\n\n  if (minimalFCPGraph.type !== 'network') {\n    throw new Error('minimalFCPGraph not a NetworkNode');\n  }\n\n  // Recalculate the \"before\" time based on our adjusted node timings.\n  const estimateBeforeInline = Math.max(...Array.from(\n      Array.from(adjustedNodeTimings).map(timing => timing[1].endTime),\n      ));\n\n  // Add the inlined bytes to the HTML response\n  const originalTransferSize = minimalFCPGraph.request.transferSize;\n  const safeTransferSize = originalTransferSize || 0;\n  minimalFCPGraph.request.transferSize = safeTransferSize + totalChildNetworkBytes;\n  const estimateAfterInline = simulator.simulate(minimalFCPGraph).timeInMs;\n  minimalFCPGraph.request.transferSize = originalTransferSize;\n  return Math.round(Math.max(estimateBeforeInline - estimateAfterInline, 0));\n}\n\nfunction computeSavings(\n    renderBlockingRequests: Types.TraceEvents.SyntheticNetworkRequest[],\n    lanternContext: LanternContext): Pick<RenderBlockingInsightResult, 'metricSavings'|'requestIdToWastedMs'> {\n  const nodesAndTimingsByRequestId =\n      getNodesAndTimingByRequestId(lanternContext.metrics.firstContentfulPaint.optimisticEstimate.nodeTimings);\n\n  const metricSavings = {FCP: 0, LCP: 0};\n  const requestIdToWastedMs = new Map<string, number>();\n  const deferredNodeIds = new Set<string>();\n  for (const resource of renderBlockingRequests) {\n    const nodeAndTiming = nodesAndTimingsByRequestId.get(resource.args.data.requestId);\n    if (!nodeAndTiming) {\n      continue;\n    }\n\n    const {node, nodeTiming} = nodeAndTiming;\n\n    // Mark this node and all its dependents as deferrable\n    node.traverse(node => deferredNodeIds.add(node.id));\n\n    // \"wastedMs\" is the download time of the network request, responseReceived - requestSent\n    const wastedMs = Math.round(nodeTiming.duration);\n    if (wastedMs < MINIMUM_WASTED_MS) {\n      continue;\n    }\n\n    requestIdToWastedMs.set(node.id, wastedMs);\n  }\n\n  if (requestIdToWastedMs.size) {\n    metricSavings.FCP = estimateSavingsWithGraphs(deferredNodeIds, lanternContext);\n\n    // In most cases, render blocking resources only affect LCP if LCP isn't an image.\n    // TODO(crbug.com/313905799): https://chromium-review.googlesource.com/c/devtools/devtools-frontend/+/5684935/comment/c85b06da_90b0c274/\n    // const lcpIsImage = ???\n    // if (!lcpIsImage) {\n    //   metricSavings.LCP = metricSavings.FCP;\n    // }\n  }\n\n  return {metricSavings, requestIdToWastedMs};\n}\n\nexport function generateInsight(\n    traceParsedData: RequiredData<typeof deps>, context: NavigationInsightContext): RenderBlockingInsightResult {\n  const firstPaintTs = traceParsedData.PageLoadMetrics.metricScoresByFrameId.get(context.frameId)\n                           ?.get(context.navigationId)\n                           ?.get(Handlers.ModelHandlers.PageLoadMetrics.MetricName.FP)\n                           ?.event?.ts;\n  if (!firstPaintTs) {\n    return {\n      renderBlockingRequests: [],\n      warnings: [InsightWarning.NO_FP],\n    };\n  }\n\n  const renderBlockingRequests = [];\n  for (const req of traceParsedData.NetworkRequests.byTime) {\n    if (req.args.data.frame !== context.frameId) {\n      continue;\n    }\n\n    if (req.args.data.renderBlocking !== 'blocking' && req.args.data.renderBlocking !== 'in_body_parser_blocking') {\n      continue;\n    }\n\n    if (req.args.data.syntheticData.finishTime > firstPaintTs) {\n      continue;\n    }\n\n    // If a resource is marked `in_body_parser_blocking` it should only be considered render blocking if it is a\n    // high enough priority. Some resources (e.g. scripts) are not marked as high priority if they are fetched\n    // after a non-preloaded image. (See \"early\" definition in https://web.dev/articles/fetch-priority)\n    //\n    // There are edge cases and exceptions (e.g. priority hints) but this gives us the best approximation\n    // of render blocking resources in the document body.\n    if (req.args.data.renderBlocking === 'in_body_parser_blocking') {\n      const priority = req.args.data.priority;\n      const isScript = req.args.data.resourceType === Protocol.Network.ResourceType.Script;\n      const isBlockingScript = isScript && priority === Protocol.Network.ResourcePriority.High;\n      if (priority !== Protocol.Network.ResourcePriority.VeryHigh && !isBlockingScript) {\n        continue;\n      }\n    }\n\n    const navigation =\n        Helpers.Trace.getNavigationForTraceEvent(req, context.frameId, traceParsedData.Meta.navigationsByFrameId);\n    if (navigation?.args.data?.navigationId !== context.navigationId) {\n      continue;\n    }\n\n    renderBlockingRequests.push(req);\n  }\n\n  const savings = context.lantern && computeSavings(renderBlockingRequests, context.lantern);\n\n  return {\n    renderBlockingRequests,\n    ...savings,\n  };\n}\n"]}

package/models/trace/insights/insights-tsconfig.json

@@ -30,6 +30,7 @@
   },
   "files": [
     "../../../../../../../front_end/models/trace/insights/CumulativeLayoutShift.ts",
+    "../../../../../../../front_end/models/trace/insights/DocumentLatency.ts",
     "../../../../../../../front_end/models/trace/insights/InsightRunners.ts",
     "../../../../../../../front_end/models/trace/insights/InteractionToNextPaint.ts",
     "../../../../../../../front_end/models/trace/insights/LargestContentfulPaint.ts",
@@ -43,6 +44,9 @@
   "references": [
     {
       "path": "../handlers/bundle-tsconfig.json"
+    },
+    {
+      "path": "../lantern/bundle-tsconfig.json"
     }
   ]
 }

package/models/trace/insights/types.d.ts

@@ -1,4 +1,6 @@
 import type * as Handlers from '../handlers/handlers.js';
+import type * as Lantern from '../lantern/lantern.js';
+import type * as Types from '../types/types.js';
 import type * as InsightsRunners from './InsightRunners.js';
 /**
  * Context for which navigation an insight should look at.
@@ -6,8 +8,14 @@ import type * as InsightsRunners from './InsightRunners.js';
 export interface NavigationInsightContext {
     frameId: string;
     navigationId: string;
+    lantern?: LanternContext;
 }
-type InsightRunnersType = typeof InsightsRunners;
+export interface LanternContext {
+    graph: Lantern.Graph.Node<Types.TraceEvents.SyntheticNetworkRequest>;
+    simulator: Lantern.Simulation.Simulator<Types.TraceEvents.SyntheticNetworkRequest>;
+    metrics: Record<string, Lantern.Metrics.MetricResult>;
+}
+export type InsightRunnersType = typeof InsightsRunners;
 export declare enum InsightWarning {
     NO_FP = "NO_FP",
     NO_LCP = "NO_LCP",
@@ -16,33 +24,33 @@ export declare enum InsightWarning {
 }
 export type InsightResult<R extends Record<string, unknown>> = R & {
     warnings?: InsightWarning[];
+    metricSavings?: {
+        FCP?: number;
+        LCP?: number;
+        TBT?: number;
+        CLS?: number;
+        INP?: number;
+    };
 };
+export type LCPInsightResult = InsightResult<{
+    lcpMs?: Types.Timing.MilliSeconds;
+    lcpTs?: Types.Timing.MilliSeconds;
+    phases?: InsightsRunners.LargestContentfulPaint.LCPPhases;
+    shouldRemoveLazyLoading?: boolean;
+    shouldIncreasePriorityHint?: boolean;
+    shouldPreloadImage?: boolean;
+}>;
 /**
  * Contains insights for a specific navigation.
  */
-export type NavigationInsightData<H extends {
-    [key: string]: Handlers.Types.TraceEventHandler;
-}> = {
-    [I in keyof EnabledInsightRunners<H>]: ReturnType<EnabledInsightRunners<H>[I]> | Error;
+export type NavigationInsightData = {
+    [I in keyof InsightRunnersType]: ReturnType<InsightRunnersType[I]['generateInsight']> | Error;
 };
 /**
  * Contains insights for the entire trace. Insights are grouped by `navigationId`.
  */
-export type TraceInsightData<H extends {
-    [key: string]: Handlers.Types.TraceEventHandler;
-}> = Map<string, NavigationInsightData<H>>;
-/**
- * Maps each enabled insight name to its generate function. Insights that are disabled (i.e. missing one or more dependencies) will be unset.
- */
-export type EnabledInsightRunners<H extends {
-    [key: string]: Handlers.Types.TraceEventHandler;
-}> = {
-    [I in keyof InsightRunnersType]: [
-        Handlers.Types.EnabledHandlerDataWithMeta<H>
-    ] extends [Parameters<InsightRunnersType[I]['generateInsight']>[0]] ? (traceParsedData: Handlers.Types.EnabledHandlerDataWithMeta<H>, context: NavigationInsightContext) => ReturnType<InsightRunnersType[I]['generateInsight']> : never;
-};
+export type TraceInsightData = Map<string, NavigationInsightData>;
 /**
  * Represents the narrow set of dependencies defined by an insight's `deps()` function. `Meta` is always included regardless of `deps()`.
  */
 export type RequiredData<D extends () => Array<keyof typeof Handlers.ModelHandlers>> = Handlers.Types.EnabledHandlerDataWithMeta<Pick<typeof Handlers.ModelHandlers, ReturnType<D>[number]>>;
-export {};

package/models/trace/insights/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/insights/types.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAgB7B,MAAM,CAAN,IAAY,cAMX;AAND,WAAY,cAAc;IACxB,iCAAe,CAAA;IACf,mCAAiB,CAAA;IACjB,uEAAuE;IACvE,6DAA2C,CAAA;IAC3C,yCAAuB,CAAA;AACzB,CAAC,EANW,cAAc,KAAd,cAAc,QAMzB","sourcesContent":["// Copyright 2024 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nimport type * as Handlers from '../handlers/handlers.js';\n\nimport type * as InsightsRunners from './InsightRunners.js';\n\n/**\n * Context for which navigation an insight should look at.\n */\nexport interface NavigationInsightContext {\n  frameId: string;\n  navigationId: string;\n}\n\ntype InsightRunnersType = typeof InsightsRunners;\n\nexport enum InsightWarning {\n  NO_FP = 'NO_FP',\n  NO_LCP = 'NO_LCP',\n  // No network request could be identified as the primary HTML document.\n  NO_DOCUMENT_REQUEST = 'NO_DOCUMENT_REQUEST',\n  NO_LAYOUT = 'NO_LAYOUT',\n}\n\nexport type InsightResult<R extends Record<string, unknown>> = R&{\n  warnings?: InsightWarning[],\n};\n\n/**\n * Contains insights for a specific navigation.\n */\nexport type NavigationInsightData<H extends {[key: string]: Handlers.Types.TraceEventHandler}> = {\n  [I in keyof EnabledInsightRunners<H>]: ReturnType<EnabledInsightRunners<H>[I]>|Error;\n};\n\n/**\n * Contains insights for the entire trace. Insights are grouped by `navigationId`.\n */\nexport type TraceInsightData<H extends {[key: string]: Handlers.Types.TraceEventHandler}> =\n    Map<string, NavigationInsightData<H>>;\n\n/**\n * Maps each enabled insight name to its generate function. Insights that are disabled (i.e. missing one or more dependencies) will be unset.\n */\nexport type EnabledInsightRunners<H extends {[key: string]: Handlers.Types.TraceEventHandler}> = {\n  [I in keyof InsightRunnersType]:\n      [Handlers.Types.EnabledHandlerDataWithMeta<H>] extends [Parameters<InsightRunnersType[I]['generateInsight']>[0]] ?\n      (traceParsedData: Handlers.Types.EnabledHandlerDataWithMeta<H>, context: NavigationInsightContext) =>\n          ReturnType<InsightRunnersType[I]['generateInsight']>:\n      never;\n};\n\n/**\n * Represents the narrow set of dependencies defined by an insight's `deps()` function. `Meta` is always included regardless of `deps()`.\n */\nexport type RequiredData<D extends() => Array<keyof typeof Handlers.ModelHandlers>> =\n    Handlers.Types.EnabledHandlerDataWithMeta<Pick<typeof Handlers.ModelHandlers, ReturnType<D>[number]>>;\n"]}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/insights/types.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAyB7B,MAAM,CAAN,IAAY,cAMX;AAND,WAAY,cAAc;IACxB,iCAAe,CAAA;IACf,mCAAiB,CAAA;IACjB,uEAAuE;IACvE,6DAA2C,CAAA;IAC3C,yCAAuB,CAAA;AACzB,CAAC,EANW,cAAc,KAAd,cAAc,QAMzB","sourcesContent":["// Copyright 2024 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nimport type * as Handlers from '../handlers/handlers.js';\nimport type * as Lantern from '../lantern/lantern.js';\nimport type * as Types from '../types/types.js';\n\nimport type * as InsightsRunners from './InsightRunners.js';\n\n/**\n * Context for which navigation an insight should look at.\n */\nexport interface NavigationInsightContext {\n  frameId: string;\n  navigationId: string;\n  lantern?: LanternContext;\n}\n\nexport interface LanternContext {\n  graph: Lantern.Graph.Node<Types.TraceEvents.SyntheticNetworkRequest>;\n  simulator: Lantern.Simulation.Simulator<Types.TraceEvents.SyntheticNetworkRequest>;\n  metrics: Record<string, Lantern.Metrics.MetricResult>;\n}\n\nexport type InsightRunnersType = typeof InsightsRunners;\n\nexport enum InsightWarning {\n  NO_FP = 'NO_FP',\n  NO_LCP = 'NO_LCP',\n  // No network request could be identified as the primary HTML document.\n  NO_DOCUMENT_REQUEST = 'NO_DOCUMENT_REQUEST',\n  NO_LAYOUT = 'NO_LAYOUT',\n}\n\nexport type InsightResult<R extends Record<string, unknown>> = R&{\n  warnings?: InsightWarning[],\n  metricSavings?: {\n    /* eslint-disable @typescript-eslint/naming-convention */\n    FCP?: number,\n    LCP?: number,\n    TBT?: number,\n    CLS?: number,\n    INP?: number,\n    /* eslint-enable @typescript-eslint/naming-convention */\n  },\n};\n\nexport type LCPInsightResult = InsightResult<{\n  lcpMs?: Types.Timing.MilliSeconds,\n  lcpTs?: Types.Timing.MilliSeconds,\n  phases?: InsightsRunners.LargestContentfulPaint.LCPPhases,\n  shouldRemoveLazyLoading?: boolean,\n  shouldIncreasePriorityHint?: boolean,\n  shouldPreloadImage?: boolean,\n}>;\n\n/**\n * Contains insights for a specific navigation.\n */\nexport type NavigationInsightData = {\n  [I in keyof InsightRunnersType]: ReturnType<InsightRunnersType[I]['generateInsight']>|Error;\n};\n\n/**\n * Contains insights for the entire trace. Insights are grouped by `navigationId`.\n */\nexport type TraceInsightData = Map<string, NavigationInsightData>;\n\n/**\n * Represents the narrow set of dependencies defined by an insight's `deps()` function. `Meta` is always included regardless of `deps()`.\n */\nexport type RequiredData<D extends() => Array<keyof typeof Handlers.ModelHandlers>> =\n    Handlers.Types.EnabledHandlerDataWithMeta<Pick<typeof Handlers.ModelHandlers, ReturnType<D>[number]>>;\n"]}

package/models/trace/lantern/core/NetworkAnalyzer.js

@@ -1,6 +1,7 @@
 // Copyright 2024 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+import { LanternError } from './LanternError.js';
 class UrlUtils {
     /**
      * There is fancy URL rewriting logic for the chrome://settings page that we need to work around.
@@ -356,7 +357,7 @@ class NetworkAnalyzer {
             }
         }
         if (!estimatesByOrigin.size) {
-            throw new Error('No timing information available');
+            throw new LanternError('No timing information available');
         }
         return NetworkAnalyzer.summarize(estimatesByOrigin);
     }

package/models/trace/lantern/core/NetworkAnalyzer.js.map

@@ -1 +1 @@
-{"version":3,"file":"NetworkAnalyzer.js","sourceRoot":"","sources":["../../../../../../../../front_end/models/trace/lantern/core/NetworkAnalyzer.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAI7B,MAAM,QAAQ;IACZ;;;;OAIG;IACH,MAAM,CAAC,wBAAwB,CAAC,GAAW;QACzC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,OAAO,GAAG,CAAC;QACb,CAAC;QACD,2EAA2E;QAC3E,+EAA+E;QAC/E,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC,OAAO,CAAC,sBAAsB,EAAE,WAAW,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,0BAA0B,CAAC,IAAY,EAAE,IAAY;QAC1D,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;QAC/D,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YAEf,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YAEf,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;QACjC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAmCD,MAAM,WAAW,GAAG,EAAE,GAAG,IAAI,CAAC;AAE9B,gFAAgF;AAChF,MAAM,kCAAkC,GAAG,GAAG,CAAC;AAE/C;;;GAGG;AACH,MAAM,kCAAkC,GAAkD;IACxF,QAAQ,EAAE,GAAG;IACb,GAAG,EAAE,GAAG;IACR,KAAK,EAAE,GAAG;CACX,CAAC;AAEF,MAAM,eAAe;IACnB,MAAM,KAAK,OAAO;QAChB,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,aAAa,CAAC,OAAiC;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACrB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC;YAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,MAAgB;QAChC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE7B,IAAI,MAAM,CAAC;QACX,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,OAAO;YACL,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;YACd,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9B,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM;YACtD,MAAM;SACP,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,MAA6B;QAC5C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,MAAM,EAAE,CAAC;YACtC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,eAAe,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;YAC7D,YAAY,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAClC,CAAC;QAED,YAAY,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,eAAe,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;QACpF,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,CAAC,sBAAsB,CACzB,QAAkC,EAClC,QAA2D;QAC7D,MAAM,mBAAmB,GAAG,eAAe,CAAC,6BAA6B,CAAC,QAAQ,CAAC,CAAC;QACpF,MAAM,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAEhE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,IAAI,eAAe,GAAa,EAAE,CAAC;YAEnC,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;gBAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,SAAS;gBACX,CAAC;gBAED,MAAM,KAAK,GAAG,QAAQ,CAAC;oBACrB,OAAO;oBACP,MAAM;oBACN,gBAAgB,EAAE,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;iBAC7D,CAAC,CAAC;gBACH,IAAI,OAAO,KAAK,KAAK,WAAW,EAAE,CAAC;oBACjC,eAAe,GAAG,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAED,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,+BAA+B,CAAC,IAAiB;QACtD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,MAAM,EAAC,YAAY,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAC,GAAG,MAAM,CAAC;QAC5D,IAAI,UAAU,IAAI,CAAC,IAAI,YAAY,IAAI,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9E,wDAAwD;YACxD,OAAO,UAAU,GAAG,YAAY,CAAC;QACnC,CAAC;QACD,IAAI,QAAQ,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC9D,kEAAkE;YAClE,OAAO,CAAC,UAAU,GAAG,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,YAAY,IAAI,CAAC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACzC,OAAO,UAAU,GAAG,YAAY,CAAC;QACnC,CAAC;QAED,OAAO;IACT,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,6BAA6B,CAAC,IAAiB;QACpD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,sEAAsE;QACtE,IAAI,OAAO,CAAC,YAAY,IAAI,WAAW,EAAE,CAAC;YACxC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC/E,OAAO;QACT,CAAC;QAED,2FAA2F;QAC3F,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC,kBAAkB,CAAC;QACtE,MAAM,0BAA0B,GAAG,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACxE,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC;QAEzE,4FAA4F;QAC5F,6BAA6B;QAC7B,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,OAAO,0BAA0B,GAAG,kBAAkB,CAAC;IACzD,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,8BAA8B,CAAC,IAAiB;QACrD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YAC/D,OAAO;QACT,CAAC;QAED,2EAA2E;QAC3E,mDAAmD;QACnD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM;QACN,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,UAAU,IAAI,CAAC,CAAC;QAClB,CAAC;QACD,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;YACzC,UAAU,IAAI,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,+BAA+B,CAAC,IAAiB;QACtD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC/E,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,MAAM,4BAA4B,GAC9B,kCAAkC,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,kCAAkC,CAAC;QACnG,MAAM,2BAA2B,GAAG,MAAM,CAAC,iBAAiB,GAAG,4BAA4B,CAAC;QAE5F,gCAAgC;QAChC,iDAAiD;QACjD,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,+BAA+B;QAC/B,gFAAgF;QAChF,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,UAAU,IAAI,CAAC,CAAC,CAAE,MAAM;YACxB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,UAAU,IAAI,CAAC,CAAC,CAAE,MAAM;YAC1B,CAAC;YACD,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;gBACzC,UAAU,IAAI,CAAC,CAAC,CAAE,MAAM;YAC1B,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,iBAAiB,GAAG,2BAA2B,CAAC,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,6BAA6B,CAAC,OAAiC,EAAE,WAAgC;QAEtG,OAAO,eAAe,CAAC,sBAAsB,CAAC,OAAO,EAAE,CAAC,EAAC,OAAO,EAAE,MAAM,EAAC,EAAE,EAAE;YAC3E,IAAI,OAAO,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;gBAC7C,OAAO,OAAO,CAAC,kBAAkB,CAAC;YACpC,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;gBAC/E,OAAO;YACT,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;gBAC3D,OAAO;YACT,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,CAAC,iBAAiB,GAAG,MAAM,CAAC,OAAO,CAAC;YACvD,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,cAAc,CAAC;YAChD,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACrF,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,6BAA6B,CAAC,QAAkC;QACrE,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAE,CAAC;QACzC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC;YAC9F,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAC5D,CAAC;QAED,0FAA0F;QAC1F,IAAI,sBAAsB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,wGAAwG;QACxG,OAAO,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;IAC/E,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,6BAA6B,CAAC,OAAiC,EAAE,OAAyC;QAE/G,MAAM,EAAC,oBAAoB,GAAG,KAAK,EAAC,GAAG,OAAO,IAAI,EAAE,CAAC;QAErD,4EAA4E;QAC5E,IAAI,CAAC,oBAAoB,IAAI,eAAe,CAAC,6BAA6B,CAAC,OAAO,CAAC,EAAE,CAAC;YACpF,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACjG,CAAC;QAED,qFAAqF;QACrF,iDAAiD;QACjD,gBAAgB;QAChB,yDAAyD;QACzD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAE,CAAC;QACtC,MAAM,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC/D,KAAK,MAAM,aAAa,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACrD,MAAM,qBAAqB,GACvB,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAEpG,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;gBACpC,mBAAmB,CAAC,GAAG,CACnB,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,kBAAkB,IAAI,qBAAqB,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,CACnF,CAAC;YACJ,CAAC;YAED,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChD,OAAO,CAAC,CAAC,kBAAkB,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC,CAAC,CAAC;YACH,mBAAmB,CAAC,GAAG,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;QAED,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,mBAAmB,CAAC,OAAiC,EAAE,OAA4B;QACxF,MAAM,EACJ,oBAAoB,GAAG,KAAK;QAC5B,wDAAwD;QACxD,0DAA0D;QAC1D,wBAAwB,GAAG,GAAG,EAC9B,oBAAoB,GAAG,IAAI,EAC3B,qBAAqB,GAAG,IAAI,EAC5B,sBAAsB,GAAG,IAAI,GAC9B,GAAG,OAAO,IAAI,EAAE,CAAC;QAElB,MAAM,mBAAmB,GAAG,eAAe,CAAC,6BAA6B,CAAC,OAAO,CAAC,CAAC;QACnF,MAAM,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAE/D,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,MAAM,eAAe,GAAa,EAAE,CAAC;YAErC,iDAAiD;YACjD,SAAS,gBAAgB,CAAC,SAA4D,EAAE,UAAU,GAAG,CAAC;gBACpG,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;oBACrC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;oBAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;wBACZ,SAAS;oBACX,CAAC;oBAED,MAAM,SAAS,GAAG,SAAS,CAAC;wBAC1B,OAAO;wBACP,MAAM;wBACN,gBAAgB,EAAE,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;qBAC7D,CAAC,CAAC;oBACH,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;wBAC5B,SAAS;oBACX,CAAC;oBAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9B,eAAe,CAAC,IAAI,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACN,eAAe,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,gBAAgB,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;YACzD,CAAC;YAED,sDAAsD;YACtD,sEAAsE;YACtE,0GAA0G;YAC1G,2GAA2G;YAC3G,iCAAiC;YACjC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;gBAC5B,IAAI,oBAAoB,EAAE,CAAC;oBACzB,gBAAgB,CAAC,IAAI,CAAC,6BAA6B,EAAE,wBAAwB,CAAC,CAAC;gBACjF,CAAC;gBACD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,gBAAgB,CAAC,IAAI,CAAC,8BAA8B,EAAE,wBAAwB,CAAC,CAAC;gBAClF,CAAC;gBACD,IAAI,sBAAsB,EAAE,CAAC;oBAC3B,gBAAgB,CAAC,IAAI,CAAC,+BAA+B,EAAE,wBAAwB,CAAC,CAAC;gBACnF,CAAC;YACH,CAAC;YAED,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;gBAC3B,iBAAiB,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,eAAe,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,kCAAkC,CAAC,OAAiC,EAAE,OAE5E;QACC,IAAI,WAAW,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,WAAW,CAAC;QAC9C,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;YAExB,MAAM,kBAAkB,GAAG,eAAe,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjF,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC7D,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,eAAe,CAAC,6BAA6B,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QAC9F,OAAO,eAAe,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,kBAAkB,CAAC,OAAiC;QACzD,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,2FAA2F;QAC3F,8FAA8F;QAC9F,oDAAoD;QACpD,MAAM,cAAc,GAAG,OAAO;aACF,MAAM,CACH,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE;YACtB,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC;YACzC,2FAA2F;YAC3F,6CAA6C;YAC7C,IAAI,MAAM,KAAK,MAAM,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ;gBACxD,OAAO,CAAC,UAAU,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;gBACtD,OAAO,UAAU,CAAC;YACpB,CAAC;YAED,4FAA4F;YAC5F,UAAU,IAAI,OAAO,CAAC,YAAY,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,OAAO,CAAC,sBAAsB,GAAG,IAAI,EAAE,OAAO,EAAE,IAAI,EAAC,CAAC,CAAC;YAC9E,UAAU,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,OAAO,CAAC,cAAc,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC;YACvE,OAAO,UAAU,CAAC;QACpB,CAAC,EACD,EAA6C,CAAC;aACjD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE5D,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YAChC,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACrB,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACnB,+EAA+E;oBAC/E,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;gBAC/B,CAAC;gBACD,QAAQ,EAAE,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,QAAQ,EAAE,CAAC;gBACX,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACnB,yFAAyF;oBACzF,aAAa,IAAI,QAAQ,CAAC,IAAI,GAAG,YAAY,CAAC;gBAChD,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,UAAU,GAAG,CAAC,GAAG,aAAa,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,+BAA+B,CAAC,OAAiC;QAEtE,0EAA0E;QAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,eAAe,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;YACvF,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;QAED,kGAAkG;QAClG,gGAAgG;QAChG,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjE,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,eAAe,CAAC,kCAAkC,CAAC,OAAO,EAAE;YACxF,WAAW;SACZ,CAAC,CAAC;QAEH,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxD,MAAM,0BAA0B,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7D,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,yFAAyF;YACzF,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC;YAC3D,qBAAqB,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,GAAG,UAAU,CAAC,CAAC;YAC7D,0BAA0B,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;QAED,OAAO;YACL,GAAG,EAAE,UAAU;YACf,qBAAqB;YACrB,0BAA0B;SAC3B,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,OAAiC;QAC9C,MAAM,UAAU,GAAG,eAAe,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC/D,OAAO;YACL,UAAU;YACV,GAAG,eAAe,CAAC,+BAA+B,CAAC,OAAO,CAAC;SAC5D,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,kBAAkB,CAAmC,OAAiB,EAAE,WAAmB;QAChG,2GAA2G;QAC3G,OAAO,OAAO,CAAC,IAAI,CACf,OAAO,CAAC,EAAE,CAAC,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,0BAA0B,CAAC,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC,CAClH,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,sBAAsB,CAAmC,OAAiB,EAAE,WAAmB;QACpG,2GAA2G;QAC3G,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CACnC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,KAAK,UAAU;YAC1C,gGAAgG;YAChG,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,0BAA0B,CAAC,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC,CAC3G,CAAC;QACF,OAAO,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,gBAAgB,CAAmC,OAAU;QAClE,OAAO,OAAO,CAAC,mBAAmB,EAAE,CAAC;YACnC,OAAO,GAAG,OAAO,CAAC,mBAAwB,CAAC;QAC7C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAED,OAAO,EAAC,eAAe,EAAC,CAAC","sourcesContent":["// Copyright 2024 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nimport type * as Lantern from '../types/types.js';\n\nclass UrlUtils {\n  /**\n   * There is fancy URL rewriting logic for the chrome://settings page that we need to work around.\n   * Why? Special handling was added by Chrome team to allow a pushState transition between chrome:// pages.\n   * As a result, the network URL (chrome://chrome/settings/) doesn't match the final document URL (chrome://settings/).\n   */\n  static rewriteChromeInternalUrl(url: string): string {\n    if (!url || !url.startsWith('chrome://')) {\n      return url;\n    }\n    // Chrome adds a trailing slash to `chrome://` URLs, but the spec does not.\n    //   https://github.com/GoogleChrome/lighthouse/pull/3941#discussion_r154026009\n    if (url.endsWith('/')) {\n      url = url.replace(/\\/$/, '');\n    }\n    return url.replace(/^chrome:\\/\\/chrome\\//, 'chrome://');\n  }\n\n  /**\n   * Determine if url1 equals url2, ignoring URL fragments.\n   */\n  static equalWithExcludedFragments(url1: string, url2: string): boolean {\n    [url1, url2] = [url1, url2].map(this.rewriteChromeInternalUrl);\n    try {\n      const urla = new URL(url1);\n      urla.hash = '';\n\n      const urlb = new URL(url2);\n      urlb.hash = '';\n\n      return urla.href === urlb.href;\n    } catch (e) {\n      return false;\n    }\n  }\n}\n\ninterface Summary {\n  min: number;\n  max: number;\n  avg: number;\n  median: number;\n}\n\ninterface RTTEstimateOptions {\n  /**\n   * TCP connection handshake information will be used when available, but in\n   * some circumstances this data can be unreliable. This flag exposes an\n   * option to ignore the handshake data and use the coarse download/TTFB timing data.\n   */\n  forceCoarseEstimates?: boolean;\n  /**\n   * Coarse estimates include lots of extra time and noise multiply by some factor\n   * to deflate the estimates a bit.\n   */\n  coarseEstimateMultiplier?: number;\n  /** Useful for testing to isolate the different methods of estimation. */\n  useDownloadEstimates?: boolean;\n  /** Useful for testing to isolate the different methods of estimation. */\n  useSendStartEstimates?: boolean;\n  /** Useful for testing to isolate the different methods of estimation. */\n  useHeadersEndEstimates?: boolean;\n}\n\ntype RequestInfo = {\n  request: Lantern.NetworkRequest,\n  timing: Lantern.ResourceTiming,\n  connectionReused?: boolean,\n};\n\nconst INITIAL_CWD = 14 * 1024;\n\n// Assume that 40% of TTFB was server response time by default for static assets\nconst DEFAULT_SERVER_RESPONSE_PERCENTAGE = 0.4;\n\n/**\n * For certain resource types, server response time takes up a greater percentage of TTFB (dynamic\n * assets like HTML documents, XHR/API calls, etc)\n */\nconst SERVER_RESPONSE_PERCENTAGE_OF_TTFB: Partial<Record<Lantern.ResourceType, number>> = {\n  Document: 0.9,\n  XHR: 0.9,\n  Fetch: 0.9,\n};\n\nclass NetworkAnalyzer {\n  static get summary(): string {\n    return '__SUMMARY__';\n  }\n\n  static groupByOrigin(records: Lantern.NetworkRequest[]): Map<string, Lantern.NetworkRequest[]> {\n    const grouped = new Map();\n    records.forEach(item => {\n      const key = item.parsedURL.securityOrigin;\n      const group = grouped.get(key) || [];\n      group.push(item);\n      grouped.set(key, group);\n    });\n    return grouped;\n  }\n\n  static getSummary(values: number[]): Summary {\n    values.sort((a, b) => a - b);\n\n    let median;\n    if (values.length === 0) {\n      median = values[0];\n    } else if (values.length % 2 === 0) {\n      const a = values[Math.floor((values.length - 1) / 2)];\n      const b = values[Math.floor((values.length - 1) / 2) + 1];\n      median = (a + b) / 2;\n    } else {\n      median = values[Math.floor((values.length - 1) / 2)];\n    }\n\n    return {\n      min: values[0],\n      max: values[values.length - 1],\n      avg: values.reduce((a, b) => a + b, 0) / values.length,\n      median,\n    };\n  }\n\n  static summarize(values: Map<string, number[]>): Map<string, Summary> {\n    const summaryByKey = new Map();\n    const allEstimates = [];\n    for (const [key, estimates] of values) {\n      summaryByKey.set(key, NetworkAnalyzer.getSummary(estimates));\n      allEstimates.push(...estimates);\n    }\n\n    summaryByKey.set(NetworkAnalyzer.summary, NetworkAnalyzer.getSummary(allEstimates));\n    return summaryByKey;\n  }\n\n  static _estimateValueByOrigin(\n      requests: Lantern.NetworkRequest[],\n      iteratee: (e: RequestInfo) => number | number[] | undefined): Map<string, number[]> {\n    const connectionWasReused = NetworkAnalyzer.estimateIfConnectionWasReused(requests);\n    const groupedByOrigin = NetworkAnalyzer.groupByOrigin(requests);\n\n    const estimates = new Map();\n    for (const [origin, originRequests] of groupedByOrigin.entries()) {\n      let originEstimates: number[] = [];\n\n      for (const request of originRequests) {\n        const timing = request.timing;\n        if (!timing) {\n          continue;\n        }\n\n        const value = iteratee({\n          request,\n          timing,\n          connectionReused: connectionWasReused.get(request.requestId),\n        });\n        if (typeof value !== 'undefined') {\n          originEstimates = originEstimates.concat(value);\n        }\n      }\n\n      if (!originEstimates.length) {\n        continue;\n      }\n      estimates.set(origin, originEstimates);\n    }\n\n    return estimates;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long the connection setup.\n   * For h1 and h2, this could includes two estimates - one for the TCP handshake, another for\n   * SSL negotiation.\n   * For h3, we get only one estimate since QUIC establishes a secure connection in a\n   * single handshake.\n   * This is the most accurate and preferred method of measurement when the data is available.\n   */\n  static _estimateRTTViaConnectionTiming(info: RequestInfo): number[]|number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (connectionReused) {\n      return;\n    }\n\n    const {connectStart, sslStart, sslEnd, connectEnd} = timing;\n    if (connectEnd >= 0 && connectStart >= 0 && request.protocol.startsWith('h3')) {\n      // These values are equal to sslStart and sslEnd for h3.\n      return connectEnd - connectStart;\n    }\n    if (sslStart >= 0 && sslEnd >= 0 && sslStart !== connectStart) {\n      // SSL can also be more than 1 RT but assume False Start was used.\n      return [connectEnd - sslStart, sslStart - connectStart];\n    }\n    if (connectStart >= 0 && connectEnd >= 0) {\n      return connectEnd - connectStart;\n    }\n\n    return;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long a download took on a fresh connection.\n   * NOTE: this will tend to overestimate the actual RTT quite significantly as the download can be\n   * slow for other reasons as well such as bandwidth constraints.\n   */\n  static _estimateRTTViaDownloadTiming(info: RequestInfo): number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (connectionReused) {\n      return;\n    }\n\n    // Only look at downloads that went past the initial congestion window\n    if (request.transferSize <= INITIAL_CWD) {\n      return;\n    }\n    if (!Number.isFinite(timing.receiveHeadersEnd) || timing.receiveHeadersEnd < 0) {\n      return;\n    }\n\n    // Compute the amount of time downloading everything after the first congestion window took\n    const totalTime = request.networkEndTime - request.networkRequestTime;\n    const downloadTimeAfterFirstByte = totalTime - timing.receiveHeadersEnd;\n    const numberOfRoundTrips = Math.log2(request.transferSize / INITIAL_CWD);\n\n    // Ignore requests that required a high number of round trips since bandwidth starts to play\n    // a larger role than latency\n    if (numberOfRoundTrips > 5) {\n      return;\n    }\n\n    return downloadTimeAfterFirstByte / numberOfRoundTrips;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long it took until Chrome could\n   * start sending the actual request when a new connection was required.\n   * NOTE: this will tend to overestimate the actual RTT as the request can be delayed for other\n   * reasons as well such as more SSL handshakes if TLS False Start is not enabled.\n   */\n  static _estimateRTTViaSendStartTiming(info: RequestInfo): number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (connectionReused) {\n      return;\n    }\n\n    if (!Number.isFinite(timing.sendStart) || timing.sendStart < 0) {\n      return;\n    }\n\n    // Assume everything before sendStart was just DNS + (SSL)? + TCP handshake\n    // 1 RT for DNS, 1 RT (maybe) for SSL, 1 RT for TCP\n    let roundTrips = 1;\n    // TCP\n    if (!request.protocol.startsWith('h3')) {\n      roundTrips += 1;\n    }\n    if (request.parsedURL.scheme === 'https') {\n      roundTrips += 1;\n    }\n    return timing.sendStart / roundTrips;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long it took until Chrome received the\n   * headers of the response (~TTFB).\n   * NOTE: this is the most inaccurate way to estimate the RTT, but in some environments it's all\n   * we have access to :(\n   */\n  static _estimateRTTViaHeadersEndTiming(info: RequestInfo): number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (!Number.isFinite(timing.receiveHeadersEnd) || timing.receiveHeadersEnd < 0) {\n      return;\n    }\n    if (!request.resourceType) {\n      return;\n    }\n\n    const serverResponseTimePercentage =\n        SERVER_RESPONSE_PERCENTAGE_OF_TTFB[request.resourceType] || DEFAULT_SERVER_RESPONSE_PERCENTAGE;\n    const estimatedServerResponseTime = timing.receiveHeadersEnd * serverResponseTimePercentage;\n\n    // When connection was reused...\n    // TTFB = 1 RT for request + server response time\n    let roundTrips = 1;\n\n    // When connection was fresh...\n    // TTFB = DNS + (SSL)? + TCP handshake + 1 RT for request + server response time\n    if (!connectionReused) {\n      roundTrips += 1;  // DNS\n      if (!request.protocol.startsWith('h3')) {\n        roundTrips += 1;  // TCP\n      }\n      if (request.parsedURL.scheme === 'https') {\n        roundTrips += 1;  // SSL\n      }\n    }\n\n    // subtract out our estimated server response time\n    return Math.max((timing.receiveHeadersEnd - estimatedServerResponseTime) / roundTrips, 3);\n  }\n\n  /**\n   * Given the RTT to each origin, estimates the observed server response times.\n   */\n  static _estimateResponseTimeByOrigin(records: Lantern.NetworkRequest[], rttByOrigin: Map<string, number>):\n      Map<string, number[]> {\n    return NetworkAnalyzer._estimateValueByOrigin(records, ({request, timing}) => {\n      if (request.serverResponseTime !== undefined) {\n        return request.serverResponseTime;\n      }\n\n      if (!Number.isFinite(timing.receiveHeadersEnd) || timing.receiveHeadersEnd < 0) {\n        return;\n      }\n      if (!Number.isFinite(timing.sendEnd) || timing.sendEnd < 0) {\n        return;\n      }\n\n      const ttfb = timing.receiveHeadersEnd - timing.sendEnd;\n      const origin = request.parsedURL.securityOrigin;\n      const rtt = rttByOrigin.get(origin) || rttByOrigin.get(NetworkAnalyzer.summary) || 0;\n      return Math.max(ttfb - rtt, 0);\n    });\n  }\n\n  static canTrustConnectionInformation(requests: Lantern.NetworkRequest[]): boolean {\n    const connectionIdWasStarted = new Map();\n    for (const request of requests) {\n      const started = connectionIdWasStarted.get(request.connectionId) || !request.connectionReused;\n      connectionIdWasStarted.set(request.connectionId, started);\n    }\n\n    // We probably can't trust the network information if all the connection IDs were the same\n    if (connectionIdWasStarted.size <= 1) {\n      return false;\n    }\n    // Or if there were connections that were always reused (a connection had to have started at some point)\n    return Array.from(connectionIdWasStarted.values()).every(started => started);\n  }\n\n  /**\n   * Returns a map of requestId -> connectionReused, estimating the information if the information\n   * available in the records themselves appears untrustworthy.\n   */\n  static estimateIfConnectionWasReused(records: Lantern.NetworkRequest[], options?: {forceCoarseEstimates: boolean}):\n      Map<string, boolean> {\n    const {forceCoarseEstimates = false} = options || {};\n\n    // Check if we can trust the connection information coming from the protocol\n    if (!forceCoarseEstimates && NetworkAnalyzer.canTrustConnectionInformation(records)) {\n      return new Map(records.map(request => [request.requestId, Boolean(request.connectionReused)]));\n    }\n\n    // Otherwise we're on our own, a request may not have needed a fresh connection if...\n    //   - It was not the first request to the domain\n    //   - It was H2\n    //   - It was after the first request to the domain ended\n    const connectionWasReused = new Map();\n    const groupedByOrigin = NetworkAnalyzer.groupByOrigin(records);\n    for (const originRecords of groupedByOrigin.values()) {\n      const earliestReusePossible =\n          originRecords.map(request => request.networkEndTime).reduce((a, b) => Math.min(a, b), Infinity);\n\n      for (const request of originRecords) {\n        connectionWasReused.set(\n            request.requestId,\n            request.networkRequestTime >= earliestReusePossible || request.protocol === 'h2',\n        );\n      }\n\n      const firstRecord = originRecords.reduce((a, b) => {\n        return a.networkRequestTime > b.networkRequestTime ? b : a;\n      });\n      connectionWasReused.set(firstRecord.requestId, false);\n    }\n\n    return connectionWasReused;\n  }\n\n  /**\n   * Estimates the RTT to each origin by examining observed network timing information.\n   * Attempts to use the most accurate information first and falls back to coarser estimates when it\n   * is unavailable.\n   */\n  static estimateRTTByOrigin(records: Lantern.NetworkRequest[], options?: RTTEstimateOptions): Map<string, Summary> {\n    const {\n      forceCoarseEstimates = false,\n      // coarse estimates include lots of extra time and noise\n      // multiply by some factor to deflate the estimates a bit.\n      coarseEstimateMultiplier = 0.3,\n      useDownloadEstimates = true,\n      useSendStartEstimates = true,\n      useHeadersEndEstimates = true,\n    } = options || {};\n\n    const connectionWasReused = NetworkAnalyzer.estimateIfConnectionWasReused(records);\n    const groupedByOrigin = NetworkAnalyzer.groupByOrigin(records);\n\n    const estimatesByOrigin = new Map();\n    for (const [origin, originRequests] of groupedByOrigin.entries()) {\n      const originEstimates: number[] = [];\n\n      // eslint-disable-next-line no-inner-declarations\n      function collectEstimates(estimator: (e: RequestInfo) => number[] | number | undefined, multiplier = 1): void {\n        for (const request of originRequests) {\n          const timing = request.timing;\n          if (!timing) {\n            continue;\n          }\n\n          const estimates = estimator({\n            request,\n            timing,\n            connectionReused: connectionWasReused.get(request.requestId),\n          });\n          if (estimates === undefined) {\n            continue;\n          }\n\n          if (!Array.isArray(estimates)) {\n            originEstimates.push(estimates * multiplier);\n          } else {\n            originEstimates.push(...estimates.map(e => e * multiplier));\n          }\n        }\n      }\n\n      if (!forceCoarseEstimates) {\n        collectEstimates(this._estimateRTTViaConnectionTiming);\n      }\n\n      // Connection timing can be missing for a few reasons:\n      // - Origin was preconnected, which we don't have instrumentation for.\n      // - Trace began recording after a connection has already been established (for example, in timespan mode)\n      // - Perhaps Chrome established a connection already in the background (service worker? Just guessing here)\n      // - Not provided in LR netstack.\n      if (!originEstimates.length) {\n        if (useDownloadEstimates) {\n          collectEstimates(this._estimateRTTViaDownloadTiming, coarseEstimateMultiplier);\n        }\n        if (useSendStartEstimates) {\n          collectEstimates(this._estimateRTTViaSendStartTiming, coarseEstimateMultiplier);\n        }\n        if (useHeadersEndEstimates) {\n          collectEstimates(this._estimateRTTViaHeadersEndTiming, coarseEstimateMultiplier);\n        }\n      }\n\n      if (originEstimates.length) {\n        estimatesByOrigin.set(origin, originEstimates);\n      }\n    }\n\n    if (!estimatesByOrigin.size) {\n      throw new Error('No timing information available');\n    }\n    return NetworkAnalyzer.summarize(estimatesByOrigin);\n  }\n\n  /**\n   * Estimates the server response time of each origin. RTT times can be passed in or will be\n   * estimated automatically if not provided.\n   */\n  static estimateServerResponseTimeByOrigin(records: Lantern.NetworkRequest[], options?: RTTEstimateOptions&{\n    rttByOrigin?: Map<string, number>,\n  }): Map<string, Summary> {\n    let rttByOrigin = (options || {}).rttByOrigin;\n    if (!rttByOrigin) {\n      rttByOrigin = new Map();\n\n      const rttSummaryByOrigin = NetworkAnalyzer.estimateRTTByOrigin(records, options);\n      for (const [origin, summary] of rttSummaryByOrigin.entries()) {\n        rttByOrigin.set(origin, summary.min);\n      }\n    }\n\n    const estimatesByOrigin = NetworkAnalyzer._estimateResponseTimeByOrigin(records, rttByOrigin);\n    return NetworkAnalyzer.summarize(estimatesByOrigin);\n  }\n\n  /**\n   * Computes the average throughput for the given requests in bits/second.\n   * Excludes data URI, failed or otherwise incomplete, and cached requests.\n   * Returns Infinity if there were no analyzable network requests.\n   */\n  static estimateThroughput(records: Lantern.NetworkRequest[]): number {\n    let totalBytes = 0;\n\n    // We will measure throughput by summing the total bytes downloaded by the total time spent\n    // downloading those bytes. We slice up all the network requests into start/end boundaries, so\n    // it's easier to deal with the gaps in downloading.\n    const timeBoundaries = records\n                               .reduce(\n                                   (boundaries, request) => {\n                                     const scheme = request.parsedURL?.scheme;\n                                     // Requests whose bodies didn't come over the network or didn't completely finish will mess\n                                     // with the computation, just skip over them.\n                                     if (scheme === 'data' || request.failed || !request.finished ||\n                                         request.statusCode > 300 || !request.transferSize) {\n                                       return boundaries;\n                                     }\n\n                                     // If we've made it this far, all the times we need should be valid (i.e. not undefined/-1).\n                                     totalBytes += request.transferSize;\n                                     boundaries.push({time: request.responseHeadersEndTime / 1000, isStart: true});\n                                     boundaries.push({time: request.networkEndTime / 1000, isStart: false});\n                                     return boundaries;\n                                   },\n                                   [] as Array<{time: number, isStart: boolean}>)\n                               .sort((a, b) => a.time - b.time);\n\n    if (!timeBoundaries.length) {\n      return Infinity;\n    }\n\n    let inflight = 0;\n    let currentStart = 0;\n    let totalDuration = 0;\n\n    timeBoundaries.forEach(boundary => {\n      if (boundary.isStart) {\n        if (inflight === 0) {\n          // We just ended a quiet period, keep track of when the download period started\n          currentStart = boundary.time;\n        }\n        inflight++;\n      } else {\n        inflight--;\n        if (inflight === 0) {\n          // We just entered a quiet period, update our duration with the time we spent downloading\n          totalDuration += boundary.time - currentStart;\n        }\n      }\n    });\n\n    return totalBytes * 8 / totalDuration;\n  }\n\n  static computeRTTAndServerResponseTime(records: Lantern.NetworkRequest[]):\n      {rtt: number, additionalRttByOrigin: Map<string, number>, serverResponseTimeByOrigin: Map<string, number>} {\n    // First pass compute the estimated observed RTT to each origin's servers.\n    const rttByOrigin = new Map<string, number>();\n    for (const [origin, summary] of NetworkAnalyzer.estimateRTTByOrigin(records).entries()) {\n      rttByOrigin.set(origin, summary.min);\n    }\n\n    // We'll use the minimum RTT as the assumed connection latency since we care about how much addt'l\n    // latency each origin introduces as Lantern will be simulating with its own connection latency.\n    const minimumRtt = Math.min(...Array.from(rttByOrigin.values()));\n    // We'll use the observed RTT information to help estimate the server response time\n    const responseTimeSummaries = NetworkAnalyzer.estimateServerResponseTimeByOrigin(records, {\n      rttByOrigin,\n    });\n\n    const additionalRttByOrigin = new Map<string, number>();\n    const serverResponseTimeByOrigin = new Map<string, number>();\n    for (const [origin, summary] of responseTimeSummaries.entries()) {\n      // Not all origins have usable timing data, we'll default to using no additional latency.\n      const rttForOrigin = rttByOrigin.get(origin) || minimumRtt;\n      additionalRttByOrigin.set(origin, rttForOrigin - minimumRtt);\n      serverResponseTimeByOrigin.set(origin, summary.median);\n    }\n\n    return {\n      rtt: minimumRtt,\n      additionalRttByOrigin,\n      serverResponseTimeByOrigin,\n    };\n  }\n\n  static analyze(records: Lantern.NetworkRequest[]): Lantern.Simulation.Settings['networkAnalysis'] {\n    const throughput = NetworkAnalyzer.estimateThroughput(records);\n    return {\n      throughput,\n      ...NetworkAnalyzer.computeRTTAndServerResponseTime(records),\n    };\n  }\n\n  static findResourceForUrl<T extends Lantern.NetworkRequest>(records: Array<T>, resourceUrl: string): T|undefined {\n    // equalWithExcludedFragments is expensive, so check that the resourceUrl starts with the request url first\n    return records.find(\n        request => resourceUrl.startsWith(request.url) && UrlUtils.equalWithExcludedFragments(request.url, resourceUrl),\n    );\n  }\n\n  static findLastDocumentForUrl<T extends Lantern.NetworkRequest>(records: Array<T>, resourceUrl: string): T|undefined {\n    // equalWithExcludedFragments is expensive, so check that the resourceUrl starts with the request url first\n    const matchingRequests = records.filter(\n        request => request.resourceType === 'Document' &&\n            // Note: `request.url` should never have a fragment, else this optimization gives wrong results.\n            resourceUrl.startsWith(request.url) && UrlUtils.equalWithExcludedFragments(request.url, resourceUrl),\n    );\n    return matchingRequests[matchingRequests.length - 1];\n  }\n\n  /**\n   * Resolves redirect chain given a main document.\n   * See: {@link NetworkAnalyzer.findLastDocumentForUrl} for how to retrieve main document.\n   */\n  static resolveRedirects<T extends Lantern.NetworkRequest>(request: T): T {\n    while (request.redirectDestination) {\n      request = request.redirectDestination as T;\n    }\n    return request;\n  }\n}\n\nexport {NetworkAnalyzer};\n"]}
+{"version":3,"file":"NetworkAnalyzer.js","sourceRoot":"","sources":["../../../../../../../../front_end/models/trace/lantern/core/NetworkAnalyzer.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAI7B,OAAO,EAAC,YAAY,EAAC,MAAM,mBAAmB,CAAC;AAE/C,MAAM,QAAQ;IACZ;;;;OAIG;IACH,MAAM,CAAC,wBAAwB,CAAC,GAAW;QACzC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,OAAO,GAAG,CAAC;QACb,CAAC;QACD,2EAA2E;QAC3E,+EAA+E;QAC/E,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,GAAG,CAAC,OAAO,CAAC,sBAAsB,EAAE,WAAW,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,0BAA0B,CAAC,IAAY,EAAE,IAAY;QAC1D,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;QAC/D,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YAEf,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YAEf,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;QACjC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAmCD,MAAM,WAAW,GAAG,EAAE,GAAG,IAAI,CAAC;AAE9B,gFAAgF;AAChF,MAAM,kCAAkC,GAAG,GAAG,CAAC;AAE/C;;;GAGG;AACH,MAAM,kCAAkC,GAAkD;IACxF,QAAQ,EAAE,GAAG;IACb,GAAG,EAAE,GAAG;IACR,KAAK,EAAE,GAAG;CACX,CAAC;AAEF,MAAM,eAAe;IACnB,MAAM,KAAK,OAAO;QAChB,OAAO,aAAa,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,aAAa,CAAC,OAAiC;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACrB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC;YAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,MAAgB;QAChC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE7B,IAAI,MAAM,CAAC;QACX,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;QAED,OAAO;YACL,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;YACd,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC9B,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM;YACtD,MAAM;SACP,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,MAA6B;QAC5C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,MAAM,EAAE,CAAC;YACtC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,eAAe,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;YAC7D,YAAY,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;QAClC,CAAC;QAED,YAAY,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,EAAE,eAAe,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;QACpF,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,CAAC,sBAAsB,CACzB,QAAkC,EAClC,QAA2D;QAC7D,MAAM,mBAAmB,GAAG,eAAe,CAAC,6BAA6B,CAAC,QAAQ,CAAC,CAAC;QACpF,MAAM,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAEhE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,IAAI,eAAe,GAAa,EAAE,CAAC;YAEnC,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;gBAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,SAAS;gBACX,CAAC;gBAED,MAAM,KAAK,GAAG,QAAQ,CAAC;oBACrB,OAAO;oBACP,MAAM;oBACN,gBAAgB,EAAE,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;iBAC7D,CAAC,CAAC;gBACH,IAAI,OAAO,KAAK,KAAK,WAAW,EAAE,CAAC;oBACjC,eAAe,GAAG,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAED,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,+BAA+B,CAAC,IAAiB;QACtD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,MAAM,EAAC,YAAY,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAC,GAAG,MAAM,CAAC;QAC5D,IAAI,UAAU,IAAI,CAAC,IAAI,YAAY,IAAI,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9E,wDAAwD;YACxD,OAAO,UAAU,GAAG,YAAY,CAAC;QACnC,CAAC;QACD,IAAI,QAAQ,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;YAC9D,kEAAkE;YAClE,OAAO,CAAC,UAAU,GAAG,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,YAAY,IAAI,CAAC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACzC,OAAO,UAAU,GAAG,YAAY,CAAC;QACnC,CAAC;QAED,OAAO;IACT,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,6BAA6B,CAAC,IAAiB;QACpD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,sEAAsE;QACtE,IAAI,OAAO,CAAC,YAAY,IAAI,WAAW,EAAE,CAAC;YACxC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC/E,OAAO;QACT,CAAC;QAED,2FAA2F;QAC3F,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC,kBAAkB,CAAC;QACtE,MAAM,0BAA0B,GAAG,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACxE,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC;QAEzE,4FAA4F;QAC5F,6BAA6B;QAC7B,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,OAAO,0BAA0B,GAAG,kBAAkB,CAAC;IACzD,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,8BAA8B,CAAC,IAAiB;QACrD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YAC/D,OAAO;QACT,CAAC;QAED,2EAA2E;QAC3E,mDAAmD;QACnD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM;QACN,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,UAAU,IAAI,CAAC,CAAC;QAClB,CAAC;QACD,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;YACzC,UAAU,IAAI,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC,SAAS,GAAG,UAAU,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,+BAA+B,CAAC,IAAiB;QACtD,MAAM,EAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAC,GAAG,IAAI,CAAC;QACjD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC/E,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,MAAM,4BAA4B,GAC9B,kCAAkC,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,kCAAkC,CAAC;QACnG,MAAM,2BAA2B,GAAG,MAAM,CAAC,iBAAiB,GAAG,4BAA4B,CAAC;QAE5F,gCAAgC;QAChC,iDAAiD;QACjD,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,+BAA+B;QAC/B,gFAAgF;QAChF,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,UAAU,IAAI,CAAC,CAAC,CAAE,MAAM;YACxB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,UAAU,IAAI,CAAC,CAAC,CAAE,MAAM;YAC1B,CAAC;YACD,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;gBACzC,UAAU,IAAI,CAAC,CAAC,CAAE,MAAM;YAC1B,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,iBAAiB,GAAG,2BAA2B,CAAC,GAAG,UAAU,EAAE,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,6BAA6B,CAAC,OAAiC,EAAE,WAAgC;QAEtG,OAAO,eAAe,CAAC,sBAAsB,CAAC,OAAO,EAAE,CAAC,EAAC,OAAO,EAAE,MAAM,EAAC,EAAE,EAAE;YAC3E,IAAI,OAAO,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;gBAC7C,OAAO,OAAO,CAAC,kBAAkB,CAAC;YACpC,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,MAAM,CAAC,iBAAiB,GAAG,CAAC,EAAE,CAAC;gBAC/E,OAAO;YACT,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;gBAC3D,OAAO;YACT,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,CAAC,iBAAiB,GAAG,MAAM,CAAC,OAAO,CAAC;YACvD,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,cAAc,CAAC;YAChD,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACrF,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,6BAA6B,CAAC,QAAkC;QACrE,MAAM,sBAAsB,GAAG,IAAI,GAAG,EAAE,CAAC;QACzC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC;YAC9F,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;QAC5D,CAAC;QAED,0FAA0F;QAC1F,IAAI,sBAAsB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,wGAAwG;QACxG,OAAO,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;IAC/E,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,6BAA6B,CAAC,OAAiC,EAAE,OAAyC;QAE/G,MAAM,EAAC,oBAAoB,GAAG,KAAK,EAAC,GAAG,OAAO,IAAI,EAAE,CAAC;QAErD,4EAA4E;QAC5E,IAAI,CAAC,oBAAoB,IAAI,eAAe,CAAC,6BAA6B,CAAC,OAAO,CAAC,EAAE,CAAC;YACpF,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACjG,CAAC;QAED,qFAAqF;QACrF,iDAAiD;QACjD,gBAAgB;QAChB,yDAAyD;QACzD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAE,CAAC;QACtC,MAAM,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC/D,KAAK,MAAM,aAAa,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACrD,MAAM,qBAAqB,GACvB,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAEpG,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;gBACpC,mBAAmB,CAAC,GAAG,CACnB,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,kBAAkB,IAAI,qBAAqB,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,CACnF,CAAC;YACJ,CAAC;YAED,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChD,OAAO,CAAC,CAAC,kBAAkB,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC,CAAC,CAAC;YACH,mBAAmB,CAAC,GAAG,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;QAED,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,mBAAmB,CAAC,OAAiC,EAAE,OAA4B;QACxF,MAAM,EACJ,oBAAoB,GAAG,KAAK;QAC5B,wDAAwD;QACxD,0DAA0D;QAC1D,wBAAwB,GAAG,GAAG,EAC9B,oBAAoB,GAAG,IAAI,EAC3B,qBAAqB,GAAG,IAAI,EAC5B,sBAAsB,GAAG,IAAI,GAC9B,GAAG,OAAO,IAAI,EAAE,CAAC;QAElB,MAAM,mBAAmB,GAAG,eAAe,CAAC,6BAA6B,CAAC,OAAO,CAAC,CAAC;QACnF,MAAM,eAAe,GAAG,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAE/D,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,IAAI,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,MAAM,eAAe,GAAa,EAAE,CAAC;YAErC,iDAAiD;YACjD,SAAS,gBAAgB,CAAC,SAA4D,EAAE,UAAU,GAAG,CAAC;gBACpG,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;oBACrC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;oBAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;wBACZ,SAAS;oBACX,CAAC;oBAED,MAAM,SAAS,GAAG,SAAS,CAAC;wBAC1B,OAAO;wBACP,MAAM;wBACN,gBAAgB,EAAE,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC;qBAC7D,CAAC,CAAC;oBACH,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;wBAC5B,SAAS;oBACX,CAAC;oBAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC9B,eAAe,CAAC,IAAI,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACN,eAAe,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,gBAAgB,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;YACzD,CAAC;YAED,sDAAsD;YACtD,sEAAsE;YACtE,0GAA0G;YAC1G,2GAA2G;YAC3G,iCAAiC;YACjC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC;gBAC5B,IAAI,oBAAoB,EAAE,CAAC;oBACzB,gBAAgB,CAAC,IAAI,CAAC,6BAA6B,EAAE,wBAAwB,CAAC,CAAC;gBACjF,CAAC;gBACD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,gBAAgB,CAAC,IAAI,CAAC,8BAA8B,EAAE,wBAAwB,CAAC,CAAC;gBAClF,CAAC;gBACD,IAAI,sBAAsB,EAAE,CAAC;oBAC3B,gBAAgB,CAAC,IAAI,CAAC,+BAA+B,EAAE,wBAAwB,CAAC,CAAC;gBACnF,CAAC;YACH,CAAC;YAED,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;gBAC3B,iBAAiB,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,eAAe,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,kCAAkC,CAAC,OAAiC,EAAE,OAE5E;QACC,IAAI,WAAW,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,WAAW,CAAC;QAC9C,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;YAExB,MAAM,kBAAkB,GAAG,eAAe,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACjF,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC7D,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,eAAe,CAAC,6BAA6B,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QAC9F,OAAO,eAAe,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,kBAAkB,CAAC,OAAiC;QACzD,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,2FAA2F;QAC3F,8FAA8F;QAC9F,oDAAoD;QACpD,MAAM,cAAc,GAAG,OAAO;aACF,MAAM,CACH,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE;YACtB,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC;YACzC,2FAA2F;YAC3F,6CAA6C;YAC7C,IAAI,MAAM,KAAK,MAAM,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ;gBACxD,OAAO,CAAC,UAAU,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;gBACtD,OAAO,UAAU,CAAC;YACpB,CAAC;YAED,4FAA4F;YAC5F,UAAU,IAAI,OAAO,CAAC,YAAY,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,OAAO,CAAC,sBAAsB,GAAG,IAAI,EAAE,OAAO,EAAE,IAAI,EAAC,CAAC,CAAC;YAC9E,UAAU,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,OAAO,CAAC,cAAc,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC;YACvE,OAAO,UAAU,CAAC;QACpB,CAAC,EACD,EAA6C,CAAC;aACjD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QAE5D,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC;YAC3B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YAChC,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACrB,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACnB,+EAA+E;oBAC/E,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;gBAC/B,CAAC;gBACD,QAAQ,EAAE,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,QAAQ,EAAE,CAAC;gBACX,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACnB,yFAAyF;oBACzF,aAAa,IAAI,QAAQ,CAAC,IAAI,GAAG,YAAY,CAAC;gBAChD,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,UAAU,GAAG,CAAC,GAAG,aAAa,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,+BAA+B,CAAC,OAAiC;QAEtE,0EAA0E;QAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,eAAe,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;YACvF,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;QAED,kGAAkG;QAClG,gGAAgG;QAChG,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjE,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,eAAe,CAAC,kCAAkC,CAAC,OAAO,EAAE;YACxF,WAAW;SACZ,CAAC,CAAC;QAEH,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxD,MAAM,0BAA0B,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7D,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,yFAAyF;YACzF,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC;YAC3D,qBAAqB,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,GAAG,UAAU,CAAC,CAAC;YAC7D,0BAA0B,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;QAED,OAAO;YACL,GAAG,EAAE,UAAU;YACf,qBAAqB;YACrB,0BAA0B;SAC3B,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,OAAiC;QAC9C,MAAM,UAAU,GAAG,eAAe,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC/D,OAAO;YACL,UAAU;YACV,GAAG,eAAe,CAAC,+BAA+B,CAAC,OAAO,CAAC;SAC5D,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,kBAAkB,CAAmC,OAAiB,EAAE,WAAmB;QAChG,2GAA2G;QAC3G,OAAO,OAAO,CAAC,IAAI,CACf,OAAO,CAAC,EAAE,CAAC,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,0BAA0B,CAAC,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC,CAClH,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,sBAAsB,CAAmC,OAAiB,EAAE,WAAmB;QACpG,2GAA2G;QAC3G,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CACnC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,KAAK,UAAU;YAC1C,gGAAgG;YAChG,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,0BAA0B,CAAC,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC,CAC3G,CAAC;QACF,OAAO,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,gBAAgB,CAAmC,OAAU;QAClE,OAAO,OAAO,CAAC,mBAAmB,EAAE,CAAC;YACnC,OAAO,GAAG,OAAO,CAAC,mBAAwB,CAAC;QAC7C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAED,OAAO,EAAC,eAAe,EAAC,CAAC","sourcesContent":["// Copyright 2024 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nimport type * as Lantern from '../types/types.js';\n\nimport {LanternError} from './LanternError.js';\n\nclass UrlUtils {\n  /**\n   * There is fancy URL rewriting logic for the chrome://settings page that we need to work around.\n   * Why? Special handling was added by Chrome team to allow a pushState transition between chrome:// pages.\n   * As a result, the network URL (chrome://chrome/settings/) doesn't match the final document URL (chrome://settings/).\n   */\n  static rewriteChromeInternalUrl(url: string): string {\n    if (!url || !url.startsWith('chrome://')) {\n      return url;\n    }\n    // Chrome adds a trailing slash to `chrome://` URLs, but the spec does not.\n    //   https://github.com/GoogleChrome/lighthouse/pull/3941#discussion_r154026009\n    if (url.endsWith('/')) {\n      url = url.replace(/\\/$/, '');\n    }\n    return url.replace(/^chrome:\\/\\/chrome\\//, 'chrome://');\n  }\n\n  /**\n   * Determine if url1 equals url2, ignoring URL fragments.\n   */\n  static equalWithExcludedFragments(url1: string, url2: string): boolean {\n    [url1, url2] = [url1, url2].map(this.rewriteChromeInternalUrl);\n    try {\n      const urla = new URL(url1);\n      urla.hash = '';\n\n      const urlb = new URL(url2);\n      urlb.hash = '';\n\n      return urla.href === urlb.href;\n    } catch (e) {\n      return false;\n    }\n  }\n}\n\ninterface Summary {\n  min: number;\n  max: number;\n  avg: number;\n  median: number;\n}\n\ninterface RTTEstimateOptions {\n  /**\n   * TCP connection handshake information will be used when available, but in\n   * some circumstances this data can be unreliable. This flag exposes an\n   * option to ignore the handshake data and use the coarse download/TTFB timing data.\n   */\n  forceCoarseEstimates?: boolean;\n  /**\n   * Coarse estimates include lots of extra time and noise multiply by some factor\n   * to deflate the estimates a bit.\n   */\n  coarseEstimateMultiplier?: number;\n  /** Useful for testing to isolate the different methods of estimation. */\n  useDownloadEstimates?: boolean;\n  /** Useful for testing to isolate the different methods of estimation. */\n  useSendStartEstimates?: boolean;\n  /** Useful for testing to isolate the different methods of estimation. */\n  useHeadersEndEstimates?: boolean;\n}\n\ntype RequestInfo = {\n  request: Lantern.NetworkRequest,\n  timing: Lantern.ResourceTiming,\n  connectionReused?: boolean,\n};\n\nconst INITIAL_CWD = 14 * 1024;\n\n// Assume that 40% of TTFB was server response time by default for static assets\nconst DEFAULT_SERVER_RESPONSE_PERCENTAGE = 0.4;\n\n/**\n * For certain resource types, server response time takes up a greater percentage of TTFB (dynamic\n * assets like HTML documents, XHR/API calls, etc)\n */\nconst SERVER_RESPONSE_PERCENTAGE_OF_TTFB: Partial<Record<Lantern.ResourceType, number>> = {\n  Document: 0.9,\n  XHR: 0.9,\n  Fetch: 0.9,\n};\n\nclass NetworkAnalyzer {\n  static get summary(): string {\n    return '__SUMMARY__';\n  }\n\n  static groupByOrigin(records: Lantern.NetworkRequest[]): Map<string, Lantern.NetworkRequest[]> {\n    const grouped = new Map();\n    records.forEach(item => {\n      const key = item.parsedURL.securityOrigin;\n      const group = grouped.get(key) || [];\n      group.push(item);\n      grouped.set(key, group);\n    });\n    return grouped;\n  }\n\n  static getSummary(values: number[]): Summary {\n    values.sort((a, b) => a - b);\n\n    let median;\n    if (values.length === 0) {\n      median = values[0];\n    } else if (values.length % 2 === 0) {\n      const a = values[Math.floor((values.length - 1) / 2)];\n      const b = values[Math.floor((values.length - 1) / 2) + 1];\n      median = (a + b) / 2;\n    } else {\n      median = values[Math.floor((values.length - 1) / 2)];\n    }\n\n    return {\n      min: values[0],\n      max: values[values.length - 1],\n      avg: values.reduce((a, b) => a + b, 0) / values.length,\n      median,\n    };\n  }\n\n  static summarize(values: Map<string, number[]>): Map<string, Summary> {\n    const summaryByKey = new Map();\n    const allEstimates = [];\n    for (const [key, estimates] of values) {\n      summaryByKey.set(key, NetworkAnalyzer.getSummary(estimates));\n      allEstimates.push(...estimates);\n    }\n\n    summaryByKey.set(NetworkAnalyzer.summary, NetworkAnalyzer.getSummary(allEstimates));\n    return summaryByKey;\n  }\n\n  static _estimateValueByOrigin(\n      requests: Lantern.NetworkRequest[],\n      iteratee: (e: RequestInfo) => number | number[] | undefined): Map<string, number[]> {\n    const connectionWasReused = NetworkAnalyzer.estimateIfConnectionWasReused(requests);\n    const groupedByOrigin = NetworkAnalyzer.groupByOrigin(requests);\n\n    const estimates = new Map();\n    for (const [origin, originRequests] of groupedByOrigin.entries()) {\n      let originEstimates: number[] = [];\n\n      for (const request of originRequests) {\n        const timing = request.timing;\n        if (!timing) {\n          continue;\n        }\n\n        const value = iteratee({\n          request,\n          timing,\n          connectionReused: connectionWasReused.get(request.requestId),\n        });\n        if (typeof value !== 'undefined') {\n          originEstimates = originEstimates.concat(value);\n        }\n      }\n\n      if (!originEstimates.length) {\n        continue;\n      }\n      estimates.set(origin, originEstimates);\n    }\n\n    return estimates;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long the connection setup.\n   * For h1 and h2, this could includes two estimates - one for the TCP handshake, another for\n   * SSL negotiation.\n   * For h3, we get only one estimate since QUIC establishes a secure connection in a\n   * single handshake.\n   * This is the most accurate and preferred method of measurement when the data is available.\n   */\n  static _estimateRTTViaConnectionTiming(info: RequestInfo): number[]|number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (connectionReused) {\n      return;\n    }\n\n    const {connectStart, sslStart, sslEnd, connectEnd} = timing;\n    if (connectEnd >= 0 && connectStart >= 0 && request.protocol.startsWith('h3')) {\n      // These values are equal to sslStart and sslEnd for h3.\n      return connectEnd - connectStart;\n    }\n    if (sslStart >= 0 && sslEnd >= 0 && sslStart !== connectStart) {\n      // SSL can also be more than 1 RT but assume False Start was used.\n      return [connectEnd - sslStart, sslStart - connectStart];\n    }\n    if (connectStart >= 0 && connectEnd >= 0) {\n      return connectEnd - connectStart;\n    }\n\n    return;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long a download took on a fresh connection.\n   * NOTE: this will tend to overestimate the actual RTT quite significantly as the download can be\n   * slow for other reasons as well such as bandwidth constraints.\n   */\n  static _estimateRTTViaDownloadTiming(info: RequestInfo): number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (connectionReused) {\n      return;\n    }\n\n    // Only look at downloads that went past the initial congestion window\n    if (request.transferSize <= INITIAL_CWD) {\n      return;\n    }\n    if (!Number.isFinite(timing.receiveHeadersEnd) || timing.receiveHeadersEnd < 0) {\n      return;\n    }\n\n    // Compute the amount of time downloading everything after the first congestion window took\n    const totalTime = request.networkEndTime - request.networkRequestTime;\n    const downloadTimeAfterFirstByte = totalTime - timing.receiveHeadersEnd;\n    const numberOfRoundTrips = Math.log2(request.transferSize / INITIAL_CWD);\n\n    // Ignore requests that required a high number of round trips since bandwidth starts to play\n    // a larger role than latency\n    if (numberOfRoundTrips > 5) {\n      return;\n    }\n\n    return downloadTimeAfterFirstByte / numberOfRoundTrips;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long it took until Chrome could\n   * start sending the actual request when a new connection was required.\n   * NOTE: this will tend to overestimate the actual RTT as the request can be delayed for other\n   * reasons as well such as more SSL handshakes if TLS False Start is not enabled.\n   */\n  static _estimateRTTViaSendStartTiming(info: RequestInfo): number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (connectionReused) {\n      return;\n    }\n\n    if (!Number.isFinite(timing.sendStart) || timing.sendStart < 0) {\n      return;\n    }\n\n    // Assume everything before sendStart was just DNS + (SSL)? + TCP handshake\n    // 1 RT for DNS, 1 RT (maybe) for SSL, 1 RT for TCP\n    let roundTrips = 1;\n    // TCP\n    if (!request.protocol.startsWith('h3')) {\n      roundTrips += 1;\n    }\n    if (request.parsedURL.scheme === 'https') {\n      roundTrips += 1;\n    }\n    return timing.sendStart / roundTrips;\n  }\n\n  /**\n   * Estimates the observed RTT to each origin based on how long it took until Chrome received the\n   * headers of the response (~TTFB).\n   * NOTE: this is the most inaccurate way to estimate the RTT, but in some environments it's all\n   * we have access to :(\n   */\n  static _estimateRTTViaHeadersEndTiming(info: RequestInfo): number|undefined {\n    const {timing, connectionReused, request} = info;\n    if (!Number.isFinite(timing.receiveHeadersEnd) || timing.receiveHeadersEnd < 0) {\n      return;\n    }\n    if (!request.resourceType) {\n      return;\n    }\n\n    const serverResponseTimePercentage =\n        SERVER_RESPONSE_PERCENTAGE_OF_TTFB[request.resourceType] || DEFAULT_SERVER_RESPONSE_PERCENTAGE;\n    const estimatedServerResponseTime = timing.receiveHeadersEnd * serverResponseTimePercentage;\n\n    // When connection was reused...\n    // TTFB = 1 RT for request + server response time\n    let roundTrips = 1;\n\n    // When connection was fresh...\n    // TTFB = DNS + (SSL)? + TCP handshake + 1 RT for request + server response time\n    if (!connectionReused) {\n      roundTrips += 1;  // DNS\n      if (!request.protocol.startsWith('h3')) {\n        roundTrips += 1;  // TCP\n      }\n      if (request.parsedURL.scheme === 'https') {\n        roundTrips += 1;  // SSL\n      }\n    }\n\n    // subtract out our estimated server response time\n    return Math.max((timing.receiveHeadersEnd - estimatedServerResponseTime) / roundTrips, 3);\n  }\n\n  /**\n   * Given the RTT to each origin, estimates the observed server response times.\n   */\n  static _estimateResponseTimeByOrigin(records: Lantern.NetworkRequest[], rttByOrigin: Map<string, number>):\n      Map<string, number[]> {\n    return NetworkAnalyzer._estimateValueByOrigin(records, ({request, timing}) => {\n      if (request.serverResponseTime !== undefined) {\n        return request.serverResponseTime;\n      }\n\n      if (!Number.isFinite(timing.receiveHeadersEnd) || timing.receiveHeadersEnd < 0) {\n        return;\n      }\n      if (!Number.isFinite(timing.sendEnd) || timing.sendEnd < 0) {\n        return;\n      }\n\n      const ttfb = timing.receiveHeadersEnd - timing.sendEnd;\n      const origin = request.parsedURL.securityOrigin;\n      const rtt = rttByOrigin.get(origin) || rttByOrigin.get(NetworkAnalyzer.summary) || 0;\n      return Math.max(ttfb - rtt, 0);\n    });\n  }\n\n  static canTrustConnectionInformation(requests: Lantern.NetworkRequest[]): boolean {\n    const connectionIdWasStarted = new Map();\n    for (const request of requests) {\n      const started = connectionIdWasStarted.get(request.connectionId) || !request.connectionReused;\n      connectionIdWasStarted.set(request.connectionId, started);\n    }\n\n    // We probably can't trust the network information if all the connection IDs were the same\n    if (connectionIdWasStarted.size <= 1) {\n      return false;\n    }\n    // Or if there were connections that were always reused (a connection had to have started at some point)\n    return Array.from(connectionIdWasStarted.values()).every(started => started);\n  }\n\n  /**\n   * Returns a map of requestId -> connectionReused, estimating the information if the information\n   * available in the records themselves appears untrustworthy.\n   */\n  static estimateIfConnectionWasReused(records: Lantern.NetworkRequest[], options?: {forceCoarseEstimates: boolean}):\n      Map<string, boolean> {\n    const {forceCoarseEstimates = false} = options || {};\n\n    // Check if we can trust the connection information coming from the protocol\n    if (!forceCoarseEstimates && NetworkAnalyzer.canTrustConnectionInformation(records)) {\n      return new Map(records.map(request => [request.requestId, Boolean(request.connectionReused)]));\n    }\n\n    // Otherwise we're on our own, a request may not have needed a fresh connection if...\n    //   - It was not the first request to the domain\n    //   - It was H2\n    //   - It was after the first request to the domain ended\n    const connectionWasReused = new Map();\n    const groupedByOrigin = NetworkAnalyzer.groupByOrigin(records);\n    for (const originRecords of groupedByOrigin.values()) {\n      const earliestReusePossible =\n          originRecords.map(request => request.networkEndTime).reduce((a, b) => Math.min(a, b), Infinity);\n\n      for (const request of originRecords) {\n        connectionWasReused.set(\n            request.requestId,\n            request.networkRequestTime >= earliestReusePossible || request.protocol === 'h2',\n        );\n      }\n\n      const firstRecord = originRecords.reduce((a, b) => {\n        return a.networkRequestTime > b.networkRequestTime ? b : a;\n      });\n      connectionWasReused.set(firstRecord.requestId, false);\n    }\n\n    return connectionWasReused;\n  }\n\n  /**\n   * Estimates the RTT to each origin by examining observed network timing information.\n   * Attempts to use the most accurate information first and falls back to coarser estimates when it\n   * is unavailable.\n   */\n  static estimateRTTByOrigin(records: Lantern.NetworkRequest[], options?: RTTEstimateOptions): Map<string, Summary> {\n    const {\n      forceCoarseEstimates = false,\n      // coarse estimates include lots of extra time and noise\n      // multiply by some factor to deflate the estimates a bit.\n      coarseEstimateMultiplier = 0.3,\n      useDownloadEstimates = true,\n      useSendStartEstimates = true,\n      useHeadersEndEstimates = true,\n    } = options || {};\n\n    const connectionWasReused = NetworkAnalyzer.estimateIfConnectionWasReused(records);\n    const groupedByOrigin = NetworkAnalyzer.groupByOrigin(records);\n\n    const estimatesByOrigin = new Map();\n    for (const [origin, originRequests] of groupedByOrigin.entries()) {\n      const originEstimates: number[] = [];\n\n      // eslint-disable-next-line no-inner-declarations\n      function collectEstimates(estimator: (e: RequestInfo) => number[] | number | undefined, multiplier = 1): void {\n        for (const request of originRequests) {\n          const timing = request.timing;\n          if (!timing) {\n            continue;\n          }\n\n          const estimates = estimator({\n            request,\n            timing,\n            connectionReused: connectionWasReused.get(request.requestId),\n          });\n          if (estimates === undefined) {\n            continue;\n          }\n\n          if (!Array.isArray(estimates)) {\n            originEstimates.push(estimates * multiplier);\n          } else {\n            originEstimates.push(...estimates.map(e => e * multiplier));\n          }\n        }\n      }\n\n      if (!forceCoarseEstimates) {\n        collectEstimates(this._estimateRTTViaConnectionTiming);\n      }\n\n      // Connection timing can be missing for a few reasons:\n      // - Origin was preconnected, which we don't have instrumentation for.\n      // - Trace began recording after a connection has already been established (for example, in timespan mode)\n      // - Perhaps Chrome established a connection already in the background (service worker? Just guessing here)\n      // - Not provided in LR netstack.\n      if (!originEstimates.length) {\n        if (useDownloadEstimates) {\n          collectEstimates(this._estimateRTTViaDownloadTiming, coarseEstimateMultiplier);\n        }\n        if (useSendStartEstimates) {\n          collectEstimates(this._estimateRTTViaSendStartTiming, coarseEstimateMultiplier);\n        }\n        if (useHeadersEndEstimates) {\n          collectEstimates(this._estimateRTTViaHeadersEndTiming, coarseEstimateMultiplier);\n        }\n      }\n\n      if (originEstimates.length) {\n        estimatesByOrigin.set(origin, originEstimates);\n      }\n    }\n\n    if (!estimatesByOrigin.size) {\n      throw new LanternError('No timing information available');\n    }\n    return NetworkAnalyzer.summarize(estimatesByOrigin);\n  }\n\n  /**\n   * Estimates the server response time of each origin. RTT times can be passed in or will be\n   * estimated automatically if not provided.\n   */\n  static estimateServerResponseTimeByOrigin(records: Lantern.NetworkRequest[], options?: RTTEstimateOptions&{\n    rttByOrigin?: Map<string, number>,\n  }): Map<string, Summary> {\n    let rttByOrigin = (options || {}).rttByOrigin;\n    if (!rttByOrigin) {\n      rttByOrigin = new Map();\n\n      const rttSummaryByOrigin = NetworkAnalyzer.estimateRTTByOrigin(records, options);\n      for (const [origin, summary] of rttSummaryByOrigin.entries()) {\n        rttByOrigin.set(origin, summary.min);\n      }\n    }\n\n    const estimatesByOrigin = NetworkAnalyzer._estimateResponseTimeByOrigin(records, rttByOrigin);\n    return NetworkAnalyzer.summarize(estimatesByOrigin);\n  }\n\n  /**\n   * Computes the average throughput for the given requests in bits/second.\n   * Excludes data URI, failed or otherwise incomplete, and cached requests.\n   * Returns Infinity if there were no analyzable network requests.\n   */\n  static estimateThroughput(records: Lantern.NetworkRequest[]): number {\n    let totalBytes = 0;\n\n    // We will measure throughput by summing the total bytes downloaded by the total time spent\n    // downloading those bytes. We slice up all the network requests into start/end boundaries, so\n    // it's easier to deal with the gaps in downloading.\n    const timeBoundaries = records\n                               .reduce(\n                                   (boundaries, request) => {\n                                     const scheme = request.parsedURL?.scheme;\n                                     // Requests whose bodies didn't come over the network or didn't completely finish will mess\n                                     // with the computation, just skip over them.\n                                     if (scheme === 'data' || request.failed || !request.finished ||\n                                         request.statusCode > 300 || !request.transferSize) {\n                                       return boundaries;\n                                     }\n\n                                     // If we've made it this far, all the times we need should be valid (i.e. not undefined/-1).\n                                     totalBytes += request.transferSize;\n                                     boundaries.push({time: request.responseHeadersEndTime / 1000, isStart: true});\n                                     boundaries.push({time: request.networkEndTime / 1000, isStart: false});\n                                     return boundaries;\n                                   },\n                                   [] as Array<{time: number, isStart: boolean}>)\n                               .sort((a, b) => a.time - b.time);\n\n    if (!timeBoundaries.length) {\n      return Infinity;\n    }\n\n    let inflight = 0;\n    let currentStart = 0;\n    let totalDuration = 0;\n\n    timeBoundaries.forEach(boundary => {\n      if (boundary.isStart) {\n        if (inflight === 0) {\n          // We just ended a quiet period, keep track of when the download period started\n          currentStart = boundary.time;\n        }\n        inflight++;\n      } else {\n        inflight--;\n        if (inflight === 0) {\n          // We just entered a quiet period, update our duration with the time we spent downloading\n          totalDuration += boundary.time - currentStart;\n        }\n      }\n    });\n\n    return totalBytes * 8 / totalDuration;\n  }\n\n  static computeRTTAndServerResponseTime(records: Lantern.NetworkRequest[]):\n      {rtt: number, additionalRttByOrigin: Map<string, number>, serverResponseTimeByOrigin: Map<string, number>} {\n    // First pass compute the estimated observed RTT to each origin's servers.\n    const rttByOrigin = new Map<string, number>();\n    for (const [origin, summary] of NetworkAnalyzer.estimateRTTByOrigin(records).entries()) {\n      rttByOrigin.set(origin, summary.min);\n    }\n\n    // We'll use the minimum RTT as the assumed connection latency since we care about how much addt'l\n    // latency each origin introduces as Lantern will be simulating with its own connection latency.\n    const minimumRtt = Math.min(...Array.from(rttByOrigin.values()));\n    // We'll use the observed RTT information to help estimate the server response time\n    const responseTimeSummaries = NetworkAnalyzer.estimateServerResponseTimeByOrigin(records, {\n      rttByOrigin,\n    });\n\n    const additionalRttByOrigin = new Map<string, number>();\n    const serverResponseTimeByOrigin = new Map<string, number>();\n    for (const [origin, summary] of responseTimeSummaries.entries()) {\n      // Not all origins have usable timing data, we'll default to using no additional latency.\n      const rttForOrigin = rttByOrigin.get(origin) || minimumRtt;\n      additionalRttByOrigin.set(origin, rttForOrigin - minimumRtt);\n      serverResponseTimeByOrigin.set(origin, summary.median);\n    }\n\n    return {\n      rtt: minimumRtt,\n      additionalRttByOrigin,\n      serverResponseTimeByOrigin,\n    };\n  }\n\n  static analyze(records: Lantern.NetworkRequest[]): Lantern.Simulation.Settings['networkAnalysis'] {\n    const throughput = NetworkAnalyzer.estimateThroughput(records);\n    return {\n      throughput,\n      ...NetworkAnalyzer.computeRTTAndServerResponseTime(records),\n    };\n  }\n\n  static findResourceForUrl<T extends Lantern.NetworkRequest>(records: Array<T>, resourceUrl: string): T|undefined {\n    // equalWithExcludedFragments is expensive, so check that the resourceUrl starts with the request url first\n    return records.find(\n        request => resourceUrl.startsWith(request.url) && UrlUtils.equalWithExcludedFragments(request.url, resourceUrl),\n    );\n  }\n\n  static findLastDocumentForUrl<T extends Lantern.NetworkRequest>(records: Array<T>, resourceUrl: string): T|undefined {\n    // equalWithExcludedFragments is expensive, so check that the resourceUrl starts with the request url first\n    const matchingRequests = records.filter(\n        request => request.resourceType === 'Document' &&\n            // Note: `request.url` should never have a fragment, else this optimization gives wrong results.\n            resourceUrl.startsWith(request.url) && UrlUtils.equalWithExcludedFragments(request.url, resourceUrl),\n    );\n    return matchingRequests[matchingRequests.length - 1];\n  }\n\n  /**\n   * Resolves redirect chain given a main document.\n   * See: {@link NetworkAnalyzer.findLastDocumentForUrl} for how to retrieve main document.\n   */\n  static resolveRedirects<T extends Lantern.NetworkRequest>(request: T): T {\n    while (request.redirectDestination) {\n      request = request.redirectDestination as T;\n    }\n    return request;\n  }\n}\n\nexport {NetworkAnalyzer};\n"]}

package/models/trace/lantern/graph/BaseNode.d.ts

@@ -1,6 +1,6 @@
+import type * as Lantern from '../types/types.js';
 import { type CPUNode } from './CPUNode.js';
 import { type NetworkNode } from './NetworkNode.js';
-import type * as Lantern from '../types/types.js';
 /**
  * A union of all types derived from BaseNode, allowing type check discrimination
  * based on `node.type`. If a new node type is created, it should be added here.
@@ -64,6 +64,10 @@ declare class BaseNode<T = Lantern.AnyNetworkObject> {
      * Clones the entire graph connected to this node filtered by the optional predicate. If a node is
      * included by the predicate, all nodes along the paths between the node and the root will be included. If the
      * node this was called on is not included in the resulting filtered graph, the method will throw.
+     *
+     * This does not clone NetworkNode's `record` or `rawRecord` fields. It may be reasonable to clone the former,
+     * to assist in graph construction, but the latter should never be cloned as one contraint of Lantern is that
+     * the underlying data records are accessible for plain object reference equality checks.
      */
     cloneWithRelationships(predicate?: (arg0: Node) => boolean): Node;
     /**

package/models/trace/lantern/graph/BaseNode.js

@@ -1,6 +1,7 @@
 // Copyright 2024 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+import * as Core from '../core/core.js';
 /**
  * @fileoverview This class encapsulates logic for handling resources and tasks used to model the
  * execution dependency graph of the page. A node has a unique identifier and can depend on other
@@ -32,19 +33,19 @@ class BaseNode {
         return this._id;
     }
     get type() {
-        throw new Error('Unimplemented');
+        throw new Core.LanternError('Unimplemented');
     }
     /**
      * In microseconds
      */
     get startTime() {
-        throw new Error('Unimplemented');
+        throw new Core.LanternError('Unimplemented');
     }
     /**
      * In microseconds
      */
     get endTime() {
-        throw new Error('Unimplemented');
+        throw new Core.LanternError('Unimplemented');
     }
     setIsMainDocument(value) {
         this._isMainDocument = value;
@@ -77,7 +78,7 @@ class BaseNode {
     addDependency(node) {
         // @ts-expect-error - in checkJs, ts doesn't know that CPUNode and NetworkNode *are* BaseNodes.
         if (node === this) {
-            throw new Error('Cannot add dependency on itself');
+            throw new Core.LanternError('Cannot add dependency on itself');
         }
         if (this._dependencies.includes(node)) {
             return;
@@ -135,6 +136,10 @@ class BaseNode {
      * Clones the entire graph connected to this node filtered by the optional predicate. If a node is
      * included by the predicate, all nodes along the paths between the node and the root will be included. If the
      * node this was called on is not included in the resulting filtered graph, the method will throw.
+     *
+     * This does not clone NetworkNode's `record` or `rawRecord` fields. It may be reasonable to clone the former,
+     * to assist in graph construction, but the latter should never be cloned as one contraint of Lantern is that
+     * the underlying data records are accessible for plain object reference equality checks.
      */
     cloneWithRelationships(predicate) {
         const rootNode = this.getRootNode();
@@ -165,14 +170,14 @@ class BaseNode {
             for (const dependency of originalNode._dependencies) {
                 const clonedDependency = idsToIncludedClones.get(dependency.id);
                 if (!clonedDependency) {
-                    throw new Error('Dependency somehow not cloned');
+                    throw new Core.LanternError('Dependency somehow not cloned');
                 }
                 clonedNode.addDependency(clonedDependency);
             }
         });
         const clonedThisNode = idsToIncludedClones.get(this.id);
         if (!clonedThisNode) {
-            throw new Error('Cloned graph missing node');
+            throw new Core.LanternError('Cloned graph missing node');
         }
         return clonedThisNode;
     }