/external/chromium_org/v8/test/mjsunit/regress/ |
regress-319722-ArrayBuffer.js | 30 var ab; variable 33 for (k = 8; k >= 1 && ab == null; k = k/2) { 35 ab = new ArrayBuffer(maxSize * k); 37 ab = null; 41 assertTrue(ab != null); 45 new constr(ab, 0, maxSize);
|
regress-581.js | 39 var ab = a.concat(b); variable 40 assertEquals(2 * pow31 - 1, ab.length); 41 assertEquals(31, ab[pow31]); 42 assertEquals(32, ab[2 * pow31 - 1]);
|
regress-copy-hole-to-field.js | 47 var o = {ab:5}; 50 o.ab = a[i]; 57 assertEquals(undefined, o.ab);
|
/external/compiler-rt/test/asan/TestCases/Helpers/ |
initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
/external/libcxx/test/containers/sequences/deque/deque.cons/ |
copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); 34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), 38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); 40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)) 45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
move_alloc.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[0]) 55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
move_assign.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 42 int* an = ab + sizeof(ab)/sizeof(ab[0]) 57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 31 int* an = ab + sizeof(ab)/sizeof(ab[0]); 32 test(std::deque<int>(ab, an)); 50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 51 int* an = ab + sizeof(ab)/sizeof(ab[0]); 52 test(std::deque<int, min_allocator<int>>(ab, an)) [all...] |
move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[0]) 56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); 33 test(std::deque<int>(ab, an)); 51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); 53 test(std::deque<int, min_allocator<int>>(ab, an)) [all...] |
iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 40 int* an = ab + sizeof(ab)/sizeof(ab[0]); 41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 42 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 43 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 44 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()) [all...] |
iter_iter.pass.cpp | 52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 53 int* an = ab + sizeof(ab)/sizeof(ab[0]); 54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 58 test<stack_allocator<int, 4096> >(ab, an); 60 test<min_allocator<int> >(ab, an) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); 34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), 38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); 40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)) 45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
move_alloc.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[0]) 55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
move_assign.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 42 int* an = ab + sizeof(ab)/sizeof(ab[0]) 57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 31 int* an = ab + sizeof(ab)/sizeof(ab[0]); 32 test(std::deque<int>(ab, an)); 50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 51 int* an = ab + sizeof(ab)/sizeof(ab[0]); 52 test(std::deque<int, min_allocator<int>>(ab, an)) [all...] |
move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[0]) 56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); 33 test(std::deque<int>(ab, an)); 51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); 53 test(std::deque<int, min_allocator<int>>(ab, an)) [all...] |
iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 40 int* an = ab + sizeof(ab)/sizeof(ab[0]); 41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 42 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 43 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 44 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()) [all...] |
iter_iter.pass.cpp | 52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 53 int* an = ab + sizeof(ab)/sizeof(ab[0]); 54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 58 test<stack_allocator<int, 4096> >(ab, an); 60 test<min_allocator<int> >(ab, an) [all...] |
/external/pcre/dist/ |
pcre_valid_utf8.c | 120 register pcre_uchar ab, c, d; local 137 ab = PRIV(utf8_table4)[c & 0x3f]; /* Number of additional bytes */ 138 if (length < ab) 141 return ab - length; /* Codes ERR1 to ERR5 */ 143 length -= ab; /* Length remaining */ 157 switch (ab) 285 if (ab > 3) 287 *erroroffset = (int)(p - string) - ab; 288 return (ab == 4)? PCRE_UTF8_ERR11 : PCRE_UTF8_ERR12;
|
/external/clang/test/CodeGenCXX/ |
atomicinit.cpp | 30 void atomic_init_bool(_Atomic(bool) *ab, bool b) { 34 __c11_atomic_init(ab, b); 39 _Atomic(bool) ab; member in struct:AtomicBoolMember 47 AtomicBoolMember::AtomicBoolMember(bool b) : ab(b) { }
|
/external/owasp/sanitizer/src/main/org/owasp/html/ |
PolicyFactory.java | 178 ImmutableMap.Builder<String, AttributePolicy> ab = ImmutableMap.builder(); local 182 ab.put( 191 ab.put(attrName, e.getValue()); 194 allGlobalAttrPolicies = ab.build();
|
/dalvik/dx/tests/119-merge-conflict/com/android/dx/merge/ |
MergeConflictTest.java | 31 Dex ab = new DexMerger(a, b, CollisionPolicy.FAIL).merge(); local 33 // a and ab overlap; this should fail 34 DexMerger dexMerger = new DexMerger(a, ab, CollisionPolicy.FAIL);
|
/developers/build/prebuilts/gradle/ActionBarCompat-Styled/Application/src/main/java/com/example/android/actionbarcompat/styled/ |
MainActivity.java | 46 ActionBar ab = getSupportActionBar(); local 47 ab.setNavigationMode(ActionBar.NAVIGATION_MODE_TABS); 50 ab.addTab(ab.newTab().setText("Tab 1").setTabListener(this)); 51 ab.addTab(ab.newTab().setText("Tab 2").setTabListener(this)); 52 ab.addTab(ab.newTab().setText("Tab 3").setTabListener(this));
|