@paulirish/trace_engine 0.0.9 → 0.0.11

package/models/trace/helpers/Timing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Timing.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/helpers/Timing.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,QAAQ,MAAM,oCAAoC,CAAC;AAC/D,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAE3C,OAAO,EAAC,0BAA0B,EAAC,MAAM,YAAY,CAAC;AAEtD,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,KAAgC,EAA6B,EAAE,CACtG,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;AAE5C,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,KAA2B,EAA6B,EAAE,CAC5F,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;AAE5C,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,KAA2B,EAA6B,EAAE,CAC5F,0BAA0B,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC;AAE7D,MAAM,CAAC,MAAM,0BAA0B,GAAG,CAAC,KAAgC,EAA6B,EAAE,CACtG,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;AAE5C,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,KAAgC,EAAwB,EAAE,CAC5F,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AAE9C,MAAM,UAAU,kBAAkB,CAAC,kBAA6C;IAC9E,IAAI,kBAAkB,GAAG,IAAI,EAAE;QAC7B,kDAA0C;KAC3C;IAED,MAAM,kBAAkB,GAAG,kBAAkB,GAAG,IAAI,CAAC;IACrD,IAAI,kBAAkB,GAAG,IAAI,EAAE;QAC7B,kDAA0C;KAC3C;IAED,MAAM,aAAa,GAAG,kBAAkB,GAAG,IAAI,CAAC;IAChD,IAAI,aAAa,GAAG,EAAE,EAAE;QACtB,6CAAqC;KACtC;IAED,6CAAqC;AACvC,CAAC;AAMD,MAAM,oBAAoB,GAAG;IAC3B,KAAK,EAAE,MAAM;IACb,IAAI,EAAE,aAAa;IACnB,WAAW,EAAE,QAAQ;CACtB,CAAC;AAEF,2EAA2E;AAC3E,oCAAoC;AACpC,MAAM,SAAS,GAAG,CAAC,KAAS,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC/D,MAAM,gBAAgB,GAAG,CAAC,GAAqB,EAAqB,EAAE;IACpE,gEAAgE;IAChE,2EAA2E;IAC3E,uEAAuE;IACvE,mBAAmB;IACnB,6EAA6E;IAC7E,gEAAgE;IAChE,OAAO,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtE,CAAC,CAAC;AACF,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAC;AAExD,yBAAyB;AACzB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAC,UAAU,EAAE,SAAS,CAAC,EAAC,KAAK,EAAE,SAAS,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAElG,wBAAwB;AACxB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAC,UAAU,EAAE,SAAS,CAAC,oBAAoB,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAEpG,mBAAmB;AACnB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAChC,UAAU,EAAE,SAAS,CAAC,EAAC,GAAG,oBAAoB,EAAE,IAAI,EAAE,QAAQ,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAExF,mBAAmB;AACnB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAChC,UAAU,EAAE,SAAS,CAAC,EAAC,GAAG,oBAAoB,EAAE,IAAI,EAAE,QAAQ,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAExF,MAAM,UAAU,sBAAsB,CAClC,kBAA6C,EAAE,OAAsB,EAAE;IACzE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;QAChB,IAAI,CAAC,MAAM,GAAG,kBAAkB,CAAC,kBAAkB,CAAC,CAAC;KACtD;IAED,MAAM,kBAAkB,GAAG,kBAAkB,GAAG,IAAI,CAAC;IACrD,MAAM,aAAa,GAAG,kBAAkB,GAAG,IAAI,CAAC;IAChD,MAAM,aAAa,GAAG,EAAC,GAAG,oBAAoB,EAAE,GAAG,IAAI,EAAC,CAAC;IAEzD,QAAQ,IAAI,CAAC,MAAM,EAAE;QACnB,+CAAuC,CAAC,CAAC;YACvC,MAAM,SAAS,GACX,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAC,UAAU,EAAE,SAAS,CAAC,EAAC,KAAK,EAAE,SAAS,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACtG,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,kBAAkB,CAAC,IAAI,CAAC;SACpD;QAED,+CAAuC,CAAC,CAAC;YACvC,MAAM,SAAS,GAAG,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAC,UAAU,EAAE,SAAS,CAAC,aAAa,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAC/G,OAAO,SAAS,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;SAC7C;QAED,0CAAkC,CAAC,CAAC;YAClC,MAAM,SAAS,GAAG,QAAQ,CAAC,YAAY,CAAC,cAAc,CAClD,UAAU,EAAE,SAAS,CAAC,EAAC,GAAG,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACjF,OAAO,SAAS,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;SACxC;QAED,OAAO,CAAC,CAAC;YACP,4BAA4B;YAC5B,MAAM,eAAe,GAAG,QAAQ,CAAC,YAAY,CAAC,cAAc,CACxD,UAAU,EAAE,SAAS,CAAC,EAAC,GAAG,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACjF,MAAM,eAAe,GAAG,QAAQ,CAAC,YAAY,CAAC,cAAc,CACxD,UAAU,EAAE,SAAS,CAAC,EAAC,GAAG,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACjF,MAAM,aAAa,GAAG,aAAa,GAAG,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,GAAG,eAAe,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;YAE/E,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,OAAO,IAAI,QAAQ,EAAE;gBACvB,+DAA+D;gBAC/D,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;aAC1D;YACD,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;SAC3F;KACF;AACH,CAAC;AAED,MAAM,UAAU,4CAA4C,CACxD,KAAuC,EACvC,WAAiD,EACjD,yBAAmF,EACnF,oBAAgF;IAElF,IAAI,cAAc,GAAG,KAAK,CAAC,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC;IAChD,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE;QAClC,MAAM,kBAAkB,GAAG,yBAAyB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACvF,IAAI,kBAAkB,EAAE;YACtB,cAAc,GAAG,KAAK,CAAC,EAAE,GAAG,kBAAkB,CAAC,EAAE,CAAC;SACnD;KACF;SAAM,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE;QAClC,MAAM,kBAAkB,GAAG,0BAA0B,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC;QAC1G,IAAI,kBAAkB,EAAE;YACtB,cAAc,GAAG,KAAK,CAAC,EAAE,GAAG,kBAAkB,CAAC,EAAE,CAAC;SACnD;KACF;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;AACnD,CAAC;AAWD,MAAM,UAAU,wBAAwB,CAAC,KAAuC;IAE9E,OAAO;QACL,SAAS,EAAE,KAAK,CAAC,EAAE;QACnB,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;QACnD,qEAAqE;QACrE,uBAAuB;QACvB,QAAQ,EAAE,KAAK,CAAC,WAAW,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;YAChD,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;KACrG,CAAC;AACJ,CAAC;AACD,MAAM,UAAU,wBAAwB,CAAC,KAAuC;IAE9E,MAAM,UAAU,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IACnD,OAAO;QACL,SAAS,EAAE,0BAA0B,CAAC,UAAU,CAAC,SAAS,CAAC;QAC3D,OAAO,EAAE,0BAA0B,CAAC,UAAU,CAAC,OAAO,CAAC;QACvD,QAAQ,EAAE,0BAA0B,CAAC,UAAU,CAAC,QAAQ,CAAC;QACzD,QAAQ,EAAE,0BAA0B,CAAC,UAAU,CAAC,QAAQ,CAAC;KAC1D,CAAC;AACJ,CAAC;AACD,MAAM,UAAU,mBAAmB,CAAC,KAAuC;IACzE,MAAM,UAAU,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;IACnD,OAAO;QACL,SAAS,EAAE,qBAAqB,CAAC,UAAU,CAAC,SAAS,CAAC;QACtD,OAAO,EAAE,qBAAqB,CAAC,UAAU,CAAC,OAAO,CAAC;QAClD,QAAQ,EAAE,qBAAqB,CAAC,UAAU,CAAC,QAAQ,CAAC;QACpD,QAAQ,EAAE,qBAAqB,CAAC,UAAU,CAAC,QAAQ,CAAC;KACrD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,MAA4C;IAElF,OAAO;QACL,GAAG,EAAE,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3C,GAAG,EAAE,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3C,KAAK,EAAE,0BAA0B,CAAC,MAAM,CAAC,KAAK,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,qCAAqC,CAAC,MAA4C;IAEhG,OAAO;QACL,GAAG,EAAE,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3C,GAAG,EAAE,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC;QAC3C,KAAK,EAAE,0BAA0B,CAAC,MAAM,CAAC,KAAK,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,2BAA2B,CACvC,GAA8B,EAAE,GAA8B;IAChE,MAAM,WAAW,GAAyC;QACxD,GAAG,EAAE,0BAA0B,CAAC,GAAG,CAAC;QACpC,GAAG,EAAE,0BAA0B,CAAC,GAAG,CAAC;QACpC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,0BAA0B,CAAC,GAAG,CAAC,GAAG,0BAA0B,CAAC,GAAG,CAAC,CAAC;KACpG,CAAC;IACF,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,2BAA2B,CACvC,GAA8B,EAAE,GAA8B;IAChE,MAAM,WAAW,GAAyC;QACxD,GAAG;QACH,GAAG;QACH,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC;KAC5C,CAAC;IACF,OAAO,WAAW,CAAC;AACrB,CAAC","sourcesContent":["// Copyright 2022 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 Platform from '../../../core/platform/platform.js';\nimport * as Types from '../types/types.js';\n\nimport {getNavigationForTraceEvent} from './Trace.js';\n\nexport const millisecondsToMicroseconds = (value: Types.Timing.MilliSeconds): Types.Timing.MicroSeconds =>\n    Types.Timing.MicroSeconds(value * 1000);\n\nexport const secondsToMilliseconds = (value: Types.Timing.Seconds): Types.Timing.MilliSeconds =>\n    Types.Timing.MilliSeconds(value * 1000);\n\nexport const secondsToMicroseconds = (value: Types.Timing.Seconds): Types.Timing.MicroSeconds =>\n    millisecondsToMicroseconds(secondsToMilliseconds(value));\n\nexport const microSecondsToMilliseconds = (value: Types.Timing.MicroSeconds): Types.Timing.MilliSeconds =>\n    Types.Timing.MilliSeconds(value / 1000);\n\nexport const microSecondsToSeconds = (value: Types.Timing.MicroSeconds): Types.Timing.Seconds =>\n    Types.Timing.Seconds(value / 1000 / 1000);\n\nexport function detectBestTimeUnit(timeInMicroseconds: Types.Timing.MicroSeconds): Types.Timing.TimeUnit {\n  if (timeInMicroseconds < 1000) {\n    return Types.Timing.TimeUnit.MICROSECONDS;\n  }\n\n  const timeInMilliseconds = timeInMicroseconds / 1000;\n  if (timeInMilliseconds < 1000) {\n    return Types.Timing.TimeUnit.MILLISECONDS;\n  }\n\n  const timeInSeconds = timeInMilliseconds / 1000;\n  if (timeInSeconds < 60) {\n    return Types.Timing.TimeUnit.SECONDS;\n  }\n\n  return Types.Timing.TimeUnit.MINUTES;\n}\n\ninterface FormatOptions extends Intl.NumberFormatOptions {\n  format?: Types.Timing.TimeUnit;\n}\n\nconst defaultFormatOptions = {\n  style: 'unit',\n  unit: 'millisecond',\n  unitDisplay: 'narrow',\n};\n\n// Create a bunch of common formatters up front, so that we're not creating\n// them repeatedly during rendering.\nconst serialize = (value: {}): string => JSON.stringify(value);\nconst formatterFactory = (key: string|undefined): Intl.NumberFormat => {\n  // If we pass undefined as the locale, that achieves two things:\n  // 1. Avoids us referencing window.navigatior to fetch the locale, which is\n  //    useful given long term we would like this engine to run in NodeJS\n  //    environments.\n  // 2. Will cause the formatter to fallback to the locale of the system, which\n  //    is likely going to be the most accurate one to use anyway.\n  return new Intl.NumberFormat(undefined, key ? JSON.parse(key) : {});\n};\nconst formatters = new Map<string, Intl.NumberFormat>();\n\n// Microsecond Formatter.\nPlatform.MapUtilities.getWithDefault(formatters, serialize({style: 'decimal'}), formatterFactory);\n\n// Millisecond Formatter\nPlatform.MapUtilities.getWithDefault(formatters, serialize(defaultFormatOptions), formatterFactory);\n\n// Second Formatter\nPlatform.MapUtilities.getWithDefault(\n    formatters, serialize({...defaultFormatOptions, unit: 'second'}), formatterFactory);\n\n// Minute Formatter\nPlatform.MapUtilities.getWithDefault(\n    formatters, serialize({...defaultFormatOptions, unit: 'minute'}), formatterFactory);\n\nexport function formatMicrosecondsTime(\n    timeInMicroseconds: Types.Timing.MicroSeconds, opts: FormatOptions = {}): string {\n  if (!opts.format) {\n    opts.format = detectBestTimeUnit(timeInMicroseconds);\n  }\n\n  const timeInMilliseconds = timeInMicroseconds / 1000;\n  const timeInSeconds = timeInMilliseconds / 1000;\n  const formatterOpts = {...defaultFormatOptions, ...opts};\n\n  switch (opts.format) {\n    case Types.Timing.TimeUnit.MICROSECONDS: {\n      const formatter =\n          Platform.MapUtilities.getWithDefault(formatters, serialize({style: 'decimal'}), formatterFactory);\n      return `${formatter.format(timeInMicroseconds)}μs`;\n    }\n\n    case Types.Timing.TimeUnit.MILLISECONDS: {\n      const formatter = Platform.MapUtilities.getWithDefault(formatters, serialize(formatterOpts), formatterFactory);\n      return formatter.format(timeInMilliseconds);\n    }\n\n    case Types.Timing.TimeUnit.SECONDS: {\n      const formatter = Platform.MapUtilities.getWithDefault(\n          formatters, serialize({...formatterOpts, unit: 'second'}), formatterFactory);\n      return formatter.format(timeInSeconds);\n    }\n\n    default: {\n      // Switch to mins & seconds.\n      const minuteFormatter = Platform.MapUtilities.getWithDefault(\n          formatters, serialize({...formatterOpts, unit: 'minute'}), formatterFactory);\n      const secondFormatter = Platform.MapUtilities.getWithDefault(\n          formatters, serialize({...formatterOpts, unit: 'second'}), formatterFactory);\n      const timeInMinutes = timeInSeconds / 60;\n      const [mins, divider, fraction] = minuteFormatter.formatToParts(timeInMinutes);\n\n      let seconds = 0;\n      if (divider && fraction) {\n        // Convert the fraction value (a string) to the nearest second.\n        seconds = Math.round(Number(`0.${fraction.value}`) * 60);\n      }\n      return `${minuteFormatter.format(Number(mins.value))} ${secondFormatter.format(seconds)}`;\n    }\n  }\n}\n\nexport function timeStampForEventAdjustedByClosestNavigation(\n    event: Types.TraceEvents.TraceEventData,\n    traceBounds: Types.Timing.TraceWindowMicroSeconds,\n    navigationsByNavigationId: Map<string, Types.TraceEvents.TraceEventNavigationStart>,\n    navigationsByFrameId: Map<string, Types.TraceEvents.TraceEventNavigationStart[]>,\n    ): Types.Timing.MicroSeconds {\n  let eventTimeStamp = event.ts - traceBounds.min;\n  if (event.args?.data?.navigationId) {\n    const navigationForEvent = navigationsByNavigationId.get(event.args.data.navigationId);\n    if (navigationForEvent) {\n      eventTimeStamp = event.ts - navigationForEvent.ts;\n    }\n  } else if (event.args?.data?.frame) {\n    const navigationForEvent = getNavigationForTraceEvent(event, event.args.data.frame, navigationsByFrameId);\n    if (navigationForEvent) {\n      eventTimeStamp = event.ts - navigationForEvent.ts;\n    }\n  }\n  return Types.Timing.MicroSeconds(eventTimeStamp);\n}\n\nexport interface EventTimingsData<\n  ValueType extends Types.Timing.MicroSeconds|Types.Timing.MilliSeconds|Types.Timing.Seconds,\n> {\n  startTime: ValueType;\n  endTime: ValueType;\n  duration: ValueType;\n  selfTime: ValueType;\n}\n\nexport function eventTimingsMicroSeconds(event: Types.TraceEvents.TraceEventData):\n    EventTimingsData<Types.Timing.MicroSeconds> {\n  return {\n    startTime: event.ts,\n    endTime: Types.Timing.MicroSeconds(event.ts + (event.dur || Types.Timing.MicroSeconds(0))),\n    duration: Types.Timing.MicroSeconds(event.dur || 0),\n    // TODO(crbug.com/1434599): Implement selfTime calculation for events\n    // from the new engine.\n    selfTime: Types.TraceEvents.isSyntheticTraceEntry(event) ? Types.Timing.MicroSeconds(event.selfTime || 0) :\n                                                               Types.Timing.MicroSeconds(event.dur || 0),\n  };\n}\nexport function eventTimingsMilliSeconds(event: Types.TraceEvents.TraceEventData):\n    EventTimingsData<Types.Timing.MilliSeconds> {\n  const microTimes = eventTimingsMicroSeconds(event);\n  return {\n    startTime: microSecondsToMilliseconds(microTimes.startTime),\n    endTime: microSecondsToMilliseconds(microTimes.endTime),\n    duration: microSecondsToMilliseconds(microTimes.duration),\n    selfTime: microSecondsToMilliseconds(microTimes.selfTime),\n  };\n}\nexport function eventTimingsSeconds(event: Types.TraceEvents.TraceEventData): EventTimingsData<Types.Timing.Seconds> {\n  const microTimes = eventTimingsMicroSeconds(event);\n  return {\n    startTime: microSecondsToSeconds(microTimes.startTime),\n    endTime: microSecondsToSeconds(microTimes.endTime),\n    duration: microSecondsToSeconds(microTimes.duration),\n    selfTime: microSecondsToSeconds(microTimes.selfTime),\n  };\n}\n\nexport function traceWindowMilliSeconds(bounds: Types.Timing.TraceWindowMicroSeconds):\n    Types.Timing.TraceWindowMilliSeconds {\n  return {\n    min: microSecondsToMilliseconds(bounds.min),\n    max: microSecondsToMilliseconds(bounds.max),\n    range: microSecondsToMilliseconds(bounds.range),\n  };\n}\n\nexport function traceWindowMillisecondsToMicroSeconds(bounds: Types.Timing.TraceWindowMilliSeconds):\n    Types.Timing.TraceWindowMicroSeconds {\n  return {\n    min: millisecondsToMicroseconds(bounds.min),\n    max: millisecondsToMicroseconds(bounds.max),\n    range: millisecondsToMicroseconds(bounds.range),\n  };\n}\n\nexport function traceWindowFromMilliSeconds(\n    min: Types.Timing.MilliSeconds, max: Types.Timing.MilliSeconds): Types.Timing.TraceWindowMicroSeconds {\n  const traceWindow: Types.Timing.TraceWindowMicroSeconds = {\n    min: millisecondsToMicroseconds(min),\n    max: millisecondsToMicroseconds(max),\n    range: Types.Timing.MicroSeconds(millisecondsToMicroseconds(max) - millisecondsToMicroseconds(min)),\n  };\n  return traceWindow;\n}\n\nexport function traceWindowFromMicroSeconds(\n    min: Types.Timing.MicroSeconds, max: Types.Timing.MicroSeconds): Types.Timing.TraceWindowMicroSeconds {\n  const traceWindow: Types.Timing.TraceWindowMicroSeconds = {\n    min,\n    max,\n    range: Types.Timing.MicroSeconds(max - min),\n  };\n  return traceWindow;\n}\n"]}

