)]}'
{
  "commit": "024dc078558e64e4cebc62c096285430a61dd10e",
  "tree": "f1bc9f20c69d1245e1c7d70d384f3c17bcbdfa8c",
  "parents": [
    "7ca3a18b055ac6667f4e7e34eae6637270002402"
  ],
  "author": {
    "name": "Mark Brown",
    "email": "broonie@opensource.wolfsonmicro.com",
    "time": "Sun Oct 09 11:52:05 2011 +0100"
  },
  "committer": {
    "name": "Mark Brown",
    "email": "broonie@opensource.wolfsonmicro.com",
    "time": "Sun Oct 09 12:07:48 2011 +0100"
  },
  "message": "ASoC: Cache connected input and output recursions\n\nThe number of connected input and output endpoints for a given widgets\ncan\u0027t change during a DAPM run so there is no need to redo the recursion\nthrough branches of the tree we\u0027ve already visited. Doing this on one of\nmy test systems gives an improvement of:\n\n         Power    Path   Neighbour\nBefore:  63       607    731\nAfter:   63       141    181\n\nwhich scales up well as more widgets are involved in paths.\n\nSigned-off-by: Mark Brown \u003cbroonie@opensource.wolfsonmicro.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "e2853daf802ce0b1106c3fba3ab90a95778e3e27",
      "old_mode": 33188,
      "old_path": "include/sound/soc-dapm.h",
      "new_id": "bfefc16137ea37e7a9aa2981a1dfb35e2d40ce91",
      "new_mode": 33188,
      "new_path": "include/sound/soc-dapm.h"
    },
    {
      "type": "modify",
      "old_id": "22fb7355b1348ebf6aed0d7b416d0281e7d031b7",
      "old_mode": 33188,
      "old_path": "sound/soc/soc-dapm.c",
      "new_id": "258326b031cfa115304cab000b3a5ff7eb852d91",
      "new_mode": 33188,
      "new_path": "sound/soc/soc-dapm.c"
    }
  ]
}