)]}'
{
  "commit": "e08b09983fe9cf379faf1aefdf9164268d4610e7",
  "tree": "579988b32bba063fa5e143b01887eb525176fc98",
  "parents": [
    "e9bef55d3d062ee7a78fde2913ec87ca9305a1e0"
  ],
  "author": {
    "name": "Jesper Dangaard Brouer",
    "email": "hawk@comx.dk",
    "time": "Wed Sep 12 16:36:28 2007 +0200"
  },
  "committer": {
    "name": "David S. Miller",
    "email": "davem@sunset.davemloft.net",
    "time": "Wed Oct 10 16:49:20 2007 -0700"
  },
  "message": "[NET_SCHED]: Making rate table lookups more flexible.\n\nThis is done in order to, add support to changing the rate table to\nuse the upper-boundry L2T (length to time) value. Currently we use the\nlower-boundry, which result in under-estimating the actual bandwidth\nusage.\n\nExtend the tc_ratespec struct, with two parameters: 1) \"cell_align\"\nthat allow adjusting the alignment of the rate table. 2) \"overhead\"\nthat allow adding a packet overhead before the lookup.\n\nSigned-off-by: Jesper Dangaard Brouer \u003chawk@comx.dk\u003e\nAcked-by: Patrick McHardy \u003ckaber@trash.net\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "268c51599eb8dc9343ffcdc6ef76e161858f6772",
      "old_mode": 33188,
      "old_path": "include/linux/pkt_sched.h",
      "new_id": "919af93b70596e70a06bdd10363c1d57a1aa50f4",
      "new_mode": 33188,
      "new_path": "include/linux/pkt_sched.h"
    },
    {
      "type": "modify",
      "old_id": "4ebd615bd013e4cd8331cb6e7e89b39e05ab5e0c",
      "old_mode": 33188,
      "old_path": "include/net/sch_generic.h",
      "new_id": "a02ec9e5fea51934666d4b18085b0bcbd682f86a",
      "new_mode": 33188,
      "new_path": "include/net/sch_generic.h"
    }
  ]
}