)]}'
{
  "commit": "829713eb572b476cd6784eb2750cb5ea7ee13227",
  "tree": "476c85cbc9ab3a123671438cf6e3f6b9ce2aa695",
  "parents": [
    "893640cf98e3520e685edbc1e45b0f4203a59e89"
  ],
  "author": {
    "name": "Darrick J. Wong",
    "email": "djwong@kernel.org",
    "time": "Mon Mar 06 19:53:06 2023 -0800"
  },
  "committer": {
    "name": "Darrick J. Wong",
    "email": "djwong@kernel.org",
    "time": "Tue Sep 12 13:00:07 2023 -0700"
  },
  "message": "xfs: improve xfarray quicksort pivot\n\nNow that we have the means to do insertion sorts of small in-memory\nsubsets of an xfarray, use it to improve the quicksort pivot algorithm\nby reading 7 records into memory and finding the median of that.  This\nshould prevent bad partitioning when a[lo] and a[hi] end up next to each\nother in the final sort, which can happen when sorting for cntbt repair\nwhen the free space is extremely fragmented (e.g. generic/176).\n\nThis doesn\u0027t speed up the average quicksort run by much, but it will\n(hopefully) avoid the quadratic time collapse for which quicksort is\nfamous.\n\nSigned-off-by: Darrick J. Wong \u003cdjwong@kernel.org\u003e\nReviewed-by: Kent Overstreet \u003ckent.overstreet@linux.dev\u003e\nReviewed-by: Dave Chinner \u003cdchinner@redhat.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "18cc734ab0f483291a7100e62948666555ffc439",
      "old_mode": 33188,
      "old_path": "fs/xfs/scrub/xfarray.c",
      "new_id": "f0f532c10a5accc5d861fbe052e13020855908d7",
      "new_mode": 33188,
      "new_path": "fs/xfs/scrub/xfarray.c"
    },
    {
      "type": "modify",
      "old_id": "091614e7f6836cf3558dfb99c98b5991fe699d29",
      "old_mode": 33188,
      "old_path": "fs/xfs/scrub/xfarray.h",
      "new_id": "4ecac01363d9f645ff9ce79e9dff934a8af5ded5",
      "new_mode": 33188,
      "new_path": "fs/xfs/scrub/xfarray.h"
    }
  ]
}