1 files changed, 132 insertions, 132 deletions
diff --git a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c
index 3ee09d2..90699cd 100755..100644
--- a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c
+++ b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c
@@ -1,132 +1,132 @@
-/* mpi-scan.c  -  MPI functions
+/* mpi-scan.c  -  MPI functions
- *      Copyright (C) 1998, 2001, 2002, 2003 Free Software Foundation, Inc.
+ *      Copyright (C) 1998, 2001, 2002, 2003 Free Software Foundation, Inc.
- *
+ *
- * This file is part of Libgcrypt.
+ * This file is part of Libgcrypt.
- *
+ *
- * Libgcrypt is free software; you can redistribute it and/or modify
+ * Libgcrypt is free software; you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License as
+ * it under the terms of the GNU Lesser General Public License as
- * published by the Free Software Foundation; either version 2.1 of
+ * published by the Free Software Foundation; either version 2.1 of
- * the License, or (at your option) any later version.
+ * the License, or (at your option) any later version.
- *
+ *
- * Libgcrypt is distributed in the hope that it will be useful,
+ * Libgcrypt is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU Lesser General Public License for more details.
+ * GNU Lesser General Public License for more details.
- *
+ *
- * You should have received a copy of the GNU Lesser General Public
+ * You should have received a copy of the GNU Lesser General Public
- * License along with this program; if not, write to the Free Software
+ * License along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
+ * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
- */
+ */
-#include <config.h>
+#include <config.h>
-#include <stdio.h>
+#include <stdio.h>
-#include <stdlib.h>
+#include <stdlib.h>
-#include "mpi-internal.h"
+#include "mpi-internal.h"
-#include "longlong.h"
+#include "longlong.h"
-/****************
+/****************
- * Scan through an mpi and return byte for byte. a -1 is returned to indicate
+ * Scan through an mpi and return byte for byte. a -1 is returned to indicate
- * the end of the mpi. Scanning is done from the lsb to the msb, returned
+ * the end of the mpi. Scanning is done from the lsb to the msb, returned
- * values are in the range of 0 .. 255.
+ * values are in the range of 0 .. 255.
- *
+ *
- * FIXME: This code is VERY ugly!
+ * FIXME: This code is VERY ugly!
- */
+ */
-int
+int
-_gcry_mpi_getbyte( gcry_mpi_t a, unsigned idx )
+_gcry_mpi_getbyte( gcry_mpi_t a, unsigned idx )
-{
+{
-    int i, j;
+    int i, j;
-    unsigned n;
+    unsigned n;
-    mpi_ptr_t ap;
+    mpi_ptr_t ap;
-    mpi_limb_t limb;
+    mpi_limb_t limb;
-    ap = a->d;
+    ap = a->d;
-    for(n=0,i=0; i < a->nlimbs; i++ ) {
+    for(n=0,i=0; i < a->nlimbs; i++ ) {
-        limb = ap[i];
+        limb = ap[i];
-        for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )
+        for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )
-            if( n == idx )
+            if( n == idx )
-                return (limb >> j*8) & 0xff;
+                return (limb >> j*8) & 0xff;
-    }
+    }
-    return -1;
+    return -1;
-}
+}
-/****************
+/****************
- * Put a value at position IDX into A. idx counts from lsb to msb
+ * Put a value at position IDX into A. idx counts from lsb to msb
- */
+ */
-void
+void
-_gcry_mpi_putbyte( gcry_mpi_t a, unsigned idx, int xc )
+_gcry_mpi_putbyte( gcry_mpi_t a, unsigned idx, int xc )
-{
+{
-    int i, j;
+    int i, j;
-    unsigned n;
+    unsigned n;
-    mpi_ptr_t ap;
+    mpi_ptr_t ap;
-    mpi_limb_t limb, c;
+    mpi_limb_t limb, c;
-    c = xc & 0xff;
+    c = xc & 0xff;
-    ap = a->d;
+    ap = a->d;
-    for(n=0,i=0; i < a->alloced; i++ ) {
+    for(n=0,i=0; i < a->alloced; i++ ) {
-        limb = ap[i];
+        limb = ap[i];
-        for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )
+        for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )
-            if( n == idx ) {
+            if( n == idx ) {
-              #if BYTES_PER_MPI_LIMB == 4
+              #if BYTES_PER_MPI_LIMB == 4
-                if( j == 0 )
+                if( j == 0 )
-                    limb = (limb & 0xffffff00) | c;
+                    limb = (limb & 0xffffff00) | c;
-                else if( j == 1 )
+                else if( j == 1 )
-                    limb = (limb & 0xffff00ff) | (c<<8);
+                    limb = (limb & 0xffff00ff) | (c<<8);
-                else if( j == 2 )
+                else if( j == 2 )
-                    limb = (limb & 0xff00ffff) | (c<<16);
+                    limb = (limb & 0xff00ffff) | (c<<16);
-                else
+                else
-                    limb = (limb & 0x00ffffff) | (c<<24);
+                    limb = (limb & 0x00ffffff) | (c<<24);
-              #elif BYTES_PER_MPI_LIMB == 8
+              #elif BYTES_PER_MPI_LIMB == 8
-                if( j == 0 )
+                if( j == 0 )
-                    limb = (limb & 0xffffffffffffff00) | c;
+                    limb = (limb & 0xffffffffffffff00) | c;
-                else if( j == 1 )
+                else if( j == 1 )
-                    limb = (limb & 0xffffffffffff00ff) | (c<<8);
+                    limb = (limb & 0xffffffffffff00ff) | (c<<8);
-                else if( j == 2 )
+                else if( j == 2 )
-                    limb = (limb & 0xffffffffff00ffff) | (c<<16);
+                    limb = (limb & 0xffffffffff00ffff) | (c<<16);
-                else if( j == 3 )
+                else if( j == 3 )
-                    limb = (limb & 0xffffffff00ffffff) | (c<<24);
+                    limb = (limb & 0xffffffff00ffffff) | (c<<24);
-                else if( j == 4 )
+                else if( j == 4 )
-                    limb = (limb & 0xffffff00ffffffff) | (c<<32);
+                    limb = (limb & 0xffffff00ffffffff) | (c<<32);
-                else if( j == 5 )
+                else if( j == 5 )
-                    limb = (limb & 0xffff00ffffffffff) | (c<<40);
+                    limb = (limb & 0xffff00ffffffffff) | (c<<40);
-                else if( j == 6 )
+                else if( j == 6 )
-                    limb = (limb & 0xff00ffffffffffff) | (c<<48);
+                    limb = (limb & 0xff00ffffffffffff) | (c<<48);
-                else
+                else
-                    limb = (limb & 0x00ffffffffffffff) | (c<<56);
+                    limb = (limb & 0x00ffffffffffffff) | (c<<56);
-              #else
+              #else
-                 #error please enhance this function, its ugly - i know.
+                 #error please enhance this function, its ugly - i know.
-              #endif
+              #endif
-                if( a->nlimbs <= i )
+                if( a->nlimbs <= i )
-                    a->nlimbs = i+1;
+                    a->nlimbs = i+1;
-                ap[i] = limb;
+                ap[i] = limb;
-                return;
+                return;
-            }
+            }
-    }
+    }
-    abort(); /* index out of range */
+    abort(); /* index out of range */
-}
+}
-/****************
+/****************
- * Count the number of zerobits at the low end of A
+ * Count the number of zerobits at the low end of A
- */
+ */
-unsigned
+unsigned
-_gcry_mpi_trailing_zeros( gcry_mpi_t a )
+_gcry_mpi_trailing_zeros( gcry_mpi_t a )
-{
+{
-    unsigned n, count = 0;
+    unsigned n, count = 0;
-    for(n=0; n < a->nlimbs; n++ ) {
+    for(n=0; n < a->nlimbs; n++ ) {
-        if( a->d[n] ) {
+        if( a->d[n] ) {
-            unsigned nn;
+            unsigned nn;
-            mpi_limb_t alimb = a->d[n];
+            mpi_limb_t alimb = a->d[n];
-            count_trailing_zeros( nn, alimb );
+            count_trailing_zeros( nn, alimb );
-            count += nn;
+            count += nn;
-            break;
+            break;
-        }
+        }
-        count += BITS_PER_MPI_LIMB;
+        count += BITS_PER_MPI_LIMB;
-    }
+    }
-    return count;
+    return count;
-}
+}