package/models/trace/helpers/Trace.d.ts

@@ -0,0 +1,37 @@
+import type * as CPUProfile from '../../cpu_profile/cpu_profile.js';
+import * as Types from '../types/types.js';
+type MatchedPairType<T extends Types.TraceEvents.TraceEventPairableAsync> = Types.TraceEvents.SyntheticEventPair<T>;
+export declare function stackTraceForEvent(event: Types.TraceEvents.TraceEventData): Types.TraceEvents.TraceEventCallFrame[] | null;
+export declare function extractOriginFromTrace(firstNavigationURL: string): string | null;
+export type EventsInThread<T extends Types.TraceEvents.TraceEventData> = Map<Types.TraceEvents.ThreadID, T[]>;
+export declare function addEventToProcessThread<T extends Types.TraceEvents.TraceEventData>(event: T, eventsInProcessThread: Map<Types.TraceEvents.ProcessID, EventsInThread<T>>): void;
+/**
+ * Sorts all the events in place, in order, by their start time. If they have
+ * the same start time, orders them by longest first.
+ */
+export declare function sortTraceEventsInPlace(events: {
+    ts: Types.Timing.MicroSeconds;
+    dur?: Types.Timing.MicroSeconds;
+}[]): void;
+/**
+ * Returns an array of ordered events that results after merging the two
+ * ordered input arrays.
+ */
+export declare function mergeEventsInOrder<T1 extends Types.TraceEvents.TraceEventData, T2 extends Types.TraceEvents.TraceEventData>(eventsArray1: T1[], eventsArray2: T2[]): (T1 | T2)[];
+export declare function getNavigationForTraceEvent(event: Types.TraceEvents.TraceEventData, eventFrameId: string, navigationsByFrameId: Map<string, Types.TraceEvents.TraceEventNavigationStart[]>): Types.TraceEvents.TraceEventNavigationStart | null;
+export declare function extractId(event: Types.TraceEvents.TraceEventPairableAsync | MatchedPairType<Types.TraceEvents.TraceEventPairableAsync>): string | undefined;
+export declare function activeURLForFrameAtTime(frameId: string, time: Types.Timing.MicroSeconds, rendererProcessesByFrame: Map<string, Map<Types.TraceEvents.ProcessID, {
+    frame: Types.TraceEvents.TraceFrame;
+    window: Types.Timing.TraceWindowMicroSeconds;
+}[]>>): string | null;
+export declare function makeProfileCall(node: CPUProfile.ProfileTreeModel.ProfileNode, ts: Types.Timing.MicroSeconds, pid: Types.TraceEvents.ProcessID, tid: Types.TraceEvents.ThreadID): Types.TraceEvents.SyntheticProfileCall;
+export declare function matchBeginningAndEndEvents(unpairedEvents: Types.TraceEvents.TraceEventPairableAsync[]): Map<string, {
+    begin: Types.TraceEvents.TraceEventPairableAsyncBegin | null;
+    end: Types.TraceEvents.TraceEventPairableAsyncEnd | null;
+}>;
+export declare function createSortedSyntheticEvents<T extends Types.TraceEvents.TraceEventPairableAsync>(matchedPairs: Map<string, {
+    begin: Types.TraceEvents.TraceEventPairableAsyncBegin | null;
+    end: Types.TraceEvents.TraceEventPairableAsyncEnd | null;
+}>): MatchedPairType<T>[];
+export declare function createMatchedSortedSyntheticEvents<T extends Types.TraceEvents.TraceEventPairableAsync>(unpairedAsyncEvents: T[]): MatchedPairType<T>[];
+export {};

