60 files changed, 0 insertions, 32426 deletions
diff --git a/src/lib/libcrypto/bn/asm/alpha-mont.pl b/src/lib/libcrypto/bn/asm/alpha-mont.pl
deleted file mode 100644
index 7a2cc3173b..0000000000
--- a/src/lib/libcrypto/bn/asm/alpha-mont.pl
+++ /dev/null
@@ -1,317 +0,0 @@
-#!/usr/bin/env perl
-#
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-#
-# On 21264 RSA sign performance improves by 70/35/20/15 percent for
-# 512/1024/2048/4096 bit key lengths. This is against vendor compiler
-# instructed to '-tune host' code with in-line assembler. Other
-# benchmarks improve by 15-20%. To anchor it to something else, the
-# code provides approximately the same performance per GHz as AMD64.
-# I.e. if you compare 1GHz 21264 and 2GHz Opteron, you'll observe ~2x
-# difference.
-# int bn_mul_mont(
-$rp="a0";       # BN_ULONG *rp,
-$ap="a1";       # const BN_ULONG *ap,
-$bp="a2";       # const BN_ULONG *bp,
-$np="a3";       # const BN_ULONG *np,
-$n0="a4";       # const BN_ULONG *n0,
-$num="a5";      # int num);
-$lo0="t0";
-$hi0="t1";
-$lo1="t2";
-$hi1="t3";
-$aj="t4";
-$bi="t5";
-$nj="t6";
-$tp="t7";
-$alo="t8";
-$ahi="t9";
-$nlo="t10";
-$nhi="t11";
-$tj="t12";
-$i="s3";
-$j="s4";
-$m1="s5";
-$code=<<___;
-#include <asm.h>
-#include <regdef.h>
-.text
-.set    noat
-.set    noreorder
-.globl  bn_mul_mont
-.align  5
-.ent    bn_mul_mont
-bn_mul_mont:
-        lda     sp,-40(sp)
-        stq     ra,0(sp)
-        stq     s3,8(sp)
-        stq     s4,16(sp)
-        stq     s5,24(sp)
-        stq     fp,32(sp)
-        mov     sp,fp
-        .mask   0x0400f000,-40
-        .frame  fp,40,ra
-        .prologue 0
-        .align  4
-        .set    reorder
-        sextl   $num,$num
-        mov     0,v0
-        cmplt   $num,4,AT
-        bne     AT,.Lexit
-        ldq     $hi0,0($ap)     # ap[0]
-        s8addq  $num,16,AT
-        ldq     $aj,8($ap)
-        subq    sp,AT,sp
-        ldq     $bi,0($bp)      # bp[0]
-        mov     -4096,AT
-        ldq     $n0,0($n0)
-        and     sp,AT,sp
-        mulq    $hi0,$bi,$lo0
-        ldq     $hi1,0($np)     # np[0]
-        umulh   $hi0,$bi,$hi0
-        ldq     $nj,8($np)
-        mulq    $lo0,$n0,$m1
-        mulq    $hi1,$m1,$lo1
-        umulh   $hi1,$m1,$hi1
-        addq    $lo1,$lo0,$lo1
-        cmpult  $lo1,$lo0,AT
-        addq    $hi1,AT,$hi1
-        mulq    $aj,$bi,$alo
-        mov     2,$j
-        umulh   $aj,$bi,$ahi
-        mov     sp,$tp
-        mulq    $nj,$m1,$nlo
-        s8addq  $j,$ap,$aj
-        umulh   $nj,$m1,$nhi
-        s8addq  $j,$np,$nj
-.align  4
-.L1st:
-        .set    noreorder
-        ldq     $aj,($aj)
-        addl    $j,1,$j
-        ldq     $nj,($nj)
-        lda     $tp,8($tp)
-        addq    $alo,$hi0,$lo0
-        mulq    $aj,$bi,$alo
-        cmpult  $lo0,$hi0,AT
-        addq    $nlo,$hi1,$lo1
-        mulq    $nj,$m1,$nlo
-        addq    $ahi,AT,$hi0
-        cmpult  $lo1,$hi1,v0
-        cmplt   $j,$num,$tj
-        umulh   $aj,$bi,$ahi
-        addq    $nhi,v0,$hi1
-        addq    $lo1,$lo0,$lo1
-        s8addq  $j,$ap,$aj
-        umulh   $nj,$m1,$nhi
-        cmpult  $lo1,$lo0,v0
-        addq    $hi1,v0,$hi1
-        s8addq  $j,$np,$nj
-        stq     $lo1,-8($tp)
-        nop
-        unop
-        bne     $tj,.L1st
-        .set    reorder
-        addq    $alo,$hi0,$lo0
-        addq    $nlo,$hi1,$lo1
-        cmpult  $lo0,$hi0,AT
-        cmpult  $lo1,$hi1,v0
-        addq    $ahi,AT,$hi0
-        addq    $nhi,v0,$hi1
-        addq    $lo1,$lo0,$lo1
-        cmpult  $lo1,$lo0,v0
-        addq    $hi1,v0,$hi1
-        stq     $lo1,0($tp)
-        addq    $hi1,$hi0,$hi1
-        cmpult  $hi1,$hi0,AT
-        stq     $hi1,8($tp)
-        stq     AT,16($tp)
-        mov     1,$i
-.align  4
-.Louter:
-        s8addq  $i,$bp,$bi
-        ldq     $hi0,($ap)
-        ldq     $aj,8($ap)
-        ldq     $bi,($bi)
-        ldq     $hi1,($np)
-        ldq     $nj,8($np)
-        ldq     $tj,(sp)
-        mulq    $hi0,$bi,$lo0
-        umulh   $hi0,$bi,$hi0
-        addq    $lo0,$tj,$lo0
-        cmpult  $lo0,$tj,AT
-        addq    $hi0,AT,$hi0
-        mulq    $lo0,$n0,$m1
-        mulq    $hi1,$m1,$lo1
-        umulh   $hi1,$m1,$hi1
-        addq    $lo1,$lo0,$lo1
-        cmpult  $lo1,$lo0,AT
-        mov     2,$j
-        addq    $hi1,AT,$hi1
-        mulq    $aj,$bi,$alo
-        mov     sp,$tp
-        umulh   $aj,$bi,$ahi
-        mulq    $nj,$m1,$nlo
-        s8addq  $j,$ap,$aj
-        umulh   $nj,$m1,$nhi
-.align  4
-.Linner:
-        .set    noreorder
-        ldq     $tj,8($tp)      #L0
-        nop                     #U1
-        ldq     $aj,($aj)       #L1
-        s8addq  $j,$np,$nj      #U0
-        ldq     $nj,($nj)       #L0
-        nop                     #U1
-        addq    $alo,$hi0,$lo0  #L1
-        lda     $tp,8($tp)
-        mulq    $aj,$bi,$alo    #U1
-        cmpult  $lo0,$hi0,AT    #L0
-        addq    $nlo,$hi1,$lo1  #L1
-        addl    $j,1,$j
-        mulq    $nj,$m1,$nlo    #U1
-        addq    $ahi,AT,$hi0    #L0
-        addq    $lo0,$tj,$lo0   #L1
-        cmpult  $lo1,$hi1,v0    #U0
-        umulh   $aj,$bi,$ahi    #U1
-        cmpult  $lo0,$tj,AT     #L0
-        addq    $lo1,$lo0,$lo1  #L1
-        addq    $nhi,v0,$hi1    #U0
-        umulh   $nj,$m1,$nhi    #U1
-        s8addq  $j,$ap,$aj      #L0
-        cmpult  $lo1,$lo0,v0    #L1
-        cmplt   $j,$num,$tj     #U0     # borrow $tj
-        addq    $hi0,AT,$hi0    #L0
-        addq    $hi1,v0,$hi1    #U1
-        stq     $lo1,-8($tp)    #L1
-        bne     $tj,.Linner     #U0
-        .set    reorder
-        ldq     $tj,8($tp)
-        addq    $alo,$hi0,$lo0
-        addq    $nlo,$hi1,$lo1
-        cmpult  $lo0,$hi0,AT
-        cmpult  $lo1,$hi1,v0
-        addq    $ahi,AT,$hi0
-        addq    $nhi,v0,$hi1
-        addq    $lo0,$tj,$lo0
-        cmpult  $lo0,$tj,AT
-        addq    $hi0,AT,$hi0
-        ldq     $tj,16($tp)
-        addq    $lo1,$lo0,$j
-        cmpult  $j,$lo0,v0
-        addq    $hi1,v0,$hi1
-        addq    $hi1,$hi0,$lo1
-        stq     $j,($tp)
-        cmpult  $lo1,$hi0,$hi1
-        addq    $lo1,$tj,$lo1
-        cmpult  $lo1,$tj,AT
-        addl    $i,1,$i
-        addq    $hi1,AT,$hi1
-        stq     $lo1,8($tp)
-        cmplt   $i,$num,$tj     # borrow $tj
-        stq     $hi1,16($tp)
-        bne     $tj,.Louter
-        s8addq  $num,sp,$tj     # &tp[num]
-        mov     $rp,$bp         # put rp aside
-        mov     sp,$tp
-        mov     sp,$ap
-        mov     0,$hi0          # clear borrow bit
-.align  4
-.Lsub:  ldq     $lo0,($tp)
-        ldq     $lo1,($np)
-        lda     $tp,8($tp)
-        lda     $np,8($np)
-        subq    $lo0,$lo1,$lo1  # tp[i]-np[i]
-        cmpult  $lo0,$lo1,AT
-        subq    $lo1,$hi0,$lo0
-        cmpult  $lo1,$lo0,$hi0
-        or      $hi0,AT,$hi0
-        stq     $lo0,($rp)
-        cmpult  $tp,$tj,v0
-        lda     $rp,8($rp)
-        bne     v0,.Lsub
-        subq    $hi1,$hi0,$hi0  # handle upmost overflow bit
-        mov     sp,$tp
-        mov     $bp,$rp         # restore rp
-        and     sp,$hi0,$ap
-        bic     $bp,$hi0,$bp
-        bis     $bp,$ap,$ap     # ap=borrow?tp:rp
-.align  4
-.Lcopy: ldq     $aj,($ap)       # copy or in-place refresh
-        lda     $tp,8($tp)
-        lda     $rp,8($rp)
-        lda     $ap,8($ap)
-        stq     zero,-8($tp)    # zap tp
-        cmpult  $tp,$tj,AT
-        stq     $aj,-8($rp)
-        bne     AT,.Lcopy
-        mov     1,v0
-.Lexit:
-        .set    noreorder
-        mov     fp,sp
-        /*ldq   ra,0(sp)*/
-        ldq     s3,8(sp)
-        ldq     s4,16(sp)
-        ldq     s5,24(sp)
-        ldq     fp,32(sp)
-        lda     sp,40(sp)
-        ret     (ra)
-.end    bn_mul_mont
-.rdata
-.asciiz "Montgomery Multiplication for Alpha, CRYPTOGAMS by <appro\@openssl.org>"
-___
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/armv4-mont.pl b/src/lib/libcrypto/bn/asm/armv4-mont.pl
deleted file mode 100644
index 05d5dc1a48..0000000000
--- a/src/lib/libcrypto/bn/asm/armv4-mont.pl
+++ /dev/null
@@ -1,200 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# January 2007.
-# Montgomery multiplication for ARMv4.
-#
-# Performance improvement naturally varies among CPU implementations
-# and compilers. The code was observed to provide +65-35% improvement
-# [depending on key length, less for longer keys] on ARM920T, and
-# +115-80% on Intel IXP425. This is compared to pre-bn_mul_mont code
-# base and compiler generated code with in-lined umull and even umlal
-# instructions. The latter means that this code didn't really have an 
-# "advantage" of utilizing some "secret" instruction.
-#
-# The code is interoperable with Thumb ISA and is rather compact, less
-# than 1/2KB. Windows CE port would be trivial, as it's exclusively
-# about decorations, ABI and instruction syntax are identical.
-$num="r0";      # starts as num argument, but holds &tp[num-1]
-$ap="r1";
-$bp="r2"; $bi="r2"; $rp="r2";
-$np="r3";
-$tp="r4";
-$aj="r5";
-$nj="r6";
-$tj="r7";
-$n0="r8";
-###########     # r9 is reserved by ELF as platform specific, e.g. TLS pointer
-$alo="r10";     # sl, gcc uses it to keep @GOT
-$ahi="r11";     # fp
-$nlo="r12";     # ip
-###########     # r13 is stack pointer
-$nhi="r14";     # lr
-###########     # r15 is program counter
-#### argument block layout relative to &tp[num-1], a.k.a. $num
-$_rp="$num,#12*4";
-# ap permanently resides in r1
-$_bp="$num,#13*4";
-# np permanently resides in r3
-$_n0="$num,#14*4";
-$_num="$num,#15*4";     $_bpend=$_num;
-$code=<<___;
-.text
-.global bn_mul_mont
-.type   bn_mul_mont,%function
-.align  2
-bn_mul_mont:
-        stmdb   sp!,{r0,r2}             @ sp points at argument block
-        ldr     $num,[sp,#3*4]          @ load num
-        cmp     $num,#2
-        movlt   r0,#0
-        addlt   sp,sp,#2*4
-        blt     .Labrt
-        stmdb   sp!,{r4-r12,lr}         @ save 10 registers
-        mov     $num,$num,lsl#2         @ rescale $num for byte count
-        sub     sp,sp,$num              @ alloca(4*num)
-        sub     sp,sp,#4                @ +extra dword
-        sub     $num,$num,#4            @ "num=num-1"
-        add     $tp,$bp,$num            @ &bp[num-1]
-        add     $num,sp,$num            @ $num to point at &tp[num-1]
-        ldr     $n0,[$_n0]              @ &n0
-        ldr     $bi,[$bp]               @ bp[0]
-        ldr     $aj,[$ap],#4            @ ap[0],ap++
-        ldr     $nj,[$np],#4            @ np[0],np++
-        ldr     $n0,[$n0]               @ *n0
-        str     $tp,[$_bpend]           @ save &bp[num]
-        umull   $alo,$ahi,$aj,$bi       @ ap[0]*bp[0]
-        str     $n0,[$_n0]              @ save n0 value
-        mul     $n0,$alo,$n0            @ "tp[0]"*n0
-        mov     $nlo,#0
-        umlal   $alo,$nlo,$nj,$n0       @ np[0]*n0+"t[0]"
-        mov     $tp,sp
-.L1st:
-        ldr     $aj,[$ap],#4            @ ap[j],ap++
-        mov     $alo,$ahi
-        mov     $ahi,#0
-        umlal   $alo,$ahi,$aj,$bi       @ ap[j]*bp[0]
-        ldr     $nj,[$np],#4            @ np[j],np++
-        mov     $nhi,#0
-        umlal   $nlo,$nhi,$nj,$n0       @ np[j]*n0
-        adds    $nlo,$nlo,$alo
-        str     $nlo,[$tp],#4           @ tp[j-1]=,tp++
-        adc     $nlo,$nhi,#0
-        cmp     $tp,$num
-        bne     .L1st
-        adds    $nlo,$nlo,$ahi
-        mov     $nhi,#0
-        adc     $nhi,$nhi,#0
-        ldr     $tp,[$_bp]              @ restore bp
-        str     $nlo,[$num]             @ tp[num-1]=
-        ldr     $n0,[$_n0]              @ restore n0
-        str     $nhi,[$num,#4]          @ tp[num]=
-.Louter:
-        sub     $tj,$num,sp             @ "original" $num-1 value
-        sub     $ap,$ap,$tj             @ "rewind" ap to &ap[1]
-        sub     $np,$np,$tj             @ "rewind" np to &np[1]
-        ldr     $bi,[$tp,#4]!           @ *(++bp)
-        ldr     $aj,[$ap,#-4]           @ ap[0]
-        ldr     $nj,[$np,#-4]           @ np[0]
-        ldr     $alo,[sp]               @ tp[0]
-        ldr     $tj,[sp,#4]             @ tp[1]
-        mov     $ahi,#0
-        umlal   $alo,$ahi,$aj,$bi       @ ap[0]*bp[i]+tp[0]
-        str     $tp,[$_bp]              @ save bp
-        mul     $n0,$alo,$n0
-        mov     $nlo,#0
-        umlal   $alo,$nlo,$nj,$n0       @ np[0]*n0+"tp[0]"
-        mov     $tp,sp
-.Linner:
-        ldr     $aj,[$ap],#4            @ ap[j],ap++
-        adds    $alo,$ahi,$tj           @ +=tp[j]
-        mov     $ahi,#0
-        umlal   $alo,$ahi,$aj,$bi       @ ap[j]*bp[i]
-        ldr     $nj,[$np],#4            @ np[j],np++
-        mov     $nhi,#0
-        umlal   $nlo,$nhi,$nj,$n0       @ np[j]*n0
-        ldr     $tj,[$tp,#8]            @ tp[j+1]
-        adc     $ahi,$ahi,#0
-        adds    $nlo,$nlo,$alo
-        str     $nlo,[$tp],#4           @ tp[j-1]=,tp++
-        adc     $nlo,$nhi,#0
-        cmp     $tp,$num
-        bne     .Linner
-        adds    $nlo,$nlo,$ahi
-        mov     $nhi,#0
-        adc     $nhi,$nhi,#0
-        adds    $nlo,$nlo,$tj
-        adc     $nhi,$nhi,#0
-        ldr     $tp,[$_bp]              @ restore bp
-        ldr     $tj,[$_bpend]           @ restore &bp[num]
-        str     $nlo,[$num]             @ tp[num-1]=
-        ldr     $n0,[$_n0]              @ restore n0
-        str     $nhi,[$num,#4]          @ tp[num]=
-        cmp     $tp,$tj
-        bne     .Louter
-        ldr     $rp,[$_rp]              @ pull rp
-        add     $num,$num,#4            @ $num to point at &tp[num]
-        sub     $aj,$num,sp             @ "original" num value
-        mov     $tp,sp                  @ "rewind" $tp
-        mov     $ap,$tp                 @ "borrow" $ap
-        sub     $np,$np,$aj             @ "rewind" $np to &np[0]
-        subs    $tj,$tj,$tj             @ "clear" carry flag
-.Lsub:  ldr     $tj,[$tp],#4
-        ldr     $nj,[$np],#4
-        sbcs    $tj,$tj,$nj             @ tp[j]-np[j]
-        str     $tj,[$rp],#4            @ rp[j]=
-        teq     $tp,$num                @ preserve carry
-        bne     .Lsub
-        sbcs    $nhi,$nhi,#0            @ upmost carry
-        mov     $tp,sp                  @ "rewind" $tp
-        sub     $rp,$rp,$aj             @ "rewind" $rp
-        and     $ap,$tp,$nhi
-        bic     $np,$rp,$nhi
-        orr     $ap,$ap,$np             @ ap=borrow?tp:rp
-.Lcopy: ldr     $tj,[$ap],#4            @ copy or in-place refresh
-        str     sp,[$tp],#4             @ zap tp
-        str     $tj,[$rp],#4
-        cmp     $tp,$num
-        bne     .Lcopy
-        add     sp,$num,#4              @ skip over tp[num+1]
-        ldmia   sp!,{r4-r12,lr}         @ restore registers
-        add     sp,sp,#2*4              @ skip over {r0,r2}
-        mov     r0,#1
-.Labrt: tst     lr,#1
-        moveq   pc,lr                   @ be binary compatible with V4, yet
-        bx      lr                      @ interoperable with Thumb ISA:-)
-.size   bn_mul_mont,.-bn_mul_mont
-.asciz  "Montgomery multiplication for ARMv4, CRYPTOGAMS by <appro\@openssl.org>"
-___
-$code =~ s/\bbx\s+lr\b/.word\t0xe12fff1e/gm;    # make it possible to compile with -march=armv4
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/bn-586.pl b/src/lib/libcrypto/bn/asm/bn-586.pl
deleted file mode 100644
index 26c2685a72..0000000000
--- a/src/lib/libcrypto/bn/asm/bn-586.pl
+++ /dev/null
@@ -1,675 +0,0 @@
-#!/usr/local/bin/perl
-push(@INC,"perlasm","../../perlasm");
-require "x86asm.pl";
-&asm_init($ARGV[0],$0);
-$sse2=0;
-for (@ARGV) { $sse2=1 if (/-DOPENSSL_IA32_SSE2/); }
-&external_label("OPENSSL_ia32cap_P") if ($sse2);
-&bn_mul_add_words("bn_mul_add_words");
-&bn_mul_words("bn_mul_words");
-&bn_sqr_words("bn_sqr_words");
-&bn_div_words("bn_div_words");
-&bn_add_words("bn_add_words");
-&bn_sub_words("bn_sub_words");
-&bn_sub_part_words("bn_sub_part_words");
-&asm_finish();
-sub bn_mul_add_words
-        {
-        local($name)=@_;
-        &function_begin($name,$sse2?"EXTRN\t_OPENSSL_ia32cap_P:DWORD":"");
-        &comment("");
-        $Low="eax";
-        $High="edx";
-        $a="ebx";
-        $w="ebp";
-        $r="edi";
-        $c="esi";
-        &xor($c,$c);            # clear carry
-        &mov($r,&wparam(0));    #
-        &mov("ecx",&wparam(2)); #
-        &mov($a,&wparam(1));    #
-        &and("ecx",0xfffffff8); # num / 8
-        &mov($w,&wparam(3));    #
-        &push("ecx");           # Up the stack for a tmp variable
-        &jz(&label("maw_finish"));
-        if ($sse2) {
-                &picmeup("eax","OPENSSL_ia32cap_P");
-                &bt(&DWP(0,"eax"),26);
-                &jnc(&label("maw_loop"));
-                &movd("mm0",$w);                # mm0 = w
-                &pxor("mm1","mm1");             # mm1 = carry_in
-                &set_label("maw_sse2_loop",0);
-                &movd("mm3",&DWP(0,$r,"",0));   # mm3 = r[0]
-                &paddq("mm1","mm3");            # mm1 = carry_in + r[0]
-                &movd("mm2",&DWP(0,$a,"",0));   # mm2 = a[0]
-                &pmuludq("mm2","mm0");          # mm2 = w*a[0]
-                &movd("mm4",&DWP(4,$a,"",0));   # mm4 = a[1]
-                &pmuludq("mm4","mm0");          # mm4 = w*a[1]
-                &movd("mm6",&DWP(8,$a,"",0));   # mm6 = a[2]
-                &pmuludq("mm6","mm0");          # mm6 = w*a[2]
-                &movd("mm7",&DWP(12,$a,"",0));  # mm7 = a[3]
-                &pmuludq("mm7","mm0");          # mm7 = w*a[3]
-                &paddq("mm1","mm2");            # mm1 = carry_in + r[0] + w*a[0]
-                &movd("mm3",&DWP(4,$r,"",0));   # mm3 = r[1]
-                &paddq("mm3","mm4");            # mm3 = r[1] + w*a[1]
-                &movd("mm5",&DWP(8,$r,"",0));   # mm5 = r[2]
-                &paddq("mm5","mm6");            # mm5 = r[2] + w*a[2]
-                &movd("mm4",&DWP(12,$r,"",0));  # mm4 = r[3]
-                &paddq("mm7","mm4");            # mm7 = r[3] + w*a[3]
-                &movd(&DWP(0,$r,"",0),"mm1");
-                &movd("mm2",&DWP(16,$a,"",0));  # mm2 = a[4]
-                &pmuludq("mm2","mm0");          # mm2 = w*a[4]
-                &psrlq("mm1",32);               # mm1 = carry0
-                &movd("mm4",&DWP(20,$a,"",0));  # mm4 = a[5]
-                &pmuludq("mm4","mm0");          # mm4 = w*a[5]
-                &paddq("mm1","mm3");            # mm1 = carry0 + r[1] + w*a[1]
-                &movd("mm6",&DWP(24,$a,"",0));  # mm6 = a[6]
-                &pmuludq("mm6","mm0");          # mm6 = w*a[6]
-                &movd(&DWP(4,$r,"",0),"mm1");
-                &psrlq("mm1",32);               # mm1 = carry1
-                &movd("mm3",&DWP(28,$a,"",0));  # mm3 = a[7]
-                &add($a,32);
-                &pmuludq("mm3","mm0");          # mm3 = w*a[7]
-                &paddq("mm1","mm5");            # mm1 = carry1 + r[2] + w*a[2]
-                &movd("mm5",&DWP(16,$r,"",0));  # mm5 = r[4]
-                &paddq("mm2","mm5");            # mm2 = r[4] + w*a[4]
-                &movd(&DWP(8,$r,"",0),"mm1");
-                &psrlq("mm1",32);               # mm1 = carry2
-                &paddq("mm1","mm7");            # mm1 = carry2 + r[3] + w*a[3]
-                &movd("mm5",&DWP(20,$r,"",0));  # mm5 = r[5]
-                &paddq("mm4","mm5");            # mm4 = r[5] + w*a[5]
-                &movd(&DWP(12,$r,"",0),"mm1");
-                &psrlq("mm1",32);               # mm1 = carry3
-                &paddq("mm1","mm2");            # mm1 = carry3 + r[4] + w*a[4]
-                &movd("mm5",&DWP(24,$r,"",0));  # mm5 = r[6]
-                &paddq("mm6","mm5");            # mm6 = r[6] + w*a[6]
-                &movd(&DWP(16,$r,"",0),"mm1");
-                &psrlq("mm1",32);               # mm1 = carry4
-                &paddq("mm1","mm4");            # mm1 = carry4 + r[5] + w*a[5]
-                &movd("mm5",&DWP(28,$r,"",0));  # mm5 = r[7]
-                &paddq("mm3","mm5");            # mm3 = r[7] + w*a[7]
-                &movd(&DWP(20,$r,"",0),"mm1");
-                &psrlq("mm1",32);               # mm1 = carry5
-                &paddq("mm1","mm6");            # mm1 = carry5 + r[6] + w*a[6]
-                &movd(&DWP(24,$r,"",0),"mm1");
-                &psrlq("mm1",32);               # mm1 = carry6
-                &paddq("mm1","mm3");            # mm1 = carry6 + r[7] + w*a[7]
-                &movd(&DWP(28,$r,"",0),"mm1");
-                &add($r,32);
-                &psrlq("mm1",32);               # mm1 = carry_out
-                &sub("ecx",8);
-                &jnz(&label("maw_sse2_loop"));
-                &movd($c,"mm1");                # c = carry_out
-                &emms();
-                &jmp(&label("maw_finish"));
-        }
-        &set_label("maw_loop",0);
-        &mov(&swtmp(0),"ecx");  #
-        for ($i=0; $i<32; $i+=4)
-                {
-                &comment("Round $i");
-                 &mov("eax",&DWP($i,$a,"",0));  # *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);         # L(t)+= *r
-                 &mov($c,&DWP($i,$r,"",0));     # L(t)+= *r
-                &adc("edx",0);                  # H(t)+=carry
-                 &add("eax",$c);                # L(t)+=c
-                &adc("edx",0);                  # H(t)+=carry
-                 &mov(&DWP($i,$r,"",0),"eax");  # *r= L(t);
-                &mov($c,"edx");                 # c=  H(t);
-                }
-        &comment("");
-        &mov("ecx",&swtmp(0));  #
-        &add($a,32);
-        &add($r,32);
-        &sub("ecx",8);
-        &jnz(&label("maw_loop"));
-        &set_label("maw_finish",0);
-        &mov("ecx",&wparam(2)); # get num
-        &and("ecx",7);
-        &jnz(&label("maw_finish2"));    # helps branch prediction
-        &jmp(&label("maw_end"));
-        &set_label("maw_finish2",1);
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                 &mov("eax",&DWP($i*4,$a,"",0));# *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);                 # L(t)+=c
-                 &mov($c,&DWP($i*4,$r,"",0));   # L(t)+= *r
-                &adc("edx",0);                  # H(t)+=carry
-                 &add("eax",$c);
-                &adc("edx",0);                  # H(t)+=carry
-                 &dec("ecx") if ($i != 7-1);
-                &mov(&DWP($i*4,$r,"",0),"eax"); # *r= L(t);
-                 &mov($c,"edx");                        # c=  H(t);
-                &jz(&label("maw_end")) if ($i != 7-1);
-                }
-        &set_label("maw_end",0);
-        &mov("eax",$c);
-        &pop("ecx");    # clear variable from
-        &function_end($name);
-        }
-sub bn_mul_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $Low="eax";
-        $High="edx";
-        $a="ebx";
-        $w="ecx";
-        $r="edi";
-        $c="esi";
-        $num="ebp";
-        &xor($c,$c);            # clear carry
-        &mov($r,&wparam(0));    #
-        &mov($a,&wparam(1));    #
-        &mov($num,&wparam(2));  #
-        &mov($w,&wparam(3));    #
-        &and($num,0xfffffff8);  # num / 8
-        &jz(&label("mw_finish"));
-        &set_label("mw_loop",0);
-        for ($i=0; $i<32; $i+=4)
-                {
-                &comment("Round $i");
-                 &mov("eax",&DWP($i,$a,"",0));  # *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);                 # L(t)+=c
-                 # XXX
-                &adc("edx",0);                  # H(t)+=carry
-                 &mov(&DWP($i,$r,"",0),"eax");  # *r= L(t);
-                &mov($c,"edx");                 # c=  H(t);
-                }
-        &comment("");
-        &add($a,32);
-        &add($r,32);
-        &sub($num,8);
-        &jz(&label("mw_finish"));
-        &jmp(&label("mw_loop"));
-        &set_label("mw_finish",0);
-        &mov($num,&wparam(2));  # get num
-        &and($num,7);
-        &jnz(&label("mw_finish2"));
-        &jmp(&label("mw_end"));
-        &set_label("mw_finish2",1);
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                 &mov("eax",&DWP($i*4,$a,"",0));# *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);                 # L(t)+=c
-                 # XXX
-                &adc("edx",0);                  # H(t)+=carry
-                 &mov(&DWP($i*4,$r,"",0),"eax");# *r= L(t);
-                &mov($c,"edx");                 # c=  H(t);
-                 &dec($num) if ($i != 7-1);
-                &jz(&label("mw_end")) if ($i != 7-1);
-                }
-        &set_label("mw_end",0);
-        &mov("eax",$c);
-        &function_end($name);
-        }
-sub bn_sqr_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $r="esi";
-        $a="edi";
-        $num="ebx";
-        &mov($r,&wparam(0));    #
-        &mov($a,&wparam(1));    #
-        &mov($num,&wparam(2));  #
-        &and($num,0xfffffff8);  # num / 8
-        &jz(&label("sw_finish"));
-        &set_label("sw_loop",0);
-        for ($i=0; $i<32; $i+=4)
-                {
-                &comment("Round $i");
-                &mov("eax",&DWP($i,$a,"",0));   # *a
-                 # XXX
-                &mul("eax");                    # *a * *a
-                &mov(&DWP($i*2,$r,"",0),"eax"); #
-                 &mov(&DWP($i*2+4,$r,"",0),"edx");#
-                }
-        &comment("");
-        &add($a,32);
-        &add($r,64);
-        &sub($num,8);
-        &jnz(&label("sw_loop"));
-        &set_label("sw_finish",0);
-        &mov($num,&wparam(2));  # get num
-        &and($num,7);
-        &jz(&label("sw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov("eax",&DWP($i*4,$a,"",0)); # *a
-                 # XXX
-                &mul("eax");                    # *a * *a
-                &mov(&DWP($i*8,$r,"",0),"eax"); #
-                 &dec($num) if ($i != 7-1);
-                &mov(&DWP($i*8+4,$r,"",0),"edx");
-                 &jz(&label("sw_end")) if ($i != 7-1);
-                }
-        &set_label("sw_end",0);
-        &function_end($name);
-        }
-sub bn_div_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &mov("edx",&wparam(0)); #
-        &mov("eax",&wparam(1)); #
-        &mov("ebx",&wparam(2)); #
-        &div("ebx");
-        &function_end($name);
-        }
-sub bn_add_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $a="esi";
-        $b="edi";
-        $c="eax";
-        $r="ebx";
-        $tmp1="ecx";
-        $tmp2="edx";
-        $num="ebp";
-        &mov($r,&wparam(0));    # get r
-         &mov($a,&wparam(1));   # get a
-        &mov($b,&wparam(2));    # get b
-         &mov($num,&wparam(3)); # get num
-        &xor($c,$c);            # clear carry
-         &and($num,0xfffffff8); # num / 8
-        &jz(&label("aw_finish"));
-        &set_label("aw_loop",0);
-        for ($i=0; $i<8; $i++)
-                {
-                &comment("Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0));         # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));        # *b
-                &add($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &add($tmp1,$tmp2);
-                &adc($c,0);
-                 &mov(&DWP($i*4,$r,"",0),$tmp1);        # *r
-                }
-        &comment("");
-        &add($a,32);
-         &add($b,32);
-        &add($r,32);
-         &sub($num,8);
-        &jnz(&label("aw_loop"));
-        &set_label("aw_finish",0);
-        &mov($num,&wparam(3));  # get num
-        &and($num,7);
-         &jz(&label("aw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0)); # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));# *b
-                &add($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &add($tmp1,$tmp2);
-                &adc($c,0);
-                 &dec($num) if ($i != 6);
-                &mov(&DWP($i*4,$r,"",0),$tmp1); # *r
-                 &jz(&label("aw_end")) if ($i != 6);
-                }
-        &set_label("aw_end",0);
-#       &mov("eax",$c);         # $c is "eax"
-        &function_end($name);
-        }
-sub bn_sub_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $a="esi";
-        $b="edi";
-        $c="eax";
-        $r="ebx";
-        $tmp1="ecx";
-        $tmp2="edx";
-        $num="ebp";
-        &mov($r,&wparam(0));    # get r
-         &mov($a,&wparam(1));   # get a
-        &mov($b,&wparam(2));    # get b
-         &mov($num,&wparam(3)); # get num
-        &xor($c,$c);            # clear carry
-         &and($num,0xfffffff8); # num / 8
-        &jz(&label("aw_finish"));
-        &set_label("aw_loop",0);
-        for ($i=0; $i<8; $i++)
-                {
-                &comment("Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0));         # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));        # *b
-                &sub($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &sub($tmp1,$tmp2);
-                &adc($c,0);
-                 &mov(&DWP($i*4,$r,"",0),$tmp1);        # *r
-                }
-        &comment("");
-        &add($a,32);
-         &add($b,32);
-        &add($r,32);
-         &sub($num,8);
-        &jnz(&label("aw_loop"));
-        &set_label("aw_finish",0);
-        &mov($num,&wparam(3));  # get num
-        &and($num,7);
-         &jz(&label("aw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0)); # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));# *b
-                &sub($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &sub($tmp1,$tmp2);
-                &adc($c,0);
-                 &dec($num) if ($i != 6);
-                &mov(&DWP($i*4,$r,"",0),$tmp1); # *r
-                 &jz(&label("aw_end")) if ($i != 6);
-                }
-        &set_label("aw_end",0);
-#       &mov("eax",$c);         # $c is "eax"
-        &function_end($name);
-        }
-sub bn_sub_part_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $a="esi";
-        $b="edi";
-        $c="eax";
-        $r="ebx";
-        $tmp1="ecx";
-        $tmp2="edx";
-        $num="ebp";
-        &mov($r,&wparam(0));    # get r
-         &mov($a,&wparam(1));   # get a
-        &mov($b,&wparam(2));    # get b
-         &mov($num,&wparam(3)); # get num
-        &xor($c,$c);            # clear carry
-         &and($num,0xfffffff8); # num / 8
-        &jz(&label("aw_finish"));
-        &set_label("aw_loop",0);
-        for ($i=0; $i<8; $i++)
-                {
-                &comment("Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0));         # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));        # *b
-                &sub($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &sub($tmp1,$tmp2);
-                &adc($c,0);
-                 &mov(&DWP($i*4,$r,"",0),$tmp1);        # *r
-                }
-        &comment("");
-        &add($a,32);
-         &add($b,32);
-        &add($r,32);
-         &sub($num,8);
-        &jnz(&label("aw_loop"));
-        &set_label("aw_finish",0);
-        &mov($num,&wparam(3));  # get num
-        &and($num,7);
-         &jz(&label("aw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov($tmp1,&DWP(0,$a,"",0));    # *a
-                 &mov($tmp2,&DWP(0,$b,"",0));# *b
-                &sub($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &sub($tmp1,$tmp2);
-                &adc($c,0);
-                &mov(&DWP(0,$r,"",0),$tmp1);    # *r
-                &add($a, 4);
-                &add($b, 4);
-                &add($r, 4);
-                 &dec($num) if ($i != 6);
-                 &jz(&label("aw_end")) if ($i != 6);
-                }
-        &set_label("aw_end",0);
-        &cmp(&wparam(4),0);
-        &je(&label("pw_end"));
-        &mov($num,&wparam(4));  # get dl
-        &cmp($num,0);
-        &je(&label("pw_end"));
-        &jge(&label("pw_pos"));
-        &comment("pw_neg");
-        &mov($tmp2,0);
-        &sub($tmp2,$num);
-        &mov($num,$tmp2);
-        &and($num,0xfffffff8);  # num / 8
-        &jz(&label("pw_neg_finish"));
-        &set_label("pw_neg_loop",0);
-        for ($i=0; $i<8; $i++)
-        {
-            &comment("dl<0 Round $i");
-            &mov($tmp1,0);
-            &mov($tmp2,&DWP($i*4,$b,"",0));     # *b
-            &sub($tmp1,$c);
-            &mov($c,0);
-            &adc($c,$c);
-            &sub($tmp1,$tmp2);
-            &adc($c,0);
-            &mov(&DWP($i*4,$r,"",0),$tmp1);     # *r
-        }
-            
-        &comment("");
-        &add($b,32);
-        &add($r,32);
-        &sub($num,8);
-        &jnz(&label("pw_neg_loop"));
-            
-        &set_label("pw_neg_finish",0);
-        &mov($tmp2,&wparam(4)); # get dl
-        &mov($num,0);
-        &sub($num,$tmp2);
-        &and($num,7);
-        &jz(&label("pw_end"));
-            
-        for ($i=0; $i<7; $i++)
-        {
-            &comment("dl<0 Tail Round $i");
-            &mov($tmp1,0);
-            &mov($tmp2,&DWP($i*4,$b,"",0));# *b
-            &sub($tmp1,$c);
-            &mov($c,0);
-            &adc($c,$c);
-            &sub($tmp1,$tmp2);
-            &adc($c,0);
-            &dec($num) if ($i != 6);
-            &mov(&DWP($i*4,$r,"",0),$tmp1);     # *r
-            &jz(&label("pw_end")) if ($i != 6);
-        }
-        &jmp(&label("pw_end"));
-        
-        &set_label("pw_pos",0);
-        
-        &and($num,0xfffffff8);  # num / 8
-        &jz(&label("pw_pos_finish"));
-        &set_label("pw_pos_loop",0);
-        for ($i=0; $i<8; $i++)
-        {
-            &comment("dl>0 Round $i");
-            &mov($tmp1,&DWP($i*4,$a,"",0));     # *a
-            &sub($tmp1,$c);
-            &mov(&DWP($i*4,$r,"",0),$tmp1);     # *r
-            &jnc(&label("pw_nc".$i));
-        }
-            
-        &comment("");
-        &add($a,32);
-        &add($r,32);
-        &sub($num,8);
-        &jnz(&label("pw_pos_loop"));
-            
-        &set_label("pw_pos_finish",0);
-        &mov($num,&wparam(4));  # get dl
-        &and($num,7);
-        &jz(&label("pw_end"));
-            
-        for ($i=0; $i<7; $i++)
-        {
-            &comment("dl>0 Tail Round $i");
-            &mov($tmp1,&DWP($i*4,$a,"",0));     # *a
-            &sub($tmp1,$c);
-            &mov(&DWP($i*4,$r,"",0),$tmp1);     # *r
-            &jnc(&label("pw_tail_nc".$i));
-            &dec($num) if ($i != 6);
-            &jz(&label("pw_end")) if ($i != 6);
-        }
-        &mov($c,1);
-        &jmp(&label("pw_end"));
-        &set_label("pw_nc_loop",0);
-        for ($i=0; $i<8; $i++)
-        {
-            &mov($tmp1,&DWP($i*4,$a,"",0));     # *a
-            &mov(&DWP($i*4,$r,"",0),$tmp1);     # *r
-            &set_label("pw_nc".$i,0);
-        }
-            
-        &comment("");
-        &add($a,32);
-        &add($r,32);
-        &sub($num,8);
-        &jnz(&label("pw_nc_loop"));
-            
-        &mov($num,&wparam(4));  # get dl
-        &and($num,7);
-        &jz(&label("pw_nc_end"));
-            
-        for ($i=0; $i<7; $i++)
-        {
-            &mov($tmp1,&DWP($i*4,$a,"",0));     # *a
-            &mov(&DWP($i*4,$r,"",0),$tmp1);     # *r
-            &set_label("pw_tail_nc".$i,0);
-            &dec($num) if ($i != 6);
-            &jz(&label("pw_nc_end")) if ($i != 6);
-        }
-        &set_label("pw_nc_end",0);
-        &mov($c,0);
-        &set_label("pw_end",0);
-#       &mov("eax",$c);         # $c is "eax"
-        &function_end($name);
-        }
diff --git a/src/lib/libcrypto/bn/asm/co-586.pl b/src/lib/libcrypto/bn/asm/co-586.pl
deleted file mode 100644
index 5d962cb957..0000000000
--- a/src/lib/libcrypto/bn/asm/co-586.pl
+++ /dev/null
@@ -1,286 +0,0 @@
-#!/usr/local/bin/perl
-push(@INC,"perlasm","../../perlasm");
-require "x86asm.pl";
-&asm_init($ARGV[0],$0);
-&bn_mul_comba("bn_mul_comba8",8);
-&bn_mul_comba("bn_mul_comba4",4);
-&bn_sqr_comba("bn_sqr_comba8",8);
-&bn_sqr_comba("bn_sqr_comba4",4);
-&asm_finish();
-sub mul_add_c
-        {
-        local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
-        # pos == -1 if eax and edx are pre-loaded, 0 to load from next
-        # words, and 1 if load return value
-        &comment("mul a[$ai]*b[$bi]");
-        # "eax" and "edx" will always be pre-loaded.
-        # &mov("eax",&DWP($ai*4,$a,"",0)) ;
-        # &mov("edx",&DWP($bi*4,$b,"",0));
-        &mul("edx");
-        &add($c0,"eax");
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 0;        # laod next a
-         &mov("eax",&wparam(0)) if $pos > 0;                    # load r[]
-         ###
-        &adc($c1,"edx");
-         &mov("edx",&DWP(($nb)*4,$b,"",0)) if $pos == 0;        # laod next b
-         &mov("edx",&DWP(($nb)*4,$b,"",0)) if $pos == 1;        # laod next b
-         ###
-        &adc($c2,0);
-         # is pos > 1, it means it is the last loop 
-         &mov(&DWP($i*4,"eax","",0),$c0) if $pos > 0;           # save r[];
-        &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 1;         # laod next a
-        }
-sub sqr_add_c
-        {
-        local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
-        # pos == -1 if eax and edx are pre-loaded, 0 to load from next
-        # words, and 1 if load return value
-        &comment("sqr a[$ai]*a[$bi]");
-        # "eax" and "edx" will always be pre-loaded.
-        # &mov("eax",&DWP($ai*4,$a,"",0)) ;
-        # &mov("edx",&DWP($bi*4,$b,"",0));
-        if ($ai == $bi)
-                { &mul("eax");}
-        else
-                { &mul("edx");}
-        &add($c0,"eax");
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 0;        # load next a
-         ###
-        &adc($c1,"edx");
-         &mov("edx",&DWP(($nb)*4,$a,"",0)) if ($pos == 1) && ($na != $nb);
-         ###
-        &adc($c2,0);
-         # is pos > 1, it means it is the last loop 
-         &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0;              # save r[];
-        &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 1;         # load next b
-        }
-sub sqr_add_c2
-        {
-        local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
-        # pos == -1 if eax and edx are pre-loaded, 0 to load from next
-        # words, and 1 if load return value
-        &comment("sqr a[$ai]*a[$bi]");
-        # "eax" and "edx" will always be pre-loaded.
-        # &mov("eax",&DWP($ai*4,$a,"",0)) ;
-        # &mov("edx",&DWP($bi*4,$a,"",0));
-        if ($ai == $bi)
-                { &mul("eax");}
-        else
-                { &mul("edx");}
-        &add("eax","eax");
-         ###
-        &adc("edx","edx");
-         ###
-        &adc($c2,0);
-         &add($c0,"eax");
-        &adc($c1,"edx");
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 0;        # load next a
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 1;        # load next b
-        &adc($c2,0);
-        &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0;               # save r[];
-         &mov("edx",&DWP(($nb)*4,$a,"",0)) if ($pos <= 1) && ($na != $nb);
-         ###
-        }
-sub bn_mul_comba
-        {
-        local($name,$num)=@_;
-        local($a,$b,$c0,$c1,$c2);
-        local($i,$as,$ae,$bs,$be,$ai,$bi);
-        local($tot,$end);
-        &function_begin_B($name,"");
-        $c0="ebx";
-        $c1="ecx";
-        $c2="ebp";
-        $a="esi";
-        $b="edi";
-        
-        $as=0;
-        $ae=0;
-        $bs=0;
-        $be=0;
-        $tot=$num+$num-1;
-        &push("esi");
-         &mov($a,&wparam(1));
-        &push("edi");
-         &mov($b,&wparam(2));
-        &push("ebp");
-         &push("ebx");
-        &xor($c0,$c0);
-         &mov("eax",&DWP(0,$a,"",0));   # load the first word 
-        &xor($c1,$c1);
-         &mov("edx",&DWP(0,$b,"",0));   # load the first second 
-        for ($i=0; $i<$tot; $i++)
-                {
-                $ai=$as;
-                $bi=$bs;
-                $end=$be+1;
-                &comment("################## Calculate word $i"); 
-                for ($j=$bs; $j<$end; $j++)
-                        {
-                        &xor($c2,$c2) if ($j == $bs);
-                        if (($j+1) == $end)
-                                {
-                                $v=1;
-                                $v=2 if (($i+1) == $tot);
-                                }
-                        else
-                                { $v=0; }
-                        if (($j+1) != $end)
-                                {
-                                $na=($ai-1);
-                                $nb=($bi+1);
-                                }
-                        else
-                                {
-                                $na=$as+($i < ($num-1));
-                                $nb=$bs+($i >= ($num-1));
-                                }
-#printf STDERR "[$ai,$bi] -> [$na,$nb]\n";
-                        &mul_add_c($a,$ai,$b,$bi,$c0,$c1,$c2,$v,$i,$na,$nb);
-                        if ($v)
-                                {
-                                &comment("saved r[$i]");
-                                # &mov("eax",&wparam(0));
-                                # &mov(&DWP($i*4,"eax","",0),$c0);
-                                ($c0,$c1,$c2)=($c1,$c2,$c0);
-                                }
-                        $ai--;
-                        $bi++;
-                        }
-                $as++ if ($i < ($num-1));
-                $ae++ if ($i >= ($num-1));
-                $bs++ if ($i >= ($num-1));
-                $be++ if ($i < ($num-1));
-                }
-        &comment("save r[$i]");
-        # &mov("eax",&wparam(0));
-        &mov(&DWP($i*4,"eax","",0),$c0);
-        &pop("ebx");
-        &pop("ebp");
-        &pop("edi");
-        &pop("esi");
-        &ret();
-        &function_end_B($name);
-        }
-sub bn_sqr_comba
-        {
-        local($name,$num)=@_;
-        local($r,$a,$c0,$c1,$c2)=@_;
-        local($i,$as,$ae,$bs,$be,$ai,$bi);
-        local($b,$tot,$end,$half);
-        &function_begin_B($name,"");
-        $c0="ebx";
-        $c1="ecx";
-        $c2="ebp";
-        $a="esi";
-        $r="edi";
-        &push("esi");
-         &push("edi");
-        &push("ebp");
-         &push("ebx");
-        &mov($r,&wparam(0));
-         &mov($a,&wparam(1));
-        &xor($c0,$c0);
-         &xor($c1,$c1);
-        &mov("eax",&DWP(0,$a,"",0)); # load the first word
-        $as=0;
-        $ae=0;
-        $bs=0;
-        $be=0;
-        $tot=$num+$num-1;
-        for ($i=0; $i<$tot; $i++)
-                {
-                $ai=$as;
-                $bi=$bs;
-                $end=$be+1;
-                &comment("############### Calculate word $i");
-                for ($j=$bs; $j<$end; $j++)
-                        {
-                        &xor($c2,$c2) if ($j == $bs);
-                        if (($ai-1) < ($bi+1))
-                                {
-                                $v=1;
-                                $v=2 if ($i+1) == $tot;
-                                }
-                        else
-                                { $v=0; }
-                        if (!$v)
-                                {
-                                $na=$ai-1;
-                                $nb=$bi+1;
-                                }
-                        else
-                                {
-                                $na=$as+($i < ($num-1));
-                                $nb=$bs+($i >= ($num-1));
-                                }
-                        if ($ai == $bi)
-                                {
-                                &sqr_add_c($r,$a,$ai,$bi,
-                                        $c0,$c1,$c2,$v,$i,$na,$nb);
-                                }
-                        else
-                                {
-                                &sqr_add_c2($r,$a,$ai,$bi,
-                                        $c0,$c1,$c2,$v,$i,$na,$nb);
-                                }
-                        if ($v)
-                                {
-                                &comment("saved r[$i]");
-                                #&mov(&DWP($i*4,$r,"",0),$c0);
-                                ($c0,$c1,$c2)=($c1,$c2,$c0);
-                                last;
-                                }
-                        $ai--;
-                        $bi++;
-                        }
-                $as++ if ($i < ($num-1));
-                $ae++ if ($i >= ($num-1));
-                $bs++ if ($i >= ($num-1));
-                $be++ if ($i < ($num-1));
-                }
-        &mov(&DWP($i*4,$r,"",0),$c0);
-        &pop("ebx");
-        &pop("ebp");
-        &pop("edi");
-        &pop("esi");
-        &ret();
-        &function_end_B($name);
-        }
diff --git a/src/lib/libcrypto/bn/asm/ia64.S b/src/lib/libcrypto/bn/asm/ia64.S
deleted file mode 100644
index 951abc53ea..0000000000
--- a/src/lib/libcrypto/bn/asm/ia64.S
+++ /dev/null
@@ -1,1555 +0,0 @@
-.explicit
-.text
-.ident  "ia64.S, Version 2.1"
-.ident  "IA-64 ISA artwork by Andy Polyakov <appro@fy.chalmers.se>"
-//
-// ====================================================================
-// Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-// project.
-//
-// Rights for redistribution and usage in source and binary forms are
-// granted according to the OpenSSL license. Warranty of any kind is
-// disclaimed.
-// ====================================================================
-//
-// Version 2.x is Itanium2 re-tune. Few words about how Itanum2 is
-// different from Itanium to this module viewpoint. Most notably, is it
-// "wider" than Itanium? Can you experience loop scalability as
-// discussed in commentary sections? Not really:-( Itanium2 has 6
-// integer ALU ports, i.e. it's 2 ports wider, but it's not enough to
-// spin twice as fast, as I need 8 IALU ports. Amount of floating point
-// ports is the same, i.e. 2, while I need 4. In other words, to this
-// module Itanium2 remains effectively as "wide" as Itanium. Yet it's
-// essentially different in respect to this module, and a re-tune was
-// required. Well, because some intruction latencies has changed. Most
-// noticeably those intensively used:
-//
-//                      Itanium Itanium2
-//      ldf8            9       6               L2 hit
-//      ld8             2       1               L1 hit
-//      getf            2       5
-//      xma[->getf]     7[+1]   4[+0]
-//      add[->st8]      1[+1]   1[+0]
-//
-// What does it mean? You might ratiocinate that the original code
-// should run just faster... Because sum of latencies is smaller...
-// Wrong! Note that getf latency increased. This means that if a loop is
-// scheduled for lower latency (as they were), then it will suffer from
-// stall condition and the code will therefore turn anti-scalable, e.g.
-// original bn_mul_words spun at 5*n or 2.5 times slower than expected
-// on Itanium2! What to do? Reschedule loops for Itanium2? But then
-// Itanium would exhibit anti-scalability. So I've chosen to reschedule
-// for worst latency for every instruction aiming for best *all-round*
-// performance.  
-// Q.   How much faster does it get?
-// A.   Here is the output from 'openssl speed rsa dsa' for vanilla
-//      0.9.6a compiled with gcc version 2.96 20000731 (Red Hat
-//      Linux 7.1 2.96-81):
-//
-//                        sign    verify    sign/s verify/s
-//      rsa  512 bits   0.0036s   0.0003s    275.3   2999.2
-//      rsa 1024 bits   0.0203s   0.0011s     49.3    894.1
-//      rsa 2048 bits   0.1331s   0.0040s      7.5    250.9
-//      rsa 4096 bits   0.9270s   0.0147s      1.1     68.1
-//                        sign    verify    sign/s verify/s
-//      dsa  512 bits   0.0035s   0.0043s    288.3    234.8
-//      dsa 1024 bits   0.0111s   0.0135s     90.0     74.2
-//
-//      And here is similar output but for this assembler
-//      implementation:-)
-//
-//                        sign    verify    sign/s verify/s
-//      rsa  512 bits   0.0021s   0.0001s    549.4   9638.5
-//      rsa 1024 bits   0.0055s   0.0002s    183.8   4481.1
-//      rsa 2048 bits   0.0244s   0.0006s     41.4   1726.3
-//      rsa 4096 bits   0.1295s   0.0018s      7.7    561.5
-//                        sign    verify    sign/s verify/s
-//      dsa  512 bits   0.0012s   0.0013s    891.9    756.6
-//      dsa 1024 bits   0.0023s   0.0028s    440.4    376.2
-//      
-//      Yes, you may argue that it's not fair comparison as it's
-//      possible to craft the C implementation with BN_UMULT_HIGH
-//      inline assembler macro. But of course! Here is the output
-//      with the macro:
-//
-//                        sign    verify    sign/s verify/s
-//      rsa  512 bits   0.0020s   0.0002s    495.0   6561.0
-//      rsa 1024 bits   0.0086s   0.0004s    116.2   2235.7
-//      rsa 2048 bits   0.0519s   0.0015s     19.3    667.3
-//      rsa 4096 bits   0.3464s   0.0053s      2.9    187.7
-//                        sign    verify    sign/s verify/s
-//      dsa  512 bits   0.0016s   0.0020s    613.1    510.5
-//      dsa 1024 bits   0.0045s   0.0054s    221.0    183.9
-//
-//      My code is still way faster, huh:-) And I believe that even
-//      higher performance can be achieved. Note that as keys get
-//      longer, performance gain is larger. Why? According to the
-//      profiler there is another player in the field, namely
-//      BN_from_montgomery consuming larger and larger portion of CPU
-//      time as keysize decreases. I therefore consider putting effort
-//      to assembler implementation of the following routine:
-//
-//      void bn_mul_add_mont (BN_ULONG *rp,BN_ULONG *np,int nl,BN_ULONG n0)
-//      {
-//      int      i,j;
-//      BN_ULONG v;
-//
-//      for (i=0; i<nl; i++)
-//              {
-//              v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);
-//              nrp++;
-//              rp++;
-//              if (((nrp[-1]+=v)&BN_MASK2) < v)
-//                      for (j=0; ((++nrp[j])&BN_MASK2) == 0; j++) ;
-//              }
-//      }
-//
-//      It might as well be beneficial to implement even combaX
-//      variants, as it appears as it can literally unleash the
-//      performance (see comment section to bn_mul_comba8 below).
-//
-//      And finally for your reference the output for 0.9.6a compiled
-//      with SGIcc version 0.01.0-12 (keep in mind that for the moment
-//      of this writing it's not possible to convince SGIcc to use
-//      BN_UMULT_HIGH inline assembler macro, yet the code is fast,
-//      i.e. for a compiler generated one:-):
-//
-//                        sign    verify    sign/s verify/s
-//      rsa  512 bits   0.0022s   0.0002s    452.7   5894.3
-//      rsa 1024 bits   0.0097s   0.0005s    102.7   2002.9
-//      rsa 2048 bits   0.0578s   0.0017s     17.3    600.2
-//      rsa 4096 bits   0.3838s   0.0061s      2.6    164.5
-//                        sign    verify    sign/s verify/s
-//      dsa  512 bits   0.0018s   0.0022s    547.3    459.6
-//      dsa 1024 bits   0.0051s   0.0062s    196.6    161.3
-//
-//      Oh! Benchmarks were performed on 733MHz Lion-class Itanium
-//      system running Redhat Linux 7.1 (very special thanks to Ray
-//      McCaffity of Williams Communications for providing an account).
-//
-// Q.   What's the heck with 'rum 1<<5' at the end of every function?
-// A.   Well, by clearing the "upper FP registers written" bit of the
-//      User Mask I want to excuse the kernel from preserving upper
-//      (f32-f128) FP register bank over process context switch, thus
-//      minimizing bus bandwidth consumption during the switch (i.e.
-//      after PKI opration completes and the program is off doing
-//      something else like bulk symmetric encryption). Having said
-//      this, I also want to point out that it might be good idea
-//      to compile the whole toolkit (as well as majority of the
-//      programs for that matter) with -mfixed-range=f32-f127 command
-//      line option. No, it doesn't prevent the compiler from writing
-//      to upper bank, but at least discourages to do so. If you don't
-//      like the idea you have the option to compile the module with
-//      -Drum=nop.m in command line.
-//
-#if defined(_HPUX_SOURCE) && !defined(_LP64)
-#define ADDP    addp4
-#else
-#define ADDP    add
-#endif
-#if 1
-//
-// bn_[add|sub]_words routines.
-//
-// Loops are spinning in 2*(n+5) ticks on Itanuim (provided that the
-// data reside in L1 cache, i.e. 2 ticks away). It's possible to
-// compress the epilogue and get down to 2*n+6, but at the cost of
-// scalability (the neat feature of this implementation is that it
-// shall automagically spin in n+5 on "wider" IA-64 implementations:-)
-// I consider that the epilogue is short enough as it is to trade tiny
-// performance loss on Itanium for scalability.
-//
-// BN_ULONG bn_add_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num)
-//
-.global bn_add_words#
-.proc   bn_add_words#
-.align  64
-.skip   32      // makes the loop body aligned at 64-byte boundary
-bn_add_words:
-        .prologue
-        .save   ar.pfs,r2
-{ .mii; alloc           r2=ar.pfs,4,12,0,16
-        cmp4.le         p6,p0=r35,r0    };;
-{ .mfb; mov             r8=r0                   // return value
-(p6)    br.ret.spnt.many        b0      };;
-{ .mib; sub             r10=r35,r0,1
-        .save   ar.lc,r3
-        mov             r3=ar.lc
-        brp.loop.imp    .L_bn_add_words_ctop,.L_bn_add_words_cend-16
-                                        }
-{ .mib; ADDP            r14=0,r32               // rp
-        .save   pr,r9
-        mov             r9=pr           };;
-        .body
-{ .mii; ADDP            r15=0,r33               // ap
-        mov             ar.lc=r10
-        mov             ar.ec=6         }
-{ .mib; ADDP            r16=0,r34               // bp
-        mov             pr.rot=1<<16    };;
-.L_bn_add_words_ctop:
-{ .mii; (p16)   ld8             r32=[r16],8       // b=*(bp++)
-        (p18)   add             r39=r37,r34
-        (p19)   cmp.ltu.unc     p56,p0=r40,r38  }
-{ .mfb; (p0)    nop.m           0x0
-        (p0)    nop.f           0x0
-        (p0)    nop.b           0x0             }
-{ .mii; (p16)   ld8             r35=[r15],8       // a=*(ap++)
-        (p58)   cmp.eq.or       p57,p0=-1,r41     // (p20)
-        (p58)   add             r41=1,r41       } // (p20)
-{ .mfb; (p21)   st8             [r14]=r42,8       // *(rp++)=r
-        (p0)    nop.f           0x0
-        br.ctop.sptk    .L_bn_add_words_ctop    };;
-.L_bn_add_words_cend:
-{ .mii;
-(p59)   add             r8=1,r8         // return value
-        mov             pr=r9,0x1ffff
-        mov             ar.lc=r3        }
-{ .mbb; nop.b           0x0
-        br.ret.sptk.many        b0      };;
-.endp   bn_add_words#
-//
-// BN_ULONG bn_sub_words(BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int num)
-//
-.global bn_sub_words#
-.proc   bn_sub_words#
-.align  64
-.skip   32      // makes the loop body aligned at 64-byte boundary
-bn_sub_words:
-        .prologue
-        .save   ar.pfs,r2
-{ .mii; alloc           r2=ar.pfs,4,12,0,16
-        cmp4.le         p6,p0=r35,r0    };;
-{ .mfb; mov             r8=r0                   // return value
-(p6)    br.ret.spnt.many        b0      };;
-{ .mib; sub             r10=r35,r0,1
-        .save   ar.lc,r3
-        mov             r3=ar.lc
-        brp.loop.imp    .L_bn_sub_words_ctop,.L_bn_sub_words_cend-16
-                                        }
-{ .mib; ADDP            r14=0,r32               // rp
-        .save   pr,r9
-        mov             r9=pr           };;
-        .body
-{ .mii; ADDP            r15=0,r33               // ap
-        mov             ar.lc=r10
-        mov             ar.ec=6         }
-{ .mib; ADDP            r16=0,r34               // bp
-        mov             pr.rot=1<<16    };;
-.L_bn_sub_words_ctop:
-{ .mii; (p16)   ld8             r32=[r16],8       // b=*(bp++)
-        (p18)   sub             r39=r37,r34
-        (p19)   cmp.gtu.unc     p56,p0=r40,r38  }
-{ .mfb; (p0)    nop.m           0x0
-        (p0)    nop.f           0x0
-        (p0)    nop.b           0x0             }
-{ .mii; (p16)   ld8             r35=[r15],8       // a=*(ap++)
-        (p58)   cmp.eq.or       p57,p0=0,r41      // (p20)
-        (p58)   add             r41=-1,r41      } // (p20)
-{ .mbb; (p21)   st8             [r14]=r42,8       // *(rp++)=r
-        (p0)    nop.b           0x0
-        br.ctop.sptk    .L_bn_sub_words_ctop    };;
-.L_bn_sub_words_cend:
-{ .mii;
-(p59)   add             r8=1,r8         // return value
-        mov             pr=r9,0x1ffff
-        mov             ar.lc=r3        }
-{ .mbb; nop.b           0x0
-        br.ret.sptk.many        b0      };;
-.endp   bn_sub_words#
-#endif
-#if 0
-#define XMA_TEMPTATION
-#endif
-#if 1
-//
-// BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-//
-.global bn_mul_words#
-.proc   bn_mul_words#
-.align  64
-.skip   32      // makes the loop body aligned at 64-byte boundary
-bn_mul_words:
-        .prologue
-        .save   ar.pfs,r2
-#ifdef XMA_TEMPTATION
-{ .mfi; alloc           r2=ar.pfs,4,0,0,0       };;
-#else
-{ .mfi; alloc           r2=ar.pfs,4,12,0,16     };;
-#endif
-{ .mib; mov             r8=r0                   // return value
-        cmp4.le         p6,p0=r34,r0
-(p6)    br.ret.spnt.many        b0              };;
-{ .mii; sub     r10=r34,r0,1
-        .save   ar.lc,r3
-        mov     r3=ar.lc
-        .save   pr,r9
-        mov     r9=pr                   };;
-        .body
-{ .mib; setf.sig        f8=r35  // w
-        mov             pr.rot=0x800001<<16
-                        // ------^----- serves as (p50) at first (p27)
-        brp.loop.imp    .L_bn_mul_words_ctop,.L_bn_mul_words_cend-16
-                                        }
-#ifndef XMA_TEMPTATION
-{ .mmi; ADDP            r14=0,r32       // rp
-        ADDP            r15=0,r33       // ap
-        mov             ar.lc=r10       }
-{ .mmi; mov             r40=0           // serves as r35 at first (p27)
-        mov             ar.ec=13        };;
-// This loop spins in 2*(n+12) ticks. It's scheduled for data in Itanium
-// L2 cache (i.e. 9 ticks away) as floating point load/store instructions
-// bypass L1 cache and L2 latency is actually best-case scenario for
-// ldf8. The loop is not scalable and shall run in 2*(n+12) even on
-// "wider" IA-64 implementations. It's a trade-off here. n+24 loop
-// would give us ~5% in *overall* performance improvement on "wider"
-// IA-64, but would hurt Itanium for about same because of longer
-// epilogue. As it's a matter of few percents in either case I've
-// chosen to trade the scalability for development time (you can see
-// this very instruction sequence in bn_mul_add_words loop which in
-// turn is scalable).
-.L_bn_mul_words_ctop:
-{ .mfi; (p25)   getf.sig        r36=f52                 // low
-        (p21)   xmpy.lu         f48=f37,f8
-        (p28)   cmp.ltu         p54,p50=r41,r39 }
-{ .mfi; (p16)   ldf8            f32=[r15],8
-        (p21)   xmpy.hu         f40=f37,f8
-        (p0)    nop.i           0x0             };;
-{ .mii; (p25)   getf.sig        r32=f44                 // high
-        .pred.rel       "mutex",p50,p54
-        (p50)   add             r40=r38,r35             // (p27)
-        (p54)   add             r40=r38,r35,1   }       // (p27)
-{ .mfb; (p28)   st8             [r14]=r41,8
-        (p0)    nop.f           0x0
-        br.ctop.sptk    .L_bn_mul_words_ctop    };;
-.L_bn_mul_words_cend:
-{ .mii; nop.m           0x0
-.pred.rel       "mutex",p51,p55
-(p51)   add             r8=r36,r0
-(p55)   add             r8=r36,r0,1     }
-{ .mfb; nop.m   0x0
-        nop.f   0x0
-        nop.b   0x0                     }
-#else   // XMA_TEMPTATION
-        setf.sig        f37=r0  // serves as carry at (p18) tick
-        mov             ar.lc=r10
-        mov             ar.ec=5;;
-// Most of you examining this code very likely wonder why in the name
-// of Intel the following loop is commented out? Indeed, it looks so
-// neat that you find it hard to believe that it's something wrong
-// with it, right? The catch is that every iteration depends on the
-// result from previous one and the latter isn't available instantly.
-// The loop therefore spins at the latency of xma minus 1, or in other
-// words at 6*(n+4) ticks:-( Compare to the "production" loop above
-// that runs in 2*(n+11) where the low latency problem is worked around
-// by moving the dependency to one-tick latent interger ALU. Note that
-// "distance" between ldf8 and xma is not latency of ldf8, but the
-// *difference* between xma and ldf8 latencies.
-.L_bn_mul_words_ctop:
-{ .mfi; (p16)   ldf8            f32=[r33],8
-        (p18)   xma.hu          f38=f34,f8,f39  }
-{ .mfb; (p20)   stf8            [r32]=f37,8
-        (p18)   xma.lu          f35=f34,f8,f39
-        br.ctop.sptk    .L_bn_mul_words_ctop    };;
-.L_bn_mul_words_cend:
-        getf.sig        r8=f41          // the return value
-#endif  // XMA_TEMPTATION
-{ .mii; nop.m           0x0
-        mov             pr=r9,0x1ffff
-        mov             ar.lc=r3        }
-{ .mfb; rum             1<<5            // clear um.mfh
-        nop.f           0x0
-        br.ret.sptk.many        b0      };;
-.endp   bn_mul_words#
-#endif
-#if 1
-//
-// BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-//
-.global bn_mul_add_words#
-.proc   bn_mul_add_words#
-.align  64
-.skip   48      // makes the loop body aligned at 64-byte boundary
-bn_mul_add_words:
-        .prologue
-        .save   ar.pfs,r2
-{ .mmi; alloc           r2=ar.pfs,4,4,0,8
-        cmp4.le         p6,p0=r34,r0
-        .save   ar.lc,r3
-        mov             r3=ar.lc        };;
-{ .mib; mov             r8=r0           // return value
-        sub             r10=r34,r0,1
-(p6)    br.ret.spnt.many        b0      };;
-{ .mib; setf.sig        f8=r35          // w
-        .save   pr,r9
-        mov             r9=pr
-        brp.loop.imp    .L_bn_mul_add_words_ctop,.L_bn_mul_add_words_cend-16
-                                        }
-        .body
-{ .mmi; ADDP            r14=0,r32       // rp
-        ADDP            r15=0,r33       // ap
-        mov             ar.lc=r10       }
-{ .mii; ADDP            r16=0,r32       // rp copy
-        mov             pr.rot=0x2001<<16
-                        // ------^----- serves as (p40) at first (p27)
-        mov             ar.ec=11        };;
-// This loop spins in 3*(n+10) ticks on Itanium and in 2*(n+10) on
-// Itanium 2. Yes, unlike previous versions it scales:-) Previous
-// version was peforming *all* additions in IALU and was starving
-// for those even on Itanium 2. In this version one addition is
-// moved to FPU and is folded with multiplication. This is at cost
-// of propogating the result from previous call to this subroutine
-// to L2 cache... In other words negligible even for shorter keys.
-// *Overall* performance improvement [over previous version] varies
-// from 11 to 22 percent depending on key length.
-.L_bn_mul_add_words_ctop:
-.pred.rel       "mutex",p40,p42
-{ .mfi; (p23)   getf.sig        r36=f45                 // low
-        (p20)   xma.lu          f42=f36,f8,f50          // low
-        (p40)   add             r39=r39,r35     }       // (p27)
-{ .mfi; (p16)   ldf8            f32=[r15],8             // *(ap++)
-        (p20)   xma.hu          f36=f36,f8,f50          // high
-        (p42)   add             r39=r39,r35,1   };;     // (p27)
-{ .mmi; (p24)   getf.sig        r32=f40                 // high
-        (p16)   ldf8            f46=[r16],8             // *(rp1++)
-        (p40)   cmp.ltu         p41,p39=r39,r35 }       // (p27)
-{ .mib; (p26)   st8             [r14]=r39,8             // *(rp2++)
-        (p42)   cmp.leu         p41,p39=r39,r35         // (p27)
-        br.ctop.sptk    .L_bn_mul_add_words_ctop};;
-.L_bn_mul_add_words_cend:
-{ .mmi; .pred.rel       "mutex",p40,p42
-(p40)   add             r8=r35,r0
-(p42)   add             r8=r35,r0,1
-        mov             pr=r9,0x1ffff   }
-{ .mib; rum             1<<5            // clear um.mfh
-        mov             ar.lc=r3
-        br.ret.sptk.many        b0      };;
-.endp   bn_mul_add_words#
-#endif
-#if 1
-//
-// void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num)
-//
-.global bn_sqr_words#
-.proc   bn_sqr_words#
-.align  64
-.skip   32      // makes the loop body aligned at 64-byte boundary 
-bn_sqr_words:
-        .prologue
-        .save   ar.pfs,r2
-{ .mii; alloc           r2=ar.pfs,3,0,0,0
-        sxt4            r34=r34         };;
-{ .mii; cmp.le          p6,p0=r34,r0
-        mov             r8=r0           }       // return value
-{ .mfb; ADDP            r32=0,r32
-        nop.f           0x0
-(p6)    br.ret.spnt.many        b0      };;
-{ .mii; sub     r10=r34,r0,1
-        .save   ar.lc,r3
-        mov     r3=ar.lc
-        .save   pr,r9
-        mov     r9=pr                   };;
-        .body
-{ .mib; ADDP            r33=0,r33
-        mov             pr.rot=1<<16
-        brp.loop.imp    .L_bn_sqr_words_ctop,.L_bn_sqr_words_cend-16
-                                        }
-{ .mii; add             r34=8,r32
-        mov             ar.lc=r10
-        mov             ar.ec=18        };;
-// 2*(n+17) on Itanium, (n+17) on "wider" IA-64 implementations. It's
-// possible to compress the epilogue (I'm getting tired to write this
-// comment over and over) and get down to 2*n+16 at the cost of
-// scalability. The decision will very likely be reconsidered after the
-// benchmark program is profiled. I.e. if perfomance gain on Itanium
-// will appear larger than loss on "wider" IA-64, then the loop should
-// be explicitely split and the epilogue compressed.
-.L_bn_sqr_words_ctop:
-{ .mfi; (p16)   ldf8            f32=[r33],8
-        (p25)   xmpy.lu         f42=f41,f41
-        (p0)    nop.i           0x0             }
-{ .mib; (p33)   stf8            [r32]=f50,16
-        (p0)    nop.i           0x0
-        (p0)    nop.b           0x0             }
-{ .mfi; (p0)    nop.m           0x0
-        (p25)   xmpy.hu         f52=f41,f41
-        (p0)    nop.i           0x0             }
-{ .mib; (p33)   stf8            [r34]=f60,16
-        (p0)    nop.i           0x0
-        br.ctop.sptk    .L_bn_sqr_words_ctop    };;
-.L_bn_sqr_words_cend:
-{ .mii; nop.m           0x0
-        mov             pr=r9,0x1ffff
-        mov             ar.lc=r3        }
-{ .mfb; rum             1<<5            // clear um.mfh
-        nop.f           0x0
-        br.ret.sptk.many        b0      };;
-.endp   bn_sqr_words#
-#endif
-#if 1
-// Apparently we win nothing by implementing special bn_sqr_comba8.
-// Yes, it is possible to reduce the number of multiplications by
-// almost factor of two, but then the amount of additions would
-// increase by factor of two (as we would have to perform those
-// otherwise performed by xma ourselves). Normally we would trade
-// anyway as multiplications are way more expensive, but not this
-// time... Multiplication kernel is fully pipelined and as we drain
-// one 128-bit multiplication result per clock cycle multiplications
-// are effectively as inexpensive as additions. Special implementation
-// might become of interest for "wider" IA-64 implementation as you'll
-// be able to get through the multiplication phase faster (there won't
-// be any stall issues as discussed in the commentary section below and
-// you therefore will be able to employ all 4 FP units)... But these
-// Itanium days it's simply too hard to justify the effort so I just
-// drop down to bn_mul_comba8 code:-)
-//
-// void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
-//
-.global bn_sqr_comba8#
-.proc   bn_sqr_comba8#
-.align  64
-bn_sqr_comba8:
-        .prologue
-        .save   ar.pfs,r2
-#if defined(_HPUX_SOURCE) && !defined(_LP64)
-{ .mii; alloc   r2=ar.pfs,2,1,0,0
-        addp4   r33=0,r33
-        addp4   r32=0,r32               };;
-{ .mii;
-#else
-{ .mii; alloc   r2=ar.pfs,2,1,0,0
-#endif
-        mov     r34=r33
-        add     r14=8,r33               };;
-        .body
-{ .mii; add     r17=8,r34
-        add     r15=16,r33
-        add     r18=16,r34              }
-{ .mfb; add     r16=24,r33
-        br      .L_cheat_entry_point8   };;
-.endp   bn_sqr_comba8#
-#endif
-#if 1
-// I've estimated this routine to run in ~120 ticks, but in reality
-// (i.e. according to ar.itc) it takes ~160 ticks. Are those extra
-// cycles consumed for instructions fetch? Or did I misinterpret some
-// clause in Itanium �-architecture manual? Comments are welcomed and
-// highly appreciated.
-//
-// On Itanium 2 it takes ~190 ticks. This is because of stalls on
-// result from getf.sig. I do nothing about it at this point for
-// reasons depicted below.
-//
-// However! It should be noted that even 160 ticks is darn good result
-// as it's over 10 (yes, ten, spelled as t-e-n) times faster than the
-// C version (compiled with gcc with inline assembler). I really
-// kicked compiler's butt here, didn't I? Yeah! This brings us to the
-// following statement. It's damn shame that this routine isn't called
-// very often nowadays! According to the profiler most CPU time is
-// consumed by bn_mul_add_words called from BN_from_montgomery. In
-// order to estimate what we're missing, I've compared the performance
-// of this routine against "traditional" implementation, i.e. against
-// following routine:
-//
-// void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-// {    r[ 8]=bn_mul_words(    &(r[0]),a,8,b[0]);
-//      r[ 9]=bn_mul_add_words(&(r[1]),a,8,b[1]);
-//      r[10]=bn_mul_add_words(&(r[2]),a,8,b[2]);
-//      r[11]=bn_mul_add_words(&(r[3]),a,8,b[3]);
-//      r[12]=bn_mul_add_words(&(r[4]),a,8,b[4]);
-//      r[13]=bn_mul_add_words(&(r[5]),a,8,b[5]);
-//      r[14]=bn_mul_add_words(&(r[6]),a,8,b[6]);
-//      r[15]=bn_mul_add_words(&(r[7]),a,8,b[7]);
-// }
-//
-// The one below is over 8 times faster than the one above:-( Even
-// more reasons to "combafy" bn_mul_add_mont...
-//
-// And yes, this routine really made me wish there were an optimizing
-// assembler! It also feels like it deserves a dedication.
-//
-//      To my wife for being there and to my kids...
-//
-// void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-//
-#define carry1  r14
-#define carry2  r15
-#define carry3  r34
-.global bn_mul_comba8#
-.proc   bn_mul_comba8#
-.align  64
-bn_mul_comba8:
-        .prologue
-        .save   ar.pfs,r2
-#if defined(_HPUX_SOURCE) && !defined(_LP64)
-{ .mii; alloc   r2=ar.pfs,3,0,0,0
-        addp4   r33=0,r33
-        addp4   r34=0,r34               };;
-{ .mii; addp4   r32=0,r32
-#else
-{ .mii; alloc   r2=ar.pfs,3,0,0,0
-#endif
-        add     r14=8,r33
-        add     r17=8,r34               }
-        .body
-{ .mii; add     r15=16,r33
-        add     r18=16,r34
-        add     r16=24,r33              }
-.L_cheat_entry_point8:
-{ .mmi; add     r19=24,r34
-        ldf8    f32=[r33],32            };;
-{ .mmi; ldf8    f120=[r34],32
-        ldf8    f121=[r17],32           }
-{ .mmi; ldf8    f122=[r18],32
-        ldf8    f123=[r19],32           };;
-{ .mmi; ldf8    f124=[r34]
-        ldf8    f125=[r17]              }
-{ .mmi; ldf8    f126=[r18]
-        ldf8    f127=[r19]              }
-{ .mmi; ldf8    f33=[r14],32
-        ldf8    f34=[r15],32            }
-{ .mmi; ldf8    f35=[r16],32;;
-        ldf8    f36=[r33]               }
-{ .mmi; ldf8    f37=[r14]
-        ldf8    f38=[r15]               }
-{ .mfi; ldf8    f39=[r16]
-// -------\ Entering multiplier's heaven /-------
-// ------------\                    /------------
-// -----------------\          /-----------------
-// ----------------------\/----------------------
-                xma.hu  f41=f32,f120,f0         }
-{ .mfi;         xma.lu  f40=f32,f120,f0         };; // (*)
-{ .mfi;         xma.hu  f51=f32,f121,f0         }
-{ .mfi;         xma.lu  f50=f32,f121,f0         };;
-{ .mfi;         xma.hu  f61=f32,f122,f0         }
-{ .mfi;         xma.lu  f60=f32,f122,f0         };;
-{ .mfi;         xma.hu  f71=f32,f123,f0         }
-{ .mfi;         xma.lu  f70=f32,f123,f0         };;
-{ .mfi;         xma.hu  f81=f32,f124,f0         }
-{ .mfi;         xma.lu  f80=f32,f124,f0         };;
-{ .mfi;         xma.hu  f91=f32,f125,f0         }
-{ .mfi;         xma.lu  f90=f32,f125,f0         };;
-{ .mfi;         xma.hu  f101=f32,f126,f0        }
-{ .mfi;         xma.lu  f100=f32,f126,f0        };;
-{ .mfi;         xma.hu  f111=f32,f127,f0        }
-{ .mfi;         xma.lu  f110=f32,f127,f0        };;//
-// (*)  You can argue that splitting at every second bundle would
-//      prevent "wider" IA-64 implementations from achieving the peak
-//      performance. Well, not really... The catch is that if you
-//      intend to keep 4 FP units busy by splitting at every fourth
-//      bundle and thus perform these 16 multiplications in 4 ticks,
-//      the first bundle *below* would stall because the result from
-//      the first xma bundle *above* won't be available for another 3
-//      ticks (if not more, being an optimist, I assume that "wider"
-//      implementation will have same latency:-). This stall will hold
-//      you back and the performance would be as if every second bundle
-//      were split *anyway*...
-{ .mfi; getf.sig        r16=f40
-                xma.hu  f42=f33,f120,f41
-        add             r33=8,r32               }
-{ .mfi;         xma.lu  f41=f33,f120,f41        };;
-{ .mfi; getf.sig        r24=f50
-                xma.hu  f52=f33,f121,f51        }
-{ .mfi;         xma.lu  f51=f33,f121,f51        };;
-{ .mfi; st8             [r32]=r16,16
-                xma.hu  f62=f33,f122,f61        }
-{ .mfi;         xma.lu  f61=f33,f122,f61        };;
-{ .mfi;         xma.hu  f72=f33,f123,f71        }
-{ .mfi;         xma.lu  f71=f33,f123,f71        };;
-{ .mfi;         xma.hu  f82=f33,f124,f81        }
-{ .mfi;         xma.lu  f81=f33,f124,f81        };;
-{ .mfi;         xma.hu  f92=f33,f125,f91        }
-{ .mfi;         xma.lu  f91=f33,f125,f91        };;
-{ .mfi;         xma.hu  f102=f33,f126,f101      }
-{ .mfi;         xma.lu  f101=f33,f126,f101      };;
-{ .mfi;         xma.hu  f112=f33,f127,f111      }
-{ .mfi;         xma.lu  f111=f33,f127,f111      };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r25=f41
-                xma.hu  f43=f34,f120,f42        }
-{ .mfi;         xma.lu  f42=f34,f120,f42        };;
-{ .mfi; getf.sig        r16=f60
-                xma.hu  f53=f34,f121,f52        }
-{ .mfi;         xma.lu  f52=f34,f121,f52        };;
-{ .mfi; getf.sig        r17=f51
-                xma.hu  f63=f34,f122,f62
-        add             r25=r25,r24             }
-{ .mfi;         xma.lu  f62=f34,f122,f62
-        mov             carry1=0                };;
-{ .mfi; cmp.ltu         p6,p0=r25,r24
-                xma.hu  f73=f34,f123,f72        }
-{ .mfi;         xma.lu  f72=f34,f123,f72        };;
-{ .mfi; st8             [r33]=r25,16
-                xma.hu  f83=f34,f124,f82
-(p6)    add             carry1=1,carry1         }
-{ .mfi;         xma.lu  f82=f34,f124,f82        };;
-{ .mfi;         xma.hu  f93=f34,f125,f92        }
-{ .mfi;         xma.lu  f92=f34,f125,f92        };;
-{ .mfi;         xma.hu  f103=f34,f126,f102      }
-{ .mfi;         xma.lu  f102=f34,f126,f102      };;
-{ .mfi;         xma.hu  f113=f34,f127,f112      }
-{ .mfi;         xma.lu  f112=f34,f127,f112      };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r18=f42
-                xma.hu  f44=f35,f120,f43
-        add             r17=r17,r16             }
-{ .mfi;         xma.lu  f43=f35,f120,f43        };;
-{ .mfi; getf.sig        r24=f70
-                xma.hu  f54=f35,f121,f53        }
-{ .mfi; mov             carry2=0
-                xma.lu  f53=f35,f121,f53        };;
-{ .mfi; getf.sig        r25=f61
-                xma.hu  f64=f35,f122,f63
-        cmp.ltu         p7,p0=r17,r16           }
-{ .mfi; add             r18=r18,r17
-                xma.lu  f63=f35,f122,f63        };;
-{ .mfi; getf.sig        r26=f52
-                xma.hu  f74=f35,f123,f73
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r18,r17
-                xma.lu  f73=f35,f123,f73
-        add             r18=r18,carry1          };;
-{ .mfi;
-                xma.hu  f84=f35,f124,f83
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r18,carry1
-                xma.lu  f83=f35,f124,f83        };;
-{ .mfi; st8             [r32]=r18,16
-                xma.hu  f94=f35,f125,f93
-(p7)    add             carry2=1,carry2         }
-{ .mfi;         xma.lu  f93=f35,f125,f93        };;
-{ .mfi;         xma.hu  f104=f35,f126,f103      }
-{ .mfi;         xma.lu  f103=f35,f126,f103      };;
-{ .mfi;         xma.hu  f114=f35,f127,f113      }
-{ .mfi; mov             carry1=0
-                xma.lu  f113=f35,f127,f113
-        add             r25=r25,r24             };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r27=f43
-                xma.hu  f45=f36,f120,f44
-        cmp.ltu         p6,p0=r25,r24           }
-{ .mfi;         xma.lu  f44=f36,f120,f44        
-        add             r26=r26,r25             };;
-{ .mfi; getf.sig        r16=f80
-                xma.hu  f55=f36,f121,f54
-(p6)    add             carry1=1,carry1         }
-{ .mfi;         xma.lu  f54=f36,f121,f54        };;
-{ .mfi; getf.sig        r17=f71
-                xma.hu  f65=f36,f122,f64
-        cmp.ltu         p6,p0=r26,r25           }
-{ .mfi;         xma.lu  f64=f36,f122,f64
-        add             r27=r27,r26             };;
-{ .mfi; getf.sig        r18=f62
-                xma.hu  f75=f36,f123,f74
-(p6)    add             carry1=1,carry1         }
-{ .mfi; cmp.ltu         p6,p0=r27,r26
-                xma.lu  f74=f36,f123,f74
-        add             r27=r27,carry2          };;
-{ .mfi; getf.sig        r19=f53
-                xma.hu  f85=f36,f124,f84
-(p6)    add             carry1=1,carry1         }
-{ .mfi;         xma.lu  f84=f36,f124,f84
-        cmp.ltu         p6,p0=r27,carry2        };;
-{ .mfi; st8             [r33]=r27,16
-                xma.hu  f95=f36,f125,f94
-(p6)    add             carry1=1,carry1         }
-{ .mfi;         xma.lu  f94=f36,f125,f94        };;
-{ .mfi;         xma.hu  f105=f36,f126,f104      }
-{ .mfi; mov             carry2=0
-                xma.lu  f104=f36,f126,f104
-        add             r17=r17,r16             };;
-{ .mfi;         xma.hu  f115=f36,f127,f114
-        cmp.ltu         p7,p0=r17,r16           }
-{ .mfi;         xma.lu  f114=f36,f127,f114
-        add             r18=r18,r17             };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r20=f44
-                xma.hu  f46=f37,f120,f45
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r18,r17
-                xma.lu  f45=f37,f120,f45
-        add             r19=r19,r18             };;
-{ .mfi; getf.sig        r24=f90
-                xma.hu  f56=f37,f121,f55        }
-{ .mfi;         xma.lu  f55=f37,f121,f55        };;
-{ .mfi; getf.sig        r25=f81
-                xma.hu  f66=f37,f122,f65
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r19,r18
-                xma.lu  f65=f37,f122,f65
-        add             r20=r20,r19             };;
-{ .mfi; getf.sig        r26=f72
-                xma.hu  f76=f37,f123,f75
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r20,r19
-                xma.lu  f75=f37,f123,f75
-        add             r20=r20,carry1          };;
-{ .mfi; getf.sig        r27=f63
-                xma.hu  f86=f37,f124,f85
-(p7)    add             carry2=1,carry2         }
-{ .mfi;         xma.lu  f85=f37,f124,f85
-        cmp.ltu         p7,p0=r20,carry1        };;
-{ .mfi; getf.sig        r28=f54
-                xma.hu  f96=f37,f125,f95
-(p7)    add             carry2=1,carry2         }
-{ .mfi; st8             [r32]=r20,16
-                xma.lu  f95=f37,f125,f95        };;
-{ .mfi;         xma.hu  f106=f37,f126,f105      }
-{ .mfi; mov             carry1=0
-                xma.lu  f105=f37,f126,f105
-        add             r25=r25,r24             };;
-{ .mfi;         xma.hu  f116=f37,f127,f115
-        cmp.ltu         p6,p0=r25,r24           }
-{ .mfi;         xma.lu  f115=f37,f127,f115
-        add             r26=r26,r25             };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r29=f45
-                xma.hu  f47=f38,f120,f46
-(p6)    add             carry1=1,carry1         }
-{ .mfi; cmp.ltu         p6,p0=r26,r25
-                xma.lu  f46=f38,f120,f46
-        add             r27=r27,r26             };;
-{ .mfi; getf.sig        r16=f100
-                xma.hu  f57=f38,f121,f56
-(p6)    add             carry1=1,carry1         }
-{ .mfi; cmp.ltu         p6,p0=r27,r26
-                xma.lu  f56=f38,f121,f56
-        add             r28=r28,r27             };;
-{ .mfi; getf.sig        r17=f91
-                xma.hu  f67=f38,f122,f66
-(p6)    add             carry1=1,carry1         }
-{ .mfi; cmp.ltu         p6,p0=r28,r27
-                xma.lu  f66=f38,f122,f66
-        add             r29=r29,r28             };;
-{ .mfi; getf.sig        r18=f82
-                xma.hu  f77=f38,f123,f76
-(p6)    add             carry1=1,carry1         }
-{ .mfi; cmp.ltu         p6,p0=r29,r28
-                xma.lu  f76=f38,f123,f76
-        add             r29=r29,carry2          };;
-{ .mfi; getf.sig        r19=f73
-                xma.hu  f87=f38,f124,f86
-(p6)    add             carry1=1,carry1         }
-{ .mfi;         xma.lu  f86=f38,f124,f86
-        cmp.ltu         p6,p0=r29,carry2        };;
-{ .mfi; getf.sig        r20=f64
-                xma.hu  f97=f38,f125,f96
-(p6)    add             carry1=1,carry1         }
-{ .mfi; st8             [r33]=r29,16
-                xma.lu  f96=f38,f125,f96        };;
-{ .mfi; getf.sig        r21=f55
-                xma.hu  f107=f38,f126,f106      }
-{ .mfi; mov             carry2=0
-                xma.lu  f106=f38,f126,f106
-        add             r17=r17,r16             };;
-{ .mfi;         xma.hu  f117=f38,f127,f116
-        cmp.ltu         p7,p0=r17,r16           }
-{ .mfi;         xma.lu  f116=f38,f127,f116
-        add             r18=r18,r17             };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r22=f46
-                xma.hu  f48=f39,f120,f47
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r18,r17
-                xma.lu  f47=f39,f120,f47
-        add             r19=r19,r18             };;
-{ .mfi; getf.sig        r24=f110
-                xma.hu  f58=f39,f121,f57
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r19,r18
-                xma.lu  f57=f39,f121,f57
-        add             r20=r20,r19             };;
-{ .mfi; getf.sig        r25=f101
-                xma.hu  f68=f39,f122,f67
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r20,r19
-                xma.lu  f67=f39,f122,f67
-        add             r21=r21,r20             };;
-{ .mfi; getf.sig        r26=f92
-                xma.hu  f78=f39,f123,f77
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r21,r20
-                xma.lu  f77=f39,f123,f77
-        add             r22=r22,r21             };;
-{ .mfi; getf.sig        r27=f83
-                xma.hu  f88=f39,f124,f87
-(p7)    add             carry2=1,carry2         }
-{ .mfi; cmp.ltu         p7,p0=r22,r21
-                xma.lu  f87=f39,f124,f87
-        add             r22=r22,carry1          };;
-{ .mfi; getf.sig        r28=f74
-                xma.hu  f98=f39,f125,f97
-(p7)    add             carry2=1,carry2         }
-{ .mfi;         xma.lu  f97=f39,f125,f97
-        cmp.ltu         p7,p0=r22,carry1        };;
-{ .mfi; getf.sig        r29=f65
-                xma.hu  f108=f39,f126,f107
-(p7)    add             carry2=1,carry2         }
-{ .mfi; st8             [r32]=r22,16
-                xma.lu  f107=f39,f126,f107      };;
-{ .mfi; getf.sig        r30=f56
-                xma.hu  f118=f39,f127,f117      }
-{ .mfi;         xma.lu  f117=f39,f127,f117      };;//
-//-------------------------------------------------//
-// Leaving muliplier's heaven... Quite a ride, huh?
-{ .mii; getf.sig        r31=f47
-        add             r25=r25,r24
-        mov             carry1=0                };;
-{ .mii;         getf.sig        r16=f111
-        cmp.ltu         p6,p0=r25,r24
-        add             r26=r26,r25             };;
-{ .mfb;         getf.sig        r17=f102        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,r25
-        add             r27=r27,r26             };;
-{ .mfb; nop.m   0x0                             }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r27,r26
-        add             r28=r28,r27             };;
-{ .mii;         getf.sig        r18=f93
-                add             r17=r17,r16
-                mov             carry3=0        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r28,r27
-        add             r29=r29,r28             };;
-{ .mii;         getf.sig        r19=f84
-                cmp.ltu         p7,p0=r17,r16   }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r29,r28
-        add             r30=r30,r29             };;
-{ .mii;         getf.sig        r20=f75
-                add             r18=r18,r17     }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r30,r29
-        add             r31=r31,r30             };;
-{ .mfb;         getf.sig        r21=f66         }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r18,r17
-                add             r19=r19,r18     }
-{ .mfb; nop.m   0x0                             }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r31,r30
-        add             r31=r31,carry2          };;
-{ .mfb;         getf.sig        r22=f57         }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r19,r18
-                add             r20=r20,r19     }
-{ .mfb; nop.m   0x0                             }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r31,carry2        };;
-{ .mfb;         getf.sig        r23=f48         }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r20,r19
-                add             r21=r21,r20     }
-{ .mii;
-(p6)    add             carry1=1,carry1         }
-{ .mfb; st8             [r33]=r31,16            };;
-{ .mfb; getf.sig        r24=f112                }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r21,r20
-                add             r22=r22,r21     };;
-{ .mfb; getf.sig        r25=f103                }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r22,r21
-                add             r23=r23,r22     };;
-{ .mfb; getf.sig        r26=f94                 }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r23,r22
-                add             r23=r23,carry1  };;
-{ .mfb; getf.sig        r27=f85                 }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p8=r23,carry1};;
-{ .mii; getf.sig        r28=f76
-        add             r25=r25,r24
-        mov             carry1=0                }
-{ .mii;         st8             [r32]=r23,16
-        (p7)    add             carry2=1,carry3
-        (p8)    add             carry2=0,carry3 };;
-{ .mfb; nop.m   0x0                             }
-{ .mii; getf.sig        r29=f67
-        cmp.ltu         p6,p0=r25,r24
-        add             r26=r26,r25             };;
-{ .mfb; getf.sig        r30=f58                 }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,r25
-        add             r27=r27,r26             };;
-{ .mfb;         getf.sig        r16=f113        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r27,r26
-        add             r28=r28,r27             };;
-{ .mfb;         getf.sig        r17=f104        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r28,r27
-        add             r29=r29,r28             };;
-{ .mfb;         getf.sig        r18=f95         }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r29,r28
-        add             r30=r30,r29             };;
-{ .mii;         getf.sig        r19=f86
-                add             r17=r17,r16
-                mov             carry3=0        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r30,r29
-        add             r30=r30,carry2          };;
-{ .mii;         getf.sig        r20=f77
-                cmp.ltu         p7,p0=r17,r16
-                add             r18=r18,r17     }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r30,carry2        };;
-{ .mfb;         getf.sig        r21=f68         }
-{ .mii; st8             [r33]=r30,16
-(p6)    add             carry1=1,carry1         };;
-{ .mfb; getf.sig        r24=f114                }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r18,r17
-                add             r19=r19,r18     };;
-{ .mfb; getf.sig        r25=f105                }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r19,r18
-                add             r20=r20,r19     };;
-{ .mfb; getf.sig        r26=f96                 }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r20,r19
-                add             r21=r21,r20     };;
-{ .mfb; getf.sig        r27=f87                 }
-{ .mii; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p0=r21,r20
-                add             r21=r21,carry1  };;
-{ .mib; getf.sig        r28=f78                 
-        add             r25=r25,r24             }
-{ .mib; (p7)    add             carry3=1,carry3
-                cmp.ltu         p7,p8=r21,carry1};;
-{ .mii;         st8             [r32]=r21,16
-        (p7)    add             carry2=1,carry3
-        (p8)    add             carry2=0,carry3 }
-{ .mii; mov             carry1=0
-        cmp.ltu         p6,p0=r25,r24
-        add             r26=r26,r25             };;
-{ .mfb;         getf.sig        r16=f115        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,r25
-        add             r27=r27,r26             };;
-{ .mfb;         getf.sig        r17=f106        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r27,r26
-        add             r28=r28,r27             };;
-{ .mfb;         getf.sig        r18=f97         }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r28,r27
-        add             r28=r28,carry2          };;
-{ .mib;         getf.sig        r19=f88
-                add             r17=r17,r16     }
-{ .mib;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r28,carry2        };;
-{ .mii; st8             [r33]=r28,16
-(p6)    add             carry1=1,carry1         }
-{ .mii;         mov             carry2=0
-                cmp.ltu         p7,p0=r17,r16
-                add             r18=r18,r17     };;
-{ .mfb; getf.sig        r24=f116                }
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r18,r17
-                add             r19=r19,r18     };;
-{ .mfb; getf.sig        r25=f107                }
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r19,r18
-                add             r19=r19,carry1  };;
-{ .mfb; getf.sig        r26=f98                 }
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r19,carry1};;
-{ .mii;         st8             [r32]=r19,16
-        (p7)    add             carry2=1,carry2 }
-{ .mfb; add             r25=r25,r24             };;
-{ .mfb;         getf.sig        r16=f117        }
-{ .mii; mov             carry1=0
-        cmp.ltu         p6,p0=r25,r24
-        add             r26=r26,r25             };;
-{ .mfb;         getf.sig        r17=f108        }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,r25
-        add             r26=r26,carry2          };;
-{ .mfb; nop.m   0x0                             }
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,carry2        };;
-{ .mii; st8             [r33]=r26,16
-(p6)    add             carry1=1,carry1         }
-{ .mfb;         add             r17=r17,r16     };;
-{ .mfb; getf.sig        r24=f118                }
-{ .mii;         mov             carry2=0
-                cmp.ltu         p7,p0=r17,r16
-                add             r17=r17,carry1  };;
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r17,carry1};;
-{ .mii;         st8             [r32]=r17
-        (p7)    add             carry2=1,carry2 };;
-{ .mfb; add             r24=r24,carry2          };;
-{ .mib; st8             [r33]=r24               }
-{ .mib; rum             1<<5            // clear um.mfh
-        br.ret.sptk.many        b0      };;
-.endp   bn_mul_comba8#
-#undef  carry3
-#undef  carry2
-#undef  carry1
-#endif
-#if 1
-// It's possible to make it faster (see comment to bn_sqr_comba8), but
-// I reckon it doesn't worth the effort. Basically because the routine
-// (actually both of them) practically never called... So I just play
-// same trick as with bn_sqr_comba8.
-//
-// void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a)
-//
-.global bn_sqr_comba4#
-.proc   bn_sqr_comba4#
-.align  64
-bn_sqr_comba4:
-        .prologue
-        .save   ar.pfs,r2
-#if defined(_HPUX_SOURCE) && !defined(_LP64)
-{ .mii; alloc   r2=ar.pfs,2,1,0,0
-        addp4   r32=0,r32
-        addp4   r33=0,r33               };;
-{ .mii;
-#else
-{ .mii; alloc   r2=ar.pfs,2,1,0,0
-#endif
-        mov     r34=r33
-        add     r14=8,r33               };;
-        .body
-{ .mii; add     r17=8,r34
-        add     r15=16,r33
-        add     r18=16,r34              }
-{ .mfb; add     r16=24,r33
-        br      .L_cheat_entry_point4   };;
-.endp   bn_sqr_comba4#
-#endif
-#if 1
-// Runs in ~115 cycles and ~4.5 times faster than C. Well, whatever...
-//
-// void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-//
-#define carry1  r14
-#define carry2  r15
-.global bn_mul_comba4#
-.proc   bn_mul_comba4#
-.align  64
-bn_mul_comba4:
-        .prologue
-        .save   ar.pfs,r2
-#if defined(_HPUX_SOURCE) && !defined(_LP64)
-{ .mii; alloc   r2=ar.pfs,3,0,0,0
-        addp4   r33=0,r33
-        addp4   r34=0,r34               };;
-{ .mii; addp4   r32=0,r32
-#else
-{ .mii; alloc   r2=ar.pfs,3,0,0,0
-#endif
-        add     r14=8,r33
-        add     r17=8,r34               }
-        .body
-{ .mii; add     r15=16,r33
-        add     r18=16,r34
-        add     r16=24,r33              };;
-.L_cheat_entry_point4:
-{ .mmi; add     r19=24,r34
-        ldf8    f32=[r33]               }
-{ .mmi; ldf8    f120=[r34]
-        ldf8    f121=[r17]              };;
-{ .mmi; ldf8    f122=[r18]
-        ldf8    f123=[r19]              }
-{ .mmi; ldf8    f33=[r14]
-        ldf8    f34=[r15]               }
-{ .mfi; ldf8    f35=[r16]
-                xma.hu  f41=f32,f120,f0         }
-{ .mfi;         xma.lu  f40=f32,f120,f0         };;
-{ .mfi;         xma.hu  f51=f32,f121,f0         }
-{ .mfi;         xma.lu  f50=f32,f121,f0         };;
-{ .mfi;         xma.hu  f61=f32,f122,f0         }
-{ .mfi;         xma.lu  f60=f32,f122,f0         };;
-{ .mfi;         xma.hu  f71=f32,f123,f0         }
-{ .mfi;         xma.lu  f70=f32,f123,f0         };;//
-// Major stall takes place here, and 3 more places below. Result from
-// first xma is not available for another 3 ticks.
-{ .mfi; getf.sig        r16=f40
-                xma.hu  f42=f33,f120,f41
-        add             r33=8,r32               }
-{ .mfi;         xma.lu  f41=f33,f120,f41        };;
-{ .mfi; getf.sig        r24=f50
-                xma.hu  f52=f33,f121,f51        }
-{ .mfi;         xma.lu  f51=f33,f121,f51        };;
-{ .mfi; st8             [r32]=r16,16
-                xma.hu  f62=f33,f122,f61        }
-{ .mfi;         xma.lu  f61=f33,f122,f61        };;
-{ .mfi;         xma.hu  f72=f33,f123,f71        }
-{ .mfi;         xma.lu  f71=f33,f123,f71        };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r25=f41
-                xma.hu  f43=f34,f120,f42        }
-{ .mfi;         xma.lu  f42=f34,f120,f42        };;
-{ .mfi; getf.sig        r16=f60
-                xma.hu  f53=f34,f121,f52        }
-{ .mfi;         xma.lu  f52=f34,f121,f52        };;
-{ .mfi; getf.sig        r17=f51
-                xma.hu  f63=f34,f122,f62
-        add             r25=r25,r24             }
-{ .mfi; mov             carry1=0
-                xma.lu  f62=f34,f122,f62        };;
-{ .mfi; st8             [r33]=r25,16
-                xma.hu  f73=f34,f123,f72
-        cmp.ltu         p6,p0=r25,r24           }
-{ .mfi;         xma.lu  f72=f34,f123,f72        };;//
-//-------------------------------------------------//
-{ .mfi; getf.sig        r18=f42
-                xma.hu  f44=f35,f120,f43
-(p6)    add             carry1=1,carry1         }
-{ .mfi; add             r17=r17,r16
-                xma.lu  f43=f35,f120,f43
-        mov             carry2=0                };;
-{ .mfi; getf.sig        r24=f70
-                xma.hu  f54=f35,f121,f53
-        cmp.ltu         p7,p0=r17,r16           }
-{ .mfi;         xma.lu  f53=f35,f121,f53        };;
-{ .mfi; getf.sig        r25=f61
-                xma.hu  f64=f35,f122,f63
-        add             r18=r18,r17             }
-{ .mfi;         xma.lu  f63=f35,f122,f63
-(p7)    add             carry2=1,carry2         };;
-{ .mfi; getf.sig        r26=f52
-                xma.hu  f74=f35,f123,f73
-        cmp.ltu         p7,p0=r18,r17           }
-{ .mfi;         xma.lu  f73=f35,f123,f73
-        add             r18=r18,carry1          };;
-//-------------------------------------------------//
-{ .mii; st8             [r32]=r18,16
-(p7)    add             carry2=1,carry2
-        cmp.ltu         p7,p0=r18,carry1        };;
-{ .mfi; getf.sig        r27=f43 // last major stall
-(p7)    add             carry2=1,carry2         };;
-{ .mii;         getf.sig        r16=f71
-        add             r25=r25,r24
-        mov             carry1=0                };;
-{ .mii;         getf.sig        r17=f62 
-        cmp.ltu         p6,p0=r25,r24
-        add             r26=r26,r25             };;
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,r25
-        add             r27=r27,r26             };;
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r27,r26
-        add             r27=r27,carry2          };;
-{ .mii;         getf.sig        r18=f53
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r27,carry2        };;
-{ .mfi; st8             [r33]=r27,16
-(p6)    add             carry1=1,carry1         }
-{ .mii;         getf.sig        r19=f44
-                add             r17=r17,r16
-                mov             carry2=0        };;
-{ .mii; getf.sig        r24=f72
-                cmp.ltu         p7,p0=r17,r16
-                add             r18=r18,r17     };;
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r18,r17
-                add             r19=r19,r18     };;
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r19,r18
-                add             r19=r19,carry1  };;
-{ .mii; getf.sig        r25=f63
-        (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r19,carry1};;
-{ .mii;         st8             [r32]=r19,16
-        (p7)    add             carry2=1,carry2 }
-{ .mii; getf.sig        r26=f54
-        add             r25=r25,r24
-        mov             carry1=0                };;
-{ .mii;         getf.sig        r16=f73
-        cmp.ltu         p6,p0=r25,r24
-        add             r26=r26,r25             };;
-{ .mii;
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,r25
-        add             r26=r26,carry2          };;
-{ .mii;         getf.sig        r17=f64
-(p6)    add             carry1=1,carry1
-        cmp.ltu         p6,p0=r26,carry2        };;
-{ .mii; st8             [r33]=r26,16
-(p6)    add             carry1=1,carry1         }
-{ .mii; getf.sig        r24=f74
-                add             r17=r17,r16     
-                mov             carry2=0        };;
-{ .mii;         cmp.ltu         p7,p0=r17,r16
-                add             r17=r17,carry1  };;
-{ .mii; (p7)    add             carry2=1,carry2
-                cmp.ltu         p7,p0=r17,carry1};;
-{ .mii;         st8             [r32]=r17,16
-        (p7)    add             carry2=1,carry2 };;
-{ .mii; add             r24=r24,carry2          };;
-{ .mii; st8             [r33]=r24               }
-{ .mib; rum             1<<5            // clear um.mfh
-        br.ret.sptk.many        b0      };;
-.endp   bn_mul_comba4#
-#undef  carry2
-#undef  carry1
-#endif
-#if 1
-//
-// BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
-//
-// In the nutshell it's a port of my MIPS III/IV implementation.
-//
-#define AT      r14
-#define H       r16
-#define HH      r20
-#define L       r17
-#define D       r18
-#define DH      r22
-#define I       r21
-#if 0
-// Some preprocessors (most notably HP-UX) appear to be allergic to
-// macros enclosed to parenthesis [as these three were].
-#define cont    p16
-#define break   p0      // p20
-#define equ     p24
-#else
-cont=p16
-break=p0
-equ=p24
-#endif
-.global abort#
-.global bn_div_words#
-.proc   bn_div_words#
-.align  64
-bn_div_words:
-        .prologue
-        .save   ar.pfs,r2
-{ .mii; alloc           r2=ar.pfs,3,5,0,8
-        .save   b0,r3
-        mov             r3=b0
-        .save   pr,r10
-        mov             r10=pr          };;
-{ .mmb; cmp.eq          p6,p0=r34,r0
-        mov             r8=-1
-(p6)    br.ret.spnt.many        b0      };;
-        .body
-{ .mii; mov             H=r32           // save h
-        mov             ar.ec=0         // don't rotate at exit
-        mov             pr.rot=0        }
-{ .mii; mov             L=r33           // save l
-        mov             r36=r0          };;
-.L_divw_shift:  // -vv- note signed comparison
-{ .mfi; (p0)    cmp.lt          p16,p0=r0,r34   // d
-        (p0)    shladd          r33=r34,1,r0    }
-{ .mfb; (p0)    add             r35=1,r36
-        (p0)    nop.f           0x0
-(p16)   br.wtop.dpnt            .L_divw_shift   };;
-{ .mii; mov             D=r34
-        shr.u           DH=r34,32
-        sub             r35=64,r36              };;
-{ .mii; setf.sig        f7=DH
-        shr.u           AT=H,r35
-        mov             I=r36                   };;
-{ .mib; cmp.ne          p6,p0=r0,AT
-        shl             H=H,r36
-(p6)    br.call.spnt.clr        b0=abort        };;     // overflow, die...
-{ .mfi; fcvt.xuf.s1     f7=f7
-        shr.u           AT=L,r35                };;
-{ .mii; shl             L=L,r36
-        or              H=H,AT                  };;
-{ .mii; nop.m           0x0
-        cmp.leu         p6,p0=D,H;;
-(p6)    sub             H=H,D                   }
-{ .mlx; setf.sig        f14=D
-        movl            AT=0xffffffff           };;
-///////////////////////////////////////////////////////////
-{ .mii; setf.sig        f6=H
-        shr.u           HH=H,32;;
-        cmp.eq          p6,p7=HH,DH             };;
-{ .mfb;
-(p6)    setf.sig        f8=AT
-(p7)    fcvt.xuf.s1     f6=f6
-(p7)    br.call.sptk    b6=.L_udiv64_32_b6      };;
-{ .mfi; getf.sig        r33=f8                          // q
-        xmpy.lu         f9=f8,f14               }
-{ .mfi; xmpy.hu         f10=f8,f14
-        shrp            H=H,L,32                };;
-{ .mmi; getf.sig        r35=f9                          // tl
-        getf.sig        r31=f10                 };;     // th
-.L_divw_1st_iter:
-{ .mii; (p0)    add             r32=-1,r33
-        (p0)    cmp.eq          equ,cont=HH,r31         };;
-{ .mii; (p0)    cmp.ltu         p8,p0=r35,D
-        (p0)    sub             r34=r35,D
-        (equ)   cmp.leu         break,cont=r35,H        };;
-{ .mib; (cont)  cmp.leu         cont,break=HH,r31
-        (p8)    add             r31=-1,r31
-(cont)  br.wtop.spnt            .L_divw_1st_iter        };;
-///////////////////////////////////////////////////////////
-{ .mii; sub             H=H,r35
-        shl             r8=r33,32
-        shl             L=L,32                  };;
-///////////////////////////////////////////////////////////
-{ .mii; setf.sig        f6=H
-        shr.u           HH=H,32;;
-        cmp.eq          p6,p7=HH,DH             };;
-{ .mfb;
-(p6)    setf.sig        f8=AT
-(p7)    fcvt.xuf.s1     f6=f6
-(p7)    br.call.sptk    b6=.L_udiv64_32_b6      };;
-{ .mfi; getf.sig        r33=f8                          // q
-        xmpy.lu         f9=f8,f14               }
-{ .mfi; xmpy.hu         f10=f8,f14
-        shrp            H=H,L,32                };;
-{ .mmi; getf.sig        r35=f9                          // tl
-        getf.sig        r31=f10                 };;     // th
-.L_divw_2nd_iter:
-{ .mii; (p0)    add             r32=-1,r33
-        (p0)    cmp.eq          equ,cont=HH,r31         };;
-{ .mii; (p0)    cmp.ltu         p8,p0=r35,D
-        (p0)    sub             r34=r35,D
-        (equ)   cmp.leu         break,cont=r35,H        };;
-{ .mib; (cont)  cmp.leu         cont,break=HH,r31
-        (p8)    add             r31=-1,r31
-(cont)  br.wtop.spnt            .L_divw_2nd_iter        };;
-///////////////////////////////////////////////////////////
-{ .mii; sub     H=H,r35
-        or      r8=r8,r33
-        mov     ar.pfs=r2               };;
-{ .mii; shr.u   r9=H,I                  // remainder if anybody wants it
-        mov     pr=r10,0x1ffff          }
-{ .mfb; br.ret.sptk.many        b0      };;
-// Unsigned 64 by 32 (well, by 64 for the moment) bit integer division
-// procedure.
-//
-// inputs:      f6 = (double)a, f7 = (double)b
-// output:      f8 = (int)(a/b)
-// clobbered:   f8,f9,f10,f11,pred
-pred=p15
-// One can argue that this snippet is copyrighted to Intel
-// Corporation, as it's essentially identical to one of those
-// found in "Divide, Square Root and Remainder" section at
-// http://www.intel.com/software/products/opensource/libraries/num.htm.
-// Yes, I admit that the referred code was used as template,
-// but after I realized that there hardly is any other instruction
-// sequence which would perform this operation. I mean I figure that
-// any independent attempt to implement high-performance division
-// will result in code virtually identical to the Intel code. It
-// should be noted though that below division kernel is 1 cycle
-// faster than Intel one (note commented splits:-), not to mention
-// original prologue (rather lack of one) and epilogue.
-.align  32
-.skip   16
-.L_udiv64_32_b6:
-        frcpa.s1        f8,pred=f6,f7;;         // [0]  y0 = 1 / b
-(pred)  fnma.s1         f9=f7,f8,f1             // [5]  e0 = 1 - b * y0
-(pred)  fmpy.s1         f10=f6,f8;;             // [5]  q0 = a * y0
-(pred)  fmpy.s1         f11=f9,f9               // [10] e1 = e0 * e0
-(pred)  fma.s1          f10=f9,f10,f10;;        // [10] q1 = q0 + e0 * q0
-(pred)  fma.s1          f8=f9,f8,f8     //;;    // [15] y1 = y0 + e0 * y0
-(pred)  fma.s1          f9=f11,f10,f10;;        // [15] q2 = q1 + e1 * q1
-(pred)  fma.s1          f8=f11,f8,f8    //;;    // [20] y2 = y1 + e1 * y1
-(pred)  fnma.s1         f10=f7,f9,f6;;          // [20] r2 = a - b * q2
-(pred)  fma.s1          f8=f10,f8,f9;;          // [25] q3 = q2 + r2 * y2
-        fcvt.fxu.trunc.s1       f8=f8           // [30] q = trunc(q3)
-        br.ret.sptk.many        b6;;
-.endp   bn_div_words#
-#endif
diff --git a/src/lib/libcrypto/bn/asm/pa-risc2.s b/src/lib/libcrypto/bn/asm/pa-risc2.s
deleted file mode 100644
index f3b16290eb..0000000000
--- a/src/lib/libcrypto/bn/asm/pa-risc2.s
+++ /dev/null
@@ -1,1618 +0,0 @@
-;
-; PA-RISC 2.0 implementation of bn_asm code, based on the
-; 64-bit version of the code.  This code is effectively the
-; same as the 64-bit version except the register model is
-; slightly different given all values must be 32-bit between
-; function calls.  Thus the 64-bit return values are returned
-; in %ret0 and %ret1 vs just %ret0 as is done in 64-bit
-;
-;
-; This code is approximately 2x faster than the C version
-; for RSA/DSA.
-;
-; See http://devresource.hp.com/  for more details on the PA-RISC
-; architecture.  Also see the book "PA-RISC 2.0 Architecture"
-; by Gerry Kane for information on the instruction set architecture.
-;
-; Code written by Chris Ruemmler (with some help from the HP C
-; compiler).
-;
-; The code compiles with HP's assembler
-;
-        .level  2.0N
-        .space  $TEXT$
-        .subspa $CODE$,QUAD=0,ALIGN=8,ACCESS=0x2c,CODE_ONLY
-;
-; Global Register definitions used for the routines.
-;
-; Some information about HP's runtime architecture for 32-bits.
-;
-; "Caller save" means the calling function must save the register
-; if it wants the register to be preserved.
-; "Callee save" means if a function uses the register, it must save
-; the value before using it.
-;
-; For the floating point registers 
-;
-;    "caller save" registers: fr4-fr11, fr22-fr31
-;    "callee save" registers: fr12-fr21
-;    "special" registers: fr0-fr3 (status and exception registers)
-;
-; For the integer registers
-;     value zero             :  r0
-;     "caller save" registers: r1,r19-r26
-;     "callee save" registers: r3-r18
-;     return register        :  r2  (rp)
-;     return values          ; r28,r29  (ret0,ret1)
-;     Stack pointer          ; r30  (sp) 
-;     millicode return ptr   ; r31  (also a caller save register)
-;
-; Arguments to the routines
-;
-r_ptr       .reg %r26
-a_ptr       .reg %r25
-b_ptr       .reg %r24
-num         .reg %r24
-n           .reg %r23
-;
-; Note that the "w" argument for bn_mul_add_words and bn_mul_words
-; is passed on the stack at a delta of -56 from the top of stack
-; as the routine is entered.
-;
-;
-; Globals used in some routines
-;
-top_overflow .reg %r23
-high_mask    .reg %r22    ; value 0xffffffff80000000L
-;------------------------------------------------------------------------------
-;
-; bn_mul_add_words
-;
-;BN_ULONG bn_mul_add_words(BN_ULONG *r_ptr, BN_ULONG *a_ptr, 
-;                                                               int num, BN_ULONG w)
-;
-; arg0 = r_ptr
-; arg1 = a_ptr
-; arg3 = num
-; -56(sp) =  w
-;
-; Local register definitions
-;
-fm1          .reg %fr22
-fm           .reg %fr23
-ht_temp      .reg %fr24
-ht_temp_1    .reg %fr25
-lt_temp      .reg %fr26
-lt_temp_1    .reg %fr27
-fm1_1        .reg %fr28
-fm_1         .reg %fr29
-fw_h         .reg %fr7L
-fw_l         .reg %fr7R
-fw           .reg %fr7
-fht_0        .reg %fr8L
-flt_0        .reg %fr8R
-t_float_0    .reg %fr8
-fht_1        .reg %fr9L
-flt_1        .reg %fr9R
-t_float_1    .reg %fr9
-tmp_0        .reg %r31
-tmp_1        .reg %r21
-m_0          .reg %r20 
-m_1          .reg %r19 
-ht_0         .reg %r1  
-ht_1         .reg %r3
-lt_0         .reg %r4
-lt_1         .reg %r5
-m1_0         .reg %r6 
-m1_1         .reg %r7 
-rp_val       .reg %r8
-rp_val_1     .reg %r9
-bn_mul_add_words
-        .export bn_mul_add_words,entry,NO_RELOCATION,LONG_RETURN
-        .proc
-        .callinfo frame=128
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3  
-    STD     %r4,8(%sp)          ; save r4  
-        NOP                         ; Needed to make the loop 16-byte aligned
-        NOP                         ; needed to make the loop 16-byte aligned
-    STD     %r5,16(%sp)         ; save r5  
-        NOP
-    STD     %r6,24(%sp)         ; save r6  
-    STD     %r7,32(%sp)         ; save r7  
-    STD     %r8,40(%sp)         ; save r8  
-    STD     %r9,48(%sp)         ; save r9  
-    COPY    %r0,%ret1           ; return 0 by default
-    DEPDI,Z 1,31,1,top_overflow ; top_overflow = 1 << 32    
-    CMPIB,>= 0,num,bn_mul_add_words_exit  ; if (num <= 0) then exit
-        LDO     128(%sp),%sp        ; bump stack
-        ;
-        ; The loop is unrolled twice, so if there is only 1 number
-    ; then go straight to the cleanup code.
-        ;
-        CMPIB,= 1,num,bn_mul_add_words_single_top
-        FLDD    -184(%sp),fw        ; (-56-128) load up w into fw (fw_h/fw_l)
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-        ; PA-RISC 2.0 chips have two fully pipelined multipliers, thus
-    ; two 32-bit mutiplies can be issued per cycle.
-    ; 
-bn_mul_add_words_unroll2
-    FLDD    0(a_ptr),t_float_0       ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    FLDD    8(a_ptr),t_float_1       ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    LDD     0(r_ptr),rp_val          ; rp[0]
-    LDD     8(r_ptr),rp_val_1        ; rp[1]
-    XMPYU   fht_0,fw_l,fm1           ; m1[0] = fht_0*fw_l
-    XMPYU   fht_1,fw_l,fm1_1         ; m1[1] = fht_1*fw_l
-    FSTD    fm1,-16(%sp)             ; -16(sp) = m1[0]
-    FSTD    fm1_1,-48(%sp)           ; -48(sp) = m1[1]
-    XMPYU   flt_0,fw_h,fm            ; m[0] = flt_0*fw_h
-    XMPYU   flt_1,fw_h,fm_1          ; m[1] = flt_1*fw_h
-    FSTD    fm,-8(%sp)               ; -8(sp) = m[0]
-    FSTD    fm_1,-40(%sp)            ; -40(sp) = m[1]
-    XMPYU   fht_0,fw_h,ht_temp       ; ht_temp   = fht_0*fw_h
-    XMPYU   fht_1,fw_h,ht_temp_1     ; ht_temp_1 = fht_1*fw_h
-    FSTD    ht_temp,-24(%sp)         ; -24(sp)   = ht_temp
-    FSTD    ht_temp_1,-56(%sp)       ; -56(sp)   = ht_temp_1
-    XMPYU   flt_0,fw_l,lt_temp       ; lt_temp = lt*fw_l
-    XMPYU   flt_1,fw_l,lt_temp_1     ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)         ; -32(sp) = lt_temp 
-    FSTD    lt_temp_1,-64(%sp)       ; -64(sp) = lt_temp_1 
-    LDD     -8(%sp),m_0              ; m[0] 
-    LDD     -40(%sp),m_1             ; m[1]
-    LDD     -16(%sp),m1_0            ; m1[0]
-    LDD     -48(%sp),m1_1            ; m1[1]
-    LDD     -24(%sp),ht_0            ; ht[0]
-    LDD     -56(%sp),ht_1            ; ht[1]
-    ADD,L   m1_0,m_0,tmp_0           ; tmp_0 = m[0] + m1[0]; 
-    ADD,L   m1_1,m_1,tmp_1           ; tmp_1 = m[1] + m1[1]; 
-    LDD     -32(%sp),lt_0            
-    LDD     -64(%sp),lt_1            
-    CMPCLR,*>>= tmp_0,m1_0, %r0      ; if (m[0] < m1[0])
-    ADD,L   ht_0,top_overflow,ht_0   ; ht[0] += (1<<32)
-    CMPCLR,*>>= tmp_1,m1_1,%r0       ; if (m[1] < m1[1])
-    ADD,L   ht_1,top_overflow,ht_1   ; ht[1] += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0          ; m[0]>>32  
-    DEPD,Z  tmp_0,31,32,m1_0         ; m1[0] = m[0]<<32 
-    EXTRD,U tmp_1,31,32,m_1          ; m[1]>>32  
-    DEPD,Z  tmp_1,31,32,m1_1         ; m1[1] = m[1]<<32 
-    ADD,L   ht_0,m_0,ht_0            ; ht[0]+= (m[0]>>32)
-    ADD,L   ht_1,m_1,ht_1            ; ht[1]+= (m[1]>>32)
-    ADD     lt_0,m1_0,lt_0           ; lt[0] = lt[0]+m1[0];
-        ADD,DC  ht_0,%r0,ht_0            ; ht[0]++
-    ADD     lt_1,m1_1,lt_1           ; lt[1] = lt[1]+m1[1];
-    ADD,DC  ht_1,%r0,ht_1            ; ht[1]++
-    ADD    %ret1,lt_0,lt_0           ; lt[0] = lt[0] + c;
-        ADD,DC  ht_0,%r0,ht_0            ; ht[0]++
-    ADD     lt_0,rp_val,lt_0         ; lt[0] = lt[0]+rp[0]
-    ADD,DC  ht_0,%r0,ht_0            ; ht[0]++
-        LDO    -2(num),num               ; num = num - 2;
-    ADD     ht_0,lt_1,lt_1           ; lt[1] = lt[1] + ht_0 (c);
-    ADD,DC  ht_1,%r0,ht_1            ; ht[1]++
-    STD     lt_0,0(r_ptr)            ; rp[0] = lt[0]
-    ADD     lt_1,rp_val_1,lt_1       ; lt[1] = lt[1]+rp[1]
-    ADD,DC  ht_1,%r0,%ret1           ; ht[1]++
-    LDO     16(a_ptr),a_ptr          ; a_ptr += 2
-    STD     lt_1,8(r_ptr)            ; rp[1] = lt[1]
-        CMPIB,<= 2,num,bn_mul_add_words_unroll2 ; go again if more to do
-    LDO     16(r_ptr),r_ptr          ; r_ptr += 2
-    CMPIB,=,N 0,num,bn_mul_add_words_exit ; are we done, or cleanup last one
-        ;
-        ; Top of loop aligned on 64-byte boundary
-        ;
-bn_mul_add_words_single_top
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    LDD     0(r_ptr),rp_val           ; rp[0]
-    LDO     8(a_ptr),a_ptr            ; a_ptr++
-    XMPYU   fht_0,fw_l,fm1            ; m1 = ht*fw_l
-    FSTD    fm1,-16(%sp)              ; -16(sp) = m1
-    XMPYU   flt_0,fw_h,fm             ; m = lt*fw_h
-    FSTD    fm,-8(%sp)                ; -8(sp) = m
-    XMPYU   fht_0,fw_h,ht_temp        ; ht_temp = ht*fw_h
-    FSTD    ht_temp,-24(%sp)          ; -24(sp) = ht
-    XMPYU   flt_0,fw_l,lt_temp        ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)          ; -32(sp) = lt 
-    LDD     -8(%sp),m_0               
-    LDD    -16(%sp),m1_0              ; m1 = temp1 
-    ADD,L   m_0,m1_0,tmp_0            ; tmp_0 = m + m1; 
-    LDD     -24(%sp),ht_0             
-    LDD     -32(%sp),lt_0             
-    CMPCLR,*>>= tmp_0,m1_0,%r0        ; if (m < m1)
-    ADD,L   ht_0,top_overflow,ht_0    ; ht += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0           ; m>>32  
-    DEPD,Z  tmp_0,31,32,m1_0          ; m1 = m<<32 
-    ADD,L   ht_0,m_0,ht_0             ; ht+= (m>>32)
-    ADD     lt_0,m1_0,tmp_0           ; tmp_0 = lt+m1;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     %ret1,tmp_0,lt_0          ; lt = lt + c;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     lt_0,rp_val,lt_0          ; lt = lt+rp[0]
-    ADD,DC  ht_0,%r0,%ret1            ; ht++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-bn_mul_add_words_exit
-    .EXIT
-        
-    EXTRD,U %ret1,31,32,%ret0         ; for 32-bit, return in ret0/ret1
-    LDD     -80(%sp),%r9              ; restore r9  
-    LDD     -88(%sp),%r8              ; restore r8  
-    LDD     -96(%sp),%r7              ; restore r7  
-    LDD     -104(%sp),%r6             ; restore r6  
-    LDD     -112(%sp),%r5             ; restore r5  
-    LDD     -120(%sp),%r4             ; restore r4  
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3             ; restore r3
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-;
-; arg0 = rp
-; arg1 = ap
-; arg3 = num
-; w on stack at -56(sp)
-bn_mul_words
-        .proc
-        .callinfo frame=128
-    .entry
-        .EXPORT bn_mul_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-        .align 64
-    STD     %r3,0(%sp)          ; save r3  
-    STD     %r4,8(%sp)          ; save r4  
-        NOP
-    STD     %r5,16(%sp)         ; save r5  
-    STD     %r6,24(%sp)         ; save r6  
-    STD     %r7,32(%sp)         ; save r7  
-    COPY    %r0,%ret1           ; return 0 by default
-    DEPDI,Z 1,31,1,top_overflow ; top_overflow = 1 << 32    
-    CMPIB,>= 0,num,bn_mul_words_exit
-        LDO     128(%sp),%sp    ; bump stack
-        ;
-        ; See if only 1 word to do, thus just do cleanup
-        ;
-        CMPIB,= 1,num,bn_mul_words_single_top
-        FLDD    -184(%sp),fw        ; (-56-128) load up w into fw (fw_h/fw_l)
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-        ; PA-RISC 2.0 chips have two fully pipelined multipliers, thus
-    ; two 32-bit mutiplies can be issued per cycle.
-    ; 
-bn_mul_words_unroll2
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    FLDD    8(a_ptr),t_float_1        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    XMPYU   fht_0,fw_l,fm1            ; m1[0] = fht_0*fw_l
-    XMPYU   fht_1,fw_l,fm1_1          ; m1[1] = ht*fw_l
-    FSTD    fm1,-16(%sp)              ; -16(sp) = m1
-    FSTD    fm1_1,-48(%sp)            ; -48(sp) = m1
-    XMPYU   flt_0,fw_h,fm             ; m = lt*fw_h
-    XMPYU   flt_1,fw_h,fm_1           ; m = lt*fw_h
-    FSTD    fm,-8(%sp)                ; -8(sp) = m
-    FSTD    fm_1,-40(%sp)             ; -40(sp) = m
-    XMPYU   fht_0,fw_h,ht_temp        ; ht_temp = fht_0*fw_h
-    XMPYU   fht_1,fw_h,ht_temp_1      ; ht_temp = ht*fw_h
-    FSTD    ht_temp,-24(%sp)          ; -24(sp) = ht
-    FSTD    ht_temp_1,-56(%sp)        ; -56(sp) = ht
-    XMPYU   flt_0,fw_l,lt_temp        ; lt_temp = lt*fw_l
-    XMPYU   flt_1,fw_l,lt_temp_1      ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)          ; -32(sp) = lt 
-    FSTD    lt_temp_1,-64(%sp)        ; -64(sp) = lt 
-    LDD     -8(%sp),m_0               
-    LDD     -40(%sp),m_1              
-    LDD    -16(%sp),m1_0              
-    LDD    -48(%sp),m1_1              
-    LDD     -24(%sp),ht_0             
-    LDD     -56(%sp),ht_1             
-    ADD,L   m1_0,m_0,tmp_0            ; tmp_0 = m + m1; 
-    ADD,L   m1_1,m_1,tmp_1            ; tmp_1 = m + m1; 
-    LDD     -32(%sp),lt_0             
-    LDD     -64(%sp),lt_1             
-    CMPCLR,*>>= tmp_0,m1_0, %r0       ; if (m < m1)
-    ADD,L   ht_0,top_overflow,ht_0    ; ht += (1<<32)
-    CMPCLR,*>>= tmp_1,m1_1,%r0        ; if (m < m1)
-    ADD,L   ht_1,top_overflow,ht_1    ; ht += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0           ; m>>32  
-    DEPD,Z  tmp_0,31,32,m1_0          ; m1 = m<<32 
-    EXTRD,U tmp_1,31,32,m_1           ; m>>32  
-    DEPD,Z  tmp_1,31,32,m1_1          ; m1 = m<<32 
-    ADD,L   ht_0,m_0,ht_0             ; ht+= (m>>32)
-    ADD,L   ht_1,m_1,ht_1             ; ht+= (m>>32)
-    ADD     lt_0,m1_0,lt_0            ; lt = lt+m1;
-        ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     lt_1,m1_1,lt_1            ; lt = lt+m1;
-    ADD,DC  ht_1,%r0,ht_1             ; ht++
-    ADD    %ret1,lt_0,lt_0            ; lt = lt + c (ret1);
-        ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     ht_0,lt_1,lt_1            ; lt = lt + c (ht_0)
-    ADD,DC  ht_1,%r0,ht_1             ; ht++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-    STD     lt_1,8(r_ptr)             ; rp[1] = lt
-        COPY    ht_1,%ret1                ; carry = ht
-        LDO    -2(num),num                ; num = num - 2;
-    LDO     16(a_ptr),a_ptr           ; ap += 2
-        CMPIB,<= 2,num,bn_mul_words_unroll2
-    LDO     16(r_ptr),r_ptr           ; rp++
-    CMPIB,=,N 0,num,bn_mul_words_exit ; are we done?
-        ;
-        ; Top of loop aligned on 64-byte boundary
-        ;
-bn_mul_words_single_top
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    XMPYU   fht_0,fw_l,fm1            ; m1 = ht*fw_l
-    FSTD    fm1,-16(%sp)              ; -16(sp) = m1
-    XMPYU   flt_0,fw_h,fm             ; m = lt*fw_h
-    FSTD    fm,-8(%sp)                ; -8(sp) = m
-    XMPYU   fht_0,fw_h,ht_temp        ; ht_temp = ht*fw_h
-    FSTD    ht_temp,-24(%sp)          ; -24(sp) = ht
-    XMPYU   flt_0,fw_l,lt_temp        ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)          ; -32(sp) = lt 
-    LDD     -8(%sp),m_0               
-    LDD    -16(%sp),m1_0              
-    ADD,L   m_0,m1_0,tmp_0            ; tmp_0 = m + m1; 
-    LDD     -24(%sp),ht_0             
-    LDD     -32(%sp),lt_0             
-    CMPCLR,*>>= tmp_0,m1_0,%r0        ; if (m < m1)
-    ADD,L   ht_0,top_overflow,ht_0    ; ht += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0           ; m>>32  
-    DEPD,Z  tmp_0,31,32,m1_0          ; m1 = m<<32 
-    ADD,L   ht_0,m_0,ht_0             ; ht+= (m>>32)
-    ADD     lt_0,m1_0,lt_0            ; lt= lt+m1;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     %ret1,lt_0,lt_0           ; lt = lt + c;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    COPY    ht_0,%ret1                ; copy carry
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-bn_mul_words_exit
-    .EXIT
-    EXTRD,U %ret1,31,32,%ret0           ; for 32-bit, return in ret0/ret1
-    LDD     -96(%sp),%r7              ; restore r7  
-    LDD     -104(%sp),%r6             ; restore r6  
-    LDD     -112(%sp),%r5             ; restore r5  
-    LDD     -120(%sp),%r4             ; restore r4  
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3             ; restore r3
-        .PROCEND        
-;----------------------------------------------------------------------------
-;
-;void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num)
-;
-; arg0 = rp
-; arg1 = ap
-; arg2 = num
-;
-bn_sqr_words
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_sqr_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3  
-    STD     %r4,8(%sp)          ; save r4  
-        NOP
-    STD     %r5,16(%sp)         ; save r5  
-    CMPIB,>= 0,num,bn_sqr_words_exit
-        LDO     128(%sp),%sp       ; bump stack
-        ;
-        ; If only 1, the goto straight to cleanup
-        ;
-        CMPIB,= 1,num,bn_sqr_words_single_top
-    DEPDI,Z -1,32,33,high_mask   ; Create Mask 0xffffffff80000000L
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-bn_sqr_words_unroll2
-    FLDD    0(a_ptr),t_float_0        ; a[0]
-    FLDD    8(a_ptr),t_float_1        ; a[1]
-    XMPYU   fht_0,flt_0,fm            ; m[0]
-    XMPYU   fht_1,flt_1,fm_1          ; m[1]
-    FSTD    fm,-24(%sp)               ; store m[0]
-    FSTD    fm_1,-56(%sp)             ; store m[1]
-    XMPYU   flt_0,flt_0,lt_temp       ; lt[0]
-    XMPYU   flt_1,flt_1,lt_temp_1     ; lt[1]
-    FSTD    lt_temp,-16(%sp)          ; store lt[0]
-    FSTD    lt_temp_1,-48(%sp)        ; store lt[1]
-    XMPYU   fht_0,fht_0,ht_temp       ; ht[0]
-    XMPYU   fht_1,fht_1,ht_temp_1     ; ht[1]
-    FSTD    ht_temp,-8(%sp)           ; store ht[0]
-    FSTD    ht_temp_1,-40(%sp)        ; store ht[1]
-    LDD     -24(%sp),m_0             
-    LDD     -56(%sp),m_1              
-    AND     m_0,high_mask,tmp_0       ; m[0] & Mask
-    AND     m_1,high_mask,tmp_1       ; m[1] & Mask
-    DEPD,Z  m_0,30,31,m_0             ; m[0] << 32+1
-    DEPD,Z  m_1,30,31,m_1             ; m[1] << 32+1
-    LDD     -16(%sp),lt_0        
-    LDD     -48(%sp),lt_1        
-    EXTRD,U tmp_0,32,33,tmp_0         ; tmp_0 = m[0]&Mask >> 32-1
-    EXTRD,U tmp_1,32,33,tmp_1         ; tmp_1 = m[1]&Mask >> 32-1
-    LDD     -8(%sp),ht_0            
-    LDD     -40(%sp),ht_1           
-    ADD,L   ht_0,tmp_0,ht_0           ; ht[0] += tmp_0
-    ADD,L   ht_1,tmp_1,ht_1           ; ht[1] += tmp_1
-    ADD     lt_0,m_0,lt_0             ; lt = lt+m
-    ADD,DC  ht_0,%r0,ht_0             ; ht[0]++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt[0]
-    STD     ht_0,8(r_ptr)             ; rp[1] = ht[1]
-    ADD     lt_1,m_1,lt_1             ; lt = lt+m
-    ADD,DC  ht_1,%r0,ht_1             ; ht[1]++
-    STD     lt_1,16(r_ptr)            ; rp[2] = lt[1]
-    STD     ht_1,24(r_ptr)            ; rp[3] = ht[1]
-        LDO    -2(num),num                ; num = num - 2;
-    LDO     16(a_ptr),a_ptr           ; ap += 2
-        CMPIB,<= 2,num,bn_sqr_words_unroll2
-    LDO     32(r_ptr),r_ptr           ; rp += 4
-    CMPIB,=,N 0,num,bn_sqr_words_exit ; are we done?
-        ;
-        ; Top of loop aligned on 64-byte boundary
-        ;
-bn_sqr_words_single_top
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    XMPYU   fht_0,flt_0,fm            ; m
-    FSTD    fm,-24(%sp)               ; store m
-    XMPYU   flt_0,flt_0,lt_temp       ; lt
-    FSTD    lt_temp,-16(%sp)          ; store lt
-    XMPYU   fht_0,fht_0,ht_temp       ; ht
-    FSTD    ht_temp,-8(%sp)           ; store ht
-    LDD     -24(%sp),m_0              ; load m
-    AND     m_0,high_mask,tmp_0       ; m & Mask
-    DEPD,Z  m_0,30,31,m_0             ; m << 32+1
-    LDD     -16(%sp),lt_0             ; lt
-    LDD     -8(%sp),ht_0              ; ht
-    EXTRD,U tmp_0,32,33,tmp_0         ; tmp_0 = m&Mask >> 32-1
-    ADD     m_0,lt_0,lt_0             ; lt = lt+m
-    ADD,L   ht_0,tmp_0,ht_0           ; ht += tmp_0
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-    STD     ht_0,8(r_ptr)             ; rp[1] = ht
-bn_sqr_words_exit
-    .EXIT
-    LDD     -112(%sp),%r5       ; restore r5  
-    LDD     -120(%sp),%r4       ; restore r4  
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3 
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;BN_ULONG bn_add_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-;
-; arg0 = rp 
-; arg1 = ap
-; arg2 = bp 
-; arg3 = n
-t  .reg %r22
-b  .reg %r21
-l  .reg %r20
-bn_add_words
-        .proc
-    .entry
-        .callinfo
-        .EXPORT bn_add_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-        .align 64
-    CMPIB,>= 0,n,bn_add_words_exit
-    COPY    %r0,%ret1           ; return 0 by default
-        ;
-        ; If 2 or more numbers do the loop
-        ;
-        CMPIB,= 1,n,bn_add_words_single_top
-        NOP
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-bn_add_words_unroll2
-        LDD     0(a_ptr),t
-        LDD     0(b_ptr),b
-        ADD     t,%ret1,t                    ; t = t+c;
-        ADD,DC  %r0,%r0,%ret1                ; set c to carry
-        ADD     t,b,l                        ; l = t + b[0]
-        ADD,DC  %ret1,%r0,%ret1              ; c+= carry
-        STD     l,0(r_ptr)
-        LDD     8(a_ptr),t
-        LDD     8(b_ptr),b
-        ADD     t,%ret1,t                     ; t = t+c;
-        ADD,DC  %r0,%r0,%ret1                 ; set c to carry
-        ADD     t,b,l                         ; l = t + b[0]
-        ADD,DC  %ret1,%r0,%ret1               ; c+= carry
-        STD     l,8(r_ptr)
-        LDO     -2(n),n
-        LDO     16(a_ptr),a_ptr
-        LDO     16(b_ptr),b_ptr
-        CMPIB,<= 2,n,bn_add_words_unroll2
-        LDO     16(r_ptr),r_ptr
-    CMPIB,=,N 0,n,bn_add_words_exit ; are we done?
-bn_add_words_single_top
-        LDD     0(a_ptr),t
-        LDD     0(b_ptr),b
-        ADD     t,%ret1,t                 ; t = t+c;
-        ADD,DC  %r0,%r0,%ret1             ; set c to carry (could use CMPCLR??)
-        ADD     t,b,l                     ; l = t + b[0]
-        ADD,DC  %ret1,%r0,%ret1           ; c+= carry
-        STD     l,0(r_ptr)
-bn_add_words_exit
-    .EXIT
-    BVE     (%rp)
-    EXTRD,U %ret1,31,32,%ret0           ; for 32-bit, return in ret0/ret1
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-;
-; arg0 = rp 
-; arg1 = ap
-; arg2 = bp 
-; arg3 = n
-t1       .reg %r22
-t2       .reg %r21
-sub_tmp1 .reg %r20
-sub_tmp2 .reg %r19
-bn_sub_words
-        .proc
-        .callinfo 
-        .EXPORT bn_sub_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    CMPIB,>=  0,n,bn_sub_words_exit
-    COPY    %r0,%ret1           ; return 0 by default
-        ;
-        ; If 2 or more numbers do the loop
-        ;
-        CMPIB,= 1,n,bn_sub_words_single_top
-        NOP
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-bn_sub_words_unroll2
-        LDD     0(a_ptr),t1
-        LDD     0(b_ptr),t2
-        SUB     t1,t2,sub_tmp1           ; t3 = t1-t2; 
-        SUB     sub_tmp1,%ret1,sub_tmp1  ; t3 = t3- c; 
-        CMPCLR,*>> t1,t2,sub_tmp2        ; clear if t1 > t2
-        LDO      1(%r0),sub_tmp2
-        
-        CMPCLR,*= t1,t2,%r0
-        COPY    sub_tmp2,%ret1
-        STD     sub_tmp1,0(r_ptr)
-        LDD     8(a_ptr),t1
-        LDD     8(b_ptr),t2
-        SUB     t1,t2,sub_tmp1            ; t3 = t1-t2; 
-        SUB     sub_tmp1,%ret1,sub_tmp1   ; t3 = t3- c; 
-        CMPCLR,*>> t1,t2,sub_tmp2         ; clear if t1 > t2
-        LDO      1(%r0),sub_tmp2
-        
-        CMPCLR,*= t1,t2,%r0
-        COPY    sub_tmp2,%ret1
-        STD     sub_tmp1,8(r_ptr)
-        LDO     -2(n),n
-        LDO     16(a_ptr),a_ptr
-        LDO     16(b_ptr),b_ptr
-        CMPIB,<= 2,n,bn_sub_words_unroll2
-        LDO     16(r_ptr),r_ptr
-    CMPIB,=,N 0,n,bn_sub_words_exit ; are we done?
-bn_sub_words_single_top
-        LDD     0(a_ptr),t1
-        LDD     0(b_ptr),t2
-        SUB     t1,t2,sub_tmp1            ; t3 = t1-t2; 
-        SUB     sub_tmp1,%ret1,sub_tmp1   ; t3 = t3- c; 
-        CMPCLR,*>> t1,t2,sub_tmp2         ; clear if t1 > t2
-        LDO      1(%r0),sub_tmp2
-        
-        CMPCLR,*= t1,t2,%r0
-        COPY    sub_tmp2,%ret1
-        STD     sub_tmp1,0(r_ptr)
-bn_sub_words_exit
-    .EXIT
-    BVE     (%rp)
-    EXTRD,U %ret1,31,32,%ret0           ; for 32-bit, return in ret0/ret1
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;------------------------------------------------------------------------------
-;
-; unsigned long bn_div_words(unsigned long h, unsigned long l, unsigned long d)
-;
-; arg0 = h
-; arg1 = l
-; arg2 = d
-;
-; This is mainly just output from the HP C compiler.  
-;
-;------------------------------------------------------------------------------
-bn_div_words
-        .PROC
-        .EXPORT bn_div_words,ENTRY,PRIV_LEV=3,ARGW0=GR,ARGW1=GR,ARGW2=GR,ARGW3=GR,RTNVAL=GR,LONG_RETURN
-        .IMPORT BN_num_bits_word,CODE
-        ;--- not PIC    .IMPORT __iob,DATA
-        ;--- not PIC    .IMPORT fprintf,CODE
-        .IMPORT abort,CODE
-        .IMPORT $$div2U,MILLICODE
-        .CALLINFO CALLER,FRAME=144,ENTRY_GR=%r9,SAVE_RP,ARGS_SAVED,ORDERING_AWARE
-        .ENTRY
-        STW     %r2,-20(%r30)   ;offset 0x8ec
-        STW,MA  %r3,192(%r30)   ;offset 0x8f0
-        STW     %r4,-188(%r30)  ;offset 0x8f4
-        DEPD    %r5,31,32,%r6   ;offset 0x8f8
-        STD     %r6,-184(%r30)  ;offset 0x8fc
-        DEPD    %r7,31,32,%r8   ;offset 0x900
-        STD     %r8,-176(%r30)  ;offset 0x904
-        STW     %r9,-168(%r30)  ;offset 0x908
-        LDD     -248(%r30),%r3  ;offset 0x90c
-        COPY    %r26,%r4        ;offset 0x910
-        COPY    %r24,%r5        ;offset 0x914
-        DEPD    %r25,31,32,%r4  ;offset 0x918
-        CMPB,*<>        %r3,%r0,$0006000C       ;offset 0x91c
-        DEPD    %r23,31,32,%r5  ;offset 0x920
-        MOVIB,TR        -1,%r29,$00060002       ;offset 0x924
-        EXTRD,U %r29,31,32,%r28 ;offset 0x928
-$0006002A
-        LDO     -1(%r29),%r29   ;offset 0x92c
-        SUB     %r23,%r7,%r23   ;offset 0x930
-$00060024
-        SUB     %r4,%r31,%r25   ;offset 0x934
-        AND     %r25,%r19,%r26  ;offset 0x938
-        CMPB,*<>,N      %r0,%r26,$00060046      ;offset 0x93c
-        DEPD,Z  %r25,31,32,%r20 ;offset 0x940
-        OR      %r20,%r24,%r21  ;offset 0x944
-        CMPB,*<<,N      %r21,%r23,$0006002A     ;offset 0x948
-        SUB     %r31,%r2,%r31   ;offset 0x94c
-$00060046
-$0006002E
-        DEPD,Z  %r23,31,32,%r25 ;offset 0x950
-        EXTRD,U %r23,31,32,%r26 ;offset 0x954
-        AND     %r25,%r19,%r24  ;offset 0x958
-        ADD,L   %r31,%r26,%r31  ;offset 0x95c
-        CMPCLR,*>>=     %r5,%r24,%r0    ;offset 0x960
-        LDO     1(%r31),%r31    ;offset 0x964
-$00060032
-        CMPB,*<<=,N     %r31,%r4,$00060036      ;offset 0x968
-        LDO     -1(%r29),%r29   ;offset 0x96c
-        ADD,L   %r4,%r3,%r4     ;offset 0x970
-$00060036
-        ADDIB,=,N       -1,%r8,$D0      ;offset 0x974
-        SUB     %r5,%r24,%r28   ;offset 0x978
-$0006003A
-        SUB     %r4,%r31,%r24   ;offset 0x97c
-        SHRPD   %r24,%r28,32,%r4        ;offset 0x980
-        DEPD,Z  %r29,31,32,%r9  ;offset 0x984
-        DEPD,Z  %r28,31,32,%r5  ;offset 0x988
-$0006001C
-        EXTRD,U %r4,31,32,%r31  ;offset 0x98c
-        CMPB,*<>,N      %r31,%r2,$00060020      ;offset 0x990
-        MOVB,TR %r6,%r29,$D1    ;offset 0x994
-        STD     %r29,-152(%r30) ;offset 0x998
-$0006000C
-        EXTRD,U %r3,31,32,%r25  ;offset 0x99c
-        COPY    %r3,%r26        ;offset 0x9a0
-        EXTRD,U %r3,31,32,%r9   ;offset 0x9a4
-        EXTRD,U %r4,31,32,%r8   ;offset 0x9a8
-        .CALL   ARGW0=GR,ARGW1=GR,RTNVAL=GR     ;in=25,26;out=28;
-        B,L     BN_num_bits_word,%r2    ;offset 0x9ac
-        EXTRD,U %r5,31,32,%r7   ;offset 0x9b0
-        LDI     64,%r20 ;offset 0x9b4
-        DEPD    %r7,31,32,%r5   ;offset 0x9b8
-        DEPD    %r8,31,32,%r4   ;offset 0x9bc
-        DEPD    %r9,31,32,%r3   ;offset 0x9c0
-        CMPB,=  %r28,%r20,$00060012     ;offset 0x9c4
-        COPY    %r28,%r24       ;offset 0x9c8
-        MTSARCM %r24    ;offset 0x9cc
-        DEPDI,Z -1,%sar,1,%r19  ;offset 0x9d0
-        CMPB,*>>,N      %r4,%r19,$D2    ;offset 0x9d4
-$00060012
-        SUBI    64,%r24,%r31    ;offset 0x9d8
-        CMPCLR,*<<      %r4,%r3,%r0     ;offset 0x9dc
-        SUB     %r4,%r3,%r4     ;offset 0x9e0
-$00060016
-        CMPB,=  %r31,%r0,$0006001A      ;offset 0x9e4
-        COPY    %r0,%r9 ;offset 0x9e8
-        MTSARCM %r31    ;offset 0x9ec
-        DEPD,Z  %r3,%sar,64,%r3 ;offset 0x9f0
-        SUBI    64,%r31,%r26    ;offset 0x9f4
-        MTSAR   %r26    ;offset 0x9f8
-        SHRPD   %r4,%r5,%sar,%r4        ;offset 0x9fc
-        MTSARCM %r31    ;offset 0xa00
-        DEPD,Z  %r5,%sar,64,%r5 ;offset 0xa04
-$0006001A
-        DEPDI,Z -1,31,32,%r19   ;offset 0xa08
-        AND     %r3,%r19,%r29   ;offset 0xa0c
-        EXTRD,U %r29,31,32,%r2  ;offset 0xa10
-        DEPDI,Z -1,63,32,%r6    ;offset 0xa14
-        MOVIB,TR        2,%r8,$0006001C ;offset 0xa18
-        EXTRD,U %r3,63,32,%r7   ;offset 0xa1c
-$D2
-        ;--- not PIC    ADDIL   LR'__iob-$global$,%r27,%r1      ;offset 0xa20
-        ;--- not PIC    LDIL    LR'C$7,%r21     ;offset 0xa24
-        ;--- not PIC    LDO     RR'__iob-$global$+32(%r1),%r26  ;offset 0xa28
-        ;--- not PIC    .CALL   ARGW0=GR,ARGW1=GR,ARGW2=GR,RTNVAL=GR    ;in=24,25,26;out=28;
-        ;--- not PIC    B,L     fprintf,%r2     ;offset 0xa2c
-        ;--- not PIC    LDO     RR'C$7(%r21),%r25       ;offset 0xa30
-        .CALL           ;
-        B,L     abort,%r2       ;offset 0xa34
-        NOP             ;offset 0xa38
-        B       $D3     ;offset 0xa3c
-        LDW     -212(%r30),%r2  ;offset 0xa40
-$00060020
-        COPY    %r4,%r26        ;offset 0xa44
-        EXTRD,U %r4,31,32,%r25  ;offset 0xa48
-        COPY    %r2,%r24        ;offset 0xa4c
-        .CALL   ;in=23,24,25,26;out=20,21,22,28,29; (MILLICALL)
-        B,L     $$div2U,%r31    ;offset 0xa50
-        EXTRD,U %r2,31,32,%r23  ;offset 0xa54
-        DEPD    %r28,31,32,%r29 ;offset 0xa58
-$00060022
-        STD     %r29,-152(%r30) ;offset 0xa5c
-$D1
-        AND     %r5,%r19,%r24   ;offset 0xa60
-        EXTRD,U %r24,31,32,%r24 ;offset 0xa64
-        STW     %r2,-160(%r30)  ;offset 0xa68
-        STW     %r7,-128(%r30)  ;offset 0xa6c
-        FLDD    -152(%r30),%fr4 ;offset 0xa70
-        FLDD    -152(%r30),%fr7 ;offset 0xa74
-        FLDW    -160(%r30),%fr8L        ;offset 0xa78
-        FLDW    -128(%r30),%fr5L        ;offset 0xa7c
-        XMPYU   %fr8L,%fr7L,%fr10       ;offset 0xa80
-        FSTD    %fr10,-136(%r30)        ;offset 0xa84
-        XMPYU   %fr8L,%fr7R,%fr22       ;offset 0xa88
-        FSTD    %fr22,-144(%r30)        ;offset 0xa8c
-        XMPYU   %fr5L,%fr4L,%fr11       ;offset 0xa90
-        XMPYU   %fr5L,%fr4R,%fr23       ;offset 0xa94
-        FSTD    %fr11,-112(%r30)        ;offset 0xa98
-        FSTD    %fr23,-120(%r30)        ;offset 0xa9c
-        LDD     -136(%r30),%r28 ;offset 0xaa0
-        DEPD,Z  %r28,31,32,%r31 ;offset 0xaa4
-        LDD     -144(%r30),%r20 ;offset 0xaa8
-        ADD,L   %r20,%r31,%r31  ;offset 0xaac
-        LDD     -112(%r30),%r22 ;offset 0xab0
-        DEPD,Z  %r22,31,32,%r22 ;offset 0xab4
-        LDD     -120(%r30),%r21 ;offset 0xab8
-        B       $00060024       ;offset 0xabc
-        ADD,L   %r21,%r22,%r23  ;offset 0xac0
-$D0
-        OR      %r9,%r29,%r29   ;offset 0xac4
-$00060040
-        EXTRD,U %r29,31,32,%r28 ;offset 0xac8
-$00060002
-$L2
-        LDW     -212(%r30),%r2  ;offset 0xacc
-$D3
-        LDW     -168(%r30),%r9  ;offset 0xad0
-        LDD     -176(%r30),%r8  ;offset 0xad4
-        EXTRD,U %r8,31,32,%r7   ;offset 0xad8
-        LDD     -184(%r30),%r6  ;offset 0xadc
-        EXTRD,U %r6,31,32,%r5   ;offset 0xae0
-        LDW     -188(%r30),%r4  ;offset 0xae4
-        BVE     (%r2)   ;offset 0xae8
-        .EXIT
-        LDW,MB  -192(%r30),%r3  ;offset 0xaec
-        .PROCEND        ;in=23,25;out=28,29;fpin=105,107;
-;----------------------------------------------------------------------------
-;
-; Registers to hold 64-bit values to manipulate.  The "L" part
-; of the register corresponds to the upper 32-bits, while the "R"
-; part corresponds to the lower 32-bits
-; 
-; Note, that when using b6 and b7, the code must save these before
-; using them because they are callee save registers 
-; 
-;
-; Floating point registers to use to save values that
-; are manipulated.  These don't collide with ftemp1-6 and
-; are all caller save registers
-;
-a0        .reg %fr22
-a0L       .reg %fr22L
-a0R       .reg %fr22R
-a1        .reg %fr23
-a1L       .reg %fr23L
-a1R       .reg %fr23R
-a2        .reg %fr24
-a2L       .reg %fr24L
-a2R       .reg %fr24R
-a3        .reg %fr25
-a3L       .reg %fr25L
-a3R       .reg %fr25R
-a4        .reg %fr26
-a4L       .reg %fr26L
-a4R       .reg %fr26R
-a5        .reg %fr27
-a5L       .reg %fr27L
-a5R       .reg %fr27R
-a6        .reg %fr28
-a6L       .reg %fr28L
-a6R       .reg %fr28R
-a7        .reg %fr29
-a7L       .reg %fr29L
-a7R       .reg %fr29R
-b0        .reg %fr30
-b0L       .reg %fr30L
-b0R       .reg %fr30R
-b1        .reg %fr31
-b1L       .reg %fr31L
-b1R       .reg %fr31R
-;
-; Temporary floating point variables, these are all caller save
-; registers
-;
-ftemp1    .reg %fr4
-ftemp2    .reg %fr5
-ftemp3    .reg %fr6
-ftemp4    .reg %fr7
-;
-; The B set of registers when used.
-;
-b2        .reg %fr8
-b2L       .reg %fr8L
-b2R       .reg %fr8R
-b3        .reg %fr9
-b3L       .reg %fr9L
-b3R       .reg %fr9R
-b4        .reg %fr10
-b4L       .reg %fr10L
-b4R       .reg %fr10R
-b5        .reg %fr11
-b5L       .reg %fr11L
-b5R       .reg %fr11R
-b6        .reg %fr12
-b6L       .reg %fr12L
-b6R       .reg %fr12R
-b7        .reg %fr13
-b7L       .reg %fr13L
-b7R       .reg %fr13R
-c1           .reg %r21   ; only reg
-temp1        .reg %r20   ; only reg
-temp2        .reg %r19   ; only reg
-temp3        .reg %r31   ; only reg
-m1           .reg %r28   
-c2           .reg %r23   
-high_one     .reg %r1
-ht           .reg %r6
-lt           .reg %r5
-m            .reg %r4
-c3           .reg %r3
-SQR_ADD_C  .macro  A0L,A0R,C1,C2,C3
-    XMPYU   A0L,A0R,ftemp1       ; m
-    FSTD    ftemp1,-24(%sp)      ; store m
-    XMPYU   A0R,A0R,ftemp2       ; lt
-    FSTD    ftemp2,-16(%sp)      ; store lt
-    XMPYU   A0L,A0L,ftemp3       ; ht
-    FSTD    ftemp3,-8(%sp)       ; store ht
-    LDD     -24(%sp),m           ; load m
-    AND     m,high_mask,temp2    ; m & Mask
-    DEPD,Z  m,30,31,temp3        ; m << 32+1
-    LDD     -16(%sp),lt          ; lt
-    LDD     -8(%sp),ht           ; ht
-    EXTRD,U temp2,32,33,temp1    ; temp1 = m&Mask >> 32-1
-    ADD     temp3,lt,lt          ; lt = lt+m
-    ADD,L   ht,temp1,ht          ; ht += temp1
-    ADD,DC  ht,%r0,ht            ; ht++
-    ADD     C1,lt,C1             ; c1=c1+lt
-    ADD,DC  ht,%r0,ht            ; ht++
-    ADD     C2,ht,C2             ; c2=c2+ht
-    ADD,DC  C3,%r0,C3            ; c3++
-.endm
-SQR_ADD_C2 .macro  A0L,A0R,A1L,A1R,C1,C2,C3
-    XMPYU   A0L,A1R,ftemp1          ; m1 = bl*ht
-    FSTD    ftemp1,-16(%sp)         ;
-    XMPYU   A0R,A1L,ftemp2          ; m = bh*lt
-    FSTD    ftemp2,-8(%sp)          ;
-    XMPYU   A0R,A1R,ftemp3          ; lt = bl*lt
-    FSTD    ftemp3,-32(%sp)
-    XMPYU   A0L,A1L,ftemp4          ; ht = bh*ht
-    FSTD    ftemp4,-24(%sp)         ;
-    LDD     -8(%sp),m               ; r21 = m
-    LDD     -16(%sp),m1             ; r19 = m1
-    ADD,L   m,m1,m                  ; m+m1
-    DEPD,Z  m,31,32,temp3           ; (m+m1<<32)
-    LDD     -24(%sp),ht             ; r24 = ht
-    CMPCLR,*>>= m,m1,%r0            ; if (m < m1)
-    ADD,L   ht,high_one,ht          ; ht+=high_one
-    EXTRD,U m,31,32,temp1           ; m >> 32
-    LDD     -32(%sp),lt             ; lt
-    ADD,L   ht,temp1,ht             ; ht+= m>>32
-    ADD     lt,temp3,lt             ; lt = lt+m1
-    ADD,DC  ht,%r0,ht               ; ht++
-    ADD     ht,ht,ht                ; ht=ht+ht;
-    ADD,DC  C3,%r0,C3               ; add in carry (c3++)
-    ADD     lt,lt,lt                ; lt=lt+lt;
-    ADD,DC  ht,%r0,ht               ; add in carry (ht++)
-    ADD     C1,lt,C1                ; c1=c1+lt
-    ADD,DC,*NUV ht,%r0,ht           ; add in carry (ht++)
-    LDO     1(C3),C3              ; bump c3 if overflow,nullify otherwise
-    ADD     C2,ht,C2                ; c2 = c2 + ht
-    ADD,DC  C3,%r0,C3             ; add in carry (c3++)
-.endm
-;
-;void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
-; arg0 = r_ptr
-; arg1 = a_ptr
-;
-bn_sqr_comba8
-        .PROC
-        .CALLINFO FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_sqr_comba8,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .ENTRY
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z -1,32,33,high_mask   ; Create Mask 0xffffffff80000000L
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD     0(a_ptr),a0       
-    FLDD     8(a_ptr),a1       
-    FLDD    16(a_ptr),a2       
-    FLDD    24(a_ptr),a3       
-    FLDD    32(a_ptr),a4       
-    FLDD    40(a_ptr),a5       
-    FLDD    48(a_ptr),a6       
-    FLDD    56(a_ptr),a7       
-        SQR_ADD_C a0L,a0R,c1,c2,c3
-        STD     c1,0(r_ptr)          ; r[0] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a1L,a1R,a0L,a0R,c2,c3,c1
-        STD     c2,8(r_ptr)          ; r[1] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a1L,a1R,c3,c1,c2
-        SQR_ADD_C2 a2L,a2R,a0L,a0R,c3,c1,c2
-        STD     c3,16(r_ptr)            ; r[2] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C2 a3L,a3R,a0L,a0R,c1,c2,c3
-        SQR_ADD_C2 a2L,a2R,a1L,a1R,c1,c2,c3
-        STD     c1,24(r_ptr)           ; r[3] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C a2L,a2R,c2,c3,c1
-        SQR_ADD_C2 a3L,a3R,a1L,a1R,c2,c3,c1
-        SQR_ADD_C2 a4L,a4R,a0L,a0R,c2,c3,c1
-        STD     c2,32(r_ptr)          ; r[4] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C2 a5L,a5R,a0L,a0R,c3,c1,c2
-        SQR_ADD_C2 a4L,a4R,a1L,a1R,c3,c1,c2
-        SQR_ADD_C2 a3L,a3R,a2L,a2R,c3,c1,c2
-        STD     c3,40(r_ptr)          ; r[5] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C a3L,a3R,c1,c2,c3
-        SQR_ADD_C2 a4L,a4R,a2L,a2R,c1,c2,c3
-        SQR_ADD_C2 a5L,a5R,a1L,a1R,c1,c2,c3
-        SQR_ADD_C2 a6L,a6R,a0L,a0R,c1,c2,c3
-        STD     c1,48(r_ptr)          ; r[6] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a7L,a7R,a0L,a0R,c2,c3,c1
-        SQR_ADD_C2 a6L,a6R,a1L,a1R,c2,c3,c1
-        SQR_ADD_C2 a5L,a5R,a2L,a2R,c2,c3,c1
-        SQR_ADD_C2 a4L,a4R,a3L,a3R,c2,c3,c1
-        STD     c2,56(r_ptr)          ; r[7] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a4L,a4R,c3,c1,c2
-        SQR_ADD_C2 a5L,a5R,a3L,a3R,c3,c1,c2
-        SQR_ADD_C2 a6L,a6R,a2L,a2R,c3,c1,c2
-        SQR_ADD_C2 a7L,a7R,a1L,a1R,c3,c1,c2
-        STD     c3,64(r_ptr)          ; r[8] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C2 a7L,a7R,a2L,a2R,c1,c2,c3
-        SQR_ADD_C2 a6L,a6R,a3L,a3R,c1,c2,c3
-        SQR_ADD_C2 a5L,a5R,a4L,a4R,c1,c2,c3
-        STD     c1,72(r_ptr)          ; r[9] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C a5L,a5R,c2,c3,c1
-        SQR_ADD_C2 a6L,a6R,a4L,a4R,c2,c3,c1
-        SQR_ADD_C2 a7L,a7R,a3L,a3R,c2,c3,c1
-        STD     c2,80(r_ptr)          ; r[10] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C2 a7L,a7R,a4L,a4R,c3,c1,c2
-        SQR_ADD_C2 a6L,a6R,a5L,a5R,c3,c1,c2
-        STD     c3,88(r_ptr)          ; r[11] = c3;
-        COPY    %r0,c3
-        
-        SQR_ADD_C a6L,a6R,c1,c2,c3
-        SQR_ADD_C2 a7L,a7R,a5L,a5R,c1,c2,c3
-        STD     c1,96(r_ptr)          ; r[12] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a7L,a7R,a6L,a6R,c2,c3,c1
-        STD     c2,104(r_ptr)         ; r[13] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a7L,a7R,c3,c1,c2
-        STD     c3, 112(r_ptr)       ; r[14] = c3
-        STD     c1, 120(r_ptr)       ; r[15] = c1
-    .EXIT
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;-----------------------------------------------------------------------------
-;
-;void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a)
-; arg0 = r_ptr
-; arg1 = a_ptr
-;
-bn_sqr_comba4
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_sqr_comba4,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z -1,32,33,high_mask   ; Create Mask 0xffffffff80000000L
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD     0(a_ptr),a0       
-    FLDD     8(a_ptr),a1       
-    FLDD    16(a_ptr),a2       
-    FLDD    24(a_ptr),a3       
-    FLDD    32(a_ptr),a4       
-    FLDD    40(a_ptr),a5       
-    FLDD    48(a_ptr),a6       
-    FLDD    56(a_ptr),a7       
-        SQR_ADD_C a0L,a0R,c1,c2,c3
-        STD     c1,0(r_ptr)          ; r[0] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a1L,a1R,a0L,a0R,c2,c3,c1
-        STD     c2,8(r_ptr)          ; r[1] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a1L,a1R,c3,c1,c2
-        SQR_ADD_C2 a2L,a2R,a0L,a0R,c3,c1,c2
-        STD     c3,16(r_ptr)            ; r[2] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C2 a3L,a3R,a0L,a0R,c1,c2,c3
-        SQR_ADD_C2 a2L,a2R,a1L,a1R,c1,c2,c3
-        STD     c1,24(r_ptr)           ; r[3] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C a2L,a2R,c2,c3,c1
-        SQR_ADD_C2 a3L,a3R,a1L,a1R,c2,c3,c1
-        STD     c2,32(r_ptr)           ; r[4] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C2 a3L,a3R,a2L,a2R,c3,c1,c2
-        STD     c3,40(r_ptr)           ; r[5] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C a3L,a3R,c1,c2,c3
-        STD     c1,48(r_ptr)           ; r[6] = c1;
-        STD     c2,56(r_ptr)           ; r[7] = c2;
-    .EXIT
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;---------------------------------------------------------------------------
-MUL_ADD_C  .macro  A0L,A0R,B0L,B0R,C1,C2,C3
-    XMPYU   A0L,B0R,ftemp1        ; m1 = bl*ht
-    FSTD    ftemp1,-16(%sp)       ;
-    XMPYU   A0R,B0L,ftemp2        ; m = bh*lt
-    FSTD    ftemp2,-8(%sp)        ;
-    XMPYU   A0R,B0R,ftemp3        ; lt = bl*lt
-    FSTD    ftemp3,-32(%sp)
-    XMPYU   A0L,B0L,ftemp4        ; ht = bh*ht
-    FSTD    ftemp4,-24(%sp)       ;
-    LDD     -8(%sp),m             ; r21 = m
-    LDD     -16(%sp),m1           ; r19 = m1
-    ADD,L   m,m1,m                ; m+m1
-    DEPD,Z  m,31,32,temp3         ; (m+m1<<32)
-    LDD     -24(%sp),ht           ; r24 = ht
-    CMPCLR,*>>= m,m1,%r0          ; if (m < m1)
-    ADD,L   ht,high_one,ht        ; ht+=high_one
-    EXTRD,U m,31,32,temp1         ; m >> 32
-    LDD     -32(%sp),lt           ; lt
-    ADD,L   ht,temp1,ht           ; ht+= m>>32
-    ADD     lt,temp3,lt           ; lt = lt+m1
-    ADD,DC  ht,%r0,ht             ; ht++
-    ADD     C1,lt,C1              ; c1=c1+lt
-    ADD,DC  ht,%r0,ht             ; bump c3 if overflow,nullify otherwise
-    ADD     C2,ht,C2              ; c2 = c2 + ht
-    ADD,DC  C3,%r0,C3             ; add in carry (c3++)
-.endm
-;
-;void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-; arg0 = r_ptr
-; arg1 = a_ptr
-; arg2 = b_ptr
-;
-bn_mul_comba8
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_mul_comba8,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-    FSTD    %fr12,32(%sp)       ; save r6
-    FSTD    %fr13,40(%sp)       ; save r7
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD      0(a_ptr),a0       
-    FLDD      8(a_ptr),a1       
-    FLDD     16(a_ptr),a2       
-    FLDD     24(a_ptr),a3       
-    FLDD     32(a_ptr),a4       
-    FLDD     40(a_ptr),a5       
-    FLDD     48(a_ptr),a6       
-    FLDD     56(a_ptr),a7       
-    FLDD      0(b_ptr),b0       
-    FLDD      8(b_ptr),b1       
-    FLDD     16(b_ptr),b2       
-    FLDD     24(b_ptr),b3       
-    FLDD     32(b_ptr),b4       
-    FLDD     40(b_ptr),b5       
-    FLDD     48(b_ptr),b6       
-    FLDD     56(b_ptr),b7       
-        MUL_ADD_C a0L,a0R,b0L,b0R,c1,c2,c3
-        STD       c1,0(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a0L,a0R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b0L,b0R,c2,c3,c1
-        STD       c2,8(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a2L,a2R,b0L,b0R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a0L,a0R,b2L,b2R,c3,c1,c2
-        STD       c3,16(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a0L,a0R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a1L,a1R,b2L,b2R,c1,c2,c3
-        MUL_ADD_C a2L,a2R,b1L,b1R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b0L,b0R,c1,c2,c3
-        STD       c1,24(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a4L,a4R,b0L,b0R,c2,c3,c1
-        MUL_ADD_C a3L,a3R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a2L,a2R,b2L,b2R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b3L,b3R,c2,c3,c1
-        MUL_ADD_C a0L,a0R,b4L,b4R,c2,c3,c1
-        STD       c2,32(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a0L,a0R,b5L,b5R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b4L,b4R,c3,c1,c2
-        MUL_ADD_C a2L,a2R,b3L,b3R,c3,c1,c2
-        MUL_ADD_C a3L,a3R,b2L,b2R,c3,c1,c2
-        MUL_ADD_C a4L,a4R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a5L,a5R,b0L,b0R,c3,c1,c2
-        STD       c3,40(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a6L,a6R,b0L,b0R,c1,c2,c3
-        MUL_ADD_C a5L,a5R,b1L,b1R,c1,c2,c3
-        MUL_ADD_C a4L,a4R,b2L,b2R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a2L,a2R,b4L,b4R,c1,c2,c3
-        MUL_ADD_C a1L,a1R,b5L,b5R,c1,c2,c3
-        MUL_ADD_C a0L,a0R,b6L,b6R,c1,c2,c3
-        STD       c1,48(r_ptr)
-        COPY      %r0,c1
-        
-        MUL_ADD_C a0L,a0R,b7L,b7R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b6L,b6R,c2,c3,c1
-        MUL_ADD_C a2L,a2R,b5L,b5R,c2,c3,c1
-        MUL_ADD_C a3L,a3R,b4L,b4R,c2,c3,c1
-        MUL_ADD_C a4L,a4R,b3L,b3R,c2,c3,c1
-        MUL_ADD_C a5L,a5R,b2L,b2R,c2,c3,c1
-        MUL_ADD_C a6L,a6R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a7L,a7R,b0L,b0R,c2,c3,c1
-        STD       c2,56(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a7L,a7R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a6L,a6R,b2L,b2R,c3,c1,c2
-        MUL_ADD_C a5L,a5R,b3L,b3R,c3,c1,c2
-        MUL_ADD_C a4L,a4R,b4L,b4R,c3,c1,c2
-        MUL_ADD_C a3L,a3R,b5L,b5R,c3,c1,c2
-        MUL_ADD_C a2L,a2R,b6L,b6R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b7L,b7R,c3,c1,c2
-        STD       c3,64(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a2L,a2R,b7L,b7R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b6L,b6R,c1,c2,c3
-        MUL_ADD_C a4L,a4R,b5L,b5R,c1,c2,c3
-        MUL_ADD_C a5L,a5R,b4L,b4R,c1,c2,c3
-        MUL_ADD_C a6L,a6R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a7L,a7R,b2L,b2R,c1,c2,c3
-        STD       c1,72(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a7L,a7R,b3L,b3R,c2,c3,c1
-        MUL_ADD_C a6L,a6R,b4L,b4R,c2,c3,c1
-        MUL_ADD_C a5L,a5R,b5L,b5R,c2,c3,c1
-        MUL_ADD_C a4L,a4R,b6L,b6R,c2,c3,c1
-        MUL_ADD_C a3L,a3R,b7L,b7R,c2,c3,c1
-        STD       c2,80(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a4L,a4R,b7L,b7R,c3,c1,c2
-        MUL_ADD_C a5L,a5R,b6L,b6R,c3,c1,c2
-        MUL_ADD_C a6L,a6R,b5L,b5R,c3,c1,c2
-        MUL_ADD_C a7L,a7R,b4L,b4R,c3,c1,c2
-        STD       c3,88(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a7L,a7R,b5L,b5R,c1,c2,c3
-        MUL_ADD_C a6L,a6R,b6L,b6R,c1,c2,c3
-        MUL_ADD_C a5L,a5R,b7L,b7R,c1,c2,c3
-        STD       c1,96(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a6L,a6R,b7L,b7R,c2,c3,c1
-        MUL_ADD_C a7L,a7R,b6L,b6R,c2,c3,c1
-        STD       c2,104(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a7L,a7R,b7L,b7R,c3,c1,c2
-        STD       c3,112(r_ptr)
-        STD       c1,120(r_ptr)
-    .EXIT
-    FLDD    -88(%sp),%fr13 
-    FLDD    -96(%sp),%fr12 
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;-----------------------------------------------------------------------------
-;
-;void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-; arg0 = r_ptr
-; arg1 = a_ptr
-; arg2 = b_ptr
-;
-bn_mul_comba4
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_mul_comba4,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-    FSTD    %fr12,32(%sp)       ; save r6
-    FSTD    %fr13,40(%sp)       ; save r7
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD      0(a_ptr),a0       
-    FLDD      8(a_ptr),a1       
-    FLDD     16(a_ptr),a2       
-    FLDD     24(a_ptr),a3       
-    FLDD      0(b_ptr),b0       
-    FLDD      8(b_ptr),b1       
-    FLDD     16(b_ptr),b2       
-    FLDD     24(b_ptr),b3       
-        MUL_ADD_C a0L,a0R,b0L,b0R,c1,c2,c3
-        STD       c1,0(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a0L,a0R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b0L,b0R,c2,c3,c1
-        STD       c2,8(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a2L,a2R,b0L,b0R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a0L,a0R,b2L,b2R,c3,c1,c2
-        STD       c3,16(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a0L,a0R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a1L,a1R,b2L,b2R,c1,c2,c3
-        MUL_ADD_C a2L,a2R,b1L,b1R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b0L,b0R,c1,c2,c3
-        STD       c1,24(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a3L,a3R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a2L,a2R,b2L,b2R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b3L,b3R,c2,c3,c1
-        STD       c2,32(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a2L,a2R,b3L,b3R,c3,c1,c2
-        MUL_ADD_C a3L,a3R,b2L,b2R,c3,c1,c2
-        STD       c3,40(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a3L,a3R,b3L,b3R,c1,c2,c3
-        STD       c1,48(r_ptr)
-        STD       c2,56(r_ptr)
-    .EXIT
-    FLDD    -88(%sp),%fr13 
-    FLDD    -96(%sp),%fr12 
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;--- not PIC    .SPACE  $TEXT$
-;--- not PIC    .SUBSPA $CODE$
-;--- not PIC    .SPACE  $PRIVATE$,SORT=16
-;--- not PIC    .IMPORT $global$,DATA
-;--- not PIC    .SPACE  $TEXT$
-;--- not PIC    .SUBSPA $CODE$
-;--- not PIC    .SUBSPA $LIT$,ACCESS=0x2c
-;--- not PIC    C$7
-;--- not PIC    .ALIGN  8
-;--- not PIC    .STRINGZ        "Division would overflow (%d)\n"
-        .END
diff --git a/src/lib/libcrypto/bn/asm/pa-risc2W.s b/src/lib/libcrypto/bn/asm/pa-risc2W.s
deleted file mode 100644
index a99545754d..0000000000
--- a/src/lib/libcrypto/bn/asm/pa-risc2W.s
+++ /dev/null
@@ -1,1605 +0,0 @@
-;
-; PA-RISC 64-bit implementation of bn_asm code
-;
-; This code is approximately 2x faster than the C version
-; for RSA/DSA.
-;
-; See http://devresource.hp.com/  for more details on the PA-RISC
-; architecture.  Also see the book "PA-RISC 2.0 Architecture"
-; by Gerry Kane for information on the instruction set architecture.
-;
-; Code written by Chris Ruemmler (with some help from the HP C
-; compiler).
-;
-; The code compiles with HP's assembler
-;
-        .level  2.0W
-        .space  $TEXT$
-        .subspa $CODE$,QUAD=0,ALIGN=8,ACCESS=0x2c,CODE_ONLY
-;
-; Global Register definitions used for the routines.
-;
-; Some information about HP's runtime architecture for 64-bits.
-;
-; "Caller save" means the calling function must save the register
-; if it wants the register to be preserved.
-; "Callee save" means if a function uses the register, it must save
-; the value before using it.
-;
-; For the floating point registers 
-;
-;    "caller save" registers: fr4-fr11, fr22-fr31
-;    "callee save" registers: fr12-fr21
-;    "special" registers: fr0-fr3 (status and exception registers)
-;
-; For the integer registers
-;     value zero             :  r0
-;     "caller save" registers: r1,r19-r26
-;     "callee save" registers: r3-r18
-;     return register        :  r2  (rp)
-;     return values          ; r28  (ret0,ret1)
-;     Stack pointer          ; r30  (sp) 
-;     global data pointer    ; r27  (dp)
-;     argument pointer       ; r29  (ap)
-;     millicode return ptr   ; r31  (also a caller save register)
-;
-; Arguments to the routines
-;
-r_ptr       .reg %r26
-a_ptr       .reg %r25
-b_ptr       .reg %r24
-num         .reg %r24
-w           .reg %r23
-n           .reg %r23
-;
-; Globals used in some routines
-;
-top_overflow .reg %r29
-high_mask    .reg %r22    ; value 0xffffffff80000000L
-;------------------------------------------------------------------------------
-;
-; bn_mul_add_words
-;
-;BN_ULONG bn_mul_add_words(BN_ULONG *r_ptr, BN_ULONG *a_ptr, 
-;                                                               int num, BN_ULONG w)
-;
-; arg0 = r_ptr
-; arg1 = a_ptr
-; arg2 = num
-; arg3 = w
-;
-; Local register definitions
-;
-fm1          .reg %fr22
-fm           .reg %fr23
-ht_temp      .reg %fr24
-ht_temp_1    .reg %fr25
-lt_temp      .reg %fr26
-lt_temp_1    .reg %fr27
-fm1_1        .reg %fr28
-fm_1         .reg %fr29
-fw_h         .reg %fr7L
-fw_l         .reg %fr7R
-fw           .reg %fr7
-fht_0        .reg %fr8L
-flt_0        .reg %fr8R
-t_float_0    .reg %fr8
-fht_1        .reg %fr9L
-flt_1        .reg %fr9R
-t_float_1    .reg %fr9
-tmp_0        .reg %r31
-tmp_1        .reg %r21
-m_0          .reg %r20 
-m_1          .reg %r19 
-ht_0         .reg %r1  
-ht_1         .reg %r3
-lt_0         .reg %r4
-lt_1         .reg %r5
-m1_0         .reg %r6 
-m1_1         .reg %r7 
-rp_val       .reg %r8
-rp_val_1     .reg %r9
-bn_mul_add_words
-        .export bn_mul_add_words,entry,NO_RELOCATION,LONG_RETURN
-        .proc
-        .callinfo frame=128
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3  
-    STD     %r4,8(%sp)          ; save r4  
-        NOP                         ; Needed to make the loop 16-byte aligned
-        NOP                         ; Needed to make the loop 16-byte aligned
-    STD     %r5,16(%sp)         ; save r5  
-    STD     %r6,24(%sp)         ; save r6  
-    STD     %r7,32(%sp)         ; save r7  
-    STD     %r8,40(%sp)         ; save r8  
-    STD     %r9,48(%sp)         ; save r9  
-    COPY    %r0,%ret0           ; return 0 by default
-    DEPDI,Z 1,31,1,top_overflow ; top_overflow = 1 << 32    
-        STD     w,56(%sp)           ; store w on stack
-    CMPIB,>= 0,num,bn_mul_add_words_exit  ; if (num <= 0) then exit
-        LDO     128(%sp),%sp       ; bump stack
-        ;
-        ; The loop is unrolled twice, so if there is only 1 number
-    ; then go straight to the cleanup code.
-        ;
-        CMPIB,= 1,num,bn_mul_add_words_single_top
-        FLDD    -72(%sp),fw     ; load up w into fp register fw (fw_h/fw_l)
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-        ; PA-RISC 2.0 chips have two fully pipelined multipliers, thus
-    ; two 32-bit mutiplies can be issued per cycle.
-    ; 
-bn_mul_add_words_unroll2
-    FLDD    0(a_ptr),t_float_0       ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    FLDD    8(a_ptr),t_float_1       ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    LDD     0(r_ptr),rp_val          ; rp[0]
-    LDD     8(r_ptr),rp_val_1        ; rp[1]
-    XMPYU   fht_0,fw_l,fm1           ; m1[0] = fht_0*fw_l
-    XMPYU   fht_1,fw_l,fm1_1         ; m1[1] = fht_1*fw_l
-    FSTD    fm1,-16(%sp)             ; -16(sp) = m1[0]
-    FSTD    fm1_1,-48(%sp)           ; -48(sp) = m1[1]
-    XMPYU   flt_0,fw_h,fm            ; m[0] = flt_0*fw_h
-    XMPYU   flt_1,fw_h,fm_1          ; m[1] = flt_1*fw_h
-    FSTD    fm,-8(%sp)               ; -8(sp) = m[0]
-    FSTD    fm_1,-40(%sp)            ; -40(sp) = m[1]
-    XMPYU   fht_0,fw_h,ht_temp       ; ht_temp   = fht_0*fw_h
-    XMPYU   fht_1,fw_h,ht_temp_1     ; ht_temp_1 = fht_1*fw_h
-    FSTD    ht_temp,-24(%sp)         ; -24(sp)   = ht_temp
-    FSTD    ht_temp_1,-56(%sp)       ; -56(sp)   = ht_temp_1
-    XMPYU   flt_0,fw_l,lt_temp       ; lt_temp = lt*fw_l
-    XMPYU   flt_1,fw_l,lt_temp_1     ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)         ; -32(sp) = lt_temp 
-    FSTD    lt_temp_1,-64(%sp)       ; -64(sp) = lt_temp_1 
-    LDD     -8(%sp),m_0              ; m[0] 
-    LDD     -40(%sp),m_1             ; m[1]
-    LDD     -16(%sp),m1_0            ; m1[0]
-    LDD     -48(%sp),m1_1            ; m1[1]
-    LDD     -24(%sp),ht_0            ; ht[0]
-    LDD     -56(%sp),ht_1            ; ht[1]
-    ADD,L   m1_0,m_0,tmp_0           ; tmp_0 = m[0] + m1[0]; 
-    ADD,L   m1_1,m_1,tmp_1           ; tmp_1 = m[1] + m1[1]; 
-    LDD     -32(%sp),lt_0            
-    LDD     -64(%sp),lt_1            
-    CMPCLR,*>>= tmp_0,m1_0, %r0      ; if (m[0] < m1[0])
-    ADD,L   ht_0,top_overflow,ht_0   ; ht[0] += (1<<32)
-    CMPCLR,*>>= tmp_1,m1_1,%r0       ; if (m[1] < m1[1])
-    ADD,L   ht_1,top_overflow,ht_1   ; ht[1] += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0          ; m[0]>>32  
-    DEPD,Z  tmp_0,31,32,m1_0         ; m1[0] = m[0]<<32 
-    EXTRD,U tmp_1,31,32,m_1          ; m[1]>>32  
-    DEPD,Z  tmp_1,31,32,m1_1         ; m1[1] = m[1]<<32 
-    ADD,L   ht_0,m_0,ht_0            ; ht[0]+= (m[0]>>32)
-    ADD,L   ht_1,m_1,ht_1            ; ht[1]+= (m[1]>>32)
-    ADD     lt_0,m1_0,lt_0           ; lt[0] = lt[0]+m1[0];
-        ADD,DC  ht_0,%r0,ht_0            ; ht[0]++
-    ADD     lt_1,m1_1,lt_1           ; lt[1] = lt[1]+m1[1];
-    ADD,DC  ht_1,%r0,ht_1            ; ht[1]++
-    ADD    %ret0,lt_0,lt_0           ; lt[0] = lt[0] + c;
-        ADD,DC  ht_0,%r0,ht_0            ; ht[0]++
-    ADD     lt_0,rp_val,lt_0         ; lt[0] = lt[0]+rp[0]
-    ADD,DC  ht_0,%r0,ht_0            ; ht[0]++
-        LDO    -2(num),num               ; num = num - 2;
-    ADD     ht_0,lt_1,lt_1           ; lt[1] = lt[1] + ht_0 (c);
-    ADD,DC  ht_1,%r0,ht_1            ; ht[1]++
-    STD     lt_0,0(r_ptr)            ; rp[0] = lt[0]
-    ADD     lt_1,rp_val_1,lt_1       ; lt[1] = lt[1]+rp[1]
-    ADD,DC  ht_1,%r0,%ret0           ; ht[1]++
-    LDO     16(a_ptr),a_ptr          ; a_ptr += 2
-    STD     lt_1,8(r_ptr)            ; rp[1] = lt[1]
-        CMPIB,<= 2,num,bn_mul_add_words_unroll2 ; go again if more to do
-    LDO     16(r_ptr),r_ptr          ; r_ptr += 2
-    CMPIB,=,N 0,num,bn_mul_add_words_exit ; are we done, or cleanup last one
-        ;
-        ; Top of loop aligned on 64-byte boundary
-        ;
-bn_mul_add_words_single_top
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    LDD     0(r_ptr),rp_val           ; rp[0]
-    LDO     8(a_ptr),a_ptr            ; a_ptr++
-    XMPYU   fht_0,fw_l,fm1            ; m1 = ht*fw_l
-    FSTD    fm1,-16(%sp)              ; -16(sp) = m1
-    XMPYU   flt_0,fw_h,fm             ; m = lt*fw_h
-    FSTD    fm,-8(%sp)                ; -8(sp) = m
-    XMPYU   fht_0,fw_h,ht_temp        ; ht_temp = ht*fw_h
-    FSTD    ht_temp,-24(%sp)          ; -24(sp) = ht
-    XMPYU   flt_0,fw_l,lt_temp        ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)          ; -32(sp) = lt 
-    LDD     -8(%sp),m_0               
-    LDD    -16(%sp),m1_0              ; m1 = temp1 
-    ADD,L   m_0,m1_0,tmp_0            ; tmp_0 = m + m1; 
-    LDD     -24(%sp),ht_0             
-    LDD     -32(%sp),lt_0             
-    CMPCLR,*>>= tmp_0,m1_0,%r0        ; if (m < m1)
-    ADD,L   ht_0,top_overflow,ht_0    ; ht += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0           ; m>>32  
-    DEPD,Z  tmp_0,31,32,m1_0          ; m1 = m<<32 
-    ADD,L   ht_0,m_0,ht_0             ; ht+= (m>>32)
-    ADD     lt_0,m1_0,tmp_0           ; tmp_0 = lt+m1;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     %ret0,tmp_0,lt_0          ; lt = lt + c;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     lt_0,rp_val,lt_0          ; lt = lt+rp[0]
-    ADD,DC  ht_0,%r0,%ret0            ; ht++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-bn_mul_add_words_exit
-    .EXIT
-    LDD     -80(%sp),%r9              ; restore r9  
-    LDD     -88(%sp),%r8              ; restore r8  
-    LDD     -96(%sp),%r7              ; restore r7  
-    LDD     -104(%sp),%r6             ; restore r6  
-    LDD     -112(%sp),%r5             ; restore r5  
-    LDD     -120(%sp),%r4             ; restore r4  
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3             ; restore r3
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-;
-; arg0 = rp
-; arg1 = ap
-; arg2 = num
-; arg3 = w
-bn_mul_words
-        .proc
-        .callinfo frame=128
-    .entry
-        .EXPORT bn_mul_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-        .align 64
-    STD     %r3,0(%sp)          ; save r3  
-    STD     %r4,8(%sp)          ; save r4  
-    STD     %r5,16(%sp)         ; save r5  
-    STD     %r6,24(%sp)         ; save r6  
-    STD     %r7,32(%sp)         ; save r7  
-    COPY    %r0,%ret0           ; return 0 by default
-    DEPDI,Z 1,31,1,top_overflow ; top_overflow = 1 << 32    
-        STD     w,56(%sp)           ; w on stack
-    CMPIB,>= 0,num,bn_mul_words_exit
-        LDO     128(%sp),%sp       ; bump stack
-        ;
-        ; See if only 1 word to do, thus just do cleanup
-        ;
-        CMPIB,= 1,num,bn_mul_words_single_top
-        FLDD    -72(%sp),fw     ; load up w into fp register fw (fw_h/fw_l)
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-        ; PA-RISC 2.0 chips have two fully pipelined multipliers, thus
-    ; two 32-bit mutiplies can be issued per cycle.
-    ; 
-bn_mul_words_unroll2
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    FLDD    8(a_ptr),t_float_1        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    XMPYU   fht_0,fw_l,fm1            ; m1[0] = fht_0*fw_l
-    XMPYU   fht_1,fw_l,fm1_1          ; m1[1] = ht*fw_l
-    FSTD    fm1,-16(%sp)              ; -16(sp) = m1
-    FSTD    fm1_1,-48(%sp)            ; -48(sp) = m1
-    XMPYU   flt_0,fw_h,fm             ; m = lt*fw_h
-    XMPYU   flt_1,fw_h,fm_1           ; m = lt*fw_h
-    FSTD    fm,-8(%sp)                ; -8(sp) = m
-    FSTD    fm_1,-40(%sp)             ; -40(sp) = m
-    XMPYU   fht_0,fw_h,ht_temp        ; ht_temp = fht_0*fw_h
-    XMPYU   fht_1,fw_h,ht_temp_1      ; ht_temp = ht*fw_h
-    FSTD    ht_temp,-24(%sp)          ; -24(sp) = ht
-    FSTD    ht_temp_1,-56(%sp)        ; -56(sp) = ht
-    XMPYU   flt_0,fw_l,lt_temp        ; lt_temp = lt*fw_l
-    XMPYU   flt_1,fw_l,lt_temp_1      ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)          ; -32(sp) = lt 
-    FSTD    lt_temp_1,-64(%sp)        ; -64(sp) = lt 
-    LDD     -8(%sp),m_0               
-    LDD     -40(%sp),m_1              
-    LDD    -16(%sp),m1_0              
-    LDD    -48(%sp),m1_1              
-    LDD     -24(%sp),ht_0             
-    LDD     -56(%sp),ht_1             
-    ADD,L   m1_0,m_0,tmp_0            ; tmp_0 = m + m1; 
-    ADD,L   m1_1,m_1,tmp_1            ; tmp_1 = m + m1; 
-    LDD     -32(%sp),lt_0             
-    LDD     -64(%sp),lt_1             
-    CMPCLR,*>>= tmp_0,m1_0, %r0       ; if (m < m1)
-    ADD,L   ht_0,top_overflow,ht_0    ; ht += (1<<32)
-    CMPCLR,*>>= tmp_1,m1_1,%r0        ; if (m < m1)
-    ADD,L   ht_1,top_overflow,ht_1    ; ht += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0           ; m>>32  
-    DEPD,Z  tmp_0,31,32,m1_0          ; m1 = m<<32 
-    EXTRD,U tmp_1,31,32,m_1           ; m>>32  
-    DEPD,Z  tmp_1,31,32,m1_1          ; m1 = m<<32 
-    ADD,L   ht_0,m_0,ht_0             ; ht+= (m>>32)
-    ADD,L   ht_1,m_1,ht_1             ; ht+= (m>>32)
-    ADD     lt_0,m1_0,lt_0            ; lt = lt+m1;
-        ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     lt_1,m1_1,lt_1            ; lt = lt+m1;
-    ADD,DC  ht_1,%r0,ht_1             ; ht++
-    ADD    %ret0,lt_0,lt_0            ; lt = lt + c (ret0);
-        ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     ht_0,lt_1,lt_1            ; lt = lt + c (ht_0)
-    ADD,DC  ht_1,%r0,ht_1             ; ht++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-    STD     lt_1,8(r_ptr)             ; rp[1] = lt
-        COPY    ht_1,%ret0                ; carry = ht
-        LDO    -2(num),num                ; num = num - 2;
-    LDO     16(a_ptr),a_ptr           ; ap += 2
-        CMPIB,<= 2,num,bn_mul_words_unroll2
-    LDO     16(r_ptr),r_ptr           ; rp++
-    CMPIB,=,N 0,num,bn_mul_words_exit ; are we done?
-        ;
-        ; Top of loop aligned on 64-byte boundary
-        ;
-bn_mul_words_single_top
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    XMPYU   fht_0,fw_l,fm1            ; m1 = ht*fw_l
-    FSTD    fm1,-16(%sp)              ; -16(sp) = m1
-    XMPYU   flt_0,fw_h,fm             ; m = lt*fw_h
-    FSTD    fm,-8(%sp)                ; -8(sp) = m
-    XMPYU   fht_0,fw_h,ht_temp        ; ht_temp = ht*fw_h
-    FSTD    ht_temp,-24(%sp)          ; -24(sp) = ht
-    XMPYU   flt_0,fw_l,lt_temp        ; lt_temp = lt*fw_l
-    FSTD    lt_temp,-32(%sp)          ; -32(sp) = lt 
-    LDD     -8(%sp),m_0               
-    LDD    -16(%sp),m1_0              
-    ADD,L   m_0,m1_0,tmp_0            ; tmp_0 = m + m1; 
-    LDD     -24(%sp),ht_0             
-    LDD     -32(%sp),lt_0             
-    CMPCLR,*>>= tmp_0,m1_0,%r0        ; if (m < m1)
-    ADD,L   ht_0,top_overflow,ht_0    ; ht += (1<<32)
-    EXTRD,U tmp_0,31,32,m_0           ; m>>32  
-    DEPD,Z  tmp_0,31,32,m1_0          ; m1 = m<<32 
-    ADD,L   ht_0,m_0,ht_0             ; ht+= (m>>32)
-    ADD     lt_0,m1_0,lt_0            ; lt= lt+m1;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    ADD     %ret0,lt_0,lt_0           ; lt = lt + c;
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    COPY    ht_0,%ret0                ; copy carry
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-bn_mul_words_exit
-    .EXIT
-    LDD     -96(%sp),%r7              ; restore r7  
-    LDD     -104(%sp),%r6             ; restore r6  
-    LDD     -112(%sp),%r5             ; restore r5  
-    LDD     -120(%sp),%r4             ; restore r4  
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3             ; restore r3
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;void bn_sqr_words(BN_ULONG *rp, BN_ULONG *ap, int num)
-;
-; arg0 = rp
-; arg1 = ap
-; arg2 = num
-;
-bn_sqr_words
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_sqr_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3  
-    STD     %r4,8(%sp)          ; save r4  
-        NOP
-    STD     %r5,16(%sp)         ; save r5  
-    CMPIB,>= 0,num,bn_sqr_words_exit
-        LDO     128(%sp),%sp       ; bump stack
-        ;
-        ; If only 1, the goto straight to cleanup
-        ;
-        CMPIB,= 1,num,bn_sqr_words_single_top
-    DEPDI,Z -1,32,33,high_mask   ; Create Mask 0xffffffff80000000L
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-bn_sqr_words_unroll2
-    FLDD    0(a_ptr),t_float_0        ; a[0]
-    FLDD    8(a_ptr),t_float_1        ; a[1]
-    XMPYU   fht_0,flt_0,fm            ; m[0]
-    XMPYU   fht_1,flt_1,fm_1          ; m[1]
-    FSTD    fm,-24(%sp)               ; store m[0]
-    FSTD    fm_1,-56(%sp)             ; store m[1]
-    XMPYU   flt_0,flt_0,lt_temp       ; lt[0]
-    XMPYU   flt_1,flt_1,lt_temp_1     ; lt[1]
-    FSTD    lt_temp,-16(%sp)          ; store lt[0]
-    FSTD    lt_temp_1,-48(%sp)        ; store lt[1]
-    XMPYU   fht_0,fht_0,ht_temp       ; ht[0]
-    XMPYU   fht_1,fht_1,ht_temp_1     ; ht[1]
-    FSTD    ht_temp,-8(%sp)           ; store ht[0]
-    FSTD    ht_temp_1,-40(%sp)        ; store ht[1]
-    LDD     -24(%sp),m_0             
-    LDD     -56(%sp),m_1              
-    AND     m_0,high_mask,tmp_0       ; m[0] & Mask
-    AND     m_1,high_mask,tmp_1       ; m[1] & Mask
-    DEPD,Z  m_0,30,31,m_0             ; m[0] << 32+1
-    DEPD,Z  m_1,30,31,m_1             ; m[1] << 32+1
-    LDD     -16(%sp),lt_0        
-    LDD     -48(%sp),lt_1        
-    EXTRD,U tmp_0,32,33,tmp_0         ; tmp_0 = m[0]&Mask >> 32-1
-    EXTRD,U tmp_1,32,33,tmp_1         ; tmp_1 = m[1]&Mask >> 32-1
-    LDD     -8(%sp),ht_0            
-    LDD     -40(%sp),ht_1           
-    ADD,L   ht_0,tmp_0,ht_0           ; ht[0] += tmp_0
-    ADD,L   ht_1,tmp_1,ht_1           ; ht[1] += tmp_1
-    ADD     lt_0,m_0,lt_0             ; lt = lt+m
-    ADD,DC  ht_0,%r0,ht_0             ; ht[0]++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt[0]
-    STD     ht_0,8(r_ptr)             ; rp[1] = ht[1]
-    ADD     lt_1,m_1,lt_1             ; lt = lt+m
-    ADD,DC  ht_1,%r0,ht_1             ; ht[1]++
-    STD     lt_1,16(r_ptr)            ; rp[2] = lt[1]
-    STD     ht_1,24(r_ptr)            ; rp[3] = ht[1]
-        LDO    -2(num),num                ; num = num - 2;
-    LDO     16(a_ptr),a_ptr           ; ap += 2
-        CMPIB,<= 2,num,bn_sqr_words_unroll2
-    LDO     32(r_ptr),r_ptr           ; rp += 4
-    CMPIB,=,N 0,num,bn_sqr_words_exit ; are we done?
-        ;
-        ; Top of loop aligned on 64-byte boundary
-        ;
-bn_sqr_words_single_top
-    FLDD    0(a_ptr),t_float_0        ; load up 64-bit value (fr8L) ht(L)/lt(R)
-    XMPYU   fht_0,flt_0,fm            ; m
-    FSTD    fm,-24(%sp)               ; store m
-    XMPYU   flt_0,flt_0,lt_temp       ; lt
-    FSTD    lt_temp,-16(%sp)          ; store lt
-    XMPYU   fht_0,fht_0,ht_temp       ; ht
-    FSTD    ht_temp,-8(%sp)           ; store ht
-    LDD     -24(%sp),m_0              ; load m
-    AND     m_0,high_mask,tmp_0       ; m & Mask
-    DEPD,Z  m_0,30,31,m_0             ; m << 32+1
-    LDD     -16(%sp),lt_0             ; lt
-    LDD     -8(%sp),ht_0              ; ht
-    EXTRD,U tmp_0,32,33,tmp_0         ; tmp_0 = m&Mask >> 32-1
-    ADD     m_0,lt_0,lt_0             ; lt = lt+m
-    ADD,L   ht_0,tmp_0,ht_0           ; ht += tmp_0
-    ADD,DC  ht_0,%r0,ht_0             ; ht++
-    STD     lt_0,0(r_ptr)             ; rp[0] = lt
-    STD     ht_0,8(r_ptr)             ; rp[1] = ht
-bn_sqr_words_exit
-    .EXIT
-    LDD     -112(%sp),%r5       ; restore r5  
-    LDD     -120(%sp),%r4       ; restore r4  
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3 
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;BN_ULONG bn_add_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-;
-; arg0 = rp 
-; arg1 = ap
-; arg2 = bp 
-; arg3 = n
-t  .reg %r22
-b  .reg %r21
-l  .reg %r20
-bn_add_words
-        .proc
-    .entry
-        .callinfo
-        .EXPORT bn_add_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-        .align 64
-    CMPIB,>= 0,n,bn_add_words_exit
-    COPY    %r0,%ret0           ; return 0 by default
-        ;
-        ; If 2 or more numbers do the loop
-        ;
-        CMPIB,= 1,n,bn_add_words_single_top
-        NOP
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-bn_add_words_unroll2
-        LDD     0(a_ptr),t
-        LDD     0(b_ptr),b
-        ADD     t,%ret0,t                    ; t = t+c;
-        ADD,DC  %r0,%r0,%ret0                ; set c to carry
-        ADD     t,b,l                        ; l = t + b[0]
-        ADD,DC  %ret0,%r0,%ret0              ; c+= carry
-        STD     l,0(r_ptr)
-        LDD     8(a_ptr),t
-        LDD     8(b_ptr),b
-        ADD     t,%ret0,t                     ; t = t+c;
-        ADD,DC  %r0,%r0,%ret0                 ; set c to carry
-        ADD     t,b,l                         ; l = t + b[0]
-        ADD,DC  %ret0,%r0,%ret0               ; c+= carry
-        STD     l,8(r_ptr)
-        LDO     -2(n),n
-        LDO     16(a_ptr),a_ptr
-        LDO     16(b_ptr),b_ptr
-        CMPIB,<= 2,n,bn_add_words_unroll2
-        LDO     16(r_ptr),r_ptr
-    CMPIB,=,N 0,n,bn_add_words_exit ; are we done?
-bn_add_words_single_top
-        LDD     0(a_ptr),t
-        LDD     0(b_ptr),b
-        ADD     t,%ret0,t                 ; t = t+c;
-        ADD,DC  %r0,%r0,%ret0             ; set c to carry (could use CMPCLR??)
-        ADD     t,b,l                     ; l = t + b[0]
-        ADD,DC  %ret0,%r0,%ret0           ; c+= carry
-        STD     l,0(r_ptr)
-bn_add_words_exit
-    .EXIT
-    BVE     (%rp)
-        NOP
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-;BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-;
-; arg0 = rp 
-; arg1 = ap
-; arg2 = bp 
-; arg3 = n
-t1       .reg %r22
-t2       .reg %r21
-sub_tmp1 .reg %r20
-sub_tmp2 .reg %r19
-bn_sub_words
-        .proc
-        .callinfo 
-        .EXPORT bn_sub_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    CMPIB,>=  0,n,bn_sub_words_exit
-    COPY    %r0,%ret0           ; return 0 by default
-        ;
-        ; If 2 or more numbers do the loop
-        ;
-        CMPIB,= 1,n,bn_sub_words_single_top
-        NOP
-        ;
-        ; This loop is unrolled 2 times (64-byte aligned as well)
-        ;
-bn_sub_words_unroll2
-        LDD     0(a_ptr),t1
-        LDD     0(b_ptr),t2
-        SUB     t1,t2,sub_tmp1           ; t3 = t1-t2; 
-        SUB     sub_tmp1,%ret0,sub_tmp1  ; t3 = t3- c; 
-        CMPCLR,*>> t1,t2,sub_tmp2        ; clear if t1 > t2
-        LDO      1(%r0),sub_tmp2
-        
-        CMPCLR,*= t1,t2,%r0
-        COPY    sub_tmp2,%ret0
-        STD     sub_tmp1,0(r_ptr)
-        LDD     8(a_ptr),t1
-        LDD     8(b_ptr),t2
-        SUB     t1,t2,sub_tmp1            ; t3 = t1-t2; 
-        SUB     sub_tmp1,%ret0,sub_tmp1   ; t3 = t3- c; 
-        CMPCLR,*>> t1,t2,sub_tmp2         ; clear if t1 > t2
-        LDO      1(%r0),sub_tmp2
-        
-        CMPCLR,*= t1,t2,%r0
-        COPY    sub_tmp2,%ret0
-        STD     sub_tmp1,8(r_ptr)
-        LDO     -2(n),n
-        LDO     16(a_ptr),a_ptr
-        LDO     16(b_ptr),b_ptr
-        CMPIB,<= 2,n,bn_sub_words_unroll2
-        LDO     16(r_ptr),r_ptr
-    CMPIB,=,N 0,n,bn_sub_words_exit ; are we done?
-bn_sub_words_single_top
-        LDD     0(a_ptr),t1
-        LDD     0(b_ptr),t2
-        SUB     t1,t2,sub_tmp1            ; t3 = t1-t2; 
-        SUB     sub_tmp1,%ret0,sub_tmp1   ; t3 = t3- c; 
-        CMPCLR,*>> t1,t2,sub_tmp2         ; clear if t1 > t2
-        LDO      1(%r0),sub_tmp2
-        
-        CMPCLR,*= t1,t2,%r0
-        COPY    sub_tmp2,%ret0
-        STD     sub_tmp1,0(r_ptr)
-bn_sub_words_exit
-    .EXIT
-    BVE     (%rp)
-        NOP
-        .PROCEND        ;in=23,24,25,26,29;out=28;
-;------------------------------------------------------------------------------
-;
-; unsigned long bn_div_words(unsigned long h, unsigned long l, unsigned long d)
-;
-; arg0 = h
-; arg1 = l
-; arg2 = d
-;
-; This is mainly just modified assembly from the compiler, thus the
-; lack of variable names.
-;
-;------------------------------------------------------------------------------
-bn_div_words
-        .proc
-        .callinfo CALLER,FRAME=272,ENTRY_GR=%r10,SAVE_RP,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_div_words,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-        .IMPORT BN_num_bits_word,CODE,NO_RELOCATION
-        .IMPORT __iob,DATA
-        .IMPORT fprintf,CODE,NO_RELOCATION
-        .IMPORT abort,CODE,NO_RELOCATION
-        .IMPORT $$div2U,MILLICODE
-    .entry
-    STD     %r2,-16(%r30)   
-    STD,MA  %r3,352(%r30)   
-    STD     %r4,-344(%r30)  
-    STD     %r5,-336(%r30)  
-    STD     %r6,-328(%r30)  
-    STD     %r7,-320(%r30)  
-    STD     %r8,-312(%r30)  
-    STD     %r9,-304(%r30)  
-    STD     %r10,-296(%r30)
-    STD     %r27,-288(%r30)             ; save gp
-    COPY    %r24,%r3           ; save d 
-    COPY    %r26,%r4           ; save h (high 64-bits)
-    LDO      -1(%r0),%ret0     ; return -1 by default   
-    CMPB,*=  %r0,%arg2,$D3     ; if (d == 0)
-    COPY    %r25,%r5           ; save l (low 64-bits)
-    LDO     -48(%r30),%r29     ; create ap 
-    .CALL   ;in=26,29;out=28;
-    B,L     BN_num_bits_word,%r2 
-    COPY    %r3,%r26        
-    LDD     -288(%r30),%r27    ; restore gp 
-    LDI     64,%r21 
-    CMPB,=  %r21,%ret0,$00000012   ;if (i == 64) (forward) 
-    COPY    %ret0,%r24             ; i   
-    MTSARCM %r24    
-    DEPDI,Z -1,%sar,1,%r29  
-    CMPB,*<<,N %r29,%r4,bn_div_err_case ; if (h > 1<<i) (forward) 
-$00000012
-    SUBI    64,%r24,%r31                       ; i = 64 - i;
-    CMPCLR,*<< %r4,%r3,%r0                     ; if (h >= d)
-    SUB     %r4,%r3,%r4                        ; h -= d
-    CMPB,=  %r31,%r0,$0000001A                 ; if (i)
-    COPY    %r0,%r10                           ; ret = 0
-    MTSARCM %r31                               ; i to shift
-    DEPD,Z  %r3,%sar,64,%r3                    ; d <<= i;
-    SUBI    64,%r31,%r19                       ; 64 - i; redundent
-    MTSAR   %r19                               ; (64 -i) to shift
-    SHRPD   %r4,%r5,%sar,%r4                   ; l>> (64-i)
-    MTSARCM %r31                               ; i to shift
-    DEPD,Z  %r5,%sar,64,%r5                    ; l <<= i;
-$0000001A
-    DEPDI,Z -1,31,32,%r19                      
-    EXTRD,U %r3,31,32,%r6                      ; dh=(d&0xfff)>>32
-    EXTRD,U %r3,63,32,%r8                      ; dl = d&0xffffff
-    LDO     2(%r0),%r9
-    STD    %r3,-280(%r30)                      ; "d" to stack
-$0000001C
-    DEPDI,Z -1,63,32,%r29                      ; 
-    EXTRD,U %r4,31,32,%r31                     ; h >> 32
-    CMPB,*=,N  %r31,%r6,$D2                    ; if ((h>>32) != dh)(forward) div
-    COPY    %r4,%r26       
-    EXTRD,U %r4,31,32,%r25 
-    COPY    %r6,%r24      
-    .CALL   ;in=23,24,25,26;out=20,21,22,28,29; (MILLICALL)
-    B,L     $$div2U,%r2     
-    EXTRD,U %r6,31,32,%r23  
-    DEPD    %r28,31,32,%r29 
-$D2
-    STD     %r29,-272(%r30)                   ; q
-    AND     %r5,%r19,%r24                   ; t & 0xffffffff00000000;
-    EXTRD,U %r24,31,32,%r24                 ; ??? 
-    FLDD    -272(%r30),%fr7                 ; q
-    FLDD    -280(%r30),%fr8                 ; d
-    XMPYU   %fr8L,%fr7L,%fr10  
-    FSTD    %fr10,-256(%r30)   
-    XMPYU   %fr8L,%fr7R,%fr22  
-    FSTD    %fr22,-264(%r30)   
-    XMPYU   %fr8R,%fr7L,%fr11 
-    XMPYU   %fr8R,%fr7R,%fr23
-    FSTD    %fr11,-232(%r30)
-    FSTD    %fr23,-240(%r30)
-    LDD     -256(%r30),%r28
-    DEPD,Z  %r28,31,32,%r2 
-    LDD     -264(%r30),%r20
-    ADD,L   %r20,%r2,%r31   
-    LDD     -232(%r30),%r22 
-    DEPD,Z  %r22,31,32,%r22 
-    LDD     -240(%r30),%r21 
-    B       $00000024       ; enter loop  
-    ADD,L   %r21,%r22,%r23 
-$0000002A
-    LDO     -1(%r29),%r29   
-    SUB     %r23,%r8,%r23   
-$00000024
-    SUB     %r4,%r31,%r25   
-    AND     %r25,%r19,%r26  
-    CMPB,*<>,N      %r0,%r26,$00000046  ; (forward)
-    DEPD,Z  %r25,31,32,%r20 
-    OR      %r20,%r24,%r21  
-    CMPB,*<<,N  %r21,%r23,$0000002A ;(backward) 
-    SUB     %r31,%r6,%r31   
-;-------------Break path---------------------
-$00000046
-    DEPD,Z  %r23,31,32,%r25              ;tl
-    EXTRD,U %r23,31,32,%r26              ;t
-    AND     %r25,%r19,%r24               ;tl = (tl<<32)&0xfffffff0000000L
-    ADD,L   %r31,%r26,%r31               ;th += t; 
-    CMPCLR,*>>=     %r5,%r24,%r0         ;if (l<tl)
-    LDO     1(%r31),%r31                 ; th++;
-    CMPB,*<<=,N     %r31,%r4,$00000036   ;if (n < th) (forward)
-    LDO     -1(%r29),%r29                ;q--; 
-    ADD,L   %r4,%r3,%r4                  ;h += d;
-$00000036
-    ADDIB,=,N       -1,%r9,$D1 ;if (--count == 0) break (forward) 
-    SUB     %r5,%r24,%r28                ; l -= tl;
-    SUB     %r4,%r31,%r24                ; h -= th;
-    SHRPD   %r24,%r28,32,%r4             ; h = ((h<<32)|(l>>32));
-    DEPD,Z  %r29,31,32,%r10              ; ret = q<<32
-    b      $0000001C
-    DEPD,Z  %r28,31,32,%r5               ; l = l << 32 
-$D1
-    OR      %r10,%r29,%r28           ; ret |= q
-$D3
-    LDD     -368(%r30),%r2  
-$D0
-    LDD     -296(%r30),%r10 
-    LDD     -304(%r30),%r9  
-    LDD     -312(%r30),%r8  
-    LDD     -320(%r30),%r7  
-    LDD     -328(%r30),%r6  
-    LDD     -336(%r30),%r5  
-    LDD     -344(%r30),%r4  
-    BVE     (%r2)   
-        .EXIT
-    LDD,MB  -352(%r30),%r3 
-bn_div_err_case
-    MFIA    %r6     
-    ADDIL   L'bn_div_words-bn_div_err_case,%r6,%r1 
-    LDO     R'bn_div_words-bn_div_err_case(%r1),%r6  
-    ADDIL   LT'__iob,%r27,%r1       
-    LDD     RT'__iob(%r1),%r26      
-    ADDIL   L'C$4-bn_div_words,%r6,%r1    
-    LDO     R'C$4-bn_div_words(%r1),%r25  
-    LDO     64(%r26),%r26   
-    .CALL           ;in=24,25,26,29;out=28;
-    B,L     fprintf,%r2    
-    LDO     -48(%r30),%r29 
-    LDD     -288(%r30),%r27
-    .CALL           ;in=29;
-    B,L     abort,%r2      
-    LDO     -48(%r30),%r29 
-    LDD     -288(%r30),%r27
-    B       $D0         
-    LDD     -368(%r30),%r2  
-        .PROCEND        ;in=24,25,26,29;out=28;
-;----------------------------------------------------------------------------
-;
-; Registers to hold 64-bit values to manipulate.  The "L" part
-; of the register corresponds to the upper 32-bits, while the "R"
-; part corresponds to the lower 32-bits
-; 
-; Note, that when using b6 and b7, the code must save these before
-; using them because they are callee save registers 
-; 
-;
-; Floating point registers to use to save values that
-; are manipulated.  These don't collide with ftemp1-6 and
-; are all caller save registers
-;
-a0        .reg %fr22
-a0L       .reg %fr22L
-a0R       .reg %fr22R
-a1        .reg %fr23
-a1L       .reg %fr23L
-a1R       .reg %fr23R
-a2        .reg %fr24
-a2L       .reg %fr24L
-a2R       .reg %fr24R
-a3        .reg %fr25
-a3L       .reg %fr25L
-a3R       .reg %fr25R
-a4        .reg %fr26
-a4L       .reg %fr26L
-a4R       .reg %fr26R
-a5        .reg %fr27
-a5L       .reg %fr27L
-a5R       .reg %fr27R
-a6        .reg %fr28
-a6L       .reg %fr28L
-a6R       .reg %fr28R
-a7        .reg %fr29
-a7L       .reg %fr29L
-a7R       .reg %fr29R
-b0        .reg %fr30
-b0L       .reg %fr30L
-b0R       .reg %fr30R
-b1        .reg %fr31
-b1L       .reg %fr31L
-b1R       .reg %fr31R
-;
-; Temporary floating point variables, these are all caller save
-; registers
-;
-ftemp1    .reg %fr4
-ftemp2    .reg %fr5
-ftemp3    .reg %fr6
-ftemp4    .reg %fr7
-;
-; The B set of registers when used.
-;
-b2        .reg %fr8
-b2L       .reg %fr8L
-b2R       .reg %fr8R
-b3        .reg %fr9
-b3L       .reg %fr9L
-b3R       .reg %fr9R
-b4        .reg %fr10
-b4L       .reg %fr10L
-b4R       .reg %fr10R
-b5        .reg %fr11
-b5L       .reg %fr11L
-b5R       .reg %fr11R
-b6        .reg %fr12
-b6L       .reg %fr12L
-b6R       .reg %fr12R
-b7        .reg %fr13
-b7L       .reg %fr13L
-b7R       .reg %fr13R
-c1           .reg %r21   ; only reg
-temp1        .reg %r20   ; only reg
-temp2        .reg %r19   ; only reg
-temp3        .reg %r31   ; only reg
-m1           .reg %r28   
-c2           .reg %r23   
-high_one     .reg %r1
-ht           .reg %r6
-lt           .reg %r5
-m            .reg %r4
-c3           .reg %r3
-SQR_ADD_C  .macro  A0L,A0R,C1,C2,C3
-    XMPYU   A0L,A0R,ftemp1       ; m
-    FSTD    ftemp1,-24(%sp)      ; store m
-    XMPYU   A0R,A0R,ftemp2       ; lt
-    FSTD    ftemp2,-16(%sp)      ; store lt
-    XMPYU   A0L,A0L,ftemp3       ; ht
-    FSTD    ftemp3,-8(%sp)       ; store ht
-    LDD     -24(%sp),m           ; load m
-    AND     m,high_mask,temp2    ; m & Mask
-    DEPD,Z  m,30,31,temp3        ; m << 32+1
-    LDD     -16(%sp),lt          ; lt
-    LDD     -8(%sp),ht           ; ht
-    EXTRD,U temp2,32,33,temp1    ; temp1 = m&Mask >> 32-1
-    ADD     temp3,lt,lt          ; lt = lt+m
-    ADD,L   ht,temp1,ht          ; ht += temp1
-    ADD,DC  ht,%r0,ht            ; ht++
-    ADD     C1,lt,C1             ; c1=c1+lt
-    ADD,DC  ht,%r0,ht            ; ht++
-    ADD     C2,ht,C2             ; c2=c2+ht
-    ADD,DC  C3,%r0,C3            ; c3++
-.endm
-SQR_ADD_C2 .macro  A0L,A0R,A1L,A1R,C1,C2,C3
-    XMPYU   A0L,A1R,ftemp1          ; m1 = bl*ht
-    FSTD    ftemp1,-16(%sp)         ;
-    XMPYU   A0R,A1L,ftemp2          ; m = bh*lt
-    FSTD    ftemp2,-8(%sp)          ;
-    XMPYU   A0R,A1R,ftemp3          ; lt = bl*lt
-    FSTD    ftemp3,-32(%sp)
-    XMPYU   A0L,A1L,ftemp4          ; ht = bh*ht
-    FSTD    ftemp4,-24(%sp)         ;
-    LDD     -8(%sp),m               ; r21 = m
-    LDD     -16(%sp),m1             ; r19 = m1
-    ADD,L   m,m1,m                  ; m+m1
-    DEPD,Z  m,31,32,temp3           ; (m+m1<<32)
-    LDD     -24(%sp),ht             ; r24 = ht
-    CMPCLR,*>>= m,m1,%r0            ; if (m < m1)
-    ADD,L   ht,high_one,ht          ; ht+=high_one
-    EXTRD,U m,31,32,temp1           ; m >> 32
-    LDD     -32(%sp),lt             ; lt
-    ADD,L   ht,temp1,ht             ; ht+= m>>32
-    ADD     lt,temp3,lt             ; lt = lt+m1
-    ADD,DC  ht,%r0,ht               ; ht++
-    ADD     ht,ht,ht                ; ht=ht+ht;
-    ADD,DC  C3,%r0,C3               ; add in carry (c3++)
-    ADD     lt,lt,lt                ; lt=lt+lt;
-    ADD,DC  ht,%r0,ht               ; add in carry (ht++)
-    ADD     C1,lt,C1                ; c1=c1+lt
-    ADD,DC,*NUV ht,%r0,ht           ; add in carry (ht++)
-    LDO     1(C3),C3              ; bump c3 if overflow,nullify otherwise
-    ADD     C2,ht,C2                ; c2 = c2 + ht
-    ADD,DC  C3,%r0,C3             ; add in carry (c3++)
-.endm
-;
-;void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
-; arg0 = r_ptr
-; arg1 = a_ptr
-;
-bn_sqr_comba8
-        .PROC
-        .CALLINFO FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_sqr_comba8,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .ENTRY
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z -1,32,33,high_mask   ; Create Mask 0xffffffff80000000L
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD     0(a_ptr),a0       
-    FLDD     8(a_ptr),a1       
-    FLDD    16(a_ptr),a2       
-    FLDD    24(a_ptr),a3       
-    FLDD    32(a_ptr),a4       
-    FLDD    40(a_ptr),a5       
-    FLDD    48(a_ptr),a6       
-    FLDD    56(a_ptr),a7       
-        SQR_ADD_C a0L,a0R,c1,c2,c3
-        STD     c1,0(r_ptr)          ; r[0] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a1L,a1R,a0L,a0R,c2,c3,c1
-        STD     c2,8(r_ptr)          ; r[1] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a1L,a1R,c3,c1,c2
-        SQR_ADD_C2 a2L,a2R,a0L,a0R,c3,c1,c2
-        STD     c3,16(r_ptr)            ; r[2] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C2 a3L,a3R,a0L,a0R,c1,c2,c3
-        SQR_ADD_C2 a2L,a2R,a1L,a1R,c1,c2,c3
-        STD     c1,24(r_ptr)           ; r[3] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C a2L,a2R,c2,c3,c1
-        SQR_ADD_C2 a3L,a3R,a1L,a1R,c2,c3,c1
-        SQR_ADD_C2 a4L,a4R,a0L,a0R,c2,c3,c1
-        STD     c2,32(r_ptr)          ; r[4] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C2 a5L,a5R,a0L,a0R,c3,c1,c2
-        SQR_ADD_C2 a4L,a4R,a1L,a1R,c3,c1,c2
-        SQR_ADD_C2 a3L,a3R,a2L,a2R,c3,c1,c2
-        STD     c3,40(r_ptr)          ; r[5] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C a3L,a3R,c1,c2,c3
-        SQR_ADD_C2 a4L,a4R,a2L,a2R,c1,c2,c3
-        SQR_ADD_C2 a5L,a5R,a1L,a1R,c1,c2,c3
-        SQR_ADD_C2 a6L,a6R,a0L,a0R,c1,c2,c3
-        STD     c1,48(r_ptr)          ; r[6] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a7L,a7R,a0L,a0R,c2,c3,c1
-        SQR_ADD_C2 a6L,a6R,a1L,a1R,c2,c3,c1
-        SQR_ADD_C2 a5L,a5R,a2L,a2R,c2,c3,c1
-        SQR_ADD_C2 a4L,a4R,a3L,a3R,c2,c3,c1
-        STD     c2,56(r_ptr)          ; r[7] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a4L,a4R,c3,c1,c2
-        SQR_ADD_C2 a5L,a5R,a3L,a3R,c3,c1,c2
-        SQR_ADD_C2 a6L,a6R,a2L,a2R,c3,c1,c2
-        SQR_ADD_C2 a7L,a7R,a1L,a1R,c3,c1,c2
-        STD     c3,64(r_ptr)          ; r[8] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C2 a7L,a7R,a2L,a2R,c1,c2,c3
-        SQR_ADD_C2 a6L,a6R,a3L,a3R,c1,c2,c3
-        SQR_ADD_C2 a5L,a5R,a4L,a4R,c1,c2,c3
-        STD     c1,72(r_ptr)          ; r[9] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C a5L,a5R,c2,c3,c1
-        SQR_ADD_C2 a6L,a6R,a4L,a4R,c2,c3,c1
-        SQR_ADD_C2 a7L,a7R,a3L,a3R,c2,c3,c1
-        STD     c2,80(r_ptr)          ; r[10] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C2 a7L,a7R,a4L,a4R,c3,c1,c2
-        SQR_ADD_C2 a6L,a6R,a5L,a5R,c3,c1,c2
-        STD     c3,88(r_ptr)          ; r[11] = c3;
-        COPY    %r0,c3
-        
-        SQR_ADD_C a6L,a6R,c1,c2,c3
-        SQR_ADD_C2 a7L,a7R,a5L,a5R,c1,c2,c3
-        STD     c1,96(r_ptr)          ; r[12] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a7L,a7R,a6L,a6R,c2,c3,c1
-        STD     c2,104(r_ptr)         ; r[13] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a7L,a7R,c3,c1,c2
-        STD     c3, 112(r_ptr)       ; r[14] = c3
-        STD     c1, 120(r_ptr)       ; r[15] = c1
-    .EXIT
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;-----------------------------------------------------------------------------
-;
-;void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a)
-; arg0 = r_ptr
-; arg1 = a_ptr
-;
-bn_sqr_comba4
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_sqr_comba4,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z -1,32,33,high_mask   ; Create Mask 0xffffffff80000000L
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD     0(a_ptr),a0       
-    FLDD     8(a_ptr),a1       
-    FLDD    16(a_ptr),a2       
-    FLDD    24(a_ptr),a3       
-    FLDD    32(a_ptr),a4       
-    FLDD    40(a_ptr),a5       
-    FLDD    48(a_ptr),a6       
-    FLDD    56(a_ptr),a7       
-        SQR_ADD_C a0L,a0R,c1,c2,c3
-        STD     c1,0(r_ptr)          ; r[0] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C2 a1L,a1R,a0L,a0R,c2,c3,c1
-        STD     c2,8(r_ptr)          ; r[1] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C a1L,a1R,c3,c1,c2
-        SQR_ADD_C2 a2L,a2R,a0L,a0R,c3,c1,c2
-        STD     c3,16(r_ptr)            ; r[2] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C2 a3L,a3R,a0L,a0R,c1,c2,c3
-        SQR_ADD_C2 a2L,a2R,a1L,a1R,c1,c2,c3
-        STD     c1,24(r_ptr)           ; r[3] = c1;
-        COPY    %r0,c1
-        SQR_ADD_C a2L,a2R,c2,c3,c1
-        SQR_ADD_C2 a3L,a3R,a1L,a1R,c2,c3,c1
-        STD     c2,32(r_ptr)           ; r[4] = c2;
-        COPY    %r0,c2
-        SQR_ADD_C2 a3L,a3R,a2L,a2R,c3,c1,c2
-        STD     c3,40(r_ptr)           ; r[5] = c3;
-        COPY    %r0,c3
-        SQR_ADD_C a3L,a3R,c1,c2,c3
-        STD     c1,48(r_ptr)           ; r[6] = c1;
-        STD     c2,56(r_ptr)           ; r[7] = c2;
-    .EXIT
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;---------------------------------------------------------------------------
-MUL_ADD_C  .macro  A0L,A0R,B0L,B0R,C1,C2,C3
-    XMPYU   A0L,B0R,ftemp1        ; m1 = bl*ht
-    FSTD    ftemp1,-16(%sp)       ;
-    XMPYU   A0R,B0L,ftemp2        ; m = bh*lt
-    FSTD    ftemp2,-8(%sp)        ;
-    XMPYU   A0R,B0R,ftemp3        ; lt = bl*lt
-    FSTD    ftemp3,-32(%sp)
-    XMPYU   A0L,B0L,ftemp4        ; ht = bh*ht
-    FSTD    ftemp4,-24(%sp)       ;
-    LDD     -8(%sp),m             ; r21 = m
-    LDD     -16(%sp),m1           ; r19 = m1
-    ADD,L   m,m1,m                ; m+m1
-    DEPD,Z  m,31,32,temp3         ; (m+m1<<32)
-    LDD     -24(%sp),ht           ; r24 = ht
-    CMPCLR,*>>= m,m1,%r0          ; if (m < m1)
-    ADD,L   ht,high_one,ht        ; ht+=high_one
-    EXTRD,U m,31,32,temp1         ; m >> 32
-    LDD     -32(%sp),lt           ; lt
-    ADD,L   ht,temp1,ht           ; ht+= m>>32
-    ADD     lt,temp3,lt           ; lt = lt+m1
-    ADD,DC  ht,%r0,ht             ; ht++
-    ADD     C1,lt,C1              ; c1=c1+lt
-    ADD,DC  ht,%r0,ht             ; bump c3 if overflow,nullify otherwise
-    ADD     C2,ht,C2              ; c2 = c2 + ht
-    ADD,DC  C3,%r0,C3             ; add in carry (c3++)
-.endm
-;
-;void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-; arg0 = r_ptr
-; arg1 = a_ptr
-; arg2 = b_ptr
-;
-bn_mul_comba8
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_mul_comba8,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-    FSTD    %fr12,32(%sp)       ; save r6
-    FSTD    %fr13,40(%sp)       ; save r7
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD      0(a_ptr),a0       
-    FLDD      8(a_ptr),a1       
-    FLDD     16(a_ptr),a2       
-    FLDD     24(a_ptr),a3       
-    FLDD     32(a_ptr),a4       
-    FLDD     40(a_ptr),a5       
-    FLDD     48(a_ptr),a6       
-    FLDD     56(a_ptr),a7       
-    FLDD      0(b_ptr),b0       
-    FLDD      8(b_ptr),b1       
-    FLDD     16(b_ptr),b2       
-    FLDD     24(b_ptr),b3       
-    FLDD     32(b_ptr),b4       
-    FLDD     40(b_ptr),b5       
-    FLDD     48(b_ptr),b6       
-    FLDD     56(b_ptr),b7       
-        MUL_ADD_C a0L,a0R,b0L,b0R,c1,c2,c3
-        STD       c1,0(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a0L,a0R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b0L,b0R,c2,c3,c1
-        STD       c2,8(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a2L,a2R,b0L,b0R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a0L,a0R,b2L,b2R,c3,c1,c2
-        STD       c3,16(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a0L,a0R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a1L,a1R,b2L,b2R,c1,c2,c3
-        MUL_ADD_C a2L,a2R,b1L,b1R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b0L,b0R,c1,c2,c3
-        STD       c1,24(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a4L,a4R,b0L,b0R,c2,c3,c1
-        MUL_ADD_C a3L,a3R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a2L,a2R,b2L,b2R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b3L,b3R,c2,c3,c1
-        MUL_ADD_C a0L,a0R,b4L,b4R,c2,c3,c1
-        STD       c2,32(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a0L,a0R,b5L,b5R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b4L,b4R,c3,c1,c2
-        MUL_ADD_C a2L,a2R,b3L,b3R,c3,c1,c2
-        MUL_ADD_C a3L,a3R,b2L,b2R,c3,c1,c2
-        MUL_ADD_C a4L,a4R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a5L,a5R,b0L,b0R,c3,c1,c2
-        STD       c3,40(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a6L,a6R,b0L,b0R,c1,c2,c3
-        MUL_ADD_C a5L,a5R,b1L,b1R,c1,c2,c3
-        MUL_ADD_C a4L,a4R,b2L,b2R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a2L,a2R,b4L,b4R,c1,c2,c3
-        MUL_ADD_C a1L,a1R,b5L,b5R,c1,c2,c3
-        MUL_ADD_C a0L,a0R,b6L,b6R,c1,c2,c3
-        STD       c1,48(r_ptr)
-        COPY      %r0,c1
-        
-        MUL_ADD_C a0L,a0R,b7L,b7R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b6L,b6R,c2,c3,c1
-        MUL_ADD_C a2L,a2R,b5L,b5R,c2,c3,c1
-        MUL_ADD_C a3L,a3R,b4L,b4R,c2,c3,c1
-        MUL_ADD_C a4L,a4R,b3L,b3R,c2,c3,c1
-        MUL_ADD_C a5L,a5R,b2L,b2R,c2,c3,c1
-        MUL_ADD_C a6L,a6R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a7L,a7R,b0L,b0R,c2,c3,c1
-        STD       c2,56(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a7L,a7R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a6L,a6R,b2L,b2R,c3,c1,c2
-        MUL_ADD_C a5L,a5R,b3L,b3R,c3,c1,c2
-        MUL_ADD_C a4L,a4R,b4L,b4R,c3,c1,c2
-        MUL_ADD_C a3L,a3R,b5L,b5R,c3,c1,c2
-        MUL_ADD_C a2L,a2R,b6L,b6R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b7L,b7R,c3,c1,c2
-        STD       c3,64(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a2L,a2R,b7L,b7R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b6L,b6R,c1,c2,c3
-        MUL_ADD_C a4L,a4R,b5L,b5R,c1,c2,c3
-        MUL_ADD_C a5L,a5R,b4L,b4R,c1,c2,c3
-        MUL_ADD_C a6L,a6R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a7L,a7R,b2L,b2R,c1,c2,c3
-        STD       c1,72(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a7L,a7R,b3L,b3R,c2,c3,c1
-        MUL_ADD_C a6L,a6R,b4L,b4R,c2,c3,c1
-        MUL_ADD_C a5L,a5R,b5L,b5R,c2,c3,c1
-        MUL_ADD_C a4L,a4R,b6L,b6R,c2,c3,c1
-        MUL_ADD_C a3L,a3R,b7L,b7R,c2,c3,c1
-        STD       c2,80(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a4L,a4R,b7L,b7R,c3,c1,c2
-        MUL_ADD_C a5L,a5R,b6L,b6R,c3,c1,c2
-        MUL_ADD_C a6L,a6R,b5L,b5R,c3,c1,c2
-        MUL_ADD_C a7L,a7R,b4L,b4R,c3,c1,c2
-        STD       c3,88(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a7L,a7R,b5L,b5R,c1,c2,c3
-        MUL_ADD_C a6L,a6R,b6L,b6R,c1,c2,c3
-        MUL_ADD_C a5L,a5R,b7L,b7R,c1,c2,c3
-        STD       c1,96(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a6L,a6R,b7L,b7R,c2,c3,c1
-        MUL_ADD_C a7L,a7R,b6L,b6R,c2,c3,c1
-        STD       c2,104(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a7L,a7R,b7L,b7R,c3,c1,c2
-        STD       c3,112(r_ptr)
-        STD       c1,120(r_ptr)
-    .EXIT
-    FLDD    -88(%sp),%fr13 
-    FLDD    -96(%sp),%fr12 
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-;-----------------------------------------------------------------------------
-;
-;void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-; arg0 = r_ptr
-; arg1 = a_ptr
-; arg2 = b_ptr
-;
-bn_mul_comba4
-        .proc
-        .callinfo FRAME=128,ENTRY_GR=%r3,ARGS_SAVED,ORDERING_AWARE
-        .EXPORT bn_mul_comba4,ENTRY,PRIV_LEV=3,NO_RELOCATION,LONG_RETURN
-    .entry
-        .align 64
-    STD     %r3,0(%sp)          ; save r3
-    STD     %r4,8(%sp)          ; save r4
-    STD     %r5,16(%sp)         ; save r5
-    STD     %r6,24(%sp)         ; save r6
-    FSTD    %fr12,32(%sp)       ; save r6
-    FSTD    %fr13,40(%sp)       ; save r7
-        ;
-        ; Zero out carries
-        ;
-        COPY     %r0,c1
-        COPY     %r0,c2
-        COPY     %r0,c3
-        LDO      128(%sp),%sp       ; bump stack
-    DEPDI,Z  1,31,1,high_one     ; Create Value  1 << 32
-        ;
-        ; Load up all of the values we are going to use
-        ;
-    FLDD      0(a_ptr),a0       
-    FLDD      8(a_ptr),a1       
-    FLDD     16(a_ptr),a2       
-    FLDD     24(a_ptr),a3       
-    FLDD      0(b_ptr),b0       
-    FLDD      8(b_ptr),b1       
-    FLDD     16(b_ptr),b2       
-    FLDD     24(b_ptr),b3       
-        MUL_ADD_C a0L,a0R,b0L,b0R,c1,c2,c3
-        STD       c1,0(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a0L,a0R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b0L,b0R,c2,c3,c1
-        STD       c2,8(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a2L,a2R,b0L,b0R,c3,c1,c2
-        MUL_ADD_C a1L,a1R,b1L,b1R,c3,c1,c2
-        MUL_ADD_C a0L,a0R,b2L,b2R,c3,c1,c2
-        STD       c3,16(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a0L,a0R,b3L,b3R,c1,c2,c3
-        MUL_ADD_C a1L,a1R,b2L,b2R,c1,c2,c3
-        MUL_ADD_C a2L,a2R,b1L,b1R,c1,c2,c3
-        MUL_ADD_C a3L,a3R,b0L,b0R,c1,c2,c3
-        STD       c1,24(r_ptr)
-        COPY      %r0,c1
-        MUL_ADD_C a3L,a3R,b1L,b1R,c2,c3,c1
-        MUL_ADD_C a2L,a2R,b2L,b2R,c2,c3,c1
-        MUL_ADD_C a1L,a1R,b3L,b3R,c2,c3,c1
-        STD       c2,32(r_ptr)
-        COPY      %r0,c2
-        MUL_ADD_C a2L,a2R,b3L,b3R,c3,c1,c2
-        MUL_ADD_C a3L,a3R,b2L,b2R,c3,c1,c2
-        STD       c3,40(r_ptr)
-        COPY      %r0,c3
-        MUL_ADD_C a3L,a3R,b3L,b3R,c1,c2,c3
-        STD       c1,48(r_ptr)
-        STD       c2,56(r_ptr)
-    .EXIT
-    FLDD    -88(%sp),%fr13 
-    FLDD    -96(%sp),%fr12 
-    LDD     -104(%sp),%r6        ; restore r6
-    LDD     -112(%sp),%r5        ; restore r5
-    LDD     -120(%sp),%r4        ; restore r4
-    BVE     (%rp)
-    LDD,MB  -128(%sp),%r3
-        .PROCEND        
-        .SPACE  $TEXT$
-        .SUBSPA $CODE$
-        .SPACE  $PRIVATE$,SORT=16
-        .IMPORT $global$,DATA
-        .SPACE  $TEXT$
-        .SUBSPA $CODE$
-        .SUBSPA $LIT$,ACCESS=0x2c
-C$4
-        .ALIGN  8
-        .STRINGZ        "Division would overflow (%d)\n"
-        .END
diff --git a/src/lib/libcrypto/bn/asm/ppc-mont.pl b/src/lib/libcrypto/bn/asm/ppc-mont.pl
deleted file mode 100644
index 7849eae959..0000000000
--- a/src/lib/libcrypto/bn/asm/ppc-mont.pl
+++ /dev/null
@@ -1,323 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# April 2006
-# "Teaser" Montgomery multiplication module for PowerPC. It's possible
-# to gain a bit more by modulo-scheduling outer loop, then dedicated
-# squaring procedure should give further 20% and code can be adapted
-# for 32-bit application running on 64-bit CPU. As for the latter.
-# It won't be able to achieve "native" 64-bit performance, because in
-# 32-bit application context every addc instruction will have to be
-# expanded as addc, twice right shift by 32 and finally adde, etc.
-# So far RSA *sign* performance improvement over pre-bn_mul_mont asm
-# for 64-bit application running on PPC970/G5 is:
-#
-# 512-bit       +65%    
-# 1024-bit      +35%
-# 2048-bit      +18%
-# 4096-bit      +4%
-$flavour = shift;
-if ($flavour =~ /32/) {
-        $BITS=  32;
-        $BNSZ=  $BITS/8;
-        $SIZE_T=4;
-        $RZONE= 224;
-        $FRAME= $SIZE_T*16;
-        $LD=    "lwz";          # load
-        $LDU=   "lwzu";         # load and update
-        $LDX=   "lwzx";         # load indexed
-        $ST=    "stw";          # store
-        $STU=   "stwu";         # store and update
-        $STX=   "stwx";         # store indexed
-        $STUX=  "stwux";        # store indexed and update
-        $UMULL= "mullw";        # unsigned multiply low
-        $UMULH= "mulhwu";       # unsigned multiply high
-        $UCMP=  "cmplw";        # unsigned compare
-        $SHRI=  "srwi";         # unsigned shift right by immediate     
-        $PUSH=  $ST;
-        $POP=   $LD;
-} elsif ($flavour =~ /64/) {
-        $BITS=  64;
-        $BNSZ=  $BITS/8;
-        $SIZE_T=8;
-        $RZONE= 288;
-        $FRAME= $SIZE_T*16;
-        # same as above, but 64-bit mnemonics...
-        $LD=    "ld";           # load
-        $LDU=   "ldu";          # load and update
-        $LDX=   "ldx";          # load indexed
-        $ST=    "std";          # store
-        $STU=   "stdu";         # store and update
-        $STX=   "stdx";         # store indexed
-        $STUX=  "stdux";        # store indexed and update
-        $UMULL= "mulld";        # unsigned multiply low
-        $UMULH= "mulhdu";       # unsigned multiply high
-        $UCMP=  "cmpld";        # unsigned compare
-        $SHRI=  "srdi";         # unsigned shift right by immediate     
-        $PUSH=  $ST;
-        $POP=   $LD;
-} else { die "nonsense $flavour"; }
-$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
-( $xlate="${dir}ppc-xlate.pl" and -f $xlate ) or
-( $xlate="${dir}../../perlasm/ppc-xlate.pl" and -f $xlate) or
-die "can't locate ppc-xlate.pl";
-open STDOUT,"| $^X $xlate $flavour ".shift || die "can't call $xlate: $!";
-$sp="r1";
-$toc="r2";
-$rp="r3";       $ovf="r3";
-$ap="r4";
-$bp="r5";
-$np="r6";
-$n0="r7";
-$num="r8";
-$rp="r9";       # $rp is reassigned
-$aj="r10";
-$nj="r11";
-$tj="r12";
-# non-volatile registers
-$i="r14";
-$j="r15";
-$tp="r16";
-$m0="r17";
-$m1="r18";
-$lo0="r19";
-$hi0="r20";
-$lo1="r21";
-$hi1="r22";
-$alo="r23";
-$ahi="r24";
-$nlo="r25";
-#
-$nhi="r0";
-$code=<<___;
-.machine "any"
-.text
-.globl  .bn_mul_mont
-.align  4
-.bn_mul_mont:
-        cmpwi   $num,4
-        mr      $rp,r3          ; $rp is reassigned
-        li      r3,0
-        bltlr
-        slwi    $num,$num,`log($BNSZ)/log(2)`
-        li      $tj,-4096
-        addi    $ovf,$num,`$FRAME+$RZONE`
-        subf    $ovf,$ovf,$sp   ; $sp-$ovf
-        and     $ovf,$ovf,$tj   ; minimize TLB usage
-        subf    $ovf,$sp,$ovf   ; $ovf-$sp
-        srwi    $num,$num,`log($BNSZ)/log(2)`
-        $STUX   $sp,$sp,$ovf
-        $PUSH   r14,`4*$SIZE_T`($sp)
-        $PUSH   r15,`5*$SIZE_T`($sp)
-        $PUSH   r16,`6*$SIZE_T`($sp)
-        $PUSH   r17,`7*$SIZE_T`($sp)
-        $PUSH   r18,`8*$SIZE_T`($sp)
-        $PUSH   r19,`9*$SIZE_T`($sp)
-        $PUSH   r20,`10*$SIZE_T`($sp)
-        $PUSH   r21,`11*$SIZE_T`($sp)
-        $PUSH   r22,`12*$SIZE_T`($sp)
-        $PUSH   r23,`13*$SIZE_T`($sp)
-        $PUSH   r24,`14*$SIZE_T`($sp)
-        $PUSH   r25,`15*$SIZE_T`($sp)
-        $LD     $n0,0($n0)      ; pull n0[0] value
-        addi    $num,$num,-2    ; adjust $num for counter register
-        $LD     $m0,0($bp)      ; m0=bp[0]
-        $LD     $aj,0($ap)      ; ap[0]
-        addi    $tp,$sp,$FRAME
-        $UMULL  $lo0,$aj,$m0    ; ap[0]*bp[0]
-        $UMULH  $hi0,$aj,$m0
-        $LD     $aj,$BNSZ($ap)  ; ap[1]
-        $LD     $nj,0($np)      ; np[0]
-        $UMULL  $m1,$lo0,$n0    ; "tp[0]"*n0
-        $UMULL  $alo,$aj,$m0    ; ap[1]*bp[0]
-        $UMULH  $ahi,$aj,$m0
-        $UMULL  $lo1,$nj,$m1    ; np[0]*m1
-        $UMULH  $hi1,$nj,$m1
-        $LD     $nj,$BNSZ($np)  ; np[1]
-        addc    $lo1,$lo1,$lo0
-        addze   $hi1,$hi1
-        $UMULL  $nlo,$nj,$m1    ; np[1]*m1
-        $UMULH  $nhi,$nj,$m1
-        mtctr   $num
-        li      $j,`2*$BNSZ`
-.align  4
-L1st:
-        $LDX    $aj,$ap,$j      ; ap[j]
-        addc    $lo0,$alo,$hi0
-        $LDX    $nj,$np,$j      ; np[j]
-        addze   $hi0,$ahi
-        $UMULL  $alo,$aj,$m0    ; ap[j]*bp[0]
-        addc    $lo1,$nlo,$hi1
-        $UMULH  $ahi,$aj,$m0
-        addze   $hi1,$nhi
-        $UMULL  $nlo,$nj,$m1    ; np[j]*m1
-        addc    $lo1,$lo1,$lo0  ; np[j]*m1+ap[j]*bp[0]
-        $UMULH  $nhi,$nj,$m1
-        addze   $hi1,$hi1
-        $ST     $lo1,0($tp)     ; tp[j-1]
-        addi    $j,$j,$BNSZ     ; j++
-        addi    $tp,$tp,$BNSZ   ; tp++
-        bdnz-   L1st
-;L1st
-        addc    $lo0,$alo,$hi0
-        addze   $hi0,$ahi
-        addc    $lo1,$nlo,$hi1
-        addze   $hi1,$nhi
-        addc    $lo1,$lo1,$lo0  ; np[j]*m1+ap[j]*bp[0]
-        addze   $hi1,$hi1
-        $ST     $lo1,0($tp)     ; tp[j-1]
-        li      $ovf,0
-        addc    $hi1,$hi1,$hi0
-        addze   $ovf,$ovf       ; upmost overflow bit
-        $ST     $hi1,$BNSZ($tp)
-        li      $i,$BNSZ
-.align  4
-Louter:
-        $LDX    $m0,$bp,$i      ; m0=bp[i]
-        $LD     $aj,0($ap)      ; ap[0]
-        addi    $tp,$sp,$FRAME
-        $LD     $tj,$FRAME($sp) ; tp[0]
-        $UMULL  $lo0,$aj,$m0    ; ap[0]*bp[i]
-        $UMULH  $hi0,$aj,$m0
-        $LD     $aj,$BNSZ($ap)  ; ap[1]
-        $LD     $nj,0($np)      ; np[0]
-        addc    $lo0,$lo0,$tj   ; ap[0]*bp[i]+tp[0]
-        $UMULL  $alo,$aj,$m0    ; ap[j]*bp[i]
-        addze   $hi0,$hi0
-        $UMULL  $m1,$lo0,$n0    ; tp[0]*n0
-        $UMULH  $ahi,$aj,$m0
-        $UMULL  $lo1,$nj,$m1    ; np[0]*m1
-        $UMULH  $hi1,$nj,$m1
-        $LD     $nj,$BNSZ($np)  ; np[1]
-        addc    $lo1,$lo1,$lo0
-        $UMULL  $nlo,$nj,$m1    ; np[1]*m1
-        addze   $hi1,$hi1
-        $UMULH  $nhi,$nj,$m1
-        mtctr   $num
-        li      $j,`2*$BNSZ`
-.align  4
-Linner:
-        $LDX    $aj,$ap,$j      ; ap[j]
-        addc    $lo0,$alo,$hi0
-        $LD     $tj,$BNSZ($tp)  ; tp[j]
-        addze   $hi0,$ahi
-        $LDX    $nj,$np,$j      ; np[j]
-        addc    $lo1,$nlo,$hi1
-        $UMULL  $alo,$aj,$m0    ; ap[j]*bp[i]
-        addze   $hi1,$nhi
-        $UMULH  $ahi,$aj,$m0
-        addc    $lo0,$lo0,$tj   ; ap[j]*bp[i]+tp[j]
-        $UMULL  $nlo,$nj,$m1    ; np[j]*m1
-        addze   $hi0,$hi0
-        $UMULH  $nhi,$nj,$m1
-        addc    $lo1,$lo1,$lo0  ; np[j]*m1+ap[j]*bp[i]+tp[j]
-        addi    $j,$j,$BNSZ     ; j++
-        addze   $hi1,$hi1
-        $ST     $lo1,0($tp)     ; tp[j-1]
-        addi    $tp,$tp,$BNSZ   ; tp++
-        bdnz-   Linner
-;Linner
-        $LD     $tj,$BNSZ($tp)  ; tp[j]
-        addc    $lo0,$alo,$hi0
-        addze   $hi0,$ahi
-        addc    $lo0,$lo0,$tj   ; ap[j]*bp[i]+tp[j]
-        addze   $hi0,$hi0
-        addc    $lo1,$nlo,$hi1
-        addze   $hi1,$nhi
-        addc    $lo1,$lo1,$lo0  ; np[j]*m1+ap[j]*bp[i]+tp[j]
-        addze   $hi1,$hi1
-        $ST     $lo1,0($tp)     ; tp[j-1]
-        addic   $ovf,$ovf,-1    ; move upmost overflow to XER[CA]
-        li      $ovf,0
-        adde    $hi1,$hi1,$hi0
-        addze   $ovf,$ovf
-        $ST     $hi1,$BNSZ($tp)
-;
-        slwi    $tj,$num,`log($BNSZ)/log(2)`
-        $UCMP   $i,$tj
-        addi    $i,$i,$BNSZ
-        ble-    Louter
-        addi    $num,$num,2     ; restore $num
-        subfc   $j,$j,$j        ; j=0 and "clear" XER[CA]
-        addi    $tp,$sp,$FRAME
-        mtctr   $num
-.align  4
-Lsub:   $LDX    $tj,$tp,$j
-        $LDX    $nj,$np,$j
-        subfe   $aj,$nj,$tj     ; tp[j]-np[j]
-        $STX    $aj,$rp,$j
-        addi    $j,$j,$BNSZ
-        bdnz-   Lsub
-        li      $j,0
-        mtctr   $num
-        subfe   $ovf,$j,$ovf    ; handle upmost overflow bit
-        and     $ap,$tp,$ovf
-        andc    $np,$rp,$ovf
-        or      $ap,$ap,$np     ; ap=borrow?tp:rp
-.align  4
-Lcopy:                          ; copy or in-place refresh
-        $LDX    $tj,$ap,$j
-        $STX    $tj,$rp,$j
-        $STX    $j,$tp,$j       ; zap at once
-        addi    $j,$j,$BNSZ
-        bdnz-   Lcopy
-        $POP    r14,`4*$SIZE_T`($sp)
-        $POP    r15,`5*$SIZE_T`($sp)
-        $POP    r16,`6*$SIZE_T`($sp)
-        $POP    r17,`7*$SIZE_T`($sp)
-        $POP    r18,`8*$SIZE_T`($sp)
-        $POP    r19,`9*$SIZE_T`($sp)
-        $POP    r20,`10*$SIZE_T`($sp)
-        $POP    r21,`11*$SIZE_T`($sp)
-        $POP    r22,`12*$SIZE_T`($sp)
-        $POP    r23,`13*$SIZE_T`($sp)
-        $POP    r24,`14*$SIZE_T`($sp)
-        $POP    r25,`15*$SIZE_T`($sp)
-        $POP    $sp,0($sp)
-        li      r3,1
-        blr
-        .long   0
-.asciz  "Montgomery Multiplication for PPC, CRYPTOGAMS by <appro\@fy.chalmers.se>"
-___
-$code =~ s/\`([^\`]*)\`/eval $1/gem;
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/ppc.pl b/src/lib/libcrypto/bn/asm/ppc.pl
deleted file mode 100644
index 08e0053473..0000000000
--- a/src/lib/libcrypto/bn/asm/ppc.pl
+++ /dev/null
@@ -1,2078 +0,0 @@
-#!/usr/bin/env perl
-#
-# Implemented as a Perl wrapper as we want to support several different
-# architectures with single file. We pick up the target based on the
-# file name we are asked to generate.
-#
-# It should be noted though that this perl code is nothing like
-# <openssl>/crypto/perlasm/x86*. In this case perl is used pretty much
-# as pre-processor to cover for platform differences in name decoration,
-# linker tables, 32-/64-bit instruction sets...
-#
-# As you might know there're several PowerPC ABI in use. Most notably
-# Linux and AIX use different 32-bit ABIs. Good news are that these ABIs
-# are similar enough to implement leaf(!) functions, which would be ABI
-# neutral. And that's what you find here: ABI neutral leaf functions.
-# In case you wonder what that is...
-#
-#       AIX performance
-#
-#       MEASUREMENTS WITH cc ON a 200 MhZ PowerPC 604e.
-#
-#       The following is the performance of 32-bit compiler
-#       generated code:
-#
-#       OpenSSL 0.9.6c 21 dec 2001
-#       built on: Tue Jun 11 11:06:51 EDT 2002
-#       options:bn(64,32) ...
-#compiler: cc -DTHREADS  -DAIX -DB_ENDIAN -DBN_LLONG -O3
-#                  sign    verify    sign/s verify/s
-#rsa  512 bits   0.0098s   0.0009s    102.0   1170.6
-#rsa 1024 bits   0.0507s   0.0026s     19.7    387.5
-#rsa 2048 bits   0.3036s   0.0085s      3.3    117.1
-#rsa 4096 bits   2.0040s   0.0299s      0.5     33.4
-#dsa  512 bits   0.0087s   0.0106s    114.3     94.5
-#dsa 1024 bits   0.0256s   0.0313s     39.0     32.0    
-#
-#       Same bechmark with this assembler code:
-#
-#rsa  512 bits   0.0056s   0.0005s    178.6   2049.2
-#rsa 1024 bits   0.0283s   0.0015s     35.3    674.1
-#rsa 2048 bits   0.1744s   0.0050s      5.7    201.2
-#rsa 4096 bits   1.1644s   0.0179s      0.9     55.7
-#dsa  512 bits   0.0052s   0.0062s    191.6    162.0
-#dsa 1024 bits   0.0149s   0.0180s     67.0     55.5
-#
-#       Number of operations increases by at almost 75%
-#
-#       Here are performance numbers for 64-bit compiler
-#       generated code:
-#
-#       OpenSSL 0.9.6g [engine] 9 Aug 2002
-#       built on: Fri Apr 18 16:59:20 EDT 2003
-#       options:bn(64,64) ...
-#       compiler: cc -DTHREADS -D_REENTRANT -q64 -DB_ENDIAN -O3
-#                  sign    verify    sign/s verify/s
-#rsa  512 bits   0.0028s   0.0003s    357.1   3844.4
-#rsa 1024 bits   0.0148s   0.0008s     67.5   1239.7
-#rsa 2048 bits   0.0963s   0.0028s     10.4    353.0
-#rsa 4096 bits   0.6538s   0.0102s      1.5     98.1
-#dsa  512 bits   0.0026s   0.0032s    382.5    313.7
-#dsa 1024 bits   0.0081s   0.0099s    122.8    100.6
-#
-#       Same benchmark with this assembler code:
-#
-#rsa  512 bits   0.0020s   0.0002s    510.4   6273.7
-#rsa 1024 bits   0.0088s   0.0005s    114.1   2128.3
-#rsa 2048 bits   0.0540s   0.0016s     18.5    622.5
-#rsa 4096 bits   0.3700s   0.0058s      2.7    171.0
-#dsa  512 bits   0.0016s   0.0020s    610.7    507.1
-#dsa 1024 bits   0.0047s   0.0058s    212.5    173.2
-#       
-#       Again, performance increases by at about 75%
-#
-#       Mac OS X, Apple G5 1.8GHz (Note this is 32 bit code)
-#       OpenSSL 0.9.7c 30 Sep 2003
-#
-#       Original code.
-#
-#rsa  512 bits   0.0011s   0.0001s    906.1  11012.5
-#rsa 1024 bits   0.0060s   0.0003s    166.6   3363.1
-#rsa 2048 bits   0.0370s   0.0010s     27.1    982.4
-#rsa 4096 bits   0.2426s   0.0036s      4.1    280.4
-#dsa  512 bits   0.0010s   0.0012s   1038.1    841.5
-#dsa 1024 bits   0.0030s   0.0037s    329.6    269.7
-#dsa 2048 bits   0.0101s   0.0127s     98.9     78.6
-#
-#       Same benchmark with this assembler code:
-#
-#rsa  512 bits   0.0007s   0.0001s   1416.2  16645.9
-#rsa 1024 bits   0.0036s   0.0002s    274.4   5380.6
-#rsa 2048 bits   0.0222s   0.0006s     45.1   1589.5
-#rsa 4096 bits   0.1469s   0.0022s      6.8    449.6
-#dsa  512 bits   0.0006s   0.0007s   1664.2   1376.2
-#dsa 1024 bits   0.0018s   0.0023s    545.0    442.2
-#dsa 2048 bits   0.0061s   0.0075s    163.5    132.8
-#
-#        Performance increase of ~60%
-#
-#       If you have comments or suggestions to improve code send
-#       me a note at schari@us.ibm.com
-#
-$opf = shift;
-if ($opf =~ /32\.s/) {
-        $BITS=  32;
-        $BNSZ=  $BITS/8;
-        $ISA=   "\"ppc\"";
-        $LD=    "lwz";          # load
-        $LDU=   "lwzu";         # load and update
-        $ST=    "stw";          # store
-        $STU=   "stwu";         # store and update
-        $UMULL= "mullw";        # unsigned multiply low
-        $UMULH= "mulhwu";       # unsigned multiply high
-        $UDIV=  "divwu";        # unsigned divide
-        $UCMPI= "cmplwi";       # unsigned compare with immediate
-        $UCMP=  "cmplw";        # unsigned compare
-        $CNTLZ= "cntlzw";       # count leading zeros
-        $SHL=   "slw";          # shift left
-        $SHR=   "srw";          # unsigned shift right
-        $SHRI=  "srwi";         # unsigned shift right by immediate     
-        $SHLI=  "slwi";         # shift left by immediate
-        $CLRU=  "clrlwi";       # clear upper bits
-        $INSR=  "insrwi";       # insert right
-        $ROTL=  "rotlwi";       # rotate left by immediate
-        $TR=    "tw";           # conditional trap
-} elsif ($opf =~ /64\.s/) {
-        $BITS=  64;
-        $BNSZ=  $BITS/8;
-        $ISA=   "\"ppc64\"";
-        # same as above, but 64-bit mnemonics...
-        $LD=    "ld";           # load
-        $LDU=   "ldu";          # load and update
-        $ST=    "std";          # store
-        $STU=   "stdu";         # store and update
-        $UMULL= "mulld";        # unsigned multiply low
-        $UMULH= "mulhdu";       # unsigned multiply high
-        $UDIV=  "divdu";        # unsigned divide
-        $UCMPI= "cmpldi";       # unsigned compare with immediate
-        $UCMP=  "cmpld";        # unsigned compare
-        $CNTLZ= "cntlzd";       # count leading zeros
-        $SHL=   "sld";          # shift left
-        $SHR=   "srd";          # unsigned shift right
-        $SHRI=  "srdi";         # unsigned shift right by immediate     
-        $SHLI=  "sldi";         # shift left by immediate
-        $CLRU=  "clrldi";       # clear upper bits
-        $INSR=  "insrdi";       # insert right 
-        $ROTL=  "rotldi";       # rotate left by immediate
-        $TR=    "td";           # conditional trap
-} else { die "nonsense $opf"; }
-( defined shift || open STDOUT,">$opf" ) || die "can't open $opf: $!";
-# function entry points from the AIX code
-#
-# There are other, more elegant, ways to handle this. We (IBM) chose
-# this approach as it plays well with scripts we run to 'namespace'
-# OpenSSL .i.e. we add a prefix to all the public symbols so we can
-# co-exist in the same process with other implementations of OpenSSL.
-# 'cleverer' ways of doing these substitutions tend to hide data we
-# need to be obvious.
-#
-my @items = ("bn_sqr_comba4",
-             "bn_sqr_comba8",
-             "bn_mul_comba4",
-             "bn_mul_comba8",
-             "bn_sub_words",
-             "bn_add_words",
-             "bn_div_words",
-             "bn_sqr_words",
-             "bn_mul_words",
-             "bn_mul_add_words");
-if    ($opf =~ /linux/) {  do_linux();  }
-elsif ($opf =~ /aix/)   {  do_aix();    }
-elsif ($opf =~ /osx/)   {  do_osx();    }
-else                    {  do_bsd();    }
-sub do_linux {
-    $d=&data();
-    if ($BITS==64) {
-      foreach $t (@items) {
-        $d =~ s/\.$t:/\
-\t.section\t".opd","aw"\
-\t.align\t3\
-\t.globl\t$t\
-$t:\
-\t.quad\t.$t,.TOC.\@tocbase,0\
-\t.size\t$t,24\
-\t.previous\n\
-\t.type\t.$t,\@function\
-\t.globl\t.$t\
-.$t:/g;
-      }
-    }
-    else {
-      foreach $t (@items) {
-        $d=~s/\.$t/$t/g;
-      }
-    }
-    # hide internal labels to avoid pollution of name table...
-    $d=~s/Lppcasm_/.Lppcasm_/gm;
-    print $d;
-}
-sub do_aix {
-    # AIX assembler is smart enough to please the linker without
-    # making us do something special...
-    print &data();
-}
-# MacOSX 32 bit
-sub do_osx {
-    $d=&data();
-    # Change the bn symbol prefix from '.' to '_'
-    foreach $t (@items) {
-      $d=~s/\.$t/_$t/g;
-    }
-    # Change .machine to something OS X asm will accept
-    $d=~s/\.machine.*/.text/g;
-    $d=~s/\#/;/g; # change comment from '#' to ';'
-    print $d;
-}
-# BSD (Untested)
-sub do_bsd {
-    $d=&data();
-    foreach $t (@items) {
-      $d=~s/\.$t/_$t/g;
-    }
-    print $d;
-}
-sub data {
-        local($data)=<<EOF;
-#--------------------------------------------------------------------
-#
-#
-#
-#
-#       File:           ppc32.s
-#
-#       Created by:     Suresh Chari
-#                       IBM Thomas J. Watson Research Library
-#                       Hawthorne, NY
-#
-#
-#       Description:    Optimized assembly routines for OpenSSL crypto
-#                       on the 32 bitPowerPC platform.
-#
-#
-#       Version History
-#
-#       2. Fixed bn_add,bn_sub and bn_div_words, added comments,
-#          cleaned up code. Also made a single version which can
-#          be used for both the AIX and Linux compilers. See NOTE
-#          below.
-#                               12/05/03                Suresh Chari
-#                       (with lots of help from)        Andy Polyakov
-##      
-#       1. Initial version      10/20/02                Suresh Chari
-#
-#
-#       The following file works for the xlc,cc
-#       and gcc compilers.
-#
-#       NOTE:   To get the file to link correctly with the gcc compiler
-#               you have to change the names of the routines and remove
-#               the first .(dot) character. This should automatically
-#               be done in the build process.
-#
-#       Hand optimized assembly code for the following routines
-#       
-#       bn_sqr_comba4
-#       bn_sqr_comba8
-#       bn_mul_comba4
-#       bn_mul_comba8
-#       bn_sub_words
-#       bn_add_words
-#       bn_div_words
-#       bn_sqr_words
-#       bn_mul_words
-#       bn_mul_add_words
-#
-#       NOTE:   It is possible to optimize this code more for
-#       specific PowerPC or Power architectures. On the Northstar
-#       architecture the optimizations in this file do
-#        NOT provide much improvement.
-#
-#       If you have comments or suggestions to improve code send
-#       me a note at schari\@us.ibm.com
-#
-#--------------------------------------------------------------------------
-#
-#       Defines to be used in the assembly code.
-#       
-.set r0,0       # we use it as storage for value of 0
-.set SP,1       # preserved
-.set RTOC,2     # preserved 
-.set r3,3       # 1st argument/return value
-.set r4,4       # 2nd argument/volatile register
-.set r5,5       # 3rd argument/volatile register
-.set r6,6       # ...
-.set r7,7
-.set r8,8
-.set r9,9
-.set r10,10
-.set r11,11
-.set r12,12
-.set r13,13     # not used, nor any other "below" it...
-.set BO_IF_NOT,4
-.set BO_IF,12
-.set BO_dCTR_NZERO,16
-.set BO_dCTR_ZERO,18
-.set BO_ALWAYS,20
-.set CR0_LT,0;
-.set CR0_GT,1;
-.set CR0_EQ,2
-.set CR1_FX,4;
-.set CR1_FEX,5;
-.set CR1_VX,6
-.set LR,8
-#       Declare function names to be global
-#       NOTE:   For gcc these names MUST be changed to remove
-#               the first . i.e. for example change ".bn_sqr_comba4"
-#               to "bn_sqr_comba4". This should be automatically done
-#               in the build.
-        
-        .globl  .bn_sqr_comba4
-        .globl  .bn_sqr_comba8
-        .globl  .bn_mul_comba4
-        .globl  .bn_mul_comba8
-        .globl  .bn_sub_words
-        .globl  .bn_add_words
-        .globl  .bn_div_words
-        .globl  .bn_sqr_words
-        .globl  .bn_mul_words
-        .globl  .bn_mul_add_words
-        
-# .text section
-        
-        .machine        $ISA
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_sqr_comba4" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4
-.bn_sqr_comba4:
-#
-# Optimized version of bn_sqr_comba4.
-#
-# void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a)
-# r3 contains r
-# r4 contains a
-#
-# Freely use registers r5,r6,r7,r8,r9,r10,r11 as follows:       
-# 
-# r5,r6 are the two BN_ULONGs being multiplied.
-# r7,r8 are the results of the 32x32 giving 64 bit multiply.
-# r9,r10, r11 are the equivalents of c1,c2, c3.
-# Here's the assembly
-#
-#
-        xor             r0,r0,r0                # set r0 = 0. Used in the addze
-                                                # instructions below
-        
-                                                #sqr_add_c(a,0,c1,c2,c3)
-        $LD             r5,`0*$BNSZ`(r4)                
-        $UMULL          r9,r5,r5                
-        $UMULH          r10,r5,r5               #in first iteration. No need
-                                                #to add since c1=c2=c3=0.
-                                                # Note c3(r11) is NOT set to 0
-                                                # but will be.
-        $ST             r9,`0*$BNSZ`(r3)        # r[0]=c1;
-                                                # sqr_add_c2(a,1,0,c2,c3,c1);
-        $LD             r6,`1*$BNSZ`(r4)                
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-                                        
-        addc            r7,r7,r7                # compute (r7,r8)=2*(r7,r8)
-        adde            r8,r8,r8
-        addze           r9,r0                   # catch carry if any.
-                                                # r9= r0(=0) and carry 
-        
-        addc            r10,r7,r10              # now add to temp result.
-        addze           r11,r8                  # r8 added to r11 which is 0 
-        addze           r9,r9
-        
-        $ST             r10,`1*$BNSZ`(r3)       #r[1]=c2; 
-                                                #sqr_add_c(a,1,c3,c1,c2)
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r0
-                                                #sqr_add_c2(a,2,0,c3,c1,c2)
-        $LD             r6,`2*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r7,r7,r7
-        adde            r8,r8,r8
-        addze           r10,r10
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        $ST             r11,`2*$BNSZ`(r3)       #r[2]=c3 
-                                                #sqr_add_c2(a,3,0,c1,c2,c3);
-        $LD             r6,`3*$BNSZ`(r4)                
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r7,r7,r7
-        adde            r8,r8,r8
-        addze           r11,r0
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-                                                #sqr_add_c2(a,2,1,c1,c2,c3);
-        $LD             r5,`1*$BNSZ`(r4)
-        $LD             r6,`2*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r7,r7,r7
-        adde            r8,r8,r8
-        addze           r11,r11
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        $ST             r9,`3*$BNSZ`(r3)        #r[3]=c1
-                                                #sqr_add_c(a,2,c2,c3,c1);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r0
-                                                #sqr_add_c2(a,3,1,c2,c3,c1);
-        $LD             r6,`3*$BNSZ`(r4)                
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r7,r7,r7
-        adde            r8,r8,r8
-        addze           r9,r9
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        $ST             r10,`4*$BNSZ`(r3)       #r[4]=c2
-                                                #sqr_add_c2(a,3,2,c3,c1,c2);
-        $LD             r5,`2*$BNSZ`(r4)                
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r7,r7,r7
-        adde            r8,r8,r8
-        addze           r10,r0
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        $ST             r11,`5*$BNSZ`(r3)       #r[5] = c3
-                                                #sqr_add_c(a,3,c1,c2,c3);
-        $UMULL          r7,r6,r6                
-        $UMULH          r8,r6,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        $ST             r9,`6*$BNSZ`(r3)        #r[6]=c1
-        $ST             r10,`7*$BNSZ`(r3)       #r[7]=c2
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_sqr_comba8" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-        
-.align  4
-.bn_sqr_comba8:
-#
-# This is an optimized version of the bn_sqr_comba8 routine.
-# Tightly uses the adde instruction
-#
-#
-# void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
-# r3 contains r
-# r4 contains a
-#
-# Freely use registers r5,r6,r7,r8,r9,r10,r11 as follows:       
-# 
-# r5,r6 are the two BN_ULONGs being multiplied.
-# r7,r8 are the results of the 32x32 giving 64 bit multiply.
-# r9,r10, r11 are the equivalents of c1,c2, c3.
-#
-# Possible optimization of loading all 8 longs of a into registers
-# doesnt provide any speedup
-# 
-        xor             r0,r0,r0                #set r0 = 0.Used in addze
-                                                #instructions below.
-                                                #sqr_add_c(a,0,c1,c2,c3);
-        $LD             r5,`0*$BNSZ`(r4)
-        $UMULL          r9,r5,r5                #1st iteration: no carries.
-        $UMULH          r10,r5,r5
-        $ST             r9,`0*$BNSZ`(r3)        # r[0]=c1;
-                                                #sqr_add_c2(a,1,0,c2,c3,c1);
-        $LD             r6,`1*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6        
-        
-        addc            r10,r7,r10              #add the two register number
-        adde            r11,r8,r0               # (r8,r7) to the three register
-        addze           r9,r0                   # number (r9,r11,r10).NOTE:r0=0
-        
-        addc            r10,r7,r10              #add the two register number
-        adde            r11,r8,r11              # (r8,r7) to the three register
-        addze           r9,r9                   # number (r9,r11,r10).
-        
-        $ST             r10,`1*$BNSZ`(r3)       # r[1]=c2
-                                
-                                                #sqr_add_c(a,1,c3,c1,c2);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r0
-                                                #sqr_add_c2(a,2,0,c3,c1,c2);
-        $LD             r6,`2*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        
-        $ST             r11,`2*$BNSZ`(r3)       #r[2]=c3
-                                                #sqr_add_c2(a,3,0,c1,c2,c3);
-        $LD             r6,`3*$BNSZ`(r4)        #r6 = a[3]. r5 is already a[0].
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r0
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-                                                #sqr_add_c2(a,2,1,c1,c2,c3);
-        $LD             r5,`1*$BNSZ`(r4)
-        $LD             r6,`2*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        
-        $ST             r9,`3*$BNSZ`(r3)        #r[3]=c1;
-                                                #sqr_add_c(a,2,c2,c3,c1);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r0
-                                                #sqr_add_c2(a,3,1,c2,c3,c1);
-        $LD             r6,`3*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-                                                #sqr_add_c2(a,4,0,c2,c3,c1);
-        $LD             r5,`0*$BNSZ`(r4)
-        $LD             r6,`4*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        $ST             r10,`4*$BNSZ`(r3)       #r[4]=c2;
-                                                #sqr_add_c2(a,5,0,c3,c1,c2);
-        $LD             r6,`5*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r0
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-                                                #sqr_add_c2(a,4,1,c3,c1,c2);
-        $LD             r5,`1*$BNSZ`(r4)
-        $LD             r6,`4*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-                                                #sqr_add_c2(a,3,2,c3,c1,c2);
-        $LD             r5,`2*$BNSZ`(r4)
-        $LD             r6,`3*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        $ST             r11,`5*$BNSZ`(r3)       #r[5]=c3;
-                                                #sqr_add_c(a,3,c1,c2,c3);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r0
-                                                #sqr_add_c2(a,4,2,c1,c2,c3);
-        $LD             r6,`4*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-                                                #sqr_add_c2(a,5,1,c1,c2,c3);
-        $LD             r5,`1*$BNSZ`(r4)
-        $LD             r6,`5*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-                                                #sqr_add_c2(a,6,0,c1,c2,c3);
-        $LD             r5,`0*$BNSZ`(r4)
-        $LD             r6,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        $ST             r9,`6*$BNSZ`(r3)        #r[6]=c1;
-                                                #sqr_add_c2(a,7,0,c2,c3,c1);
-        $LD             r6,`7*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r0
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-                                                #sqr_add_c2(a,6,1,c2,c3,c1);
-        $LD             r5,`1*$BNSZ`(r4)
-        $LD             r6,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-                                                #sqr_add_c2(a,5,2,c2,c3,c1);
-        $LD             r5,`2*$BNSZ`(r4)
-        $LD             r6,`5*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-                                                #sqr_add_c2(a,4,3,c2,c3,c1);
-        $LD             r5,`3*$BNSZ`(r4)
-        $LD             r6,`4*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        $ST             r10,`7*$BNSZ`(r3)       #r[7]=c2;
-                                                #sqr_add_c(a,4,c3,c1,c2);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r0
-                                                #sqr_add_c2(a,5,3,c3,c1,c2);
-        $LD             r6,`5*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-                                                #sqr_add_c2(a,6,2,c3,c1,c2);
-        $LD             r5,`2*$BNSZ`(r4)
-        $LD             r6,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-                                                #sqr_add_c2(a,7,1,c3,c1,c2);
-        $LD             r5,`1*$BNSZ`(r4)
-        $LD             r6,`7*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        $ST             r11,`8*$BNSZ`(r3)       #r[8]=c3;
-                                                #sqr_add_c2(a,7,2,c1,c2,c3);
-        $LD             r5,`2*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r0
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-                                                #sqr_add_c2(a,6,3,c1,c2,c3);
-        $LD             r5,`3*$BNSZ`(r4)
-        $LD             r6,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-                                                #sqr_add_c2(a,5,4,c1,c2,c3);
-        $LD             r5,`4*$BNSZ`(r4)
-        $LD             r6,`5*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        $ST             r9,`9*$BNSZ`(r3)        #r[9]=c1;
-                                                #sqr_add_c(a,5,c2,c3,c1);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r0
-                                                #sqr_add_c2(a,6,4,c2,c3,c1);
-        $LD             r6,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-                                                #sqr_add_c2(a,7,3,c2,c3,c1);
-        $LD             r5,`3*$BNSZ`(r4)
-        $LD             r6,`7*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        $ST             r10,`10*$BNSZ`(r3)      #r[10]=c2;
-                                                #sqr_add_c2(a,7,4,c3,c1,c2);
-        $LD             r5,`4*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r0
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-                                                #sqr_add_c2(a,6,5,c3,c1,c2);
-        $LD             r5,`5*$BNSZ`(r4)
-        $LD             r6,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        addze           r10,r10
-        $ST             r11,`11*$BNSZ`(r3)      #r[11]=c3;
-                                                #sqr_add_c(a,6,c1,c2,c3);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r0
-                                                #sqr_add_c2(a,7,5,c1,c2,c3)
-        $LD             r6,`7*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        addc            r9,r7,r9
-        adde            r10,r8,r10
-        addze           r11,r11
-        $ST             r9,`12*$BNSZ`(r3)       #r[12]=c1;
-        
-                                                #sqr_add_c2(a,7,6,c2,c3,c1)
-        $LD             r5,`6*$BNSZ`(r4)
-        $UMULL          r7,r5,r6
-        $UMULH          r8,r5,r6
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r0
-        addc            r10,r7,r10
-        adde            r11,r8,r11
-        addze           r9,r9
-        $ST             r10,`13*$BNSZ`(r3)      #r[13]=c2;
-                                                #sqr_add_c(a,7,c3,c1,c2);
-        $UMULL          r7,r6,r6
-        $UMULH          r8,r6,r6
-        addc            r11,r7,r11
-        adde            r9,r8,r9
-        $ST             r11,`14*$BNSZ`(r3)      #r[14]=c3;
-        $ST             r9, `15*$BNSZ`(r3)      #r[15]=c1;
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_mul_comba4" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4
-.bn_mul_comba4:
-#
-# This is an optimized version of the bn_mul_comba4 routine.
-#
-# void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-# r3 contains r
-# r4 contains a
-# r5 contains b
-# r6, r7 are the 2 BN_ULONGs being multiplied.
-# r8, r9 are the results of the 32x32 giving 64 multiply.
-# r10, r11, r12 are the equivalents of c1, c2, and c3.
-#
-        xor     r0,r0,r0                #r0=0. Used in addze below.
-                                        #mul_add_c(a[0],b[0],c1,c2,c3);
-        $LD     r6,`0*$BNSZ`(r4)                
-        $LD     r7,`0*$BNSZ`(r5)                
-        $UMULL  r10,r6,r7               
-        $UMULH  r11,r6,r7               
-        $ST     r10,`0*$BNSZ`(r3)       #r[0]=c1
-                                        #mul_add_c(a[0],b[1],c2,c3,c1);
-        $LD     r7,`1*$BNSZ`(r5)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r8,r11
-        adde    r12,r9,r0
-        addze   r10,r0
-                                        #mul_add_c(a[1],b[0],c2,c3,c1);
-        $LD     r6, `1*$BNSZ`(r4)               
-        $LD     r7, `0*$BNSZ`(r5)               
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r8,r11
-        adde    r12,r9,r12
-        addze   r10,r10
-        $ST     r11,`1*$BNSZ`(r3)       #r[1]=c2
-                                        #mul_add_c(a[2],b[0],c3,c1,c2);
-        $LD     r6,`2*$BNSZ`(r4)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r8,r12
-        adde    r10,r9,r10
-        addze   r11,r0
-                                        #mul_add_c(a[1],b[1],c3,c1,c2);
-        $LD     r6,`1*$BNSZ`(r4)                
-        $LD     r7,`1*$BNSZ`(r5)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r8,r12
-        adde    r10,r9,r10
-        addze   r11,r11
-                                        #mul_add_c(a[0],b[2],c3,c1,c2);
-        $LD     r6,`0*$BNSZ`(r4)                
-        $LD     r7,`2*$BNSZ`(r5)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r8,r12
-        adde    r10,r9,r10
-        addze   r11,r11
-        $ST     r12,`2*$BNSZ`(r3)       #r[2]=c3
-                                        #mul_add_c(a[0],b[3],c1,c2,c3);
-        $LD     r7,`3*$BNSZ`(r5)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r8,r10
-        adde    r11,r9,r11
-        addze   r12,r0
-                                        #mul_add_c(a[1],b[2],c1,c2,c3);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r8,r10
-        adde    r11,r9,r11
-        addze   r12,r12
-                                        #mul_add_c(a[2],b[1],c1,c2,c3);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r8,r10
-        adde    r11,r9,r11
-        addze   r12,r12
-                                        #mul_add_c(a[3],b[0],c1,c2,c3);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`0*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r8,r10
-        adde    r11,r9,r11
-        addze   r12,r12
-        $ST     r10,`3*$BNSZ`(r3)       #r[3]=c1
-                                        #mul_add_c(a[3],b[1],c2,c3,c1);
-        $LD     r7,`1*$BNSZ`(r5)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r8,r11
-        adde    r12,r9,r12
-        addze   r10,r0
-                                        #mul_add_c(a[2],b[2],c2,c3,c1);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r8,r11
-        adde    r12,r9,r12
-        addze   r10,r10
-                                        #mul_add_c(a[1],b[3],c2,c3,c1);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r8,r11
-        adde    r12,r9,r12
-        addze   r10,r10
-        $ST     r11,`4*$BNSZ`(r3)       #r[4]=c2
-                                        #mul_add_c(a[2],b[3],c3,c1,c2);
-        $LD     r6,`2*$BNSZ`(r4)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r8,r12
-        adde    r10,r9,r10
-        addze   r11,r0
-                                        #mul_add_c(a[3],b[2],c3,c1,c2);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r8,r12
-        adde    r10,r9,r10
-        addze   r11,r11
-        $ST     r12,`5*$BNSZ`(r3)       #r[5]=c3
-                                        #mul_add_c(a[3],b[3],c1,c2,c3);
-        $LD     r7,`3*$BNSZ`(r5)                
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r8,r10
-        adde    r11,r9,r11
-        $ST     r10,`6*$BNSZ`(r3)       #r[6]=c1
-        $ST     r11,`7*$BNSZ`(r3)       #r[7]=c2
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_mul_comba8" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-        
-.align  4
-.bn_mul_comba8:
-#
-# Optimized version of the bn_mul_comba8 routine.
-#
-# void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-# r3 contains r
-# r4 contains a
-# r5 contains b
-# r6, r7 are the 2 BN_ULONGs being multiplied.
-# r8, r9 are the results of the 32x32 giving 64 multiply.
-# r10, r11, r12 are the equivalents of c1, c2, and c3.
-#
-        xor     r0,r0,r0                #r0=0. Used in addze below.
-        
-                                        #mul_add_c(a[0],b[0],c1,c2,c3);
-        $LD     r6,`0*$BNSZ`(r4)        #a[0]
-        $LD     r7,`0*$BNSZ`(r5)        #b[0]
-        $UMULL  r10,r6,r7
-        $UMULH  r11,r6,r7
-        $ST     r10,`0*$BNSZ`(r3)       #r[0]=c1;
-                                        #mul_add_c(a[0],b[1],c2,c3,c1);
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        addze   r12,r9                  # since we didnt set r12 to zero before.
-        addze   r10,r0
-                                        #mul_add_c(a[1],b[0],c2,c3,c1);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`0*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-        $ST     r11,`1*$BNSZ`(r3)       #r[1]=c2;
-                                        #mul_add_c(a[2],b[0],c3,c1,c2);
-        $LD     r6,`2*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r0
-                                        #mul_add_c(a[1],b[1],c3,c1,c2);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[0],b[2],c3,c1,c2);
-        $LD     r6,`0*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-        $ST     r12,`2*$BNSZ`(r3)       #r[2]=c3;
-                                        #mul_add_c(a[0],b[3],c1,c2,c3);
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r0
-                                        #mul_add_c(a[1],b[2],c1,c2,c3);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                
-                                        #mul_add_c(a[2],b[1],c1,c2,c3);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[3],b[0],c1,c2,c3);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`0*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-        $ST     r10,`3*$BNSZ`(r3)       #r[3]=c1;
-                                        #mul_add_c(a[4],b[0],c2,c3,c1);
-        $LD     r6,`4*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r0
-                                        #mul_add_c(a[3],b[1],c2,c3,c1);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[2],b[2],c2,c3,c1);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[1],b[3],c2,c3,c1);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[0],b[4],c2,c3,c1);
-        $LD     r6,`0*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-        $ST     r11,`4*$BNSZ`(r3)       #r[4]=c2;
-                                        #mul_add_c(a[0],b[5],c3,c1,c2);
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r0
-                                        #mul_add_c(a[1],b[4],c3,c1,c2);
-        $LD     r6,`1*$BNSZ`(r4)                
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[2],b[3],c3,c1,c2);
-        $LD     r6,`2*$BNSZ`(r4)                
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[3],b[2],c3,c1,c2);
-        $LD     r6,`3*$BNSZ`(r4)                
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[4],b[1],c3,c1,c2);
-        $LD     r6,`4*$BNSZ`(r4)                
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[5],b[0],c3,c1,c2);
-        $LD     r6,`5*$BNSZ`(r4)                
-        $LD     r7,`0*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-        $ST     r12,`5*$BNSZ`(r3)       #r[5]=c3;
-                                        #mul_add_c(a[6],b[0],c1,c2,c3);
-        $LD     r6,`6*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r0
-                                        #mul_add_c(a[5],b[1],c1,c2,c3);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[4],b[2],c1,c2,c3);
-        $LD     r6,`4*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[3],b[3],c1,c2,c3);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[2],b[4],c1,c2,c3);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[1],b[5],c1,c2,c3);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[0],b[6],c1,c2,c3);
-        $LD     r6,`0*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-        $ST     r10,`6*$BNSZ`(r3)       #r[6]=c1;
-                                        #mul_add_c(a[0],b[7],c2,c3,c1);
-        $LD     r7,`7*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r0
-                                        #mul_add_c(a[1],b[6],c2,c3,c1);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[2],b[5],c2,c3,c1);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[3],b[4],c2,c3,c1);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[4],b[3],c2,c3,c1);
-        $LD     r6,`4*$BNSZ`(r4)
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[5],b[2],c2,c3,c1);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[6],b[1],c2,c3,c1);
-        $LD     r6,`6*$BNSZ`(r4)
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[7],b[0],c2,c3,c1);
-        $LD     r6,`7*$BNSZ`(r4)
-        $LD     r7,`0*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-        $ST     r11,`7*$BNSZ`(r3)       #r[7]=c2;
-                                        #mul_add_c(a[7],b[1],c3,c1,c2);
-        $LD     r7,`1*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r0
-                                        #mul_add_c(a[6],b[2],c3,c1,c2);
-        $LD     r6,`6*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[5],b[3],c3,c1,c2);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[4],b[4],c3,c1,c2);
-        $LD     r6,`4*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[3],b[5],c3,c1,c2);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[2],b[6],c3,c1,c2);
-        $LD     r6,`2*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[1],b[7],c3,c1,c2);
-        $LD     r6,`1*$BNSZ`(r4)
-        $LD     r7,`7*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-        $ST     r12,`8*$BNSZ`(r3)       #r[8]=c3;
-                                        #mul_add_c(a[2],b[7],c1,c2,c3);
-        $LD     r6,`2*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r0
-                                        #mul_add_c(a[3],b[6],c1,c2,c3);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[4],b[5],c1,c2,c3);
-        $LD     r6,`4*$BNSZ`(r4)
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[5],b[4],c1,c2,c3);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[6],b[3],c1,c2,c3);
-        $LD     r6,`6*$BNSZ`(r4)
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[7],b[2],c1,c2,c3);
-        $LD     r6,`7*$BNSZ`(r4)
-        $LD     r7,`2*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-        $ST     r10,`9*$BNSZ`(r3)       #r[9]=c1;
-                                        #mul_add_c(a[7],b[3],c2,c3,c1);
-        $LD     r7,`3*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r0
-                                        #mul_add_c(a[6],b[4],c2,c3,c1);
-        $LD     r6,`6*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[5],b[5],c2,c3,c1);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[4],b[6],c2,c3,c1);
-        $LD     r6,`4*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-                                        #mul_add_c(a[3],b[7],c2,c3,c1);
-        $LD     r6,`3*$BNSZ`(r4)
-        $LD     r7,`7*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-        $ST     r11,`10*$BNSZ`(r3)      #r[10]=c2;
-                                        #mul_add_c(a[4],b[7],c3,c1,c2);
-        $LD     r6,`4*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r0
-                                        #mul_add_c(a[5],b[6],c3,c1,c2);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[6],b[5],c3,c1,c2);
-        $LD     r6,`6*$BNSZ`(r4)
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-                                        #mul_add_c(a[7],b[4],c3,c1,c2);
-        $LD     r6,`7*$BNSZ`(r4)
-        $LD     r7,`4*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        addze   r11,r11
-        $ST     r12,`11*$BNSZ`(r3)      #r[11]=c3;
-                                        #mul_add_c(a[7],b[5],c1,c2,c3);
-        $LD     r7,`5*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r0
-                                        #mul_add_c(a[6],b[6],c1,c2,c3);
-        $LD     r6,`6*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-                                        #mul_add_c(a[5],b[7],c1,c2,c3);
-        $LD     r6,`5*$BNSZ`(r4)
-        $LD     r7,`7*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r10,r10,r8
-        adde    r11,r11,r9
-        addze   r12,r12
-        $ST     r10,`12*$BNSZ`(r3)      #r[12]=c1;
-                                        #mul_add_c(a[6],b[7],c2,c3,c1);
-        $LD     r6,`6*$BNSZ`(r4)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r0
-                                        #mul_add_c(a[7],b[6],c2,c3,c1);
-        $LD     r6,`7*$BNSZ`(r4)
-        $LD     r7,`6*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r11,r11,r8
-        adde    r12,r12,r9
-        addze   r10,r10
-        $ST     r11,`13*$BNSZ`(r3)      #r[13]=c2;
-                                        #mul_add_c(a[7],b[7],c3,c1,c2);
-        $LD     r7,`7*$BNSZ`(r5)
-        $UMULL  r8,r6,r7
-        $UMULH  r9,r6,r7
-        addc    r12,r12,r8
-        adde    r10,r10,r9
-        $ST     r12,`14*$BNSZ`(r3)      #r[14]=c3;
-        $ST     r10,`15*$BNSZ`(r3)      #r[15]=c1;
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_sub_words" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-#
-.align  4
-.bn_sub_words:
-#
-#       Handcoded version of bn_sub_words
-#
-#BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-#
-#       r3 = r
-#       r4 = a
-#       r5 = b
-#       r6 = n
-#
-#       Note:   No loop unrolling done since this is not a performance
-#               critical loop.
-        xor     r0,r0,r0        #set r0 = 0
-#
-#       check for r6 = 0 AND set carry bit.
-#
-        subfc.  r7,r0,r6        # If r6 is 0 then result is 0.
-                                # if r6 > 0 then result !=0
-                                # In either case carry bit is set.
-        bc      BO_IF,CR0_EQ,Lppcasm_sub_adios
-        addi    r4,r4,-$BNSZ
-        addi    r3,r3,-$BNSZ
-        addi    r5,r5,-$BNSZ
-        mtctr   r6
-Lppcasm_sub_mainloop:   
-        $LDU    r7,$BNSZ(r4)
-        $LDU    r8,$BNSZ(r5)
-        subfe   r6,r8,r7        # r6 = r7+carry bit + onescomplement(r8)
-                                # if carry = 1 this is r7-r8. Else it
-                                # is r7-r8 -1 as we need.
-        $STU    r6,$BNSZ(r3)
-        bc      BO_dCTR_NZERO,CR0_EQ,Lppcasm_sub_mainloop
-Lppcasm_sub_adios:      
-        subfze  r3,r0           # if carry bit is set then r3 = 0 else -1
-        andi.   r3,r3,1         # keep only last bit.
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_add_words" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4
-.bn_add_words:
-#
-#       Handcoded version of bn_add_words
-#
-#BN_ULONG bn_add_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-#
-#       r3 = r
-#       r4 = a
-#       r5 = b
-#       r6 = n
-#
-#       Note:   No loop unrolling done since this is not a performance
-#               critical loop.
-        xor     r0,r0,r0
-#
-#       check for r6 = 0. Is this needed?
-#
-        addic.  r6,r6,0         #test r6 and clear carry bit.
-        bc      BO_IF,CR0_EQ,Lppcasm_add_adios
-        addi    r4,r4,-$BNSZ
-        addi    r3,r3,-$BNSZ
-        addi    r5,r5,-$BNSZ
-        mtctr   r6
-Lppcasm_add_mainloop:   
-        $LDU    r7,$BNSZ(r4)
-        $LDU    r8,$BNSZ(r5)
-        adde    r8,r7,r8
-        $STU    r8,$BNSZ(r3)
-        bc      BO_dCTR_NZERO,CR0_EQ,Lppcasm_add_mainloop
-Lppcasm_add_adios:      
-        addze   r3,r0                   #return carry bit.
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_div_words" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4
-.bn_div_words:
-#
-#       This is a cleaned up version of code generated by
-#       the AIX compiler. The only optimization is to use
-#       the PPC instruction to count leading zeros instead
-#       of call to num_bits_word. Since this was compiled
-#       only at level -O2 we can possibly squeeze it more?
-#       
-#       r3 = h
-#       r4 = l
-#       r5 = d
-        
-        $UCMPI  0,r5,0                  # compare r5 and 0
-        bc      BO_IF_NOT,CR0_EQ,Lppcasm_div1   # proceed if d!=0
-        li      r3,-1                   # d=0 return -1
-        bclr    BO_ALWAYS,CR0_LT        
-Lppcasm_div1:
-        xor     r0,r0,r0                #r0=0
-        li      r8,$BITS
-        $CNTLZ. r7,r5                   #r7 = num leading 0s in d.
-        bc      BO_IF,CR0_EQ,Lppcasm_div2       #proceed if no leading zeros
-        subf    r8,r7,r8                #r8 = BN_num_bits_word(d)
-        $SHR.   r9,r3,r8                #are there any bits above r8'th?
-        $TR     16,r9,r0                #if there're, signal to dump core...
-Lppcasm_div2:
-        $UCMP   0,r3,r5                 #h>=d?
-        bc      BO_IF,CR0_LT,Lppcasm_div3       #goto Lppcasm_div3 if not
-        subf    r3,r5,r3                #h-=d ; 
-Lppcasm_div3:                           #r7 = BN_BITS2-i. so r7=i
-        cmpi    0,0,r7,0                # is (i == 0)?
-        bc      BO_IF,CR0_EQ,Lppcasm_div4
-        $SHL    r3,r3,r7                # h = (h<< i)
-        $SHR    r8,r4,r8                # r8 = (l >> BN_BITS2 -i)
-        $SHL    r5,r5,r7                # d<<=i
-        or      r3,r3,r8                # h = (h<<i)|(l>>(BN_BITS2-i))
-        $SHL    r4,r4,r7                # l <<=i
-Lppcasm_div4:
-        $SHRI   r9,r5,`$BITS/2`         # r9 = dh
-                                        # dl will be computed when needed
-                                        # as it saves registers.
-        li      r6,2                    #r6=2
-        mtctr   r6                      #counter will be in count.
-Lppcasm_divouterloop: 
-        $SHRI   r8,r3,`$BITS/2`         #r8 = (h>>BN_BITS4)
-        $SHRI   r11,r4,`$BITS/2`        #r11= (l&BN_MASK2h)>>BN_BITS4
-                                        # compute here for innerloop.
-        $UCMP   0,r8,r9                 # is (h>>BN_BITS4)==dh
-        bc      BO_IF_NOT,CR0_EQ,Lppcasm_div5   # goto Lppcasm_div5 if not
-        li      r8,-1
-        $CLRU   r8,r8,`$BITS/2`         #q = BN_MASK2l 
-        b       Lppcasm_div6
-Lppcasm_div5:
-        $UDIV   r8,r3,r9                #q = h/dh
-Lppcasm_div6:
-        $UMULL  r12,r9,r8               #th = q*dh
-        $CLRU   r10,r5,`$BITS/2`        #r10=dl
-        $UMULL  r6,r8,r10               #tl = q*dl
-        
-Lppcasm_divinnerloop:
-        subf    r10,r12,r3              #t = h -th
-        $SHRI   r7,r10,`$BITS/2`        #r7= (t &BN_MASK2H), sort of...
-        addic.  r7,r7,0                 #test if r7 == 0. used below.
-                                        # now want to compute
-                                        # r7 = (t<<BN_BITS4)|((l&BN_MASK2h)>>BN_BITS4)
-                                        # the following 2 instructions do that
-        $SHLI   r7,r10,`$BITS/2`        # r7 = (t<<BN_BITS4)
-        or      r7,r7,r11               # r7|=((l&BN_MASK2h)>>BN_BITS4)
-        $UCMP   1,r6,r7                 # compare (tl <= r7)
-        bc      BO_IF_NOT,CR0_EQ,Lppcasm_divinnerexit
-        bc      BO_IF_NOT,CR1_FEX,Lppcasm_divinnerexit
-        addi    r8,r8,-1                #q--
-        subf    r12,r9,r12              #th -=dh
-        $CLRU   r10,r5,`$BITS/2`        #r10=dl. t is no longer needed in loop.
-        subf    r6,r10,r6               #tl -=dl
-        b       Lppcasm_divinnerloop
-Lppcasm_divinnerexit:
-        $SHRI   r10,r6,`$BITS/2`        #t=(tl>>BN_BITS4)
-        $SHLI   r11,r6,`$BITS/2`        #tl=(tl<<BN_BITS4)&BN_MASK2h;
-        $UCMP   1,r4,r11                # compare l and tl
-        add     r12,r12,r10             # th+=t
-        bc      BO_IF_NOT,CR1_FX,Lppcasm_div7  # if (l>=tl) goto Lppcasm_div7
-        addi    r12,r12,1               # th++
-Lppcasm_div7:
-        subf    r11,r11,r4              #r11=l-tl
-        $UCMP   1,r3,r12                #compare h and th
-        bc      BO_IF_NOT,CR1_FX,Lppcasm_div8   #if (h>=th) goto Lppcasm_div8
-        addi    r8,r8,-1                # q--
-        add     r3,r5,r3                # h+=d
-Lppcasm_div8:
-        subf    r12,r12,r3              #r12 = h-th
-        $SHLI   r4,r11,`$BITS/2`        #l=(l&BN_MASK2l)<<BN_BITS4
-                                        # want to compute
-                                        # h = ((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2
-                                        # the following 2 instructions will do this.
-        $INSR   r11,r12,`$BITS/2`,`$BITS/2`     # r11 is the value we want rotated $BITS/2.
-        $ROTL   r3,r11,`$BITS/2`        # rotate by $BITS/2 and store in r3
-        bc      BO_dCTR_ZERO,CR0_EQ,Lppcasm_div9#if (count==0) break ;
-        $SHLI   r0,r8,`$BITS/2`         #ret =q<<BN_BITS4
-        b       Lppcasm_divouterloop
-Lppcasm_div9:
-        or      r3,r8,r0
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_sqr_words" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4
-.bn_sqr_words:
-#
-#       Optimized version of bn_sqr_words
-#
-#       void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
-#
-#       r3 = r
-#       r4 = a
-#       r5 = n
-#
-#       r6 = a[i].
-#       r7,r8 = product.
-#
-#       No unrolling done here. Not performance critical.
-        addic.  r5,r5,0                 #test r5.
-        bc      BO_IF,CR0_EQ,Lppcasm_sqr_adios
-        addi    r4,r4,-$BNSZ
-        addi    r3,r3,-$BNSZ
-        mtctr   r5
-Lppcasm_sqr_mainloop:   
-                                        #sqr(r[0],r[1],a[0]);
-        $LDU    r6,$BNSZ(r4)
-        $UMULL  r7,r6,r6
-        $UMULH  r8,r6,r6
-        $STU    r7,$BNSZ(r3)
-        $STU    r8,$BNSZ(r3)
-        bc      BO_dCTR_NZERO,CR0_EQ,Lppcasm_sqr_mainloop
-Lppcasm_sqr_adios:      
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_mul_words" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4       
-.bn_mul_words:
-#
-# BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-#
-# r3 = rp
-# r4 = ap
-# r5 = num
-# r6 = w
-        xor     r0,r0,r0
-        xor     r12,r12,r12             # used for carry
-        rlwinm. r7,r5,30,2,31           # num >> 2
-        bc      BO_IF,CR0_EQ,Lppcasm_mw_REM
-        mtctr   r7
-Lppcasm_mw_LOOP:        
-                                        #mul(rp[0],ap[0],w,c1);
-        $LD     r8,`0*$BNSZ`(r4)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        addc    r9,r9,r12
-        #addze  r10,r10                 #carry is NOT ignored.
-                                        #will be taken care of
-                                        #in second spin below
-                                        #using adde.
-        $ST     r9,`0*$BNSZ`(r3)
-                                        #mul(rp[1],ap[1],w,c1);
-        $LD     r8,`1*$BNSZ`(r4)        
-        $UMULL  r11,r6,r8
-        $UMULH  r12,r6,r8
-        adde    r11,r11,r10
-        #addze  r12,r12
-        $ST     r11,`1*$BNSZ`(r3)
-                                        #mul(rp[2],ap[2],w,c1);
-        $LD     r8,`2*$BNSZ`(r4)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        adde    r9,r9,r12
-        #addze  r10,r10
-        $ST     r9,`2*$BNSZ`(r3)
-                                        #mul_add(rp[3],ap[3],w,c1);
-        $LD     r8,`3*$BNSZ`(r4)
-        $UMULL  r11,r6,r8
-        $UMULH  r12,r6,r8
-        adde    r11,r11,r10
-        addze   r12,r12                 #this spin we collect carry into
-                                        #r12
-        $ST     r11,`3*$BNSZ`(r3)
-        
-        addi    r3,r3,`4*$BNSZ`
-        addi    r4,r4,`4*$BNSZ`
-        bc      BO_dCTR_NZERO,CR0_EQ,Lppcasm_mw_LOOP
-Lppcasm_mw_REM:
-        andi.   r5,r5,0x3
-        bc      BO_IF,CR0_EQ,Lppcasm_mw_OVER
-                                        #mul(rp[0],ap[0],w,c1);
-        $LD     r8,`0*$BNSZ`(r4)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        addc    r9,r9,r12
-        addze   r10,r10
-        $ST     r9,`0*$BNSZ`(r3)
-        addi    r12,r10,0
-        
-        addi    r5,r5,-1
-        cmpli   0,0,r5,0
-        bc      BO_IF,CR0_EQ,Lppcasm_mw_OVER
-        
-                                        #mul(rp[1],ap[1],w,c1);
-        $LD     r8,`1*$BNSZ`(r4)        
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        addc    r9,r9,r12
-        addze   r10,r10
-        $ST     r9,`1*$BNSZ`(r3)
-        addi    r12,r10,0
-        
-        addi    r5,r5,-1
-        cmpli   0,0,r5,0
-        bc      BO_IF,CR0_EQ,Lppcasm_mw_OVER
-        
-                                        #mul_add(rp[2],ap[2],w,c1);
-        $LD     r8,`2*$BNSZ`(r4)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        addc    r9,r9,r12
-        addze   r10,r10
-        $ST     r9,`2*$BNSZ`(r3)
-        addi    r12,r10,0
-                
-Lppcasm_mw_OVER:        
-        addi    r3,r12,0
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-#
-#       NOTE:   The following label name should be changed to
-#               "bn_mul_add_words" i.e. remove the first dot
-#               for the gcc compiler. This should be automatically
-#               done in the build
-#
-.align  4
-.bn_mul_add_words:
-#
-# BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-#
-# r3 = rp
-# r4 = ap
-# r5 = num
-# r6 = w
-#
-# empirical evidence suggests that unrolled version performs best!!
-#
-        xor     r0,r0,r0                #r0 = 0
-        xor     r12,r12,r12             #r12 = 0 . used for carry               
-        rlwinm. r7,r5,30,2,31           # num >> 2
-        bc      BO_IF,CR0_EQ,Lppcasm_maw_leftover       # if (num < 4) go LPPCASM_maw_leftover
-        mtctr   r7
-Lppcasm_maw_mainloop:   
-                                        #mul_add(rp[0],ap[0],w,c1);
-        $LD     r8,`0*$BNSZ`(r4)
-        $LD     r11,`0*$BNSZ`(r3)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        addc    r9,r9,r12               #r12 is carry.
-        addze   r10,r10
-        addc    r9,r9,r11
-        #addze  r10,r10
-                                        #the above instruction addze
-                                        #is NOT needed. Carry will NOT
-                                        #be ignored. It's not affected
-                                        #by multiply and will be collected
-                                        #in the next spin
-        $ST     r9,`0*$BNSZ`(r3)
-        
-                                        #mul_add(rp[1],ap[1],w,c1);
-        $LD     r8,`1*$BNSZ`(r4)        
-        $LD     r9,`1*$BNSZ`(r3)
-        $UMULL  r11,r6,r8
-        $UMULH  r12,r6,r8
-        adde    r11,r11,r10             #r10 is carry.
-        addze   r12,r12
-        addc    r11,r11,r9
-        #addze  r12,r12
-        $ST     r11,`1*$BNSZ`(r3)
-        
-                                        #mul_add(rp[2],ap[2],w,c1);
-        $LD     r8,`2*$BNSZ`(r4)
-        $UMULL  r9,r6,r8
-        $LD     r11,`2*$BNSZ`(r3)
-        $UMULH  r10,r6,r8
-        adde    r9,r9,r12
-        addze   r10,r10
-        addc    r9,r9,r11
-        #addze  r10,r10
-        $ST     r9,`2*$BNSZ`(r3)
-        
-                                        #mul_add(rp[3],ap[3],w,c1);
-        $LD     r8,`3*$BNSZ`(r4)
-        $UMULL  r11,r6,r8
-        $LD     r9,`3*$BNSZ`(r3)
-        $UMULH  r12,r6,r8
-        adde    r11,r11,r10
-        addze   r12,r12
-        addc    r11,r11,r9
-        addze   r12,r12
-        $ST     r11,`3*$BNSZ`(r3)
-        addi    r3,r3,`4*$BNSZ`
-        addi    r4,r4,`4*$BNSZ`
-        bc      BO_dCTR_NZERO,CR0_EQ,Lppcasm_maw_mainloop
-        
-Lppcasm_maw_leftover:
-        andi.   r5,r5,0x3
-        bc      BO_IF,CR0_EQ,Lppcasm_maw_adios
-        addi    r3,r3,-$BNSZ
-        addi    r4,r4,-$BNSZ
-                                        #mul_add(rp[0],ap[0],w,c1);
-        mtctr   r5
-        $LDU    r8,$BNSZ(r4)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        $LDU    r11,$BNSZ(r3)
-        addc    r9,r9,r11
-        addze   r10,r10
-        addc    r9,r9,r12
-        addze   r12,r10
-        $ST     r9,0(r3)
-        
-        bc      BO_dCTR_ZERO,CR0_EQ,Lppcasm_maw_adios
-                                        #mul_add(rp[1],ap[1],w,c1);
-        $LDU    r8,$BNSZ(r4)    
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        $LDU    r11,$BNSZ(r3)
-        addc    r9,r9,r11
-        addze   r10,r10
-        addc    r9,r9,r12
-        addze   r12,r10
-        $ST     r9,0(r3)
-        
-        bc      BO_dCTR_ZERO,CR0_EQ,Lppcasm_maw_adios
-                                        #mul_add(rp[2],ap[2],w,c1);
-        $LDU    r8,$BNSZ(r4)
-        $UMULL  r9,r6,r8
-        $UMULH  r10,r6,r8
-        $LDU    r11,$BNSZ(r3)
-        addc    r9,r9,r11
-        addze   r10,r10
-        addc    r9,r9,r12
-        addze   r12,r10
-        $ST     r9,0(r3)
-                
-Lppcasm_maw_adios:      
-        addi    r3,r12,0
-        bclr    BO_ALWAYS,CR0_LT
-        .long   0x00000000
-        .align  4
-EOF
-        $data =~ s/\`([^\`]*)\`/eval $1/gem;
-        # if some assembler chokes on some simplified mnemonic,
-        # this is the spot to fix it up, e.g.:
-        # GNU as doesn't seem to accept cmplw, 32-bit unsigned compare
-        $data =~ s/^(\s*)cmplw(\s+)([^,]+),(.*)/$1cmpl$2$3,0,$4/gm;
-        # assembler X doesn't accept li, load immediate value
-        #$data =~ s/^(\s*)li(\s+)([^,]+),(.*)/$1addi$2$3,0,$4/gm;
-        return($data);
-}
diff --git a/src/lib/libcrypto/bn/asm/ppc64-mont.pl b/src/lib/libcrypto/bn/asm/ppc64-mont.pl
deleted file mode 100644
index 3449b35855..0000000000
--- a/src/lib/libcrypto/bn/asm/ppc64-mont.pl
+++ /dev/null
@@ -1,918 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# December 2007
-# The reason for undertaken effort is basically following. Even though
-# Power 6 CPU operates at incredible 4.7GHz clock frequency, its PKI
-# performance was observed to be less than impressive, essentially as
-# fast as 1.8GHz PPC970, or 2.6 times(!) slower than one would hope.
-# Well, it's not surprising that IBM had to make some sacrifices to
-# boost the clock frequency that much, but no overall improvement?
-# Having observed how much difference did switching to FPU make on
-# UltraSPARC, playing same stunt on Power 6 appeared appropriate...
-# Unfortunately the resulting performance improvement is not as
-# impressive, ~30%, and in absolute terms is still very far from what
-# one would expect from 4.7GHz CPU. There is a chance that I'm doing
-# something wrong, but in the lack of assembler level micro-profiling
-# data or at least decent platform guide I can't tell... Or better
-# results might be achieved with VMX... Anyway, this module provides
-# *worse* performance on other PowerPC implementations, ~40-15% slower
-# on PPC970 depending on key length and ~40% slower on Power 5 for all
-# key lengths. As it's obviously inappropriate as "best all-round"
-# alternative, it has to be complemented with run-time CPU family
-# detection. Oh! It should also be noted that unlike other PowerPC
-# implementation IALU ppc-mont.pl module performs *suboptimaly* on
-# >=1024-bit key lengths on Power 6. It should also be noted that
-# *everything* said so far applies to 64-bit builds! As far as 32-bit
-# application executed on 64-bit CPU goes, this module is likely to
-# become preferred choice, because it's easy to adapt it for such
-# case and *is* faster than 32-bit ppc-mont.pl on *all* processors.
-# February 2008
-# Micro-profiling assisted optimization results in ~15% improvement
-# over original ppc64-mont.pl version, or overall ~50% improvement
-# over ppc.pl module on Power 6. If compared to ppc-mont.pl on same
-# Power 6 CPU, this module is 5-150% faster depending on key length,
-# [hereafter] more for longer keys. But if compared to ppc-mont.pl
-# on 1.8GHz PPC970, it's only 5-55% faster. Still far from impressive
-# in absolute terms, but it's apparently the way Power 6 is...
-$flavour = shift;
-if ($flavour =~ /32/) {
-        $SIZE_T=4;
-        $RZONE= 224;
-        $FRAME= $SIZE_T*12+8*12;
-        $fname= "bn_mul_mont_ppc64";
-        $STUX=  "stwux";        # store indexed and update
-        $PUSH=  "stw";
-        $POP=   "lwz";
-        die "not implemented yet";
-} elsif ($flavour =~ /64/) {
-        $SIZE_T=8;
-        $RZONE= 288;
-        $FRAME= $SIZE_T*12+8*12;
-        $fname= "bn_mul_mont";
-        # same as above, but 64-bit mnemonics...
-        $STUX=  "stdux";        # store indexed and update
-        $PUSH=  "std";
-        $POP=   "ld";
-} else { die "nonsense $flavour"; }
-$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
-( $xlate="${dir}ppc-xlate.pl" and -f $xlate ) or
-( $xlate="${dir}../../perlasm/ppc-xlate.pl" and -f $xlate) or
-die "can't locate ppc-xlate.pl";
-open STDOUT,"| $^X $xlate $flavour ".shift || die "can't call $xlate: $!";
-$FRAME=($FRAME+63)&~63;
-$TRANSFER=16*8;
-$carry="r0";
-$sp="r1";
-$toc="r2";
-$rp="r3";       $ovf="r3";
-$ap="r4";
-$bp="r5";
-$np="r6";
-$n0="r7";
-$num="r8";
-$rp="r9";       # $rp is reassigned
-$tp="r10";
-$j="r11";
-$i="r12";
-# non-volatile registers
-$nap_d="r14";   # interleaved ap and np in double format
-$a0="r15";      # ap[0]
-$t0="r16";      # temporary registers
-$t1="r17";
-$t2="r18";
-$t3="r19";
-$t4="r20";
-$t5="r21";
-$t6="r22";
-$t7="r23";
-# PPC offers enough register bank capacity to unroll inner loops twice
-#
-#     ..A3A2A1A0
-#           dcba
-#    -----------
-#            A0a
-#           A0b
-#          A0c
-#         A0d
-#          A1a
-#         A1b
-#        A1c
-#       A1d
-#        A2a
-#       A2b
-#      A2c
-#     A2d
-#      A3a
-#     A3b
-#    A3c
-#   A3d
-#    ..a
-#   ..b
-#
-$ba="f0";       $bb="f1";       $bc="f2";       $bd="f3";
-$na="f4";       $nb="f5";       $nc="f6";       $nd="f7";
-$dota="f8";     $dotb="f9";
-$A0="f10";      $A1="f11";      $A2="f12";      $A3="f13";
-$N0="f14";      $N1="f15";      $N2="f16";      $N3="f17";
-$T0a="f18";     $T0b="f19";
-$T1a="f20";     $T1b="f21";
-$T2a="f22";     $T2b="f23";
-$T3a="f24";     $T3b="f25";
-# sp----------->+-------------------------------+
-#               | saved sp                      |
-#               +-------------------------------+
-#               |                               |
-#               +-------------------------------+
-#               | 10 saved gpr, r14-r23         |
-#               .                               .
-#               .                               .
-#   +12*size_t  +-------------------------------+
-#               | 12 saved fpr, f14-f25         |
-#               .                               .
-#               .                               .
-#   +12*8       +-------------------------------+
-#               | padding to 64 byte boundary   |
-#               .                               .
-#   +X          +-------------------------------+
-#               | 16 gpr<->fpr transfer zone    |
-#               .                               .
-#               .                               .
-#   +16*8       +-------------------------------+
-#               | __int64 tmp[-1]               |
-#               +-------------------------------+
-#               | __int64 tmp[num]              |
-#               .                               .
-#               .                               .
-#               .                               .
-#   +(num+1)*8  +-------------------------------+
-#               | padding to 64 byte boundary   |
-#               .                               .
-#   +X          +-------------------------------+
-#               | double nap_d[4*num]           |
-#               .                               .
-#               .                               .
-#               .                               .
-#               +-------------------------------+
-$code=<<___;
-.machine "any"
-.text
-.globl  .$fname
-.align  5
-.$fname:
-        cmpwi   $num,4
-        mr      $rp,r3          ; $rp is reassigned
-        li      r3,0            ; possible "not handled" return code
-        bltlr-
-        andi.   r0,$num,1       ; $num has to be even
-        bnelr-
-        slwi    $num,$num,3     ; num*=8
-        li      $i,-4096
-        slwi    $tp,$num,2      ; place for {an}p_{lh}[num], i.e. 4*num
-        add     $tp,$tp,$num    ; place for tp[num+1]
-        addi    $tp,$tp,`$FRAME+$TRANSFER+8+64+$RZONE`
-        subf    $tp,$tp,$sp     ; $sp-$tp
-        and     $tp,$tp,$i      ; minimize TLB usage
-        subf    $tp,$sp,$tp     ; $tp-$sp
-        $STUX   $sp,$sp,$tp     ; alloca
-        $PUSH   r14,`2*$SIZE_T`($sp)
-        $PUSH   r15,`3*$SIZE_T`($sp)
-        $PUSH   r16,`4*$SIZE_T`($sp)
-        $PUSH   r17,`5*$SIZE_T`($sp)
-        $PUSH   r18,`6*$SIZE_T`($sp)
-        $PUSH   r19,`7*$SIZE_T`($sp)
-        $PUSH   r20,`8*$SIZE_T`($sp)
-        $PUSH   r21,`9*$SIZE_T`($sp)
-        $PUSH   r22,`10*$SIZE_T`($sp)
-        $PUSH   r23,`11*$SIZE_T`($sp)
-        stfd    f14,`12*$SIZE_T+0`($sp)
-        stfd    f15,`12*$SIZE_T+8`($sp)
-        stfd    f16,`12*$SIZE_T+16`($sp)
-        stfd    f17,`12*$SIZE_T+24`($sp)
-        stfd    f18,`12*$SIZE_T+32`($sp)
-        stfd    f19,`12*$SIZE_T+40`($sp)
-        stfd    f20,`12*$SIZE_T+48`($sp)
-        stfd    f21,`12*$SIZE_T+56`($sp)
-        stfd    f22,`12*$SIZE_T+64`($sp)
-        stfd    f23,`12*$SIZE_T+72`($sp)
-        stfd    f24,`12*$SIZE_T+80`($sp)
-        stfd    f25,`12*$SIZE_T+88`($sp)
-        ld      $a0,0($ap)      ; pull ap[0] value
-        ld      $n0,0($n0)      ; pull n0[0] value
-        ld      $t3,0($bp)      ; bp[0]
-        addi    $tp,$sp,`$FRAME+$TRANSFER+8+64`
-        li      $i,-64
-        add     $nap_d,$tp,$num
-        and     $nap_d,$nap_d,$i        ; align to 64 bytes
-        mulld   $t7,$a0,$t3     ; ap[0]*bp[0]
-        ; nap_d is off by 1, because it's used with stfdu/lfdu
-        addi    $nap_d,$nap_d,-8
-        srwi    $j,$num,`3+1`   ; counter register, num/2
-        mulld   $t7,$t7,$n0     ; tp[0]*n0
-        addi    $j,$j,-1
-        addi    $tp,$sp,`$FRAME+$TRANSFER-8`
-        li      $carry,0
-        mtctr   $j
-        ; transfer bp[0] to FPU as 4x16-bit values
-        extrdi  $t0,$t3,16,48
-        extrdi  $t1,$t3,16,32
-        extrdi  $t2,$t3,16,16
-        extrdi  $t3,$t3,16,0
-        std     $t0,`$FRAME+0`($sp)
-        std     $t1,`$FRAME+8`($sp)
-        std     $t2,`$FRAME+16`($sp)
-        std     $t3,`$FRAME+24`($sp)
-        ; transfer (ap[0]*bp[0])*n0 to FPU as 4x16-bit values
-        extrdi  $t4,$t7,16,48
-        extrdi  $t5,$t7,16,32
-        extrdi  $t6,$t7,16,16
-        extrdi  $t7,$t7,16,0
-        std     $t4,`$FRAME+32`($sp)
-        std     $t5,`$FRAME+40`($sp)
-        std     $t6,`$FRAME+48`($sp)
-        std     $t7,`$FRAME+56`($sp)
-        lwz     $t0,4($ap)              ; load a[j] as 32-bit word pair
-        lwz     $t1,0($ap)
-        lwz     $t2,12($ap)             ; load a[j+1] as 32-bit word pair
-        lwz     $t3,8($ap)
-        lwz     $t4,4($np)              ; load n[j] as 32-bit word pair
-        lwz     $t5,0($np)
-        lwz     $t6,12($np)             ; load n[j+1] as 32-bit word pair
-        lwz     $t7,8($np)
-        lfd     $ba,`$FRAME+0`($sp)
-        lfd     $bb,`$FRAME+8`($sp)
-        lfd     $bc,`$FRAME+16`($sp)
-        lfd     $bd,`$FRAME+24`($sp)
-        lfd     $na,`$FRAME+32`($sp)
-        lfd     $nb,`$FRAME+40`($sp)
-        lfd     $nc,`$FRAME+48`($sp)
-        lfd     $nd,`$FRAME+56`($sp)
-        std     $t0,`$FRAME+64`($sp)
-        std     $t1,`$FRAME+72`($sp)
-        std     $t2,`$FRAME+80`($sp)
-        std     $t3,`$FRAME+88`($sp)
-        std     $t4,`$FRAME+96`($sp)
-        std     $t5,`$FRAME+104`($sp)
-        std     $t6,`$FRAME+112`($sp)
-        std     $t7,`$FRAME+120`($sp)
-        fcfid   $ba,$ba
-        fcfid   $bb,$bb
-        fcfid   $bc,$bc
-        fcfid   $bd,$bd
-        fcfid   $na,$na
-        fcfid   $nb,$nb
-        fcfid   $nc,$nc
-        fcfid   $nd,$nd
-        lfd     $A0,`$FRAME+64`($sp)
-        lfd     $A1,`$FRAME+72`($sp)
-        lfd     $A2,`$FRAME+80`($sp)
-        lfd     $A3,`$FRAME+88`($sp)
-        lfd     $N0,`$FRAME+96`($sp)
-        lfd     $N1,`$FRAME+104`($sp)
-        lfd     $N2,`$FRAME+112`($sp)
-        lfd     $N3,`$FRAME+120`($sp)
-        fcfid   $A0,$A0
-        fcfid   $A1,$A1
-        fcfid   $A2,$A2
-        fcfid   $A3,$A3
-        fcfid   $N0,$N0
-        fcfid   $N1,$N1
-        fcfid   $N2,$N2
-        fcfid   $N3,$N3
-        addi    $ap,$ap,16
-        addi    $np,$np,16
-        fmul    $T1a,$A1,$ba
-        fmul    $T1b,$A1,$bb
-        stfd    $A0,8($nap_d)           ; save a[j] in double format
-        stfd    $A1,16($nap_d)
-        fmul    $T2a,$A2,$ba
-        fmul    $T2b,$A2,$bb
-        stfd    $A2,24($nap_d)          ; save a[j+1] in double format
-        stfd    $A3,32($nap_d)
-        fmul    $T3a,$A3,$ba
-        fmul    $T3b,$A3,$bb
-        stfd    $N0,40($nap_d)          ; save n[j] in double format
-        stfd    $N1,48($nap_d)
-        fmul    $T0a,$A0,$ba
-        fmul    $T0b,$A0,$bb
-        stfd    $N2,56($nap_d)          ; save n[j+1] in double format
-        stfdu   $N3,64($nap_d)
-        fmadd   $T1a,$A0,$bc,$T1a
-        fmadd   $T1b,$A0,$bd,$T1b
-        fmadd   $T2a,$A1,$bc,$T2a
-        fmadd   $T2b,$A1,$bd,$T2b
-        fmadd   $T3a,$A2,$bc,$T3a
-        fmadd   $T3b,$A2,$bd,$T3b
-        fmul    $dota,$A3,$bc
-        fmul    $dotb,$A3,$bd
-        fmadd   $T1a,$N1,$na,$T1a
-        fmadd   $T1b,$N1,$nb,$T1b
-        fmadd   $T2a,$N2,$na,$T2a
-        fmadd   $T2b,$N2,$nb,$T2b
-        fmadd   $T3a,$N3,$na,$T3a
-        fmadd   $T3b,$N3,$nb,$T3b
-        fmadd   $T0a,$N0,$na,$T0a
-        fmadd   $T0b,$N0,$nb,$T0b
-        fmadd   $T1a,$N0,$nc,$T1a
-        fmadd   $T1b,$N0,$nd,$T1b
-        fmadd   $T2a,$N1,$nc,$T2a
-        fmadd   $T2b,$N1,$nd,$T2b
-        fmadd   $T3a,$N2,$nc,$T3a
-        fmadd   $T3b,$N2,$nd,$T3b
-        fmadd   $dota,$N3,$nc,$dota
-        fmadd   $dotb,$N3,$nd,$dotb
-        fctid   $T0a,$T0a
-        fctid   $T0b,$T0b
-        fctid   $T1a,$T1a
-        fctid   $T1b,$T1b
-        fctid   $T2a,$T2a
-        fctid   $T2b,$T2b
-        fctid   $T3a,$T3a
-        fctid   $T3b,$T3b
-        stfd    $T0a,`$FRAME+0`($sp)
-        stfd    $T0b,`$FRAME+8`($sp)
-        stfd    $T1a,`$FRAME+16`($sp)
-        stfd    $T1b,`$FRAME+24`($sp)
-        stfd    $T2a,`$FRAME+32`($sp)
-        stfd    $T2b,`$FRAME+40`($sp)
-        stfd    $T3a,`$FRAME+48`($sp)
-        stfd    $T3b,`$FRAME+56`($sp)
-.align  5
-L1st:
-        lwz     $t0,4($ap)              ; load a[j] as 32-bit word pair
-        lwz     $t1,0($ap)
-        lwz     $t2,12($ap)             ; load a[j+1] as 32-bit word pair
-        lwz     $t3,8($ap)
-        lwz     $t4,4($np)              ; load n[j] as 32-bit word pair
-        lwz     $t5,0($np)
-        lwz     $t6,12($np)             ; load n[j+1] as 32-bit word pair
-        lwz     $t7,8($np)
-        std     $t0,`$FRAME+64`($sp)
-        std     $t1,`$FRAME+72`($sp)
-        std     $t2,`$FRAME+80`($sp)
-        std     $t3,`$FRAME+88`($sp)
-        std     $t4,`$FRAME+96`($sp)
-        std     $t5,`$FRAME+104`($sp)
-        std     $t6,`$FRAME+112`($sp)
-        std     $t7,`$FRAME+120`($sp)
-        ld      $t0,`$FRAME+0`($sp)
-        ld      $t1,`$FRAME+8`($sp)
-        ld      $t2,`$FRAME+16`($sp)
-        ld      $t3,`$FRAME+24`($sp)
-        ld      $t4,`$FRAME+32`($sp)
-        ld      $t5,`$FRAME+40`($sp)
-        ld      $t6,`$FRAME+48`($sp)
-        ld      $t7,`$FRAME+56`($sp)
-        lfd     $A0,`$FRAME+64`($sp)
-        lfd     $A1,`$FRAME+72`($sp)
-        lfd     $A2,`$FRAME+80`($sp)
-        lfd     $A3,`$FRAME+88`($sp)
-        lfd     $N0,`$FRAME+96`($sp)
-        lfd     $N1,`$FRAME+104`($sp)
-        lfd     $N2,`$FRAME+112`($sp)
-        lfd     $N3,`$FRAME+120`($sp)
-        fcfid   $A0,$A0
-        fcfid   $A1,$A1
-        fcfid   $A2,$A2
-        fcfid   $A3,$A3
-        fcfid   $N0,$N0
-        fcfid   $N1,$N1
-        fcfid   $N2,$N2
-        fcfid   $N3,$N3
-        addi    $ap,$ap,16
-        addi    $np,$np,16
-        fmul    $T1a,$A1,$ba
-        fmul    $T1b,$A1,$bb
-        fmul    $T2a,$A2,$ba
-        fmul    $T2b,$A2,$bb
-        stfd    $A0,8($nap_d)           ; save a[j] in double format
-        stfd    $A1,16($nap_d)
-        fmul    $T3a,$A3,$ba
-        fmul    $T3b,$A3,$bb
-        fmadd   $T0a,$A0,$ba,$dota
-        fmadd   $T0b,$A0,$bb,$dotb
-        stfd    $A2,24($nap_d)          ; save a[j+1] in double format
-        stfd    $A3,32($nap_d)
-        fmadd   $T1a,$A0,$bc,$T1a
-        fmadd   $T1b,$A0,$bd,$T1b
-        fmadd   $T2a,$A1,$bc,$T2a
-        fmadd   $T2b,$A1,$bd,$T2b
-        stfd    $N0,40($nap_d)          ; save n[j] in double format
-        stfd    $N1,48($nap_d)
-        fmadd   $T3a,$A2,$bc,$T3a
-        fmadd   $T3b,$A2,$bd,$T3b
-         add    $t0,$t0,$carry          ; can not overflow
-        fmul    $dota,$A3,$bc
-        fmul    $dotb,$A3,$bd
-        stfd    $N2,56($nap_d)          ; save n[j+1] in double format
-        stfdu   $N3,64($nap_d)
-         srdi   $carry,$t0,16
-         add    $t1,$t1,$carry
-         srdi   $carry,$t1,16
-        fmadd   $T1a,$N1,$na,$T1a
-        fmadd   $T1b,$N1,$nb,$T1b
-         insrdi $t0,$t1,16,32
-        fmadd   $T2a,$N2,$na,$T2a
-        fmadd   $T2b,$N2,$nb,$T2b
-         add    $t2,$t2,$carry
-        fmadd   $T3a,$N3,$na,$T3a
-        fmadd   $T3b,$N3,$nb,$T3b
-         srdi   $carry,$t2,16
-        fmadd   $T0a,$N0,$na,$T0a
-        fmadd   $T0b,$N0,$nb,$T0b
-         insrdi $t0,$t2,16,16
-         add    $t3,$t3,$carry
-         srdi   $carry,$t3,16
-        fmadd   $T1a,$N0,$nc,$T1a
-        fmadd   $T1b,$N0,$nd,$T1b
-         insrdi $t0,$t3,16,0            ; 0..63 bits
-        fmadd   $T2a,$N1,$nc,$T2a
-        fmadd   $T2b,$N1,$nd,$T2b
-         add    $t4,$t4,$carry
-        fmadd   $T3a,$N2,$nc,$T3a
-        fmadd   $T3b,$N2,$nd,$T3b
-         srdi   $carry,$t4,16
-        fmadd   $dota,$N3,$nc,$dota
-        fmadd   $dotb,$N3,$nd,$dotb
-         add    $t5,$t5,$carry
-         srdi   $carry,$t5,16
-         insrdi $t4,$t5,16,32
-        fctid   $T0a,$T0a
-        fctid   $T0b,$T0b
-         add    $t6,$t6,$carry
-        fctid   $T1a,$T1a
-        fctid   $T1b,$T1b
-         srdi   $carry,$t6,16
-        fctid   $T2a,$T2a
-        fctid   $T2b,$T2b
-         insrdi $t4,$t6,16,16
-        fctid   $T3a,$T3a
-        fctid   $T3b,$T3b
-         add    $t7,$t7,$carry
-         insrdi $t4,$t7,16,0            ; 64..127 bits
-         srdi   $carry,$t7,16           ; upper 33 bits
-        stfd    $T0a,`$FRAME+0`($sp)
-        stfd    $T0b,`$FRAME+8`($sp)
-        stfd    $T1a,`$FRAME+16`($sp)
-        stfd    $T1b,`$FRAME+24`($sp)
-        stfd    $T2a,`$FRAME+32`($sp)
-        stfd    $T2b,`$FRAME+40`($sp)
-        stfd    $T3a,`$FRAME+48`($sp)
-        stfd    $T3b,`$FRAME+56`($sp)
-         std    $t0,8($tp)              ; tp[j-1]
-         stdu   $t4,16($tp)             ; tp[j]
-        bdnz-   L1st
-        fctid   $dota,$dota
-        fctid   $dotb,$dotb
-        ld      $t0,`$FRAME+0`($sp)
-        ld      $t1,`$FRAME+8`($sp)
-        ld      $t2,`$FRAME+16`($sp)
-        ld      $t3,`$FRAME+24`($sp)
-        ld      $t4,`$FRAME+32`($sp)
-        ld      $t5,`$FRAME+40`($sp)
-        ld      $t6,`$FRAME+48`($sp)
-        ld      $t7,`$FRAME+56`($sp)
-        stfd    $dota,`$FRAME+64`($sp)
-        stfd    $dotb,`$FRAME+72`($sp)
-        add     $t0,$t0,$carry          ; can not overflow
-        srdi    $carry,$t0,16
-        add     $t1,$t1,$carry
-        srdi    $carry,$t1,16
-        insrdi  $t0,$t1,16,32
-        add     $t2,$t2,$carry
-        srdi    $carry,$t2,16
-        insrdi  $t0,$t2,16,16
-        add     $t3,$t3,$carry
-        srdi    $carry,$t3,16
-        insrdi  $t0,$t3,16,0            ; 0..63 bits
-        add     $t4,$t4,$carry
-        srdi    $carry,$t4,16
-        add     $t5,$t5,$carry
-        srdi    $carry,$t5,16
-        insrdi  $t4,$t5,16,32
-        add     $t6,$t6,$carry
-        srdi    $carry,$t6,16
-        insrdi  $t4,$t6,16,16
-        add     $t7,$t7,$carry
-        insrdi  $t4,$t7,16,0            ; 64..127 bits
-        srdi    $carry,$t7,16           ; upper 33 bits
-        ld      $t6,`$FRAME+64`($sp)
-        ld      $t7,`$FRAME+72`($sp)
-        std     $t0,8($tp)              ; tp[j-1]
-        stdu    $t4,16($tp)             ; tp[j]
-        add     $t6,$t6,$carry          ; can not overflow
-        srdi    $carry,$t6,16
-        add     $t7,$t7,$carry
-        insrdi  $t6,$t7,48,0
-        srdi    $ovf,$t7,48
-        std     $t6,8($tp)              ; tp[num-1]
-        slwi    $t7,$num,2
-        subf    $nap_d,$t7,$nap_d       ; rewind pointer
-        li      $i,8                    ; i=1
-.align  5
-Louter:
-        ldx     $t3,$bp,$i      ; bp[i]
-        ld      $t6,`$FRAME+$TRANSFER+8`($sp)   ; tp[0]
-        mulld   $t7,$a0,$t3     ; ap[0]*bp[i]
-        addi    $tp,$sp,`$FRAME+$TRANSFER`
-        add     $t7,$t7,$t6     ; ap[0]*bp[i]+tp[0]
-        li      $carry,0
-        mulld   $t7,$t7,$n0     ; tp[0]*n0
-        mtctr   $j
-        ; transfer bp[i] to FPU as 4x16-bit values
-        extrdi  $t0,$t3,16,48
-        extrdi  $t1,$t3,16,32
-        extrdi  $t2,$t3,16,16
-        extrdi  $t3,$t3,16,0
-        std     $t0,`$FRAME+0`($sp)
-        std     $t1,`$FRAME+8`($sp)
-        std     $t2,`$FRAME+16`($sp)
-        std     $t3,`$FRAME+24`($sp)
-        ; transfer (ap[0]*bp[i]+tp[0])*n0 to FPU as 4x16-bit values
-        extrdi  $t4,$t7,16,48
-        extrdi  $t5,$t7,16,32
-        extrdi  $t6,$t7,16,16
-        extrdi  $t7,$t7,16,0
-        std     $t4,`$FRAME+32`($sp)
-        std     $t5,`$FRAME+40`($sp)
-        std     $t6,`$FRAME+48`($sp)
-        std     $t7,`$FRAME+56`($sp)
-        lfd     $A0,8($nap_d)           ; load a[j] in double format
-        lfd     $A1,16($nap_d)
-        lfd     $A2,24($nap_d)          ; load a[j+1] in double format
-        lfd     $A3,32($nap_d)
-        lfd     $N0,40($nap_d)          ; load n[j] in double format
-        lfd     $N1,48($nap_d)
-        lfd     $N2,56($nap_d)          ; load n[j+1] in double format
-        lfdu    $N3,64($nap_d)
-        lfd     $ba,`$FRAME+0`($sp)
-        lfd     $bb,`$FRAME+8`($sp)
-        lfd     $bc,`$FRAME+16`($sp)
-        lfd     $bd,`$FRAME+24`($sp)
-        lfd     $na,`$FRAME+32`($sp)
-        lfd     $nb,`$FRAME+40`($sp)
-        lfd     $nc,`$FRAME+48`($sp)
-        lfd     $nd,`$FRAME+56`($sp)
-        fcfid   $ba,$ba
-        fcfid   $bb,$bb
-        fcfid   $bc,$bc
-        fcfid   $bd,$bd
-        fcfid   $na,$na
-        fcfid   $nb,$nb
-        fcfid   $nc,$nc
-        fcfid   $nd,$nd
-        fmul    $T1a,$A1,$ba
-        fmul    $T1b,$A1,$bb
-        fmul    $T2a,$A2,$ba
-        fmul    $T2b,$A2,$bb
-        fmul    $T3a,$A3,$ba
-        fmul    $T3b,$A3,$bb
-        fmul    $T0a,$A0,$ba
-        fmul    $T0b,$A0,$bb
-        fmadd   $T1a,$A0,$bc,$T1a
-        fmadd   $T1b,$A0,$bd,$T1b
-        fmadd   $T2a,$A1,$bc,$T2a
-        fmadd   $T2b,$A1,$bd,$T2b
-        fmadd   $T3a,$A2,$bc,$T3a
-        fmadd   $T3b,$A2,$bd,$T3b
-        fmul    $dota,$A3,$bc
-        fmul    $dotb,$A3,$bd
-        fmadd   $T1a,$N1,$na,$T1a
-        fmadd   $T1b,$N1,$nb,$T1b
-         lfd    $A0,8($nap_d)           ; load a[j] in double format
-         lfd    $A1,16($nap_d)
-        fmadd   $T2a,$N2,$na,$T2a
-        fmadd   $T2b,$N2,$nb,$T2b
-         lfd    $A2,24($nap_d)          ; load a[j+1] in double format
-         lfd    $A3,32($nap_d)
-        fmadd   $T3a,$N3,$na,$T3a
-        fmadd   $T3b,$N3,$nb,$T3b
-        fmadd   $T0a,$N0,$na,$T0a
-        fmadd   $T0b,$N0,$nb,$T0b
-        fmadd   $T1a,$N0,$nc,$T1a
-        fmadd   $T1b,$N0,$nd,$T1b
-        fmadd   $T2a,$N1,$nc,$T2a
-        fmadd   $T2b,$N1,$nd,$T2b
-        fmadd   $T3a,$N2,$nc,$T3a
-        fmadd   $T3b,$N2,$nd,$T3b
-        fmadd   $dota,$N3,$nc,$dota
-        fmadd   $dotb,$N3,$nd,$dotb
-        fctid   $T0a,$T0a
-        fctid   $T0b,$T0b
-        fctid   $T1a,$T1a
-        fctid   $T1b,$T1b
-        fctid   $T2a,$T2a
-        fctid   $T2b,$T2b
-        fctid   $T3a,$T3a
-        fctid   $T3b,$T3b
-        stfd    $T0a,`$FRAME+0`($sp)
-        stfd    $T0b,`$FRAME+8`($sp)
-        stfd    $T1a,`$FRAME+16`($sp)
-        stfd    $T1b,`$FRAME+24`($sp)
-        stfd    $T2a,`$FRAME+32`($sp)
-        stfd    $T2b,`$FRAME+40`($sp)
-        stfd    $T3a,`$FRAME+48`($sp)
-        stfd    $T3b,`$FRAME+56`($sp)
-.align  5
-Linner:
-        fmul    $T1a,$A1,$ba
-        fmul    $T1b,$A1,$bb
-        fmul    $T2a,$A2,$ba
-        fmul    $T2b,$A2,$bb
-        lfd     $N0,40($nap_d)          ; load n[j] in double format
-        lfd     $N1,48($nap_d)
-        fmul    $T3a,$A3,$ba
-        fmul    $T3b,$A3,$bb
-        fmadd   $T0a,$A0,$ba,$dota
-        fmadd   $T0b,$A0,$bb,$dotb
-        lfd     $N2,56($nap_d)          ; load n[j+1] in double format
-        lfdu    $N3,64($nap_d)
-        fmadd   $T1a,$A0,$bc,$T1a
-        fmadd   $T1b,$A0,$bd,$T1b
-        fmadd   $T2a,$A1,$bc,$T2a
-        fmadd   $T2b,$A1,$bd,$T2b
-         lfd    $A0,8($nap_d)           ; load a[j] in double format
-         lfd    $A1,16($nap_d)
-        fmadd   $T3a,$A2,$bc,$T3a
-        fmadd   $T3b,$A2,$bd,$T3b
-        fmul    $dota,$A3,$bc
-        fmul    $dotb,$A3,$bd
-         lfd    $A2,24($nap_d)          ; load a[j+1] in double format
-         lfd    $A3,32($nap_d)
-        fmadd   $T1a,$N1,$na,$T1a
-        fmadd   $T1b,$N1,$nb,$T1b
-         ld     $t0,`$FRAME+0`($sp)
-         ld     $t1,`$FRAME+8`($sp)
-        fmadd   $T2a,$N2,$na,$T2a
-        fmadd   $T2b,$N2,$nb,$T2b
-         ld     $t2,`$FRAME+16`($sp)
-         ld     $t3,`$FRAME+24`($sp)
-        fmadd   $T3a,$N3,$na,$T3a
-        fmadd   $T3b,$N3,$nb,$T3b
-         add    $t0,$t0,$carry          ; can not overflow
-         ld     $t4,`$FRAME+32`($sp)
-         ld     $t5,`$FRAME+40`($sp)
-        fmadd   $T0a,$N0,$na,$T0a
-        fmadd   $T0b,$N0,$nb,$T0b
-         srdi   $carry,$t0,16
-         add    $t1,$t1,$carry
-         srdi   $carry,$t1,16
-         ld     $t6,`$FRAME+48`($sp)
-         ld     $t7,`$FRAME+56`($sp)
-        fmadd   $T1a,$N0,$nc,$T1a
-        fmadd   $T1b,$N0,$nd,$T1b
-         insrdi $t0,$t1,16,32
-         ld     $t1,8($tp)              ; tp[j]
-        fmadd   $T2a,$N1,$nc,$T2a
-        fmadd   $T2b,$N1,$nd,$T2b
-         add    $t2,$t2,$carry
-        fmadd   $T3a,$N2,$nc,$T3a
-        fmadd   $T3b,$N2,$nd,$T3b
-         srdi   $carry,$t2,16
-         insrdi $t0,$t2,16,16
-        fmadd   $dota,$N3,$nc,$dota
-        fmadd   $dotb,$N3,$nd,$dotb
-         add    $t3,$t3,$carry
-         ldu    $t2,16($tp)             ; tp[j+1]
-         srdi   $carry,$t3,16
-         insrdi $t0,$t3,16,0            ; 0..63 bits
-         add    $t4,$t4,$carry
-        fctid   $T0a,$T0a
-        fctid   $T0b,$T0b
-         srdi   $carry,$t4,16
-        fctid   $T1a,$T1a
-        fctid   $T1b,$T1b
-         add    $t5,$t5,$carry
-        fctid   $T2a,$T2a
-        fctid   $T2b,$T2b
-         srdi   $carry,$t5,16
-         insrdi $t4,$t5,16,32
-        fctid   $T3a,$T3a
-        fctid   $T3b,$T3b
-         add    $t6,$t6,$carry
-         srdi   $carry,$t6,16
-         insrdi $t4,$t6,16,16
-        stfd    $T0a,`$FRAME+0`($sp)
-        stfd    $T0b,`$FRAME+8`($sp)
-         add    $t7,$t7,$carry
-         addc   $t3,$t0,$t1
-        stfd    $T1a,`$FRAME+16`($sp)
-        stfd    $T1b,`$FRAME+24`($sp)
-         insrdi $t4,$t7,16,0            ; 64..127 bits
-         srdi   $carry,$t7,16           ; upper 33 bits
-        stfd    $T2a,`$FRAME+32`($sp)
-        stfd    $T2b,`$FRAME+40`($sp)
-         adde   $t5,$t4,$t2
-        stfd    $T3a,`$FRAME+48`($sp)
-        stfd    $T3b,`$FRAME+56`($sp)
-         addze  $carry,$carry
-         std    $t3,-16($tp)            ; tp[j-1]
-         std    $t5,-8($tp)             ; tp[j]
-        bdnz-   Linner
-        fctid   $dota,$dota
-        fctid   $dotb,$dotb
-        ld      $t0,`$FRAME+0`($sp)
-        ld      $t1,`$FRAME+8`($sp)
-        ld      $t2,`$FRAME+16`($sp)
-        ld      $t3,`$FRAME+24`($sp)
-        ld      $t4,`$FRAME+32`($sp)
-        ld      $t5,`$FRAME+40`($sp)
-        ld      $t6,`$FRAME+48`($sp)
-        ld      $t7,`$FRAME+56`($sp)
-        stfd    $dota,`$FRAME+64`($sp)
-        stfd    $dotb,`$FRAME+72`($sp)
-        add     $t0,$t0,$carry          ; can not overflow
-        srdi    $carry,$t0,16
-        add     $t1,$t1,$carry
-        srdi    $carry,$t1,16
-        insrdi  $t0,$t1,16,32
-        add     $t2,$t2,$carry
-        ld      $t1,8($tp)              ; tp[j]
-        srdi    $carry,$t2,16
-        insrdi  $t0,$t2,16,16
-        add     $t3,$t3,$carry
-        ldu     $t2,16($tp)             ; tp[j+1]
-        srdi    $carry,$t3,16
-        insrdi  $t0,$t3,16,0            ; 0..63 bits
-        add     $t4,$t4,$carry
-        srdi    $carry,$t4,16
-        add     $t5,$t5,$carry
-        srdi    $carry,$t5,16
-        insrdi  $t4,$t5,16,32
-        add     $t6,$t6,$carry
-        srdi    $carry,$t6,16
-        insrdi  $t4,$t6,16,16
-        add     $t7,$t7,$carry
-        insrdi  $t4,$t7,16,0            ; 64..127 bits
-        srdi    $carry,$t7,16           ; upper 33 bits
-        ld      $t6,`$FRAME+64`($sp)
-        ld      $t7,`$FRAME+72`($sp)
-        addc    $t3,$t0,$t1
-        adde    $t5,$t4,$t2
-        addze   $carry,$carry
-        std     $t3,-16($tp)            ; tp[j-1]
-        std     $t5,-8($tp)             ; tp[j]
-        add     $carry,$carry,$ovf      ; comsume upmost overflow
-        add     $t6,$t6,$carry          ; can not overflow
-        srdi    $carry,$t6,16
-        add     $t7,$t7,$carry
-        insrdi  $t6,$t7,48,0
-        srdi    $ovf,$t7,48
-        std     $t6,0($tp)              ; tp[num-1]
-        slwi    $t7,$num,2
-        addi    $i,$i,8
-        subf    $nap_d,$t7,$nap_d       ; rewind pointer
-        cmpw    $i,$num
-        blt-    Louter
-        subf    $np,$num,$np    ; rewind np
-        addi    $j,$j,1         ; restore counter
-        subfc   $i,$i,$i        ; j=0 and "clear" XER[CA]
-        addi    $tp,$sp,`$FRAME+$TRANSFER+8`
-        addi    $t4,$sp,`$FRAME+$TRANSFER+16`
-        addi    $t5,$np,8
-        addi    $t6,$rp,8
-        mtctr   $j
-.align  4
-Lsub:   ldx     $t0,$tp,$i
-        ldx     $t1,$np,$i
-        ldx     $t2,$t4,$i
-        ldx     $t3,$t5,$i
-        subfe   $t0,$t1,$t0     ; tp[j]-np[j]
-        subfe   $t2,$t3,$t2     ; tp[j+1]-np[j+1]
-        stdx    $t0,$rp,$i
-        stdx    $t2,$t6,$i
-        addi    $i,$i,16
-        bdnz-   Lsub
-        li      $i,0
-        subfe   $ovf,$i,$ovf    ; handle upmost overflow bit
-        and     $ap,$tp,$ovf
-        andc    $np,$rp,$ovf
-        or      $ap,$ap,$np     ; ap=borrow?tp:rp
-        addi    $t7,$ap,8
-        mtctr   $j
-.align  4
-Lcopy:                          ; copy or in-place refresh
-        ldx     $t0,$ap,$i
-        ldx     $t1,$t7,$i
-        std     $i,8($nap_d)    ; zap nap_d
-        std     $i,16($nap_d)
-        std     $i,24($nap_d)
-        std     $i,32($nap_d)
-        std     $i,40($nap_d)
-        std     $i,48($nap_d)
-        std     $i,56($nap_d)
-        stdu    $i,64($nap_d)
-        stdx    $t0,$rp,$i
-        stdx    $t1,$t6,$i
-        stdx    $i,$tp,$i       ; zap tp at once
-        stdx    $i,$t4,$i
-        addi    $i,$i,16
-        bdnz-   Lcopy
-        $POP    r14,`2*$SIZE_T`($sp)
-        $POP    r15,`3*$SIZE_T`($sp)
-        $POP    r16,`4*$SIZE_T`($sp)
-        $POP    r17,`5*$SIZE_T`($sp)
-        $POP    r18,`6*$SIZE_T`($sp)
-        $POP    r19,`7*$SIZE_T`($sp)
-        $POP    r20,`8*$SIZE_T`($sp)
-        $POP    r21,`9*$SIZE_T`($sp)
-        $POP    r22,`10*$SIZE_T`($sp)
-        $POP    r23,`11*$SIZE_T`($sp)
-        lfd     f14,`12*$SIZE_T+0`($sp)
-        lfd     f15,`12*$SIZE_T+8`($sp)
-        lfd     f16,`12*$SIZE_T+16`($sp)
-        lfd     f17,`12*$SIZE_T+24`($sp)
-        lfd     f18,`12*$SIZE_T+32`($sp)
-        lfd     f19,`12*$SIZE_T+40`($sp)
-        lfd     f20,`12*$SIZE_T+48`($sp)
-        lfd     f21,`12*$SIZE_T+56`($sp)
-        lfd     f22,`12*$SIZE_T+64`($sp)
-        lfd     f23,`12*$SIZE_T+72`($sp)
-        lfd     f24,`12*$SIZE_T+80`($sp)
-        lfd     f25,`12*$SIZE_T+88`($sp)
-        $POP    $sp,0($sp)
-        li      r3,1    ; signal "handled"
-        blr
-        .long   0
-.asciz  "Montgomery Multiplication for PPC64, CRYPTOGAMS by <appro\@fy.chalmers.se>"
-___
-$code =~ s/\`([^\`]*)\`/eval $1/gem;
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/s390x-mont.pl b/src/lib/libcrypto/bn/asm/s390x-mont.pl
deleted file mode 100644
index d23251033b..0000000000
--- a/src/lib/libcrypto/bn/asm/s390x-mont.pl
+++ /dev/null
@@ -1,225 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# April 2007.
-#
-# Performance improvement over vanilla C code varies from 85% to 45%
-# depending on key length and benchmark. Unfortunately in this context
-# these are not very impressive results [for code that utilizes "wide"
-# 64x64=128-bit multiplication, which is not commonly available to C
-# programmers], at least hand-coded bn_asm.c replacement is known to
-# provide 30-40% better results for longest keys. Well, on a second
-# thought it's not very surprising, because z-CPUs are single-issue
-# and _strictly_ in-order execution, while bn_mul_mont is more or less
-# dependent on CPU ability to pipe-line instructions and have several
-# of them "in-flight" at the same time. I mean while other methods,
-# for example Karatsuba, aim to minimize amount of multiplications at
-# the cost of other operations increase, bn_mul_mont aim to neatly
-# "overlap" multiplications and the other operations [and on most
-# platforms even minimize the amount of the other operations, in
-# particular references to memory]. But it's possible to improve this
-# module performance by implementing dedicated squaring code-path and
-# possibly by unrolling loops...
-# January 2009.
-#
-# Reschedule to minimize/avoid Address Generation Interlock hazard,
-# make inner loops counter-based.
-$mn0="%r0";
-$num="%r1";
-# int bn_mul_mont(
-$rp="%r2";              # BN_ULONG *rp,
-$ap="%r3";              # const BN_ULONG *ap,
-$bp="%r4";              # const BN_ULONG *bp,
-$np="%r5";              # const BN_ULONG *np,
-$n0="%r6";              # const BN_ULONG *n0,
-#$num="160(%r15)"       # int num);
-$bi="%r2";      # zaps rp
-$j="%r7";
-$ahi="%r8";
-$alo="%r9";
-$nhi="%r10";
-$nlo="%r11";
-$AHI="%r12";
-$NHI="%r13";
-$count="%r14";
-$sp="%r15";
-$code.=<<___;
-.text
-.globl  bn_mul_mont
-.type   bn_mul_mont,\@function
-bn_mul_mont:
-        lgf     $num,164($sp)   # pull $num
-        sla     $num,3          # $num to enumerate bytes
-        la      $bp,0($num,$bp)
-        stg     %r2,16($sp)
-        cghi    $num,16         #
-        lghi    %r2,0           #
-        blr     %r14            # if($num<16) return 0;
-        cghi    $num,128        #
-        bhr     %r14            # if($num>128) return 0;
-        stmg    %r3,%r15,24($sp)
-        lghi    $rp,-160-8      # leave room for carry bit
-        lcgr    $j,$num         # -$num
-        lgr     %r0,$sp
-        la      $rp,0($rp,$sp)
-        la      $sp,0($j,$rp)   # alloca
-        stg     %r0,0($sp)      # back chain
-        sra     $num,3          # restore $num
-        la      $bp,0($j,$bp)   # restore $bp
-        ahi     $num,-1         # adjust $num for inner loop
-        lg      $n0,0($n0)      # pull n0
-        lg      $bi,0($bp)
-        lg      $alo,0($ap)
-        mlgr    $ahi,$bi        # ap[0]*bp[0]
-        lgr     $AHI,$ahi
-        lgr     $mn0,$alo       # "tp[0]"*n0
-        msgr    $mn0,$n0
-        lg      $nlo,0($np)     #
-        mlgr    $nhi,$mn0       # np[0]*m1
-        algr    $nlo,$alo       # +="tp[0]"
-        lghi    $NHI,0
-        alcgr   $NHI,$nhi
-        la      $j,8(%r0)       # j=1
-        lr      $count,$num
-.align  16
-.L1st:
-        lg      $alo,0($j,$ap)
-        mlgr    $ahi,$bi        # ap[j]*bp[0]
-        algr    $alo,$AHI
-        lghi    $AHI,0
-        alcgr   $AHI,$ahi
-        lg      $nlo,0($j,$np)
-        mlgr    $nhi,$mn0       # np[j]*m1
-        algr    $nlo,$NHI
-        lghi    $NHI,0
-        alcgr   $nhi,$NHI       # +="tp[j]"
-        algr    $nlo,$alo
-        alcgr   $NHI,$nhi
-        stg     $nlo,160-8($j,$sp)      # tp[j-1]=
-        la      $j,8($j)        # j++
-        brct    $count,.L1st
-        algr    $NHI,$AHI
-        lghi    $AHI,0
-        alcgr   $AHI,$AHI       # upmost overflow bit
-        stg     $NHI,160-8($j,$sp)
-        stg     $AHI,160($j,$sp)
-        la      $bp,8($bp)      # bp++
-.Louter:
-        lg      $bi,0($bp)      # bp[i]
-        lg      $alo,0($ap)
-        mlgr    $ahi,$bi        # ap[0]*bp[i]
-        alg     $alo,160($sp)   # +=tp[0]
-        lghi    $AHI,0
-        alcgr   $AHI,$ahi
-        lgr     $mn0,$alo
-        msgr    $mn0,$n0        # tp[0]*n0
-        lg      $nlo,0($np)     # np[0]
-        mlgr    $nhi,$mn0       # np[0]*m1
-        algr    $nlo,$alo       # +="tp[0]"
-        lghi    $NHI,0
-        alcgr   $NHI,$nhi
-        la      $j,8(%r0)       # j=1
-        lr      $count,$num
-.align  16
-.Linner:
-        lg      $alo,0($j,$ap)
-        mlgr    $ahi,$bi        # ap[j]*bp[i]
-        algr    $alo,$AHI
-        lghi    $AHI,0
-        alcgr   $ahi,$AHI
-        alg     $alo,160($j,$sp)# +=tp[j]
-        alcgr   $AHI,$ahi
-        lg      $nlo,0($j,$np)
-        mlgr    $nhi,$mn0       # np[j]*m1
-        algr    $nlo,$NHI
-        lghi    $NHI,0
-        alcgr   $nhi,$NHI
-        algr    $nlo,$alo       # +="tp[j]"
-        alcgr   $NHI,$nhi
-        stg     $nlo,160-8($j,$sp)      # tp[j-1]=
-        la      $j,8($j)        # j++
-        brct    $count,.Linner
-        algr    $NHI,$AHI
-        lghi    $AHI,0
-        alcgr   $AHI,$AHI
-        alg     $NHI,160($j,$sp)# accumulate previous upmost overflow bit
-        lghi    $ahi,0
-        alcgr   $AHI,$ahi       # new upmost overflow bit
-        stg     $NHI,160-8($j,$sp)
-        stg     $AHI,160($j,$sp)
-        la      $bp,8($bp)      # bp++
-        clg     $bp,160+8+32($j,$sp)    # compare to &bp[num]
-        jne     .Louter
-        lg      $rp,160+8+16($j,$sp)    # reincarnate rp
-        la      $ap,160($sp)
-        ahi     $num,1          # restore $num, incidentally clears "borrow"
-        la      $j,0(%r0)
-        lr      $count,$num
-.Lsub:  lg      $alo,0($j,$ap)
-        slbg    $alo,0($j,$np)
-        stg     $alo,0($j,$rp)
-        la      $j,8($j)
-        brct    $count,.Lsub
-        lghi    $ahi,0
-        slbgr   $AHI,$ahi       # handle upmost carry
-        ngr     $ap,$AHI
-        lghi    $np,-1
-        xgr     $np,$AHI
-        ngr     $np,$rp
-        ogr     $ap,$np         # ap=borrow?tp:rp
-        la      $j,0(%r0)
-        lgr     $count,$num
-.Lcopy: lg      $alo,0($j,$ap)  # copy or in-place refresh
-        stg     $j,160($j,$sp)  # zap tp
-        stg     $alo,0($j,$rp)
-        la      $j,8($j)
-        brct    $count,.Lcopy
-        la      %r1,160+8+48($j,$sp)
-        lmg     %r6,%r15,0(%r1)
-        lghi    %r2,1           # signal "processed"
-        br      %r14
-.size   bn_mul_mont,.-bn_mul_mont
-.string "Montgomery Multiplication for s390x, CRYPTOGAMS by <appro\@openssl.org>"
-___
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/s390x.S b/src/lib/libcrypto/bn/asm/s390x.S
deleted file mode 100755
index 8f45f5d513..0000000000
--- a/src/lib/libcrypto/bn/asm/s390x.S
+++ /dev/null
@@ -1,678 +0,0 @@
-.ident "s390x.S, version 1.0"
-// ====================================================================
-// Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-// project.
-//
-// Rights for redistribution and usage in source and binary forms are
-// granted according to the OpenSSL license. Warranty of any kind is
-// disclaimed.
-// ====================================================================
-.text
-#define zero    %r0
-// BN_ULONG bn_mul_add_words(BN_ULONG *r2,BN_ULONG *r3,int r4,BN_ULONG r5);
-.globl  bn_mul_add_words
-.type   bn_mul_add_words,@function
-.align  4
-bn_mul_add_words:
-        lghi    zero,0          // zero = 0
-        la      %r1,0(%r2)      // put rp aside
-        lghi    %r2,0           // i=0;
-        ltgfr   %r4,%r4
-        bler    %r14            // if (len<=0) return 0;
-        stmg    %r6,%r10,48(%r15)
-        lghi    %r8,0           // carry = 0
-        srag    %r10,%r4,2      // cnt=len/4
-        jz      .Loop1_madd
-.Loop4_madd:
-        lg      %r7,0(%r2,%r3)  // ap[i]
-        mlgr    %r6,%r5         // *=w
-        algr    %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
-        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
-        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
-        alcgr   %r8,zero
-        alg     %r9,24(%r2,%r1)
-        alcgr   %r8,zero
-        stg     %r9,24(%r2,%r1)
-        la      %r2,32(%r2)     // i+=4
-        brct    %r10,.Loop4_madd
-        lghi    %r10,3
-        nr      %r4,%r10        // cnt=len%4
-        jz      .Lend_madd
-.Loop1_madd:
-        lg      %r7,0(%r2,%r3)  // ap[i]
-        mlgr    %r6,%r5         // *=w
-        algr    %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    %r4,.Loop1_madd
-.Lend_madd:
-        lgr     %r2,%r8
-        lmg     %r6,%r10,48(%r15)
-        br      %r14
-.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);
-.globl  bn_mul_words
-.type   bn_mul_words,@function
-.align  4
-bn_mul_words:
-        lghi    zero,0          // zero = 0
-        la      %r1,0(%r2)      // put rp aside
-        lghi    %r2,0           // i=0;
-        ltgfr   %r4,%r4
-        bler    %r14            // if (len<=0) return 0;
-        stmg    %r6,%r10,48(%r15)
-        lghi    %r8,0           // carry = 0
-        srag    %r10,%r4,2      // cnt=len/4
-        jz      .Loop1_mul
-.Loop4_mul:
-        lg      %r7,0(%r2,%r3)  // ap[i]
-        mlgr    %r6,%r5         // *=w
-        algr    %r7,%r8         // +=carry
-        alcgr   %r6,zero
-        stg     %r7,0(%r2,%r1)  // rp[i]=
-        lg      %r9,8(%r2,%r3)
-        mlgr    %r8,%r5
-        algr    %r9,%r6
-        alcgr   %r8,zero
-        stg     %r9,8(%r2,%r1)
-        lg      %r7,16(%r2,%r3)
-        mlgr    %r6,%r5
-        algr    %r7,%r8
-        alcgr   %r6,zero
-        stg     %r7,16(%r2,%r1)
-        lg      %r9,24(%r2,%r3)
-        mlgr    %r8,%r5
-        algr    %r9,%r6
-        alcgr   %r8,zero
-        stg     %r9,24(%r2,%r1)
-        la      %r2,32(%r2)     // i+=4
-        brct    %r10,.Loop4_mul
-        lghi    %r10,3
-        nr      %r4,%r10        // cnt=len%4
-        jz      .Lend_mul
-.Loop1_mul:
-        lg      %r7,0(%r2,%r3)  // ap[i]
-        mlgr    %r6,%r5         // *=w
-        algr    %r7,%r8         // +=carry
-        alcgr   %r6,zero
-        stg     %r7,0(%r2,%r1)  // rp[i]=
-        lgr     %r8,%r6
-        la      %r2,8(%r2)      // i++
-        brct    %r4,.Loop1_mul
-.Lend_mul:
-        lgr     %r2,%r8
-        lmg     %r6,%r10,48(%r15)
-        br      %r14
-.size   bn_mul_words,.-bn_mul_words
-// void bn_sqr_words(BN_ULONG *r2,BN_ULONG *r2,int r4)
-.globl  bn_sqr_words
-.type   bn_sqr_words,@function
-.align  4
-bn_sqr_words:
-        ltgfr   %r4,%r4
-        bler    %r14
-        stmg    %r6,%r7,48(%r15)
-        srag    %r1,%r4,2       // cnt=len/4
-        jz      .Loop1_sqr
-.Loop4_sqr:
-        lg      %r7,0(%r3)
-        mlgr    %r6,%r7
-        stg     %r7,0(%r2)
-        stg     %r6,8(%r2)
-        lg      %r7,8(%r3)
-        mlgr    %r6,%r7
-        stg     %r7,16(%r2)
-        stg     %r6,24(%r2)
-        lg      %r7,16(%r3)
-        mlgr    %r6,%r7
-        stg     %r7,32(%r2)
-        stg     %r6,40(%r2)
-        lg      %r7,24(%r3)
-        mlgr    %r6,%r7
-        stg     %r7,48(%r2)
-        stg     %r6,56(%r2)
-        la      %r3,32(%r3)
-        la      %r2,64(%r2)
-        brct    %r1,.Loop4_sqr
-        lghi    %r1,3
-        nr      %r4,%r1         // cnt=len%4
-        jz      .Lend_sqr
-.Loop1_sqr:
-        lg      %r7,0(%r3)
-        mlgr    %r6,%r7
-        stg     %r7,0(%r2)
-        stg     %r6,8(%r2)
-        la      %r3,8(%r3)
-        la      %r2,16(%r2)
-        brct    %r4,.Loop1_sqr
-.Lend_sqr:
-        lmg     %r6,%r7,48(%r15)
-        br      %r14
-.size   bn_sqr_words,.-bn_sqr_words
-// BN_ULONG bn_div_words(BN_ULONG h,BN_ULONG l,BN_ULONG d);
-.globl  bn_div_words
-.type   bn_div_words,@function
-.align  4
-bn_div_words:
-        dlgr    %r2,%r4
-        lgr     %r2,%r3
-        br      %r14
-.size   bn_div_words,.-bn_div_words
-// BN_ULONG bn_add_words(BN_ULONG *r2,BN_ULONG *r3,BN_ULONG *r4,int r5);
-.globl  bn_add_words
-.type   bn_add_words,@function
-.align  4
-bn_add_words:
-        la      %r1,0(%r2)      // put rp aside
-        lghi    %r2,0           // i=0
-        ltgfr   %r5,%r5
-        bler    %r14            // if (len<=0) return 0;
-        stg     %r6,48(%r15)
-        lghi    %r6,3
-        nr      %r6,%r5         // len%4
-        sra     %r5,2           // len/4, use sra because it sets condition code
-        jz      .Loop1_add      // carry is incidentally cleared if branch taken
-        algr    %r2,%r2         // clear carry
-.Loop4_add:
-        lg      %r0,0(%r2,%r3)
-        alcg    %r0,0(%r2,%r4)
-        stg     %r0,0(%r2,%r1)
-        lg      %r0,8(%r2,%r3)
-        alcg    %r0,8(%r2,%r4)
-        stg     %r0,8(%r2,%r1)
-        lg      %r0,16(%r2,%r3)
-        alcg    %r0,16(%r2,%r4)
-        stg     %r0,16(%r2,%r1)
-        lg      %r0,24(%r2,%r3)
-        alcg    %r0,24(%r2,%r4)
-        stg     %r0,24(%r2,%r1)
-        la      %r2,32(%r2)     // i+=4
-        brct    %r5,.Loop4_add
-        la      %r6,1(%r6)      // see if len%4 is zero ...
-        brct    %r6,.Loop1_add  // without touching condition code:-)
-.Lexit_add:
-        lghi    %r2,0
-        alcgr   %r2,%r2
-        lg      %r6,48(%r15)
-        br      %r14
-.Loop1_add:
-        lg      %r0,0(%r2,%r3)
-        alcg    %r0,0(%r2,%r4)
-        stg     %r0,0(%r2,%r1)
-        la      %r2,8(%r2)      // i++
-        brct    %r6,.Loop1_add
-        j       .Lexit_add
-.size   bn_add_words,.-bn_add_words
-// BN_ULONG bn_sub_words(BN_ULONG *r2,BN_ULONG *r3,BN_ULONG *r4,int r5);
-.globl  bn_sub_words
-.type   bn_sub_words,@function
-.align  4
-bn_sub_words:
-        la      %r1,0(%r2)      // put rp aside
-        lghi    %r2,0           // i=0
-        ltgfr   %r5,%r5
-        bler    %r14            // if (len<=0) return 0;
-        stg     %r6,48(%r15)
-        lghi    %r6,3
-        nr      %r6,%r5         // len%4
-        sra     %r5,2           // len/4, use sra because it sets condition code
-        jnz     .Loop4_sub      // borrow is incidentally cleared if branch taken
-        slgr    %r2,%r2         // clear borrow
-.Loop1_sub:
-        lg      %r0,0(%r2,%r3)
-        slbg    %r0,0(%r2,%r4)
-        stg     %r0,0(%r2,%r1)
-        la      %r2,8(%r2)      // i++
-        brct    %r6,.Loop1_sub
-        j       .Lexit_sub
-.Loop4_sub:
-        lg      %r0,0(%r2,%r3)
-        slbg    %r0,0(%r2,%r4)
-        stg     %r0,0(%r2,%r1)
-        lg      %r0,8(%r2,%r3)
-        slbg    %r0,8(%r2,%r4)
-        stg     %r0,8(%r2,%r1)
-        lg      %r0,16(%r2,%r3)
-        slbg    %r0,16(%r2,%r4)
-        stg     %r0,16(%r2,%r1)
-        lg      %r0,24(%r2,%r3)
-        slbg    %r0,24(%r2,%r4)
-        stg     %r0,24(%r2,%r1)
-        la      %r2,32(%r2)     // i+=4
-        brct    %r5,.Loop4_sub
-        la      %r6,1(%r6)      // see if len%4 is zero ...
-        brct    %r6,.Loop1_sub  // without touching condition code:-)
-.Lexit_sub:
-        lghi    %r2,0
-        slbgr   %r2,%r2
-        lcgr    %r2,%r2
-        lg      %r6,48(%r15)
-        br      %r14
-.size   bn_sub_words,.-bn_sub_words
-#define c1      %r1
-#define c2      %r5
-#define c3      %r8
-#define mul_add_c(ai,bi,c1,c2,c3)       \
-        lg      %r7,ai*8(%r3);          \
-        mlg     %r6,bi*8(%r4);          \
-        algr    c1,%r7;                 \
-        alcgr   c2,%r6;                 \
-        alcgr   c3,zero
-// void bn_mul_comba8(BN_ULONG *r2,BN_ULONG *r3,BN_ULONG *r4);
-.globl  bn_mul_comba8
-.type   bn_mul_comba8,@function
-.align  4
-bn_mul_comba8:
-        stmg    %r6,%r8,48(%r15)
-        lghi    c1,0
-        lghi    c2,0
-        lghi    c3,0
-        lghi    zero,0
-        mul_add_c(0,0,c1,c2,c3);
-        stg     c1,0*8(%r2)
-        lghi    c1,0
-        mul_add_c(0,1,c2,c3,c1);
-        mul_add_c(1,0,c2,c3,c1);
-        stg     c2,1*8(%r2)
-        lghi    c2,0
-        mul_add_c(2,0,c3,c1,c2);
-        mul_add_c(1,1,c3,c1,c2);
-        mul_add_c(0,2,c3,c1,c2);
-        stg     c3,2*8(%r2)
-        lghi    c3,0
-        mul_add_c(0,3,c1,c2,c3);
-        mul_add_c(1,2,c1,c2,c3);
-        mul_add_c(2,1,c1,c2,c3);
-        mul_add_c(3,0,c1,c2,c3);
-        stg     c1,3*8(%r2)
-        lghi    c1,0
-        mul_add_c(4,0,c2,c3,c1);
-        mul_add_c(3,1,c2,c3,c1);
-        mul_add_c(2,2,c2,c3,c1);
-        mul_add_c(1,3,c2,c3,c1);
-        mul_add_c(0,4,c2,c3,c1);
-        stg     c2,4*8(%r2)
-        lghi    c2,0
-        mul_add_c(0,5,c3,c1,c2);
-        mul_add_c(1,4,c3,c1,c2);
-        mul_add_c(2,3,c3,c1,c2);
-        mul_add_c(3,2,c3,c1,c2);
-        mul_add_c(4,1,c3,c1,c2);
-        mul_add_c(5,0,c3,c1,c2);
-        stg     c3,5*8(%r2)
-        lghi    c3,0
-        mul_add_c(6,0,c1,c2,c3);
-        mul_add_c(5,1,c1,c2,c3);
-        mul_add_c(4,2,c1,c2,c3);
-        mul_add_c(3,3,c1,c2,c3);
-        mul_add_c(2,4,c1,c2,c3);
-        mul_add_c(1,5,c1,c2,c3);
-        mul_add_c(0,6,c1,c2,c3);
-        stg     c1,6*8(%r2)
-        lghi    c1,0
-        mul_add_c(0,7,c2,c3,c1);
-        mul_add_c(1,6,c2,c3,c1);
-        mul_add_c(2,5,c2,c3,c1);
-        mul_add_c(3,4,c2,c3,c1);
-        mul_add_c(4,3,c2,c3,c1);
-        mul_add_c(5,2,c2,c3,c1);
-        mul_add_c(6,1,c2,c3,c1);
-        mul_add_c(7,0,c2,c3,c1);
-        stg     c2,7*8(%r2)
-        lghi    c2,0
-        mul_add_c(7,1,c3,c1,c2);
-        mul_add_c(6,2,c3,c1,c2);
-        mul_add_c(5,3,c3,c1,c2);
-        mul_add_c(4,4,c3,c1,c2);
-        mul_add_c(3,5,c3,c1,c2);
-        mul_add_c(2,6,c3,c1,c2);
-        mul_add_c(1,7,c3,c1,c2);
-        stg     c3,8*8(%r2)
-        lghi    c3,0
-        mul_add_c(2,7,c1,c2,c3);
-        mul_add_c(3,6,c1,c2,c3);
-        mul_add_c(4,5,c1,c2,c3);
-        mul_add_c(5,4,c1,c2,c3);
-        mul_add_c(6,3,c1,c2,c3);
-        mul_add_c(7,2,c1,c2,c3);
-        stg     c1,9*8(%r2)
-        lghi    c1,0
-        mul_add_c(7,3,c2,c3,c1);
-        mul_add_c(6,4,c2,c3,c1);
-        mul_add_c(5,5,c2,c3,c1);
-        mul_add_c(4,6,c2,c3,c1);
-        mul_add_c(3,7,c2,c3,c1);
-        stg     c2,10*8(%r2)
-        lghi    c2,0
-        mul_add_c(4,7,c3,c1,c2);
-        mul_add_c(5,6,c3,c1,c2);
-        mul_add_c(6,5,c3,c1,c2);
-        mul_add_c(7,4,c3,c1,c2);
-        stg     c3,11*8(%r2)
-        lghi    c3,0
-        mul_add_c(7,5,c1,c2,c3);
-        mul_add_c(6,6,c1,c2,c3);
-        mul_add_c(5,7,c1,c2,c3);
-        stg     c1,12*8(%r2)
-        lghi    c1,0
-        mul_add_c(6,7,c2,c3,c1);
-        mul_add_c(7,6,c2,c3,c1);
-        stg     c2,13*8(%r2)
-        lghi    c2,0
-        mul_add_c(7,7,c3,c1,c2);
-        stg     c3,14*8(%r2)
-        stg     c1,15*8(%r2)
-        lmg     %r6,%r8,48(%r15)
-        br      %r14
-.size   bn_mul_comba8,.-bn_mul_comba8
-// void bn_mul_comba4(BN_ULONG *r2,BN_ULONG *r3,BN_ULONG *r4);
-.globl  bn_mul_comba4
-.type   bn_mul_comba4,@function
-.align  4
-bn_mul_comba4:
-        stmg    %r6,%r8,48(%r15)
-        lghi    c1,0
-        lghi    c2,0
-        lghi    c3,0
-        lghi    zero,0
-        mul_add_c(0,0,c1,c2,c3);
-        stg     c1,0*8(%r3)
-        lghi    c1,0
-        mul_add_c(0,1,c2,c3,c1);
-        mul_add_c(1,0,c2,c3,c1);
-        stg     c2,1*8(%r2)
-        lghi    c2,0
-        mul_add_c(2,0,c3,c1,c2);
-        mul_add_c(1,1,c3,c1,c2);
-        mul_add_c(0,2,c3,c1,c2);
-        stg     c3,2*8(%r2)
-        lghi    c3,0
-        mul_add_c(0,3,c1,c2,c3);
-        mul_add_c(1,2,c1,c2,c3);
-        mul_add_c(2,1,c1,c2,c3);
-        mul_add_c(3,0,c1,c2,c3);
-        stg     c1,3*8(%r2)
-        lghi    c1,0
-        mul_add_c(3,1,c2,c3,c1);
-        mul_add_c(2,2,c2,c3,c1);
-        mul_add_c(1,3,c2,c3,c1);
-        stg     c2,4*8(%r2)
-        lghi    c2,0
-        mul_add_c(2,3,c3,c1,c2);
-        mul_add_c(3,2,c3,c1,c2);
-        stg     c3,5*8(%r2)
-        lghi    c3,0
-        mul_add_c(3,3,c1,c2,c3);
-        stg     c1,6*8(%r2)
-        stg     c2,7*8(%r2)
-        stmg    %r6,%r8,48(%r15)
-        br      %r14
-.size   bn_mul_comba4,.-bn_mul_comba4
-#define sqr_add_c(ai,c1,c2,c3)          \
-        lg      %r7,ai*8(%r3);          \
-        mlgr    %r6,%r7;                \
-        algr    c1,%r7;                 \
-        alcgr   c2,%r6;                 \
-        alcgr   c3,zero
-#define sqr_add_c2(ai,aj,c1,c2,c3)      \
-        lg      %r7,ai*8(%r3);          \
-        mlg     %r6,aj*8(%r3);          \
-        algr    c1,%r7;                 \
-        alcgr   c2,%r6;                 \
-        alcgr   c3,zero;                \
-        algr    c1,%r7;                 \
-        alcgr   c2,%r6;                 \
-        alcgr   c3,zero
-// void bn_sqr_comba8(BN_ULONG *r2,BN_ULONG *r3);
-.globl  bn_sqr_comba8
-.type   bn_sqr_comba8,@function
-.align  4
-bn_sqr_comba8:
-        stmg    %r6,%r8,48(%r15)
-        lghi    c1,0
-        lghi    c2,0
-        lghi    c3,0
-        lghi    zero,0
-        sqr_add_c(0,c1,c2,c3);
-        stg     c1,0*8(%r2)
-        lghi    c1,0
-        sqr_add_c2(1,0,c2,c3,c1);
-        stg     c2,1*8(%r2)
-        lghi    c2,0
-        sqr_add_c(1,c3,c1,c2);
-        sqr_add_c2(2,0,c3,c1,c2);
-        stg     c3,2*8(%r2)
-        lghi    c3,0
-        sqr_add_c2(3,0,c1,c2,c3);
-        sqr_add_c2(2,1,c1,c2,c3);
-        stg     c1,3*8(%r2)
-        lghi    c1,0
-        sqr_add_c(2,c2,c3,c1);
-        sqr_add_c2(3,1,c2,c3,c1);
-        sqr_add_c2(4,0,c2,c3,c1);
-        stg     c2,4*8(%r2)
-        lghi    c2,0
-        sqr_add_c2(5,0,c3,c1,c2);
-        sqr_add_c2(4,1,c3,c1,c2);
-        sqr_add_c2(3,2,c3,c1,c2);
-        stg     c3,5*8(%r2)
-        lghi    c3,0
-        sqr_add_c(3,c1,c2,c3);
-        sqr_add_c2(4,2,c1,c2,c3);
-        sqr_add_c2(5,1,c1,c2,c3);
-        sqr_add_c2(6,0,c1,c2,c3);
-        stg     c1,6*8(%r2)
-        lghi    c1,0
-        sqr_add_c2(7,0,c2,c3,c1);
-        sqr_add_c2(6,1,c2,c3,c1);
-        sqr_add_c2(5,2,c2,c3,c1);
-        sqr_add_c2(4,3,c2,c3,c1);
-        stg     c2,7*8(%r2)
-        lghi    c2,0
-        sqr_add_c(4,c3,c1,c2);
-        sqr_add_c2(5,3,c3,c1,c2);
-        sqr_add_c2(6,2,c3,c1,c2);
-        sqr_add_c2(7,1,c3,c1,c2);
-        stg     c3,8*8(%r2)
-        lghi    c3,0
-        sqr_add_c2(7,2,c1,c2,c3);
-        sqr_add_c2(6,3,c1,c2,c3);
-        sqr_add_c2(5,4,c1,c2,c3);
-        stg     c1,9*8(%r2)
-        lghi    c1,0
-        sqr_add_c(5,c2,c3,c1);
-        sqr_add_c2(6,4,c2,c3,c1);
-        sqr_add_c2(7,3,c2,c3,c1);
-        stg     c2,10*8(%r2)
-        lghi    c2,0
-        sqr_add_c2(7,4,c3,c1,c2);
-        sqr_add_c2(6,5,c3,c1,c2);
-        stg     c3,11*8(%r2)
-        lghi    c3,0
-        sqr_add_c(6,c1,c2,c3);
-        sqr_add_c2(7,5,c1,c2,c3);
-        stg     c1,12*8(%r2)
-        lghi    c1,0
-        sqr_add_c2(7,6,c2,c3,c1);
-        stg     c2,13*8(%r2)
-        lghi    c2,0
-        sqr_add_c(7,c3,c1,c2);
-        stg     c3,14*8(%r2)
-        stg     c1,15*8(%r2)
-        lmg     %r6,%r8,48(%r15)
-        br      %r14
-.size   bn_sqr_comba8,.-bn_sqr_comba8
-// void bn_sqr_comba4(BN_ULONG *r2,BN_ULONG *r3);
-.globl bn_sqr_comba4
-.type   bn_sqr_comba4,@function
-.align  4
-bn_sqr_comba4:
-        stmg    %r6,%r8,48(%r15)
-        lghi    c1,0
-        lghi    c2,0
-        lghi    c3,0
-        lghi    zero,0
-        sqr_add_c(0,c1,c2,c3);
-        stg     c1,0*8(%r2)
-        lghi    c1,0
-        sqr_add_c2(1,0,c2,c3,c1);
-        stg     c2,1*8(%r2)
-        lghi    c2,0
-        sqr_add_c(1,c3,c1,c2);
-        sqr_add_c2(2,0,c3,c1,c2);
-        stg     c3,2*8(%r2)
-        lghi    c3,0
-        sqr_add_c2(3,0,c1,c2,c3);
-        sqr_add_c2(2,1,c1,c2,c3);
-        stg     c1,3*8(%r2)
-        lghi    c1,0
-        sqr_add_c(2,c2,c3,c1);
-        sqr_add_c2(3,1,c2,c3,c1);
-        stg     c2,4*8(%r2)
-        lghi    c2,0
-        sqr_add_c2(3,2,c3,c1,c2);
-        stg     c3,5*8(%r2)
-        lghi    c3,0
-        sqr_add_c(3,c1,c2,c3);
-        stg     c1,6*8(%r2)
-        stg     c2,7*8(%r2)
-        lmg     %r6,%r8,48(%r15)
-        br      %r14
-.size   bn_sqr_comba4,.-bn_sqr_comba4
diff --git a/src/lib/libcrypto/bn/asm/sparcv8.S b/src/lib/libcrypto/bn/asm/sparcv8.S
deleted file mode 100644
index 88c5dc480a..0000000000
--- a/src/lib/libcrypto/bn/asm/sparcv8.S
+++ /dev/null
@@ -1,1458 +0,0 @@
-.ident  "sparcv8.s, Version 1.4"
-.ident  "SPARC v8 ISA artwork by Andy Polyakov <appro@fy.chalmers.se>"
-/*
- * ====================================================================
- * Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
- * project.
- *
- * Rights for redistribution and usage in source and binary forms are
- * granted according to the OpenSSL license. Warranty of any kind is
- * disclaimed.
- * ====================================================================
- */
-/*
- * This is my modest contributon to OpenSSL project (see
- * http://www.openssl.org/ for more information about it) and is
- * a drop-in SuperSPARC ISA replacement for crypto/bn/bn_asm.c
- * module. For updates see http://fy.chalmers.se/~appro/hpe/.
- *
- * See bn_asm.sparc.v8plus.S for more details.
- */
-/*
- * Revision history.
- *
- * 1.1  - new loop unrolling model(*);
- * 1.2  - made gas friendly;
- * 1.3  - fixed problem with /usr/ccs/lib/cpp;
- * 1.4  - some retunes;
- *
- * (*)  see bn_asm.sparc.v8plus.S for details
- */
-.section        ".text",#alloc,#execinstr
-.file           "bn_asm.sparc.v8.S"
-.align  32
-.global bn_mul_add_words
-/*
- * BN_ULONG bn_mul_add_words(rp,ap,num,w)
- * BN_ULONG *rp,*ap;
- * int num;
- * BN_ULONG w;
- */
-bn_mul_add_words:
-        cmp     %o2,0
-        bg,a    .L_bn_mul_add_words_proceed
-        ld      [%o1],%g2
-        retl
-        clr     %o0
-.L_bn_mul_add_words_proceed:
-        andcc   %o2,-4,%g0
-        bz      .L_bn_mul_add_words_tail
-        clr     %o5
-.L_bn_mul_add_words_loop:
-        ld      [%o0],%o4
-        ld      [%o1+4],%g3
-        umul    %o3,%g2,%g2
-        rd      %y,%g1
-        addcc   %o4,%o5,%o4
-        addx    %g1,0,%g1
-        addcc   %o4,%g2,%o4
-        st      %o4,[%o0]
-        addx    %g1,0,%o5
-        ld      [%o0+4],%o4
-        ld      [%o1+8],%g2
-        umul    %o3,%g3,%g3
-        dec     4,%o2
-        rd      %y,%g1
-        addcc   %o4,%o5,%o4
-        addx    %g1,0,%g1
-        addcc   %o4,%g3,%o4
-        st      %o4,[%o0+4]
-        addx    %g1,0,%o5
-        ld      [%o0+8],%o4
-        ld      [%o1+12],%g3
-        umul    %o3,%g2,%g2
-        inc     16,%o1
-        rd      %y,%g1
-        addcc   %o4,%o5,%o4
-        addx    %g1,0,%g1
-        addcc   %o4,%g2,%o4
-        st      %o4,[%o0+8]
-        addx    %g1,0,%o5
-        ld      [%o0+12],%o4
-        umul    %o3,%g3,%g3
-        inc     16,%o0
-        rd      %y,%g1
-        addcc   %o4,%o5,%o4
-        addx    %g1,0,%g1
-        addcc   %o4,%g3,%o4
-        st      %o4,[%o0-4]
-        addx    %g1,0,%o5
-        andcc   %o2,-4,%g0
-        bnz,a   .L_bn_mul_add_words_loop
-        ld      [%o1],%g2
-        tst     %o2
-        bnz,a   .L_bn_mul_add_words_tail
-        ld      [%o1],%g2
-.L_bn_mul_add_words_return:
-        retl
-        mov     %o5,%o0
-        nop
-.L_bn_mul_add_words_tail:
-        ld      [%o0],%o4
-        umul    %o3,%g2,%g2
-        addcc   %o4,%o5,%o4
-        rd      %y,%g1
-        addx    %g1,0,%g1
-        addcc   %o4,%g2,%o4
-        addx    %g1,0,%o5
-        deccc   %o2
-        bz      .L_bn_mul_add_words_return
-        st      %o4,[%o0]
-        ld      [%o1+4],%g2
-        ld      [%o0+4],%o4
-        umul    %o3,%g2,%g2
-        rd      %y,%g1
-        addcc   %o4,%o5,%o4
-        addx    %g1,0,%g1
-        addcc   %o4,%g2,%o4
-        addx    %g1,0,%o5
-        deccc   %o2
-        bz      .L_bn_mul_add_words_return
-        st      %o4,[%o0+4]
-        ld      [%o1+8],%g2
-        ld      [%o0+8],%o4
-        umul    %o3,%g2,%g2
-        rd      %y,%g1
-        addcc   %o4,%o5,%o4
-        addx    %g1,0,%g1
-        addcc   %o4,%g2,%o4
-        st      %o4,[%o0+8]
-        retl
-        addx    %g1,0,%o0
-.type   bn_mul_add_words,#function
-.size   bn_mul_add_words,(.-bn_mul_add_words)
-.align  32
-.global bn_mul_words
-/*
- * BN_ULONG bn_mul_words(rp,ap,num,w)
- * BN_ULONG *rp,*ap;
- * int num;
- * BN_ULONG w;
- */
-bn_mul_words:
-        cmp     %o2,0
-        bg,a    .L_bn_mul_words_proceeed
-        ld      [%o1],%g2
-        retl
-        clr     %o0
-.L_bn_mul_words_proceeed:
-        andcc   %o2,-4,%g0
-        bz      .L_bn_mul_words_tail
-        clr     %o5
-.L_bn_mul_words_loop:
-        ld      [%o1+4],%g3
-        umul    %o3,%g2,%g2
-        addcc   %g2,%o5,%g2
-        rd      %y,%g1
-        addx    %g1,0,%o5
-        st      %g2,[%o0]
-        ld      [%o1+8],%g2
-        umul    %o3,%g3,%g3
-        addcc   %g3,%o5,%g3
-        rd      %y,%g1
-        dec     4,%o2
-        addx    %g1,0,%o5
-        st      %g3,[%o0+4]
-        ld      [%o1+12],%g3
-        umul    %o3,%g2,%g2
-        addcc   %g2,%o5,%g2
-        rd      %y,%g1
-        inc     16,%o1
-        st      %g2,[%o0+8]
-        addx    %g1,0,%o5
-        umul    %o3,%g3,%g3
-        addcc   %g3,%o5,%g3
-        rd      %y,%g1
-        inc     16,%o0
-        addx    %g1,0,%o5
-        st      %g3,[%o0-4]
-        andcc   %o2,-4,%g0
-        nop
-        bnz,a   .L_bn_mul_words_loop
-        ld      [%o1],%g2
-        tst     %o2
-        bnz,a   .L_bn_mul_words_tail
-        ld      [%o1],%g2
-.L_bn_mul_words_return:
-        retl
-        mov     %o5,%o0
-        nop
-.L_bn_mul_words_tail:
-        umul    %o3,%g2,%g2
-        addcc   %g2,%o5,%g2
-        rd      %y,%g1
-        addx    %g1,0,%o5
-        deccc   %o2
-        bz      .L_bn_mul_words_return
-        st      %g2,[%o0]
-        nop
-        ld      [%o1+4],%g2
-        umul    %o3,%g2,%g2
-        addcc   %g2,%o5,%g2
-        rd      %y,%g1
-        addx    %g1,0,%o5
-        deccc   %o2
-        bz      .L_bn_mul_words_return
-        st      %g2,[%o0+4]
-        ld      [%o1+8],%g2
-        umul    %o3,%g2,%g2
-        addcc   %g2,%o5,%g2
-        rd      %y,%g1
-        st      %g2,[%o0+8]
-        retl
-        addx    %g1,0,%o0
-.type   bn_mul_words,#function
-.size   bn_mul_words,(.-bn_mul_words)
-.align  32
-.global bn_sqr_words
-/*
- * void bn_sqr_words(r,a,n)
- * BN_ULONG *r,*a;
- * int n;
- */
-bn_sqr_words:
-        cmp     %o2,0
-        bg,a    .L_bn_sqr_words_proceeed
-        ld      [%o1],%g2
-        retl
-        clr     %o0
-.L_bn_sqr_words_proceeed:
-        andcc   %o2,-4,%g0
-        bz      .L_bn_sqr_words_tail
-        clr     %o5
-.L_bn_sqr_words_loop:
-        ld      [%o1+4],%g3
-        umul    %g2,%g2,%o4
-        st      %o4,[%o0]
-        rd      %y,%o5
-        st      %o5,[%o0+4]
-        ld      [%o1+8],%g2
-        umul    %g3,%g3,%o4
-        dec     4,%o2
-        st      %o4,[%o0+8]
-        rd      %y,%o5
-        st      %o5,[%o0+12]
-        nop
-        ld      [%o1+12],%g3
-        umul    %g2,%g2,%o4
-        st      %o4,[%o0+16]
-        rd      %y,%o5
-        inc     16,%o1
-        st      %o5,[%o0+20]
-        umul    %g3,%g3,%o4
-        inc     32,%o0
-        st      %o4,[%o0-8]
-        rd      %y,%o5
-        st      %o5,[%o0-4]
-        andcc   %o2,-4,%g2
-        bnz,a   .L_bn_sqr_words_loop
-        ld      [%o1],%g2
-        tst     %o2
-        nop
-        bnz,a   .L_bn_sqr_words_tail
-        ld      [%o1],%g2
-.L_bn_sqr_words_return:
-        retl
-        clr     %o0
-.L_bn_sqr_words_tail:
-        umul    %g2,%g2,%o4
-        st      %o4,[%o0]
-        deccc   %o2
-        rd      %y,%o5
-        bz      .L_bn_sqr_words_return
-        st      %o5,[%o0+4]
-        ld      [%o1+4],%g2
-        umul    %g2,%g2,%o4
-        st      %o4,[%o0+8]
-        deccc   %o2
-        rd      %y,%o5
-        nop
-        bz      .L_bn_sqr_words_return
-        st      %o5,[%o0+12]
-        ld      [%o1+8],%g2
-        umul    %g2,%g2,%o4
-        st      %o4,[%o0+16]
-        rd      %y,%o5
-        st      %o5,[%o0+20]
-        retl
-        clr     %o0
-.type   bn_sqr_words,#function
-.size   bn_sqr_words,(.-bn_sqr_words)
-.align  32
-.global bn_div_words
-/*
- * BN_ULONG bn_div_words(h,l,d)
- * BN_ULONG h,l,d;
- */
-bn_div_words:
-        wr      %o0,%y
-        udiv    %o1,%o2,%o0
-        retl
-        nop
-.type   bn_div_words,#function
-.size   bn_div_words,(.-bn_div_words)
-.align  32
-.global bn_add_words
-/*
- * BN_ULONG bn_add_words(rp,ap,bp,n)
- * BN_ULONG *rp,*ap,*bp;
- * int n;
- */
-bn_add_words:
-        cmp     %o3,0
-        bg,a    .L_bn_add_words_proceed
-        ld      [%o1],%o4
-        retl
-        clr     %o0
-.L_bn_add_words_proceed:
-        andcc   %o3,-4,%g0
-        bz      .L_bn_add_words_tail
-        clr     %g1
-        ba      .L_bn_add_words_warn_loop
-        addcc   %g0,0,%g0       ! clear carry flag
-.L_bn_add_words_loop:
-        ld      [%o1],%o4
-.L_bn_add_words_warn_loop:
-        ld      [%o2],%o5
-        ld      [%o1+4],%g3
-        ld      [%o2+4],%g4
-        dec     4,%o3
-        addxcc  %o5,%o4,%o5
-        st      %o5,[%o0]
-        ld      [%o1+8],%o4
-        ld      [%o2+8],%o5
-        inc     16,%o1
-        addxcc  %g3,%g4,%g3
-        st      %g3,[%o0+4]
-        
-        ld      [%o1-4],%g3
-        ld      [%o2+12],%g4
-        inc     16,%o2
-        addxcc  %o5,%o4,%o5
-        st      %o5,[%o0+8]
-        inc     16,%o0
-        addxcc  %g3,%g4,%g3
-        st      %g3,[%o0-4]
-        addx    %g0,0,%g1
-        andcc   %o3,-4,%g0
-        bnz,a   .L_bn_add_words_loop
-        addcc   %g1,-1,%g0
-        tst     %o3
-        bnz,a   .L_bn_add_words_tail
-        ld      [%o1],%o4
-.L_bn_add_words_return:
-        retl
-        mov     %g1,%o0
-.L_bn_add_words_tail:
-        addcc   %g1,-1,%g0
-        ld      [%o2],%o5
-        addxcc  %o5,%o4,%o5
-        addx    %g0,0,%g1
-        deccc   %o3
-        bz      .L_bn_add_words_return
-        st      %o5,[%o0]
-        ld      [%o1+4],%o4
-        addcc   %g1,-1,%g0
-        ld      [%o2+4],%o5
-        addxcc  %o5,%o4,%o5
-        addx    %g0,0,%g1
-        deccc   %o3
-        bz      .L_bn_add_words_return
-        st      %o5,[%o0+4]
-        ld      [%o1+8],%o4
-        addcc   %g1,-1,%g0
-        ld      [%o2+8],%o5
-        addxcc  %o5,%o4,%o5
-        st      %o5,[%o0+8]
-        retl
-        addx    %g0,0,%o0
-.type   bn_add_words,#function
-.size   bn_add_words,(.-bn_add_words)
-.align  32
-.global bn_sub_words
-/*
- * BN_ULONG bn_sub_words(rp,ap,bp,n)
- * BN_ULONG *rp,*ap,*bp;
- * int n;
- */
-bn_sub_words:
-        cmp     %o3,0
-        bg,a    .L_bn_sub_words_proceed
-        ld      [%o1],%o4
-        retl
-        clr     %o0
-.L_bn_sub_words_proceed:
-        andcc   %o3,-4,%g0
-        bz      .L_bn_sub_words_tail
-        clr     %g1
-        ba      .L_bn_sub_words_warm_loop
-        addcc   %g0,0,%g0       ! clear carry flag
-.L_bn_sub_words_loop:
-        ld      [%o1],%o4
-.L_bn_sub_words_warm_loop:
-        ld      [%o2],%o5
-        ld      [%o1+4],%g3
-        ld      [%o2+4],%g4
-        dec     4,%o3
-        subxcc  %o4,%o5,%o5
-        st      %o5,[%o0]
-        ld      [%o1+8],%o4
-        ld      [%o2+8],%o5
-        inc     16,%o1
-        subxcc  %g3,%g4,%g4
-        st      %g4,[%o0+4]
-        
-        ld      [%o1-4],%g3
-        ld      [%o2+12],%g4
-        inc     16,%o2
-        subxcc  %o4,%o5,%o5
-        st      %o5,[%o0+8]
-        inc     16,%o0
-        subxcc  %g3,%g4,%g4
-        st      %g4,[%o0-4]
-        addx    %g0,0,%g1
-        andcc   %o3,-4,%g0
-        bnz,a   .L_bn_sub_words_loop
-        addcc   %g1,-1,%g0
-        tst     %o3
-        nop
-        bnz,a   .L_bn_sub_words_tail
-        ld      [%o1],%o4
-.L_bn_sub_words_return:
-        retl
-        mov     %g1,%o0
-.L_bn_sub_words_tail:
-        addcc   %g1,-1,%g0
-        ld      [%o2],%o5
-        subxcc  %o4,%o5,%o5
-        addx    %g0,0,%g1
-        deccc   %o3
-        bz      .L_bn_sub_words_return
-        st      %o5,[%o0]
-        nop
-        ld      [%o1+4],%o4
-        addcc   %g1,-1,%g0
-        ld      [%o2+4],%o5
-        subxcc  %o4,%o5,%o5
-        addx    %g0,0,%g1
-        deccc   %o3
-        bz      .L_bn_sub_words_return
-        st      %o5,[%o0+4]
-        ld      [%o1+8],%o4
-        addcc   %g1,-1,%g0
-        ld      [%o2+8],%o5
-        subxcc  %o4,%o5,%o5
-        st      %o5,[%o0+8]
-        retl
-        addx    %g0,0,%o0
-.type   bn_sub_words,#function
-.size   bn_sub_words,(.-bn_sub_words)
-#define FRAME_SIZE      -96
-/*
- * Here is register usage map for *all* routines below.
- */
-#define t_1     %o0
-#define t_2     %o1
-#define c_1     %o2
-#define c_2     %o3
-#define c_3     %o4
-#define ap(I)   [%i1+4*I]
-#define bp(I)   [%i2+4*I]
-#define rp(I)   [%i0+4*I]
-#define a_0     %l0
-#define a_1     %l1
-#define a_2     %l2
-#define a_3     %l3
-#define a_4     %l4
-#define a_5     %l5
-#define a_6     %l6
-#define a_7     %l7
-#define b_0     %i3
-#define b_1     %i4
-#define b_2     %i5
-#define b_3     %o5
-#define b_4     %g1
-#define b_5     %g2
-#define b_6     %g3
-#define b_7     %g4
-.align  32
-.global bn_mul_comba8
-/*
- * void bn_mul_comba8(r,a,b)
- * BN_ULONG *r,*a,*b;
- */
-bn_mul_comba8:
-        save    %sp,FRAME_SIZE,%sp
-        ld      ap(0),a_0
-        ld      bp(0),b_0
-        umul    a_0,b_0,c_1     !=!mul_add_c(a[0],b[0],c1,c2,c3);
-        ld      bp(1),b_1
-        rd      %y,c_2
-        st      c_1,rp(0)       !r[0]=c1;
-        umul    a_0,b_1,t_1     !=!mul_add_c(a[0],b[1],c2,c3,c1);
-        ld      ap(1),a_1
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  %g0,t_2,c_3     !=
-        addx    %g0,%g0,c_1
-        ld      ap(2),a_2
-        umul    a_1,b_0,t_1     !mul_add_c(a[1],b[0],c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        st      c_2,rp(1)       !r[1]=c2;
-        addx    c_1,%g0,c_1     !=
-        umul    a_2,b_0,t_1     !mul_add_c(a[2],b[0],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    %g0,%g0,c_2
-        ld      bp(2),b_2
-        umul    a_1,b_1,t_1     !mul_add_c(a[1],b[1],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        ld      bp(3),b_3
-        addx    c_2,%g0,c_2     !=
-        umul    a_0,b_2,t_1     !mul_add_c(a[0],b[2],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        st      c_3,rp(2)       !r[2]=c3;
-        umul    a_0,b_3,t_1     !mul_add_c(a[0],b[3],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    %g0,%g0,c_3
-        umul    a_1,b_2,t_1     !=!mul_add_c(a[1],b[2],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        ld      ap(3),a_3
-        umul    a_2,b_1,t_1     !mul_add_c(a[2],b[1],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2          !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        ld      ap(4),a_4
-        umul    a_3,b_0,t_1     !mul_add_c(a[3],b[0],c1,c2,c3);!=
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(3)       !r[3]=c1;
-        umul    a_4,b_0,t_1     !mul_add_c(a[4],b[0],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        umul    a_3,b_1,t_1     !mul_add_c(a[3],b[1],c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        umul    a_2,b_2,t_1     !=!mul_add_c(a[2],b[2],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        ld      bp(4),b_4
-        umul    a_1,b_3,t_1     !mul_add_c(a[1],b[3],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        ld      bp(5),b_5
-        umul    a_0,b_4,t_1     !=!mul_add_c(a[0],b[4],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        st      c_2,rp(4)       !r[4]=c2;
-        umul    a_0,b_5,t_1     !mul_add_c(a[0],b[5],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2
-        umul    a_1,b_4,t_1     !mul_add_c(a[1],b[4],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_2,b_3,t_1     !=!mul_add_c(a[2],b[3],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        umul    a_3,b_2,t_1     !mul_add_c(a[3],b[2],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        ld      ap(5),a_5
-        umul    a_4,b_1,t_1     !mul_add_c(a[4],b[1],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        ld      ap(6),a_6
-        addx    c_2,%g0,c_2     !=
-        umul    a_5,b_0,t_1     !mul_add_c(a[5],b[0],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        st      c_3,rp(5)       !r[5]=c3;
-        umul    a_6,b_0,t_1     !mul_add_c(a[6],b[0],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    %g0,%g0,c_3
-        umul    a_5,b_1,t_1     !=!mul_add_c(a[5],b[1],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        umul    a_4,b_2,t_1     !mul_add_c(a[4],b[2],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        umul    a_3,b_3,t_1     !mul_add_c(a[3],b[3],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2          !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_2,b_4,t_1     !mul_add_c(a[2],b[4],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        ld      bp(6),b_6
-        addx    c_3,%g0,c_3     !=
-        umul    a_1,b_5,t_1     !mul_add_c(a[1],b[5],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        ld      bp(7),b_7
-        umul    a_0,b_6,t_1     !mul_add_c(a[0],b[6],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        st      c_1,rp(6)       !r[6]=c1;
-        addx    c_3,%g0,c_3     !=
-        umul    a_0,b_7,t_1     !mul_add_c(a[0],b[7],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    %g0,%g0,c_1
-        umul    a_1,b_6,t_1     !mul_add_c(a[1],b[6],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        umul    a_2,b_5,t_1     !mul_add_c(a[2],b[5],c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        umul    a_3,b_4,t_1     !=!mul_add_c(a[3],b[4],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        umul    a_4,b_3,t_1     !mul_add_c(a[4],b[3],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_5,b_2,t_1     !mul_add_c(a[5],b[2],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        ld      ap(7),a_7
-        umul    a_6,b_1,t_1     !=!mul_add_c(a[6],b[1],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        umul    a_7,b_0,t_1     !mul_add_c(a[7],b[0],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        st      c_2,rp(7)       !r[7]=c2;
-        umul    a_7,b_1,t_1     !mul_add_c(a[7],b[1],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2
-        umul    a_6,b_2,t_1     !=!mul_add_c(a[6],b[2],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        umul    a_5,b_3,t_1     !mul_add_c(a[5],b[3],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        umul    a_4,b_4,t_1     !mul_add_c(a[4],b[4],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_3,b_5,t_1     !mul_add_c(a[3],b[5],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_2,b_6,t_1     !=!mul_add_c(a[2],b[6],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        umul    a_1,b_7,t_1     !mul_add_c(a[1],b[7],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !
-        addx    c_2,%g0,c_2
-        st      c_3,rp(8)       !r[8]=c3;
-        umul    a_2,b_7,t_1     !mul_add_c(a[2],b[7],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    %g0,%g0,c_3
-        umul    a_3,b_6,t_1     !=!mul_add_c(a[3],b[6],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        umul    a_4,b_5,t_1     !mul_add_c(a[4],b[5],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        umul    a_5,b_4,t_1     !mul_add_c(a[5],b[4],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2          !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_6,b_3,t_1     !mul_add_c(a[6],b[3],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_7,b_2,t_1     !=!mul_add_c(a[7],b[2],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(9)       !r[9]=c1;
-        umul    a_7,b_3,t_1     !mul_add_c(a[7],b[3],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        umul    a_6,b_4,t_1     !mul_add_c(a[6],b[4],c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        umul    a_5,b_5,t_1     !=!mul_add_c(a[5],b[5],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        umul    a_4,b_6,t_1     !mul_add_c(a[4],b[6],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_3,b_7,t_1     !mul_add_c(a[3],b[7],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        st      c_2,rp(10)      !r[10]=c2;
-        umul    a_4,b_7,t_1     !=!mul_add_c(a[4],b[7],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2     !=
-        umul    a_5,b_6,t_1     !mul_add_c(a[5],b[6],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        umul    a_6,b_5,t_1     !mul_add_c(a[6],b[5],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_7,b_4,t_1     !mul_add_c(a[7],b[4],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        st      c_3,rp(11)      !r[11]=c3;
-        addx    c_2,%g0,c_2     !=
-        umul    a_7,b_5,t_1     !mul_add_c(a[7],b[5],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    %g0,%g0,c_3
-        umul    a_6,b_6,t_1     !mul_add_c(a[6],b[6],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2          !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_5,b_7,t_1     !mul_add_c(a[5],b[7],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        st      c_1,rp(12)      !r[12]=c1;
-        addx    c_3,%g0,c_3     !=
-        umul    a_6,b_7,t_1     !mul_add_c(a[6],b[7],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    %g0,%g0,c_1
-        umul    a_7,b_6,t_1     !mul_add_c(a[7],b[6],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        st      c_2,rp(13)      !r[13]=c2;
-        umul    a_7,b_7,t_1     !=!mul_add_c(a[7],b[7],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        nop                     !=
-        st      c_3,rp(14)      !r[14]=c3;
-        st      c_1,rp(15)      !r[15]=c1;
-        ret
-        restore %g0,%g0,%o0
-.type   bn_mul_comba8,#function
-.size   bn_mul_comba8,(.-bn_mul_comba8)
-.align  32
-.global bn_mul_comba4
-/*
- * void bn_mul_comba4(r,a,b)
- * BN_ULONG *r,*a,*b;
- */
-bn_mul_comba4:
-        save    %sp,FRAME_SIZE,%sp
-        ld      ap(0),a_0
-        ld      bp(0),b_0
-        umul    a_0,b_0,c_1     !=!mul_add_c(a[0],b[0],c1,c2,c3);
-        ld      bp(1),b_1
-        rd      %y,c_2
-        st      c_1,rp(0)       !r[0]=c1;
-        umul    a_0,b_1,t_1     !=!mul_add_c(a[0],b[1],c2,c3,c1);
-        ld      ap(1),a_1
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  %g0,t_2,c_3
-        addx    %g0,%g0,c_1
-        ld      ap(2),a_2
-        umul    a_1,b_0,t_1     !=!mul_add_c(a[1],b[0],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        st      c_2,rp(1)       !r[1]=c2;
-        umul    a_2,b_0,t_1     !mul_add_c(a[2],b[0],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2
-        ld      bp(2),b_2
-        umul    a_1,b_1,t_1     !=!mul_add_c(a[1],b[1],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        ld      bp(3),b_3
-        umul    a_0,b_2,t_1     !mul_add_c(a[0],b[2],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        st      c_3,rp(2)       !r[2]=c3;
-        umul    a_0,b_3,t_1     !=!mul_add_c(a[0],b[3],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    %g0,%g0,c_3     !=
-        umul    a_1,b_2,t_1     !mul_add_c(a[1],b[2],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        ld      ap(3),a_3
-        umul    a_2,b_1,t_1     !mul_add_c(a[2],b[1],c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_3,b_0,t_1     !=!mul_add_c(a[3],b[0],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(3)       !r[3]=c1;
-        umul    a_3,b_1,t_1     !mul_add_c(a[3],b[1],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        umul    a_2,b_2,t_1     !mul_add_c(a[2],b[2],c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        umul    a_1,b_3,t_1     !=!mul_add_c(a[1],b[3],c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        st      c_2,rp(4)       !r[4]=c2;
-        umul    a_2,b_3,t_1     !mul_add_c(a[2],b[3],c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2
-        umul    a_3,b_2,t_1     !mul_add_c(a[3],b[2],c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        st      c_3,rp(5)       !r[5]=c3;
-        addx    c_2,%g0,c_2     !=
-        umul    a_3,b_3,t_1     !mul_add_c(a[3],b[3],c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        st      c_1,rp(6)       !r[6]=c1;
-        st      c_2,rp(7)       !r[7]=c2;
-        
-        ret
-        restore %g0,%g0,%o0
-.type   bn_mul_comba4,#function
-.size   bn_mul_comba4,(.-bn_mul_comba4)
-.align  32
-.global bn_sqr_comba8
-bn_sqr_comba8:
-        save    %sp,FRAME_SIZE,%sp
-        ld      ap(0),a_0
-        ld      ap(1),a_1
-        umul    a_0,a_0,c_1     !=!sqr_add_c(a,0,c1,c2,c3);
-        rd      %y,c_2
-        st      c_1,rp(0)       !r[0]=c1;
-        ld      ap(2),a_2
-        umul    a_0,a_1,t_1     !=!sqr_add_c2(a,1,0,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  %g0,t_2,c_3
-        addx    %g0,%g0,c_1     !=
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3
-        st      c_2,rp(1)       !r[1]=c2;
-        addx    c_1,%g0,c_1     !=
-        umul    a_2,a_0,t_1     !sqr_add_c2(a,2,0,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    %g0,%g0,c_2
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        ld      ap(3),a_3
-        umul    a_1,a_1,t_1     !sqr_add_c(a,1,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        st      c_3,rp(2)       !r[2]=c3;
-        umul    a_0,a_3,t_1     !=!sqr_add_c2(a,3,0,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    %g0,%g0,c_3     !=
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        ld      ap(4),a_4
-        addx    c_3,%g0,c_3     !=
-        umul    a_1,a_2,t_1     !sqr_add_c2(a,2,1,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(3)       !r[3]=c1;
-        umul    a_4,a_0,t_1     !sqr_add_c2(a,4,0,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_3,a_1,t_1     !sqr_add_c2(a,3,1,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        ld      ap(5),a_5
-        umul    a_2,a_2,t_1     !sqr_add_c(a,2,c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        st      c_2,rp(4)       !r[4]=c2;
-        addx    c_1,%g0,c_1     !=
-        umul    a_0,a_5,t_1     !sqr_add_c2(a,5,0,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    %g0,%g0,c_2
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        umul    a_1,a_4,t_1     !sqr_add_c2(a,4,1,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        ld      ap(6),a_6
-        umul    a_2,a_3,t_1     !sqr_add_c2(a,3,2,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        st      c_3,rp(5)       !r[5]=c3;
-        umul    a_6,a_0,t_1     !sqr_add_c2(a,6,0,c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    %g0,%g0,c_3
-        addcc   c_1,t_1,c_1     !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_5,a_1,t_1     !sqr_add_c2(a,5,1,c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        addcc   c_1,t_1,c_1     !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        umul    a_4,a_2,t_1     !sqr_add_c2(a,4,2,c1,c2,c3);
-        addcc   c_1,t_1,c_1     !=
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        addcc   c_1,t_1,c_1     !=
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3
-        ld      ap(7),a_7
-        umul    a_3,a_3,t_1     !=!sqr_add_c(a,3,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(6)       !r[6]=c1;
-        umul    a_0,a_7,t_1     !sqr_add_c2(a,7,0,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_1,a_6,t_1     !sqr_add_c2(a,6,1,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_2,a_5,t_1     !sqr_add_c2(a,5,2,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_3,a_4,t_1     !sqr_add_c2(a,4,3,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        st      c_2,rp(7)       !r[7]=c2;
-        umul    a_7,a_1,t_1     !sqr_add_c2(a,7,1,c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2
-        addcc   c_3,t_1,c_3     !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_6,a_2,t_1     !sqr_add_c2(a,6,2,c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        addcc   c_3,t_1,c_3     !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_5,a_3,t_1     !sqr_add_c2(a,5,3,c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        addcc   c_3,t_1,c_3     !=
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_4,a_4,t_1     !sqr_add_c(a,4,c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        st      c_3,rp(8)       !r[8]=c3;
-        addx    c_2,%g0,c_2     !=
-        umul    a_2,a_7,t_1     !sqr_add_c2(a,7,2,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    %g0,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        umul    a_3,a_6,t_1     !sqr_add_c2(a,6,3,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        umul    a_4,a_5,t_1     !sqr_add_c2(a,5,4,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(9)       !r[9]=c1;
-        umul    a_7,a_3,t_1     !sqr_add_c2(a,7,3,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_6,a_4,t_1     !sqr_add_c2(a,6,4,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_5,a_5,t_1     !sqr_add_c(a,5,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        st      c_2,rp(10)      !r[10]=c2;
-        umul    a_4,a_7,t_1     !=!sqr_add_c2(a,7,4,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2     !=
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2
-        umul    a_5,a_6,t_1     !=!sqr_add_c2(a,6,5,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    c_2,%g0,c_2     !=
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1
-        st      c_3,rp(11)      !r[11]=c3;
-        addx    c_2,%g0,c_2     !=
-        umul    a_7,a_5,t_1     !sqr_add_c2(a,7,5,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    %g0,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        umul    a_6,a_6,t_1     !sqr_add_c(a,6,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        st      c_1,rp(12)      !r[12]=c1;
-        umul    a_6,a_7,t_1     !sqr_add_c2(a,7,6,c2,c3,c1);
-        addcc   c_2,t_1,c_2     !=
-        rd      %y,t_2
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        addcc   c_2,t_1,c_2     !=
-        addxcc  c_3,t_2,c_3
-        st      c_2,rp(13)      !r[13]=c2;
-        addx    c_1,%g0,c_1     !=
-        umul    a_7,a_7,t_1     !sqr_add_c(a,7,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1     !=
-        st      c_3,rp(14)      !r[14]=c3;
-        st      c_1,rp(15)      !r[15]=c1;
-        ret
-        restore %g0,%g0,%o0
-.type   bn_sqr_comba8,#function
-.size   bn_sqr_comba8,(.-bn_sqr_comba8)
-.align  32
-.global bn_sqr_comba4
-/*
- * void bn_sqr_comba4(r,a)
- * BN_ULONG *r,*a;
- */
-bn_sqr_comba4:
-        save    %sp,FRAME_SIZE,%sp
-        ld      ap(0),a_0
-        umul    a_0,a_0,c_1     !sqr_add_c(a,0,c1,c2,c3);
-        ld      ap(1),a_1       !=
-        rd      %y,c_2
-        st      c_1,rp(0)       !r[0]=c1;
-        ld      ap(2),a_2
-        umul    a_0,a_1,t_1     !=!sqr_add_c2(a,1,0,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2
-        addxcc  %g0,t_2,c_3
-        addx    %g0,%g0,c_1     !=
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1     !=
-        st      c_2,rp(1)       !r[1]=c2;
-        umul    a_2,a_0,t_1     !sqr_add_c2(a,2,0,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2          !=
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1     !=
-        addx    c_2,%g0,c_2
-        ld      ap(3),a_3
-        umul    a_1,a_1,t_1     !sqr_add_c(a,1,c3,c1,c2);
-        addcc   c_3,t_1,c_3     !=
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        st      c_3,rp(2)       !r[2]=c3;
-        addx    c_2,%g0,c_2     !=
-        umul    a_0,a_3,t_1     !sqr_add_c2(a,3,0,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    %g0,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        umul    a_1,a_2,t_1     !sqr_add_c2(a,2,1,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        addx    c_3,%g0,c_3
-        addcc   c_1,t_1,c_1
-        addxcc  c_2,t_2,c_2
-        addx    c_3,%g0,c_3     !=
-        st      c_1,rp(3)       !r[3]=c1;
-        umul    a_3,a_1,t_1     !sqr_add_c2(a,3,1,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    %g0,%g0,c_1
-        addcc   c_2,t_1,c_2
-        addxcc  c_3,t_2,c_3     !=
-        addx    c_1,%g0,c_1
-        umul    a_2,a_2,t_1     !sqr_add_c(a,2,c2,c3,c1);
-        addcc   c_2,t_1,c_2
-        rd      %y,t_2          !=
-        addxcc  c_3,t_2,c_3
-        addx    c_1,%g0,c_1
-        st      c_2,rp(4)       !r[4]=c2;
-        umul    a_2,a_3,t_1     !=!sqr_add_c2(a,3,2,c3,c1,c2);
-        addcc   c_3,t_1,c_3
-        rd      %y,t_2
-        addxcc  c_1,t_2,c_1
-        addx    %g0,%g0,c_2     !=
-        addcc   c_3,t_1,c_3
-        addxcc  c_1,t_2,c_1
-        st      c_3,rp(5)       !r[5]=c3;
-        addx    c_2,%g0,c_2     !=
-        umul    a_3,a_3,t_1     !sqr_add_c(a,3,c1,c2,c3);
-        addcc   c_1,t_1,c_1
-        rd      %y,t_2
-        addxcc  c_2,t_2,c_2     !=
-        st      c_1,rp(6)       !r[6]=c1;
-        st      c_2,rp(7)       !r[7]=c2;
-        
-        ret
-        restore %g0,%g0,%o0
-.type   bn_sqr_comba4,#function
-.size   bn_sqr_comba4,(.-bn_sqr_comba4)
-.align  32
diff --git a/src/lib/libcrypto/bn/asm/sparcv8plus.S b/src/lib/libcrypto/bn/asm/sparcv8plus.S
deleted file mode 100644
index 8c56e2e7e7..0000000000
--- a/src/lib/libcrypto/bn/asm/sparcv8plus.S
+++ /dev/null
@@ -1,1547 +0,0 @@
-.ident  "sparcv8plus.s, Version 1.4"
-.ident  "SPARC v9 ISA artwork by Andy Polyakov <appro@fy.chalmers.se>"
-/*
- * ====================================================================
- * Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
- * project.
- *
- * Rights for redistribution and usage in source and binary forms are
- * granted according to the OpenSSL license. Warranty of any kind is
- * disclaimed.
- * ====================================================================
- */
-/*
- * This is my modest contributon to OpenSSL project (see
- * http://www.openssl.org/ for more information about it) and is
- * a drop-in UltraSPARC ISA replacement for crypto/bn/bn_asm.c
- * module. For updates see http://fy.chalmers.se/~appro/hpe/.
- *
- * Questions-n-answers.
- *
- * Q. How to compile?
- * A. With SC4.x/SC5.x:
- *
- *      cc -xarch=v8plus -c bn_asm.sparc.v8plus.S -o bn_asm.o
- *
- *    and with gcc:
- *
- *      gcc -mcpu=ultrasparc -c bn_asm.sparc.v8plus.S -o bn_asm.o
- *
- *    or if above fails (it does if you have gas installed):
- *
- *      gcc -E bn_asm.sparc.v8plus.S | as -xarch=v8plus /dev/fd/0 -o bn_asm.o
- *
- *    Quick-n-dirty way to fuse the module into the library.
- *    Provided that the library is already configured and built
- *    (in 0.9.2 case with no-asm option):
- *
- *      # cd crypto/bn
- *      # cp /some/place/bn_asm.sparc.v8plus.S .
- *      # cc -xarch=v8plus -c bn_asm.sparc.v8plus.S -o bn_asm.o
- *      # make
- *      # cd ../..
- *      # make; make test
- *
- *    Quick-n-dirty way to get rid of it:
- *
- *      # cd crypto/bn
- *      # touch bn_asm.c
- *      # make
- *      # cd ../..
- *      # make; make test
- *
- * Q. V8plus achitecture? What kind of beast is that?
- * A. Well, it's rather a programming model than an architecture...
- *    It's actually v9-compliant, i.e. *any* UltraSPARC, CPU under
- *    special conditions, namely when kernel doesn't preserve upper
- *    32 bits of otherwise 64-bit registers during a context switch.
- *
- * Q. Why just UltraSPARC? What about SuperSPARC?
- * A. Original release did target UltraSPARC only. Now SuperSPARC
- *    version is provided along. Both version share bn_*comba[48]
- *    implementations (see comment later in code for explanation).
- *    But what's so special about this UltraSPARC implementation?
- *    Why didn't I let compiler do the job? Trouble is that most of
- *    available compilers (well, SC5.0 is the only exception) don't
- *    attempt to take advantage of UltraSPARC's 64-bitness under
- *    32-bit kernels even though it's perfectly possible (see next
- *    question).
- *
- * Q. 64-bit registers under 32-bit kernels? Didn't you just say it
- *    doesn't work?
- * A. You can't adress *all* registers as 64-bit wide:-( The catch is
- *    that you actually may rely upon %o0-%o5 and %g1-%g4 being fully
- *    preserved if you're in a leaf function, i.e. such never calling
- *    any other functions. All functions in this module are leaf and
- *    10 registers is a handful. And as a matter of fact none-"comba"
- *    routines don't require even that much and I could even afford to
- *    not allocate own stack frame for 'em:-)
- *
- * Q. What about 64-bit kernels?
- * A. What about 'em? Just kidding:-) Pure 64-bit version is currently
- *    under evaluation and development...
- *
- * Q. What about shared libraries?
- * A. What about 'em? Kidding again:-) Code does *not* contain any
- *    code position dependencies and it's safe to include it into
- *    shared library as is.
- *
- * Q. How much faster does it go?
- * A. Do you have a good benchmark? In either case below is what I
- *    experience with crypto/bn/expspeed.c test program:
- *
- *      v8plus module on U10/300MHz against bn_asm.c compiled with:
- *
- *      cc-5.0 -xarch=v8plus -xO5 -xdepend      +7-12%
- *      cc-4.2 -xarch=v8plus -xO5 -xdepend      +25-35%
- *      egcs-1.1.2 -mcpu=ultrasparc -O3         +35-45%
- *
- *      v8 module on SS10/60MHz against bn_asm.c compiled with:
- *
- *      cc-5.0 -xarch=v8 -xO5 -xdepend          +7-10%
- *      cc-4.2 -xarch=v8 -xO5 -xdepend          +10%
- *      egcs-1.1.2 -mv8 -O3                     +35-45%
- *
- *    As you can see it's damn hard to beat the new Sun C compiler
- *    and it's in first place GNU C users who will appreciate this
- *    assembler implementation:-)       
- */
-/*
- * Revision history.
- *
- * 1.0  - initial release;
- * 1.1  - new loop unrolling model(*);
- *      - some more fine tuning;
- * 1.2  - made gas friendly;
- *      - updates to documentation concerning v9;
- *      - new performance comparison matrix;
- * 1.3  - fixed problem with /usr/ccs/lib/cpp;
- * 1.4  - native V9 bn_*_comba[48] implementation (15% more efficient)
- *        resulting in slight overall performance kick;
- *      - some retunes;
- *      - support for GNU as added;
- *
- * (*)  Originally unrolled loop looked like this:
- *          for (;;) {
- *              op(p+0); if (--n==0) break;
- *              op(p+1); if (--n==0) break;
- *              op(p+2); if (--n==0) break;
- *              op(p+3); if (--n==0) break;
- *              p+=4;
- *          }
- *      I unroll according to following:
- *          while (n&~3) {
- *              op(p+0); op(p+1); op(p+2); op(p+3);
- *              p+=4; n=-4;
- *          }
- *          if (n) {
- *              op(p+0); if (--n==0) return;
- *              op(p+2); if (--n==0) return;
- *              op(p+3); return;
- *          }
- */
-/*
- * GNU assembler can't stand stuw:-(
- */
-#define stuw st
-.section        ".text",#alloc,#execinstr
-.file           "bn_asm.sparc.v8plus.S"
-.align  32
-.global bn_mul_add_words
-/*
- * BN_ULONG bn_mul_add_words(rp,ap,num,w)
- * BN_ULONG *rp,*ap;
- * int num;
- * BN_ULONG w;
- */
-bn_mul_add_words:
-        sra     %o2,%g0,%o2     ! signx %o2
-        brgz,a  %o2,.L_bn_mul_add_words_proceed
-        lduw    [%o1],%g2
-        retl
-        clr     %o0
-        nop
-        nop
-        nop
-.L_bn_mul_add_words_proceed:
-        srl     %o3,%g0,%o3     ! clruw %o3
-        andcc   %o2,-4,%g0
-        bz,pn   %icc,.L_bn_mul_add_words_tail
-        clr     %o5
-.L_bn_mul_add_words_loop:       ! wow! 32 aligned!
-        lduw    [%o0],%g1
-        lduw    [%o1+4],%g3
-        mulx    %o3,%g2,%g2
-        add     %g1,%o5,%o4
-        nop
-        add     %o4,%g2,%o4
-        stuw    %o4,[%o0]
-        srlx    %o4,32,%o5
-        lduw    [%o0+4],%g1
-        lduw    [%o1+8],%g2
-        mulx    %o3,%g3,%g3
-        add     %g1,%o5,%o4
-        dec     4,%o2
-        add     %o4,%g3,%o4
-        stuw    %o4,[%o0+4]
-        srlx    %o4,32,%o5
-        lduw    [%o0+8],%g1
-        lduw    [%o1+12],%g3
-        mulx    %o3,%g2,%g2
-        add     %g1,%o5,%o4
-        inc     16,%o1
-        add     %o4,%g2,%o4
-        stuw    %o4,[%o0+8]
-        srlx    %o4,32,%o5
-        lduw    [%o0+12],%g1
-        mulx    %o3,%g3,%g3
-        add     %g1,%o5,%o4
-        inc     16,%o0
-        add     %o4,%g3,%o4
-        andcc   %o2,-4,%g0
-        stuw    %o4,[%o0-4]
-        srlx    %o4,32,%o5
-        bnz,a,pt        %icc,.L_bn_mul_add_words_loop
-        lduw    [%o1],%g2
-        brnz,a,pn       %o2,.L_bn_mul_add_words_tail
-        lduw    [%o1],%g2
-.L_bn_mul_add_words_return:
-        retl
-        mov     %o5,%o0
-.L_bn_mul_add_words_tail:
-        lduw    [%o0],%g1
-        mulx    %o3,%g2,%g2
-        add     %g1,%o5,%o4
-        dec     %o2
-        add     %o4,%g2,%o4
-        srlx    %o4,32,%o5
-        brz,pt  %o2,.L_bn_mul_add_words_return
-        stuw    %o4,[%o0]
-        lduw    [%o1+4],%g2
-        lduw    [%o0+4],%g1
-        mulx    %o3,%g2,%g2
-        add     %g1,%o5,%o4
-        dec     %o2
-        add     %o4,%g2,%o4
-        srlx    %o4,32,%o5
-        brz,pt  %o2,.L_bn_mul_add_words_return
-        stuw    %o4,[%o0+4]
-        lduw    [%o1+8],%g2
-        lduw    [%o0+8],%g1
-        mulx    %o3,%g2,%g2
-        add     %g1,%o5,%o4
-        add     %o4,%g2,%o4
-        stuw    %o4,[%o0+8]
-        retl
-        srlx    %o4,32,%o0
-.type   bn_mul_add_words,#function
-.size   bn_mul_add_words,(.-bn_mul_add_words)
-.align  32
-.global bn_mul_words
-/*
- * BN_ULONG bn_mul_words(rp,ap,num,w)
- * BN_ULONG *rp,*ap;
- * int num;
- * BN_ULONG w;
- */
-bn_mul_words:
-        sra     %o2,%g0,%o2     ! signx %o2
-        brgz,a  %o2,.L_bn_mul_words_proceeed
-        lduw    [%o1],%g2
-        retl
-        clr     %o0
-        nop
-        nop
-        nop
-.L_bn_mul_words_proceeed:
-        srl     %o3,%g0,%o3     ! clruw %o3
-        andcc   %o2,-4,%g0
-        bz,pn   %icc,.L_bn_mul_words_tail
-        clr     %o5
-.L_bn_mul_words_loop:           ! wow! 32 aligned!
-        lduw    [%o1+4],%g3
-        mulx    %o3,%g2,%g2
-        add     %g2,%o5,%o4
-        nop
-        stuw    %o4,[%o0]
-        srlx    %o4,32,%o5
-        lduw    [%o1+8],%g2
-        mulx    %o3,%g3,%g3
-        add     %g3,%o5,%o4
-        dec     4,%o2
-        stuw    %o4,[%o0+4]
-        srlx    %o4,32,%o5
-        lduw    [%o1+12],%g3
-        mulx    %o3,%g2,%g2
-        add     %g2,%o5,%o4
-        inc     16,%o1
-        stuw    %o4,[%o0+8]
-        srlx    %o4,32,%o5
-        mulx    %o3,%g3,%g3
-        add     %g3,%o5,%o4
-        inc     16,%o0
-        stuw    %o4,[%o0-4]
-        srlx    %o4,32,%o5
-        andcc   %o2,-4,%g0
-        bnz,a,pt        %icc,.L_bn_mul_words_loop
-        lduw    [%o1],%g2
-        nop
-        nop
-        brnz,a,pn       %o2,.L_bn_mul_words_tail
-        lduw    [%o1],%g2
-.L_bn_mul_words_return:
-        retl
-        mov     %o5,%o0
-.L_bn_mul_words_tail:
-        mulx    %o3,%g2,%g2
-        add     %g2,%o5,%o4
-        dec     %o2
-        srlx    %o4,32,%o5
-        brz,pt  %o2,.L_bn_mul_words_return
-        stuw    %o4,[%o0]
-        lduw    [%o1+4],%g2
-        mulx    %o3,%g2,%g2
-        add     %g2,%o5,%o4
-        dec     %o2
-        srlx    %o4,32,%o5
-        brz,pt  %o2,.L_bn_mul_words_return
-        stuw    %o4,[%o0+4]
-        lduw    [%o1+8],%g2
-        mulx    %o3,%g2,%g2
-        add     %g2,%o5,%o4
-        stuw    %o4,[%o0+8]
-        retl
-        srlx    %o4,32,%o0
-.type   bn_mul_words,#function
-.size   bn_mul_words,(.-bn_mul_words)
-.align  32
-.global bn_sqr_words
-/*
- * void bn_sqr_words(r,a,n)
- * BN_ULONG *r,*a;
- * int n;
- */
-bn_sqr_words:
-        sra     %o2,%g0,%o2     ! signx %o2
-        brgz,a  %o2,.L_bn_sqr_words_proceeed
-        lduw    [%o1],%g2
-        retl
-        clr     %o0
-        nop
-        nop
-        nop
-.L_bn_sqr_words_proceeed:
-        andcc   %o2,-4,%g0
-        nop
-        bz,pn   %icc,.L_bn_sqr_words_tail
-        nop
-.L_bn_sqr_words_loop:           ! wow! 32 aligned!
-        lduw    [%o1+4],%g3
-        mulx    %g2,%g2,%o4
-        stuw    %o4,[%o0]
-        srlx    %o4,32,%o5
-        stuw    %o5,[%o0+4]
-        nop
-        lduw    [%o1+8],%g2
-        mulx    %g3,%g3,%o4
-        dec     4,%o2
-        stuw    %o4,[%o0+8]
-        srlx    %o4,32,%o5
-        stuw    %o5,[%o0+12]
-        lduw    [%o1+12],%g3
-        mulx    %g2,%g2,%o4
-        srlx    %o4,32,%o5
-        stuw    %o4,[%o0+16]
-        inc     16,%o1
-        stuw    %o5,[%o0+20]
-        mulx    %g3,%g3,%o4
-        inc     32,%o0
-        stuw    %o4,[%o0-8]
-        srlx    %o4,32,%o5
-        andcc   %o2,-4,%g2
-        stuw    %o5,[%o0-4]
-        bnz,a,pt        %icc,.L_bn_sqr_words_loop
-        lduw    [%o1],%g2
-        nop
-        brnz,a,pn       %o2,.L_bn_sqr_words_tail
-        lduw    [%o1],%g2
-.L_bn_sqr_words_return:
-        retl
-        clr     %o0
-.L_bn_sqr_words_tail:
-        mulx    %g2,%g2,%o4
-        dec     %o2
-        stuw    %o4,[%o0]
-        srlx    %o4,32,%o5
-        brz,pt  %o2,.L_bn_sqr_words_return
-        stuw    %o5,[%o0+4]
-        lduw    [%o1+4],%g2
-        mulx    %g2,%g2,%o4
-        dec     %o2
-        stuw    %o4,[%o0+8]
-        srlx    %o4,32,%o5
-        brz,pt  %o2,.L_bn_sqr_words_return
-        stuw    %o5,[%o0+12]
-        lduw    [%o1+8],%g2
-        mulx    %g2,%g2,%o4
-        srlx    %o4,32,%o5
-        stuw    %o4,[%o0+16]
-        stuw    %o5,[%o0+20]
-        retl
-        clr     %o0
-.type   bn_sqr_words,#function
-.size   bn_sqr_words,(.-bn_sqr_words)
-.align  32
-.global bn_div_words
-/*
- * BN_ULONG bn_div_words(h,l,d)
- * BN_ULONG h,l,d;
- */
-bn_div_words:
-        sllx    %o0,32,%o0
-        or      %o0,%o1,%o0
-        udivx   %o0,%o2,%o0
-        retl
-        srl     %o0,%g0,%o0     ! clruw %o0
-.type   bn_div_words,#function
-.size   bn_div_words,(.-bn_div_words)
-.align  32
-.global bn_add_words
-/*
- * BN_ULONG bn_add_words(rp,ap,bp,n)
- * BN_ULONG *rp,*ap,*bp;
- * int n;
- */
-bn_add_words:
-        sra     %o3,%g0,%o3     ! signx %o3
-        brgz,a  %o3,.L_bn_add_words_proceed
-        lduw    [%o1],%o4
-        retl
-        clr     %o0
-.L_bn_add_words_proceed:
-        andcc   %o3,-4,%g0
-        bz,pn   %icc,.L_bn_add_words_tail
-        addcc   %g0,0,%g0       ! clear carry flag
-.L_bn_add_words_loop:           ! wow! 32 aligned!
-        dec     4,%o3
-        lduw    [%o2],%o5
-        lduw    [%o1+4],%g1
-        lduw    [%o2+4],%g2
-        lduw    [%o1+8],%g3
-        lduw    [%o2+8],%g4
-        addccc  %o5,%o4,%o5
-        stuw    %o5,[%o0]
-        lduw    [%o1+12],%o4
-        lduw    [%o2+12],%o5
-        inc     16,%o1
-        addccc  %g1,%g2,%g1
-        stuw    %g1,[%o0+4]
-        
-        inc     16,%o2
-        addccc  %g3,%g4,%g3
-        stuw    %g3,[%o0+8]
-        inc     16,%o0
-        addccc  %o5,%o4,%o5
-        stuw    %o5,[%o0-4]
-        and     %o3,-4,%g1
-        brnz,a,pt       %g1,.L_bn_add_words_loop
-        lduw    [%o1],%o4
-        brnz,a,pn       %o3,.L_bn_add_words_tail
-        lduw    [%o1],%o4
-.L_bn_add_words_return:
-        clr     %o0
-        retl
-        movcs   %icc,1,%o0
-        nop
-.L_bn_add_words_tail:
-        lduw    [%o2],%o5
-        dec     %o3
-        addccc  %o5,%o4,%o5
-        brz,pt  %o3,.L_bn_add_words_return
-        stuw    %o5,[%o0]
-        lduw    [%o1+4],%o4
-        lduw    [%o2+4],%o5
-        dec     %o3
-        addccc  %o5,%o4,%o5
-        brz,pt  %o3,.L_bn_add_words_return
-        stuw    %o5,[%o0+4]
-        lduw    [%o1+8],%o4
-        lduw    [%o2+8],%o5
-        addccc  %o5,%o4,%o5
-        stuw    %o5,[%o0+8]
-        clr     %o0
-        retl
-        movcs   %icc,1,%o0
-.type   bn_add_words,#function
-.size   bn_add_words,(.-bn_add_words)
-.global bn_sub_words
-/*
- * BN_ULONG bn_sub_words(rp,ap,bp,n)
- * BN_ULONG *rp,*ap,*bp;
- * int n;
- */
-bn_sub_words:
-        sra     %o3,%g0,%o3     ! signx %o3
-        brgz,a  %o3,.L_bn_sub_words_proceed
-        lduw    [%o1],%o4
-        retl
-        clr     %o0
-.L_bn_sub_words_proceed:
-        andcc   %o3,-4,%g0
-        bz,pn   %icc,.L_bn_sub_words_tail
-        addcc   %g0,0,%g0       ! clear carry flag
-.L_bn_sub_words_loop:           ! wow! 32 aligned!
-        dec     4,%o3
-        lduw    [%o2],%o5
-        lduw    [%o1+4],%g1
-        lduw    [%o2+4],%g2
-        lduw    [%o1+8],%g3
-        lduw    [%o2+8],%g4
-        subccc  %o4,%o5,%o5
-        stuw    %o5,[%o0]
-        lduw    [%o1+12],%o4
-        lduw    [%o2+12],%o5
-        inc     16,%o1
-        subccc  %g1,%g2,%g2
-        stuw    %g2,[%o0+4]
-        inc     16,%o2
-        subccc  %g3,%g4,%g4
-        stuw    %g4,[%o0+8]
-        inc     16,%o0
-        subccc  %o4,%o5,%o5
-        stuw    %o5,[%o0-4]
-        and     %o3,-4,%g1
-        brnz,a,pt       %g1,.L_bn_sub_words_loop
-        lduw    [%o1],%o4
-        brnz,a,pn       %o3,.L_bn_sub_words_tail
-        lduw    [%o1],%o4
-.L_bn_sub_words_return:
-        clr     %o0
-        retl
-        movcs   %icc,1,%o0
-        nop
-.L_bn_sub_words_tail:           ! wow! 32 aligned!
-        lduw    [%o2],%o5
-        dec     %o3
-        subccc  %o4,%o5,%o5
-        brz,pt  %o3,.L_bn_sub_words_return
-        stuw    %o5,[%o0]
-        lduw    [%o1+4],%o4
-        lduw    [%o2+4],%o5
-        dec     %o3
-        subccc  %o4,%o5,%o5
-        brz,pt  %o3,.L_bn_sub_words_return
-        stuw    %o5,[%o0+4]
-        lduw    [%o1+8],%o4
-        lduw    [%o2+8],%o5
-        subccc  %o4,%o5,%o5
-        stuw    %o5,[%o0+8]
-        clr     %o0
-        retl
-        movcs   %icc,1,%o0
-.type   bn_sub_words,#function
-.size   bn_sub_words,(.-bn_sub_words)
-/*
- * Code below depends on the fact that upper parts of the %l0-%l7
- * and %i0-%i7 are zeroed by kernel after context switch. In
- * previous versions this comment stated that "the trouble is that
- * it's not feasible to implement the mumbo-jumbo in less V9
- * instructions:-(" which apparently isn't true thanks to
- * 'bcs,a %xcc,.+8; inc %rd' pair. But the performance improvement
- * results not from the shorter code, but from elimination of
- * multicycle none-pairable 'rd %y,%rd' instructions.
- *
- *                                                      Andy.
- */
-#define FRAME_SIZE      -96
-/*
- * Here is register usage map for *all* routines below.
- */
-#define t_1     %o0
-#define t_2     %o1
-#define c_12    %o2
-#define c_3     %o3
-#define ap(I)   [%i1+4*I]
-#define bp(I)   [%i2+4*I]
-#define rp(I)   [%i0+4*I]
-#define a_0     %l0
-#define a_1     %l1
-#define a_2     %l2
-#define a_3     %l3
-#define a_4     %l4
-#define a_5     %l5
-#define a_6     %l6
-#define a_7     %l7
-#define b_0     %i3
-#define b_1     %i4
-#define b_2     %i5
-#define b_3     %o4
-#define b_4     %o5
-#define b_5     %o7
-#define b_6     %g1
-#define b_7     %g4
-.align  32
-.global bn_mul_comba8
-/*
- * void bn_mul_comba8(r,a,b)
- * BN_ULONG *r,*a,*b;
- */
-bn_mul_comba8:
-        save    %sp,FRAME_SIZE,%sp
-        mov     1,t_2
-        lduw    ap(0),a_0
-        sllx    t_2,32,t_2
-        lduw    bp(0),b_0       !=
-        lduw    bp(1),b_1
-        mulx    a_0,b_0,t_1     !mul_add_c(a[0],b[0],c1,c2,c3);
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(0)       !=!r[0]=c1;
-        lduw    ap(1),a_1
-        mulx    a_0,b_1,t_1     !mul_add_c(a[0],b[1],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3             !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(2),a_2
-        mulx    a_1,b_0,t_1     !=!mul_add_c(a[1],b[0],c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(1)       !r[1]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_2,b_0,t_1     !mul_add_c(a[2],b[0],c3,c1,c2);
-        addcc   c_12,t_1,c_12   !=
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    bp(2),b_2       !=
-        mulx    a_1,b_1,t_1     !mul_add_c(a[1],b[1],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        lduw    bp(3),b_3
-        mulx    a_0,b_2,t_1     !mul_add_c(a[0],b[2],c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(2)       !r[2]=c3;
-        or      c_12,c_3,c_12   !=
-        mulx    a_0,b_3,t_1     !mul_add_c(a[0],b[3],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_1,b_2,t_1     !=!mul_add_c(a[1],b[2],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        lduw    ap(3),a_3
-        mulx    a_2,b_1,t_1     !mul_add_c(a[2],b[1],c1,c2,c3);
-        addcc   c_12,t_1,c_12   !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(4),a_4
-        mulx    a_3,b_0,t_1     !=!mul_add_c(a[3],b[0],c1,c2,c3);!=
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(3)       !r[3]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_4,b_0,t_1     !mul_add_c(a[4],b[0],c2,c3,c1);
-        addcc   c_12,t_1,c_12   !=
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,b_1,t_1     !=!mul_add_c(a[3],b[1],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_2,b_2,t_1     !=!mul_add_c(a[2],b[2],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    bp(4),b_4       !=
-        mulx    a_1,b_3,t_1     !mul_add_c(a[1],b[3],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        lduw    bp(5),b_5
-        mulx    a_0,b_4,t_1     !mul_add_c(a[0],b[4],c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(4)       !r[4]=c2;
-        or      c_12,c_3,c_12   !=
-        mulx    a_0,b_5,t_1     !mul_add_c(a[0],b[5],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_1,b_4,t_1     !mul_add_c(a[1],b[4],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_2,b_3,t_1     !mul_add_c(a[2],b[3],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_3,b_2,t_1     !mul_add_c(a[3],b[2],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        lduw    ap(5),a_5
-        mulx    a_4,b_1,t_1     !mul_add_c(a[4],b[1],c3,c1,c2);
-        addcc   c_12,t_1,c_12   !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(6),a_6
-        mulx    a_5,b_0,t_1     !=!mul_add_c(a[5],b[0],c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(5)       !r[5]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_6,b_0,t_1     !mul_add_c(a[6],b[0],c1,c2,c3);
-        addcc   c_12,t_1,c_12   !=
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_5,b_1,t_1     !=!mul_add_c(a[5],b[1],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_4,b_2,t_1     !=!mul_add_c(a[4],b[2],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,b_3,t_1     !=!mul_add_c(a[3],b[3],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_2,b_4,t_1     !=!mul_add_c(a[2],b[4],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    bp(6),b_6       !=
-        mulx    a_1,b_5,t_1     !mul_add_c(a[1],b[5],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        lduw    bp(7),b_7
-        mulx    a_0,b_6,t_1     !mul_add_c(a[0],b[6],c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(6)       !r[6]=c1;
-        or      c_12,c_3,c_12   !=
-        mulx    a_0,b_7,t_1     !mul_add_c(a[0],b[7],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_1,b_6,t_1     !mul_add_c(a[1],b[6],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_2,b_5,t_1     !mul_add_c(a[2],b[5],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_3,b_4,t_1     !mul_add_c(a[3],b[4],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_4,b_3,t_1     !mul_add_c(a[4],b[3],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_5,b_2,t_1     !mul_add_c(a[5],b[2],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        lduw    ap(7),a_7
-        mulx    a_6,b_1,t_1     !=!mul_add_c(a[6],b[1],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_7,b_0,t_1     !=!mul_add_c(a[7],b[0],c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(7)       !r[7]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_7,b_1,t_1     !=!mul_add_c(a[7],b[1],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_6,b_2,t_1     !mul_add_c(a[6],b[2],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_5,b_3,t_1     !mul_add_c(a[5],b[3],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_4,b_4,t_1     !mul_add_c(a[4],b[4],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_3,b_5,t_1     !mul_add_c(a[3],b[5],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_2,b_6,t_1     !mul_add_c(a[2],b[6],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_1,b_7,t_1     !mul_add_c(a[1],b[7],c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(8)       !r[8]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_2,b_7,t_1     !=!mul_add_c(a[2],b[7],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        mulx    a_3,b_6,t_1     !mul_add_c(a[3],b[6],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_4,b_5,t_1     !mul_add_c(a[4],b[5],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_5,b_4,t_1     !mul_add_c(a[5],b[4],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_6,b_3,t_1     !mul_add_c(a[6],b[3],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_7,b_2,t_1     !mul_add_c(a[7],b[2],c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(9)       !r[9]=c1;
-        or      c_12,c_3,c_12   !=
-        mulx    a_7,b_3,t_1     !mul_add_c(a[7],b[3],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_6,b_4,t_1     !mul_add_c(a[6],b[4],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_5,b_5,t_1     !mul_add_c(a[5],b[5],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_4,b_6,t_1     !mul_add_c(a[4],b[6],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_3,b_7,t_1     !mul_add_c(a[3],b[7],c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(10)      !r[10]=c2;
-        or      c_12,c_3,c_12   !=
-        mulx    a_4,b_7,t_1     !mul_add_c(a[4],b[7],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_5,b_6,t_1     !mul_add_c(a[5],b[6],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_6,b_5,t_1     !mul_add_c(a[6],b[5],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_7,b_4,t_1     !mul_add_c(a[7],b[4],c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(11)      !r[11]=c3;
-        or      c_12,c_3,c_12   !=
-        mulx    a_7,b_5,t_1     !mul_add_c(a[7],b[5],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_6,b_6,t_1     !mul_add_c(a[6],b[6],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_5,b_7,t_1     !mul_add_c(a[5],b[7],c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(12)      !r[12]=c1;
-        or      c_12,c_3,c_12   !=
-        mulx    a_6,b_7,t_1     !mul_add_c(a[6],b[7],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_7,b_6,t_1     !mul_add_c(a[7],b[6],c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        st      t_1,rp(13)      !r[13]=c2;
-        or      c_12,c_3,c_12   !=
-        mulx    a_7,b_7,t_1     !mul_add_c(a[7],b[7],c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(14)      !r[14]=c3;
-        stuw    c_12,rp(15)     !r[15]=c1;
-        ret
-        restore %g0,%g0,%o0     !=
-.type   bn_mul_comba8,#function
-.size   bn_mul_comba8,(.-bn_mul_comba8)
-.align  32
-.global bn_mul_comba4
-/*
- * void bn_mul_comba4(r,a,b)
- * BN_ULONG *r,*a,*b;
- */
-bn_mul_comba4:
-        save    %sp,FRAME_SIZE,%sp
-        lduw    ap(0),a_0
-        mov     1,t_2
-        lduw    bp(0),b_0
-        sllx    t_2,32,t_2      !=
-        lduw    bp(1),b_1
-        mulx    a_0,b_0,t_1     !mul_add_c(a[0],b[0],c1,c2,c3);
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(0)       !=!r[0]=c1;
-        lduw    ap(1),a_1
-        mulx    a_0,b_1,t_1     !mul_add_c(a[0],b[1],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3             !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(2),a_2
-        mulx    a_1,b_0,t_1     !=!mul_add_c(a[1],b[0],c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(1)       !r[1]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_2,b_0,t_1     !mul_add_c(a[2],b[0],c3,c1,c2);
-        addcc   c_12,t_1,c_12   !=
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    bp(2),b_2       !=
-        mulx    a_1,b_1,t_1     !mul_add_c(a[1],b[1],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3     !=
-        lduw    bp(3),b_3
-        mulx    a_0,b_2,t_1     !mul_add_c(a[0],b[2],c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(2)       !r[2]=c3;
-        or      c_12,c_3,c_12   !=
-        mulx    a_0,b_3,t_1     !mul_add_c(a[0],b[3],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        mulx    a_1,b_2,t_1     !mul_add_c(a[1],b[2],c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8        !=
-        add     c_3,t_2,c_3
-        lduw    ap(3),a_3
-        mulx    a_2,b_1,t_1     !mul_add_c(a[2],b[1],c1,c2,c3);
-        addcc   c_12,t_1,c_12   !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,b_0,t_1     !mul_add_c(a[3],b[0],c1,c2,c3);!=
-        addcc   c_12,t_1,t_1    !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(3)       !=!r[3]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_3,b_1,t_1     !mul_add_c(a[3],b[1],c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3             !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_2,b_2,t_1     !mul_add_c(a[2],b[2],c2,c3,c1);
-        addcc   c_12,t_1,c_12   !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_1,b_3,t_1     !mul_add_c(a[1],b[3],c2,c3,c1);
-        addcc   c_12,t_1,t_1    !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(4)       !=!r[4]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_2,b_3,t_1     !mul_add_c(a[2],b[3],c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3             !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,b_2,t_1     !mul_add_c(a[3],b[2],c3,c1,c2);
-        addcc   c_12,t_1,t_1    !=
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(5)       !=!r[5]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_3,b_3,t_1     !mul_add_c(a[3],b[3],c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        srlx    t_1,32,c_12     !=
-        stuw    t_1,rp(6)       !r[6]=c1;
-        stuw    c_12,rp(7)      !r[7]=c2;
-        
-        ret
-        restore %g0,%g0,%o0
-.type   bn_mul_comba4,#function
-.size   bn_mul_comba4,(.-bn_mul_comba4)
-.align  32
-.global bn_sqr_comba8
-bn_sqr_comba8:
-        save    %sp,FRAME_SIZE,%sp
-        mov     1,t_2
-        lduw    ap(0),a_0
-        sllx    t_2,32,t_2
-        lduw    ap(1),a_1
-        mulx    a_0,a_0,t_1     !sqr_add_c(a,0,c1,c2,c3);
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(0)       !r[0]=c1;
-        lduw    ap(2),a_2
-        mulx    a_0,a_1,t_1     !=!sqr_add_c2(a,1,0,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(1)       !r[1]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_2,a_0,t_1     !sqr_add_c2(a,2,0,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(3),a_3
-        mulx    a_1,a_1,t_1     !sqr_add_c(a,1,c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(2)       !r[2]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_0,a_3,t_1     !sqr_add_c2(a,3,0,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(4),a_4
-        mulx    a_1,a_2,t_1     !sqr_add_c2(a,2,1,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        st      t_1,rp(3)       !r[3]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_4,a_0,t_1     !sqr_add_c2(a,4,0,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,a_1,t_1     !sqr_add_c2(a,3,1,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(5),a_5
-        mulx    a_2,a_2,t_1     !sqr_add_c(a,2,c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(4)       !r[4]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_0,a_5,t_1     !sqr_add_c2(a,5,0,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_1,a_4,t_1     !sqr_add_c2(a,4,1,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(6),a_6
-        mulx    a_2,a_3,t_1     !sqr_add_c2(a,3,2,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(5)       !r[5]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_6,a_0,t_1     !sqr_add_c2(a,6,0,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_5,a_1,t_1     !sqr_add_c2(a,5,1,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_4,a_2,t_1     !sqr_add_c2(a,4,2,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(7),a_7
-        mulx    a_3,a_3,t_1     !=!sqr_add_c(a,3,c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(6)       !r[6]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_0,a_7,t_1     !sqr_add_c2(a,7,0,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_1,a_6,t_1     !sqr_add_c2(a,6,1,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_2,a_5,t_1     !sqr_add_c2(a,5,2,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,a_4,t_1     !sqr_add_c2(a,4,3,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(7)       !r[7]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_7,a_1,t_1     !sqr_add_c2(a,7,1,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_6,a_2,t_1     !sqr_add_c2(a,6,2,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_5,a_3,t_1     !sqr_add_c2(a,5,3,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_4,a_4,t_1     !sqr_add_c(a,4,c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(8)       !r[8]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_2,a_7,t_1     !sqr_add_c2(a,7,2,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_3,a_6,t_1     !sqr_add_c2(a,6,3,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_4,a_5,t_1     !sqr_add_c2(a,5,4,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(9)       !r[9]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_7,a_3,t_1     !sqr_add_c2(a,7,3,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_6,a_4,t_1     !sqr_add_c2(a,6,4,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_5,a_5,t_1     !sqr_add_c(a,5,c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(10)      !r[10]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_4,a_7,t_1     !sqr_add_c2(a,7,4,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_5,a_6,t_1     !sqr_add_c2(a,6,5,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(11)      !r[11]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_7,a_5,t_1     !sqr_add_c2(a,7,5,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_6,a_6,t_1     !sqr_add_c(a,6,c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(12)      !r[12]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_6,a_7,t_1     !sqr_add_c2(a,7,6,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(13)      !r[13]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_7,a_7,t_1     !sqr_add_c(a,7,c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(14)      !r[14]=c3;
-        stuw    c_12,rp(15)     !r[15]=c1;
-        ret
-        restore %g0,%g0,%o0
-.type   bn_sqr_comba8,#function
-.size   bn_sqr_comba8,(.-bn_sqr_comba8)
-.align  32
-.global bn_sqr_comba4
-/*
- * void bn_sqr_comba4(r,a)
- * BN_ULONG *r,*a;
- */
-bn_sqr_comba4:
-        save    %sp,FRAME_SIZE,%sp
-        mov     1,t_2
-        lduw    ap(0),a_0
-        sllx    t_2,32,t_2
-        lduw    ap(1),a_1
-        mulx    a_0,a_0,t_1     !sqr_add_c(a,0,c1,c2,c3);
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(0)       !r[0]=c1;
-        lduw    ap(2),a_2
-        mulx    a_0,a_1,t_1     !sqr_add_c2(a,1,0,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(1)       !r[1]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_2,a_0,t_1     !sqr_add_c2(a,2,0,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        lduw    ap(3),a_3
-        mulx    a_1,a_1,t_1     !sqr_add_c(a,1,c3,c1,c2);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(2)       !r[2]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_0,a_3,t_1     !sqr_add_c2(a,3,0,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_1,a_2,t_1     !sqr_add_c2(a,2,1,c1,c2,c3);
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(3)       !r[3]=c1;
-        or      c_12,c_3,c_12
-        mulx    a_3,a_1,t_1     !sqr_add_c2(a,3,1,c2,c3,c1);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,c_12
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        mulx    a_2,a_2,t_1     !sqr_add_c(a,2,c2,c3,c1);
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(4)       !r[4]=c2;
-        or      c_12,c_3,c_12
-        mulx    a_2,a_3,t_1     !sqr_add_c2(a,3,2,c3,c1,c2);
-        addcc   c_12,t_1,c_12
-        clr     c_3
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        addcc   c_12,t_1,t_1
-        bcs,a   %xcc,.+8
-        add     c_3,t_2,c_3
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(5)       !r[5]=c3;
-        or      c_12,c_3,c_12
-        mulx    a_3,a_3,t_1     !sqr_add_c(a,3,c1,c2,c3);
-        addcc   c_12,t_1,t_1
-        srlx    t_1,32,c_12
-        stuw    t_1,rp(6)       !r[6]=c1;
-        stuw    c_12,rp(7)      !r[7]=c2;
-        
-        ret
-        restore %g0,%g0,%o0
-.type   bn_sqr_comba4,#function
-.size   bn_sqr_comba4,(.-bn_sqr_comba4)
-.align  32
diff --git a/src/lib/libcrypto/bn/asm/sparcv9-mont.pl b/src/lib/libcrypto/bn/asm/sparcv9-mont.pl
deleted file mode 100644
index b8fb1e8a25..0000000000
--- a/src/lib/libcrypto/bn/asm/sparcv9-mont.pl
+++ /dev/null
@@ -1,606 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# December 2005
-#
-# Pure SPARCv9/8+ and IALU-only bn_mul_mont implementation. The reasons
-# for undertaken effort are multiple. First of all, UltraSPARC is not
-# the whole SPARCv9 universe and other VIS-free implementations deserve
-# optimized code as much. Secondly, newly introduced UltraSPARC T1,
-# a.k.a. Niagara, has shared FPU and concurrent FPU-intensive pathes,
-# such as sparcv9a-mont, will simply sink it. Yes, T1 is equipped with
-# several integrated RSA/DSA accelerator circuits accessible through
-# kernel driver [only(*)], but having decent user-land software
-# implementation is important too. Finally, reasons like desire to
-# experiment with dedicated squaring procedure. Yes, this module
-# implements one, because it was easiest to draft it in SPARCv9
-# instructions...
-# (*)   Engine accessing the driver in question is on my TODO list.
-#       For reference, acceleator is estimated to give 6 to 10 times
-#       improvement on single-threaded RSA sign. It should be noted
-#       that 6-10x improvement coefficient does not actually mean
-#       something extraordinary in terms of absolute [single-threaded]
-#       performance, as SPARCv9 instruction set is by all means least
-#       suitable for high performance crypto among other 64 bit
-#       platforms. 6-10x factor simply places T1 in same performance
-#       domain as say AMD64 and IA-64. Improvement of RSA verify don't
-#       appear impressive at all, but it's the sign operation which is
-#       far more critical/interesting.
-# You might notice that inner loops are modulo-scheduled:-) This has
-# essentially negligible impact on UltraSPARC performance, it's
-# Fujitsu SPARC64 V users who should notice and hopefully appreciate
-# the advantage... Currently this module surpasses sparcv9a-mont.pl
-# by ~20% on UltraSPARC-III and later cores, but recall that sparcv9a
-# module still have hidden potential [see TODO list there], which is
-# estimated to be larger than 20%...
-# int bn_mul_mont(
-$rp="%i0";      # BN_ULONG *rp,
-$ap="%i1";      # const BN_ULONG *ap,
-$bp="%i2";      # const BN_ULONG *bp,
-$np="%i3";      # const BN_ULONG *np,
-$n0="%i4";      # const BN_ULONG *n0,
-$num="%i5";     # int num);
-$bits=32;
-for (@ARGV)     { $bits=64 if (/\-m64/ || /\-xarch\=v9/); }
-if ($bits==64)  { $bias=2047; $frame=192; }
-else            { $bias=0;    $frame=128; }
-$car0="%o0";
-$car1="%o1";
-$car2="%o2";    # 1 bit
-$acc0="%o3";
-$acc1="%o4";
-$mask="%g1";    # 32 bits, what a waste...
-$tmp0="%g4";
-$tmp1="%g5";
-$i="%l0";
-$j="%l1";
-$mul0="%l2";
-$mul1="%l3";
-$tp="%l4";
-$apj="%l5";
-$npj="%l6";
-$tpj="%l7";
-$fname="bn_mul_mont_int";
-$code=<<___;
-.section        ".text",#alloc,#execinstr
-.global $fname
-.align  32
-$fname:
-        cmp     %o5,4                   ! 128 bits minimum
-        bge,pt  %icc,.Lenter
-        sethi   %hi(0xffffffff),$mask
-        retl
-        clr     %o0
-.align  32
-.Lenter:
-        save    %sp,-$frame,%sp
-        sll     $num,2,$num             ! num*=4
-        or      $mask,%lo(0xffffffff),$mask
-        ld      [$n0],$n0
-        cmp     $ap,$bp
-        and     $num,$mask,$num
-        ld      [$bp],$mul0             ! bp[0]
-        nop
-        add     %sp,$bias,%o7           ! real top of stack
-        ld      [$ap],$car0             ! ap[0] ! redundant in squaring context
-        sub     %o7,$num,%o7
-        ld      [$ap+4],$apj            ! ap[1]
-        and     %o7,-1024,%o7
-        ld      [$np],$car1             ! np[0]
-        sub     %o7,$bias,%sp           ! alloca
-        ld      [$np+4],$npj            ! np[1]
-        be,pt   `$bits==32?"%icc":"%xcc"`,.Lbn_sqr_mont
-        mov     12,$j
-        mulx    $car0,$mul0,$car0       ! ap[0]*bp[0]
-        mulx    $apj,$mul0,$tmp0        !prologue! ap[1]*bp[0]
-        and     $car0,$mask,$acc0
-        add     %sp,$bias+$frame,$tp
-        ld      [$ap+8],$apj            !prologue!
-        mulx    $n0,$acc0,$mul1         ! "t[0]"*n0
-        and     $mul1,$mask,$mul1
-        mulx    $car1,$mul1,$car1       ! np[0]*"t[0]"*n0
-        mulx    $npj,$mul1,$acc1        !prologue! np[1]*"t[0]"*n0
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        ld      [$np+8],$npj            !prologue!
-        srlx    $car1,32,$car1
-        mov     $tmp0,$acc0             !prologue!
-.L1st:
-        mulx    $apj,$mul0,$tmp0
-        mulx    $npj,$mul1,$tmp1
-        add     $acc0,$car0,$car0
-        ld      [$ap+$j],$apj           ! ap[j]
-        and     $car0,$mask,$acc0
-        add     $acc1,$car1,$car1
-        ld      [$np+$j],$npj           ! np[j]
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        add     $j,4,$j                 ! j++
-        mov     $tmp0,$acc0
-        st      $car1,[$tp]
-        cmp     $j,$num
-        mov     $tmp1,$acc1
-        srlx    $car1,32,$car1
-        bl      %icc,.L1st
-        add     $tp,4,$tp               ! tp++
-!.L1st
-        mulx    $apj,$mul0,$tmp0        !epilogue!
-        mulx    $npj,$mul1,$tmp1
-        add     $acc0,$car0,$car0
-        and     $car0,$mask,$acc0
-        add     $acc1,$car1,$car1
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp]
-        srlx    $car1,32,$car1
-        add     $tmp0,$car0,$car0
-        and     $car0,$mask,$acc0
-        add     $tmp1,$car1,$car1
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp+4]
-        srlx    $car1,32,$car1
-        add     $car0,$car1,$car1
-        st      $car1,[$tp+8]
-        srlx    $car1,32,$car2
-        mov     4,$i                    ! i++
-        ld      [$bp+4],$mul0           ! bp[1]
-.Louter:
-        add     %sp,$bias+$frame,$tp
-        ld      [$ap],$car0             ! ap[0]
-        ld      [$ap+4],$apj            ! ap[1]
-        ld      [$np],$car1             ! np[0]
-        ld      [$np+4],$npj            ! np[1]
-        ld      [$tp],$tmp1             ! tp[0]
-        ld      [$tp+4],$tpj            ! tp[1]
-        mov     12,$j
-        mulx    $car0,$mul0,$car0
-        mulx    $apj,$mul0,$tmp0        !prologue!
-        add     $tmp1,$car0,$car0
-        ld      [$ap+8],$apj            !prologue!
-        and     $car0,$mask,$acc0
-        mulx    $n0,$acc0,$mul1
-        and     $mul1,$mask,$mul1
-        mulx    $car1,$mul1,$car1
-        mulx    $npj,$mul1,$acc1        !prologue!
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        ld      [$np+8],$npj            !prologue!
-        srlx    $car1,32,$car1
-        mov     $tmp0,$acc0             !prologue!
-.Linner:
-        mulx    $apj,$mul0,$tmp0
-        mulx    $npj,$mul1,$tmp1
-        add     $tpj,$car0,$car0
-        ld      [$ap+$j],$apj           ! ap[j]
-        add     $acc0,$car0,$car0
-        add     $acc1,$car1,$car1
-        ld      [$np+$j],$npj           ! np[j]
-        and     $car0,$mask,$acc0
-        ld      [$tp+8],$tpj            ! tp[j]
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        add     $j,4,$j                 ! j++
-        mov     $tmp0,$acc0
-        st      $car1,[$tp]             ! tp[j-1]
-        srlx    $car1,32,$car1
-        mov     $tmp1,$acc1
-        cmp     $j,$num
-        bl      %icc,.Linner
-        add     $tp,4,$tp               ! tp++
-!.Linner
-        mulx    $apj,$mul0,$tmp0        !epilogue!
-        mulx    $npj,$mul1,$tmp1
-        add     $tpj,$car0,$car0
-        add     $acc0,$car0,$car0
-        ld      [$tp+8],$tpj            ! tp[j]
-        and     $car0,$mask,$acc0
-        add     $acc1,$car1,$car1
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp]             ! tp[j-1]
-        srlx    $car1,32,$car1
-        add     $tpj,$car0,$car0
-        add     $tmp0,$car0,$car0
-        and     $car0,$mask,$acc0
-        add     $tmp1,$car1,$car1
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp+4]           ! tp[j-1]
-        srlx    $car0,32,$car0
-        add     $i,4,$i                 ! i++
-        srlx    $car1,32,$car1
-        add     $car0,$car1,$car1
-        cmp     $i,$num
-        add     $car2,$car1,$car1
-        st      $car1,[$tp+8]
-        srlx    $car1,32,$car2
-        bl,a    %icc,.Louter
-        ld      [$bp+$i],$mul0          ! bp[i]
-!.Louter
-        add     $tp,12,$tp
-.Ltail:
-        add     $np,$num,$np
-        add     $rp,$num,$rp
-        mov     $tp,$ap
-        sub     %g0,$num,%o7            ! k=-num
-        ba      .Lsub
-        subcc   %g0,%g0,%g0             ! clear %icc.c
-.align  16
-.Lsub:
-        ld      [$tp+%o7],%o0
-        ld      [$np+%o7],%o1
-        subccc  %o0,%o1,%o1             ! tp[j]-np[j]
-        add     $rp,%o7,$i
-        add     %o7,4,%o7
-        brnz    %o7,.Lsub
-        st      %o1,[$i]
-        subc    $car2,0,$car2           ! handle upmost overflow bit
-        and     $tp,$car2,$ap
-        andn    $rp,$car2,$np
-        or      $ap,$np,$ap
-        sub     %g0,$num,%o7
-.Lcopy:
-        ld      [$ap+%o7],%o0           ! copy or in-place refresh
-        st      %g0,[$tp+%o7]           ! zap tp
-        st      %o0,[$rp+%o7]
-        add     %o7,4,%o7
-        brnz    %o7,.Lcopy
-        nop
-        mov     1,%i0
-        ret
-        restore
-___
-########
-######## .Lbn_sqr_mont gives up to 20% *overall* improvement over
-######## code without following dedicated squaring procedure.
-########
-$sbit="%i2";            # re-use $bp!
-$code.=<<___;
-.align  32
-.Lbn_sqr_mont:
-        mulx    $mul0,$mul0,$car0               ! ap[0]*ap[0]
-        mulx    $apj,$mul0,$tmp0                !prologue!
-        and     $car0,$mask,$acc0
-        add     %sp,$bias+$frame,$tp
-        ld      [$ap+8],$apj                    !prologue!
-        mulx    $n0,$acc0,$mul1                 ! "t[0]"*n0
-        srlx    $car0,32,$car0
-        and     $mul1,$mask,$mul1
-        mulx    $car1,$mul1,$car1               ! np[0]*"t[0]"*n0
-        mulx    $npj,$mul1,$acc1                !prologue!
-        and     $car0,1,$sbit
-        ld      [$np+8],$npj                    !prologue!
-        srlx    $car0,1,$car0
-        add     $acc0,$car1,$car1
-        srlx    $car1,32,$car1
-        mov     $tmp0,$acc0                     !prologue!
-.Lsqr_1st:
-        mulx    $apj,$mul0,$tmp0
-        mulx    $npj,$mul1,$tmp1
-        add     $acc0,$car0,$car0               ! ap[j]*a0+c0
-        add     $acc1,$car1,$car1
-        ld      [$ap+$j],$apj                   ! ap[j]
-        and     $car0,$mask,$acc0
-        ld      [$np+$j],$npj                   ! np[j]
-        srlx    $car0,32,$car0
-        add     $acc0,$acc0,$acc0
-        or      $sbit,$acc0,$acc0
-        mov     $tmp1,$acc1
-        srlx    $acc0,32,$sbit
-        add     $j,4,$j                         ! j++
-        and     $acc0,$mask,$acc0
-        cmp     $j,$num
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp]
-        mov     $tmp0,$acc0
-        srlx    $car1,32,$car1
-        bl      %icc,.Lsqr_1st
-        add     $tp,4,$tp                       ! tp++
-!.Lsqr_1st
-        mulx    $apj,$mul0,$tmp0                ! epilogue
-        mulx    $npj,$mul1,$tmp1
-        add     $acc0,$car0,$car0               ! ap[j]*a0+c0
-        add     $acc1,$car1,$car1
-        and     $car0,$mask,$acc0
-        srlx    $car0,32,$car0
-        add     $acc0,$acc0,$acc0
-        or      $sbit,$acc0,$acc0
-        srlx    $acc0,32,$sbit
-        and     $acc0,$mask,$acc0
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp]
-        srlx    $car1,32,$car1
-        add     $tmp0,$car0,$car0               ! ap[j]*a0+c0
-        add     $tmp1,$car1,$car1
-        and     $car0,$mask,$acc0
-        srlx    $car0,32,$car0
-        add     $acc0,$acc0,$acc0
-        or      $sbit,$acc0,$acc0
-        srlx    $acc0,32,$sbit
-        and     $acc0,$mask,$acc0
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp+4]
-        srlx    $car1,32,$car1
-        add     $car0,$car0,$car0
-        or      $sbit,$car0,$car0
-        add     $car0,$car1,$car1
-        st      $car1,[$tp+8]
-        srlx    $car1,32,$car2
-        ld      [%sp+$bias+$frame],$tmp0        ! tp[0]
-        ld      [%sp+$bias+$frame+4],$tmp1      ! tp[1]
-        ld      [%sp+$bias+$frame+8],$tpj       ! tp[2]
-        ld      [$ap+4],$mul0                   ! ap[1]
-        ld      [$ap+8],$apj                    ! ap[2]
-        ld      [$np],$car1                     ! np[0]
-        ld      [$np+4],$npj                    ! np[1]
-        mulx    $n0,$tmp0,$mul1
-        mulx    $mul0,$mul0,$car0
-        and     $mul1,$mask,$mul1
-        mulx    $car1,$mul1,$car1
-        mulx    $npj,$mul1,$acc1
-        add     $tmp0,$car1,$car1
-        and     $car0,$mask,$acc0
-        ld      [$np+8],$npj                    ! np[2]
-        srlx    $car1,32,$car1
-        add     $tmp1,$car1,$car1
-        srlx    $car0,32,$car0
-        add     $acc0,$car1,$car1
-        and     $car0,1,$sbit
-        add     $acc1,$car1,$car1
-        srlx    $car0,1,$car0
-        mov     12,$j
-        st      $car1,[%sp+$bias+$frame]        ! tp[0]=
-        srlx    $car1,32,$car1
-        add     %sp,$bias+$frame+4,$tp
-.Lsqr_2nd:
-        mulx    $apj,$mul0,$acc0
-        mulx    $npj,$mul1,$acc1
-        add     $acc0,$car0,$car0
-        add     $tpj,$car1,$car1
-        ld      [$ap+$j],$apj                   ! ap[j]
-        and     $car0,$mask,$acc0
-        ld      [$np+$j],$npj                   ! np[j]
-        srlx    $car0,32,$car0
-        add     $acc1,$car1,$car1
-        ld      [$tp+8],$tpj                    ! tp[j]
-        add     $acc0,$acc0,$acc0
-        add     $j,4,$j                         ! j++
-        or      $sbit,$acc0,$acc0
-        srlx    $acc0,32,$sbit
-        and     $acc0,$mask,$acc0
-        cmp     $j,$num
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp]                     ! tp[j-1]
-        srlx    $car1,32,$car1
-        bl      %icc,.Lsqr_2nd
-        add     $tp,4,$tp                       ! tp++
-!.Lsqr_2nd
-        mulx    $apj,$mul0,$acc0
-        mulx    $npj,$mul1,$acc1
-        add     $acc0,$car0,$car0
-        add     $tpj,$car1,$car1
-        and     $car0,$mask,$acc0
-        srlx    $car0,32,$car0
-        add     $acc1,$car1,$car1
-        add     $acc0,$acc0,$acc0
-        or      $sbit,$acc0,$acc0
-        srlx    $acc0,32,$sbit
-        and     $acc0,$mask,$acc0
-        add     $acc0,$car1,$car1
-        st      $car1,[$tp]                     ! tp[j-1]
-        srlx    $car1,32,$car1
-        add     $car0,$car0,$car0
-        or      $sbit,$car0,$car0
-        add     $car0,$car1,$car1
-        add     $car2,$car1,$car1
-        st      $car1,[$tp+4]
-        srlx    $car1,32,$car2
-        ld      [%sp+$bias+$frame],$tmp1        ! tp[0]
-        ld      [%sp+$bias+$frame+4],$tpj       ! tp[1]
-        ld      [$ap+8],$mul0                   ! ap[2]
-        ld      [$np],$car1                     ! np[0]
-        ld      [$np+4],$npj                    ! np[1]
-        mulx    $n0,$tmp1,$mul1
-        and     $mul1,$mask,$mul1
-        mov     8,$i
-        mulx    $mul0,$mul0,$car0
-        mulx    $car1,$mul1,$car1
-        and     $car0,$mask,$acc0
-        add     $tmp1,$car1,$car1
-        srlx    $car0,32,$car0
-        add     %sp,$bias+$frame,$tp
-        srlx    $car1,32,$car1
-        and     $car0,1,$sbit
-        srlx    $car0,1,$car0
-        mov     4,$j
-.Lsqr_outer:
-.Lsqr_inner1:
-        mulx    $npj,$mul1,$acc1
-        add     $tpj,$car1,$car1
-        add     $j,4,$j
-        ld      [$tp+8],$tpj
-        cmp     $j,$i
-        add     $acc1,$car1,$car1
-        ld      [$np+$j],$npj
-        st      $car1,[$tp]
-        srlx    $car1,32,$car1
-        bl      %icc,.Lsqr_inner1
-        add     $tp,4,$tp
-!.Lsqr_inner1
-        add     $j,4,$j
-        ld      [$ap+$j],$apj                   ! ap[j]
-        mulx    $npj,$mul1,$acc1
-        add     $tpj,$car1,$car1
-        ld      [$np+$j],$npj                   ! np[j]
-        add     $acc0,$car1,$car1
-        ld      [$tp+8],$tpj                    ! tp[j]
-        add     $acc1,$car1,$car1
-        st      $car1,[$tp]
-        srlx    $car1,32,$car1
-        add     $j,4,$j
-        cmp     $j,$num
-        be,pn   %icc,.Lsqr_no_inner2
-        add     $tp,4,$tp
-.Lsqr_inner2:
-        mulx    $apj,$mul0,$acc0
-        mulx    $npj,$mul1,$acc1
-        add     $tpj,$car1,$car1
-        add     $acc0,$car0,$car0
-        ld      [$ap+$j],$apj                   ! ap[j]
-        and     $car0,$mask,$acc0
-        ld      [$np+$j],$npj                   ! np[j]
-        srlx    $car0,32,$car0
-        add     $acc0,$acc0,$acc0
-        ld      [$tp+8],$tpj                    ! tp[j]
-        or      $sbit,$acc0,$acc0
-        add     $j,4,$j                         ! j++
-        srlx    $acc0,32,$sbit
-        and     $acc0,$mask,$acc0
-        cmp     $j,$num
-        add     $acc0,$car1,$car1
-        add     $acc1,$car1,$car1
-        st      $car1,[$tp]                     ! tp[j-1]
-        srlx    $car1,32,$car1
-        bl      %icc,.Lsqr_inner2
-        add     $tp,4,$tp                       ! tp++
-.Lsqr_no_inner2:
-        mulx    $apj,$mul0,$acc0
-        mulx    $npj,$mul1,$acc1
-        add     $tpj,$car1,$car1
-        add     $acc0,$car0,$car0
-        and     $car0,$mask,$acc0
-        srlx    $car0,32,$car0
-        add     $acc0,$acc0,$acc0
-        or      $sbit,$acc0,$acc0
-        srlx    $acc0,32,$sbit
-        and     $acc0,$mask,$acc0
-        add     $acc0,$car1,$car1
-        add     $acc1,$car1,$car1
-        st      $car1,[$tp]                     ! tp[j-1]
-        srlx    $car1,32,$car1
-        add     $car0,$car0,$car0
-        or      $sbit,$car0,$car0
-        add     $car0,$car1,$car1
-        add     $car2,$car1,$car1
-        st      $car1,[$tp+4]
-        srlx    $car1,32,$car2
-        add     $i,4,$i                         ! i++
-        ld      [%sp+$bias+$frame],$tmp1        ! tp[0]
-        ld      [%sp+$bias+$frame+4],$tpj       ! tp[1]
-        ld      [$ap+$i],$mul0                  ! ap[j]
-        ld      [$np],$car1                     ! np[0]
-        ld      [$np+4],$npj                    ! np[1]
-        mulx    $n0,$tmp1,$mul1
-        and     $mul1,$mask,$mul1
-        add     $i,4,$tmp0
-        mulx    $mul0,$mul0,$car0
-        mulx    $car1,$mul1,$car1
-        and     $car0,$mask,$acc0
-        add     $tmp1,$car1,$car1
-        srlx    $car0,32,$car0
-        add     %sp,$bias+$frame,$tp
-        srlx    $car1,32,$car1
-        and     $car0,1,$sbit
-        srlx    $car0,1,$car0
-        cmp     $tmp0,$num                      ! i<num-1
-        bl      %icc,.Lsqr_outer
-        mov     4,$j
-.Lsqr_last:
-        mulx    $npj,$mul1,$acc1
-        add     $tpj,$car1,$car1
-        add     $j,4,$j
-        ld      [$tp+8],$tpj
-        cmp     $j,$i
-        add     $acc1,$car1,$car1
-        ld      [$np+$j],$npj
-        st      $car1,[$tp]
-        srlx    $car1,32,$car1
-        bl      %icc,.Lsqr_last
-        add     $tp,4,$tp
-!.Lsqr_last
-        mulx    $npj,$mul1,$acc1
-        add     $tpj,$car1,$car1
-        add     $acc0,$car1,$car1
-        add     $acc1,$car1,$car1
-        st      $car1,[$tp]
-        srlx    $car1,32,$car1
-        add     $car0,$car0,$car0               ! recover $car0
-        or      $sbit,$car0,$car0
-        add     $car0,$car1,$car1
-        add     $car2,$car1,$car1
-        st      $car1,[$tp+4]
-        srlx    $car1,32,$car2
-        ba      .Ltail
-        add     $tp,8,$tp
-.type   $fname,#function
-.size   $fname,(.-$fname)
-.asciz  "Montgomery Multipltication for SPARCv9, CRYPTOGAMS by <appro\@openssl.org>"
-.align  32
-___
-$code =~ s/\`([^\`]*)\`/eval($1)/gem;
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/sparcv9a-mont.pl b/src/lib/libcrypto/bn/asm/sparcv9a-mont.pl
deleted file mode 100755
index a14205f2f0..0000000000
--- a/src/lib/libcrypto/bn/asm/sparcv9a-mont.pl
+++ /dev/null
@@ -1,882 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# October 2005
-#
-# "Teaser" Montgomery multiplication module for UltraSPARC. Why FPU?
-# Because unlike integer multiplier, which simply stalls whole CPU,
-# FPU is fully pipelined and can effectively emit 48 bit partial
-# product every cycle. Why not blended SPARC v9? One can argue that
-# making this module dependent on UltraSPARC VIS extension limits its
-# binary compatibility. Well yes, it does exclude SPARC64 prior-V(!)
-# implementations from compatibility matrix. But the rest, whole Sun
-# UltraSPARC family and brand new Fujitsu's SPARC64 V, all support
-# VIS extension instructions used in this module. This is considered
-# good enough to not care about HAL SPARC64 users [if any] who have
-# integer-only pure SPARCv9 module to "fall down" to.
-# USI&II cores currently exhibit uniform 2x improvement [over pre-
-# bn_mul_mont codebase] for all key lengths and benchmarks. On USIII
-# performance improves few percents for shorter keys and worsens few
-# percents for longer keys. This is because USIII integer multiplier
-# is >3x faster than USI&II one, which is harder to match [but see
-# TODO list below]. It should also be noted that SPARC64 V features
-# out-of-order execution, which *might* mean that integer multiplier
-# is pipelined, which in turn *might* be impossible to match... On
-# additional note, SPARC64 V implements FP Multiply-Add instruction,
-# which is perfectly usable in this context... In other words, as far
-# as Fujitsu SPARC64 V goes, talk to the author:-)
-# The implementation implies following "non-natural" limitations on
-# input arguments:
-# - num may not be less than 4;
-# - num has to be even;
-# Failure to meet either condition has no fatal effects, simply
-# doesn't give any performance gain.
-# TODO:
-# - modulo-schedule inner loop for better performance (on in-order
-#   execution core such as UltraSPARC this shall result in further
-#   noticeable(!) improvement);
-# - dedicated squaring procedure[?];
-######################################################################
-# November 2006
-#
-# Modulo-scheduled inner loops allow to interleave floating point and
-# integer instructions and minimize Read-After-Write penalties. This
-# results in *further* 20-50% perfromance improvement [depending on
-# key length, more for longer keys] on USI&II cores and 30-80% - on
-# USIII&IV.
-$fname="bn_mul_mont_fpu";
-$bits=32;
-for (@ARGV) { $bits=64 if (/\-m64/ || /\-xarch\=v9/); }
-if ($bits==64) {
-        $bias=2047;
-        $frame=192;
-} else {
-        $bias=0;
-        $frame=128;     # 96 rounded up to largest known cache-line
-}
-$locals=64;
-# In order to provide for 32-/64-bit ABI duality, I keep integers wider
-# than 32 bit in %g1-%g4 and %o0-%o5. %l0-%l7 and %i0-%i5 are used
-# exclusively for pointers, indexes and other small values...
-# int bn_mul_mont(
-$rp="%i0";      # BN_ULONG *rp,
-$ap="%i1";      # const BN_ULONG *ap,
-$bp="%i2";      # const BN_ULONG *bp,
-$np="%i3";      # const BN_ULONG *np,
-$n0="%i4";      # const BN_ULONG *n0,
-$num="%i5";     # int num);
-$tp="%l0";      # t[num]
-$ap_l="%l1";    # a[num],n[num] are smashed to 32-bit words and saved
-$ap_h="%l2";    # to these four vectors as double-precision FP values.
-$np_l="%l3";    # This way a bunch of fxtods are eliminated in second
-$np_h="%l4";    # loop and L1-cache aliasing is minimized...
-$i="%l5";
-$j="%l6";
-$mask="%l7";    # 16-bit mask, 0xffff
-$n0="%g4";      # reassigned(!) to "64-bit" register
-$carry="%i4";   # %i4 reused(!) for a carry bit
-# FP register naming chart
-#
-#     ..HILO
-#       dcba
-#   --------
-#        LOa
-#       LOb
-#      LOc
-#     LOd
-#      HIa
-#     HIb
-#    HIc
-#   HId
-#    ..a
-#   ..b
-$ba="%f0";    $bb="%f2";    $bc="%f4";    $bd="%f6";
-$na="%f8";    $nb="%f10";   $nc="%f12";   $nd="%f14";
-$alo="%f16";  $alo_="%f17"; $ahi="%f18";  $ahi_="%f19";
-$nlo="%f20";  $nlo_="%f21"; $nhi="%f22";  $nhi_="%f23";
-$dota="%f24"; $dotb="%f26";
-$aloa="%f32"; $alob="%f34"; $aloc="%f36"; $alod="%f38";
-$ahia="%f40"; $ahib="%f42"; $ahic="%f44"; $ahid="%f46";
-$nloa="%f48"; $nlob="%f50"; $nloc="%f52"; $nlod="%f54";
-$nhia="%f56"; $nhib="%f58"; $nhic="%f60"; $nhid="%f62";
-$ASI_FL16_P=0xD2;       # magic ASI value to engage 16-bit FP load
-$code=<<___;
-.section        ".text",#alloc,#execinstr
-.global $fname
-.align  32
-$fname:
-        save    %sp,-$frame-$locals,%sp
-        cmp     $num,4
-        bl,a,pn %icc,.Lret
-        clr     %i0
-        andcc   $num,1,%g0              ! $num has to be even...
-        bnz,a,pn %icc,.Lret
-        clr     %i0                     ! signal "unsupported input value"
-        srl     $num,1,$num
-        sethi   %hi(0xffff),$mask
-        ld      [%i4+0],$n0             ! $n0 reassigned, remember?
-        or      $mask,%lo(0xffff),$mask
-        ld      [%i4+4],%o0
-        sllx    %o0,32,%o0
-        or      %o0,$n0,$n0             ! $n0=n0[1].n0[0]
-        sll     $num,3,$num             ! num*=8
-        add     %sp,$bias,%o0           ! real top of stack
-        sll     $num,2,%o1
-        add     %o1,$num,%o1            ! %o1=num*5
-        sub     %o0,%o1,%o0
-        and     %o0,-2048,%o0           ! optimize TLB utilization
-        sub     %o0,$bias,%sp           ! alloca(5*num*8)
-        rd      %asi,%o7                ! save %asi
-        add     %sp,$bias+$frame+$locals,$tp
-        add     $tp,$num,$ap_l
-        add     $ap_l,$num,$ap_l        ! [an]p_[lh] point at the vectors' ends !
-        add     $ap_l,$num,$ap_h
-        add     $ap_h,$num,$np_l
-        add     $np_l,$num,$np_h
-        wr      %g0,$ASI_FL16_P,%asi    ! setup %asi for 16-bit FP loads
-        add     $rp,$num,$rp            ! readjust input pointers to point
-        add     $ap,$num,$ap            ! at the ends too...
-        add     $bp,$num,$bp
-        add     $np,$num,$np
-        stx     %o7,[%sp+$bias+$frame+48]       ! save %asi
-        sub     %g0,$num,$i             ! i=-num
-        sub     %g0,$num,$j             ! j=-num
-        add     $ap,$j,%o3
-        add     $bp,$i,%o4
-        ld      [%o3+4],%g1             ! bp[0]
-        ld      [%o3+0],%o0
-        ld      [%o4+4],%g5             ! ap[0]
-        sllx    %g1,32,%g1
-        ld      [%o4+0],%o1
-        sllx    %g5,32,%g5
-        or      %g1,%o0,%o0
-        or      %g5,%o1,%o1
-        add     $np,$j,%o5
-        mulx    %o1,%o0,%o0             ! ap[0]*bp[0]
-        mulx    $n0,%o0,%o0             ! ap[0]*bp[0]*n0
-        stx     %o0,[%sp+$bias+$frame+0]
-        ld      [%o3+0],$alo_   ! load a[j] as pair of 32-bit words
-        fzeros  $alo
-        ld      [%o3+4],$ahi_
-        fzeros  $ahi
-        ld      [%o5+0],$nlo_   ! load n[j] as pair of 32-bit words
-        fzeros  $nlo
-        ld      [%o5+4],$nhi_
-        fzeros  $nhi
-        ! transfer b[i] to FPU as 4x16-bit values
-        ldda    [%o4+2]%asi,$ba
-        fxtod   $alo,$alo
-        ldda    [%o4+0]%asi,$bb
-        fxtod   $ahi,$ahi
-        ldda    [%o4+6]%asi,$bc
-        fxtod   $nlo,$nlo
-        ldda    [%o4+4]%asi,$bd
-        fxtod   $nhi,$nhi
-        ! transfer ap[0]*b[0]*n0 to FPU as 4x16-bit values
-        ldda    [%sp+$bias+$frame+6]%asi,$na
-        fxtod   $ba,$ba
-        ldda    [%sp+$bias+$frame+4]%asi,$nb
-        fxtod   $bb,$bb
-        ldda    [%sp+$bias+$frame+2]%asi,$nc
-        fxtod   $bc,$bc
-        ldda    [%sp+$bias+$frame+0]%asi,$nd
-        fxtod   $bd,$bd
-        std     $alo,[$ap_l+$j]         ! save smashed ap[j] in double format
-        fxtod   $na,$na
-        std     $ahi,[$ap_h+$j]
-        fxtod   $nb,$nb
-        std     $nlo,[$np_l+$j]         ! save smashed np[j] in double format
-        fxtod   $nc,$nc
-        std     $nhi,[$np_h+$j]
-        fxtod   $nd,$nd
-                fmuld   $alo,$ba,$aloa
-                fmuld   $nlo,$na,$nloa
-                fmuld   $alo,$bb,$alob
-                fmuld   $nlo,$nb,$nlob
-                fmuld   $alo,$bc,$aloc
-        faddd   $aloa,$nloa,$nloa
-                fmuld   $nlo,$nc,$nloc
-                fmuld   $alo,$bd,$alod
-        faddd   $alob,$nlob,$nlob
-                fmuld   $nlo,$nd,$nlod
-                fmuld   $ahi,$ba,$ahia
-        faddd   $aloc,$nloc,$nloc
-                fmuld   $nhi,$na,$nhia
-                fmuld   $ahi,$bb,$ahib
-        faddd   $alod,$nlod,$nlod
-                fmuld   $nhi,$nb,$nhib
-                fmuld   $ahi,$bc,$ahic
-        faddd   $ahia,$nhia,$nhia
-                fmuld   $nhi,$nc,$nhic
-                fmuld   $ahi,$bd,$ahid
-        faddd   $ahib,$nhib,$nhib
-                fmuld   $nhi,$nd,$nhid
-        faddd   $ahic,$nhic,$dota       ! $nhic
-        faddd   $ahid,$nhid,$dotb       ! $nhid
-        faddd   $nloc,$nhia,$nloc
-        faddd   $nlod,$nhib,$nlod
-        fdtox   $nloa,$nloa
-        fdtox   $nlob,$nlob
-        fdtox   $nloc,$nloc
-        fdtox   $nlod,$nlod
-        std     $nloa,[%sp+$bias+$frame+0]
-        add     $j,8,$j
-        std     $nlob,[%sp+$bias+$frame+8]
-        add     $ap,$j,%o4
-        std     $nloc,[%sp+$bias+$frame+16]
-        add     $np,$j,%o5
-        std     $nlod,[%sp+$bias+$frame+24]
-        ld      [%o4+0],$alo_   ! load a[j] as pair of 32-bit words
-        fzeros  $alo
-        ld      [%o4+4],$ahi_
-        fzeros  $ahi
-        ld      [%o5+0],$nlo_   ! load n[j] as pair of 32-bit words
-        fzeros  $nlo
-        ld      [%o5+4],$nhi_
-        fzeros  $nhi
-        fxtod   $alo,$alo
-        fxtod   $ahi,$ahi
-        fxtod   $nlo,$nlo
-        fxtod   $nhi,$nhi
-        ldx     [%sp+$bias+$frame+0],%o0
-                fmuld   $alo,$ba,$aloa
-        ldx     [%sp+$bias+$frame+8],%o1
-                fmuld   $nlo,$na,$nloa
-        ldx     [%sp+$bias+$frame+16],%o2
-                fmuld   $alo,$bb,$alob
-        ldx     [%sp+$bias+$frame+24],%o3
-                fmuld   $nlo,$nb,$nlob
-        srlx    %o0,16,%o7
-        std     $alo,[$ap_l+$j]         ! save smashed ap[j] in double format
-                fmuld   $alo,$bc,$aloc
-        add     %o7,%o1,%o1
-        std     $ahi,[$ap_h+$j]
-                faddd   $aloa,$nloa,$nloa
-                fmuld   $nlo,$nc,$nloc
-        srlx    %o1,16,%o7
-        std     $nlo,[$np_l+$j]         ! save smashed np[j] in double format
-                fmuld   $alo,$bd,$alod
-        add     %o7,%o2,%o2
-        std     $nhi,[$np_h+$j]
-                faddd   $alob,$nlob,$nlob
-                fmuld   $nlo,$nd,$nlod
-        srlx    %o2,16,%o7
-                fmuld   $ahi,$ba,$ahia
-        add     %o7,%o3,%o3             ! %o3.%o2[0..15].%o1[0..15].%o0[0..15]
-                faddd   $aloc,$nloc,$nloc
-                fmuld   $nhi,$na,$nhia
-        !and    %o0,$mask,%o0
-        !and    %o1,$mask,%o1
-        !and    %o2,$mask,%o2
-        !sllx   %o1,16,%o1
-        !sllx   %o2,32,%o2
-        !sllx   %o3,48,%o7
-        !or     %o1,%o0,%o0
-        !or     %o2,%o0,%o0
-        !or     %o7,%o0,%o0             ! 64-bit result
-        srlx    %o3,16,%g1              ! 34-bit carry
-                fmuld   $ahi,$bb,$ahib
-        faddd   $alod,$nlod,$nlod
-                fmuld   $nhi,$nb,$nhib
-                fmuld   $ahi,$bc,$ahic
-        faddd   $ahia,$nhia,$nhia
-                fmuld   $nhi,$nc,$nhic
-                fmuld   $ahi,$bd,$ahid
-        faddd   $ahib,$nhib,$nhib
-                fmuld   $nhi,$nd,$nhid
-        faddd   $dota,$nloa,$nloa
-        faddd   $dotb,$nlob,$nlob
-        faddd   $ahic,$nhic,$dota       ! $nhic
-        faddd   $ahid,$nhid,$dotb       ! $nhid
-        faddd   $nloc,$nhia,$nloc
-        faddd   $nlod,$nhib,$nlod
-        fdtox   $nloa,$nloa
-        fdtox   $nlob,$nlob
-        fdtox   $nloc,$nloc
-        fdtox   $nlod,$nlod
-        std     $nloa,[%sp+$bias+$frame+0]
-        std     $nlob,[%sp+$bias+$frame+8]
-        addcc   $j,8,$j
-        std     $nloc,[%sp+$bias+$frame+16]
-        bz,pn   %icc,.L1stskip
-        std     $nlod,[%sp+$bias+$frame+24]
-.align  32                      ! incidentally already aligned !
-.L1st:
-        add     $ap,$j,%o4
-        add     $np,$j,%o5
-        ld      [%o4+0],$alo_   ! load a[j] as pair of 32-bit words
-        fzeros  $alo
-        ld      [%o4+4],$ahi_
-        fzeros  $ahi
-        ld      [%o5+0],$nlo_   ! load n[j] as pair of 32-bit words
-        fzeros  $nlo
-        ld      [%o5+4],$nhi_
-        fzeros  $nhi
-        fxtod   $alo,$alo
-        fxtod   $ahi,$ahi
-        fxtod   $nlo,$nlo
-        fxtod   $nhi,$nhi
-        ldx     [%sp+$bias+$frame+0],%o0
-                fmuld   $alo,$ba,$aloa
-        ldx     [%sp+$bias+$frame+8],%o1
-                fmuld   $nlo,$na,$nloa
-        ldx     [%sp+$bias+$frame+16],%o2
-                fmuld   $alo,$bb,$alob
-        ldx     [%sp+$bias+$frame+24],%o3
-                fmuld   $nlo,$nb,$nlob
-        srlx    %o0,16,%o7
-        std     $alo,[$ap_l+$j]         ! save smashed ap[j] in double format
-                fmuld   $alo,$bc,$aloc
-        add     %o7,%o1,%o1
-        std     $ahi,[$ap_h+$j]
-                faddd   $aloa,$nloa,$nloa
-                fmuld   $nlo,$nc,$nloc
-        srlx    %o1,16,%o7
-        std     $nlo,[$np_l+$j]         ! save smashed np[j] in double format
-                fmuld   $alo,$bd,$alod
-        add     %o7,%o2,%o2
-        std     $nhi,[$np_h+$j]
-                faddd   $alob,$nlob,$nlob
-                fmuld   $nlo,$nd,$nlod
-        srlx    %o2,16,%o7
-                fmuld   $ahi,$ba,$ahia
-        add     %o7,%o3,%o3             ! %o3.%o2[0..15].%o1[0..15].%o0[0..15]
-        and     %o0,$mask,%o0
-                faddd   $aloc,$nloc,$nloc
-                fmuld   $nhi,$na,$nhia
-        and     %o1,$mask,%o1
-        and     %o2,$mask,%o2
-                fmuld   $ahi,$bb,$ahib
-        sllx    %o1,16,%o1
-                faddd   $alod,$nlod,$nlod
-                fmuld   $nhi,$nb,$nhib
-        sllx    %o2,32,%o2
-                fmuld   $ahi,$bc,$ahic
-        sllx    %o3,48,%o7
-        or      %o1,%o0,%o0
-                faddd   $ahia,$nhia,$nhia
-                fmuld   $nhi,$nc,$nhic
-        or      %o2,%o0,%o0
-                fmuld   $ahi,$bd,$ahid
-        or      %o7,%o0,%o0             ! 64-bit result
-                faddd   $ahib,$nhib,$nhib
-                fmuld   $nhi,$nd,$nhid
-        addcc   %g1,%o0,%o0
-                faddd   $dota,$nloa,$nloa
-        srlx    %o3,16,%g1              ! 34-bit carry
-                faddd   $dotb,$nlob,$nlob
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        stx     %o0,[$tp]               ! tp[j-1]=
-        faddd   $ahic,$nhic,$dota       ! $nhic
-        faddd   $ahid,$nhid,$dotb       ! $nhid
-        faddd   $nloc,$nhia,$nloc
-        faddd   $nlod,$nhib,$nlod
-        fdtox   $nloa,$nloa
-        fdtox   $nlob,$nlob
-        fdtox   $nloc,$nloc
-        fdtox   $nlod,$nlod
-        std     $nloa,[%sp+$bias+$frame+0]
-        std     $nlob,[%sp+$bias+$frame+8]
-        std     $nloc,[%sp+$bias+$frame+16]
-        std     $nlod,[%sp+$bias+$frame+24]
-        addcc   $j,8,$j
-        bnz,pt  %icc,.L1st
-        add     $tp,8,$tp
-.L1stskip:
-        fdtox   $dota,$dota
-        fdtox   $dotb,$dotb
-        ldx     [%sp+$bias+$frame+0],%o0
-        ldx     [%sp+$bias+$frame+8],%o1
-        ldx     [%sp+$bias+$frame+16],%o2
-        ldx     [%sp+$bias+$frame+24],%o3
-        srlx    %o0,16,%o7
-        std     $dota,[%sp+$bias+$frame+32]
-        add     %o7,%o1,%o1
-        std     $dotb,[%sp+$bias+$frame+40]
-        srlx    %o1,16,%o7
-        add     %o7,%o2,%o2
-        srlx    %o2,16,%o7
-        add     %o7,%o3,%o3             ! %o3.%o2[0..15].%o1[0..15].%o0[0..15]
-        and     %o0,$mask,%o0
-        and     %o1,$mask,%o1
-        and     %o2,$mask,%o2
-        sllx    %o1,16,%o1
-        sllx    %o2,32,%o2
-        sllx    %o3,48,%o7
-        or      %o1,%o0,%o0
-        or      %o2,%o0,%o0
-        or      %o7,%o0,%o0             ! 64-bit result
-        ldx     [%sp+$bias+$frame+32],%o4
-        addcc   %g1,%o0,%o0
-        ldx     [%sp+$bias+$frame+40],%o5
-        srlx    %o3,16,%g1              ! 34-bit carry
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        stx     %o0,[$tp]               ! tp[j-1]=
-        add     $tp,8,$tp
-        srlx    %o4,16,%o7
-        add     %o7,%o5,%o5
-        and     %o4,$mask,%o4
-        sllx    %o5,16,%o7
-        or      %o7,%o4,%o4
-        addcc   %g1,%o4,%o4
-        srlx    %o5,48,%g1
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        mov     %g1,$carry
-        stx     %o4,[$tp]               ! tp[num-1]=
-        ba      .Louter
-        add     $i,8,$i
-.align  32
-.Louter:
-        sub     %g0,$num,$j             ! j=-num
-        add     %sp,$bias+$frame+$locals,$tp
-        add     $ap,$j,%o3
-        add     $bp,$i,%o4
-        ld      [%o3+4],%g1             ! bp[i]
-        ld      [%o3+0],%o0
-        ld      [%o4+4],%g5             ! ap[0]
-        sllx    %g1,32,%g1
-        ld      [%o4+0],%o1
-        sllx    %g5,32,%g5
-        or      %g1,%o0,%o0
-        or      %g5,%o1,%o1
-        ldx     [$tp],%o2               ! tp[0]
-        mulx    %o1,%o0,%o0
-        addcc   %o2,%o0,%o0
-        mulx    $n0,%o0,%o0             ! (ap[0]*bp[i]+t[0])*n0
-        stx     %o0,[%sp+$bias+$frame+0]
-        ! transfer b[i] to FPU as 4x16-bit values
-        ldda    [%o4+2]%asi,$ba
-        ldda    [%o4+0]%asi,$bb
-        ldda    [%o4+6]%asi,$bc
-        ldda    [%o4+4]%asi,$bd
-        ! transfer (ap[0]*b[i]+t[0])*n0 to FPU as 4x16-bit values
-        ldda    [%sp+$bias+$frame+6]%asi,$na
-        fxtod   $ba,$ba
-        ldda    [%sp+$bias+$frame+4]%asi,$nb
-        fxtod   $bb,$bb
-        ldda    [%sp+$bias+$frame+2]%asi,$nc
-        fxtod   $bc,$bc
-        ldda    [%sp+$bias+$frame+0]%asi,$nd
-        fxtod   $bd,$bd
-        ldd     [$ap_l+$j],$alo         ! load a[j] in double format
-        fxtod   $na,$na
-        ldd     [$ap_h+$j],$ahi
-        fxtod   $nb,$nb
-        ldd     [$np_l+$j],$nlo         ! load n[j] in double format
-        fxtod   $nc,$nc
-        ldd     [$np_h+$j],$nhi
-        fxtod   $nd,$nd
-                fmuld   $alo,$ba,$aloa
-                fmuld   $nlo,$na,$nloa
-                fmuld   $alo,$bb,$alob
-                fmuld   $nlo,$nb,$nlob
-                fmuld   $alo,$bc,$aloc
-        faddd   $aloa,$nloa,$nloa
-                fmuld   $nlo,$nc,$nloc
-                fmuld   $alo,$bd,$alod
-        faddd   $alob,$nlob,$nlob
-                fmuld   $nlo,$nd,$nlod
-                fmuld   $ahi,$ba,$ahia
-        faddd   $aloc,$nloc,$nloc
-                fmuld   $nhi,$na,$nhia
-                fmuld   $ahi,$bb,$ahib
-        faddd   $alod,$nlod,$nlod
-                fmuld   $nhi,$nb,$nhib
-                fmuld   $ahi,$bc,$ahic
-        faddd   $ahia,$nhia,$nhia
-                fmuld   $nhi,$nc,$nhic
-                fmuld   $ahi,$bd,$ahid
-        faddd   $ahib,$nhib,$nhib
-                fmuld   $nhi,$nd,$nhid
-        faddd   $ahic,$nhic,$dota       ! $nhic
-        faddd   $ahid,$nhid,$dotb       ! $nhid
-        faddd   $nloc,$nhia,$nloc
-        faddd   $nlod,$nhib,$nlod
-        fdtox   $nloa,$nloa
-        fdtox   $nlob,$nlob
-        fdtox   $nloc,$nloc
-        fdtox   $nlod,$nlod
-        std     $nloa,[%sp+$bias+$frame+0]
-        std     $nlob,[%sp+$bias+$frame+8]
-        std     $nloc,[%sp+$bias+$frame+16]
-        add     $j,8,$j
-        std     $nlod,[%sp+$bias+$frame+24]
-        ldd     [$ap_l+$j],$alo         ! load a[j] in double format
-        ldd     [$ap_h+$j],$ahi
-        ldd     [$np_l+$j],$nlo         ! load n[j] in double format
-        ldd     [$np_h+$j],$nhi
-                fmuld   $alo,$ba,$aloa
-                fmuld   $nlo,$na,$nloa
-                fmuld   $alo,$bb,$alob
-                fmuld   $nlo,$nb,$nlob
-                fmuld   $alo,$bc,$aloc
-        ldx     [%sp+$bias+$frame+0],%o0
-                faddd   $aloa,$nloa,$nloa
-                fmuld   $nlo,$nc,$nloc
-        ldx     [%sp+$bias+$frame+8],%o1
-                fmuld   $alo,$bd,$alod
-        ldx     [%sp+$bias+$frame+16],%o2
-                faddd   $alob,$nlob,$nlob
-                fmuld   $nlo,$nd,$nlod
-        ldx     [%sp+$bias+$frame+24],%o3
-                fmuld   $ahi,$ba,$ahia
-        srlx    %o0,16,%o7
-                faddd   $aloc,$nloc,$nloc
-                fmuld   $nhi,$na,$nhia
-        add     %o7,%o1,%o1
-                fmuld   $ahi,$bb,$ahib
-        srlx    %o1,16,%o7
-                faddd   $alod,$nlod,$nlod
-                fmuld   $nhi,$nb,$nhib
-        add     %o7,%o2,%o2
-                fmuld   $ahi,$bc,$ahic
-        srlx    %o2,16,%o7
-                faddd   $ahia,$nhia,$nhia
-                fmuld   $nhi,$nc,$nhic
-        add     %o7,%o3,%o3             ! %o3.%o2[0..15].%o1[0..15].%o0[0..15]
-        ! why?
-        and     %o0,$mask,%o0
-                fmuld   $ahi,$bd,$ahid
-        and     %o1,$mask,%o1
-        and     %o2,$mask,%o2
-                faddd   $ahib,$nhib,$nhib
-                fmuld   $nhi,$nd,$nhid
-        sllx    %o1,16,%o1
-                faddd   $dota,$nloa,$nloa
-        sllx    %o2,32,%o2
-                faddd   $dotb,$nlob,$nlob
-        sllx    %o3,48,%o7
-        or      %o1,%o0,%o0
-                faddd   $ahic,$nhic,$dota       ! $nhic
-        or      %o2,%o0,%o0
-                faddd   $ahid,$nhid,$dotb       ! $nhid
-        or      %o7,%o0,%o0             ! 64-bit result
-        ldx     [$tp],%o7
-                faddd   $nloc,$nhia,$nloc
-        addcc   %o7,%o0,%o0
-        ! end-of-why?
-                faddd   $nlod,$nhib,$nlod
-        srlx    %o3,16,%g1              ! 34-bit carry
-                fdtox   $nloa,$nloa
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        fdtox   $nlob,$nlob
-        fdtox   $nloc,$nloc
-        fdtox   $nlod,$nlod
-        std     $nloa,[%sp+$bias+$frame+0]
-        std     $nlob,[%sp+$bias+$frame+8]
-        addcc   $j,8,$j
-        std     $nloc,[%sp+$bias+$frame+16]
-        bz,pn   %icc,.Linnerskip
-        std     $nlod,[%sp+$bias+$frame+24]
-        ba      .Linner
-        nop
-.align  32
-.Linner:
-        ldd     [$ap_l+$j],$alo         ! load a[j] in double format
-        ldd     [$ap_h+$j],$ahi
-        ldd     [$np_l+$j],$nlo         ! load n[j] in double format
-        ldd     [$np_h+$j],$nhi
-                fmuld   $alo,$ba,$aloa
-                fmuld   $nlo,$na,$nloa
-                fmuld   $alo,$bb,$alob
-                fmuld   $nlo,$nb,$nlob
-                fmuld   $alo,$bc,$aloc
-        ldx     [%sp+$bias+$frame+0],%o0
-                faddd   $aloa,$nloa,$nloa
-                fmuld   $nlo,$nc,$nloc
-        ldx     [%sp+$bias+$frame+8],%o1
-                fmuld   $alo,$bd,$alod
-        ldx     [%sp+$bias+$frame+16],%o2
-                faddd   $alob,$nlob,$nlob
-                fmuld   $nlo,$nd,$nlod
-        ldx     [%sp+$bias+$frame+24],%o3
-                fmuld   $ahi,$ba,$ahia
-        srlx    %o0,16,%o7
-                faddd   $aloc,$nloc,$nloc
-                fmuld   $nhi,$na,$nhia
-        add     %o7,%o1,%o1
-                fmuld   $ahi,$bb,$ahib
-        srlx    %o1,16,%o7
-                faddd   $alod,$nlod,$nlod
-                fmuld   $nhi,$nb,$nhib
-        add     %o7,%o2,%o2
-                fmuld   $ahi,$bc,$ahic
-        srlx    %o2,16,%o7
-                faddd   $ahia,$nhia,$nhia
-                fmuld   $nhi,$nc,$nhic
-        add     %o7,%o3,%o3             ! %o3.%o2[0..15].%o1[0..15].%o0[0..15]
-        and     %o0,$mask,%o0
-                fmuld   $ahi,$bd,$ahid
-        and     %o1,$mask,%o1
-        and     %o2,$mask,%o2
-                faddd   $ahib,$nhib,$nhib
-                fmuld   $nhi,$nd,$nhid
-        sllx    %o1,16,%o1
-                faddd   $dota,$nloa,$nloa
-        sllx    %o2,32,%o2
-                faddd   $dotb,$nlob,$nlob
-        sllx    %o3,48,%o7
-        or      %o1,%o0,%o0
-                faddd   $ahic,$nhic,$dota       ! $nhic
-        or      %o2,%o0,%o0
-                faddd   $ahid,$nhid,$dotb       ! $nhid
-        or      %o7,%o0,%o0             ! 64-bit result
-                faddd   $nloc,$nhia,$nloc
-        addcc   %g1,%o0,%o0
-        ldx     [$tp+8],%o7             ! tp[j]
-                faddd   $nlod,$nhib,$nlod
-        srlx    %o3,16,%g1              ! 34-bit carry
-                fdtox   $nloa,$nloa
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-                fdtox   $nlob,$nlob
-        addcc   %o7,%o0,%o0
-                fdtox   $nloc,$nloc
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        stx     %o0,[$tp]               ! tp[j-1]
-                fdtox   $nlod,$nlod
-        std     $nloa,[%sp+$bias+$frame+0]
-        std     $nlob,[%sp+$bias+$frame+8]
-        std     $nloc,[%sp+$bias+$frame+16]
-        addcc   $j,8,$j
-        std     $nlod,[%sp+$bias+$frame+24]
-        bnz,pt  %icc,.Linner
-        add     $tp,8,$tp
-.Linnerskip:
-        fdtox   $dota,$dota
-        fdtox   $dotb,$dotb
-        ldx     [%sp+$bias+$frame+0],%o0
-        ldx     [%sp+$bias+$frame+8],%o1
-        ldx     [%sp+$bias+$frame+16],%o2
-        ldx     [%sp+$bias+$frame+24],%o3
-        srlx    %o0,16,%o7
-        std     $dota,[%sp+$bias+$frame+32]
-        add     %o7,%o1,%o1
-        std     $dotb,[%sp+$bias+$frame+40]
-        srlx    %o1,16,%o7
-        add     %o7,%o2,%o2
-        srlx    %o2,16,%o7
-        add     %o7,%o3,%o3             ! %o3.%o2[0..15].%o1[0..15].%o0[0..15]
-        and     %o0,$mask,%o0
-        and     %o1,$mask,%o1
-        and     %o2,$mask,%o2
-        sllx    %o1,16,%o1
-        sllx    %o2,32,%o2
-        sllx    %o3,48,%o7
-        or      %o1,%o0,%o0
-        or      %o2,%o0,%o0
-        ldx     [%sp+$bias+$frame+32],%o4
-        or      %o7,%o0,%o0             ! 64-bit result
-        ldx     [%sp+$bias+$frame+40],%o5
-        addcc   %g1,%o0,%o0
-        ldx     [$tp+8],%o7             ! tp[j]
-        srlx    %o3,16,%g1              ! 34-bit carry
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        addcc   %o7,%o0,%o0
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        stx     %o0,[$tp]               ! tp[j-1]
-        add     $tp,8,$tp
-        srlx    %o4,16,%o7
-        add     %o7,%o5,%o5
-        and     %o4,$mask,%o4
-        sllx    %o5,16,%o7
-        or      %o7,%o4,%o4
-        addcc   %g1,%o4,%o4
-        srlx    %o5,48,%g1
-        bcs,a   %xcc,.+8
-        add     %g1,1,%g1
-        addcc   $carry,%o4,%o4
-        stx     %o4,[$tp]               ! tp[num-1]
-        mov     %g1,$carry
-        bcs,a   %xcc,.+8
-        add     $carry,1,$carry
-        addcc   $i,8,$i
-        bnz     %icc,.Louter
-        nop
-        add     $tp,8,$tp               ! adjust tp to point at the end
-        orn     %g0,%g0,%g4
-        sub     %g0,$num,%o7            ! n=-num
-        ba      .Lsub
-        subcc   %g0,%g0,%g0             ! clear %icc.c
-.align  32
-.Lsub:
-        ldx     [$tp+%o7],%o0
-        add     $np,%o7,%g1
-        ld      [%g1+0],%o2
-        ld      [%g1+4],%o3
-        srlx    %o0,32,%o1
-        subccc  %o0,%o2,%o2
-        add     $rp,%o7,%g1
-        subccc  %o1,%o3,%o3
-        st      %o2,[%g1+0]
-        add     %o7,8,%o7
-        brnz,pt %o7,.Lsub
-        st      %o3,[%g1+4]
-        subc    $carry,0,%g4
-        sub     %g0,$num,%o7            ! n=-num
-        ba      .Lcopy
-        nop
-.align  32
-.Lcopy:
-        ldx     [$tp+%o7],%o0
-        add     $rp,%o7,%g1
-        ld      [%g1+0],%o2
-        ld      [%g1+4],%o3
-        stx     %g0,[$tp+%o7]
-        and     %o0,%g4,%o0
-        srlx    %o0,32,%o1
-        andn    %o2,%g4,%o2
-        andn    %o3,%g4,%o3
-        or      %o2,%o0,%o0
-        or      %o3,%o1,%o1
-        st      %o0,[%g1+0]
-        add     %o7,8,%o7
-        brnz,pt %o7,.Lcopy
-        st      %o1,[%g1+4]
-        sub     %g0,$num,%o7            ! n=-num
-.Lzap:
-        stx     %g0,[$ap_l+%o7]
-        stx     %g0,[$ap_h+%o7]
-        stx     %g0,[$np_l+%o7]
-        stx     %g0,[$np_h+%o7]
-        add     %o7,8,%o7
-        brnz,pt %o7,.Lzap
-        nop
-        ldx     [%sp+$bias+$frame+48],%o7
-        wr      %g0,%o7,%asi            ! restore %asi
-        mov     1,%i0
-.Lret:
-        ret
-        restore
-.type   $fname,#function
-.size   $fname,(.-$fname)
-.asciz  "Montgomery Multipltication for UltraSPARC, CRYPTOGAMS by <appro\@openssl.org>"
-.align  32
-___
-$code =~ s/\`([^\`]*)\`/eval($1)/gem;
-# Below substitution makes it possible to compile without demanding
-# VIS extentions on command line, e.g. -xarch=v9 vs. -xarch=v9a. I
-# dare to do this, because VIS capability is detected at run-time now
-# and this routine is not called on CPU not capable to execute it. Do
-# note that fzeros is not the only VIS dependency! Another dependency
-# is implicit and is just _a_ numerical value loaded to %asi register,
-# which assembler can't recognize as VIS specific...
-$code =~ s/fzeros\s+%f([0-9]+)/
-           sprintf(".word\t0x%x\t! fzeros %%f%d",0x81b00c20|($1<<25),$1)
-          /gem;
-print $code;
-# flush
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/asm/via-mont.pl b/src/lib/libcrypto/bn/asm/via-mont.pl
deleted file mode 100644
index c046a514c8..0000000000
--- a/src/lib/libcrypto/bn/asm/via-mont.pl
+++ /dev/null
@@ -1,242 +0,0 @@
-#!/usr/bin/env perl
-#
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-#
-# Wrapper around 'rep montmul', VIA-specific instruction accessing
-# PadLock Montgomery Multiplier. The wrapper is designed as drop-in
-# replacement for OpenSSL bn_mul_mont [first implemented in 0.9.9].
-#
-# Below are interleaved outputs from 'openssl speed rsa dsa' for 4
-# different software configurations on 1.5GHz VIA Esther processor.
-# Lines marked with "software integer" denote performance of hand-
-# coded integer-only assembler found in OpenSSL 0.9.7. "Software SSE2"
-# refers to hand-coded SSE2 Montgomery multiplication procedure found
-# OpenSSL 0.9.9. "Hardware VIA SDK" refers to padlock_pmm routine from
-# Padlock SDK 2.0.1 available for download from VIA, which naturally
-# utilizes the magic 'repz montmul' instruction. And finally "hardware
-# this" refers to *this* implementation which also uses 'repz montmul'
-#
-#                   sign    verify    sign/s verify/s
-# rsa  512 bits 0.001720s 0.000140s    581.4   7149.7   software integer
-# rsa  512 bits 0.000690s 0.000086s   1450.3  11606.0   software SSE2
-# rsa  512 bits 0.006136s 0.000201s    163.0   4974.5   hardware VIA SDK
-# rsa  512 bits 0.000712s 0.000050s   1404.9  19858.5   hardware this
-#
-# rsa 1024 bits 0.008518s 0.000413s    117.4   2420.8   software integer
-# rsa 1024 bits 0.004275s 0.000277s    233.9   3609.7   software SSE2
-# rsa 1024 bits 0.012136s 0.000260s     82.4   3844.5   hardware VIA SDK
-# rsa 1024 bits 0.002522s 0.000116s    396.5   8650.9   hardware this
-#
-# rsa 2048 bits 0.050101s 0.001371s     20.0    729.6   software integer
-# rsa 2048 bits 0.030273s 0.001008s     33.0    991.9   software SSE2
-# rsa 2048 bits 0.030833s 0.000976s     32.4   1025.1   hardware VIA SDK
-# rsa 2048 bits 0.011879s 0.000342s     84.2   2921.7   hardware this
-#
-# rsa 4096 bits 0.327097s 0.004859s      3.1    205.8   software integer
-# rsa 4096 bits 0.229318s 0.003859s      4.4    259.2   software SSE2
-# rsa 4096 bits 0.233953s 0.003274s      4.3    305.4   hardware VIA SDK
-# rsa 4096 bits 0.070493s 0.001166s     14.2    857.6   hardware this
-#
-# dsa  512 bits 0.001342s 0.001651s    745.2    605.7   software integer
-# dsa  512 bits 0.000844s 0.000987s   1185.3   1013.1   software SSE2
-# dsa  512 bits 0.001902s 0.002247s    525.6    444.9   hardware VIA SDK
-# dsa  512 bits 0.000458s 0.000524s   2182.2   1909.1   hardware this
-#
-# dsa 1024 bits 0.003964s 0.004926s    252.3    203.0   software integer
-# dsa 1024 bits 0.002686s 0.003166s    372.3    315.8   software SSE2
-# dsa 1024 bits 0.002397s 0.002823s    417.1    354.3   hardware VIA SDK
-# dsa 1024 bits 0.000978s 0.001170s   1022.2    855.0   hardware this
-#
-# dsa 2048 bits 0.013280s 0.016518s     75.3     60.5   software integer
-# dsa 2048 bits 0.009911s 0.011522s    100.9     86.8   software SSE2
-# dsa 2048 bits 0.009542s 0.011763s    104.8     85.0   hardware VIA SDK
-# dsa 2048 bits 0.002884s 0.003352s    346.8    298.3   hardware this
-#
-# To give you some other reference point here is output for 2.4GHz P4
-# running hand-coded SSE2 bn_mul_mont found in 0.9.9, i.e. "software
-# SSE2" in above terms.
-#
-# rsa  512 bits 0.000407s 0.000047s   2454.2  21137.0
-# rsa 1024 bits 0.002426s 0.000141s    412.1   7100.0
-# rsa 2048 bits 0.015046s 0.000491s     66.5   2034.9
-# rsa 4096 bits 0.109770s 0.002379s      9.1    420.3
-# dsa  512 bits 0.000438s 0.000525s   2281.1   1904.1
-# dsa 1024 bits 0.001346s 0.001595s    742.7    627.0
-# dsa 2048 bits 0.004745s 0.005582s    210.7    179.1
-#
-# Conclusions: 
-# - VIA SDK leaves a *lot* of room for improvement (which this
-#   implementation successfully fills:-);
-# - 'rep montmul' gives up to >3x performance improvement depending on
-#   key length;
-# - in terms of absolute performance it delivers approximately as much
-#   as modern out-of-order 32-bit cores [again, for longer keys].
-$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
-push(@INC,"${dir}","${dir}../../perlasm");
-require "x86asm.pl";
-&asm_init($ARGV[0],"via-mont.pl");
-# int bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, const BN_ULONG *np,const BN_ULONG *n0, int num);
-$func="bn_mul_mont_padlock";
-$pad=16*1;      # amount of reserved bytes on top of every vector
-# stack layout
-$mZeroPrime=&DWP(0,"esp");              # these are specified by VIA
-$A=&DWP(4,"esp");
-$B=&DWP(8,"esp");
-$T=&DWP(12,"esp");
-$M=&DWP(16,"esp");
-$scratch=&DWP(20,"esp");
-$rp=&DWP(24,"esp");                     # these are mine
-$sp=&DWP(28,"esp");
-# &DWP(32,"esp")                        # 32 byte scratch area
-# &DWP(64+(4*$num+$pad)*0,"esp")        # padded tp[num]
-# &DWP(64+(4*$num+$pad)*1,"esp")        # padded copy of ap[num]
-# &DWP(64+(4*$num+$pad)*2,"esp")        # padded copy of bp[num]
-# &DWP(64+(4*$num+$pad)*3,"esp")        # padded copy of np[num]
-# Note that SDK suggests to unconditionally allocate 2K per vector. This
-# has quite an impact on performance. It naturally depends on key length,
-# but to give an example 1024 bit private RSA key operations suffer >30%
-# penalty. I allocate only as much as actually required...
-&function_begin($func);
-        &xor    ("eax","eax");
-        &mov    ("ecx",&wparam(5));     # num
-        # meet VIA's limitations for num [note that the specification
-        # expresses them in bits, while we work with amount of 32-bit words]
-        &test   ("ecx",3);
-        &jnz    (&label("leave"));      # num % 4 != 0
-        &cmp    ("ecx",8);
-        &jb     (&label("leave"));      # num < 8
-        &cmp    ("ecx",1024);
-        &ja     (&label("leave"));      # num > 1024
-        &pushf  ();
-        &cld    ();
-        &mov    ("edi",&wparam(0));     # rp
-        &mov    ("eax",&wparam(1));     # ap
-        &mov    ("ebx",&wparam(2));     # bp
-        &mov    ("edx",&wparam(3));     # np
-        &mov    ("esi",&wparam(4));     # n0
-        &mov    ("esi",&DWP(0,"esi"));  # *n0
-        &lea    ("ecx",&DWP($pad,"","ecx",4));  # ecx becomes vector size in bytes
-        &lea    ("ebp",&DWP(64,"","ecx",4));    # allocate 4 vectors + 64 bytes
-        &neg    ("ebp");
-        &add    ("ebp","esp");
-        &and    ("ebp",-64);            # align to cache-line
-        &xchg   ("ebp","esp");          # alloca
-        &mov    ($rp,"edi");            # save rp
-        &mov    ($sp,"ebp");            # save esp
-        &mov    ($mZeroPrime,"esi");
-        &lea    ("esi",&DWP(64,"esp")); # tp
-        &mov    ($T,"esi");
-        &lea    ("edi",&DWP(32,"esp")); # scratch area
-        &mov    ($scratch,"edi");
-        &mov    ("esi","eax");
-        &lea    ("ebp",&DWP(-$pad,"ecx"));
-        &shr    ("ebp",2);              # restore original num value in ebp
-        &xor    ("eax","eax");
-        &mov    ("ecx","ebp");
-        &lea    ("ecx",&DWP((32+$pad)/4,"ecx"));# padded tp + scratch
-        &data_byte(0xf3,0xab);          # rep stosl, bzero
-        &mov    ("ecx","ebp");
-        &lea    ("edi",&DWP(64+$pad,"esp","ecx",4));# pointer to ap copy
-        &mov    ($A,"edi");
-        &data_byte(0xf3,0xa5);          # rep movsl, memcpy
-        &mov    ("ecx",$pad/4);
-        &data_byte(0xf3,0xab);          # rep stosl, bzero pad
-        # edi points at the end of padded ap copy...
-        &mov    ("ecx","ebp");
-        &mov    ("esi","ebx");
-        &mov    ($B,"edi");
-        &data_byte(0xf3,0xa5);          # rep movsl, memcpy
-        &mov    ("ecx",$pad/4);
-        &data_byte(0xf3,0xab);          # rep stosl, bzero pad
-        # edi points at the end of padded bp copy...
-        &mov    ("ecx","ebp");
-        &mov    ("esi","edx");
-        &mov    ($M,"edi");
-        &data_byte(0xf3,0xa5);          # rep movsl, memcpy
-        &mov    ("ecx",$pad/4);
-        &data_byte(0xf3,0xab);          # rep stosl, bzero pad
-        # edi points at the end of padded np copy...
-        # let magic happen...
-        &mov    ("ecx","ebp");
-        &mov    ("esi","esp");
-        &shl    ("ecx",5);              # convert word counter to bit counter
-        &align  (4);
-        &data_byte(0xf3,0x0f,0xa6,0xc0);# rep montmul
-        &mov    ("ecx","ebp");
-        &lea    ("esi",&DWP(64,"esp"));         # tp
-        # edi still points at the end of padded np copy...
-        &neg    ("ebp");
-        &lea    ("ebp",&DWP(-$pad,"edi","ebp",4));      # so just "rewind"
-        &mov    ("edi",$rp);                    # restore rp
-        &xor    ("edx","edx");                  # i=0 and clear CF
-&set_label("sub",8);
-        &mov    ("eax",&DWP(0,"esi","edx",4));
-        &sbb    ("eax",&DWP(0,"ebp","edx",4));
-        &mov    (&DWP(0,"edi","edx",4),"eax");  # rp[i]=tp[i]-np[i]
-        &lea    ("edx",&DWP(1,"edx"));          # i++
-        &loop   (&label("sub"));                # doesn't affect CF!
-        &mov    ("eax",&DWP(0,"esi","edx",4));  # upmost overflow bit
-        &sbb    ("eax",0);
-        &and    ("esi","eax");
-        &not    ("eax");
-        &mov    ("ebp","edi");
-        &and    ("ebp","eax");
-        &or     ("esi","ebp");                  # tp=carry?tp:rp
-        &mov    ("ecx","edx");                  # num
-        &xor    ("edx","edx");                  # i=0
-&set_label("copy",8);
-        &mov    ("eax",&DWP(0,"esi","edx",4));
-        &mov    (&DWP(64,"esp","edx",4),"ecx"); # zap tp
-        &mov    (&DWP(0,"edi","edx",4),"eax");
-        &lea    ("edx",&DWP(1,"edx"));          # i++
-        &loop   (&label("copy"));
-        &mov    ("ebp",$sp);
-        &xor    ("eax","eax");
-        &mov    ("ecx",64/4);
-        &mov    ("edi","esp");          # zap frame including scratch area
-        &data_byte(0xf3,0xab);          # rep stosl, bzero
-        # zap copies of ap, bp and np
-        &lea    ("edi",&DWP(64+$pad,"esp","edx",4));# pointer to ap
-        &lea    ("ecx",&DWP(3*$pad/4,"edx","edx",2));
-        &data_byte(0xf3,0xab);          # rep stosl, bzero
-        &mov    ("esp","ebp");
-        &inc    ("eax");                # signal "done"
-        &popf   ();
-&set_label("leave");
-&function_end($func);
-&asciz("Padlock Montgomery Multiplication, CRYPTOGAMS by <appro\@openssl.org>");
-&asm_finish();
diff --git a/src/lib/libcrypto/bn/asm/x86-mont.pl b/src/lib/libcrypto/bn/asm/x86-mont.pl
deleted file mode 100755
index 5cd3cd2ed5..0000000000
--- a/src/lib/libcrypto/bn/asm/x86-mont.pl
+++ /dev/null
@@ -1,591 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# October 2005
-#
-# This is a "teaser" code, as it can be improved in several ways...
-# First of all non-SSE2 path should be implemented (yes, for now it
-# performs Montgomery multiplication/convolution only on SSE2-capable
-# CPUs such as P4, others fall down to original code). Then inner loop
-# can be unrolled and modulo-scheduled to improve ILP and possibly
-# moved to 128-bit XMM register bank (though it would require input
-# rearrangement and/or increase bus bandwidth utilization). Dedicated
-# squaring procedure should give further performance improvement...
-# Yet, for being draft, the code improves rsa512 *sign* benchmark by
-# 110%(!), rsa1024 one - by 70% and rsa4096 - by 20%:-)
-# December 2006
-#
-# Modulo-scheduling SSE2 loops results in further 15-20% improvement.
-# Integer-only code [being equipped with dedicated squaring procedure]
-# gives ~40% on rsa512 sign benchmark...
-$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
-push(@INC,"${dir}","${dir}../../perlasm");
-require "x86asm.pl";
-&asm_init($ARGV[0],$0);
-$sse2=0;
-for (@ARGV) { $sse2=1 if (/-DOPENSSL_IA32_SSE2/); }
-&external_label("OPENSSL_ia32cap_P") if ($sse2);
-&function_begin("bn_mul_mont");
-$i="edx";
-$j="ecx";
-$ap="esi";      $tp="esi";              # overlapping variables!!!
-$rp="edi";      $bp="edi";              # overlapping variables!!!
-$np="ebp";
-$num="ebx";
-$_num=&DWP(4*0,"esp");                  # stack top layout
-$_rp=&DWP(4*1,"esp");
-$_ap=&DWP(4*2,"esp");
-$_bp=&DWP(4*3,"esp");
-$_np=&DWP(4*4,"esp");
-$_n0=&DWP(4*5,"esp");   $_n0q=&QWP(4*5,"esp");
-$_sp=&DWP(4*6,"esp");
-$_bpend=&DWP(4*7,"esp");
-$frame=32;                              # size of above frame rounded up to 16n
-        &xor    ("eax","eax");
-        &mov    ("edi",&wparam(5));     # int num
-        &cmp    ("edi",4);
-        &jl     (&label("just_leave"));
-        &lea    ("esi",&wparam(0));     # put aside pointer to argument block
-        &lea    ("edx",&wparam(1));     # load ap
-        &mov    ("ebp","esp");          # saved stack pointer!
-        &add    ("edi",2);              # extra two words on top of tp
-        &neg    ("edi");
-        &lea    ("esp",&DWP(-$frame,"esp","edi",4));    # alloca($frame+4*(num+2))
-        &neg    ("edi");
-        # minimize cache contention by arraning 2K window between stack
-        # pointer and ap argument [np is also position sensitive vector,
-        # but it's assumed to be near ap, as it's allocated at ~same
-        # time].
-        &mov    ("eax","esp");
-        &sub    ("eax","edx");
-        &and    ("eax",2047);
-        &sub    ("esp","eax");          # this aligns sp and ap modulo 2048
-        &xor    ("edx","esp");
-        &and    ("edx",2048);
-        &xor    ("edx",2048);
-        &sub    ("esp","edx");          # this splits them apart modulo 4096
-        &and    ("esp",-64);            # align to cache line
-        ################################# load argument block...
-        &mov    ("eax",&DWP(0*4,"esi"));# BN_ULONG *rp
-        &mov    ("ebx",&DWP(1*4,"esi"));# const BN_ULONG *ap
-        &mov    ("ecx",&DWP(2*4,"esi"));# const BN_ULONG *bp
-        &mov    ("edx",&DWP(3*4,"esi"));# const BN_ULONG *np
-        &mov    ("esi",&DWP(4*4,"esi"));# const BN_ULONG *n0
-        #&mov   ("edi",&DWP(5*4,"esi"));# int num
-        &mov    ("esi",&DWP(0,"esi"));  # pull n0[0]
-        &mov    ($_rp,"eax");           # ... save a copy of argument block
-        &mov    ($_ap,"ebx");
-        &mov    ($_bp,"ecx");
-        &mov    ($_np,"edx");
-        &mov    ($_n0,"esi");
-        &lea    ($num,&DWP(-3,"edi"));  # num=num-1 to assist modulo-scheduling
-        #&mov   ($_num,$num);           # redundant as $num is not reused
-        &mov    ($_sp,"ebp");           # saved stack pointer!
-if($sse2) {
-$acc0="mm0";    # mmx register bank layout
-$acc1="mm1";
-$car0="mm2";
-$car1="mm3";
-$mul0="mm4";
-$mul1="mm5";
-$temp="mm6";
-$mask="mm7";
-        &picmeup("eax","OPENSSL_ia32cap_P");
-        &bt     (&DWP(0,"eax"),26);
-        &jnc    (&label("non_sse2"));
-        &mov    ("eax",-1);
-        &movd   ($mask,"eax");          # mask 32 lower bits
-        &mov    ($ap,$_ap);             # load input pointers
-        &mov    ($bp,$_bp);
-        &mov    ($np,$_np);
-        &xor    ($i,$i);                # i=0
-        &xor    ($j,$j);                # j=0
-        &movd   ($mul0,&DWP(0,$bp));            # bp[0]
-        &movd   ($mul1,&DWP(0,$ap));            # ap[0]
-        &movd   ($car1,&DWP(0,$np));            # np[0]
-        &pmuludq($mul1,$mul0);                  # ap[0]*bp[0]
-        &movq   ($car0,$mul1);
-        &movq   ($acc0,$mul1);                  # I wish movd worked for
-        &pand   ($acc0,$mask);                  # inter-register transfers
-        &pmuludq($mul1,$_n0q);                  # *=n0
-        &pmuludq($car1,$mul1);                  # "t[0]"*np[0]*n0
-        &paddq  ($car1,$acc0);
-        &movd   ($acc1,&DWP(4,$np));            # np[1]
-        &movd   ($acc0,&DWP(4,$ap));            # ap[1]
-        &psrlq  ($car0,32);
-        &psrlq  ($car1,32);
-        &inc    ($j);                           # j++
-&set_label("1st",16);
-        &pmuludq($acc0,$mul0);                  # ap[j]*bp[0]
-        &pmuludq($acc1,$mul1);                  # np[j]*m1
-        &paddq  ($car0,$acc0);                  # +=c0
-        &paddq  ($car1,$acc1);                  # +=c1
-        &movq   ($acc0,$car0);
-        &pand   ($acc0,$mask);
-        &movd   ($acc1,&DWP(4,$np,$j,4));       # np[j+1]
-        &paddq  ($car1,$acc0);                  # +=ap[j]*bp[0];
-        &movd   ($acc0,&DWP(4,$ap,$j,4));       # ap[j+1]
-        &psrlq  ($car0,32);
-        &movd   (&DWP($frame-4,"esp",$j,4),$car1);      # tp[j-1]=
-        &psrlq  ($car1,32);
-        &lea    ($j,&DWP(1,$j));
-        &cmp    ($j,$num);
-        &jl     (&label("1st"));
-        &pmuludq($acc0,$mul0);                  # ap[num-1]*bp[0]
-        &pmuludq($acc1,$mul1);                  # np[num-1]*m1
-        &paddq  ($car0,$acc0);                  # +=c0
-        &paddq  ($car1,$acc1);                  # +=c1
-        &movq   ($acc0,$car0);
-        &pand   ($acc0,$mask);
-        &paddq  ($car1,$acc0);                  # +=ap[num-1]*bp[0];
-        &movd   (&DWP($frame-4,"esp",$j,4),$car1);      # tp[num-2]=
-        &psrlq  ($car0,32);
-        &psrlq  ($car1,32);
-        &paddq  ($car1,$car0);
-        &movq   (&QWP($frame,"esp",$num,4),$car1);      # tp[num].tp[num-1]
-        &inc    ($i);                           # i++
-&set_label("outer");
-        &xor    ($j,$j);                        # j=0
-        &movd   ($mul0,&DWP(0,$bp,$i,4));       # bp[i]
-        &movd   ($mul1,&DWP(0,$ap));            # ap[0]
-        &movd   ($temp,&DWP($frame,"esp"));     # tp[0]
-        &movd   ($car1,&DWP(0,$np));            # np[0]
-        &pmuludq($mul1,$mul0);                  # ap[0]*bp[i]
-        &paddq  ($mul1,$temp);                  # +=tp[0]
-        &movq   ($acc0,$mul1);
-        &movq   ($car0,$mul1);
-        &pand   ($acc0,$mask);
-        &pmuludq($mul1,$_n0q);                  # *=n0
-        &pmuludq($car1,$mul1);
-        &paddq  ($car1,$acc0);
-        &movd   ($temp,&DWP($frame+4,"esp"));   # tp[1]
-        &movd   ($acc1,&DWP(4,$np));            # np[1]
-        &movd   ($acc0,&DWP(4,$ap));            # ap[1]
-        &psrlq  ($car0,32);
-        &psrlq  ($car1,32);
-        &paddq  ($car0,$temp);                  # +=tp[1]
-        &inc    ($j);                           # j++
-        &dec    ($num);
-&set_label("inner");
-        &pmuludq($acc0,$mul0);                  # ap[j]*bp[i]
-        &pmuludq($acc1,$mul1);                  # np[j]*m1
-        &paddq  ($car0,$acc0);                  # +=c0
-        &paddq  ($car1,$acc1);                  # +=c1
-        &movq   ($acc0,$car0);
-        &movd   ($temp,&DWP($frame+4,"esp",$j,4));# tp[j+1]
-        &pand   ($acc0,$mask);
-        &movd   ($acc1,&DWP(4,$np,$j,4));       # np[j+1]
-        &paddq  ($car1,$acc0);                  # +=ap[j]*bp[i]+tp[j]
-        &movd   ($acc0,&DWP(4,$ap,$j,4));       # ap[j+1]
-        &psrlq  ($car0,32);
-        &movd   (&DWP($frame-4,"esp",$j,4),$car1);# tp[j-1]=
-        &psrlq  ($car1,32);
-        &paddq  ($car0,$temp);                  # +=tp[j+1]
-        &dec    ($num);
-        &lea    ($j,&DWP(1,$j));                # j++
-        &jnz    (&label("inner"));
-        &mov    ($num,$j);
-        &pmuludq($acc0,$mul0);                  # ap[num-1]*bp[i]
-        &pmuludq($acc1,$mul1);                  # np[num-1]*m1
-        &paddq  ($car0,$acc0);                  # +=c0
-        &paddq  ($car1,$acc1);                  # +=c1
-        &movq   ($acc0,$car0);
-        &pand   ($acc0,$mask);
-        &paddq  ($car1,$acc0);                  # +=ap[num-1]*bp[i]+tp[num-1]
-        &movd   (&DWP($frame-4,"esp",$j,4),$car1);      # tp[num-2]=
-        &psrlq  ($car0,32);
-        &psrlq  ($car1,32);
-        &movd   ($temp,&DWP($frame+4,"esp",$num,4));    # += tp[num]
-        &paddq  ($car1,$car0);
-        &paddq  ($car1,$temp);
-        &movq   (&QWP($frame,"esp",$num,4),$car1);      # tp[num].tp[num-1]
-        &lea    ($i,&DWP(1,$i));                # i++
-        &cmp    ($i,$num);
-        &jle    (&label("outer"));
-        &emms   ();                             # done with mmx bank
-        &jmp    (&label("common_tail"));
-&set_label("non_sse2",16);
-}
-if (0) {
-        &mov    ("esp",$_sp);
-        &xor    ("eax","eax");  # signal "not fast enough [yet]"
-        &jmp    (&label("just_leave"));
-        # While the below code provides competitive performance for
-        # all key lengthes on modern Intel cores, it's still more
-        # than 10% slower for 4096-bit key elsewhere:-( "Competitive"
-        # means compared to the original integer-only assembler.
-        # 512-bit RSA sign is better by ~40%, but that's about all
-        # one can say about all CPUs...
-} else {
-$inp="esi";     # integer path uses these registers differently
-$word="edi";
-$carry="ebp";
-        &mov    ($inp,$_ap);
-        &lea    ($carry,&DWP(1,$num));
-        &mov    ($word,$_bp);
-        &xor    ($j,$j);                                # j=0
-        &mov    ("edx",$inp);
-        &and    ($carry,1);                             # see if num is even
-        &sub    ("edx",$word);                          # see if ap==bp
-        &lea    ("eax",&DWP(4,$word,$num,4));           # &bp[num]
-        &or     ($carry,"edx");
-        &mov    ($word,&DWP(0,$word));                  # bp[0]
-        &jz     (&label("bn_sqr_mont"));
-        &mov    ($_bpend,"eax");
-        &mov    ("eax",&DWP(0,$inp));
-        &xor    ("edx","edx");
-&set_label("mull",16);
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[j]*bp[0]
-        &add    ($carry,"eax");
-        &lea    ($j,&DWP(1,$j));
-        &adc    ("edx",0);
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # ap[j+1]
-        &cmp    ($j,$num);
-        &mov    (&DWP($frame-4,"esp",$j,4),$carry);     # tp[j]=
-        &jl     (&label("mull"));
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[num-1]*bp[0]
-         &mov   ($word,$_n0);
-        &add    ("eax",$carry);
-         &mov   ($inp,$_np);
-        &adc    ("edx",0);
-         &imul  ($word,&DWP($frame,"esp"));             # n0*tp[0]
-        &mov    (&DWP($frame,"esp",$num,4),"eax");      # tp[num-1]=
-        &xor    ($j,$j);
-        &mov    (&DWP($frame+4,"esp",$num,4),"edx");    # tp[num]=
-        &mov    (&DWP($frame+8,"esp",$num,4),$j);       # tp[num+1]=
-        &mov    ("eax",&DWP(0,$inp));                   # np[0]
-        &mul    ($word);                                # np[0]*m
-        &add    ("eax",&DWP($frame,"esp"));             # +=tp[0]
-        &mov    ("eax",&DWP(4,$inp));                   # np[1]
-        &adc    ("edx",0);
-        &inc    ($j);
-        &jmp    (&label("2ndmadd"));
-&set_label("1stmadd",16);
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[j]*bp[i]
-        &add    ($carry,&DWP($frame,"esp",$j,4));       # +=tp[j]
-        &lea    ($j,&DWP(1,$j));
-        &adc    ("edx",0);
-        &add    ($carry,"eax");
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # ap[j+1]
-        &adc    ("edx",0);
-        &cmp    ($j,$num);
-        &mov    (&DWP($frame-4,"esp",$j,4),$carry);     # tp[j]=
-        &jl     (&label("1stmadd"));
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[num-1]*bp[i]
-        &add    ("eax",&DWP($frame,"esp",$num,4));      # +=tp[num-1]
-         &mov   ($word,$_n0);
-        &adc    ("edx",0);
-         &mov   ($inp,$_np);
-        &add    ($carry,"eax");
-        &adc    ("edx",0);
-         &imul  ($word,&DWP($frame,"esp"));             # n0*tp[0]
-        &xor    ($j,$j);
-        &add    ("edx",&DWP($frame+4,"esp",$num,4));    # carry+=tp[num]
-        &mov    (&DWP($frame,"esp",$num,4),$carry);     # tp[num-1]=
-        &adc    ($j,0);
-         &mov   ("eax",&DWP(0,$inp));                   # np[0]
-        &mov    (&DWP($frame+4,"esp",$num,4),"edx");    # tp[num]=
-        &mov    (&DWP($frame+8,"esp",$num,4),$j);       # tp[num+1]=
-        &mul    ($word);                                # np[0]*m
-        &add    ("eax",&DWP($frame,"esp"));             # +=tp[0]
-        &mov    ("eax",&DWP(4,$inp));                   # np[1]
-        &adc    ("edx",0);
-        &mov    ($j,1);
-&set_label("2ndmadd",16);
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # np[j]*m
-        &add    ($carry,&DWP($frame,"esp",$j,4));       # +=tp[j]
-        &lea    ($j,&DWP(1,$j));
-        &adc    ("edx",0);
-        &add    ($carry,"eax");
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # np[j+1]
-        &adc    ("edx",0);
-        &cmp    ($j,$num);
-        &mov    (&DWP($frame-8,"esp",$j,4),$carry);     # tp[j-1]=
-        &jl     (&label("2ndmadd"));
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # np[j]*m
-        &add    ($carry,&DWP($frame,"esp",$num,4));     # +=tp[num-1]
-        &adc    ("edx",0);
-        &add    ($carry,"eax");
-        &adc    ("edx",0);
-        &mov    (&DWP($frame-4,"esp",$num,4),$carry);   # tp[num-2]=
-        &xor    ("eax","eax");
-         &mov   ($j,$_bp);                              # &bp[i]
-        &add    ("edx",&DWP($frame+4,"esp",$num,4));    # carry+=tp[num]
-        &adc    ("eax",&DWP($frame+8,"esp",$num,4));    # +=tp[num+1]
-         &lea   ($j,&DWP(4,$j));
-        &mov    (&DWP($frame,"esp",$num,4),"edx");      # tp[num-1]=
-         &cmp   ($j,$_bpend);
-        &mov    (&DWP($frame+4,"esp",$num,4),"eax");    # tp[num]=
-        &je     (&label("common_tail"));
-        &mov    ($word,&DWP(0,$j));                     # bp[i+1]
-        &mov    ($inp,$_ap);
-        &mov    ($_bp,$j);                              # &bp[++i]
-        &xor    ($j,$j);
-        &xor    ("edx","edx");
-        &mov    ("eax",&DWP(0,$inp));
-        &jmp    (&label("1stmadd"));
-&set_label("bn_sqr_mont",16);
-$sbit=$num;
-        &mov    ($_num,$num);
-        &mov    ($_bp,$j);                              # i=0
-        &mov    ("eax",$word);                          # ap[0]
-        &mul    ($word);                                # ap[0]*ap[0]
-        &mov    (&DWP($frame,"esp"),"eax");             # tp[0]=
-        &mov    ($sbit,"edx");
-        &shr    ("edx",1);
-        &and    ($sbit,1);
-        &inc    ($j);
-&set_label("sqr",16);
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # ap[j]
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[j]*ap[0]
-        &add    ("eax",$carry);
-        &lea    ($j,&DWP(1,$j));
-        &adc    ("edx",0);
-        &lea    ($carry,&DWP(0,$sbit,"eax",2));
-        &shr    ("eax",31);
-        &cmp    ($j,$_num);
-        &mov    ($sbit,"eax");
-        &mov    (&DWP($frame-4,"esp",$j,4),$carry);     # tp[j]=
-        &jl     (&label("sqr"));
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # ap[num-1]
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[num-1]*ap[0]
-        &add    ("eax",$carry);
-         &mov   ($word,$_n0);
-        &adc    ("edx",0);
-         &mov   ($inp,$_np);
-        &lea    ($carry,&DWP(0,$sbit,"eax",2));
-         &imul  ($word,&DWP($frame,"esp"));             # n0*tp[0]
-        &shr    ("eax",31);
-        &mov    (&DWP($frame,"esp",$j,4),$carry);       # tp[num-1]=
-        &lea    ($carry,&DWP(0,"eax","edx",2));
-         &mov   ("eax",&DWP(0,$inp));                   # np[0]
-        &shr    ("edx",31);
-        &mov    (&DWP($frame+4,"esp",$j,4),$carry);     # tp[num]=
-        &mov    (&DWP($frame+8,"esp",$j,4),"edx");      # tp[num+1]=
-        &mul    ($word);                                # np[0]*m
-        &add    ("eax",&DWP($frame,"esp"));             # +=tp[0]
-        &mov    ($num,$j);
-        &adc    ("edx",0);
-        &mov    ("eax",&DWP(4,$inp));                   # np[1]
-        &mov    ($j,1);
-&set_label("3rdmadd",16);
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # np[j]*m
-        &add    ($carry,&DWP($frame,"esp",$j,4));       # +=tp[j]
-        &adc    ("edx",0);
-        &add    ($carry,"eax");
-        &mov    ("eax",&DWP(4,$inp,$j,4));              # np[j+1]
-        &adc    ("edx",0);
-        &mov    (&DWP($frame-4,"esp",$j,4),$carry);     # tp[j-1]=
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # np[j+1]*m
-        &add    ($carry,&DWP($frame+4,"esp",$j,4));     # +=tp[j+1]
-        &lea    ($j,&DWP(2,$j));
-        &adc    ("edx",0);
-        &add    ($carry,"eax");
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # np[j+2]
-        &adc    ("edx",0);
-        &cmp    ($j,$num);
-        &mov    (&DWP($frame-8,"esp",$j,4),$carry);     # tp[j]=
-        &jl     (&label("3rdmadd"));
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # np[j]*m
-        &add    ($carry,&DWP($frame,"esp",$num,4));     # +=tp[num-1]
-        &adc    ("edx",0);
-        &add    ($carry,"eax");
-        &adc    ("edx",0);
-        &mov    (&DWP($frame-4,"esp",$num,4),$carry);   # tp[num-2]=
-        &mov    ($j,$_bp);                              # i
-        &xor    ("eax","eax");
-        &mov    ($inp,$_ap);
-        &add    ("edx",&DWP($frame+4,"esp",$num,4));    # carry+=tp[num]
-        &adc    ("eax",&DWP($frame+8,"esp",$num,4));    # +=tp[num+1]
-        &mov    (&DWP($frame,"esp",$num,4),"edx");      # tp[num-1]=
-        &cmp    ($j,$num);
-        &mov    (&DWP($frame+4,"esp",$num,4),"eax");    # tp[num]=
-        &je     (&label("common_tail"));
-        &mov    ($word,&DWP(4,$inp,$j,4));              # ap[i]
-        &lea    ($j,&DWP(1,$j));
-        &mov    ("eax",$word);
-        &mov    ($_bp,$j);                              # ++i
-        &mul    ($word);                                # ap[i]*ap[i]
-        &add    ("eax",&DWP($frame,"esp",$j,4));        # +=tp[i]
-        &adc    ("edx",0);
-        &mov    (&DWP($frame,"esp",$j,4),"eax");        # tp[i]=
-        &xor    ($carry,$carry);
-        &cmp    ($j,$num);
-        &lea    ($j,&DWP(1,$j));
-        &je     (&label("sqrlast"));
-        &mov    ($sbit,"edx");                          # zaps $num
-        &shr    ("edx",1);
-        &and    ($sbit,1);
-&set_label("sqradd",16);
-        &mov    ("eax",&DWP(0,$inp,$j,4));              # ap[j]
-        &mov    ($carry,"edx");
-        &mul    ($word);                                # ap[j]*ap[i]
-        &add    ("eax",$carry);
-        &lea    ($carry,&DWP(0,"eax","eax"));
-        &adc    ("edx",0);
-        &shr    ("eax",31);
-        &add    ($carry,&DWP($frame,"esp",$j,4));       # +=tp[j]
-        &lea    ($j,&DWP(1,$j));
-        &adc    ("eax",0);
-        &add    ($carry,$sbit);
-        &adc    ("eax",0);
-        &cmp    ($j,$_num);
-        &mov    (&DWP($frame-4,"esp",$j,4),$carry);     # tp[j]=
-        &mov    ($sbit,"eax");
-        &jle    (&label("sqradd"));
-        &mov    ($carry,"edx");
-        &lea    ("edx",&DWP(0,$sbit,"edx",2));
-        &shr    ($carry,31);
-&set_label("sqrlast");
-        &mov    ($word,$_n0);
-        &mov    ($inp,$_np);
-        &imul   ($word,&DWP($frame,"esp"));             # n0*tp[0]
-        &add    ("edx",&DWP($frame,"esp",$j,4));        # +=tp[num]
-        &mov    ("eax",&DWP(0,$inp));                   # np[0]
-        &adc    ($carry,0);
-        &mov    (&DWP($frame,"esp",$j,4),"edx");        # tp[num]=
-        &mov    (&DWP($frame+4,"esp",$j,4),$carry);     # tp[num+1]=
-        &mul    ($word);                                # np[0]*m
-        &add    ("eax",&DWP($frame,"esp"));             # +=tp[0]
-        &lea    ($num,&DWP(-1,$j));
-        &adc    ("edx",0);
-        &mov    ($j,1);
-        &mov    ("eax",&DWP(4,$inp));                   # np[1]
-        &jmp    (&label("3rdmadd"));
-}
-&set_label("common_tail",16);
-        &mov    ($np,$_np);                     # load modulus pointer
-        &mov    ($rp,$_rp);                     # load result pointer
-        &lea    ($tp,&DWP($frame,"esp"));       # [$ap and $bp are zapped]
-        &mov    ("eax",&DWP(0,$tp));            # tp[0]
-        &mov    ($j,$num);                      # j=num-1
-        &xor    ($i,$i);                        # i=0 and clear CF!
-&set_label("sub",16);
-        &sbb    ("eax",&DWP(0,$np,$i,4));
-        &mov    (&DWP(0,$rp,$i,4),"eax");       # rp[i]=tp[i]-np[i]
-        &dec    ($j);                           # doesn't affect CF!
-        &mov    ("eax",&DWP(4,$tp,$i,4));       # tp[i+1]
-        &lea    ($i,&DWP(1,$i));                # i++
-        &jge    (&label("sub"));
-        &sbb    ("eax",0);                      # handle upmost overflow bit
-        &and    ($tp,"eax");
-        &not    ("eax");
-        &mov    ($np,$rp);
-        &and    ($np,"eax");
-        &or     ($tp,$np);                      # tp=carry?tp:rp
-&set_label("copy",16);                          # copy or in-place refresh
-        &mov    ("eax",&DWP(0,$tp,$num,4));
-        &mov    (&DWP(0,$rp,$num,4),"eax");     # rp[i]=tp[i]
-        &mov    (&DWP($frame,"esp",$num,4),$j); # zap temporary vector
-        &dec    ($num);
-        &jge    (&label("copy"));
-        &mov    ("esp",$_sp);           # pull saved stack pointer
-        &mov    ("eax",1);
-&set_label("just_leave");
-&function_end("bn_mul_mont");
-&asciz("Montgomery Multiplication for x86, CRYPTOGAMS by <appro\@openssl.org>");
-&asm_finish();
diff --git a/src/lib/libcrypto/bn/asm/x86.pl b/src/lib/libcrypto/bn/asm/x86.pl
deleted file mode 100644
index 1bc4f1bb27..0000000000
--- a/src/lib/libcrypto/bn/asm/x86.pl
+++ /dev/null
@@ -1,28 +0,0 @@
-#!/usr/local/bin/perl
-push(@INC,"perlasm","../../perlasm");
-require "x86asm.pl";
-require("x86/mul_add.pl");
-require("x86/mul.pl");
-require("x86/sqr.pl");
-require("x86/div.pl");
-require("x86/add.pl");
-require("x86/sub.pl");
-require("x86/comba.pl");
-&asm_init($ARGV[0],$0);
-&bn_mul_add_words("bn_mul_add_words");
-&bn_mul_words("bn_mul_words");
-&bn_sqr_words("bn_sqr_words");
-&bn_div_words("bn_div_words");
-&bn_add_words("bn_add_words");
-&bn_sub_words("bn_sub_words");
-&bn_mul_comba("bn_mul_comba8",8);
-&bn_mul_comba("bn_mul_comba4",4);
-&bn_sqr_comba("bn_sqr_comba8",8);
-&bn_sqr_comba("bn_sqr_comba4",4);
-&asm_finish();
diff --git a/src/lib/libcrypto/bn/asm/x86/add.pl b/src/lib/libcrypto/bn/asm/x86/add.pl
deleted file mode 100644
index 0b5cf583e3..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/add.pl
+++ /dev/null
@@ -1,76 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub bn_add_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $a="esi";
-        $b="edi";
-        $c="eax";
-        $r="ebx";
-        $tmp1="ecx";
-        $tmp2="edx";
-        $num="ebp";
-        &mov($r,&wparam(0));    # get r
-         &mov($a,&wparam(1));   # get a
-        &mov($b,&wparam(2));    # get b
-         &mov($num,&wparam(3)); # get num
-        &xor($c,$c);            # clear carry
-         &and($num,0xfffffff8); # num / 8
-        &jz(&label("aw_finish"));
-        &set_label("aw_loop",0);
-        for ($i=0; $i<8; $i++)
-                {
-                &comment("Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0));         # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));        # *b
-                &add($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &add($tmp1,$tmp2);
-                &adc($c,0);
-                 &mov(&DWP($i*4,$r,"",0),$tmp1);        # *r
-                }
-        &comment("");
-        &add($a,32);
-         &add($b,32);
-        &add($r,32);
-         &sub($num,8);
-        &jnz(&label("aw_loop"));
-        &set_label("aw_finish",0);
-        &mov($num,&wparam(3));  # get num
-        &and($num,7);
-         &jz(&label("aw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0)); # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));# *b
-                &add($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &add($tmp1,$tmp2);
-                &adc($c,0);
-                 &dec($num) if ($i != 6);
-                &mov(&DWP($i*4,$r,"",0),$tmp1); # *a
-                 &jz(&label("aw_end")) if ($i != 6);
-                }
-        &set_label("aw_end",0);
-#       &mov("eax",$c);         # $c is "eax"
-        &function_end($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86/comba.pl b/src/lib/libcrypto/bn/asm/x86/comba.pl
deleted file mode 100644
index 2291253629..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/comba.pl
+++ /dev/null
@@ -1,277 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub mul_add_c
-        {
-        local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
-        # pos == -1 if eax and edx are pre-loaded, 0 to load from next
-        # words, and 1 if load return value
-        &comment("mul a[$ai]*b[$bi]");
-        # "eax" and "edx" will always be pre-loaded.
-        # &mov("eax",&DWP($ai*4,$a,"",0)) ;
-        # &mov("edx",&DWP($bi*4,$b,"",0));
-        &mul("edx");
-        &add($c0,"eax");
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 0;        # laod next a
-         &mov("eax",&wparam(0)) if $pos > 0;                    # load r[]
-         ###
-        &adc($c1,"edx");
-         &mov("edx",&DWP(($nb)*4,$b,"",0)) if $pos == 0;        # laod next b
-         &mov("edx",&DWP(($nb)*4,$b,"",0)) if $pos == 1;        # laod next b
-         ###
-        &adc($c2,0);
-         # is pos > 1, it means it is the last loop 
-         &mov(&DWP($i*4,"eax","",0),$c0) if $pos > 0;           # save r[];
-        &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 1;         # laod next a
-        }
-sub sqr_add_c
-        {
-        local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
-        # pos == -1 if eax and edx are pre-loaded, 0 to load from next
-        # words, and 1 if load return value
-        &comment("sqr a[$ai]*a[$bi]");
-        # "eax" and "edx" will always be pre-loaded.
-        # &mov("eax",&DWP($ai*4,$a,"",0)) ;
-        # &mov("edx",&DWP($bi*4,$b,"",0));
-        if ($ai == $bi)
-                { &mul("eax");}
-        else
-                { &mul("edx");}
-        &add($c0,"eax");
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 0;        # load next a
-         ###
-        &adc($c1,"edx");
-         &mov("edx",&DWP(($nb)*4,$a,"",0)) if ($pos == 1) && ($na != $nb);
-         ###
-        &adc($c2,0);
-         # is pos > 1, it means it is the last loop 
-         &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0;              # save r[];
-        &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 1;         # load next b
-        }
-sub sqr_add_c2
-        {
-        local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
-        # pos == -1 if eax and edx are pre-loaded, 0 to load from next
-        # words, and 1 if load return value
-        &comment("sqr a[$ai]*a[$bi]");
-        # "eax" and "edx" will always be pre-loaded.
-        # &mov("eax",&DWP($ai*4,$a,"",0)) ;
-        # &mov("edx",&DWP($bi*4,$a,"",0));
-        if ($ai == $bi)
-                { &mul("eax");}
-        else
-                { &mul("edx");}
-        &add("eax","eax");
-         ###
-        &adc("edx","edx");
-         ###
-        &adc($c2,0);
-         &add($c0,"eax");
-        &adc($c1,"edx");
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 0;        # load next a
-         &mov("eax",&DWP(($na)*4,$a,"",0)) if $pos == 1;        # load next b
-        &adc($c2,0);
-        &mov(&DWP($i*4,$r,"",0),$c0) if $pos > 0;               # save r[];
-         &mov("edx",&DWP(($nb)*4,$a,"",0)) if ($pos <= 1) && ($na != $nb);
-         ###
-        }
-sub bn_mul_comba
-        {
-        local($name,$num)=@_;
-        local($a,$b,$c0,$c1,$c2);
-        local($i,$as,$ae,$bs,$be,$ai,$bi);
-        local($tot,$end);
-        &function_begin_B($name,"");
-        $c0="ebx";
-        $c1="ecx";
-        $c2="ebp";
-        $a="esi";
-        $b="edi";
-        
-        $as=0;
-        $ae=0;
-        $bs=0;
-        $be=0;
-        $tot=$num+$num-1;
-        &push("esi");
-         &mov($a,&wparam(1));
-        &push("edi");
-         &mov($b,&wparam(2));
-        &push("ebp");
-         &push("ebx");
-        &xor($c0,$c0);
-         &mov("eax",&DWP(0,$a,"",0));   # load the first word 
-        &xor($c1,$c1);
-         &mov("edx",&DWP(0,$b,"",0));   # load the first second 
-        for ($i=0; $i<$tot; $i++)
-                {
-                $ai=$as;
-                $bi=$bs;
-                $end=$be+1;
-                &comment("################## Calculate word $i"); 
-                for ($j=$bs; $j<$end; $j++)
-                        {
-                        &xor($c2,$c2) if ($j == $bs);
-                        if (($j+1) == $end)
-                                {
-                                $v=1;
-                                $v=2 if (($i+1) == $tot);
-                                }
-                        else
-                                { $v=0; }
-                        if (($j+1) != $end)
-                                {
-                                $na=($ai-1);
-                                $nb=($bi+1);
-                                }
-                        else
-                                {
-                                $na=$as+($i < ($num-1));
-                                $nb=$bs+($i >= ($num-1));
-                                }
-#printf STDERR "[$ai,$bi] -> [$na,$nb]\n";
-                        &mul_add_c($a,$ai,$b,$bi,$c0,$c1,$c2,$v,$i,$na,$nb);
-                        if ($v)
-                                {
-                                &comment("saved r[$i]");
-                                # &mov("eax",&wparam(0));
-                                # &mov(&DWP($i*4,"eax","",0),$c0);
-                                ($c0,$c1,$c2)=($c1,$c2,$c0);
-                                }
-                        $ai--;
-                        $bi++;
-                        }
-                $as++ if ($i < ($num-1));
-                $ae++ if ($i >= ($num-1));
-                $bs++ if ($i >= ($num-1));
-                $be++ if ($i < ($num-1));
-                }
-        &comment("save r[$i]");
-        # &mov("eax",&wparam(0));
-        &mov(&DWP($i*4,"eax","",0),$c0);
-        &pop("ebx");
-        &pop("ebp");
-        &pop("edi");
-        &pop("esi");
-        &ret();
-        &function_end_B($name);
-        }
-sub bn_sqr_comba
-        {
-        local($name,$num)=@_;
-        local($r,$a,$c0,$c1,$c2)=@_;
-        local($i,$as,$ae,$bs,$be,$ai,$bi);
-        local($b,$tot,$end,$half);
-        &function_begin_B($name,"");
-        $c0="ebx";
-        $c1="ecx";
-        $c2="ebp";
-        $a="esi";
-        $r="edi";
-        &push("esi");
-         &push("edi");
-        &push("ebp");
-         &push("ebx");
-        &mov($r,&wparam(0));
-         &mov($a,&wparam(1));
-        &xor($c0,$c0);
-         &xor($c1,$c1);
-        &mov("eax",&DWP(0,$a,"",0)); # load the first word
-        $as=0;
-        $ae=0;
-        $bs=0;
-        $be=0;
-        $tot=$num+$num-1;
-        for ($i=0; $i<$tot; $i++)
-                {
-                $ai=$as;
-                $bi=$bs;
-                $end=$be+1;
-                &comment("############### Calculate word $i");
-                for ($j=$bs; $j<$end; $j++)
-                        {
-                        &xor($c2,$c2) if ($j == $bs);
-                        if (($ai-1) < ($bi+1))
-                                {
-                                $v=1;
-                                $v=2 if ($i+1) == $tot;
-                                }
-                        else
-                                { $v=0; }
-                        if (!$v)
-                                {
-                                $na=$ai-1;
-                                $nb=$bi+1;
-                                }
-                        else
-                                {
-                                $na=$as+($i < ($num-1));
-                                $nb=$bs+($i >= ($num-1));
-                                }
-                        if ($ai == $bi)
-                                {
-                                &sqr_add_c($r,$a,$ai,$bi,
-                                        $c0,$c1,$c2,$v,$i,$na,$nb);
-                                }
-                        else
-                                {
-                                &sqr_add_c2($r,$a,$ai,$bi,
-                                        $c0,$c1,$c2,$v,$i,$na,$nb);
-                                }
-                        if ($v)
-                                {
-                                &comment("saved r[$i]");
-                                #&mov(&DWP($i*4,$r,"",0),$c0);
-                                ($c0,$c1,$c2)=($c1,$c2,$c0);
-                                last;
-                                }
-                        $ai--;
-                        $bi++;
-                        }
-                $as++ if ($i < ($num-1));
-                $ae++ if ($i >= ($num-1));
-                $bs++ if ($i >= ($num-1));
-                $be++ if ($i < ($num-1));
-                }
-        &mov(&DWP($i*4,$r,"",0),$c0);
-        &pop("ebx");
-        &pop("ebp");
-        &pop("edi");
-        &pop("esi");
-        &ret();
-        &function_end_B($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86/div.pl b/src/lib/libcrypto/bn/asm/x86/div.pl
deleted file mode 100644
index 0e90152caa..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/div.pl
+++ /dev/null
@@ -1,15 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub bn_div_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &mov("edx",&wparam(0)); #
-        &mov("eax",&wparam(1)); #
-        &mov("ebx",&wparam(2)); #
-        &div("ebx");
-        &function_end($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86/mul.pl b/src/lib/libcrypto/bn/asm/x86/mul.pl
deleted file mode 100644
index 674cb9b055..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/mul.pl
+++ /dev/null
@@ -1,77 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub bn_mul_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $Low="eax";
-        $High="edx";
-        $a="ebx";
-        $w="ecx";
-        $r="edi";
-        $c="esi";
-        $num="ebp";
-        &xor($c,$c);            # clear carry
-        &mov($r,&wparam(0));    #
-        &mov($a,&wparam(1));    #
-        &mov($num,&wparam(2));  #
-        &mov($w,&wparam(3));    #
-        &and($num,0xfffffff8);  # num / 8
-        &jz(&label("mw_finish"));
-        &set_label("mw_loop",0);
-        for ($i=0; $i<32; $i+=4)
-                {
-                &comment("Round $i");
-                 &mov("eax",&DWP($i,$a,"",0));  # *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);                 # L(t)+=c
-                 # XXX
-                &adc("edx",0);                  # H(t)+=carry
-                 &mov(&DWP($i,$r,"",0),"eax");  # *r= L(t);
-                &mov($c,"edx");                 # c=  H(t);
-                }
-        &comment("");
-        &add($a,32);
-        &add($r,32);
-        &sub($num,8);
-        &jz(&label("mw_finish"));
-        &jmp(&label("mw_loop"));
-        &set_label("mw_finish",0);
-        &mov($num,&wparam(2));  # get num
-        &and($num,7);
-        &jnz(&label("mw_finish2"));
-        &jmp(&label("mw_end"));
-        &set_label("mw_finish2",1);
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                 &mov("eax",&DWP($i*4,$a,"",0));# *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);                 # L(t)+=c
-                 # XXX
-                &adc("edx",0);                  # H(t)+=carry
-                 &mov(&DWP($i*4,$r,"",0),"eax");# *r= L(t);
-                &mov($c,"edx");                 # c=  H(t);
-                 &dec($num) if ($i != 7-1);
-                &jz(&label("mw_end")) if ($i != 7-1);
-                }
-        &set_label("mw_end",0);
-        &mov("eax",$c);
-        &function_end($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86/mul_add.pl b/src/lib/libcrypto/bn/asm/x86/mul_add.pl
deleted file mode 100644
index 61830d3a90..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/mul_add.pl
+++ /dev/null
@@ -1,87 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub bn_mul_add_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $Low="eax";
-        $High="edx";
-        $a="ebx";
-        $w="ebp";
-        $r="edi";
-        $c="esi";
-        &xor($c,$c);            # clear carry
-        &mov($r,&wparam(0));    #
-        &mov("ecx",&wparam(2)); #
-        &mov($a,&wparam(1));    #
-        &and("ecx",0xfffffff8); # num / 8
-        &mov($w,&wparam(3));    #
-        &push("ecx");           # Up the stack for a tmp variable
-        &jz(&label("maw_finish"));
-        &set_label("maw_loop",0);
-        &mov(&swtmp(0),"ecx");  #
-        for ($i=0; $i<32; $i+=4)
-                {
-                &comment("Round $i");
-                 &mov("eax",&DWP($i,$a,"",0));  # *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);         # L(t)+= *r
-                 &mov($c,&DWP($i,$r,"",0));     # L(t)+= *r
-                &adc("edx",0);                  # H(t)+=carry
-                 &add("eax",$c);                # L(t)+=c
-                &adc("edx",0);                  # H(t)+=carry
-                 &mov(&DWP($i,$r,"",0),"eax");  # *r= L(t);
-                &mov($c,"edx");                 # c=  H(t);
-                }
-        &comment("");
-        &mov("ecx",&swtmp(0));  #
-        &add($a,32);
-        &add($r,32);
-        &sub("ecx",8);
-        &jnz(&label("maw_loop"));
-        &set_label("maw_finish",0);
-        &mov("ecx",&wparam(2)); # get num
-        &and("ecx",7);
-        &jnz(&label("maw_finish2"));    # helps branch prediction
-        &jmp(&label("maw_end"));
-        &set_label("maw_finish2",1);
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                 &mov("eax",&DWP($i*4,$a,"",0));# *a
-                &mul($w);                       # *a * w
-                &add("eax",$c);                 # L(t)+=c
-                 &mov($c,&DWP($i*4,$r,"",0));   # L(t)+= *r
-                &adc("edx",0);                  # H(t)+=carry
-                 &add("eax",$c);
-                &adc("edx",0);                  # H(t)+=carry
-                 &dec("ecx") if ($i != 7-1);
-                &mov(&DWP($i*4,$r,"",0),"eax"); # *r= L(t);
-                 &mov($c,"edx");                        # c=  H(t);
-                &jz(&label("maw_end")) if ($i != 7-1);
-                }
-        &set_label("maw_end",0);
-        &mov("eax",$c);
-        &pop("ecx");    # clear variable from
-        &function_end($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86/sqr.pl b/src/lib/libcrypto/bn/asm/x86/sqr.pl
deleted file mode 100644
index 1f90993cf6..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/sqr.pl
+++ /dev/null
@@ -1,60 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub bn_sqr_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $r="esi";
-        $a="edi";
-        $num="ebx";
-        &mov($r,&wparam(0));    #
-        &mov($a,&wparam(1));    #
-        &mov($num,&wparam(2));  #
-        &and($num,0xfffffff8);  # num / 8
-        &jz(&label("sw_finish"));
-        &set_label("sw_loop",0);
-        for ($i=0; $i<32; $i+=4)
-                {
-                &comment("Round $i");
-                &mov("eax",&DWP($i,$a,"",0));   # *a
-                 # XXX
-                &mul("eax");                    # *a * *a
-                &mov(&DWP($i*2,$r,"",0),"eax"); #
-                 &mov(&DWP($i*2+4,$r,"",0),"edx");#
-                }
-        &comment("");
-        &add($a,32);
-        &add($r,64);
-        &sub($num,8);
-        &jnz(&label("sw_loop"));
-        &set_label("sw_finish",0);
-        &mov($num,&wparam(2));  # get num
-        &and($num,7);
-        &jz(&label("sw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov("eax",&DWP($i*4,$a,"",0)); # *a
-                 # XXX
-                &mul("eax");                    # *a * *a
-                &mov(&DWP($i*8,$r,"",0),"eax"); #
-                 &dec($num) if ($i != 7-1);
-                &mov(&DWP($i*8+4,$r,"",0),"edx");
-                 &jz(&label("sw_end")) if ($i != 7-1);
-                }
-        &set_label("sw_end",0);
-        &function_end($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86/sub.pl b/src/lib/libcrypto/bn/asm/x86/sub.pl
deleted file mode 100644
index 837b0e1b07..0000000000
--- a/src/lib/libcrypto/bn/asm/x86/sub.pl
+++ /dev/null
@@ -1,76 +0,0 @@
-#!/usr/local/bin/perl
-# x86 assember
-sub bn_sub_words
-        {
-        local($name)=@_;
-        &function_begin($name,"");
-        &comment("");
-        $a="esi";
-        $b="edi";
-        $c="eax";
-        $r="ebx";
-        $tmp1="ecx";
-        $tmp2="edx";
-        $num="ebp";
-        &mov($r,&wparam(0));    # get r
-         &mov($a,&wparam(1));   # get a
-        &mov($b,&wparam(2));    # get b
-         &mov($num,&wparam(3)); # get num
-        &xor($c,$c);            # clear carry
-         &and($num,0xfffffff8); # num / 8
-        &jz(&label("aw_finish"));
-        &set_label("aw_loop",0);
-        for ($i=0; $i<8; $i++)
-                {
-                &comment("Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0));         # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));        # *b
-                &sub($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &sub($tmp1,$tmp2);
-                &adc($c,0);
-                 &mov(&DWP($i*4,$r,"",0),$tmp1);        # *r
-                }
-        &comment("");
-        &add($a,32);
-         &add($b,32);
-        &add($r,32);
-         &sub($num,8);
-        &jnz(&label("aw_loop"));
-        &set_label("aw_finish",0);
-        &mov($num,&wparam(3));  # get num
-        &and($num,7);
-         &jz(&label("aw_end"));
-        for ($i=0; $i<7; $i++)
-                {
-                &comment("Tail Round $i");
-                &mov($tmp1,&DWP($i*4,$a,"",0)); # *a
-                 &mov($tmp2,&DWP($i*4,$b,"",0));# *b
-                &sub($tmp1,$c);
-                 &mov($c,0);
-                &adc($c,$c);
-                 &sub($tmp1,$tmp2);
-                &adc($c,0);
-                 &dec($num) if ($i != 6);
-                &mov(&DWP($i*4,$r,"",0),$tmp1); # *a
-                 &jz(&label("aw_end")) if ($i != 6);
-                }
-        &set_label("aw_end",0);
-#       &mov("eax",$c);         # $c is "eax"
-        &function_end($name);
-        }
-1;
diff --git a/src/lib/libcrypto/bn/asm/x86_64-gcc.c b/src/lib/libcrypto/bn/asm/x86_64-gcc.c
deleted file mode 100644
index f13f52dd85..0000000000
--- a/src/lib/libcrypto/bn/asm/x86_64-gcc.c
+++ /dev/null
@@ -1,597 +0,0 @@
-#ifdef __SUNPRO_C
-# include "../bn_asm.c" /* kind of dirty hack for Sun Studio */
-#else
-/*
- * x86_64 BIGNUM accelerator version 0.1, December 2002.
- *
- * Implemented by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
- * project.
- *
- * Rights for redistribution and usage in source and binary forms are
- * granted according to the OpenSSL license. Warranty of any kind is
- * disclaimed.
- *
- * Q. Version 0.1? It doesn't sound like Andy, he used to assign real
- *    versions, like 1.0...
- * A. Well, that's because this code is basically a quick-n-dirty
- *    proof-of-concept hack. As you can see it's implemented with
- *    inline assembler, which means that you're bound to GCC and that
- *    there might be enough room for further improvement.
- *
- * Q. Why inline assembler?
- * A. x86_64 features own ABI which I'm not familiar with. This is
- *    why I decided to let the compiler take care of subroutine
- *    prologue/epilogue as well as register allocation. For reference.
- *    Win64 implements different ABI for AMD64, different from Linux.
- *
- * Q. How much faster does it get?
- * A. 'apps/openssl speed rsa dsa' output with no-asm:
- *
- *                        sign    verify    sign/s verify/s
- *      rsa  512 bits   0.0006s   0.0001s   1683.8  18456.2
- *      rsa 1024 bits   0.0028s   0.0002s    356.0   6407.0
- *      rsa 2048 bits   0.0172s   0.0005s     58.0   1957.8
- *      rsa 4096 bits   0.1155s   0.0018s      8.7    555.6
- *                        sign    verify    sign/s verify/s
- *      dsa  512 bits   0.0005s   0.0006s   2100.8   1768.3
- *      dsa 1024 bits   0.0014s   0.0018s    692.3    559.2
- *      dsa 2048 bits   0.0049s   0.0061s    204.7    165.0
- *
- *    'apps/openssl speed rsa dsa' output with this module:
- *
- *                        sign    verify    sign/s verify/s
- *      rsa  512 bits   0.0004s   0.0000s   2767.1  33297.9
- *      rsa 1024 bits   0.0012s   0.0001s    867.4  14674.7
- *      rsa 2048 bits   0.0061s   0.0002s    164.0   5270.0
- *      rsa 4096 bits   0.0384s   0.0006s     26.1   1650.8
- *                        sign    verify    sign/s verify/s
- *      dsa  512 bits   0.0002s   0.0003s   4442.2   3786.3
- *      dsa 1024 bits   0.0005s   0.0007s   1835.1   1497.4
- *      dsa 2048 bits   0.0016s   0.0020s    620.4    504.6
- *
- *    For the reference. IA-32 assembler implementation performs
- *    very much like 64-bit code compiled with no-asm on the same
- *    machine.
- */
-#define BN_ULONG unsigned long
-/*
- * "m"(a), "+m"(r)      is the way to favor DirectPath �-code;
- * "g"(0)               let the compiler to decide where does it
- *                      want to keep the value of zero;
- */
-#define mul_add(r,a,word,carry) do {    \
-        register BN_ULONG high,low;     \
-        asm ("mulq %3"                  \
-                : "=a"(low),"=d"(high)  \
-                : "a"(word),"m"(a)      \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(carry),"+d"(high)\
-                : "a"(low),"g"(0)       \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+m"(r),"+d"(high)    \
-                : "r"(carry),"g"(0)     \
-                : "cc");                \
-        carry=high;                     \
-        } while (0)
-#define mul(r,a,word,carry) do {        \
-        register BN_ULONG high,low;     \
-        asm ("mulq %3"                  \
-                : "=a"(low),"=d"(high)  \
-                : "a"(word),"g"(a)      \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(carry),"+d"(high)\
-                : "a"(low),"g"(0)       \
-                : "cc");                \
-        (r)=carry, carry=high;          \
-        } while (0)
-#define sqr(r0,r1,a)                    \
-        asm ("mulq %2"                  \
-                : "=a"(r0),"=d"(r1)     \
-                : "a"(a)                \
-                : "cc");
-BN_ULONG bn_mul_add_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-        {
-        BN_ULONG c1=0;
-        if (num <= 0) return(c1);
-        while (num&~3)
-                {
-                mul_add(rp[0],ap[0],w,c1);
-                mul_add(rp[1],ap[1],w,c1);
-                mul_add(rp[2],ap[2],w,c1);
-                mul_add(rp[3],ap[3],w,c1);
-                ap+=4; rp+=4; num-=4;
-                }
-        if (num)
-                {
-                mul_add(rp[0],ap[0],w,c1); if (--num==0) return c1;
-                mul_add(rp[1],ap[1],w,c1); if (--num==0) return c1;
-                mul_add(rp[2],ap[2],w,c1); return c1;
-                }
-        
-        return(c1);
-        } 
-BN_ULONG bn_mul_words(BN_ULONG *rp, BN_ULONG *ap, int num, BN_ULONG w)
-        {
-        BN_ULONG c1=0;
-        if (num <= 0) return(c1);
-        while (num&~3)
-                {
-                mul(rp[0],ap[0],w,c1);
-                mul(rp[1],ap[1],w,c1);
-                mul(rp[2],ap[2],w,c1);
-                mul(rp[3],ap[3],w,c1);
-                ap+=4; rp+=4; num-=4;
-                }
-        if (num)
-                {
-                mul(rp[0],ap[0],w,c1); if (--num == 0) return c1;
-                mul(rp[1],ap[1],w,c1); if (--num == 0) return c1;
-                mul(rp[2],ap[2],w,c1);
-                }
-        return(c1);
-        } 
-void bn_sqr_words(BN_ULONG *r, BN_ULONG *a, int n)
-        {
-        if (n <= 0) return;
-        while (n&~3)
-                {
-                sqr(r[0],r[1],a[0]);
-                sqr(r[2],r[3],a[1]);
-                sqr(r[4],r[5],a[2]);
-                sqr(r[6],r[7],a[3]);
-                a+=4; r+=8; n-=4;
-                }
-        if (n)
-                {
-                sqr(r[0],r[1],a[0]); if (--n == 0) return;
-                sqr(r[2],r[3],a[1]); if (--n == 0) return;
-                sqr(r[4],r[5],a[2]);
-                }
-        }
-BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
-{       BN_ULONG ret,waste;
-        asm ("divq      %4"
-                : "=a"(ret),"=d"(waste)
-                : "a"(l),"d"(h),"g"(d)
-                : "cc");
-        return ret;
-}
-BN_ULONG bn_add_words (BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int n)
-{ BN_ULONG ret=0,i=0;
-        if (n <= 0) return 0;
-        asm (
-        "       subq    %2,%2           \n"
-        ".align 16                      \n"
-        "1:     movq    (%4,%2,8),%0    \n"
-        "       adcq    (%5,%2,8),%0    \n"
-        "       movq    %0,(%3,%2,8)    \n"
-        "       leaq    1(%2),%2        \n"
-        "       loop    1b              \n"
-        "       sbbq    %0,%0           \n"
-                : "=&a"(ret),"+c"(n),"=&r"(i)
-                : "r"(rp),"r"(ap),"r"(bp)
-                : "cc"
-        );
-  return ret&1;
-}
-#ifndef SIMICS
-BN_ULONG bn_sub_words (BN_ULONG *rp, BN_ULONG *ap, BN_ULONG *bp,int n)
-{ BN_ULONG ret=0,i=0;
-        if (n <= 0) return 0;
-        asm (
-        "       subq    %2,%2           \n"
-        ".align 16                      \n"
-        "1:     movq    (%4,%2,8),%0    \n"
-        "       sbbq    (%5,%2,8),%0    \n"
-        "       movq    %0,(%3,%2,8)    \n"
-        "       leaq    1(%2),%2        \n"
-        "       loop    1b              \n"
-        "       sbbq    %0,%0           \n"
-                : "=&a"(ret),"+c"(n),"=&r"(i)
-                : "r"(rp),"r"(ap),"r"(bp)
-                : "cc"
-        );
-  return ret&1;
-}
-#else
-/* Simics 1.4<7 has buggy sbbq:-( */
-#define BN_MASK2 0xffffffffffffffffL
-BN_ULONG bn_sub_words(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-        {
-        BN_ULONG t1,t2;
-        int c=0;
-        if (n <= 0) return((BN_ULONG)0);
-        for (;;)
-                {
-                t1=a[0]; t2=b[0];
-                r[0]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                t1=a[1]; t2=b[1];
-                r[1]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                t1=a[2]; t2=b[2];
-                r[2]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                t1=a[3]; t2=b[3];
-                r[3]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                a+=4;
-                b+=4;
-                r+=4;
-                }
-        return(c);
-        }
-#endif
-/* mul_add_c(a,b,c0,c1,c2)  -- c+=a*b for three word number c=(c2,c1,c0) */
-/* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
-/* sqr_add_c(a,i,c0,c1,c2)  -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
-/* sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number c=(c2,c1,c0) */
-#if 0
-/* original macros are kept for reference purposes */
-#define mul_add_c(a,b,c0,c1,c2) {       \
-        BN_ULONG ta=(a),tb=(b);         \
-        t1 = ta * tb;                   \
-        t2 = BN_UMULT_HIGH(ta,tb);      \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define mul_add_c2(a,b,c0,c1,c2) {      \
-        BN_ULONG ta=(a),tb=(b),t0;      \
-        t1 = BN_UMULT_HIGH(ta,tb);      \
-        t0 = ta * tb;                   \
-        t2 = t1+t1; c2 += (t2<t1)?1:0;  \
-        t1 = t0+t0; t2 += (t1<t0)?1:0;  \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#else
-#define mul_add_c(a,b,c0,c1,c2) do {    \
-        asm ("mulq %3"                  \
-                : "=a"(t1),"=d"(t2)     \
-                : "a"(a),"m"(b)         \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(c0),"+d"(t2)     \
-                : "a"(t1),"g"(0)        \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(c1),"+r"(c2)     \
-                : "d"(t2),"g"(0)        \
-                : "cc");                \
-        } while (0)
-#define sqr_add_c(a,i,c0,c1,c2) do {    \
-        asm ("mulq %2"                  \
-                : "=a"(t1),"=d"(t2)     \
-                : "a"(a[i])             \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(c0),"+d"(t2)     \
-                : "a"(t1),"g"(0)        \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(c1),"+r"(c2)     \
-                : "d"(t2),"g"(0)        \
-                : "cc");                \
-        } while (0)
-#define mul_add_c2(a,b,c0,c1,c2) do {   \
-        asm ("mulq %3"                  \
-                : "=a"(t1),"=d"(t2)     \
-                : "a"(a),"m"(b)         \
-                : "cc");                \
-        asm ("addq %0,%0; adcq %2,%1"   \
-                : "+d"(t2),"+r"(c2)     \
-                : "g"(0)                \
-                : "cc");                \
-        asm ("addq %0,%0; adcq %2,%1"   \
-                : "+a"(t1),"+d"(t2)     \
-                : "g"(0)                \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(c0),"+d"(t2)     \
-                : "a"(t1),"g"(0)        \
-                : "cc");                \
-        asm ("addq %2,%0; adcq %3,%1"   \
-                : "+r"(c1),"+r"(c2)     \
-                : "d"(t2),"g"(0)        \
-                : "cc");                \
-        } while (0)
-#endif
-#define sqr_add_c2(a,i,j,c0,c1,c2)      \
-        mul_add_c2((a)[i],(a)[j],c0,c1,c2)
-void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-        {
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        mul_add_c(a[0],b[0],c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        mul_add_c(a[0],b[1],c2,c3,c1);
-        mul_add_c(a[1],b[0],c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        mul_add_c(a[2],b[0],c3,c1,c2);
-        mul_add_c(a[1],b[1],c3,c1,c2);
-        mul_add_c(a[0],b[2],c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        mul_add_c(a[0],b[3],c1,c2,c3);
-        mul_add_c(a[1],b[2],c1,c2,c3);
-        mul_add_c(a[2],b[1],c1,c2,c3);
-        mul_add_c(a[3],b[0],c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        mul_add_c(a[4],b[0],c2,c3,c1);
-        mul_add_c(a[3],b[1],c2,c3,c1);
-        mul_add_c(a[2],b[2],c2,c3,c1);
-        mul_add_c(a[1],b[3],c2,c3,c1);
-        mul_add_c(a[0],b[4],c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        mul_add_c(a[0],b[5],c3,c1,c2);
-        mul_add_c(a[1],b[4],c3,c1,c2);
-        mul_add_c(a[2],b[3],c3,c1,c2);
-        mul_add_c(a[3],b[2],c3,c1,c2);
-        mul_add_c(a[4],b[1],c3,c1,c2);
-        mul_add_c(a[5],b[0],c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        mul_add_c(a[6],b[0],c1,c2,c3);
-        mul_add_c(a[5],b[1],c1,c2,c3);
-        mul_add_c(a[4],b[2],c1,c2,c3);
-        mul_add_c(a[3],b[3],c1,c2,c3);
-        mul_add_c(a[2],b[4],c1,c2,c3);
-        mul_add_c(a[1],b[5],c1,c2,c3);
-        mul_add_c(a[0],b[6],c1,c2,c3);
-        r[6]=c1;
-        c1=0;
-        mul_add_c(a[0],b[7],c2,c3,c1);
-        mul_add_c(a[1],b[6],c2,c3,c1);
-        mul_add_c(a[2],b[5],c2,c3,c1);
-        mul_add_c(a[3],b[4],c2,c3,c1);
-        mul_add_c(a[4],b[3],c2,c3,c1);
-        mul_add_c(a[5],b[2],c2,c3,c1);
-        mul_add_c(a[6],b[1],c2,c3,c1);
-        mul_add_c(a[7],b[0],c2,c3,c1);
-        r[7]=c2;
-        c2=0;
-        mul_add_c(a[7],b[1],c3,c1,c2);
-        mul_add_c(a[6],b[2],c3,c1,c2);
-        mul_add_c(a[5],b[3],c3,c1,c2);
-        mul_add_c(a[4],b[4],c3,c1,c2);
-        mul_add_c(a[3],b[5],c3,c1,c2);
-        mul_add_c(a[2],b[6],c3,c1,c2);
-        mul_add_c(a[1],b[7],c3,c1,c2);
-        r[8]=c3;
-        c3=0;
-        mul_add_c(a[2],b[7],c1,c2,c3);
-        mul_add_c(a[3],b[6],c1,c2,c3);
-        mul_add_c(a[4],b[5],c1,c2,c3);
-        mul_add_c(a[5],b[4],c1,c2,c3);
-        mul_add_c(a[6],b[3],c1,c2,c3);
-        mul_add_c(a[7],b[2],c1,c2,c3);
-        r[9]=c1;
-        c1=0;
-        mul_add_c(a[7],b[3],c2,c3,c1);
-        mul_add_c(a[6],b[4],c2,c3,c1);
-        mul_add_c(a[5],b[5],c2,c3,c1);
-        mul_add_c(a[4],b[6],c2,c3,c1);
-        mul_add_c(a[3],b[7],c2,c3,c1);
-        r[10]=c2;
-        c2=0;
-        mul_add_c(a[4],b[7],c3,c1,c2);
-        mul_add_c(a[5],b[6],c3,c1,c2);
-        mul_add_c(a[6],b[5],c3,c1,c2);
-        mul_add_c(a[7],b[4],c3,c1,c2);
-        r[11]=c3;
-        c3=0;
-        mul_add_c(a[7],b[5],c1,c2,c3);
-        mul_add_c(a[6],b[6],c1,c2,c3);
-        mul_add_c(a[5],b[7],c1,c2,c3);
-        r[12]=c1;
-        c1=0;
-        mul_add_c(a[6],b[7],c2,c3,c1);
-        mul_add_c(a[7],b[6],c2,c3,c1);
-        r[13]=c2;
-        c2=0;
-        mul_add_c(a[7],b[7],c3,c1,c2);
-        r[14]=c3;
-        r[15]=c1;
-        }
-void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-        {
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        mul_add_c(a[0],b[0],c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        mul_add_c(a[0],b[1],c2,c3,c1);
-        mul_add_c(a[1],b[0],c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        mul_add_c(a[2],b[0],c3,c1,c2);
-        mul_add_c(a[1],b[1],c3,c1,c2);
-        mul_add_c(a[0],b[2],c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        mul_add_c(a[0],b[3],c1,c2,c3);
-        mul_add_c(a[1],b[2],c1,c2,c3);
-        mul_add_c(a[2],b[1],c1,c2,c3);
-        mul_add_c(a[3],b[0],c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        mul_add_c(a[3],b[1],c2,c3,c1);
-        mul_add_c(a[2],b[2],c2,c3,c1);
-        mul_add_c(a[1],b[3],c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        mul_add_c(a[2],b[3],c3,c1,c2);
-        mul_add_c(a[3],b[2],c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        mul_add_c(a[3],b[3],c1,c2,c3);
-        r[6]=c1;
-        r[7]=c2;
-        }
-void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
-        {
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        sqr_add_c(a,0,c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        sqr_add_c2(a,1,0,c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        sqr_add_c(a,1,c3,c1,c2);
-        sqr_add_c2(a,2,0,c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        sqr_add_c2(a,3,0,c1,c2,c3);
-        sqr_add_c2(a,2,1,c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        sqr_add_c(a,2,c2,c3,c1);
-        sqr_add_c2(a,3,1,c2,c3,c1);
-        sqr_add_c2(a,4,0,c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        sqr_add_c2(a,5,0,c3,c1,c2);
-        sqr_add_c2(a,4,1,c3,c1,c2);
-        sqr_add_c2(a,3,2,c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        sqr_add_c(a,3,c1,c2,c3);
-        sqr_add_c2(a,4,2,c1,c2,c3);
-        sqr_add_c2(a,5,1,c1,c2,c3);
-        sqr_add_c2(a,6,0,c1,c2,c3);
-        r[6]=c1;
-        c1=0;
-        sqr_add_c2(a,7,0,c2,c3,c1);
-        sqr_add_c2(a,6,1,c2,c3,c1);
-        sqr_add_c2(a,5,2,c2,c3,c1);
-        sqr_add_c2(a,4,3,c2,c3,c1);
-        r[7]=c2;
-        c2=0;
-        sqr_add_c(a,4,c3,c1,c2);
-        sqr_add_c2(a,5,3,c3,c1,c2);
-        sqr_add_c2(a,6,2,c3,c1,c2);
-        sqr_add_c2(a,7,1,c3,c1,c2);
-        r[8]=c3;
-        c3=0;
-        sqr_add_c2(a,7,2,c1,c2,c3);
-        sqr_add_c2(a,6,3,c1,c2,c3);
-        sqr_add_c2(a,5,4,c1,c2,c3);
-        r[9]=c1;
-        c1=0;
-        sqr_add_c(a,5,c2,c3,c1);
-        sqr_add_c2(a,6,4,c2,c3,c1);
-        sqr_add_c2(a,7,3,c2,c3,c1);
-        r[10]=c2;
-        c2=0;
-        sqr_add_c2(a,7,4,c3,c1,c2);
-        sqr_add_c2(a,6,5,c3,c1,c2);
-        r[11]=c3;
-        c3=0;
-        sqr_add_c(a,6,c1,c2,c3);
-        sqr_add_c2(a,7,5,c1,c2,c3);
-        r[12]=c1;
-        c1=0;
-        sqr_add_c2(a,7,6,c2,c3,c1);
-        r[13]=c2;
-        c2=0;
-        sqr_add_c(a,7,c3,c1,c2);
-        r[14]=c3;
-        r[15]=c1;
-        }
-void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a)
-        {
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        sqr_add_c(a,0,c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        sqr_add_c2(a,1,0,c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        sqr_add_c(a,1,c3,c1,c2);
-        sqr_add_c2(a,2,0,c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        sqr_add_c2(a,3,0,c1,c2,c3);
-        sqr_add_c2(a,2,1,c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        sqr_add_c(a,2,c2,c3,c1);
-        sqr_add_c2(a,3,1,c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        sqr_add_c2(a,3,2,c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        sqr_add_c(a,3,c1,c2,c3);
-        r[6]=c1;
-        r[7]=c2;
-        }
-#endif
diff --git a/src/lib/libcrypto/bn/asm/x86_64-mont.pl b/src/lib/libcrypto/bn/asm/x86_64-mont.pl
deleted file mode 100755
index c43b69592a..0000000000
--- a/src/lib/libcrypto/bn/asm/x86_64-mont.pl
+++ /dev/null
@@ -1,214 +0,0 @@
-#!/usr/bin/env perl
-# ====================================================================
-# Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
-# project. The module is, however, dual licensed under OpenSSL and
-# CRYPTOGAMS licenses depending on where you obtain it. For further
-# details see http://www.openssl.org/~appro/cryptogams/.
-# ====================================================================
-# October 2005.
-#
-# Montgomery multiplication routine for x86_64. While it gives modest
-# 9% improvement of rsa4096 sign on Opteron, rsa512 sign runs more
-# than twice, >2x, as fast. Most common rsa1024 sign is improved by
-# respectful 50%. It remains to be seen if loop unrolling and
-# dedicated squaring routine can provide further improvement...
-$output=shift;
-$0 =~ m/(.*[\/\\])[^\/\\]+$/; $dir=$1;
-( $xlate="${dir}x86_64-xlate.pl" and -f $xlate ) or
-( $xlate="${dir}../../perlasm/x86_64-xlate.pl" and -f $xlate) or
-die "can't locate x86_64-xlate.pl";
-open STDOUT,"| $^X $xlate $output";
-# int bn_mul_mont(
-$rp="%rdi";     # BN_ULONG *rp,
-$ap="%rsi";     # const BN_ULONG *ap,
-$bp="%rdx";     # const BN_ULONG *bp,
-$np="%rcx";     # const BN_ULONG *np,
-$n0="%r8";      # const BN_ULONG *n0,
-$num="%r9";     # int num);
-$lo0="%r10";
-$hi0="%r11";
-$bp="%r12";     # reassign $bp
-$hi1="%r13";
-$i="%r14";
-$j="%r15";
-$m0="%rbx";
-$m1="%rbp";
-$code=<<___;
-.text
-.globl  bn_mul_mont
-.type   bn_mul_mont,\@function,6
-.align  16
-bn_mul_mont:
-        push    %rbx
-        push    %rbp
-        push    %r12
-        push    %r13
-        push    %r14
-        push    %r15
-        mov     ${num}d,${num}d
-        lea     2($num),%rax
-        mov     %rsp,%rbp
-        neg     %rax
-        lea     (%rsp,%rax,8),%rsp      # tp=alloca(8*(num+2))
-        and     \$-1024,%rsp            # minimize TLB usage
-        mov     %rbp,8(%rsp,$num,8)     # tp[num+1]=%rsp
-        mov     %rdx,$bp                # $bp reassigned, remember?
-        mov     ($n0),$n0               # pull n0[0] value
-        xor     $i,$i                   # i=0
-        xor     $j,$j                   # j=0
-        mov     ($bp),$m0               # m0=bp[0]
-        mov     ($ap),%rax
-        mulq    $m0                     # ap[0]*bp[0]
-        mov     %rax,$lo0
-        mov     %rdx,$hi0
-        imulq   $n0,%rax                # "tp[0]"*n0
-        mov     %rax,$m1
-        mulq    ($np)                   # np[0]*m1
-        add     $lo0,%rax               # discarded
-        adc     \$0,%rdx
-        mov     %rdx,$hi1
-        lea     1($j),$j                # j++
-.L1st:
-        mov     ($ap,$j,8),%rax
-        mulq    $m0                     # ap[j]*bp[0]
-        add     $hi0,%rax
-        adc     \$0,%rdx
-        mov     %rax,$lo0
-        mov     ($np,$j,8),%rax
-        mov     %rdx,$hi0
-        mulq    $m1                     # np[j]*m1
-        add     $hi1,%rax
-        lea     1($j),$j                # j++
-        adc     \$0,%rdx
-        add     $lo0,%rax               # np[j]*m1+ap[j]*bp[0]
-        adc     \$0,%rdx
-        mov     %rax,-16(%rsp,$j,8)     # tp[j-1]
-        cmp     $num,$j
-        mov     %rdx,$hi1
-        jl      .L1st
-        xor     %rdx,%rdx
-        add     $hi0,$hi1
-        adc     \$0,%rdx
-        mov     $hi1,-8(%rsp,$num,8)
-        mov     %rdx,(%rsp,$num,8)      # store upmost overflow bit
-        lea     1($i),$i                # i++
-.align  4
-.Louter:
-        xor     $j,$j                   # j=0
-        mov     ($bp,$i,8),$m0          # m0=bp[i]
-        mov     ($ap),%rax              # ap[0]
-        mulq    $m0                     # ap[0]*bp[i]
-        add     (%rsp),%rax             # ap[0]*bp[i]+tp[0]
-        adc     \$0,%rdx
-        mov     %rax,$lo0
-        mov     %rdx,$hi0
-        imulq   $n0,%rax                # tp[0]*n0
-        mov     %rax,$m1
-        mulq    ($np,$j,8)              # np[0]*m1
-        add     $lo0,%rax               # discarded
-        mov     8(%rsp),$lo0            # tp[1]
-        adc     \$0,%rdx
-        mov     %rdx,$hi1
-        lea     1($j),$j                # j++
-.align  4
-.Linner:
-        mov     ($ap,$j,8),%rax
-        mulq    $m0                     # ap[j]*bp[i]
-        add     $hi0,%rax
-        adc     \$0,%rdx
-        add     %rax,$lo0               # ap[j]*bp[i]+tp[j]
-        mov     ($np,$j,8),%rax
-        adc     \$0,%rdx
-        mov     %rdx,$hi0
-        mulq    $m1                     # np[j]*m1
-        add     $hi1,%rax
-        lea     1($j),$j                # j++
-        adc     \$0,%rdx
-        add     $lo0,%rax               # np[j]*m1+ap[j]*bp[i]+tp[j]
-        adc     \$0,%rdx
-        mov     (%rsp,$j,8),$lo0
-        cmp     $num,$j
-        mov     %rax,-16(%rsp,$j,8)     # tp[j-1]
-        mov     %rdx,$hi1
-        jl      .Linner
-        xor     %rdx,%rdx
-        add     $hi0,$hi1
-        adc     \$0,%rdx
-        add     $lo0,$hi1               # pull upmost overflow bit
-        adc     \$0,%rdx
-        mov     $hi1,-8(%rsp,$num,8)
-        mov     %rdx,(%rsp,$num,8)      # store upmost overflow bit
-        lea     1($i),$i                # i++
-        cmp     $num,$i
-        jl      .Louter
-        lea     (%rsp),$ap              # borrow ap for tp
-        lea     -1($num),$j             # j=num-1
-        mov     ($ap),%rax              # tp[0]
-        xor     $i,$i                   # i=0 and clear CF!
-        jmp     .Lsub
-.align  16
-.Lsub:  sbb     ($np,$i,8),%rax
-        mov     %rax,($rp,$i,8)         # rp[i]=tp[i]-np[i]
-        dec     $j                      # doesn't affect CF!
-        mov     8($ap,$i,8),%rax        # tp[i+1]
-        lea     1($i),$i                # i++
-        jge     .Lsub
-        sbb     \$0,%rax                # handle upmost overflow bit
-        and     %rax,$ap
-        not     %rax
-        mov     $rp,$np
-        and     %rax,$np
-        lea     -1($num),$j
-        or      $np,$ap                 # ap=borrow?tp:rp
-.align  16
-.Lcopy:                                 # copy or in-place refresh
-        mov     ($ap,$j,8),%rax
-        mov     %rax,($rp,$j,8)         # rp[i]=tp[i]
-        mov     $i,(%rsp,$j,8)          # zap temporary vector
-        dec     $j
-        jge     .Lcopy
-        mov     8(%rsp,$num,8),%rsp     # restore %rsp
-        mov     \$1,%rax
-        pop     %r15
-        pop     %r14
-        pop     %r13
-        pop     %r12
-        pop     %rbp
-        pop     %rbx
-        ret
-.size   bn_mul_mont,.-bn_mul_mont
-.asciz  "Montgomery Multiplication for x86_64, CRYPTOGAMS by <appro\@openssl.org>"
-___
-print $code;
-close STDOUT;
diff --git a/src/lib/libcrypto/bn/bn.h b/src/lib/libcrypto/bn/bn.h
deleted file mode 100644
index f1719a5877..0000000000
--- a/src/lib/libcrypto/bn/bn.h
+++ /dev/null
@@ -1,855 +0,0 @@
-/* crypto/bn/bn.h */
-/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
- *
- * Portions of the attached software ("Contribution") are developed by 
- * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project.
- *
- * The Contribution is licensed pursuant to the Eric Young open source
- * license provided above.
- *
- * The binary polynomial arithmetic software is originally written by 
- * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories.
- *
- */
-#ifndef HEADER_BN_H
-#define HEADER_BN_H
-#include <openssl/e_os2.h>
-#ifndef OPENSSL_NO_FP_API
-#include <stdio.h> /* FILE */
-#endif
-#include <openssl/ossl_typ.h>
-#ifdef  __cplusplus
-extern "C" {
-#endif
-/* These preprocessor symbols control various aspects of the bignum headers and
- * library code. They're not defined by any "normal" configuration, as they are
- * intended for development and testing purposes. NB: defining all three can be
- * useful for debugging application code as well as openssl itself.
- *
- * BN_DEBUG - turn on various debugging alterations to the bignum code
- * BN_DEBUG_RAND - uses random poisoning of unused words to trip up
- * mismanagement of bignum internals. You must also define BN_DEBUG.
- */
-/* #define BN_DEBUG */
-/* #define BN_DEBUG_RAND */
-#define BN_MUL_COMBA
-#define BN_SQR_COMBA
-#define BN_RECURSION
-/* This next option uses the C libraries (2 word)/(1 word) function.
- * If it is not defined, I use my C version (which is slower).
- * The reason for this flag is that when the particular C compiler
- * library routine is used, and the library is linked with a different
- * compiler, the library is missing.  This mostly happens when the
- * library is built with gcc and then linked using normal cc.  This would
- * be a common occurrence because gcc normally produces code that is
- * 2 times faster than system compilers for the big number stuff.
- * For machines with only one compiler (or shared libraries), this should
- * be on.  Again this in only really a problem on machines
- * using "long long's", are 32bit, and are not using my assembler code. */
-#if defined(OPENSSL_SYS_MSDOS) || defined(OPENSSL_SYS_WINDOWS) || \
-    defined(OPENSSL_SYS_WIN32) || defined(linux)
-# ifndef BN_DIV2W
-#  define BN_DIV2W
-# endif
-#endif
-/* assuming long is 64bit - this is the DEC Alpha
- * unsigned long long is only 64 bits :-(, don't define
- * BN_LLONG for the DEC Alpha */
-#ifdef SIXTY_FOUR_BIT_LONG
-#define BN_ULLONG       unsigned long long
-#define BN_ULONG        unsigned long
-#define BN_LONG         long
-#define BN_BITS         128
-#define BN_BYTES        8
-#define BN_BITS2        64
-#define BN_BITS4        32
-#define BN_MASK         (0xffffffffffffffffffffffffffffffffLL)
-#define BN_MASK2        (0xffffffffffffffffL)
-#define BN_MASK2l       (0xffffffffL)
-#define BN_MASK2h       (0xffffffff00000000L)
-#define BN_MASK2h1      (0xffffffff80000000L)
-#define BN_TBIT         (0x8000000000000000L)
-#define BN_DEC_CONV     (10000000000000000000UL)
-#define BN_DEC_FMT1     "%lu"
-#define BN_DEC_FMT2     "%019lu"
-#define BN_DEC_NUM      19
-#endif
-/* This is where the long long data type is 64 bits, but long is 32.
- * For machines where there are 64bit registers, this is the mode to use.
- * IRIX, on R4000 and above should use this mode, along with the relevant
- * assembler code :-).  Do NOT define BN_LLONG.
- */
-#ifdef SIXTY_FOUR_BIT
-#undef BN_LLONG
-#undef BN_ULLONG
-#define BN_ULONG        unsigned long long
-#define BN_LONG         long long
-#define BN_BITS         128
-#define BN_BYTES        8
-#define BN_BITS2        64
-#define BN_BITS4        32
-#define BN_MASK2        (0xffffffffffffffffLL)
-#define BN_MASK2l       (0xffffffffL)
-#define BN_MASK2h       (0xffffffff00000000LL)
-#define BN_MASK2h1      (0xffffffff80000000LL)
-#define BN_TBIT         (0x8000000000000000LL)
-#define BN_DEC_CONV     (10000000000000000000ULL)
-#define BN_DEC_FMT1     "%llu"
-#define BN_DEC_FMT2     "%019llu"
-#define BN_DEC_NUM      19
-#endif
-#ifdef THIRTY_TWO_BIT
-#ifdef BN_LLONG
-# if defined(OPENSSL_SYS_WIN32) && !defined(__GNUC__)
-#  define BN_ULLONG     unsigned __int64
-# else
-#  define BN_ULLONG     unsigned long long
-# endif
-#endif
-#define BN_ULONG        unsigned long
-#define BN_LONG         long
-#define BN_BITS         64
-#define BN_BYTES        4
-#define BN_BITS2        32
-#define BN_BITS4        16
-#ifdef OPENSSL_SYS_WIN32
-/* VC++ doesn't like the LL suffix */
-#define BN_MASK         (0xffffffffffffffffL)
-#else
-#define BN_MASK         (0xffffffffffffffffLL)
-#endif
-#define BN_MASK2        (0xffffffffL)
-#define BN_MASK2l       (0xffff)
-#define BN_MASK2h1      (0xffff8000L)
-#define BN_MASK2h       (0xffff0000L)
-#define BN_TBIT         (0x80000000L)
-#define BN_DEC_CONV     (1000000000L)
-#define BN_DEC_FMT1     "%lu"
-#define BN_DEC_FMT2     "%09lu"
-#define BN_DEC_NUM      9
-#endif
-#ifdef SIXTEEN_BIT
-#ifndef BN_DIV2W
-#define BN_DIV2W
-#endif
-#define BN_ULLONG       unsigned long
-#define BN_ULONG        unsigned short
-#define BN_LONG         short
-#define BN_BITS         32
-#define BN_BYTES        2
-#define BN_BITS2        16
-#define BN_BITS4        8
-#define BN_MASK         (0xffffffff)
-#define BN_MASK2        (0xffff)
-#define BN_MASK2l       (0xff)
-#define BN_MASK2h1      (0xff80)
-#define BN_MASK2h       (0xff00)
-#define BN_TBIT         (0x8000)
-#define BN_DEC_CONV     (100000)
-#define BN_DEC_FMT1     "%u"
-#define BN_DEC_FMT2     "%05u"
-#define BN_DEC_NUM      5
-#endif
-#ifdef EIGHT_BIT
-#ifndef BN_DIV2W
-#define BN_DIV2W
-#endif
-#define BN_ULLONG       unsigned short
-#define BN_ULONG        unsigned char
-#define BN_LONG         char
-#define BN_BITS         16
-#define BN_BYTES        1
-#define BN_BITS2        8
-#define BN_BITS4        4
-#define BN_MASK         (0xffff)
-#define BN_MASK2        (0xff)
-#define BN_MASK2l       (0xf)
-#define BN_MASK2h1      (0xf8)
-#define BN_MASK2h       (0xf0)
-#define BN_TBIT         (0x80)
-#define BN_DEC_CONV     (100)
-#define BN_DEC_FMT1     "%u"
-#define BN_DEC_FMT2     "%02u"
-#define BN_DEC_NUM      2
-#endif
-#define BN_DEFAULT_BITS 1280
-#define BN_FLG_MALLOCED         0x01
-#define BN_FLG_STATIC_DATA      0x02
-#define BN_FLG_CONSTTIME        0x04 /* avoid leaking exponent information through timing,
-                                      * BN_mod_exp_mont() will call BN_mod_exp_mont_consttime,
-                                      * BN_div() will call BN_div_no_branch,
-                                      * BN_mod_inverse() will call BN_mod_inverse_no_branch.
-                                      */
-#ifndef OPENSSL_NO_DEPRECATED
-#define BN_FLG_EXP_CONSTTIME BN_FLG_CONSTTIME /* deprecated name for the flag */
-                                      /* avoid leaking exponent information through timings
-                                      * (BN_mod_exp_mont() will call BN_mod_exp_mont_consttime) */
-#endif
-#ifndef OPENSSL_NO_DEPRECATED
-#define BN_FLG_FREE             0x8000  /* used for debuging */
-#endif
-#define BN_set_flags(b,n)       ((b)->flags|=(n))
-#define BN_get_flags(b,n)       ((b)->flags&(n))
-/* get a clone of a BIGNUM with changed flags, for *temporary* use only
- * (the two BIGNUMs cannot not be used in parallel!) */
-#define BN_with_flags(dest,b,n)  ((dest)->d=(b)->d, \
-                                  (dest)->top=(b)->top, \
-                                  (dest)->dmax=(b)->dmax, \
-                                  (dest)->neg=(b)->neg, \
-                                  (dest)->flags=(((dest)->flags & BN_FLG_MALLOCED) \
-                                                 |  ((b)->flags & ~BN_FLG_MALLOCED) \
-                                                 |  BN_FLG_STATIC_DATA \
-                                                 |  (n)))
-/* Already declared in ossl_typ.h */
-#if 0
-typedef struct bignum_st BIGNUM;
-/* Used for temp variables (declaration hidden in bn_lcl.h) */
-typedef struct bignum_ctx BN_CTX;
-typedef struct bn_blinding_st BN_BLINDING;
-typedef struct bn_mont_ctx_st BN_MONT_CTX;
-typedef struct bn_recp_ctx_st BN_RECP_CTX;
-typedef struct bn_gencb_st BN_GENCB;
-#endif
-struct bignum_st
-        {
-        BN_ULONG *d;    /* Pointer to an array of 'BN_BITS2' bit chunks. */
-        int top;        /* Index of last used d +1. */
-        /* The next are internal book keeping for bn_expand. */
-        int dmax;       /* Size of the d array. */
-        int neg;        /* one if the number is negative */
-        int flags;
-        };
-/* Used for montgomery multiplication */
-struct bn_mont_ctx_st
-        {
-        int ri;        /* number of bits in R */
-        BIGNUM RR;     /* used to convert to montgomery form */
-        BIGNUM N;      /* The modulus */
-        BIGNUM Ni;     /* R*(1/R mod N) - N*Ni = 1
-                        * (Ni is only stored for bignum algorithm) */
-#if 0
-        /* OpenSSL 0.9.9 preview: */
-        BN_ULONG n0[2];/* least significant word(s) of Ni */
-#else
-        BN_ULONG n0;   /* least significant word of Ni */
-#endif
-        int flags;
-        };
-/* Used for reciprocal division/mod functions
- * It cannot be shared between threads
- */
-struct bn_recp_ctx_st
-        {
-        BIGNUM N;       /* the divisor */
-        BIGNUM Nr;      /* the reciprocal */
-        int num_bits;
-        int shift;
-        int flags;
-        };
-/* Used for slow "generation" functions. */
-struct bn_gencb_st
-        {
-        unsigned int ver;       /* To handle binary (in)compatibility */
-        void *arg;              /* callback-specific data */
-        union
-                {
-                /* if(ver==1) - handles old style callbacks */
-                void (*cb_1)(int, int, void *);
-                /* if(ver==2) - new callback style */
-                int (*cb_2)(int, int, BN_GENCB *);
-                } cb;
-        };
-/* Wrapper function to make using BN_GENCB easier,  */
-int BN_GENCB_call(BN_GENCB *cb, int a, int b);
-/* Macro to populate a BN_GENCB structure with an "old"-style callback */
-#define BN_GENCB_set_old(gencb, callback, cb_arg) { \
-                BN_GENCB *tmp_gencb = (gencb); \
-                tmp_gencb->ver = 1; \
-                tmp_gencb->arg = (cb_arg); \
-                tmp_gencb->cb.cb_1 = (callback); }
-/* Macro to populate a BN_GENCB structure with a "new"-style callback */
-#define BN_GENCB_set(gencb, callback, cb_arg) { \
-                BN_GENCB *tmp_gencb = (gencb); \
-                tmp_gencb->ver = 2; \
-                tmp_gencb->arg = (cb_arg); \
-                tmp_gencb->cb.cb_2 = (callback); }
-#define BN_prime_checks 0 /* default: select number of iterations
-                             based on the size of the number */
-/* number of Miller-Rabin iterations for an error rate  of less than 2^-80
- * for random 'b'-bit input, b >= 100 (taken from table 4.4 in the Handbook
- * of Applied Cryptography [Menezes, van Oorschot, Vanstone; CRC Press 1996];
- * original paper: Damgaard, Landrock, Pomerance: Average case error estimates
- * for the strong probable prime test. -- Math. Comp. 61 (1993) 177-194) */
-#define BN_prime_checks_for_size(b) ((b) >= 1300 ?  2 : \
-                                (b) >=  850 ?  3 : \
-                                (b) >=  650 ?  4 : \
-                                (b) >=  550 ?  5 : \
-                                (b) >=  450 ?  6 : \
-                                (b) >=  400 ?  7 : \
-                                (b) >=  350 ?  8 : \
-                                (b) >=  300 ?  9 : \
-                                (b) >=  250 ? 12 : \
-                                (b) >=  200 ? 15 : \
-                                (b) >=  150 ? 18 : \
-                                /* b >= 100 */ 27)
-#define BN_num_bytes(a) ((BN_num_bits(a)+7)/8)
-/* Note that BN_abs_is_word didn't work reliably for w == 0 until 0.9.8 */
-#define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \
-                                (((w) == 0) && ((a)->top == 0)))
-#define BN_is_zero(a)       ((a)->top == 0)
-#define BN_is_one(a)        (BN_abs_is_word((a),1) && !(a)->neg)
-#define BN_is_word(a,w)     (BN_abs_is_word((a),(w)) && (!(w) || !(a)->neg))
-#define BN_is_odd(a)        (((a)->top > 0) && ((a)->d[0] & 1))
-#define BN_one(a)       (BN_set_word((a),1))
-#define BN_zero_ex(a) \
-        do { \
-                BIGNUM *_tmp_bn = (a); \
-                _tmp_bn->top = 0; \
-                _tmp_bn->neg = 0; \
-        } while(0)
-#ifdef OPENSSL_NO_DEPRECATED
-#define BN_zero(a)      BN_zero_ex(a)
-#else
-#define BN_zero(a)      (BN_set_word((a),0))
-#endif
-const BIGNUM *BN_value_one(void);
-char *  BN_options(void);
-BN_CTX *BN_CTX_new(void);
-#ifndef OPENSSL_NO_DEPRECATED
-void    BN_CTX_init(BN_CTX *c);
-#endif
-void    BN_CTX_free(BN_CTX *c);
-void    BN_CTX_start(BN_CTX *ctx);
-BIGNUM *BN_CTX_get(BN_CTX *ctx);
-void    BN_CTX_end(BN_CTX *ctx);
-int     BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
-int     BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
-int     BN_rand_range(BIGNUM *rnd, const BIGNUM *range);
-int     BN_pseudo_rand_range(BIGNUM *rnd, const BIGNUM *range);
-int     BN_num_bits(const BIGNUM *a);
-int     BN_num_bits_word(BN_ULONG);
-BIGNUM *BN_new(void);
-void    BN_init(BIGNUM *);
-void    BN_clear_free(BIGNUM *a);
-BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b);
-void    BN_swap(BIGNUM *a, BIGNUM *b);
-BIGNUM *BN_bin2bn(const unsigned char *s,int len,BIGNUM *ret);
-int     BN_bn2bin(const BIGNUM *a, unsigned char *to);
-BIGNUM *BN_mpi2bn(const unsigned char *s,int len,BIGNUM *ret);
-int     BN_bn2mpi(const BIGNUM *a, unsigned char *to);
-int     BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
-int     BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
-int     BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
-int     BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
-int     BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
-int     BN_sqr(BIGNUM *r, const BIGNUM *a,BN_CTX *ctx);
-/** BN_set_negative sets sign of a BIGNUM
- * \param  b  pointer to the BIGNUM object
- * \param  n  0 if the BIGNUM b should be positive and a value != 0 otherwise 
- */
-void    BN_set_negative(BIGNUM *b, int n);
-/** BN_is_negative returns 1 if the BIGNUM is negative
- * \param  a  pointer to the BIGNUM object
- * \return 1 if a < 0 and 0 otherwise
- */
-#define BN_is_negative(a) ((a)->neg != 0)
-int     BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
-        BN_CTX *ctx);
-#define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
-int     BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx);
-int     BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
-int     BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);
-int     BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx);
-int     BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m);
-int     BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const BIGNUM *m, BN_CTX *ctx);
-int     BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
-int     BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
-int     BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m);
-int     BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);
-int     BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
-BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w);
-BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w);
-int     BN_mul_word(BIGNUM *a, BN_ULONG w);
-int     BN_add_word(BIGNUM *a, BN_ULONG w);
-int     BN_sub_word(BIGNUM *a, BN_ULONG w);
-int     BN_set_word(BIGNUM *a, BN_ULONG w);
-BN_ULONG BN_get_word(const BIGNUM *a);
-int     BN_cmp(const BIGNUM *a, const BIGNUM *b);
-void    BN_free(BIGNUM *a);
-int     BN_is_bit_set(const BIGNUM *a, int n);
-int     BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
-int     BN_lshift1(BIGNUM *r, const BIGNUM *a);
-int     BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,BN_CTX *ctx);
-int     BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        const BIGNUM *m,BN_CTX *ctx);
-int     BN_mod_exp_mont(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
-int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
-        const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont);
-int     BN_mod_exp_mont_word(BIGNUM *r, BN_ULONG a, const BIGNUM *p,
-        const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
-int     BN_mod_exp2_mont(BIGNUM *r, const BIGNUM *a1, const BIGNUM *p1,
-        const BIGNUM *a2, const BIGNUM *p2,const BIGNUM *m,
-        BN_CTX *ctx,BN_MONT_CTX *m_ctx);
-int     BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        const BIGNUM *m,BN_CTX *ctx);
-int     BN_mask_bits(BIGNUM *a,int n);
-#ifndef OPENSSL_NO_FP_API
-int     BN_print_fp(FILE *fp, const BIGNUM *a);
-#endif
-#ifdef HEADER_BIO_H
-int     BN_print(BIO *fp, const BIGNUM *a);
-#else
-int     BN_print(void *fp, const BIGNUM *a);
-#endif
-int     BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx);
-int     BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
-int     BN_rshift1(BIGNUM *r, const BIGNUM *a);
-void    BN_clear(BIGNUM *a);
-BIGNUM *BN_dup(const BIGNUM *a);
-int     BN_ucmp(const BIGNUM *a, const BIGNUM *b);
-int     BN_set_bit(BIGNUM *a, int n);
-int     BN_clear_bit(BIGNUM *a, int n);
-char *  BN_bn2hex(const BIGNUM *a);
-char *  BN_bn2dec(const BIGNUM *a);
-int     BN_hex2bn(BIGNUM **a, const char *str);
-int     BN_dec2bn(BIGNUM **a, const char *str);
-int     BN_gcd(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx);
-int     BN_kronecker(const BIGNUM *a,const BIGNUM *b,BN_CTX *ctx); /* returns -2 for error */
-BIGNUM *BN_mod_inverse(BIGNUM *ret,
-        const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
-BIGNUM *BN_mod_sqrt(BIGNUM *ret,
-        const BIGNUM *a, const BIGNUM *n,BN_CTX *ctx);
-/* Deprecated versions */
-#ifndef OPENSSL_NO_DEPRECATED
-BIGNUM *BN_generate_prime(BIGNUM *ret,int bits,int safe,
-        const BIGNUM *add, const BIGNUM *rem,
-        void (*callback)(int,int,void *),void *cb_arg);
-int     BN_is_prime(const BIGNUM *p,int nchecks,
-        void (*callback)(int,int,void *),
-        BN_CTX *ctx,void *cb_arg);
-int     BN_is_prime_fasttest(const BIGNUM *p,int nchecks,
-        void (*callback)(int,int,void *),BN_CTX *ctx,void *cb_arg,
-        int do_trial_division);
-#endif /* !defined(OPENSSL_NO_DEPRECATED) */
-/* Newer versions */
-int     BN_generate_prime_ex(BIGNUM *ret,int bits,int safe, const BIGNUM *add,
-                const BIGNUM *rem, BN_GENCB *cb);
-int     BN_is_prime_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx, BN_GENCB *cb);
-int     BN_is_prime_fasttest_ex(const BIGNUM *p,int nchecks, BN_CTX *ctx,
-                int do_trial_division, BN_GENCB *cb);
-int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx);
-int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
-                        const BIGNUM *Xp, const BIGNUM *Xp1, const BIGNUM *Xp2,
-                        const BIGNUM *e, BN_CTX *ctx, BN_GENCB *cb);
-int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
-                        BIGNUM *Xp1, BIGNUM *Xp2,
-                        const BIGNUM *Xp,
-                        const BIGNUM *e, BN_CTX *ctx,
-                        BN_GENCB *cb);
-BN_MONT_CTX *BN_MONT_CTX_new(void );
-void BN_MONT_CTX_init(BN_MONT_CTX *ctx);
-int BN_mod_mul_montgomery(BIGNUM *r,const BIGNUM *a,const BIGNUM *b,
-        BN_MONT_CTX *mont, BN_CTX *ctx);
-#define BN_to_montgomery(r,a,mont,ctx)  BN_mod_mul_montgomery(\
-        (r),(a),&((mont)->RR),(mont),(ctx))
-int BN_from_montgomery(BIGNUM *r,const BIGNUM *a,
-        BN_MONT_CTX *mont, BN_CTX *ctx);
-void BN_MONT_CTX_free(BN_MONT_CTX *mont);
-int BN_MONT_CTX_set(BN_MONT_CTX *mont,const BIGNUM *mod,BN_CTX *ctx);
-BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to,BN_MONT_CTX *from);
-BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
-                                        const BIGNUM *mod, BN_CTX *ctx);
-/* BN_BLINDING flags */
-#define BN_BLINDING_NO_UPDATE   0x00000001
-#define BN_BLINDING_NO_RECREATE 0x00000002
-BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, /* const */ BIGNUM *mod);
-void BN_BLINDING_free(BN_BLINDING *b);
-int BN_BLINDING_update(BN_BLINDING *b,BN_CTX *ctx);
-int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
-int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
-int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
-int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *);
-unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *);
-void BN_BLINDING_set_thread_id(BN_BLINDING *, unsigned long);
-unsigned long BN_BLINDING_get_flags(const BN_BLINDING *);
-void BN_BLINDING_set_flags(BN_BLINDING *, unsigned long);
-BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
-        const BIGNUM *e, /* const */ BIGNUM *m, BN_CTX *ctx,
-        int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-                          const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
-        BN_MONT_CTX *m_ctx);
-#ifndef OPENSSL_NO_DEPRECATED
-void BN_set_params(int mul,int high,int low,int mont);
-int BN_get_params(int which); /* 0, mul, 1 high, 2 low, 3 mont */
-#endif
-void    BN_RECP_CTX_init(BN_RECP_CTX *recp);
-BN_RECP_CTX *BN_RECP_CTX_new(void);
-void    BN_RECP_CTX_free(BN_RECP_CTX *recp);
-int     BN_RECP_CTX_set(BN_RECP_CTX *recp,const BIGNUM *rdiv,BN_CTX *ctx);
-int     BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
-        BN_RECP_CTX *recp,BN_CTX *ctx);
-int     BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        const BIGNUM *m, BN_CTX *ctx);
-int     BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
-        BN_RECP_CTX *recp, BN_CTX *ctx);
-/* Functions for arithmetic over binary polynomials represented by BIGNUMs. 
- *
- * The BIGNUM::neg property of BIGNUMs representing binary polynomials is
- * ignored.
- *
- * Note that input arguments are not const so that their bit arrays can
- * be expanded to the appropriate size if needed.
- */
-int     BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b); /*r = a + b*/
-#define BN_GF2m_sub(r, a, b) BN_GF2m_add(r, a, b)
-int     BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p); /*r=a mod p*/
-int     BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const BIGNUM *p, BN_CTX *ctx); /* r = (a * b) mod p */
-int     BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        BN_CTX *ctx); /* r = (a * a) mod p */
-int     BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *b, const BIGNUM *p,
-        BN_CTX *ctx); /* r = (1 / b) mod p */
-int     BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const BIGNUM *p, BN_CTX *ctx); /* r = (a / b) mod p */
-int     BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const BIGNUM *p, BN_CTX *ctx); /* r = (a ^ b) mod p */
-int     BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        BN_CTX *ctx); /* r = sqrt(a) mod p */
-int     BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-        BN_CTX *ctx); /* r^2 + r = a mod p */
-#define BN_GF2m_cmp(a, b) BN_ucmp((a), (b))
-/* Some functions allow for representation of the irreducible polynomials
- * as an unsigned int[], say p.  The irreducible f(t) is then of the form:
- *     t^p[0] + t^p[1] + ... + t^p[k]
- * where m = p[0] > p[1] > ... > p[k] = 0.
- */
-int     BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[]);
-        /* r = a mod p */
-int     BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const unsigned int p[], BN_CTX *ctx); /* r = (a * b) mod p */
-int     BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[],
-        BN_CTX *ctx); /* r = (a * a) mod p */
-int     BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *b, const unsigned int p[],
-        BN_CTX *ctx); /* r = (1 / b) mod p */
-int     BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const unsigned int p[], BN_CTX *ctx); /* r = (a / b) mod p */
-int     BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-        const unsigned int p[], BN_CTX *ctx); /* r = (a ^ b) mod p */
-int     BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a,
-        const unsigned int p[], BN_CTX *ctx); /* r = sqrt(a) mod p */
-int     BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a,
-        const unsigned int p[], BN_CTX *ctx); /* r^2 + r = a mod p */
-int     BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max);
-int     BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a);
-/* faster mod functions for the 'NIST primes' 
- * 0 <= a < p^2 */
-int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
-int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
-int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
-int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
-int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
-const BIGNUM *BN_get0_nist_prime_192(void);
-const BIGNUM *BN_get0_nist_prime_224(void);
-const BIGNUM *BN_get0_nist_prime_256(void);
-const BIGNUM *BN_get0_nist_prime_384(void);
-const BIGNUM *BN_get0_nist_prime_521(void);
-/* library internal functions */
-#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
-        (a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))
-#define bn_wexpand(a,words) (((words) <= (a)->dmax)?(a):bn_expand2((a),(words)))
-BIGNUM *bn_expand2(BIGNUM *a, int words);
-#ifndef OPENSSL_NO_DEPRECATED
-BIGNUM *bn_dup_expand(const BIGNUM *a, int words); /* unused */
-#endif
-/* Bignum consistency macros
- * There is one "API" macro, bn_fix_top(), for stripping leading zeroes from
- * bignum data after direct manipulations on the data. There is also an
- * "internal" macro, bn_check_top(), for verifying that there are no leading
- * zeroes. Unfortunately, some auditing is required due to the fact that
- * bn_fix_top() has become an overabused duct-tape because bignum data is
- * occasionally passed around in an inconsistent state. So the following
- * changes have been made to sort this out;
- * - bn_fix_top()s implementation has been moved to bn_correct_top()
- * - if BN_DEBUG isn't defined, bn_fix_top() maps to bn_correct_top(), and
- *   bn_check_top() is as before.
- * - if BN_DEBUG *is* defined;
- *   - bn_check_top() tries to pollute unused words even if the bignum 'top' is
- *     consistent. (ed: only if BN_DEBUG_RAND is defined)
- *   - bn_fix_top() maps to bn_check_top() rather than "fixing" anything.
- * The idea is to have debug builds flag up inconsistent bignums when they
- * occur. If that occurs in a bn_fix_top(), we examine the code in question; if
- * the use of bn_fix_top() was appropriate (ie. it follows directly after code
- * that manipulates the bignum) it is converted to bn_correct_top(), and if it
- * was not appropriate, we convert it permanently to bn_check_top() and track
- * down the cause of the bug. Eventually, no internal code should be using the
- * bn_fix_top() macro. External applications and libraries should try this with
- * their own code too, both in terms of building against the openssl headers
- * with BN_DEBUG defined *and* linking with a version of OpenSSL built with it
- * defined. This not only improves external code, it provides more test
- * coverage for openssl's own code.
- */
-#ifdef BN_DEBUG
-/* We only need assert() when debugging */
-#include <assert.h>
-#ifdef BN_DEBUG_RAND
-/* To avoid "make update" cvs wars due to BN_DEBUG, use some tricks */
-#ifndef RAND_pseudo_bytes
-int RAND_pseudo_bytes(unsigned char *buf,int num);
-#define BN_DEBUG_TRIX
-#endif
-#define bn_pollute(a) \
-        do { \
-                const BIGNUM *_bnum1 = (a); \
-                if(_bnum1->top < _bnum1->dmax) { \
-                        unsigned char _tmp_char; \
-                        /* We cast away const without the compiler knowing, any \
-                         * *genuinely* constant variables that aren't mutable \
-                         * wouldn't be constructed with top!=dmax. */ \
-                        BN_ULONG *_not_const; \
-                        memcpy(&_not_const, &_bnum1->d, sizeof(BN_ULONG*)); \
-                        RAND_pseudo_bytes(&_tmp_char, 1); \
-                        memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \
-                                (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \
-                } \
-        } while(0)
-#ifdef BN_DEBUG_TRIX
-#undef RAND_pseudo_bytes
-#endif
-#else
-#define bn_pollute(a)
-#endif
-#define bn_check_top(a) \
-        do { \
-                const BIGNUM *_bnum2 = (a); \
-                if (_bnum2 != NULL) { \
-                        assert((_bnum2->top == 0) || \
-                                (_bnum2->d[_bnum2->top - 1] != 0)); \
-                        bn_pollute(_bnum2); \
-                } \
-        } while(0)
-#define bn_fix_top(a)           bn_check_top(a)
-#else /* !BN_DEBUG */
-#define bn_pollute(a)
-#define bn_check_top(a)
-#define bn_fix_top(a)           bn_correct_top(a)
-#endif
-#define bn_correct_top(a) \
-        { \
-        BN_ULONG *ftl; \
-        if ((a)->top > 0) \
-                { \
-                for (ftl= &((a)->d[(a)->top-1]); (a)->top > 0; (a)->top--) \
-                if (*(ftl--)) break; \
-                } \
-        bn_pollute(a); \
-        }
-BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
-BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w);
-void     bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, int num);
-BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d);
-BN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
-BN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp,int num);
-/* Primes from RFC 2409 */
-BIGNUM *get_rfc2409_prime_768(BIGNUM *bn);
-BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn);
-/* Primes from RFC 3526 */
-BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn);
-BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn);
-BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn);
-BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn);
-BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn);
-BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn);
-int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom);
-/* BEGIN ERROR CODES */
-/* The following lines are auto generated by the script mkerr.pl. Any changes
- * made after this point may be overwritten when the script is next run.
- */
-void ERR_load_BN_strings(void);
-/* Error codes for the BN functions. */
-/* Function codes. */
-#define BN_F_BNRAND                                      127
-#define BN_F_BN_BLINDING_CONVERT_EX                      100
-#define BN_F_BN_BLINDING_CREATE_PARAM                    128
-#define BN_F_BN_BLINDING_INVERT_EX                       101
-#define BN_F_BN_BLINDING_NEW                             102
-#define BN_F_BN_BLINDING_UPDATE                          103
-#define BN_F_BN_BN2DEC                                   104
-#define BN_F_BN_BN2HEX                                   105
-#define BN_F_BN_CTX_GET                                  116
-#define BN_F_BN_CTX_NEW                                  106
-#define BN_F_BN_CTX_START                                129
-#define BN_F_BN_DIV                                      107
-#define BN_F_BN_DIV_NO_BRANCH                            138
-#define BN_F_BN_DIV_RECP                                 130
-#define BN_F_BN_EXP                                      123
-#define BN_F_BN_EXPAND2                                  108
-#define BN_F_BN_EXPAND_INTERNAL                          120
-#define BN_F_BN_GF2M_MOD                                 131
-#define BN_F_BN_GF2M_MOD_EXP                             132
-#define BN_F_BN_GF2M_MOD_MUL                             133
-#define BN_F_BN_GF2M_MOD_SOLVE_QUAD                      134
-#define BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR                  135
-#define BN_F_BN_GF2M_MOD_SQR                             136
-#define BN_F_BN_GF2M_MOD_SQRT                            137
-#define BN_F_BN_MOD_EXP2_MONT                            118
-#define BN_F_BN_MOD_EXP_MONT                             109
-#define BN_F_BN_MOD_EXP_MONT_CONSTTIME                   124
-#define BN_F_BN_MOD_EXP_MONT_WORD                        117
-#define BN_F_BN_MOD_EXP_RECP                             125
-#define BN_F_BN_MOD_EXP_SIMPLE                           126
-#define BN_F_BN_MOD_INVERSE                              110
-#define BN_F_BN_MOD_INVERSE_NO_BRANCH                    139
-#define BN_F_BN_MOD_LSHIFT_QUICK                         119
-#define BN_F_BN_MOD_MUL_RECIPROCAL                       111
-#define BN_F_BN_MOD_SQRT                                 121
-#define BN_F_BN_MPI2BN                                   112
-#define BN_F_BN_NEW                                      113
-#define BN_F_BN_RAND                                     114
-#define BN_F_BN_RAND_RANGE                               122
-#define BN_F_BN_USUB                                     115
-/* Reason codes. */
-#define BN_R_ARG2_LT_ARG3                                100
-#define BN_R_BAD_RECIPROCAL                              101
-#define BN_R_BIGNUM_TOO_LONG                             114
-#define BN_R_CALLED_WITH_EVEN_MODULUS                    102
-#define BN_R_DIV_BY_ZERO                                 103
-#define BN_R_ENCODING_ERROR                              104
-#define BN_R_EXPAND_ON_STATIC_BIGNUM_DATA                105
-#define BN_R_INPUT_NOT_REDUCED                           110
-#define BN_R_INVALID_LENGTH                              106
-#define BN_R_INVALID_RANGE                               115
-#define BN_R_NOT_A_SQUARE                                111
-#define BN_R_NOT_INITIALIZED                             107
-#define BN_R_NO_INVERSE                                  108
-#define BN_R_NO_SOLUTION                                 116
-#define BN_R_P_IS_NOT_PRIME                              112
-#define BN_R_TOO_MANY_ITERATIONS                         113
-#define BN_R_TOO_MANY_TEMPORARY_VARIABLES                109
-#ifdef  __cplusplus
-}
-#endif
-#endif
diff --git a/src/lib/libcrypto/bn/bn_add.c b/src/lib/libcrypto/bn/bn_add.c
deleted file mode 100644
index 9405163706..0000000000
--- a/src/lib/libcrypto/bn/bn_add.c
+++ /dev/null
@@ -1,313 +0,0 @@
-/* crypto/bn/bn_add.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* r can == a or b */
-int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
-        {
-        const BIGNUM *tmp;
-        int a_neg = a->neg, ret;
-        bn_check_top(a);
-        bn_check_top(b);
-        /*  a +  b      a+b
-         *  a + -b      a-b
-         * -a +  b      b-a
-         * -a + -b      -(a+b)
-         */
-        if (a_neg ^ b->neg)
-                {
-                /* only one is negative */
-                if (a_neg)
-                        { tmp=a; a=b; b=tmp; }
-                /* we are now a - b */
-                if (BN_ucmp(a,b) < 0)
-                        {
-                        if (!BN_usub(r,b,a)) return(0);
-                        r->neg=1;
-                        }
-                else
-                        {
-                        if (!BN_usub(r,a,b)) return(0);
-                        r->neg=0;
-                        }
-                return(1);
-                }
-        ret = BN_uadd(r,a,b);
-        r->neg = a_neg;
-        bn_check_top(r);
-        return ret;
-        }
-/* unsigned add of b to a */
-int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
-        {
-        int max,min,dif;
-        BN_ULONG *ap,*bp,*rp,carry,t1,t2;
-        const BIGNUM *tmp;
-        bn_check_top(a);
-        bn_check_top(b);
-        if (a->top < b->top)
-                { tmp=a; a=b; b=tmp; }
-        max = a->top;
-        min = b->top;
-        dif = max - min;
-        if (bn_wexpand(r,max+1) == NULL)
-                return 0;
-        r->top=max;
-        ap=a->d;
-        bp=b->d;
-        rp=r->d;
-        carry=bn_add_words(rp,ap,bp,min);
-        rp+=min;
-        ap+=min;
-        bp+=min;
-        if (carry)
-                {
-                while (dif)
-                        {
-                        dif--;
-                        t1 = *(ap++);
-                        t2 = (t1+1) & BN_MASK2;
-                        *(rp++) = t2;
-                        if (t2)
-                                {
-                                carry=0;
-                                break;
-                                }
-                        }
-                if (carry)
-                        {
-                        /* carry != 0 => dif == 0 */
-                        *rp = 1;
-                        r->top++;
-                        }
-                }
-        if (dif && rp != ap)
-                while (dif--)
-                        /* copy remaining words if ap != rp */
-                        *(rp++) = *(ap++);
-        r->neg = 0;
-        bn_check_top(r);
-        return 1;
-        }
-/* unsigned subtraction of b from a, a must be larger than b. */
-int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
-        {
-        int max,min,dif;
-        register BN_ULONG t1,t2,*ap,*bp,*rp;
-        int i,carry;
-#if defined(IRIX_CC_BUG) && !defined(LINT)
-        int dummy;
-#endif
-        bn_check_top(a);
-        bn_check_top(b);
-        max = a->top;
-        min = b->top;
-        dif = max - min;
-        if (dif < 0)    /* hmm... should not be happening */
-                {
-                BNerr(BN_F_BN_USUB,BN_R_ARG2_LT_ARG3);
-                return(0);
-                }
-        if (bn_wexpand(r,max) == NULL) return(0);
-        ap=a->d;
-        bp=b->d;
-        rp=r->d;
-#if 1
-        carry=0;
-        for (i = min; i != 0; i--)
-                {
-                t1= *(ap++);
-                t2= *(bp++);
-                if (carry)
-                        {
-                        carry=(t1 <= t2);
-                        t1=(t1-t2-1)&BN_MASK2;
-                        }
-                else
-                        {
-                        carry=(t1 < t2);
-                        t1=(t1-t2)&BN_MASK2;
-                        }
-#if defined(IRIX_CC_BUG) && !defined(LINT)
-                dummy=t1;
-#endif
-                *(rp++)=t1&BN_MASK2;
-                }
-#else
-        carry=bn_sub_words(rp,ap,bp,min);
-        ap+=min;
-        bp+=min;
-        rp+=min;
-#endif
-        if (carry) /* subtracted */
-                {
-                if (!dif)
-                        /* error: a < b */
-                        return 0;
-                while (dif)
-                        {
-                        dif--;
-                        t1 = *(ap++);
-                        t2 = (t1-1)&BN_MASK2;
-                        *(rp++) = t2;
-                        if (t1)
-                                break;
-                        }
-                }
-#if 0
-        memcpy(rp,ap,sizeof(*rp)*(max-i));
-#else
-        if (rp != ap)
-                {
-                for (;;)
-                        {
-                        if (!dif--) break;
-                        rp[0]=ap[0];
-                        if (!dif--) break;
-                        rp[1]=ap[1];
-                        if (!dif--) break;
-                        rp[2]=ap[2];
-                        if (!dif--) break;
-                        rp[3]=ap[3];
-                        rp+=4;
-                        ap+=4;
-                        }
-                }
-#endif
-        r->top=max;
-        r->neg=0;
-        bn_correct_top(r);
-        return(1);
-        }
-int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
-        {
-        int max;
-        int add=0,neg=0;
-        const BIGNUM *tmp;
-        bn_check_top(a);
-        bn_check_top(b);
-        /*  a -  b      a-b
-         *  a - -b      a+b
-         * -a -  b      -(a+b)
-         * -a - -b      b-a
-         */
-        if (a->neg)
-                {
-                if (b->neg)
-                        { tmp=a; a=b; b=tmp; }
-                else
-                        { add=1; neg=1; }
-                }
-        else
-                {
-                if (b->neg) { add=1; neg=0; }
-                }
-        if (add)
-                {
-                if (!BN_uadd(r,a,b)) return(0);
-                r->neg=neg;
-                return(1);
-                }
-        /* We are actually doing a - b :-) */
-        max=(a->top > b->top)?a->top:b->top;
-        if (bn_wexpand(r,max) == NULL) return(0);
-        if (BN_ucmp(a,b) < 0)
-                {
-                if (!BN_usub(r,b,a)) return(0);
-                r->neg=1;
-                }
-        else
-                {
-                if (!BN_usub(r,a,b)) return(0);
-                r->neg=0;
-                }
-        bn_check_top(r);
-        return(1);
-        }
diff --git a/src/lib/libcrypto/bn/bn_asm.c b/src/lib/libcrypto/bn/bn_asm.c
deleted file mode 100644
index 99bc2de491..0000000000
--- a/src/lib/libcrypto/bn/bn_asm.c
+++ /dev/null
@@ -1,860 +0,0 @@
-/* crypto/bn/bn_asm.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#ifndef BN_DEBUG
-# undef NDEBUG /* avoid conflicting definitions */
-# define NDEBUG
-#endif
-#include <stdio.h>
-#include <assert.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#if defined(BN_LLONG) || defined(BN_UMULT_HIGH)
-BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)
-        {
-        BN_ULONG c1=0;
-        assert(num >= 0);
-        if (num <= 0) return(c1);
-        while (num&~3)
-                {
-                mul_add(rp[0],ap[0],w,c1);
-                mul_add(rp[1],ap[1],w,c1);
-                mul_add(rp[2],ap[2],w,c1);
-                mul_add(rp[3],ap[3],w,c1);
-                ap+=4; rp+=4; num-=4;
-                }
-        if (num)
-                {
-                mul_add(rp[0],ap[0],w,c1); if (--num==0) return c1;
-                mul_add(rp[1],ap[1],w,c1); if (--num==0) return c1;
-                mul_add(rp[2],ap[2],w,c1); return c1;
-                }
-        
-        return(c1);
-        } 
-BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)
-        {
-        BN_ULONG c1=0;
-        assert(num >= 0);
-        if (num <= 0) return(c1);
-        while (num&~3)
-                {
-                mul(rp[0],ap[0],w,c1);
-                mul(rp[1],ap[1],w,c1);
-                mul(rp[2],ap[2],w,c1);
-                mul(rp[3],ap[3],w,c1);
-                ap+=4; rp+=4; num-=4;
-                }
-        if (num)
-                {
-                mul(rp[0],ap[0],w,c1); if (--num == 0) return c1;
-                mul(rp[1],ap[1],w,c1); if (--num == 0) return c1;
-                mul(rp[2],ap[2],w,c1);
-                }
-        return(c1);
-        } 
-void bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)
-        {
-        assert(n >= 0);
-        if (n <= 0) return;
-        while (n&~3)
-                {
-                sqr(r[0],r[1],a[0]);
-                sqr(r[2],r[3],a[1]);
-                sqr(r[4],r[5],a[2]);
-                sqr(r[6],r[7],a[3]);
-                a+=4; r+=8; n-=4;
-                }
-        if (n)
-                {
-                sqr(r[0],r[1],a[0]); if (--n == 0) return;
-                sqr(r[2],r[3],a[1]); if (--n == 0) return;
-                sqr(r[4],r[5],a[2]);
-                }
-        }
-#else /* !(defined(BN_LLONG) || defined(BN_UMULT_HIGH)) */
-BN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)
-        {
-        BN_ULONG c=0;
-        BN_ULONG bl,bh;
-        assert(num >= 0);
-        if (num <= 0) return((BN_ULONG)0);
-        bl=LBITS(w);
-        bh=HBITS(w);
-        for (;;)
-                {
-                mul_add(rp[0],ap[0],bl,bh,c);
-                if (--num == 0) break;
-                mul_add(rp[1],ap[1],bl,bh,c);
-                if (--num == 0) break;
-                mul_add(rp[2],ap[2],bl,bh,c);
-                if (--num == 0) break;
-                mul_add(rp[3],ap[3],bl,bh,c);
-                if (--num == 0) break;
-                ap+=4;
-                rp+=4;
-                }
-        return(c);
-        } 
-BN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, int num, BN_ULONG w)
-        {
-        BN_ULONG carry=0;
-        BN_ULONG bl,bh;
-        assert(num >= 0);
-        if (num <= 0) return((BN_ULONG)0);
-        bl=LBITS(w);
-        bh=HBITS(w);
-        for (;;)
-                {
-                mul(rp[0],ap[0],bl,bh,carry);
-                if (--num == 0) break;
-                mul(rp[1],ap[1],bl,bh,carry);
-                if (--num == 0) break;
-                mul(rp[2],ap[2],bl,bh,carry);
-                if (--num == 0) break;
-                mul(rp[3],ap[3],bl,bh,carry);
-                if (--num == 0) break;
-                ap+=4;
-                rp+=4;
-                }
-        return(carry);
-        } 
-void bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)
-        {
-        assert(n >= 0);
-        if (n <= 0) return;
-        for (;;)
-                {
-                sqr64(r[0],r[1],a[0]);
-                if (--n == 0) break;
-                sqr64(r[2],r[3],a[1]);
-                if (--n == 0) break;
-                sqr64(r[4],r[5],a[2]);
-                if (--n == 0) break;
-                sqr64(r[6],r[7],a[3]);
-                if (--n == 0) break;
-                a+=4;
-                r+=8;
-                }
-        }
-#endif /* !(defined(BN_LLONG) || defined(BN_UMULT_HIGH)) */
-#if defined(BN_LLONG) && defined(BN_DIV2W)
-BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
-        {
-        return((BN_ULONG)(((((BN_ULLONG)h)<<BN_BITS2)|l)/(BN_ULLONG)d));
-        }
-#else
-/* Divide h,l by d and return the result. */
-/* I need to test this some more :-( */
-BN_ULONG bn_div_words(BN_ULONG h, BN_ULONG l, BN_ULONG d)
-        {
-        BN_ULONG dh,dl,q,ret=0,th,tl,t;
-        int i,count=2;
-        if (d == 0) return(BN_MASK2);
-        i=BN_num_bits_word(d);
-        assert((i == BN_BITS2) || (h <= (BN_ULONG)1<<i));
-        i=BN_BITS2-i;
-        if (h >= d) h-=d;
-        if (i)
-                {
-                d<<=i;
-                h=(h<<i)|(l>>(BN_BITS2-i));
-                l<<=i;
-                }
-        dh=(d&BN_MASK2h)>>BN_BITS4;
-        dl=(d&BN_MASK2l);
-        for (;;)
-                {
-                if ((h>>BN_BITS4) == dh)
-                        q=BN_MASK2l;
-                else
-                        q=h/dh;
-                th=q*dh;
-                tl=dl*q;
-                for (;;)
-                        {
-                        t=h-th;
-                        if ((t&BN_MASK2h) ||
-                                ((tl) <= (
-                                        (t<<BN_BITS4)|
-                                        ((l&BN_MASK2h)>>BN_BITS4))))
-                                break;
-                        q--;
-                        th-=dh;
-                        tl-=dl;
-                        }
-                t=(tl>>BN_BITS4);
-                tl=(tl<<BN_BITS4)&BN_MASK2h;
-                th+=t;
-                if (l < tl) th++;
-                l-=tl;
-                if (h < th)
-                        {
-                        h+=d;
-                        q--;
-                        }
-                h-=th;
-                if (--count == 0) break;
-                ret=q<<BN_BITS4;
-                h=((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2;
-                l=(l&BN_MASK2l)<<BN_BITS4;
-                }
-        ret|=q;
-        return(ret);
-        }
-#endif /* !defined(BN_LLONG) && defined(BN_DIV2W) */
-#ifdef BN_LLONG
-BN_ULONG bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
-        {
-        BN_ULLONG ll=0;
-        assert(n >= 0);
-        if (n <= 0) return((BN_ULONG)0);
-        for (;;)
-                {
-                ll+=(BN_ULLONG)a[0]+b[0];
-                r[0]=(BN_ULONG)ll&BN_MASK2;
-                ll>>=BN_BITS2;
-                if (--n <= 0) break;
-                ll+=(BN_ULLONG)a[1]+b[1];
-                r[1]=(BN_ULONG)ll&BN_MASK2;
-                ll>>=BN_BITS2;
-                if (--n <= 0) break;
-                ll+=(BN_ULLONG)a[2]+b[2];
-                r[2]=(BN_ULONG)ll&BN_MASK2;
-                ll>>=BN_BITS2;
-                if (--n <= 0) break;
-                ll+=(BN_ULLONG)a[3]+b[3];
-                r[3]=(BN_ULONG)ll&BN_MASK2;
-                ll>>=BN_BITS2;
-                if (--n <= 0) break;
-                a+=4;
-                b+=4;
-                r+=4;
-                }
-        return((BN_ULONG)ll);
-        }
-#else /* !BN_LLONG */
-BN_ULONG bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
-        {
-        BN_ULONG c,l,t;
-        assert(n >= 0);
-        if (n <= 0) return((BN_ULONG)0);
-        c=0;
-        for (;;)
-                {
-                t=a[0];
-                t=(t+c)&BN_MASK2;
-                c=(t < c);
-                l=(t+b[0])&BN_MASK2;
-                c+=(l < t);
-                r[0]=l;
-                if (--n <= 0) break;
-                t=a[1];
-                t=(t+c)&BN_MASK2;
-                c=(t < c);
-                l=(t+b[1])&BN_MASK2;
-                c+=(l < t);
-                r[1]=l;
-                if (--n <= 0) break;
-                t=a[2];
-                t=(t+c)&BN_MASK2;
-                c=(t < c);
-                l=(t+b[2])&BN_MASK2;
-                c+=(l < t);
-                r[2]=l;
-                if (--n <= 0) break;
-                t=a[3];
-                t=(t+c)&BN_MASK2;
-                c=(t < c);
-                l=(t+b[3])&BN_MASK2;
-                c+=(l < t);
-                r[3]=l;
-                if (--n <= 0) break;
-                a+=4;
-                b+=4;
-                r+=4;
-                }
-        return((BN_ULONG)c);
-        }
-#endif /* !BN_LLONG */
-BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
-        {
-        BN_ULONG t1,t2;
-        int c=0;
-        assert(n >= 0);
-        if (n <= 0) return((BN_ULONG)0);
-        for (;;)
-                {
-                t1=a[0]; t2=b[0];
-                r[0]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                t1=a[1]; t2=b[1];
-                r[1]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                t1=a[2]; t2=b[2];
-                r[2]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                t1=a[3]; t2=b[3];
-                r[3]=(t1-t2-c)&BN_MASK2;
-                if (t1 != t2) c=(t1 < t2);
-                if (--n <= 0) break;
-                a+=4;
-                b+=4;
-                r+=4;
-                }
-        return(c);
-        }
-#ifdef BN_MUL_COMBA
-#undef bn_mul_comba8
-#undef bn_mul_comba4
-#undef bn_sqr_comba8
-#undef bn_sqr_comba4
-/* mul_add_c(a,b,c0,c1,c2)  -- c+=a*b for three word number c=(c2,c1,c0) */
-/* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
-/* sqr_add_c(a,i,c0,c1,c2)  -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
-/* sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number c=(c2,c1,c0) */
-#ifdef BN_LLONG
-#define mul_add_c(a,b,c0,c1,c2) \
-        t=(BN_ULLONG)a*b; \
-        t1=(BN_ULONG)Lw(t); \
-        t2=(BN_ULONG)Hw(t); \
-        c0=(c0+t1)&BN_MASK2; if ((c0) < t1) t2++; \
-        c1=(c1+t2)&BN_MASK2; if ((c1) < t2) c2++;
-#define mul_add_c2(a,b,c0,c1,c2) \
-        t=(BN_ULLONG)a*b; \
-        tt=(t+t)&BN_MASK; \
-        if (tt < t) c2++; \
-        t1=(BN_ULONG)Lw(tt); \
-        t2=(BN_ULONG)Hw(tt); \
-        c0=(c0+t1)&BN_MASK2;  \
-        if ((c0 < t1) && (((++t2)&BN_MASK2) == 0)) c2++; \
-        c1=(c1+t2)&BN_MASK2; if ((c1) < t2) c2++;
-#define sqr_add_c(a,i,c0,c1,c2) \
-        t=(BN_ULLONG)a[i]*a[i]; \
-        t1=(BN_ULONG)Lw(t); \
-        t2=(BN_ULONG)Hw(t); \
-        c0=(c0+t1)&BN_MASK2; if ((c0) < t1) t2++; \
-        c1=(c1+t2)&BN_MASK2; if ((c1) < t2) c2++;
-#define sqr_add_c2(a,i,j,c0,c1,c2) \
-        mul_add_c2((a)[i],(a)[j],c0,c1,c2)
-#elif defined(BN_UMULT_LOHI)
-#define mul_add_c(a,b,c0,c1,c2) {       \
-        BN_ULONG ta=(a),tb=(b);         \
-        BN_UMULT_LOHI(t1,t2,ta,tb);     \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define mul_add_c2(a,b,c0,c1,c2) {      \
-        BN_ULONG ta=(a),tb=(b),t0;      \
-        BN_UMULT_LOHI(t0,t1,ta,tb);     \
-        t2 = t1+t1; c2 += (t2<t1)?1:0;  \
-        t1 = t0+t0; t2 += (t1<t0)?1:0;  \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define sqr_add_c(a,i,c0,c1,c2) {       \
-        BN_ULONG ta=(a)[i];             \
-        BN_UMULT_LOHI(t1,t2,ta,ta);     \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define sqr_add_c2(a,i,j,c0,c1,c2)      \
-        mul_add_c2((a)[i],(a)[j],c0,c1,c2)
-#elif defined(BN_UMULT_HIGH)
-#define mul_add_c(a,b,c0,c1,c2) {       \
-        BN_ULONG ta=(a),tb=(b);         \
-        t1 = ta * tb;                   \
-        t2 = BN_UMULT_HIGH(ta,tb);      \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define mul_add_c2(a,b,c0,c1,c2) {      \
-        BN_ULONG ta=(a),tb=(b),t0;      \
-        t1 = BN_UMULT_HIGH(ta,tb);      \
-        t0 = ta * tb;                   \
-        t2 = t1+t1; c2 += (t2<t1)?1:0;  \
-        t1 = t0+t0; t2 += (t1<t0)?1:0;  \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define sqr_add_c(a,i,c0,c1,c2) {       \
-        BN_ULONG ta=(a)[i];             \
-        t1 = ta * ta;                   \
-        t2 = BN_UMULT_HIGH(ta,ta);      \
-        c0 += t1; t2 += (c0<t1)?1:0;    \
-        c1 += t2; c2 += (c1<t2)?1:0;    \
-        }
-#define sqr_add_c2(a,i,j,c0,c1,c2)      \
-        mul_add_c2((a)[i],(a)[j],c0,c1,c2)
-#else /* !BN_LLONG */
-#define mul_add_c(a,b,c0,c1,c2) \
-        t1=LBITS(a); t2=HBITS(a); \
-        bl=LBITS(b); bh=HBITS(b); \
-        mul64(t1,t2,bl,bh); \
-        c0=(c0+t1)&BN_MASK2; if ((c0) < t1) t2++; \
-        c1=(c1+t2)&BN_MASK2; if ((c1) < t2) c2++;
-#define mul_add_c2(a,b,c0,c1,c2) \
-        t1=LBITS(a); t2=HBITS(a); \
-        bl=LBITS(b); bh=HBITS(b); \
-        mul64(t1,t2,bl,bh); \
-        if (t2 & BN_TBIT) c2++; \
-        t2=(t2+t2)&BN_MASK2; \
-        if (t1 & BN_TBIT) t2++; \
-        t1=(t1+t1)&BN_MASK2; \
-        c0=(c0+t1)&BN_MASK2;  \
-        if ((c0 < t1) && (((++t2)&BN_MASK2) == 0)) c2++; \
-        c1=(c1+t2)&BN_MASK2; if ((c1) < t2) c2++;
-#define sqr_add_c(a,i,c0,c1,c2) \
-        sqr64(t1,t2,(a)[i]); \
-        c0=(c0+t1)&BN_MASK2; if ((c0) < t1) t2++; \
-        c1=(c1+t2)&BN_MASK2; if ((c1) < t2) c2++;
-#define sqr_add_c2(a,i,j,c0,c1,c2) \
-        mul_add_c2((a)[i],(a)[j],c0,c1,c2)
-#endif /* !BN_LLONG */
-void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-        {
-#ifdef BN_LLONG
-        BN_ULLONG t;
-#else
-        BN_ULONG bl,bh;
-#endif
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        mul_add_c(a[0],b[0],c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        mul_add_c(a[0],b[1],c2,c3,c1);
-        mul_add_c(a[1],b[0],c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        mul_add_c(a[2],b[0],c3,c1,c2);
-        mul_add_c(a[1],b[1],c3,c1,c2);
-        mul_add_c(a[0],b[2],c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        mul_add_c(a[0],b[3],c1,c2,c3);
-        mul_add_c(a[1],b[2],c1,c2,c3);
-        mul_add_c(a[2],b[1],c1,c2,c3);
-        mul_add_c(a[3],b[0],c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        mul_add_c(a[4],b[0],c2,c3,c1);
-        mul_add_c(a[3],b[1],c2,c3,c1);
-        mul_add_c(a[2],b[2],c2,c3,c1);
-        mul_add_c(a[1],b[3],c2,c3,c1);
-        mul_add_c(a[0],b[4],c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        mul_add_c(a[0],b[5],c3,c1,c2);
-        mul_add_c(a[1],b[4],c3,c1,c2);
-        mul_add_c(a[2],b[3],c3,c1,c2);
-        mul_add_c(a[3],b[2],c3,c1,c2);
-        mul_add_c(a[4],b[1],c3,c1,c2);
-        mul_add_c(a[5],b[0],c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        mul_add_c(a[6],b[0],c1,c2,c3);
-        mul_add_c(a[5],b[1],c1,c2,c3);
-        mul_add_c(a[4],b[2],c1,c2,c3);
-        mul_add_c(a[3],b[3],c1,c2,c3);
-        mul_add_c(a[2],b[4],c1,c2,c3);
-        mul_add_c(a[1],b[5],c1,c2,c3);
-        mul_add_c(a[0],b[6],c1,c2,c3);
-        r[6]=c1;
-        c1=0;
-        mul_add_c(a[0],b[7],c2,c3,c1);
-        mul_add_c(a[1],b[6],c2,c3,c1);
-        mul_add_c(a[2],b[5],c2,c3,c1);
-        mul_add_c(a[3],b[4],c2,c3,c1);
-        mul_add_c(a[4],b[3],c2,c3,c1);
-        mul_add_c(a[5],b[2],c2,c3,c1);
-        mul_add_c(a[6],b[1],c2,c3,c1);
-        mul_add_c(a[7],b[0],c2,c3,c1);
-        r[7]=c2;
-        c2=0;
-        mul_add_c(a[7],b[1],c3,c1,c2);
-        mul_add_c(a[6],b[2],c3,c1,c2);
-        mul_add_c(a[5],b[3],c3,c1,c2);
-        mul_add_c(a[4],b[4],c3,c1,c2);
-        mul_add_c(a[3],b[5],c3,c1,c2);
-        mul_add_c(a[2],b[6],c3,c1,c2);
-        mul_add_c(a[1],b[7],c3,c1,c2);
-        r[8]=c3;
-        c3=0;
-        mul_add_c(a[2],b[7],c1,c2,c3);
-        mul_add_c(a[3],b[6],c1,c2,c3);
-        mul_add_c(a[4],b[5],c1,c2,c3);
-        mul_add_c(a[5],b[4],c1,c2,c3);
-        mul_add_c(a[6],b[3],c1,c2,c3);
-        mul_add_c(a[7],b[2],c1,c2,c3);
-        r[9]=c1;
-        c1=0;
-        mul_add_c(a[7],b[3],c2,c3,c1);
-        mul_add_c(a[6],b[4],c2,c3,c1);
-        mul_add_c(a[5],b[5],c2,c3,c1);
-        mul_add_c(a[4],b[6],c2,c3,c1);
-        mul_add_c(a[3],b[7],c2,c3,c1);
-        r[10]=c2;
-        c2=0;
-        mul_add_c(a[4],b[7],c3,c1,c2);
-        mul_add_c(a[5],b[6],c3,c1,c2);
-        mul_add_c(a[6],b[5],c3,c1,c2);
-        mul_add_c(a[7],b[4],c3,c1,c2);
-        r[11]=c3;
-        c3=0;
-        mul_add_c(a[7],b[5],c1,c2,c3);
-        mul_add_c(a[6],b[6],c1,c2,c3);
-        mul_add_c(a[5],b[7],c1,c2,c3);
-        r[12]=c1;
-        c1=0;
-        mul_add_c(a[6],b[7],c2,c3,c1);
-        mul_add_c(a[7],b[6],c2,c3,c1);
-        r[13]=c2;
-        c2=0;
-        mul_add_c(a[7],b[7],c3,c1,c2);
-        r[14]=c3;
-        r[15]=c1;
-        }
-void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-        {
-#ifdef BN_LLONG
-        BN_ULLONG t;
-#else
-        BN_ULONG bl,bh;
-#endif
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        mul_add_c(a[0],b[0],c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        mul_add_c(a[0],b[1],c2,c3,c1);
-        mul_add_c(a[1],b[0],c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        mul_add_c(a[2],b[0],c3,c1,c2);
-        mul_add_c(a[1],b[1],c3,c1,c2);
-        mul_add_c(a[0],b[2],c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        mul_add_c(a[0],b[3],c1,c2,c3);
-        mul_add_c(a[1],b[2],c1,c2,c3);
-        mul_add_c(a[2],b[1],c1,c2,c3);
-        mul_add_c(a[3],b[0],c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        mul_add_c(a[3],b[1],c2,c3,c1);
-        mul_add_c(a[2],b[2],c2,c3,c1);
-        mul_add_c(a[1],b[3],c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        mul_add_c(a[2],b[3],c3,c1,c2);
-        mul_add_c(a[3],b[2],c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        mul_add_c(a[3],b[3],c1,c2,c3);
-        r[6]=c1;
-        r[7]=c2;
-        }
-void bn_sqr_comba8(BN_ULONG *r, const BN_ULONG *a)
-        {
-#ifdef BN_LLONG
-        BN_ULLONG t,tt;
-#else
-        BN_ULONG bl,bh;
-#endif
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        sqr_add_c(a,0,c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        sqr_add_c2(a,1,0,c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        sqr_add_c(a,1,c3,c1,c2);
-        sqr_add_c2(a,2,0,c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        sqr_add_c2(a,3,0,c1,c2,c3);
-        sqr_add_c2(a,2,1,c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        sqr_add_c(a,2,c2,c3,c1);
-        sqr_add_c2(a,3,1,c2,c3,c1);
-        sqr_add_c2(a,4,0,c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        sqr_add_c2(a,5,0,c3,c1,c2);
-        sqr_add_c2(a,4,1,c3,c1,c2);
-        sqr_add_c2(a,3,2,c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        sqr_add_c(a,3,c1,c2,c3);
-        sqr_add_c2(a,4,2,c1,c2,c3);
-        sqr_add_c2(a,5,1,c1,c2,c3);
-        sqr_add_c2(a,6,0,c1,c2,c3);
-        r[6]=c1;
-        c1=0;
-        sqr_add_c2(a,7,0,c2,c3,c1);
-        sqr_add_c2(a,6,1,c2,c3,c1);
-        sqr_add_c2(a,5,2,c2,c3,c1);
-        sqr_add_c2(a,4,3,c2,c3,c1);
-        r[7]=c2;
-        c2=0;
-        sqr_add_c(a,4,c3,c1,c2);
-        sqr_add_c2(a,5,3,c3,c1,c2);
-        sqr_add_c2(a,6,2,c3,c1,c2);
-        sqr_add_c2(a,7,1,c3,c1,c2);
-        r[8]=c3;
-        c3=0;
-        sqr_add_c2(a,7,2,c1,c2,c3);
-        sqr_add_c2(a,6,3,c1,c2,c3);
-        sqr_add_c2(a,5,4,c1,c2,c3);
-        r[9]=c1;
-        c1=0;
-        sqr_add_c(a,5,c2,c3,c1);
-        sqr_add_c2(a,6,4,c2,c3,c1);
-        sqr_add_c2(a,7,3,c2,c3,c1);
-        r[10]=c2;
-        c2=0;
-        sqr_add_c2(a,7,4,c3,c1,c2);
-        sqr_add_c2(a,6,5,c3,c1,c2);
-        r[11]=c3;
-        c3=0;
-        sqr_add_c(a,6,c1,c2,c3);
-        sqr_add_c2(a,7,5,c1,c2,c3);
-        r[12]=c1;
-        c1=0;
-        sqr_add_c2(a,7,6,c2,c3,c1);
-        r[13]=c2;
-        c2=0;
-        sqr_add_c(a,7,c3,c1,c2);
-        r[14]=c3;
-        r[15]=c1;
-        }
-void bn_sqr_comba4(BN_ULONG *r, const BN_ULONG *a)
-        {
-#ifdef BN_LLONG
-        BN_ULLONG t,tt;
-#else
-        BN_ULONG bl,bh;
-#endif
-        BN_ULONG t1,t2;
-        BN_ULONG c1,c2,c3;
-        c1=0;
-        c2=0;
-        c3=0;
-        sqr_add_c(a,0,c1,c2,c3);
-        r[0]=c1;
-        c1=0;
-        sqr_add_c2(a,1,0,c2,c3,c1);
-        r[1]=c2;
-        c2=0;
-        sqr_add_c(a,1,c3,c1,c2);
-        sqr_add_c2(a,2,0,c3,c1,c2);
-        r[2]=c3;
-        c3=0;
-        sqr_add_c2(a,3,0,c1,c2,c3);
-        sqr_add_c2(a,2,1,c1,c2,c3);
-        r[3]=c1;
-        c1=0;
-        sqr_add_c(a,2,c2,c3,c1);
-        sqr_add_c2(a,3,1,c2,c3,c1);
-        r[4]=c2;
-        c2=0;
-        sqr_add_c2(a,3,2,c3,c1,c2);
-        r[5]=c3;
-        c3=0;
-        sqr_add_c(a,3,c1,c2,c3);
-        r[6]=c1;
-        r[7]=c2;
-        }
-#else /* !BN_MUL_COMBA */
-/* hmm... is it faster just to do a multiply? */
-#undef bn_sqr_comba4
-void bn_sqr_comba4(BN_ULONG *r, BN_ULONG *a)
-        {
-        BN_ULONG t[8];
-        bn_sqr_normal(r,a,4,t);
-        }
-#undef bn_sqr_comba8
-void bn_sqr_comba8(BN_ULONG *r, BN_ULONG *a)
-        {
-        BN_ULONG t[16];
-        bn_sqr_normal(r,a,8,t);
-        }
-void bn_mul_comba4(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-        {
-        r[4]=bn_mul_words(    &(r[0]),a,4,b[0]);
-        r[5]=bn_mul_add_words(&(r[1]),a,4,b[1]);
-        r[6]=bn_mul_add_words(&(r[2]),a,4,b[2]);
-        r[7]=bn_mul_add_words(&(r[3]),a,4,b[3]);
-        }
-void bn_mul_comba8(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b)
-        {
-        r[ 8]=bn_mul_words(    &(r[0]),a,8,b[0]);
-        r[ 9]=bn_mul_add_words(&(r[1]),a,8,b[1]);
-        r[10]=bn_mul_add_words(&(r[2]),a,8,b[2]);
-        r[11]=bn_mul_add_words(&(r[3]),a,8,b[3]);
-        r[12]=bn_mul_add_words(&(r[4]),a,8,b[4]);
-        r[13]=bn_mul_add_words(&(r[5]),a,8,b[5]);
-        r[14]=bn_mul_add_words(&(r[6]),a,8,b[6]);
-        r[15]=bn_mul_add_words(&(r[7]),a,8,b[7]);
-        }
-#endif /* !BN_MUL_COMBA */
diff --git a/src/lib/libcrypto/bn/bn_blind.c b/src/lib/libcrypto/bn/bn_blind.c
deleted file mode 100644
index c11fb4ccc2..0000000000
--- a/src/lib/libcrypto/bn/bn_blind.c
+++ /dev/null
@@ -1,365 +0,0 @@
-/* crypto/bn/bn_blind.c */
-/* ====================================================================
- * Copyright (c) 1998-2005 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#define BN_BLINDING_COUNTER     32
-struct bn_blinding_st
-        {
-        BIGNUM *A;
-        BIGNUM *Ai;
-        BIGNUM *e;
-        BIGNUM *mod; /* just a reference */
-        unsigned long thread_id; /* added in OpenSSL 0.9.6j and 0.9.7b;
-                                  * used only by crypto/rsa/rsa_eay.c, rsa_lib.c */
-        unsigned int  counter;
-        unsigned long flags;
-        BN_MONT_CTX *m_ctx;
-        int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-                          const BIGNUM *m, BN_CTX *ctx,
-                          BN_MONT_CTX *m_ctx);
-        };
-BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, /* const */ BIGNUM *mod)
-        {
-        BN_BLINDING *ret=NULL;
-        bn_check_top(mod);
-        if ((ret=(BN_BLINDING *)OPENSSL_malloc(sizeof(BN_BLINDING))) == NULL)
-                {
-                BNerr(BN_F_BN_BLINDING_NEW,ERR_R_MALLOC_FAILURE);
-                return(NULL);
-                }
-        memset(ret,0,sizeof(BN_BLINDING));
-        if (A != NULL)
-                {
-                if ((ret->A  = BN_dup(A))  == NULL) goto err;
-                }
-        if (Ai != NULL)
-                {
-                if ((ret->Ai = BN_dup(Ai)) == NULL) goto err;
-                }
-        /* save a copy of mod in the BN_BLINDING structure */
-        if ((ret->mod = BN_dup(mod)) == NULL) goto err;
-        if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)
-                BN_set_flags(ret->mod, BN_FLG_CONSTTIME);
-        ret->counter = BN_BLINDING_COUNTER;
-        return(ret);
-err:
-        if (ret != NULL) BN_BLINDING_free(ret);
-        return(NULL);
-        }
-void BN_BLINDING_free(BN_BLINDING *r)
-        {
-        if(r == NULL)
-            return;
-        if (r->A  != NULL) BN_free(r->A );
-        if (r->Ai != NULL) BN_free(r->Ai);
-        if (r->e  != NULL) BN_free(r->e );
-        if (r->mod != NULL) BN_free(r->mod); 
-        OPENSSL_free(r);
-        }
-int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
-        {
-        int ret=0;
-        if ((b->A == NULL) || (b->Ai == NULL))
-                {
-                BNerr(BN_F_BN_BLINDING_UPDATE,BN_R_NOT_INITIALIZED);
-                goto err;
-                }
-        if (--(b->counter) == 0 && b->e != NULL &&
-                !(b->flags & BN_BLINDING_NO_RECREATE))
-                {
-                /* re-create blinding parameters */
-                if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL))
-                        goto err;
-                }
-        else if (!(b->flags & BN_BLINDING_NO_UPDATE))
-                {
-                if (!BN_mod_mul(b->A,b->A,b->A,b->mod,ctx)) goto err;
-                if (!BN_mod_mul(b->Ai,b->Ai,b->Ai,b->mod,ctx)) goto err;
-                }
-        ret=1;
-err:
-        if (b->counter == 0)
-                b->counter = BN_BLINDING_COUNTER;
-        return(ret);
-        }
-int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
-        {
-        return BN_BLINDING_convert_ex(n, NULL, b, ctx);
-        }
-int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
-        {
-        int ret = 1;
-        bn_check_top(n);
-        if ((b->A == NULL) || (b->Ai == NULL))
-                {
-                BNerr(BN_F_BN_BLINDING_CONVERT_EX,BN_R_NOT_INITIALIZED);
-                return(0);
-                }
-        if (r != NULL)
-                {
-                if (!BN_copy(r, b->Ai)) ret=0;
-                }
-        if (!BN_mod_mul(n,n,b->A,b->mod,ctx)) ret=0;
-        
-        return ret;
-        }
-int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
-        {
-        return BN_BLINDING_invert_ex(n, NULL, b, ctx);
-        }
-int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
-        {
-        int ret;
-        bn_check_top(n);
-        if ((b->A == NULL) || (b->Ai == NULL))
-                {
-                BNerr(BN_F_BN_BLINDING_INVERT_EX,BN_R_NOT_INITIALIZED);
-                return(0);
-                }
-        if (r != NULL)
-                ret = BN_mod_mul(n, n, r, b->mod, ctx);
-        else
-                ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx);
-        if (ret >= 0)
-                {
-                if (!BN_BLINDING_update(b,ctx))
-                        return(0);
-                }
-        bn_check_top(n);
-        return(ret);
-        }
-unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *b)
-        {
-        return b->thread_id;
-        }
-void BN_BLINDING_set_thread_id(BN_BLINDING *b, unsigned long n)
-        {
-        b->thread_id = n;
-        }
-unsigned long BN_BLINDING_get_flags(const BN_BLINDING *b)
-        {
-        return b->flags;
-        }
-void BN_BLINDING_set_flags(BN_BLINDING *b, unsigned long flags)
-        {
-        b->flags = flags;
-        }
-BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
-        const BIGNUM *e, /* const */ BIGNUM *m, BN_CTX *ctx,
-        int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-                          const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
-        BN_MONT_CTX *m_ctx)
-{
-        int    retry_counter = 32;
-        BN_BLINDING *ret = NULL;
-        if (b == NULL)
-                ret = BN_BLINDING_new(NULL, NULL, m);
-        else
-                ret = b;
-        if (ret == NULL)
-                goto err;
-        if (ret->A  == NULL && (ret->A  = BN_new()) == NULL)
-                goto err;
-        if (ret->Ai == NULL && (ret->Ai = BN_new()) == NULL)
-                goto err;
-        if (e != NULL)
-                {
-                if (ret->e != NULL)
-                        BN_free(ret->e);
-                ret->e = BN_dup(e);
-                }
-        if (ret->e == NULL)
-                goto err;
-        if (bn_mod_exp != NULL)
-                ret->bn_mod_exp = bn_mod_exp;
-        if (m_ctx != NULL)
-                ret->m_ctx = m_ctx;
-        do {
-                if (!BN_rand_range(ret->A, ret->mod)) goto err;
-                if (BN_mod_inverse(ret->Ai, ret->A, ret->mod, ctx) == NULL)
-                        {
-                        /* this should almost never happen for good RSA keys */
-                        unsigned long error = ERR_peek_last_error();
-                        if (ERR_GET_REASON(error) == BN_R_NO_INVERSE)
-                                {
-                                if (retry_counter-- == 0)
-                                {
-                                        BNerr(BN_F_BN_BLINDING_CREATE_PARAM,
-                                                BN_R_TOO_MANY_ITERATIONS);
-                                        goto err;
-                                }
-                                ERR_clear_error();
-                                }
-                        else
-                                goto err;
-                        }
-                else
-                        break;
-        } while (1);
-        if (ret->bn_mod_exp != NULL && ret->m_ctx != NULL)
-                {
-                if (!ret->bn_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx, ret->m_ctx))
-                        goto err;
-                }
-        else
-                {
-                if (!BN_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx))
-                        goto err;
-                }
-        return ret;
-err:
-        if (b == NULL && ret != NULL)
-                {
-                BN_BLINDING_free(ret);
-                ret = NULL;
-                }
-        return ret;
-}
diff --git a/src/lib/libcrypto/bn/bn_const.c b/src/lib/libcrypto/bn/bn_const.c
deleted file mode 100644
index eb60a25b3c..0000000000
--- a/src/lib/libcrypto/bn/bn_const.c
+++ /dev/null
@@ -1,402 +0,0 @@
-/* crypto/bn/knownprimes.c */
-/* Insert boilerplate */
-#include "bn.h"
-/* "First Oakley Default Group" from RFC2409, section 6.1.
- *
- * The prime is: 2^768 - 2 ^704 - 1 + 2^64 * { [2^638 pi] + 149686 }
- *
- * RFC2409 specifies a generator of 2.
- * RFC2412 specifies a generator of of 22.
- */
-BIGNUM *get_rfc2409_prime_768(BIGNUM *bn)
-        {
-        static const unsigned char RFC2409_PRIME_768[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x3A,0x36,0x20,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC2409_PRIME_768,sizeof(RFC2409_PRIME_768),bn);
-        }
-/* "Second Oakley Default Group" from RFC2409, section 6.2.
- *
- * The prime is: 2^1024 - 2^960 - 1 + 2^64 * { [2^894 pi] + 129093 }.
- *
- * RFC2409 specifies a generator of 2.
- * RFC2412 specifies a generator of 22.
- */
-BIGNUM *get_rfc2409_prime_1024(BIGNUM *bn)
-        {
-        static const unsigned char RFC2409_PRIME_1024[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE6,0x53,0x81,
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC2409_PRIME_1024,sizeof(RFC2409_PRIME_1024),bn);
-        }
-/* "1536-bit MODP Group" from RFC3526, Section 2.
- *
- * The prime is: 2^1536 - 2^1472 - 1 + 2^64 * { [2^1406 pi] + 741804 }
- *
- * RFC3526 specifies a generator of 2.
- * RFC2312 specifies a generator of 22.
- */
-BIGNUM *get_rfc3526_prime_1536(BIGNUM *bn)
-        {
-        static const unsigned char RFC3526_PRIME_1536[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE4,0x5B,0x3D,
-                0xC2,0x00,0x7C,0xB8,0xA1,0x63,0xBF,0x05,0x98,0xDA,0x48,0x36,
-                0x1C,0x55,0xD3,0x9A,0x69,0x16,0x3F,0xA8,0xFD,0x24,0xCF,0x5F,
-                0x83,0x65,0x5D,0x23,0xDC,0xA3,0xAD,0x96,0x1C,0x62,0xF3,0x56,
-                0x20,0x85,0x52,0xBB,0x9E,0xD5,0x29,0x07,0x70,0x96,0x96,0x6D,
-                0x67,0x0C,0x35,0x4E,0x4A,0xBC,0x98,0x04,0xF1,0x74,0x6C,0x08,
-                0xCA,0x23,0x73,0x27,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC3526_PRIME_1536,sizeof(RFC3526_PRIME_1536),bn);
-        }
-/* "2048-bit MODP Group" from RFC3526, Section 3.
- *
- * The prime is: 2^2048 - 2^1984 - 1 + 2^64 * { [2^1918 pi] + 124476 }
- *
- * RFC3526 specifies a generator of 2.
- */
-BIGNUM *get_rfc3526_prime_2048(BIGNUM *bn)
-        {
-        static const unsigned char RFC3526_PRIME_2048[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE4,0x5B,0x3D,
-                0xC2,0x00,0x7C,0xB8,0xA1,0x63,0xBF,0x05,0x98,0xDA,0x48,0x36,
-                0x1C,0x55,0xD3,0x9A,0x69,0x16,0x3F,0xA8,0xFD,0x24,0xCF,0x5F,
-                0x83,0x65,0x5D,0x23,0xDC,0xA3,0xAD,0x96,0x1C,0x62,0xF3,0x56,
-                0x20,0x85,0x52,0xBB,0x9E,0xD5,0x29,0x07,0x70,0x96,0x96,0x6D,
-                0x67,0x0C,0x35,0x4E,0x4A,0xBC,0x98,0x04,0xF1,0x74,0x6C,0x08,
-                0xCA,0x18,0x21,0x7C,0x32,0x90,0x5E,0x46,0x2E,0x36,0xCE,0x3B,
-                0xE3,0x9E,0x77,0x2C,0x18,0x0E,0x86,0x03,0x9B,0x27,0x83,0xA2,
-                0xEC,0x07,0xA2,0x8F,0xB5,0xC5,0x5D,0xF0,0x6F,0x4C,0x52,0xC9,
-                0xDE,0x2B,0xCB,0xF6,0x95,0x58,0x17,0x18,0x39,0x95,0x49,0x7C,
-                0xEA,0x95,0x6A,0xE5,0x15,0xD2,0x26,0x18,0x98,0xFA,0x05,0x10,
-                0x15,0x72,0x8E,0x5A,0x8A,0xAC,0xAA,0x68,0xFF,0xFF,0xFF,0xFF,
-                0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC3526_PRIME_2048,sizeof(RFC3526_PRIME_2048),bn);
-        }
-/* "3072-bit MODP Group" from RFC3526, Section 4.
- *
- * The prime is: 2^3072 - 2^3008 - 1 + 2^64 * { [2^2942 pi] + 1690314 }
- *
- * RFC3526 specifies a generator of 2.
- */
-BIGNUM *get_rfc3526_prime_3072(BIGNUM *bn)
-        {
-        static const unsigned char RFC3526_PRIME_3072[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE4,0x5B,0x3D,
-                0xC2,0x00,0x7C,0xB8,0xA1,0x63,0xBF,0x05,0x98,0xDA,0x48,0x36,
-                0x1C,0x55,0xD3,0x9A,0x69,0x16,0x3F,0xA8,0xFD,0x24,0xCF,0x5F,
-                0x83,0x65,0x5D,0x23,0xDC,0xA3,0xAD,0x96,0x1C,0x62,0xF3,0x56,
-                0x20,0x85,0x52,0xBB,0x9E,0xD5,0x29,0x07,0x70,0x96,0x96,0x6D,
-                0x67,0x0C,0x35,0x4E,0x4A,0xBC,0x98,0x04,0xF1,0x74,0x6C,0x08,
-                0xCA,0x18,0x21,0x7C,0x32,0x90,0x5E,0x46,0x2E,0x36,0xCE,0x3B,
-                0xE3,0x9E,0x77,0x2C,0x18,0x0E,0x86,0x03,0x9B,0x27,0x83,0xA2,
-                0xEC,0x07,0xA2,0x8F,0xB5,0xC5,0x5D,0xF0,0x6F,0x4C,0x52,0xC9,
-                0xDE,0x2B,0xCB,0xF6,0x95,0x58,0x17,0x18,0x39,0x95,0x49,0x7C,
-                0xEA,0x95,0x6A,0xE5,0x15,0xD2,0x26,0x18,0x98,0xFA,0x05,0x10,
-                0x15,0x72,0x8E,0x5A,0x8A,0xAA,0xC4,0x2D,0xAD,0x33,0x17,0x0D,
-                0x04,0x50,0x7A,0x33,0xA8,0x55,0x21,0xAB,0xDF,0x1C,0xBA,0x64,
-                0xEC,0xFB,0x85,0x04,0x58,0xDB,0xEF,0x0A,0x8A,0xEA,0x71,0x57,
-                0x5D,0x06,0x0C,0x7D,0xB3,0x97,0x0F,0x85,0xA6,0xE1,0xE4,0xC7,
-                0xAB,0xF5,0xAE,0x8C,0xDB,0x09,0x33,0xD7,0x1E,0x8C,0x94,0xE0,
-                0x4A,0x25,0x61,0x9D,0xCE,0xE3,0xD2,0x26,0x1A,0xD2,0xEE,0x6B,
-                0xF1,0x2F,0xFA,0x06,0xD9,0x8A,0x08,0x64,0xD8,0x76,0x02,0x73,
-                0x3E,0xC8,0x6A,0x64,0x52,0x1F,0x2B,0x18,0x17,0x7B,0x20,0x0C,
-                0xBB,0xE1,0x17,0x57,0x7A,0x61,0x5D,0x6C,0x77,0x09,0x88,0xC0,
-                0xBA,0xD9,0x46,0xE2,0x08,0xE2,0x4F,0xA0,0x74,0xE5,0xAB,0x31,
-                0x43,0xDB,0x5B,0xFC,0xE0,0xFD,0x10,0x8E,0x4B,0x82,0xD1,0x20,
-                0xA9,0x3A,0xD2,0xCA,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC3526_PRIME_3072,sizeof(RFC3526_PRIME_3072),bn);
-        }
-/* "4096-bit MODP Group" from RFC3526, Section 5.
- *
- * The prime is: 2^4096 - 2^4032 - 1 + 2^64 * { [2^3966 pi] + 240904 }
- *
- * RFC3526 specifies a generator of 2.
- */
-BIGNUM *get_rfc3526_prime_4096(BIGNUM *bn)
-        {
-        static const unsigned char RFC3526_PRIME_4096[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE4,0x5B,0x3D,
-                0xC2,0x00,0x7C,0xB8,0xA1,0x63,0xBF,0x05,0x98,0xDA,0x48,0x36,
-                0x1C,0x55,0xD3,0x9A,0x69,0x16,0x3F,0xA8,0xFD,0x24,0xCF,0x5F,
-                0x83,0x65,0x5D,0x23,0xDC,0xA3,0xAD,0x96,0x1C,0x62,0xF3,0x56,
-                0x20,0x85,0x52,0xBB,0x9E,0xD5,0x29,0x07,0x70,0x96,0x96,0x6D,
-                0x67,0x0C,0x35,0x4E,0x4A,0xBC,0x98,0x04,0xF1,0x74,0x6C,0x08,
-                0xCA,0x18,0x21,0x7C,0x32,0x90,0x5E,0x46,0x2E,0x36,0xCE,0x3B,
-                0xE3,0x9E,0x77,0x2C,0x18,0x0E,0x86,0x03,0x9B,0x27,0x83,0xA2,
-                0xEC,0x07,0xA2,0x8F,0xB5,0xC5,0x5D,0xF0,0x6F,0x4C,0x52,0xC9,
-                0xDE,0x2B,0xCB,0xF6,0x95,0x58,0x17,0x18,0x39,0x95,0x49,0x7C,
-                0xEA,0x95,0x6A,0xE5,0x15,0xD2,0x26,0x18,0x98,0xFA,0x05,0x10,
-                0x15,0x72,0x8E,0x5A,0x8A,0xAA,0xC4,0x2D,0xAD,0x33,0x17,0x0D,
-                0x04,0x50,0x7A,0x33,0xA8,0x55,0x21,0xAB,0xDF,0x1C,0xBA,0x64,
-                0xEC,0xFB,0x85,0x04,0x58,0xDB,0xEF,0x0A,0x8A,0xEA,0x71,0x57,
-                0x5D,0x06,0x0C,0x7D,0xB3,0x97,0x0F,0x85,0xA6,0xE1,0xE4,0xC7,
-                0xAB,0xF5,0xAE,0x8C,0xDB,0x09,0x33,0xD7,0x1E,0x8C,0x94,0xE0,
-                0x4A,0x25,0x61,0x9D,0xCE,0xE3,0xD2,0x26,0x1A,0xD2,0xEE,0x6B,
-                0xF1,0x2F,0xFA,0x06,0xD9,0x8A,0x08,0x64,0xD8,0x76,0x02,0x73,
-                0x3E,0xC8,0x6A,0x64,0x52,0x1F,0x2B,0x18,0x17,0x7B,0x20,0x0C,
-                0xBB,0xE1,0x17,0x57,0x7A,0x61,0x5D,0x6C,0x77,0x09,0x88,0xC0,
-                0xBA,0xD9,0x46,0xE2,0x08,0xE2,0x4F,0xA0,0x74,0xE5,0xAB,0x31,
-                0x43,0xDB,0x5B,0xFC,0xE0,0xFD,0x10,0x8E,0x4B,0x82,0xD1,0x20,
-                0xA9,0x21,0x08,0x01,0x1A,0x72,0x3C,0x12,0xA7,0x87,0xE6,0xD7,
-                0x88,0x71,0x9A,0x10,0xBD,0xBA,0x5B,0x26,0x99,0xC3,0x27,0x18,
-                0x6A,0xF4,0xE2,0x3C,0x1A,0x94,0x68,0x34,0xB6,0x15,0x0B,0xDA,
-                0x25,0x83,0xE9,0xCA,0x2A,0xD4,0x4C,0xE8,0xDB,0xBB,0xC2,0xDB,
-                0x04,0xDE,0x8E,0xF9,0x2E,0x8E,0xFC,0x14,0x1F,0xBE,0xCA,0xA6,
-                0x28,0x7C,0x59,0x47,0x4E,0x6B,0xC0,0x5D,0x99,0xB2,0x96,0x4F,
-                0xA0,0x90,0xC3,0xA2,0x23,0x3B,0xA1,0x86,0x51,0x5B,0xE7,0xED,
-                0x1F,0x61,0x29,0x70,0xCE,0xE2,0xD7,0xAF,0xB8,0x1B,0xDD,0x76,
-                0x21,0x70,0x48,0x1C,0xD0,0x06,0x91,0x27,0xD5,0xB0,0x5A,0xA9,
-                0x93,0xB4,0xEA,0x98,0x8D,0x8F,0xDD,0xC1,0x86,0xFF,0xB7,0xDC,
-                0x90,0xA6,0xC0,0x8F,0x4D,0xF4,0x35,0xC9,0x34,0x06,0x31,0x99,
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC3526_PRIME_4096,sizeof(RFC3526_PRIME_4096),bn);
-        }
-/* "6144-bit MODP Group" from RFC3526, Section 6.
- *
- * The prime is: 2^6144 - 2^6080 - 1 + 2^64 * { [2^6014 pi] + 929484 }
- *
- * RFC3526 specifies a generator of 2.
- */
-BIGNUM *get_rfc3526_prime_6144(BIGNUM *bn)
-        {
-        static const unsigned char RFC3526_PRIME_6144[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE4,0x5B,0x3D,
-                0xC2,0x00,0x7C,0xB8,0xA1,0x63,0xBF,0x05,0x98,0xDA,0x48,0x36,
-                0x1C,0x55,0xD3,0x9A,0x69,0x16,0x3F,0xA8,0xFD,0x24,0xCF,0x5F,
-                0x83,0x65,0x5D,0x23,0xDC,0xA3,0xAD,0x96,0x1C,0x62,0xF3,0x56,
-                0x20,0x85,0x52,0xBB,0x9E,0xD5,0x29,0x07,0x70,0x96,0x96,0x6D,
-                0x67,0x0C,0x35,0x4E,0x4A,0xBC,0x98,0x04,0xF1,0x74,0x6C,0x08,
-                0xCA,0x18,0x21,0x7C,0x32,0x90,0x5E,0x46,0x2E,0x36,0xCE,0x3B,
-                0xE3,0x9E,0x77,0x2C,0x18,0x0E,0x86,0x03,0x9B,0x27,0x83,0xA2,
-                0xEC,0x07,0xA2,0x8F,0xB5,0xC5,0x5D,0xF0,0x6F,0x4C,0x52,0xC9,
-                0xDE,0x2B,0xCB,0xF6,0x95,0x58,0x17,0x18,0x39,0x95,0x49,0x7C,
-                0xEA,0x95,0x6A,0xE5,0x15,0xD2,0x26,0x18,0x98,0xFA,0x05,0x10,
-                0x15,0x72,0x8E,0x5A,0x8A,0xAA,0xC4,0x2D,0xAD,0x33,0x17,0x0D,
-                0x04,0x50,0x7A,0x33,0xA8,0x55,0x21,0xAB,0xDF,0x1C,0xBA,0x64,
-                0xEC,0xFB,0x85,0x04,0x58,0xDB,0xEF,0x0A,0x8A,0xEA,0x71,0x57,
-                0x5D,0x06,0x0C,0x7D,0xB3,0x97,0x0F,0x85,0xA6,0xE1,0xE4,0xC7,
-                0xAB,0xF5,0xAE,0x8C,0xDB,0x09,0x33,0xD7,0x1E,0x8C,0x94,0xE0,
-                0x4A,0x25,0x61,0x9D,0xCE,0xE3,0xD2,0x26,0x1A,0xD2,0xEE,0x6B,
-                0xF1,0x2F,0xFA,0x06,0xD9,0x8A,0x08,0x64,0xD8,0x76,0x02,0x73,
-                0x3E,0xC8,0x6A,0x64,0x52,0x1F,0x2B,0x18,0x17,0x7B,0x20,0x0C,
-                0xBB,0xE1,0x17,0x57,0x7A,0x61,0x5D,0x6C,0x77,0x09,0x88,0xC0,
-                0xBA,0xD9,0x46,0xE2,0x08,0xE2,0x4F,0xA0,0x74,0xE5,0xAB,0x31,
-                0x43,0xDB,0x5B,0xFC,0xE0,0xFD,0x10,0x8E,0x4B,0x82,0xD1,0x20,
-                0xA9,0x21,0x08,0x01,0x1A,0x72,0x3C,0x12,0xA7,0x87,0xE6,0xD7,
-                0x88,0x71,0x9A,0x10,0xBD,0xBA,0x5B,0x26,0x99,0xC3,0x27,0x18,
-                0x6A,0xF4,0xE2,0x3C,0x1A,0x94,0x68,0x34,0xB6,0x15,0x0B,0xDA,
-                0x25,0x83,0xE9,0xCA,0x2A,0xD4,0x4C,0xE8,0xDB,0xBB,0xC2,0xDB,
-                0x04,0xDE,0x8E,0xF9,0x2E,0x8E,0xFC,0x14,0x1F,0xBE,0xCA,0xA6,
-                0x28,0x7C,0x59,0x47,0x4E,0x6B,0xC0,0x5D,0x99,0xB2,0x96,0x4F,
-                0xA0,0x90,0xC3,0xA2,0x23,0x3B,0xA1,0x86,0x51,0x5B,0xE7,0xED,
-                0x1F,0x61,0x29,0x70,0xCE,0xE2,0xD7,0xAF,0xB8,0x1B,0xDD,0x76,
-                0x21,0x70,0x48,0x1C,0xD0,0x06,0x91,0x27,0xD5,0xB0,0x5A,0xA9,
-                0x93,0xB4,0xEA,0x98,0x8D,0x8F,0xDD,0xC1,0x86,0xFF,0xB7,0xDC,
-                0x90,0xA6,0xC0,0x8F,0x4D,0xF4,0x35,0xC9,0x34,0x02,0x84,0x92,
-                0x36,0xC3,0xFA,0xB4,0xD2,0x7C,0x70,0x26,0xC1,0xD4,0xDC,0xB2,
-                0x60,0x26,0x46,0xDE,0xC9,0x75,0x1E,0x76,0x3D,0xBA,0x37,0xBD,
-                0xF8,0xFF,0x94,0x06,0xAD,0x9E,0x53,0x0E,0xE5,0xDB,0x38,0x2F,
-                0x41,0x30,0x01,0xAE,0xB0,0x6A,0x53,0xED,0x90,0x27,0xD8,0x31,
-                0x17,0x97,0x27,0xB0,0x86,0x5A,0x89,0x18,0xDA,0x3E,0xDB,0xEB,
-                0xCF,0x9B,0x14,0xED,0x44,0xCE,0x6C,0xBA,0xCE,0xD4,0xBB,0x1B,
-                0xDB,0x7F,0x14,0x47,0xE6,0xCC,0x25,0x4B,0x33,0x20,0x51,0x51,
-                0x2B,0xD7,0xAF,0x42,0x6F,0xB8,0xF4,0x01,0x37,0x8C,0xD2,0xBF,
-                0x59,0x83,0xCA,0x01,0xC6,0x4B,0x92,0xEC,0xF0,0x32,0xEA,0x15,
-                0xD1,0x72,0x1D,0x03,0xF4,0x82,0xD7,0xCE,0x6E,0x74,0xFE,0xF6,
-                0xD5,0x5E,0x70,0x2F,0x46,0x98,0x0C,0x82,0xB5,0xA8,0x40,0x31,
-                0x90,0x0B,0x1C,0x9E,0x59,0xE7,0xC9,0x7F,0xBE,0xC7,0xE8,0xF3,
-                0x23,0xA9,0x7A,0x7E,0x36,0xCC,0x88,0xBE,0x0F,0x1D,0x45,0xB7,
-                0xFF,0x58,0x5A,0xC5,0x4B,0xD4,0x07,0xB2,0x2B,0x41,0x54,0xAA,
-                0xCC,0x8F,0x6D,0x7E,0xBF,0x48,0xE1,0xD8,0x14,0xCC,0x5E,0xD2,
-                0x0F,0x80,0x37,0xE0,0xA7,0x97,0x15,0xEE,0xF2,0x9B,0xE3,0x28,
-                0x06,0xA1,0xD5,0x8B,0xB7,0xC5,0xDA,0x76,0xF5,0x50,0xAA,0x3D,
-                0x8A,0x1F,0xBF,0xF0,0xEB,0x19,0xCC,0xB1,0xA3,0x13,0xD5,0x5C,
-                0xDA,0x56,0xC9,0xEC,0x2E,0xF2,0x96,0x32,0x38,0x7F,0xE8,0xD7,
-                0x6E,0x3C,0x04,0x68,0x04,0x3E,0x8F,0x66,0x3F,0x48,0x60,0xEE,
-                0x12,0xBF,0x2D,0x5B,0x0B,0x74,0x74,0xD6,0xE6,0x94,0xF9,0x1E,
-                0x6D,0xCC,0x40,0x24,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC3526_PRIME_6144,sizeof(RFC3526_PRIME_6144),bn);
-        }
-/* "8192-bit MODP Group" from RFC3526, Section 7.
- *
- * The prime is: 2^8192 - 2^8128 - 1 + 2^64 * { [2^8062 pi] + 4743158 }
- *
- * RFC3526 specifies a generator of 2.
- */
-BIGNUM *get_rfc3526_prime_8192(BIGNUM *bn)
-        {
-        static const unsigned char RFC3526_PRIME_8192[]={
-                0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xC9,0x0F,0xDA,0xA2,
-                0x21,0x68,0xC2,0x34,0xC4,0xC6,0x62,0x8B,0x80,0xDC,0x1C,0xD1,
-                0x29,0x02,0x4E,0x08,0x8A,0x67,0xCC,0x74,0x02,0x0B,0xBE,0xA6,
-                0x3B,0x13,0x9B,0x22,0x51,0x4A,0x08,0x79,0x8E,0x34,0x04,0xDD,
-                0xEF,0x95,0x19,0xB3,0xCD,0x3A,0x43,0x1B,0x30,0x2B,0x0A,0x6D,
-                0xF2,0x5F,0x14,0x37,0x4F,0xE1,0x35,0x6D,0x6D,0x51,0xC2,0x45,
-                0xE4,0x85,0xB5,0x76,0x62,0x5E,0x7E,0xC6,0xF4,0x4C,0x42,0xE9,
-                0xA6,0x37,0xED,0x6B,0x0B,0xFF,0x5C,0xB6,0xF4,0x06,0xB7,0xED,
-                0xEE,0x38,0x6B,0xFB,0x5A,0x89,0x9F,0xA5,0xAE,0x9F,0x24,0x11,
-                0x7C,0x4B,0x1F,0xE6,0x49,0x28,0x66,0x51,0xEC,0xE4,0x5B,0x3D,
-                0xC2,0x00,0x7C,0xB8,0xA1,0x63,0xBF,0x05,0x98,0xDA,0x48,0x36,
-                0x1C,0x55,0xD3,0x9A,0x69,0x16,0x3F,0xA8,0xFD,0x24,0xCF,0x5F,
-                0x83,0x65,0x5D,0x23,0xDC,0xA3,0xAD,0x96,0x1C,0x62,0xF3,0x56,
-                0x20,0x85,0x52,0xBB,0x9E,0xD5,0x29,0x07,0x70,0x96,0x96,0x6D,
-                0x67,0x0C,0x35,0x4E,0x4A,0xBC,0x98,0x04,0xF1,0x74,0x6C,0x08,
-                0xCA,0x18,0x21,0x7C,0x32,0x90,0x5E,0x46,0x2E,0x36,0xCE,0x3B,
-                0xE3,0x9E,0x77,0x2C,0x18,0x0E,0x86,0x03,0x9B,0x27,0x83,0xA2,
-                0xEC,0x07,0xA2,0x8F,0xB5,0xC5,0x5D,0xF0,0x6F,0x4C,0x52,0xC9,
-                0xDE,0x2B,0xCB,0xF6,0x95,0x58,0x17,0x18,0x39,0x95,0x49,0x7C,
-                0xEA,0x95,0x6A,0xE5,0x15,0xD2,0x26,0x18,0x98,0xFA,0x05,0x10,
-                0x15,0x72,0x8E,0x5A,0x8A,0xAA,0xC4,0x2D,0xAD,0x33,0x17,0x0D,
-                0x04,0x50,0x7A,0x33,0xA8,0x55,0x21,0xAB,0xDF,0x1C,0xBA,0x64,
-                0xEC,0xFB,0x85,0x04,0x58,0xDB,0xEF,0x0A,0x8A,0xEA,0x71,0x57,
-                0x5D,0x06,0x0C,0x7D,0xB3,0x97,0x0F,0x85,0xA6,0xE1,0xE4,0xC7,
-                0xAB,0xF5,0xAE,0x8C,0xDB,0x09,0x33,0xD7,0x1E,0x8C,0x94,0xE0,
-                0x4A,0x25,0x61,0x9D,0xCE,0xE3,0xD2,0x26,0x1A,0xD2,0xEE,0x6B,
-                0xF1,0x2F,0xFA,0x06,0xD9,0x8A,0x08,0x64,0xD8,0x76,0x02,0x73,
-                0x3E,0xC8,0x6A,0x64,0x52,0x1F,0x2B,0x18,0x17,0x7B,0x20,0x0C,
-                0xBB,0xE1,0x17,0x57,0x7A,0x61,0x5D,0x6C,0x77,0x09,0x88,0xC0,
-                0xBA,0xD9,0x46,0xE2,0x08,0xE2,0x4F,0xA0,0x74,0xE5,0xAB,0x31,
-                0x43,0xDB,0x5B,0xFC,0xE0,0xFD,0x10,0x8E,0x4B,0x82,0xD1,0x20,
-                0xA9,0x21,0x08,0x01,0x1A,0x72,0x3C,0x12,0xA7,0x87,0xE6,0xD7,
-                0x88,0x71,0x9A,0x10,0xBD,0xBA,0x5B,0x26,0x99,0xC3,0x27,0x18,
-                0x6A,0xF4,0xE2,0x3C,0x1A,0x94,0x68,0x34,0xB6,0x15,0x0B,0xDA,
-                0x25,0x83,0xE9,0xCA,0x2A,0xD4,0x4C,0xE8,0xDB,0xBB,0xC2,0xDB,
-                0x04,0xDE,0x8E,0xF9,0x2E,0x8E,0xFC,0x14,0x1F,0xBE,0xCA,0xA6,
-                0x28,0x7C,0x59,0x47,0x4E,0x6B,0xC0,0x5D,0x99,0xB2,0x96,0x4F,
-                0xA0,0x90,0xC3,0xA2,0x23,0x3B,0xA1,0x86,0x51,0x5B,0xE7,0xED,
-                0x1F,0x61,0x29,0x70,0xCE,0xE2,0xD7,0xAF,0xB8,0x1B,0xDD,0x76,
-                0x21,0x70,0x48,0x1C,0xD0,0x06,0x91,0x27,0xD5,0xB0,0x5A,0xA9,
-                0x93,0xB4,0xEA,0x98,0x8D,0x8F,0xDD,0xC1,0x86,0xFF,0xB7,0xDC,
-                0x90,0xA6,0xC0,0x8F,0x4D,0xF4,0x35,0xC9,0x34,0x02,0x84,0x92,
-                0x36,0xC3,0xFA,0xB4,0xD2,0x7C,0x70,0x26,0xC1,0xD4,0xDC,0xB2,
-                0x60,0x26,0x46,0xDE,0xC9,0x75,0x1E,0x76,0x3D,0xBA,0x37,0xBD,
-                0xF8,0xFF,0x94,0x06,0xAD,0x9E,0x53,0x0E,0xE5,0xDB,0x38,0x2F,
-                0x41,0x30,0x01,0xAE,0xB0,0x6A,0x53,0xED,0x90,0x27,0xD8,0x31,
-                0x17,0x97,0x27,0xB0,0x86,0x5A,0x89,0x18,0xDA,0x3E,0xDB,0xEB,
-                0xCF,0x9B,0x14,0xED,0x44,0xCE,0x6C,0xBA,0xCE,0xD4,0xBB,0x1B,
-                0xDB,0x7F,0x14,0x47,0xE6,0xCC,0x25,0x4B,0x33,0x20,0x51,0x51,
-                0x2B,0xD7,0xAF,0x42,0x6F,0xB8,0xF4,0x01,0x37,0x8C,0xD2,0xBF,
-                0x59,0x83,0xCA,0x01,0xC6,0x4B,0x92,0xEC,0xF0,0x32,0xEA,0x15,
-                0xD1,0x72,0x1D,0x03,0xF4,0x82,0xD7,0xCE,0x6E,0x74,0xFE,0xF6,
-                0xD5,0x5E,0x70,0x2F,0x46,0x98,0x0C,0x82,0xB5,0xA8,0x40,0x31,
-                0x90,0x0B,0x1C,0x9E,0x59,0xE7,0xC9,0x7F,0xBE,0xC7,0xE8,0xF3,
-                0x23,0xA9,0x7A,0x7E,0x36,0xCC,0x88,0xBE,0x0F,0x1D,0x45,0xB7,
-                0xFF,0x58,0x5A,0xC5,0x4B,0xD4,0x07,0xB2,0x2B,0x41,0x54,0xAA,
-                0xCC,0x8F,0x6D,0x7E,0xBF,0x48,0xE1,0xD8,0x14,0xCC,0x5E,0xD2,
-                0x0F,0x80,0x37,0xE0,0xA7,0x97,0x15,0xEE,0xF2,0x9B,0xE3,0x28,
-                0x06,0xA1,0xD5,0x8B,0xB7,0xC5,0xDA,0x76,0xF5,0x50,0xAA,0x3D,
-                0x8A,0x1F,0xBF,0xF0,0xEB,0x19,0xCC,0xB1,0xA3,0x13,0xD5,0x5C,
-                0xDA,0x56,0xC9,0xEC,0x2E,0xF2,0x96,0x32,0x38,0x7F,0xE8,0xD7,
-                0x6E,0x3C,0x04,0x68,0x04,0x3E,0x8F,0x66,0x3F,0x48,0x60,0xEE,
-                0x12,0xBF,0x2D,0x5B,0x0B,0x74,0x74,0xD6,0xE6,0x94,0xF9,0x1E,
-                0x6D,0xBE,0x11,0x59,0x74,0xA3,0x92,0x6F,0x12,0xFE,0xE5,0xE4,
-                0x38,0x77,0x7C,0xB6,0xA9,0x32,0xDF,0x8C,0xD8,0xBE,0xC4,0xD0,
-                0x73,0xB9,0x31,0xBA,0x3B,0xC8,0x32,0xB6,0x8D,0x9D,0xD3,0x00,
-                0x74,0x1F,0xA7,0xBF,0x8A,0xFC,0x47,0xED,0x25,0x76,0xF6,0x93,
-                0x6B,0xA4,0x24,0x66,0x3A,0xAB,0x63,0x9C,0x5A,0xE4,0xF5,0x68,
-                0x34,0x23,0xB4,0x74,0x2B,0xF1,0xC9,0x78,0x23,0x8F,0x16,0xCB,
-                0xE3,0x9D,0x65,0x2D,0xE3,0xFD,0xB8,0xBE,0xFC,0x84,0x8A,0xD9,
-                0x22,0x22,0x2E,0x04,0xA4,0x03,0x7C,0x07,0x13,0xEB,0x57,0xA8,
-                0x1A,0x23,0xF0,0xC7,0x34,0x73,0xFC,0x64,0x6C,0xEA,0x30,0x6B,
-                0x4B,0xCB,0xC8,0x86,0x2F,0x83,0x85,0xDD,0xFA,0x9D,0x4B,0x7F,
-                0xA2,0xC0,0x87,0xE8,0x79,0x68,0x33,0x03,0xED,0x5B,0xDD,0x3A,
-                0x06,0x2B,0x3C,0xF5,0xB3,0xA2,0x78,0xA6,0x6D,0x2A,0x13,0xF8,
-                0x3F,0x44,0xF8,0x2D,0xDF,0x31,0x0E,0xE0,0x74,0xAB,0x6A,0x36,
-                0x45,0x97,0xE8,0x99,0xA0,0x25,0x5D,0xC1,0x64,0xF3,0x1C,0xC5,
-                0x08,0x46,0x85,0x1D,0xF9,0xAB,0x48,0x19,0x5D,0xED,0x7E,0xA1,
-                0xB1,0xD5,0x10,0xBD,0x7E,0xE7,0x4D,0x73,0xFA,0xF3,0x6B,0xC3,
-                0x1E,0xCF,0xA2,0x68,0x35,0x90,0x46,0xF4,0xEB,0x87,0x9F,0x92,
-                0x40,0x09,0x43,0x8B,0x48,0x1C,0x6C,0xD7,0x88,0x9A,0x00,0x2E,
-                0xD5,0xEE,0x38,0x2B,0xC9,0x19,0x0D,0xA6,0xFC,0x02,0x6E,0x47,
-                0x95,0x58,0xE4,0x47,0x56,0x77,0xE9,0xAA,0x9E,0x30,0x50,0xE2,
-                0x76,0x56,0x94,0xDF,0xC8,0x1F,0x56,0xE8,0x80,0xB9,0x6E,0x71,
-                0x60,0xC9,0x80,0xDD,0x98,0xED,0xD3,0xDF,0xFF,0xFF,0xFF,0xFF,
-                0xFF,0xFF,0xFF,0xFF,
-                };
-        return BN_bin2bn(RFC3526_PRIME_8192,sizeof(RFC3526_PRIME_8192),bn);
-        }
diff --git a/src/lib/libcrypto/bn/bn_ctx.c b/src/lib/libcrypto/bn/bn_ctx.c
deleted file mode 100644
index b3452f1a91..0000000000
--- a/src/lib/libcrypto/bn/bn_ctx.c
+++ /dev/null
@@ -1,454 +0,0 @@
-/* crypto/bn/bn_ctx.c */
-/* Written by Ulf Moeller for the OpenSSL project. */
-/* ====================================================================
- * Copyright (c) 1998-2004 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#if !defined(BN_CTX_DEBUG) && !defined(BN_DEBUG)
-#ifndef NDEBUG
-#define NDEBUG
-#endif
-#endif
-#include <stdio.h>
-#include <assert.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* TODO list
- *
- * 1. Check a bunch of "(words+1)" type hacks in various bignum functions and
- * check they can be safely removed.
- *  - Check +1 and other ugliness in BN_from_montgomery()
- *
- * 2. Consider allowing a BN_new_ex() that, at least, lets you specify an
- * appropriate 'block' size that will be honoured by bn_expand_internal() to
- * prevent piddly little reallocations. OTOH, profiling bignum expansions in
- * BN_CTX doesn't show this to be a big issue.
- */
-/* How many bignums are in each "pool item"; */
-#define BN_CTX_POOL_SIZE        16
-/* The stack frame info is resizing, set a first-time expansion size; */
-#define BN_CTX_START_FRAMES     32
-/***********/
-/* BN_POOL */
-/***********/
-/* A bundle of bignums that can be linked with other bundles */
-typedef struct bignum_pool_item
-        {
-        /* The bignum values */
-        BIGNUM vals[BN_CTX_POOL_SIZE];
-        /* Linked-list admin */
-        struct bignum_pool_item *prev, *next;
-        } BN_POOL_ITEM;
-/* A linked-list of bignums grouped in bundles */
-typedef struct bignum_pool
-        {
-        /* Linked-list admin */
-        BN_POOL_ITEM *head, *current, *tail;
-        /* Stack depth and allocation size */
-        unsigned used, size;
-        } BN_POOL;
-static void             BN_POOL_init(BN_POOL *);
-static void             BN_POOL_finish(BN_POOL *);
-#ifndef OPENSSL_NO_DEPRECATED
-static void             BN_POOL_reset(BN_POOL *);
-#endif
-static BIGNUM *         BN_POOL_get(BN_POOL *);
-static void             BN_POOL_release(BN_POOL *, unsigned int);
-/************/
-/* BN_STACK */
-/************/
-/* A wrapper to manage the "stack frames" */
-typedef struct bignum_ctx_stack
-        {
-        /* Array of indexes into the bignum stack */
-        unsigned int *indexes;
-        /* Number of stack frames, and the size of the allocated array */
-        unsigned int depth, size;
-        } BN_STACK;
-static void             BN_STACK_init(BN_STACK *);
-static void             BN_STACK_finish(BN_STACK *);
-#ifndef OPENSSL_NO_DEPRECATED
-static void             BN_STACK_reset(BN_STACK *);
-#endif
-static int              BN_STACK_push(BN_STACK *, unsigned int);
-static unsigned int     BN_STACK_pop(BN_STACK *);
-/**********/
-/* BN_CTX */
-/**********/
-/* The opaque BN_CTX type */
-struct bignum_ctx
-        {
-        /* The bignum bundles */
-        BN_POOL pool;
-        /* The "stack frames", if you will */
-        BN_STACK stack;
-        /* The number of bignums currently assigned */
-        unsigned int used;
-        /* Depth of stack overflow */
-        int err_stack;
-        /* Block "gets" until an "end" (compatibility behaviour) */
-        int too_many;
-        };
-/* Enable this to find BN_CTX bugs */
-#ifdef BN_CTX_DEBUG
-static const char *ctxdbg_cur = NULL;
-static void ctxdbg(BN_CTX *ctx)
-        {
-        unsigned int bnidx = 0, fpidx = 0;
-        BN_POOL_ITEM *item = ctx->pool.head;
-        BN_STACK *stack = &ctx->stack;
-        fprintf(stderr,"(%08x): ", (unsigned int)ctx);
-        while(bnidx < ctx->used)
-                {
-                fprintf(stderr,"%02x ", item->vals[bnidx++ % BN_CTX_POOL_SIZE].dmax);
-                if(!(bnidx % BN_CTX_POOL_SIZE))
-                        item = item->next;
-                }
-        fprintf(stderr,"\n");
-        bnidx = 0;
-        fprintf(stderr,"          : ");
-        while(fpidx < stack->depth)
-                {
-                while(bnidx++ < stack->indexes[fpidx])
-                        fprintf(stderr,"   ");
-                fprintf(stderr,"^^ ");
-                bnidx++;
-                fpidx++;
-                }
-        fprintf(stderr,"\n");
-        }
-#define CTXDBG_ENTRY(str, ctx)  do { \
-                                ctxdbg_cur = (str); \
-                                fprintf(stderr,"Starting %s\n", ctxdbg_cur); \
-                                ctxdbg(ctx); \
-                                } while(0)
-#define CTXDBG_EXIT(ctx)        do { \
-                                fprintf(stderr,"Ending %s\n", ctxdbg_cur); \
-                                ctxdbg(ctx); \
-                                } while(0)
-#define CTXDBG_RET(ctx,ret)
-#else
-#define CTXDBG_ENTRY(str, ctx)
-#define CTXDBG_EXIT(ctx)
-#define CTXDBG_RET(ctx,ret)
-#endif
-/* This function is an evil legacy and should not be used. This implementation
- * is WYSIWYG, though I've done my best. */
-#ifndef OPENSSL_NO_DEPRECATED
-void BN_CTX_init(BN_CTX *ctx)
-        {
-        /* Assume the caller obtained the context via BN_CTX_new() and so is
-         * trying to reset it for use. Nothing else makes sense, least of all
-         * binary compatibility from a time when they could declare a static
-         * variable. */
-        BN_POOL_reset(&ctx->pool);
-        BN_STACK_reset(&ctx->stack);
-        ctx->used = 0;
-        ctx->err_stack = 0;
-        ctx->too_many = 0;
-        }
-#endif
-BN_CTX *BN_CTX_new(void)
-        {
-        BN_CTX *ret = OPENSSL_malloc(sizeof(BN_CTX));
-        if(!ret)
-                {
-                BNerr(BN_F_BN_CTX_NEW,ERR_R_MALLOC_FAILURE);
-                return NULL;
-                }
-        /* Initialise the structure */
-        BN_POOL_init(&ret->pool);
-        BN_STACK_init(&ret->stack);
-        ret->used = 0;
-        ret->err_stack = 0;
-        ret->too_many = 0;
-        return ret;
-        }
-void BN_CTX_free(BN_CTX *ctx)
-        {
-        if (ctx == NULL)
-                return;
-#ifdef BN_CTX_DEBUG
-        {
-        BN_POOL_ITEM *pool = ctx->pool.head;
-        fprintf(stderr,"BN_CTX_free, stack-size=%d, pool-bignums=%d\n",
-                ctx->stack.size, ctx->pool.size);
-        fprintf(stderr,"dmaxs: ");
-        while(pool) {
-                unsigned loop = 0;
-                while(loop < BN_CTX_POOL_SIZE)
-                        fprintf(stderr,"%02x ", pool->vals[loop++].dmax);
-                pool = pool->next;
-        }
-        fprintf(stderr,"\n");
-        }
-#endif
-        BN_STACK_finish(&ctx->stack);
-        BN_POOL_finish(&ctx->pool);
-        OPENSSL_free(ctx);
-        }
-void BN_CTX_start(BN_CTX *ctx)
-        {
-        CTXDBG_ENTRY("BN_CTX_start", ctx);
-        /* If we're already overflowing ... */
-        if(ctx->err_stack || ctx->too_many)
-                ctx->err_stack++;
-        /* (Try to) get a new frame pointer */
-        else if(!BN_STACK_push(&ctx->stack, ctx->used))
-                {
-                BNerr(BN_F_BN_CTX_START,BN_R_TOO_MANY_TEMPORARY_VARIABLES);
-                ctx->err_stack++;
-                }
-        CTXDBG_EXIT(ctx);
-        }
-void BN_CTX_end(BN_CTX *ctx)
-        {
-        CTXDBG_ENTRY("BN_CTX_end", ctx);
-        if(ctx->err_stack)
-                ctx->err_stack--;
-        else
-                {
-                unsigned int fp = BN_STACK_pop(&ctx->stack);
-                /* Does this stack frame have anything to release? */
-                if(fp < ctx->used)
-                        BN_POOL_release(&ctx->pool, ctx->used - fp);
-                ctx->used = fp;
-                /* Unjam "too_many" in case "get" had failed */
-                ctx->too_many = 0;
-                }
-        CTXDBG_EXIT(ctx);
-        }
-BIGNUM *BN_CTX_get(BN_CTX *ctx)
-        {
-        BIGNUM *ret;
-        CTXDBG_ENTRY("BN_CTX_get", ctx);
-        if(ctx->err_stack || ctx->too_many) return NULL;
-        if((ret = BN_POOL_get(&ctx->pool)) == NULL)
-                {
-                /* Setting too_many prevents repeated "get" attempts from
-                 * cluttering the error stack. */
-                ctx->too_many = 1;
-                BNerr(BN_F_BN_CTX_GET,BN_R_TOO_MANY_TEMPORARY_VARIABLES);
-                return NULL;
-                }
-        /* OK, make sure the returned bignum is "zero" */
-        BN_zero(ret);
-        ctx->used++;
-        CTXDBG_RET(ctx, ret);
-        return ret;
-        }
-/************/
-/* BN_STACK */
-/************/
-static void BN_STACK_init(BN_STACK *st)
-        {
-        st->indexes = NULL;
-        st->depth = st->size = 0;
-        }
-static void BN_STACK_finish(BN_STACK *st)
-        {
-        if(st->size) OPENSSL_free(st->indexes);
-        }
-#ifndef OPENSSL_NO_DEPRECATED
-static void BN_STACK_reset(BN_STACK *st)
-        {
-        st->depth = 0;
-        }
-#endif
-static int BN_STACK_push(BN_STACK *st, unsigned int idx)
-        {
-        if(st->depth == st->size)
-                /* Need to expand */
-                {
-                unsigned int newsize = (st->size ?
-                                (st->size * 3 / 2) : BN_CTX_START_FRAMES);
-                unsigned int *newitems = OPENSSL_malloc(newsize *
-                                                sizeof(unsigned int));
-                if(!newitems) return 0;
-                if(st->depth)
-                        memcpy(newitems, st->indexes, st->depth *
-                                                sizeof(unsigned int));
-                if(st->size) OPENSSL_free(st->indexes);
-                st->indexes = newitems;
-                st->size = newsize;
-                }
-        st->indexes[(st->depth)++] = idx;
-        return 1;
-        }
-static unsigned int BN_STACK_pop(BN_STACK *st)
-        {
-        return st->indexes[--(st->depth)];
-        }
-/***********/
-/* BN_POOL */
-/***********/
-static void BN_POOL_init(BN_POOL *p)
-        {
-        p->head = p->current = p->tail = NULL;
-        p->used = p->size = 0;
-        }
-static void BN_POOL_finish(BN_POOL *p)
-        {
-        while(p->head)
-                {
-                unsigned int loop = 0;
-                BIGNUM *bn = p->head->vals;
-                while(loop++ < BN_CTX_POOL_SIZE)
-                        {
-                        if(bn->d) BN_clear_free(bn);
-                        bn++;
-                        }
-                p->current = p->head->next;
-                OPENSSL_free(p->head);
-                p->head = p->current;
-                }
-        }
-#ifndef OPENSSL_NO_DEPRECATED
-static void BN_POOL_reset(BN_POOL *p)
-        {
-        BN_POOL_ITEM *item = p->head;
-        while(item)
-                {
-                unsigned int loop = 0;
-                BIGNUM *bn = item->vals;
-                while(loop++ < BN_CTX_POOL_SIZE)
-                        {
-                        if(bn->d) BN_clear(bn);
-                        bn++;
-                        }
-                item = item->next;
-                }
-        p->current = p->head;
-        p->used = 0;
-        }
-#endif
-static BIGNUM *BN_POOL_get(BN_POOL *p)
-        {
-        if(p->used == p->size)
-                {
-                BIGNUM *bn;
-                unsigned int loop = 0;
-                BN_POOL_ITEM *item = OPENSSL_malloc(sizeof(BN_POOL_ITEM));
-                if(!item) return NULL;
-                /* Initialise the structure */
-                bn = item->vals;
-                while(loop++ < BN_CTX_POOL_SIZE)
-                        BN_init(bn++);
-                item->prev = p->tail;
-                item->next = NULL;
-                /* Link it in */
-                if(!p->head)
-                        p->head = p->current = p->tail = item;
-                else
-                        {
-                        p->tail->next = item;
-                        p->tail = item;
-                        p->current = item;
-                        }
-                p->size += BN_CTX_POOL_SIZE;
-                p->used++;
-                /* Return the first bignum from the new pool */
-                return item->vals;
-                }
-        if(!p->used)
-                p->current = p->head;
-        else if((p->used % BN_CTX_POOL_SIZE) == 0)
-                p->current = p->current->next;
-        return p->current->vals + ((p->used++) % BN_CTX_POOL_SIZE);
-        }
-static void BN_POOL_release(BN_POOL *p, unsigned int num)
-        {
-        unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
-        p->used -= num;
-        while(num--)
-                {
-                bn_check_top(p->current->vals + offset);
-                if(!offset)
-                        {
-                        offset = BN_CTX_POOL_SIZE - 1;
-                        p->current = p->current->prev;
-                        }
-                else
-                        offset--;
-                }
-        }
diff --git a/src/lib/libcrypto/bn/bn_depr.c b/src/lib/libcrypto/bn/bn_depr.c
deleted file mode 100644
index 27535e4fca..0000000000
--- a/src/lib/libcrypto/bn/bn_depr.c
+++ /dev/null
@@ -1,112 +0,0 @@
-/* crypto/bn/bn_depr.c */
-/* ====================================================================
- * Copyright (c) 1998-2002 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-/* Support for deprecated functions goes here - static linkage will only slurp
- * this code if applications are using them directly. */
-#include <stdio.h>
-#include <time.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#include <openssl/rand.h>
-static void *dummy=&dummy;
-#ifndef OPENSSL_NO_DEPRECATED
-BIGNUM *BN_generate_prime(BIGNUM *ret, int bits, int safe,
-        const BIGNUM *add, const BIGNUM *rem,
-        void (*callback)(int,int,void *), void *cb_arg)
-        {
-        BN_GENCB cb;
-        BIGNUM *rnd=NULL;
-        int found = 0;
-        BN_GENCB_set_old(&cb, callback, cb_arg);
-        if (ret == NULL)
-                {
-                if ((rnd=BN_new()) == NULL) goto err;
-                }
-        else
-                rnd=ret;
-        if(!BN_generate_prime_ex(rnd, bits, safe, add, rem, &cb))
-                goto err;
-        /* we have a prime :-) */
-        found = 1;
-err:
-        if (!found && (ret == NULL) && (rnd != NULL)) BN_free(rnd);
-        return(found ? rnd : NULL);
-        }
-int BN_is_prime(const BIGNUM *a, int checks, void (*callback)(int,int,void *),
-        BN_CTX *ctx_passed, void *cb_arg)
-        {
-        BN_GENCB cb;
-        BN_GENCB_set_old(&cb, callback, cb_arg);
-        return BN_is_prime_ex(a, checks, ctx_passed, &cb);
-        }
-int BN_is_prime_fasttest(const BIGNUM *a, int checks,
-                void (*callback)(int,int,void *),
-                BN_CTX *ctx_passed, void *cb_arg,
-                int do_trial_division)
-        {
-        BN_GENCB cb;
-        BN_GENCB_set_old(&cb, callback, cb_arg);
-        return BN_is_prime_fasttest_ex(a, checks, ctx_passed,
-                                do_trial_division, &cb);
-        }
-#endif
diff --git a/src/lib/libcrypto/bn/bn_div.c b/src/lib/libcrypto/bn/bn_div.c
deleted file mode 100644
index 1e8e57626b..0000000000
--- a/src/lib/libcrypto/bn/bn_div.c
+++ /dev/null
@@ -1,643 +0,0 @@
-/* crypto/bn/bn_div.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include <openssl/bn.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* The old slow way */
-#if 0
-int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,
-           BN_CTX *ctx)
-        {
-        int i,nm,nd;
-        int ret = 0;
-        BIGNUM *D;
-        bn_check_top(m);
-        bn_check_top(d);
-        if (BN_is_zero(d))
-                {
-                BNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO);
-                return(0);
-                }
-        if (BN_ucmp(m,d) < 0)
-                {
-                if (rem != NULL)
-                        { if (BN_copy(rem,m) == NULL) return(0); }
-                if (dv != NULL) BN_zero(dv);
-                return(1);
-                }
-        BN_CTX_start(ctx);
-        D = BN_CTX_get(ctx);
-        if (dv == NULL) dv = BN_CTX_get(ctx);
-        if (rem == NULL) rem = BN_CTX_get(ctx);
-        if (D == NULL || dv == NULL || rem == NULL)
-                goto end;
-        nd=BN_num_bits(d);
-        nm=BN_num_bits(m);
-        if (BN_copy(D,d) == NULL) goto end;
-        if (BN_copy(rem,m) == NULL) goto end;
-        /* The next 2 are needed so we can do a dv->d[0]|=1 later
-         * since BN_lshift1 will only work once there is a value :-) */
-        BN_zero(dv);
-        bn_wexpand(dv,1);
-        dv->top=1;
-        if (!BN_lshift(D,D,nm-nd)) goto end;
-        for (i=nm-nd; i>=0; i--)
-                {
-                if (!BN_lshift1(dv,dv)) goto end;
-                if (BN_ucmp(rem,D) >= 0)
-                        {
-                        dv->d[0]|=1;
-                        if (!BN_usub(rem,rem,D)) goto end;
-                        }
-/* CAN IMPROVE (and have now :=) */
-                if (!BN_rshift1(D,D)) goto end;
-                }
-        rem->neg=BN_is_zero(rem)?0:m->neg;
-        dv->neg=m->neg^d->neg;
-        ret = 1;
- end:
-        BN_CTX_end(ctx);
-        return(ret);
-        }
-#else
-#if !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) \
-    && !defined(PEDANTIC) && !defined(BN_DIV3W)
-# if defined(__GNUC__) && __GNUC__>=2
-#  if defined(__i386) || defined (__i386__)
-   /*
-    * There were two reasons for implementing this template:
-    * - GNU C generates a call to a function (__udivdi3 to be exact)
-    *   in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
-    *   understand why...);
-    * - divl doesn't only calculate quotient, but also leaves
-    *   remainder in %edx which we can definitely use here:-)
-    *
-    *                                   <appro@fy.chalmers.se>
-    */
-#  define bn_div_words(n0,n1,d0)                \
-        ({  asm volatile (                      \
-                "divl   %4"                     \
-                : "=a"(q), "=d"(rem)            \
-                : "a"(n1), "d"(n0), "g"(d0)     \
-                : "cc");                        \
-            q;                                  \
-        })
-#  define REMAINDER_IS_ALREADY_CALCULATED
-#  elif defined(__x86_64) && defined(SIXTY_FOUR_BIT_LONG)
-   /*
-    * Same story here, but it's 128-bit by 64-bit division. Wow!
-    *                                   <appro@fy.chalmers.se>
-    */
-#  define bn_div_words(n0,n1,d0)                \
-        ({  asm volatile (                      \
-                "divq   %4"                     \
-                : "=a"(q), "=d"(rem)            \
-                : "a"(n1), "d"(n0), "g"(d0)     \
-                : "cc");                        \
-            q;                                  \
-        })
-#  define REMAINDER_IS_ALREADY_CALCULATED
-#  endif /* __<cpu> */
-# endif /* __GNUC__ */
-#endif /* OPENSSL_NO_ASM */
-/* BN_div[_no_branch] computes  dv := num / divisor,  rounding towards
- * zero, and sets up rm  such that  dv*divisor + rm = num  holds.
- * Thus:
- *     dv->neg == num->neg ^ divisor->neg  (unless the result is zero)
- *     rm->neg == num->neg                 (unless the remainder is zero)
- * If 'dv' or 'rm' is NULL, the respective value is not returned.
- */
-static int BN_div_no_branch(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
-        const BIGNUM *divisor, BN_CTX *ctx);
-int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
-           BN_CTX *ctx)
-        {
-        int norm_shift,i,loop;
-        BIGNUM *tmp,wnum,*snum,*sdiv,*res;
-        BN_ULONG *resp,*wnump;
-        BN_ULONG d0,d1;
-        int num_n,div_n;
-        /* Invalid zero-padding would have particularly bad consequences
-         * in the case of 'num', so don't just rely on bn_check_top() for this one
-         * (bn_check_top() works only for BN_DEBUG builds) */
-        if (num->top > 0 && num->d[num->top - 1] == 0)
-                {
-                BNerr(BN_F_BN_DIV,BN_R_NOT_INITIALIZED);
-                return 0;
-                }
-        bn_check_top(num);
-        if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0))
-                {
-                return BN_div_no_branch(dv, rm, num, divisor, ctx);
-                }
-        bn_check_top(dv);
-        bn_check_top(rm);
-        /* bn_check_top(num); */ /* 'num' has been checked already */
-        bn_check_top(divisor);
-        if (BN_is_zero(divisor))
-                {
-                BNerr(BN_F_BN_DIV,BN_R_DIV_BY_ZERO);
-                return(0);
-                }
-        if (BN_ucmp(num,divisor) < 0)
-                {
-                if (rm != NULL)
-                        { if (BN_copy(rm,num) == NULL) return(0); }
-                if (dv != NULL) BN_zero(dv);
-                return(1);
-                }
-        BN_CTX_start(ctx);
-        tmp=BN_CTX_get(ctx);
-        snum=BN_CTX_get(ctx);
-        sdiv=BN_CTX_get(ctx);
-        if (dv == NULL)
-                res=BN_CTX_get(ctx);
-        else    res=dv;
-        if (sdiv == NULL || res == NULL) goto err;
-        /* First we normalise the numbers */
-        norm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2);
-        if (!(BN_lshift(sdiv,divisor,norm_shift))) goto err;
-        sdiv->neg=0;
-        norm_shift+=BN_BITS2;
-        if (!(BN_lshift(snum,num,norm_shift))) goto err;
-        snum->neg=0;
-        div_n=sdiv->top;
-        num_n=snum->top;
-        loop=num_n-div_n;
-        /* Lets setup a 'window' into snum
-         * This is the part that corresponds to the current
-         * 'area' being divided */
-        wnum.neg   = 0;
-        wnum.d     = &(snum->d[loop]);
-        wnum.top   = div_n;
-        /* only needed when BN_ucmp messes up the values between top and max */
-        wnum.dmax  = snum->dmax - loop; /* so we don't step out of bounds */
-        /* Get the top 2 words of sdiv */
-        /* div_n=sdiv->top; */
-        d0=sdiv->d[div_n-1];
-        d1=(div_n == 1)?0:sdiv->d[div_n-2];
-        /* pointer to the 'top' of snum */
-        wnump= &(snum->d[num_n-1]);
-        /* Setup to 'res' */
-        res->neg= (num->neg^divisor->neg);
-        if (!bn_wexpand(res,(loop+1))) goto err;
-        res->top=loop;
-        resp= &(res->d[loop-1]);
-        /* space for temp */
-        if (!bn_wexpand(tmp,(div_n+1))) goto err;
-        if (BN_ucmp(&wnum,sdiv) >= 0)
-                {
-                /* If BN_DEBUG_RAND is defined BN_ucmp changes (via
-                 * bn_pollute) the const bignum arguments =>
-                 * clean the values between top and max again */
-                bn_clear_top2max(&wnum);
-                bn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);
-                *resp=1;
-                }
-        else
-                res->top--;
-        /* if res->top == 0 then clear the neg value otherwise decrease
-         * the resp pointer */
-        if (res->top == 0)
-                res->neg = 0;
-        else
-                resp--;
-        for (i=0; i<loop-1; i++, wnump--, resp--)
-                {
-                BN_ULONG q,l0;
-                /* the first part of the loop uses the top two words of
-                 * snum and sdiv to calculate a BN_ULONG q such that
-                 * | wnum - sdiv * q | < sdiv */
-#if defined(BN_DIV3W) && !defined(OPENSSL_NO_ASM)
-                BN_ULONG bn_div_3_words(BN_ULONG*,BN_ULONG,BN_ULONG);
-                q=bn_div_3_words(wnump,d1,d0);
-#else
-                BN_ULONG n0,n1,rem=0;
-                n0=wnump[0];
-                n1=wnump[-1];
-                if (n0 == d0)
-                        q=BN_MASK2;
-                else                    /* n0 < d0 */
-                        {
-#ifdef BN_LLONG
-                        BN_ULLONG t2;
-#if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)
-                        q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
-#else
-                        q=bn_div_words(n0,n1,d0);
-#ifdef BN_DEBUG_LEVITTE
-                        fprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\
-X) -> 0x%08X\n",
-                                n0, n1, d0, q);
-#endif
-#endif
-#ifndef REMAINDER_IS_ALREADY_CALCULATED
-                        /*
-                         * rem doesn't have to be BN_ULLONG. The least we
-                         * know it's less that d0, isn't it?
-                         */
-                        rem=(n1-q*d0)&BN_MASK2;
-#endif
-                        t2=(BN_ULLONG)d1*q;
-                        for (;;)
-                                {
-                                if (t2 <= ((((BN_ULLONG)rem)<<BN_BITS2)|wnump[-2]))
-                                        break;
-                                q--;
-                                rem += d0;
-                                if (rem < d0) break; /* don't let rem overflow */
-                                t2 -= d1;
-                                }
-#else /* !BN_LLONG */
-                        BN_ULONG t2l,t2h,ql,qh;
-                        q=bn_div_words(n0,n1,d0);
-#ifdef BN_DEBUG_LEVITTE
-                        fprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\
-X) -> 0x%08X\n",
-                                n0, n1, d0, q);
-#endif
-#ifndef REMAINDER_IS_ALREADY_CALCULATED
-                        rem=(n1-q*d0)&BN_MASK2;
-#endif
-#if defined(BN_UMULT_LOHI)
-                        BN_UMULT_LOHI(t2l,t2h,d1,q);
-#elif defined(BN_UMULT_HIGH)
-                        t2l = d1 * q;
-                        t2h = BN_UMULT_HIGH(d1,q);
-#else
-                        t2l=LBITS(d1); t2h=HBITS(d1);
-                        ql =LBITS(q);  qh =HBITS(q);
-                        mul64(t2l,t2h,ql,qh); /* t2=(BN_ULLONG)d1*q; */
-#endif
-                        for (;;)
-                                {
-                                if ((t2h < rem) ||
-                                        ((t2h == rem) && (t2l <= wnump[-2])))
-                                        break;
-                                q--;
-                                rem += d0;
-                                if (rem < d0) break; /* don't let rem overflow */
-                                if (t2l < d1) t2h--; t2l -= d1;
-                                }
-#endif /* !BN_LLONG */
-                        }
-#endif /* !BN_DIV3W */
-                l0=bn_mul_words(tmp->d,sdiv->d,div_n,q);
-                tmp->d[div_n]=l0;
-                wnum.d--;
-                /* ingore top values of the bignums just sub the two 
-                 * BN_ULONG arrays with bn_sub_words */
-                if (bn_sub_words(wnum.d, wnum.d, tmp->d, div_n+1))
-                        {
-                        /* Note: As we have considered only the leading
-                         * two BN_ULONGs in the calculation of q, sdiv * q
-                         * might be greater than wnum (but then (q-1) * sdiv
-                         * is less or equal than wnum)
-                         */
-                        q--;
-                        if (bn_add_words(wnum.d, wnum.d, sdiv->d, div_n))
-                                /* we can't have an overflow here (assuming
-                                 * that q != 0, but if q == 0 then tmp is
-                                 * zero anyway) */
-                                (*wnump)++;
-                        }
-                /* store part of the result */
-                *resp = q;
-                }
-        bn_correct_top(snum);
-        if (rm != NULL)
-                {
-                /* Keep a copy of the neg flag in num because if rm==num
-                 * BN_rshift() will overwrite it.
-                 */
-                int neg = num->neg;
-                BN_rshift(rm,snum,norm_shift);
-                if (!BN_is_zero(rm))
-                        rm->neg = neg;
-                bn_check_top(rm);
-                }
-        BN_CTX_end(ctx);
-        return(1);
-err:
-        bn_check_top(rm);
-        BN_CTX_end(ctx);
-        return(0);
-        }
-/* BN_div_no_branch is a special version of BN_div. It does not contain
- * branches that may leak sensitive information.
- */
-static int BN_div_no_branch(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, 
-        const BIGNUM *divisor, BN_CTX *ctx)
-        {
-        int norm_shift,i,loop;
-        BIGNUM *tmp,wnum,*snum,*sdiv,*res;
-        BN_ULONG *resp,*wnump;
-        BN_ULONG d0,d1;
-        int num_n,div_n;
-        bn_check_top(dv);
-        bn_check_top(rm);
-        /* bn_check_top(num); */ /* 'num' has been checked in BN_div() */
-        bn_check_top(divisor);
-        if (BN_is_zero(divisor))
-                {
-                BNerr(BN_F_BN_DIV_NO_BRANCH,BN_R_DIV_BY_ZERO);
-                return(0);
-                }
-        BN_CTX_start(ctx);
-        tmp=BN_CTX_get(ctx);
-        snum=BN_CTX_get(ctx);
-        sdiv=BN_CTX_get(ctx);
-        if (dv == NULL)
-                res=BN_CTX_get(ctx);
-        else    res=dv;
-        if (sdiv == NULL || res == NULL) goto err;
-        /* First we normalise the numbers */
-        norm_shift=BN_BITS2-((BN_num_bits(divisor))%BN_BITS2);
-        if (!(BN_lshift(sdiv,divisor,norm_shift))) goto err;
-        sdiv->neg=0;
-        norm_shift+=BN_BITS2;
-        if (!(BN_lshift(snum,num,norm_shift))) goto err;
-        snum->neg=0;
-        /* Since we don't know whether snum is larger than sdiv,
-         * we pad snum with enough zeroes without changing its
-         * value. 
-         */
-        if (snum->top <= sdiv->top+1) 
-                {
-                if (bn_wexpand(snum, sdiv->top + 2) == NULL) goto err;
-                for (i = snum->top; i < sdiv->top + 2; i++) snum->d[i] = 0;
-                snum->top = sdiv->top + 2;
-                }
-        else
-                {
-                if (bn_wexpand(snum, snum->top + 1) == NULL) goto err;
-                snum->d[snum->top] = 0;
-                snum->top ++;
-                }
-        div_n=sdiv->top;
-        num_n=snum->top;
-        loop=num_n-div_n;
-        /* Lets setup a 'window' into snum
-         * This is the part that corresponds to the current
-         * 'area' being divided */
-        wnum.neg   = 0;
-        wnum.d     = &(snum->d[loop]);
-        wnum.top   = div_n;
-        /* only needed when BN_ucmp messes up the values between top and max */
-        wnum.dmax  = snum->dmax - loop; /* so we don't step out of bounds */
-        /* Get the top 2 words of sdiv */
-        /* div_n=sdiv->top; */
-        d0=sdiv->d[div_n-1];
-        d1=(div_n == 1)?0:sdiv->d[div_n-2];
-        /* pointer to the 'top' of snum */
-        wnump= &(snum->d[num_n-1]);
-        /* Setup to 'res' */
-        res->neg= (num->neg^divisor->neg);
-        if (!bn_wexpand(res,(loop+1))) goto err;
-        res->top=loop-1;
-        resp= &(res->d[loop-1]);
-        /* space for temp */
-        if (!bn_wexpand(tmp,(div_n+1))) goto err;
-        /* if res->top == 0 then clear the neg value otherwise decrease
-         * the resp pointer */
-        if (res->top == 0)
-                res->neg = 0;
-        else
-                resp--;
-        for (i=0; i<loop-1; i++, wnump--, resp--)
-                {
-                BN_ULONG q,l0;
-                /* the first part of the loop uses the top two words of
-                 * snum and sdiv to calculate a BN_ULONG q such that
-                 * | wnum - sdiv * q | < sdiv */
-#if defined(BN_DIV3W) && !defined(OPENSSL_NO_ASM)
-                BN_ULONG bn_div_3_words(BN_ULONG*,BN_ULONG,BN_ULONG);
-                q=bn_div_3_words(wnump,d1,d0);
-#else
-                BN_ULONG n0,n1,rem=0;
-                n0=wnump[0];
-                n1=wnump[-1];
-                if (n0 == d0)
-                        q=BN_MASK2;
-                else                    /* n0 < d0 */
-                        {
-#ifdef BN_LLONG
-                        BN_ULLONG t2;
-#if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)
-                        q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
-#else
-                        q=bn_div_words(n0,n1,d0);
-#ifdef BN_DEBUG_LEVITTE
-                        fprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\
-X) -> 0x%08X\n",
-                                n0, n1, d0, q);
-#endif
-#endif
-#ifndef REMAINDER_IS_ALREADY_CALCULATED
-                        /*
-                         * rem doesn't have to be BN_ULLONG. The least we
-                         * know it's less that d0, isn't it?
-                         */
-                        rem=(n1-q*d0)&BN_MASK2;
-#endif
-                        t2=(BN_ULLONG)d1*q;
-                        for (;;)
-                                {
-                                if (t2 <= ((((BN_ULLONG)rem)<<BN_BITS2)|wnump[-2]))
-                                        break;
-                                q--;
-                                rem += d0;
-                                if (rem < d0) break; /* don't let rem overflow */
-                                t2 -= d1;
-                                }
-#else /* !BN_LLONG */
-                        BN_ULONG t2l,t2h,ql,qh;
-                        q=bn_div_words(n0,n1,d0);
-#ifdef BN_DEBUG_LEVITTE
-                        fprintf(stderr,"DEBUG: bn_div_words(0x%08X,0x%08X,0x%08\
-X) -> 0x%08X\n",
-                                n0, n1, d0, q);
-#endif
-#ifndef REMAINDER_IS_ALREADY_CALCULATED
-                        rem=(n1-q*d0)&BN_MASK2;
-#endif
-#if defined(BN_UMULT_LOHI)
-                        BN_UMULT_LOHI(t2l,t2h,d1,q);
-#elif defined(BN_UMULT_HIGH)
-                        t2l = d1 * q;
-                        t2h = BN_UMULT_HIGH(d1,q);
-#else
-                        t2l=LBITS(d1); t2h=HBITS(d1);
-                        ql =LBITS(q);  qh =HBITS(q);
-                        mul64(t2l,t2h,ql,qh); /* t2=(BN_ULLONG)d1*q; */
-#endif
-                        for (;;)
-                                {
-                                if ((t2h < rem) ||
-                                        ((t2h == rem) && (t2l <= wnump[-2])))
-                                        break;
-                                q--;
-                                rem += d0;
-                                if (rem < d0) break; /* don't let rem overflow */
-                                if (t2l < d1) t2h--; t2l -= d1;
-                                }
-#endif /* !BN_LLONG */
-                        }
-#endif /* !BN_DIV3W */
-                l0=bn_mul_words(tmp->d,sdiv->d,div_n,q);
-                tmp->d[div_n]=l0;
-                wnum.d--;
-                /* ingore top values of the bignums just sub the two 
-                 * BN_ULONG arrays with bn_sub_words */
-                if (bn_sub_words(wnum.d, wnum.d, tmp->d, div_n+1))
-                        {
-                        /* Note: As we have considered only the leading
-                         * two BN_ULONGs in the calculation of q, sdiv * q
-                         * might be greater than wnum (but then (q-1) * sdiv
-                         * is less or equal than wnum)
-                         */
-                        q--;
-                        if (bn_add_words(wnum.d, wnum.d, sdiv->d, div_n))
-                                /* we can't have an overflow here (assuming
-                                 * that q != 0, but if q == 0 then tmp is
-                                 * zero anyway) */
-                                (*wnump)++;
-                        }
-                /* store part of the result */
-                *resp = q;
-                }
-        bn_correct_top(snum);
-        if (rm != NULL)
-                {
-                /* Keep a copy of the neg flag in num because if rm==num
-                 * BN_rshift() will overwrite it.
-                 */
-                int neg = num->neg;
-                BN_rshift(rm,snum,norm_shift);
-                if (!BN_is_zero(rm))
-                        rm->neg = neg;
-                bn_check_top(rm);
-                }
-        bn_correct_top(res);
-        BN_CTX_end(ctx);
-        return(1);
-err:
-        bn_check_top(rm);
-        BN_CTX_end(ctx);
-        return(0);
-        }
-#endif
diff --git a/src/lib/libcrypto/bn/bn_err.c b/src/lib/libcrypto/bn/bn_err.c
deleted file mode 100644
index cfe2eb94a0..0000000000
--- a/src/lib/libcrypto/bn/bn_err.c
+++ /dev/null
@@ -1,150 +0,0 @@
-/* crypto/bn/bn_err.c */
-/* ====================================================================
- * Copyright (c) 1999-2007 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@OpenSSL.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-/* NOTE: this file was auto generated by the mkerr.pl script: any changes
- * made to it will be overwritten when the script next updates this file,
- * only reason strings will be preserved.
- */
-#include <stdio.h>
-#include <openssl/err.h>
-#include <openssl/bn.h>
-/* BEGIN ERROR CODES */
-#ifndef OPENSSL_NO_ERR
-#define ERR_FUNC(func) ERR_PACK(ERR_LIB_BN,func,0)
-#define ERR_REASON(reason) ERR_PACK(ERR_LIB_BN,0,reason)
-static ERR_STRING_DATA BN_str_functs[]=
-        {
-{ERR_FUNC(BN_F_BNRAND), "BNRAND"},
-{ERR_FUNC(BN_F_BN_BLINDING_CONVERT_EX), "BN_BLINDING_convert_ex"},
-{ERR_FUNC(BN_F_BN_BLINDING_CREATE_PARAM),       "BN_BLINDING_create_param"},
-{ERR_FUNC(BN_F_BN_BLINDING_INVERT_EX),  "BN_BLINDING_invert_ex"},
-{ERR_FUNC(BN_F_BN_BLINDING_NEW),        "BN_BLINDING_new"},
-{ERR_FUNC(BN_F_BN_BLINDING_UPDATE),     "BN_BLINDING_update"},
-{ERR_FUNC(BN_F_BN_BN2DEC),      "BN_bn2dec"},
-{ERR_FUNC(BN_F_BN_BN2HEX),      "BN_bn2hex"},
-{ERR_FUNC(BN_F_BN_CTX_GET),     "BN_CTX_get"},
-{ERR_FUNC(BN_F_BN_CTX_NEW),     "BN_CTX_new"},
-{ERR_FUNC(BN_F_BN_CTX_START),   "BN_CTX_start"},
-{ERR_FUNC(BN_F_BN_DIV), "BN_div"},
-{ERR_FUNC(BN_F_BN_DIV_NO_BRANCH),       "BN_div_no_branch"},
-{ERR_FUNC(BN_F_BN_DIV_RECP),    "BN_div_recp"},
-{ERR_FUNC(BN_F_BN_EXP), "BN_exp"},
-{ERR_FUNC(BN_F_BN_EXPAND2),     "bn_expand2"},
-{ERR_FUNC(BN_F_BN_EXPAND_INTERNAL),     "BN_EXPAND_INTERNAL"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD),    "BN_GF2m_mod"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD_EXP),        "BN_GF2m_mod_exp"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD_MUL),        "BN_GF2m_mod_mul"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD_SOLVE_QUAD), "BN_GF2m_mod_solve_quad"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR),     "BN_GF2m_mod_solve_quad_arr"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD_SQR),        "BN_GF2m_mod_sqr"},
-{ERR_FUNC(BN_F_BN_GF2M_MOD_SQRT),       "BN_GF2m_mod_sqrt"},
-{ERR_FUNC(BN_F_BN_MOD_EXP2_MONT),       "BN_mod_exp2_mont"},
-{ERR_FUNC(BN_F_BN_MOD_EXP_MONT),        "BN_mod_exp_mont"},
-{ERR_FUNC(BN_F_BN_MOD_EXP_MONT_CONSTTIME),      "BN_mod_exp_mont_consttime"},
-{ERR_FUNC(BN_F_BN_MOD_EXP_MONT_WORD),   "BN_mod_exp_mont_word"},
-{ERR_FUNC(BN_F_BN_MOD_EXP_RECP),        "BN_mod_exp_recp"},
-{ERR_FUNC(BN_F_BN_MOD_EXP_SIMPLE),      "BN_mod_exp_simple"},
-{ERR_FUNC(BN_F_BN_MOD_INVERSE), "BN_mod_inverse"},
-{ERR_FUNC(BN_F_BN_MOD_INVERSE_NO_BRANCH),       "BN_mod_inverse_no_branch"},
-{ERR_FUNC(BN_F_BN_MOD_LSHIFT_QUICK),    "BN_mod_lshift_quick"},
-{ERR_FUNC(BN_F_BN_MOD_MUL_RECIPROCAL),  "BN_mod_mul_reciprocal"},
-{ERR_FUNC(BN_F_BN_MOD_SQRT),    "BN_mod_sqrt"},
-{ERR_FUNC(BN_F_BN_MPI2BN),      "BN_mpi2bn"},
-{ERR_FUNC(BN_F_BN_NEW), "BN_new"},
-{ERR_FUNC(BN_F_BN_RAND),        "BN_rand"},
-{ERR_FUNC(BN_F_BN_RAND_RANGE),  "BN_rand_range"},
-{ERR_FUNC(BN_F_BN_USUB),        "BN_usub"},
-{0,NULL}
-        };
-static ERR_STRING_DATA BN_str_reasons[]=
-        {
-{ERR_REASON(BN_R_ARG2_LT_ARG3)           ,"arg2 lt arg3"},
-{ERR_REASON(BN_R_BAD_RECIPROCAL)         ,"bad reciprocal"},
-{ERR_REASON(BN_R_BIGNUM_TOO_LONG)        ,"bignum too long"},
-{ERR_REASON(BN_R_CALLED_WITH_EVEN_MODULUS),"called with even modulus"},
-{ERR_REASON(BN_R_DIV_BY_ZERO)            ,"div by zero"},
-{ERR_REASON(BN_R_ENCODING_ERROR)         ,"encoding error"},
-{ERR_REASON(BN_R_EXPAND_ON_STATIC_BIGNUM_DATA),"expand on static bignum data"},
-{ERR_REASON(BN_R_INPUT_NOT_REDUCED)      ,"input not reduced"},
-{ERR_REASON(BN_R_INVALID_LENGTH)         ,"invalid length"},
-{ERR_REASON(BN_R_INVALID_RANGE)          ,"invalid range"},
-{ERR_REASON(BN_R_NOT_A_SQUARE)           ,"not a square"},
-{ERR_REASON(BN_R_NOT_INITIALIZED)        ,"not initialized"},
-{ERR_REASON(BN_R_NO_INVERSE)             ,"no inverse"},
-{ERR_REASON(BN_R_NO_SOLUTION)            ,"no solution"},
-{ERR_REASON(BN_R_P_IS_NOT_PRIME)         ,"p is not prime"},
-{ERR_REASON(BN_R_TOO_MANY_ITERATIONS)    ,"too many iterations"},
-{ERR_REASON(BN_R_TOO_MANY_TEMPORARY_VARIABLES),"too many temporary variables"},
-{0,NULL}
-        };
-#endif
-void ERR_load_BN_strings(void)
-        {
-#ifndef OPENSSL_NO_ERR
-        if (ERR_func_error_string(BN_str_functs[0].error) == NULL)
-                {
-                ERR_load_strings(0,BN_str_functs);
-                ERR_load_strings(0,BN_str_reasons);
-                }
-#endif
-        }
diff --git a/src/lib/libcrypto/bn/bn_exp.c b/src/lib/libcrypto/bn/bn_exp.c
deleted file mode 100644
index 70a33f0d93..0000000000
--- a/src/lib/libcrypto/bn/bn_exp.c
+++ /dev/null
@@ -1,990 +0,0 @@
-/* crypto/bn/bn_exp.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2005 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* maximum precomputation table size for *variable* sliding windows */
-#define TABLE_SIZE      32
-/* this one works - simple but works */
-int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
-        {
-        int i,bits,ret=0;
-        BIGNUM *v,*rr;
-        if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
-                {
-                /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
-                BNerr(BN_F_BN_EXP,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
-                return -1;
-                }
-        BN_CTX_start(ctx);
-        if ((r == a) || (r == p))
-                rr = BN_CTX_get(ctx);
-        else
-                rr = r;
-        if ((v = BN_CTX_get(ctx)) == NULL) goto err;
-        if (BN_copy(v,a) == NULL) goto err;
-        bits=BN_num_bits(p);
-        if (BN_is_odd(p))
-                { if (BN_copy(rr,a) == NULL) goto err; }
-        else    { if (!BN_one(rr)) goto err; }
-        for (i=1; i<bits; i++)
-                {
-                if (!BN_sqr(v,v,ctx)) goto err;
-                if (BN_is_bit_set(p,i))
-                        {
-                        if (!BN_mul(rr,rr,v,ctx)) goto err;
-                        }
-                }
-        ret=1;
-err:
-        if (r != rr) BN_copy(r,rr);
-        BN_CTX_end(ctx);
-        bn_check_top(r);
-        return(ret);
-        }
-int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
-               BN_CTX *ctx)
-        {
-        int ret;
-        bn_check_top(a);
-        bn_check_top(p);
-        bn_check_top(m);
-        /* For even modulus  m = 2^k*m_odd,  it might make sense to compute
-         * a^p mod m_odd  and  a^p mod 2^k  separately (with Montgomery
-         * exponentiation for the odd part), using appropriate exponent
-         * reductions, and combine the results using the CRT.
-         *
-         * For now, we use Montgomery only if the modulus is odd; otherwise,
-         * exponentiation using the reciprocal-based quick remaindering
-         * algorithm is used.
-         *
-         * (Timing obtained with expspeed.c [computations  a^p mod m
-         * where  a, p, m  are of the same length: 256, 512, 1024, 2048,
-         * 4096, 8192 bits], compared to the running time of the
-         * standard algorithm:
-         *
-         *   BN_mod_exp_mont   33 .. 40 %  [AMD K6-2, Linux, debug configuration]
-         *                     55 .. 77 %  [UltraSparc processor, but
-         *                                  debug-solaris-sparcv8-gcc conf.]
-         * 
-         *   BN_mod_exp_recp   50 .. 70 %  [AMD K6-2, Linux, debug configuration]
-         *                     62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]
-         *
-         * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont
-         * at 2048 and more bits, but at 512 and 1024 bits, it was
-         * slower even than the standard algorithm!
-         *
-         * "Real" timings [linux-elf, solaris-sparcv9-gcc configurations]
-         * should be obtained when the new Montgomery reduction code
-         * has been integrated into OpenSSL.)
-         */
-#define MONT_MUL_MOD
-#define MONT_EXP_WORD
-#define RECP_MUL_MOD
-#ifdef MONT_MUL_MOD
-        /* I have finally been able to take out this pre-condition of
-         * the top bit being set.  It was caused by an error in BN_div
-         * with negatives.  There was also another problem when for a^b%m
-         * a >= m.  eay 07-May-97 */
-/*      if ((m->d[m->top-1]&BN_TBIT) && BN_is_odd(m)) */
-        if (BN_is_odd(m))
-                {
-#  ifdef MONT_EXP_WORD
-                if (a->top == 1 && !a->neg && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0))
-                        {
-                        BN_ULONG A = a->d[0];
-                        ret=BN_mod_exp_mont_word(r,A,p,m,ctx,NULL);
-                        }
-                else
-#  endif
-                        ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL);
-                }
-        else
-#endif
-#ifdef RECP_MUL_MOD
-                { ret=BN_mod_exp_recp(r,a,p,m,ctx); }
-#else
-                { ret=BN_mod_exp_simple(r,a,p,m,ctx); }
-#endif
-        bn_check_top(r);
-        return(ret);
-        }
-int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-                    const BIGNUM *m, BN_CTX *ctx)
-        {
-        int i,j,bits,ret=0,wstart,wend,window,wvalue;
-        int start=1;
-        BIGNUM *aa;
-        /* Table of variables obtained from 'ctx' */
-        BIGNUM *val[TABLE_SIZE];
-        BN_RECP_CTX recp;
-        if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
-                {
-                /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
-                BNerr(BN_F_BN_MOD_EXP_RECP,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
-                return -1;
-                }
-        bits=BN_num_bits(p);
-        if (bits == 0)
-                {
-                ret = BN_one(r);
-                return ret;
-                }
-        BN_CTX_start(ctx);
-        aa = BN_CTX_get(ctx);
-        val[0] = BN_CTX_get(ctx);
-        if(!aa || !val[0]) goto err;
-        BN_RECP_CTX_init(&recp);
-        if (m->neg)
-                {
-                /* ignore sign of 'm' */
-                if (!BN_copy(aa, m)) goto err;
-                aa->neg = 0;
-                if (BN_RECP_CTX_set(&recp,aa,ctx) <= 0) goto err;
-                }
-        else
-                {
-                if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
-                }
-        if (!BN_nnmod(val[0],a,m,ctx)) goto err;                /* 1 */
-        if (BN_is_zero(val[0]))
-                {
-                BN_zero(r);
-                ret = 1;
-                goto err;
-                }
-        window = BN_window_bits_for_exponent_size(bits);
-        if (window > 1)
-                {
-                if (!BN_mod_mul_reciprocal(aa,val[0],val[0],&recp,ctx))
-                        goto err;                               /* 2 */
-                j=1<<(window-1);
-                for (i=1; i<j; i++)
-                        {
-                        if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
-                                        !BN_mod_mul_reciprocal(val[i],val[i-1],
-                                                aa,&recp,ctx))
-                                goto err;
-                        }
-                }
-                
-        start=1;        /* This is used to avoid multiplication etc
-                         * when there is only the value '1' in the
-                         * buffer. */
-        wvalue=0;       /* The 'value' of the window */
-        wstart=bits-1;  /* The top bit of the window */
-        wend=0;         /* The bottom bit of the window */
-        if (!BN_one(r)) goto err;
-        for (;;)
-                {
-                if (BN_is_bit_set(p,wstart) == 0)
-                        {
-                        if (!start)
-                                if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
-                                goto err;
-                        if (wstart == 0) break;
-                        wstart--;
-                        continue;
-                        }
-                /* We now have wstart on a 'set' bit, we now need to work out
-                 * how bit a window to do.  To do this we need to scan
-                 * forward until the last set bit before the end of the
-                 * window */
-                j=wstart;
-                wvalue=1;
-                wend=0;
-                for (i=1; i<window; i++)
-                        {
-                        if (wstart-i < 0) break;
-                        if (BN_is_bit_set(p,wstart-i))
-                                {
-                                wvalue<<=(i-wend);
-                                wvalue|=1;
-                                wend=i;
-                                }
-                        }
-                /* wend is the size of the current window */
-                j=wend+1;
-                /* add the 'bytes above' */
-                if (!start)
-                        for (i=0; i<j; i++)
-                                {
-                                if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
-                                        goto err;
-                                }
-                
-                /* wvalue will be an odd number < 2^window */
-                if (!BN_mod_mul_reciprocal(r,r,val[wvalue>>1],&recp,ctx))
-                        goto err;
-                /* move the 'window' down further */
-                wstart-=wend+1;
-                wvalue=0;
-                start=0;
-                if (wstart < 0) break;
-                }
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        BN_RECP_CTX_free(&recp);
-        bn_check_top(r);
-        return(ret);
-        }
-int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
-                    const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
-        {
-        int i,j,bits,ret=0,wstart,wend,window,wvalue;
-        int start=1;
-        BIGNUM *d,*r;
-        const BIGNUM *aa;
-        /* Table of variables obtained from 'ctx' */
-        BIGNUM *val[TABLE_SIZE];
-        BN_MONT_CTX *mont=NULL;
-        if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
-                {
-                return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
-                }
-        bn_check_top(a);
-        bn_check_top(p);
-        bn_check_top(m);
-        if (!BN_is_odd(m))
-                {
-                BNerr(BN_F_BN_MOD_EXP_MONT,BN_R_CALLED_WITH_EVEN_MODULUS);
-                return(0);
-                }
-        bits=BN_num_bits(p);
-        if (bits == 0)
-                {
-                ret = BN_one(rr);
-                return ret;
-                }
-        BN_CTX_start(ctx);
-        d = BN_CTX_get(ctx);
-        r = BN_CTX_get(ctx);
-        val[0] = BN_CTX_get(ctx);
-        if (!d || !r || !val[0]) goto err;
-        /* If this is not done, things will break in the montgomery
-         * part */
-        if (in_mont != NULL)
-                mont=in_mont;
-        else
-                {
-                if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
-                if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
-                }
-        if (a->neg || BN_ucmp(a,m) >= 0)
-                {
-                if (!BN_nnmod(val[0],a,m,ctx))
-                        goto err;
-                aa= val[0];
-                }
-        else
-                aa=a;
-        if (BN_is_zero(aa))
-                {
-                BN_zero(rr);
-                ret = 1;
-                goto err;
-                }
-        if (!BN_to_montgomery(val[0],aa,mont,ctx)) goto err; /* 1 */
-        window = BN_window_bits_for_exponent_size(bits);
-        if (window > 1)
-                {
-                if (!BN_mod_mul_montgomery(d,val[0],val[0],mont,ctx)) goto err; /* 2 */
-                j=1<<(window-1);
-                for (i=1; i<j; i++)
-                        {
-                        if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
-                                        !BN_mod_mul_montgomery(val[i],val[i-1],
-                                                d,mont,ctx))
-                                goto err;
-                        }
-                }
-        start=1;        /* This is used to avoid multiplication etc
-                         * when there is only the value '1' in the
-                         * buffer. */
-        wvalue=0;       /* The 'value' of the window */
-        wstart=bits-1;  /* The top bit of the window */
-        wend=0;         /* The bottom bit of the window */
-        if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
-        for (;;)
-                {
-                if (BN_is_bit_set(p,wstart) == 0)
-                        {
-                        if (!start)
-                                {
-                                if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
-                                goto err;
-                                }
-                        if (wstart == 0) break;
-                        wstart--;
-                        continue;
-                        }
-                /* We now have wstart on a 'set' bit, we now need to work out
-                 * how bit a window to do.  To do this we need to scan
-                 * forward until the last set bit before the end of the
-                 * window */
-                j=wstart;
-                wvalue=1;
-                wend=0;
-                for (i=1; i<window; i++)
-                        {
-                        if (wstart-i < 0) break;
-                        if (BN_is_bit_set(p,wstart-i))
-                                {
-                                wvalue<<=(i-wend);
-                                wvalue|=1;
-                                wend=i;
-                                }
-                        }
-                /* wend is the size of the current window */
-                j=wend+1;
-                /* add the 'bytes above' */
-                if (!start)
-                        for (i=0; i<j; i++)
-                                {
-                                if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
-                                        goto err;
-                                }
-                
-                /* wvalue will be an odd number < 2^window */
-                if (!BN_mod_mul_montgomery(r,r,val[wvalue>>1],mont,ctx))
-                        goto err;
-                /* move the 'window' down further */
-                wstart-=wend+1;
-                wvalue=0;
-                start=0;
-                if (wstart < 0) break;
-                }
-        if (!BN_from_montgomery(rr,r,mont,ctx)) goto err;
-        ret=1;
-err:
-        if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
-        BN_CTX_end(ctx);
-        bn_check_top(rr);
-        return(ret);
-        }
-/* BN_mod_exp_mont_consttime() stores the precomputed powers in a specific layout
- * so that accessing any of these table values shows the same access pattern as far
- * as cache lines are concerned.  The following functions are used to transfer a BIGNUM
- * from/to that table. */
-static int MOD_EXP_CTIME_COPY_TO_PREBUF(BIGNUM *b, int top, unsigned char *buf, int idx, int width)
-        {
-        size_t i, j;
-        if (bn_wexpand(b, top) == NULL)
-                return 0;
-        while (b->top < top)
-                {
-                b->d[b->top++] = 0;
-                }
-        
-        for (i = 0, j=idx; i < top * sizeof b->d[0]; i++, j+=width)
-                {
-                buf[j] = ((unsigned char*)b->d)[i];
-                }
-        bn_correct_top(b);
-        return 1;
-        }
-static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top, unsigned char *buf, int idx, int width)
-        {
-        size_t i, j;
-        if (bn_wexpand(b, top) == NULL)
-                return 0;
-        for (i=0, j=idx; i < top * sizeof b->d[0]; i++, j+=width)
-                {
-                ((unsigned char*)b->d)[i] = buf[j];
-                }
-        b->top = top;
-        bn_correct_top(b);
-        return 1;
-        }       
-/* Given a pointer value, compute the next address that is a cache line multiple. */
-#define MOD_EXP_CTIME_ALIGN(x_) \
-        ((unsigned char*)(x_) + (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - (((BN_ULONG)(x_)) & (MOD_EXP_CTIME_MIN_CACHE_LINE_MASK))))
-/* This variant of BN_mod_exp_mont() uses fixed windows and the special
- * precomputation memory layout to limit data-dependency to a minimum
- * to protect secret exponents (cf. the hyper-threading timing attacks
- * pointed out by Colin Percival,
- * http://www.daemonology.net/hyperthreading-considered-harmful/)
- */
-int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
-                    const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
-        {
-        int i,bits,ret=0,idx,window,wvalue;
-        int top;
-        BIGNUM *r;
-        const BIGNUM *aa;
-        BN_MONT_CTX *mont=NULL;
-        int numPowers;
-        unsigned char *powerbufFree=NULL;
-        int powerbufLen = 0;
-        unsigned char *powerbuf=NULL;
-        BIGNUM *computeTemp=NULL, *am=NULL;
-        bn_check_top(a);
-        bn_check_top(p);
-        bn_check_top(m);
-        top = m->top;
-        if (!(m->d[0] & 1))
-                {
-                BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME,BN_R_CALLED_WITH_EVEN_MODULUS);
-                return(0);
-                }
-        bits=BN_num_bits(p);
-        if (bits == 0)
-                {
-                ret = BN_one(rr);
-                return ret;
-                }
-        /* Initialize BIGNUM context and allocate intermediate result */
-        BN_CTX_start(ctx);
-        r = BN_CTX_get(ctx);
-        if (r == NULL) goto err;
-        /* Allocate a montgomery context if it was not supplied by the caller.
-         * If this is not done, things will break in the montgomery part.
-         */
-        if (in_mont != NULL)
-                mont=in_mont;
-        else
-                {
-                if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
-                if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
-                }
-        /* Get the window size to use with size of p. */
-        window = BN_window_bits_for_ctime_exponent_size(bits);
-        /* Allocate a buffer large enough to hold all of the pre-computed
-         * powers of a.
-         */
-        numPowers = 1 << window;
-        powerbufLen = sizeof(m->d[0])*top*numPowers;
-        if ((powerbufFree=(unsigned char*)OPENSSL_malloc(powerbufLen+MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH)) == NULL)
-                goto err;
-                
-        powerbuf = MOD_EXP_CTIME_ALIGN(powerbufFree);
-        memset(powerbuf, 0, powerbufLen);
-        /* Initialize the intermediate result. Do this early to save double conversion,
-         * once each for a^0 and intermediate result.
-         */
-        if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
-        if (!MOD_EXP_CTIME_COPY_TO_PREBUF(r, top, powerbuf, 0, numPowers)) goto err;
-        /* Initialize computeTemp as a^1 with montgomery precalcs */
-        computeTemp = BN_CTX_get(ctx);
-        am = BN_CTX_get(ctx);
-        if (computeTemp==NULL || am==NULL) goto err;
-        if (a->neg || BN_ucmp(a,m) >= 0)
-                {
-                if (!BN_mod(am,a,m,ctx))
-                        goto err;
-                aa= am;
-                }
-        else
-                aa=a;
-        if (!BN_to_montgomery(am,aa,mont,ctx)) goto err;
-        if (!BN_copy(computeTemp, am)) goto err;
-        if (!MOD_EXP_CTIME_COPY_TO_PREBUF(am, top, powerbuf, 1, numPowers)) goto err;
-        /* If the window size is greater than 1, then calculate
-         * val[i=2..2^winsize-1]. Powers are computed as a*a^(i-1)
-         * (even powers could instead be computed as (a^(i/2))^2
-         * to use the slight performance advantage of sqr over mul).
-         */
-        if (window > 1)
-                {
-                for (i=2; i<numPowers; i++)
-                        {
-                        /* Calculate a^i = a^(i-1) * a */
-                        if (!BN_mod_mul_montgomery(computeTemp,am,computeTemp,mont,ctx))
-                                goto err;
-                        if (!MOD_EXP_CTIME_COPY_TO_PREBUF(computeTemp, top, powerbuf, i, numPowers)) goto err;
-                        }
-                }
-        /* Adjust the number of bits up to a multiple of the window size.
-         * If the exponent length is not a multiple of the window size, then
-         * this pads the most significant bits with zeros to normalize the
-         * scanning loop to there's no special cases.
-         *
-         * * NOTE: Making the window size a power of two less than the native
-         * * word size ensures that the padded bits won't go past the last
-         * * word in the internal BIGNUM structure. Going past the end will
-         * * still produce the correct result, but causes a different branch
-         * * to be taken in the BN_is_bit_set function.
-         */
-        bits = ((bits+window-1)/window)*window;
-        idx=bits-1;     /* The top bit of the window */
-        /* Scan the exponent one window at a time starting from the most
-         * significant bits.
-         */
-        while (idx >= 0)
-                {
-                wvalue=0; /* The 'value' of the window */
-                
-                /* Scan the window, squaring the result as we go */
-                for (i=0; i<window; i++,idx--)
-                        {
-                        if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))     goto err;
-                        wvalue = (wvalue<<1)+BN_is_bit_set(p,idx);
-                        }
-                
-                /* Fetch the appropriate pre-computed value from the pre-buf */
-                if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(computeTemp, top, powerbuf, wvalue, numPowers)) goto err;
-                /* Multiply the result into the intermediate result */
-                if (!BN_mod_mul_montgomery(r,r,computeTemp,mont,ctx)) goto err;
-                }
-        /* Convert the final result from montgomery to standard format */
-        if (!BN_from_montgomery(rr,r,mont,ctx)) goto err;
-        ret=1;
-err:
-        if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
-        if (powerbuf!=NULL)
-                {
-                OPENSSL_cleanse(powerbuf,powerbufLen);
-                OPENSSL_free(powerbufFree);
-                }
-        if (am!=NULL) BN_clear(am);
-        if (computeTemp!=NULL) BN_clear(computeTemp);
-        BN_CTX_end(ctx);
-        return(ret);
-        }
-int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
-                         const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
-        {
-        BN_MONT_CTX *mont = NULL;
-        int b, bits, ret=0;
-        int r_is_one;
-        BN_ULONG w, next_w;
-        BIGNUM *d, *r, *t;
-        BIGNUM *swap_tmp;
-#define BN_MOD_MUL_WORD(r, w, m) \
-                (BN_mul_word(r, (w)) && \
-                (/* BN_ucmp(r, (m)) < 0 ? 1 :*/  \
-                        (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
-                /* BN_MOD_MUL_WORD is only used with 'w' large,
-                 * so the BN_ucmp test is probably more overhead
-                 * than always using BN_mod (which uses BN_copy if
-                 * a similar test returns true). */
-                /* We can use BN_mod and do not need BN_nnmod because our
-                 * accumulator is never negative (the result of BN_mod does
-                 * not depend on the sign of the modulus).
-                 */
-#define BN_TO_MONTGOMERY_WORD(r, w, mont) \
-                (BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))
-        if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
-                {
-                /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
-                BNerr(BN_F_BN_MOD_EXP_MONT_WORD,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
-                return -1;
-                }
-        bn_check_top(p);
-        bn_check_top(m);
-        if (!BN_is_odd(m))
-                {
-                BNerr(BN_F_BN_MOD_EXP_MONT_WORD,BN_R_CALLED_WITH_EVEN_MODULUS);
-                return(0);
-                }
-        if (m->top == 1)
-                a %= m->d[0]; /* make sure that 'a' is reduced */
-        bits = BN_num_bits(p);
-        if (bits == 0)
-                {
-                ret = BN_one(rr);
-                return ret;
-                }
-        if (a == 0)
-                {
-                BN_zero(rr);
-                ret = 1;
-                return ret;
-                }
-        BN_CTX_start(ctx);
-        d = BN_CTX_get(ctx);
-        r = BN_CTX_get(ctx);
-        t = BN_CTX_get(ctx);
-        if (d == NULL || r == NULL || t == NULL) goto err;
-        if (in_mont != NULL)
-                mont=in_mont;
-        else
-                {
-                if ((mont = BN_MONT_CTX_new()) == NULL) goto err;
-                if (!BN_MONT_CTX_set(mont, m, ctx)) goto err;
-                }
-        r_is_one = 1; /* except for Montgomery factor */
-        /* bits-1 >= 0 */
-        /* The result is accumulated in the product r*w. */
-        w = a; /* bit 'bits-1' of 'p' is always set */
-        for (b = bits-2; b >= 0; b--)
-                {
-                /* First, square r*w. */
-                next_w = w*w;
-                if ((next_w/w) != w) /* overflow */
-                        {
-                        if (r_is_one)
-                                {
-                                if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
-                                r_is_one = 0;
-                                }
-                        else
-                                {
-                                if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
-                                }
-                        next_w = 1;
-                        }
-                w = next_w;
-                if (!r_is_one)
-                        {
-                        if (!BN_mod_mul_montgomery(r, r, r, mont, ctx)) goto err;
-                        }
-                /* Second, multiply r*w by 'a' if exponent bit is set. */
-                if (BN_is_bit_set(p, b))
-                        {
-                        next_w = w*a;
-                        if ((next_w/a) != w) /* overflow */
-                                {
-                                if (r_is_one)
-                                        {
-                                        if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
-                                        r_is_one = 0;
-                                        }
-                                else
-                                        {
-                                        if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
-                                        }
-                                next_w = a;
-                                }
-                        w = next_w;
-                        }
-                }
-        /* Finally, set r:=r*w. */
-        if (w != 1)
-                {
-                if (r_is_one)
-                        {
-                        if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
-                        r_is_one = 0;
-                        }
-                else
-                        {
-                        if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
-                        }
-                }
-        if (r_is_one) /* can happen only if a == 1*/
-                {
-                if (!BN_one(rr)) goto err;
-                }
-        else
-                {
-                if (!BN_from_montgomery(rr, r, mont, ctx)) goto err;
-                }
-        ret = 1;
-err:
-        if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
-        BN_CTX_end(ctx);
-        bn_check_top(rr);
-        return(ret);
-        }
-/* The old fallback, simple version :-) */
-int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
-                const BIGNUM *m, BN_CTX *ctx)
-        {
-        int i,j,bits,ret=0,wstart,wend,window,wvalue;
-        int start=1;
-        BIGNUM *d;
-        /* Table of variables obtained from 'ctx' */
-        BIGNUM *val[TABLE_SIZE];
-        if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
-                {
-                /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
-                BNerr(BN_F_BN_MOD_EXP_SIMPLE,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
-                return -1;
-                }
-        bits=BN_num_bits(p);
-        if (bits == 0)
-                {
-                ret = BN_one(r);
-                return ret;
-                }
-        BN_CTX_start(ctx);
-        d = BN_CTX_get(ctx);
-        val[0] = BN_CTX_get(ctx);
-        if(!d || !val[0]) goto err;
-        if (!BN_nnmod(val[0],a,m,ctx)) goto err;                /* 1 */
-        if (BN_is_zero(val[0]))
-                {
-                BN_zero(r);
-                ret = 1;
-                goto err;
-                }
-        window = BN_window_bits_for_exponent_size(bits);
-        if (window > 1)
-                {
-                if (!BN_mod_mul(d,val[0],val[0],m,ctx))
-                        goto err;                               /* 2 */
-                j=1<<(window-1);
-                for (i=1; i<j; i++)
-                        {
-                        if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
-                                        !BN_mod_mul(val[i],val[i-1],d,m,ctx))
-                                goto err;
-                        }
-                }
-        start=1;        /* This is used to avoid multiplication etc
-                         * when there is only the value '1' in the
-                         * buffer. */
-        wvalue=0;       /* The 'value' of the window */
-        wstart=bits-1;  /* The top bit of the window */
-        wend=0;         /* The bottom bit of the window */
-        if (!BN_one(r)) goto err;
-        for (;;)
-                {
-                if (BN_is_bit_set(p,wstart) == 0)
-                        {
-                        if (!start)
-                                if (!BN_mod_mul(r,r,r,m,ctx))
-                                goto err;
-                        if (wstart == 0) break;
-                        wstart--;
-                        continue;
-                        }
-                /* We now have wstart on a 'set' bit, we now need to work out
-                 * how bit a window to do.  To do this we need to scan
-                 * forward until the last set bit before the end of the
-                 * window */
-                j=wstart;
-                wvalue=1;
-                wend=0;
-                for (i=1; i<window; i++)
-                        {
-                        if (wstart-i < 0) break;
-                        if (BN_is_bit_set(p,wstart-i))
-                                {
-                                wvalue<<=(i-wend);
-                                wvalue|=1;
-                                wend=i;
-                                }
-                        }
-                /* wend is the size of the current window */
-                j=wend+1;
-                /* add the 'bytes above' */
-                if (!start)
-                        for (i=0; i<j; i++)
-                                {
-                                if (!BN_mod_mul(r,r,r,m,ctx))
-                                        goto err;
-                                }
-                
-                /* wvalue will be an odd number < 2^window */
-                if (!BN_mod_mul(r,r,val[wvalue>>1],m,ctx))
-                        goto err;
-                /* move the 'window' down further */
-                wstart-=wend+1;
-                wvalue=0;
-                start=0;
-                if (wstart < 0) break;
-                }
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        bn_check_top(r);
-        return(ret);
-        }
diff --git a/src/lib/libcrypto/bn/bn_exp2.c b/src/lib/libcrypto/bn/bn_exp2.c
deleted file mode 100644
index b3f43cec8c..0000000000
--- a/src/lib/libcrypto/bn/bn_exp2.c
+++ /dev/null
@@ -1,311 +0,0 @@
-/* crypto/bn/bn_exp2.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2000 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#define TABLE_SIZE      32
-int BN_mod_exp2_mont(BIGNUM *rr, const BIGNUM *a1, const BIGNUM *p1,
-        const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
-        BN_CTX *ctx, BN_MONT_CTX *in_mont)
-        {
-        int i,j,bits,b,bits1,bits2,ret=0,wpos1,wpos2,window1,window2,wvalue1,wvalue2;
-        int r_is_one=1;
-        BIGNUM *d,*r;
-        const BIGNUM *a_mod_m;
-        /* Tables of variables obtained from 'ctx' */
-        BIGNUM *val1[TABLE_SIZE], *val2[TABLE_SIZE];
-        BN_MONT_CTX *mont=NULL;
-        bn_check_top(a1);
-        bn_check_top(p1);
-        bn_check_top(a2);
-        bn_check_top(p2);
-        bn_check_top(m);
-        if (!(m->d[0] & 1))
-                {
-                BNerr(BN_F_BN_MOD_EXP2_MONT,BN_R_CALLED_WITH_EVEN_MODULUS);
-                return(0);
-                }
-        bits1=BN_num_bits(p1);
-        bits2=BN_num_bits(p2);
-        if ((bits1 == 0) && (bits2 == 0))
-                {
-                ret = BN_one(rr);
-                return ret;
-                }
-        
-        bits=(bits1 > bits2)?bits1:bits2;
-        BN_CTX_start(ctx);
-        d = BN_CTX_get(ctx);
-        r = BN_CTX_get(ctx);
-        val1[0] = BN_CTX_get(ctx);
-        val2[0] = BN_CTX_get(ctx);
-        if(!d || !r || !val1[0] || !val2[0]) goto err;
-        if (in_mont != NULL)
-                mont=in_mont;
-        else
-                {
-                if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
-                if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
-                }
-        window1 = BN_window_bits_for_exponent_size(bits1);
-        window2 = BN_window_bits_for_exponent_size(bits2);
-        /*
-         * Build table for a1:   val1[i] := a1^(2*i + 1) mod m  for i = 0 .. 2^(window1-1)
-         */
-        if (a1->neg || BN_ucmp(a1,m) >= 0)
-                {
-                if (!BN_mod(val1[0],a1,m,ctx))
-                        goto err;
-                a_mod_m = val1[0];
-                }
-        else
-                a_mod_m = a1;
-        if (BN_is_zero(a_mod_m))
-                {
-                BN_zero(rr);
-                ret = 1;
-                goto err;
-                }
-        if (!BN_to_montgomery(val1[0],a_mod_m,mont,ctx)) goto err;
-        if (window1 > 1)
-                {
-                if (!BN_mod_mul_montgomery(d,val1[0],val1[0],mont,ctx)) goto err;
-                j=1<<(window1-1);
-                for (i=1; i<j; i++)
-                        {
-                        if(((val1[i] = BN_CTX_get(ctx)) == NULL) ||
-                                        !BN_mod_mul_montgomery(val1[i],val1[i-1],
-                                                d,mont,ctx))
-                                goto err;
-                        }
-                }
-        /*
-         * Build table for a2:   val2[i] := a2^(2*i + 1) mod m  for i = 0 .. 2^(window2-1)
-         */
-        if (a2->neg || BN_ucmp(a2,m) >= 0)
-                {
-                if (!BN_mod(val2[0],a2,m,ctx))
-                        goto err;
-                a_mod_m = val2[0];
-                }
-        else
-                a_mod_m = a2;
-        if (BN_is_zero(a_mod_m))
-                {
-                BN_zero(rr);
-                ret = 1;
-                goto err;
-                }
-        if (!BN_to_montgomery(val2[0],a_mod_m,mont,ctx)) goto err;
-        if (window2 > 1)
-                {
-                if (!BN_mod_mul_montgomery(d,val2[0],val2[0],mont,ctx)) goto err;
-                j=1<<(window2-1);
-                for (i=1; i<j; i++)
-                        {
-                        if(((val2[i] = BN_CTX_get(ctx)) == NULL) ||
-                                        !BN_mod_mul_montgomery(val2[i],val2[i-1],
-                                                d,mont,ctx))
-                                goto err;
-                        }
-                }
-        /* Now compute the power product, using independent windows. */
-        r_is_one=1;
-        wvalue1=0;  /* The 'value' of the first window */
-        wvalue2=0;  /* The 'value' of the second window */
-        wpos1=0;    /* If wvalue1 > 0, the bottom bit of the first window */
-        wpos2=0;    /* If wvalue2 > 0, the bottom bit of the second window */
-        if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
-        for (b=bits-1; b>=0; b--)
-                {
-                if (!r_is_one)
-                        {
-                        if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
-                                goto err;
-                        }
-                
-                if (!wvalue1)
-                        if (BN_is_bit_set(p1, b))
-                                {
-                                /* consider bits b-window1+1 .. b for this window */
-                                i = b-window1+1;
-                                while (!BN_is_bit_set(p1, i)) /* works for i<0 */
-                                        i++;
-                                wpos1 = i;
-                                wvalue1 = 1;
-                                for (i = b-1; i >= wpos1; i--)
-                                        {
-                                        wvalue1 <<= 1;
-                                        if (BN_is_bit_set(p1, i))
-                                                wvalue1++;
-                                        }
-                                }
-                
-                if (!wvalue2)
-                        if (BN_is_bit_set(p2, b))
-                                {
-                                /* consider bits b-window2+1 .. b for this window */
-                                i = b-window2+1;
-                                while (!BN_is_bit_set(p2, i))
-                                        i++;
-                                wpos2 = i;
-                                wvalue2 = 1;
-                                for (i = b-1; i >= wpos2; i--)
-                                        {
-                                        wvalue2 <<= 1;
-                                        if (BN_is_bit_set(p2, i))
-                                                wvalue2++;
-                                        }
-                                }
-                if (wvalue1 && b == wpos1)
-                        {
-                        /* wvalue1 is odd and < 2^window1 */
-                        if (!BN_mod_mul_montgomery(r,r,val1[wvalue1>>1],mont,ctx))
-                                goto err;
-                        wvalue1 = 0;
-                        r_is_one = 0;
-                        }
-                
-                if (wvalue2 && b == wpos2)
-                        {
-                        /* wvalue2 is odd and < 2^window2 */
-                        if (!BN_mod_mul_montgomery(r,r,val2[wvalue2>>1],mont,ctx))
-                                goto err;
-                        wvalue2 = 0;
-                        r_is_one = 0;
-                        }
-                }
-        BN_from_montgomery(rr,r,mont,ctx);
-        ret=1;
-err:
-        if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
-        BN_CTX_end(ctx);
-        bn_check_top(rr);
-        return(ret);
-        }
diff --git a/src/lib/libcrypto/bn/bn_gcd.c b/src/lib/libcrypto/bn/bn_gcd.c
deleted file mode 100644
index 4a352119ba..0000000000
--- a/src/lib/libcrypto/bn/bn_gcd.c
+++ /dev/null
@@ -1,654 +0,0 @@
-/* crypto/bn/bn_gcd.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2001 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include "cryptlib.h"
-#include "bn_lcl.h"
-static BIGNUM *euclid(BIGNUM *a, BIGNUM *b);
-int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx)
-        {
-        BIGNUM *a,*b,*t;
-        int ret=0;
-        bn_check_top(in_a);
-        bn_check_top(in_b);
-        BN_CTX_start(ctx);
-        a = BN_CTX_get(ctx);
-        b = BN_CTX_get(ctx);
-        if (a == NULL || b == NULL) goto err;
-        if (BN_copy(a,in_a) == NULL) goto err;
-        if (BN_copy(b,in_b) == NULL) goto err;
-        a->neg = 0;
-        b->neg = 0;
-        if (BN_cmp(a,b) < 0) { t=a; a=b; b=t; }
-        t=euclid(a,b);
-        if (t == NULL) goto err;
-        if (BN_copy(r,t) == NULL) goto err;
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        bn_check_top(r);
-        return(ret);
-        }
-static BIGNUM *euclid(BIGNUM *a, BIGNUM *b)
-        {
-        BIGNUM *t;
-        int shifts=0;
-        bn_check_top(a);
-        bn_check_top(b);
-        /* 0 <= b <= a */
-        while (!BN_is_zero(b))
-                {
-                /* 0 < b <= a */
-                if (BN_is_odd(a))
-                        {
-                        if (BN_is_odd(b))
-                                {
-                                if (!BN_sub(a,a,b)) goto err;
-                                if (!BN_rshift1(a,a)) goto err;
-                                if (BN_cmp(a,b) < 0)
-                                        { t=a; a=b; b=t; }
-                                }
-                        else            /* a odd - b even */
-                                {
-                                if (!BN_rshift1(b,b)) goto err;
-                                if (BN_cmp(a,b) < 0)
-                                        { t=a; a=b; b=t; }
-                                }
-                        }
-                else                    /* a is even */
-                        {
-                        if (BN_is_odd(b))
-                                {
-                                if (!BN_rshift1(a,a)) goto err;
-                                if (BN_cmp(a,b) < 0)
-                                        { t=a; a=b; b=t; }
-                                }
-                        else            /* a even - b even */
-                                {
-                                if (!BN_rshift1(a,a)) goto err;
-                                if (!BN_rshift1(b,b)) goto err;
-                                shifts++;
-                                }
-                        }
-                /* 0 <= b <= a */
-                }
-        if (shifts)
-                {
-                if (!BN_lshift(a,a,shifts)) goto err;
-                }
-        bn_check_top(a);
-        return(a);
-err:
-        return(NULL);
-        }
-/* solves ax == 1 (mod n) */
-static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
-        const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
-BIGNUM *BN_mod_inverse(BIGNUM *in,
-        const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
-        {
-        BIGNUM *A,*B,*X,*Y,*M,*D,*T,*R=NULL;
-        BIGNUM *ret=NULL;
-        int sign;
-        if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0))
-                {
-                return BN_mod_inverse_no_branch(in, a, n, ctx);
-                }
-        bn_check_top(a);
-        bn_check_top(n);
-        BN_CTX_start(ctx);
-        A = BN_CTX_get(ctx);
-        B = BN_CTX_get(ctx);
-        X = BN_CTX_get(ctx);
-        D = BN_CTX_get(ctx);
-        M = BN_CTX_get(ctx);
-        Y = BN_CTX_get(ctx);
-        T = BN_CTX_get(ctx);
-        if (T == NULL) goto err;
-        if (in == NULL)
-                R=BN_new();
-        else
-                R=in;
-        if (R == NULL) goto err;
-        BN_one(X);
-        BN_zero(Y);
-        if (BN_copy(B,a) == NULL) goto err;
-        if (BN_copy(A,n) == NULL) goto err;
-        A->neg = 0;
-        if (B->neg || (BN_ucmp(B, A) >= 0))
-                {
-                if (!BN_nnmod(B, B, A, ctx)) goto err;
-                }
-        sign = -1;
-        /* From  B = a mod |n|,  A = |n|  it follows that
-         *
-         *      0 <= B < A,
-         *     -sign*X*a  ==  B   (mod |n|),
-         *      sign*Y*a  ==  A   (mod |n|).
-         */
-        if (BN_is_odd(n) && (BN_num_bits(n) <= (BN_BITS <= 32 ? 450 : 2048)))
-                {
-                /* Binary inversion algorithm; requires odd modulus.
-                 * This is faster than the general algorithm if the modulus
-                 * is sufficiently small (about 400 .. 500 bits on 32-bit
-                 * sytems, but much more on 64-bit systems) */
-                int shift;
-                
-                while (!BN_is_zero(B))
-                        {
-                        /*
-                         *      0 < B < |n|,
-                         *      0 < A <= |n|,
-                         * (1) -sign*X*a  ==  B   (mod |n|),
-                         * (2)  sign*Y*a  ==  A   (mod |n|)
-                         */
-                        /* Now divide  B  by the maximum possible power of two in the integers,
-                         * and divide  X  by the same value mod |n|.
-                         * When we're done, (1) still holds. */
-                        shift = 0;
-                        while (!BN_is_bit_set(B, shift)) /* note that 0 < B */
-                                {
-                                shift++;
-                                
-                                if (BN_is_odd(X))
-                                        {
-                                        if (!BN_uadd(X, X, n)) goto err;
-                                        }
-                                /* now X is even, so we can easily divide it by two */
-                                if (!BN_rshift1(X, X)) goto err;
-                                }
-                        if (shift > 0)
-                                {
-                                if (!BN_rshift(B, B, shift)) goto err;
-                                }
-                        /* Same for  A  and  Y.  Afterwards, (2) still holds. */
-                        shift = 0;
-                        while (!BN_is_bit_set(A, shift)) /* note that 0 < A */
-                                {
-                                shift++;
-                                
-                                if (BN_is_odd(Y))
-                                        {
-                                        if (!BN_uadd(Y, Y, n)) goto err;
-                                        }
-                                /* now Y is even */
-                                if (!BN_rshift1(Y, Y)) goto err;
-                                }
-                        if (shift > 0)
-                                {
-                                if (!BN_rshift(A, A, shift)) goto err;
-                                }
-                        
-                        /* We still have (1) and (2).
-                         * Both  A  and  B  are odd.
-                         * The following computations ensure that
-                         *
-                         *     0 <= B < |n|,
-                         *      0 < A < |n|,
-                         * (1) -sign*X*a  ==  B   (mod |n|),
-                         * (2)  sign*Y*a  ==  A   (mod |n|),
-                         *
-                         * and that either  A  or  B  is even in the next iteration.
-                         */
-                        if (BN_ucmp(B, A) >= 0)
-                                {
-                                /* -sign*(X + Y)*a == B - A  (mod |n|) */
-                                if (!BN_uadd(X, X, Y)) goto err;
-                                /* NB: we could use BN_mod_add_quick(X, X, Y, n), but that
-                                 * actually makes the algorithm slower */
-                                if (!BN_usub(B, B, A)) goto err;
-                                }
-                        else
-                                {
-                                /*  sign*(X + Y)*a == A - B  (mod |n|) */
-                                if (!BN_uadd(Y, Y, X)) goto err;
-                                /* as above, BN_mod_add_quick(Y, Y, X, n) would slow things down */
-                                if (!BN_usub(A, A, B)) goto err;
-                                }
-                        }
-                }
-        else
-                {
-                /* general inversion algorithm */
-                while (!BN_is_zero(B))
-                        {
-                        BIGNUM *tmp;
-                        
-                        /*
-                         *      0 < B < A,
-                         * (*) -sign*X*a  ==  B   (mod |n|),
-                         *      sign*Y*a  ==  A   (mod |n|)
-                         */
-                        
-                        /* (D, M) := (A/B, A%B) ... */
-                        if (BN_num_bits(A) == BN_num_bits(B))
-                                {
-                                if (!BN_one(D)) goto err;
-                                if (!BN_sub(M,A,B)) goto err;
-                                }
-                        else if (BN_num_bits(A) == BN_num_bits(B) + 1)
-                                {
-                                /* A/B is 1, 2, or 3 */
-                                if (!BN_lshift1(T,B)) goto err;
-                                if (BN_ucmp(A,T) < 0)
-                                        {
-                                        /* A < 2*B, so D=1 */
-                                        if (!BN_one(D)) goto err;
-                                        if (!BN_sub(M,A,B)) goto err;
-                                        }
-                                else
-                                        {
-                                        /* A >= 2*B, so D=2 or D=3 */
-                                        if (!BN_sub(M,A,T)) goto err;
-                                        if (!BN_add(D,T,B)) goto err; /* use D (:= 3*B) as temp */
-                                        if (BN_ucmp(A,D) < 0)
-                                                {
-                                                /* A < 3*B, so D=2 */
-                                                if (!BN_set_word(D,2)) goto err;
-                                                /* M (= A - 2*B) already has the correct value */
-                                                }
-                                        else
-                                                {
-                                                /* only D=3 remains */
-                                                if (!BN_set_word(D,3)) goto err;
-                                                /* currently  M = A - 2*B,  but we need  M = A - 3*B */
-                                                if (!BN_sub(M,M,B)) goto err;
-                                                }
-                                        }
-                                }
-                        else
-                                {
-                                if (!BN_div(D,M,A,B,ctx)) goto err;
-                                }
-                        
-                        /* Now
-                         *      A = D*B + M;
-                         * thus we have
-                         * (**)  sign*Y*a  ==  D*B + M   (mod |n|).
-                         */
-                        
-                        tmp=A; /* keep the BIGNUM object, the value does not matter */
-                        
-                        /* (A, B) := (B, A mod B) ... */
-                        A=B;
-                        B=M;
-                        /* ... so we have  0 <= B < A  again */
-                        
-                        /* Since the former  M  is now  B  and the former  B  is now  A,
-                         * (**) translates into
-                         *       sign*Y*a  ==  D*A + B    (mod |n|),
-                         * i.e.
-                         *       sign*Y*a - D*A  ==  B    (mod |n|).
-                         * Similarly, (*) translates into
-                         *      -sign*X*a  ==  A          (mod |n|).
-                         *
-                         * Thus,
-                         *   sign*Y*a + D*sign*X*a  ==  B  (mod |n|),
-                         * i.e.
-                         *        sign*(Y + D*X)*a  ==  B  (mod |n|).
-                         *
-                         * So if we set  (X, Y, sign) := (Y + D*X, X, -sign),  we arrive back at
-                         *      -sign*X*a  ==  B   (mod |n|),
-                         *       sign*Y*a  ==  A   (mod |n|).
-                         * Note that  X  and  Y  stay non-negative all the time.
-                         */
-                        
-                        /* most of the time D is very small, so we can optimize tmp := D*X+Y */
-                        if (BN_is_one(D))
-                                {
-                                if (!BN_add(tmp,X,Y)) goto err;
-                                }
-                        else
-                                {
-                                if (BN_is_word(D,2))
-                                        {
-                                        if (!BN_lshift1(tmp,X)) goto err;
-                                        }
-                                else if (BN_is_word(D,4))
-                                        {
-                                        if (!BN_lshift(tmp,X,2)) goto err;
-                                        }
-                                else if (D->top == 1)
-                                        {
-                                        if (!BN_copy(tmp,X)) goto err;
-                                        if (!BN_mul_word(tmp,D->d[0])) goto err;
-                                        }
-                                else
-                                        {
-                                        if (!BN_mul(tmp,D,X,ctx)) goto err;
-                                        }
-                                if (!BN_add(tmp,tmp,Y)) goto err;
-                                }
-                        
-                        M=Y; /* keep the BIGNUM object, the value does not matter */
-                        Y=X;
-                        X=tmp;
-                        sign = -sign;
-                        }
-                }
-                
-        /*
-         * The while loop (Euclid's algorithm) ends when
-         *      A == gcd(a,n);
-         * we have
-         *       sign*Y*a  ==  A  (mod |n|),
-         * where  Y  is non-negative.
-         */
-        if (sign < 0)
-                {
-                if (!BN_sub(Y,n,Y)) goto err;
-                }
-        /* Now  Y*a  ==  A  (mod |n|).  */
-        
-        if (BN_is_one(A))
-                {
-                /* Y*a == 1  (mod |n|) */
-                if (!Y->neg && BN_ucmp(Y,n) < 0)
-                        {
-                        if (!BN_copy(R,Y)) goto err;
-                        }
-                else
-                        {
-                        if (!BN_nnmod(R,Y,n,ctx)) goto err;
-                        }
-                }
-        else
-                {
-                BNerr(BN_F_BN_MOD_INVERSE,BN_R_NO_INVERSE);
-                goto err;
-                }
-        ret=R;
-err:
-        if ((ret == NULL) && (in == NULL)) BN_free(R);
-        BN_CTX_end(ctx);
-        bn_check_top(ret);
-        return(ret);
-        }
-/* BN_mod_inverse_no_branch is a special version of BN_mod_inverse. 
- * It does not contain branches that may leak sensitive information.
- */
-static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
-        const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
-        {
-        BIGNUM *A,*B,*X,*Y,*M,*D,*T,*R=NULL;
-        BIGNUM local_A, local_B;
-        BIGNUM *pA, *pB;
-        BIGNUM *ret=NULL;
-        int sign;
-        bn_check_top(a);
-        bn_check_top(n);
-        BN_CTX_start(ctx);
-        A = BN_CTX_get(ctx);
-        B = BN_CTX_get(ctx);
-        X = BN_CTX_get(ctx);
-        D = BN_CTX_get(ctx);
-        M = BN_CTX_get(ctx);
-        Y = BN_CTX_get(ctx);
-        T = BN_CTX_get(ctx);
-        if (T == NULL) goto err;
-        if (in == NULL)
-                R=BN_new();
-        else
-                R=in;
-        if (R == NULL) goto err;
-        BN_one(X);
-        BN_zero(Y);
-        if (BN_copy(B,a) == NULL) goto err;
-        if (BN_copy(A,n) == NULL) goto err;
-        A->neg = 0;
-        if (B->neg || (BN_ucmp(B, A) >= 0))
-                {
-                /* Turn BN_FLG_CONSTTIME flag on, so that when BN_div is invoked,
-                 * BN_div_no_branch will be called eventually.
-                 */
-                pB = &local_B;
-                BN_with_flags(pB, B, BN_FLG_CONSTTIME); 
-                if (!BN_nnmod(B, pB, A, ctx)) goto err;
-                }
-        sign = -1;
-        /* From  B = a mod |n|,  A = |n|  it follows that
-         *
-         *      0 <= B < A,
-         *     -sign*X*a  ==  B   (mod |n|),
-         *      sign*Y*a  ==  A   (mod |n|).
-         */
-        while (!BN_is_zero(B))
-                {
-                BIGNUM *tmp;
-                
-                /*
-                 *      0 < B < A,
-                 * (*) -sign*X*a  ==  B   (mod |n|),
-                 *      sign*Y*a  ==  A   (mod |n|)
-                 */
-                /* Turn BN_FLG_CONSTTIME flag on, so that when BN_div is invoked,
-                 * BN_div_no_branch will be called eventually.
-                 */
-                pA = &local_A;
-                BN_with_flags(pA, A, BN_FLG_CONSTTIME); 
-                
-                /* (D, M) := (A/B, A%B) ... */          
-                if (!BN_div(D,M,pA,B,ctx)) goto err;
-                
-                /* Now
-                 *      A = D*B + M;
-                 * thus we have
-                 * (**)  sign*Y*a  ==  D*B + M   (mod |n|).
-                 */
-                
-                tmp=A; /* keep the BIGNUM object, the value does not matter */
-                
-                /* (A, B) := (B, A mod B) ... */
-                A=B;
-                B=M;
-                /* ... so we have  0 <= B < A  again */
-                
-                /* Since the former  M  is now  B  and the former  B  is now  A,
-                 * (**) translates into
-                 *       sign*Y*a  ==  D*A + B    (mod |n|),
-                 * i.e.
-                 *       sign*Y*a - D*A  ==  B    (mod |n|).
-                 * Similarly, (*) translates into
-                 *      -sign*X*a  ==  A          (mod |n|).
-                 *
-                 * Thus,
-                 *   sign*Y*a + D*sign*X*a  ==  B  (mod |n|),
-                 * i.e.
-                 *        sign*(Y + D*X)*a  ==  B  (mod |n|).
-                 *
-                 * So if we set  (X, Y, sign) := (Y + D*X, X, -sign),  we arrive back at
-                 *      -sign*X*a  ==  B   (mod |n|),
-                 *       sign*Y*a  ==  A   (mod |n|).
-                 * Note that  X  and  Y  stay non-negative all the time.
-                 */
-                        
-                if (!BN_mul(tmp,D,X,ctx)) goto err;
-                if (!BN_add(tmp,tmp,Y)) goto err;
-                M=Y; /* keep the BIGNUM object, the value does not matter */
-                Y=X;
-                X=tmp;
-                sign = -sign;
-                }
-                
-        /*
-         * The while loop (Euclid's algorithm) ends when
-         *      A == gcd(a,n);
-         * we have
-         *       sign*Y*a  ==  A  (mod |n|),
-         * where  Y  is non-negative.
-         */
-        if (sign < 0)
-                {
-                if (!BN_sub(Y,n,Y)) goto err;
-                }
-        /* Now  Y*a  ==  A  (mod |n|).  */
-        if (BN_is_one(A))
-                {
-                /* Y*a == 1  (mod |n|) */
-                if (!Y->neg && BN_ucmp(Y,n) < 0)
-                        {
-                        if (!BN_copy(R,Y)) goto err;
-                        }
-                else
-                        {
-                        if (!BN_nnmod(R,Y,n,ctx)) goto err;
-                        }
-                }
-        else
-                {
-                BNerr(BN_F_BN_MOD_INVERSE_NO_BRANCH,BN_R_NO_INVERSE);
-                goto err;
-                }
-        ret=R;
-err:
-        if ((ret == NULL) && (in == NULL)) BN_free(R);
-        BN_CTX_end(ctx);
-        bn_check_top(ret);
-        return(ret);
-        }
diff --git a/src/lib/libcrypto/bn/bn_gf2m.c b/src/lib/libcrypto/bn/bn_gf2m.c
deleted file mode 100644
index 306f029f27..0000000000
--- a/src/lib/libcrypto/bn/bn_gf2m.c
+++ /dev/null
@@ -1,1095 +0,0 @@
-/* crypto/bn/bn_gf2m.c */
-/* ====================================================================
- * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
- *
- * The Elliptic Curve Public-Key Crypto Library (ECC Code) included
- * herein is developed by SUN MICROSYSTEMS, INC., and is contributed
- * to the OpenSSL project.
- *
- * The ECC Code is licensed pursuant to the OpenSSL open source
- * license provided below.
- *
- * In addition, Sun covenants to all licensees who provide a reciprocal
- * covenant with respect to their own patents if any, not to sue under
- * current and future patent claims necessarily infringed by the making,
- * using, practicing, selling, offering for sale and/or otherwise
- * disposing of the ECC Code as delivered hereunder (or portions thereof),
- * provided that such covenant shall not apply:
- *  1) for code that a licensee deletes from the ECC Code;
- *  2) separates from the ECC Code; or
- *  3) for infringements caused by:
- *       i) the modification of the ECC Code or
- *      ii) the combination of the ECC Code with other software or
- *          devices where such combination causes the infringement.
- *
- * The software is originally written by Sheueling Chang Shantz and
- * Douglas Stebila of Sun Microsystems Laboratories.
- *
- */
-/* NOTE: This file is licensed pursuant to the OpenSSL license below
- * and may be modified; but after modifications, the above covenant
- * may no longer apply!  In such cases, the corresponding paragraph
- * ["In addition, Sun covenants ... causes the infringement."] and
- * this note can be edited out; but please keep the Sun copyright
- * notice and attribution. */
-/* ====================================================================
- * Copyright (c) 1998-2002 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include <assert.h>
-#include <limits.h>
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* Maximum number of iterations before BN_GF2m_mod_solve_quad_arr should fail. */
-#define MAX_ITERATIONS 50
-static const BN_ULONG SQR_tb[16] =
-  {     0,     1,     4,     5,    16,    17,    20,    21,
-       64,    65,    68,    69,    80,    81,    84,    85 };
-/* Platform-specific macros to accelerate squaring. */
-#if defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
-#define SQR1(w) \
-    SQR_tb[(w) >> 60 & 0xF] << 56 | SQR_tb[(w) >> 56 & 0xF] << 48 | \
-    SQR_tb[(w) >> 52 & 0xF] << 40 | SQR_tb[(w) >> 48 & 0xF] << 32 | \
-    SQR_tb[(w) >> 44 & 0xF] << 24 | SQR_tb[(w) >> 40 & 0xF] << 16 | \
-    SQR_tb[(w) >> 36 & 0xF] <<  8 | SQR_tb[(w) >> 32 & 0xF]
-#define SQR0(w) \
-    SQR_tb[(w) >> 28 & 0xF] << 56 | SQR_tb[(w) >> 24 & 0xF] << 48 | \
-    SQR_tb[(w) >> 20 & 0xF] << 40 | SQR_tb[(w) >> 16 & 0xF] << 32 | \
-    SQR_tb[(w) >> 12 & 0xF] << 24 | SQR_tb[(w) >>  8 & 0xF] << 16 | \
-    SQR_tb[(w) >>  4 & 0xF] <<  8 | SQR_tb[(w)       & 0xF]
-#endif
-#ifdef THIRTY_TWO_BIT
-#define SQR1(w) \
-    SQR_tb[(w) >> 28 & 0xF] << 24 | SQR_tb[(w) >> 24 & 0xF] << 16 | \
-    SQR_tb[(w) >> 20 & 0xF] <<  8 | SQR_tb[(w) >> 16 & 0xF]
-#define SQR0(w) \
-    SQR_tb[(w) >> 12 & 0xF] << 24 | SQR_tb[(w) >>  8 & 0xF] << 16 | \
-    SQR_tb[(w) >>  4 & 0xF] <<  8 | SQR_tb[(w)       & 0xF]
-#endif
-#ifdef SIXTEEN_BIT
-#define SQR1(w) \
-    SQR_tb[(w) >> 12 & 0xF] <<  8 | SQR_tb[(w) >>  8 & 0xF]
-#define SQR0(w) \
-    SQR_tb[(w) >>  4 & 0xF] <<  8 | SQR_tb[(w)       & 0xF]
-#endif
-#ifdef EIGHT_BIT
-#define SQR1(w) \
-    SQR_tb[(w) >>  4 & 0xF]
-#define SQR0(w) \
-    SQR_tb[(w)       & 15]
-#endif
-/* Product of two polynomials a, b each with degree < BN_BITS2 - 1,
- * result is a polynomial r with degree < 2 * BN_BITS - 1
- * The caller MUST ensure that the variables have the right amount
- * of space allocated.
- */
-#ifdef EIGHT_BIT
-static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
-        {
-        register BN_ULONG h, l, s;
-        BN_ULONG tab[4], top1b = a >> 7;
-        register BN_ULONG a1, a2;
-        a1 = a & (0x7F); a2 = a1 << 1;
-        tab[0] = 0; tab[1] = a1; tab[2] = a2; tab[3] = a1^a2;
-        s = tab[b      & 0x3]; l  = s;
-        s = tab[b >> 2 & 0x3]; l ^= s << 2; h  = s >> 6;
-        s = tab[b >> 4 & 0x3]; l ^= s << 4; h ^= s >> 4;
-        s = tab[b >> 6      ]; l ^= s << 6; h ^= s >> 2;
-        
-        /* compensate for the top bit of a */
-        if (top1b & 01) { l ^= b << 7; h ^= b >> 1; } 
-        *r1 = h; *r0 = l;
-        } 
-#endif
-#ifdef SIXTEEN_BIT
-static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
-        {
-        register BN_ULONG h, l, s;
-        BN_ULONG tab[4], top1b = a >> 15; 
-        register BN_ULONG a1, a2;
-        a1 = a & (0x7FFF); a2 = a1 << 1;
-        tab[0] = 0; tab[1] = a1; tab[2] = a2; tab[3] = a1^a2;
-        s = tab[b      & 0x3]; l  = s;
-        s = tab[b >> 2 & 0x3]; l ^= s <<  2; h  = s >> 14;
-        s = tab[b >> 4 & 0x3]; l ^= s <<  4; h ^= s >> 12;
-        s = tab[b >> 6 & 0x3]; l ^= s <<  6; h ^= s >> 10;
-        s = tab[b >> 8 & 0x3]; l ^= s <<  8; h ^= s >>  8;
-        s = tab[b >>10 & 0x3]; l ^= s << 10; h ^= s >>  6;
-        s = tab[b >>12 & 0x3]; l ^= s << 12; h ^= s >>  4;
-        s = tab[b >>14      ]; l ^= s << 14; h ^= s >>  2;
-        /* compensate for the top bit of a */
-        if (top1b & 01) { l ^= b << 15; h ^= b >> 1; } 
-        *r1 = h; *r0 = l;
-        } 
-#endif
-#ifdef THIRTY_TWO_BIT
-static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
-        {
-        register BN_ULONG h, l, s;
-        BN_ULONG tab[8], top2b = a >> 30; 
-        register BN_ULONG a1, a2, a4;
-        a1 = a & (0x3FFFFFFF); a2 = a1 << 1; a4 = a2 << 1;
-        tab[0] =  0; tab[1] = a1;    tab[2] = a2;    tab[3] = a1^a2;
-        tab[4] = a4; tab[5] = a1^a4; tab[6] = a2^a4; tab[7] = a1^a2^a4;
-        s = tab[b       & 0x7]; l  = s;
-        s = tab[b >>  3 & 0x7]; l ^= s <<  3; h  = s >> 29;
-        s = tab[b >>  6 & 0x7]; l ^= s <<  6; h ^= s >> 26;
-        s = tab[b >>  9 & 0x7]; l ^= s <<  9; h ^= s >> 23;
-        s = tab[b >> 12 & 0x7]; l ^= s << 12; h ^= s >> 20;
-        s = tab[b >> 15 & 0x7]; l ^= s << 15; h ^= s >> 17;
-        s = tab[b >> 18 & 0x7]; l ^= s << 18; h ^= s >> 14;
-        s = tab[b >> 21 & 0x7]; l ^= s << 21; h ^= s >> 11;
-        s = tab[b >> 24 & 0x7]; l ^= s << 24; h ^= s >>  8;
-        s = tab[b >> 27 & 0x7]; l ^= s << 27; h ^= s >>  5;
-        s = tab[b >> 30      ]; l ^= s << 30; h ^= s >>  2;
-        /* compensate for the top two bits of a */
-        if (top2b & 01) { l ^= b << 30; h ^= b >> 2; } 
-        if (top2b & 02) { l ^= b << 31; h ^= b >> 1; } 
-        *r1 = h; *r0 = l;
-        } 
-#endif
-#if defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
-static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
-        {
-        register BN_ULONG h, l, s;
-        BN_ULONG tab[16], top3b = a >> 61;
-        register BN_ULONG a1, a2, a4, a8;
-        a1 = a & (0x1FFFFFFFFFFFFFFFULL); a2 = a1 << 1; a4 = a2 << 1; a8 = a4 << 1;
-        tab[ 0] = 0;     tab[ 1] = a1;       tab[ 2] = a2;       tab[ 3] = a1^a2;
-        tab[ 4] = a4;    tab[ 5] = a1^a4;    tab[ 6] = a2^a4;    tab[ 7] = a1^a2^a4;
-        tab[ 8] = a8;    tab[ 9] = a1^a8;    tab[10] = a2^a8;    tab[11] = a1^a2^a8;
-        tab[12] = a4^a8; tab[13] = a1^a4^a8; tab[14] = a2^a4^a8; tab[15] = a1^a2^a4^a8;
-        s = tab[b       & 0xF]; l  = s;
-        s = tab[b >>  4 & 0xF]; l ^= s <<  4; h  = s >> 60;
-        s = tab[b >>  8 & 0xF]; l ^= s <<  8; h ^= s >> 56;
-        s = tab[b >> 12 & 0xF]; l ^= s << 12; h ^= s >> 52;
-        s = tab[b >> 16 & 0xF]; l ^= s << 16; h ^= s >> 48;
-        s = tab[b >> 20 & 0xF]; l ^= s << 20; h ^= s >> 44;
-        s = tab[b >> 24 & 0xF]; l ^= s << 24; h ^= s >> 40;
-        s = tab[b >> 28 & 0xF]; l ^= s << 28; h ^= s >> 36;
-        s = tab[b >> 32 & 0xF]; l ^= s << 32; h ^= s >> 32;
-        s = tab[b >> 36 & 0xF]; l ^= s << 36; h ^= s >> 28;
-        s = tab[b >> 40 & 0xF]; l ^= s << 40; h ^= s >> 24;
-        s = tab[b >> 44 & 0xF]; l ^= s << 44; h ^= s >> 20;
-        s = tab[b >> 48 & 0xF]; l ^= s << 48; h ^= s >> 16;
-        s = tab[b >> 52 & 0xF]; l ^= s << 52; h ^= s >> 12;
-        s = tab[b >> 56 & 0xF]; l ^= s << 56; h ^= s >>  8;
-        s = tab[b >> 60      ]; l ^= s << 60; h ^= s >>  4;
-        /* compensate for the top three bits of a */
-        if (top3b & 01) { l ^= b << 61; h ^= b >> 3; } 
-        if (top3b & 02) { l ^= b << 62; h ^= b >> 2; } 
-        if (top3b & 04) { l ^= b << 63; h ^= b >> 1; } 
-        *r1 = h; *r0 = l;
-        } 
-#endif
-/* Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
- * result is a polynomial r with degree < 4 * BN_BITS2 - 1
- * The caller MUST ensure that the variables have the right amount
- * of space allocated.
- */
-static void bn_GF2m_mul_2x2(BN_ULONG *r, const BN_ULONG a1, const BN_ULONG a0, const BN_ULONG b1, const BN_ULONG b0)
-        {
-        BN_ULONG m1, m0;
-        /* r[3] = h1, r[2] = h0; r[1] = l1; r[0] = l0 */
-        bn_GF2m_mul_1x1(r+3, r+2, a1, b1);
-        bn_GF2m_mul_1x1(r+1, r, a0, b0);
-        bn_GF2m_mul_1x1(&m1, &m0, a0 ^ a1, b0 ^ b1);
-        /* Correction on m1 ^= l1 ^ h1; m0 ^= l0 ^ h0; */
-        r[2] ^= m1 ^ r[1] ^ r[3];  /* h0 ^= m1 ^ l1 ^ h1; */
-        r[1] = r[3] ^ r[2] ^ r[0] ^ m1 ^ m0;  /* l1 ^= l0 ^ h0 ^ m0; */
-        }
-/* Add polynomials a and b and store result in r; r could be a or b, a and b 
- * could be equal; r is the bitwise XOR of a and b.
- */
-int     BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
-        {
-        int i;
-        const BIGNUM *at, *bt;
-        bn_check_top(a);
-        bn_check_top(b);
-        if (a->top < b->top) { at = b; bt = a; }
-        else { at = a; bt = b; }
-        bn_wexpand(r, at->top);
-        for (i = 0; i < bt->top; i++)
-                {
-                r->d[i] = at->d[i] ^ bt->d[i];
-                }
-        for (; i < at->top; i++)
-                {
-                r->d[i] = at->d[i];
-                }
-        
-        r->top = at->top;
-        bn_correct_top(r);
-        
-        return 1;
-        }
-/* Some functions allow for representation of the irreducible polynomials
- * as an int[], say p.  The irreducible f(t) is then of the form:
- *     t^p[0] + t^p[1] + ... + t^p[k]
- * where m = p[0] > p[1] > ... > p[k] = 0.
- */
-/* Performs modular reduction of a and store result in r.  r could be a. */
-int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[])
-        {
-        int j, k;
-        int n, dN, d0, d1;
-        BN_ULONG zz, *z;
-        bn_check_top(a);
-        if (!p[0])
-                {
-                /* reduction mod 1 => return 0 */
-                BN_zero(r);
-                return 1;
-                }
-        /* Since the algorithm does reduction in the r value, if a != r, copy
-         * the contents of a into r so we can do reduction in r. 
-         */
-        if (a != r)
-                {
-                if (!bn_wexpand(r, a->top)) return 0;
-                for (j = 0; j < a->top; j++)
-                        {
-                        r->d[j] = a->d[j];
-                        }
-                r->top = a->top;
-                }
-        z = r->d;
-        /* start reduction */
-        dN = p[0] / BN_BITS2;  
-        for (j = r->top - 1; j > dN;)
-                {
-                zz = z[j];
-                if (z[j] == 0) { j--; continue; }
-                z[j] = 0;
-                for (k = 1; p[k] != 0; k++)
-                        {
-                        /* reducing component t^p[k] */
-                        n = p[0] - p[k];
-                        d0 = n % BN_BITS2;  d1 = BN_BITS2 - d0;
-                        n /= BN_BITS2; 
-                        z[j-n] ^= (zz>>d0);
-                        if (d0) z[j-n-1] ^= (zz<<d1);
-                        }
-                /* reducing component t^0 */
-                n = dN;  
-                d0 = p[0] % BN_BITS2;
-                d1 = BN_BITS2 - d0;
-                z[j-n] ^= (zz >> d0);
-                if (d0) z[j-n-1] ^= (zz << d1);
-                }
-        /* final round of reduction */
-        while (j == dN)
-                {
-                d0 = p[0] % BN_BITS2;
-                zz = z[dN] >> d0;
-                if (zz == 0) break;
-                d1 = BN_BITS2 - d0;
-                
-                /* clear up the top d1 bits */
-                if (d0)
-                        z[dN] = (z[dN] << d1) >> d1;
-                else
-                        z[dN] = 0;
-                z[0] ^= zz; /* reduction t^0 component */
-                for (k = 1; p[k] != 0; k++)
-                        {
-                        BN_ULONG tmp_ulong;
-                        /* reducing component t^p[k]*/
-                        n = p[k] / BN_BITS2;   
-                        d0 = p[k] % BN_BITS2;
-                        d1 = BN_BITS2 - d0;
-                        z[n] ^= (zz << d0);
-                        tmp_ulong = zz >> d1;
-                        if (d0 && tmp_ulong)
-                                z[n+1] ^= tmp_ulong;
-                        }
-                
-                }
-        bn_correct_top(r);
-        return 1;
-        }
-/* Performs modular reduction of a by p and store result in r.  r could be a.
- *
- * This function calls down to the BN_GF2m_mod_arr implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_arr function.
- */
-int     BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p)
-        {
-        int ret = 0;
-        const int max = BN_num_bits(p);
-        unsigned int *arr=NULL;
-        bn_check_top(a);
-        bn_check_top(p);
-        if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
-        ret = BN_GF2m_poly2arr(p, arr, max);
-        if (!ret || ret > max)
-                {
-                BNerr(BN_F_BN_GF2M_MOD,BN_R_INVALID_LENGTH);
-                goto err;
-                }
-        ret = BN_GF2m_mod_arr(r, a, arr);
-        bn_check_top(r);
-err:
-        if (arr) OPENSSL_free(arr);
-        return ret;
-        }
-/* Compute the product of two polynomials a and b, reduce modulo p, and store
- * the result in r.  r could be a or b; a could be b.
- */
-int     BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const unsigned int p[], BN_CTX *ctx)
-        {
-        int zlen, i, j, k, ret = 0;
-        BIGNUM *s;
-        BN_ULONG x1, x0, y1, y0, zz[4];
-        bn_check_top(a);
-        bn_check_top(b);
-        if (a == b)
-                {
-                return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
-                }
-        BN_CTX_start(ctx);
-        if ((s = BN_CTX_get(ctx)) == NULL) goto err;
-        
-        zlen = a->top + b->top + 4;
-        if (!bn_wexpand(s, zlen)) goto err;
-        s->top = zlen;
-        for (i = 0; i < zlen; i++) s->d[i] = 0;
-        for (j = 0; j < b->top; j += 2)
-                {
-                y0 = b->d[j];
-                y1 = ((j+1) == b->top) ? 0 : b->d[j+1];
-                for (i = 0; i < a->top; i += 2)
-                        {
-                        x0 = a->d[i];
-                        x1 = ((i+1) == a->top) ? 0 : a->d[i+1];
-                        bn_GF2m_mul_2x2(zz, x1, x0, y1, y0);
-                        for (k = 0; k < 4; k++) s->d[i+j+k] ^= zz[k];
-                        }
-                }
-        bn_correct_top(s);
-        if (BN_GF2m_mod_arr(r, s, p))
-                ret = 1;
-        bn_check_top(r);
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Compute the product of two polynomials a and b, reduce modulo p, and store
- * the result in r.  r could be a or b; a could equal b.
- *
- * This function calls down to the BN_GF2m_mod_mul_arr implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_mul_arr function.
- */
-int     BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx)
-        {
-        int ret = 0;
-        const int max = BN_num_bits(p);
-        unsigned int *arr=NULL;
-        bn_check_top(a);
-        bn_check_top(b);
-        bn_check_top(p);
-        if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
-        ret = BN_GF2m_poly2arr(p, arr, max);
-        if (!ret || ret > max)
-                {
-                BNerr(BN_F_BN_GF2M_MOD_MUL,BN_R_INVALID_LENGTH);
-                goto err;
-                }
-        ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
-        bn_check_top(r);
-err:
-        if (arr) OPENSSL_free(arr);
-        return ret;
-        }
-/* Square a, reduce the result mod p, and store it in a.  r could be a. */
-int     BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
-        {
-        int i, ret = 0;
-        BIGNUM *s;
-        bn_check_top(a);
-        BN_CTX_start(ctx);
-        if ((s = BN_CTX_get(ctx)) == NULL) return 0;
-        if (!bn_wexpand(s, 2 * a->top)) goto err;
-        for (i = a->top - 1; i >= 0; i--)
-                {
-                s->d[2*i+1] = SQR1(a->d[i]);
-                s->d[2*i  ] = SQR0(a->d[i]);
-                }
-        s->top = 2 * a->top;
-        bn_correct_top(s);
-        if (!BN_GF2m_mod_arr(r, s, p)) goto err;
-        bn_check_top(r);
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Square a, reduce the result mod p, and store it in a.  r could be a.
- *
- * This function calls down to the BN_GF2m_mod_sqr_arr implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_sqr_arr function.
- */
-int     BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
-        {
-        int ret = 0;
-        const int max = BN_num_bits(p);
-        unsigned int *arr=NULL;
-        bn_check_top(a);
-        bn_check_top(p);
-        if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
-        ret = BN_GF2m_poly2arr(p, arr, max);
-        if (!ret || ret > max)
-                {
-                BNerr(BN_F_BN_GF2M_MOD_SQR,BN_R_INVALID_LENGTH);
-                goto err;
-                }
-        ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
-        bn_check_top(r);
-err:
-        if (arr) OPENSSL_free(arr);
-        return ret;
-        }
-/* Invert a, reduce modulo p, and store the result in r. r could be a. 
- * Uses Modified Almost Inverse Algorithm (Algorithm 10) from
- *     Hankerson, D., Hernandez, J.L., and Menezes, A.  "Software Implementation
- *     of Elliptic Curve Cryptography Over Binary Fields".
- */
-int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
-        {
-        BIGNUM *b, *c, *u, *v, *tmp;
-        int ret = 0;
-        bn_check_top(a);
-        bn_check_top(p);
-        BN_CTX_start(ctx);
-        
-        b = BN_CTX_get(ctx);
-        c = BN_CTX_get(ctx);
-        u = BN_CTX_get(ctx);
-        v = BN_CTX_get(ctx);
-        if (v == NULL) goto err;
-        if (!BN_one(b)) goto err;
-        if (!BN_GF2m_mod(u, a, p)) goto err;
-        if (!BN_copy(v, p)) goto err;
-        if (BN_is_zero(u)) goto err;
-        while (1)
-                {
-                while (!BN_is_odd(u))
-                        {
-                        if (!BN_rshift1(u, u)) goto err;
-                        if (BN_is_odd(b))
-                                {
-                                if (!BN_GF2m_add(b, b, p)) goto err;
-                                }
-                        if (!BN_rshift1(b, b)) goto err;
-                        }
-                if (BN_abs_is_word(u, 1)) break;
-                if (BN_num_bits(u) < BN_num_bits(v))
-                        {
-                        tmp = u; u = v; v = tmp;
-                        tmp = b; b = c; c = tmp;
-                        }
-                
-                if (!BN_GF2m_add(u, u, v)) goto err;
-                if (!BN_GF2m_add(b, b, c)) goto err;
-                }
-        if (!BN_copy(r, b)) goto err;
-        bn_check_top(r);
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Invert xx, reduce modulo p, and store the result in r. r could be xx. 
- *
- * This function calls down to the BN_GF2m_mod_inv implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_inv function.
- */
-int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *xx, const unsigned int p[], BN_CTX *ctx)
-        {
-        BIGNUM *field;
-        int ret = 0;
-        bn_check_top(xx);
-        BN_CTX_start(ctx);
-        if ((field = BN_CTX_get(ctx)) == NULL) goto err;
-        if (!BN_GF2m_arr2poly(p, field)) goto err;
-        
-        ret = BN_GF2m_mod_inv(r, xx, field, ctx);
-        bn_check_top(r);
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-#ifndef OPENSSL_SUN_GF2M_DIV
-/* Divide y by x, reduce modulo p, and store the result in r. r could be x 
- * or y, x could equal y.
- */
-int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x, const BIGNUM *p, BN_CTX *ctx)
-        {
-        BIGNUM *xinv = NULL;
-        int ret = 0;
-        bn_check_top(y);
-        bn_check_top(x);
-        bn_check_top(p);
-        BN_CTX_start(ctx);
-        xinv = BN_CTX_get(ctx);
-        if (xinv == NULL) goto err;
-        
-        if (!BN_GF2m_mod_inv(xinv, x, p, ctx)) goto err;
-        if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx)) goto err;
-        bn_check_top(r);
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-#else
-/* Divide y by x, reduce modulo p, and store the result in r. r could be x 
- * or y, x could equal y.
- * Uses algorithm Modular_Division_GF(2^m) from 
- *     Chang-Shantz, S.  "From Euclid's GCD to Montgomery Multiplication to 
- *     the Great Divide".
- */
-int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x, const BIGNUM *p, BN_CTX *ctx)
-        {
-        BIGNUM *a, *b, *u, *v;
-        int ret = 0;
-        bn_check_top(y);
-        bn_check_top(x);
-        bn_check_top(p);
-        BN_CTX_start(ctx);
-        
-        a = BN_CTX_get(ctx);
-        b = BN_CTX_get(ctx);
-        u = BN_CTX_get(ctx);
-        v = BN_CTX_get(ctx);
-        if (v == NULL) goto err;
-        /* reduce x and y mod p */
-        if (!BN_GF2m_mod(u, y, p)) goto err;
-        if (!BN_GF2m_mod(a, x, p)) goto err;
-        if (!BN_copy(b, p)) goto err;
-        
-        while (!BN_is_odd(a))
-                {
-                if (!BN_rshift1(a, a)) goto err;
-                if (BN_is_odd(u)) if (!BN_GF2m_add(u, u, p)) goto err;
-                if (!BN_rshift1(u, u)) goto err;
-                }
-        do
-                {
-                if (BN_GF2m_cmp(b, a) > 0)
-                        {
-                        if (!BN_GF2m_add(b, b, a)) goto err;
-                        if (!BN_GF2m_add(v, v, u)) goto err;
-                        do
-                                {
-                                if (!BN_rshift1(b, b)) goto err;
-                                if (BN_is_odd(v)) if (!BN_GF2m_add(v, v, p)) goto err;
-                                if (!BN_rshift1(v, v)) goto err;
-                                } while (!BN_is_odd(b));
-                        }
-                else if (BN_abs_is_word(a, 1))
-                        break;
-                else
-                        {
-                        if (!BN_GF2m_add(a, a, b)) goto err;
-                        if (!BN_GF2m_add(u, u, v)) goto err;
-                        do
-                                {
-                                if (!BN_rshift1(a, a)) goto err;
-                                if (BN_is_odd(u)) if (!BN_GF2m_add(u, u, p)) goto err;
-                                if (!BN_rshift1(u, u)) goto err;
-                                } while (!BN_is_odd(a));
-                        }
-                } while (1);
-        if (!BN_copy(r, u)) goto err;
-        bn_check_top(r);
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-#endif
-/* Divide yy by xx, reduce modulo p, and store the result in r. r could be xx 
- * or yy, xx could equal yy.
- *
- * This function calls down to the BN_GF2m_mod_div implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_div function.
- */
-int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *yy, const BIGNUM *xx, const unsigned int p[], BN_CTX *ctx)
-        {
-        BIGNUM *field;
-        int ret = 0;
-        bn_check_top(yy);
-        bn_check_top(xx);
-        BN_CTX_start(ctx);
-        if ((field = BN_CTX_get(ctx)) == NULL) goto err;
-        if (!BN_GF2m_arr2poly(p, field)) goto err;
-        
-        ret = BN_GF2m_mod_div(r, yy, xx, field, ctx);
-        bn_check_top(r);
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Compute the bth power of a, reduce modulo p, and store
- * the result in r.  r could be a.
- * Uses simple square-and-multiply algorithm A.5.1 from IEEE P1363.
- */
-int     BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const unsigned int p[], BN_CTX *ctx)
-        {
-        int ret = 0, i, n;
-        BIGNUM *u;
-        bn_check_top(a);
-        bn_check_top(b);
-        if (BN_is_zero(b))
-                return(BN_one(r));
-        if (BN_abs_is_word(b, 1))
-                return (BN_copy(r, a) != NULL);
-        BN_CTX_start(ctx);
-        if ((u = BN_CTX_get(ctx)) == NULL) goto err;
-        
-        if (!BN_GF2m_mod_arr(u, a, p)) goto err;
-        
-        n = BN_num_bits(b) - 1;
-        for (i = n - 1; i >= 0; i--)
-                {
-                if (!BN_GF2m_mod_sqr_arr(u, u, p, ctx)) goto err;
-                if (BN_is_bit_set(b, i))
-                        {
-                        if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx)) goto err;
-                        }
-                }
-        if (!BN_copy(r, u)) goto err;
-        bn_check_top(r);
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Compute the bth power of a, reduce modulo p, and store
- * the result in r.  r could be a.
- *
- * This function calls down to the BN_GF2m_mod_exp_arr implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_exp_arr function.
- */
-int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx)
-        {
-        int ret = 0;
-        const int max = BN_num_bits(p);
-        unsigned int *arr=NULL;
-        bn_check_top(a);
-        bn_check_top(b);
-        bn_check_top(p);
-        if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
-        ret = BN_GF2m_poly2arr(p, arr, max);
-        if (!ret || ret > max)
-                {
-                BNerr(BN_F_BN_GF2M_MOD_EXP,BN_R_INVALID_LENGTH);
-                goto err;
-                }
-        ret = BN_GF2m_mod_exp_arr(r, a, b, arr, ctx);
-        bn_check_top(r);
-err:
-        if (arr) OPENSSL_free(arr);
-        return ret;
-        }
-/* Compute the square root of a, reduce modulo p, and store
- * the result in r.  r could be a.
- * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
- */
-int     BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
-        {
-        int ret = 0;
-        BIGNUM *u;
-        bn_check_top(a);
-        if (!p[0])
-                {
-                /* reduction mod 1 => return 0 */
-                BN_zero(r);
-                return 1;
-                }
-        BN_CTX_start(ctx);
-        if ((u = BN_CTX_get(ctx)) == NULL) goto err;
-        
-        if (!BN_set_bit(u, p[0] - 1)) goto err;
-        ret = BN_GF2m_mod_exp_arr(r, a, u, p, ctx);
-        bn_check_top(r);
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Compute the square root of a, reduce modulo p, and store
- * the result in r.  r could be a.
- *
- * This function calls down to the BN_GF2m_mod_sqrt_arr implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_sqrt_arr function.
- */
-int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
-        {
-        int ret = 0;
-        const int max = BN_num_bits(p);
-        unsigned int *arr=NULL;
-        bn_check_top(a);
-        bn_check_top(p);
-        if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
-        ret = BN_GF2m_poly2arr(p, arr, max);
-        if (!ret || ret > max)
-                {
-                BNerr(BN_F_BN_GF2M_MOD_SQRT,BN_R_INVALID_LENGTH);
-                goto err;
-                }
-        ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
-        bn_check_top(r);
-err:
-        if (arr) OPENSSL_free(arr);
-        return ret;
-        }
-/* Find r such that r^2 + r = a mod p.  r could be a. If no r exists returns 0.
- * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
- */
-int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
-        {
-        int ret = 0, count = 0;
-        unsigned int j;
-        BIGNUM *a, *z, *rho, *w, *w2, *tmp;
-        bn_check_top(a_);
-        if (!p[0])
-                {
-                /* reduction mod 1 => return 0 */
-                BN_zero(r);
-                return 1;
-                }
-        BN_CTX_start(ctx);
-        a = BN_CTX_get(ctx);
-        z = BN_CTX_get(ctx);
-        w = BN_CTX_get(ctx);
-        if (w == NULL) goto err;
-        if (!BN_GF2m_mod_arr(a, a_, p)) goto err;
-        
-        if (BN_is_zero(a))
-                {
-                BN_zero(r);
-                ret = 1;
-                goto err;
-                }
-        if (p[0] & 0x1) /* m is odd */
-                {
-                /* compute half-trace of a */
-                if (!BN_copy(z, a)) goto err;
-                for (j = 1; j <= (p[0] - 1) / 2; j++)
-                        {
-                        if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
-                        if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
-                        if (!BN_GF2m_add(z, z, a)) goto err;
-                        }
-                
-                }
-        else /* m is even */
-                {
-                rho = BN_CTX_get(ctx);
-                w2 = BN_CTX_get(ctx);
-                tmp = BN_CTX_get(ctx);
-                if (tmp == NULL) goto err;
-                do
-                        {
-                        if (!BN_rand(rho, p[0], 0, 0)) goto err;
-                        if (!BN_GF2m_mod_arr(rho, rho, p)) goto err;
-                        BN_zero(z);
-                        if (!BN_copy(w, rho)) goto err;
-                        for (j = 1; j <= p[0] - 1; j++)
-                                {
-                                if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
-                                if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx)) goto err;
-                                if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) goto err;
-                                if (!BN_GF2m_add(z, z, tmp)) goto err;
-                                if (!BN_GF2m_add(w, w2, rho)) goto err;
-                                }
-                        count++;
-                        } while (BN_is_zero(w) && (count < MAX_ITERATIONS));
-                if (BN_is_zero(w))
-                        {
-                        BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR,BN_R_TOO_MANY_ITERATIONS);
-                        goto err;
-                        }
-                }
-        
-        if (!BN_GF2m_mod_sqr_arr(w, z, p, ctx)) goto err;
-        if (!BN_GF2m_add(w, z, w)) goto err;
-        if (BN_GF2m_cmp(w, a))
-                {
-                BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR, BN_R_NO_SOLUTION);
-                goto err;
-                }
-        if (!BN_copy(r, z)) goto err;
-        bn_check_top(r);
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Find r such that r^2 + r = a mod p.  r could be a. If no r exists returns 0.
- *
- * This function calls down to the BN_GF2m_mod_solve_quad_arr implementation; this wrapper
- * function is only provided for convenience; for best performance, use the 
- * BN_GF2m_mod_solve_quad_arr function.
- */
-int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
-        {
-        int ret = 0;
-        const int max = BN_num_bits(p);
-        unsigned int *arr=NULL;
-        bn_check_top(a);
-        bn_check_top(p);
-        if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) *
-                                                max)) == NULL) goto err;
-        ret = BN_GF2m_poly2arr(p, arr, max);
-        if (!ret || ret > max)
-                {
-                BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD,BN_R_INVALID_LENGTH);
-                goto err;
-                }
-        ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx);
-        bn_check_top(r);
-err:
-        if (arr) OPENSSL_free(arr);
-        return ret;
-        }
-/* Convert the bit-string representation of a polynomial
- * ( \sum_{i=0}^n a_i * x^i , where a_0 is *not* zero) into an array
- * of integers corresponding to the bits with non-zero coefficient.
- * Up to max elements of the array will be filled.  Return value is total
- * number of coefficients that would be extracted if array was large enough.
- */
-int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max)
-        {
-        int i, j, k = 0;
-        BN_ULONG mask;
-        if (BN_is_zero(a) || !BN_is_bit_set(a, 0))
-                /* a_0 == 0 => return error (the unsigned int array
-                 * must be terminated by 0)
-                 */
-                return 0;
-        for (i = a->top - 1; i >= 0; i--)
-                {
-                if (!a->d[i])
-                        /* skip word if a->d[i] == 0 */
-                        continue;
-                mask = BN_TBIT;
-                for (j = BN_BITS2 - 1; j >= 0; j--)
-                        {
-                        if (a->d[i] & mask) 
-                                {
-                                if (k < max) p[k] = BN_BITS2 * i + j;
-                                k++;
-                                }
-                        mask >>= 1;
-                        }
-                }
-        return k;
-        }
-/* Convert the coefficient array representation of a polynomial to a 
- * bit-string.  The array must be terminated by 0.
- */
-int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a)
-        {
-        int i;
-        bn_check_top(a);
-        BN_zero(a);
-        for (i = 0; p[i] != 0; i++)
-                {
-                if (BN_set_bit(a, p[i]) == 0)
-                        return 0;
-                }
-        BN_set_bit(a, 0);
-        bn_check_top(a);
-        return 1;
-        }
diff --git a/src/lib/libcrypto/bn/bn_kron.c b/src/lib/libcrypto/bn/bn_kron.c
deleted file mode 100644
index 740359b752..0000000000
--- a/src/lib/libcrypto/bn/bn_kron.c
+++ /dev/null
@@ -1,184 +0,0 @@
-/* crypto/bn/bn_kron.c */
-/* ====================================================================
- * Copyright (c) 1998-2000 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* least significant word */
-#define BN_lsw(n) (((n)->top == 0) ? (BN_ULONG) 0 : (n)->d[0])
-/* Returns -2 for errors because both -1 and 0 are valid results. */
-int BN_kronecker(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
-        {
-        int i;
-        int ret = -2; /* avoid 'uninitialized' warning */
-        int err = 0;
-        BIGNUM *A, *B, *tmp;
-        /* In 'tab', only odd-indexed entries are relevant:
-         * For any odd BIGNUM n,
-         *     tab[BN_lsw(n) & 7]
-         * is $(-1)^{(n^2-1)/8}$ (using TeX notation).
-         * Note that the sign of n does not matter.
-         */
-        static const int tab[8] = {0, 1, 0, -1, 0, -1, 0, 1};
-        bn_check_top(a);
-        bn_check_top(b);
-        BN_CTX_start(ctx);
-        A = BN_CTX_get(ctx);
-        B = BN_CTX_get(ctx);
-        if (B == NULL) goto end;
-        
-        err = !BN_copy(A, a);
-        if (err) goto end;
-        err = !BN_copy(B, b);
-        if (err) goto end;
-        /*
-         * Kronecker symbol, imlemented according to Henri Cohen,
-         * "A Course in Computational Algebraic Number Theory"
-         * (algorithm 1.4.10).
-         */
-        /* Cohen's step 1: */
-        if (BN_is_zero(B))
-                {
-                ret = BN_abs_is_word(A, 1);
-                goto end;
-                }
-        
-        /* Cohen's step 2: */
-        if (!BN_is_odd(A) && !BN_is_odd(B))
-                {
-                ret = 0;
-                goto end;
-                }
-        /* now  B  is non-zero */
-        i = 0;
-        while (!BN_is_bit_set(B, i))
-                i++;
-        err = !BN_rshift(B, B, i);
-        if (err) goto end;
-        if (i & 1)
-                {
-                /* i is odd */
-                /* (thus  B  was even, thus  A  must be odd!)  */
-                /* set 'ret' to $(-1)^{(A^2-1)/8}$ */
-                ret = tab[BN_lsw(A) & 7];
-                }
-        else
-                {
-                /* i is even */
-                ret = 1;
-                }
-        
-        if (B->neg)
-                {
-                B->neg = 0;
-                if (A->neg)
-                        ret = -ret;
-                }
-        /* now  B  is positive and odd, so what remains to be done is
-         * to compute the Jacobi symbol  (A/B)  and multiply it by 'ret' */
-        while (1)
-                {
-                /* Cohen's step 3: */
-                /*  B  is positive and odd */
-                if (BN_is_zero(A))
-                        {
-                        ret = BN_is_one(B) ? ret : 0;
-                        goto end;
-                        }
-                /* now  A  is non-zero */
-                i = 0;
-                while (!BN_is_bit_set(A, i))
-                        i++;
-                err = !BN_rshift(A, A, i);
-                if (err) goto end;
-                if (i & 1)
-                        {
-                        /* i is odd */
-                        /* multiply 'ret' by  $(-1)^{(B^2-1)/8}$ */
-                        ret = ret * tab[BN_lsw(B) & 7];
-                        }
-        
-                /* Cohen's step 4: */
-                /* multiply 'ret' by  $(-1)^{(A-1)(B-1)/4}$ */
-                if ((A->neg ? ~BN_lsw(A) : BN_lsw(A)) & BN_lsw(B) & 2)
-                        ret = -ret;
-                
-                /* (A, B) := (B mod |A|, |A|) */
-                err = !BN_nnmod(B, B, A, ctx);
-                if (err) goto end;
-                tmp = A; A = B; B = tmp;
-                tmp->neg = 0;
-                }
-end:
-        BN_CTX_end(ctx);
-        if (err)
-                return -2;
-        else
-                return ret;
-        }
diff --git a/src/lib/libcrypto/bn/bn_lcl.h b/src/lib/libcrypto/bn/bn_lcl.h
deleted file mode 100644
index 27ac4397a1..0000000000
--- a/src/lib/libcrypto/bn/bn_lcl.h
+++ /dev/null
@@ -1,490 +0,0 @@
-/* crypto/bn/bn_lcl.h */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2000 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#ifndef HEADER_BN_LCL_H
-#define HEADER_BN_LCL_H
-#include <openssl/bn.h>
-#ifdef  __cplusplus
-extern "C" {
-#endif
-/*
- * BN_window_bits_for_exponent_size -- macro for sliding window mod_exp functions
- *
- *
- * For window size 'w' (w >= 2) and a random 'b' bits exponent,
- * the number of multiplications is a constant plus on average
- *
- *    2^(w-1) + (b-w)/(w+1);
- *
- * here  2^(w-1)  is for precomputing the table (we actually need
- * entries only for windows that have the lowest bit set), and
- * (b-w)/(w+1)  is an approximation for the expected number of
- * w-bit windows, not counting the first one.
- *
- * Thus we should use
- *
- *    w >= 6  if        b > 671
- *     w = 5  if  671 > b > 239
- *     w = 4  if  239 > b >  79
- *     w = 3  if   79 > b >  23
- *    w <= 2  if   23 > b
- *
- * (with draws in between).  Very small exponents are often selected
- * with low Hamming weight, so we use  w = 1  for b <= 23.
- */
-#if 1
-#define BN_window_bits_for_exponent_size(b) \
-                ((b) > 671 ? 6 : \
-                 (b) > 239 ? 5 : \
-                 (b) >  79 ? 4 : \
-                 (b) >  23 ? 3 : 1)
-#else
-/* Old SSLeay/OpenSSL table.
- * Maximum window size was 5, so this table differs for b==1024;
- * but it coincides for other interesting values (b==160, b==512).
- */
-#define BN_window_bits_for_exponent_size(b) \
-                ((b) > 255 ? 5 : \
-                 (b) > 127 ? 4 : \
-                 (b) >  17 ? 3 : 1)
-#endif   
-/* BN_mod_exp_mont_conttime is based on the assumption that the
- * L1 data cache line width of the target processor is at least
- * the following value.
- */
-#define MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH      ( 64 )
-#define MOD_EXP_CTIME_MIN_CACHE_LINE_MASK       (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - 1)
-/* Window sizes optimized for fixed window size modular exponentiation
- * algorithm (BN_mod_exp_mont_consttime).
- *
- * To achieve the security goals of BN_mode_exp_mont_consttime, the
- * maximum size of the window must not exceed
- * log_2(MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH). 
- *
- * Window size thresholds are defined for cache line sizes of 32 and 64,
- * cache line sizes where log_2(32)=5 and log_2(64)=6 respectively. A
- * window size of 7 should only be used on processors that have a 128
- * byte or greater cache line size.
- */
-#if MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH == 64
-#  define BN_window_bits_for_ctime_exponent_size(b) \
-                ((b) > 937 ? 6 : \
-                 (b) > 306 ? 5 : \
-                 (b) >  89 ? 4 : \
-                 (b) >  22 ? 3 : 1)
-#  define BN_MAX_WINDOW_BITS_FOR_CTIME_EXPONENT_SIZE    (6)
-#elif MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH == 32
-#  define BN_window_bits_for_ctime_exponent_size(b) \
-                ((b) > 306 ? 5 : \
-                 (b) >  89 ? 4 : \
-                 (b) >  22 ? 3 : 1)
-#  define BN_MAX_WINDOW_BITS_FOR_CTIME_EXPONENT_SIZE    (5)
-#endif
-/* Pentium pro 16,16,16,32,64 */
-/* Alpha       16,16,16,16.64 */
-#define BN_MULL_SIZE_NORMAL                     (16) /* 32 */
-#define BN_MUL_RECURSIVE_SIZE_NORMAL            (16) /* 32 less than */
-#define BN_SQR_RECURSIVE_SIZE_NORMAL            (16) /* 32 */
-#define BN_MUL_LOW_RECURSIVE_SIZE_NORMAL        (32) /* 32 */
-#define BN_MONT_CTX_SET_SIZE_WORD               (64) /* 32 */
-#if !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) && !defined(PEDANTIC)
-/*
- * BN_UMULT_HIGH section.
- *
- * No, I'm not trying to overwhelm you when stating that the
- * product of N-bit numbers is 2*N bits wide:-) No, I don't expect
- * you to be impressed when I say that if the compiler doesn't
- * support 2*N integer type, then you have to replace every N*N
- * multiplication with 4 (N/2)*(N/2) accompanied by some shifts
- * and additions which unavoidably results in severe performance
- * penalties. Of course provided that the hardware is capable of
- * producing 2*N result... That's when you normally start
- * considering assembler implementation. However! It should be
- * pointed out that some CPUs (most notably Alpha, PowerPC and
- * upcoming IA-64 family:-) provide *separate* instruction
- * calculating the upper half of the product placing the result
- * into a general purpose register. Now *if* the compiler supports
- * inline assembler, then it's not impossible to implement the
- * "bignum" routines (and have the compiler optimize 'em)
- * exhibiting "native" performance in C. That's what BN_UMULT_HIGH
- * macro is about:-)
- *
- *                                      <appro@fy.chalmers.se>
- */
-# if defined(__alpha) && (defined(SIXTY_FOUR_BIT_LONG) || defined(SIXTY_FOUR_BIT))
-#  if defined(__DECC)
-#   include <c_asm.h>
-#   define BN_UMULT_HIGH(a,b)   (BN_ULONG)asm("umulh %a0,%a1,%v0",(a),(b))
-#  elif defined(__GNUC__)
-#   define BN_UMULT_HIGH(a,b)   ({      \
-        register BN_ULONG ret;          \
-        asm ("umulh     %1,%2,%0"       \
-             : "=r"(ret)                \
-             : "r"(a), "r"(b));         \
-        ret;                    })
-#  endif        /* compiler */
-# elif defined(_ARCH_PPC) && defined(__64BIT__) && defined(SIXTY_FOUR_BIT_LONG)
-#  if defined(__GNUC__)
-#   define BN_UMULT_HIGH(a,b)   ({      \
-        register BN_ULONG ret;          \
-        asm ("mulhdu    %0,%1,%2"       \
-             : "=r"(ret)                \
-             : "r"(a), "r"(b));         \
-        ret;                    })
-#  endif        /* compiler */
-# elif defined(__x86_64) && defined(SIXTY_FOUR_BIT_LONG)
-#  if defined(__GNUC__)
-#   define BN_UMULT_HIGH(a,b)   ({      \
-        register BN_ULONG ret,discard;  \
-        asm ("mulq      %3"             \
-             : "=a"(discard),"=d"(ret)  \
-             : "a"(a), "g"(b)           \
-             : "cc");                   \
-        ret;                    })
-#   define BN_UMULT_LOHI(low,high,a,b)  \
-        asm ("mulq      %3"             \
-                : "=a"(low),"=d"(high)  \
-                : "a"(a),"g"(b)         \
-                : "cc");
-#  endif
-# elif (defined(_M_AMD64) || defined(_M_X64)) && defined(SIXTY_FOUR_BIT)
-#  if defined(_MSC_VER) && _MSC_VER>=1400
-    unsigned __int64 __umulh    (unsigned __int64 a,unsigned __int64 b);
-    unsigned __int64 _umul128   (unsigned __int64 a,unsigned __int64 b,
-                                 unsigned __int64 *h);
-#   pragma intrinsic(__umulh,_umul128)
-#   define BN_UMULT_HIGH(a,b)           __umulh((a),(b))
-#   define BN_UMULT_LOHI(low,high,a,b)  ((low)=_umul128((a),(b),&(high)))
-#  endif
-# endif         /* cpu */
-#endif          /* OPENSSL_NO_ASM */
-/*************************************************************
- * Using the long long type
- */
-#define Lw(t)    (((BN_ULONG)(t))&BN_MASK2)
-#define Hw(t)    (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
-#ifdef BN_DEBUG_RAND
-#define bn_clear_top2max(a) \
-        { \
-        int      ind = (a)->dmax - (a)->top; \
-        BN_ULONG *ftl = &(a)->d[(a)->top-1]; \
-        for (; ind != 0; ind--) \
-                *(++ftl) = 0x0; \
-        }
-#else
-#define bn_clear_top2max(a)
-#endif
-#ifdef BN_LLONG
-#define mul_add(r,a,w,c) { \
-        BN_ULLONG t; \
-        t=(BN_ULLONG)w * (a) + (r) + (c); \
-        (r)= Lw(t); \
-        (c)= Hw(t); \
-        }
-#define mul(r,a,w,c) { \
-        BN_ULLONG t; \
-        t=(BN_ULLONG)w * (a) + (c); \
-        (r)= Lw(t); \
-        (c)= Hw(t); \
-        }
-#define sqr(r0,r1,a) { \
-        BN_ULLONG t; \
-        t=(BN_ULLONG)(a)*(a); \
-        (r0)=Lw(t); \
-        (r1)=Hw(t); \
-        }
-#elif defined(BN_UMULT_LOHI)
-#define mul_add(r,a,w,c) {              \
-        BN_ULONG high,low,ret,tmp=(a);  \
-        ret =  (r);                     \
-        BN_UMULT_LOHI(low,high,w,tmp);  \
-        ret += (c);                     \
-        (c) =  (ret<(c))?1:0;           \
-        (c) += high;                    \
-        ret += low;                     \
-        (c) += (ret<low)?1:0;           \
-        (r) =  ret;                     \
-        }
-#define mul(r,a,w,c)    {               \
-        BN_ULONG high,low,ret,ta=(a);   \
-        BN_UMULT_LOHI(low,high,w,ta);   \
-        ret =  low + (c);               \
-        (c) =  high;                    \
-        (c) += (ret<low)?1:0;           \
-        (r) =  ret;                     \
-        }
-#define sqr(r0,r1,a)    {               \
-        BN_ULONG tmp=(a);               \
-        BN_UMULT_LOHI(r0,r1,tmp,tmp);   \
-        }
-#elif defined(BN_UMULT_HIGH)
-#define mul_add(r,a,w,c) {              \
-        BN_ULONG high,low,ret,tmp=(a);  \
-        ret =  (r);                     \
-        high=  BN_UMULT_HIGH(w,tmp);    \
-        ret += (c);                     \
-        low =  (w) * tmp;               \
-        (c) =  (ret<(c))?1:0;           \
-        (c) += high;                    \
-        ret += low;                     \
-        (c) += (ret<low)?1:0;           \
-        (r) =  ret;                     \
-        }
-#define mul(r,a,w,c)    {               \
-        BN_ULONG high,low,ret,ta=(a);   \
-        low =  (w) * ta;                \
-        high=  BN_UMULT_HIGH(w,ta);     \
-        ret =  low + (c);               \
-        (c) =  high;                    \
-        (c) += (ret<low)?1:0;           \
-        (r) =  ret;                     \
-        }
-#define sqr(r0,r1,a)    {               \
-        BN_ULONG tmp=(a);               \
-        (r0) = tmp * tmp;               \
-        (r1) = BN_UMULT_HIGH(tmp,tmp);  \
-        }
-#else
-/*************************************************************
- * No long long type
- */
-#define LBITS(a)        ((a)&BN_MASK2l)
-#define HBITS(a)        (((a)>>BN_BITS4)&BN_MASK2l)
-#define L2HBITS(a)      (((a)<<BN_BITS4)&BN_MASK2)
-#define LLBITS(a)       ((a)&BN_MASKl)
-#define LHBITS(a)       (((a)>>BN_BITS2)&BN_MASKl)
-#define LL2HBITS(a)     ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2)
-#define mul64(l,h,bl,bh) \
-        { \
-        BN_ULONG m,m1,lt,ht; \
- \
-        lt=l; \
-        ht=h; \
-        m =(bh)*(lt); \
-        lt=(bl)*(lt); \
-        m1=(bl)*(ht); \
-        ht =(bh)*(ht); \
-        m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS((BN_ULONG)1); \
-        ht+=HBITS(m); \
-        m1=L2HBITS(m); \
-        lt=(lt+m1)&BN_MASK2; if (lt < m1) ht++; \
-        (l)=lt; \
-        (h)=ht; \
-        }
-#define sqr64(lo,ho,in) \
-        { \
-        BN_ULONG l,h,m; \
- \
-        h=(in); \
-        l=LBITS(h); \
-        h=HBITS(h); \
-        m =(l)*(h); \
-        l*=l; \
-        h*=h; \
-        h+=(m&BN_MASK2h1)>>(BN_BITS4-1); \
-        m =(m&BN_MASK2l)<<(BN_BITS4+1); \
-        l=(l+m)&BN_MASK2; if (l < m) h++; \
-        (lo)=l; \
-        (ho)=h; \
-        }
-#define mul_add(r,a,bl,bh,c) { \
-        BN_ULONG l,h; \
- \
-        h= (a); \
-        l=LBITS(h); \
-        h=HBITS(h); \
-        mul64(l,h,(bl),(bh)); \
- \
-        /* non-multiply part */ \
-        l=(l+(c))&BN_MASK2; if (l < (c)) h++; \
-        (c)=(r); \
-        l=(l+(c))&BN_MASK2; if (l < (c)) h++; \
-        (c)=h&BN_MASK2; \
-        (r)=l; \
-        }
-#define mul(r,a,bl,bh,c) { \
-        BN_ULONG l,h; \
- \
-        h= (a); \
-        l=LBITS(h); \
-        h=HBITS(h); \
-        mul64(l,h,(bl),(bh)); \
- \
-        /* non-multiply part */ \
-        l+=(c); if ((l&BN_MASK2) < (c)) h++; \
-        (c)=h&BN_MASK2; \
-        (r)=l&BN_MASK2; \
-        }
-#endif /* !BN_LLONG */
-void bn_mul_normal(BN_ULONG *r,BN_ULONG *a,int na,BN_ULONG *b,int nb);
-void bn_mul_comba8(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
-void bn_mul_comba4(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b);
-void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp);
-void bn_sqr_comba8(BN_ULONG *r,const BN_ULONG *a);
-void bn_sqr_comba4(BN_ULONG *r,const BN_ULONG *a);
-int bn_cmp_words(const BN_ULONG *a,const BN_ULONG *b,int n);
-int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
-        int cl, int dl);
-void bn_mul_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,
-        int dna,int dnb,BN_ULONG *t);
-void bn_mul_part_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,
-        int n,int tna,int tnb,BN_ULONG *t);
-void bn_sqr_recursive(BN_ULONG *r,const BN_ULONG *a, int n2, BN_ULONG *t);
-void bn_mul_low_normal(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b, int n);
-void bn_mul_low_recursive(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,int n2,
-        BN_ULONG *t);
-void bn_mul_high(BN_ULONG *r,BN_ULONG *a,BN_ULONG *b,BN_ULONG *l,int n2,
-        BN_ULONG *t);
-BN_ULONG bn_add_part_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,
-        int cl, int dl);
-BN_ULONG bn_sub_part_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b,
-        int cl, int dl);
-int bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, const BN_ULONG *np,const BN_ULONG *n0, int num);
-#ifdef  __cplusplus
-}
-#endif
-#endif
diff --git a/src/lib/libcrypto/bn/bn_lib.c b/src/lib/libcrypto/bn/bn_lib.c
deleted file mode 100644
index 32a8fbaf51..0000000000
--- a/src/lib/libcrypto/bn/bn_lib.c
+++ /dev/null
@@ -1,826 +0,0 @@
-/* crypto/bn/bn_lib.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#ifndef BN_DEBUG
-# undef NDEBUG /* avoid conflicting definitions */
-# define NDEBUG
-#endif
-#include <assert.h>
-#include <limits.h>
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-const char BN_version[]="Big Number" OPENSSL_VERSION_PTEXT;
-/* This stuff appears to be completely unused, so is deprecated */
-#ifndef OPENSSL_NO_DEPRECATED
-/* For a 32 bit machine
- * 2 -   4 ==  128
- * 3 -   8 ==  256
- * 4 -  16 ==  512
- * 5 -  32 == 1024
- * 6 -  64 == 2048
- * 7 - 128 == 4096
- * 8 - 256 == 8192
- */
-static int bn_limit_bits=0;
-static int bn_limit_num=8;        /* (1<<bn_limit_bits) */
-static int bn_limit_bits_low=0;
-static int bn_limit_num_low=8;    /* (1<<bn_limit_bits_low) */
-static int bn_limit_bits_high=0;
-static int bn_limit_num_high=8;   /* (1<<bn_limit_bits_high) */
-static int bn_limit_bits_mont=0;
-static int bn_limit_num_mont=8;   /* (1<<bn_limit_bits_mont) */
-void BN_set_params(int mult, int high, int low, int mont)
-        {
-        if (mult >= 0)
-                {
-                if (mult > (int)(sizeof(int)*8)-1)
-                        mult=sizeof(int)*8-1;
-                bn_limit_bits=mult;
-                bn_limit_num=1<<mult;
-                }
-        if (high >= 0)
-                {
-                if (high > (int)(sizeof(int)*8)-1)
-                        high=sizeof(int)*8-1;
-                bn_limit_bits_high=high;
-                bn_limit_num_high=1<<high;
-                }
-        if (low >= 0)
-                {
-                if (low > (int)(sizeof(int)*8)-1)
-                        low=sizeof(int)*8-1;
-                bn_limit_bits_low=low;
-                bn_limit_num_low=1<<low;
-                }
-        if (mont >= 0)
-                {
-                if (mont > (int)(sizeof(int)*8)-1)
-                        mont=sizeof(int)*8-1;
-                bn_limit_bits_mont=mont;
-                bn_limit_num_mont=1<<mont;
-                }
-        }
-int BN_get_params(int which)
-        {
-        if      (which == 0) return(bn_limit_bits);
-        else if (which == 1) return(bn_limit_bits_high);
-        else if (which == 2) return(bn_limit_bits_low);
-        else if (which == 3) return(bn_limit_bits_mont);
-        else return(0);
-        }
-#endif
-const BIGNUM *BN_value_one(void)
-        {
-        static BN_ULONG data_one=1L;
-        static BIGNUM const_one={&data_one,1,1,0,BN_FLG_STATIC_DATA};
-        return(&const_one);
-        }
-int BN_num_bits_word(BN_ULONG l)
-        {
-        static const char bits[256]={
-                0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,
-                5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
-                6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
-                6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
-                7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-                7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-                7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-                7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
-                };
-#if defined(SIXTY_FOUR_BIT_LONG)
-        if (l & 0xffffffff00000000L)
-                {
-                if (l & 0xffff000000000000L)
-                        {
-                        if (l & 0xff00000000000000L)
-                                {
-                                return(bits[(int)(l>>56)]+56);
-                                }
-                        else    return(bits[(int)(l>>48)]+48);
-                        }
-                else
-                        {
-                        if (l & 0x0000ff0000000000L)
-                                {
-                                return(bits[(int)(l>>40)]+40);
-                                }
-                        else    return(bits[(int)(l>>32)]+32);
-                        }
-                }
-        else
-#else
-#ifdef SIXTY_FOUR_BIT
-        if (l & 0xffffffff00000000LL)
-                {
-                if (l & 0xffff000000000000LL)
-                        {
-                        if (l & 0xff00000000000000LL)
-                                {
-                                return(bits[(int)(l>>56)]+56);
-                                }
-                        else    return(bits[(int)(l>>48)]+48);
-                        }
-                else
-                        {
-                        if (l & 0x0000ff0000000000LL)
-                                {
-                                return(bits[(int)(l>>40)]+40);
-                                }
-                        else    return(bits[(int)(l>>32)]+32);
-                        }
-                }
-        else
-#endif
-#endif
-                {
-#if defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
-                if (l & 0xffff0000L)
-                        {
-                        if (l & 0xff000000L)
-                                return(bits[(int)(l>>24L)]+24);
-                        else    return(bits[(int)(l>>16L)]+16);
-                        }
-                else
-#endif
-                        {
-#if defined(SIXTEEN_BIT) || defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
-                        if (l & 0xff00L)
-                                return(bits[(int)(l>>8)]+8);
-                        else    
-#endif
-                                return(bits[(int)(l   )]  );
-                        }
-                }
-        }
-int BN_num_bits(const BIGNUM *a)
-        {
-        int i = a->top - 1;
-        bn_check_top(a);
-        if (BN_is_zero(a)) return 0;
-        return ((i*BN_BITS2) + BN_num_bits_word(a->d[i]));
-        }
-void BN_clear_free(BIGNUM *a)
-        {
-        int i;
-        if (a == NULL) return;
-        bn_check_top(a);
-        if (a->d != NULL)
-                {
-                OPENSSL_cleanse(a->d,a->dmax*sizeof(a->d[0]));
-                if (!(BN_get_flags(a,BN_FLG_STATIC_DATA)))
-                        OPENSSL_free(a->d);
-                }
-        i=BN_get_flags(a,BN_FLG_MALLOCED);
-        OPENSSL_cleanse(a,sizeof(BIGNUM));
-        if (i)
-                OPENSSL_free(a);
-        }
-void BN_free(BIGNUM *a)
-        {
-        if (a == NULL) return;
-        bn_check_top(a);
-        if ((a->d != NULL) && !(BN_get_flags(a,BN_FLG_STATIC_DATA)))
-                OPENSSL_free(a->d);
-        if (a->flags & BN_FLG_MALLOCED)
-                OPENSSL_free(a);
-        else
-                {
-#ifndef OPENSSL_NO_DEPRECATED
-                a->flags|=BN_FLG_FREE;
-#endif
-                a->d = NULL;
-                }
-        }
-void BN_init(BIGNUM *a)
-        {
-        memset(a,0,sizeof(BIGNUM));
-        bn_check_top(a);
-        }
-BIGNUM *BN_new(void)
-        {
-        BIGNUM *ret;
-        if ((ret=(BIGNUM *)OPENSSL_malloc(sizeof(BIGNUM))) == NULL)
-                {
-                BNerr(BN_F_BN_NEW,ERR_R_MALLOC_FAILURE);
-                return(NULL);
-                }
-        ret->flags=BN_FLG_MALLOCED;
-        ret->top=0;
-        ret->neg=0;
-        ret->dmax=0;
-        ret->d=NULL;
-        bn_check_top(ret);
-        return(ret);
-        }
-/* This is used both by bn_expand2() and bn_dup_expand() */
-/* The caller MUST check that words > b->dmax before calling this */
-static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
-        {
-        BN_ULONG *A,*a = NULL;
-        const BN_ULONG *B;
-        int i;
-        bn_check_top(b);
-        if (words > (INT_MAX/(4*BN_BITS2)))
-                {
-                BNerr(BN_F_BN_EXPAND_INTERNAL,BN_R_BIGNUM_TOO_LONG);
-                return NULL;
-                }
-        if (BN_get_flags(b,BN_FLG_STATIC_DATA))
-                {
-                BNerr(BN_F_BN_EXPAND_INTERNAL,BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
-                return(NULL);
-                }
-        a=A=(BN_ULONG *)OPENSSL_malloc(sizeof(BN_ULONG)*words);
-        if (A == NULL)
-                {
-                BNerr(BN_F_BN_EXPAND_INTERNAL,ERR_R_MALLOC_FAILURE);
-                return(NULL);
-                }
-#if 1
-        B=b->d;
-        /* Check if the previous number needs to be copied */
-        if (B != NULL)
-                {
-                for (i=b->top>>2; i>0; i--,A+=4,B+=4)
-                        {
-                        /*
-                         * The fact that the loop is unrolled
-                         * 4-wise is a tribute to Intel. It's
-                         * the one that doesn't have enough
-                         * registers to accomodate more data.
-                         * I'd unroll it 8-wise otherwise:-)
-                         *
-                         *              <appro@fy.chalmers.se>
-                         */
-                        BN_ULONG a0,a1,a2,a3;
-                        a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
-                        A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
-                        }
-                switch (b->top&3)
-                        {
-                case 3: A[2]=B[2];
-                case 2: A[1]=B[1];
-                case 1: A[0]=B[0];
-                case 0: /* workaround for ultrix cc: without 'case 0', the optimizer does
-                         * the switch table by doing a=top&3; a--; goto jump_table[a];
-                         * which fails for top== 0 */
-                        ;
-                        }
-                }
-#else
-        memset(A,0,sizeof(BN_ULONG)*words);
-        memcpy(A,b->d,sizeof(b->d[0])*b->top);
-#endif
-                
-        return(a);
-        }
-/* This is an internal function that can be used instead of bn_expand2()
- * when there is a need to copy BIGNUMs instead of only expanding the
- * data part, while still expanding them.
- * Especially useful when needing to expand BIGNUMs that are declared
- * 'const' and should therefore not be changed.
- * The reason to use this instead of a BN_dup() followed by a bn_expand2()
- * is memory allocation overhead.  A BN_dup() followed by a bn_expand2()
- * will allocate new memory for the BIGNUM data twice, and free it once,
- * while bn_dup_expand() makes sure allocation is made only once.
- */
-#ifndef OPENSSL_NO_DEPRECATED
-BIGNUM *bn_dup_expand(const BIGNUM *b, int words)
-        {
-        BIGNUM *r = NULL;
-        bn_check_top(b);
-        /* This function does not work if
-         *      words <= b->dmax && top < words
-         * because BN_dup() does not preserve 'dmax'!
-         * (But bn_dup_expand() is not used anywhere yet.)
-         */
-        if (words > b->dmax)
-                {
-                BN_ULONG *a = bn_expand_internal(b, words);
-                if (a)
-                        {
-                        r = BN_new();
-                        if (r)
-                                {
-                                r->top = b->top;
-                                r->dmax = words;
-                                r->neg = b->neg;
-                                r->d = a;
-                                }
-                        else
-                                {
-                                /* r == NULL, BN_new failure */
-                                OPENSSL_free(a);
-                                }
-                        }
-                /* If a == NULL, there was an error in allocation in
-                   bn_expand_internal(), and NULL should be returned */
-                }
-        else
-                {
-                r = BN_dup(b);
-                }
-        bn_check_top(r);
-        return r;
-        }
-#endif
-/* This is an internal function that should not be used in applications.
- * It ensures that 'b' has enough room for a 'words' word number
- * and initialises any unused part of b->d with leading zeros.
- * It is mostly used by the various BIGNUM routines. If there is an error,
- * NULL is returned. If not, 'b' is returned. */
-BIGNUM *bn_expand2(BIGNUM *b, int words)
-        {
-        bn_check_top(b);
-        if (words > b->dmax)
-                {
-                BN_ULONG *a = bn_expand_internal(b, words);
-                if(!a) return NULL;
-                if(b->d) OPENSSL_free(b->d);
-                b->d=a;
-                b->dmax=words;
-                }
-/* None of this should be necessary because of what b->top means! */
-#if 0
-        /* NB: bn_wexpand() calls this only if the BIGNUM really has to grow */
-        if (b->top < b->dmax)
-                {
-                int i;
-                BN_ULONG *A = &(b->d[b->top]);
-                for (i=(b->dmax - b->top)>>3; i>0; i--,A+=8)
-                        {
-                        A[0]=0; A[1]=0; A[2]=0; A[3]=0;
-                        A[4]=0; A[5]=0; A[6]=0; A[7]=0;
-                        }
-                for (i=(b->dmax - b->top)&7; i>0; i--,A++)
-                        A[0]=0;
-                assert(A == &(b->d[b->dmax]));
-                }
-#endif
-        bn_check_top(b);
-        return b;
-        }
-BIGNUM *BN_dup(const BIGNUM *a)
-        {
-        BIGNUM *t;
-        if (a == NULL) return NULL;
-        bn_check_top(a);
-        t = BN_new();
-        if (t == NULL) return NULL;
-        if(!BN_copy(t, a))
-                {
-                BN_free(t);
-                return NULL;
-                }
-        bn_check_top(t);
-        return t;
-        }
-BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
-        {
-        int i;
-        BN_ULONG *A;
-        const BN_ULONG *B;
-        bn_check_top(b);
-        if (a == b) return(a);
-        if (bn_wexpand(a,b->top) == NULL) return(NULL);
-#if 1
-        A=a->d;
-        B=b->d;
-        for (i=b->top>>2; i>0; i--,A+=4,B+=4)
-                {
-                BN_ULONG a0,a1,a2,a3;
-                a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
-                A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
-                }
-        switch (b->top&3)
-                {
-                case 3: A[2]=B[2];
-                case 2: A[1]=B[1];
-                case 1: A[0]=B[0];
-                case 0: ; /* ultrix cc workaround, see comments in bn_expand_internal */
-                }
-#else
-        memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
-#endif
-        a->top=b->top;
-        a->neg=b->neg;
-        bn_check_top(a);
-        return(a);
-        }
-void BN_swap(BIGNUM *a, BIGNUM *b)
-        {
-        int flags_old_a, flags_old_b;
-        BN_ULONG *tmp_d;
-        int tmp_top, tmp_dmax, tmp_neg;
-        
-        bn_check_top(a);
-        bn_check_top(b);
-        flags_old_a = a->flags;
-        flags_old_b = b->flags;
-        tmp_d = a->d;
-        tmp_top = a->top;
-        tmp_dmax = a->dmax;
-        tmp_neg = a->neg;
-        
-        a->d = b->d;
-        a->top = b->top;
-        a->dmax = b->dmax;
-        a->neg = b->neg;
-        
-        b->d = tmp_d;
-        b->top = tmp_top;
-        b->dmax = tmp_dmax;
-        b->neg = tmp_neg;
-        
-        a->flags = (flags_old_a & BN_FLG_MALLOCED) | (flags_old_b & BN_FLG_STATIC_DATA);
-        b->flags = (flags_old_b & BN_FLG_MALLOCED) | (flags_old_a & BN_FLG_STATIC_DATA);
-        bn_check_top(a);
-        bn_check_top(b);
-        }
-void BN_clear(BIGNUM *a)
-        {
-        bn_check_top(a);
-        if (a->d != NULL)
-                memset(a->d,0,a->dmax*sizeof(a->d[0]));
-        a->top=0;
-        a->neg=0;
-        }
-BN_ULONG BN_get_word(const BIGNUM *a)
-        {
-        if (a->top > 1)
-                return BN_MASK2;
-        else if (a->top == 1)
-                return a->d[0];
-        /* a->top == 0 */
-        return 0;
-        }
-int BN_set_word(BIGNUM *a, BN_ULONG w)
-        {
-        bn_check_top(a);
-        if (bn_expand(a,(int)sizeof(BN_ULONG)*8) == NULL) return(0);
-        a->neg = 0;
-        a->d[0] = w;
-        a->top = (w ? 1 : 0);
-        bn_check_top(a);
-        return(1);
-        }
-BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
-        {
-        unsigned int i,m;
-        unsigned int n;
-        BN_ULONG l;
-        BIGNUM  *bn = NULL;
-        if (ret == NULL)
-                ret = bn = BN_new();
-        if (ret == NULL) return(NULL);
-        bn_check_top(ret);
-        l=0;
-        n=len;
-        if (n == 0)
-                {
-                ret->top=0;
-                return(ret);
-                }
-        i=((n-1)/BN_BYTES)+1;
-        m=((n-1)%(BN_BYTES));
-        if (bn_wexpand(ret, (int)i) == NULL)
-                {
-                if (bn) BN_free(bn);
-                return NULL;
-                }
-        ret->top=i;
-        ret->neg=0;
-        while (n--)
-                {
-                l=(l<<8L)| *(s++);
-                if (m-- == 0)
-                        {
-                        ret->d[--i]=l;
-                        l=0;
-                        m=BN_BYTES-1;
-                        }
-                }
-        /* need to call this due to clear byte at top if avoiding
-         * having the top bit set (-ve number) */
-        bn_correct_top(ret);
-        return(ret);
-        }
-/* ignore negative */
-int BN_bn2bin(const BIGNUM *a, unsigned char *to)
-        {
-        int n,i;
-        BN_ULONG l;
-        bn_check_top(a);
-        n=i=BN_num_bytes(a);
-        while (i--)
-                {
-                l=a->d[i/BN_BYTES];
-                *(to++)=(unsigned char)(l>>(8*(i%BN_BYTES)))&0xff;
-                }
-        return(n);
-        }
-int BN_ucmp(const BIGNUM *a, const BIGNUM *b)
-        {
-        int i;
-        BN_ULONG t1,t2,*ap,*bp;
-        bn_check_top(a);
-        bn_check_top(b);
-        i=a->top-b->top;
-        if (i != 0) return(i);
-        ap=a->d;
-        bp=b->d;
-        for (i=a->top-1; i>=0; i--)
-                {
-                t1= ap[i];
-                t2= bp[i];
-                if (t1 != t2)
-                        return((t1 > t2) ? 1 : -1);
-                }
-        return(0);
-        }
-int BN_cmp(const BIGNUM *a, const BIGNUM *b)
-        {
-        int i;
-        int gt,lt;
-        BN_ULONG t1,t2;
-        if ((a == NULL) || (b == NULL))
-                {
-                if (a != NULL)
-                        return(-1);
-                else if (b != NULL)
-                        return(1);
-                else
-                        return(0);
-                }
-        bn_check_top(a);
-        bn_check_top(b);
-        if (a->neg != b->neg)
-                {
-                if (a->neg)
-                        return(-1);
-                else    return(1);
-                }
-        if (a->neg == 0)
-                { gt=1; lt= -1; }
-        else    { gt= -1; lt=1; }
-        if (a->top > b->top) return(gt);
-        if (a->top < b->top) return(lt);
-        for (i=a->top-1; i>=0; i--)
-                {
-                t1=a->d[i];
-                t2=b->d[i];
-                if (t1 > t2) return(gt);
-                if (t1 < t2) return(lt);
-                }
-        return(0);
-        }
-int BN_set_bit(BIGNUM *a, int n)
-        {
-        int i,j,k;
-        if (n < 0)
-                return 0;
-        i=n/BN_BITS2;
-        j=n%BN_BITS2;
-        if (a->top <= i)
-                {
-                if (bn_wexpand(a,i+1) == NULL) return(0);
-                for(k=a->top; k<i+1; k++)
-                        a->d[k]=0;
-                a->top=i+1;
-                }
-        a->d[i]|=(((BN_ULONG)1)<<j);
-        bn_check_top(a);
-        return(1);
-        }
-int BN_clear_bit(BIGNUM *a, int n)
-        {
-        int i,j;
-        bn_check_top(a);
-        if (n < 0) return 0;
-        i=n/BN_BITS2;
-        j=n%BN_BITS2;
-        if (a->top <= i) return(0);
-        a->d[i]&=(~(((BN_ULONG)1)<<j));
-        bn_correct_top(a);
-        return(1);
-        }
-int BN_is_bit_set(const BIGNUM *a, int n)
-        {
-        int i,j;
-        bn_check_top(a);
-        if (n < 0) return 0;
-        i=n/BN_BITS2;
-        j=n%BN_BITS2;
-        if (a->top <= i) return 0;
-        return(((a->d[i])>>j)&((BN_ULONG)1));
-        }
-int BN_mask_bits(BIGNUM *a, int n)
-        {
-        int b,w;
-        bn_check_top(a);
-        if (n < 0) return 0;
-        w=n/BN_BITS2;
-        b=n%BN_BITS2;
-        if (w >= a->top) return 0;
-        if (b == 0)
-                a->top=w;
-        else
-                {
-                a->top=w+1;
-                a->d[w]&= ~(BN_MASK2<<b);
-                }
-        bn_correct_top(a);
-        return(1);
-        }
-void BN_set_negative(BIGNUM *a, int b)
-        {
-        if (b && !BN_is_zero(a))
-                a->neg = 1;
-        else
-                a->neg = 0;
-        }
-int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
-        {
-        int i;
-        BN_ULONG aa,bb;
-        aa=a[n-1];
-        bb=b[n-1];
-        if (aa != bb) return((aa > bb)?1:-1);
-        for (i=n-2; i>=0; i--)
-                {
-                aa=a[i];
-                bb=b[i];
-                if (aa != bb) return((aa > bb)?1:-1);
-                }
-        return(0);
-        }
-/* Here follows a specialised variants of bn_cmp_words().  It has the
-   property of performing the operation on arrays of different sizes.
-   The sizes of those arrays is expressed through cl, which is the
-   common length ( basicall, min(len(a),len(b)) ), and dl, which is the
-   delta between the two lengths, calculated as len(a)-len(b).
-   All lengths are the number of BN_ULONGs...  */
-int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
-        int cl, int dl)
-        {
-        int n,i;
-        n = cl-1;
-        if (dl < 0)
-                {
-                for (i=dl; i<0; i++)
-                        {
-                        if (b[n-i] != 0)
-                                return -1; /* a < b */
-                        }
-                }
-        if (dl > 0)
-                {
-                for (i=dl; i>0; i--)
-                        {
-                        if (a[n+i] != 0)
-                                return 1; /* a > b */
-                        }
-                }
-        return bn_cmp_words(a,b,cl);
-        }
diff --git a/src/lib/libcrypto/bn/bn_mod.c b/src/lib/libcrypto/bn/bn_mod.c
deleted file mode 100644
index 77d6ddb91a..0000000000
--- a/src/lib/libcrypto/bn/bn_mod.c
+++ /dev/null
@@ -1,301 +0,0 @@
-/* crypto/bn/bn_mod.c */
-/* Includes code written by Lenka Fibikova <fibikova@exp-math.uni-essen.de>
- * for the OpenSSL project. */
-/* ====================================================================
- * Copyright (c) 1998-2000 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#if 0 /* now just a #define */
-int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
-        {
-        return(BN_div(NULL,rem,m,d,ctx));
-        /* note that  rem->neg == m->neg  (unless the remainder is zero) */
-        }
-#endif
-int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
-        {
-        /* like BN_mod, but returns non-negative remainder
-         * (i.e.,  0 <= r < |d|  always holds) */
-        if (!(BN_mod(r,m,d,ctx)))
-                return 0;
-        if (!r->neg)
-                return 1;
-        /* now   -|d| < r < 0,  so we have to set  r := r + |d| */
-        return (d->neg ? BN_sub : BN_add)(r, r, d);
-}
-int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx)
-        {
-        if (!BN_add(r, a, b)) return 0;
-        return BN_nnmod(r, r, m, ctx);
-        }
-/* BN_mod_add variant that may be used if both  a  and  b  are non-negative
- * and less than  m */
-int BN_mod_add_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m)
-        {
-        if (!BN_uadd(r, a, b)) return 0;
-        if (BN_ucmp(r, m) >= 0)
-                return BN_usub(r, r, m);
-        return 1;
-        }
-int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m, BN_CTX *ctx)
-        {
-        if (!BN_sub(r, a, b)) return 0;
-        return BN_nnmod(r, r, m, ctx);
-        }
-/* BN_mod_sub variant that may be used if both  a  and  b  are non-negative
- * and less than  m */
-int BN_mod_sub_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m)
-        {
-        if (!BN_sub(r, a, b)) return 0;
-        if (r->neg)
-                return BN_add(r, r, m);
-        return 1;
-        }
-/* slow but works */
-int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
-        BN_CTX *ctx)
-        {
-        BIGNUM *t;
-        int ret=0;
-        bn_check_top(a);
-        bn_check_top(b);
-        bn_check_top(m);
-        BN_CTX_start(ctx);
-        if ((t = BN_CTX_get(ctx)) == NULL) goto err;
-        if (a == b)
-                { if (!BN_sqr(t,a,ctx)) goto err; }
-        else
-                { if (!BN_mul(t,a,b,ctx)) goto err; }
-        if (!BN_nnmod(r,t,m,ctx)) goto err;
-        bn_check_top(r);
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        return(ret);
-        }
-int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
-        {
-        if (!BN_sqr(r, a, ctx)) return 0;
-        /* r->neg == 0,  thus we don't need BN_nnmod */
-        return BN_mod(r, r, m, ctx);
-        }
-int BN_mod_lshift1(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx)
-        {
-        if (!BN_lshift1(r, a)) return 0;
-        bn_check_top(r);
-        return BN_nnmod(r, r, m, ctx);
-        }
-/* BN_mod_lshift1 variant that may be used if  a  is non-negative
- * and less than  m */
-int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
-        {
-        if (!BN_lshift1(r, a)) return 0;
-        bn_check_top(r);
-        if (BN_cmp(r, m) >= 0)
-                return BN_sub(r, r, m);
-        return 1;
-        }
-int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx)
-        {
-        BIGNUM *abs_m = NULL;
-        int ret;
-        if (!BN_nnmod(r, a, m, ctx)) return 0;
-        if (m->neg)
-                {
-                abs_m = BN_dup(m);
-                if (abs_m == NULL) return 0;
-                abs_m->neg = 0;
-                }
-        
-        ret = BN_mod_lshift_quick(r, r, n, (abs_m ? abs_m : m));
-        bn_check_top(r);
-        if (abs_m)
-                BN_free(abs_m);
-        return ret;
-        }
-/* BN_mod_lshift variant that may be used if  a  is non-negative
- * and less than  m */
-int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m)
-        {
-        if (r != a)
-                {
-                if (BN_copy(r, a) == NULL) return 0;
-                }
-        while (n > 0)
-                {
-                int max_shift;
-                
-                /* 0 < r < m */
-                max_shift = BN_num_bits(m) - BN_num_bits(r);
-                /* max_shift >= 0 */
-                if (max_shift < 0)
-                        {
-                        BNerr(BN_F_BN_MOD_LSHIFT_QUICK, BN_R_INPUT_NOT_REDUCED);
-                        return 0;
-                        }
-                if (max_shift > n)
-                        max_shift = n;
-                if (max_shift)
-                        {
-                        if (!BN_lshift(r, r, max_shift)) return 0;
-                        n -= max_shift;
-                        }
-                else
-                        {
-                        if (!BN_lshift1(r, r)) return 0;
-                        --n;
-                        }
-                /* BN_num_bits(r) <= BN_num_bits(m) */
-                if (BN_cmp(r, m) >= 0) 
-                        {
-                        if (!BN_sub(r, r, m)) return 0;
-                        }
-                }
-        bn_check_top(r);
-        
-        return 1;
-        }
diff --git a/src/lib/libcrypto/bn/bn_mont.c b/src/lib/libcrypto/bn/bn_mont.c
deleted file mode 100644
index 4799b152dd..0000000000
--- a/src/lib/libcrypto/bn/bn_mont.c
+++ /dev/null
@@ -1,732 +0,0 @@
-/* crypto/bn/bn_mont.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2006 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-/*
- * Details about Montgomery multiplication algorithms can be found at
- * http://security.ece.orst.edu/publications.html, e.g.
- * http://security.ece.orst.edu/koc/papers/j37acmon.pdf and
- * sections 3.8 and 4.2 in http://security.ece.orst.edu/koc/papers/r01rsasw.pdf
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#define MONT_WORD /* use the faster word-based algorithm */
-#if defined(MONT_WORD) && defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)
-/* This condition means we have a specific non-default build:
- * In the 0.9.8 branch, OPENSSL_BN_ASM_MONT is normally not set for any
- * BN_BITS2<=32 platform; an explicit "enable-montasm" is required.
- * I.e., if we are here, the user intentionally deviates from the
- * normal stable build to get better Montgomery performance from
- * the 0.9.9-dev backport.
- *
- * In this case only, we also enable BN_from_montgomery_word()
- * (another non-stable feature from 0.9.9-dev).
- */
-#define MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD
-#endif
-#ifdef MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD
-static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont);
-#endif
-int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
-                          BN_MONT_CTX *mont, BN_CTX *ctx)
-        {
-        BIGNUM *tmp;
-        int ret=0;
-#if defined(OPENSSL_BN_ASM_MONT) && defined(MONT_WORD)
-        int num = mont->N.top;
-        if (num>1 && a->top==num && b->top==num)
-                {
-                if (bn_wexpand(r,num) == NULL) return(0);
-#if 0 /* for OpenSSL 0.9.9 mont->n0 */
-                if (bn_mul_mont(r->d,a->d,b->d,mont->N.d,mont->n0,num))
-#else
-                if (bn_mul_mont(r->d,a->d,b->d,mont->N.d,&mont->n0,num))
-#endif
-                        {
-                        r->neg = a->neg^b->neg;
-                        r->top = num;
-                        bn_correct_top(r);
-                        return(1);
-                        }
-                }
-#endif
-        BN_CTX_start(ctx);
-        tmp = BN_CTX_get(ctx);
-        if (tmp == NULL) goto err;
-        bn_check_top(tmp);
-        if (a == b)
-                {
-                if (!BN_sqr(tmp,a,ctx)) goto err;
-                }
-        else
-                {
-                if (!BN_mul(tmp,a,b,ctx)) goto err;
-                }
-        /* reduce from aRR to aR */
-#ifdef MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD
-        if (!BN_from_montgomery_word(r,tmp,mont)) goto err;
-#else
-        if (!BN_from_montgomery(r,tmp,mont,ctx)) goto err;
-#endif
-        bn_check_top(r);
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        return(ret);
-        }
-#ifdef MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD
-static int BN_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
-        {
-        BIGNUM *n;
-        BN_ULONG *ap,*np,*rp,n0,v,*nrp;
-        int al,nl,max,i,x,ri;
-        n= &(mont->N);
-        /* mont->ri is the size of mont->N in bits (rounded up
-           to the word size) */
-        al=ri=mont->ri/BN_BITS2;
-        nl=n->top;
-        if ((al == 0) || (nl == 0)) { ret->top=0; return(1); }
-        max=(nl+al+1); /* allow for overflow (no?) XXX */
-        if (bn_wexpand(r,max) == NULL) return(0);
-        r->neg^=n->neg;
-        np=n->d;
-        rp=r->d;
-        nrp= &(r->d[nl]);
-        /* clear the top words of T */
-        for (i=r->top; i<max; i++) /* memset? XXX */
-                r->d[i]=0;
-        r->top=max;
-#if 0 /* for OpenSSL 0.9.9 mont->n0 */
-        n0=mont->n0[0];
-#else
-        n0=mont->n0;
-#endif
-#ifdef BN_COUNT
-        fprintf(stderr,"word BN_from_montgomery_word %d * %d\n",nl,nl);
-#endif
-        for (i=0; i<nl; i++)
-                {
-#ifdef __TANDEM
-                {
-                   long long t1;
-                   long long t2;
-                   long long t3;
-                   t1 = rp[0] * (n0 & 0177777);
-                   t2 = 037777600000l;
-                   t2 = n0 & t2;
-                   t3 = rp[0] & 0177777;
-                   t2 = (t3 * t2) & BN_MASK2;
-                   t1 = t1 + t2;
-                   v=bn_mul_add_words(rp,np,nl,(BN_ULONG) t1);
-                }
-#else
-                v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);
-#endif
-                nrp++;
-                rp++;
-                if (((nrp[-1]+=v)&BN_MASK2) >= v)
-                        continue;
-                else
-                        {
-                        if (((++nrp[0])&BN_MASK2) != 0) continue;
-                        if (((++nrp[1])&BN_MASK2) != 0) continue;
-                        for (x=2; (((++nrp[x])&BN_MASK2) == 0); x++) ;
-                        }
-                }
-        bn_correct_top(r);
-        /* mont->ri will be a multiple of the word size and below code
-         * is kind of BN_rshift(ret,r,mont->ri) equivalent */
-        if (r->top <= ri)
-                {
-                ret->top=0;
-                return(1);
-                }
-        al=r->top-ri;
-        if (bn_wexpand(ret,ri) == NULL) return(0);
-        x=0-(((al-ri)>>(sizeof(al)*8-1))&1);
-        ret->top=x=(ri&~x)|(al&x);      /* min(ri,al) */
-        ret->neg=r->neg;
-        rp=ret->d;
-        ap=&(r->d[ri]);
-        {
-        size_t m1,m2;
-        v=bn_sub_words(rp,ap,np,ri);
-        /* this ----------------^^ works even in al<ri case
-         * thanks to zealous zeroing of top of the vector in the
-         * beginning. */
-        /* if (al==ri && !v) || al>ri) nrp=rp; else nrp=ap; */
-        /* in other words if subtraction result is real, then
-         * trick unconditional memcpy below to perform in-place
-         * "refresh" instead of actual copy. */
-        m1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1);   /* al<ri */
-        m2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1);   /* al>ri */
-        m1|=m2;                 /* (al!=ri) */
-        m1|=(0-(size_t)v);      /* (al!=ri || v) */
-        m1&=~m2;                /* (al!=ri || v) && !al>ri */
-        nrp=(BN_ULONG *)(((size_t)rp&~m1)|((size_t)ap&m1));
-        }
-        /* 'i<ri' is chosen to eliminate dependency on input data, even
-         * though it results in redundant copy in al<ri case. */
-        for (i=0,ri-=4; i<ri; i+=4)
-                {
-                BN_ULONG t1,t2,t3,t4;
-                
-                t1=nrp[i+0];
-                t2=nrp[i+1];
-                t3=nrp[i+2];    ap[i+0]=0;
-                t4=nrp[i+3];    ap[i+1]=0;
-                rp[i+0]=t1;     ap[i+2]=0;
-                rp[i+1]=t2;     ap[i+3]=0;
-                rp[i+2]=t3;
-                rp[i+3]=t4;
-                }
-        for (ri+=4; i<ri; i++)
-                rp[i]=nrp[i], ap[i]=0;
-        bn_correct_top(r);
-        bn_correct_top(ret);
-        bn_check_top(ret);
-        return(1);
-        }
-int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,
-             BN_CTX *ctx)
-        {
-        int retn=0;
-        BIGNUM *t;
-        BN_CTX_start(ctx);
-        if ((t = BN_CTX_get(ctx)) && BN_copy(t,a))
-                retn = BN_from_montgomery_word(ret,t,mont);
-        BN_CTX_end(ctx);
-        return retn;
-        }
-#else /* !MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD */
-int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,
-             BN_CTX *ctx)
-        {
-        int retn=0;
-#ifdef MONT_WORD
-        BIGNUM *n,*r;
-        BN_ULONG *ap,*np,*rp,n0,v,*nrp;
-        int al,nl,max,i,x,ri;
-        BN_CTX_start(ctx);
-        if ((r = BN_CTX_get(ctx)) == NULL) goto err;
-        if (!BN_copy(r,a)) goto err;
-        n= &(mont->N);
-        ap=a->d;
-        /* mont->ri is the size of mont->N in bits (rounded up
-           to the word size) */
-        al=ri=mont->ri/BN_BITS2;
-        
-        nl=n->top;
-        if ((al == 0) || (nl == 0)) { r->top=0; return(1); }
-        max=(nl+al+1); /* allow for overflow (no?) XXX */
-        if (bn_wexpand(r,max) == NULL) goto err;
-        r->neg=a->neg^n->neg;
-        np=n->d;
-        rp=r->d;
-        nrp= &(r->d[nl]);
-        /* clear the top words of T */
-#if 1
-        for (i=r->top; i<max; i++) /* memset? XXX */
-                r->d[i]=0;
-#else
-        memset(&(r->d[r->top]),0,(max-r->top)*sizeof(BN_ULONG)); 
-#endif
-        r->top=max;
-        n0=mont->n0;
-#ifdef BN_COUNT
-        fprintf(stderr,"word BN_from_montgomery %d * %d\n",nl,nl);
-#endif
-        for (i=0; i<nl; i++)
-                {
-#ifdef __TANDEM
-                {
-                   long long t1;
-                   long long t2;
-                   long long t3;
-                   t1 = rp[0] * (n0 & 0177777);
-                   t2 = 037777600000l;
-                   t2 = n0 & t2;
-                   t3 = rp[0] & 0177777;
-                   t2 = (t3 * t2) & BN_MASK2;
-                   t1 = t1 + t2;
-                   v=bn_mul_add_words(rp,np,nl,(BN_ULONG) t1);
-                }
-#else
-                v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);
-#endif
-                nrp++;
-                rp++;
-                if (((nrp[-1]+=v)&BN_MASK2) >= v)
-                        continue;
-                else
-                        {
-                        if (((++nrp[0])&BN_MASK2) != 0) continue;
-                        if (((++nrp[1])&BN_MASK2) != 0) continue;
-                        for (x=2; (((++nrp[x])&BN_MASK2) == 0); x++) ;
-                        }
-                }
-        bn_correct_top(r);
-        
-        /* mont->ri will be a multiple of the word size and below code
-         * is kind of BN_rshift(ret,r,mont->ri) equivalent */
-        if (r->top <= ri)
-                {
-                ret->top=0;
-                retn=1;
-                goto err;
-                }
-        al=r->top-ri;
-# define BRANCH_FREE 1
-# if BRANCH_FREE
-        if (bn_wexpand(ret,ri) == NULL) goto err;
-        x=0-(((al-ri)>>(sizeof(al)*8-1))&1);
-        ret->top=x=(ri&~x)|(al&x);      /* min(ri,al) */
-        ret->neg=r->neg;
-        rp=ret->d;
-        ap=&(r->d[ri]);
-        {
-        size_t m1,m2;
-        v=bn_sub_words(rp,ap,np,ri);
-        /* this ----------------^^ works even in al<ri case
-         * thanks to zealous zeroing of top of the vector in the
-         * beginning. */
-        /* if (al==ri && !v) || al>ri) nrp=rp; else nrp=ap; */
-        /* in other words if subtraction result is real, then
-         * trick unconditional memcpy below to perform in-place
-         * "refresh" instead of actual copy. */
-        m1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1);   /* al<ri */
-        m2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1);   /* al>ri */
-        m1|=m2;                 /* (al!=ri) */
-        m1|=(0-(size_t)v);      /* (al!=ri || v) */
-        m1&=~m2;                /* (al!=ri || v) && !al>ri */
-        nrp=(BN_ULONG *)(((size_t)rp&~m1)|((size_t)ap&m1));
-        }
-        /* 'i<ri' is chosen to eliminate dependency on input data, even
-         * though it results in redundant copy in al<ri case. */
-        for (i=0,ri-=4; i<ri; i+=4)
-                {
-                BN_ULONG t1,t2,t3,t4;
-                
-                t1=nrp[i+0];
-                t2=nrp[i+1];
-                t3=nrp[i+2];    ap[i+0]=0;
-                t4=nrp[i+3];    ap[i+1]=0;
-                rp[i+0]=t1;     ap[i+2]=0;
-                rp[i+1]=t2;     ap[i+3]=0;
-                rp[i+2]=t3;
-                rp[i+3]=t4;
-                }
-        for (ri+=4; i<ri; i++)
-                rp[i]=nrp[i], ap[i]=0;
-        bn_correct_top(r);
-        bn_correct_top(ret);
-# else
-        if (bn_wexpand(ret,al) == NULL) goto err;
-        ret->top=al;
-        ret->neg=r->neg;
-        rp=ret->d;
-        ap=&(r->d[ri]);
-        al-=4;
-        for (i=0; i<al; i+=4)
-                {
-                BN_ULONG t1,t2,t3,t4;
-                
-                t1=ap[i+0];
-                t2=ap[i+1];
-                t3=ap[i+2];
-                t4=ap[i+3];
-                rp[i+0]=t1;
-                rp[i+1]=t2;
-                rp[i+2]=t3;
-                rp[i+3]=t4;
-                }
-        al+=4;
-        for (; i<al; i++)
-                rp[i]=ap[i];
-# endif
-#else /* !MONT_WORD */ 
-        BIGNUM *t1,*t2;
-        BN_CTX_start(ctx);
-        t1 = BN_CTX_get(ctx);
-        t2 = BN_CTX_get(ctx);
-        if (t1 == NULL || t2 == NULL) goto err;
-        
-        if (!BN_copy(t1,a)) goto err;
-        BN_mask_bits(t1,mont->ri);
-        if (!BN_mul(t2,t1,&mont->Ni,ctx)) goto err;
-        BN_mask_bits(t2,mont->ri);
-        if (!BN_mul(t1,t2,&mont->N,ctx)) goto err;
-        if (!BN_add(t2,a,t1)) goto err;
-        if (!BN_rshift(ret,t2,mont->ri)) goto err;
-#endif /* MONT_WORD */
-#if !defined(BRANCH_FREE) || BRANCH_FREE==0
-        if (BN_ucmp(ret, &(mont->N)) >= 0)
-                {
-                if (!BN_usub(ret,ret,&(mont->N))) goto err;
-                }
-#endif
-        retn=1;
-        bn_check_top(ret);
- err:
-        BN_CTX_end(ctx);
-        return(retn);
-        }
-#endif /* MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD */
-BN_MONT_CTX *BN_MONT_CTX_new(void)
-        {
-        BN_MONT_CTX *ret;
-        if ((ret=(BN_MONT_CTX *)OPENSSL_malloc(sizeof(BN_MONT_CTX))) == NULL)
-                return(NULL);
-        BN_MONT_CTX_init(ret);
-        ret->flags=BN_FLG_MALLOCED;
-        return(ret);
-        }
-void BN_MONT_CTX_init(BN_MONT_CTX *ctx)
-        {
-        ctx->ri=0;
-        BN_init(&(ctx->RR));
-        BN_init(&(ctx->N));
-        BN_init(&(ctx->Ni));
-#if 0 /* for OpenSSL 0.9.9 mont->n0 */
-        ctx->n0[0] = ctx->n0[1] = 0;
-#else
-        ctx->n0 = 0;
-#endif
-        ctx->flags=0;
-        }
-void BN_MONT_CTX_free(BN_MONT_CTX *mont)
-        {
-        if(mont == NULL)
-            return;
-        BN_free(&(mont->RR));
-        BN_free(&(mont->N));
-        BN_free(&(mont->Ni));
-        if (mont->flags & BN_FLG_MALLOCED)
-                OPENSSL_free(mont);
-        }
-int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
-        {
-        int ret = 0;
-        BIGNUM *Ri,*R;
-        BN_CTX_start(ctx);
-        if((Ri = BN_CTX_get(ctx)) == NULL) goto err;
-        R= &(mont->RR);                                 /* grab RR as a temp */
-        if (!BN_copy(&(mont->N),mod)) goto err;         /* Set N */
-        mont->N.neg = 0;
-#ifdef MONT_WORD
-                {
-                BIGNUM tmod;
-                BN_ULONG buf[2];
-                mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;
-                BN_zero(R);
-#if 0 /* for OpenSSL 0.9.9 mont->n0, would be "#if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)",
-         only certain BN_BITS2<=32 platforms actually need this */
-                if (!(BN_set_bit(R,2*BN_BITS2))) goto err;      /* R */
-#else
-                if (!(BN_set_bit(R,BN_BITS2))) goto err;        /* R */
-#endif
-                buf[0]=mod->d[0]; /* tmod = N mod word size */
-                buf[1]=0;
-                BN_init(&tmod);
-                tmod.d=buf;
-                tmod.top = buf[0] != 0 ? 1 : 0;
-                tmod.dmax=2;
-                tmod.neg=0;
-#if 0 /* for OpenSSL 0.9.9 mont->n0, would be "#if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)";
-         only certain BN_BITS2<=32 platforms actually need this */
-                                                                tmod.top=0;
-                if ((buf[0] = mod->d[0]))                       tmod.top=1;
-                if ((buf[1] = mod->top>1 ? mod->d[1] : 0))      tmod.top=2;
-                if ((BN_mod_inverse(Ri,R,&tmod,ctx)) == NULL)
-                        goto err;
-                if (!BN_lshift(Ri,Ri,2*BN_BITS2)) goto err; /* R*Ri */
-                if (!BN_is_zero(Ri))
-                        {
-                        if (!BN_sub_word(Ri,1)) goto err;
-                        }
-                else /* if N mod word size == 1 */
-                        {
-                        if (bn_expand(Ri,(int)sizeof(BN_ULONG)*2) == NULL)
-                                goto err;
-                        /* Ri-- (mod double word size) */
-                        Ri->neg=0;
-                        Ri->d[0]=BN_MASK2;
-                        Ri->d[1]=BN_MASK2;
-                        Ri->top=2;
-                        }
-                if (!BN_div(Ri,NULL,Ri,&tmod,ctx)) goto err;
-                /* Ni = (R*Ri-1)/N,
-                 * keep only couple of least significant words: */
-                mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
-                mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;
-#else
-                                                        /* Ri = R^-1 mod N*/
-                if ((BN_mod_inverse(Ri,R,&tmod,ctx)) == NULL)
-                        goto err;
-                if (!BN_lshift(Ri,Ri,BN_BITS2)) goto err; /* R*Ri */
-                if (!BN_is_zero(Ri))
-                        {
-                        if (!BN_sub_word(Ri,1)) goto err;
-                        }
-                else /* if N mod word size == 1 */
-                        {
-                        if (!BN_set_word(Ri,BN_MASK2)) goto err;  /* Ri-- (mod word size) */
-                        }
-                if (!BN_div(Ri,NULL,Ri,&tmod,ctx)) goto err;
-                /* Ni = (R*Ri-1)/N,
-                 * keep only least significant word: */
-# if 0 /* for OpenSSL 0.9.9 mont->n0 */
-                mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
-                mont->n0[1] = 0;
-# else
-                mont->n0 = (Ri->top > 0) ? Ri->d[0] : 0;
-# endif
-#endif
-                }
-#else /* !MONT_WORD */
-                { /* bignum version */
-                mont->ri=BN_num_bits(&mont->N);
-                BN_zero(R);
-                if (!BN_set_bit(R,mont->ri)) goto err;  /* R = 2^ri */
-                                                        /* Ri = R^-1 mod N*/
-                if ((BN_mod_inverse(Ri,R,&mont->N,ctx)) == NULL)
-                        goto err;
-                if (!BN_lshift(Ri,Ri,mont->ri)) goto err; /* R*Ri */
-                if (!BN_sub_word(Ri,1)) goto err;
-                                                        /* Ni = (R*Ri-1) / N */
-                if (!BN_div(&(mont->Ni),NULL,Ri,&mont->N,ctx)) goto err;
-                }
-#endif
-        /* setup RR for conversions */
-        BN_zero(&(mont->RR));
-        if (!BN_set_bit(&(mont->RR),mont->ri*2)) goto err;
-        if (!BN_mod(&(mont->RR),&(mont->RR),&(mont->N),ctx)) goto err;
-        ret = 1;
-err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from)
-        {
-        if (to == from) return(to);
-        if (!BN_copy(&(to->RR),&(from->RR))) return NULL;
-        if (!BN_copy(&(to->N),&(from->N))) return NULL;
-        if (!BN_copy(&(to->Ni),&(from->Ni))) return NULL;
-        to->ri=from->ri;
-#if 0 /* for OpenSSL 0.9.9 mont->n0 */
-        to->n0[0]=from->n0[0];
-        to->n0[1]=from->n0[1];
-#else
-        to->n0=from->n0;
-#endif
-        return(to);
-        }
-BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,
-                                        const BIGNUM *mod, BN_CTX *ctx)
-        {
-        int got_write_lock = 0;
-        BN_MONT_CTX *ret;
-        CRYPTO_r_lock(lock);
-        if (!*pmont)
-                {
-                CRYPTO_r_unlock(lock);
-                CRYPTO_w_lock(lock);
-                got_write_lock = 1;
-                if (!*pmont)
-                        {
-                        ret = BN_MONT_CTX_new();
-                        if (ret && !BN_MONT_CTX_set(ret, mod, ctx))
-                                BN_MONT_CTX_free(ret);
-                        else
-                                *pmont = ret;
-                        }
-                }
-        
-        ret = *pmont;
-        
-        if (got_write_lock)
-                CRYPTO_w_unlock(lock);
-        else
-                CRYPTO_r_unlock(lock);
-                
-        return ret;
-        }
diff --git a/src/lib/libcrypto/bn/bn_mpi.c b/src/lib/libcrypto/bn/bn_mpi.c
deleted file mode 100644
index a054d21aed..0000000000
--- a/src/lib/libcrypto/bn/bn_mpi.c
+++ /dev/null
@@ -1,130 +0,0 @@
-/* crypto/bn/bn_mpi.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-int BN_bn2mpi(const BIGNUM *a, unsigned char *d)
-        {
-        int bits;
-        int num=0;
-        int ext=0;
-        long l;
-        bits=BN_num_bits(a);
-        num=(bits+7)/8;
-        if (bits > 0)
-                {
-                ext=((bits & 0x07) == 0);
-                }
-        if (d == NULL)
-                return(num+4+ext);
-        l=num+ext;
-        d[0]=(unsigned char)(l>>24)&0xff;
-        d[1]=(unsigned char)(l>>16)&0xff;
-        d[2]=(unsigned char)(l>> 8)&0xff;
-        d[3]=(unsigned char)(l    )&0xff;
-        if (ext) d[4]=0;
-        num=BN_bn2bin(a,&(d[4+ext]));
-        if (a->neg)
-                d[4]|=0x80;
-        return(num+4+ext);
-        }
-BIGNUM *BN_mpi2bn(const unsigned char *d, int n, BIGNUM *a)
-        {
-        long len;
-        int neg=0;
-        if (n < 4)
-                {
-                BNerr(BN_F_BN_MPI2BN,BN_R_INVALID_LENGTH);
-                return(NULL);
-                }
-        len=((long)d[0]<<24)|((long)d[1]<<16)|((int)d[2]<<8)|(int)d[3];
-        if ((len+4) != n)
-                {
-                BNerr(BN_F_BN_MPI2BN,BN_R_ENCODING_ERROR);
-                return(NULL);
-                }
-        if (a == NULL) a=BN_new();
-        if (a == NULL) return(NULL);
-        if (len == 0)
-                {
-                a->neg=0;
-                a->top=0;
-                return(a);
-                }
-        d+=4;
-        if ((*d) & 0x80)
-                neg=1;
-        if (BN_bin2bn(d,(int)len,a) == NULL)
-                return(NULL);
-        a->neg=neg;
-        if (neg)
-                {
-                BN_clear_bit(a,BN_num_bits(a)-1);
-                }
-        bn_check_top(a);
-        return(a);
-        }
diff --git a/src/lib/libcrypto/bn/bn_mul.c b/src/lib/libcrypto/bn/bn_mul.c
deleted file mode 100644
index b848c8cc60..0000000000
--- a/src/lib/libcrypto/bn/bn_mul.c
+++ /dev/null
@@ -1,1169 +0,0 @@
-/* crypto/bn/bn_mul.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#ifndef BN_DEBUG
-# undef NDEBUG /* avoid conflicting definitions */
-# define NDEBUG
-#endif
-#include <stdio.h>
-#include <assert.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#if defined(OPENSSL_NO_ASM) || !defined(OPENSSL_BN_ASM_PART_WORDS)
-/* Here follows specialised variants of bn_add_words() and
-   bn_sub_words().  They have the property performing operations on
-   arrays of different sizes.  The sizes of those arrays is expressed through
-   cl, which is the common length ( basicall, min(len(a),len(b)) ), and dl,
-   which is the delta between the two lengths, calculated as len(a)-len(b).
-   All lengths are the number of BN_ULONGs...  For the operations that require
-   a result array as parameter, it must have the length cl+abs(dl).
-   These functions should probably end up in bn_asm.c as soon as there are
-   assembler counterparts for the systems that use assembler files.  */
-BN_ULONG bn_sub_part_words(BN_ULONG *r,
-        const BN_ULONG *a, const BN_ULONG *b,
-        int cl, int dl)
-        {
-        BN_ULONG c, t;
-        assert(cl >= 0);
-        c = bn_sub_words(r, a, b, cl);
-        if (dl == 0)
-                return c;
-        r += cl;
-        a += cl;
-        b += cl;
-        if (dl < 0)
-                {
-#ifdef BN_COUNT
-                fprintf(stderr, "  bn_sub_part_words %d + %d (dl < 0, c = %d)\n", cl, dl, c);
-#endif
-                for (;;)
-                        {
-                        t = b[0];
-                        r[0] = (0-t-c)&BN_MASK2;
-                        if (t != 0) c=1;
-                        if (++dl >= 0) break;
-                        t = b[1];
-                        r[1] = (0-t-c)&BN_MASK2;
-                        if (t != 0) c=1;
-                        if (++dl >= 0) break;
-                        t = b[2];
-                        r[2] = (0-t-c)&BN_MASK2;
-                        if (t != 0) c=1;
-                        if (++dl >= 0) break;
-                        t = b[3];
-                        r[3] = (0-t-c)&BN_MASK2;
-                        if (t != 0) c=1;
-                        if (++dl >= 0) break;
-                        b += 4;
-                        r += 4;
-                        }
-                }
-        else
-                {
-                int save_dl = dl;
-#ifdef BN_COUNT
-                fprintf(stderr, "  bn_sub_part_words %d + %d (dl > 0, c = %d)\n", cl, dl, c);
-#endif
-                while(c)
-                        {
-                        t = a[0];
-                        r[0] = (t-c)&BN_MASK2;
-                        if (t != 0) c=0;
-                        if (--dl <= 0) break;
-                        t = a[1];
-                        r[1] = (t-c)&BN_MASK2;
-                        if (t != 0) c=0;
-                        if (--dl <= 0) break;
-                        t = a[2];
-                        r[2] = (t-c)&BN_MASK2;
-                        if (t != 0) c=0;
-                        if (--dl <= 0) break;
-                        t = a[3];
-                        r[3] = (t-c)&BN_MASK2;
-                        if (t != 0) c=0;
-                        if (--dl <= 0) break;
-                        save_dl = dl;
-                        a += 4;
-                        r += 4;
-                        }
-                if (dl > 0)
-                        {
-#ifdef BN_COUNT
-                        fprintf(stderr, "  bn_sub_part_words %d + %d (dl > 0, c == 0)\n", cl, dl);
-#endif
-                        if (save_dl > dl)
-                                {
-                                switch (save_dl - dl)
-                                        {
-                                case 1:
-                                        r[1] = a[1];
-                                        if (--dl <= 0) break;
-                                case 2:
-                                        r[2] = a[2];
-                                        if (--dl <= 0) break;
-                                case 3:
-                                        r[3] = a[3];
-                                        if (--dl <= 0) break;
-                                        }
-                                a += 4;
-                                r += 4;
-                                }
-                        }
-                if (dl > 0)
-                        {
-#ifdef BN_COUNT
-                        fprintf(stderr, "  bn_sub_part_words %d + %d (dl > 0, copy)\n", cl, dl);
-#endif
-                        for(;;)
-                                {
-                                r[0] = a[0];
-                                if (--dl <= 0) break;
-                                r[1] = a[1];
-                                if (--dl <= 0) break;
-                                r[2] = a[2];
-                                if (--dl <= 0) break;
-                                r[3] = a[3];
-                                if (--dl <= 0) break;
-                                a += 4;
-                                r += 4;
-                                }
-                        }
-                }
-        return c;
-        }
-#endif
-BN_ULONG bn_add_part_words(BN_ULONG *r,
-        const BN_ULONG *a, const BN_ULONG *b,
-        int cl, int dl)
-        {
-        BN_ULONG c, l, t;
-        assert(cl >= 0);
-        c = bn_add_words(r, a, b, cl);
-        if (dl == 0)
-                return c;
-        r += cl;
-        a += cl;
-        b += cl;
-        if (dl < 0)
-                {
-                int save_dl = dl;
-#ifdef BN_COUNT
-                fprintf(stderr, "  bn_add_part_words %d + %d (dl < 0, c = %d)\n", cl, dl, c);
-#endif
-                while (c)
-                        {
-                        l=(c+b[0])&BN_MASK2;
-                        c=(l < c);
-                        r[0]=l;
-                        if (++dl >= 0) break;
-                        l=(c+b[1])&BN_MASK2;
-                        c=(l < c);
-                        r[1]=l;
-                        if (++dl >= 0) break;
-                        l=(c+b[2])&BN_MASK2;
-                        c=(l < c);
-                        r[2]=l;
-                        if (++dl >= 0) break;
-                        l=(c+b[3])&BN_MASK2;
-                        c=(l < c);
-                        r[3]=l;
-                        if (++dl >= 0) break;
-                        save_dl = dl;
-                        b+=4;
-                        r+=4;
-                        }
-                if (dl < 0)
-                        {
-#ifdef BN_COUNT
-                        fprintf(stderr, "  bn_add_part_words %d + %d (dl < 0, c == 0)\n", cl, dl);
-#endif
-                        if (save_dl < dl)
-                                {
-                                switch (dl - save_dl)
-                                        {
-                                case 1:
-                                        r[1] = b[1];
-                                        if (++dl >= 0) break;
-                                case 2:
-                                        r[2] = b[2];
-                                        if (++dl >= 0) break;
-                                case 3:
-                                        r[3] = b[3];
-                                        if (++dl >= 0) break;
-                                        }
-                                b += 4;
-                                r += 4;
-                                }
-                        }
-                if (dl < 0)
-                        {
-#ifdef BN_COUNT
-                        fprintf(stderr, "  bn_add_part_words %d + %d (dl < 0, copy)\n", cl, dl);
-#endif
-                        for(;;)
-                                {
-                                r[0] = b[0];
-                                if (++dl >= 0) break;
-                                r[1] = b[1];
-                                if (++dl >= 0) break;
-                                r[2] = b[2];
-                                if (++dl >= 0) break;
-                                r[3] = b[3];
-                                if (++dl >= 0) break;
-                                b += 4;
-                                r += 4;
-                                }
-                        }
-                }
-        else
-                {
-                int save_dl = dl;
-#ifdef BN_COUNT
-                fprintf(stderr, "  bn_add_part_words %d + %d (dl > 0)\n", cl, dl);
-#endif
-                while (c)
-                        {
-                        t=(a[0]+c)&BN_MASK2;
-                        c=(t < c);
-                        r[0]=t;
-                        if (--dl <= 0) break;
-                        t=(a[1]+c)&BN_MASK2;
-                        c=(t < c);
-                        r[1]=t;
-                        if (--dl <= 0) break;
-                        t=(a[2]+c)&BN_MASK2;
-                        c=(t < c);
-                        r[2]=t;
-                        if (--dl <= 0) break;
-                        t=(a[3]+c)&BN_MASK2;
-                        c=(t < c);
-                        r[3]=t;
-                        if (--dl <= 0) break;
-                        save_dl = dl;
-                        a+=4;
-                        r+=4;
-                        }
-#ifdef BN_COUNT
-                fprintf(stderr, "  bn_add_part_words %d + %d (dl > 0, c == 0)\n", cl, dl);
-#endif
-                if (dl > 0)
-                        {
-                        if (save_dl > dl)
-                                {
-                                switch (save_dl - dl)
-                                        {
-                                case 1:
-                                        r[1] = a[1];
-                                        if (--dl <= 0) break;
-                                case 2:
-                                        r[2] = a[2];
-                                        if (--dl <= 0) break;
-                                case 3:
-                                        r[3] = a[3];
-                                        if (--dl <= 0) break;
-                                        }
-                                a += 4;
-                                r += 4;
-                                }
-                        }
-                if (dl > 0)
-                        {
-#ifdef BN_COUNT
-                        fprintf(stderr, "  bn_add_part_words %d + %d (dl > 0, copy)\n", cl, dl);
-#endif
-                        for(;;)
-                                {
-                                r[0] = a[0];
-                                if (--dl <= 0) break;
-                                r[1] = a[1];
-                                if (--dl <= 0) break;
-                                r[2] = a[2];
-                                if (--dl <= 0) break;
-                                r[3] = a[3];
-                                if (--dl <= 0) break;
-                                a += 4;
-                                r += 4;
-                                }
-                        }
-                }
-        return c;
-        }
-#ifdef BN_RECURSION
-/* Karatsuba recursive multiplication algorithm
- * (cf. Knuth, The Art of Computer Programming, Vol. 2) */
-/* r is 2*n2 words in size,
- * a and b are both n2 words in size.
- * n2 must be a power of 2.
- * We multiply and return the result.
- * t must be 2*n2 words in size
- * We calculate
- * a[0]*b[0]
- * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])
- * a[1]*b[1]
- */
-/* dnX may not be positive, but n2/2+dnX has to be */
-void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
-        int dna, int dnb, BN_ULONG *t)
-        {
-        int n=n2/2,c1,c2;
-        int tna=n+dna, tnb=n+dnb;
-        unsigned int neg,zero;
-        BN_ULONG ln,lo,*p;
-# ifdef BN_COUNT
-        fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb);
-# endif
-# ifdef BN_MUL_COMBA
-#  if 0
-        if (n2 == 4)
-                {
-                bn_mul_comba4(r,a,b);
-                return;
-                }
-#  endif
-        /* Only call bn_mul_comba 8 if n2 == 8 and the
-         * two arrays are complete [steve]
-         */
-        if (n2 == 8 && dna == 0 && dnb == 0)
-                {
-                bn_mul_comba8(r,a,b);
-                return; 
-                }
-# endif /* BN_MUL_COMBA */
-        /* Else do normal multiply */
-        if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL)
-                {
-                bn_mul_normal(r,a,n2+dna,b,n2+dnb);
-                if ((dna + dnb) < 0)
-                        memset(&r[2*n2 + dna + dnb], 0,
-                                sizeof(BN_ULONG) * -(dna + dnb));
-                return;
-                }
-        /* r=(a[0]-a[1])*(b[1]-b[0]) */
-        c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
-        c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
-        zero=neg=0;
-        switch (c1*3+c2)
-                {
-        case -4:
-                bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
-                bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
-                break;
-        case -3:
-                zero=1;
-                break;
-        case -2:
-                bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
-                bn_sub_part_words(&(t[n]),&(b[n]),b,      tnb,tnb-n); /* + */
-                neg=1;
-                break;
-        case -1:
-        case 0:
-        case 1:
-                zero=1;
-                break;
-        case 2:
-                bn_sub_part_words(t,      a,      &(a[n]),tna,n-tna); /* + */
-                bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
-                neg=1;
-                break;
-        case 3:
-                zero=1;
-                break;
-        case 4:
-                bn_sub_part_words(t,      a,      &(a[n]),tna,n-tna);
-                bn_sub_part_words(&(t[n]),&(b[n]),b,      tnb,tnb-n);
-                break;
-                }
-# ifdef BN_MUL_COMBA
-        if (n == 4 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba4 could take
-                                               extra args to do this well */
-                {
-                if (!zero)
-                        bn_mul_comba4(&(t[n2]),t,&(t[n]));
-                else
-                        memset(&(t[n2]),0,8*sizeof(BN_ULONG));
-                
-                bn_mul_comba4(r,a,b);
-                bn_mul_comba4(&(r[n2]),&(a[n]),&(b[n]));
-                }
-        else if (n == 8 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba8 could
-                                                    take extra args to do this
-                                                    well */
-                {
-                if (!zero)
-                        bn_mul_comba8(&(t[n2]),t,&(t[n]));
-                else
-                        memset(&(t[n2]),0,16*sizeof(BN_ULONG));
-                
-                bn_mul_comba8(r,a,b);
-                bn_mul_comba8(&(r[n2]),&(a[n]),&(b[n]));
-                }
-        else
-# endif /* BN_MUL_COMBA */
-                {
-                p= &(t[n2*2]);
-                if (!zero)
-                        bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
-                else
-                        memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
-                bn_mul_recursive(r,a,b,n,0,0,p);
-                bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),n,dna,dnb,p);
-                }
-        /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
-         * r[10] holds (a[0]*b[0])
-         * r[32] holds (b[1]*b[1])
-         */
-        c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
-        if (neg) /* if t[32] is negative */
-                {
-                c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
-                }
-        else
-                {
-                /* Might have a carry */
-                c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
-                }
-        /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
-         * r[10] holds (a[0]*b[0])
-         * r[32] holds (b[1]*b[1])
-         * c1 holds the carry bits
-         */
-        c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
-        if (c1)
-                {
-                p= &(r[n+n2]);
-                lo= *p;
-                ln=(lo+c1)&BN_MASK2;
-                *p=ln;
-                /* The overflow will stop before we over write
-                 * words we should not overwrite */
-                if (ln < (BN_ULONG)c1)
-                        {
-                        do      {
-                                p++;
-                                lo= *p;
-                                ln=(lo+1)&BN_MASK2;
-                                *p=ln;
-                                } while (ln == 0);
-                        }
-                }
-        }
-/* n+tn is the word length
- * t needs to be n*4 is size, as does r */
-/* tnX may not be negative but less than n */
-void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
-             int tna, int tnb, BN_ULONG *t)
-        {
-        int i,j,n2=n*2;
-        int c1,c2,neg,zero;
-        BN_ULONG ln,lo,*p;
-# ifdef BN_COUNT
-        fprintf(stderr," bn_mul_part_recursive (%d%+d) * (%d%+d)\n",
-                n, tna, n, tnb);
-# endif
-        if (n < 8)
-                {
-                bn_mul_normal(r,a,n+tna,b,n+tnb);
-                return;
-                }
-        /* r=(a[0]-a[1])*(b[1]-b[0]) */
-        c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
-        c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
-        zero=neg=0;
-        switch (c1*3+c2)
-                {
-        case -4:
-                bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
-                bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
-                break;
-        case -3:
-                zero=1;
-                /* break; */
-        case -2:
-                bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
-                bn_sub_part_words(&(t[n]),&(b[n]),b,      tnb,tnb-n); /* + */
-                neg=1;
-                break;
-        case -1:
-        case 0:
-        case 1:
-                zero=1;
-                /* break; */
-        case 2:
-                bn_sub_part_words(t,      a,      &(a[n]),tna,n-tna); /* + */
-                bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
-                neg=1;
-                break;
-        case 3:
-                zero=1;
-                /* break; */
-        case 4:
-                bn_sub_part_words(t,      a,      &(a[n]),tna,n-tna);
-                bn_sub_part_words(&(t[n]),&(b[n]),b,      tnb,tnb-n);
-                break;
-                }
-                /* The zero case isn't yet implemented here. The speedup
-                   would probably be negligible. */
-# if 0
-        if (n == 4)
-                {
-                bn_mul_comba4(&(t[n2]),t,&(t[n]));
-                bn_mul_comba4(r,a,b);
-                bn_mul_normal(&(r[n2]),&(a[n]),tn,&(b[n]),tn);
-                memset(&(r[n2+tn*2]),0,sizeof(BN_ULONG)*(n2-tn*2));
-                }
-        else
-# endif
-        if (n == 8)
-                {
-                bn_mul_comba8(&(t[n2]),t,&(t[n]));
-                bn_mul_comba8(r,a,b);
-                bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb);
-                memset(&(r[n2+tna+tnb]),0,sizeof(BN_ULONG)*(n2-tna-tnb));
-                }
-        else
-                {
-                p= &(t[n2*2]);
-                bn_mul_recursive(&(t[n2]),t,&(t[n]),n,0,0,p);
-                bn_mul_recursive(r,a,b,n,0,0,p);
-                i=n/2;
-                /* If there is only a bottom half to the number,
-                 * just do it */
-                if (tna > tnb)
-                        j = tna - i;
-                else
-                        j = tnb - i;
-                if (j == 0)
-                        {
-                        bn_mul_recursive(&(r[n2]),&(a[n]),&(b[n]),
-                                i,tna-i,tnb-i,p);
-                        memset(&(r[n2+i*2]),0,sizeof(BN_ULONG)*(n2-i*2));
-                        }
-                else if (j > 0) /* eg, n == 16, i == 8 and tn == 11 */
-                                {
-                                bn_mul_part_recursive(&(r[n2]),&(a[n]),&(b[n]),
-                                        i,tna-i,tnb-i,p);
-                                memset(&(r[n2+tna+tnb]),0,
-                                        sizeof(BN_ULONG)*(n2-tna-tnb));
-                                }
-                else /* (j < 0) eg, n == 16, i == 8 and tn == 5 */
-                        {
-                        memset(&(r[n2]),0,sizeof(BN_ULONG)*n2);
-                        if (tna < BN_MUL_RECURSIVE_SIZE_NORMAL
-                                && tnb < BN_MUL_RECURSIVE_SIZE_NORMAL)
-                                {
-                                bn_mul_normal(&(r[n2]),&(a[n]),tna,&(b[n]),tnb);
-                                }
-                        else
-                                {
-                                for (;;)
-                                        {
-                                        i/=2;
-                                        /* these simplified conditions work
-                                         * exclusively because difference
-                                         * between tna and tnb is 1 or 0 */
-                                        if (i < tna || i < tnb)
-                                                {
-                                                bn_mul_part_recursive(&(r[n2]),
-                                                        &(a[n]),&(b[n]),
-                                                        i,tna-i,tnb-i,p);
-                                                break;
-                                                }
-                                        else if (i == tna || i == tnb)
-                                                {
-                                                bn_mul_recursive(&(r[n2]),
-                                                        &(a[n]),&(b[n]),
-                                                        i,tna-i,tnb-i,p);
-                                                break;
-                                                }
-                                        }
-                                }
-                        }
-                }
-        /* t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign
-         * r[10] holds (a[0]*b[0])
-         * r[32] holds (b[1]*b[1])
-         */
-        c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
-        if (neg) /* if t[32] is negative */
-                {
-                c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
-                }
-        else
-                {
-                /* Might have a carry */
-                c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),t,n2));
-                }
-        /* t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])
-         * r[10] holds (a[0]*b[0])
-         * r[32] holds (b[1]*b[1])
-         * c1 holds the carry bits
-         */
-        c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
-        if (c1)
-                {
-                p= &(r[n+n2]);
-                lo= *p;
-                ln=(lo+c1)&BN_MASK2;
-                *p=ln;
-                /* The overflow will stop before we over write
-                 * words we should not overwrite */
-                if (ln < (BN_ULONG)c1)
-                        {
-                        do      {
-                                p++;
-                                lo= *p;
-                                ln=(lo+1)&BN_MASK2;
-                                *p=ln;
-                                } while (ln == 0);
-                        }
-                }
-        }
-/* a and b must be the same size, which is n2.
- * r needs to be n2 words and t needs to be n2*2
- */
-void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
-             BN_ULONG *t)
-        {
-        int n=n2/2;
-# ifdef BN_COUNT
-        fprintf(stderr," bn_mul_low_recursive %d * %d\n",n2,n2);
-# endif
-        bn_mul_recursive(r,a,b,n,0,0,&(t[0]));
-        if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL)
-                {
-                bn_mul_low_recursive(&(t[0]),&(a[0]),&(b[n]),n,&(t[n2]));
-                bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
-                bn_mul_low_recursive(&(t[0]),&(a[n]),&(b[0]),n,&(t[n2]));
-                bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
-                }
-        else
-                {
-                bn_mul_low_normal(&(t[0]),&(a[0]),&(b[n]),n);
-                bn_mul_low_normal(&(t[n]),&(a[n]),&(b[0]),n);
-                bn_add_words(&(r[n]),&(r[n]),&(t[0]),n);
-                bn_add_words(&(r[n]),&(r[n]),&(t[n]),n);
-                }
-        }
-/* a and b must be the same size, which is n2.
- * r needs to be n2 words and t needs to be n2*2
- * l is the low words of the output.
- * t needs to be n2*3
- */
-void bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2,
-             BN_ULONG *t)
-        {
-        int i,n;
-        int c1,c2;
-        int neg,oneg,zero;
-        BN_ULONG ll,lc,*lp,*mp;
-# ifdef BN_COUNT
-        fprintf(stderr," bn_mul_high %d * %d\n",n2,n2);
-# endif
-        n=n2/2;
-        /* Calculate (al-ah)*(bh-bl) */
-        neg=zero=0;
-        c1=bn_cmp_words(&(a[0]),&(a[n]),n);
-        c2=bn_cmp_words(&(b[n]),&(b[0]),n);
-        switch (c1*3+c2)
-                {
-        case -4:
-                bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n);
-                bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n);
-                break;
-        case -3:
-                zero=1;
-                break;
-        case -2:
-                bn_sub_words(&(r[0]),&(a[n]),&(a[0]),n);
-                bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n);
-                neg=1;
-                break;
-        case -1:
-        case 0:
-        case 1:
-                zero=1;
-                break;
-        case 2:
-                bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n);
-                bn_sub_words(&(r[n]),&(b[0]),&(b[n]),n);
-                neg=1;
-                break;
-        case 3:
-                zero=1;
-                break;
-        case 4:
-                bn_sub_words(&(r[0]),&(a[0]),&(a[n]),n);
-                bn_sub_words(&(r[n]),&(b[n]),&(b[0]),n);
-                break;
-                }
-                
-        oneg=neg;
-        /* t[10] = (a[0]-a[1])*(b[1]-b[0]) */
-        /* r[10] = (a[1]*b[1]) */
-# ifdef BN_MUL_COMBA
-        if (n == 8)
-                {
-                bn_mul_comba8(&(t[0]),&(r[0]),&(r[n]));
-                bn_mul_comba8(r,&(a[n]),&(b[n]));
-                }
-        else
-# endif
-                {
-                bn_mul_recursive(&(t[0]),&(r[0]),&(r[n]),n,0,0,&(t[n2]));
-                bn_mul_recursive(r,&(a[n]),&(b[n]),n,0,0,&(t[n2]));
-                }
-        /* s0 == low(al*bl)
-         * s1 == low(ah*bh)+low((al-ah)*(bh-bl))+low(al*bl)+high(al*bl)
-         * We know s0 and s1 so the only unknown is high(al*bl)
-         * high(al*bl) == s1 - low(ah*bh+s0+(al-ah)*(bh-bl))
-         * high(al*bl) == s1 - (r[0]+l[0]+t[0])
-         */
-        if (l != NULL)
-                {
-                lp= &(t[n2+n]);
-                c1=(int)(bn_add_words(lp,&(r[0]),&(l[0]),n));
-                }
-        else
-                {
-                c1=0;
-                lp= &(r[0]);
-                }
-        if (neg)
-                neg=(int)(bn_sub_words(&(t[n2]),lp,&(t[0]),n));
-        else
-                {
-                bn_add_words(&(t[n2]),lp,&(t[0]),n);
-                neg=0;
-                }
-        if (l != NULL)
-                {
-                bn_sub_words(&(t[n2+n]),&(l[n]),&(t[n2]),n);
-                }
-        else
-                {
-                lp= &(t[n2+n]);
-                mp= &(t[n2]);
-                for (i=0; i<n; i++)
-                        lp[i]=((~mp[i])+1)&BN_MASK2;
-                }
-        /* s[0] = low(al*bl)
-         * t[3] = high(al*bl)
-         * t[10] = (a[0]-a[1])*(b[1]-b[0]) neg is the sign
-         * r[10] = (a[1]*b[1])
-         */
-        /* R[10] = al*bl
-         * R[21] = al*bl + ah*bh + (a[0]-a[1])*(b[1]-b[0])
-         * R[32] = ah*bh
-         */
-        /* R[1]=t[3]+l[0]+r[0](+-)t[0] (have carry/borrow)
-         * R[2]=r[0]+t[3]+r[1](+-)t[1] (have carry/borrow)
-         * R[3]=r[1]+(carry/borrow)
-         */
-        if (l != NULL)
-                {
-                lp= &(t[n2]);
-                c1= (int)(bn_add_words(lp,&(t[n2+n]),&(l[0]),n));
-                }
-        else
-                {
-                lp= &(t[n2+n]);
-                c1=0;
-                }
-        c1+=(int)(bn_add_words(&(t[n2]),lp,  &(r[0]),n));
-        if (oneg)
-                c1-=(int)(bn_sub_words(&(t[n2]),&(t[n2]),&(t[0]),n));
-        else
-                c1+=(int)(bn_add_words(&(t[n2]),&(t[n2]),&(t[0]),n));
-        c2 =(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n2+n]),n));
-        c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(r[n]),n));
-        if (oneg)
-                c2-=(int)(bn_sub_words(&(r[0]),&(r[0]),&(t[n]),n));
-        else
-                c2+=(int)(bn_add_words(&(r[0]),&(r[0]),&(t[n]),n));
-        
-        if (c1 != 0) /* Add starting at r[0], could be +ve or -ve */
-                {
-                i=0;
-                if (c1 > 0)
-                        {
-                        lc=c1;
-                        do      {
-                                ll=(r[i]+lc)&BN_MASK2;
-                                r[i++]=ll;
-                                lc=(lc > ll);
-                                } while (lc);
-                        }
-                else
-                        {
-                        lc= -c1;
-                        do      {
-                                ll=r[i];
-                                r[i++]=(ll-lc)&BN_MASK2;
-                                lc=(lc > ll);
-                                } while (lc);
-                        }
-                }
-        if (c2 != 0) /* Add starting at r[1] */
-                {
-                i=n;
-                if (c2 > 0)
-                        {
-                        lc=c2;
-                        do      {
-                                ll=(r[i]+lc)&BN_MASK2;
-                                r[i++]=ll;
-                                lc=(lc > ll);
-                                } while (lc);
-                        }
-                else
-                        {
-                        lc= -c2;
-                        do      {
-                                ll=r[i];
-                                r[i++]=(ll-lc)&BN_MASK2;
-                                lc=(lc > ll);
-                                } while (lc);
-                        }
-                }
-        }
-#endif /* BN_RECURSION */
-int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
-        {
-        int ret=0;
-        int top,al,bl;
-        BIGNUM *rr;
-#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
-        int i;
-#endif
-#ifdef BN_RECURSION
-        BIGNUM *t=NULL;
-        int j=0,k;
-#endif
-#ifdef BN_COUNT
-        fprintf(stderr,"BN_mul %d * %d\n",a->top,b->top);
-#endif
-        bn_check_top(a);
-        bn_check_top(b);
-        bn_check_top(r);
-        al=a->top;
-        bl=b->top;
-        if ((al == 0) || (bl == 0))
-                {
-                BN_zero(r);
-                return(1);
-                }
-        top=al+bl;
-        BN_CTX_start(ctx);
-        if ((r == a) || (r == b))
-                {
-                if ((rr = BN_CTX_get(ctx)) == NULL) goto err;
-                }
-        else
-                rr = r;
-        rr->neg=a->neg^b->neg;
-#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
-        i = al-bl;
-#endif
-#ifdef BN_MUL_COMBA
-        if (i == 0)
-                {
-# if 0
-                if (al == 4)
-                        {
-                        if (bn_wexpand(rr,8) == NULL) goto err;
-                        rr->top=8;
-                        bn_mul_comba4(rr->d,a->d,b->d);
-                        goto end;
-                        }
-# endif
-                if (al == 8)
-                        {
-                        if (bn_wexpand(rr,16) == NULL) goto err;
-                        rr->top=16;
-                        bn_mul_comba8(rr->d,a->d,b->d);
-                        goto end;
-                        }
-                }
-#endif /* BN_MUL_COMBA */
-#ifdef BN_RECURSION
-        if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL))
-                {
-                if (i >= -1 && i <= 1)
-                        {
-                        int sav_j =0;
-                        /* Find out the power of two lower or equal
-                           to the longest of the two numbers */
-                        if (i >= 0)
-                                {
-                                j = BN_num_bits_word((BN_ULONG)al);
-                                }
-                        if (i == -1)
-                                {
-                                j = BN_num_bits_word((BN_ULONG)bl);
-                                }
-                        sav_j = j;
-                        j = 1<<(j-1);
-                        assert(j <= al || j <= bl);
-                        k = j+j;
-                        t = BN_CTX_get(ctx);
-                        if (al > j || bl > j)
-                                {
-                                bn_wexpand(t,k*4);
-                                bn_wexpand(rr,k*4);
-                                bn_mul_part_recursive(rr->d,a->d,b->d,
-                                        j,al-j,bl-j,t->d);
-                                }
-                        else    /* al <= j || bl <= j */
-                                {
-                                bn_wexpand(t,k*2);
-                                bn_wexpand(rr,k*2);
-                                bn_mul_recursive(rr->d,a->d,b->d,
-                                        j,al-j,bl-j,t->d);
-                                }
-                        rr->top=top;
-                        goto end;
-                        }
-#if 0
-                if (i == 1 && !BN_get_flags(b,BN_FLG_STATIC_DATA))
-                        {
-                        BIGNUM *tmp_bn = (BIGNUM *)b;
-                        if (bn_wexpand(tmp_bn,al) == NULL) goto err;
-                        tmp_bn->d[bl]=0;
-                        bl++;
-                        i--;
-                        }
-                else if (i == -1 && !BN_get_flags(a,BN_FLG_STATIC_DATA))
-                        {
-                        BIGNUM *tmp_bn = (BIGNUM *)a;
-                        if (bn_wexpand(tmp_bn,bl) == NULL) goto err;
-                        tmp_bn->d[al]=0;
-                        al++;
-                        i++;
-                        }
-                if (i == 0)
-                        {
-                        /* symmetric and > 4 */
-                        /* 16 or larger */
-                        j=BN_num_bits_word((BN_ULONG)al);
-                        j=1<<(j-1);
-                        k=j+j;
-                        t = BN_CTX_get(ctx);
-                        if (al == j) /* exact multiple */
-                                {
-                                if (bn_wexpand(t,k*2) == NULL) goto err;
-                                if (bn_wexpand(rr,k*2) == NULL) goto err;
-                                bn_mul_recursive(rr->d,a->d,b->d,al,t->d);
-                                }
-                        else
-                                {
-                                if (bn_wexpand(t,k*4) == NULL) goto err;
-                                if (bn_wexpand(rr,k*4) == NULL) goto err;
-                                bn_mul_part_recursive(rr->d,a->d,b->d,al-j,j,t->d);
-                                }
-                        rr->top=top;
-                        goto end;
-                        }
-#endif
-                }
-#endif /* BN_RECURSION */
-        if (bn_wexpand(rr,top) == NULL) goto err;
-        rr->top=top;
-        bn_mul_normal(rr->d,a->d,al,b->d,bl);
-#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)
-end:
-#endif
-        bn_correct_top(rr);
-        if (r != rr) BN_copy(r,rr);
-        ret=1;
-err:
-        bn_check_top(r);
-        BN_CTX_end(ctx);
-        return(ret);
-        }
-void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
-        {
-        BN_ULONG *rr;
-#ifdef BN_COUNT
-        fprintf(stderr," bn_mul_normal %d * %d\n",na,nb);
-#endif
-        if (na < nb)
-                {
-                int itmp;
-                BN_ULONG *ltmp;
-                itmp=na; na=nb; nb=itmp;
-                ltmp=a;   a=b;   b=ltmp;
-                }
-        rr= &(r[na]);
-        if (nb <= 0)
-                {
-                (void)bn_mul_words(r,a,na,0);
-                return;
-                }
-        else
-                rr[0]=bn_mul_words(r,a,na,b[0]);
-        for (;;)
-                {
-                if (--nb <= 0) return;
-                rr[1]=bn_mul_add_words(&(r[1]),a,na,b[1]);
-                if (--nb <= 0) return;
-                rr[2]=bn_mul_add_words(&(r[2]),a,na,b[2]);
-                if (--nb <= 0) return;
-                rr[3]=bn_mul_add_words(&(r[3]),a,na,b[3]);
-                if (--nb <= 0) return;
-                rr[4]=bn_mul_add_words(&(r[4]),a,na,b[4]);
-                rr+=4;
-                r+=4;
-                b+=4;
-                }
-        }
-void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
-        {
-#ifdef BN_COUNT
-        fprintf(stderr," bn_mul_low_normal %d * %d\n",n,n);
-#endif
-        bn_mul_words(r,a,n,b[0]);
-        for (;;)
-                {
-                if (--n <= 0) return;
-                bn_mul_add_words(&(r[1]),a,n,b[1]);
-                if (--n <= 0) return;
-                bn_mul_add_words(&(r[2]),a,n,b[2]);
-                if (--n <= 0) return;
-                bn_mul_add_words(&(r[3]),a,n,b[3]);
-                if (--n <= 0) return;
-                bn_mul_add_words(&(r[4]),a,n,b[4]);
-                r+=4;
-                b+=4;
-                }
-        }
diff --git a/src/lib/libcrypto/bn/bn_nist.c b/src/lib/libcrypto/bn/bn_nist.c
deleted file mode 100644
index 2ca5b01391..0000000000
--- a/src/lib/libcrypto/bn/bn_nist.c
+++ /dev/null
@@ -1,836 +0,0 @@
-/* crypto/bn/bn_nist.c */
-/*
- * Written by Nils Larsch for the OpenSSL project
- */
-/* ====================================================================
- * Copyright (c) 1998-2005 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include "bn_lcl.h"
-#include "cryptlib.h"
-#define BN_NIST_192_TOP (192+BN_BITS2-1)/BN_BITS2
-#define BN_NIST_224_TOP (224+BN_BITS2-1)/BN_BITS2
-#define BN_NIST_256_TOP (256+BN_BITS2-1)/BN_BITS2
-#define BN_NIST_384_TOP (384+BN_BITS2-1)/BN_BITS2
-#define BN_NIST_521_TOP (521+BN_BITS2-1)/BN_BITS2
-/* pre-computed tables are "carry-less" values of modulus*(i+1) */
-#if BN_BITS2 == 64
-static const BN_ULONG _nist_p_192[][BN_NIST_192_TOP] = {
-        {0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFEULL,0xFFFFFFFFFFFFFFFFULL},
-        {0xFFFFFFFFFFFFFFFEULL,0xFFFFFFFFFFFFFFFDULL,0xFFFFFFFFFFFFFFFFULL},
-        {0xFFFFFFFFFFFFFFFDULL,0xFFFFFFFFFFFFFFFCULL,0xFFFFFFFFFFFFFFFFULL}
-        };
-static const BN_ULONG _nist_p_192_sqr[] = {
-        0x0000000000000001ULL,0x0000000000000002ULL,0x0000000000000001ULL,
-        0xFFFFFFFFFFFFFFFEULL,0xFFFFFFFFFFFFFFFDULL,0xFFFFFFFFFFFFFFFFULL
-        };
-static const BN_ULONG _nist_p_224[][BN_NIST_224_TOP] = {
-        {0x0000000000000001ULL,0xFFFFFFFF00000000ULL,
-         0xFFFFFFFFFFFFFFFFULL,0x00000000FFFFFFFFULL},
-        {0x0000000000000002ULL,0xFFFFFFFE00000000ULL,
-         0xFFFFFFFFFFFFFFFFULL,0x00000001FFFFFFFFULL} /* this one is "carry-full" */
-        };
-static const BN_ULONG _nist_p_224_sqr[] = {
-        0x0000000000000001ULL,0xFFFFFFFE00000000ULL,
-        0xFFFFFFFFFFFFFFFFULL,0x0000000200000000ULL,
-        0x0000000000000000ULL,0xFFFFFFFFFFFFFFFEULL,
-        0xFFFFFFFFFFFFFFFFULL
-        };
-static const BN_ULONG _nist_p_256[][BN_NIST_256_TOP] = {
-        {0xFFFFFFFFFFFFFFFFULL,0x00000000FFFFFFFFULL,
-         0x0000000000000000ULL,0xFFFFFFFF00000001ULL},
-        {0xFFFFFFFFFFFFFFFEULL,0x00000001FFFFFFFFULL,
-         0x0000000000000000ULL,0xFFFFFFFE00000002ULL},
-        {0xFFFFFFFFFFFFFFFDULL,0x00000002FFFFFFFFULL,
-         0x0000000000000000ULL,0xFFFFFFFD00000003ULL},
-        {0xFFFFFFFFFFFFFFFCULL,0x00000003FFFFFFFFULL,
-         0x0000000000000000ULL,0xFFFFFFFC00000004ULL},
-        {0xFFFFFFFFFFFFFFFBULL,0x00000004FFFFFFFFULL,
-         0x0000000000000000ULL,0xFFFFFFFB00000005ULL},
-        };
-static const BN_ULONG _nist_p_256_sqr[] = {
-        0x0000000000000001ULL,0xFFFFFFFE00000000ULL,
-        0xFFFFFFFFFFFFFFFFULL,0x00000001FFFFFFFEULL,
-        0x00000001FFFFFFFEULL,0x00000001FFFFFFFEULL,
-        0xFFFFFFFE00000001ULL,0xFFFFFFFE00000002ULL
-        };
-static const BN_ULONG _nist_p_384[][BN_NIST_384_TOP] = {
-        {0x00000000FFFFFFFFULL,0xFFFFFFFF00000000ULL,0xFFFFFFFFFFFFFFFEULL,
-         0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL},
-        {0x00000001FFFFFFFEULL,0xFFFFFFFE00000000ULL,0xFFFFFFFFFFFFFFFDULL,
-         0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL},
-        {0x00000002FFFFFFFDULL,0xFFFFFFFD00000000ULL,0xFFFFFFFFFFFFFFFCULL,
-         0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL},
-        {0x00000003FFFFFFFCULL,0xFFFFFFFC00000000ULL,0xFFFFFFFFFFFFFFFBULL,
-         0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL},
-        {0x00000004FFFFFFFBULL,0xFFFFFFFB00000000ULL,0xFFFFFFFFFFFFFFFAULL,
-         0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL},
-        };
-static const BN_ULONG _nist_p_384_sqr[] = {
-        0xFFFFFFFE00000001ULL,0x0000000200000000ULL,0xFFFFFFFE00000000ULL,
-        0x0000000200000000ULL,0x0000000000000001ULL,0x0000000000000000ULL,
-        0x00000001FFFFFFFEULL,0xFFFFFFFE00000000ULL,0xFFFFFFFFFFFFFFFDULL,
-        0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL
-        };
-static const BN_ULONG _nist_p_521[] =
-        {0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,
-        0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,
-        0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,
-        0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,
-        0x00000000000001FFULL};
-static const BN_ULONG _nist_p_521_sqr[] = {
-        0x0000000000000001ULL,0x0000000000000000ULL,0x0000000000000000ULL,
-        0x0000000000000000ULL,0x0000000000000000ULL,0x0000000000000000ULL,
-        0x0000000000000000ULL,0x0000000000000000ULL,0xFFFFFFFFFFFFFC00ULL,
-        0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,
-        0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,0xFFFFFFFFFFFFFFFFULL,
-        0xFFFFFFFFFFFFFFFFULL,0x000000000003FFFFULL
-        };
-#elif BN_BITS2 == 32
-static const BN_ULONG _nist_p_192[][BN_NIST_192_TOP] = {
-        {0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFE,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0xFFFFFFFE,0xFFFFFFFF,0xFFFFFFFD,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0xFFFFFFFD,0xFFFFFFFF,0xFFFFFFFC,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF}
-        };
-static const BN_ULONG _nist_p_192_sqr[] = {
-        0x00000001,0x00000000,0x00000002,0x00000000,0x00000001,0x00000000,
-        0xFFFFFFFE,0xFFFFFFFF,0xFFFFFFFD,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF
-        };
-static const BN_ULONG _nist_p_224[][BN_NIST_224_TOP] = {
-        {0x00000001,0x00000000,0x00000000,0xFFFFFFFF,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0x00000002,0x00000000,0x00000000,0xFFFFFFFE,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF}
-        };
-static const BN_ULONG _nist_p_224_sqr[] = {
-        0x00000001,0x00000000,0x00000000,0xFFFFFFFE,
-        0xFFFFFFFF,0xFFFFFFFF,0x00000000,0x00000002,
-        0x00000000,0x00000000,0xFFFFFFFE,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF
-        };
-static const BN_ULONG _nist_p_256[][BN_NIST_256_TOP] = {
-        {0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0x00000000,
-         0x00000000,0x00000000,0x00000001,0xFFFFFFFF},
-        {0xFFFFFFFE,0xFFFFFFFF,0xFFFFFFFF,0x00000001,
-         0x00000000,0x00000000,0x00000002,0xFFFFFFFE},
-        {0xFFFFFFFD,0xFFFFFFFF,0xFFFFFFFF,0x00000002,
-         0x00000000,0x00000000,0x00000003,0xFFFFFFFD},
-        {0xFFFFFFFC,0xFFFFFFFF,0xFFFFFFFF,0x00000003,
-         0x00000000,0x00000000,0x00000004,0xFFFFFFFC},
-        {0xFFFFFFFB,0xFFFFFFFF,0xFFFFFFFF,0x00000004,
-         0x00000000,0x00000000,0x00000005,0xFFFFFFFB},
-        };
-static const BN_ULONG _nist_p_256_sqr[] = {
-        0x00000001,0x00000000,0x00000000,0xFFFFFFFE,
-        0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFE,0x00000001,
-        0xFFFFFFFE,0x00000001,0xFFFFFFFE,0x00000001,
-        0x00000001,0xFFFFFFFE,0x00000002,0xFFFFFFFE
-        };
-static const BN_ULONG _nist_p_384[][BN_NIST_384_TOP] = {
-        {0xFFFFFFFF,0x00000000,0x00000000,0xFFFFFFFF,0xFFFFFFFE,0xFFFFFFFF,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0xFFFFFFFE,0x00000001,0x00000000,0xFFFFFFFE,0xFFFFFFFD,0xFFFFFFFF,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0xFFFFFFFD,0x00000002,0x00000000,0xFFFFFFFD,0xFFFFFFFC,0xFFFFFFFF,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0xFFFFFFFC,0x00000003,0x00000000,0xFFFFFFFC,0xFFFFFFFB,0xFFFFFFFF,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        {0xFFFFFFFB,0x00000004,0x00000000,0xFFFFFFFB,0xFFFFFFFA,0xFFFFFFFF,
-         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF},
-        };
-static const BN_ULONG _nist_p_384_sqr[] = {
-        0x00000001,0xFFFFFFFE,0x00000000,0x00000002,0x00000000,0xFFFFFFFE,
-        0x00000000,0x00000002,0x00000001,0x00000000,0x00000000,0x00000000,
-        0xFFFFFFFE,0x00000001,0x00000000,0xFFFFFFFE,0xFFFFFFFD,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF
-        };
-static const BN_ULONG _nist_p_521[] = {0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
-        0xFFFFFFFF,0x000001FF};
-static const BN_ULONG _nist_p_521_sqr[] = {
-        0x00000001,0x00000000,0x00000000,0x00000000,0x00000000,0x00000000,
-        0x00000000,0x00000000,0x00000000,0x00000000,0x00000000,0x00000000,
-        0x00000000,0x00000000,0x00000000,0x00000000,0xFFFFFC00,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
-        0xFFFFFFFF,0xFFFFFFFF,0x0003FFFF
-        };
-#else
-#error "unsupported BN_BITS2"
-#endif
-static const BIGNUM _bignum_nist_p_192 =
-        {
-        (BN_ULONG *)_nist_p_192[0],
-        BN_NIST_192_TOP,
-        BN_NIST_192_TOP,
-        0,
-        BN_FLG_STATIC_DATA
-        };
-static const BIGNUM _bignum_nist_p_224 =
-        {
-        (BN_ULONG *)_nist_p_224[0],
-        BN_NIST_224_TOP,
-        BN_NIST_224_TOP,
-        0,
-        BN_FLG_STATIC_DATA
-        };
-static const BIGNUM _bignum_nist_p_256 =
-        {
-        (BN_ULONG *)_nist_p_256[0],
-        BN_NIST_256_TOP,
-        BN_NIST_256_TOP,
-        0,
-        BN_FLG_STATIC_DATA
-        };
-static const BIGNUM _bignum_nist_p_384 =
-        {
-        (BN_ULONG *)_nist_p_384[0],
-        BN_NIST_384_TOP,
-        BN_NIST_384_TOP,
-        0,
-        BN_FLG_STATIC_DATA
-        };
-static const BIGNUM _bignum_nist_p_521 =
-        {
-        (BN_ULONG *)_nist_p_521,
-        BN_NIST_521_TOP,
-        BN_NIST_521_TOP,
-        0,
-        BN_FLG_STATIC_DATA
-        };
-const BIGNUM *BN_get0_nist_prime_192(void)
-        {
-        return &_bignum_nist_p_192;
-        }
-const BIGNUM *BN_get0_nist_prime_224(void)
-        {
-        return &_bignum_nist_p_224;
-        }
-const BIGNUM *BN_get0_nist_prime_256(void)
-        {
-        return &_bignum_nist_p_256;
-        }
-const BIGNUM *BN_get0_nist_prime_384(void)
-        {
-        return &_bignum_nist_p_384;
-        }
-const BIGNUM *BN_get0_nist_prime_521(void)
-        {
-        return &_bignum_nist_p_521;
-        }
-static void nist_cp_bn_0(BN_ULONG *buf, BN_ULONG *a, int top, int max)
-        {
-        int i;
-        BN_ULONG *_tmp1 = (buf), *_tmp2 = (a);
-#ifdef BN_DEBUG
-        OPENSSL_assert(top <= max);
-#endif
-        for (i = (top); i != 0; i--)
-                *_tmp1++ = *_tmp2++;
-        for (i = (max) - (top); i != 0; i--)
-                *_tmp1++ = (BN_ULONG) 0;
-        }
-static void nist_cp_bn(BN_ULONG *buf, BN_ULONG *a, int top)
-        { 
-        int i;
-        BN_ULONG *_tmp1 = (buf), *_tmp2 = (a);
-        for (i = (top); i != 0; i--)
-                *_tmp1++ = *_tmp2++;
-        }
-#if BN_BITS2 == 64
-#define bn_cp_64(to, n, from, m)        (to)[n] = (m>=0)?((from)[m]):0;
-#define bn_64_set_0(to, n)              (to)[n] = (BN_ULONG)0;
-/*
- * two following macros are implemented under assumption that they
- * are called in a sequence with *ascending* n, i.e. as they are...
- */
-#define bn_cp_32_naked(to, n, from, m)  (((n)&1)?(to[(n)/2]|=((m)&1)?(from[(m)/2]&BN_MASK2h):(from[(m)/2]<<32))\
-                                                :(to[(n)/2] =((m)&1)?(from[(m)/2]>>32):(from[(m)/2]&BN_MASK2l)))
-#define bn_32_set_0(to, n)              (((n)&1)?(to[(n)/2]&=BN_MASK2l):(to[(n)/2]=0));
-#define bn_cp_32(to,n,from,m)           ((m)>=0)?bn_cp_32_naked(to,n,from,m):bn_32_set_0(to,n)
-#else
-#define bn_cp_64(to, n, from, m) \
-        { \
-        bn_cp_32(to, (n)*2, from, (m)*2); \
-        bn_cp_32(to, (n)*2+1, from, (m)*2+1); \
-        }
-#define bn_64_set_0(to, n) \
-        { \
-        bn_32_set_0(to, (n)*2); \
-        bn_32_set_0(to, (n)*2+1); \
-        }
-#if BN_BITS2 == 32
-#define bn_cp_32(to, n, from, m)        (to)[n] = (m>=0)?((from)[m]):0;
-#define bn_32_set_0(to, n)              (to)[n] = (BN_ULONG)0;
-#endif
-#endif /* BN_BITS2 != 64 */
-#define nist_set_192(to, from, a1, a2, a3) \
-        { \
-        bn_cp_64(to, 0, from, (a3) - 3) \
-        bn_cp_64(to, 1, from, (a2) - 3) \
-        bn_cp_64(to, 2, from, (a1) - 3) \
-        }
-int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
-        BN_CTX *ctx)
-        {
-        int      top = a->top, i;
-        int      carry;
-        register BN_ULONG *r_d, *a_d = a->d;
-        BN_ULONG t_d[BN_NIST_192_TOP],
-                 buf[BN_NIST_192_TOP],
-                 c_d[BN_NIST_192_TOP],
-                *res;
-        size_t   mask;
-        static const BIGNUM _bignum_nist_p_192_sqr = {
-                (BN_ULONG *)_nist_p_192_sqr,
-                sizeof(_nist_p_192_sqr)/sizeof(_nist_p_192_sqr[0]),
-                sizeof(_nist_p_192_sqr)/sizeof(_nist_p_192_sqr[0]),
-                0,BN_FLG_STATIC_DATA };
-        field = &_bignum_nist_p_192; /* just to make sure */
-        if (BN_is_negative(a) || BN_ucmp(a,&_bignum_nist_p_192_sqr)>=0)
-                return BN_nnmod(r, a, field, ctx);
-        i = BN_ucmp(field, a);
-        if (i == 0)
-                {
-                BN_zero(r);
-                return 1;
-                }
-        else if (i > 0)
-                return (r == a) ? 1 : (BN_copy(r ,a) != NULL);
-        if (r != a)
-                {
-                if (!bn_wexpand(r, BN_NIST_192_TOP))
-                        return 0;
-                r_d = r->d;
-                nist_cp_bn(r_d, a_d, BN_NIST_192_TOP);
-                }
-        else
-                r_d = a_d;
-        nist_cp_bn_0(buf, a_d + BN_NIST_192_TOP, top - BN_NIST_192_TOP, BN_NIST_192_TOP);
-        nist_set_192(t_d, buf, 0, 3, 3);
-        carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
-        nist_set_192(t_d, buf, 4, 4, 0);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
-        nist_set_192(t_d, buf, 5, 5, 5)
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP);
-        if (carry > 0)
-                carry = (int)bn_sub_words(r_d,r_d,_nist_p_192[carry-1],BN_NIST_192_TOP);
-        else
-                carry = 1;
-        /*
-         * we need 'if (carry==0 || result>=modulus) result-=modulus;'
-         * as comparison implies subtraction, we can write
-         * 'tmp=result-modulus; if (!carry || !borrow) result=tmp;'
-         * this is what happens below, but without explicit if:-) a.
-         */
-        mask  = 0-(size_t)bn_sub_words(c_d,r_d,_nist_p_192[0],BN_NIST_192_TOP);
-        mask &= 0-(size_t)carry;
-        res   = (BN_ULONG *)(((size_t)c_d&~mask) | ((size_t)r_d&mask));
-        nist_cp_bn(r_d, res, BN_NIST_192_TOP);
-        r->top = BN_NIST_192_TOP;
-        bn_correct_top(r);
-        return 1;
-        }
-typedef BN_ULONG (*bn_addsub_f)(BN_ULONG *,const BN_ULONG *,const BN_ULONG *,int);
-#define nist_set_224(to, from, a1, a2, a3, a4, a5, a6, a7) \
-        { \
-        bn_cp_32(to, 0, from, (a7) - 7) \
-        bn_cp_32(to, 1, from, (a6) - 7) \
-        bn_cp_32(to, 2, from, (a5) - 7) \
-        bn_cp_32(to, 3, from, (a4) - 7) \
-        bn_cp_32(to, 4, from, (a3) - 7) \
-        bn_cp_32(to, 5, from, (a2) - 7) \
-        bn_cp_32(to, 6, from, (a1) - 7) \
-        }
-int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
-        BN_CTX *ctx)
-        {
-        int     top = a->top, i;
-        int     carry;
-        BN_ULONG *r_d, *a_d = a->d;
-        BN_ULONG t_d[BN_NIST_224_TOP],
-                 buf[BN_NIST_224_TOP],
-                 c_d[BN_NIST_224_TOP],
-                *res;
-        size_t   mask;
-        union { bn_addsub_f f; size_t p; } u;
-        static const BIGNUM _bignum_nist_p_224_sqr = {
-                (BN_ULONG *)_nist_p_224_sqr,
-                sizeof(_nist_p_224_sqr)/sizeof(_nist_p_224_sqr[0]),
-                sizeof(_nist_p_224_sqr)/sizeof(_nist_p_224_sqr[0]),
-                0,BN_FLG_STATIC_DATA };
-        field = &_bignum_nist_p_224; /* just to make sure */
-        if (BN_is_negative(a) || BN_ucmp(a,&_bignum_nist_p_224_sqr)>=0)
-                return BN_nnmod(r, a, field, ctx);
-        i = BN_ucmp(field, a);
-        if (i == 0)
-                {
-                BN_zero(r);
-                return 1;
-                }
-        else if (i > 0)
-                return (r == a)? 1 : (BN_copy(r ,a) != NULL);
-        if (r != a)
-                {
-                if (!bn_wexpand(r, BN_NIST_224_TOP))
-                        return 0;
-                r_d = r->d;
-                nist_cp_bn(r_d, a_d, BN_NIST_224_TOP);
-                }
-        else
-                r_d = a_d;
-#if BN_BITS2==64
-        /* copy upper 256 bits of 448 bit number ... */
-        nist_cp_bn_0(t_d, a_d + (BN_NIST_224_TOP-1), top - (BN_NIST_224_TOP-1), BN_NIST_224_TOP);
-        /* ... and right shift by 32 to obtain upper 224 bits */
-        nist_set_224(buf, t_d, 14, 13, 12, 11, 10, 9, 8);
-        /* truncate lower part to 224 bits too */
-        r_d[BN_NIST_224_TOP-1] &= BN_MASK2l;
-#else
-        nist_cp_bn_0(buf, a_d + BN_NIST_224_TOP, top - BN_NIST_224_TOP, BN_NIST_224_TOP);
-#endif
-        nist_set_224(t_d, buf, 10, 9, 8, 7, 0, 0, 0);
-        carry = (int)bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP);
-        nist_set_224(t_d, buf, 0, 13, 12, 11, 0, 0, 0);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP);
-        nist_set_224(t_d, buf, 13, 12, 11, 10, 9, 8, 7);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP);
-        nist_set_224(t_d, buf, 0, 0, 0, 0, 13, 12, 11);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP);
-#if BN_BITS2==64
-        carry = (int)(r_d[BN_NIST_224_TOP-1]>>32);
-#endif
-        u.f = bn_sub_words;
-        if (carry > 0)
-                {
-                carry = (int)bn_sub_words(r_d,r_d,_nist_p_224[carry-1],BN_NIST_224_TOP);
-#if BN_BITS2==64
-                carry=(int)(~(r_d[BN_NIST_224_TOP-1]>>32))&1;
-#endif
-                }
-        else if (carry < 0)
-                {
-                /* it's a bit more comlicated logic in this case.
-                 * if bn_add_words yields no carry, then result
-                 * has to be adjusted by unconditionally *adding*
-                 * the modulus. but if it does, then result has
-                 * to be compared to the modulus and conditionally
-                 * adjusted by *subtracting* the latter. */
-                carry = (int)bn_add_words(r_d,r_d,_nist_p_224[-carry-1],BN_NIST_224_TOP);
-                mask = 0-(size_t)carry;
-                u.p = ((size_t)bn_sub_words&mask) | ((size_t)bn_add_words&~mask);
-                }
-        else
-                carry = 1;
-        /* otherwise it's effectively same as in BN_nist_mod_192... */
-        mask  = 0-(size_t)(*u.f)(c_d,r_d,_nist_p_224[0],BN_NIST_224_TOP);
-        mask &= 0-(size_t)carry;
-        res   = (BN_ULONG *)(((size_t)c_d&~mask) | ((size_t)r_d&mask));
-        nist_cp_bn(r_d, res, BN_NIST_224_TOP);
-        r->top = BN_NIST_224_TOP;
-        bn_correct_top(r);
-        return 1;
-        }
-#define nist_set_256(to, from, a1, a2, a3, a4, a5, a6, a7, a8) \
-        { \
-        bn_cp_32(to, 0, from, (a8) - 8) \
-        bn_cp_32(to, 1, from, (a7) - 8) \
-        bn_cp_32(to, 2, from, (a6) - 8) \
-        bn_cp_32(to, 3, from, (a5) - 8) \
-        bn_cp_32(to, 4, from, (a4) - 8) \
-        bn_cp_32(to, 5, from, (a3) - 8) \
-        bn_cp_32(to, 6, from, (a2) - 8) \
-        bn_cp_32(to, 7, from, (a1) - 8) \
-        }
-int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
-        BN_CTX *ctx)
-        {
-        int     i, top = a->top;
-        int     carry = 0;
-        register BN_ULONG *a_d = a->d, *r_d;
-        BN_ULONG t_d[BN_NIST_256_TOP],
-                 buf[BN_NIST_256_TOP],
-                 c_d[BN_NIST_256_TOP],
-                *res;
-        size_t   mask;
-        union { bn_addsub_f f; size_t p; } u;
-        static const BIGNUM _bignum_nist_p_256_sqr = {
-                (BN_ULONG *)_nist_p_256_sqr,
-                sizeof(_nist_p_256_sqr)/sizeof(_nist_p_256_sqr[0]),
-                sizeof(_nist_p_256_sqr)/sizeof(_nist_p_256_sqr[0]),
-                0,BN_FLG_STATIC_DATA };
-        field = &_bignum_nist_p_256; /* just to make sure */
-        if (BN_is_negative(a) || BN_ucmp(a,&_bignum_nist_p_256_sqr)>=0)
-                return BN_nnmod(r, a, field, ctx);
-        i = BN_ucmp(field, a);
-        if (i == 0)
-                {
-                BN_zero(r);
-                return 1;
-                }
-        else if (i > 0)
-                return (r == a)? 1 : (BN_copy(r ,a) != NULL);
-        if (r != a)
-                {
-                if (!bn_wexpand(r, BN_NIST_256_TOP))
-                        return 0;
-                r_d = r->d;
-                nist_cp_bn(r_d, a_d, BN_NIST_256_TOP);
-                }
-        else
-                r_d = a_d;
-        nist_cp_bn_0(buf, a_d + BN_NIST_256_TOP, top - BN_NIST_256_TOP, BN_NIST_256_TOP);
-        /*S1*/
-        nist_set_256(t_d, buf, 15, 14, 13, 12, 11, 0, 0, 0);
-        /*S2*/
-        nist_set_256(c_d, buf, 0, 15, 14, 13, 12, 0, 0, 0);
-        carry = (int)bn_add_words(t_d, t_d, c_d, BN_NIST_256_TOP);
-        /* left shift */
-                {
-                register BN_ULONG *ap,t,c;
-                ap = t_d;
-                c=0;
-                for (i = BN_NIST_256_TOP; i != 0; --i)
-                        {
-                        t= *ap;
-                        *(ap++)=((t<<1)|c)&BN_MASK2;
-                        c=(t & BN_TBIT)?1:0;
-                        }
-                carry <<= 1;
-                carry  |= c;
-                }
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /*S3*/
-        nist_set_256(t_d, buf, 15, 14, 0, 0, 0, 10, 9, 8);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /*S4*/
-        nist_set_256(t_d, buf, 8, 13, 15, 14, 13, 11, 10, 9);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /*D1*/
-        nist_set_256(t_d, buf, 10, 8, 0, 0, 0, 13, 12, 11);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /*D2*/
-        nist_set_256(t_d, buf, 11, 9, 0, 0, 15, 14, 13, 12);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /*D3*/
-        nist_set_256(t_d, buf, 12, 0, 10, 9, 8, 15, 14, 13);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /*D4*/
-        nist_set_256(t_d, buf, 13, 0, 11, 10, 9, 0, 15, 14);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP);
-        /* see BN_nist_mod_224 for explanation */
-        u.f = bn_sub_words;
-        if (carry > 0)
-                carry = (int)bn_sub_words(r_d,r_d,_nist_p_256[carry-1],BN_NIST_256_TOP);
-        else if (carry < 0)
-                {
-                carry = (int)bn_add_words(r_d,r_d,_nist_p_256[-carry-1],BN_NIST_256_TOP);
-                mask = 0-(size_t)carry;
-                u.p = ((size_t)bn_sub_words&mask) | ((size_t)bn_add_words&~mask);
-                }
-        else
-                carry = 1;
-        mask  = 0-(size_t)(*u.f)(c_d,r_d,_nist_p_256[0],BN_NIST_256_TOP);
-        mask &= 0-(size_t)carry;
-        res   = (BN_ULONG *)(((size_t)c_d&~mask) | ((size_t)r_d&mask));
-        nist_cp_bn(r_d, res, BN_NIST_256_TOP);
-        r->top = BN_NIST_256_TOP;
-        bn_correct_top(r);
-        return 1;
-        }
-#define nist_set_384(to,from,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12) \
-        { \
-        bn_cp_32(to, 0, from,  (a12) - 12) \
-        bn_cp_32(to, 1, from,  (a11) - 12) \
-        bn_cp_32(to, 2, from,  (a10) - 12) \
-        bn_cp_32(to, 3, from,  (a9) - 12)  \
-        bn_cp_32(to, 4, from,  (a8) - 12)  \
-        bn_cp_32(to, 5, from,  (a7) - 12)  \
-        bn_cp_32(to, 6, from,  (a6) - 12)  \
-        bn_cp_32(to, 7, from,  (a5) - 12)  \
-        bn_cp_32(to, 8, from,  (a4) - 12)  \
-        bn_cp_32(to, 9, from,  (a3) - 12)  \
-        bn_cp_32(to, 10, from, (a2) - 12)  \
-        bn_cp_32(to, 11, from, (a1) - 12)  \
-        }
-int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
-        BN_CTX *ctx)
-        {
-        int     i, top = a->top;
-        int     carry = 0;
-        register BN_ULONG *r_d, *a_d = a->d;
-        BN_ULONG t_d[BN_NIST_384_TOP],
-                 buf[BN_NIST_384_TOP],
-                 c_d[BN_NIST_384_TOP],
-                *res;
-        size_t   mask;
-        union { bn_addsub_f f; size_t p; } u;
-        static const BIGNUM _bignum_nist_p_384_sqr = {
-                (BN_ULONG *)_nist_p_384_sqr,
-                sizeof(_nist_p_384_sqr)/sizeof(_nist_p_384_sqr[0]),
-                sizeof(_nist_p_384_sqr)/sizeof(_nist_p_384_sqr[0]),
-                0,BN_FLG_STATIC_DATA };
-        field = &_bignum_nist_p_384; /* just to make sure */
-        if (BN_is_negative(a) || BN_ucmp(a,&_bignum_nist_p_384_sqr)>=0)
-                return BN_nnmod(r, a, field, ctx);
-        i = BN_ucmp(field, a);
-        if (i == 0)
-                {
-                BN_zero(r);
-                return 1;
-                }
-        else if (i > 0)
-                return (r == a)? 1 : (BN_copy(r ,a) != NULL);
-        if (r != a)
-                {
-                if (!bn_wexpand(r, BN_NIST_384_TOP))
-                        return 0;
-                r_d = r->d;
-                nist_cp_bn(r_d, a_d, BN_NIST_384_TOP);
-                }
-        else
-                r_d = a_d;
-        nist_cp_bn_0(buf, a_d + BN_NIST_384_TOP, top - BN_NIST_384_TOP, BN_NIST_384_TOP);
-        /*S1*/
-        nist_set_256(t_d, buf, 0, 0, 0, 0, 0, 23-4, 22-4, 21-4);
-                /* left shift */
-                {
-                register BN_ULONG *ap,t,c;
-                ap = t_d;
-                c=0;
-                for (i = 3; i != 0; --i)
-                        {
-                        t= *ap;
-                        *(ap++)=((t<<1)|c)&BN_MASK2;
-                        c=(t & BN_TBIT)?1:0;
-                        }
-                *ap=c;
-                }
-        carry = (int)bn_add_words(r_d+(128/BN_BITS2), r_d+(128/BN_BITS2), 
-                t_d, BN_NIST_256_TOP);
-        /*S2 */
-        carry += (int)bn_add_words(r_d, r_d, buf, BN_NIST_384_TOP);
-        /*S3*/
-        nist_set_384(t_d,buf,20,19,18,17,16,15,14,13,12,23,22,21);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /*S4*/
-        nist_set_384(t_d,buf,19,18,17,16,15,14,13,12,20,0,23,0);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /*S5*/
-        nist_set_384(t_d, buf,0,0,0,0,23,22,21,20,0,0,0,0);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /*S6*/
-        nist_set_384(t_d,buf,0,0,0,0,0,0,23,22,21,0,0,20);
-        carry += (int)bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /*D1*/
-        nist_set_384(t_d,buf,22,21,20,19,18,17,16,15,14,13,12,23);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /*D2*/
-        nist_set_384(t_d,buf,0,0,0,0,0,0,0,23,22,21,20,0);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /*D3*/
-        nist_set_384(t_d,buf,0,0,0,0,0,0,0,23,23,0,0,0);
-        carry -= (int)bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP);
-        /* see BN_nist_mod_224 for explanation */
-        u.f = bn_sub_words;
-        if (carry > 0)
-                carry = (int)bn_sub_words(r_d,r_d,_nist_p_384[carry-1],BN_NIST_384_TOP);
-        else if (carry < 0)
-                {
-                carry = (int)bn_add_words(r_d,r_d,_nist_p_384[-carry-1],BN_NIST_384_TOP);
-                mask = 0-(size_t)carry;
-                u.p = ((size_t)bn_sub_words&mask) | ((size_t)bn_add_words&~mask);
-                }
-        else
-                carry = 1;
-        mask  = 0-(size_t)(*u.f)(c_d,r_d,_nist_p_384[0],BN_NIST_384_TOP);
-        mask &= 0-(size_t)carry;
-        res   = (BN_ULONG *)(((size_t)c_d&~mask) | ((size_t)r_d&mask));
-        nist_cp_bn(r_d, res, BN_NIST_384_TOP);
-        r->top = BN_NIST_384_TOP;
-        bn_correct_top(r);
-        return 1;
-        }
-#define BN_NIST_521_RSHIFT      (521%BN_BITS2)
-#define BN_NIST_521_LSHIFT      (BN_BITS2-BN_NIST_521_RSHIFT)
-#define BN_NIST_521_TOP_MASK    ((BN_ULONG)BN_MASK2>>BN_NIST_521_LSHIFT)
-int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
-        BN_CTX *ctx)
-        {
-        int     top = a->top, i;
-        BN_ULONG *r_d, *a_d = a->d,
-                 t_d[BN_NIST_521_TOP],
-                 val,tmp,*res;
-        size_t  mask;
-        static const BIGNUM _bignum_nist_p_521_sqr = {
-                (BN_ULONG *)_nist_p_521_sqr,
-                sizeof(_nist_p_521_sqr)/sizeof(_nist_p_521_sqr[0]),
-                sizeof(_nist_p_521_sqr)/sizeof(_nist_p_521_sqr[0]),
-                0,BN_FLG_STATIC_DATA };
-        field = &_bignum_nist_p_521; /* just to make sure */
-        if (BN_is_negative(a) || BN_ucmp(a,&_bignum_nist_p_521_sqr)>=0)
-                return BN_nnmod(r, a, field, ctx);
-        i = BN_ucmp(field, a);
-        if (i == 0)
-                {
-                BN_zero(r);
-                return 1;
-                }
-        else if (i > 0)
-                return (r == a)? 1 : (BN_copy(r ,a) != NULL);
-        if (r != a)
-                {
-                if (!bn_wexpand(r,BN_NIST_521_TOP))
-                        return 0;
-                r_d = r->d;
-                nist_cp_bn(r_d,a_d, BN_NIST_521_TOP);
-                }
-        else
-                r_d = a_d;
-        /* upper 521 bits, copy ... */
-        nist_cp_bn_0(t_d,a_d + (BN_NIST_521_TOP-1), top - (BN_NIST_521_TOP-1),BN_NIST_521_TOP);
-        /* ... and right shift */
-        for (val=t_d[0],i=0; i<BN_NIST_521_TOP-1; i++)
-                {
-                tmp = val>>BN_NIST_521_RSHIFT;
-                val = t_d[i+1];
-                t_d[i] = (tmp | val<<BN_NIST_521_LSHIFT) & BN_MASK2;
-                }
-        t_d[i] = val>>BN_NIST_521_RSHIFT;
-        /* lower 521 bits */
-        r_d[i] &= BN_NIST_521_TOP_MASK;
-        bn_add_words(r_d,r_d,t_d,BN_NIST_521_TOP);
-        mask = 0-(size_t)bn_sub_words(t_d,r_d,_nist_p_521,BN_NIST_521_TOP);
-        res  = (BN_ULONG *)(((size_t)t_d&~mask) | ((size_t)r_d&mask));
-        nist_cp_bn(r_d,res,BN_NIST_521_TOP);
-        r->top = BN_NIST_521_TOP;
-        bn_correct_top(r);
-        return 1;
-        }
diff --git a/src/lib/libcrypto/bn/bn_prime.c b/src/lib/libcrypto/bn/bn_prime.c
deleted file mode 100644
index 7b25979dd1..0000000000
--- a/src/lib/libcrypto/bn/bn_prime.c
+++ /dev/null
@@ -1,494 +0,0 @@
-/* crypto/bn/bn_prime.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2001 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include <stdio.h>
-#include <time.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#include <openssl/rand.h>
-/* NB: these functions have been "upgraded", the deprecated versions (which are
- * compatibility wrappers using these functions) are in bn_depr.c.
- * - Geoff
- */
-/* The quick sieve algorithm approach to weeding out primes is
- * Philip Zimmermann's, as implemented in PGP.  I have had a read of
- * his comments and implemented my own version.
- */
-#include "bn_prime.h"
-static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
-        const BIGNUM *a1_odd, int k, BN_CTX *ctx, BN_MONT_CTX *mont);
-static int probable_prime(BIGNUM *rnd, int bits);
-static int probable_prime_dh(BIGNUM *rnd, int bits,
-        const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
-static int probable_prime_dh_safe(BIGNUM *rnd, int bits,
-        const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
-int BN_GENCB_call(BN_GENCB *cb, int a, int b)
-        {
-        /* No callback means continue */
-        if(!cb) return 1;
-        switch(cb->ver)
-                {
-        case 1:
-                /* Deprecated-style callbacks */
-                if(!cb->cb.cb_1)
-                        return 1;
-                cb->cb.cb_1(a, b, cb->arg);
-                return 1;
-        case 2:
-                /* New-style callbacks */
-                return cb->cb.cb_2(a, b, cb);
-        default:
-                break;
-                }
-        /* Unrecognised callback type */
-        return 0;
-        }
-int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
-        const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
-        {
-        BIGNUM *t;
-        int found=0;
-        int i,j,c1=0;
-        BN_CTX *ctx;
-        int checks = BN_prime_checks_for_size(bits);
-        ctx=BN_CTX_new();
-        if (ctx == NULL) goto err;
-        BN_CTX_start(ctx);
-        t = BN_CTX_get(ctx);
-        if(!t) goto err;
-loop: 
-        /* make a random number and set the top and bottom bits */
-        if (add == NULL)
-                {
-                if (!probable_prime(ret,bits)) goto err;
-                }
-        else
-                {
-                if (safe)
-                        {
-                        if (!probable_prime_dh_safe(ret,bits,add,rem,ctx))
-                                 goto err;
-                        }
-                else
-                        {
-                        if (!probable_prime_dh(ret,bits,add,rem,ctx))
-                                goto err;
-                        }
-                }
-        /* if (BN_mod_word(ret,(BN_ULONG)3) == 1) goto loop; */
-        if(!BN_GENCB_call(cb, 0, c1++))
-                /* aborted */
-                goto err;
-        if (!safe)
-                {
-                i=BN_is_prime_fasttest_ex(ret,checks,ctx,0,cb);
-                if (i == -1) goto err;
-                if (i == 0) goto loop;
-                }
-        else
-                {
-                /* for "safe prime" generation,
-                 * check that (p-1)/2 is prime.
-                 * Since a prime is odd, We just
-                 * need to divide by 2 */
-                if (!BN_rshift1(t,ret)) goto err;
-                for (i=0; i<checks; i++)
-                        {
-                        j=BN_is_prime_fasttest_ex(ret,1,ctx,0,cb);
-                        if (j == -1) goto err;
-                        if (j == 0) goto loop;
-                        j=BN_is_prime_fasttest_ex(t,1,ctx,0,cb);
-                        if (j == -1) goto err;
-                        if (j == 0) goto loop;
-                        if(!BN_GENCB_call(cb, 2, c1-1))
-                                goto err;
-                        /* We have a safe prime test pass */
-                        }
-                }
-        /* we have a prime :-) */
-        found = 1;
-err:
-        if (ctx != NULL)
-                {
-                BN_CTX_end(ctx);
-                BN_CTX_free(ctx);
-                }
-        bn_check_top(ret);
-        return found;
-        }
-int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
-        {
-        return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
-        }
-int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
-                int do_trial_division, BN_GENCB *cb)
-        {
-        int i, j, ret = -1;
-        int k;
-        BN_CTX *ctx = NULL;
-        BIGNUM *A1, *A1_odd, *check; /* taken from ctx */
-        BN_MONT_CTX *mont = NULL;
-        const BIGNUM *A = NULL;
-        if (BN_cmp(a, BN_value_one()) <= 0)
-                return 0;
-        
-        if (checks == BN_prime_checks)
-                checks = BN_prime_checks_for_size(BN_num_bits(a));
-        /* first look for small factors */
-        if (!BN_is_odd(a))
-                /* a is even => a is prime if and only if a == 2 */
-                return BN_is_word(a, 2);
-        if (do_trial_division)
-                {
-                for (i = 1; i < NUMPRIMES; i++)
-                        if (BN_mod_word(a, primes[i]) == 0) 
-                                return 0;
-                if(!BN_GENCB_call(cb, 1, -1))
-                        goto err;
-                }
-        if (ctx_passed != NULL)
-                ctx = ctx_passed;
-        else
-                if ((ctx=BN_CTX_new()) == NULL)
-                        goto err;
-        BN_CTX_start(ctx);
-        /* A := abs(a) */
-        if (a->neg)
-                {
-                BIGNUM *t;
-                if ((t = BN_CTX_get(ctx)) == NULL) goto err;
-                BN_copy(t, a);
-                t->neg = 0;
-                A = t;
-                }
-        else
-                A = a;
-        A1 = BN_CTX_get(ctx);
-        A1_odd = BN_CTX_get(ctx);
-        check = BN_CTX_get(ctx);
-        if (check == NULL) goto err;
-        /* compute A1 := A - 1 */
-        if (!BN_copy(A1, A))
-                goto err;
-        if (!BN_sub_word(A1, 1))
-                goto err;
-        if (BN_is_zero(A1))
-                {
-                ret = 0;
-                goto err;
-                }
-        /* write  A1  as  A1_odd * 2^k */
-        k = 1;
-        while (!BN_is_bit_set(A1, k))
-                k++;
-        if (!BN_rshift(A1_odd, A1, k))
-                goto err;
-        /* Montgomery setup for computations mod A */
-        mont = BN_MONT_CTX_new();
-        if (mont == NULL)
-                goto err;
-        if (!BN_MONT_CTX_set(mont, A, ctx))
-                goto err;
-        
-        for (i = 0; i < checks; i++)
-                {
-                if (!BN_pseudo_rand_range(check, A1))
-                        goto err;
-                if (!BN_add_word(check, 1))
-                        goto err;
-                /* now 1 <= check < A */
-                j = witness(check, A, A1, A1_odd, k, ctx, mont);
-                if (j == -1) goto err;
-                if (j)
-                        {
-                        ret=0;
-                        goto err;
-                        }
-                if(!BN_GENCB_call(cb, 1, i))
-                        goto err;
-                }
-        ret=1;
-err:
-        if (ctx != NULL)
-                {
-                BN_CTX_end(ctx);
-                if (ctx_passed == NULL)
-                        BN_CTX_free(ctx);
-                }
-        if (mont != NULL)
-                BN_MONT_CTX_free(mont);
-        return(ret);
-        }
-static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
-        const BIGNUM *a1_odd, int k, BN_CTX *ctx, BN_MONT_CTX *mont)
-        {
-        if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
-                return -1;
-        if (BN_is_one(w))
-                return 0; /* probably prime */
-        if (BN_cmp(w, a1) == 0)
-                return 0; /* w == -1 (mod a),  'a' is probably prime */
-        while (--k)
-                {
-                if (!BN_mod_mul(w, w, w, a, ctx)) /* w := w^2 mod a */
-                        return -1;
-                if (BN_is_one(w))
-                        return 1; /* 'a' is composite, otherwise a previous 'w' would
-                                   * have been == -1 (mod 'a') */
-                if (BN_cmp(w, a1) == 0)
-                        return 0; /* w == -1 (mod a), 'a' is probably prime */
-                }
-        /* If we get here, 'w' is the (a-1)/2-th power of the original 'w',
-         * and it is neither -1 nor +1 -- so 'a' cannot be prime */
-        bn_check_top(w);
-        return 1;
-        }
-static int probable_prime(BIGNUM *rnd, int bits)
-        {
-        int i;
-        prime_t mods[NUMPRIMES];
-        BN_ULONG delta,maxdelta;
-again:
-        if (!BN_rand(rnd,bits,1,1)) return(0);
-        /* we now have a random number 'rand' to test. */
-        for (i=1; i<NUMPRIMES; i++)
-                mods[i]=(prime_t)BN_mod_word(rnd,(BN_ULONG)primes[i]);
-        maxdelta=BN_MASK2 - primes[NUMPRIMES-1];
-        delta=0;
-        loop: for (i=1; i<NUMPRIMES; i++)
-                {
-                /* check that rnd is not a prime and also
-                 * that gcd(rnd-1,primes) == 1 (except for 2) */
-                if (((mods[i]+delta)%primes[i]) <= 1)
-                        {
-                        delta+=2;
-                        if (delta > maxdelta) goto again;
-                        goto loop;
-                        }
-                }
-        if (!BN_add_word(rnd,delta)) return(0);
-        bn_check_top(rnd);
-        return(1);
-        }
-static int probable_prime_dh(BIGNUM *rnd, int bits,
-        const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx)
-        {
-        int i,ret=0;
-        BIGNUM *t1;
-        BN_CTX_start(ctx);
-        if ((t1 = BN_CTX_get(ctx)) == NULL) goto err;
-        if (!BN_rand(rnd,bits,0,1)) goto err;
-        /* we need ((rnd-rem) % add) == 0 */
-        if (!BN_mod(t1,rnd,add,ctx)) goto err;
-        if (!BN_sub(rnd,rnd,t1)) goto err;
-        if (rem == NULL)
-                { if (!BN_add_word(rnd,1)) goto err; }
-        else
-                { if (!BN_add(rnd,rnd,rem)) goto err; }
-        /* we now have a random number 'rand' to test. */
-        loop: for (i=1; i<NUMPRIMES; i++)
-                {
-                /* check that rnd is a prime */
-                if (BN_mod_word(rnd,(BN_ULONG)primes[i]) <= 1)
-                        {
-                        if (!BN_add(rnd,rnd,add)) goto err;
-                        goto loop;
-                        }
-                }
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        bn_check_top(rnd);
-        return(ret);
-        }
-static int probable_prime_dh_safe(BIGNUM *p, int bits, const BIGNUM *padd,
-        const BIGNUM *rem, BN_CTX *ctx)
-        {
-        int i,ret=0;
-        BIGNUM *t1,*qadd,*q;
-        bits--;
-        BN_CTX_start(ctx);
-        t1 = BN_CTX_get(ctx);
-        q = BN_CTX_get(ctx);
-        qadd = BN_CTX_get(ctx);
-        if (qadd == NULL) goto err;
-        if (!BN_rshift1(qadd,padd)) goto err;
-                
-        if (!BN_rand(q,bits,0,1)) goto err;
-        /* we need ((rnd-rem) % add) == 0 */
-        if (!BN_mod(t1,q,qadd,ctx)) goto err;
-        if (!BN_sub(q,q,t1)) goto err;
-        if (rem == NULL)
-                { if (!BN_add_word(q,1)) goto err; }
-        else
-                {
-                if (!BN_rshift1(t1,rem)) goto err;
-                if (!BN_add(q,q,t1)) goto err;
-                }
-        /* we now have a random number 'rand' to test. */
-        if (!BN_lshift1(p,q)) goto err;
-        if (!BN_add_word(p,1)) goto err;
-        loop: for (i=1; i<NUMPRIMES; i++)
-                {
-                /* check that p and q are prime */
-                /* check that for p and q
-                 * gcd(p-1,primes) == 1 (except for 2) */
-                if (    (BN_mod_word(p,(BN_ULONG)primes[i]) == 0) ||
-                        (BN_mod_word(q,(BN_ULONG)primes[i]) == 0))
-                        {
-                        if (!BN_add(p,p,padd)) goto err;
-                        if (!BN_add(q,q,qadd)) goto err;
-                        goto loop;
-                        }
-                }
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        bn_check_top(p);
-        return(ret);
-        }
diff --git a/src/lib/libcrypto/bn/bn_prime.h b/src/lib/libcrypto/bn/bn_prime.h
deleted file mode 100644
index 51d2194feb..0000000000
--- a/src/lib/libcrypto/bn/bn_prime.h
+++ /dev/null
@@ -1,327 +0,0 @@
-/* Auto generated by bn_prime.pl */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#ifndef EIGHT_BIT
-#define NUMPRIMES 2048
-typedef unsigned short prime_t;
-#else
-#define NUMPRIMES 54
-typedef unsigned char prime_t;
-#endif
-static const prime_t primes[NUMPRIMES]=
-        {
-           2,   3,   5,   7,  11,  13,  17,  19,
-          23,  29,  31,  37,  41,  43,  47,  53,
-          59,  61,  67,  71,  73,  79,  83,  89,
-          97, 101, 103, 107, 109, 113, 127, 131,
-         137, 139, 149, 151, 157, 163, 167, 173,
-         179, 181, 191, 193, 197, 199, 211, 223,
-         227, 229, 233, 239, 241, 251,
-#ifndef EIGHT_BIT
-         257, 263,
-         269, 271, 277, 281, 283, 293, 307, 311,
-         313, 317, 331, 337, 347, 349, 353, 359,
-         367, 373, 379, 383, 389, 397, 401, 409,
-         419, 421, 431, 433, 439, 443, 449, 457,
-         461, 463, 467, 479, 487, 491, 499, 503,
-         509, 521, 523, 541, 547, 557, 563, 569,
-         571, 577, 587, 593, 599, 601, 607, 613,
-         617, 619, 631, 641, 643, 647, 653, 659,
-         661, 673, 677, 683, 691, 701, 709, 719,
-         727, 733, 739, 743, 751, 757, 761, 769,
-         773, 787, 797, 809, 811, 821, 823, 827,
-         829, 839, 853, 857, 859, 863, 877, 881,
-         883, 887, 907, 911, 919, 929, 937, 941,
-         947, 953, 967, 971, 977, 983, 991, 997,
-        1009,1013,1019,1021,1031,1033,1039,1049,
-        1051,1061,1063,1069,1087,1091,1093,1097,
-        1103,1109,1117,1123,1129,1151,1153,1163,
-        1171,1181,1187,1193,1201,1213,1217,1223,
-        1229,1231,1237,1249,1259,1277,1279,1283,
-        1289,1291,1297,1301,1303,1307,1319,1321,
-        1327,1361,1367,1373,1381,1399,1409,1423,
-        1427,1429,1433,1439,1447,1451,1453,1459,
-        1471,1481,1483,1487,1489,1493,1499,1511,
-        1523,1531,1543,1549,1553,1559,1567,1571,
-        1579,1583,1597,1601,1607,1609,1613,1619,
-        1621,1627,1637,1657,1663,1667,1669,1693,
-        1697,1699,1709,1721,1723,1733,1741,1747,
-        1753,1759,1777,1783,1787,1789,1801,1811,
-        1823,1831,1847,1861,1867,1871,1873,1877,
-        1879,1889,1901,1907,1913,1931,1933,1949,
-        1951,1973,1979,1987,1993,1997,1999,2003,
-        2011,2017,2027,2029,2039,2053,2063,2069,
-        2081,2083,2087,2089,2099,2111,2113,2129,
-        2131,2137,2141,2143,2153,2161,2179,2203,
-        2207,2213,2221,2237,2239,2243,2251,2267,
-        2269,2273,2281,2287,2293,2297,2309,2311,
-        2333,2339,2341,2347,2351,2357,2371,2377,
-        2381,2383,2389,2393,2399,2411,2417,2423,
-        2437,2441,2447,2459,2467,2473,2477,2503,
-        2521,2531,2539,2543,2549,2551,2557,2579,
-        2591,2593,2609,2617,2621,2633,2647,2657,
-        2659,2663,2671,2677,2683,2687,2689,2693,
-        2699,2707,2711,2713,2719,2729,2731,2741,
-        2749,2753,2767,2777,2789,2791,2797,2801,
-        2803,2819,2833,2837,2843,2851,2857,2861,
-        2879,2887,2897,2903,2909,2917,2927,2939,
-        2953,2957,2963,2969,2971,2999,3001,3011,
-        3019,3023,3037,3041,3049,3061,3067,3079,
-        3083,3089,3109,3119,3121,3137,3163,3167,
-        3169,3181,3187,3191,3203,3209,3217,3221,
-        3229,3251,3253,3257,3259,3271,3299,3301,
-        3307,3313,3319,3323,3329,3331,3343,3347,
-        3359,3361,3371,3373,3389,3391,3407,3413,
-        3433,3449,3457,3461,3463,3467,3469,3491,
-        3499,3511,3517,3527,3529,3533,3539,3541,
-        3547,3557,3559,3571,3581,3583,3593,3607,
-        3613,3617,3623,3631,3637,3643,3659,3671,
-        3673,3677,3691,3697,3701,3709,3719,3727,
-        3733,3739,3761,3767,3769,3779,3793,3797,
-        3803,3821,3823,3833,3847,3851,3853,3863,
-        3877,3881,3889,3907,3911,3917,3919,3923,
-        3929,3931,3943,3947,3967,3989,4001,4003,
-        4007,4013,4019,4021,4027,4049,4051,4057,
-        4073,4079,4091,4093,4099,4111,4127,4129,
-        4133,4139,4153,4157,4159,4177,4201,4211,
-        4217,4219,4229,4231,4241,4243,4253,4259,
-        4261,4271,4273,4283,4289,4297,4327,4337,
-        4339,4349,4357,4363,4373,4391,4397,4409,
-        4421,4423,4441,4447,4451,4457,4463,4481,
-        4483,4493,4507,4513,4517,4519,4523,4547,
-        4549,4561,4567,4583,4591,4597,4603,4621,
-        4637,4639,4643,4649,4651,4657,4663,4673,
-        4679,4691,4703,4721,4723,4729,4733,4751,
-        4759,4783,4787,4789,4793,4799,4801,4813,
-        4817,4831,4861,4871,4877,4889,4903,4909,
-        4919,4931,4933,4937,4943,4951,4957,4967,
-        4969,4973,4987,4993,4999,5003,5009,5011,
-        5021,5023,5039,5051,5059,5077,5081,5087,
-        5099,5101,5107,5113,5119,5147,5153,5167,
-        5171,5179,5189,5197,5209,5227,5231,5233,
-        5237,5261,5273,5279,5281,5297,5303,5309,
-        5323,5333,5347,5351,5381,5387,5393,5399,
-        5407,5413,5417,5419,5431,5437,5441,5443,
-        5449,5471,5477,5479,5483,5501,5503,5507,
-        5519,5521,5527,5531,5557,5563,5569,5573,
-        5581,5591,5623,5639,5641,5647,5651,5653,
-        5657,5659,5669,5683,5689,5693,5701,5711,
-        5717,5737,5741,5743,5749,5779,5783,5791,
-        5801,5807,5813,5821,5827,5839,5843,5849,
-        5851,5857,5861,5867,5869,5879,5881,5897,
-        5903,5923,5927,5939,5953,5981,5987,6007,
-        6011,6029,6037,6043,6047,6053,6067,6073,
-        6079,6089,6091,6101,6113,6121,6131,6133,
-        6143,6151,6163,6173,6197,6199,6203,6211,
-        6217,6221,6229,6247,6257,6263,6269,6271,
-        6277,6287,6299,6301,6311,6317,6323,6329,
-        6337,6343,6353,6359,6361,6367,6373,6379,
-        6389,6397,6421,6427,6449,6451,6469,6473,
-        6481,6491,6521,6529,6547,6551,6553,6563,
-        6569,6571,6577,6581,6599,6607,6619,6637,
-        6653,6659,6661,6673,6679,6689,6691,6701,
-        6703,6709,6719,6733,6737,6761,6763,6779,
-        6781,6791,6793,6803,6823,6827,6829,6833,
-        6841,6857,6863,6869,6871,6883,6899,6907,
-        6911,6917,6947,6949,6959,6961,6967,6971,
-        6977,6983,6991,6997,7001,7013,7019,7027,
-        7039,7043,7057,7069,7079,7103,7109,7121,
-        7127,7129,7151,7159,7177,7187,7193,7207,
-        7211,7213,7219,7229,7237,7243,7247,7253,
-        7283,7297,7307,7309,7321,7331,7333,7349,
-        7351,7369,7393,7411,7417,7433,7451,7457,
-        7459,7477,7481,7487,7489,7499,7507,7517,
-        7523,7529,7537,7541,7547,7549,7559,7561,
-        7573,7577,7583,7589,7591,7603,7607,7621,
-        7639,7643,7649,7669,7673,7681,7687,7691,
-        7699,7703,7717,7723,7727,7741,7753,7757,
-        7759,7789,7793,7817,7823,7829,7841,7853,
-        7867,7873,7877,7879,7883,7901,7907,7919,
-        7927,7933,7937,7949,7951,7963,7993,8009,
-        8011,8017,8039,8053,8059,8069,8081,8087,
-        8089,8093,8101,8111,8117,8123,8147,8161,
-        8167,8171,8179,8191,8209,8219,8221,8231,
-        8233,8237,8243,8263,8269,8273,8287,8291,
-        8293,8297,8311,8317,8329,8353,8363,8369,
-        8377,8387,8389,8419,8423,8429,8431,8443,
-        8447,8461,8467,8501,8513,8521,8527,8537,
-        8539,8543,8563,8573,8581,8597,8599,8609,
-        8623,8627,8629,8641,8647,8663,8669,8677,
-        8681,8689,8693,8699,8707,8713,8719,8731,
-        8737,8741,8747,8753,8761,8779,8783,8803,
-        8807,8819,8821,8831,8837,8839,8849,8861,
-        8863,8867,8887,8893,8923,8929,8933,8941,
-        8951,8963,8969,8971,8999,9001,9007,9011,
-        9013,9029,9041,9043,9049,9059,9067,9091,
-        9103,9109,9127,9133,9137,9151,9157,9161,
-        9173,9181,9187,9199,9203,9209,9221,9227,
-        9239,9241,9257,9277,9281,9283,9293,9311,
-        9319,9323,9337,9341,9343,9349,9371,9377,
-        9391,9397,9403,9413,9419,9421,9431,9433,
-        9437,9439,9461,9463,9467,9473,9479,9491,
-        9497,9511,9521,9533,9539,9547,9551,9587,
-        9601,9613,9619,9623,9629,9631,9643,9649,
-        9661,9677,9679,9689,9697,9719,9721,9733,
-        9739,9743,9749,9767,9769,9781,9787,9791,
-        9803,9811,9817,9829,9833,9839,9851,9857,
-        9859,9871,9883,9887,9901,9907,9923,9929,
-        9931,9941,9949,9967,9973,10007,10009,10037,
-        10039,10061,10067,10069,10079,10091,10093,10099,
-        10103,10111,10133,10139,10141,10151,10159,10163,
-        10169,10177,10181,10193,10211,10223,10243,10247,
-        10253,10259,10267,10271,10273,10289,10301,10303,
-        10313,10321,10331,10333,10337,10343,10357,10369,
-        10391,10399,10427,10429,10433,10453,10457,10459,
-        10463,10477,10487,10499,10501,10513,10529,10531,
-        10559,10567,10589,10597,10601,10607,10613,10627,
-        10631,10639,10651,10657,10663,10667,10687,10691,
-        10709,10711,10723,10729,10733,10739,10753,10771,
-        10781,10789,10799,10831,10837,10847,10853,10859,
-        10861,10867,10883,10889,10891,10903,10909,10937,
-        10939,10949,10957,10973,10979,10987,10993,11003,
-        11027,11047,11057,11059,11069,11071,11083,11087,
-        11093,11113,11117,11119,11131,11149,11159,11161,
-        11171,11173,11177,11197,11213,11239,11243,11251,
-        11257,11261,11273,11279,11287,11299,11311,11317,
-        11321,11329,11351,11353,11369,11383,11393,11399,
-        11411,11423,11437,11443,11447,11467,11471,11483,
-        11489,11491,11497,11503,11519,11527,11549,11551,
-        11579,11587,11593,11597,11617,11621,11633,11657,
-        11677,11681,11689,11699,11701,11717,11719,11731,
-        11743,11777,11779,11783,11789,11801,11807,11813,
-        11821,11827,11831,11833,11839,11863,11867,11887,
-        11897,11903,11909,11923,11927,11933,11939,11941,
-        11953,11959,11969,11971,11981,11987,12007,12011,
-        12037,12041,12043,12049,12071,12073,12097,12101,
-        12107,12109,12113,12119,12143,12149,12157,12161,
-        12163,12197,12203,12211,12227,12239,12241,12251,
-        12253,12263,12269,12277,12281,12289,12301,12323,
-        12329,12343,12347,12373,12377,12379,12391,12401,
-        12409,12413,12421,12433,12437,12451,12457,12473,
-        12479,12487,12491,12497,12503,12511,12517,12527,
-        12539,12541,12547,12553,12569,12577,12583,12589,
-        12601,12611,12613,12619,12637,12641,12647,12653,
-        12659,12671,12689,12697,12703,12713,12721,12739,
-        12743,12757,12763,12781,12791,12799,12809,12821,
-        12823,12829,12841,12853,12889,12893,12899,12907,
-        12911,12917,12919,12923,12941,12953,12959,12967,
-        12973,12979,12983,13001,13003,13007,13009,13033,
-        13037,13043,13049,13063,13093,13099,13103,13109,
-        13121,13127,13147,13151,13159,13163,13171,13177,
-        13183,13187,13217,13219,13229,13241,13249,13259,
-        13267,13291,13297,13309,13313,13327,13331,13337,
-        13339,13367,13381,13397,13399,13411,13417,13421,
-        13441,13451,13457,13463,13469,13477,13487,13499,
-        13513,13523,13537,13553,13567,13577,13591,13597,
-        13613,13619,13627,13633,13649,13669,13679,13681,
-        13687,13691,13693,13697,13709,13711,13721,13723,
-        13729,13751,13757,13759,13763,13781,13789,13799,
-        13807,13829,13831,13841,13859,13873,13877,13879,
-        13883,13901,13903,13907,13913,13921,13931,13933,
-        13963,13967,13997,13999,14009,14011,14029,14033,
-        14051,14057,14071,14081,14083,14087,14107,14143,
-        14149,14153,14159,14173,14177,14197,14207,14221,
-        14243,14249,14251,14281,14293,14303,14321,14323,
-        14327,14341,14347,14369,14387,14389,14401,14407,
-        14411,14419,14423,14431,14437,14447,14449,14461,
-        14479,14489,14503,14519,14533,14537,14543,14549,
-        14551,14557,14561,14563,14591,14593,14621,14627,
-        14629,14633,14639,14653,14657,14669,14683,14699,
-        14713,14717,14723,14731,14737,14741,14747,14753,
-        14759,14767,14771,14779,14783,14797,14813,14821,
-        14827,14831,14843,14851,14867,14869,14879,14887,
-        14891,14897,14923,14929,14939,14947,14951,14957,
-        14969,14983,15013,15017,15031,15053,15061,15073,
-        15077,15083,15091,15101,15107,15121,15131,15137,
-        15139,15149,15161,15173,15187,15193,15199,15217,
-        15227,15233,15241,15259,15263,15269,15271,15277,
-        15287,15289,15299,15307,15313,15319,15329,15331,
-        15349,15359,15361,15373,15377,15383,15391,15401,
-        15413,15427,15439,15443,15451,15461,15467,15473,
-        15493,15497,15511,15527,15541,15551,15559,15569,
-        15581,15583,15601,15607,15619,15629,15641,15643,
-        15647,15649,15661,15667,15671,15679,15683,15727,
-        15731,15733,15737,15739,15749,15761,15767,15773,
-        15787,15791,15797,15803,15809,15817,15823,15859,
-        15877,15881,15887,15889,15901,15907,15913,15919,
-        15923,15937,15959,15971,15973,15991,16001,16007,
-        16033,16057,16061,16063,16067,16069,16073,16087,
-        16091,16097,16103,16111,16127,16139,16141,16183,
-        16187,16189,16193,16217,16223,16229,16231,16249,
-        16253,16267,16273,16301,16319,16333,16339,16349,
-        16361,16363,16369,16381,16411,16417,16421,16427,
-        16433,16447,16451,16453,16477,16481,16487,16493,
-        16519,16529,16547,16553,16561,16567,16573,16603,
-        16607,16619,16631,16633,16649,16651,16657,16661,
-        16673,16691,16693,16699,16703,16729,16741,16747,
-        16759,16763,16787,16811,16823,16829,16831,16843,
-        16871,16879,16883,16889,16901,16903,16921,16927,
-        16931,16937,16943,16963,16979,16981,16987,16993,
-        17011,17021,17027,17029,17033,17041,17047,17053,
-        17077,17093,17099,17107,17117,17123,17137,17159,
-        17167,17183,17189,17191,17203,17207,17209,17231,
-        17239,17257,17291,17293,17299,17317,17321,17327,
-        17333,17341,17351,17359,17377,17383,17387,17389,
-        17393,17401,17417,17419,17431,17443,17449,17467,
-        17471,17477,17483,17489,17491,17497,17509,17519,
-        17539,17551,17569,17573,17579,17581,17597,17599,
-        17609,17623,17627,17657,17659,17669,17681,17683,
-        17707,17713,17729,17737,17747,17749,17761,17783,
-        17789,17791,17807,17827,17837,17839,17851,17863,
-#endif
-        };
diff --git a/src/lib/libcrypto/bn/bn_prime.pl b/src/lib/libcrypto/bn/bn_prime.pl
deleted file mode 100644
index 3fafb6f3e9..0000000000
--- a/src/lib/libcrypto/bn/bn_prime.pl
+++ /dev/null
@@ -1,119 +0,0 @@
-#!/usr/local/bin/perl
-# bn_prime.pl
-$num=2048;
-$num=$ARGV[0] if ($#ARGV >= 0);
-push(@primes,2);
-$p=1;
-loop: while ($#primes < $num-1)
-        {
-        $p+=2;
-        $s=int(sqrt($p));
-        for ($i=0; defined($primes[$i]) && $primes[$i]<=$s; $i++)
-                {
-                next loop if (($p%$primes[$i]) == 0);
-                }
-        push(@primes,$p);
-        }
-# print <<"EOF";
-# /* Auto generated by bn_prime.pl */
-# /* Copyright (C) 1995-1997 Eric Young (eay\@mincom.oz.au).
-#  * All rights reserved.
-#  * Copyright remains Eric Young's, and as such any Copyright notices in
-#  * the code are not to be removed.
-#  * See the COPYRIGHT file in the SSLeay distribution for more details.
-#  */
-# 
-# EOF
-print <<\EOF;
-/* Auto generated by bn_prime.pl */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-EOF
-for ($i=0; $i <= $#primes; $i++)
-        {
-        if ($primes[$i] > 256)
-                {
-                $eight=$i;
-                last;
-                }
-        }
-printf "#ifndef EIGHT_BIT\n";
-printf "#define NUMPRIMES %d\n",$num;
-printf "typedef unsigned short prime_t;\n";
-printf "#else\n";
-printf "#define NUMPRIMES %d\n",$eight;
-printf "typedef unsigned char prime_t;\n";
-printf "#endif\n";
-print "static const prime_t primes[NUMPRIMES]=\n\t{\n\t";
-$init=0;
-for ($i=0; $i <= $#primes; $i++)
-        {
-        printf "\n#ifndef EIGHT_BIT\n\t" if ($primes[$i] > 256) && !($init++);
-        printf("\n\t") if (($i%8) == 0) && ($i != 0);
-        printf("%4d,",$primes[$i]);
-        }
-print "\n#endif\n\t};\n";
diff --git a/src/lib/libcrypto/bn/bn_print.c b/src/lib/libcrypto/bn/bn_print.c
deleted file mode 100644
index 810dde34e1..0000000000
--- a/src/lib/libcrypto/bn/bn_print.c
+++ /dev/null
@@ -1,338 +0,0 @@
-/* crypto/bn/bn_print.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include <ctype.h>
-#include "cryptlib.h"
-#include <openssl/buffer.h>
-#include "bn_lcl.h"
-static const char Hex[]="0123456789ABCDEF";
-/* Must 'OPENSSL_free' the returned data */
-char *BN_bn2hex(const BIGNUM *a)
-        {
-        int i,j,v,z=0;
-        char *buf;
-        char *p;
-        buf=(char *)OPENSSL_malloc(a->top*BN_BYTES*2+2);
-        if (buf == NULL)
-                {
-                BNerr(BN_F_BN_BN2HEX,ERR_R_MALLOC_FAILURE);
-                goto err;
-                }
-        p=buf;
-        if (a->neg) *(p++)='-';
-        if (BN_is_zero(a)) *(p++)='0';
-        for (i=a->top-1; i >=0; i--)
-                {
-                for (j=BN_BITS2-8; j >= 0; j-=8)
-                        {
-                        /* strip leading zeros */
-                        v=((int)(a->d[i]>>(long)j))&0xff;
-                        if (z || (v != 0))
-                                {
-                                *(p++)=Hex[v>>4];
-                                *(p++)=Hex[v&0x0f];
-                                z=1;
-                                }
-                        }
-                }
-        *p='\0';
-err:
-        return(buf);
-        }
-/* Must 'OPENSSL_free' the returned data */
-char *BN_bn2dec(const BIGNUM *a)
-        {
-        int i=0,num, ok = 0;
-        char *buf=NULL;
-        char *p;
-        BIGNUM *t=NULL;
-        BN_ULONG *bn_data=NULL,*lp;
-        /* get an upper bound for the length of the decimal integer
-         * num <= (BN_num_bits(a) + 1) * log(2)
-         *     <= 3 * BN_num_bits(a) * 0.1001 + log(2) + 1     (rounding error)
-         *     <= BN_num_bits(a)/10 + BN_num_bits/1000 + 1 + 1 
-         */
-        i=BN_num_bits(a)*3;
-        num=(i/10+i/1000+1)+1;
-        bn_data=(BN_ULONG *)OPENSSL_malloc((num/BN_DEC_NUM+1)*sizeof(BN_ULONG));
-        buf=(char *)OPENSSL_malloc(num+3);
-        if ((buf == NULL) || (bn_data == NULL))
-                {
-                BNerr(BN_F_BN_BN2DEC,ERR_R_MALLOC_FAILURE);
-                goto err;
-                }
-        if ((t=BN_dup(a)) == NULL) goto err;
-#define BUF_REMAIN (num+3 - (size_t)(p - buf))
-        p=buf;
-        lp=bn_data;
-        if (BN_is_zero(t))
-                {
-                *(p++)='0';
-                *(p++)='\0';
-                }
-        else
-                {
-                if (BN_is_negative(t))
-                        *p++ = '-';
-                i=0;
-                while (!BN_is_zero(t))
-                        {
-                        *lp=BN_div_word(t,BN_DEC_CONV);
-                        lp++;
-                        }
-                lp--;
-                /* We now have a series of blocks, BN_DEC_NUM chars
-                 * in length, where the last one needs truncation.
-                 * The blocks need to be reversed in order. */
-                BIO_snprintf(p,BUF_REMAIN,BN_DEC_FMT1,*lp);
-                while (*p) p++;
-                while (lp != bn_data)
-                        {
-                        lp--;
-                        BIO_snprintf(p,BUF_REMAIN,BN_DEC_FMT2,*lp);
-                        while (*p) p++;
-                        }
-                }
-        ok = 1;
-err:
-        if (bn_data != NULL) OPENSSL_free(bn_data);
-        if (t != NULL) BN_free(t);
-        if (!ok && buf)
-                {
-                OPENSSL_free(buf);
-                buf = NULL;
-                }
-        return(buf);
-        }
-int BN_hex2bn(BIGNUM **bn, const char *a)
-        {
-        BIGNUM *ret=NULL;
-        BN_ULONG l=0;
-        int neg=0,h,m,i,j,k,c;
-        int num;
-        if ((a == NULL) || (*a == '\0')) return(0);
-        if (*a == '-') { neg=1; a++; }
-        for (i=0; isxdigit((unsigned char) a[i]); i++)
-                ;
-        num=i+neg;
-        if (bn == NULL) return(num);
-        /* a is the start of the hex digits, and it is 'i' long */
-        if (*bn == NULL)
-                {
-                if ((ret=BN_new()) == NULL) return(0);
-                }
-        else
-                {
-                ret= *bn;
-                BN_zero(ret);
-                }
-        /* i is the number of hex digests; */
-        if (bn_expand(ret,i*4) == NULL) goto err;
-        j=i; /* least significant 'hex' */
-        m=0;
-        h=0;
-        while (j > 0)
-                {
-                m=((BN_BYTES*2) <= j)?(BN_BYTES*2):j;
-                l=0;
-                for (;;)
-                        {
-                        c=a[j-m];
-                        if ((c >= '0') && (c <= '9')) k=c-'0';
-                        else if ((c >= 'a') && (c <= 'f')) k=c-'a'+10;
-                        else if ((c >= 'A') && (c <= 'F')) k=c-'A'+10;
-                        else k=0; /* paranoia */
-                        l=(l<<4)|k;
-                        if (--m <= 0)
-                                {
-                                ret->d[h++]=l;
-                                break;
-                                }
-                        }
-                j-=(BN_BYTES*2);
-                }
-        ret->top=h;
-        bn_correct_top(ret);
-        ret->neg=neg;
-        *bn=ret;
-        bn_check_top(ret);
-        return(num);
-err:
-        if (*bn == NULL) BN_free(ret);
-        return(0);
-        }
-int BN_dec2bn(BIGNUM **bn, const char *a)
-        {
-        BIGNUM *ret=NULL;
-        BN_ULONG l=0;
-        int neg=0,i,j;
-        int num;
-        if ((a == NULL) || (*a == '\0')) return(0);
-        if (*a == '-') { neg=1; a++; }
-        for (i=0; isdigit((unsigned char) a[i]); i++)
-                ;
-        num=i+neg;
-        if (bn == NULL) return(num);
-        /* a is the start of the digits, and it is 'i' long.
-         * We chop it into BN_DEC_NUM digits at a time */
-        if (*bn == NULL)
-                {
-                if ((ret=BN_new()) == NULL) return(0);
-                }
-        else
-                {
-                ret= *bn;
-                BN_zero(ret);
-                }
-        /* i is the number of digests, a bit of an over expand; */
-        if (bn_expand(ret,i*4) == NULL) goto err;
-        j=BN_DEC_NUM-(i%BN_DEC_NUM);
-        if (j == BN_DEC_NUM) j=0;
-        l=0;
-        while (*a)
-                {
-                l*=10;
-                l+= *a-'0';
-                a++;
-                if (++j == BN_DEC_NUM)
-                        {
-                        BN_mul_word(ret,BN_DEC_CONV);
-                        BN_add_word(ret,l);
-                        l=0;
-                        j=0;
-                        }
-                }
-        ret->neg=neg;
-        bn_correct_top(ret);
-        *bn=ret;
-        bn_check_top(ret);
-        return(num);
-err:
-        if (*bn == NULL) BN_free(ret);
-        return(0);
-        }
-#ifndef OPENSSL_NO_BIO
-#ifndef OPENSSL_NO_FP_API
-int BN_print_fp(FILE *fp, const BIGNUM *a)
-        {
-        BIO *b;
-        int ret;
-        if ((b=BIO_new(BIO_s_file())) == NULL)
-                return(0);
-        BIO_set_fp(b,fp,BIO_NOCLOSE);
-        ret=BN_print(b,a);
-        BIO_free(b);
-        return(ret);
-        }
-#endif
-int BN_print(BIO *bp, const BIGNUM *a)
-        {
-        int i,j,v,z=0;
-        int ret=0;
-        if ((a->neg) && (BIO_write(bp,"-",1) != 1)) goto end;
-        if (BN_is_zero(a) && (BIO_write(bp,"0",1) != 1)) goto end;
-        for (i=a->top-1; i >=0; i--)
-                {
-                for (j=BN_BITS2-4; j >= 0; j-=4)
-                        {
-                        /* strip leading zeros */
-                        v=((int)(a->d[i]>>(long)j))&0x0f;
-                        if (z || (v != 0))
-                                {
-                                if (BIO_write(bp,&(Hex[v]),1) != 1)
-                                        goto end;
-                                z=1;
-                                }
-                        }
-                }
-        ret=1;
-end:
-        return(ret);
-        }
-#endif
diff --git a/src/lib/libcrypto/bn/bn_rand.c b/src/lib/libcrypto/bn/bn_rand.c
deleted file mode 100644
index b376c28ff3..0000000000
--- a/src/lib/libcrypto/bn/bn_rand.c
+++ /dev/null
@@ -1,305 +0,0 @@
-/* crypto/bn/bn_rand.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-/* ====================================================================
- * Copyright (c) 1998-2001 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include <stdio.h>
-#include <time.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-#include <openssl/rand.h>
-static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom)
-        {
-        unsigned char *buf=NULL;
-        int ret=0,bit,bytes,mask;
-        time_t tim;
-        if (bits == 0)
-                {
-                BN_zero(rnd);
-                return 1;
-                }
-        bytes=(bits+7)/8;
-        bit=(bits-1)%8;
-        mask=0xff<<(bit+1);
-        buf=(unsigned char *)OPENSSL_malloc(bytes);
-        if (buf == NULL)
-                {
-                BNerr(BN_F_BNRAND,ERR_R_MALLOC_FAILURE);
-                goto err;
-                }
-        /* make a random number and set the top and bottom bits */
-        time(&tim);
-        RAND_add(&tim,sizeof(tim),0.0);
-        if (pseudorand)
-                {
-                if (RAND_pseudo_bytes(buf, bytes) == -1)
-                        goto err;
-                }
-        else
-                {
-                if (RAND_bytes(buf, bytes) <= 0)
-                        goto err;
-                }
-#if 1
-        if (pseudorand == 2)
-                {
-                /* generate patterns that are more likely to trigger BN
-                   library bugs */
-                int i;
-                unsigned char c;
-                for (i = 0; i < bytes; i++)
-                        {
-                        RAND_pseudo_bytes(&c, 1);
-                        if (c >= 128 && i > 0)
-                                buf[i] = buf[i-1];
-                        else if (c < 42)
-                                buf[i] = 0;
-                        else if (c < 84)
-                                buf[i] = 255;
-                        }
-                }
-#endif
-        if (top != -1)
-                {
-                if (top)
-                        {
-                        if (bit == 0)
-                                {
-                                buf[0]=1;
-                                buf[1]|=0x80;
-                                }
-                        else
-                                {
-                                buf[0]|=(3<<(bit-1));
-                                }
-                        }
-                else
-                        {
-                        buf[0]|=(1<<bit);
-                        }
-                }
-        buf[0] &= ~mask;
-        if (bottom) /* set bottom bit if requested */
-                buf[bytes-1]|=1;
-        if (!BN_bin2bn(buf,bytes,rnd)) goto err;
-        ret=1;
-err:
-        if (buf != NULL)
-                {
-                OPENSSL_cleanse(buf,bytes);
-                OPENSSL_free(buf);
-                }
-        bn_check_top(rnd);
-        return(ret);
-        }
-int     BN_rand(BIGNUM *rnd, int bits, int top, int bottom)
-        {
-        return bnrand(0, rnd, bits, top, bottom);
-        }
-int     BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom)
-        {
-        return bnrand(1, rnd, bits, top, bottom);
-        }
-#if 1
-int     BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
-        {
-        return bnrand(2, rnd, bits, top, bottom);
-        }
-#endif
-/* random number r:  0 <= r < range */
-static int bn_rand_range(int pseudo, BIGNUM *r, const BIGNUM *range)
-        {
-        int (*bn_rand)(BIGNUM *, int, int, int) = pseudo ? BN_pseudo_rand : BN_rand;
-        int n;
-        int count = 100;
-        if (range->neg || BN_is_zero(range))
-                {
-                BNerr(BN_F_BN_RAND_RANGE, BN_R_INVALID_RANGE);
-                return 0;
-                }
-        n = BN_num_bits(range); /* n > 0 */
-        /* BN_is_bit_set(range, n - 1) always holds */
-        if (n == 1)
-                BN_zero(r);
-        else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3))
-                {
-                /* range = 100..._2,
-                 * so  3*range (= 11..._2)  is exactly one bit longer than  range */
-                do
-                        {
-                        if (!bn_rand(r, n + 1, -1, 0)) return 0;
-                        /* If  r < 3*range,  use  r := r MOD range
-                         * (which is either  r, r - range,  or  r - 2*range).
-                         * Otherwise, iterate once more.
-                         * Since  3*range = 11..._2, each iteration succeeds with
-                         * probability >= .75. */
-                        if (BN_cmp(r ,range) >= 0)
-                                {
-                                if (!BN_sub(r, r, range)) return 0;
-                                if (BN_cmp(r, range) >= 0)
-                                        if (!BN_sub(r, r, range)) return 0;
-                                }
-                        if (!--count)
-                                {
-                                BNerr(BN_F_BN_RAND_RANGE, BN_R_TOO_MANY_ITERATIONS);
-                                return 0;
-                                }
-                        
-                        }
-                while (BN_cmp(r, range) >= 0);
-                }
-        else
-                {
-                do
-                        {
-                        /* range = 11..._2  or  range = 101..._2 */
-                        if (!bn_rand(r, n, -1, 0)) return 0;
-                        if (!--count)
-                                {
-                                BNerr(BN_F_BN_RAND_RANGE, BN_R_TOO_MANY_ITERATIONS);
-                                return 0;
-                                }
-                        }
-                while (BN_cmp(r, range) >= 0);
-                }
-        bn_check_top(r);
-        return 1;
-        }
-int     BN_rand_range(BIGNUM *r, const BIGNUM *range)
-        {
-        return bn_rand_range(0, r, range);
-        }
-int     BN_pseudo_rand_range(BIGNUM *r, const BIGNUM *range)
-        {
-        return bn_rand_range(1, r, range);
-        }
diff --git a/src/lib/libcrypto/bn/bn_recp.c b/src/lib/libcrypto/bn/bn_recp.c
deleted file mode 100644
index 2e8efb8dae..0000000000
--- a/src/lib/libcrypto/bn/bn_recp.c
+++ /dev/null
@@ -1,234 +0,0 @@
-/* crypto/bn/bn_recp.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-void BN_RECP_CTX_init(BN_RECP_CTX *recp)
-        {
-        BN_init(&(recp->N));
-        BN_init(&(recp->Nr));
-        recp->num_bits=0;
-        recp->flags=0;
-        }
-BN_RECP_CTX *BN_RECP_CTX_new(void)
-        {
-        BN_RECP_CTX *ret;
-        if ((ret=(BN_RECP_CTX *)OPENSSL_malloc(sizeof(BN_RECP_CTX))) == NULL)
-                return(NULL);
-        BN_RECP_CTX_init(ret);
-        ret->flags=BN_FLG_MALLOCED;
-        return(ret);
-        }
-void BN_RECP_CTX_free(BN_RECP_CTX *recp)
-        {
-        if(recp == NULL)
-            return;
-        BN_free(&(recp->N));
-        BN_free(&(recp->Nr));
-        if (recp->flags & BN_FLG_MALLOCED)
-                OPENSSL_free(recp);
-        }
-int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
-        {
-        if (!BN_copy(&(recp->N),d)) return 0;
-        BN_zero(&(recp->Nr));
-        recp->num_bits=BN_num_bits(d);
-        recp->shift=0;
-        return(1);
-        }
-int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
-        BN_RECP_CTX *recp, BN_CTX *ctx)
-        {
-        int ret=0;
-        BIGNUM *a;
-        const BIGNUM *ca;
-        BN_CTX_start(ctx);
-        if ((a = BN_CTX_get(ctx)) == NULL) goto err;
-        if (y != NULL)
-                {
-                if (x == y)
-                        { if (!BN_sqr(a,x,ctx)) goto err; }
-                else
-                        { if (!BN_mul(a,x,y,ctx)) goto err; }
-                ca = a;
-                }
-        else
-                ca=x; /* Just do the mod */
-        ret = BN_div_recp(NULL,r,ca,recp,ctx);
-err:
-        BN_CTX_end(ctx);
-        bn_check_top(r);
-        return(ret);
-        }
-int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
-        BN_RECP_CTX *recp, BN_CTX *ctx)
-        {
-        int i,j,ret=0;
-        BIGNUM *a,*b,*d,*r;
-        BN_CTX_start(ctx);
-        a=BN_CTX_get(ctx);
-        b=BN_CTX_get(ctx);
-        if (dv != NULL)
-                d=dv;
-        else
-                d=BN_CTX_get(ctx);
-        if (rem != NULL)
-                r=rem;
-        else
-                r=BN_CTX_get(ctx);
-        if (a == NULL || b == NULL || d == NULL || r == NULL) goto err;
-        if (BN_ucmp(m,&(recp->N)) < 0)
-                {
-                BN_zero(d);
-                if (!BN_copy(r,m)) return 0;
-                BN_CTX_end(ctx);
-                return(1);
-                }
-        /* We want the remainder
-         * Given input of ABCDEF / ab
-         * we need multiply ABCDEF by 3 digests of the reciprocal of ab
-         *
-         */
-        /* i := max(BN_num_bits(m), 2*BN_num_bits(N)) */
-        i=BN_num_bits(m);
-        j=recp->num_bits<<1;
-        if (j>i) i=j;
-        /* Nr := round(2^i / N) */
-        if (i != recp->shift)
-                recp->shift=BN_reciprocal(&(recp->Nr),&(recp->N),
-                        i,ctx); /* BN_reciprocal returns i, or -1 for an error */
-        if (recp->shift == -1) goto err;
-        /* d := |round(round(m / 2^BN_num_bits(N)) * recp->Nr / 2^(i - BN_num_bits(N)))|
-         *    = |round(round(m / 2^BN_num_bits(N)) * round(2^i / N) / 2^(i - BN_num_bits(N)))|
-         *   <= |(m / 2^BN_num_bits(N)) * (2^i / N) * (2^BN_num_bits(N) / 2^i)|
-         *    = |m/N|
-         */
-        if (!BN_rshift(a,m,recp->num_bits)) goto err;
-        if (!BN_mul(b,a,&(recp->Nr),ctx)) goto err;
-        if (!BN_rshift(d,b,i-recp->num_bits)) goto err;
-        d->neg=0;
-        if (!BN_mul(b,&(recp->N),d,ctx)) goto err;
-        if (!BN_usub(r,m,b)) goto err;
-        r->neg=0;
-#if 1
-        j=0;
-        while (BN_ucmp(r,&(recp->N)) >= 0)
-                {
-                if (j++ > 2)
-                        {
-                        BNerr(BN_F_BN_DIV_RECP,BN_R_BAD_RECIPROCAL);
-                        goto err;
-                        }
-                if (!BN_usub(r,r,&(recp->N))) goto err;
-                if (!BN_add_word(d,1)) goto err;
-                }
-#endif
-        r->neg=BN_is_zero(r)?0:m->neg;
-        d->neg=m->neg^recp->N.neg;
-        ret=1;
-err:
-        BN_CTX_end(ctx);
-        bn_check_top(dv);
-        bn_check_top(rem);
-        return(ret);
-        } 
-/* len is the expected size of the result
- * We actually calculate with an extra word of precision, so
- * we can do faster division if the remainder is not required.
- */
-/* r := 2^len / m */
-int BN_reciprocal(BIGNUM *r, const BIGNUM *m, int len, BN_CTX *ctx)
-        {
-        int ret= -1;
-        BIGNUM *t;
-        BN_CTX_start(ctx);
-        if((t = BN_CTX_get(ctx)) == NULL) goto err;
-        if (!BN_set_bit(t,len)) goto err;
-        if (!BN_div(r,NULL,t,m,ctx)) goto err;
-        ret=len;
-err:
-        bn_check_top(r);
-        BN_CTX_end(ctx);
-        return(ret);
-        }
diff --git a/src/lib/libcrypto/bn/bn_shift.c b/src/lib/libcrypto/bn/bn_shift.c
deleted file mode 100644
index c4d301afc4..0000000000
--- a/src/lib/libcrypto/bn/bn_shift.c
+++ /dev/null
@@ -1,220 +0,0 @@
-/* crypto/bn/bn_shift.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-int BN_lshift1(BIGNUM *r, const BIGNUM *a)
-        {
-        register BN_ULONG *ap,*rp,t,c;
-        int i;
-        bn_check_top(r);
-        bn_check_top(a);
-        if (r != a)
-                {
-                r->neg=a->neg;
-                if (bn_wexpand(r,a->top+1) == NULL) return(0);
-                r->top=a->top;
-                }
-        else
-                {
-                if (bn_wexpand(r,a->top+1) == NULL) return(0);
-                }
-        ap=a->d;
-        rp=r->d;
-        c=0;
-        for (i=0; i<a->top; i++)
-                {
-                t= *(ap++);
-                *(rp++)=((t<<1)|c)&BN_MASK2;
-                c=(t & BN_TBIT)?1:0;
-                }
-        if (c)
-                {
-                *rp=1;
-                r->top++;
-                }
-        bn_check_top(r);
-        return(1);
-        }
-int BN_rshift1(BIGNUM *r, const BIGNUM *a)
-        {
-        BN_ULONG *ap,*rp,t,c;
-        int i;
-        bn_check_top(r);
-        bn_check_top(a);
-        if (BN_is_zero(a))
-                {
-                BN_zero(r);
-                return(1);
-                }
-        if (a != r)
-                {
-                if (bn_wexpand(r,a->top) == NULL) return(0);
-                r->top=a->top;
-                r->neg=a->neg;
-                }
-        ap=a->d;
-        rp=r->d;
-        c=0;
-        for (i=a->top-1; i>=0; i--)
-                {
-                t=ap[i];
-                rp[i]=((t>>1)&BN_MASK2)|c;
-                c=(t&1)?BN_TBIT:0;
-                }
-        bn_correct_top(r);
-        bn_check_top(r);
-        return(1);
-        }
-int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
-        {
-        int i,nw,lb,rb;
-        BN_ULONG *t,*f;
-        BN_ULONG l;
-        bn_check_top(r);
-        bn_check_top(a);
-        r->neg=a->neg;
-        nw=n/BN_BITS2;
-        if (bn_wexpand(r,a->top+nw+1) == NULL) return(0);
-        lb=n%BN_BITS2;
-        rb=BN_BITS2-lb;
-        f=a->d;
-        t=r->d;
-        t[a->top+nw]=0;
-        if (lb == 0)
-                for (i=a->top-1; i>=0; i--)
-                        t[nw+i]=f[i];
-        else
-                for (i=a->top-1; i>=0; i--)
-                        {
-                        l=f[i];
-                        t[nw+i+1]|=(l>>rb)&BN_MASK2;
-                        t[nw+i]=(l<<lb)&BN_MASK2;
-                        }
-        memset(t,0,nw*sizeof(t[0]));
-/*      for (i=0; i<nw; i++)
-                t[i]=0;*/
-        r->top=a->top+nw+1;
-        bn_correct_top(r);
-        bn_check_top(r);
-        return(1);
-        }
-int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
-        {
-        int i,j,nw,lb,rb;
-        BN_ULONG *t,*f;
-        BN_ULONG l,tmp;
-        bn_check_top(r);
-        bn_check_top(a);
-        nw=n/BN_BITS2;
-        rb=n%BN_BITS2;
-        lb=BN_BITS2-rb;
-        if (nw >= a->top || a->top == 0)
-                {
-                BN_zero(r);
-                return(1);
-                }
-        if (r != a)
-                {
-                r->neg=a->neg;
-                if (bn_wexpand(r,a->top-nw+1) == NULL) return(0);
-                }
-        else
-                {
-                if (n == 0)
-                        return 1; /* or the copying loop will go berserk */
-                }
-        f= &(a->d[nw]);
-        t=r->d;
-        j=a->top-nw;
-        r->top=j;
-        if (rb == 0)
-                {
-                for (i=j; i != 0; i--)
-                        *(t++)= *(f++);
-                }
-        else
-                {
-                l= *(f++);
-                for (i=j-1; i != 0; i--)
-                        {
-                        tmp =(l>>rb)&BN_MASK2;
-                        l= *(f++);
-                        *(t++) =(tmp|(l<<lb))&BN_MASK2;
-                        }
-                *(t++) =(l>>rb)&BN_MASK2;
-                }
-        bn_correct_top(r);
-        bn_check_top(r);
-        return(1);
-        }
diff --git a/src/lib/libcrypto/bn/bn_sqr.c b/src/lib/libcrypto/bn/bn_sqr.c
deleted file mode 100644
index 270d0cd348..0000000000
--- a/src/lib/libcrypto/bn/bn_sqr.c
+++ /dev/null
@@ -1,294 +0,0 @@
-/* crypto/bn/bn_sqr.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-/* r must not be a */
-/* I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96 */
-int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
-        {
-        int max,al;
-        int ret = 0;
-        BIGNUM *tmp,*rr;
-#ifdef BN_COUNT
-        fprintf(stderr,"BN_sqr %d * %d\n",a->top,a->top);
-#endif
-        bn_check_top(a);
-        al=a->top;
-        if (al <= 0)
-                {
-                r->top=0;
-                return 1;
-                }
-        BN_CTX_start(ctx);
-        rr=(a != r) ? r : BN_CTX_get(ctx);
-        tmp=BN_CTX_get(ctx);
-        if (!rr || !tmp) goto err;
-        max = 2 * al; /* Non-zero (from above) */
-        if (bn_wexpand(rr,max) == NULL) goto err;
-        if (al == 4)
-                {
-#ifndef BN_SQR_COMBA
-                BN_ULONG t[8];
-                bn_sqr_normal(rr->d,a->d,4,t);
-#else
-                bn_sqr_comba4(rr->d,a->d);
-#endif
-                }
-        else if (al == 8)
-                {
-#ifndef BN_SQR_COMBA
-                BN_ULONG t[16];
-                bn_sqr_normal(rr->d,a->d,8,t);
-#else
-                bn_sqr_comba8(rr->d,a->d);
-#endif
-                }
-        else 
-                {
-#if defined(BN_RECURSION)
-                if (al < BN_SQR_RECURSIVE_SIZE_NORMAL)
-                        {
-                        BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL*2];
-                        bn_sqr_normal(rr->d,a->d,al,t);
-                        }
-                else
-                        {
-                        int j,k;
-                        j=BN_num_bits_word((BN_ULONG)al);
-                        j=1<<(j-1);
-                        k=j+j;
-                        if (al == j)
-                                {
-                                if (bn_wexpand(tmp,k*2) == NULL) goto err;
-                                bn_sqr_recursive(rr->d,a->d,al,tmp->d);
-                                }
-                        else
-                                {
-                                if (bn_wexpand(tmp,max) == NULL) goto err;
-                                bn_sqr_normal(rr->d,a->d,al,tmp->d);
-                                }
-                        }
-#else
-                if (bn_wexpand(tmp,max) == NULL) goto err;
-                bn_sqr_normal(rr->d,a->d,al,tmp->d);
-#endif
-                }
-        rr->neg=0;
-        /* If the most-significant half of the top word of 'a' is zero, then
-         * the square of 'a' will max-1 words. */
-        if(a->d[al - 1] == (a->d[al - 1] & BN_MASK2l))
-                rr->top = max - 1;
-        else
-                rr->top = max;
-        if (rr != r) BN_copy(r,rr);
-        ret = 1;
- err:
-        bn_check_top(rr);
-        bn_check_top(tmp);
-        BN_CTX_end(ctx);
-        return(ret);
-        }
-/* tmp must have 2*n words */
-void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
-        {
-        int i,j,max;
-        const BN_ULONG *ap;
-        BN_ULONG *rp;
-        max=n*2;
-        ap=a;
-        rp=r;
-        rp[0]=rp[max-1]=0;
-        rp++;
-        j=n;
-        if (--j > 0)
-                {
-                ap++;
-                rp[j]=bn_mul_words(rp,ap,j,ap[-1]);
-                rp+=2;
-                }
-        for (i=n-2; i>0; i--)
-                {
-                j--;
-                ap++;
-                rp[j]=bn_mul_add_words(rp,ap,j,ap[-1]);
-                rp+=2;
-                }
-        bn_add_words(r,r,r,max);
-        /* There will not be a carry */
-        bn_sqr_words(tmp,a,n);
-        bn_add_words(r,r,tmp,max);
-        }
-#ifdef BN_RECURSION
-/* r is 2*n words in size,
- * a and b are both n words in size.    (There's not actually a 'b' here ...)
- * n must be a power of 2.
- * We multiply and return the result.
- * t must be 2*n words in size
- * We calculate
- * a[0]*b[0]
- * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])
- * a[1]*b[1]
- */
-void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
-        {
-        int n=n2/2;
-        int zero,c1;
-        BN_ULONG ln,lo,*p;
-#ifdef BN_COUNT
-        fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
-#endif
-        if (n2 == 4)
-                {
-#ifndef BN_SQR_COMBA
-                bn_sqr_normal(r,a,4,t);
-#else
-                bn_sqr_comba4(r,a);
-#endif
-                return;
-                }
-        else if (n2 == 8)
-                {
-#ifndef BN_SQR_COMBA
-                bn_sqr_normal(r,a,8,t);
-#else
-                bn_sqr_comba8(r,a);
-#endif
-                return;
-                }
-        if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
-                {
-                bn_sqr_normal(r,a,n2,t);
-                return;
-                }
-        /* r=(a[0]-a[1])*(a[1]-a[0]) */
-        c1=bn_cmp_words(a,&(a[n]),n);
-        zero=0;
-        if (c1 > 0)
-                bn_sub_words(t,a,&(a[n]),n);
-        else if (c1 < 0)
-                bn_sub_words(t,&(a[n]),a,n);
-        else
-                zero=1;
-        /* The result will always be negative unless it is zero */
-        p= &(t[n2*2]);
-        if (!zero)
-                bn_sqr_recursive(&(t[n2]),t,n,p);
-        else
-                memset(&(t[n2]),0,n2*sizeof(BN_ULONG));
-        bn_sqr_recursive(r,a,n,p);
-        bn_sqr_recursive(&(r[n2]),&(a[n]),n,p);
-        /* t[32] holds (a[0]-a[1])*(a[1]-a[0]), it is negative or zero
-         * r[10] holds (a[0]*b[0])
-         * r[32] holds (b[1]*b[1])
-         */
-        c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
-        /* t[32] is negative */
-        c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
-        /* t[32] holds (a[0]-a[1])*(a[1]-a[0])+(a[0]*a[0])+(a[1]*a[1])
-         * r[10] holds (a[0]*a[0])
-         * r[32] holds (a[1]*a[1])
-         * c1 holds the carry bits
-         */
-        c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
-        if (c1)
-                {
-                p= &(r[n+n2]);
-                lo= *p;
-                ln=(lo+c1)&BN_MASK2;
-                *p=ln;
-                /* The overflow will stop before we over write
-                 * words we should not overwrite */
-                if (ln < (BN_ULONG)c1)
-                        {
-                        do      {
-                                p++;
-                                lo= *p;
-                                ln=(lo+1)&BN_MASK2;
-                                *p=ln;
-                                } while (ln == 0);
-                        }
-                }
-        }
-#endif
diff --git a/src/lib/libcrypto/bn/bn_sqrt.c b/src/lib/libcrypto/bn/bn_sqrt.c
deleted file mode 100644
index 6beaf9e5e5..0000000000
--- a/src/lib/libcrypto/bn/bn_sqrt.c
+++ /dev/null
@@ -1,393 +0,0 @@
-/* crypto/bn/bn_sqrt.c */
-/* Written by Lenka Fibikova <fibikova@exp-math.uni-essen.de>
- * and Bodo Moeller for the OpenSSL project. */
-/* ====================================================================
- * Copyright (c) 1998-2000 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    openssl-core@openssl.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include "cryptlib.h"
-#include "bn_lcl.h"
-BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx) 
-/* Returns 'ret' such that
- *      ret^2 == a (mod p),
- * using the Tonelli/Shanks algorithm (cf. Henri Cohen, "A Course
- * in Algebraic Computational Number Theory", algorithm 1.5.1).
- * 'p' must be prime!
- */
-        {
-        BIGNUM *ret = in;
-        int err = 1;
-        int r;
-        BIGNUM *A, *b, *q, *t, *x, *y;
-        int e, i, j;
-        
-        if (!BN_is_odd(p) || BN_abs_is_word(p, 1))
-                {
-                if (BN_abs_is_word(p, 2))
-                        {
-                        if (ret == NULL)
-                                ret = BN_new();
-                        if (ret == NULL)
-                                goto end;
-                        if (!BN_set_word(ret, BN_is_bit_set(a, 0)))
-                                {
-                                if (ret != in)
-                                        BN_free(ret);
-                                return NULL;
-                                }
-                        bn_check_top(ret);
-                        return ret;
-                        }
-                BNerr(BN_F_BN_MOD_SQRT, BN_R_P_IS_NOT_PRIME);
-                return(NULL);
-                }
-        if (BN_is_zero(a) || BN_is_one(a))
-                {
-                if (ret == NULL)
-                        ret = BN_new();
-                if (ret == NULL)
-                        goto end;
-                if (!BN_set_word(ret, BN_is_one(a)))
-                        {
-                        if (ret != in)
-                                BN_free(ret);
-                        return NULL;
-                        }
-                bn_check_top(ret);
-                return ret;
-                }
-        BN_CTX_start(ctx);
-        A = BN_CTX_get(ctx);
-        b = BN_CTX_get(ctx);
-        q = BN_CTX_get(ctx);
-        t = BN_CTX_get(ctx);
-        x = BN_CTX_get(ctx);
-        y = BN_CTX_get(ctx);
-        if (y == NULL) goto end;
-        
-        if (ret == NULL)
-                ret = BN_new();
-        if (ret == NULL) goto end;
-        /* A = a mod p */
-        if (!BN_nnmod(A, a, p, ctx)) goto end;
-        /* now write  |p| - 1  as  2^e*q  where  q  is odd */
-        e = 1;
-        while (!BN_is_bit_set(p, e))
-                e++;
-        /* we'll set  q  later (if needed) */
-        if (e == 1)
-                {
-                /* The easy case:  (|p|-1)/2  is odd, so 2 has an inverse
-                 * modulo  (|p|-1)/2,  and square roots can be computed
-                 * directly by modular exponentiation.
-                 * We have
-                 *     2 * (|p|+1)/4 == 1   (mod (|p|-1)/2),
-                 * so we can use exponent  (|p|+1)/4,  i.e.  (|p|-3)/4 + 1.
-                 */
-                if (!BN_rshift(q, p, 2)) goto end;
-                q->neg = 0;
-                if (!BN_add_word(q, 1)) goto end;
-                if (!BN_mod_exp(ret, A, q, p, ctx)) goto end;
-                err = 0;
-                goto vrfy;
-                }
-        
-        if (e == 2)
-                {
-                /* |p| == 5  (mod 8)
-                 *
-                 * In this case  2  is always a non-square since
-                 * Legendre(2,p) = (-1)^((p^2-1)/8)  for any odd prime.
-                 * So if  a  really is a square, then  2*a  is a non-square.
-                 * Thus for
-                 *      b := (2*a)^((|p|-5)/8),
-                 *      i := (2*a)*b^2
-                 * we have
-                 *     i^2 = (2*a)^((1 + (|p|-5)/4)*2)
-                 *         = (2*a)^((p-1)/2)
-                 *         = -1;
-                 * so if we set
-                 *      x := a*b*(i-1),
-                 * then
-                 *     x^2 = a^2 * b^2 * (i^2 - 2*i + 1)
-                 *         = a^2 * b^2 * (-2*i)
-                 *         = a*(-i)*(2*a*b^2)
-                 *         = a*(-i)*i
-                 *         = a.
-                 *
-                 * (This is due to A.O.L. Atkin, 
-                 * <URL: http://listserv.nodak.edu/scripts/wa.exe?A2=ind9211&L=nmbrthry&O=T&P=562>,
-                 * November 1992.)
-                 */
-                /* t := 2*a */
-                if (!BN_mod_lshift1_quick(t, A, p)) goto end;
-                /* b := (2*a)^((|p|-5)/8) */
-                if (!BN_rshift(q, p, 3)) goto end;
-                q->neg = 0;
-                if (!BN_mod_exp(b, t, q, p, ctx)) goto end;
-                /* y := b^2 */
-                if (!BN_mod_sqr(y, b, p, ctx)) goto end;
-                /* t := (2*a)*b^2 - 1*/
-                if (!BN_mod_mul(t, t, y, p, ctx)) goto end;
-                if (!BN_sub_word(t, 1)) goto end;
-                /* x = a*b*t */
-                if (!BN_mod_mul(x, A, b, p, ctx)) goto end;
-                if (!BN_mod_mul(x, x, t, p, ctx)) goto end;
-                if (!BN_copy(ret, x)) goto end;
-                err = 0;
-                goto vrfy;
-                }
-        
-        /* e > 2, so we really have to use the Tonelli/Shanks algorithm.
-         * First, find some  y  that is not a square. */
-        if (!BN_copy(q, p)) goto end; /* use 'q' as temp */
-        q->neg = 0;
-        i = 2;
-        do
-                {
-                /* For efficiency, try small numbers first;
-                 * if this fails, try random numbers.
-                 */
-                if (i < 22)
-                        {
-                        if (!BN_set_word(y, i)) goto end;
-                        }
-                else
-                        {
-                        if (!BN_pseudo_rand(y, BN_num_bits(p), 0, 0)) goto end;
-                        if (BN_ucmp(y, p) >= 0)
-                                {
-                                if (!(p->neg ? BN_add : BN_sub)(y, y, p)) goto end;
-                                }
-                        /* now 0 <= y < |p| */
-                        if (BN_is_zero(y))
-                                if (!BN_set_word(y, i)) goto end;
-                        }
-                
-                r = BN_kronecker(y, q, ctx); /* here 'q' is |p| */
-                if (r < -1) goto end;
-                if (r == 0)
-                        {
-                        /* m divides p */
-                        BNerr(BN_F_BN_MOD_SQRT, BN_R_P_IS_NOT_PRIME);
-                        goto end;
-                        }
-                }
-        while (r == 1 && ++i < 82);
-        
-        if (r != -1)
-                {
-                /* Many rounds and still no non-square -- this is more likely
-                 * a bug than just bad luck.
-                 * Even if  p  is not prime, we should have found some  y
-                 * such that r == -1.
-                 */
-                BNerr(BN_F_BN_MOD_SQRT, BN_R_TOO_MANY_ITERATIONS);
-                goto end;
-                }
-        /* Here's our actual 'q': */
-        if (!BN_rshift(q, q, e)) goto end;
-        /* Now that we have some non-square, we can find an element
-         * of order  2^e  by computing its q'th power. */
-        if (!BN_mod_exp(y, y, q, p, ctx)) goto end;
-        if (BN_is_one(y))
-                {
-                BNerr(BN_F_BN_MOD_SQRT, BN_R_P_IS_NOT_PRIME);
-                goto end;
-                }
-        /* Now we know that (if  p  is indeed prime) there is an integer
-         * k,  0 <= k < 2^e,  such that
-         *
-         *      a^q * y^k == 1   (mod p).
-         *
-         * As  a^q  is a square and  y  is not,  k  must be even.
-         * q+1  is even, too, so there is an element
-         *
-         *     X := a^((q+1)/2) * y^(k/2),
-         *
-         * and it satisfies
-         *
-         *     X^2 = a^q * a     * y^k
-         *         = a,
-         *
-         * so it is the square root that we are looking for.
-         */
-        
-        /* t := (q-1)/2  (note that  q  is odd) */
-        if (!BN_rshift1(t, q)) goto end;
-        
-        /* x := a^((q-1)/2) */
-        if (BN_is_zero(t)) /* special case: p = 2^e + 1 */
-                {
-                if (!BN_nnmod(t, A, p, ctx)) goto end;
-                if (BN_is_zero(t))
-                        {
-                        /* special case: a == 0  (mod p) */
-                        BN_zero(ret);
-                        err = 0;
-                        goto end;
-                        }
-                else
-                        if (!BN_one(x)) goto end;
-                }
-        else
-                {
-                if (!BN_mod_exp(x, A, t, p, ctx)) goto end;
-                if (BN_is_zero(x))
-                        {
-                        /* special case: a == 0  (mod p) */
-                        BN_zero(ret);
-                        err = 0;
-                        goto end;
-                        }
-                }
-        /* b := a*x^2  (= a^q) */
-        if (!BN_mod_sqr(b, x, p, ctx)) goto end;
-        if (!BN_mod_mul(b, b, A, p, ctx)) goto end;
-        
-        /* x := a*x    (= a^((q+1)/2)) */
-        if (!BN_mod_mul(x, x, A, p, ctx)) goto end;
-        while (1)
-                {
-                /* Now  b  is  a^q * y^k  for some even  k  (0 <= k < 2^E
-                 * where  E  refers to the original value of  e,  which we
-                 * don't keep in a variable),  and  x  is  a^((q+1)/2) * y^(k/2).
-                 *
-                 * We have  a*b = x^2,
-                 *    y^2^(e-1) = -1,
-                 *    b^2^(e-1) = 1.
-                 */
-                if (BN_is_one(b))
-                        {
-                        if (!BN_copy(ret, x)) goto end;
-                        err = 0;
-                        goto vrfy;
-                        }
-                /* find smallest  i  such that  b^(2^i) = 1 */
-                i = 1;
-                if (!BN_mod_sqr(t, b, p, ctx)) goto end;
-                while (!BN_is_one(t))
-                        {
-                        i++;
-                        if (i == e)
-                                {
-                                BNerr(BN_F_BN_MOD_SQRT, BN_R_NOT_A_SQUARE);
-                                goto end;
-                                }
-                        if (!BN_mod_mul(t, t, t, p, ctx)) goto end;
-                        }
-                
-                /* t := y^2^(e - i - 1) */
-                if (!BN_copy(t, y)) goto end;
-                for (j = e - i - 1; j > 0; j--)
-                        {
-                        if (!BN_mod_sqr(t, t, p, ctx)) goto end;
-                        }
-                if (!BN_mod_mul(y, t, t, p, ctx)) goto end;
-                if (!BN_mod_mul(x, x, t, p, ctx)) goto end;
-                if (!BN_mod_mul(b, b, y, p, ctx)) goto end;
-                e = i;
-                }
- vrfy:
-        if (!err)
-                {
-                /* verify the result -- the input might have been not a square
-                 * (test added in 0.9.8) */
-                
-                if (!BN_mod_sqr(x, ret, p, ctx))
-                        err = 1;
-                
-                if (!err && 0 != BN_cmp(x, A))
-                        {
-                        BNerr(BN_F_BN_MOD_SQRT, BN_R_NOT_A_SQUARE);
-                        err = 1;
-                        }
-                }
- end:
-        if (err)
-                {
-                if (ret != NULL && ret != in)
-                        {
-                        BN_clear_free(ret);
-                        }
-                ret = NULL;
-                }
-        BN_CTX_end(ctx);
-        bn_check_top(ret);
-        return ret;
-        }
diff --git a/src/lib/libcrypto/bn/bn_word.c b/src/lib/libcrypto/bn/bn_word.c
deleted file mode 100644
index ee7b87c45c..0000000000
--- a/src/lib/libcrypto/bn/bn_word.c
+++ /dev/null
@@ -1,247 +0,0 @@
-/* crypto/bn/bn_word.c */
-/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
- * All rights reserved.
- *
- * This package is an SSL implementation written
- * by Eric Young (eay@cryptsoft.com).
- * The implementation was written so as to conform with Netscapes SSL.
- * 
- * This library is free for commercial and non-commercial use as long as
- * the following conditions are aheared to.  The following conditions
- * apply to all code found in this distribution, be it the RC4, RSA,
- * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
- * included with this distribution is covered by the same copyright terms
- * except that the holder is Tim Hudson (tjh@cryptsoft.com).
- * 
- * Copyright remains Eric Young's, and as such any Copyright notices in
- * the code are not to be removed.
- * If this package is used in a product, Eric Young should be given attribution
- * as the author of the parts of the library used.
- * This can be in the form of a textual message at program startup or
- * in documentation (online or textual) provided with the package.
- * 
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. All advertising materials mentioning features or use of this software
- *    must display the following acknowledgement:
- *    "This product includes cryptographic software written by
- *     Eric Young (eay@cryptsoft.com)"
- *    The word 'cryptographic' can be left out if the rouines from the library
- *    being used are not cryptographic related :-).
- * 4. If you include any Windows specific code (or a derivative thereof) from 
- *    the apps directory (application code) you must include an acknowledgement:
- *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
- * 
- * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * 
- * The licence and distribution terms for any publically available version or
- * derivative of this code cannot be changed.  i.e. this code cannot simply be
- * copied and put under another distribution licence
- * [including the GNU Public Licence.]
- */
-#include <stdio.h>
-#include "cryptlib.h"
-#include "bn_lcl.h"
-BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w)
-        {
-#ifndef BN_LLONG
-        BN_ULONG ret=0;
-#else
-        BN_ULLONG ret=0;
-#endif
-        int i;
-        if (w == 0)
-                return (BN_ULONG)-1;
-        bn_check_top(a);
-        w&=BN_MASK2;
-        for (i=a->top-1; i>=0; i--)
-                {
-#ifndef BN_LLONG
-                ret=((ret<<BN_BITS4)|((a->d[i]>>BN_BITS4)&BN_MASK2l))%w;
-                ret=((ret<<BN_BITS4)|(a->d[i]&BN_MASK2l))%w;
-#else
-                ret=(BN_ULLONG)(((ret<<(BN_ULLONG)BN_BITS2)|a->d[i])%
-                        (BN_ULLONG)w);
-#endif
-                }
-        return((BN_ULONG)ret);
-        }
-BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
-        {
-        BN_ULONG ret = 0;
-        int i, j;
-        bn_check_top(a);
-        w &= BN_MASK2;
-        if (!w)
-                /* actually this an error (division by zero) */
-                return (BN_ULONG)-1;
-        if (a->top == 0)
-                return 0;
-        /* normalize input (so bn_div_words doesn't complain) */
-        j = BN_BITS2 - BN_num_bits_word(w);
-        w <<= j;
-        if (!BN_lshift(a, a, j))
-                return (BN_ULONG)-1;
-        for (i=a->top-1; i>=0; i--)
-                {
-                BN_ULONG l,d;
-                
-                l=a->d[i];
-                d=bn_div_words(ret,l,w);
-                ret=(l-((d*w)&BN_MASK2))&BN_MASK2;
-                a->d[i]=d;
-                }
-        if ((a->top > 0) && (a->d[a->top-1] == 0))
-                a->top--;
-        ret >>= j;
-        bn_check_top(a);
-        return(ret);
-        }
-int BN_add_word(BIGNUM *a, BN_ULONG w)
-        {
-        BN_ULONG l;
-        int i;
-        bn_check_top(a);
-        w &= BN_MASK2;
-        /* degenerate case: w is zero */
-        if (!w) return 1;
-        /* degenerate case: a is zero */
-        if(BN_is_zero(a)) return BN_set_word(a, w);
-        /* handle 'a' when negative */
-        if (a->neg)
-                {
-                a->neg=0;
-                i=BN_sub_word(a,w);
-                if (!BN_is_zero(a))
-                        a->neg=!(a->neg);
-                return(i);
-                }
-        /* Only expand (and risk failing) if it's possibly necessary */
-        if (((BN_ULONG)(a->d[a->top - 1] + 1) == 0) &&
-                        (bn_wexpand(a,a->top+1) == NULL))
-                return(0);
-        i=0;
-        for (;;)
-                {
-                if (i >= a->top)
-                        l=w;
-                else
-                        l=(a->d[i]+w)&BN_MASK2;
-                a->d[i]=l;
-                if (w > l)
-                        w=1;
-                else
-                        break;
-                i++;
-                }
-        if (i >= a->top)
-                a->top++;
-        bn_check_top(a);
-        return(1);
-        }
-int BN_sub_word(BIGNUM *a, BN_ULONG w)
-        {
-        int i;
-        bn_check_top(a);
-        w &= BN_MASK2;
-        /* degenerate case: w is zero */
-        if (!w) return 1;
-        /* degenerate case: a is zero */
-        if(BN_is_zero(a))
-                {
-                i = BN_set_word(a,w);
-                if (i != 0)
-                        BN_set_negative(a, 1);
-                return i;
-                }
-        /* handle 'a' when negative */
-        if (a->neg)
-                {
-                a->neg=0;
-                i=BN_add_word(a,w);
-                a->neg=1;
-                return(i);
-                }
-        if ((a->top == 1) && (a->d[0] < w))
-                {
-                a->d[0]=w-a->d[0];
-                a->neg=1;
-                return(1);
-                }
-        i=0;
-        for (;;)
-                {
-                if (a->d[i] >= w)
-                        {
-                        a->d[i]-=w;
-                        break;
-                        }
-                else
-                        {
-                        a->d[i]=(a->d[i]-w)&BN_MASK2;
-                        i++;
-                        w=1;
-                        }
-                }
-        if ((a->d[i] == 0) && (i == (a->top-1)))
-                a->top--;
-        bn_check_top(a);
-        return(1);
-        }
-int BN_mul_word(BIGNUM *a, BN_ULONG w)
-        {
-        BN_ULONG ll;
-        bn_check_top(a);
-        w&=BN_MASK2;
-        if (a->top)
-                {
-                if (w == 0)
-                        BN_zero(a);
-                else
-                        {
-                        ll=bn_mul_words(a->d,a->d,a->top,w);
-                        if (ll)
-                                {
-                                if (bn_wexpand(a,a->top+1) == NULL) return(0);
-                                a->d[a->top++]=ll;
-                                }
-                        }
-                }
-        bn_check_top(a);
-        return(1);
-        }
diff --git a/src/lib/libcrypto/bn/bn_x931p.c b/src/lib/libcrypto/bn/bn_x931p.c
deleted file mode 100644
index 04c5c874ec..0000000000
--- a/src/lib/libcrypto/bn/bn_x931p.c
+++ /dev/null
@@ -1,272 +0,0 @@
-/* bn_x931p.c */
-/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
- * project 2005.
- */
-/* ====================================================================
- * Copyright (c) 2005 The OpenSSL Project.  All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer. 
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in
- *    the documentation and/or other materials provided with the
- *    distribution.
- *
- * 3. All advertising materials mentioning features or use of this
- *    software must display the following acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
- *
- * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
- *    endorse or promote products derived from this software without
- *    prior written permission. For written permission, please contact
- *    licensing@OpenSSL.org.
- *
- * 5. Products derived from this software may not be called "OpenSSL"
- *    nor may "OpenSSL" appear in their names without prior written
- *    permission of the OpenSSL Project.
- *
- * 6. Redistributions of any form whatsoever must retain the following
- *    acknowledgment:
- *    "This product includes software developed by the OpenSSL Project
- *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
- *
- * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
- * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
- * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
- * OF THE POSSIBILITY OF SUCH DAMAGE.
- * ====================================================================
- *
- * This product includes cryptographic software written by Eric Young
- * (eay@cryptsoft.com).  This product includes software written by Tim
- * Hudson (tjh@cryptsoft.com).
- *
- */
-#include <stdio.h>
-#include <openssl/bn.h>
-/* X9.31 routines for prime derivation */
-/* X9.31 prime derivation. This is used to generate the primes pi
- * (p1, p2, q1, q2) from a parameter Xpi by checking successive odd
- * integers.
- */
-static int bn_x931_derive_pi(BIGNUM *pi, const BIGNUM *Xpi, BN_CTX *ctx,
-                        BN_GENCB *cb)
-        {
-        int i = 0;
-        if (!BN_copy(pi, Xpi))
-                return 0;
-        if (!BN_is_odd(pi) && !BN_add_word(pi, 1))
-                return 0;
-        for(;;)
-                {
-                i++;
-                BN_GENCB_call(cb, 0, i);
-                /* NB 27 MR is specificed in X9.31 */
-                if (BN_is_prime_fasttest_ex(pi, 27, ctx, 1, cb))
-                        break;
-                if (!BN_add_word(pi, 2))
-                        return 0;
-                }
-        BN_GENCB_call(cb, 2, i);
-        return 1;
-        }
-/* This is the main X9.31 prime derivation function. From parameters
- * Xp1, Xp2 and Xp derive the prime p. If the parameters p1 or p2 are
- * not NULL they will be returned too: this is needed for testing.
- */
-int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
-                        const BIGNUM *Xp, const BIGNUM *Xp1, const BIGNUM *Xp2,
-                        const BIGNUM *e, BN_CTX *ctx, BN_GENCB *cb)
-        {
-        int ret = 0;
-        BIGNUM *t, *p1p2, *pm1;
-        /* Only even e supported */
-        if (!BN_is_odd(e))
-                return 0;
-        BN_CTX_start(ctx);
-        if (!p1)
-                p1 = BN_CTX_get(ctx);
-        if (!p2)
-                p2 = BN_CTX_get(ctx);
-        t = BN_CTX_get(ctx);
-        p1p2 = BN_CTX_get(ctx);
-        pm1 = BN_CTX_get(ctx);
-        if (!bn_x931_derive_pi(p1, Xp1, ctx, cb))
-                goto err;
-        if (!bn_x931_derive_pi(p2, Xp2, ctx, cb))
-                goto err;
-        if (!BN_mul(p1p2, p1, p2, ctx))
-                goto err;
-        /* First set p to value of Rp */
-        if (!BN_mod_inverse(p, p2, p1, ctx))
-                goto err;
-        if (!BN_mul(p, p, p2, ctx))
-                goto err;
-        if (!BN_mod_inverse(t, p1, p2, ctx))
-                goto err;
-        if (!BN_mul(t, t, p1, ctx))
-                goto err;
-        if (!BN_sub(p, p, t))
-                goto err;
-        if (p->neg && !BN_add(p, p, p1p2))
-                goto err;
-        /* p now equals Rp */
-        if (!BN_mod_sub(p, p, Xp, p1p2, ctx))
-                goto err;
-        if (!BN_add(p, p, Xp))
-                goto err;
-        /* p now equals Yp0 */
-        for (;;)
-                {
-                int i = 1;
-                BN_GENCB_call(cb, 0, i++);
-                if (!BN_copy(pm1, p))
-                        goto err;
-                if (!BN_sub_word(pm1, 1))
-                        goto err;
-                if (!BN_gcd(t, pm1, e, ctx))
-                        goto err;
-                if (BN_is_one(t)
-                /* X9.31 specifies 8 MR and 1 Lucas test or any prime test
-                 * offering similar or better guarantees 50 MR is considerably 
-                 * better.
-                 */
-                        && BN_is_prime_fasttest_ex(p, 50, ctx, 1, cb))
-                        break;
-                if (!BN_add(p, p, p1p2))
-                        goto err;
-                }
-        BN_GENCB_call(cb, 3, 0);
-        ret = 1;
-        err:
-        BN_CTX_end(ctx);
-        return ret;
-        }
-/* Generate pair of paramters Xp, Xq for X9.31 prime generation.
- * Note: nbits paramter is sum of number of bits in both.
- */
-int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx)
-        {
-        BIGNUM *t;
-        int i;
-        /* Number of bits for each prime is of the form
-         * 512+128s for s = 0, 1, ...
-         */
-        if ((nbits < 1024) || (nbits & 0xff))
-                return 0;
-        nbits >>= 1;
-        /* The random value Xp must be between sqrt(2) * 2^(nbits-1) and
-         * 2^nbits - 1. By setting the top two bits we ensure that the lower
-         * bound is exceeded.
-         */
-        if (!BN_rand(Xp, nbits, 1, 0))
-                return 0;
-        BN_CTX_start(ctx);
-        t = BN_CTX_get(ctx);
-        for (i = 0; i < 1000; i++)
-                {
-                if (!BN_rand(Xq, nbits, 1, 0))
-                        return 0;
-                /* Check that |Xp - Xq| > 2^(nbits - 100) */
-                BN_sub(t, Xp, Xq);
-                if (BN_num_bits(t) > (nbits - 100))
-                        break;
-                }
-        BN_CTX_end(ctx);
-        if (i < 1000)
-                return 1;
-        return 0;
-        }
-/* Generate primes using X9.31 algorithm. Of the values p, p1, p2, Xp1
- * and Xp2 only 'p' needs to be non-NULL. If any of the others are not NULL
- * the relevant parameter will be stored in it.
- *
- * Due to the fact that |Xp - Xq| > 2^(nbits - 100) must be satisfied Xp and Xq
- * are generated using the previous function and supplied as input.
- */
-int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
-                        BIGNUM *Xp1, BIGNUM *Xp2,
-                        const BIGNUM *Xp,
-                        const BIGNUM *e, BN_CTX *ctx,
-                        BN_GENCB *cb)
-        {
-        int ret = 0;
-        BN_CTX_start(ctx);
-        if (!Xp1)
-                Xp1 = BN_CTX_get(ctx);
-        if (!Xp2)
-                Xp2 = BN_CTX_get(ctx);
-        if (!BN_rand(Xp1, 101, 0, 0))
-                goto error;
-        if (!BN_rand(Xp2, 101, 0, 0))
-                goto error;
-        if (!BN_X931_derive_prime_ex(p, p1, p2, Xp, Xp1, Xp2, e, ctx, cb))
-                goto error;
-        ret = 1;
-        error:
-        BN_CTX_end(ctx);
-        return ret;
-        }