)]}'
{
  "commit": "d33d4e444c64215949ba82bcc2e92a3f69f28876",
  "tree": "cda76011ef3c61a7c56743faab70b35e6f5b0602",
  "parents": [
    "9763619c979672870f4e0fc616d557ef4d87577f"
  ],
  "author": {
    "name": "Salome Thirot",
    "email": "salome.thirot@arm.com",
    "time": "Mon Nov 06 15:19:52 2023 +0100"
  },
  "committer": {
    "name": "James Zern",
    "email": "jzern@google.com",
    "time": "Fri Dec 01 19:36:45 2023 +0000"
  },
  "message": "Simplify cost computation in cdef_find_dir_neon\n\nUse multiply-accumulate operations instead of zips and pairwise\nadditions to perform the final sum of squares. This gives around 8%\nspeedup for this function on both Clang and GCC.\n\nChange-Id: Ib4528d1e5621f9261a997e80161c1c5aba8e8247\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "a07092756b0408fe940ff4e227fad677f2559f28",
      "old_mode": 33188,
      "old_path": "av1/common/arm/cdef_block_neon.c",
      "new_id": "45d58aa38a7ab89ab3bf042a6b9ac40a88d37743",
      "new_mode": 33188,
      "new_path": "av1/common/arm/cdef_block_neon.c"
    }
  ]
}
