@ifc-lite/load-trace 0.0.0-stage → 0.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (51) hide show
  1. package/LICENSE +373 -0
  2. package/README.md +130 -2
  3. package/dist/call-meter.d.ts +16 -0
  4. package/dist/call-meter.d.ts.map +1 -0
  5. package/dist/call-meter.js +50 -0
  6. package/dist/call-meter.js.map +1 -0
  7. package/dist/chrome-trace.d.ts +23 -0
  8. package/dist/chrome-trace.d.ts.map +1 -0
  9. package/dist/chrome-trace.js +53 -0
  10. package/dist/chrome-trace.js.map +1 -0
  11. package/dist/counters.d.ts +34 -0
  12. package/dist/counters.d.ts.map +1 -0
  13. package/dist/counters.js +69 -0
  14. package/dist/counters.js.map +1 -0
  15. package/dist/frames.d.ts +69 -0
  16. package/dist/frames.d.ts.map +1 -0
  17. package/dist/frames.js +85 -0
  18. package/dist/frames.js.map +1 -0
  19. package/dist/index.d.ts +12 -0
  20. package/dist/index.d.ts.map +1 -0
  21. package/dist/index.js +13 -0
  22. package/dist/index.js.map +1 -0
  23. package/dist/load-trace.d.ts +62 -0
  24. package/dist/load-trace.d.ts.map +1 -0
  25. package/dist/load-trace.js +199 -0
  26. package/dist/load-trace.js.map +1 -0
  27. package/dist/messages.d.ts +43 -0
  28. package/dist/messages.d.ts.map +1 -0
  29. package/dist/messages.js +137 -0
  30. package/dist/messages.js.map +1 -0
  31. package/dist/perf-sink.d.ts +15 -0
  32. package/dist/perf-sink.d.ts.map +1 -0
  33. package/dist/perf-sink.js +37 -0
  34. package/dist/perf-sink.js.map +1 -0
  35. package/dist/tree.d.ts +11 -0
  36. package/dist/tree.d.ts.map +1 -0
  37. package/dist/tree.js +25 -0
  38. package/dist/tree.js.map +1 -0
  39. package/dist/types.d.ts +70 -0
  40. package/dist/types.d.ts.map +1 -0
  41. package/dist/types.js +5 -0
  42. package/dist/types.js.map +1 -0
  43. package/dist/worker-phases.d.ts +44 -0
  44. package/dist/worker-phases.d.ts.map +1 -0
  45. package/dist/worker-phases.js +78 -0
  46. package/dist/worker-phases.js.map +1 -0
  47. package/dist/worker.d.ts +72 -0
  48. package/dist/worker.d.ts.map +1 -0
  49. package/dist/worker.js +120 -0
  50. package/dist/worker.js.map +1 -0
  51. package/package.json +46 -3
