X-Git-Url: https://the.earth.li/gitweb/?a=blobdiff_plain;f=stats.h;h=bad00fe75456c8759f90354e4632c856ca1de9ba;hb=b46987cfe602a9a7e2c98bae1528b4a6cdf3e56e;hp=4b7cf09ffa0f03cfa807890491720e3da11b42ab;hpb=5913c95f2c7abf4c3cb06e27d384d80fb4c83547;p=onak.git

diff --git a/stats.h b/stats.h
index 4b7cf09..bad00fe 100644
--- a/stats.h
+++ b/stats.h
@@ -4,6 +4,8 @@
  * Jonathan McDowell <noodles@earth.li>
  *
  * Copyright 2002 Project Purple
+ *
+ * $Id: stats.h,v 1.5 2003/06/04 20:57:13 noodles Exp $
  */
 
 /* MOSTSIGNED
@@ -50,12 +52,13 @@ unsigned long findpath(struct stats_key *have, struct stats_key *want);
  *	@have: The key we have.
  *	@want: The key we want to get to.
  *	@html: Should we output in html.
+ *	@count: How many paths we should look for at most.
  *
  *	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);
+void dofindpath(uint64_t have, uint64_t want, bool html, int count);
 
 struct stats_key *furthestkey(struct stats_key *have);