X-Git-Url: https://git.sommitrealweird.co.uk/onak.git/blobdiff_plain/4b8483ae278577a3adc8d84da81d77019704466f..576754568dc383e78065e88e05eeb2d078524f9c:/stats.h?ds=inline diff --git a/stats.h b/stats.h index af9f79f..bad00fe 100644 --- a/stats.h +++ b/stats.h @@ -4,6 +4,8 @@ * Jonathan McDowell * * Copyright 2002 Project Purple + * + * $Id: stats.h,v 1.5 2003/06/04 20:57:13 noodles Exp $ */ /* MOSTSIGNED @@ -19,28 +21,12 @@ key_getsigns - get the keys a key signs. */ #ifndef __STATS_H__ #define __STATS_H__ -#include -// #include #include +#include +#include "keystructs.h" #include "ll.h" -/** - * struct stats_key - holds key details suitable for doing stats on. - * @keyid: The keyid. - * @colour: Used for marking during DFS/BFS. - * @parent: The key that lead us to this one for DFS/BFS. - * @sigs: A linked list of the signatures on this key. - * @gotsigs: A bool indicating if we've initialized the sigs element yet. - */ -struct stats_key { - uint64_t keyid; - int colour; - uint64_t parent; - struct ll *sigs; - bool gotsigs; -}; - /** * initcolour - Clear the key graph ready for use. * @parent: Do we want to clear the parent pointers too? @@ -61,6 +47,18 @@ 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. + * @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, int count); struct stats_key *furthestkey(struct stats_key *have);