| /dalvik/vm/compiler/template/mips/ |
| TEMPLATE_SHL_LONG.S | 8 sll rRESULT0, rARG0, a2 # rlo<- alo << (shift&31)
11 srl rARG0, rRESULT1 # alo<- alo >> (32-(shift&31))
13 or rRESULT1, rARG0 # rhi<- rhi | alo
|
| TEMPLATE_USHR_LONG.S | 9 srl rRESULT0, rARG0, a2 # rlo<- alo >> (shift&31)
10 not rARG0, a2 # alo<- 31-n (shift is 5b)
|
| TEMPLATE_SHR_LONG.S | 9 srl rRESULT0, rARG0, a2 # rlo<- alo >> (shift&31)
11 not rARG0, a2 # alo<- 31-shift (shift is 5b)
|
| /external/chromium_org/third_party/openssl/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...] |
| armv4-mont.pl | 39 $alo="r10"; # sl, gcc uses it to keep @GOT
85 umull $alo,$ahi,$aj,$bi @ ap[0]*bp[0]
87 mul $n0,$alo,$n0 @ "tp[0]"*n0
89 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
94 mov $alo,$ahi
97 umlal $alo,$ahi,$aj,$bi @ ap[j]*bp[0]
100 adds $nlo,$nlo,$alo
121 ldr $alo,[sp] @ tp[0]
126 umlal $alo,$ahi,$aj,$bi @ ap[0]*bp[i]+tp[0]
128 mul $n0,$alo,$n
[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...] |
| 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
|
| /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...] |
| armv4-mont.pl | 39 $alo="r10"; # sl, gcc uses it to keep @GOT
85 umull $alo,$ahi,$aj,$bi @ ap[0]*bp[0]
87 mul $n0,$alo,$n0 @ "tp[0]"*n0
89 umlal $alo,$nlo,$nj,$n0 @ np[0]*n0+"t[0]"
94 mov $alo,$ahi
97 umlal $alo,$ahi,$aj,$bi @ ap[j]*bp[0]
100 adds $nlo,$nlo,$alo
121 ldr $alo,[sp] @ tp[0]
126 umlal $alo,$ahi,$aj,$bi @ ap[0]*bp[i]+tp[0]
128 mul $n0,$alo,$n
[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...] |
| 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
|
| /dalvik/vm/mterp/mips/ |
| OP_SHL_LONG_2ADDR.S | 15 sll v0, a0, a2 # rlo<- alo << (shift&31)
18 srl a0, v1 # alo<- alo >> (32-(shift&31))
20 or v1, a0 # rhi<- rhi | alo
|
| OP_SHL_LONG.S | 20 sll v0, a0, a2 # rlo<- alo << (shift&31)
23 srl a0, v1 # alo<- alo >> (32-(shift&31))
25 or v1, a0 # rhi<- rhi | alo
|
| OP_USHR_LONG_2ADDR.S | 15 srl v0, a0, a2 # rlo<- alo >> (shift&31)
16 not a0, a2 # alo<- 31-n (shift is 5b)
|
| OP_SHR_LONG.S | 20 srl v0, a0, a2 # rlo<- alo >> (shift&31)
22 not a0, a2 # alo<- 31-shift (shift is 5b)
|
| OP_SHR_LONG_2ADDR.S | 15 srl v0, a0, a2 # rlo<- alo >> (shift&31)
17 not a0, a2 # alo<- 31-shift (shift is 5b)
|
| OP_USHR_LONG.S | 20 srl v0, a0, a2 # rlo<- alo >> (shift&31)
21 not a0, a2 # alo<- 31-n (shift is 5b)
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| 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...] |
| /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...] |
