Searched refs:l1 (Results 51 - 75 of 319) sorted by relevance

1234567891011>>

/external/llvm/test/MC/ARM/
H A Dcmp-immediate-fixup-error.s4 cmp r0, #(l1 - unknownLabel + 4) >> 2
7 l1: label
H A Dcmp-immediate-fixup-error2.s4 cmp r0, #(l1 - unknownLabel)
7 l1: label
H A Dcmp-immediate-fixup.s7 cmp r2, #(l2 - l1 + 4) >> 2
8 l1: label
H A Dcmp-immediate-fixup2.s7 cmp r2, #(l2 - l1)
8 l1: label
/external/python/cpython2/Tools/pybench/
H A DConstructs.py478 l1 = range(1000)
482 for i in l1:
489 l1 = range(1000)
503 l1 = range(100)
505 for i in l1:
507 for i in l1:
509 for i in l1:
511 for i in l1:
513 for i in l1:
516 for i in l1
[all...]
/external/python/cpython2/Modules/_ctypes/libffi/testsuite/libffi.call/
H A Dcls_struct_va1.c32 struct large_tag l1 = * (struct large_tag *) args[2]; local
36 l1.a, l1.b, l1.c, l1.d, l1.e,
59 struct large_tag l1; local
100 l1.a = 10;
101 l1.b = 11;
102 l1
[all...]
/external/python/cpython2/Lib/lib2to3/tests/
H A Dtest_pytree.py57 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_
[all...]
/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/
H A Derase_iter_iter_db1.pass.cpp28 std::unordered_map<int, int> l1(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
H A Derase_iter_iter_db2.pass.cpp28 std::unordered_map<int, int> l1(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
H A Derase_iter_db2.pass.cpp28 std::unordered_map<int, int> l1(a1, a1+3);
31 l1.erase(i);
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
H A Derase_iter_iter_db1.pass.cpp28 std::unordered_multimap<int, int> l1(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
H A Derase_iter_iter_db2.pass.cpp28 std::unordered_multimap<int, int> l1(a1, a1+3);
30 std::unordered_multimap<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
H A Derase_iter_db2.pass.cpp28 std::unordered_multimap<int, int> l1(a1, a1+3);
31 l1.erase(i);
/external/selinux/libsepol/include/sepol/policydb/
H A Dmls_types.h76 static inline int mls_level_eq(const struct mls_level *l1, const struct mls_level *l2) argument
78 return ((l1->sens == l2->sens) && ebitmap_cmp(&l1->cat, &l2->cat));
81 static inline int mls_level_dom(const struct mls_level *l1, const struct mls_level *l2) argument
83 return ((l1->sens >= l2->sens) && ebitmap_contains(&l1->cat, &l2->cat));
86 #define mls_level_incomp(l1, l2) \
87 (!mls_level_dom((l1), (l2)) && !mls_level_dom((l2), (l1)))
89 #define mls_level_between(l1, l
[all...]
/external/clang/test/CodeGen/
H A Dle32-libcall-pow.c18 double l1 = pow(a1, a1); local
/external/llvm/test/MC/AArch64/
H A Doptional-hash.s16 l1: label
/external/r8/src/test/examples/rewrite/
H A DLongCompare.java8 public static int simpleCompare(long l1, long l2) { argument
10 return Long.compare(l1, l2);
25 public static boolean complexCompare(long l1, long l2) { argument
26 return Long.compare(getValue1(), l1) == 0 && Long.compare(l2, getValue2()) > 0;
/external/autotest/contrib/
H A Dservo-inventory17 ' | sort | ./haveservo | xargs -l1 ./servo-stat
/external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/
H A Derase_iter_iter_db3.pass.cpp24 std::list<int> l1(a1, a1+3);
26 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
/external/libcxx/test/std/containers/unord/unord.multiset/
H A Derase_iter_db2.pass.cpp27 std::unordered_multiset<int> l1(a1, a1+3);
30 l1.erase(i);
H A Derase_iter_iter_db3.pass.cpp27 std::unordered_multiset<int> l1(a1, a1+3);
29 std::unordered_multiset<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
/external/libcxx/test/std/containers/unord/unord.set/
H A Derase_iter_db2.pass.cpp27 std::unordered_set<int> l1(a1, a1+3);
30 l1.erase(i);
H A Derase_iter_iter_db3.pass.cpp27 std::unordered_set<int> l1(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
/external/clang/test/CodeGenCXX/
H A Dstatic-local-in-local-class.cpp50 // Referring to l1 before emitting it used to crash.
52 static int l1 = 0;
53 return [] { return l1; };
62 // Taking the address of l1 in a constant expression used to crash.
64 static int l1 = 0;
66 static int *l2 = &l1;
76 // Lambda-less reduction that references l1 before emitting it. This didn't
80 static int l1 = 0; local
82 int operator()() { return l1; }
/external/eigen/bench/
H A Dcheck_cache_queries.cpp22 int l1, l2, l3; local
23 internal::queryCacheSizes(l1, l2, l3);
24 cout << "Eigen's L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
43 internal::queryCacheSizes_intel_codes(l1, l2, l3);
44 cout << "Eigen's intel codes L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
47 internal::queryCacheSizes_intel_direct(l1, l2, l3);
48 cout << "Eigen's intel direct L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
50 internal::queryCacheSizes_amd(l1, l2, l3);
51 cout << "Eigen's amd L1, L2, L3 = " << l1 << " " << l2 << " " << l3 << endl;
57 l1
[all...]

Completed in 1080 milliseconds

1234567891011>>