aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S
diff options
context:
space:
mode:
authorDavid Walter Seikel2011-06-27 15:59:06 +1000
committerDavid Walter Seikel2011-06-27 15:59:06 +1000
commit92bd9b2503e7dd927f416cb9b17f169ea925fa56 (patch)
treef0f3776cfc0c6e6224db66f5678387c580095f16 /linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S
parentMake use of the new packaging stuff from upstream. (diff)
downloadmeta-impy-92bd9b2503e7dd927f416cb9b17f169ea925fa56.zip
meta-impy-92bd9b2503e7dd927f416cb9b17f169ea925fa56.tar.gz
meta-impy-92bd9b2503e7dd927f416cb9b17f169ea925fa56.tar.bz2
meta-impy-92bd9b2503e7dd927f416cb9b17f169ea925fa56.tar.xz
Clean up line endings, execute bits, and other bits of errant nonsense from Windows.
Diffstat (limited to 'linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S')
-rw-r--r--[-rwxr-xr-x]linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S156
1 files changed, 78 insertions, 78 deletions
diff --git a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S
index cc4b837..8d197e4 100755..100644
--- a/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S
+++ b/linden/indra/libgcrypt/libgcrypt-1.2.2/mpi/hppa/mpih-sub1.S
@@ -1,78 +1,78 @@
1/* hppa sub_n -- Sub two limb vectors of the same length > 0 and store 1/* hppa sub_n -- Sub 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 Free Software Foundation, Inc. 5 * 2001, 2002 Free 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#include "sysdep.h" 31#include "sysdep.h"
32#include "asm-syntax.h" 32#include "asm-syntax.h"
33 33
34 34
35/******************* 35/*******************
36 * mpi_limb_t 36 * mpi_limb_t
37 * _gcry_mpih_sub_n( mpi_ptr_t res_ptr, (gr26) 37 * _gcry_mpih_sub_n( mpi_ptr_t res_ptr, (gr26)
38 * mpi_ptr_t s1_ptr, (gr25) 38 * mpi_ptr_t s1_ptr, (gr25)
39 * mpi_ptr_t s2_ptr, (gr24) 39 * mpi_ptr_t s2_ptr, (gr24)
40 * mpi_size_t size) (gr23) 40 * mpi_size_t size) (gr23)
41 * 41 *
42 * One might want to unroll this as for other processors, but it turns 42 * One might want to unroll this as for other processors, but it turns
43 * out that the data cache contention after a store makes such 43 * out that the data cache contention after a store makes such
44 * unrolling useless. We can't come under 5 cycles/limb anyway. 44 * unrolling useless. We can't come under 5 cycles/limb anyway.
45 */ 45 */
46 46
47 47
48 .code 48 .code
49 .export _gcry_mpih_sub_n 49 .export _gcry_mpih_sub_n
50 .label _gcry_mpih_sub_n 50 .label _gcry_mpih_sub_n
51 .proc 51 .proc
52 .callinfo frame=0,no_calls 52 .callinfo frame=0,no_calls
53 .entry 53 .entry
54 54
55 ldws,ma 4(0,%r25),%r20 55 ldws,ma 4(0,%r25),%r20
56 ldws,ma 4(0,%r24),%r19 56 ldws,ma 4(0,%r24),%r19
57 57
58 addib,= -1,%r23,L$end ; check for (SIZE == 1) 58 addib,= -1,%r23,L$end ; check for (SIZE == 1)
59 sub %r20,%r19,%r28 ; subtract first limbs ignoring cy 59 sub %r20,%r19,%r28 ; subtract first limbs ignoring cy
60 60
61 .label L$loop 61 .label L$loop
62 ldws,ma 4(0,%r25),%r20 62 ldws,ma 4(0,%r25),%r20
63 ldws,ma 4(0,%r24),%r19 63 ldws,ma 4(0,%r24),%r19
64 stws,ma %r28,4(0,%r26) 64 stws,ma %r28,4(0,%r26)
65 addib,<> -1,%r23,L$loop 65 addib,<> -1,%r23,L$loop
66 subb %r20,%r19,%r28 66 subb %r20,%r19,%r28
67 67
68 .label L$end 68 .label L$end
69 stws %r28,0(0,%r26) 69 stws %r28,0(0,%r26)
70 addc %r0,%r0,%r28 70 addc %r0,%r0,%r28
71 bv 0(%r2) 71 bv 0(%r2)
72 subi 1,%r28,%r28 72 subi 1,%r28,%r28
73 73
74 .exit 74 .exit
75 .procend 75 .procend
76 76
77 77
78 78