| /art/runtime/interpreter/mterp/mips/ |
| op_shl_long_2addr.S | 16 sll v0, a0, a2 # rlo<- alo << (shift&31)
20 srl a0, v1 # alo<- alo >> (32-(shift&31))
22 or v1, a0 # rhi<- rhi | alo
|
| op_shl_long.S | 20 sll v0, a0, a2 # rlo<- alo << (shift&31)
24 srl a0, v1 # alo<- alo >> (32-(shift&31))
26 or v1, a0 # rhi<- rhi | alo
|
| op_shr_long_2addr.S | 17 srl v0, a0, a2 # rlo<- alo >> (shift&31)
18 not a0, a2 # alo<- 31-shift (shift is 5b)
|
| op_ushr_long_2addr.S | 18 srl v0, a0, a2 # rlo<- alo >> (shift&31)
19 not a0, a2 # alo<- 31-n (shift is 5b)
|
| op_shr_long.S | 21 srl v0, a0, a2 # rlo<- alo >> (shift&31)
22 not a0, a2 # alo<- 31-shift (shift is 5b)
|
| op_ushr_long.S | 22 srl v0, a0, a2 # rlo<- alo >> (shift&31)
23 not a0, a2 # alo<- 31-n (shift is 5b)
|
| /external/boringssl/src/crypto/bn/asm/ |
| armv4-mont.pl | 66 $alo="r10"; # sl, gcc uses it to keep @GOT
140 umull $alo,$ahi,$aj,$bi @ ap[0]*bp[0]
142 mul $n0,$alo,$n0 @ "tp[0]"*n0
144 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
149 mov $alo,$ahi
152 umlal $alo,$ahi,$aj,$bi @ ap[j]*bp[0]
155 adds $nlo,$nlo,$alo
176 ldr $alo,[sp] @ tp[0]
181 umlal $alo,$ahi,$aj,$bi @ ap[0]*bp[i]+tp[0]
183 mul $n0,$alo,$n
[all...] |
| armv8-mont.pl | 47 ($lo0,$hi0,$aj,$m0,$alo,$ahi,
88 mul $alo,$aj,$m0 // ap[1]*bp[0]
114 adds $lo0,$alo,$hi0
120 mul $alo,$aj,$m0 // ap[j]*bp[0]
132 adds $lo0,$alo,$hi0
157 mul $alo,$aj,$m0 // ap[1]*bp[i]
177 adds $lo0,$alo,$hi0
185 mul $alo,$aj,$m0 // ap[j]*bp[i]
199 adds $lo0,$alo,$hi0
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| 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/gdb/darwin-x86/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/gdb/linux-x86/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/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...] |
| /art/runtime/interpreter/mterp/out/ |
| mterp_mips.S | [all...] |
