X-Git-Url: http://the.earth.li/gitweb/?a=blobdiff_plain;f=stats.h;h=08d2eb6313f24f4ba9626168db9f6767e8e8df06;hb=76f079e5ebdb34acaaa2462a8d915ee06d3c8425;hp=af9f79fcbf7d4975bb063098c2b2f7493e0713c4;hpb=4b8483ae278577a3adc8d84da81d77019704466f;p=onak.git diff --git a/stats.h b/stats.h index af9f79f..08d2eb6 100644 --- a/stats.h +++ b/stats.h @@ -1,9 +1,19 @@ /* * stats.c - various routines to do stats on the key graph * - * Jonathan McDowell + * Copyright 2000-2004,2007-2009 Jonathan McDowell * - * Copyright 2002 Project Purple + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License as published by the Free + * Software Foundation; version 2 of the License. + * + * This program is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for + * more details. + * + * You should have received a copy of the GNU General Public License along with + * this program. If not, see . */ /* MOSTSIGNED @@ -19,26 +29,32 @@ key_getsigns - get the keys a key signs. */ #ifndef __STATS_H__ #define __STATS_H__ -#include -// #include #include +#include +#include "keydb.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. + * @brief Holds key details suitable for doing stats on. */ struct stats_key { + /** The keyid. */ uint64_t keyid; + /** Used for marking during DFS/BFS. */ int colour; + /** The key that lead us to this one for DFS/BFS. */ uint64_t parent; + /** A linked list of the signatures on this key. */ struct ll *sigs; + /** A linked list of the keys this key signs. */ + struct ll *signs; + /** A bool indicating if we've initialized the sigs element yet. */ bool gotsigs; + /** If we shouldn't consider the key in calculations. */ + bool disabled; + /** If the key is revoked (and shouldn't be considered). */ + bool revoked; }; /** @@ -59,9 +75,23 @@ void initcolour(bool parent); * key we have. It returns as soon as a path is found or when we run out * of keys; whichever comes sooner. */ -unsigned long findpath(struct stats_key *have, struct stats_key *want); +unsigned long findpath(struct onak_dbctx *dbctx, + 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(struct onak_dbctx *dbctx, + uint64_t have, uint64_t want, bool html, int count); -struct stats_key *furthestkey(struct stats_key *have); +struct stats_key *furthestkey(struct onak_dbctx *dbctx, struct stats_key *have); #endif /* __STATS_H__ */