)]}'
{
  "commit": "269778769d4d24c511bc3d5f95eeb2e92dcf1868",
  "tree": "05352c73f47a30ac0f99aba921559682489c7abe",
  "parents": [
    "03039e5ef0b92cb3ec89ff2caa5b57fa6bf12a88"
  ],
  "author": {
    "name": "Tom Musta",
    "email": "tommusta@gmail.com",
    "time": "Mon Aug 25 14:25:43 2014 -0500"
  },
  "committer": {
    "name": "Alexander Graf",
    "email": "agraf@suse.de",
    "time": "Mon Sep 08 12:50:53 2014 +0200"
  },
  "message": "target-ppc: Clean up mullwo\n\nSimplify the implementation of mullwo.  For 64 bit CPUs, the result is\nthe concatenation of the upper and lower parts of the muls2_i32 operation,\nwhich may be slightly better than deposit.  For 32 bit CPUs, the lower part\nof the muls_i32 operation is moved into the target GPR.\n\nSigned-off-by: Tom Musta \u003ctommusta@gmail.com\u003e\nSuggested-by: Richard Henderson \u003crth@twiddle.net\u003e\nReviewed-by: Richard Henderson \u003crth@twiddle.net\u003e\nSigned-off-by: Alexander Graf \u003cagraf@suse.de\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "ced295f079268559f6e589addd998ecb4d75f5e5",
      "old_mode": 33188,
      "old_path": "target-ppc/translate.c",
      "new_id": "106263477a1f035e85b4ca754e78265279121af4",
      "new_mode": 33188,
      "new_path": "target-ppc/translate.c"
    }
  ]
}