| /external/clang/test/Analysis/ |
| pr22954.c | 318 struct ii i181 = {{1, 2, 3, 4}, 5, 6}; local
319 i181.i = 10;
320 i181.j = 11;
321 i181.s2 = strdup("hello");
323 memcpy(i181.s1, input, 5); // invalidate the whole region of i181
324 clang_analyzer_eval(i181.s1[0] == 1); // expected-warning{{UNKNOWN}}\
325 expected-warning{{Potential leak of memory pointed to by 'i181.s2'}}
326 clang_analyzer_eval(i181.s1[1] == 2); // expected-warning{{UNKNOWN}}
327 clang_analyzer_eval(i181.s1[2] == 3); // expected-warning{{UNKNOWN}
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 323 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
450 assert(std::is_heap_until(i181, i181+7) == i181+1);
|
| is_heap.pass.cpp | 323 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
450 assert(std::is_heap(i181, i181+7) == (std::is_heap_until(i181, i181+7) == i181+7));
|
| is_heap_until_comp.pass.cpp | 324 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
451 assert(std::is_heap_until(i181, i181+7, std::greater<int>()) == i181+5);
|
| is_heap_comp.pass.cpp | 324 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_until.pass.cpp | 323 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
450 assert(std::is_heap_until(i181, i181+7) == i181+1);
|
| is_heap.pass.cpp | 323 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
450 assert(std::is_heap(i181, i181+7) == (std::is_heap_until(i181, i181+7) == i181+7));
|
| is_heap_until_comp.pass.cpp | 324 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
451 assert(std::is_heap_until(i181, i181+7, std::greater<int>()) == i181+5);
|
| is_heap_comp.pass.cpp | 324 int i181[] = {0, 1, 1, 1, 1, 0, 1}; local
[all...] |
| /art/test/083-compiler-regressions/src/ |
| Main.java | 1698 int i181 = 181; local
[all...] |
