From 0d4c6e272d7f8545d0fbf2e28df4aef6750c5546 Mon Sep 17 00:00:00 2001 From: James Shubin Date: Thu, 27 Mar 2025 06:09:08 -0400 Subject: [PATCH] lib: Add timing for topological sort At least for consistency with everyone else... --- lib/main.go | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lib/main.go b/lib/main.go index 0a57d022..db4d3907 100644 --- a/lib/main.go +++ b/lib/main.go @@ -972,6 +972,7 @@ func (obj *Main) Run() error { Logf("send/recv building took: %s", time.Since(timing)) // Double check before we commit. + timing = time.Now() if err := obj.ge.Apply(func(graph *pgraph.Graph) error { _, e := graph.TopologicalSort() // am i a dag or not? return e @@ -980,6 +981,7 @@ func (obj *Main) Run() error { Logf("error running the TopologicalSort: %+v", err) continue } + Logf("resource topological sort took: %s", time.Since(timing)) // TODO: do we want to do a transitive reduction? // FIXME: run a type checker that verifies all the send->recv relationships