)]}'
{
  "commit": "46b6135a7402ac23c5b25f2bd79b03bab8f98278",
  "tree": "8430c191a455b1ff48c62229731ded4cbc71a9a1",
  "parents": [
    "60670b8034d6e2ba860af79c9379b7788d09db73"
  ],
  "author": {
    "name": "Michel Lespinasse",
    "email": "walken@google.com",
    "time": "Mon Oct 08 16:31:11 2012 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@linux-foundation.org",
    "time": "Tue Oct 09 16:22:37 2012 +0900"
  },
  "message": "rbtree: handle 1-child recoloring in rb_erase() instead of rb_erase_color()\n\nAn interesting observation for rb_erase() is that when a node has\nexactly one child, the node must be black and the child must be red.\nAn interesting consequence is that removing such a node can be done by\nsimply replacing it with its child and making the child black,\nwhich we can do efficiently in rb_erase(). __rb_erase_color() then\nonly needs to handle the no-childs case and can be modified accordingly.\n\nSigned-off-by: Michel Lespinasse \u003cwalken@google.com\u003e\nAcked-by: Rik van Riel \u003criel@redhat.com\u003e\nCc: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nCc: Andrea Arcangeli \u003caarcange@redhat.com\u003e\nCc: David Woodhouse \u003cdwmw2@infradead.org\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "bde1b5c5fb33d4f45266c844b62412a90d86baec",
      "old_mode": 33188,
      "old_path": "lib/rbtree.c",
      "new_id": "80b092538fa94bc1e3d93a803e05497c6f299ebf",
      "new_mode": 33188,
      "new_path": "lib/rbtree.c"
    }
  ]
}