)]}'
{
  "commit": "7a232e0350940d2664f4de5cc3f0f443bae5062d",
  "tree": "bb91a53faab7bf6e92df127f8bdb2225cf808925",
  "parents": [
    "2e084786f6fe052274f1dfa7c675fe4a02cacd6e"
  ],
  "author": {
    "name": "Lai Jiangshan",
    "email": "laijs@cn.fujitsu.com",
    "time": "Thu Jun 12 16:43:07 2008 +0800"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Thu Jun 12 14:29:54 2008 +0200"
  },
  "message": "sched: 64-bit: fix arithmetics overflow\n\n(overflow means weight \u003e\u003d 2^32 here, because inv_weigh \u003d 2^32/weight)\n\nA weight of a cfs_rq is the sum of weights of which entities\nare queued on this cfs_rq, so it will overflow when there are\ntoo many entities.\n\nAlthough, overflow occurs very rarely, but it break fairness when\nit occurs. 64-bits systems have more memory than 32-bit systems\nand 64-bit systems can create more process usually, so overflow may\noccur more frequently.\n\nThis patch guarantees fairness when overflow happens on 64-bit systems.\nThanks to the optimization of compiler, it changes nothing on 32-bit.\n\nSigned-off-by: Lai Jiangshan \u003claijs@cn.fujitsu.com\u003e\nAcked-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": "6c1ecbdc0db9941ffa7c5698761e71aa36381009",
      "old_mode": 33188,
      "old_path": "kernel/sched.c",
      "new_id": "eaf6751e7612cbc5167865c8c1e4e929ff32ca5a",
      "new_mode": 33188,
      "new_path": "kernel/sched.c"
    }
  ]
}