/external/clang/test/Index/Inputs/ |
H A D | preamble.h | 3 float *ptr1; local 4 ptr = ptr1;
|
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.mod/ |
H A D | swap.pass.cpp | 33 A* ptr1 = new A; local 35 std::shared_ptr<A> p1(ptr1); 44 assert(w2.lock().get() == ptr1);
|
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.spec/ |
H A D | swap.pass.cpp | 33 A* ptr1 = new A; local 35 std::shared_ptr<A> p1(ptr1); 44 assert(w2.lock().get() == ptr1);
|
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.mod/ |
H A D | swap.pass.cpp | 33 A* ptr1 = new A; local 35 std::shared_ptr<A> p1(ptr1); 42 assert(p2.get() == ptr1); 51 A* ptr1 = new A; local 53 std::shared_ptr<A> p1(ptr1); 60 assert(p2.get() == ptr1); 69 A* ptr1 = 0; local 78 assert(p2.get() == ptr1); 87 A* ptr1 = 0; local 96 assert(p2.get() == ptr1); [all...] |
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.spec/ |
H A D | swap.pass.cpp | 33 A* ptr1 = new A; local 35 std::shared_ptr<A> p1(ptr1); 42 assert(p2.get() == ptr1); 51 A* ptr1 = new A; local 53 std::shared_ptr<A> p1(ptr1); 60 assert(p2.get() == ptr1); 69 A* ptr1 = 0; local 78 assert(p2.get() == ptr1); 87 A* ptr1 = 0; local 96 assert(p2.get() == ptr1); [all...] |
/external/libcxx/test/std/utilities/memory/specialized.algorithms/specialized.destroy/ |
H A D | destroy_at.pass.cpp | 52 Counted* ptr1 = ::new(mem1) Counted(); local 55 std::destroy_at(ptr1); 67 DCounted* ptr1 = ::new(mem1) DCounted(); local 71 std::destroy_at(ptr1);
|
/external/libopus/silk/float/ |
H A D | corrMatrix_FLP.c | 48 const silk_float *ptr1; local 50 ptr1 = &x[ Order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */ 53 Xt[ lag ] = (silk_float)silk_inner_product_FLP( ptr1, t, L ); 54 ptr1--; /* Next column of X */ 68 const silk_float *ptr1, *ptr2; local 70 ptr1 = &x[ Order - 1 ]; /* First sample of column 0 of X */ 71 energy = silk_energy_FLP( ptr1, L ); /* X[:,0]'*X[:,0] */ 75 energy += ptr1[ -j ] * ptr1[ -j ] - ptr1[ [all...] |
H A D | solve_LS_FLP.c | 121 const silk_float *ptr1; local 124 ptr1 = matrix_adr( L, 0, i, M ); 127 temp += ptr1[ j * M ] * x[ j ]; 143 const silk_float *ptr1; local 146 ptr1 = matrix_adr( L, i, 0, M ); 149 temp += ptr1[ j ] * x[ j ]; 164 silk_float *ptr1, *ptr2; local 174 ptr1 = matrix_adr( L, j, 0, M ); 177 v[ i ] = ptr1[ i ] * D[ i ]; 178 temp -= ptr1[ [all...] |
/external/pdfium/core/fxcrt/ |
H A D | cfx_weak_ptr_unittest.cpp | 39 WeakPtr ptr1; local 40 EXPECT_FALSE(ptr1); 43 EXPECT_TRUE(ptr1 == ptr2); 44 EXPECT_FALSE(ptr1 != ptr2); 46 WeakPtr ptr3(ptr1); 47 EXPECT_TRUE(ptr1 == ptr3); 48 EXPECT_FALSE(ptr1 != ptr3); 50 WeakPtr ptr4 = ptr1; 51 EXPECT_TRUE(ptr1 == ptr4); 52 EXPECT_FALSE(ptr1 ! [all...] |
H A D | cfx_maybe_owned_unittest.cpp | 32 CFX_MaybeOwned<PseudoDeletable> ptr1; local 33 EXPECT_FALSE(ptr1.IsOwned()); 34 EXPECT_FALSE(ptr1); 35 EXPECT_EQ(nullptr, ptr1.Get()); 38 EXPECT_TRUE(ptr1 == ptr2); 39 EXPECT_FALSE(ptr1 != ptr2); 146 CFX_MaybeOwned<PseudoDeletable> ptr1(&thing1); 149 EXPECT_FALSE(ptr1.IsOwned()); 152 CFX_MaybeOwned<PseudoDeletable> ptr3(std::move(ptr1)); 154 EXPECT_FALSE(ptr1 [all...] |
H A D | cfx_shared_copy_on_write_unittest.cpp | 60 CFX_SharedCopyOnWrite<Object> ptr1; local 61 ptr1.Emplace(&observer, std::string("one")); 63 CFX_SharedCopyOnWrite<Object> ptr2 = ptr1; 68 CFX_SharedCopyOnWrite<Object> ptr3(ptr1); 81 CFX_SharedCopyOnWrite<Object> ptr1; local 82 ptr1.Emplace(&observer, std::string("one")); 83 ptr1.Emplace(&observer, std::string("two")); 95 CFX_SharedCopyOnWrite<Object> ptr1; local 96 ptr1.Emplace(&observer, std::string("one")); 97 CFX_SharedCopyOnWrite<Object> ptr2(ptr1); [all...] |
/external/clang/test/SemaTemplate/ |
H A D | class-template-id.cpp | 21 B<17 + 2> *bar(B<(19)> *ptr1, B< (::value + 7) > *ptr2, B<19 - 3> *ptr3) { argument 22 if (ptr1) 23 return ptr1;
|
H A D | instantiate-complete.cpp | 27 void test_subscript(X<double> *ptr1, X<int(int)> *ptr2, int i) { argument 28 (void)ptr1[i]; 32 void test_arith(X<signed char> *ptr1, X<unsigned char> *ptr2, argument 34 (void)(ptr1 + 5);
|
/external/deqp/framework/delibs/decpp/ |
H A D | deUniquePtr.cpp | 166 MovePtr<Object> ptr1(new Object(exists1)); 168 ptr1 = ptr2; 178 MovePtr<Object> ptr1(new Object(exists)); 179 raw = ptr1.release(); 181 DE_TEST_ASSERT(ptr1.get() == DE_NULL); 193 MovePtr<Object> ptr1; local 194 DE_TEST_ASSERT(ptr1.get() == DE_NULL); 196 ptr1 = ptr2; 198 DE_TEST_ASSERT(ptr1.get() != DE_NULL);
|
/external/libopus/silk/fixed/ |
H A D | corrMatrix_FIX.c | 50 const opus_int16 *ptr1, *ptr2; local 53 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */ 61 inner_prod += silk_RSHIFT32( silk_SMULBB( ptr1[ i ], ptr2[i] ), rshifts ); 64 ptr1--; /* Go to next column of X */ 69 Xt[ lag ] = silk_inner_prod_aligned( ptr1, ptr2, L, arch ); /* X[:,lag]'*t */ 70 ptr1--; /* Go to next column of X */ 88 const opus_int16 *ptr1, *ptr2; local 112 ptr1 = &x[ order - 1 ]; /* First sample of column 0 of X */ 114 energy = silk_SUB32( energy, silk_RSHIFT32( silk_SMULBB( ptr1[ L - j ], ptr1[ [all...] |
H A D | solve_LS_FIX.c | 124 const opus_int32 *ptr1, *ptr2; local 136 ptr1 = matrix_adr( L_Q16, j, 0, M ); 139 v_Q0[ i ] = silk_SMULWW( D_Q0[ i ], ptr1[ i ] ); /* Q0 */ 140 tmp_32 = silk_SMLAWW( tmp_32, v_Q0[ i ], ptr1[ i ] ); /* Q0 */ 166 ptr1 = matrix_adr( A, j, 0, M ); 173 tmp_32 = silk_SUB32( ptr1[ i ], tmp_32 ); /* always < max(Correlation) */
|
/external/clang/test/CXX/expr/expr.post/expr.const.cast/ |
H A D | p1-0x.cpp | 17 int *&&ptr1 = const_cast<int *&&>(xvalue<const int*>()); local
|
/external/libchrome/base/ |
H A D | security_unittest.cc | 130 // Check if ptr1 and ptr2 are separated by less than size chars. 131 bool ArePointersToSameArea(void* ptr1, void* ptr2, size_t size) { argument 132 ptrdiff_t ptr_diff = reinterpret_cast<char*>(std::max(ptr1, ptr2)) - 133 reinterpret_cast<char*>(std::min(ptr1, ptr2));
|
/external/v8/src/profiler/ |
H A D | tick-sample.cc | 17 bool IsSamePage(i::byte* ptr1, i::byte* ptr2) { argument 20 return (reinterpret_cast<uintptr_t>(ptr1) & mask) ==
|
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
H A D | lattice_mips.c | 123 // *ptr1 = input1 * (*ptr0) + input0 * (*ptr2); 131 int32_t* ptr1, // Sample buffer 204 "sw %[t0], 0(%[ptr1]) \n\t" 205 "sw %[t1], 4(%[ptr1]) \n\t" 206 "sw %[t2], 8(%[ptr1]) \n\t" 207 "sw %[t3], 12(%[ptr1]) \n\t" 209 " addiu %[ptr1], %[ptr1], 16 \n\t" 229 "sw %[t0], 0(%[ptr1]) \n\t" 231 " addiu %[ptr1], 127 WebRtcIsacfix_FilterMaLoopMIPS(int16_t input0, int16_t input1, int32_t input2, int32_t* ptr0, int32_t* ptr1, int32_t* ptr2) argument [all...] |
H A D | lattice.c | 51 *ptr1 = input1 * (*ptr0) + input0 * (*ptr2); 59 int32_t* ptr1, // Sample buffer 69 // The loop filtering the samples *ptr0, *ptr1, *ptr2 with filter coefficients 71 for(n = 0; n < HALF_SUBFRAMELEN - 1; n++, ptr0++, ptr1++, ptr2++) { 80 // Calculate *ptr1 = input1 * (*ptr0) + input0 * (*ptr2); 83 *ptr1 = tmp32a + tmp32b; // Q15 + Q15 = Q15 55 WebRtcIsacfix_FilterMaLoopC(int16_t input0, int16_t input1, int32_t input2, int32_t* ptr0, int32_t* ptr1, int32_t* ptr2) argument
|
/external/clang/test/Analysis/ |
H A D | ptr-arith.c | 304 char *ptr1 = str - 1; local 305 clang_analyzer_eval(*ptr1 == 'a'); // expected-warning{{UNKNOWN}}
|
/external/clang/test/CodeGenCXX/ |
H A D | member-function-pointers.cpp | 112 void (foo::*ptr1)(void *) = (void (foo::*)(void *))&foo::bar; member in namespace:PR5138 204 void (C::*ptr1)() = &B::foo; member in namespace:test7
|
/external/libvpx/libvpx/vp8/decoder/ |
H A D | onyxd_int.h | 30 void *ptr1; member in struct:__anon11853
|
/external/webp/src/utils/ |
H A D | huffman_encode_utils.c | 122 static int CompareHuffmanTrees(const void* ptr1, const void* ptr2) { argument 123 const HuffmanTree* const t1 = (const HuffmanTree*)ptr1;
|