package/models/trace/helpers/Trace.js

@@ -0,0 +1,230 @@
+// Copyright 2022 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 Platform from '../../../core/platform/platform.js';
+import * as Types from '../types/types.js';
+export function stackTraceForEvent(event) {
+    if (Types.TraceEvents.isSyntheticInvalidation(event)) {
+        return event.stackTrace || null;
+    }
+    if (event.args?.data?.stackTrace) {
+        return event.args.data.stackTrace;
+    }
+    if (Types.TraceEvents.isTraceEventUpdateLayoutTree(event)) {
+        return event.args.beginData?.stackTrace || null;
+    }
+    return null;
+}
+export function extractOriginFromTrace(firstNavigationURL) {
+    const url = new URL(firstNavigationURL);
+    if (url) {
+        // We do this to save some space in the toolbar - seeing the `www` is less
+        // useful than seeing `foo.com` if it's truncated at narrow widths
+        if (url.host.startsWith('www.')) {
+            return url.host.slice(4);
+        }
+        return url.host;
+    }
+    return null;
+}
+// Each thread contains events. Events indicate the thread and process IDs, which are
+// used to store the event in the correct process thread entry below.
+export function addEventToProcessThread(event, eventsInProcessThread) {
+    const { tid, pid } = event;
+    let eventsInThread = eventsInProcessThread.get(pid);
+    if (!eventsInThread) {
+        eventsInThread = new Map();
+    }
+    let events = eventsInThread.get(tid);
+    if (!events) {
+        events = [];
+    }
+    events.push(event);
+    eventsInThread.set(event.tid, events);
+    eventsInProcessThread.set(event.pid, eventsInThread);
+}
+function eventTimeComparator(a, b) {
+    const aBeginTime = a.ts;
+    const bBeginTime = b.ts;
+    if (aBeginTime < bBeginTime) {
+        return -1;
+    }
+    if (aBeginTime > bBeginTime) {
+        return 1;
+    }
+    const aDuration = a.dur ?? 0;
+    const bDuration = b.dur ?? 0;
+    const aEndTime = aBeginTime + aDuration;
+    const bEndTime = bBeginTime + bDuration;
+    if (aEndTime > bEndTime) {
+        return -1;
+    }
+    if (aEndTime < bEndTime) {
+        return 1;
+    }
+    return 0;
+}
+/**
+ * Sorts all the events in place, in order, by their start time. If they have
+ * the same start time, orders them by longest first.
+ */
+export function sortTraceEventsInPlace(events) {
+    events.sort(eventTimeComparator);
+}
+/**
+ * Returns an array of ordered events that results after merging the two
+ * ordered input arrays.
+ */
+export function mergeEventsInOrder(eventsArray1, eventsArray2) {
+    const result = [];
+    let i = 0;
+    let j = 0;
+    while (i < eventsArray1.length && j < eventsArray2.length) {
+        const event1 = eventsArray1[i];
+        const event2 = eventsArray2[j];
+        const compareValue = eventTimeComparator(event1, event2);
+        if (compareValue <= 0) {
+            result.push(event1);
+            i++;
+        }
+        if (compareValue === 1) {
+            result.push(event2);
+            j++;
+        }
+    }
+    while (i < eventsArray1.length) {
+        result.push(eventsArray1[i++]);
+    }
+    while (j < eventsArray2.length) {
+        result.push(eventsArray2[j++]);
+    }
+    return result;
+}
+export function getNavigationForTraceEvent(event, eventFrameId, navigationsByFrameId) {
+    const navigations = navigationsByFrameId.get(eventFrameId);
+    if (!navigations || eventFrameId === '') {
+        // This event's navigation has been filtered out by the meta handler as a noise event
+        // or contains an empty frameId.
+        return null;
+    }
+    const eventNavigationIndex = Platform.ArrayUtilities.nearestIndexFromEnd(navigations, navigation => navigation.ts <= event.ts);
+    if (eventNavigationIndex === null) {
+        // This event's navigation has been filtered out by the meta handler as a noise event.
+        return null;
+    }
+    return navigations[eventNavigationIndex];
+}
+export function extractId(event) {
+    return event.id ?? event.id2?.global ?? event.id2?.local;
+}
+export function activeURLForFrameAtTime(frameId, time, rendererProcessesByFrame) {
+    const processData = rendererProcessesByFrame.get(frameId);
+    if (!processData) {
+        return null;
+    }
+    for (const processes of processData.values()) {
+        for (const processInfo of processes) {
+            if (processInfo.window.min > time || processInfo.window.max < time) {
+                continue;
+            }
+            return processInfo.frame.url;
+        }
+    }
+    return null;
+}
+export function makeProfileCall(node, ts, pid, tid) {
+    return {
+        cat: '',
+        name: 'ProfileCall',
+        nodeId: node.id,
+        args: {},
+        ph: "X" /* Types.TraceEvents.Phase.COMPLETE */,
+        pid,
+        tid,
+        ts,
+        dur: Types.Timing.MicroSeconds(0),
+        selfTime: Types.Timing.MicroSeconds(0),
+        callFrame: node.callFrame,
+    };
+}
+export function matchBeginningAndEndEvents(unpairedEvents) {
+    // map to store begin and end of the event
+    const matchedPairs = new Map();
+    // looking for start and end
+    for (const event of unpairedEvents) {
+        const syntheticId = getSyntheticId(event);
+        if (syntheticId === undefined) {
+            continue;
+        }
+        // Create a synthetic id to prevent collisions across categories.
+        // Console timings can be dispatched with the same id, so use the
+        // event name as well to generate unique ids.
+        const otherEventsWithID = Platform.MapUtilities.getWithDefault(matchedPairs, syntheticId, () => {
+            return { begin: null, end: null };
+        });
+        const isStartEvent = event.ph === "b" /* Types.TraceEvents.Phase.ASYNC_NESTABLE_START */;
+        const isEndEvent = event.ph === "e" /* Types.TraceEvents.Phase.ASYNC_NESTABLE_END */;
+        if (isStartEvent) {
+            otherEventsWithID.begin = event;
+        }
+        else if (isEndEvent) {
+            otherEventsWithID.end = event;
+        }
+    }
+    return matchedPairs;
+}
+function getSyntheticId(event) {
+    const id = extractId(event);
+    return id && `${event.cat}:${id}:${event.name}`;
+}
+export function createSortedSyntheticEvents(matchedPairs) {
+    const syntheticEvents = [];
+    for (const [id, eventsPair] of matchedPairs.entries()) {
+        const beginEvent = eventsPair.begin;
+        const endEvent = eventsPair.end;
+        if (!beginEvent || !endEvent) {
+            // This should never happen, the backend only creates the events once it
+            // has them both, so we should never get into this state.
+            // If we do, something is very wrong, so let's just drop that problematic event.
+            continue;
+        }
+        const pair = { beginEvent, endEvent };
+        function eventsArePairable(data) {
+            return Boolean(getSyntheticId(data.beginEvent)) &&
+                getSyntheticId(data.beginEvent) === getSyntheticId(data.endEvent);
+        }
+        if (!eventsArePairable(pair)) {
+            continue;
+        }
+        const event = {
+            cat: endEvent.cat,
+            ph: endEvent.ph,
+            pid: endEvent.pid,
+            tid: endEvent.tid,
+            id,
+            // Both events have the same name, so it doesn't matter which we pick to
+            // use as the description
+            name: beginEvent.name,
+            dur: Types.Timing.MicroSeconds(endEvent.ts - beginEvent.ts),
+            ts: beginEvent.ts,
+            args: {
+                data: pair,
+            },
+        };
+        if (event.dur < 0) {
+            // We have seen in the backend that sometimes animation events get
+            // generated with multiple begin entries, or multiple end entries, and this
+            // can cause invalid data on the performance panel, so we drop them.
+            // crbug.com/1472375
+            continue;
+        }
+        syntheticEvents.push(event);
+    }
+    return syntheticEvents.sort((a, b) => a.ts - b.ts);
+}
+export function createMatchedSortedSyntheticEvents(unpairedAsyncEvents) {
+    const matchedPairs = matchBeginningAndEndEvents(unpairedAsyncEvents);
+    const syntheticEvents = createSortedSyntheticEvents(matchedPairs);
+    return syntheticEvents;
+}
+//# sourceMappingURL=Trace.js.map

