1 files changed, 70 insertions, 70 deletions
diff --git a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S
index f521de0..3bc0e5e 100755..100644
--- a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S
+++ b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S
@@ -1,70 +1,70 @@
-/* hppa add_n -- Add two limb vectors of the same length > 0 and store
+/* hppa add_n -- Add two limb vectors of the same length > 0 and store
- *               sum in a third limb vector.
+ *               sum in a third limb vector.
- *
+ *
- *      Copyright (C) 1992, 1994, 1998,
+ *      Copyright (C) 1992, 1994, 1998,
- *                    2001, 2002 Fee Software Foundation, Inc.
+ *                    2001, 2002 Fee 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
- *
+ *
- * Note: This code is heavily based on the GNU MP Library.
+ * Note: This code is heavily based on the GNU MP Library.
- *       Actually it's the same code with only minor changes in the
+ *       Actually it's the same code with only minor changes in the
- *       way the data is stored; this is to support the abstraction
+ *       way the data is stored; this is to support the abstraction
- *       of an optional secure memory allocation which may be used
+ *       of an optional secure memory allocation which may be used
- *       to avoid revealing of sensitive data due to paging etc.
+ *       to avoid revealing of sensitive data due to paging etc.
- */
+ */
-/*******************
+/*******************
- *  mpi_limb_t
+ *  mpi_limb_t
- *  _gcry_mpih_add_n( mpi_ptr_t res_ptr,        (gr26)
+ *  _gcry_mpih_add_n( mpi_ptr_t res_ptr,        (gr26)
- *                 mpi_ptr_t s1_ptr,    (gr25)
+ *                 mpi_ptr_t s1_ptr,    (gr25)
- *                 mpi_ptr_t s2_ptr,    (gr24)
+ *                 mpi_ptr_t s2_ptr,    (gr24)
- *                 mpi_size_t size)     (gr23)
+ *                 mpi_size_t size)     (gr23)
- *
+ *
- * One might want to unroll this as for other processors, but it turns
+ * One might want to unroll this as for other processors, but it turns
- * out that the data cache contention after a store makes such
+ * out that the data cache contention after a store makes such
- * unrolling useless.  We can't come under 5 cycles/limb anyway.
+ * unrolling useless.  We can't come under 5 cycles/limb anyway.
- */
+ */
-        .code
+        .code
-        .export         _gcry_mpih_add_n
+        .export         _gcry_mpih_add_n
-        .label          _gcry_mpih_add_n
+        .label          _gcry_mpih_add_n
-        .proc
+        .proc
-        .callinfo       frame=0,no_calls
+        .callinfo       frame=0,no_calls
-        .entry
+        .entry
-        ldws,ma         4(0,%r25),%r20
+        ldws,ma         4(0,%r25),%r20
-        ldws,ma         4(0,%r24),%r19
+        ldws,ma         4(0,%r24),%r19
-        addib,=         -1,%r23,L$end   ; check for (SIZE == 1)
+        addib,=         -1,%r23,L$end   ; check for (SIZE == 1)
-         add            %r20,%r19,%r28  ; add first limbs ignoring cy
+         add            %r20,%r19,%r28  ; add first limbs ignoring cy
-        .label L$loop
+        .label L$loop
-        ldws,ma         4(0,%r25),%r20
+        ldws,ma         4(0,%r25),%r20
-        ldws,ma         4(0,%r24),%r19
+        ldws,ma         4(0,%r24),%r19
-        stws,ma         %r28,4(0,%r26)
+        stws,ma         %r28,4(0,%r26)
-        addib,<>        -1,%r23,L$loop
+        addib,<>        -1,%r23,L$loop
-         addc           %r20,%r19,%r28
+         addc           %r20,%r19,%r28
-        .label L$end
+        .label L$end
-        stws            %r28,0(0,%r26)
+        stws            %r28,0(0,%r26)
-        bv              0(%r2)
+        bv              0(%r2)
-         addc           %r0,%r0,%r28
+         addc           %r0,%r0,%r28
-        .exit
+        .exit
-        .procend
+        .procend

