@paulirish/trace_engine 0.0.50 → 0.0.52

package/models/trace/extras/ScriptDuplication.js

@@ -1,66 +1,11 @@
 // Copyright 2025 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 Handlers from '../handlers/handlers.js';
 // Ignore modules smaller than an absolute threshold.
 const ABSOLUTE_SIZE_THRESHOLD_BYTES = 1024 * 0.5;
 // Ignore modules smaller than a % size of largest copy of the module.
 const RELATIVE_SIZE_THRESHOLD = 0.1;
-/**
- * Using a script's contents and source map, attribute every generated byte to an authored source file.
- */
-export function computeGeneratedFileSizes(script) {
-    if (!script.sourceMap) {
-        throw new Error('expected source map');
-    }
-    const map = script.sourceMap;
-    const content = script.content ?? '';
-    const contentLength = content.length;
-    const lines = content.split('\n');
-    const files = {};
-    const totalBytes = contentLength;
-    let unmappedBytes = totalBytes;
-    const lastGeneratedColumnMap = computeLastGeneratedColumnMap(script.sourceMap);
-    for (const mapping of map.mappings()) {
-        const source = mapping.sourceURL;
-        const lineNum = mapping.lineNumber;
-        const colNum = mapping.columnNumber;
-        const lastColNum = lastGeneratedColumnMap.get(mapping);
-        // Webpack sometimes emits null mappings.
-        // https://github.com/mozilla/source-map/pull/303
-        if (!source) {
-            continue;
-        }
-        // Lines and columns are zero-based indices. Visually, lines are shown as a 1-based index.
-        const line = lines[lineNum];
-        if (line === null || line === undefined) {
-            const errorMessage = `${map.url()} mapping for line out of bounds: ${lineNum + 1}`;
-            return { errorMessage };
-        }
-        if (colNum > line.length) {
-            const errorMessage = `${map.url()} mapping for column out of bounds: ${lineNum + 1}:${colNum}`;
-            return { errorMessage };
-        }
-        let mappingLength = 0;
-        if (lastColNum !== undefined) {
-            if (lastColNum > line.length) {
-                const errorMessage = `${map.url()} mapping for last column out of bounds: ${lineNum + 1}:${lastColNum}`;
-                return { errorMessage };
-            }
-            mappingLength = lastColNum - colNum;
-        }
-        else {
-            // Add +1 to account for the newline.
-            mappingLength = line.length - colNum + 1;
-        }
-        files[source] = (files[source] || 0) + mappingLength;
-        unmappedBytes -= mappingLength;
-    }
-    return {
-        files,
-        unmappedBytes,
-        totalBytes,
-    };
-}
 export function normalizeSource(source) {
     // Trim trailing question mark - b/c webpack.
     source = source.replace(/\?$/, '');
@@ -111,33 +56,66 @@ export function normalizeDuplication(duplication) {
         data.estimatedDuplicateBytes = data.duplicates.slice(1).reduce((acc, cur) => acc + cur.attributedSize, 0);
     }
 }
