Searched refs:ptr1 (Results 1 - 25 of 80) sorted by relevance

1234

/external/clang/test/Index/Inputs/
H A Dpreamble.h3 float *ptr1; local
4 ptr = ptr1;
/external/pdfium/core/fxcrt/
H A Dunowned_ptr_unittest.cpp21 Clink* ptr1 = new Clink(); local
23 ptr2->next_ = ptr1;
24 delete ptr1;
29 Clink* ptr1 = new Clink(); local
31 ptr2->next_ = ptr1;
32 delete ptr1;
38 Clink* ptr1 = new Clink(); local
40 ptr2->next_ = ptr1;
41 delete ptr1;
49 Clink* ptr1 local
65 Clink* ptr1 = new Clink(); local
82 Clink* ptr1 = new Clink(); local
100 UnownedPtr<int> ptr1; local
117 UnownedPtr<int> ptr1; local
[all...]
H A Dweak_ptr_unittest.cpp39 WeakTestPtr ptr1; local
40 EXPECT_FALSE(ptr1);
43 EXPECT_TRUE(ptr1 == ptr2);
44 EXPECT_FALSE(ptr1 != ptr2);
46 WeakTestPtr ptr3(ptr1);
47 EXPECT_TRUE(ptr1 == ptr3);
48 EXPECT_FALSE(ptr1 != ptr3);
50 WeakTestPtr ptr4 = ptr1;
51 EXPECT_TRUE(ptr1 == ptr4);
52 EXPECT_FALSE(ptr1 !
[all...]
H A Dshared_copy_on_write_unittest.cpp61 SharedCopyOnWrite<Object> ptr1; local
62 ptr1.Emplace(&observer, std::string("one"));
64 SharedCopyOnWrite<Object> ptr2 = ptr1;
69 SharedCopyOnWrite<Object> ptr3(ptr1);
82 SharedCopyOnWrite<Object> ptr1; local
83 ptr1.Emplace(&observer, std::string("one"));
84 ptr1.Emplace(&observer, std::string("two"));
96 SharedCopyOnWrite<Object> ptr1; local
97 ptr1.Emplace(&observer, std::string("one"));
98 SharedCopyOnWrite<Object> ptr2(ptr1);
[all...]
H A Dmaybe_owned_unittest.cpp32 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 MaybeOwned<PseudoDeletable> ptr1(&thing1);
149 EXPECT_FALSE(ptr1.IsOwned());
152 MaybeOwned<PseudoDeletable> ptr3(std::move(ptr1));
154 EXPECT_FALSE(ptr1
[all...]
H A Dretain_ptr_unittest.cpp50 RetainPtr<PseudoRetainable> ptr1(&obj);
52 RetainPtr<PseudoRetainable> ptr2(ptr1);
66 RetainPtr<PseudoRetainable> ptr1(&obj);
68 RetainPtr<PseudoRetainable> ptr2(std::move(ptr1));
69 EXPECT_EQ(nullptr, ptr1.Get());
114 RetainPtr<PseudoRetainable> ptr1(&obj1);
117 ptr1.Swap(ptr2);
158 RetainPtr<PseudoRetainable> ptr1(&obj1);
161 ptr1.Swap(ptr2);
162 EXPECT_FALSE(ptr1);
[all...]
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.cmp/
H A Dlt.pass.cpp23 int* ptr1(new int);
25 const std::shared_ptr<int> p1(ptr1);
28 assert((p1 < p2) == (ptr1 < ptr2));
H A Deq.pass.cpp24 int* ptr1(new int);
26 const std::shared_ptr<int> p1(ptr1);
/external/libopus/silk/float/
H A DcorrMatrix_FLP.c48 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...]
/external/libopus/silk/fixed/
H A DcorrMatrix_FIX.c50 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_ADD_RSHIFT32( inner_prod, 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
104 ptr1 = &x[ order - 1 ]; /* First sample of column 0 of X */
106 energy = silk_SUB32( energy, silk_RSHIFT32( silk_SMULBB( ptr1[ L - j ], ptr1[
[all...]
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.mod/
H A Dswap.pass.cpp33 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 Dswap.pass.cpp33 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/clang/test/SemaTemplate/
H A Dclass-template-id.cpp21 B<17 + 2> *bar(B<(19)> *ptr1, B< (::value + 7) > *ptr2, B<19 - 3> *ptr3) { argument
22 if (ptr1)
23 return ptr1;
H A Dinstantiate-complete.cpp27 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/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.mod/
H A Dswap.pass.cpp33 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 Dswap.pass.cpp33 A* ptr1 = new A; local
35 std::shared_ptr<A> p1(ptr1);
44 assert(w2.lock().get() == ptr1);
/external/libcxx/test/std/utilities/memory/specialized.algorithms/specialized.destroy/
H A Ddestroy_at.pass.cpp52 Counted* ptr1 = ::new(mem1) Counted(); local
55 std::destroy_at(ptr1);
67 DCounted* ptr1 = ::new(mem1) DCounted(); local
71 std::destroy_at(ptr1);
/external/deqp/framework/delibs/decpp/
H A DdeUniquePtr.cpp166 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/lzma/Java/Tukaani/src/org/tukaani/xz/lz/
H A DBT4.java133 int ptr1 = cyclicPos << 1;
145 tree[ptr1] = 0;
165 tree[ptr1] = tree[pair];
174 tree[ptr1] = currentMatch;
175 ptr1 = pair + 1;
176 currentMatch = tree[ptr1];
191 int ptr1 = cyclicPos << 1;
200 tree[ptr1] = 0;
214 tree[ptr1] = tree[pair];
223 tree[ptr1]
[all...]
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
H A Dlattice_mips.c123 // *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 Dlattice_neon.c21 // *ptr1 = input1 * (*ptr0) + input0 * (*ptr2);
29 int32_t* ptr1, // Sample buffer
93 // Calculate *ptr1 = tmp1 + tmp3.
97 vst1q_s32(ptr1, ptr1va);
98 vst1q_s32(ptr1 + 4, ptr1vb);
99 ptr1 += 8;
134 // Calculate *ptr1 = tmp1 + tmp3.
137 vst1q_s32(ptr1, ptr1va);
138 ptr1 += 4;
169 // Calculate *ptr1
25 WebRtcIsacfix_FilterMaLoopNeon(int16_t input0, int16_t input1, int32_t input2, int32_t* ptr0, int32_t* ptr1, int32_t* ptr2) argument
[all...]
/external/lzma/CS/7zip/Compress/LZ/
H A DLzBinTree.cs182 UInt32 ptr1 = (_cyclicBufferPos << 1);
206 _son[ptr0] = _son[ptr1] = kEmptyHashValue;
227 _son[ptr1] = _son[cyclicPos];
235 _son[ptr1] = curMatch;
236 ptr1 = cyclicPos + 1;
237 curMatch = _son[ptr1];
291 UInt32 ptr1 = (_cyclicBufferPos << 1);
301 _son[ptr0] = _son[ptr1] = kEmptyHashValue;
319 _son[ptr1] = _son[cyclicPos];
326 _son[ptr1]
[all...]
/external/lzma/Java/SevenZip/Compression/LZ/
H A DBinTree.java182 int ptr1 = (_cyclicBufferPos << 1);
206 _son[ptr0] = _son[ptr1] = kEmptyHashValue;
227 _son[ptr1] = _son[cyclicPos];
235 _son[ptr1] = curMatch;
236 ptr1 = cyclicPos + 1;
237 curMatch = _son[ptr1];
291 int ptr1 = (_cyclicBufferPos << 1);
301 _son[ptr0] = _son[ptr1] = kEmptyHashValue;
319 _son[ptr1] = _son[cyclicPos];
326 _son[ptr1]
[all...]
/external/opencv/cv/src/
H A Dcvcontourtree.cpp81 _CvTrianAttr **ptr_p, **ptr_n, **ptr1, **ptr2; /* pointers to pointers of triangles */ local
112 ptr_p = ptr_n = ptr1 = ptr2 = NULL;
158 ptr1 = ptr_p;
169 ptr1 = ptr_p;
179 ptr1 = ptr_n;
238 if( ptr1[j_1] == NULL && ptr1[j] == NULL )
253 tree_one.next_v1 = ptr1[j_1];
254 tree_one.next_v2 = ptr1[j];
259 if( ptr1[j_
[all...]
/external/libchrome/base/
H A Dsecurity_unittest.cc131 // Check if ptr1 and ptr2 are separated by less than size chars.
132 bool ArePointersToSameArea(void* ptr1, void* ptr2, size_t size) { argument
133 ptrdiff_t ptr_diff = reinterpret_cast<char*>(std::max(ptr1, ptr2)) -
134 reinterpret_cast<char*>(std::min(ptr1, ptr2));

Completed in 1001 milliseconds

1234