)]}'
{
  "commit": "528e408b94cd093e582de8352acebf85a41f5d56",
  "tree": "040e29161d0f2345742091ec7226800dc97f8728",
  "parents": [
    "c47023dceb11fcb06c2405ea11eca10ea1139aa0"
  ],
  "author": {
    "name": "Ryotaro Kasuga",
    "email": "kasuga.ryotaro@fujitsu.com",
    "time": "Wed Apr 02 15:41:40 2025 +0900"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Wed Apr 02 15:41:40 2025 +0900"
  },
  "message": "[LoopInterchange] Add an option to control the cost heuristics applied (#133664)\n\nLoopInterchange has several heuristic functions to determine if\nexchanging two loops is profitable or not. Whether or not to use each\nheuristic and the order in which to use them were fixed, but #125830\nallows them to be changed internally at will. This patch adds a new\noption to control them via the compiler option.\n\nThe previous patch also added an option to prioritize the vectorization\nheuristic. This patch also removes it to avoid conflicts between it and\nthe newly introduced one, e.g., both\n`-loop-interchange-prioritize-vectorization\u003d1` and\n`-loop-interchange-profitabilities\u003d\u0027cache,vectorization\u0027` are specified.",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "4366418b2379ddf7ab7db43c2477c2e227234f8c",
      "old_mode": 33188,
      "old_path": "llvm/lib/Transforms/Scalar/LoopInterchange.cpp",
      "new_id": "e777f950a7c5ae15b4cbc8aae7dca551d96dea8b",
      "new_mode": 33188,
      "new_path": "llvm/lib/Transforms/Scalar/LoopInterchange.cpp"
    },
    {
      "type": "modify",
      "old_id": "0018aa0308f2802dc565800ade883c421aee359c",
      "old_mode": 33188,
      "old_path": "llvm/test/Transforms/LoopInterchange/profitability-vectorization.ll",
      "new_id": "85be48cb9a710b4e361fbd6161170180eeb7dd7c",
      "new_mode": 33188,
      "new_path": "llvm/test/Transforms/LoopInterchange/profitability-vectorization.ll"
    }
  ]
}