tree 606de83e7bb76d4c4d9086b43a7850716b9f3ad3
parent f091fecf6c6a9ae39632aa1923330a178a63d112
author Thomas Lively <tlively@google.com> 1791587807 -0700
committer GitHub <noreply@github.com> 1791587807 +0000
gpgsig -----BEGIN PGP SIGNATURE-----
 
 wsFcBAABCAAQBQJqyXXfCRC1aQ7uu5UhlAAAA1cQAHKpdpDxPIVL7CjSgH2epN3l
 6N8/bYL5PR8nwkthd5rF6IW/+j9YfbBLETuwwnc7W7u47yO0RAdu1ZOLtaPg6jbU
 UiRbsBphjXRKGwPsvzhcTRpp9AkFOmEdODT3h9buHIbjl04pCX9I81G+UjF8+e9U
 HEpsp8em1KBFTpwSSuZy339AqTkU+qvMp6CMdGhXErQequG8W6b1LMdEPqRKT+WM
 7Q+Zhmpze2NQesUMtm4NJ3cJ6jqQTns7WsjbyqH+BIu3cs+yL8fq/5hKzzYHBjR7
 6ClLCKfxkYxli0hQpq7SvglT/iORVa+PrilBlszERLb98qSdB/jMTznUqCYHZzn1
 Mtdd/PSxDFBG/G/0agKZXkk/rrY/A9gjNehNrAN1GPa+F9cTEvJzgxkVWSXI4R3N
 wbbI4YVDxToJNjxt8Ivbm6V6SbfVxi/nch9cxo6ZuWT6D5hqk1gPz/4qZxPwdJxF
 Iw99JWqJf/QSkNLEe3Xj+ghOWBdY1zTZSezsFfNk1MQhwjSIpnCdukzQLeTw/0MW
 K3cp8dJyscCsADiKI9B/Rkr3felTDe6cA26ypnvA+FMVHERKjLzmXRKEWdXinPvL
 vjMlKbEtKZZQgt8U90eFhuyZpoXK5VkdhhZbvqTaA73x/IS6SdU4mZdpIuOAaj1e
 vOUtzsSqmgCYnNCp0ErC
 =1C8C
 -----END PGP SIGNATURE-----
 

Flatten WeakTopologicalOrdering into a single entry vector (#9220)

Replace the recursive std::variant/Cycle representation of
WeakTopologicalOrdering with a single contiguous std::vector<Entry>
where cycle ends store the header block and jump target index. This
avoids per-cycle vector allocations and recursive evaluation in
WTOWorklist::run.

Benchmark results across 16 WebAssembly modules (3 iterations,
interleaved):
- --constraint-analysis:
  - Geomean: 1.606s -> 1.592s (-0.9%)
  - Total time: 64.05s -> 63.67s (-0.6%; faster on 11/16 modules)
- --rse:
  - Geomean: 0.871s -> 0.852s (-2.2%)
  - Total time: 26.03s -> 25.39s (-2.5%; faster on 12/16 modules)