Thomas Moschny passed along a request from the Fedora packagers which came

up during the Fedora submission review, that each source file include some
text about the license. One handy Perl script later and each file now has
the line
   Distributed under the terms of the Botan license
after the copyright notices.

While I was in there modifying every file anyway, I also stripped out the
remainder of the block comments (lots of astericks before and after the
text); this is stylistic thing I picked up when I was first learning C++
but in retrospect it is not a good style as the structure makes it harder
to modify comments (with the result that comments become fewer, shorter and
are less likely to be updated, which are not good things).

1 files changed, 18 insertions, 16 deletions

diff --git a/src/math/bigint/mp_misc.cpp b/src/math/bigint/mp_misc.cpp
index db9c8cda0..6b7fc651b 100644
--- a/src/math/bigint/mp_misc.cpp
+++ b/src/math/bigint/mp_misc.cpp
@@ -1,7 +1,9 @@
-/*************************************************
-* MP Misc Functions Source File                  *
-* (C) 1999-2008 Jack Lloyd                       *
-*************************************************/
+/*
+* MP Misc Functions
+* (C) 1999-2008 Jack Lloyd
+*
+* Distributed under the terms of the Botan license
+*/
 
 #include <botan/mp_core.h>
 #include <botan/mp_asm.h>
@@ -10,9 +12,9 @@ namespace Botan {
 
 extern "C" {
 
-/*************************************************
-* Core Division Operation                        *
-*************************************************/
+/*
+* Core Division Operation
+*/
 u32bit bigint_divcore(word q, word y1, word y2,
                       word x1, word x2, word x3)
    {
@@ -29,9 +31,9 @@ u32bit bigint_divcore(word q, word y1, word y2,
    return 0;
    }
 
-/*************************************************
-* Compare two MP integers                        *
-*************************************************/
+/*
+* Compare two MP integers
+*/
 s32bit bigint_cmp(const word x[], u32bit x_size,
                   const word y[], u32bit y_size)
    {
@@ -51,9 +53,9 @@ s32bit bigint_cmp(const word x[], u32bit x_size,
    return 0;
    }
 
-/*************************************************
-* Do a 2-word/1-word Division                    *
-*************************************************/
+/*
+* Do a 2-word/1-word Division
+*/
 word bigint_divop(word n1, word n0, word d)
    {
    word high = n1 % d, quotient = 0;
@@ -76,9 +78,9 @@ word bigint_divop(word n1, word n0, word d)
    return quotient;
    }
 
-/*************************************************
-* Do a 2-word/1-word Modulo                      *
-*************************************************/
+/*
+* Do a 2-word/1-word Modulo
+*/
 word bigint_modop(word n1, word n0, word d)
    {
    word z = bigint_divop(n1, n0, d);