)]}'
{
  "commit": "9d48902108d2ed0b04ea862d7d3aa8bf14e17f47",
  "tree": "4dad8139d19ca04c4551180170625c03e59d468d",
  "parents": [
    "9dcc97dcdaa29dbe7698d76749954d0635e63234"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Tue Jun 06 19:34:39 2023 -0400"
  },
  "committer": {
    "name": "Boringssl LUCI CQ",
    "email": "boringssl-scoped@luci-project-accounts.iam.gserviceaccount.com",
    "time": "Wed Jun 07 17:36:09 2023 +0000"
  },
  "message": "Remove a pointer indirection in STACK_OF(T) comparisons\n\nAt the public API, the comparison functions are a double pointer to\nmatch qsort. qsort comparators are passed pointers to the list elements,\nand our list elements are T*. qsort needs this indirection because it\ncan sort values of arbitrary size. However, our type-erased versions\nhave no such constraints. Since we know our all elements are pointers,\nwe can skip the indirection.\n\nChange-Id: Ibb102b51a5aaf0a68a7318bf14ec8f4f9c7a3daf\nReviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/60506\nReviewed-by: Bob Beck \u003cbbe@google.com\u003e\nCommit-Queue: David Benjamin \u003cdavidben@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "4f4f1dfc234854ed890d8e002a81a368a752026f",
      "old_mode": 33188,
      "old_path": "crypto/stack/stack.c",
      "new_id": "a11533ed517863a8211aa46c50276e27ad10c2bf",
      "new_mode": 33188,
      "new_path": "crypto/stack/stack.c"
    },
    {
      "type": "modify",
      "old_id": "ce92be67e8a77c47721deed40d8c399daf91c590",
      "old_mode": 33188,
      "old_path": "include/openssl/stack.h",
      "new_id": "7d5d4d7e339fa568871241c733668c326c6df900",
      "new_mode": 33188,
      "new_path": "include/openssl/stack.h"
    }
  ]
}