X-Git-Url: https://git.sommitrealweird.co.uk/onak.git/blobdiff_plain/4b8483ae278577a3adc8d84da81d77019704466f..9b511d8943fa34c9dd09999a4a72ae8405f34164:/stats.h?ds=sidebyside

diff --git a/stats.h b/stats.h
index af9f79f..df32ab6 100644
--- a/stats.h
+++ b/stats.h
@@ -61,6 +61,17 @@ void initcolour(bool parent);
  */
 unsigned long findpath(struct stats_key *have, struct stats_key *want);
 
+/**
+ *	dofindpath - Given 2 keys displays a path between them.
+ *	@have: The key we have.
+ *	@want: The key we want to get to.
+ *	@html: Should we output in html.
+ *
+ *	This does a breadth first search on the key tree, starting with the
+ *	key we have. It returns as soon as a path is found or when we run out
+ *	of keys; whichever comes sooner.
+ */
+void dofindpath(uint64_t have, uint64_t want, bool html);
 
 struct stats_key *furthestkey(struct stats_key *have);