)]}'
{
  "commit": "63ea30516353613fdca9ca01ca2abab38574268b",
  "tree": "3f1c6cf45dc54bb61a4386a3acc8d08d3f81957f",
  "parents": [
    "039109ae3538b5d22dc262591b81fb1ac527c27e",
    "69b2702db74151cd410a028fb347c6e4e3f779dc"
  ],
  "author": {
    "name": "bors",
    "email": "bors@rust-lang.org",
    "time": "Sat Dec 27 03:12:17 2025 +0000"
  },
  "committer": {
    "name": "bors",
    "email": "bors@rust-lang.org",
    "time": "Sat Dec 27 03:12:17 2025 +0000"
  },
  "message": "Auto merge of #142881 - cjgillot:minimap, r\u003dsaethlin\n\nJumpThreading: compute place and value indices on-demand\n\nProfiling JumpThreading reveals that a large part of the runtime happens constructing the place and value `Map`. This is unfortunate, as jump-threading may end up not even doing anything.\n\nThe cause for this large up-front cost is following: `Map` attempts to create a `PlaceIndex` for each place that *may* hold a relevant value. This means all places that appear in MIR, but also all places whose value is accessed by a projection of a copy of a larger place.\n\nThis PR refactors the creation of `Map` to happen on-demand: place and value indices are created when threading computation happens.\n\nThe up-front mode is still relevant for DataflowConstProp, so is not touched.\n",
  "tree_diff": []
}