HomeSort by relevance Sort by last modified time
    Searched refs:l1 (Results 26 - 50 of 127) sorted by null

12 3 4 5 6

  /external/bluetooth/glib/glib/
gslist.c 849 g_slist_sort_merge (GSList *l1,
859 while (l1 && l2)
861 cmp = ((GCompareDataFunc) compare_func) (l1->data, l2->data, user_data);
865 l=l->next=l1;
866 l1=l1->next;
874 l->next= l1 ? l1 : l2;
884 GSList *l1, *l2; local
891 l1 = list;
    [all...]
  /external/openssl/crypto/x509/
x509_obj.c 70 int n,lold,l,l1,l2,num,j,type; local
112 l1=strlen(s);
161 l+=1+l1+1+l2;
174 memcpy(p,s,(unsigned int)l1); p+=l1;
  /external/openssl/crypto/des/
des_locl.h 114 #define c2ln(c,l1,l2,n) { \
116 l1=l2=0; \
122 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
123 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
124 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
125 case 1: l1|=((DES_LONG)(*(--(c)))); \
149 #define l2cn(l1,l2,c,n) { \
156 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
157 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
158 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff);
    [all...]
  /external/opencv/cvaux/src/
cvlmeds.cpp 408 double l1, l2, l3, d1, d2, value; local
423 l1 = F[0] * mr[i3] + F[1] * mr[i3 + 1] + F[2];
427 d1 = (l1 * ml[i3] + l2 * ml[i3 + 1] + l3) / sqrt( l1 * l1 + l2 * l2 );
429 l1 = F[0] * ml[i3] + F[3] * ml[i3 + 1] + F[6];
433 d2 = (l1 * mr[i3] + l2 * mr[i3 + 1] + l3) / sqrt( l1 * l1 + l2 * l2 );
491 double l1, l2, l3, d1, d2, sigma local
584 double l1, l2, w, old_norm = -1, new_norm = -2, summ; local
935 int i = 0, j, k, l = 0, i1, k1, l1 = 0; local
    [all...]
cvbgfg_codebook.cpp 147 uchar p0, p1, p2, l0, l1, l2, h0, h1, h2; local
154 l0 = SAT_8U(p0 - cb0); l1 = SAT_8U(p1 - cb1); l2 = SAT_8U(p2 - cb2);
175 if( e->learnMin[1] > l1 ) e->learnMin[1]--;
207 e->learnMin[1] = l1; e->learnMax[1] = h1;
271 int l0 = p0 + m0, l1 = p1 + m1, l2 = p2 + m2; local
278 e->boxMin[1] <= l1 && h1 <= e->boxMax[1] &&
  /external/webkit/Source/JavaScriptCore/runtime/
UString.cpp 238 const unsigned l1 = s1.length(); local
240 const unsigned lmin = l1 < l2 ? l1 : l2;
252 return (l1 < l2);
257 const unsigned l1 = s1.length();
259 const unsigned lmin = l1 < l2 ? l1 : l2;
271 return (l1 > l2);
  /external/e2fsprogs/intl/
localcharset.c 149 size_t l1, l2; local
171 l1 = strlen (buf1);
175 res_size = l1 + 1 + l2 + 1;
180 res_size += l1 + 1 + l2 + 1;
189 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
  /ndk/sources/host-tools/sed-4.2.1/lib/
localcharset.c 162 size_t l1, l2; local
183 l1 = strlen (buf1);
188 res_size = l1 + 1 + l2 + 1;
193 res_size += l1 + 1 + l2 + 1;
204 strcpy (res_ptr + res_size - (l2 + 1) - (l1 + 1), buf1);
  /development/tools/mkstubs/src/com/android/mkstubs/stubber/
MethodStubber.java 56 Label l1 = new Label(); local
57 mv.visitLabel(l1);
63 l1, // label end
  /external/apache-harmony/logging/src/test/java/org/apache/harmony/logging/tests/java/util/logging/
LevelTest.java 222 MockLevel l1 = new MockLevel("level1", 1); local
224 assertEquals(l1, l2);
225 assertEquals(l2, l1);
232 MockLevel l1 = new MockLevel("level1", 1); local
234 assertFalse(l1.equals(l2));
235 assertFalse(l2.equals(l1));
  /external/llvm/include/llvm/ADT/
Trie.h 91 unsigned l1 = s.length(); local
95 l = std::min(l1, l2);
101 if (l1 == l2)
103 else if (i == l1)
171 std::string l1 = l.substr(0, index); local
174 Node* nNode = addNode(Empty, l1);
  /external/clang/test/Analysis/
auto-obj-dtors-cfg-output.cpp 45 if (UV) goto l1;
48 l1:
248 // CHECK: l1:
265 // CHECK: T: goto l1;
  /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/
p7-0x.cpp 129 long l1 = 1; local
130 Agg<int> i1 = {l1}; // expected-error {{ cannot be narrowed }} expected-note {{override}}
  /libcore/luni/src/main/java/java/lang/
