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

  /external/openssl/crypto/bn/asm/
s390x-mont.pl 77 $alo="%r9";
126 lg $alo,0($ap)
127 _dswap $alo
131 lgr $mn0,$alo # "tp[0]"*n0
137 algr $nlo,$alo # +="tp[0]"
146 lg $alo,0($j,$ap)
147 _dswap $alo
149 algr $alo,$AHI
159 algr $nlo,$alo
176 lg $alo,0($ap
    [all...]
ia64-mont.pl 120 .rotf alo[6],nlo[4],ahi[8],nhi[6]
124 ldf8 alo[4]=[aptr],16 // ap[0]
126 { .mmi; ldf8 alo[3]=[r30],16 // ap[1]
127 ldf8 alo[2]=[aptr],16 // ap[2]
129 { .mmi; ldf8 alo[1]=[r30] // ap[3]
142 xmpy.hu ahi[2]=alo[4],bi // ap[0]*bp[0]
145 xmpy.lu alo[4]=alo[4],bi
149 xma.hu ahi[1]=alo[3],bi,ahi[2] // ap[1]*bp[0]
152 xma.lu alo[3]=alo[3],bi,ahi[2
    [all...]
armv4-mont.pl 54 $alo="r10"; # sl, gcc uses it to keep @GOT
124 umull $alo,$ahi,$aj,$bi @ ap[0]*bp[0]
126 mul $n0,$alo,$n0 @ "tp[0]"*n0
128 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
133 mov $alo,$ahi
136 umlal $alo,$ahi,$aj,$bi @ ap[j]*bp[0]
139 adds $nlo,$nlo,$alo
160 ldr $alo,[sp] @ tp[0]
165 umlal $alo,$ahi,$aj,$bi @ ap[0]*bp[i]+tp[0]
167 mul $n0,$alo,$n
    [all...]
mips3-mont.pl 37 $alo="s0";
95 ld $alo,8($ap)
102 dmultu $alo,$bi
103 mflo $alo
127 daddu $lo0,$alo,$hi0
133 mflo $alo
150 daddu $lo0,$alo,$hi0
174 ld $alo,8($ap)
188 dmultu $alo,$bi
189 mflo $alo
    [all...]
mips-mont.pl 105 $alo=$s4;
180 $LD $alo,$BNSZ($ap)
187 $MULTU $alo,$bi
188 mflo $alo
212 $ADDU $lo0,$alo,$hi0
218 mflo $alo
235 $ADDU $lo0,$alo,$hi0
259 $LD $alo,$BNSZ($ap)
273 $MULTU $alo,$bi
274 mflo $alo
    [all...]
alpha-mont.pl 34 $alo="t8";
101 mulq $aj,$bi,$alo
118 addq $alo,$hi0,$lo0
119 mulq $aj,$bi,$alo
144 addq $alo,$hi0,$lo0
190 mulq $aj,$bi,$alo
207 addq $alo,$hi0,$lo0 #L1
210 mulq $aj,$bi,$alo #U1
237 addq $alo,$hi0,$lo0
ppc-mont.pl 102 $alo="r29";
163 $UMULL $alo,$aj,$m0 ; ap[1]*bp[0]
180 addc $lo0,$alo,$hi0
183 $UMULL $alo,$aj,$m0 ; ap[j]*bp[0]
197 addc $lo0,$alo,$hi0
224 $UMULL $alo,$aj,$m0 ; ap[j]*bp[i]
242 addc $lo0,$alo,$hi0
247 $UMULL $alo,$aj,$m0 ; ap[j]*bp[i]
262 addc $lo0,$alo,$hi0
sparcv9a-mont.pl 111 $alo="%f16"; $alo_="%f17"; $ahi="%f18"; $ahi_="%f19";
195 fzeros $alo
205 fxtod $alo,$alo
223 std $alo,[$ap_l+$j] ! save smashed ap[j] in double format
232 fmuld $alo,$ba,$aloa
234 fmuld $alo,$bb,$alob
236 fmuld $alo,$bc,$aloc
239 fmuld $alo,$bd,$alod
276 fzeros $alo
    [all...]
  /external/chromium_org/third_party/boringssl/src/crypto/bn/asm/
armv4-mont.pl 54 $alo="r10"; # sl, gcc uses it to keep @GOT
125 umull $alo,$ahi,$aj,$bi @ ap[0]*bp[0]
127 mul $n0,$alo,$n0 @ "tp[0]"*n0
129 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
134 mov $alo,$ahi
137 umlal $alo,$ahi,$aj,$bi @ ap[j]*bp[0]
140 adds $nlo,$nlo,$alo
161 ldr $alo,[sp] @ tp[0]
166 umlal $alo,$ahi,$aj,$bi @ ap[0]*bp[i]+tp[0]
168 mul $n0,$alo,$n
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/sources/
jsdifflib.js 167 this.find_longest_match = function (alo, ahi, blo, bhi) {
172 var besti = alo;
179 for (var i = alo; i < ahi; i++) {
198 while (besti > alo && bestj > blo && !isbjunk(b[bestj - 1]) && a[besti - 1] == b[bestj - 1]) {
210 while (besti > alo && bestj > blo && isbjunk(b[bestj - 1]) && a[besti - 1] == b[bestj - 1]) {
231 var alo, ahi, blo, bhi, qi, i, j, k, x;
234 alo = qi[0];
238 x = this.find_longest_match(alo, ahi, blo, bhi);
245 if (alo < i && blo < j)
246 queue.push([alo, i, blo, j])
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
difflib.py 135 find_longest_match(alo, ahi, blo, bhi)
136 Find longest matching block in a[alo:ahi] and b[blo:bhi].
350 def find_longest_match(self, alo, ahi, blo, bhi):
351 """Find longest matching block in a[alo:ahi] and b[blo:bhi].
356 alo <= i <= i+k <= ahi
387 If no blocks match, return (alo, blo, 0).
407 besti, bestj, bestsize = alo, blo, 0
413 for i in xrange(alo, ahi):
433 while besti > alo and bestj > blo and \
449 while besti > alo and bestj > blo and
    [all...]
mhlib.py 816 alo, ahi = self.pairs[i-1]
819 self.pairs[i-1:i+1] = [(alo, max(ahi, bhi))]
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
difflib.py 135 find_longest_match(alo, ahi, blo, bhi)
136 Find longest matching block in a[alo:ahi] and b[blo:bhi].
350 def find_longest_match(self, alo, ahi, blo, bhi):
351 """Find longest matching block in a[alo:ahi] and b[blo:bhi].
356 alo <= i <= i+k <= ahi
387 If no blocks match, return (alo, blo, 0).
407 besti, bestj, bestsize = alo, blo, 0
413 for i in xrange(alo, ahi):
433 while besti > alo and bestj > blo and \
449 while besti > alo and bestj > blo and
    [all...]
mhlib.py 816 alo, ahi = self.pairs[i-1]
819 self.pairs[i-1:i+1] = [(alo, max(ahi, bhi))]
    [all...]
  /external/openssl/crypto/sha/asm/
sha512-parisc.pl 363 @V=( $Ahi, $Alo, $Bhi, $Blo, $Chi, $Clo, $Dhi, $Dlo,
380 my ($i,$ahi,$alo,$bhi,$blo,$chi,$clo,$dhi,$dlo,
413 shd $ahi,$alo,$Sigma0[0],$t0
415 shd $alo,$ahi,$Sigma0[0],$t1
417 shd $ahi,$alo,$Sigma0[1],$t2
419 shd $alo,$ahi,$Sigma0[1],$t3
423 shd $ahi,$alo,$Sigma0[2],$t2
424 and $alo,$blo,$a0
425 shd $alo,$ahi,$Sigma0[2],$t3
430 and $alo,$clo,$a
    [all...]

Completed in 262 milliseconds