)]}'
{
  "commit": "8dfd47aab1f20d4d08326932a4b80b36c2865a45",
  "tree": "7349912ef312601b37d3f505944a1d85dd342b45",
  "parents": [
    "7327a003b2588845698b0993c454719a1f7005dc"
  ],
  "author": {
    "name": "Mike McTernan",
    "email": "mikemcternan@google.com",
    "time": "Tue Jun 16 12:25:29 2026 +0100"
  },
  "committer": {
    "name": "Android Build Coastguard Worker",
    "email": "android-build-coastguard-worker@google.com",
    "time": "Mon Jul 13 18:07:25 2026 -0700"
  },
  "message": "libufdt: Fix stack overflow risk in vendor qsort\n\nOptimize the qsort implementation in libufdt_sysdeps_vendor.c by\nrecursing on the smaller partition and iterating on the larger\npartition. This limits the maximum recursion depth to O(log n)\nstack frames, preventing potential stack overflows on large or\nadversarial inputs.\n\nBug: 509980995\nTest: Standalone test suite (1M elements, ASan/UBSan/Valgrind passed)\nTest: tests/run_tests.sh\nTest: tests/run_performance_test.sh\nFlag: EXEMPT BUGFIX\nCherrypick-From: https://googleplex-android-review.googlesource.com/q/commit:df9856866b8d8b19058beb8e418c588cd47c60dc\nCherrypick-From: https://googleplex-android-review.googlesource.com/q/commit:3ddb2cd7727cc2b7d0f5b5330aadb93aa21943ba\nMerged-In: I260075b5280433ae59b61edef9b30cb6610bd02f\nChange-Id: I260075b5280433ae59b61edef9b30cb6610bd02f\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "fc5b1869dbd7bb35ae44f0696469d7bdb6c0fe71",
      "old_mode": 33188,
      "old_path": "sysdeps/libufdt_sysdeps_vendor.c",
      "new_id": "57d334a5d159e2c39b77b61a1ee4206f75abba8b",
      "new_mode": 33188,
      "new_path": "sysdeps/libufdt_sysdeps_vendor.c"
    }
  ]
}