2 * stats.c - various routines to do stats on the key graph
4 * Copyright 2000-2004,2007-2009 Jonathan McDowell <noodles@earth.li>
6 * This program is free software: you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License as published by the Free
8 * Software Foundation; version 2 of the License.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, write to the Free Software Foundation, Inc., 51
17 * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
27 key_getsigs - get the sigs for a key.
28 key_getsigns - get the keys a key signs. */
40 * @brief Holds key details suitable for doing stats on.
45 /** Used for marking during DFS/BFS. */
47 /** The key that lead us to this one for DFS/BFS. */
49 /** A linked list of the signatures on this key. */
51 /** A linked list of the keys this key signs. */
53 /** A bool indicating if we've initialized the sigs element yet. */
55 /** If we shouldn't consider the key in calculations. */
57 /** If the key is revoked (and shouldn't be considered). */
62 * initcolour - Clear the key graph ready for use.
63 * @parent: Do we want to clear the parent pointers too?
65 * Clears the parent and colour information on all elements in the key
68 void initcolour(bool parent);
71 * findpath - Given 2 keys finds a path between them.
72 * @have: The key we have.
73 * @want: The key we want to get to.
75 * This does a breadth first search on the key tree, starting with the
76 * key we have. It returns as soon as a path is found or when we run out
77 * of keys; whichever comes sooner.
79 unsigned long findpath(struct onak_dbctx *dbctx,
80 struct stats_key *have, struct stats_key *want);
83 * dofindpath - Given 2 keys displays a path between them.
84 * @have: The key we have.
85 * @want: The key we want to get to.
86 * @html: Should we output in html.
87 * @count: How many paths we should look for at most.
89 * This does a breadth first search on the key tree, starting with the
90 * key we have. It returns as soon as a path is found or when we run out
91 * of keys; whichever comes sooner.
93 void dofindpath(struct onak_dbctx *dbctx,
94 uint64_t have, uint64_t want, bool html, int count);
96 struct stats_key *furthestkey(struct onak_dbctx *dbctx, struct stats_key *have);
98 #endif /* __STATS_H__ */