-function computeLastGeneratedColumnMap(map) {
-    const result = new Map();
-    const mappings = map.mappings();
-    for (let i = 0; i < mappings.length - 1; i++) {
-        const mapping = mappings[i];
-        const nextMapping = mappings[i + 1];
-        if (mapping.lineNumber === nextMapping.lineNumber) {
-            result.set(mapping, nextMapping.columnNumber);
+function indexOfOrLength(haystack, needle, startPosition = 0) {
+    const index = haystack.indexOf(needle, startPosition);
+    return index === -1 ? haystack.length : index;
+}
+export function getNodeModuleName(source) {
+    const sourceSplit = source.split('node_modules/');
+    source = sourceSplit[sourceSplit.length - 1];
+    const indexFirstSlash = indexOfOrLength(source, '/');
+    if (source[0] === '@') {
+        return source.slice(0, indexOfOrLength(source, '/', indexFirstSlash + 1));
+    }
+    return source.slice(0, indexFirstSlash);
+}
+function groupByNodeModules(duplication) {
+    const groupedDuplication = new Map();
+    for (const [source, data] of duplication) {
+        if (!source.includes('node_modules')) {
+            groupedDuplication.set(source, data);
+            continue;
+        }
+        const nodeModuleKey = 'node_modules/' + getNodeModuleName(source);
+        const aggregatedData = groupedDuplication.get(nodeModuleKey) ?? {
+            duplicates: [],
+            // This is calculated in normalizeDuplication.
+            estimatedDuplicateBytes: 0,
+        };
+        groupedDuplication.set(nodeModuleKey, aggregatedData);
+        for (const { script, attributedSize } of data.duplicates) {
+            let duplicate = aggregatedData.duplicates.find(d => d.script === script);
+            if (!duplicate) {
+                duplicate = { script, attributedSize: 0 };
+                aggregatedData.duplicates.push(duplicate);
+            }
+            duplicate.attributedSize += attributedSize;
         }
     }
-    // Now, all but the last mapping on each line will have 'lastColumnNumber' set to a number.
-    return result;
+    return groupedDuplication;
 }
 /**
- * Returns a @see ScriptDuplication for the given collection of script contents + source maps.
+ * Sort by estimated savings.
  */
-export function computeScriptDuplication(scriptsData) {
-    const sizesMap = new Map();
-    for (const script of scriptsData.scripts) {
-        if (script.content && script.sourceMap) {
-            sizesMap.set(script, computeGeneratedFileSizes(script));
-        }
-    }
+function sorted(duplication) {
+    return new Map([...duplication].sort((a, b) => b[1].estimatedDuplicateBytes - a[1].estimatedDuplicateBytes));
+}
+/**
+ * Returns 2 @see ScriptDuplication for the given collection of script contents + source maps:
+ *
+ * 1. `duplication` keys correspond to authored files
+ * 2. `duplication` keys correspond to authored files, except all files within the same
+ *    node_module package are aggregated under the same entry.
+ */
+export function computeScriptDuplication(scriptsData, compressionRatios) {
     const sourceDatasMap = new Map();
     // Determine size of each `sources` entry.
-    for (const [script, sizes] of sizesMap) {
-        if (!script.sourceMap) {
+    for (const script of scriptsData.scripts) {
+        if (!script.content || !script.sourceMap) {
+            continue;
+        }
+        const sizes = Handlers.ModelHandlers.Scripts.getScriptGeneratedSizes(script);
+        if (!sizes) {
             continue;
         }
         if ('errorMessage' in sizes) {
@@ -166,14 +144,20 @@ export function computeScriptDuplication(scriptsData) {
                 data = { estimatedDuplicateBytes: 0, duplicates: [] };
                 duplication.set(sourceData.source, data);
             }
+            const compressionRatio = script.request ? compressionRatios.get(script.request?.args.data.requestId) ?? 1 : 1;
+            const transferSize = Math.round(sourceData.resourceSize * compressionRatio);
             data.duplicates.push({
                 script,
-                attributedSize: sourceData.resourceSize,
+                attributedSize: transferSize,
             });
         }
     }
+    const duplicationGroupedByNodeModules = groupByNodeModules(duplication);
     normalizeDuplication(duplication);
-    // Sort by estimated savings.
-    return new Map([...duplication].sort((a, b) => b[1].estimatedDuplicateBytes - a[1].estimatedDuplicateBytes));
+    normalizeDuplication(duplicationGroupedByNodeModules);
+    return {
+        duplication: sorted(duplication),
+        duplicationGroupedByNodeModules: sorted(duplicationGroupedByNodeModules),
+    };
 }
 //# sourceMappingURL=ScriptDuplication.js.map

package/models/trace/extras/ScriptDuplication.js.map

@@ -1 +1 @@
-{"version":3,"file":"ScriptDuplication.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/ScriptDuplication.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAK7B,qDAAqD;AACrD,MAAM,6BAA6B,GAAG,IAAI,GAAG,GAAG,CAAC;AACjD,sEAAsE;AACtE,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAMpC;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,MAA6C;IACrF,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC;IAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC;IACrC,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC;IACrC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,KAAK,GAA2B,EAAE,CAAC;IACzC,MAAM,UAAU,GAAG,aAAa,CAAC;IACjC,IAAI,aAAa,GAAG,UAAU,CAAC;IAE/B,MAAM,sBAAsB,GAAG,6BAA6B,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAE/E,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;QACjC,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC;QACnC,MAAM,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;QACpC,MAAM,UAAU,GAAG,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAEvD,yCAAyC;QACzC,iDAAiD;QACjD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,SAAS;QACX,CAAC;QAED,0FAA0F;QAE1F,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,oCAAoC,OAAO,GAAG,CAAC,EAAE,CAAC;YACnF,OAAO,EAAC,YAAY,EAAC,CAAC;QACxB,CAAC;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,YAAY,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,sCAAsC,OAAO,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;YAC/F,OAAO,EAAC,YAAY,EAAC,CAAC;QACxB,CAAC;QAED,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,YAAY,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,2CAA2C,OAAO,GAAG,CAAC,IAAI,UAAU,EAAE,CAAC;gBACxG,OAAO,EAAC,YAAY,EAAC,CAAC;YACxB,CAAC;YACD,aAAa,GAAG,UAAU,GAAG,MAAM,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,qCAAqC;YACrC,aAAa,GAAG,IAAI,CAAC,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC;QACrD,aAAa,IAAI,aAAa,CAAC;IACjC,CAAC;IAED,OAAO;QACL,KAAK;QACL,aAAa;QACb,UAAU;KACX,CAAC;AACJ,CAAC;AAOD,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,6CAA6C;IAC7C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAEnC,6FAA6F;IAC7F,MAAM,oBAAoB,GAAG,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;IAChE,IAAI,oBAAoB,KAAK,CAAC,CAAC,EAAE,CAAC;QAChC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAc;IACxC,0BAA0B;IAC1B,IAAI,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yFAAyF;IACzF,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAiCD;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,WAA8B;IACjE,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;QACtC,yBAAyB;QACzB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;QAEpE,mDAAmD;QACnD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,mBAAmB,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;YAC9D,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;gBACnD,MAAM,WAAW,GAAG,SAAS,CAAC,cAAc,GAAG,mBAAmB,CAAC;gBACnE,OAAO,WAAW,IAAI,uBAAuB,CAAC;YAChD,CAAC,CAAC,CAAC;QACL,CAAC;QAED,qDAAqD;QACrD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,CAAC,cAAc,IAAI,6BAA6B,CAAC,CAAC;QAEjH,mDAAmD;QACnD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAChC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAC5G,CAAC;AACH,CAAC;AAED,SAAS,6BAA6B,CAAC,GAA4B;IACjE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwC,CAAC;IAE/D,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,OAAO,CAAC,UAAU,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,YAAY,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,2FAA2F;IAC3F,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CAAC,WAAuD;IAC9F,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6D,CAAC;IACtF,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,OAAO,EAAE,CAAC;QACzC,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACvC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAAuD,CAAC;IAEtF,0CAA0C;IAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YACtB,SAAS;QACX,CAAC;QAED,IAAI,cAAc,IAAI,KAAK,EAAE,CAAC;YAC5B,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QAED,MAAM,eAAe,GAAiB,EAAE,CAAC;QACzC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAE5C,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,SAAS;YACX,CAAC;YAED,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,eAAe,CAAC,IAAI,CAAC;gBACnB,MAAM,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,YAAY,EAAE,UAAU;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAsB,IAAI,GAAG,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,IAAI,cAAc,EAAE,CAAC;QACvD,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;YACzC,IAAI,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,EAAC,uBAAuB,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAC,CAAC;gBACpD,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;gBACnB,MAAM;gBACN,cAAc,EAAE,UAAU,CAAC,YAAY;aACxC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,oBAAoB,CAAC,WAAW,CAAC,CAAC;IAElC,6BAA6B;IAC7B,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC;AAC/G,CAAC","sourcesContent":["// Copyright 2025 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 SDK from '../../../core/sdk/sdk.js';\nimport type * as Handlers from '../handlers/handlers.js';\n\n// Ignore modules smaller than an absolute threshold.\nconst ABSOLUTE_SIZE_THRESHOLD_BYTES = 1024 * 0.5;\n// Ignore modules smaller than a % size of largest copy of the module.\nconst RELATIVE_SIZE_THRESHOLD = 0.1;\n\ntype GeneratedFileSizes = {\n  errorMessage: string,\n}|{files: Record<string, number>, unmappedBytes: number, totalBytes: number};\n\n/**\n * Using a script's contents and source map, attribute every generated byte to an authored source file.\n */\nexport function computeGeneratedFileSizes(script: Handlers.ModelHandlers.Scripts.Script): GeneratedFileSizes {\n  if (!script.sourceMap) {\n    throw new Error('expected source map');\n  }\n\n  const map = script.sourceMap;\n  const content = script.content ?? '';\n  const contentLength = content.length;\n  const lines = content.split('\\n');\n  const files: Record<string, number> = {};\n  const totalBytes = contentLength;\n  let unmappedBytes = totalBytes;\n\n  const lastGeneratedColumnMap = computeLastGeneratedColumnMap(script.sourceMap);\n\n  for (const mapping of map.mappings()) {\n    const source = mapping.sourceURL;\n    const lineNum = mapping.lineNumber;\n    const colNum = mapping.columnNumber;\n    const lastColNum = lastGeneratedColumnMap.get(mapping);\n\n    // Webpack sometimes emits null mappings.\n    // https://github.com/mozilla/source-map/pull/303\n    if (!source) {\n      continue;\n    }\n\n    // Lines and columns are zero-based indices. Visually, lines are shown as a 1-based index.\n\n    const line = lines[lineNum];\n    if (line === null || line === undefined) {\n      const errorMessage = `${map.url()} mapping for line out of bounds: ${lineNum + 1}`;\n      return {errorMessage};\n    }\n\n    if (colNum > line.length) {\n      const errorMessage = `${map.url()} mapping for column out of bounds: ${lineNum + 1}:${colNum}`;\n      return {errorMessage};\n    }\n\n    let mappingLength = 0;\n    if (lastColNum !== undefined) {\n      if (lastColNum > line.length) {\n        const errorMessage = `${map.url()} mapping for last column out of bounds: ${lineNum + 1}:${lastColNum}`;\n        return {errorMessage};\n      }\n      mappingLength = lastColNum - colNum;\n    } else {\n      // Add +1 to account for the newline.\n      mappingLength = line.length - colNum + 1;\n    }\n    files[source] = (files[source] || 0) + mappingLength;\n    unmappedBytes -= mappingLength;\n  }\n\n  return {\n    files,\n    unmappedBytes,\n    totalBytes,\n  };\n}\n\ninterface SourceData {\n  source: string;\n  resourceSize: number;\n}\n\nexport function normalizeSource(source: string): string {\n  // Trim trailing question mark - b/c webpack.\n  source = source.replace(/\\?$/, '');\n\n  // Normalize paths for dependencies by only keeping everything after the last `node_modules`.\n  const lastNodeModulesIndex = source.lastIndexOf('node_modules');\n  if (lastNodeModulesIndex !== -1) {\n    source = source.substring(lastNodeModulesIndex);\n  }\n\n  return source;\n}\n\nfunction shouldIgnoreSource(source: string): boolean {\n  // Ignore bundle overhead.\n  if (source.includes('webpack/bootstrap')) {\n    return true;\n  }\n  if (source.includes('(webpack)/buildin')) {\n    return true;\n  }\n\n  // Ignore webpack module shims, i.e. aliases of the form `module.exports = window.jQuery`\n  if (source.includes('external ')) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * The key is a source map `sources` entry (these are URLs/file paths), but normalized\n * via `normalizeSource`.\n *\n * The value is an object with an entry for every script that has a source map which\n * denotes that this source was used, along with the estimated resource size it takes\n * up in the script.\n */\nexport type ScriptDuplication = Map<string, {\n  /**\n   * This is the sum of all (but one) `attributedSize` in `scripts`.\n   *\n   * One copy of this module is treated as the canonical version - the rest will\n   * have non-zero `wastedBytes`. The canonical copy is the first entry of\n   * `scripts`.\n   *\n   * In the case of all copies being the same version, all sizes are\n   * equal and the selection doesn't matter (ignoring compression ratios). When\n   * the copies are different versions, it does matter. Ideally the newest\n   * version would be the canonical copy, but version information is not present.\n   * Instead, size is used as a heuristic for latest version. This makes the\n   * value here conserative in its estimation.\n   */\n  estimatedDuplicateBytes: number,\n  duplicates: Array<{\n    script: Handlers.ModelHandlers.Scripts.Script,\n    /** The number of bytes in the script bundle that map back to this module. */\n    attributedSize: number,\n  }>,\n}>;\n\n/**\n * Sorts each array within @see ScriptDuplication by attributedSize, drops information\n * on sources that are too small, and calculates esimatedDuplicateBytes.\n */\nexport function normalizeDuplication(duplication: ScriptDuplication): void {\n  for (const [key, data] of duplication) {\n    // Sort by resource size.\n    data.duplicates.sort((a, b) => b.attributedSize - a.attributedSize);\n\n    // Ignore modules smaller than a % size of largest.\n    if (data.duplicates.length > 1) {\n      const largestResourceSize = data.duplicates[0].attributedSize;\n      data.duplicates = data.duplicates.filter(duplicate => {\n        const percentSize = duplicate.attributedSize / largestResourceSize;\n        return percentSize >= RELATIVE_SIZE_THRESHOLD;\n      });\n    }\n\n    // Ignore modules smaller than an absolute threshold.\n    data.duplicates = data.duplicates.filter(duplicate => duplicate.attributedSize >= ABSOLUTE_SIZE_THRESHOLD_BYTES);\n\n    // Delete any that now don't have multiple entries.\n    if (data.duplicates.length <= 1) {\n      duplication.delete(key);\n      continue;\n    }\n\n    data.estimatedDuplicateBytes = data.duplicates.slice(1).reduce((acc, cur) => acc + cur.attributedSize, 0);\n  }\n}\n\nfunction computeLastGeneratedColumnMap(map: SDK.SourceMap.SourceMap): Map<SDK.SourceMap.SourceMapEntry, number> {\n  const result = new Map<SDK.SourceMap.SourceMapEntry, number>();\n\n  const mappings = map.mappings();\n  for (let i = 0; i < mappings.length - 1; i++) {\n    const mapping = mappings[i];\n    const nextMapping = mappings[i + 1];\n    if (mapping.lineNumber === nextMapping.lineNumber) {\n      result.set(mapping, nextMapping.columnNumber);\n    }\n  }\n\n  // Now, all but the last mapping on each line will have 'lastColumnNumber' set to a number.\n  return result;\n}\n\n/**\n * Returns a @see ScriptDuplication for the given collection of script contents + source maps.\n */\nexport function computeScriptDuplication(scriptsData: Handlers.ModelHandlers.Scripts.ScriptsData): ScriptDuplication {\n  const sizesMap = new Map<Handlers.ModelHandlers.Scripts.Script, GeneratedFileSizes>();\n  for (const script of scriptsData.scripts) {\n    if (script.content && script.sourceMap) {\n      sizesMap.set(script, computeGeneratedFileSizes(script));\n    }\n  }\n\n  const sourceDatasMap = new Map<Handlers.ModelHandlers.Scripts.Script, SourceData[]>();\n\n  // Determine size of each `sources` entry.\n  for (const [script, sizes] of sizesMap) {\n    if (!script.sourceMap) {\n      continue;\n    }\n\n    if ('errorMessage' in sizes) {\n      console.error(sizes.errorMessage);\n      continue;\n    }\n\n    const sourceDataArray: SourceData[] = [];\n    sourceDatasMap.set(script, sourceDataArray);\n\n    const sources = script.sourceMap.sourceURLs();\n    for (let i = 0; i < sources.length; i++) {\n      if (shouldIgnoreSource(sources[i])) {\n        continue;\n      }\n\n      const sourceSize = sizes.files[sources[i]];\n      sourceDataArray.push({\n        source: normalizeSource(sources[i]),\n        resourceSize: sourceSize,\n      });\n    }\n  }\n\n  const duplication: ScriptDuplication = new Map();\n  for (const [script, sourceDataArray] of sourceDatasMap) {\n    for (const sourceData of sourceDataArray) {\n      let data = duplication.get(sourceData.source);\n      if (!data) {\n        data = {estimatedDuplicateBytes: 0, duplicates: []};\n        duplication.set(sourceData.source, data);\n      }\n      data.duplicates.push({\n        script,\n        attributedSize: sourceData.resourceSize,\n      });\n    }\n  }\n\n  normalizeDuplication(duplication);\n\n  // Sort by estimated savings.\n  return new Map([...duplication].sort((a, b) => b[1].estimatedDuplicateBytes - a[1].estimatedDuplicateBytes));\n}\n"]}
+{"version":3,"file":"ScriptDuplication.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/ScriptDuplication.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,QAAQ,MAAM,yBAAyB,CAAC;AAEpD,qDAAqD;AACrD,MAAM,6BAA6B,GAAG,IAAI,GAAG,GAAG,CAAC;AACjD,sEAAsE;AACtE,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAOpC,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,6CAA6C;IAC7C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAEnC,6FAA6F;IAC7F,MAAM,oBAAoB,GAAG,MAAM,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;IAChE,IAAI,oBAAoB,KAAK,CAAC,CAAC,EAAE,CAAC;QAChC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAc;IACxC,0BAA0B;IAC1B,IAAI,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yFAAyF;IACzF,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAoCD;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,WAA8B;IACjE,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;QACtC,yBAAyB;QACzB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;QAEpE,mDAAmD;QACnD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,mBAAmB,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;YAC9D,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;gBACnD,MAAM,WAAW,GAAG,SAAS,CAAC,cAAc,GAAG,mBAAmB,CAAC;gBACnE,OAAO,WAAW,IAAI,uBAAuB,CAAC;YAChD,CAAC,CAAC,CAAC;QACL,CAAC;QAED,qDAAqD;QACrD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,CAAC,cAAc,IAAI,6BAA6B,CAAC,CAAC;QAEjH,mDAAmD;QACnD,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAChC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAC5G,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,QAAgB,EAAE,MAAc,EAAE,aAAa,GAAG,CAAC;IAC1E,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAClD,MAAM,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE7C,MAAM,eAAe,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACrD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,kBAAkB,CAAC,WAA8B;IACxD,MAAM,kBAAkB,GAAsB,IAAI,GAAG,EAAE,CAAC;IACxD,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YACrC,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACrC,SAAS;QACX,CAAC;QAED,MAAM,aAAa,GAAG,eAAe,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAClE,MAAM,cAAc,GAAG,kBAAkB,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI;YAC9D,UAAU,EAAE,EAAE;YACd,8CAA8C;YAC9C,uBAAuB,EAAE,CAAC;SAC3B,CAAC;QACF,kBAAkB,CAAC,GAAG,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAEtD,KAAK,MAAM,EAAC,MAAM,EAAE,cAAc,EAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvD,IAAI,SAAS,GAAG,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;YACzE,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,SAAS,GAAG,EAAC,MAAM,EAAE,cAAc,EAAE,CAAC,EAAC,CAAC;gBACxC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC5C,CAAC;YACD,SAAS,CAAC,cAAc,IAAI,cAAc,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,SAAS,MAAM,CAAC,WAA8B;IAC5C,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC;AAC/G,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACpC,WAAuD,EAAE,iBAAsC;IAEjG,MAAM,cAAc,GAAG,IAAI,GAAG,EAAuD,CAAC;IAEtF,0CAA0C;IAC1C,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,OAAO,EAAE,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YACzC,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;QAC7E,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QAED,IAAI,cAAc,IAAI,KAAK,EAAE,CAAC;YAC5B,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QAED,MAAM,eAAe,GAAiB,EAAE,CAAC;QACzC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAE5C,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,SAAS;YACX,CAAC;YAED,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,eAAe,CAAC,IAAI,CAAC;gBACnB,MAAM,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,YAAY,EAAE,UAAU;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,WAAW,GAAsB,IAAI,GAAG,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,IAAI,cAAc,EAAE,CAAC;QACvD,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;YACzC,IAAI,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,EAAC,uBAAuB,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAC,CAAC;gBACpD,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9G,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,YAAY,GAAG,gBAAgB,CAAC,CAAC;YAC5E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;gBACnB,MAAM;gBACN,cAAc,EAAE,YAAY;aAC7B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,+BAA+B,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IAExE,oBAAoB,CAAC,WAAW,CAAC,CAAC;IAClC,oBAAoB,CAAC,+BAA+B,CAAC,CAAC;IAEtD,OAAO;QACL,WAAW,EAAE,MAAM,CAAC,WAAW,CAAC;QAChC,+BAA+B,EAAE,MAAM,CAAC,+BAA+B,CAAC;KACzE,CAAC;AACJ,CAAC","sourcesContent":["// Copyright 2025 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 Handlers from '../handlers/handlers.js';\n\n// Ignore modules smaller than an absolute threshold.\nconst ABSOLUTE_SIZE_THRESHOLD_BYTES = 1024 * 0.5;\n// Ignore modules smaller than a % size of largest copy of the module.\nconst RELATIVE_SIZE_THRESHOLD = 0.1;\n\ninterface SourceData {\n  source: string;\n  resourceSize: number;\n}\n\nexport function normalizeSource(source: string): string {\n  // Trim trailing question mark - b/c webpack.\n  source = source.replace(/\\?$/, '');\n\n  // Normalize paths for dependencies by only keeping everything after the last `node_modules`.\n  const lastNodeModulesIndex = source.lastIndexOf('node_modules');\n  if (lastNodeModulesIndex !== -1) {\n    source = source.substring(lastNodeModulesIndex);\n  }\n\n  return source;\n}\n\nfunction shouldIgnoreSource(source: string): boolean {\n  // Ignore bundle overhead.\n  if (source.includes('webpack/bootstrap')) {\n    return true;\n  }\n  if (source.includes('(webpack)/buildin')) {\n    return true;\n  }\n\n  // Ignore webpack module shims, i.e. aliases of the form `module.exports = window.jQuery`\n  if (source.includes('external ')) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * The key is a source map `sources` entry (these are URLs/file paths), but normalized\n * via `normalizeSource`.\n *\n * The value is an object with an entry for every script that has a source map which\n * denotes that this source was used, along with the estimated resource size it takes\n * up in the script.\n */\nexport type ScriptDuplication = Map<string, {\n  /**\n   * This is the sum of all (but one) `attributedSize` in `scripts`.\n   *\n   * One copy of this module is treated as the canonical version - the rest will\n   * have non-zero `wastedBytes`. The canonical copy is the first entry of\n   * `scripts`.\n   *\n   * In the case of all copies being the same version, all sizes are\n   * equal and the selection doesn't matter (ignoring compression ratios). When\n   * the copies are different versions, it does matter. Ideally the newest\n   * version would be the canonical copy, but version information is not present.\n   * Instead, size is used as a heuristic for latest version. This makes the\n   * value here conserative in its estimation.\n   */\n  estimatedDuplicateBytes: number,\n  duplicates: Array<{\n    script: Handlers.ModelHandlers.Scripts.Script,\n    /**\n     * The number of bytes in the script bundle that map back to this module,\n     * in terms of estimated impact on transfer size.\n     */\n    attributedSize: number,\n  }>,\n}>;\n\n/**\n * Sorts each array within @see ScriptDuplication by attributedSize, drops information\n * on sources that are too small, and calculates esimatedDuplicateBytes.\n */\nexport function normalizeDuplication(duplication: ScriptDuplication): void {\n  for (const [key, data] of duplication) {\n    // Sort by resource size.\n    data.duplicates.sort((a, b) => b.attributedSize - a.attributedSize);\n\n    // Ignore modules smaller than a % size of largest.\n    if (data.duplicates.length > 1) {\n      const largestResourceSize = data.duplicates[0].attributedSize;\n      data.duplicates = data.duplicates.filter(duplicate => {\n        const percentSize = duplicate.attributedSize / largestResourceSize;\n        return percentSize >= RELATIVE_SIZE_THRESHOLD;\n      });\n    }\n\n    // Ignore modules smaller than an absolute threshold.\n    data.duplicates = data.duplicates.filter(duplicate => duplicate.attributedSize >= ABSOLUTE_SIZE_THRESHOLD_BYTES);\n\n    // Delete any that now don't have multiple entries.\n    if (data.duplicates.length <= 1) {\n      duplication.delete(key);\n      continue;\n    }\n\n    data.estimatedDuplicateBytes = data.duplicates.slice(1).reduce((acc, cur) => acc + cur.attributedSize, 0);\n  }\n}\n\nfunction indexOfOrLength(haystack: string, needle: string, startPosition = 0): number {\n  const index = haystack.indexOf(needle, startPosition);\n  return index === -1 ? haystack.length : index;\n}\n\nexport function getNodeModuleName(source: string): string {\n  const sourceSplit = source.split('node_modules/');\n  source = sourceSplit[sourceSplit.length - 1];\n\n  const indexFirstSlash = indexOfOrLength(source, '/');\n  if (source[0] === '@') {\n    return source.slice(0, indexOfOrLength(source, '/', indexFirstSlash + 1));\n  }\n\n  return source.slice(0, indexFirstSlash);\n}\n\nfunction groupByNodeModules(duplication: ScriptDuplication): ScriptDuplication {\n  const groupedDuplication: ScriptDuplication = new Map();\n  for (const [source, data] of duplication) {\n    if (!source.includes('node_modules')) {\n      groupedDuplication.set(source, data);\n      continue;\n    }\n\n    const nodeModuleKey = 'node_modules/' + getNodeModuleName(source);\n    const aggregatedData = groupedDuplication.get(nodeModuleKey) ?? {\n      duplicates: [],\n      // This is calculated in normalizeDuplication.\n      estimatedDuplicateBytes: 0,\n    };\n    groupedDuplication.set(nodeModuleKey, aggregatedData);\n\n    for (const {script, attributedSize} of data.duplicates) {\n      let duplicate = aggregatedData.duplicates.find(d => d.script === script);\n      if (!duplicate) {\n        duplicate = {script, attributedSize: 0};\n        aggregatedData.duplicates.push(duplicate);\n      }\n      duplicate.attributedSize += attributedSize;\n    }\n  }\n\n  return groupedDuplication;\n}\n\n/**\n * Sort by estimated savings.\n */\nfunction sorted(duplication: ScriptDuplication): ScriptDuplication {\n  return new Map([...duplication].sort((a, b) => b[1].estimatedDuplicateBytes - a[1].estimatedDuplicateBytes));\n}\n\n/**\n * Returns 2 @see ScriptDuplication for the given collection of script contents + source maps:\n *\n * 1. `duplication` keys correspond to authored files\n * 2. `duplication` keys correspond to authored files, except all files within the same\n *    node_module package are aggregated under the same entry.\n */\nexport function computeScriptDuplication(\n    scriptsData: Handlers.ModelHandlers.Scripts.ScriptsData, compressionRatios: Map<string, number>):\n    {duplication: ScriptDuplication, duplicationGroupedByNodeModules: ScriptDuplication} {\n  const sourceDatasMap = new Map<Handlers.ModelHandlers.Scripts.Script, SourceData[]>();\n\n  // Determine size of each `sources` entry.\n  for (const script of scriptsData.scripts) {\n    if (!script.content || !script.sourceMap) {\n      continue;\n    }\n\n    const sizes = Handlers.ModelHandlers.Scripts.getScriptGeneratedSizes(script);\n    if (!sizes) {\n      continue;\n    }\n\n    if ('errorMessage' in sizes) {\n      console.error(sizes.errorMessage);\n      continue;\n    }\n\n    const sourceDataArray: SourceData[] = [];\n    sourceDatasMap.set(script, sourceDataArray);\n\n    const sources = script.sourceMap.sourceURLs();\n    for (let i = 0; i < sources.length; i++) {\n      if (shouldIgnoreSource(sources[i])) {\n        continue;\n      }\n\n      const sourceSize = sizes.files[sources[i]];\n      sourceDataArray.push({\n        source: normalizeSource(sources[i]),\n        resourceSize: sourceSize,\n      });\n    }\n  }\n\n  const duplication: ScriptDuplication = new Map();\n  for (const [script, sourceDataArray] of sourceDatasMap) {\n    for (const sourceData of sourceDataArray) {\n      let data = duplication.get(sourceData.source);\n      if (!data) {\n        data = {estimatedDuplicateBytes: 0, duplicates: []};\n        duplication.set(sourceData.source, data);\n      }\n      const compressionRatio = script.request ? compressionRatios.get(script.request?.args.data.requestId) ?? 1 : 1;\n      const transferSize = Math.round(sourceData.resourceSize * compressionRatio);\n      data.duplicates.push({\n        script,\n        attributedSize: transferSize,\n      });\n    }\n  }\n\n  const duplicationGroupedByNodeModules = groupByNodeModules(duplication);\n\n  normalizeDuplication(duplication);\n  normalizeDuplication(duplicationGroupedByNodeModules);\n\n  return {\n    duplication: sorted(duplication),\n    duplicationGroupedByNodeModules: sorted(duplicationGroupedByNodeModules),\n  };\n}\n"]}

package/models/trace/extras/StackTraceForEvent.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 Helpers from '../helpers/helpers.js';
 import * as Types from '../types/types.js';
 export const stackTraceForEventInTrace = new Map();
 export function clearCacheForTrace(parsedTrace) {
@@ -23,20 +24,23 @@ export function get(event, parsedTrace) {
         return resultFromCache;
     }
     let result = null;
-    if (Types.Events.isProfileCall(event)) {
-        result = getForProfileCall(event, parsedTrace);
-    }
-    else if (Types.Extensions.isSyntheticExtensionEntry(event)) {
+    if (Types.Extensions.isSyntheticExtensionEntry(event)) {
         result = getForExtensionEntry(event, parsedTrace);
     }
-    else if (Types.Events.isUserTiming(event)) {
-        result = getForUserTiming(event, parsedTrace);
+    else if (Types.Events.isPerformanceMeasureBegin(event)) {
+        result = getForPerformanceMeasure(event, parsedTrace);
     }
-    else if (Types.Events.isLayout(event) || Types.Events.isUpdateLayoutTree(event)) {
-        const node = parsedTrace.Renderer.entryToNode.get(event);
-        const parent = node?.parent?.entry;
-        if (parent) {
-            result = get(parent, parsedTrace);
+    else {
+        result = getForEvent(event, parsedTrace);
+        const maybeProtocolCallFrame = getPayloadStackAsProtocolCallFrame(event);
+        if (result && maybeProtocolCallFrame && !isNativeJSFunction(maybeProtocolCallFrame)) {
+            // If the event has a payload stack trace, replace the top frame
+            // of the calculated stack with the top frame of the payload stack
+            // because trace payload call frames contain call locations, unlike
+            // profile call frames (which contain function declaration locations).
+            // This way the user knows which exact JS location triggered an
+            // event.
+            result.callFrames[0] = maybeProtocolCallFrame;
         }
     }
     if (result) {
@@ -44,21 +48,36 @@ export function get(event, parsedTrace) {
     }
     return result;
 }
-function getForProfileCall(event, parsedTrace) {
+/**
+ * Fallback method to obtain a stack trace using the parsed event tree
+ * hierarchy. This shouldn't be called outside of this file, use `get`
+ * instead to ensure the correct event in the tree hierarchy is used.
+ */
+function getForEvent(event, parsedTrace) {
     // When working with a CPU profile the renderer handler won't have
     // entries in its tree.
     const entryToNode = parsedTrace.Renderer.entryToNode.size > 0 ? parsedTrace.Renderer.entryToNode : parsedTrace.Samples.entryToNode;
     const topStackTrace = { callFrames: [] };
     let stackTrace = topStackTrace;
-    let currentEntry = event;
+    let currentEntry;
     let node = entryToNode.get(event);
     const traceCache = stackTraceForEventInTrace.get(parsedTrace) || new Map();
     stackTraceForEventInTrace.set(parsedTrace, traceCache);
-    // Move up this node's ancestor tree appending frames to its
-    // stack trace.
+    // Move up this node's ancestor tree appending JS frames to its
+    // stack trace. If an async caller is detected, move up in the async
+    // stack instead.
     while (node) {
         if (!Types.Events.isProfileCall(node.entry)) {
-            node = node.parent;
+            const maybeAsyncParent = parsedTrace.AsyncJSCalls.runEntryPointToScheduler.get(node.entry);
+            if (!maybeAsyncParent) {
+                node = node.parent;
+                continue;
+            }
+            const maybeAsyncParentNode = maybeAsyncParent && entryToNode.get(maybeAsyncParent.scheduler);
+            if (maybeAsyncParentNode) {
+                stackTrace = addAsyncParentToStack(stackTrace, maybeAsyncParent.taskName);
+                node = maybeAsyncParentNode;
+            }
             continue;
         }
         currentEntry = node.entry;
@@ -83,18 +102,7 @@ function getForProfileCall(event, parsedTrace) {
         const maybeAsyncParentEvent = parsedTrace.AsyncJSCalls.asyncCallToScheduler.get(currentEntry);
         const maybeAsyncParentNode = maybeAsyncParentEvent && entryToNode.get(maybeAsyncParentEvent.scheduler);
         if (maybeAsyncParentNode) {
-            // The Protocol.Runtime.StackTrace type is recursive, so we
-            // move one level deeper in it as we walk up the ancestor tree.
-            stackTrace.parent = { callFrames: [] };
-            stackTrace = stackTrace.parent;
-            // Note: this description effectively corresponds to the name
-            // of the task that scheduled the stack trace we are jumping
-            // FROM, so it would make sense that it was set to that stack
-            // trace instead of the one we are jumping TO. However, the
-            // JS presentation utils we use to present async stack traces
-            // assume the description is added to the stack trace that
-            // scheduled the async task, so we build the data that way.
-            stackTrace.description = maybeAsyncParentEvent.taskName;
+            stackTrace = addAsyncParentToStack(stackTrace, maybeAsyncParentEvent.taskName);
             node = maybeAsyncParentNode;
             continue;
         }
@@ -102,39 +110,54 @@ function getForProfileCall(event, parsedTrace) {
     }
     return topStackTrace;
 }
+function addAsyncParentToStack(stackTrace, taskName) {
+    const parent = { callFrames: [] };
+    // The Protocol.Runtime.StackTrace type is recursive, so we
+    // move one level deeper in it as we walk up the ancestor tree.
+    stackTrace.parent = parent;
+    // Note: this description effectively corresponds to the name
+    // of the task that scheduled the stack trace we are jumping
+    // FROM, so it would make sense that it was set to that stack
+    // trace instead of the one we are jumping TO. However, the
+    // JS presentation utils we use to present async stack traces
+    // assume the description is added to the stack trace that
+    // scheduled the async task, so we build the data that way.
+    parent.description = taskName;
+    return parent;
+}
 /**
  * Finds the JS call in which an extension entry was injected (the
  * code location that called the extension API), and returns its stack
  * trace.
  */
 function getForExtensionEntry(event, parsedTrace) {
-    return getForUserTiming(event.rawSourceEvent, parsedTrace);
+    const rawEvent = event.rawSourceEvent;
+    if (Types.Events.isPerformanceMeasureBegin(rawEvent)) {
+        return getForPerformanceMeasure(rawEvent, parsedTrace);
+    }
+    if (!rawEvent) {
+        return null;
+    }
+    return get(rawEvent, parsedTrace);
 }
 /**
- * Finds the JS call in which the user timing API was called and returns
- * its stack trace.
+ * Gets the raw event for a user timing and obtains its stack trace.
  */
-function getForUserTiming(event, parsedTrace) {
+function getForPerformanceMeasure(event, parsedTrace) {
     let rawEvent = event;
-    if (Types.Events.isPerformanceMeasureBegin(event)) {
-        if (event.args.traceId === undefined) {
-            return null;
-        }
-        rawEvent = parsedTrace.UserTimings.measureTraceByTraceId.get(event.args.traceId);
+    if (event.args.traceId === undefined) {
+        return null;
     }
+    // performance.measure calls dispatch 2 events: one for the call
+    // itself and another to represent the measured entry in the trace
+    // timeline. They are connected via a common traceId. At this
+    // point `rawEvent` corresponds to the second case, we must
+    // encounter the event for the call itself to obtain its callstack.
+    rawEvent = parsedTrace.UserTimings.measureTraceByTraceId.get(event.args.traceId);
     if (!rawEvent) {
         return null;
     }
-    // Look for the nearest profile call ancestor of the event tracing
-    // the call to the API.
-    let node = parsedTrace.Renderer.entryToNode.get(rawEvent);
-    while (node && !Types.Events.isProfileCall(node.entry)) {
-        node = node.parent;
-    }
-    if (node && Types.Events.isProfileCall(node.entry)) {
-        return get(node.entry, parsedTrace);
-    }
-    return null;
+    return get(rawEvent, parsedTrace);
 }
 /**
  * Determines if a function is a native JS API (like setTimeout,
@@ -148,4 +171,14 @@ function getForUserTiming(event, parsedTrace) {
 function isNativeJSFunction({ columnNumber, lineNumber, url, scriptId }) {
     return lineNumber === -1 && columnNumber === -1 && url === '' && scriptId === '0';
 }
+/**
+ * Extracts the top frame in the stack contained in a trace event's payload
+ * (if any) and casts it as a Protocol.Runtime.CallFrame.
+ */
+function getPayloadStackAsProtocolCallFrame(event) {
+    const maybeCallStack = Helpers.Trace.getZeroIndexedStackTraceInEventPayload(event);
+    const maybeCallFrame = maybeCallStack?.at(0);
+    const maybeProtocolCallFrame = maybeCallFrame && { ...maybeCallFrame, scriptId: String(maybeCallFrame.scriptId) };
+    return maybeProtocolCallFrame || null;
+}
 //# sourceMappingURL=StackTraceForEvent.js.map

package/models/trace/extras/StackTraceForEvent.js.map

@@ -1 +1 @@
-{"version":3,"file":"StackTraceForEvent.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/StackTraceForEvent.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAK7B,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAE3C,MAAM,CAAC,MAAM,yBAAyB,GAClC,IAAI,GAAG,EAAoF,CAAC;AAEhG,MAAM,UAAU,kBAAkB,CAAC,WAAuC;IACxE,yBAAyB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;AAChD,CAAC;AACD;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CAAC,KAAyB,EAAE,WAAuC;IAEpF,IAAI,aAAa,GAAG,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/D,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,yBAAyB,CAAC,GAAG,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjD,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,IAAI,MAAM,GAAqC,IAAI,CAAC;IACpD,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,GAAG,iBAAiB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACjD,CAAC;SAAM,IAAI,KAAK,CAAC,UAAU,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7D,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACpD,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5C,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAChD,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;QAClF,MAAM,IAAI,GAAG,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC;QACnC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,IAAI,MAAM,EAAE,CAAC;QACX,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,iBAAiB,CACtB,KAAwC,EAAE,WAAuC;IACnF,kEAAkE;IAClE,uBAAuB;IACvB,MAAM,WAAW,GACb,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC;IACnH,MAAM,aAAa,GAAgC,EAAC,UAAU,EAAE,EAAE,EAAC,CAAC;IACpE,IAAI,UAAU,GAAgC,aAAa,CAAC;IAC5D,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,IAAI,IAAI,GAAsD,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACrF,MAAM,UAAU,GACZ,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAmD,CAAC;IAC7G,yBAAyB,CAAC,GAAG,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACvD,4DAA4D;IAC5D,eAAe;IACf,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5C,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACnB,SAAS;QACX,CAAC;QAED,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,kDAAkD;QAClD,MAAM,mBAAmB,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,mBAAmB,EAAE,CAAC;YACxB,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAClH,UAAU,CAAC,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC;YAC/C,2DAA2D;YAC3D,8DAA8D;YAC9D,gEAAgE;YAChE,6DAA6D;YAC7D,uDAAuD;YACvD,4DAA4D;YAC5D,UAAU;YACV,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,WAAW,IAAI,mBAAmB,CAAC,WAAW,CAAC;YACnF,MAAM;QACR,CAAC;QAED,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;YAChD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;QACD,MAAM,qBAAqB,GAAG,WAAW,CAAC,YAAY,CAAC,oBAAoB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC9F,MAAM,oBAAoB,GAAG,qBAAqB,IAAI,WAAW,CAAC,GAAG,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QACvG,IAAI,oBAAoB,EAAE,CAAC;YACzB,2DAA2D;YAC3D,+DAA+D;YAC/D,UAAU,CAAC,MAAM,GAAG,EAAC,UAAU,EAAE,EAAE,EAAC,CAAC;YACrC,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;YAC/B,6DAA6D;YAC7D,4DAA4D;YAC5D,6DAA6D;YAC7D,2DAA2D;YAC3D,6DAA6D;YAC7D,0DAA0D;YAC1D,2DAA2D;YAC3D,UAAU,CAAC,WAAW,GAAG,qBAAqB,CAAC,QAAQ,CAAC;YACxD,IAAI,GAAG,oBAAoB,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,KAA+C,EAAE,WAAuC;IAEpH,OAAO,gBAAgB,CAAC,KAAK,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;AAC7D,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CACrB,KAA4D,EAC5D,WAAuC;IACzC,IAAI,QAAQ,GAAiC,KAAK,CAAC;IACnD,IAAI,KAAK,CAAC,MAAM,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC;QAClD,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,qBAAqB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnF,CAAC;IACD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kEAAkE;IAClE,uBAAuB;IACvB,IAAI,IAAI,GAAsD,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC7G,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACnD,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AACD;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,EAAC,YAAY,EAAE,UAAU,EAAE,GAAG,EAAE,QAAQ,EAA6B;IAC/F,OAAO,UAAU,KAAK,CAAC,CAAC,IAAI,YAAY,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,EAAE,IAAI,QAAQ,KAAK,GAAG,CAAC;AACpF,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 Protocol from '../../../generated/protocol.js';\nimport type * as Handlers from '../handlers/handlers.js';\nimport type * as Helpers from '../helpers/helpers.js';\nimport * as Types from '../types/types.js';\n\nexport const stackTraceForEventInTrace =\n    new Map<Handlers.Types.ParsedTrace, Map<Types.Events.Event, Protocol.Runtime.StackTrace>>();\n\nexport function clearCacheForTrace(parsedTrace: Handlers.Types.ParsedTrace): void {\n  stackTraceForEventInTrace.delete(parsedTrace);\n}\n/**\n * This util builds a stack trace that includes async calls for a given\n * event. It leverages data we collect from sampling to deduce sync\n * stacks and trace event instrumentation on the V8 debugger to stitch\n * them together.\n */\nexport function get(event: Types.Events.Event, parsedTrace: Handlers.Types.ParsedTrace): Protocol.Runtime.StackTrace|\n    null {\n  let cacheForTrace = stackTraceForEventInTrace.get(parsedTrace);\n  if (!cacheForTrace) {\n    cacheForTrace = new Map();\n    stackTraceForEventInTrace.set(parsedTrace, cacheForTrace);\n  }\n  const resultFromCache = cacheForTrace.get(event);\n  if (resultFromCache) {\n    return resultFromCache;\n  }\n  let result: Protocol.Runtime.StackTrace|null = null;\n  if (Types.Events.isProfileCall(event)) {\n    result = getForProfileCall(event, parsedTrace);\n  } else if (Types.Extensions.isSyntheticExtensionEntry(event)) {\n    result = getForExtensionEntry(event, parsedTrace);\n  } else if (Types.Events.isUserTiming(event)) {\n    result = getForUserTiming(event, parsedTrace);\n  } else if (Types.Events.isLayout(event) || Types.Events.isUpdateLayoutTree(event)) {\n    const node = parsedTrace.Renderer.entryToNode.get(event);\n    const parent = node?.parent?.entry;\n    if (parent) {\n      result = get(parent, parsedTrace);\n    }\n  }\n  if (result) {\n    cacheForTrace.set(event, result);\n  }\n  return result;\n}\n\nfunction getForProfileCall(\n    event: Types.Events.SyntheticProfileCall, parsedTrace: Handlers.Types.ParsedTrace): Protocol.Runtime.StackTrace {\n  // When working with a CPU profile the renderer handler won't have\n  // entries in its tree.\n  const entryToNode =\n      parsedTrace.Renderer.entryToNode.size > 0 ? parsedTrace.Renderer.entryToNode : parsedTrace.Samples.entryToNode;\n  const topStackTrace: Protocol.Runtime.StackTrace = {callFrames: []};\n  let stackTrace: Protocol.Runtime.StackTrace = topStackTrace;\n  let currentEntry = event;\n  let node: Helpers.TreeHelpers.TraceEntryNode|null|undefined = entryToNode.get(event);\n  const traceCache =\n      stackTraceForEventInTrace.get(parsedTrace) || new Map<Types.Events.Event, Protocol.Runtime.StackTrace>();\n  stackTraceForEventInTrace.set(parsedTrace, traceCache);\n  // Move up this node's ancestor tree appending frames to its\n  // stack trace.\n  while (node) {\n    if (!Types.Events.isProfileCall(node.entry)) {\n      node = node.parent;\n      continue;\n    }\n\n    currentEntry = node.entry;\n    // First check if this entry was processed before.\n    const stackTraceFromCache = traceCache.get(node.entry);\n    if (stackTraceFromCache) {\n      stackTrace.callFrames.push(...stackTraceFromCache.callFrames.filter(callFrame => !isNativeJSFunction(callFrame)));\n      stackTrace.parent = stackTraceFromCache.parent;\n      // Only set the description to the cache value if we didn't\n      // compute it in the previous iteration, since the async stack\n      // trace descriptions / taskNames is only extracted when jumping\n      // to the async parent, and that might not have happened when\n      // the cached value was computed (e.g. the cached value\n      // computation started at some point inside the parent stack\n      // trace).\n      stackTrace.description = stackTrace.description || stackTraceFromCache.description;\n      break;\n    }\n\n    if (!isNativeJSFunction(currentEntry.callFrame)) {\n      stackTrace.callFrames.push(currentEntry.callFrame);\n    }\n    const maybeAsyncParentEvent = parsedTrace.AsyncJSCalls.asyncCallToScheduler.get(currentEntry);\n    const maybeAsyncParentNode = maybeAsyncParentEvent && entryToNode.get(maybeAsyncParentEvent.scheduler);\n    if (maybeAsyncParentNode) {\n      // The Protocol.Runtime.StackTrace type is recursive, so we\n      // move one level deeper in it as we walk up the ancestor tree.\n      stackTrace.parent = {callFrames: []};\n      stackTrace = stackTrace.parent;\n      // Note: this description effectively corresponds to the name\n      // of the task that scheduled the stack trace we are jumping\n      // FROM, so it would make sense that it was set to that stack\n      // trace instead of the one we are jumping TO. However, the\n      // JS presentation utils we use to present async stack traces\n      // assume the description is added to the stack trace that\n      // scheduled the async task, so we build the data that way.\n      stackTrace.description = maybeAsyncParentEvent.taskName;\n      node = maybeAsyncParentNode;\n      continue;\n    }\n    node = node.parent;\n  }\n  return topStackTrace;\n}\n\n/**\n * Finds the JS call in which an extension entry was injected (the\n * code location that called the extension API), and returns its stack\n * trace.\n */\nfunction getForExtensionEntry(event: Types.Extensions.SyntheticExtensionEntry, parsedTrace: Handlers.Types.ParsedTrace):\n    Protocol.Runtime.StackTrace|null {\n  return getForUserTiming(event.rawSourceEvent, parsedTrace);\n}\n\n/**\n * Finds the JS call in which the user timing API was called and returns\n * its stack trace.\n */\nfunction getForUserTiming(\n    event: Types.Events.UserTiming|Types.Events.ConsoleTimeStamp,\n    parsedTrace: Handlers.Types.ParsedTrace): Protocol.Runtime.StackTrace|null {\n  let rawEvent: Types.Events.Event|undefined = event;\n  if (Types.Events.isPerformanceMeasureBegin(event)) {\n    if (event.args.traceId === undefined) {\n      return null;\n    }\n    rawEvent = parsedTrace.UserTimings.measureTraceByTraceId.get(event.args.traceId);\n  }\n  if (!rawEvent) {\n    return null;\n  }\n  // Look for the nearest profile call ancestor of the event tracing\n  // the call to the API.\n  let node: Helpers.TreeHelpers.TraceEntryNode|undefined|null = parsedTrace.Renderer.entryToNode.get(rawEvent);\n  while (node && !Types.Events.isProfileCall(node.entry)) {\n    node = node.parent;\n  }\n  if (node && Types.Events.isProfileCall(node.entry)) {\n    return get(node.entry, parsedTrace);\n  }\n  return null;\n}\n/**\n * Determines if a function is a native JS API (like setTimeout,\n * requestAnimationFrame, consoleTask.run. etc.). This is useful to\n * discard stack frames corresponding to the JS scheduler function\n * itself, since it's already being used as title of async stack traces\n * taken from the async `taskName`. This is also consistent with the\n * behaviour of the stack trace in the sources\n * panel.\n */\nfunction isNativeJSFunction({columnNumber, lineNumber, url, scriptId}: Protocol.Runtime.CallFrame): boolean {\n  return lineNumber === -1 && columnNumber === -1 && url === '' && scriptId === '0';\n}\n"]}
+{"version":3,"file":"StackTraceForEvent.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/StackTraceForEvent.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAI7B,OAAO,KAAK,OAAO,MAAM,uBAAuB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAE3C,MAAM,CAAC,MAAM,yBAAyB,GAClC,IAAI,GAAG,EAAoF,CAAC;AAEhG,MAAM,UAAU,kBAAkB,CAAC,WAAuC;IACxE,yBAAyB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;AAChD,CAAC;AACD;;;;;GAKG;AACH,MAAM,UAAU,GAAG,CAAC,KAAyB,EAAE,WAAuC;IAEpF,IAAI,aAAa,GAAG,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/D,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,yBAAyB,CAAC,GAAG,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjD,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,IAAI,MAAM,GAAqC,IAAI,CAAC;IACpD,IAAI,KAAK,CAAC,UAAU,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC;QACtD,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACpD,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,MAAM,GAAG,wBAAwB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QACzC,MAAM,sBAAsB,GAAG,kCAAkC,CAAC,KAAK,CAAC,CAAC;QACzE,IAAI,MAAM,IAAI,sBAAsB,IAAI,CAAC,kBAAkB,CAAC,sBAAsB,CAAC,EAAE,CAAC;YACpF,gEAAgE;YAChE,kEAAkE;YAClE,mEAAmE;YACnE,sEAAsE;YACtE,+DAA+D;YAC/D,SAAS;YACT,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC;QAChD,CAAC;IACH,CAAC;IACD,IAAI,MAAM,EAAE,CAAC;QACX,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,KAAyB,EAAE,WAAuC;IACrF,kEAAkE;IAClE,uBAAuB;IACvB,MAAM,WAAW,GACb,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC;IACnH,MAAM,aAAa,GAAgC,EAAC,UAAU,EAAE,EAAE,EAAC,CAAC;IACpE,IAAI,UAAU,GAAgC,aAAa,CAAC;IAC5D,IAAI,YAA+C,CAAC;IACpD,IAAI,IAAI,GAAsD,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACrF,MAAM,UAAU,GACZ,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAmD,CAAC;IAC7G,yBAAyB,CAAC,GAAG,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACvD,+DAA+D;IAC/D,oEAAoE;IACpE,iBAAiB;IACjB,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5C,MAAM,gBAAgB,GAAG,WAAW,CAAC,YAAY,CAAC,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3F,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACtB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,oBAAoB,GAAG,gBAAgB,IAAI,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YAC7F,IAAI,oBAAoB,EAAE,CAAC;gBACzB,UAAU,GAAG,qBAAqB,CAAC,UAAU,EAAE,gBAAgB,CAAC,QAAQ,CAAC,CAAC;gBAC1E,IAAI,GAAG,oBAAoB,CAAC;YAC9B,CAAC;YACD,SAAS;QACX,CAAC;QACD,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,kDAAkD;QAClD,MAAM,mBAAmB,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,mBAAmB,EAAE,CAAC;YACxB,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAClH,UAAU,CAAC,MAAM,GAAG,mBAAmB,CAAC,MAAM,CAAC;YAC/C,2DAA2D;YAC3D,8DAA8D;YAC9D,gEAAgE;YAChE,6DAA6D;YAC7D,uDAAuD;YACvD,4DAA4D;YAC5D,UAAU;YACV,UAAU,CAAC,WAAW,GAAG,UAAU,CAAC,WAAW,IAAI,mBAAmB,CAAC,WAAW,CAAC;YACnF,MAAM;QACR,CAAC;QAED,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;YAChD,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACrD,CAAC;QACD,MAAM,qBAAqB,GAAG,WAAW,CAAC,YAAY,CAAC,oBAAoB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC9F,MAAM,oBAAoB,GAAG,qBAAqB,IAAI,WAAW,CAAC,GAAG,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QACvG,IAAI,oBAAoB,EAAE,CAAC;YACzB,UAAU,GAAG,qBAAqB,CAAC,UAAU,EAAE,qBAAqB,CAAC,QAAQ,CAAC,CAAC;YAC/E,IAAI,GAAG,oBAAoB,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,SAAS,qBAAqB,CAAC,UAAuC,EAAE,QAAgB;IACtF,MAAM,MAAM,GAAgC,EAAC,UAAU,EAAE,EAAE,EAAC,CAAC;IAC7D,2DAA2D;IAC3D,+DAA+D;IAC/D,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC;IAC3B,6DAA6D;IAC7D,4DAA4D;IAC5D,6DAA6D;IAC7D,2DAA2D;IAC3D,6DAA6D;IAC7D,0DAA0D;IAC1D,2DAA2D;IAC3D,MAAM,CAAC,WAAW,GAAG,QAAQ,CAAC;IAC9B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,KAA+C,EAAE,WAAuC;IAEpH,MAAM,QAAQ,GAAuB,KAAK,CAAC,cAAc,CAAC;IAC1D,IAAI,KAAK,CAAC,MAAM,CAAC,yBAAyB,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrD,OAAO,wBAAwB,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;IACzD,CAAC;IACD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAS,wBAAwB,CAAC,KAA2C,EAAE,WAAuC;IAEpH,IAAI,QAAQ,GAAiC,KAAK,CAAC;IACnD,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,gEAAgE;IAChE,kEAAkE;IAClE,6DAA6D;IAC7D,2DAA2D;IAC3D,mEAAmE;IACnE,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,qBAAqB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjF,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AACpC,CAAC;AACD;;;;;;;;GAQG;AACH,SAAS,kBAAkB,CAAC,EAAC,YAAY,EAAE,UAAU,EAAE,GAAG,EAAE,QAAQ,EAA6B;IAC/F,OAAO,UAAU,KAAK,CAAC,CAAC,IAAI,YAAY,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,EAAE,IAAI,QAAQ,KAAK,GAAG,CAAC;AACpF,CAAC;AAED;;;GAGG;AACH,SAAS,kCAAkC,CAAC,KAAyB;IACnE,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,sCAAsC,CAAC,KAAK,CAAC,CAAC;IACnF,MAAM,cAAc,GAAG,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,sBAAsB,GACxB,cAAc,IAAI,EAAC,GAAG,cAAc,EAAE,QAAQ,EAAE,MAAM,CAAC,cAAc,CAAC,QAAQ,CAA8B,EAAC,CAAC;IAClH,OAAO,sBAAsB,IAAI,IAAI,CAAC;AACxC,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 Protocol from '../../../generated/protocol.js';\nimport type * as Handlers from '../handlers/handlers.js';\nimport * as Helpers from '../helpers/helpers.js';\nimport * as Types from '../types/types.js';\n\nexport const stackTraceForEventInTrace =\n    new Map<Handlers.Types.ParsedTrace, Map<Types.Events.Event, Protocol.Runtime.StackTrace>>();\n\nexport function clearCacheForTrace(parsedTrace: Handlers.Types.ParsedTrace): void {\n  stackTraceForEventInTrace.delete(parsedTrace);\n}\n/**\n * This util builds a stack trace that includes async calls for a given\n * event. It leverages data we collect from sampling to deduce sync\n * stacks and trace event instrumentation on the V8 debugger to stitch\n * them together.\n */\nexport function get(event: Types.Events.Event, parsedTrace: Handlers.Types.ParsedTrace): Protocol.Runtime.StackTrace|\n    null {\n  let cacheForTrace = stackTraceForEventInTrace.get(parsedTrace);\n  if (!cacheForTrace) {\n    cacheForTrace = new Map();\n    stackTraceForEventInTrace.set(parsedTrace, cacheForTrace);\n  }\n  const resultFromCache = cacheForTrace.get(event);\n  if (resultFromCache) {\n    return resultFromCache;\n  }\n  let result: Protocol.Runtime.StackTrace|null = null;\n  if (Types.Extensions.isSyntheticExtensionEntry(event)) {\n    result = getForExtensionEntry(event, parsedTrace);\n  } else if (Types.Events.isPerformanceMeasureBegin(event)) {\n    result = getForPerformanceMeasure(event, parsedTrace);\n  } else {\n    result = getForEvent(event, parsedTrace);\n    const maybeProtocolCallFrame = getPayloadStackAsProtocolCallFrame(event);\n    if (result && maybeProtocolCallFrame && !isNativeJSFunction(maybeProtocolCallFrame)) {\n      // If the event has a payload stack trace, replace the top frame\n      // of the calculated stack with the top frame of the payload stack\n      // because trace payload call frames contain call locations, unlike\n      // profile call frames (which contain function declaration locations).\n      // This way the user knows which exact JS location triggered an\n      // event.\n      result.callFrames[0] = maybeProtocolCallFrame;\n    }\n  }\n  if (result) {\n    cacheForTrace.set(event, result);\n  }\n  return result;\n}\n\n/**\n * Fallback method to obtain a stack trace using the parsed event tree\n * hierarchy. This shouldn't be called outside of this file, use `get`\n * instead to ensure the correct event in the tree hierarchy is used.\n */\nfunction getForEvent(event: Types.Events.Event, parsedTrace: Handlers.Types.ParsedTrace): Protocol.Runtime.StackTrace {\n  // When working with a CPU profile the renderer handler won't have\n  // entries in its tree.\n  const entryToNode =\n      parsedTrace.Renderer.entryToNode.size > 0 ? parsedTrace.Renderer.entryToNode : parsedTrace.Samples.entryToNode;\n  const topStackTrace: Protocol.Runtime.StackTrace = {callFrames: []};\n  let stackTrace: Protocol.Runtime.StackTrace = topStackTrace;\n  let currentEntry: Types.Events.SyntheticProfileCall;\n  let node: Helpers.TreeHelpers.TraceEntryNode|null|undefined = entryToNode.get(event);\n  const traceCache =\n      stackTraceForEventInTrace.get(parsedTrace) || new Map<Types.Events.Event, Protocol.Runtime.StackTrace>();\n  stackTraceForEventInTrace.set(parsedTrace, traceCache);\n  // Move up this node's ancestor tree appending JS frames to its\n  // stack trace. If an async caller is detected, move up in the async\n  // stack instead.\n  while (node) {\n    if (!Types.Events.isProfileCall(node.entry)) {\n      const maybeAsyncParent = parsedTrace.AsyncJSCalls.runEntryPointToScheduler.get(node.entry);\n      if (!maybeAsyncParent) {\n        node = node.parent;\n        continue;\n      }\n      const maybeAsyncParentNode = maybeAsyncParent && entryToNode.get(maybeAsyncParent.scheduler);\n      if (maybeAsyncParentNode) {\n        stackTrace = addAsyncParentToStack(stackTrace, maybeAsyncParent.taskName);\n        node = maybeAsyncParentNode;\n      }\n      continue;\n    }\n    currentEntry = node.entry;\n    // First check if this entry was processed before.\n    const stackTraceFromCache = traceCache.get(node.entry);\n    if (stackTraceFromCache) {\n      stackTrace.callFrames.push(...stackTraceFromCache.callFrames.filter(callFrame => !isNativeJSFunction(callFrame)));\n      stackTrace.parent = stackTraceFromCache.parent;\n      // Only set the description to the cache value if we didn't\n      // compute it in the previous iteration, since the async stack\n      // trace descriptions / taskNames is only extracted when jumping\n      // to the async parent, and that might not have happened when\n      // the cached value was computed (e.g. the cached value\n      // computation started at some point inside the parent stack\n      // trace).\n      stackTrace.description = stackTrace.description || stackTraceFromCache.description;\n      break;\n    }\n\n    if (!isNativeJSFunction(currentEntry.callFrame)) {\n      stackTrace.callFrames.push(currentEntry.callFrame);\n    }\n    const maybeAsyncParentEvent = parsedTrace.AsyncJSCalls.asyncCallToScheduler.get(currentEntry);\n    const maybeAsyncParentNode = maybeAsyncParentEvent && entryToNode.get(maybeAsyncParentEvent.scheduler);\n    if (maybeAsyncParentNode) {\n      stackTrace = addAsyncParentToStack(stackTrace, maybeAsyncParentEvent.taskName);\n      node = maybeAsyncParentNode;\n      continue;\n    }\n    node = node.parent;\n  }\n  return topStackTrace;\n}\n\nfunction addAsyncParentToStack(stackTrace: Protocol.Runtime.StackTrace, taskName: string): Protocol.Runtime.StackTrace {\n  const parent: Protocol.Runtime.StackTrace = {callFrames: []};\n  // The Protocol.Runtime.StackTrace type is recursive, so we\n  // move one level deeper in it as we walk up the ancestor tree.\n  stackTrace.parent = parent;\n  // Note: this description effectively corresponds to the name\n  // of the task that scheduled the stack trace we are jumping\n  // FROM, so it would make sense that it was set to that stack\n  // trace instead of the one we are jumping TO. However, the\n  // JS presentation utils we use to present async stack traces\n  // assume the description is added to the stack trace that\n  // scheduled the async task, so we build the data that way.\n  parent.description = taskName;\n  return parent;\n}\n\n/**\n * Finds the JS call in which an extension entry was injected (the\n * code location that called the extension API), and returns its stack\n * trace.\n */\nfunction getForExtensionEntry(event: Types.Extensions.SyntheticExtensionEntry, parsedTrace: Handlers.Types.ParsedTrace):\n    Protocol.Runtime.StackTrace|null {\n  const rawEvent: Types.Events.Event = event.rawSourceEvent;\n  if (Types.Events.isPerformanceMeasureBegin(rawEvent)) {\n    return getForPerformanceMeasure(rawEvent, parsedTrace);\n  }\n  if (!rawEvent) {\n    return null;\n  }\n  return get(rawEvent, parsedTrace);\n}\n\n/**\n * Gets the raw event for a user timing and obtains its stack trace.\n */\nfunction getForPerformanceMeasure(event: Types.Events.PerformanceMeasureBegin, parsedTrace: Handlers.Types.ParsedTrace):\n    Protocol.Runtime.StackTrace|null {\n  let rawEvent: Types.Events.Event|undefined = event;\n  if (event.args.traceId === undefined) {\n    return null;\n  }\n  // performance.measure calls dispatch 2 events: one for the call\n  // itself and another to represent the measured entry in the trace\n  // timeline. They are connected via a common traceId. At this\n  // point `rawEvent` corresponds to the second case, we must\n  // encounter the event for the call itself to obtain its callstack.\n  rawEvent = parsedTrace.UserTimings.measureTraceByTraceId.get(event.args.traceId);\n  if (!rawEvent) {\n    return null;\n  }\n  return get(rawEvent, parsedTrace);\n}\n/**\n * Determines if a function is a native JS API (like setTimeout,\n * requestAnimationFrame, consoleTask.run. etc.). This is useful to\n * discard stack frames corresponding to the JS scheduler function\n * itself, since it's already being used as title of async stack traces\n * taken from the async `taskName`. This is also consistent with the\n * behaviour of the stack trace in the sources\n * panel.\n */\nfunction isNativeJSFunction({columnNumber, lineNumber, url, scriptId}: Protocol.Runtime.CallFrame): boolean {\n  return lineNumber === -1 && columnNumber === -1 && url === '' && scriptId === '0';\n}\n\n/**\n * Extracts the top frame in the stack contained in a trace event's payload\n * (if any) and casts it as a Protocol.Runtime.CallFrame.\n */\nfunction getPayloadStackAsProtocolCallFrame(event: Types.Events.Event): Protocol.Runtime.CallFrame|null {\n  const maybeCallStack = Helpers.Trace.getZeroIndexedStackTraceInEventPayload(event);\n  const maybeCallFrame = maybeCallStack?.at(0);\n  const maybeProtocolCallFrame =\n      maybeCallFrame && {...maybeCallFrame, scriptId: String(maybeCallFrame.scriptId) as Protocol.Runtime.ScriptId};\n  return maybeProtocolCallFrame || null;\n}\n"]}

package/models/trace/extras/ThirdParties.d.ts

@@ -1,28 +1,22 @@
-import * as ThirdPartyWeb from '../../../third_party/third-party-web/third-party-web.js';
+import type * as ThirdPartyWeb from '../../../third_party/third-party-web/third-party-web.js';
 import * as Handlers from '../handlers/handlers.js';
 import * as Types from '../types/types.js';
 export type Entity = typeof ThirdPartyWeb.ThirdPartyWeb.entities[number];
-export interface Summary {
+interface BaseSummary {
+    entity: Entity;
     transferSize: number;
-    mainThreadTime: Types.Timing.Micro;
+    mainThreadTime: Types.Timing.Milli;
 }
-export interface ThirdPartySummary {
-    byEntity: Map<Entity, Summary>;
-    byUrl: Map<string, Summary>;
-    urlsByEntity: Map<Entity, Set<string>>;
-    eventsByEntity: Map<Entity, Types.Events.Event[]>;
-    madeUpEntityCache: Map<string, Entity>;
+export interface EntitySummary extends BaseSummary {
+    relatedEvents: Types.Events.Event[];
 }
+export interface URLSummary extends BaseSummary {
+    url: string;
+    request?: Types.Events.SyntheticNetworkRequest;
+}
+export declare function summarizeByThirdParty(parsedTrace: Handlers.Types.ParsedTrace, traceBounds: Types.Timing.TraceWindowMicro): EntitySummary[];
 /**
- * @param networkRequests Won't be filtered by trace bounds, so callers should ensure it is filtered.
- */
-export declare function summarizeThirdParties(parsedTrace: Handlers.Types.ParsedTrace, traceBounds: Types.Timing.TraceWindowMicro, networkRequests: Types.Events.SyntheticNetworkRequest[]): ThirdPartySummary;
-/**
- * Note: unlike summarizeThirdParties, this does not calculate mainThreadTime. The reason is that it is not
- * needed for its one use case, and when dragging the trace bounds it takes a long time to calculate.
- * If it is ever needed, we need to make getSelfTimeByUrl (see deleted code/blame) much faster (cache + bucket?).
+ * Used only by Lighthouse.
  */
-export declare function getSummariesAndEntitiesWithMapping(parsedTrace: Handlers.Types.ParsedTrace, traceBounds: Types.Timing.TraceWindowMicro, entityMapping: Handlers.Helpers.EntityMappings): {
-    summaries: ThirdPartySummary;
-    entityByEvent: Map<Types.Events.Event, Handlers.Helpers.Entity>;
-};
+export declare function summarizeByURL(parsedTrace: Handlers.Types.ParsedTrace, traceBounds: Types.Timing.TraceWindowMicro): URLSummary[];
+export {};