)]}'
{
  "commit": "67e86250f8ea7b8f7da53ac25ea73c6bd71f5cd9",
  "tree": "9e429bdc568172f00e81aa4dcb57796ed0d404dd",
  "parents": [
    "e33078baa4d30ad1d0e46d1f62b9e5a63a3e6ee3"
  ],
  "author": {
    "name": "Paul Turner",
    "email": "pjt@google.com",
    "time": "Mon Nov 15 15:47:05 2010 -0800"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Thu Nov 18 13:27:48 2010 +0100"
  },
  "message": "sched: Introduce hierarchal order on shares update list\n\nAvoid duplicate shares update calls by ensuring children always appear before\nparents in rq-\u003eleaf_cfs_rq_list.\n\nThis allows us to do a single in-order traversal for update_shares().\n\nSince we always enqueue in bottom-up order this reduces to 2 cases:\n\n1) Our parent is already in the list, e.g.\n\n   root\n     \\\n      b\n      /\\\n      c d* (root-\u003eb-\u003ec already enqueued)\n\nSince d\u0027s parent is enqueued we push it to the head of the list, implicitly ahead of b.\n\n2) Our parent does not appear in the list (or we have no parent)\n\nIn this case we enqueue to the tail of the list, if our parent is subsequently enqueued\n(bottom-up) it will appear to our right by the same rule.\n\nSigned-off-by: Paul Turner \u003cpjt@google.com\u003e\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nLKML-Reference: \u003c20101115234938.022488865@google.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "a543a5b202a42af4fa9e122a35665d1ad9304529",
      "old_mode": 33188,
      "old_path": "kernel/sched_fair.c",
      "new_id": "b320753aa6c92178da0b9ca91147fb46fcc76012",
      "new_mode": 33188,
      "new_path": "kernel/sched_fair.c"
    }
  ]
}