package/LICENSE ADDED
@@ -0,0 +1,373 @@
1
+ Mozilla Public License Version 2.0
2
+ ==================================
3
+
4
+ 1. Definitions
5
+ --------------
6
+
7
+ 1.1. "Contributor"
8
+ means each individual or legal entity that creates, contributes to
9
+ the creation of, or owns Covered Software.
10
+
11
+ 1.2. "Contributor Version"
12
+ means the combination of the Contributions of others (if any) used
13
+ by a Contributor and that particular Contributor's Contribution.
14
+
15
+ 1.3. "Contribution"
16
+ means Covered Software of a particular Contributor.
17
+
18
+ 1.4. "Covered Software"
19
+ means Source Code Form to which the initial Contributor has attached
20
+ the notice in Exhibit A, the Executable Form of such Source Code
21
+ Form, and Modifications of such Source Code Form, in each case
22
+ including portions thereof.
23
+
24
+ 1.5. "Incompatible With Secondary Licenses"
25
+ means
26
+
27
+ (a) that the initial Contributor has attached the notice described
28
+ in Exhibit B to the Covered Software; or
29
+
30
+ (b) that the Covered Software was made available under the terms of
31
+ version 1.1 or earlier of the License, but not also under the
32
+ terms of a Secondary License.
33
+
34
+ 1.6. "Executable Form"
35
+ means any form of the work other than Source Code Form.
36
+
37
+ 1.7. "Larger Work"
38
+ means a work that combines Covered Software with other material, in
39
+ a separate file or files, that is not Covered Software.
40
+
41
+ 1.8. "License"
42
+ means this document.
43
+
44
+ 1.9. "Licensable"
45
+ means having the right to grant, to the maximum extent possible,
46
+ whether at the time of the initial grant or subsequently, any and
47
+ all of the rights conveyed by this License.
48
+
49
+ 1.10. "Modifications"
50
+ means any of the following:
51
+
52
+ (a) any file in Source Code Form that results from an addition to,
53
+ deletion from, or modification of the contents of Covered
54
+ Software; or
55
+
56
+ (b) any new file in Source Code Form that contains any Covered
57
+ Software.
58
+
59
+ 1.11. "Patent Claims" of a Contributor
60
+ means any patent claim(s), including without limitation, method,
61
+ process, and apparatus claims, in any patent Licensable by such
62
+ Contributor that would be infringed, but for the grant of the
63
+ License, by the making, using, selling, offering for sale, having
64
+ made, import, or transfer of either its Contributions or its
65
+ Contributor Version.
66
+
67
+ 1.12. "Secondary License"
68
+ means either the GNU General Public License, Version 2.0, the GNU
69
+ Lesser General Public License, Version 2.1, the GNU Affero General
70
+ Public License, Version 3.0, or any later versions of those
71
+ licenses.
72
+
73
+ 1.13. "Source Code Form"
74
+ means the form of the work preferred for making modifications.
75
+
76
+ 1.14. "You" (or "Your")
77
+ means an individual or a legal entity exercising rights under this
78
+ License. For legal entities, "You" includes any entity that
79
+ controls, is controlled by, or is under common control with You. For
80
+ purposes of this definition, "control" means (a) the power, direct
81
+ or indirect, to cause the direction or management of such entity,
82
+ whether by contract or otherwise, or (b) ownership of more than
83
+ fifty percent (50%) of the outstanding shares or beneficial
84
+ ownership of such entity.
85
+
86
+ 2. License Grants and Conditions
87
+ --------------------------------
88
+
89
+ 2.1. Grants
90
+
91
+ Each Contributor hereby grants You a world-wide, royalty-free,
92
+ non-exclusive license:
93
+
94
+ (a) under intellectual property rights (other than patent or trademark)
95
+ Licensable by such Contributor to use, reproduce, make available,
96
+ modify, display, perform, distribute, and otherwise exploit its
97
+ Contributions, either on an unmodified basis, with Modifications, or
98
+ as part of a Larger Work; and
99
+
100
+ (b) under Patent Claims of such Contributor to make, use, sell, offer
101
+ for sale, have made, import, and otherwise transfer either its
102
+ Contributions or its Contributor Version.
103
+
104
+ 2.2. Effective Date
105
+
106
+ The licenses granted in Section 2.1 with respect to any Contribution
107
+ become effective for each Contribution on the date the Contributor first
108
+ distributes such Contribution.
109
+
110
+ 2.3. Limitations on Grant Scope
111
+
112
+ The licenses granted in this Section 2 are the only rights granted under
113
+ this License. No additional rights or licenses will be implied from the
114
+ distribution or licensing of Covered Software under this License.
115
+ Notwithstanding Section 2.1(b) above, no patent license is granted by a
116
+ Contributor:
117
+
118
+ (a) for any code that a Contributor has removed from Covered Software;
119
+ or
120
+
121
+ (b) for infringements caused by: (i) Your and any other third party's
122
+ modifications of Covered Software, or (ii) the combination of its
123
+ Contributions with other software (except as part of its Contributor
124
+ Version); or
125
+
126
+ (c) under Patent Claims infringed by Covered Software in the absence of
127
+ its Contributions.
128
+
129
+ This License does not grant any rights in the trademarks, service marks,
130
+ or logos of any Contributor (except as may be necessary to comply with
131
+ the notice requirements in Section 3.4).
132
+
133
+ 2.4. Subsequent Licenses
134
+
135
+ No Contributor makes additional grants as a result of Your choice to
136
+ distribute the Covered Software under a subsequent version of this
137
+ License (see Section 10.2) or under the terms of a Secondary License (if
138
+ permitted under the terms of Section 3.3).
139
+
140
+ 2.5. Representation
141
+
142
+ Each Contributor represents that the Contributor believes its
143
+ Contributions are its original creation(s) or it has sufficient rights
144
+ to grant the rights to its Contributions conveyed by this License.
145
+
146
+ 2.6. Fair Use
147
+
148
+ This License is not intended to limit any rights You have under
149
+ applicable copyright doctrines of fair use, fair dealing, or other
150
+ equivalents.
151
+
152
+ 2.7. Conditions
153
+
154
+ Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
155
+ in Section 2.1.
156
+
157
+ 3. Responsibilities
158
+ -------------------
159
+
160
+ 3.1. Distribution of Source Form
161
+
162
+ All distribution of Covered Software in Source Code Form, including any
163
+ Modifications that You create or to which You contribute, must be under
164
+ the terms of this License. You must inform recipients that the Source
165
+ Code Form of the Covered Software is governed by the terms of this
166
+ License, and how they can obtain a copy of this License. You may not
167
+ attempt to alter or restrict the recipients' rights in the Source Code
168
+ Form.
169
+
170
+ 3.2. Distribution of Executable Form
171
+
172
+ If You distribute Covered Software in Executable Form then:
173
+
174
+ (a) such Covered Software must also be made available in Source Code
175
+ Form, as described in Section 3.1, and You must inform recipients of
176
+ the Executable Form how they can obtain a copy of such Source Code
177
+ Form by reasonable means in a timely manner, at a charge no more
178
+ than the cost of distribution to the recipient; and
179
+
180
+ (b) You may distribute such Executable Form under the terms of this
181
+ License, or sublicense it under different terms, provided that the
182
+ license for the Executable Form does not attempt to limit or alter
183
+ the recipients' rights in the Source Code Form under this License.
184
+
185
+ 3.3. Distribution of a Larger Work
186
+
187
+ You may create and distribute a Larger Work under terms of Your choice,
188
+ provided that You also comply with the requirements of this License for
189
+ the Covered Software. If the Larger Work is a combination of Covered
190
+ Software with a work governed by one or more Secondary Licenses, and the
191
+ Covered Software is not Incompatible With Secondary Licenses, this
192
+ License permits You to additionally distribute such Covered Software
193
+ under the terms of such Secondary License(s), so that the recipient of
194
+ the Larger Work may, at their option, further distribute the Covered
195
+ Software under the terms of either this License or such Secondary
196
+ License(s).
197
+
198
+ 3.4. Notices
199
+
200
+ You may not remove or alter the substance of any license notices
201
+ (including copyright notices, patent notices, disclaimers of warranty,
202
+ or limitations of liability) contained within the Source Code Form of
203
+ the Covered Software, except that You may alter any license notices to
204
+ the extent required to remedy known factual inaccuracies.
205
+
206
+ 3.5. Application of Additional Terms
207
+
208
+ You may choose to offer, and to charge a fee for, warranty, support,
209
+ indemnity or liability obligations to one or more recipients of Covered
210
+ Software. However, You may do so only on Your own behalf, and not on
211
+ behalf of any Contributor. You must make it absolutely clear that any
212
+ such warranty, support, indemnity, or liability obligation is offered by
213
+ You alone, and You hereby agree to indemnify every Contributor for any
214
+ liability incurred by such Contributor as a result of warranty, support,
215
+ indemnity or liability terms You offer. You may include additional
216
+ disclaimers of warranty and limitations of liability specific to any
217
+ jurisdiction.
218
+
219
+ 4. Inability to Comply Due to Statute or Regulation
220
+ ---------------------------------------------------
221
+
222
+ If it is impossible for You to comply with any of the terms of this
223
+ License with respect to some or all of the Covered Software due to
224
+ statute, judicial order, or regulation then You must: (a) comply with
225
+ the terms of this License to the maximum extent possible; and (b)
226
+ describe the limitations and the code they affect. Such description must
227
+ be placed in a text file included with all distributions of the Covered
228
+ Software under this License. Except to the extent prohibited by statute
229
+ or regulation, such description must be sufficiently detailed for a
230
+ recipient of ordinary skill to be able to understand it.
231
+
232
+ 5. Termination
233
+ --------------
234
+
235
+ 5.1. The rights granted under this License will terminate automatically
236
+ if You fail to comply with any of its terms. However, if You become
237
+ compliant, then the rights granted under this License from a particular
238
+ Contributor are reinstated (a) provisionally, unless and until such
239
+ Contributor explicitly and finally terminates Your grants, and (b) on an
240
+ ongoing basis, if such Contributor fails to notify You of the
241
+ non-compliance by some reasonable means prior to 60 days after You have
242
+ come back into compliance. Moreover, Your grants from a particular
243
+ Contributor are reinstated on an ongoing basis if such Contributor
244
+ notifies You of the non-compliance by some reasonable means, this is the
245
+ first time You have received notice of non-compliance with this License
246
+ from such Contributor, and You become compliant prior to 30 days after
247
+ Your receipt of the notice.
248
+
249
+ 5.2. If You initiate litigation against any entity by asserting a patent
250
+ infringement claim (excluding declaratory judgment actions,
251
+ counter-claims, and cross-claims) alleging that a Contributor Version
252
+ directly or indirectly infringes any patent, then the rights granted to
253
+ You by any and all Contributors for the Covered Software under Section
254
+ 2.1 of this License shall terminate.
255
+
256
+ 5.3. In the event of termination under Sections 5.1 or 5.2 above, all
257
+ end user license agreements (excluding distributors and resellers) which
258
+ have been validly granted by You or Your distributors under this License
259
+ prior to termination shall survive termination.
260
+
261
+ ************************************************************************
262
+ * *
263
+ * 6. Disclaimer of Warranty *
264
+ * ------------------------- *
265
+ * *
266
+ * Covered Software is provided under this License on an "as is" *
267
+ * basis, without warranty of any kind, either expressed, implied, or *
268
+ * statutory, including, without limitation, warranties that the *
269
+ * Covered Software is free of defects, merchantable, fit for a *
270
+ * particular purpose or non-infringing. The entire risk as to the *
271
+ * quality and performance of the Covered Software is with You. *
272
+ * Should any Covered Software prove defective in any respect, You *
273
+ * (not any Contributor) assume the cost of any necessary servicing, *
274
+ * repair, or correction. This disclaimer of warranty constitutes an *
275
+ * essential part of this License. No use of any Covered Software is *
276
+ * authorized under this License except under this disclaimer. *
277
+ * *
278
+ ************************************************************************
279
+
280
+ ************************************************************************
281
+ * *
282
+ * 7. Limitation of Liability *
283
+ * -------------------------- *
284
+ * *
285
+ * Under no circumstances and under no legal theory, whether tort *
286
+ * (including negligence), contract, or otherwise, shall any *
287
+ * Contributor, or anyone who distributes Covered Software as *
288
+ * permitted above, be liable to You for any direct, indirect, *
289
+ * special, incidental, or consequential damages of any character *
290
+ * including, without limitation, damages for lost profits, loss of *
291
+ * goodwill, work stoppage, computer failure or malfunction, or any *
292
+ * and all other commercial damages or losses, even if such party *
293
+ * shall have been informed of the possibility of such damages. This *
294
+ * limitation of liability shall not apply to liability for death or *
295
+ * personal injury resulting from such party's negligence to the *
296
+ * extent applicable law prohibits such limitation. Some *
297
+ * jurisdictions do not allow the exclusion or limitation of *
298
+ * incidental or consequential damages, so this exclusion and *
299
+ * limitation may not apply to You. *
300
+ * *
301
+ ************************************************************************
302
+
303
+ 8. Litigation
304
+ -------------
305
+
306
+ Any litigation relating to this License may be brought only in the
307
+ courts of a jurisdiction where the defendant maintains its principal
308
+ place of business and such litigation shall be governed by laws of that
309
+ jurisdiction, without reference to its conflict-of-law provisions.
310
+ Nothing in this Section shall prevent a party's ability to bring
311
+ cross-claims or counter-claims.
312
+
313
+ 9. Miscellaneous
314
+ ----------------
315
+
316
+ This License represents the complete agreement concerning the subject
317
+ matter hereof. If any provision of this License is held to be
318
+ unenforceable, such provision shall be reformed only to the extent
319
+ necessary to make it enforceable. Any law or regulation which provides
320
+ that the language of a contract shall be construed against the drafter
321
+ shall not be used to construe this License against a Contributor.
322
+
323
+ 10. Versions of the License
324
+ ---------------------------
325
+
326
+ 10.1. New Versions
327
+
328
+ Mozilla Foundation is the license steward. Except as provided in Section
329
+ 10.3, no one other than the license steward has the right to modify or
330
+ publish new versions of this License. Each version will be given a
331
+ distinguishing version number.
332
+
333
+ 10.2. Effect of New Versions
334
+
335
+ You may distribute the Covered Software under the terms of the version
336
+ of the License under which You originally received the Covered Software,
337
+ or under the terms of any subsequent version published by the license
338
+ steward.
339
+
340
+ 10.3. Modified Versions
341
+
342
+ If you create software not governed by this License, and you want to
343
+ create a new license for such software, you may create and use a
344
+ modified version of this License if you rename the license and remove
345
+ any references to the name of the license steward (except to note that
346
+ such modified license differs from this License).
347
+
348
+ 10.4. Distributing Source Code Form that is Incompatible With Secondary
349
+ Licenses
350
+
351
+ If You choose to distribute Source Code Form that is Incompatible With
352
+ Secondary Licenses under the terms of this version of the License, the
353
+ notice described in Exhibit B of this License must be attached.
354
+
355
+ Exhibit A - Source Code Form License Notice
356
+ -------------------------------------------
357
+
358
+ This Source Code Form is subject to the terms of the Mozilla Public
359
+ License, v. 2.0. If a copy of the MPL was not distributed with this
360
+ file, You can obtain one at https://mozilla.org/MPL/2.0/.
361
+
362
+ If it is not possible or desirable to put the notice in a particular
363
+ file, then You may include the notice in a location (such as a LICENSE
364
+ file in a relevant directory) where a recipient would be likely to look
365
+ for such a notice.
366
+
367
+ You may add additional accurate notices of copyright ownership.
368
+
369
+ Exhibit B - "Incompatible With Secondary Licenses" Notice
370
+ ---------------------------------------------------------
371
+
372
+ This Source Code Form is "Incompatible With Secondary Licenses", as
373
+ defined by the Mozilla Public License, v. 2.0.
package/README.md CHANGED
@@ -1,3 +1,131 @@
1
- # Temporary Holding Version
1
+ # @ifc-lite/load-trace
2
2
 
