)]}'
{
  "commit": "a1ff751abda89006f167b14fa4bfc5b59e4980f0",
  "tree": "17411b8c99eff38aa4185a3ac633b6391f953c33",
  "parents": [
    "aea390e4be652d5b5457771d25eded0dba14fe37"
  ],
  "author": {
    "name": "David Gibson",
    "email": "david@gibson.dropbear.id.au",
    "time": "Tue Mar 12 00:31:29 2013 +0000"
  },
  "committer": {
    "name": "Alexander Graf",
    "email": "agraf@suse.de",
    "time": "Fri Mar 22 15:28:50 2013 +0100"
  },
  "message": "mmu-hash*: Make find_pte{32, 64} do more of the job of finding ptes\n\nfind_pte{32,64}() are not particularly well named.  They only \"find\" a PTE\nwithin a given PTE group, and they also do permissions checking and other\nthings.\n\nThis patch makes it somewhat close to matching the name, by folding the\nsearch of both primary and secondary hash bucket into it, along with the\nvarious address bit shuffling to determine the right hash buckets.\n\nIn the 32-bit case we also remove the code for splitting large pages into\n4k pieces for the qemu tlb, since no 32-bit hash MMUs support multiple page\nsizes.\n\nSigned-off-by: David Gibson \u003cdavid@gibson.dropbear.id.au\u003e\nSigned-off-by: Alexander Graf \u003cagraf@suse.de\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "7c13a4957f85d1e3d13ff4d4b06631b291c25242",
      "old_mode": 33188,
      "old_path": "target-ppc/mmu-hash32.c",
      "new_id": "b7a26a2a9074f06d1ff49fda6aa8720c53593503",
      "new_mode": 33188,
      "new_path": "target-ppc/mmu-hash32.c"
    },
    {
      "type": "modify",
      "old_id": "66b2d2444b99053960365d2487f981d2e9ba3e1c",
      "old_mode": 33188,
      "old_path": "target-ppc/mmu-hash64.c",
      "new_id": "36e2c845561a37994ecaacd291fe350267454b54",
      "new_mode": 33188,
      "new_path": "target-ppc/mmu-hash64.c"
    }
  ]
}