| /art/runtime/interpreter/mterp/mips/ |
| op_shr_long_2addr.S | 15 sra v1, a1, a2 # rhi<- ahi >> (shift&31)
20 sll a1, a0 # ahi<- ahi << (32-(shift&31))
21 or v0, a1 # rlo<- rlo | ahi
|
| op_ushr_long_2addr.S | 16 srl v1, a1, a2 # rhi<- ahi >> (shift&31)
21 sll a1, a0 # ahi<- ahi << (32-(shift&31))
22 or v0, a1 # rlo<- rlo | ahi
|
| op_shr_long.S | 19 sra v1, a1, a2 # rhi<- ahi >> (shift&31)
24 sll a1, a0 # ahi<- ahi << (32-(shift&31))
25 or v0, a1 # rlo<- rlo | ahi
|
| op_ushr_long.S | 20 srl v1, a1, a2 # rhi<- ahi >> (shift&31)
25 sll a1, a0 # ahi<- ahi << (32-(shift&31))
26 or v0, a1 # rlo<- rlo | ahi
|
| op_shl_long_2addr.S | 21 sll v1, a1, a2 # rhi<- ahi << (shift&31)
|
| op_shl_long.S | 25 sll v1, a1, a2 # rhi<- ahi << (shift&31)
|
| /external/valgrind/none/tests/s390x/ |
| add.c | 7 immsweep(ahi, 0, 0);
8 immsweep(ahi, -1, 0);
9 immsweep(ahi, -32768, 0);
10 immsweep(ahi, 32767, 0);
|
| /toolchain/binutils/binutils-2.27/gold/testsuite/ |
| split_s390_1_z3.s | 2 # zarch mode, conditional call, ahi.
12 ahi %r1, 0x1000
28 ahi %r15, -0x60
|
| split_s390_1_a1.s | 13 ahi %r15, -0x60
|
| split_s390_1_a2.s | 13 ahi %r15, -0x60
|
| split_s390_1_z1.s | 24 ahi %r15, -0x60
|
| split_s390_1_z2.s | 26 ahi %r15, -0x60
|
| split_s390_1_z4.s | 28 ahi %r15, -0x60
|
| split_s390x_1_z3.s | 2 # conditional call, ahi.
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/s390/ |
| esa-operands.d | 10 2: a7 1a 80 01 [ ]*ahi %r1,-32767
|
| /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
413 for i in xrange(alo, ahi):
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
492 alo, ahi, blo, bhi = queue.pop()
493 i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi)
[all...] |
| /external/python/cpython2/Lib/ |
| difflib.py | 133 find_longest_match(alo, ahi, blo, bhi)
134 Find longest matching block in a[alo:ahi] and b[blo:bhi].
348 def find_longest_match(self, alo, ahi, blo, bhi):
349 """Find longest matching block in a[alo:ahi] and b[blo:bhi].
354 alo <= i <= i+k <= ahi
411 for i in xrange(alo, ahi):
435 while besti+bestsize < ahi and bestj+bestsize < bhi and \
451 while besti+bestsize < ahi and bestj+bestsize < bhi and \
490 alo, ahi, blo, bhi = queue.pop()
491 i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi
[all...] |
| /external/python/cpython3/Lib/ |
| difflib.py | 132 find_longest_match(alo, ahi, blo, bhi)
133 Find longest matching block in a[alo:ahi] and b[blo:bhi].
336 def find_longest_match(self, alo, ahi, blo, bhi):
337 """Find longest matching block in a[alo:ahi] and b[blo:bhi].
342 alo <= i <= i+k <= ahi
399 for i in range(alo, ahi):
423 while besti+bestsize < ahi and bestj+bestsize < bhi and \
439 while besti+bestsize < ahi and bestj+bestsize < bhi and \
478 alo, ahi, blo, bhi = queue.pop()
479 i, j, k = x = self.find_longest_match(alo, ahi, blo, 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
413 for i in xrange(alo, ahi):
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
492 alo, ahi, blo, bhi = queue.pop()
493 i, j, k = x = self.find_longest_match(alo, ahi, blo, 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
413 for i in xrange(alo, ahi):
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
492 alo, ahi, blo, bhi = queue.pop()
493 i, j, k = x = self.find_longest_match(alo, ahi, blo, 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
413 for i in xrange(alo, ahi):
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
492 alo, ahi, blo, bhi = queue.pop()
493 i, j, k = x = self.find_longest_match(alo, ahi, blo, 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
413 for i in xrange(alo, ahi):
437 while besti+bestsize < ahi and bestj+bestsize < bhi and \
453 while besti+bestsize < ahi and bestj+bestsize < bhi and \
492 alo, ahi, blo, bhi = queue.pop()
493 i, j, k = x = self.find_longest_match(alo, ahi, blo, bhi
[all...] |
| /external/boringssl/src/crypto/fipsmodule/bn/asm/ |
| armv4-mont.pl | 83 $ahi="r11"; # fp
168 umull $alo,$ahi,$aj,$bi @ ap[0]*bp[0]
177 mov $alo,$ahi
179 mov $ahi,#0
180 umlal $alo,$ahi,$aj,$bi @ ap[j]*bp[0]
189 adds $nlo,$nlo,$ahi
209 mov $ahi,#0
210 umlal $alo,$ahi,$aj,$bi @ ap[0]*bp[i]+tp[0]
219 adds $alo,$ahi,$tj @ +=tp[j]
221 mov $ahi,#
[all...] |
| /external/valgrind/coregrind/m_dispatch/ |
| dispatch-s390x-linux.S | 206 ahi %r10,1
242 ahi %r10,1
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/cfi/ |
| cfi-s390-1.s | 31 ahi %r15,-96
|
