)]}'
{
  "commit": "bb065afb8ebd07a03155502dba29ebf0f6fe67e8",
  "tree": "aa32a9461cd38f336797cfba4d07c58789a6f1be",
  "parents": [
    "a98a3c3fde3ae7614f19758a043691b6f59dac53"
  ],
  "author": {
    "name": "Steven Rostedt",
    "email": "rostedt@goodmis.org",
    "time": "Mon May 12 21:21:00 2008 +0200"
  },
  "committer": {
    "name": "Thomas Gleixner",
    "email": "tglx@linutronix.de",
    "time": "Fri May 23 21:50:21 2008 +0200"
  },
  "message": "lockdep: update lockdep_recursion on graph_lock\n\nWith the introduction of ftrace, it is possible to recurse into\nthe lockdep functions via the mcount call. To prevent possible\nlockups, updating the lockdep_recursion counter on grabbing the internal\nlockdep_lock should prevent deadlocks.\n\nSigned-off-by: Steven Rostedt \u003csrostedt@redhat.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Thomas Gleixner \u003ctglx@linutronix.de\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "90a440cbd6de32786150a9f865d800d02fa76b4b",
      "old_mode": 33188,
      "old_path": "kernel/lockdep.c",
      "new_id": "65548eff029e4d61360d5a29626bce3f64ffaae1",
      "new_mode": 33188,
      "new_path": "kernel/lockdep.c"
    }
  ]
}