from = to = tmp = NULL;
/*
- * My (noodles@earth.li, DSA) key is in the strongly connected set of
+ * My (noodles@earth.li, RSA) key is in the strongly connected set of
* keys, so we use it as a suitable starting seed.
*/
- cached_getkeysigs(0xF1BD4BE45B430367);
+ config.dbbackend->cached_getkeysigs(0x94FA372B2DA8B985);
/*
* Loop through the hash examining each key present and finding the
for (loop = 0; (loop < HASHSIZE) && (distance < max); loop++) {
curkey = gethashtableentry(loop);
while (curkey != NULL && distance < max) {
- cached_getkeysigs(((struct stats_key *)
+ config.dbbackend->cached_getkeysigs(
+ ((struct stats_key *)
curkey->object)->keyid);
initcolour(false);
tmp = furthestkey((struct stats_key *)
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 %"
+ PRIX64 " to %" PRIX64
+ " (%ld steps)\n",
loop,
from->keyid,
to->keyid,
curkey=curkey->next;
}
}
- printf("Max path is from %llX to %llX (%ld steps)\n",
+ printf("Max path is from %" PRIX64 " to %" PRIX64 " (%ld steps)\n",
from->keyid,
to->keyid,
distance);
{
readconfig(NULL);
initlogthing("maxpath", config.logfile);
- initdb(true);
+ config.dbbackend->initdb(true);
inithash();
findmaxpath(30);
printf("--------\n");
findmaxpath(30);
destroyhash();
- cleanupdb();
+ config.dbbackend->cleanupdb();
cleanuplogthing();
cleanupconfig();