HomeSort by relevance Sort by last modified time
    Searched refs:Xupdate (Results 1 - 6 of 6) sorted by null

  /external/openssl/crypto/sha/asm/
sha1-s390x.pl 20 # Optimize Xupdate for amount of memory references and reschedule
47 sub Xupdate {
51 lg $prefetch,160($sp) ### Xupdate(16) warm-up
54 return if ($i&1); # Xupdate is vectorized and executed every 2nd cycle
60 xgr $X[0],$prefetch ### Xupdate($i)
80 &Xupdate($i);
99 &Xupdate($i);
117 &Xupdate($i);
sha1-armv4-large.pl 80 sub Xupdate {
115 &Xupdate(@_);
125 &Xupdate(@_);
134 &Xupdate(@_,1);
sha1-sparcv9.pl 79 sub Xupdate {
91 sllx @X[($j+6)%8],32,$Xi ! Xupdate($i)
112 &Xupdate(@_);
136 &Xupdate(@_);
159 &Xupdate(@_);
sha512-sparcv9.pl 276 srl $xi,@sigma0[0],$T1 !! Xupdate($i)
339 sllx %l2,32,$tmp0 !! Xupdate($i)
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
  /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), \
160 Xupdate(f,xi,xa,xb,xc,xd); \
165 Xupdate(f,xi,xa,xb,xc,xd); \
170 Xupdate(f,xa,xa,xb,xc,xd); \
175 Xupdate(f,xa,xa,xb,xc,xd); \
180 Xupdate(f,xa,xa,xb,xc,xd); \
369 Xupdate(T,xa,xa,xb,xc,xd); \
375 Xupdate(T,xa,xa,xb,xc,xd);
    [all...]

Completed in 117 milliseconds