Math.java 549 * @param l1
553 * @return the larger of {@code l1} and {@code l2}.
555 public static long max(long l1, long l2) {
556 return l1 > l2 ? l1 : l2;
649 * @param l1
653 * @return the smaller of {@code l1} and {@code l2}.
655 public static long min(long l1, long l2) {
656 return l1 < l2 ? l1 : l2
    [all...]
StrictMath.java 545 * @param l1
549 * @return the larger of {@code l1} and {@code l2}.
551 public static long max(long l1, long l2) {
552 return Math.max(l1, l2);
639 * @param l1
643 * @return the smaller of {@code l1} and {@code l2}.
645 public static long min(long l1, long l2) {
646 return Math.min(l1, l2);
    [all...]
  /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/cert/
PKIXParametersTest.java 735 List l1 = p.getCertPathCheckers(); local
736 assertNotNull("notNull", l1);
737 assertFalse("isNotEmpty", l1.isEmpty());
753 List l1 = p.getCertPathCheckers(); local
754 assertNotNull("notNull1", l1);
755 assertTrue("isEmpty1", l1.isEmpty());
869 List l1 = p.getCertPathCheckers(); local
896 List l1 = p.getCertPathCheckers(); local
    [all...]
  /external/clang/test/CXX/temp/temp.decls/temp.friend/
p1.cpp 230 A<T> l1; local
231 l1.foo();
236 return l1;
  /external/elfutils/libdw/
dwarf_getloclist.c 39 const struct loc_s *l1 = (const struct loc_s *) p1; local
42 if ((uintptr_t) l1->addr < (uintptr_t) l2->addr)
44 if ((uintptr_t) l1->addr > (uintptr_t) l2->addr)
  /libcore/luni/src/test/java/libcore/java/util/prefs/
OldPreferencesTest.java 823 MockNodeChangeListener l1 = new MockNodeChangeListener(); local
825 pref.addNodeChangeListener(l1);
826 pref.addNodeChangeListener(l1);
828 pref.removeNodeChangeListener(l1);
829 pref.removeNodeChangeListener(l1);
831 pref.removeNodeChangeListener(l1);
849 MockPreferenceChangeListener l1 = new MockPreferenceChangeListener(); local
851 pref.addPreferenceChangeListener(l1);
852 pref.addPreferenceChangeListener(l1);
858 pref.removePreferenceChangeListener(l1);
    [all...]
  /external/openssl/ssl/
ssl_locl.h 181 #define c2ln(c,l1,l2,n) { \
183 l1=l2=0; \
189 case 4: l1 =((unsigned long)(*(--(c))))<<24; \
190 case 3: l1|=((unsigned long)(*(--(c))))<<16; \
191 case 2: l1|=((unsigned long)(*(--(c))))<< 8; \
192 case 1: l1|=((unsigned long)(*(--(c)))); \
226 #define l2cn(l1,l2,c,n) { \
233 case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
234 case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
235 case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff);
    [all...]
  /external/v8/benchmarks/
earley-boyer.js 890 function sc_reverseAppendBang(l1, l2) {
892 while (l1 !== null) {
894 res = l1;
895 l1 = l1.cdr;
901 function sc_dualAppend(l1, l2) {
902 if (l1 === null) return l2;
903 if (l2 === null) return l1;
904 var rev = sc_reverse(l1);
918 function sc_dualAppendBang(l1, l2)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-earley-boyer.js 884 function sc_reverseAppendBang(l1, l2) {
886 while (l1 !== null) {
888 res = l1;
889 l1 = l1.cdr;
895 function sc_dualAppend(l1, l2) {
896 if (l1 === null) return l2;
897 if (l2 === null) return l1;
898 var rev = sc_reverse(l1);
912 function sc_dualAppendBang(l1, l2)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
v8-earley-boyer.js 884 function sc_reverseAppendBang(l1, l2) {
886 while (l1 !== null) {
888 res = l1;
889 l1 = l1.cdr;
895 function sc_dualAppend(l1, l2) {
896 if (l1 === null) return l2;
897 if (l2 === null) return l1;
898 var rev = sc_reverse(l1);
912 function sc_dualAppendBang(l1, l2)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
v8-earley-boyer.js 884 function sc_reverseAppendBang(l1, l2) {
886 while (l1 !== null) {
888 res = l1;
889 l1 = l1.cdr;
895 function sc_dualAppend(l1, l2) {
896 if (l1 === null) return l2;
897 if (l2 === null) return l1;
898 var rev = sc_reverse(l1);
912 function sc_dualAppendBang(l1, l2)
    [all...]
  /external/openssl/crypto/aes/asm/
aes-sparcv9.pl 15 # that the tables don't have to reside in L1 cache. Once again, this
44 $acc4="%l1";
541 ldub [%i0+1],%l1
546 sll %l1,16,%l1
549 or %l1,%l0,%l0
562 ldub [%i0+9],%l1
568 sll %l1,16,%l1
571 or %l1,%l0,%l
    [all...]

Completed in 499 milliseconds

12 3 4 5 6