/external/openssl/crypto/sha/asm/ |
sha1-s390x.pl | 20 # Optimize Xupdate for amount of memory references and reschedule 67 sub Xupdate { 71 lg $prefetch,$stdframe($sp) ### Xupdate(16) warm-up 74 return if ($i&1); # Xupdate is vectorized and executed every 2nd cycle 80 xgr $X[0],$prefetch ### Xupdate($i) 100 &Xupdate($i); 119 &Xupdate($i); 137 &Xupdate($i);
|
sha1-ia64.pl | 95 { .mmi; add $e=$e,$X[$i] // e+=Xupdate 98 { .mmi; xor $Xn=$Xn,$X[($j+2)%16] // forward Xupdate 99 xor tmp3=$X[($j+8)%16],$X[($j+13)%16] // forward Xupdate 102 xor $Xn=$Xn,tmp3 // forward Xupdate 125 { .mmi; add $e=$e,$X[$i%16] // e+=Xupdate 128 { .mmi; xor $Xn=$Xn,$X[($j+2)%16] // forward Xupdate 129 xor tmp3=$X[($j+8)%16],$X[($j+13)%16] // forward Xupdate 132 xor $Xn=$Xn,tmp3 // forward Xupdate 155 xor $Xn=$Xn,$X[($j+2)%16] };; // forward Xupdate 156 { .mib; add $e=$e,$X[$i%16] // e+=Xupdate [all...] |
sha1-sparcv9.pl | 79 sub Xupdate { 91 sllx @X[($j+6)%8],32,$Xi ! Xupdate($i) 112 &Xupdate(@_); 136 &Xupdate(@_); 159 &Xupdate(@_);
|
sha1-alpha.pl | 15 # byte swap, but not Xupdate. 105 $code.=<<___ if ($i>=15); # with forward Xupdate 138 $code.=<<___ if ($i<79); # with forward Xupdate 195 $code.=<<___; # with forward Xupdate
|
sha1-armv4-large.pl | 74 sub Xupdate { 128 &Xupdate(@_,"and $t1,$b,$t1,ror#2"); 137 &Xupdate(@_,"eor $t1,$b,$t1,ror#2"); 145 &Xupdate(@_,"and $t1,$b,$t1,ror#2","and $t2,$c,$d");
|
sha256-mips.S | 887 srl $14,$9,3 # Xupdate(16) 952 srl $15,$10,3 # Xupdate(17) 1017 srl $16,$11,3 # Xupdate(18) 1082 srl $17,$12,3 # Xupdate(19) 1147 srl $18,$13,3 # Xupdate(20) 1212 srl $19,$14,3 # Xupdate(21) 1277 srl $20,$15,3 # Xupdate(22) 1342 srl $21,$16,3 # Xupdate(23) 1407 srl $22,$17,3 # Xupdate(24) 1472 srl $23,$18,3 # Xupdate(25 [all...] |
sha1-586.pl | 51 # or Xupdate in OpenSSL source, to SIMD unit. The idea is not novel, 170 &xor($f,&swtmp(($n+2)%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) 187 &xor($f,&swtmp(($n+2)%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) 214 &xor($f,&swtmp(($n+2)%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) 232 &xor($f,&swtmp(($n+2)%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) 257 &xor($f,&swtmp(($n+2)%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) 276 &xor($f,&swtmp(($n+2)%16)); # f to hold Xupdate(xi,xa,xb,xc,xd) 396 # 32 elements of the message schedule or Xupdate outputs. First 4 415 my $Xi=4; # 4xSIMD Xupdate round, start pre-seeded 857 my $Xi=4; # 4xSIMD Xupdate round, start pre-seede [all...] |
sha1-sparcv9a.pl | 13 # pairable(*) with IALU ones, offloading of Xupdate to the UltraSPARC 82 # This is reference 2x-parallelized VIS-powered Xupdate procedure. It 84 sub Xupdate { 121 # half-round VIS timing, because there are 16 Xupdate-free rounds, 131 # The reference Xupdate procedure is then "strained" over *pairs* of
|
sha1-parisc.pl | 75 $code.=<<___ if ($i>=15); # with forward Xupdate
|
sha512-sparcv9.pl | 276 srl $xi,@sigma0[0],$T1 !! Xupdate($i) 339 sllx %l2,32,$tmp0 !! Xupdate($i)
|
sha1-mips.pl | 14 # vectorized Xupdate on MIPSIII/IV, but the goal was to code MIPS32-
|
sha512-mips.pl | 210 $SRL $tmp2,@X[1],@sigma0[0] # Xupdate($i)
|
sha1-x86_64.pl | 43 # or Xupdate in OpenSSL source, to SIMD unit. See sha1-586.pl module
|
/external/openssl/crypto/sha/ |
sha_locl.h | 86 # define Xupdate(a,ix,ia,ib,ic,id) (ix=(a)=(ia^ib^ic^id)) 99 # define Xupdate(a,ix,ia,ib,ic,id) do { (a)=(ia^ib^ic^id); \ 103 # define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \ 164 Xupdate(f,xi,xa,xb,xc,xd); \ 169 Xupdate(f,xi,xa,xb,xc,xd); \ 174 Xupdate(f,xa,xa,xb,xc,xd); \ 179 Xupdate(f,xa,xa,xb,xc,xd); \ 184 Xupdate(f,xa,xa,xb,xc,xd); \ 373 Xupdate(T,xa,xa,xb,xc,xd); \ 379 Xupdate(T,xa,xa,xb,xc,xd); [all...] |
/external/sqlite/dist/orig/ |
sqlite3.c | [all...] |
sqlite3.h | [all...] |
/external/sqlite/dist/ |
sqlite3.c | [all...] |
sqlite3.h | [all...] |
/external/webkit/WebKitLibraries/WebCoreSQLite3/ |
sqlite3.h | [all...] |