)]}'
{
  "commit": "c740ad92d0d958fa785e5d7aa1b67ecaf30a6a54",
  "tree": "9294b5dcdf00456ad6f8823ef7891d76ff45e003",
  "parents": [
    "6d86ae0824bdd6175dd3874688a871e981093888"
  ],
  "author": {
    "name": "Paolo Bonzini",
    "email": "pbonzini@redhat.com",
    "time": "Tue Dec 02 12:05:47 2014 +0100"
  },
  "committer": {
    "name": "Stefan Hajnoczi",
    "email": "stefanha@redhat.com",
    "time": "Tue Jan 13 13:43:29 2015 +0000"
  },
  "message": "QSLIST: add lock-free operations\n\nThese operations are trivial to implement and do not have ABA problems.\nThey are enough to implement simple multiple-producer, single consumer\nlock-free lists or, as in the next patch, the multiple consumers can\nsteal a whole batch of elements and process them at their leisure.\n\nSigned-off-by: Paolo Bonzini \u003cpbonzini@redhat.com\u003e\nReviewed-by: Fam Zheng \u003cfamz@redhat.com\u003e\nMessage-id: 1417518350-6167-5-git-send-email-pbonzini@redhat.com\nSigned-off-by: Stefan Hajnoczi \u003cstefanha@redhat.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "42bcadfbb12c1ff48a3a0c680ec72efeafe9205a",
      "old_mode": 33188,
      "old_path": "include/qemu/queue.h",
      "new_id": "a98eb3ad795537b31568d5881eecd7f7089abde9",
      "new_mode": 33188,
      "new_path": "include/qemu/queue.h"
    }
  ]
}