)]}'
{
  "commit": "af5568843594fb71055debe36e521fa8072fcecc",
  "tree": "4f35966cb4e1018b05c87d7a10c337d888949e22",
  "parents": [
    "5dcc03fe29537edd7819f5b121bf3d779693f37b"
  ],
  "author": {
    "name": "Bruno Randolf",
    "email": "br1@einfach.org",
    "time": "Thu Dec 02 19:50:37 2010 +0900"
  },
  "committer": {
    "name": "John W. Linville",
    "email": "linville@tuxdriver.com",
    "time": "Mon Dec 06 15:58:43 2010 -0500"
  },
  "message": "lib: Improve EWMA efficiency by using bitshifts\n\nUsing bitshifts instead of division and multiplication should improve\nperformance. That requires weight and factor to be powers of two, but i think\nthis is something we can live with.\n\nThanks to Peter Zijlstra for the improved formula!\n\nSigned-off-by: Bruno Randolf \u003cbr1@einfach.org\u003e\n\n--\n\nv2:\tuse log2.h functions\nSigned-off-by: John W. Linville \u003clinville@tuxdriver.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "7706e40f95fa43eb1ffa23af0fb60c6c2687ae60",
      "old_mode": 33188,
      "old_path": "include/linux/average.h",
      "new_id": "c6028fd742c1a18309a323a016e3be076d9b13be",
      "new_mode": 33188,
      "new_path": "include/linux/average.h"
    },
    {
      "type": "modify",
      "old_id": "f1d1b4660c428f18d9e8779a2db83779d351f8e3",
      "old_mode": 33188,
      "old_path": "lib/average.c",
      "new_id": "5576c28414968a1d384913885bfa8c3e5cd2b1c9",
      "new_mode": 33188,
      "new_path": "lib/average.c"
    }
  ]
}