* @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);