Merge pull request #565 from usafchn/develop

Make the arg of mp_hash() const

Author: sjaeckel

doc/bn.tex

@@ -1449,7 +1449,7 @@ \section{Hashing}
 
 \index{mp\_hash}
 \begin{alltt}
-mp_err mp_hash (mp_int *a, mp_hval *hash);
+mp_err mp_hash (const mp_int *a, mp_hval *hash);
 \end{alltt}
 
 This will create the hash of $a$ following the \mbox{FNV-1a} algorithm as described on

doc/tommath.3

@@ -369,7 +369,7 @@ Returns \fBMP_MEM\fP if the functions fails to allocate enough memory.
 .in -1i
 
 .LP
-.BI "mp_err mp_hash (mp_int *" a ", mp_hval *" hash ")"
+.BI "mp_err mp_hash (const mp_int *" a ", mp_hval *" hash ")"
 .in 1i
 This will create the hash of \fBa\fP following the \fIFNV-1a\fP algorithm as described on
 \fIhttp://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-1a\fP. With the

mp_hash.c

@@ -12,7 +12,7 @@
 #endif
 
 /* computes hash of mp_int. */
-mp_err mp_hash(mp_int *a, mp_hval *hash)
+mp_err mp_hash(const mp_int *a, mp_hval *hash)
 {
    int  x;
    mp_hval hval = FNV_1A_INIT;

tommath.h

@@ -499,7 +499,7 @@ typedef uint64_t mp_hval;
 #endif
 
 /* computes hash */
-mp_err mp_hash(mp_int *a, mp_hval *hash) MP_WUR;
+mp_err mp_hash(const mp_int *a, mp_hval *hash) MP_WUR;
 
 /* ---> Primes <--- */