package/models/trace/helpers/Trace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Trace.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/helpers/Trace.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,QAAQ,MAAM,oCAAoC,CAAC;AAE/D,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAG3C,MAAM,UAAU,kBAAkB,CAAC,KAAuC;IAExE,IAAI,KAAK,CAAC,WAAW,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE;QACpD,OAAO,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC;KACjC;IACD,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE;QAChC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;KACnC;IACD,IAAI,KAAK,CAAC,WAAW,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE;QACzD,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,IAAI,IAAI,CAAC;KACjD;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,kBAA0B;IAC/D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,kBAAkB,CAAC,CAAC;IACxC,IAAI,GAAG,EAAE;QACP,0EAA0E;QAC1E,kEAAkE;QAClE,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE;YAC/B,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC1B;QACD,OAAO,GAAG,CAAC,IAAI,CAAC;KACjB;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAGD,qFAAqF;AACrF,qEAAqE;AACrE,MAAM,UAAU,uBAAuB,CACnC,KAAQ,EACR,qBAA0E;IAE5E,MAAM,EAAC,GAAG,EAAE,GAAG,EAAC,GAAG,KAAK,CAAC;IACzB,IAAI,cAAc,GAAG,qBAAqB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpD,IAAI,CAAC,cAAc,EAAE;QACnB,cAAc,GAAG,IAAI,GAAG,EAAmC,CAAC;KAC7D;IAED,IAAI,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,CAAC,MAAM,EAAE;QACX,MAAM,GAAG,EAAE,CAAC;KACb;IAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnB,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACtC,qBAAqB,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;AACvD,CAAC;AAMD,SAAS,mBAAmB,CAAC,CAAW,EAAE,CAAW;IACnD,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;IACxB,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC;IACxB,IAAI,UAAU,GAAG,UAAU,EAAE;QAC3B,OAAO,CAAC,CAAC,CAAC;KACX;IACD,IAAI,UAAU,GAAG,UAAU,EAAE;QAC3B,OAAO,CAAC,CAAC;KACV;IACD,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC7B,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;IACxC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;IACxC,IAAI,QAAQ,GAAG,QAAQ,EAAE;QACvB,OAAO,CAAC,CAAC,CAAC;KACX;IACD,IAAI,QAAQ,GAAG,QAAQ,EAAE;QACvB,OAAO,CAAC,CAAC;KACV;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,MAA0E;IAE/G,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,MAAM,UACN,kBAAkB,CACd,YAAkB,EAAE,YAAkB;IACxC,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,YAAY,CAAC,MAAM,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE;QACzD,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,YAAY,GAAG,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,IAAI,YAAY,IAAI,CAAC,EAAE;YACrB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,CAAC,EAAE,CAAC;SACL;QACD,IAAI,YAAY,KAAK,CAAC,EAAE;YACtB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,CAAC,EAAE,CAAC;SACL;KACF;IACD,OAAO,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE;QAC9B,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAChC;IACD,OAAO,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE;QAC9B,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;KAChC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,0BAA0B,CACtC,KAAuC,EACvC,YAAoB,EACpB,oBAAgF;IAElF,MAAM,WAAW,GAAG,oBAAoB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC3D,IAAI,CAAC,WAAW,IAAI,YAAY,KAAK,EAAE,EAAE;QACvC,qFAAqF;QACrF,gCAAgC;QAChC,OAAO,IAAI,CAAC;KACb;IAED,MAAM,oBAAoB,GACtB,QAAQ,CAAC,cAAc,CAAC,mBAAmB,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC;IAEtG,IAAI,oBAAoB,KAAK,IAAI,EAAE;QACjC,sFAAsF;QACtF,OAAO,IAAI,CAAC;KACb;IACD,OAAO,WAAW,CAAC,oBAAoB,CAAC,CAAC;AAC3C,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAC0D;IAClF,OAAO,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,GAAG,EAAE,MAAM,IAAI,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC;AAC3D,CAAC;AAED,MAAM,UAAU,uBAAuB,CACnC,OAAe,EAAE,IAA+B,EAChD,wBAGmG;IACrG,MAAM,WAAW,GAAG,wBAAwB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC1D,IAAI,CAAC,WAAW,EAAE;QAChB,OAAO,IAAI,CAAC;KACb;IACD,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE;QAC5C,KAAK,MAAM,WAAW,IAAI,SAAS,EAAE;YACnC,IAAI,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,IAAI,IAAI,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,IAAI,EAAE;gBAClE,SAAS;aACV;YACD,OAAO,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC;SAC9B;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,eAAe,CAC3B,IAA6C,EAAE,EAA6B,EAAE,GAAgC,EAC9G,GAA+B;IACjC,OAAO;QACL,GAAG,EAAE,EAAE;QACP,IAAI,EAAE,aAAa;QACnB,MAAM,EAAE,IAAI,CAAC,EAAE;QACf,IAAI,EAAE,EAAE;QACR,EAAE,4CAAkC;QACpC,GAAG;QACH,GAAG;QACH,EAAE;QACF,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;QACjC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;QACtC,SAAS,EAAE,IAAI,CAAC,SAAS;KAC1B,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,cAA2D;IAIpG,0CAA0C;IAC1C,MAAM,YAAY,GAGb,IAAI,GAAG,EAAE,CAAC;IAEf,4BAA4B;IAC5B,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;QAClC,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,WAAW,KAAK,SAAS,EAAE;YAC7B,SAAS;SACV;QACD,iEAAiE;QACjE,iEAAiE;QACjE,6CAA6C;QAC7C,MAAM,iBAAiB,GAAG,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAC,YAAY,EAAE,WAAW,EAAE,GAAG,EAAE;YAC7F,OAAO,EAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,KAAK,CAAC,EAAE,2DAAiD,CAAC;QAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,EAAE,yDAA+C,CAAC;QAE3E,IAAI,YAAY,EAAE;YAChB,iBAAiB,CAAC,KAAK,GAAG,KAAuD,CAAC;SACnF;aAAM,IAAI,UAAU,EAAE;YACrB,iBAAiB,CAAC,GAAG,GAAG,KAAqD,CAAC;SAC/E;KACF;IAED,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,SAAS,cAAc,CAAC,KAAgD;IACtE,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC5B,OAAO,EAAE,IAAI,GAAG,KAAK,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,2BAA2B,CACvC,YAGE;IACJ,MAAM,eAAe,GAAyB,EAAE,CAAC;IACjD,KAAK,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE;QACrD,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;QACpC,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC;QAChC,IAAI,CAAC,UAAU,IAAI,CAAC,QAAQ,EAAE;YAC5B,wEAAwE;YACxE,yDAAyD;YACzD,gFAAgF;YAChF,SAAS;SACV;QACD,MAAM,IAAI,GAAG,EAAC,UAAU,EAAE,QAAQ,EAAC,CAAC;QACpC,SAAS,iBAAiB,CAAC,IAG1B;YACC,OAAO,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC3C,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE;YAC5B,SAAS;SACV;QACD,MAAM,KAAK,GAAuB;YAChC,GAAG,EAAE,QAAQ,CAAC,GAAG;YACjB,EAAE,EAAE,QAAQ,CAAC,EAAE;YACf,GAAG,EAAE,QAAQ,CAAC,GAAG;YACjB,GAAG,EAAE,QAAQ,CAAC,GAAG;YACjB,EAAE;YACF,wEAAwE;YACxE,yBAAyB;YACzB,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC;YAC3D,EAAE,EAAE,UAAU,CAAC,EAAE;YACjB,IAAI,EAAE;gBACJ,IAAI,EAAE,IAAI;aACX;SACF,CAAC;QAEF,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE;YACjB,kEAAkE;YAClE,2EAA2E;YAC3E,oEAAoE;YACpE,oBAAoB;YACpB,SAAS;SACV;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KAC7B;IACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,kCAAkC,CAC9C,mBAAwB;IAC1B,MAAM,YAAY,GAAG,0BAA0B,CAAC,mBAAmB,CAAC,CAAC;IACrE,MAAM,eAAe,GAAG,2BAA2B,CAAI,YAAY,CAAC,CAAC;IACrE,OAAO,eAAe,CAAC;AACzB,CAAC","sourcesContent":["// Copyright 2022 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 Platform from '../../../core/platform/platform.js';\nimport type * as CPUProfile from '../../cpu_profile/cpu_profile.js';\nimport * as Types from '../types/types.js';\n\ntype MatchedPairType<T extends Types.TraceEvents.TraceEventPairableAsync> = Types.TraceEvents.SyntheticEventPair<T>;\nexport function stackTraceForEvent(event: Types.TraceEvents.TraceEventData): Types.TraceEvents.TraceEventCallFrame[]|\n    null {\n  if (Types.TraceEvents.isSyntheticInvalidation(event)) {\n    return event.stackTrace || null;\n  }\n  if (event.args?.data?.stackTrace) {\n    return event.args.data.stackTrace;\n  }\n  if (Types.TraceEvents.isTraceEventUpdateLayoutTree(event)) {\n    return event.args.beginData?.stackTrace || null;\n  }\n  return null;\n}\n\nexport function extractOriginFromTrace(firstNavigationURL: string): string|null {\n  const url = new URL(firstNavigationURL);\n  if (url) {\n    // We do this to save some space in the toolbar - seeing the `www` is less\n    // useful than seeing `foo.com` if it's truncated at narrow widths\n    if (url.host.startsWith('www.')) {\n      return url.host.slice(4);\n    }\n    return url.host;\n  }\n  return null;\n}\n\nexport type EventsInThread<T extends Types.TraceEvents.TraceEventData> = Map<Types.TraceEvents.ThreadID, T[]>;\n// Each thread contains events. Events indicate the thread and process IDs, which are\n// used to store the event in the correct process thread entry below.\nexport function addEventToProcessThread<T extends Types.TraceEvents.TraceEventData>(\n    event: T,\n    eventsInProcessThread: Map<Types.TraceEvents.ProcessID, EventsInThread<T>>,\n    ): void {\n  const {tid, pid} = event;\n  let eventsInThread = eventsInProcessThread.get(pid);\n  if (!eventsInThread) {\n    eventsInThread = new Map<Types.TraceEvents.ThreadID, T[]>();\n  }\n\n  let events = eventsInThread.get(tid);\n  if (!events) {\n    events = [];\n  }\n\n  events.push(event);\n  eventsInThread.set(event.tid, events);\n  eventsInProcessThread.set(event.pid, eventsInThread);\n}\n\ntype TimeSpan = {\n  ts: Types.Timing.MicroSeconds,\n  dur?: Types.Timing.MicroSeconds,\n};\nfunction eventTimeComparator(a: TimeSpan, b: TimeSpan): -1|0|1 {\n  const aBeginTime = a.ts;\n  const bBeginTime = b.ts;\n  if (aBeginTime < bBeginTime) {\n    return -1;\n  }\n  if (aBeginTime > bBeginTime) {\n    return 1;\n  }\n  const aDuration = a.dur ?? 0;\n  const bDuration = b.dur ?? 0;\n  const aEndTime = aBeginTime + aDuration;\n  const bEndTime = bBeginTime + bDuration;\n  if (aEndTime > bEndTime) {\n    return -1;\n  }\n  if (aEndTime < bEndTime) {\n    return 1;\n  }\n  return 0;\n}\n/**\n * Sorts all the events in place, in order, by their start time. If they have\n * the same start time, orders them by longest first.\n */\nexport function sortTraceEventsInPlace(events: {ts: Types.Timing.MicroSeconds, dur?: Types.Timing.MicroSeconds}[]):\n    void {\n  events.sort(eventTimeComparator);\n}\n\n/**\n * Returns an array of ordered events that results after merging the two\n * ordered input arrays.\n */\nexport function\nmergeEventsInOrder<T1 extends Types.TraceEvents.TraceEventData, T2 extends Types.TraceEvents.TraceEventData>(\n    eventsArray1: T1[], eventsArray2: T2[]): (T1|T2)[] {\n  const result = [];\n  let i = 0;\n  let j = 0;\n  while (i < eventsArray1.length && j < eventsArray2.length) {\n    const event1 = eventsArray1[i];\n    const event2 = eventsArray2[j];\n    const compareValue = eventTimeComparator(event1, event2);\n    if (compareValue <= 0) {\n      result.push(event1);\n      i++;\n    }\n    if (compareValue === 1) {\n      result.push(event2);\n      j++;\n    }\n  }\n  while (i < eventsArray1.length) {\n    result.push(eventsArray1[i++]);\n  }\n  while (j < eventsArray2.length) {\n    result.push(eventsArray2[j++]);\n  }\n  return result;\n}\n\nexport function getNavigationForTraceEvent(\n    event: Types.TraceEvents.TraceEventData,\n    eventFrameId: string,\n    navigationsByFrameId: Map<string, Types.TraceEvents.TraceEventNavigationStart[]>,\n    ): Types.TraceEvents.TraceEventNavigationStart|null {\n  const navigations = navigationsByFrameId.get(eventFrameId);\n  if (!navigations || eventFrameId === '') {\n    // This event's navigation has been filtered out by the meta handler as a noise event\n    // or contains an empty frameId.\n    return null;\n  }\n\n  const eventNavigationIndex =\n      Platform.ArrayUtilities.nearestIndexFromEnd(navigations, navigation => navigation.ts <= event.ts);\n\n  if (eventNavigationIndex === null) {\n    // This event's navigation has been filtered out by the meta handler as a noise event.\n    return null;\n  }\n  return navigations[eventNavigationIndex];\n}\n\nexport function extractId(event: Types.TraceEvents.TraceEventPairableAsync|\n                          MatchedPairType<Types.TraceEvents.TraceEventPairableAsync>): string|undefined {\n  return event.id ?? event.id2?.global ?? event.id2?.local;\n}\n\nexport function activeURLForFrameAtTime(\n    frameId: string, time: Types.Timing.MicroSeconds,\n    rendererProcessesByFrame:\n        Map<string,\n            Map<Types.TraceEvents.ProcessID,\n                {frame: Types.TraceEvents.TraceFrame, window: Types.Timing.TraceWindowMicroSeconds}[]>>): string|null {\n  const processData = rendererProcessesByFrame.get(frameId);\n  if (!processData) {\n    return null;\n  }\n  for (const processes of processData.values()) {\n    for (const processInfo of processes) {\n      if (processInfo.window.min > time || processInfo.window.max < time) {\n        continue;\n      }\n      return processInfo.frame.url;\n    }\n  }\n  return null;\n}\n\nexport function makeProfileCall(\n    node: CPUProfile.ProfileTreeModel.ProfileNode, ts: Types.Timing.MicroSeconds, pid: Types.TraceEvents.ProcessID,\n    tid: Types.TraceEvents.ThreadID): Types.TraceEvents.SyntheticProfileCall {\n  return {\n    cat: '',\n    name: 'ProfileCall',\n    nodeId: node.id,\n    args: {},\n    ph: Types.TraceEvents.Phase.COMPLETE,\n    pid,\n    tid,\n    ts,\n    dur: Types.Timing.MicroSeconds(0),\n    selfTime: Types.Timing.MicroSeconds(0),\n    callFrame: node.callFrame,\n  };\n}\n\nexport function matchBeginningAndEndEvents(unpairedEvents: Types.TraceEvents.TraceEventPairableAsync[]): Map<string, {\n  begin: Types.TraceEvents.TraceEventPairableAsyncBegin | null,\n  end: Types.TraceEvents.TraceEventPairableAsyncEnd | null,\n}> {\n  // map to store begin and end of the event\n  const matchedPairs: Map<string, {\n    begin: Types.TraceEvents.TraceEventPairableAsyncBegin | null,\n    end: Types.TraceEvents.TraceEventPairableAsyncEnd | null,\n  }> = new Map();\n\n  // looking for start and end\n  for (const event of unpairedEvents) {\n    const syntheticId = getSyntheticId(event);\n    if (syntheticId === undefined) {\n      continue;\n    }\n    // Create a synthetic id to prevent collisions across categories.\n    // Console timings can be dispatched with the same id, so use the\n    // event name as well to generate unique ids.\n    const otherEventsWithID = Platform.MapUtilities.getWithDefault(matchedPairs, syntheticId, () => {\n      return {begin: null, end: null};\n    });\n\n    const isStartEvent = event.ph === Types.TraceEvents.Phase.ASYNC_NESTABLE_START;\n    const isEndEvent = event.ph === Types.TraceEvents.Phase.ASYNC_NESTABLE_END;\n\n    if (isStartEvent) {\n      otherEventsWithID.begin = event as Types.TraceEvents.TraceEventPairableAsyncBegin;\n    } else if (isEndEvent) {\n      otherEventsWithID.end = event as Types.TraceEvents.TraceEventPairableAsyncEnd;\n    }\n  }\n\n  return matchedPairs;\n}\n\nfunction getSyntheticId(event: Types.TraceEvents.TraceEventPairableAsync): string|undefined {\n  const id = extractId(event);\n  return id && `${event.cat}:${id}:${event.name}`;\n}\n\nexport function createSortedSyntheticEvents<T extends Types.TraceEvents.TraceEventPairableAsync>(\n    matchedPairs: Map<string, {\n      begin: Types.TraceEvents.TraceEventPairableAsyncBegin | null,\n      end: Types.TraceEvents.TraceEventPairableAsyncEnd | null,\n    }>): MatchedPairType<T>[] {\n  const syntheticEvents: MatchedPairType<T>[] = [];\n  for (const [id, eventsPair] of matchedPairs.entries()) {\n    const beginEvent = eventsPair.begin;\n    const endEvent = eventsPair.end;\n    if (!beginEvent || !endEvent) {\n      // This should never happen, the backend only creates the events once it\n      // has them both, so we should never get into this state.\n      // If we do, something is very wrong, so let's just drop that problematic event.\n      continue;\n    }\n    const pair = {beginEvent, endEvent};\n    function eventsArePairable(data: {\n      beginEvent: Types.TraceEvents.TraceEventPairableAsyncBegin,\n      endEvent: Types.TraceEvents.TraceEventPairableAsyncEnd,\n    }): data is MatchedPairType<T>['args']['data'] {\n      return Boolean(getSyntheticId(data.beginEvent)) &&\n          getSyntheticId(data.beginEvent) === getSyntheticId(data.endEvent);\n    }\n    if (!eventsArePairable(pair)) {\n      continue;\n    }\n    const event: MatchedPairType<T> = {\n      cat: endEvent.cat,\n      ph: endEvent.ph,\n      pid: endEvent.pid,\n      tid: endEvent.tid,\n      id,\n      // Both events have the same name, so it doesn't matter which we pick to\n      // use as the description\n      name: beginEvent.name,\n      dur: Types.Timing.MicroSeconds(endEvent.ts - beginEvent.ts),\n      ts: beginEvent.ts,\n      args: {\n        data: pair,\n      },\n    };\n\n    if (event.dur < 0) {\n      // We have seen in the backend that sometimes animation events get\n      // generated with multiple begin entries, or multiple end entries, and this\n      // can cause invalid data on the performance panel, so we drop them.\n      // crbug.com/1472375\n      continue;\n    }\n    syntheticEvents.push(event);\n  }\n  return syntheticEvents.sort((a, b) => a.ts - b.ts);\n}\n\nexport function createMatchedSortedSyntheticEvents<T extends Types.TraceEvents.TraceEventPairableAsync>(\n    unpairedAsyncEvents: T[]): MatchedPairType<T>[] {\n  const matchedPairs = matchBeginningAndEndEvents(unpairedAsyncEvents);\n  const syntheticEvents = createSortedSyntheticEvents<T>(matchedPairs);\n  return syntheticEvents;\n}\n"]}

