X-Git-Url: https://the.earth.li/gitweb/?a=blobdiff_plain;f=maxpath.c;h=b0d2e9a9c6a716a2f4f6368ee4c1e6f1b9179911;hb=7f1c2d9ec737a90d4d216f59ccb8b93f9054c472;hp=0bb5fcf1aca5aa7b2a6f4aaeb359cbee2c889b78;hpb=5913c95f2c7abf4c3cb06e27d384d80fb4c83547;p=onak.git diff --git a/maxpath.c b/maxpath.c index 0bb5fcf..b0d2e9a 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.10 2003/10/15 21:15:21 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,12 +66,12 @@ 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(); + readconfig(NULL); initdb(); inithash(); findmaxpath(30);