X-Git-Url: https://the.earth.li/gitweb/?p=onak.git;a=blobdiff_plain;f=stats.h;h=08d2eb6313f24f4ba9626168db9f6767e8e8df06;hp=df32ab66189a6345e4f2c20c58f55f4bc751239d;hb=58ed9a0076feb9604154b99da6ed1907ca7df089;hpb=4aafe74aea2d616a5d9611c6e3c01a182a0b37ec

diff --git a/stats.h b/stats.h
index df32ab6..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 <noodles@earth.li>
+ * Copyright 2000-2004,2007-2009 Jonathan McDowell <noodles@earth.li>
  *
- * 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 <https://www.gnu.org/licenses/>.
  */
 
 /* MOSTSIGNED
@@ -19,26 +29,32 @@ key_getsigns - get the keys a key signs. */
 #ifndef __STATS_H__
 #define __STATS_H__
 
-#include <stdbool.h>
-// #include <stdint.h>
 #include <inttypes.h>
+#include <stdbool.h>
 
+#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,20 +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(uint64_t have, uint64_t want, bool html);
+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__ */