| /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/valgrind/main/none/tests/s390x/ |
| clcle.c | 13 register unsigned long l1 asm ("3") = *_l1;
23 :"=d" (cc), "+d" (a1),"+d" (l1), "+d" (a3), "+d" (l3)
28 *_l1 = l1;
37 unsigned long a1,a3,l1,l3; local
40 a1 = (unsigned long) _a1; l1 = _l1; a3 = (unsigned long) _a3; l3 = _l3;
41 cc = clcle(&a1, &l1, &a3, &l3, pad);
42 printf("cc: %d, l1: %lu(%lu) l3: %lu(%lu) diff1: %lu diff3: %lu\n",
43 cc, l1, _l1, l3, _l3, a1-(unsigned long) _a1, a3-(unsigned long) _a3);
47 void multiplex(unsigned long l1, unsigned long l3, char pad)
49 testrun(b1, l1, b1, l3, pad)
[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);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db1.pass.cpp | 29 std::list<int> l1(a1, a1+3);
30 std::list<int>::const_iterator i = l1.end();
31 l1.erase(i);
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>>::const_iterator i = l1.end();
39 l1.erase(i);
|
| insert_iter_value.pass.cpp | 47 std::list<int> l1(a1, a1+3);
48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 4);
49 assert(i == next(l1.begin()));
50 assert(l1.size() == 4);
51 assert(distance(l1.begin(), l1.end()) == 4);
52 assert(l1 == std::list<int>(a2, a2+4));
57 i = l1.insert(i, 5);
65 assert(l1 == std::list<int>(a2, a2+4))
[all...] |
| erase_iter_iter_db1.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 29 std::list<int> l1(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| insert_iter_iter_iter.pass.cpp | 47 std::list<int> l1; local
48 std::list<int>::iterator i = l1.insert(l1.begin(), a1, a1+3);
49 assert(i == l1.begin());
50 assert(l1.size() == 3);
51 assert(distance(l1.begin(), l1.end()) == 3);
52 i = l1.begin();
59 i = l1.insert(i, a2, a2+3);
61 assert(l1.size() == 6)
116 std::list<int, min_allocator<int>> l1; local
[all...] |
| insert_iter_size_value.pass.cpp | 47 std::list<int> l1(a1, a1+3);
48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
49 assert(i == next(l1.begin()));
50 assert(l1 == std::list<int>(a2, a2+8));
55 i = l1.insert(i, 5, 5);
63 assert(l1 == std::list<int>(a2, a2+8));
77 std::list<int, min_allocator<int>> l1(a1, a1+3);
78 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
| erase_iter_db1.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
30 std::vector<int>::const_iterator i = l1.end();
31 l1.erase(i);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
38 std::vector<int, min_allocator<int>>::const_iterator i = l1.end();
39 l1.erase(i);
|
| erase_iter_iter_db1.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), l1.cbegin()+1);
|
| erase_iter_iter_db2.pass.cpp | 29 std::vector<int> l1(a1, a1+3);
31 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
37 std::vector<int, min_allocator<int>> l1(a1, a1+3);
39 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l2.cbegin()+1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/thread/thread.mutex/thread.lock.algorithm/ |
| lock.pass.cpp | 12 // template <class L1, class L2, class... L3>
13 // void lock(L1&, L2&, L3&...);
41 class L1
46 L1() : locked_(false) {}
91 L0 l1; local
92 std::lock(l0, l1);
94 assert(l1.locked());
98 L1 l1; local
99 std::lock(l0, l1);
105 L0 l1; local
112 L2 l1; local
126 L0 l1; local
140 L2 l1; local
154 L1 l1; local
168 L2 l1; local
183 L0 l1; local
192 L2 l1; local
208 L0 l1; local
217 L1 l1; local
226 L0 l1; local
235 L0 l1; local
251 L2 l1; local
267 L0 l1; local
283 L2 l1; local
299 L0 l1; local
315 L2 l1; local
331 L2 l1; local
347 L1 l1; local
363 L2 l1; local
379 L0 l1; local
390 L0 l1; local
401 L0 l1; local
412 L1 l1; local
423 L0 l1; local
434 L0 l1; local
452 L0 l1; local
470 L2 l1; local
488 L0 l1; local
[all...] |
| /external/chromium_org/third_party/openssl/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);
|
| /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);
|
| /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);
|
| /external/llvm/test/MC/ELF/ |
| subsection.s | 20 l1: label
23 .subsection l2-l1
24 .byte l1-l0
|
| /external/chromium_org/third_party/openssl/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/chromium_org/third_party/openssl/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/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...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 57 l1 = pytree.Leaf(100, "foo")
58 self.assertEqual(l1.type, 100)
59 self.assertEqual(l1.value, "foo")
62 l1 = pytree.Leaf(100, "foo")
63 self.assertEqual(repr(l1), "Leaf(100, 'foo')")
66 l1 = pytree.Leaf(100, "foo")
67 self.assertEqual(str(l1), "foo")
74 l1 = pytree.Leaf(2, 5)
75 l1.prefix = "foo_"
76 self.assertEqual(str(l1), "foo_5"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 57 l1 = pytree.Leaf(100, "foo")
58 self.assertEqual(l1.type, 100)
59 self.assertEqual(l1.value, "foo")
62 l1 = pytree.Leaf(100, "foo")
63 self.assertEqual(repr(l1), "Leaf(100, 'foo')")
66 l1 = pytree.Leaf(100, "foo")
67 self.assertEqual(str(l1), "foo")
74 l1 = pytree.Leaf(2, 5)
75 l1.prefix = "foo_"
76 self.assertEqual(str(l1), "foo_5"
[all...] |
| /external/sepolicy/ |
| mls | 23 ((h1 eq h2 and l1 eq l2) or t1 == mlstrustedsubject);
27 (l1 dom l2 or t1 == mlstrustedsubject);
31 (l1 domby l2 or t1 == mlstrustedsubject);
40 ((h1 eq h2 and l1 eq l2) or t1 == mlstrustedsubject);
45 (l1 domby l2 or t1 == mlstrustedsubject or t2 == mlstrustedsubject);
50 (l1 eq l2 or t1 == mlstrustedsubject or t2 == mlstrustedsubject);
60 (l2 eq h2 and (l1 eq l2 or t1 == mlstrustedsubject));
70 (t2 != app_data_file or l1 eq l2 or t1 == mlstrustedsubject);
72 (t2 != app_data_file or l1 eq l2 or t1 == mlstrustedsubject);
81 (t2 == app_data_file or l1 dom l2 or t1 == mlstrustedsubject or t2 == mlstrustedobject)
[all...] |
| /external/libsepol/include/sepol/policydb/ |
| mls_types.h | 73 static inline int mls_level_eq(const struct mls_level *l1, const struct mls_level *l2)
75 return ((l1->sens == l2->sens) && ebitmap_cmp(&l1->cat, &l2->cat));
78 static inline int mls_level_dom(const struct mls_level *l1, const struct mls_level *l2)
80 return ((l1->sens >= l2->sens) && ebitmap_contains(&l1->cat, &l2->cat));
83 #define mls_level_incomp(l1, l2) \
84 (!mls_level_dom((l1), (l2)) && !mls_level_dom((l2), (l1)))
86 #define mls_level_between(l1, l2, l3)
[all...] |
