X-Git-Url: https://git.sommitrealweird.co.uk/onak.git/blobdiff_plain/5913c95f2c7abf4c3cb06e27d384d80fb4c83547..71ad017abe933ba0dc7ed1b005074c4a5ab9978a:/maxpath.c diff --git a/maxpath.c b/maxpath.c index 0bb5fcf..922cc8c 100644 --- a/maxpath.c +++ b/maxpath.c @@ -1,9 +1,12 @@ /* - gpgstats.c - Program to produce stats on a GPG keyring. - Written by Jonathan McDowell . - - 19/02/2000 - Started writing (sort of). -*/ + * maxpath.c - Find the longest trust path in the key database. + * + * Jonathan McDowell + * + * Copyright 2001-2002 Project Purple. + * + * $Id: maxpath.c,v 1.11 2004/03/23 12:33:47 noodles Exp $ + */ #include #include @@ -24,8 +27,19 @@ void findmaxpath(unsigned long max) distance = 0; from = to = tmp = NULL; + + /* + * My (noodles@earth.li, DSA) key is in the strongly connected set of + * keys, so we use it as a suitable starting seed. + */ cached_getkeysigs(0xF1BD4BE45B430367); + /* + * Loop through the hash examining each key present and finding the + * furthest key from it. If it's further than our current max then + * store it as our new max and print out the fact we've found a new + * max. + */ for (loop = 0; (loop < HASHSIZE) && (distance < max); loop++) { curkey = gethashtableentry(loop); while (curkey != NULL && distance < max) { @@ -38,7 +52,8 @@ void findmaxpath(unsigned long max) from = (struct stats_key *)curkey->object; to = tmp; distance = to->colour; - printf("Current max path (#%ld) is from %llX to %llX (%ld steps)\n", + printf("Current max path (#%ld) is from %llX" + " to %llX (%ld steps)\n", loop, from->keyid, to->keyid, @@ -51,13 +66,13 @@ void findmaxpath(unsigned long max) from->keyid, to->keyid, distance); - dofindpath(to->keyid, from->keyid, false); + dofindpath(to->keyid, from->keyid, false, 1); } int main(int argc, char *argv[]) { - readconfig(); - initdb(); + readconfig(NULL); + initdb(true); inithash(); findmaxpath(30); printf("--------\n");