generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

crypto/bn/asm/s390x.S: drop redundant instructions.

Browse Source
This commit is contained in:
Andy Polyakov 2010-09-10 14:53:36 +00:00
parent 7d1f55e9d9
commit dd4a0af370
1 changed files with 43 additions and 43 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

86
crypto/bn/asm/s390x.S
View File

@ -1,4 +1,4 @@
.ident "s390x.S, version 1.0" .ident "s390x.S, version 1.1"
// ==================================================================== // ====================================================================
// Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL // Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
// project. // project.
@ -24,67 +24,67 @@ bn_mul_add_words:
bler %r14 // if (len<=0) return 0; bler %r14 // if (len<=0) return 0;
stmg %r6,%r10,48(%r15) stmg %r6,%r10,48(%r15)
lghi %r10,3
lghi %r8,0 // carry = 0 lghi %r8,0 // carry = 0
srag %r10,%r4,2 // cnt=len/4 nr %r10,%r4 // len%4
jz .Loop1_madd sra %r4,2 // cnt=len/4
jz .Loop1_madd // carry is incidentally cleared if branch taken
algr zero,zero // clear carry
.Loop4_madd: .Loop4_madd:
lg %r7,0(%r2,%r3) // ap[i] lg %r7,0(%r2,%r3) // ap[i]
mlgr %r6,%r5 // *=w mlgr %r6,%r5 // *=w
algr %r7,%r8 // +=carry alcgr %r7,%r8 // +=carry
alcgr %r6,zero alcgr %r6,zero
alg %r7,0(%r2,%r1) // +=rp[i] alg %r7,0(%r2,%r1) // +=rp[i]
alcgr %r6,zero
stg %r7,0(%r2,%r1) // rp[i]= stg %r7,0(%r2,%r1) // rp[i]=
lg %r9,8(%r2,%r3) lg %r9,8(%r2,%r3)
mlgr %r8,%r5 mlgr %r8,%r5
algr %r9,%r6 alcgr %r9,%r6
alcgr %r8,zero alcgr %r8,zero
alg %r9,8(%r2,%r1) alg %r9,8(%r2,%r1)
alcgr %r8,zero
stg %r9,8(%r2,%r1) stg %r9,8(%r2,%r1)
lg %r7,16(%r2,%r3) lg %r7,16(%r2,%r3)
mlgr %r6,%r5 mlgr %r6,%r5
algr %r7,%r8 alcgr %r7,%r8
alcgr %r6,zero alcgr %r6,zero
alg %r7,16(%r2,%r1) alg %r7,16(%r2,%r1)
alcgr %r6,zero
stg %r7,16(%r2,%r1) stg %r7,16(%r2,%r1)
lg %r9,24(%r2,%r3) lg %r9,24(%r2,%r3)
mlgr %r8,%r5 mlgr %r8,%r5
algr %r9,%r6 alcgr %r9,%r6
alcgr %r8,zero alcgr %r8,zero
alg %r9,24(%r2,%r1) alg %r9,24(%r2,%r1)
alcgr %r8,zero
stg %r9,24(%r2,%r1) stg %r9,24(%r2,%r1)
la %r2,32(%r2) // i+=4 la %r2,32(%r2) // i+=4
brct %r10,.Loop4_madd brct %r4,.Loop4_madd
lghi %r10,3 la %r10,1(%r10) // see if len%4 is zero ...
nr %r4,%r10 // cnt=len%4 brct %r10,.Loop1_madd // without touching condition code:-)
jz .Lend_madd
.Lend_madd:
alcgr %r8,zero // collect carry bit
lgr %r2,%r8
lmg %r6,%r10,48(%r15)
br %r14
.Loop1_madd: .Loop1_madd:
lg %r7,0(%r2,%r3) // ap[i] lg %r7,0(%r2,%r3) // ap[i]
mlgr %r6,%r5 // *=w mlgr %r6,%r5 // *=w
algr %r7,%r8 // +=carry alcgr %r7,%r8 // +=carry
alcgr %r6,zero alcgr %r6,zero
alg %r7,0(%r2,%r1) // +=rp[i] alg %r7,0(%r2,%r1) // +=rp[i]
alcgr %r6,zero
stg %r7,0(%r2,%r1) // rp[i]= stg %r7,0(%r2,%r1) // rp[i]=
lgr %r8,%r6 lgr %r8,%r6
la %r2,8(%r2) // i++ la %r2,8(%r2) // i++
brct %r4,.Loop1_madd brct %r10,.Loop1_madd
.Lend_madd: j .Lend_madd
lgr %r2,%r8
lmg %r6,%r10,48(%r15)
br %r14
.size bn_mul_add_words,.-bn_mul_add_words .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); // 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; bler %r14 // if (len<=0) return 0;
stmg %r6,%r10,48(%r15) stmg %r6,%r10,48(%r15)
lghi %r10,3
lghi %r8,0 // carry = 0 lghi %r8,0 // carry = 0
srag %r10,%r4,2 // cnt=len/4 nr %r10,%r4 // len%4
jz .Loop1_mul sra %r4,2 // cnt=len/4
jz .Loop1_mul // carry is incidentally cleared if branch taken
algr zero,zero // clear carry
.Loop4_mul: .Loop4_mul:
lg %r7,0(%r2,%r3) // ap[i] lg %r7,0(%r2,%r3) // ap[i]
mlgr %r6,%r5 // *=w mlgr %r6,%r5 // *=w
algr %r7,%r8 // +=carry alcgr %r7,%r8 // +=carry
alcgr %r6,zero
stg %r7,0(%r2,%r1) // rp[i]= stg %r7,0(%r2,%r1) // rp[i]=
lg %r9,8(%r2,%r3) lg %r9,8(%r2,%r3)
mlgr %r8,%r5 mlgr %r8,%r5
algr %r9,%r6 alcgr %r9,%r6
alcgr %r8,zero
stg %r9,8(%r2,%r1) stg %r9,8(%r2,%r1)
lg %r7,16(%r2,%r3) lg %r7,16(%r2,%r3)
mlgr %r6,%r5 mlgr %r6,%r5
algr %r7,%r8 alcgr %r7,%r8
alcgr %r6,zero
stg %r7,16(%r2,%r1) stg %r7,16(%r2,%r1)
lg %r9,24(%r2,%r3) lg %r9,24(%r2,%r3)
mlgr %r8,%r5 mlgr %r8,%r5
algr %r9,%r6 alcgr %r9,%r6
alcgr %r8,zero
stg %r9,24(%r2,%r1) stg %r9,24(%r2,%r1)
la %r2,32(%r2) // i+=4 la %r2,32(%r2) // i+=4
brct %r10,.Loop4_mul brct %r4,.Loop4_mul
lghi %r10,3 la %r10,1(%r10) // see if len%4 is zero ...
nr %r4,%r10 // cnt=len%4 brct %r10,.Loop1_madd // without touching condition code:-)
jz .Lend_mul
.Lend_mul:
alcgr %r8,zero // collect carry bit
lgr %r2,%r8
lmg %r6,%r10,48(%r15)
br %r14
.Loop1_mul: .Loop1_mul:
lg %r7,0(%r2,%r3) // ap[i] lg %r7,0(%r2,%r3) // ap[i]
mlgr %r6,%r5 // *=w mlgr %r6,%r5 // *=w
algr %r7,%r8 // +=carry alcgr %r7,%r8 // +=carry
alcgr %r6,zero
stg %r7,0(%r2,%r1) // rp[i]= stg %r7,0(%r2,%r1) // rp[i]=
lgr %r8,%r6 lgr %r8,%r6
la %r2,8(%r2) // i++ la %r2,8(%r2) // i++
brct %r4,.Loop1_mul brct %r10,.Loop1_mul
.Lend_mul: j .Lend_mul
lgr %r2,%r8
lmg %r6,%r10,48(%r15)
br %r14
.size bn_mul_words,.-bn_mul_words .size bn_mul_words,.-bn_mul_words
// void bn_sqr_words(BN_ULONG *r2,BN_ULONG *r2,int r4) // void bn_sqr_words(BN_ULONG *r2,BN_ULONG *r2,int r4)