)]}'
{
  "commit": "452f24ae94f38afa3704d4361d91d51218405c0a",
  "tree": "3d621153728412ca9be6cd950970ba24814ba6c5",
  "parents": [
    "656d3f4401e1fdb628e24027cf91cc803c7a0dac"
  ],
  "author": {
    "name": "Russ Cox",
    "email": "rsc@golang.org",
    "time": "Wed Feb 02 16:41:32 2022 -0500"
  },
  "committer": {
    "name": "Russ Cox",
    "email": "rsc@golang.org",
    "time": "Thu Feb 10 15:23:05 2022 +0000"
  },
  "message": "regexp/syntax: reject very deeply nested regexps in Parse\n\nThe regexp code assumes it can recurse over the structure of\na regexp safely. Go\u0027s growable stacks make that reasonable\nfor all plausible regexps, but implausible ones can reach the\n“infinite recursion?” stack limit.\n\nThis CL limits the depth of any parsed regexp to 1000.\nThat is, the depth of the parse tree is required to be ≤ 1000.\nRegexps that require deeper parse trees will return ErrInternalError.\nA future CL will change the error to ErrInvalidDepth,\nbut using ErrInternalError for now avoids introducing new API\nin point releases when this is backported.\n\nFixes #51112.\n\nChange-Id: I97d2cd82195946eb43a4ea8561f5b95f91fb14c5\nReviewed-on: https://go-review.googlesource.com/c/go/+/384616\nTrust: Russ Cox \u003crsc@golang.org\u003e\nRun-TryBot: Russ Cox \u003crsc@golang.org\u003e\nReviewed-by: Ian Lance Taylor \u003ciant@golang.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "06a92fb3d75322a89987d410b2f794c4039df242",
      "old_mode": 33188,
      "old_path": "src/regexp/syntax/parse.go",
      "new_id": "0f6587ab27f313b7d80b6a3237f497d527e9a0c5",
      "new_mode": 33188,
      "new_path": "src/regexp/syntax/parse.go"
    },
    {
      "type": "modify",
      "old_id": "5581ba1ca5ee29bad6fb6c2ae314b513a01931ff",
      "old_mode": 33188,
      "old_path": "src/regexp/syntax/parse_test.go",
      "new_id": "1ef6d8a3fe09ba9034fef1c2a4dda6c7784c2d26",
      "new_mode": 33188,
      "new_path": "src/regexp/syntax/parse_test.go"
    }
  ]
}