3
- This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
3
+ Dependency-free load tracing for the ifc-lite viewer. A load gets one span
4
+ tree that spans the main thread and its workers, every finished span is
5
+ mirrored into the browser's User Timing buffer as an `ifc:<name>` measure, and
6
+ the whole tree exports as Chrome-trace JSON (DevTools, Perfetto,
7
+ chrome://tracing).
8
+
9
+ Tracing is opt-in. A disabled tracer hands out a trace whose methods are empty
10
+ functions (`milestone` and `finish` still return elapsed milliseconds), so
11
+ instrumented call sites cost one no-op call when tracing is off.
12
+
13
+ ## Main thread
14
+
15
+ ```ts
16
+ import { createLoadTracer } from '@ifc-lite/load-trace';
17
+
18
+ const tracer = createLoadTracer({ enabled: true });
19
+ const trace = tracer.startLoad('model-1', { journey: 'J1', modelKind: 'primary' });
20
+
21
+ const bytes = await trace.span('file.read', () => fetch('/model.ifc').then((r) => r.arrayBuffer()));
22
+ const firstPaintMs = trace.milestone('geometry.firstVisible'); // span from load start
23
+ trace.finish({ loadPath: 'wasm' });
24
+
25
+ console.log(bytes.byteLength, firstPaintMs, tracer.latest());
26
+ ```
27
+
28
+ - `begin(name)` / `end(token)` open and close a span; `span(name, fn)` times a
29
+ function and, when it returns a promise, ends the span when the promise
30
+ settles.
31
+ - `record(name, start, end)` stores an interval the caller already measured.
32
+ - `milestone(name, atMs?)` records a span from the load start, so its measure
33
+ duration is the time-to-milestone. Only the first call per name is recorded.
34
+ - `setAttrs` / `finish(attrs)` set load attributes (`journey`, `modelKind`,
35
+ `cacheTier`, `loadPath`, `workerCount`).
36
+ - `snapshots()` / `latest()` return JSON-safe copies; `buildSpanTree` nests a
37
+ snapshot by parent, `toChromeTrace` renders snapshots as Chrome-trace JSON.
38
+
39
+ ## Workers
40
+
41
+ A worker's `performance.now()` counts from the worker's creation, not the
42
+ page's. Spans recorded in a worker therefore travel with the worker's
43
+ `performance.timeOrigin`, and `trace.merge(payload)` shifts them onto the main
44
+ thread's clock.
45
+
46
+ ```ts
47
+ import { createWorkerTraceHost } from '@ifc-lite/load-trace';
48
+
49
+ const traced = createWorkerTraceHost({
50
+ spanNames: { 'scan-shard': 'shard.scan' },
51
+ post: (message) => self.postMessage(message),
52
+ endpoint: () => self, // sender-side transfer accounting, enabled with tracing
53
+ });
54
+ self.onmessage = (e) => { void traced(e.data, async () => { /* handle e.data */ }); };
55
+ ```
56
+
57
+ If a handler publishes a terminal event before it returns, call
58
+ `traced.flush('shard.scan')` before that event. This completes open spans with that name
59
+ and publishes it with pending counters before the main thread can terminate
60
+ the worker. A plain `flush()` drains only already-completed spans; it cannot
61
+ publish the handler's still-open span. Other in-flight spans remain open, and
62
+ the handler's eventual return does not publish the completed span again.
63
+
64
+ For phases inside one long handler, `createWorkerPhaseTrace` records spans
65
+ the handler opens itself (`begin`/`end`, `span`, and `step` for sequential
66
+ phases such as a parser's progress callback) and posts them on `flush()`. Call
67
+ `flush()` before any message the main thread answers with `terminate()`:
68
+ spans posted after it die with the worker.
69
+
70
+ ```ts
71
+ import { createWorkerPhaseTrace } from '@ifc-lite/load-trace';
72
+
73
+ const phases = createWorkerPhaseTrace({ post: (message) => self.postMessage(message) });
74
+ self.onmessage = (e) => {
75
+ if (phases.accept(e.data)) return; // the enable request
76
+ const whole = phases.begin('parse');
77
+ phases.step('scan');
78
+ phases.step('index');
79
+ phases.step(null);
80
+ phases.end(whole);
81
+ phases.flush(); // before posting `complete`
82
+ };
83
+ ```
84
+
85
+ On the main thread, `enableWorkerTrace(worker, trace, 'geom-0')` turns
86
+ recording on (it sends nothing when tracing is off), and `isTraceSpansMessage`
87
+ recognises the replies to pass to `trace.merge`.
88
+
89
+ ## Structural counters and main-thread health (#6957)
90
+
91
+ `perfCounters` is one counter registry per JS realm (kept on `globalThis`, so
92
+ two bundled copies of the package share it). It is off until a recording
93
+ tracer switches it on; until then `perfCount(name, n)` is one boolean test.
94
+ Each load's snapshot carries `counters`: what moved from its start until the
95
+ next load started (or the snapshot was taken), plus everything its workers
96
+ posted back (`workerCounters`, per worker thread).
97
+
98
+ ```ts
99
+ import { accountWorkerMessages, countCopy, createLoadTracer, meterTypedArrayArgs, perfTally, startFrameMonitor } from '@ifc-lite/load-trace';
100
+
101
+ declare const url: URL; // the worker script
102
+ declare const vertices: number; // merged vertex count
103
+ const tracer = createLoadTracer({ enabled: true, frames: startFrameMonitor() });
104
+ const worker = accountWorkerMessages(new Worker(url), 'geometry'); // msg.geometry.{out,in}.*
105
+ const copy = countCopy('source.zip', bytes.slice().buffer); // copy.source.zip.{count,bytes}
106
+ const api = meterTypedArrayArgs(new IfcAPI(), 'wasm'); // wasm.<method>.{calls,bytes}
107
+ perfTally('render.mergeGeometry', vertices, 'vertices'); // render.mergeGeometry.{count,vertices}
108
+ ```
109
+
110
+ - `accountWorkerMessages` patches `postMessage` and listens for replies:
111
+ message counts, estimated structured-clone bytes, transferred bytes
112
+ (outbound), received ArrayBuffer bytes (inbound: the receiver cannot tell a
113
+ transfer from a clone) and SharedArrayBuffer bytes, per direction.
114
+ - In a worker, `createWorkerTraceHost` switches the worker's registry on with
115
+ tracing and posts its increments after every handler; `host.flush()` posts
116
+ them early when the main thread is about to terminate the worker. Pass the
117
+ completed span name when its handler has not yet returned.
118
+ - Both worker trace factories accept `endpoint: () => self` to count the
119
+ worker's outgoing messages as `msg.worker.out.*` in its per-thread
120
+ `workerCounters`. Transfer bytes come from the actual transfer list before
121
+ buffers detach; clone bytes remain an estimate of structured-clone work.
122
+ Counter increments are published before each data message, including the
123
+ terminal message. Trace-control messages are excluded. Phase traces also
124
+ drain WASM and copy counters on `flush()`; parser scans use the shared
125
+ typed-array argument meter. An entity-index handoff performs no parser
126
+ WASM scan and therefore records no parser WASM ingress.
127
+ - `startFrameMonitor` observes `long-animation-frame` and `longtask`
128
+ (feature-detected). `snapshot().mainThread` sums each type over the load
129
+ window and attributes LoAF blocking time to the innermost main-thread span
130
+ open when each frame started.
131
+ - With counters off, every wrapper returns its target unchanged.
@@ -0,0 +1,16 @@
1
+ import { type PerfCounterRegistry } from './counters.js';
2
+ /**
3
+ * Count the typed-array bytes handed to an object's methods (#6957). Wrapped
4
+ * around a wasm-bindgen API object it measures what crosses INTO wasm linear
5
+ * memory: wasm-bindgen copies every `&[u8]` / `&[u32]` argument there, so a
6
+ * whole-file `Uint8Array` argument is one full source copy per call.
7
+ *
8
+ * <prefix>.bytesIn all typed-array argument bytes
9
+ * <prefix>.<method>.calls calls that carried at least one typed array
10
+ * <prefix>.<method>.bytes their typed-array bytes
11
+ *
12
+ * With counters off it returns `target` itself (no Proxy). Methods run with
13
+ * the real object as `this`, so wasm-bindgen's pointer checks still pass.
14
+ */
15
+ export declare function meterTypedArrayArgs<T extends object>(target: T, prefix: string, registry?: PerfCounterRegistry): T;
16
+ //# sourceMappingURL=call-meter.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"call-meter.d.ts","sourceRoot":"","sources":["../src/call-meter.ts"],"names":[],"mappings":"AAIA,OAAO,EAAgB,KAAK,mBAAmB,EAAE,MAAM,eAAe,CAAC;AAEvE;;;;;;;;;;;;GAYG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,MAAM,EAClD,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,mBAAkC,GACtE,CAAC,CAyBH"}
@@ -0,0 +1,50 @@
1
+ /* This Source Code Form is subject to the terms of the Mozilla Public
2
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
3
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
4
+ import { perfCounters } from './counters.js';
5
+ /**
6
+ * Count the typed-array bytes handed to an object's methods (#6957). Wrapped
7
+ * around a wasm-bindgen API object it measures what crosses INTO wasm linear
8
+ * memory: wasm-bindgen copies every `&[u8]` / `&[u32]` argument there, so a
9
+ * whole-file `Uint8Array` argument is one full source copy per call.
10
+ *
11
+ * <prefix>.bytesIn all typed-array argument bytes
12
+ * <prefix>.<method>.calls calls that carried at least one typed array
13
+ * <prefix>.<method>.bytes their typed-array bytes
14
+ *
15
+ * With counters off it returns `target` itself (no Proxy). Methods run with
16
+ * the real object as `this`, so wasm-bindgen's pointer checks still pass.
17
+ */
18
+ export function meterTypedArrayArgs(target, prefix, registry = perfCounters) {
19
+ if (!registry.enabled)
20
+ return target;
21
+ const wrapped = new Map();
22
+ return new Proxy(target, {
23
+ get(obj, prop) {
24
+ const value = Reflect.get(obj, prop, obj);
25
+ if (typeof value !== 'function' || typeof prop !== 'string')
26
+ return value;
27
+ let fn = wrapped.get(prop);
28
+ if (fn === undefined) {
29
+ const method = value;
30
+ fn = (...args) => {
31
+ let bytes = 0, views = 0;
32
+ for (const a of args)
33
+ if (ArrayBuffer.isView(a)) {
34
+ bytes += a.byteLength;
35
+ views++;
36
+ }
37
+ if (views > 0) {
38
+ registry.add(`${prefix}.bytesIn`, bytes);
39
+ registry.add(`${prefix}.${prop}.calls`);
40
+ registry.add(`${prefix}.${prop}.bytes`, bytes);
41
+ }
42
+ return method.apply(obj, args);
43
+ };
44
+ wrapped.set(prop, fn);
45
+ }
46
+ return fn;
47
+ },
48
+ });
49
+ }
50
+ //# sourceMappingURL=call-meter.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"call-meter.js","sourceRoot":"","sources":["../src/call-meter.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,OAAO,EAAE,YAAY,EAA4B,MAAM,eAAe,CAAC;AAEvE;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAS,EAAE,MAAc,EAAE,WAAgC,YAAY;IAEvE,IAAI,CAAC,QAAQ,CAAC,OAAO;QAAE,OAAO,MAAM,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;IAChD,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;QACvB,GAAG,CAAC,GAAG,EAAE,IAAI;YACX,MAAM,KAAK,GAAY,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,OAAO,KAAK,KAAK,UAAU,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAC1E,IAAI,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,MAAM,MAAM,GAAG,KAAwC,CAAC;gBACxD,EAAE,GAAG,CAAC,GAAG,IAAe,EAAE,EAAE;oBAC1B,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;oBACzB,KAAK,MAAM,CAAC,IAAI,IAAI;wBAAE,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;4BAAC,KAAK,IAAI,CAAC,CAAC,UAAU,CAAC;4BAAC,KAAK,EAAE,CAAC;wBAAC,CAAC;oBACpF,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;wBACd,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,UAAU,EAAE,KAAK,CAAC,CAAC;wBACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,IAAI,QAAQ,CAAC,CAAC;wBACxC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,IAAI,QAAQ,EAAE,KAAK,CAAC,CAAC;oBACjD,CAAC;oBACD,OAAO,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACjC,CAAC,CAAC;gBACF,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACxB,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;KACF,CAAC,CAAC;AACL,CAAC"}
@@ -0,0 +1,23 @@
1
+ import type { LoadTraceSnapshot, TraceAttrValue } from './types.js';
2
+ /** One event of the Chrome Trace Event format (chrome://tracing, Perfetto, DevTools). */
3
+ export interface ChromeTraceEvent {
4
+ name: string;
5
+ cat: string;
6
+ ph: 'X' | 'M';
7
+ pid: number;
8
+ tid: number;
9
+ ts?: number;
10
+ dur?: number;
11
+ args?: Record<string, TraceAttrValue>;
12
+ }
13
+ export interface ChromeTrace {
14
+ traceEvents: ChromeTraceEvent[];
15
+ displayTimeUnit: 'ms';
16
+ }
17
+ /**
18
+ * Render loads as Chrome-trace JSON: one process per load, one thread track per
19
+ * recording thread (`main`, `geom-0`, ...), complete (`X`) events in µs on the
20
+ * main thread's clock. Open spans are omitted.
21
+ */
22
+ export declare function toChromeTrace(snapshots: readonly LoadTraceSnapshot[]): ChromeTrace;
23
+ //# sourceMappingURL=chrome-trace.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"chrome-trace.d.ts","sourceRoot":"","sources":["../src/chrome-trace.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,iBAAiB,EAAE,cAAc,EAAa,MAAM,YAAY,CAAC;AAE/E,yFAAyF;AACzF,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,EAAE,EAAE,GAAG,GAAG,GAAG,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;CACvC;AAED,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAChC,eAAe,EAAE,IAAI,CAAC;CACvB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,SAAS,iBAAiB,EAAE,GAAG,WAAW,CAyBlF"}
@@ -0,0 +1,53 @@
1
+ /* This Source Code Form is subject to the terms of the Mozilla Public
2
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
3
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
4
+ /**
5
+ * Render loads as Chrome-trace JSON: one process per load, one thread track per
6
+ * recording thread (`main`, `geom-0`, ...), complete (`X`) events in µs on the
7
+ * main thread's clock. Open spans are omitted.
8
+ */
9
+ export function toChromeTrace(snapshots) {
10
+ const traceEvents = [];
11
+ snapshots.forEach((load, index) => {
12
+ const pid = index + 1;
13
+ const tids = new Map([['main', 0]]);
14
+ const tid = (thread) => {
15
+ let t = tids.get(thread);
16
+ if (t === undefined) {
17
+ t = tids.size;
18
+ tids.set(thread, t);
19
+ }
20
+ return t;
21
+ };
22
+ const attrs = { loadId: load.loadId };
23
+ for (const [k, v] of Object.entries(load.attrs))
24
+ if (v !== undefined)
25
+ attrs[k] = v;
26
+ traceEvents.push({ name: 'process_name', cat: '__metadata', ph: 'M', pid, tid: 0, args: { name: `load ${load.loadId}` } });
27
+ if (load.end !== null) {
28
+ traceEvents.push(complete('load', pid, 0, load.start, load.end, attrs));
29
+ }
30
+ for (const span of load.spans) {
31
+ if (span.end === null)
32
+ continue;
33
+ traceEvents.push(complete(span.name, pid, tid(span.thread), span.start, span.end, spanArgs(span)));
34
+ }
35
+ for (const [thread, t] of tids) {
36
+ traceEvents.push({ name: 'thread_name', cat: '__metadata', ph: 'M', pid, tid: t, args: { name: thread } });
37
+ }
38
+ });
39
+ return { traceEvents, displayTimeUnit: 'ms' };
40
+ }
41
+ function complete(name, pid, tid, start, end, args) {
42
+ return {
43
+ name, cat: 'ifc-load', ph: 'X', pid, tid,
44
+ ts: Math.round(start * 1000), dur: Math.max(0, Math.round((end - start) * 1000)),
45
+ ...(args ? { args } : {}),
46
+ };
47
+ }
48
+ function spanArgs(span) {
49
+ if (!span.attrs && !span.milestone)
50
+ return undefined;
51
+ return { ...span.attrs, ...(span.milestone ? { milestone: true } : {}) };
52
+ }
53
+ //# sourceMappingURL=chrome-trace.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"chrome-trace.js","sourceRoot":"","sources":["../src/chrome-trace.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAqB/D;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,SAAuC;IACnE,MAAM,WAAW,GAAuB,EAAE,CAAC;IAC3C,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAChC,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,GAAG,GAAG,CAAC,MAAc,EAAU,EAAE;YACrC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;gBAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAAC,CAAC;YAC5D,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,MAAM,KAAK,GAAmC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,KAAK,SAAS;gBAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnF,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,YAAY,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3H,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC;YACtB,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI;gBAAE,SAAS;YAChC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrG,CAAC;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,YAAY,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;AAChD,CAAC;AAED,SAAS,QAAQ,CACf,IAAY,EAAE,GAAW,EAAE,GAAW,EAAE,KAAa,EAAE,GAAW,EAAE,IAAqC;IAEzG,OAAO;QACL,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;QACxC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;QAChF,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1B,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,IAAe;IAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,SAAS;QAAE,OAAO,SAAS,CAAC;IACrD,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC3E,CAAC"}