)]}'
{
  "commit": "3c94193e0bbdd855bcbedabd27e3cbe1e6bc6242",
  "tree": "66acc972bc03f5d47de4488f60c5fd786cbd7d27",
  "parents": [
    "0aba1c7376ad325202f328211ab6dfcae94c7f2a"
  ],
  "author": {
    "name": "Aurelien Jarno",
    "email": "aurelien@aurel32.net",
    "time": "Tue Sep 18 19:12:36 2012 +0200"
  },
  "committer": {
    "name": "Aurelien Jarno",
    "email": "aurelien@aurel32.net",
    "time": "Sat Sep 22 15:10:21 2012 +0200"
  },
  "message": "tcg/optimize: optimize \"op r, a, a \u003d\u003e movi r, 0\"\n\nNow that it\u0027s possible to detect copies, we can optimize the case\nthe \"op r, a, a \u003d\u003e movi r, 0\". This helps in the computation of\noverflow flags when one of the two args is 0.\n\nReviewed-by: Richard Henderson \u003crth@twiddle.net\u003e\nSigned-off-by: Aurelien Jarno \u003caurelien@aurel32.net\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "b9a7da920f1078dac93fd3eed7941f529c1a0b9c",
      "old_mode": 33188,
      "old_path": "tcg/optimize.c",
      "new_id": "ceea6441bcaba7773192294b821ca87e9a45e97c",
      "new_mode": 33188,
      "new_path": "tcg/optimize.c"
    }
  ]
}