X-Git-Url: http://the.earth.li/gitweb/?p=onak.git;a=blobdiff_plain;f=maxpath.c;h=f088cc615274cc6eb24a55c73f7391c9f7feffef;hp=ccd500839fe00f0a0d5eddb801822af3597f25fa;hb=de18b56efecadc4b5d2473904828db9c08cd2162;hpb=e21d57328129d20ebef11143909ebc58bc0affce

diff --git a/maxpath.c b/maxpath.c
index ccd5008..f088cc6 100644
--- a/maxpath.c
+++ b/maxpath.c
@@ -1,16 +1,28 @@
 /*
  * maxpath.c - Find the longest trust path in the key database.
- * 
- * Jonathan McDowell <noodles@earth.li>
  *
- * Copyright 2001-2002 Project Purple.
+ * Copyright 2001-2002 Jonathan McDowell <noodles@earth.li>
+ *
+ * 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/>.
  */
 
+#include <getopt.h>
+#include <inttypes.h>
+#include <stdbool.h>
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
 
-#include "stats.h"
 #include "hash.h"
 #include "keydb.h"
 #include "ll.h"
@@ -18,7 +30,7 @@
 #include "onak-conf.h"
 #include "stats.h"
 
-void findmaxpath(unsigned long max)
+void findmaxpath(struct onak_dbctx *dbctx, unsigned long max)
 {
 	struct stats_key *from, *to, *tmp;
 	struct ll *curkey;
@@ -28,10 +40,10 @@ void findmaxpath(unsigned long max)
 	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.
 	 */
-	config.dbbackend->cached_getkeysigs(0xF1BD4BE45B430367);
+	dbctx->cached_getkeysigs(dbctx, 0x94FA372B2DA8B985);
 
 	/*
 	 * Loop through the hash examining each key present and finding the
@@ -42,11 +54,11 @@ void findmaxpath(unsigned long max)
 	for (loop = 0; (loop < HASHSIZE) && (distance < max); loop++) {
 		curkey = gethashtableentry(loop);
 		while (curkey != NULL && distance < max) {
-			config.dbbackend->cached_getkeysigs(
+			dbctx->cached_getkeysigs(dbctx,
 					((struct stats_key *)
 					curkey->object)->keyid);
 			initcolour(false);
-			tmp = furthestkey((struct stats_key *)
+			tmp = furthestkey(dbctx, (struct stats_key *)
 						curkey->object);
 			if (tmp->colour > distance) {
 				from = (struct stats_key *)curkey->object;
@@ -67,20 +79,40 @@ void findmaxpath(unsigned long max)
 			from->keyid,
 			to->keyid,
 			distance);
-	dofindpath(to->keyid, from->keyid, false, 1);
+	dofindpath(dbctx, to->keyid, from->keyid, false, 1);
 }
 
 int main(int argc, char *argv[])
 {
-	readconfig(NULL);
+	int optchar;
+	char *configfile = NULL;
+	struct onak_dbctx *dbctx;
+
+	while ((optchar = getopt(argc, argv, "c:")) != -1 ) {
+		switch (optchar) {
+		case 'c':
+			if (configfile != NULL) {
+				free(configfile);
+			}
+			configfile = strdup(optarg);
+			break;
+		}
+	}
+
+	readconfig(configfile);
+	free(configfile);
 	initlogthing("maxpath", config.logfile);
-	config.dbbackend->initdb(true);
-	inithash();
-	findmaxpath(30);
-	printf("--------\n");
-	findmaxpath(30);
-	destroyhash();
-	config.dbbackend->cleanupdb();
+	dbctx = config.dbinit(config.backend, true);
+	if (dbctx != NULL) {
+		inithash();
+		findmaxpath(dbctx, 30);
+		printf("--------\n");
+		findmaxpath(dbctx, 30);
+		destroyhash();
+		dbctx->cleanupdb(dbctx);
+	} else {
+		fprintf(stderr, "Couldn't initialize key database.\n");
+	}
 	cleanuplogthing();
 	cleanupconfig();