tree 59997f7cc96118fce85f03e508d6e05214d20378
parent 4eb5ba49563c9e5a65a0ab432d19aecf1d1222ec
author Zvonimir Pavlinovic <zpavlinovic@google.com> 1654889480 -0700
committer Zvonimir Pavlinovic <zpavlinovic@google.com> 1656538088 +0000

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>