)]}'
{
  "commit": "58d6c2d72f8628f39e8689fbde8aa177fcf00a37",
  "tree": "0be40bd788856b3cabb99ff258561b15a574f2f3",
  "parents": [
    "d19ca30874f2ad343d054e0b5c0576744afeecd4"
  ],
  "author": {
    "name": "Peter Zijlstra",
    "email": "a.p.zijlstra@chello.nl",
    "time": "Sat Apr 19 19:45:00 2008 +0200"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Sat Apr 19 19:45:00 2008 +0200"
  },
  "message": "sched: rt-group: optimize dequeue_rt_stack\n\nNow that the group hierarchy can have an arbitrary depth the O(n^2) nature\nof RT task dequeues will really hurt. Optimize this by providing space to\nstore the tree path, so we can walk it the other way.\n\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "0a32059e6ed45df1a7e6ac120b004f4a636645aa",
      "old_mode": 33188,
      "old_path": "include/linux/sched.h",
      "new_id": "887f5db8942d28ec5bc2425f938d7c8c6be56173",
      "new_mode": 33188,
      "new_path": "include/linux/sched.h"
    },
    {
      "type": "modify",
      "old_id": "736fb8fd8977bd0a1cfd8e3129962f48e5d39138",
      "old_mode": 33188,
      "old_path": "kernel/sched_rt.c",
      "new_id": "c2730a5a4f056c04526cb56008b772fe26712072",
      "new_mode": 33188,
      "new_path": "kernel/sched_rt.c"
    }
  ]
}