3 # ====================================================================
4 # Written by Andy Polyakov <appro@fy.chalmers.se> for the OpenSSL
5 # project. The module is, however, dual licensed under OpenSSL and
6 # CRYPTOGAMS licenses depending on where you obtain it. For further
7 # details see http://www.openssl.org/~appro/cryptogams/.
8 # ====================================================================
10 # Eternal question is what's wrong with compiler generated code? The
11 # trick is that it's possible to reduce the number of shifts required
12 # to perform rotations by maintaining copy of 32-bit value in upper
13 # bits of 64-bit register. Just follow mux2 and shrp instructions...
14 # Performance under big-endian OS such as HP-UX is 179MBps*1GHz, which
15 # is >50% better than HP C and >2x better than gcc.
20 .ident \"sha1-ia64.s, version 1.3\"
21 .ident \"IA-64 ISA artwork by Andy Polyakov <appro\@fy.chalmers.se>\"
29 for (@ARGV) { $ADDP="add" if (/[\+DD|\-mlp]64/); }
30 } else { $ADDP="add"; }
33 if ($human) { # useful for visual code auditing...
34 ($A,$B,$C,$D,$E) = ("A","B","C","D","E");
35 ($h0,$h1,$h2,$h3,$h4) = ("h0","h1","h2","h3","h4");
36 ($K_00_19, $K_20_39, $K_40_59, $K_60_79) =
37 ( "K_00_19","K_20_39","K_40_59","K_60_79" );
38 @X= ( "X0", "X1", "X2", "X3", "X4", "X5", "X6", "X7",
39 "X8", "X9","X10","X11","X12","X13","X14","X15" );
42 ($A,$B,$C,$D,$E) = ("loc0","loc1","loc2","loc3","loc4");
43 ($h0,$h1,$h2,$h3,$h4) = ("loc5","loc6","loc7","loc8","loc9");
44 ($K_00_19, $K_20_39, $K_40_59, $K_60_79) =
45 ( "r14", "r15", "loc10", "loc11" );
46 @X= ( "r16", "r17", "r18", "r19", "r20", "r21", "r22", "r23",
47 "r24", "r25", "r26", "r27", "r28", "r29", "r30", "r31" );
52 my ($i,$a,$b,$c,$d,$e)=@_;
56 $code.=<<___ if ($i==0);
57 { .mmi; ld1 $X[$i]=[inp],2 // MSB
59 { .mmi; ld1 tmp0=[inp],2
60 ld1 tmp4=[tmp3],2 // LSB
61 dep $X[$i]=$X[$i],tmp2,8,8 };;
65 { .mmi; ld1 $Xn=[inp],2 // forward Xload
67 dep tmp1=tmp0,tmp4,8,8 };;
68 { .mmi; ld1 tmp2=[tmp3],2 // forward Xload
70 dep $X[$i]=$X[$i],tmp1,16,16} //;;
71 { .mmi; add $e=$e,$K_00_19 // e+=K_00_19
73 dep.z tmp5=$a,5,27 };; // a<<5
74 { .mmi; add $e=$e,$X[$i] // e+=Xload
75 or tmp4=tmp4,tmp1 // F_00_19(b,c,d)=(b&c)|(~b&d)
76 extr.u tmp1=$a,27,5 };; // a>>27
77 { .mmi; ld1 tmp0=[inp],2 // forward Xload
78 add $e=$e,tmp4 // e+=F_00_19(b,c,d)
79 shrp $b=tmp6,tmp6,2 } // b=ROTATE(b,30)
80 { .mmi; ld1 tmp4=[tmp3],2 // forward Xload
81 or tmp5=tmp1,tmp5 // ROTATE(a,5)
82 mux2 tmp6=$a,0x44 };; // see b in next iteration
83 { .mii; add $e=$e,tmp5 // e+=ROTATE(a,5)
84 dep $Xn=$Xn,tmp2,8,8 // forward Xload
85 mux2 $X[$i]=$X[$i],0x44 } //;;
91 { .mii; and tmp3=$c,$b
92 dep tmp1=tmp0,tmp4,8,8;;
93 dep $X[$i]=$X[$i],tmp1,16,16} //;;
94 { .mmi; add $e=$e,$K_00_19 // e+=K_00_19
96 dep.z tmp5=$a,5,27 };; // a<<5
97 { .mmi; add $e=$e,$X[$i] // e+=Xupdate
98 or tmp4=tmp3,tmp1 // F_00_19(b,c,d)=(b&c)|(~b&d)
99 extr.u tmp1=$a,27,5 } // a>>27
100 { .mmi; xor $Xn=$Xn,$X[($j+2)%16] // forward Xupdate
101 xor tmp3=$X[($j+8)%16],$X[($j+13)%16] // forward Xupdate
103 { .mmi; add $e=$e,tmp4 // e+=F_00_19(b,c,d)
104 xor $Xn=$Xn,tmp3 // forward Xupdate
105 shrp $b=tmp6,tmp6,2 } // b=ROTATE(b,30)
106 { .mmi; or tmp1=tmp1,tmp5 // ROTATE(a,5)
107 mux2 tmp6=$a,0x44 };; // see b in next iteration
108 { .mii; add $e=$e,tmp1 // e+=ROTATE(a,5)
109 shrp $Xn=$Xn,$Xn,31 // ROTATE(x[0]^x[2]^x[8]^x[13],1)
110 mux2 $X[$i]=$X[$i],0x44 };;
118 my ($i,$a,$b,$c,$d,$e)=@_;
123 { .mib; add $e=$e,$K_00_19 // e+=K_00_19
124 dep.z tmp5=$a,5,27 } // a<<5
125 { .mib; andcm tmp1=$d,$b
127 { .mmi; add $e=$e,$X[$i%16] // e+=Xupdate
128 or tmp0=tmp0,tmp1 // F_00_19(b,c,d)=(b&c)|(~b&d)
129 extr.u tmp1=$a,27,5 } // a>>27
130 { .mmi; xor $Xn=$Xn,$X[($j+2)%16] // forward Xupdate
131 xor tmp3=$X[($j+8)%16],$X[($j+13)%16] // forward Xupdate
133 { .mmi; add $e=$e,tmp0 // f+=F_00_19(b,c,d)
134 xor $Xn=$Xn,tmp3 // forward Xupdate
135 shrp $b=tmp6,tmp6,2 } // b=ROTATE(b,30)
136 { .mmi; or tmp1=tmp1,tmp5 // ROTATE(a,5)
137 mux2 tmp6=$a,0x44 };; // see b in next iteration
138 { .mii; add $e=$e,tmp1 // e+=ROTATE(a,5)
139 shrp $Xn=$Xn,$Xn,31 // ROTATE(x[0]^x[2]^x[8]^x[13],1)
147 my ($i,$a,$b,$c,$d,$e,$Konst)=@_;
148 $Konst = $K_20_39 if (!defined($Konst));
154 { .mib; add $e=$e,$Konst // e+=K_XX_XX
155 dep.z tmp5=$a,5,27 } // a<<5
156 { .mib; xor tmp0=$c,$b
157 xor $Xn=$Xn,$X[($j+2)%16] };; // forward Xupdate
158 { .mib; add $e=$e,$X[$i%16] // e+=Xupdate
159 extr.u tmp1=$a,27,5 } // a>>27
160 { .mib; xor tmp0=tmp0,$d // F_20_39(b,c,d)=b^c^d
161 xor $Xn=$Xn,$X[($j+8)%16] };; // forward Xupdate
162 { .mmi; add $e=$e,tmp0 // e+=F_20_39(b,c,d)
163 xor $Xn=$Xn,$X[($j+13)%16] // forward Xupdate
164 shrp $b=tmp6,tmp6,2 } // b=ROTATE(b,30)
165 { .mmi; or tmp1=tmp1,tmp5 // ROTATE(a,5)
166 mux2 tmp6=$a,0x44 };; // see b in next iteration
167 { .mii; add $e=$e,tmp1 // e+=ROTATE(a,5)
168 shrp $Xn=$Xn,$Xn,31 // ROTATE(x[0]^x[2]^x[8]^x[13],1)
175 { .mib; add $e=$e,$Konst // e+=K_60_79
176 dep.z tmp5=$a,5,27 } // a<<5
177 { .mib; xor tmp0=$c,$b
178 add $h1=$h1,$a };; // wrap up
179 { .mib; add $e=$e,$X[$i%16] // e+=Xupdate
180 extr.u tmp1=$a,27,5 } // a>>27
181 { .mib; xor tmp0=tmp0,$d // F_20_39(b,c,d)=b^c^d
182 add $h3=$h3,$c };; // wrap up
183 { .mmi; add $e=$e,tmp0 // e+=F_20_39(b,c,d)
184 or tmp1=tmp1,tmp5 // ROTATE(a,5)
185 shrp $b=tmp6,tmp6,2 };; // b=ROTATE(b,30) ;;?
186 { .mmi; add $e=$e,tmp1 // e+=ROTATE(a,5)
187 add tmp3=1,inp // used in unaligned codepath
188 add $h4=$h4,$d };; // wrap up
196 my ($i,$a,$b,$c,$d,$e)=@_;
201 { .mib; add $e=$e,$K_40_59 // e+=K_40_59
202 dep.z tmp5=$a,5,27 } // a<<5
203 { .mib; and tmp1=$c,$d
205 { .mmi; add $e=$e,$X[$i%16] // e+=Xupdate
206 add tmp5=tmp5,tmp1 // a<<5+(c&d)
207 extr.u tmp1=$a,27,5 } // a>>27
208 { .mmi; and tmp0=tmp0,$b
209 xor $Xn=$Xn,$X[($j+2)%16] // forward Xupdate
210 xor tmp3=$X[($j+8)%16],$X[($j+13)%16] };; // forward Xupdate
211 { .mmi; add $e=$e,tmp0 // e+=b&(c^d)
212 add tmp5=tmp5,tmp1 // ROTATE(a,5)+(c&d)
213 shrp $b=tmp6,tmp6,2 } // b=ROTATE(b,30)
214 { .mmi; xor $Xn=$Xn,tmp3
215 mux2 tmp6=$a,0x44 };; // see b in next iteration
216 { .mii; add $e=$e,tmp5 // e+=ROTATE(a,5)+(c&d)
217 shrp $Xn=$Xn,$Xn,31 // ROTATE(x[0]^x[2]^x[8]^x[13],1)
222 sub BODY_60_79 { &BODY_20_39(@_,$K_60_79); }
234 // void sha1_block_data_order(SHA_CTX *c,const void *p,size_t num);
235 .global sha1_block_data_order#
236 .proc sha1_block_data_order#
238 sha1_block_data_order:
240 { .mmi; alloc tmp1=ar.pfs,3,14,0,0
244 { .mmi; $ADDP ctx=0,ctx
251 { .mlx; ld4 $h0=[ctx],8
252 movl $K_00_19=0x5a827999 }
253 { .mlx; ld4 $h1=[tmp0],8
254 movl $K_20_39=0x6ed9eba1 };;
255 { .mlx; ld4 $h2=[ctx],8
256 movl $K_40_59=0x8f1bbcdc }
257 { .mlx; ld4 $h3=[tmp0]
258 movl $K_60_79=0xca62c1d6 };;
259 { .mmi; ld4 $h4=[ctx],-16
260 add in2=-1,in2 // adjust num for ar.lc
264 mov ar.lc=in2 };; // brp.loop.imp: too far
277 my @V=($A,$B,$C,$D,$E);
279 for($i=0;$i<16;$i++) { &BODY_00_15(\$code,$i,@V); unshift(@V,pop(@V)); }
280 for(;$i<20;$i++) { &BODY_16_19(\$code,$i,@V); unshift(@V,pop(@V)); }
281 for(;$i<40;$i++) { &BODY_20_39(\$code,$i,@V); unshift(@V,pop(@V)); }
282 for(;$i<60;$i++) { &BODY_40_59(\$code,$i,@V); unshift(@V,pop(@V)); }
283 for(;$i<80;$i++) { &BODY_60_79(\$code,$i,@V); unshift(@V,pop(@V)); }
285 (($V[0] eq $A) and ($V[4] eq $E)) or die; # double-check
289 { .mmb; add $h0=$h0,$A
291 br.ctop.dptk.many .Ldtop };;
293 { .mmi; add tmp0=4,ctx
295 { .mmi; st4 [ctx]=$h0,8
297 { .mmi; st4 [ctx]=$h2,8
299 { .mib; st4 [ctx]=$h4,-16
301 br.ret.sptk.many b0 };;
302 .endp sha1_block_data_order#
303 stringz "SHA1 block transform for IA64, CRYPTOGAMS by <appro\@openssl.org>"
306 open STDOUT,">$output" if $output;