Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
T
TLMSP OpenSSL
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
CYBER - Cyber Security
TS 103 523 MSP
TLMSP
TLMSP OpenSSL
Commits
dd4a0af3
Commit
dd4a0af3
authored
14 years ago
by
Andy Polyakov
Browse files
Options
Downloads
Patches
Plain Diff
crypto/bn/asm/s390x.S: drop redundant instructions.
parent
7d1f55e9
No related branches found
No related tags found
Loading
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
crypto/bn/asm/s390x.S
+43
-43
43 additions, 43 deletions
crypto/bn/asm/s390x.S
with
43 additions
and
43 deletions
crypto/bn/asm/s390x.S
+
43
−
43
View file @
dd4a0af3
.
ident
"
s390x.S
,
version
1
.
0
"
.
ident
"
s390x.S
,
version
1
.
1
"
//
===================================================================
=
//
Written
by
Andy
Polyakov
<
appro
@
fy
.
chalmers
.
se
>
for
the
OpenSSL
//
project
.
...
...
@@ -24,67 +24,67 @@ bn_mul_add_words:
bler
%
r14
//
if
(
len
<=
0
)
return
0
;
stmg
%
r6
,%
r10
,
48
(%
r15
)
lghi
%
r10
,
3
lghi
%
r8
,
0
//
carry
=
0
srag
%
r10
,%
r4
,
2
//
cnt
=
len
/
4
jz
.
Loop1_madd
nr
%
r10
,%
r4
//
len
%4
sra
%
r4
,
2
//
cnt
=
len
/
4
jz
.
Loop1_madd
//
carry
is
incidentally
cleared
if
branch
taken
algr
zero
,
zero
//
clear
carry
.
Loop4_madd
:
lg
%
r7
,
0
(%
r2
,%
r3
)
//
ap
[
i
]
mlgr
%
r6
,%
r5
//
*=
w
algr
%
r7
,%
r8
//
+=
carry
al
c
gr
%
r7
,%
r8
//
+=
carry
alcgr
%
r6
,
zero
alg
%
r7
,
0
(%
r2
,%
r1
)
//
+=
rp
[
i
]
alcgr
%
r6
,
zero
stg
%
r7
,
0
(%
r2
,%
r1
)
//
rp
[
i
]=
lg
%
r9
,
8
(%
r2
,%
r3
)
mlgr
%
r8
,%
r5
algr
%
r9
,%
r6
al
c
gr
%
r9
,%
r6
alcgr
%
r8
,
zero
alg
%
r9
,
8
(%
r2
,%
r1
)
alcgr
%
r8
,
zero
stg
%
r9
,
8
(%
r2
,%
r1
)
lg
%
r7
,
16
(%
r2
,%
r3
)
mlgr
%
r6
,%
r5
algr
%
r7
,%
r8
al
c
gr
%
r7
,%
r8
alcgr
%
r6
,
zero
alg
%
r7
,
16
(%
r2
,%
r1
)
alcgr
%
r6
,
zero
stg
%
r7
,
16
(%
r2
,%
r1
)
lg
%
r9
,
24
(%
r2
,%
r3
)
mlgr
%
r8
,%
r5
algr
%
r9
,%
r6
al
c
gr
%
r9
,%
r6
alcgr
%
r8
,
zero
alg
%
r9
,
24
(%
r2
,%
r1
)
alcgr
%
r8
,
zero
stg
%
r9
,
24
(%
r2
,%
r1
)
la
%
r2
,
32
(%
r2
)
//
i
+=
4
brct
%
r
10
,
.
Loop4_madd
brct
%
r
4
,
.
Loop4_madd
lghi
%
r10
,
3
nr
%
r4
,%
r10
//
cnt
=
len
%4
jz
.
Lend_madd
la
%
r10
,
1
(%
r10
)
//
see
if
len
%4
is
zero
...
brct
%
r10
,
.
Loop1_madd
//
without
touching
condition
code
:
-)
.
Lend_madd
:
alcgr
%
r8
,
zero
//
collect
carry
bit
lgr
%
r2
,%
r8
lmg
%
r6
,%
r10
,
48
(%
r15
)
br
%
r14
.
Loop1_madd
:
lg
%
r7
,
0
(%
r2
,%
r3
)
//
ap
[
i
]
mlgr
%
r6
,%
r5
//
*=
w
algr
%
r7
,%
r8
//
+=
carry
al
c
gr
%
r7
,%
r8
//
+=
carry
alcgr
%
r6
,
zero
alg
%
r7
,
0
(%
r2
,%
r1
)
//
+=
rp
[
i
]
alcgr
%
r6
,
zero
stg
%
r7
,
0
(%
r2
,%
r1
)
//
rp
[
i
]=
lgr
%
r8
,%
r6
la
%
r2
,
8
(%
r2
)
//
i
++
brct
%
r
4
,
.
Loop1_madd
brct
%
r
10
,
.
Loop1_madd
.
Lend_madd
:
lgr
%
r2
,%
r8
lmg
%
r6
,%
r10
,
48
(%
r15
)
br
%
r14
j
.
Lend_madd
.
size
bn_mul_add_words
,.-
bn_mul_add_words
//
BN_ULONG
bn_mul_words
(
BN_ULONG
*
r2
,
BN_ULONG
*
r3
,
int
r4
,
BN_ULONG
r5
)
;
...
...
@@ -99,57 +99,57 @@ bn_mul_words:
bler
%
r14
//
if
(
len
<=
0
)
return
0
;
stmg
%
r6
,%
r10
,
48
(%
r15
)
lghi
%
r10
,
3
lghi
%
r8
,
0
//
carry
=
0
srag
%
r10
,%
r4
,
2
//
cnt
=
len
/
4
jz
.
Loop1_mul
nr
%
r10
,%
r4
//
len
%4
sra
%
r4
,
2
//
cnt
=
len
/
4
jz
.
Loop1_mul
//
carry
is
incidentally
cleared
if
branch
taken
algr
zero
,
zero
//
clear
carry
.
Loop4_mul
:
lg
%
r7
,
0
(%
r2
,%
r3
)
//
ap
[
i
]
mlgr
%
r6
,%
r5
//
*=
w
algr
%
r7
,%
r8
//
+=
carry
alcgr
%
r6
,
zero
alcgr
%
r7
,%
r8
//
+=
carry
stg
%
r7
,
0
(%
r2
,%
r1
)
//
rp
[
i
]=
lg
%
r9
,
8
(%
r2
,%
r3
)
mlgr
%
r8
,%
r5
algr
%
r9
,%
r6
alcgr
%
r8
,
zero
alcgr
%
r9
,%
r6
stg
%
r9
,
8
(%
r2
,%
r1
)
lg
%
r7
,
16
(%
r2
,%
r3
)
mlgr
%
r6
,%
r5
algr
%
r7
,%
r8
alcgr
%
r6
,
zero
alcgr
%
r7
,%
r8
stg
%
r7
,
16
(%
r2
,%
r1
)
lg
%
r9
,
24
(%
r2
,%
r3
)
mlgr
%
r8
,%
r5
algr
%
r9
,%
r6
alcgr
%
r8
,
zero
alcgr
%
r9
,%
r6
stg
%
r9
,
24
(%
r2
,%
r1
)
la
%
r2
,
32
(%
r2
)
//
i
+=
4
brct
%
r
10
,
.
Loop4_mul
brct
%
r
4
,
.
Loop4_mul
lghi
%
r10
,
3
nr
%
r4
,%
r10
//
cnt
=
len
%4
jz
.
Lend_mul
la
%
r10
,
1
(%
r10
)
//
see
if
len
%4
is
zero
...
brct
%
r10
,
.
Loop1_madd
//
without
touching
condition
code
:
-)
.
Lend_mul
:
alcgr
%
r8
,
zero
//
collect
carry
bit
lgr
%
r2
,%
r8
lmg
%
r6
,%
r10
,
48
(%
r15
)
br
%
r14
.
Loop1_mul
:
lg
%
r7
,
0
(%
r2
,%
r3
)
//
ap
[
i
]
mlgr
%
r6
,%
r5
//
*=
w
algr
%
r7
,%
r8
//
+=
carry
alcgr
%
r6
,
zero
alcgr
%
r7
,%
r8
//
+=
carry
stg
%
r7
,
0
(%
r2
,%
r1
)
//
rp
[
i
]=
lgr
%
r8
,%
r6
la
%
r2
,
8
(%
r2
)
//
i
++
brct
%
r
4
,
.
Loop1_mul
brct
%
r
10
,
.
Loop1_mul
.
Lend_mul
:
lgr
%
r2
,%
r8
lmg
%
r6
,%
r10
,
48
(%
r15
)
br
%
r14
j
.
Lend_mul
.
size
bn_mul_words
,.-
bn_mul_words
//
void
bn_sqr_words
(
BN_ULONG
*
r2
,
BN_ULONG
*
r2
,
int
r4
)
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment