2 * sixdegrees.c - List the size of the six degrees of trust away from a key.
4 * Copyright 2001-2002 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 #include "keystructs.h"
30 #include "onak-conf.h"
33 unsigned long countdegree(struct onak_dbctx *dbctx,
34 struct stats_key *have, bool sigs, int maxdegree)
36 unsigned long count = 0, curdegree = 0;
37 struct ll *curll, *nextll, *sigll, *tmp;
38 struct stats_key *key = NULL;
43 curll = lladd(NULL, have);
45 while (curll != NULL && curdegree <= maxdegree) {
47 sigll = dbctx->cached_getkeysigs(dbctx,
49 curll->object)->keyid);
52 key = findinhash(((struct stats_key *)
53 curll->object)->keyid);
58 while (sigll != NULL) {
59 if (((struct stats_key *) sigll->object)->colour==0) {
60 /* We've never seen it. Count it, mark it and
61 explore its subtree */
63 ((struct stats_key *)sigll->object)->colour =
65 ((struct stats_key *)sigll->object)->parent =
67 curll->object)->keyid;
68 nextll=lladd(nextll, sigll->object);
93 void sixdegrees(struct onak_dbctx *dbctx, uint64_t keyid)
95 struct stats_key *keyinfo;
100 dbctx->cached_getkeysigs(dbctx, keyid);
102 if ((keyinfo = findinhash(keyid)) == NULL) {
103 printf("Couldn't find key 0x%016" PRIX64 ".\n", keyid);
107 uid = dbctx->keyid2uid(dbctx, keyinfo->keyid);
108 printf("Six degrees for 0x%016" PRIX64 " (%s):\n", keyinfo->keyid,
114 * Cheat. This prefills the ->sign part of all the keys we want to
115 * look at so that we can output that info at the same time as the
116 * signers. However we're assuming that the signers and signees are
117 * reasonably closely related otherwise the info is wildly off - the
118 * only way to get 100% accurate results is to examine every key to see
119 * if it's signed by the key we're looking at.
122 countdegree(dbctx, keyinfo, true, 7);
124 puts("\t\tSigned by\t\tSigns");
125 for (loop = 1; loop < 7; loop++) {
127 degree = countdegree(dbctx, keyinfo, true, loop);
128 printf("Degree %d:\t%8ld", loop, degree);
131 degree = countdegree(dbctx, keyinfo, false, loop);
132 printf("\t\t%8ld\n", degree);
136 int main(int argc, char *argv[])
139 char *configfile = NULL;
140 uint64_t keyid = 0x2DA8B985;
141 struct onak_dbctx *dbctx;
143 while ((optchar = getopt(argc, argv, "c:")) != -1 ) {
146 if (configfile != NULL) {
149 configfile = strdup(optarg);
155 keyid = strtoll(argv[optind], NULL, 16);
158 readconfig(configfile);
160 initlogthing("sixdegrees", config.logfile);
161 dbctx = config.dbinit(true);
164 sixdegrees(dbctx, dbctx->getfullkeyid(dbctx, keyid));
166 dbctx->cleanupdb(dbctx);
168 fprintf(stderr, "Couldn't initialize key database.\n");