diff --git a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S index f521de0..3bc0e5e 100755..100644 --- a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S +++ b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-add1.S
@@ -1,70 +1,70 @@
1	/* hppa add_n -- Add two limb vectors of the same length > 0 and store	1	/* hppa add_n -- Add two limb vectors of the same length > 0 and store
2	* sum in a third limb vector.	2	* sum in a third limb vector.
3	*	3	*
4	* Copyright (C) 1992, 1994, 1998,	4	* Copyright (C) 1992, 1994, 1998,
5	* 2001, 2002 Fee Software Foundation, Inc.	5	* 2001, 2002 Fee Software Foundation, Inc.
6	*	6	*
7	* This file is part of Libgcrypt.	7	* This file is part of Libgcrypt.
8	*	8	*
9	* Libgcrypt is free software; you can redistribute it and/or modify	9	* Libgcrypt is free software; you can redistribute it and/or modify
10	* it under the terms of the GNU Lesser General Public License as	10	* it under the terms of the GNU Lesser General Public License as
11	* published by the Free Software Foundation; either version 2.1 of	11	* published by the Free Software Foundation; either version 2.1 of
12	* the License, or (at your option) any later version.	12	* the License, or (at your option) any later version.
13	*	13	*
14	* Libgcrypt is distributed in the hope that it will be useful,	14	* Libgcrypt is distributed in the hope that it will be useful,
15	* but WITHOUT ANY WARRANTY; without even the implied warranty of	15	* but WITHOUT ANY WARRANTY; without even the implied warranty of
16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the	16	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17	* GNU Lesser General Public License for more details.	17	* GNU Lesser General Public License for more details.
18	*	18	*
19	* You should have received a copy of the GNU Lesser General Public	19	* You should have received a copy of the GNU Lesser General Public
20	* License along with this program; if not, write to the Free Software	20	* License along with this program; if not, write to the Free Software
21	* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA	21	* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
22	*	22	*
23	* Note: This code is heavily based on the GNU MP Library.	23	* Note: This code is heavily based on the GNU MP Library.
24	* Actually it's the same code with only minor changes in the	24	* Actually it's the same code with only minor changes in the
25	* way the data is stored; this is to support the abstraction	25	* way the data is stored; this is to support the abstraction
26	* of an optional secure memory allocation which may be used	26	* of an optional secure memory allocation which may be used
27	* to avoid revealing of sensitive data due to paging etc.	27	* to avoid revealing of sensitive data due to paging etc.
28	*/	28	*/
29		29
30		30
31		31
32	/*******************	32	/*******************
33	* mpi_limb_t	33	* mpi_limb_t
34	* _gcry_mpih_add_n( mpi_ptr_t res_ptr, (gr26)	34	* _gcry_mpih_add_n( mpi_ptr_t res_ptr, (gr26)
35	* mpi_ptr_t s1_ptr, (gr25)	35	* mpi_ptr_t s1_ptr, (gr25)
36	* mpi_ptr_t s2_ptr, (gr24)	36	* mpi_ptr_t s2_ptr, (gr24)
37	* mpi_size_t size) (gr23)	37	* mpi_size_t size) (gr23)
38	*	38	*
39	* One might want to unroll this as for other processors, but it turns	39	* One might want to unroll this as for other processors, but it turns
40	* out that the data cache contention after a store makes such	40	* out that the data cache contention after a store makes such
41	* unrolling useless. We can't come under 5 cycles/limb anyway.	41	* unrolling useless. We can't come under 5 cycles/limb anyway.
42	*/	42	*/
43		43
44	.code	44	.code
45	.export _gcry_mpih_add_n	45	.export _gcry_mpih_add_n
46	.label _gcry_mpih_add_n	46	.label _gcry_mpih_add_n
47	.proc	47	.proc
48	.callinfo frame=0,no_calls	48	.callinfo frame=0,no_calls
49	.entry	49	.entry
50		50
51	ldws,ma 4(0,%r25),%r20	51	ldws,ma 4(0,%r25),%r20
52	ldws,ma 4(0,%r24),%r19	52	ldws,ma 4(0,%r24),%r19
53		53
54	addib,= -1,%r23,L$end ; check for (SIZE == 1)	54	addib,= -1,%r23,L$end ; check for (SIZE == 1)
55	add %r20,%r19,%r28 ; add first limbs ignoring cy	55	add %r20,%r19,%r28 ; add first limbs ignoring cy
56		56
57	.label L$loop	57	.label L$loop
58	ldws,ma 4(0,%r25),%r20	58	ldws,ma 4(0,%r25),%r20
59	ldws,ma 4(0,%r24),%r19	59	ldws,ma 4(0,%r24),%r19
60	stws,ma %r28,4(0,%r26)	60	stws,ma %r28,4(0,%r26)
61	addib,<> -1,%r23,L$loop	61	addib,<> -1,%r23,L$loop
62	addc %r20,%r19,%r28	62	addc %r20,%r19,%r28
63		63
64	.label L$end	64	.label L$end
65	stws %r28,0(0,%r26)	65	stws %r28,0(0,%r26)
66	bv 0(%r2)	66	bv 0(%r2)
67	addc %r0,%r0,%r28	67	addc %r0,%r0,%r28
68		68
69	.exit	69	.exit
70	.procend	70	.procend