0.3.5 release.

[onak.git] / stats.h

diff --git a/stats.h b/stats.h
index 4b7cf09ffa0f03cfa807890491720e3da11b42ab..3696e0849283cbd9e76a9e6e4f04532ca9e2753d 100644 (file)
--- a/stats.h
+++ b/stats.h
@@ -50,12 +50,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.
  *     @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.
  */
  *
  *     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);
 
 
 struct stats_key *furthestkey(struct stats_key *have);