)]}'
{
  "commit": "136d5c17b58d0135767ba81f4359c2d3c971876d",
  "tree": "582fc44b7de31b6c823ca42d22b4b5ace303a783",
  "parents": [
    "568b7c7eaee65b38bca4eba455e0c4c7234ae76c"
  ],
  "author": {
    "name": "Rupert Swarbrick",
    "email": "rupert.swarbrick@argondesign.com",
    "time": "Thu Sep 07 13:56:48 2017 +0100"
  },
  "committer": {
    "name": "Rupert Swarbrick",
    "email": "rupert.swarbrick@argondesign.com",
    "time": "Wed Sep 13 11:01:27 2017 +0000"
  },
  "message": "Simplify get_partition() implementation\n\nThis function is given a bsize and an mi array and has to figure out\nwhat partition to use to divide the given bsize in the direction of\nthe sizes it finds in the mi array. (Since each block size can be\nreached by only one sequence of partitions, this can be done\nunambiguously)\n\nThe previous version was correct, working by looking up entries in the\npartition_lookup array. Unfortunately, that lookup isn\u0027t quite enough\nwhen CONFIG_EXT_PARTITION_TYPES is true, so it then had to do some\nslightly confusing computations to fix things up after the fact.\n\nThe new version should be more self-explanatory and doesn\u0027t work by\nlooking things up in a magic array. It looks up the width and height\ncorresponding to bsize and compares them with the width and height\ncorresponding to the sb_type at mi_row,mi_col in the mi array. When\nCONFIG_EXT_PARTITION_TYPES is false, this is all you need, and the\nfour corresponding cases can be found by a lookup in an array of 4\nelements.\n\nWith extended partition types and a sufficiently large block, you have\nto do a bit more searching. For example, if bsize is BLOCK_16X16 and\nthe subsize is BLOCK_8X8, the partition might be PARTITION_SPLIT, but\nit might be one of PARTITION_HORZ_A or PARTITION_VERT_A instead. The\nnew code adds some comments to explain what\u0027s going on.\n\nA nice side-effect of rewriting get_partition in this way is that it\nlets us completely dispense with the partition_lookup array.\n\nThe patch also fixes comments for the A/B extended partitions in\nenums.h, which were slightly backwards (a \"horizontal split means two\nblocks vertically above one another)\n\nChange-Id: I4b48189103aa63e1859f25a15d7690d53ca7baf5\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "ee8d3bf3c8e3194f0bca57a1a648113ebad35505",
      "old_mode": 33188,
      "old_path": "av1/common/common_data.h",
      "new_id": "1e5e184c40bd48b31b7fcbc717b3764c07547f5b",
      "new_mode": 33188,
      "new_path": "av1/common/common_data.h"
    },
    {
      "type": "modify",
      "old_id": "31c54fbca3cd95d96b910a6e50824717c164d252",
      "old_mode": 33188,
      "old_path": "av1/common/enums.h",
      "new_id": "fda6a86bf078bb44f56b8354ea30ce67860d59cb",
      "new_mode": 33188,
      "new_path": "av1/common/enums.h"
    },
    {
      "type": "modify",
      "old_id": "4dc7a3e2bf46981cd1d2a2f24045288336bc1e4d",
      "old_mode": 33188,
      "old_path": "av1/common/onyxc_int.h",
      "new_id": "ebf7ea47e2c68f75b355f41c5cf90876a0fda259",
      "new_mode": 33188,
      "new_path": "av1/common/onyxc_int.h"
    }
  ]
}