commit | 7a5ec79c4872ea602b1cb38191379d145845b13b | [log] [tgz] |
---|---|---|
author | Zvonimir Pavlinovic <zpavlinovic@google.com> | Fri Jun 10 12:31:20 2022 -0700 |
committer | Zvonimir Pavlinovic <zpavlinovic@google.com> | Wed Jun 29 21:28:08 2022 +0000 |
tree | 59997f7cc96118fce85f03e508d6e05214d20378 | |
parent | 4eb5ba49563c9e5a65a0ab432d19aecf1d1222ec [diff] |
vulncheck: make call stack search faster while preserving determinism We sort edges while doing call stack search instead of sorting edges in the vulnerability call graph (which is not promised to clients anyhow). We can use the structure of call stack search to do sorting in a smart way. This reduces k8s and vault times by 7 and 5 seconds, resp. Change-Id: I46b6623fd6543fdef898d991b7f29f228ca59d91 Reviewed-on: https://go-review.googlesource.com/c/vuln/+/412194 Run-TryBot: Zvonimir Pavlinovic <zpavlinovic@google.com> Reviewed-by: Jonathan Amsterdam <jba@google.com> TryBot-Result: Gopher Robot <gobot@golang.org>
This repository contains the following:
The code in this repository is under active development and not to be considered stable.
Unless otherwise noted, the Go source files are distributed under the BSD-style license found in the LICENSE file.
Database entries available at https://vuln.go.dev are distributed under the terms of the CC-BY 4.0 license.