| /dalvik/dx/tests/044-dex-math-ops/ |
| Blort.java | 40 public void blort(long l1, long l2) {
41 l = -l1;
42 l = ~l1;
43 l = l1 + l2;
44 l = l1 - l2;
45 l = l1 * l2;
46 l = l1 / l2;
47 l = l1 % l2;
48 l = l1 & l2;
49 l = l1 | l2
[all...] |
| /external/libffi/testsuite/libffi.call/ |
| return_sl.c | 9 static long return_sl(long l1, long l2)
11 return l1 - l2;
20 unsigned long l1, l2; local
24 values[0] = &l1;
30 l1 = 1073741823L;
34 printf("res: %ld, %ld\n", (long)res, l1 - l2);
|
| /bootable/bootloader/legacy/libc/ |
| strstr.c | 33 int l1 = strlen(s1); local
36 while (l1 >= l2) {
41 l1--;
|
| /external/dropbear/libtomcrypt/testprof/ |
| base64_test.c | 6 unsigned long x, l1, l2; local
10 l1 = sizeof(out);
11 DO(base64_encode(in, x, out, &l1));
13 DO(base64_decode(out, l1, tmp, &l2));
15 fprintf(stderr, "base64 failed %lu %lu %lu", x, l1, l2);
|
| pkcs_1_test.c | 9 unsigned long x, y, l1, l2, l3, i1, i2, lparamlen, saltlen, modlen; local
40 l1 = sizeof(buf[1]);
41 DO(pkcs_1_oaep_encode(buf[0], l3, lparam, lparamlen, modlen, &yarrow_prng, prng_idx, hash_idx, buf[1], &l1));
45 DO(pkcs_1_oaep_decode(buf[1], l1, lparam, lparamlen, modlen, hash_idx, buf[2], &l2, &res1));
62 l1 = sizeof(buf[1]);
63 DO(pkcs_1_pss_encode(buf[0], l3, saltlen, &yarrow_prng, prng_idx, hash_idx, modlen, buf[1], &l1));
64 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res1));
67 DO(pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res2));
70 buf[1][i2 = abs(rand()) % (l1 - 1)] ^= 1;
71 pkcs_1_pss_decode(buf[0], l3, buf[1], l1, saltlen, hash_idx, modlen, &res3)
[all...] |
| /external/openssl/crypto/des/ |
| ecb3_enc.c | 66 register DES_LONG l0,l1; local
72 c2l(in,l1);
74 ll[1]=l1;
80 l1=ll[1];
82 l2c(l1,out);
|
| 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/openssl/crypto/bf/ |
| bf_locl.h | 71 #define c2ln(c,l1,l2,n) { \
73 l1=l2=0; \
79 case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
80 case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
81 case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
82 case 1: l1|=((unsigned long)(*(--(c)))); \
94 #define l2cn(l1,l2,c,n) { \
101 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
102 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
103 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff);
[all...] |
| /external/openssl/crypto/rc2/ |
| rc2_locl.h | 67 #define c2ln(c,l1,l2,n) { \
69 l1=l2=0; \
75 case 4: l1 =((unsigned long)(*(--(c))))<<24L; \
76 case 3: l1|=((unsigned long)(*(--(c))))<<16L; \
77 case 2: l1|=((unsigned long)(*(--(c))))<< 8L; \
78 case 1: l1|=((unsigned long)(*(--(c)))); \
90 #define l2cn(l1,l2,c,n) { \
97 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
98 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
99 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff);
[all...] |
| /external/ipsec-tools/src/racoon/ |
| genlist.c | 113 struct genlist *l1, *l2;
144 cf->l1 = genlist_init();
147 genlist_insert(cf->l1, "Ahoj");
148 genlist_insert(cf->l1, "Cau");
149 genlist_insert(cf->l1, "Nazdar");
150 genlist_insert(cf->l1, "Te buch");
160 dump_list(cf->l1);
168 * genlist_free (cf->l1, 0); but to illustrate the idea */
169 genlist_free (cf->l1, free_data);
170 cf->l1 = 0
[all...] |
| /external/chromium/third_party/icu/source/tools/genprops/misc/ |
| ucdmerge.c | 54 sameData(const char *l1, const char *l2) {
59 l1=strchr(l1, ';')+1;
63 end1=endOfData(l1);
67 length=end1-l1;
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
|
| /external/icu4c/tools/genprops/misc/ |
| ucdmerge.c | 54 sameData(const char *l1, const char *l2) {
59 l1=strchr(l1, ';')+1;
63 end1=endOfData(l1);
67 length=end1-l1;
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
|
| /external/icu4c/tools/genprops/ |
| ucdmerge.c | 54 sameData(const char *l1, const char *l2) {
59 l1=strchr(l1, ';')+1;
63 end1=endOfData(l1);
67 length=end1-l1;
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
|
| /system/core/sh/ |
| mkbuiltins | 93 l1="${line###}"
94 [ "$l1" != "$line" ] && continue
|
| /external/chromium/third_party/icu/source/test/intltest/ |
| aliastst.cpp | 70 const char* l1 = c1->getLocaleID(ULOC_VALID_LOCALE, status); local
72 if (strcmp(newLoc.getName(), l1)!=0) {
73 errln("CalendarTest: newLoc!=l1: newLoc= "+UnicodeString(newLoc.getName()) +" l1= "+UnicodeString(l1));
75 if (strcmp(l1, l2)!=0) {
76 errln("CalendarTest: l1!=l2: l1= "+UnicodeString(l1) +" l2= "+UnicodeString(l2));
81 logln("Calendar(getLocale) old:"+UnicodeString(l1)+" new:"+UnicodeString(l2));
103 const char* l1 = df1->getLocaleID(ULOC_VALID_LOCALE, status); local
136 Locale l1 = c1->getLocale(ULOC_VALID_LOCALE, status); local
[all...] |
| /external/icu4c/test/intltest/ |
| aliastst.cpp | 70 const char* l1 = c1->getLocaleID(ULOC_VALID_LOCALE, status); local
72 if (strcmp(newLoc.getName(), l1)!=0) {
73 errln("CalendarTest: newLoc!=l1: newLoc= "+UnicodeString(newLoc.getName()) +" l1= "+UnicodeString(l1));
75 if (strcmp(l1, l2)!=0) {
76 errln("CalendarTest: l1!=l2: l1= "+UnicodeString(l1) +" l2= "+UnicodeString(l2));
81 logln("Calendar(getLocale) old:"+UnicodeString(l1)+" new:"+UnicodeString(l2));
103 const char* l1 = df1->getLocaleID(ULOC_VALID_LOCALE, status); local
136 Locale l1 = c1->getLocale(ULOC_VALID_LOCALE, status); local
[all...] |
| /external/speex/libspeex/ |
| smallft.c | 45 int k1, l1, l2, ib; local
82 l1=1;
89 l2=l1*ip;
94 ld+=l1;
106 l1=l2;
116 static void dradf2(int ido,int l1,float *cc,float *ch,float *wa1){
122 t0=(t2=l1*ido);
124 for(k=0;k<l1;k++){
136 for(k=0;k<l1;k++){
162 for(k=0;k<l1;k++)
576 int i,k1,l1,l2; local
1157 int i,k1,l1,l2; local
[all...] |
| /external/stlport/test/unit/ |
| list_test.cpp | 60 list<int> l1(array1, array1 + 3);
62 list<int>::iterator i1 = l1.begin();
66 l1.splice(i1, l2);
67 i1 = l1.begin();
76 CPPUNIT_ASSERT( i2 == l1.begin() );
100 list<int> l1(array1, array1 + 2);
102 list<int>::iterator i = l1.begin();
104 l1.splice(i, l2, l2.begin(), l2.end());
105 i = l1.begin();
153 list<int> l1(array1, array1 + 4)
[all...] |
| /ndk/sources/android/stlport/test/unit/ |
| list_test.cpp | 60 list<int> l1(array1, array1 + 3);
62 list<int>::iterator i1 = l1.begin();
66 l1.splice(i1, l2);
67 i1 = l1.begin();
76 CPPUNIT_ASSERT( i2 == l1.begin() );
100 list<int> l1(array1, array1 + 2);
102 list<int>::iterator i = l1.begin();
104 l1.splice(i, l2, l2.begin(), l2.end());
105 i = l1.begin();
153 list<int> l1(array1, array1 + 4)
[all...] |
| /system/extras/tests/bionic/libstdc++/ |
| test_climits.cpp | 60 volatile long l1 = LONG_MAX; local
|
| /external/bluetooth/glib/glib/ |
| glist.c | 893 g_list_sort_merge (GList *l1,
904 while (l1 && l2)
906 cmp = ((GCompareDataFunc) compare_func) (l1->data, l2->data, user_data);
910 l->next = l1;
911 l1 = l1->next;
922 l->next = l1 ? l1 : l2;
933 GList *l1, *l2; local
940 l1 = list;
[all...] |
| 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;
|
| /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/lang/ |
| ThreadLocalTest.java | 84 final ThreadLocal<Object> l1 = new ThreadLocal<Object>() { local
92 + " but is " + l1.get(), l1.get() == INITIAL_VALUE);
105 THREADVALUE.result = l1.get();
|
| /external/webkit/JavaScriptCore/runtime/ |
| UString.cpp | 664 const int l1 = s1.size(); local
666 const int lmin = l1 < l2 ? l1 : l2;
678 return (l1 < l2);
683 const int l1 = s1.size();
685 const int lmin = l1 < l2 ? l1 : l2;
697 return (l1 > l2);
702 const int l1 = s1.size();
704 const int lmin = l1 < l2 ? l1 : l2
[all...] |