package/models/trace/helpers/TreeHelpers.d.ts

@@ -0,0 +1,90 @@
+import * as Types from '../types/types.js';
+export declare const makeTraceEntryNodeId: () => TraceEntryNodeId;
+export declare const makeEmptyTraceEntryTree: () => TraceEntryTree;
+export declare const makeEmptyTraceEntryNode: (entry: Types.TraceEvents.SyntheticTraceEntry, id: TraceEntryNodeId) => TraceEntryNode;
+export interface TraceEntryTree {
+    roots: Set<TraceEntryNode>;
+    maxDepth: number;
+}
+export interface TraceEntryNode {
+    entry: Types.TraceEvents.SyntheticTraceEntry;
+    depth: number;
+    id: TraceEntryNodeId;
+    parent: TraceEntryNode | null;
+    children: TraceEntryNode[];
+}
+declare class TraceEntryNodeIdTag {
+    #private;
+}
+export type TraceEntryNodeId = number & TraceEntryNodeIdTag;
+/**
+ * Builds a hierarchy of the entries (trace events and profile calls) in
+ * a particular thread of a particular process, assuming that they're
+ * sorted, by iterating through all of the events in order.
+ *
+ * The approach is analogous to how a parser would be implemented. A
+ * stack maintains local context. A scanner peeks and pops from the data
+ * stream. Various "tokens" (events) are treated as "whitespace"
+ * (ignored).
+ *
+ * The tree starts out empty and is populated as the hierarchy is built.
+ * The nodes are also assumed to be created empty, with no known parent
+ * or children.
+ *
+ * Complexity: O(n), where n = number of events
+ */
+export declare function treify(entries: Types.TraceEvents.SyntheticTraceEntry[], options?: {
+    filter: {
+        has: (name: Types.TraceEvents.KnownEventName) => boolean;
+    };
+}): {
+    tree: TraceEntryTree;
+    entryToNode: Map<Types.TraceEvents.SyntheticTraceEntry, TraceEntryNode>;
+};
+/**
+ * Iterates events in a tree hierarchically, from top to bottom,
+ * calling back on every event's start and end in the order
+ * as it traverses down and then up the tree.
+ *
+ * For example, given this tree, the following callbacks
+ * are expected to be made in the following order
+ * |---------------A---------------|
+ *  |------B------||-------D------|
+ *    |---C---|
+ *
+ * 1. Start A
+ * 3. Start B
+ * 4. Start C
+ * 5. End C
+ * 6. End B
+ * 7. Start D
+ * 8. End D
+ * 9. End A
+ *
+ */
+export declare function walkTreeFromEntry(entryToNode: Map<Types.TraceEvents.SyntheticTraceEntry, TraceEntryNode>, rootEntry: Types.TraceEvents.SyntheticTraceEntry, onEntryStart: (entry: Types.TraceEvents.SyntheticTraceEntry) => void, onEntryEnd: (entry: Types.TraceEvents.SyntheticTraceEntry) => void): void;
+/**
+ * Given a Helpers.TreeHelpers.RendererTree, this will iterates events in hierarchically, visiting
+ * each root node and working from top to bottom, calling back on every event's
+ * start and end in the order as it traverses down and then up the tree.
+ *
+ * For example, given this tree, the following callbacks
+ * are expected to be made in the following order
+ * |------------- Task A -------------||-- Task E --|
+ *  |-- Task B --||-- Task D --|
+ *   |- Task C -|
+ *
+ * 1. Start A
+ * 3. Start B
+ * 4. Start C
+ * 5. End C
+ * 6. End B
+ * 7. Start D
+ * 8. End D
+ * 9. End A
+ * 10. Start E
+ * 11. End E
+ *
+ */
+export declare function walkEntireTree(entryToNode: Map<Types.TraceEvents.SyntheticTraceEntry, TraceEntryNode>, tree: TraceEntryTree, onEntryStart: (entry: Types.TraceEvents.SyntheticTraceEntry) => void, onEntryEnd: (entry: Types.TraceEvents.SyntheticTraceEntry) => void, traceWindowToInclude?: Types.Timing.TraceWindowMicroSeconds, minDuration?: Types.Timing.MicroSeconds): void;
+export {};