diff --git a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c index 3ee09d2..90699cd 100755..100644 --- a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c +++ b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/mpi-scan.c
@@ -1,132 +1,132 @@
1	/* mpi-scan.c - MPI functions	1	/* mpi-scan.c - MPI functions
2	* Copyright (C) 1998, 2001, 2002, 2003 Free Software Foundation, Inc.	2	* Copyright (C) 1998, 2001, 2002, 2003 Free Software Foundation, Inc.
3	*	3	*
4	* This file is part of Libgcrypt.	4	* This file is part of Libgcrypt.
5	*	5	*
6	* Libgcrypt is free software; you can redistribute it and/or modify	6	* Libgcrypt is free software; you can redistribute it and/or modify
7	* it under the terms of the GNU Lesser General Public License as	7	* it under the terms of the GNU Lesser General Public License as
8	* published by the Free Software Foundation; either version 2.1 of	8	* published by the Free Software Foundation; either version 2.1 of
9	* the License, or (at your option) any later version.	9	* the License, or (at your option) any later version.
10	*	10	*
11	* Libgcrypt is distributed in the hope that it will be useful,	11	* Libgcrypt is distributed in the hope that it will be useful,
12	* but WITHOUT ANY WARRANTY; without even the implied warranty of	12	* but WITHOUT ANY WARRANTY; without even the implied warranty of
13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	13	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14	* GNU Lesser General Public License for more details.	14	* GNU Lesser General Public License for more details.
15	*	15	*
16	* You should have received a copy of the GNU Lesser General Public	16	* You should have received a copy of the GNU Lesser General Public
17	* License along with this program; if not, write to the Free Software	17	* License along with this program; if not, write to the Free Software
18	* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA	18	* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
19	*/	19	*/
20		20
21	#include <config.h>	21	#include <config.h>
22	#include <stdio.h>	22	#include <stdio.h>
23	#include <stdlib.h>	23	#include <stdlib.h>
24	#include "mpi-internal.h"	24	#include "mpi-internal.h"
25	#include "longlong.h"	25	#include "longlong.h"
26		26
27	/****************	27	/****************
28	* Scan through an mpi and return byte for byte. a -1 is returned to indicate	28	* Scan through an mpi and return byte for byte. a -1 is returned to indicate
29	* the end of the mpi. Scanning is done from the lsb to the msb, returned	29	* the end of the mpi. Scanning is done from the lsb to the msb, returned
30	* values are in the range of 0 .. 255.	30	* values are in the range of 0 .. 255.
31	*	31	*
32	* FIXME: This code is VERY ugly!	32	* FIXME: This code is VERY ugly!
33	*/	33	*/
34	int	34	int
35	_gcry_mpi_getbyte( gcry_mpi_t a, unsigned idx )	35	_gcry_mpi_getbyte( gcry_mpi_t a, unsigned idx )
36	{	36	{
37	int i, j;	37	int i, j;
38	unsigned n;	38	unsigned n;
39	mpi_ptr_t ap;	39	mpi_ptr_t ap;
40	mpi_limb_t limb;	40	mpi_limb_t limb;
41		41
42	ap = a->d;	42	ap = a->d;
43	for(n=0,i=0; i < a->nlimbs; i++ ) {	43	for(n=0,i=0; i < a->nlimbs; i++ ) {
44	limb = ap[i];	44	limb = ap[i];
45	for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )	45	for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )
46	if( n == idx )	46	if( n == idx )
47	return (limb >> j*8) & 0xff;	47	return (limb >> j*8) & 0xff;
48	}	48	}
49	return -1;	49	return -1;
50	}	50	}
51		51
52		52
53	/****************	53	/****************
54	* Put a value at position IDX into A. idx counts from lsb to msb	54	* Put a value at position IDX into A. idx counts from lsb to msb
55	*/	55	*/
56	void	56	void
57	_gcry_mpi_putbyte( gcry_mpi_t a, unsigned idx, int xc )	57	_gcry_mpi_putbyte( gcry_mpi_t a, unsigned idx, int xc )
58	{	58	{
59	int i, j;	59	int i, j;
60	unsigned n;	60	unsigned n;
61	mpi_ptr_t ap;	61	mpi_ptr_t ap;
62	mpi_limb_t limb, c;	62	mpi_limb_t limb, c;
63		63
64	c = xc & 0xff;	64	c = xc & 0xff;
65	ap = a->d;	65	ap = a->d;
66	for(n=0,i=0; i < a->alloced; i++ ) {	66	for(n=0,i=0; i < a->alloced; i++ ) {
67	limb = ap[i];	67	limb = ap[i];
68	for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )	68	for( j=0; j < BYTES_PER_MPI_LIMB; j++, n++ )
69	if( n == idx ) {	69	if( n == idx ) {
70	#if BYTES_PER_MPI_LIMB == 4	70	#if BYTES_PER_MPI_LIMB == 4
71	if( j == 0 )	71	if( j == 0 )
72	limb = (limb & 0xffffff00) \| c;	72	limb = (limb & 0xffffff00) \| c;
73	else if( j == 1 )	73	else if( j == 1 )
74	limb = (limb & 0xffff00ff) \| (c<<8);	74	limb = (limb & 0xffff00ff) \| (c<<8);
75	else if( j == 2 )	75	else if( j == 2 )
76	limb = (limb & 0xff00ffff) \| (c<<16);	76	limb = (limb & 0xff00ffff) \| (c<<16);
77	else	77	else
78	limb = (limb & 0x00ffffff) \| (c<<24);	78	limb = (limb & 0x00ffffff) \| (c<<24);
79	#elif BYTES_PER_MPI_LIMB == 8	79	#elif BYTES_PER_MPI_LIMB == 8
80	if( j == 0 )	80	if( j == 0 )
81	limb = (limb & 0xffffffffffffff00) \| c;	81	limb = (limb & 0xffffffffffffff00) \| c;
82	else if( j == 1 )	82	else if( j == 1 )
83	limb = (limb & 0xffffffffffff00ff) \| (c<<8);	83	limb = (limb & 0xffffffffffff00ff) \| (c<<8);
84	else if( j == 2 )	84	else if( j == 2 )
85	limb = (limb & 0xffffffffff00ffff) \| (c<<16);	85	limb = (limb & 0xffffffffff00ffff) \| (c<<16);
86	else if( j == 3 )	86	else if( j == 3 )
87	limb = (limb & 0xffffffff00ffffff) \| (c<<24);	87	limb = (limb & 0xffffffff00ffffff) \| (c<<24);
88	else if( j == 4 )	88	else if( j == 4 )
89	limb = (limb & 0xffffff00ffffffff) \| (c<<32);	89	limb = (limb & 0xffffff00ffffffff) \| (c<<32);
90	else if( j == 5 )	90	else if( j == 5 )
91	limb = (limb & 0xffff00ffffffffff) \| (c<<40);	91	limb = (limb & 0xffff00ffffffffff) \| (c<<40);
92	else if( j == 6 )	92	else if( j == 6 )
93	limb = (limb & 0xff00ffffffffffff) \| (c<<48);	93	limb = (limb & 0xff00ffffffffffff) \| (c<<48);
94	else	94	else
95	limb = (limb & 0x00ffffffffffffff) \| (c<<56);	95	limb = (limb & 0x00ffffffffffffff) \| (c<<56);
96	#else	96	#else
97	#error please enhance this function, its ugly - i know.	97	#error please enhance this function, its ugly - i know.
98	#endif	98	#endif
99	if( a->nlimbs <= i )	99	if( a->nlimbs <= i )
100	a->nlimbs = i+1;	100	a->nlimbs = i+1;
101	ap[i] = limb;	101	ap[i] = limb;
102	return;	102	return;
103	}	103	}
104	}	104	}
105	abort(); /* index out of range */	105	abort(); /* index out of range */
106	}	106	}
107		107
108		108
109	/****************	109	/****************
110	* Count the number of zerobits at the low end of A	110	* Count the number of zerobits at the low end of A
111	*/	111	*/
112	unsigned	112	unsigned
113	_gcry_mpi_trailing_zeros( gcry_mpi_t a )	113	_gcry_mpi_trailing_zeros( gcry_mpi_t a )
114	{	114	{
115	unsigned n, count = 0;	115	unsigned n, count = 0;
116		116
117	for(n=0; n < a->nlimbs; n++ ) {	117	for(n=0; n < a->nlimbs; n++ ) {
118	if( a->d[n] ) {	118	if( a->d[n] ) {
119	unsigned nn;	119	unsigned nn;
120	mpi_limb_t alimb = a->d[n];	120	mpi_limb_t alimb = a->d[n];
121		121
122	count_trailing_zeros( nn, alimb );	122	count_trailing_zeros( nn, alimb );
123	count += nn;	123	count += nn;
124	break;	124	break;
125	}	125	}
126	count += BITS_PER_MPI_LIMB;	126	count += BITS_PER_MPI_LIMB;
127	}	127	}
128	return count;	128	return count;
129		129
130	}	130	}
131		131
132		132