)]}'
{
  "commit": "256cebe5d17477cd1443f47a9bd5ca35ca0dbc9c",
  "tree": "5415177ed97e20c1fd1f2c8e0b42c197fea3bb89",
  "parents": [
    "fda6a0ecc61926ea1af6a85ab47a4ae47a6fe0a7"
  ],
  "author": {
    "name": "David Gibson",
    "email": "david@gibson.dropbear.id.au",
    "time": "Fri Apr 01 15:15:17 2011 +1100"
  },
  "committer": {
    "name": "Alexander Graf",
    "email": "agraf@suse.de",
    "time": "Fri Apr 01 18:34:55 2011 +0200"
  },
  "message": "Better factor the ppc hash translation path\n\nCurrently the path handling hash page table translation in get_segment()\nhas a mix of common and 32 or 64 bit specific code.  However the\ndivision is not done terribly well which results in a lot of messy code\nflipping between common and divided paths.\n\nThis patch improves the organization, consolidating several divided paths\ninto one.  This in turn allows simplification of some code in\nget_segment(), removing a number of ugly interim variables.\n\nThis new factorization will also make it easier to add support for the 1T\nsegments added in newer CPUs.\n\nSigned-off-by: David Gibson \u003cdwg@au1.ibm.com\u003e\nSigned-off-by: Alexander Graf \u003cagraf@suse.de\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "cee1057aeba47219bac7841e4dbcf45b823a7f25",
      "old_mode": 33188,
      "old_path": "target-ppc/cpu.h",
      "new_id": "fd2dfcd92cbad94093f10e8b713d20c8dc2f5971",
      "new_mode": 33188,
      "new_path": "target-ppc/cpu.h"
    },
    {
      "type": "modify",
      "old_id": "0efa2a8c3afc60cd36950026ed34f9d2eb47aaf7",
      "old_mode": 33188,
      "old_path": "target-ppc/helper.c",
      "new_id": "ae8001cd35abe7f91d2420b50cbfe4e4ac2aaac8",
      "new_mode": 33188,
      "new_path": "target-ppc/helper.c"
    }
  ]
}