package/models/trace/helpers/TreeHelpers.js

@@ -0,0 +1,222 @@
+// Copyright 2023 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 Types from '../types/types.js';
+let nodeIdCount = 0;
+export const makeTraceEntryNodeId = () => (++nodeIdCount);
+export const makeEmptyTraceEntryTree = () => ({
+    roots: new Set(),
+    maxDepth: 0,
+});
+export const makeEmptyTraceEntryNode = (entry, id) => ({
+    entry,
+    id,
+    parent: null,
+    children: [],
+    depth: 0,
+});
+class TraceEntryNodeIdTag {
+    /* eslint-disable-next-line no-unused-private-class-members */
+    #tag;
+}
+/**
+ * Builds a hierarchy of the entries (trace events and profile calls) in
+ * a particular thread of a particular process, assuming that they're
+ * sorted, by iterating through all of the events in order.
+ *
+ * The approach is analogous to how a parser would be implemented. A
+ * stack maintains local context. A scanner peeks and pops from the data
+ * stream. Various "tokens" (events) are treated as "whitespace"
+ * (ignored).
+ *
+ * The tree starts out empty and is populated as the hierarchy is built.
+ * The nodes are also assumed to be created empty, with no known parent
+ * or children.
+ *
+ * Complexity: O(n), where n = number of events
+ */
+export function treify(entries, options) {
+    // As we construct the tree, store a map of each entry to its node. This
+    // means if you are iterating over a list of RendererEntry events you can
+    // easily look up that node in the tree.
+    const entryToNode = new Map();
+    const stack = [];
+    // Reset the node id counter for every new renderer.
+    nodeIdCount = -1;
+    const tree = makeEmptyTraceEntryTree();
+    for (let i = 0; i < entries.length; i++) {
+        const event = entries[i];
+        // If the current event should not be part of the tree, then simply proceed
+        // with the next event.
+        if (options && !options.filter.has(event.name)) {
+            continue;
+        }
+        const duration = event.dur || 0;
+        const nodeId = makeTraceEntryNodeId();
+        const node = makeEmptyTraceEntryNode(event, nodeId);
+        // If the parent stack is empty, then the current event is a root. Create a
+        // node for it, mark it as a root, then proceed with the next event.
+        if (stack.length === 0) {
+            tree.roots.add(node);
+            event.selfTime = Types.Timing.MicroSeconds(duration);
+            stack.push(node);
+            tree.maxDepth = Math.max(tree.maxDepth, stack.length);
+            entryToNode.set(event, node);
+            continue;
+        }
+        const parentNode = stack.at(-1);
+        if (parentNode === undefined) {
+            throw new Error('Impossible: no parent node found in the stack');
+        }
+        const parentEvent = parentNode.entry;
+        const begin = event.ts;
+        const parentBegin = parentEvent.ts;
+        const parentDuration = parentEvent.dur || 0;
+        const end = begin + duration;
+        const parentEnd = parentBegin + parentDuration;
+        // Check the relationship between the parent event at the top of the stack,
+        // and the current event being processed. There are only 4 distinct
+        // possiblities, only 2 of them actually valid, given the assumed sorting:
+        // 1. Current event starts before the parent event, ends whenever. (invalid)
+        // 2. Current event starts after the parent event, ends whenever. (valid)
+        // 3. Current event starts during the parent event, ends after. (invalid)
+        // 4. Current event starts and ends during the parent event. (valid)
+        // 1. If the current event starts before the parent event, then the data is
+        //    not sorted properly, messed up some way, or this logic is incomplete.
+        const startsBeforeParent = begin < parentBegin;
+        if (startsBeforeParent) {
+            throw new Error('Impossible: current event starts before the parent event');
+        }
+        // 2. If the current event starts after the parent event, then it's a new
+        //    parent. Pop, then handle current event again.
+        const startsAfterParent = begin >= parentEnd;
+        if (startsAfterParent) {
+            stack.pop();
+            i--;
+            // The last created node has been discarded, so discard this id.
+            nodeIdCount--;
+            continue;
+        }
+        // 3. If the current event starts during the parent event, but ends
+        //    after it, then the data is messed up some way, for example a
+        //    profile call was sampled too late after its start, ignore the
+        //    problematic event.
+        const endsAfterParent = end > parentEnd;
+        if (endsAfterParent) {
+            continue;
+        }
+        // 4. The only remaining case is the common case, where the current event is
+        //    contained within the parent event. Create a node for the current
+        //    event, establish the parent/child relationship, then proceed with the
+        //    next event.
+        node.depth = stack.length;
+        node.parent = parentNode;
+        parentNode.children.push(node);
+        event.selfTime = Types.Timing.MicroSeconds(duration);
+        if (parentEvent.selfTime !== undefined) {
+            parentEvent.selfTime = Types.Timing.MicroSeconds(parentEvent.selfTime - (event.dur || 0));
+        }
+        stack.push(node);
+        tree.maxDepth = Math.max(tree.maxDepth, stack.length);
+        entryToNode.set(event, node);
+    }
+    return { tree, entryToNode };
+}
+/**
+ * Iterates events in a tree hierarchically, from top to bottom,
+ * calling back on every event's start and end in the order
+ * as it traverses down and then up the tree.
+ *
+ * For example, given this tree, the following callbacks
+ * are expected to be made in the following order
+ * |---------------A---------------|
+ *  |------B------||-------D------|
+ *    |---C---|
+ *
+ * 1. Start A
+ * 3. Start B
+ * 4. Start C
+ * 5. End C
+ * 6. End B
+ * 7. Start D
+ * 8. End D
+ * 9. End A
+ *
+ */
+export function walkTreeFromEntry(entryToNode, rootEntry, onEntryStart, onEntryEnd) {
+    const startNode = entryToNode.get(rootEntry);
+    if (!startNode) {
+        return;
+    }
+    walkTreeByNode(entryToNode, startNode, onEntryStart, onEntryEnd);
+}
+/**
+ * Given a Helpers.TreeHelpers.RendererTree, this will iterates events in hierarchically, visiting
+ * each root node and working from top to bottom, calling back on every event's
+ * start and end in the order as it traverses down and then up the tree.
+ *
+ * For example, given this tree, the following callbacks
+ * are expected to be made in the following order
+ * |------------- Task A -------------||-- Task E --|
+ *  |-- Task B --||-- Task D --|
+ *   |- Task C -|
+ *
+ * 1. Start A
+ * 3. Start B
+ * 4. Start C
+ * 5. End C
+ * 6. End B
+ * 7. Start D
+ * 8. End D
+ * 9. End A
+ * 10. Start E
+ * 11. End E
+ *
+ */
+export function walkEntireTree(entryToNode, tree, onEntryStart, onEntryEnd, traceWindowToInclude, minDuration) {
+    for (const rootNode of tree.roots) {
+        walkTreeByNode(entryToNode, rootNode, onEntryStart, onEntryEnd, traceWindowToInclude, minDuration);
+    }
+}
+function walkTreeByNode(entryToNode, rootNode, onEntryStart, onEntryEnd, traceWindowToInclude, minDuration) {
+    if (traceWindowToInclude && !treeNodeIsInWindow(rootNode, traceWindowToInclude)) {
+        // If this node is not within the provided window, we can skip it. We also
+        // can skip all its children too, as we know they won't be in the window if
+        // their parent is not.
+        return;
+    }
+    if (typeof minDuration !== 'undefined') {
+        const duration = Types.Timing.MicroSeconds(rootNode.entry.ts + Types.Timing.MicroSeconds(rootNode.entry.dur || 0));
+        if (duration < minDuration) {
+            return;
+        }
+    }
+    onEntryStart(rootNode.entry);
+    for (const child of rootNode.children) {
+        walkTreeByNode(entryToNode, child, onEntryStart, onEntryEnd, traceWindowToInclude, minDuration);
+    }
+    onEntryEnd(rootNode.entry);
+}
+/**
+ * Returns true if the provided node is partially or fully within the trace
+ * window. The entire node does not have to fit inside the window, but it does
+ * have to partially intersect it.
+ */
+function treeNodeIsInWindow(node, traceWindow) {
+    const startTime = node.entry.ts;
+    const endTime = node.entry.ts + (node.entry.dur || 0);
+    // Min ======= startTime ========= Max => node is within window
+    if (startTime >= traceWindow.min && startTime < traceWindow.max) {
+        return true;
+    }
+    // Min ======= endTime ========= Max => node is within window
+    if (endTime > traceWindow.min && endTime <= traceWindow.max) {
+        return true;
+    }
+    // startTime ==== Min ======== Max === endTime => node spans greater than the window so is in it.
+    if (startTime <= traceWindow.min && endTime >= traceWindow.max) {
+        return true;
+    }
+    return false;
+}
+//# sourceMappingURL=TreeHelpers.js.map