)]}'
{
  "commit": "449b29e8bd9fb1ae2e57cea7074e1b9778343455",
  "tree": "0f4d1897e1b17123a50f7351c74006badbd232da",
  "parents": [
    "c96e78dde1f118eaee4269aa2c91ef70850e5423"
  ],
  "author": {
    "name": "David Lamparter",
    "email": "equinox@opensourcerouting.org",
    "time": "Mon Jun 13 17:29:12 2016 +0200"
  },
  "committer": {
    "name": "Paul Jakma",
    "email": "paul@quagga.net",
    "time": "Mon Jan 23 18:51:53 2017 +0000"
  },
  "message": "lib: linklist: add listnode_add_before()\n\nThis utility function, to join the zoo that the Quagga linked-list\nimplementation has accumulated, does an insert-before while returning\nthe newly allocated node.\n\nIt is similar to:\n- listnode_add_after(), but\n  - complementary direction\n  - returns allocated node\n- list_add_node_prev(), but\n  - supports before \u003d\u003d NULL\n  - returns allocated node\n\nIn general, the entire linked-list implementation is in bad shape, and\nwhile it needs a cleanup / rewrite / replacement, this would both cause\nsignificant conflicts and block other cleanups...\n\nSigned-off-by: David Lamparter \u003cequinox@opensourcerouting.org\u003e\nSigned-off-by: David Lamparter \u003cequinox@opensourcerouting.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "4b16f07dd1c313c8d2113ceaa107b9ed219fc471",
      "old_mode": 33188,
      "old_path": "lib/linklist.c",
      "new_id": "8b6a8528262dcad1367ef9e349212c5dcd44cbae",
      "new_mode": 33188,
      "new_path": "lib/linklist.c"
    },
    {
      "type": "modify",
      "old_id": "6209c8b9d627e0c2a113f2eeed55670bd856f2e4",
      "old_mode": 33188,
      "old_path": "lib/linklist.h",
      "new_id": "96aaf4319602e0aea3ab7ee6da065f09cee6e7f7",
      "new_mode": 33188,
      "new_path": "lib/linklist.h"
    }
  ]
}