/external/llvm/test/CodeGen/Thumb2/ |
2010-03-08-addi12-ccout.ll | 16 %last2 = alloca [256 x i8], align 4 ; <[256 x i8]*> [#uses=1] 169 %scevgep666 = getelementptr [256 x i8], [256 x i8]* %last2, i32 0, i32 %tmp665 ; <i8*> [#uses=1]
|
/external/llvm/test/Transforms/InstSimplify/ |
compare.ll | 117 %last2 = getelementptr inbounds i8, i8* %last1, i32 8 118 %last3 = getelementptr inbounds i8, i8* %last2, i32 -4 135 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6 137 %last.int = ptrtoint i8* %last2 to i32 150 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6 151 %cmp = icmp ult i8* %first1, %last2 163 %last2 = getelementptr inbounds i8, i8* %last1, i32 -6 164 %cmp = icmp slt i8* %first1, %last2
|
/external/skia/tools/ |
pathops_visualizer.htm | [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
tsan_rtl_report.cc | 71 const char *last2 = last_frame2->info.function; local 73 if (last2 && 0 == internal_strcmp(last2, "main")) { 85 } else if (last || last2) {
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
find_end_pred.pass.cpp | 16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
includes.pass.cpp | 16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
includes_comp.pass.cpp | 16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Compare comp);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
AttributedCharacterIteratorTest.java | 108 assertEquals("Wrong last2", 's', it.last());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
find_end_pred.pass.cpp | 16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
search.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
search_pred.pass.cpp | 15 // search(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
includes.pass.cpp | 16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
includes_comp.pass.cpp | 16 // includes(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Compare comp);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
merge.pass.cpp | 19 // merge(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2, OutIter result);
|
merge_comp.pass.cpp | 21 // InIter2 first2, InIter2 last2, OutIter result, Compare comp);
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference.pass.cpp | 18 // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
set_difference_comp.pass.cpp | 19 // set_difference(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
set_intersection.pass.cpp | 18 // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
set_intersection_comp.pass.cpp | 19 // set_intersection(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
set_symmetric_difference.pass.cpp | 19 // InIter2 first2, InIter2 last2,
|
set_symmetric_difference_comp.pass.cpp | 20 // InIter2 first2, InIter2 last2,
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
set_union.pass.cpp | 19 // InIter2 first2, InIter2 last2, OutIter result);
|
set_union_comp.pass.cpp | 19 // set_union(InIter1 first1, InIter1 last1, InIter2 first2, InIter2 last2,
|