)]}'
{
  "commit": "eeee9ebb54b76a33a13d2c926ffb018a4aea410f",
  "tree": "96e40d9c6690878008d6d4f1ca672fc6578d6d2d",
  "parents": [
    "bb2ab10fa693110cffa7087ffe2749d6e9a27d5f"
  ],
  "author": {
    "name": "Artem Bityutskiy",
    "email": "Artem.Bityutskiy@nokia.com",
    "time": "Tue Oct 26 14:23:06 2010 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@linux-foundation.org",
    "time": "Tue Oct 26 16:52:19 2010 -0700"
  },
  "message": "lib/list_sort: test: use generic random32\n\nInstead of using own pseudo-random generator, use generic linux\n\u0027random32()\u0027 function.  Presumably, this should improve test coverage.\n\nAt the same time, do the following changes:\n  o Use shorter macro name for test list length\n  o Do not use strange \u0027l_h\u0027 name for \u0027struct list_head\u0027 element,\n    use \u0027list\u0027, because it is traditional name and thus, makes the\n    code more obvious and readable.\n\nSigned-off-by: Artem Bityutskiy \u003cArtem.Bityutskiy@nokia.com\u003e\nCc: Don Mullis \u003cdon.mullis@gmail.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "679b3a060e7e9b1dbaaa286a17bf179655463963",
      "old_mode": 33188,
      "old_path": "lib/list_sort.c",
      "new_id": "8f3c24415ae51a02e403726a7079d051583cef31",
      "new_mode": 33188,
      "new_path": "lib/list_sort.c"
    }
  ]
}