)]}'
{
  "commit": "e2c880630438f80b474378d5487b511b07665051",
  "tree": "0f35b58cd657a3b50e03a93a12367ab82bd569ef",
  "parents": [
    "45a5c8bad827ebb9c9798becc15bce2e804d49e0"
  ],
  "author": {
    "name": "Rusty Russell",
    "email": "rusty@rustcorp.com.au",
    "time": "Tue Nov 03 14:53:15 2009 +1030"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Wed Nov 04 13:16:38 2009 +0100"
  },
  "message": "cpumask: Simplify sched_rt.c\n\nfind_lowest_rq() wants to call pick_optimal_cpu() on the\nintersection of sched_domain_span(sd) and lowest_mask.  Rather\nthan doing a cpus_and into a temporary, we can open-code it.\n\nThis actually makes the code slightly clearer, IMHO.\n\nSigned-off-by: Rusty Russell \u003crusty@rustcorp.com.au\u003e\nAcked-by: Gregory Haskins \u003cghaskins@novell.com\u003e\nCc: Steven Rostedt \u003crostedt@goodmis.org\u003e\nLKML-Reference: \u003c200911031453.15350.rusty@rustcorp.com.au\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "a4d790cddb1983196ba9881936d8abf7a8870dbe",
      "old_mode": 33188,
      "old_path": "kernel/sched_rt.c",
      "new_id": "5c5fef3784152396980cd81e5c6c9ebe87c0d93c",
      "new_mode": 33188,
      "new_path": "kernel/sched_rt.c"
    }
  ]
}