1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
dnl ARM mpn_add_n/mpn_sub_n optimised for A15.
dnl Copyright 2013 Free Software Foundation, Inc.
dnl This file is part of the GNU MP Library.
dnl
dnl The GNU MP Library is free software; you can redistribute it and/or modify
dnl it under the terms of either:
dnl
dnl * the GNU Lesser General Public License as published by the Free
dnl Software Foundation; either version 3 of the License, or (at your
dnl option) any later version.
dnl
dnl or
dnl
dnl * the GNU General Public License as published by the Free Software
dnl Foundation; either version 2 of the License, or (at your option) any
dnl later version.
dnl
dnl or both in parallel, as here.
dnl
dnl The GNU MP Library is distributed in the hope that it will be useful, but
dnl WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
dnl for more details.
dnl
dnl You should have received copies of the GNU General Public License and the
dnl GNU Lesser General Public License along with the GNU MP Library. If not,
dnl see https://www.gnu.org/licenses/.
include(`../config.m4')
C cycles/limb best
C StrongARM: -
C XScale ?
C Cortex-A7 ?
C Cortex-A8 ?
C Cortex-A9 3.55 2.5
C Cortex-A15 1.27 this
C This was a major improvement compared to the code we had before, but it might
C not be the best 8-way code possible. We've tried some permutations of auto-
C increments and separate pointer updates, but they all ran at the same speed
C on A15.
C Architecture requirements:
C v5 -
C v5t -
C v5te ldrd strd
C v6 -
C v6t2 -
C v7a -
define(`rp', `r0')
define(`up', `r1')
define(`vp', `r2')
define(`n', `r3')
ifdef(`OPERATION_add_n', `
define(`ADDSUBC', adcs)
define(`IFADD', `$1')
define(`SETCY', `cmp $1, #1')
define(`RETVAL', `adc r0, n, #0')
define(`RETVAL2', `adc r0, n, #1')
define(`func', mpn_add_n)
define(`func_nc', mpn_add_nc)')
ifdef(`OPERATION_sub_n', `
define(`ADDSUBC', sbcs)
define(`IFADD', `')
define(`SETCY', `rsbs $1, $1, #0')
define(`RETVAL', `sbc r0, r0, r0
and r0, r0, #1')
define(`RETVAL2', `RETVAL')
define(`func', mpn_sub_n)
define(`func_nc', mpn_sub_nc)')
MULFUNC_PROLOGUE(mpn_add_n mpn_add_nc mpn_sub_n mpn_sub_nc)
ASM_START()
PROLOGUE(func_nc)
ldr r12, [sp]
b L(ent)
EPILOGUE()
PROLOGUE(func)
mov r12, #0
L(ent): push { r4-r9 }
ands r6, n, #3
mov n, n, lsr #2
beq L(b00)
cmp r6, #2
bcc L(b01)
beq L(b10)
L(b11): ldr r5, [up], #4
ldr r7, [vp], #4
SETCY( r12)
ADDSUBC r9, r5, r7
ldrd r4, r5, [up, #0]
ldrd r6, r7, [vp, #0]
str r9, [rp], #-4
b L(lo)
L(b00): ldrd r4, r5, [up], #-8
ldrd r6, r7, [vp], #-8
SETCY( r12)
sub rp, rp, #16
b L(mid)
L(b01): ldr r5, [up], #-4
ldr r7, [vp], #-4
SETCY( r12)
ADDSUBC r9, r5, r7
str r9, [rp], #-12
tst n, n
beq L(wd1)
L(gt1): ldrd r4, r5, [up, #8]
ldrd r6, r7, [vp, #8]
b L(mid)
L(b10): ldrd r4, r5, [up]
ldrd r6, r7, [vp]
SETCY( r12)
sub rp, rp, #8
b L(lo)
ALIGN(16)
L(top): ldrd r4, r5, [up, #8]
ldrd r6, r7, [vp, #8]
strd r8, r9, [rp, #8]
L(mid): ADDSUBC r8, r4, r6
ADDSUBC r9, r5, r7
ldrd r4, r5, [up, #16]
ldrd r6, r7, [vp, #16]
strd r8, r9, [rp, #16]
ADDSUBC r8, r4, r6
ADDSUBC r9, r5, r7
sub n, n, #2
tst n, n
bmi L(dne)
ldrd r4, r5, [up, #24]
ldrd r6, r7, [vp, #24]
strd r8, r9, [rp, #24]
ADDSUBC r8, r4, r6
ADDSUBC r9, r5, r7
ldrd r4, r5, [up, #32]!
ldrd r6, r7, [vp, #32]!
strd r8, r9, [rp, #32]!
L(lo): ADDSUBC r8, r4, r6
ADDSUBC r9, r5, r7
tst n, n
bne L(top)
L(end): strd r8, r9, [rp, #8]
L(wd1): RETVAL
pop { r4-r9 }
bx r14
L(dne): strd r8, r9, [rp, #24]
RETVAL2
pop { r4-r9 }
bx r14
EPILOGUE()
|
