)]}'
{
  "commit": "2ac1356d4daa989706150ade3446fe3e74546130",
  "tree": "af5edc49e72c0734fcc247daa6fea3a6029e9e02",
  "parents": [
    "c6d8c585ddbf119a85f3cc155068540aef6e18b0"
  ],
  "author": {
    "name": "Connal de Souza",
    "email": "connaldesouza@google.com",
    "time": "Fri Apr 19 19:33:53 2024 +0000"
  },
  "committer": {
    "name": "Danila Kutenin",
    "email": "danilak@google.com",
    "time": "Sat May 09 18:52:39 2026 +0000"
  },
  "message": "Optimize ExtractOffset() by avoiding storing the mask.\n\nCurrently, the constant mask is stored to memory and then immediately read back. Since the read address is often not aligned to the store address, this can cause an expensive Read-after-Write hazard. Although the load is contained entirely within the store, meaning that store forwarding can occur and there are no throughput penalties, there is still a latency penalty. The increased latency matters because of the pointer-chasing pattern in decompression here.\n\nhttps://godbolt.org/z/e71jhE3bj\n\nPiperOrigin-RevId: 626440765\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "708c57da98fbd28c701c568f41c22c23db8c8279",
      "old_mode": 33188,
      "old_path": "snappy.cc",
      "new_id": "d689aac80a968930c26625cb2f43d259ef56a488",
      "new_mode": 33188,
      "new_path": "snappy.cc"
    }
  ]
}