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

  /external/openssl/crypto/bn/asm/
alpha-mont.pl 26 $lo0="t0";
87 mulq $hi0,$bi,$lo0
92 mulq $lo0,$n0,$m1
97 addq $lo1,$lo0,$lo1
98 cmpult $lo1,$lo0,AT
118 addq $alo,$hi0,$lo0
120 cmpult $lo0,$hi0,AT
130 addq $lo1,$lo0,$lo1
134 cmpult $lo1,$lo0,v0
144 addq $alo,$hi0,$lo0
    [all...]
mips3-mont.pl 29 $lo0="a6";
97 mflo $lo0
99 dmultu $lo0,$n0
110 daddu $lo1,$lo0
111 sltu AT,$lo1,$lo0
127 daddu $lo0,$alo,$hi0
129 sltu AT,$lo0,$hi0
136 daddu $lo1,$lo0
137 sltu AT,$lo1,$lo0
150 daddu $lo0,$alo,$hi
    [all...]
mips-mont.pl 97 $lo0=$a6;
182 mflo $lo0
184 $MULTU $lo0,$n0
195 $ADDU $lo1,$lo0
196 sltu $at,$lo1,$lo0
212 $ADDU $lo0,$alo,$hi0
214 sltu $at,$lo0,$hi0
221 $ADDU $lo1,$lo0
222 sltu $at,$lo1,$lo0
235 $ADDU $lo0,$alo,$hi
    [all...]
ppc-mont.pl 98 $lo0="r25";
155 $UMULL $lo0,$aj,$m0 ; ap[0]*bp[0]
161 $UMULL $m1,$lo0,$n0 ; "tp[0]"*n0
169 addc $lo1,$lo1,$lo0
180 addc $lo0,$alo,$hi0
188 addc $lo1,$lo1,$lo0 ; np[j]*m1+ap[j]*bp[0]
197 addc $lo0,$alo,$hi0
202 addc $lo1,$lo1,$lo0 ; np[j]*m1+ap[j]*bp[0]
219 $UMULL $lo0,$aj,$m0 ; ap[0]*bp[i]
223 addc $lo0,$lo0,$tj ; ap[0]*bp[i]+tp[0
    [all...]
x86_64-mont5.pl 44 $lo0="%r10";
138 mov %rax,$lo0
146 imulq $lo0,$m1 # "tp[0]"*n0
154 add %rax,$lo0 # discarded
168 mov $lo0,$hi0
179 mov %rdx,$lo0
194 mov $lo0,$hi0
208 mov (%rsp),$lo0
217 add %rax,$lo0 # ap[0]*bp[i]+tp[0]
226 imulq $lo0,$m1 # tp[0]*n
    [all...]
x86_64-mont.pl 52 $lo0="%r10";
106 mov %rax,$lo0
109 imulq $lo0,$m1 # "tp[0]"*n0
113 add %rax,$lo0 # discarded
127 mov $lo0,$hi0
138 mov %rdx,$lo0
151 mov $lo0,$hi0
166 mov (%rsp),$lo0
168 add %rax,$lo0 # ap[0]*bp[i]+tp[0]
172 imulq $lo0,$m1 # tp[0]*n
    [all...]
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
SortUtil.java 182 * @param lo0 the index of the lowest element to include in the sort.
186 public static void qsort(Object[] a, int lo0, int hi0, Comparator comp) {
188 if (hi0 <= lo0) {
194 if (hi0 - lo0 == 1) {
196 if (comp.compare(a[hi0], a[lo0]) < 0) {
197 t = a[lo0];
198 a[lo0] = a[hi0];
205 Object mid = a[(lo0 + hi0) / 2];
208 int lo = lo0 - 1, hi = hi0 + 1;
232 if (lo0 < lo - 1)
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/utils/
NodeVector.java 635 * @param lo0 The low index.
640 public void sort(int a[], int lo0, int hi0) throws Exception
643 int lo = lo0;
722 * Recursive calls, elements a[lo0] to a[lo-1] are less than or
726 sort(a, lo0, lo - 1);
  /external/apache-xml/src/main/java/org/apache/xalan/templates/
StylesheetRoot.java     [all...]
  /external/openssl/crypto/sha/asm/
sha512-armv4.s 5 # define WORD64(hi0,lo0,hi1,lo1) .word lo0,hi0, lo1,hi1
9 # define WORD64(hi0,lo0,hi1,lo1) .word hi0,lo0, hi1,lo1
    [all...]
  /prebuilt/common/ecj/
ecj.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.jasper_5.5.17.v201004212143.jar 
org.eclipse.jdt.core_3.6.2.v_A76_R36x.jar 

Completed in 373 milliseconds