)]}'
{
  "commit": "ad2a3f13b7258a5daaaeb8cff9f835aac468b71d",
  "tree": "ac9ea87be655aba0a372b6b4a25215547da0e291",
  "parents": [
    "7ea56616ba6b3d67a4892728182e38ae162ea3e7"
  ],
  "author": {
    "name": "Peter Zijlstra",
    "email": "a.p.zijlstra@chello.nl",
    "time": "Thu Jun 19 09:06:57 2008 +0200"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Thu Jun 19 09:06:57 2008 +0200"
  },
  "message": "sched: rt-group: heirarchy aware throttle\n\nThe bandwidth throttle code dequeues a group when it runs out of quota, and\nre-queues it once the period rolls over and the quota gets refreshed.\n\nSadly it failed to take the hierarchy into consideration. Share more of the\nenqueue/dequeue code with regular task opterations.\n\nAlso, some operations like sched_setscheduler() can dequeue/enqueue tasks that\nare in throttled runqueues, we should not inadvertly re-enqueue empty runqueues\nso check for that.\n\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nTested-by: Daniel K. \u003cdk@uw.no\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "3432d573205d415d8a02070c3f59d3ab2f68fbbb",
      "old_mode": 33188,
      "old_path": "kernel/sched_rt.c",
      "new_id": "837241568d767a2f0b25298544921088bfba4941",
      "new_mode": 33188,
      "new_path": "kernel/sched_rt.c"
    }
  ]
}