1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
/*
* stats.c - various routines to do stats on the key graph
*
* Copyright 2000-2004,2007-2009 Jonathan McDowell <noodles@earth.li>
*
* 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 <https://www.gnu.org/licenses/>.
*/
/* MOSTSIGNED
SIGNSMOST
SIGNS <key>
SIGS <key>
SIXDEGREES <keyid>
MAXPATH
key_getsigs - get the sigs for a key.
key_getsigns - get the keys a key signs. */
#ifndef __STATS_H__
#define __STATS_H__
#include <inttypes.h>
#include <stdbool.h>
#include "keydb.h"
#include "ll.h"
/**
* @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;
};
/**
* initcolour - Clear the key graph ready for use.
* @parent: Do we want to clear the parent pointers too?
*
* Clears the parent and colour information on all elements in the key
* graph.
*/
void initcolour(bool parent);
/**
* findpath - Given 2 keys finds a path between them.
* @have: The key we have.
* @want: The key we want to get to.
*
* 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.
*/
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 onak_dbctx *dbctx, struct stats_key *have);
#endif /* __STATS_H__ */
|
