Use nettle for hashing when available rather than internal MD5/SHA1 routines

[onak.git] / maxpath.c

diff --git a/maxpath.c b/maxpath.c
index b9ba53a14b036b7b7a32cc0a3edc7b90e55c364c..81a2b22b8d2f4fbfa126dcc7751ee08e4f645cc6 100644 (file)
--- a/maxpath.c
+++ b/maxpath.c
@@ -1,9 +1,20 @@
 /*
  * 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, write to the Free Software Foundation, Inc., 51
+ * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
  */
 
 #include <stdio.h>
@@ -28,10 +39,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);
+       config.dbbackend->cached_getkeysigs(0x94FA372B2DA8B985);
 
        /*
         * Loop through the hash examining each key present and finding the
@@ -52,8 +63,9 @@ 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 %"
+                                               PRIX64 " to %" PRIX64 
+                                               " (%ld steps)\n", 
                                                loop,
                                                from->keyid,
                                                to->keyid,
@@ -62,7 +74,7 @@ void findmaxpath(unsigned long max)
                        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);