)]}'
{
  "commit": "a64692a3afd85fe048551ab89142fd5ca99a0dbd",
  "tree": "7d2800efb7fb9e3aa5c99ab883004932fdc362c6",
  "parents": [
    "e12f31d3e5d36328c7fbd0fce40a95e70b59152c"
  ],
  "author": {
    "name": "Mike Galbraith",
    "email": "efault@gmx.de",
    "time": "Thu Mar 11 17:16:20 2010 +0100"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Thu Mar 11 18:32:50 2010 +0100"
  },
  "message": "sched: Cleanup/optimize clock updates\n\nNow that we no longer depend on the clock being updated prior to enqueueing\non migratory wakeup, we can clean up a bit, placing calls to update_rq_clock()\nexactly where they are needed, ie on enqueue, dequeue and schedule events.\n\nIn the case of a freshly enqueued task immediately preempting, we can skip the\nupdate during preemption, as the clock was just updated by the enqueue event.\nWe also save an unneeded call during a migratory wakeup by not updating the\nprevious runqueue, where update_curr() won\u0027t be invoked.\n\nSigned-off-by: Mike Galbraith \u003cefault@gmx.de\u003e\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nLKML-Reference: \u003c1268301199.6785.32.camel@marge.simson.net\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "68ed6f4f3c1398e0ef36c3719989afc06e0adeae",
      "old_mode": 33188,
      "old_path": "kernel/sched.c",
      "new_id": "16559de4edeafbe0d51542c934ced7951ee2bff8",
      "new_mode": 33188,
      "new_path": "kernel/sched.c"
    },
    {
      "type": "modify",
      "old_id": "c3b69d4b5d65049006d490e5de4d9ea8f0e2764d",
      "old_mode": 33188,
      "old_path": "kernel/sched_fair.c",
      "new_id": "69e582020ff89ac66908276dc8f9ae3b93831b37",
      "new_mode": 33188,
      "new_path": "kernel/sched_fair.c"
    }
  ]
}
