| /toolchain/binutils/binutils-2.25/gold/testsuite/ |
| dyn_weak_ref_1.c | 33 void* ptr1 = weak_ref; variable
|
| /external/clang/test/Index/Inputs/ |
| preamble.h | 3 float *ptr1; local
4 ptr = ptr1;
|
| /external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.mod/ |
| 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/ |
| swap.pass.cpp | 33 A* ptr1 = new A; local
35 std::shared_ptr<A> p1(ptr1);
44 assert(w2.lock().get() == ptr1);
|
| /external/libopus/silk/float/ |
| 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[ L - j ] * ptr1[ L - j ]
[all...] |
| 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[ i ] * v[ i ]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.mod/ |
| swap.pass.cpp | 33 A* ptr1 = new A; local
35 std::shared_ptr<A> p1(ptr1);
44 assert(w2.lock().get() == ptr1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.spec/ |
| 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/ |
| 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/ |
| 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.mod/ |
| 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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.spec/ |
| 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/libopus/silk/fixed/ |
| corrMatrix_FIX.c | 49 const opus_int16 *ptr1, *ptr2; local
52 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */
60 inner_prod += silk_RSHIFT32( silk_SMULBB( ptr1[ i ], ptr2[i] ), rshifts );
63 ptr1--; /* Go to next column of X */
68 Xt[ lag ] = silk_inner_prod_aligned( ptr1, ptr2, L ); /* X[:,lag]'*t */
69 ptr1--; /* Go to next column of X */
86 const opus_int16 *ptr1, *ptr2; local
110 ptr1 = &x[ order - 1 ]; /* First sample of column 0 of X */
112 energy = silk_SUB32( energy, silk_RSHIFT32( silk_SMULBB( ptr1[ L - j ], ptr1[ L - j ] ), rshifts_local ) )
[all...] |
| 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) */
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| pred_lt4.c | 60 Word16 *ptr, *ptr1; local
77 ptr1 = x;
78 L_sum = vo_mult32((*ptr1++), (*ptr++));
79 L_sum += vo_mult32((*ptr1++), (*ptr++));
80 L_sum += vo_mult32((*ptr1++), (*ptr++));
81 L_sum += vo_mult32((*ptr1++), (*ptr++));
82 L_sum += vo_mult32((*ptr1++), (*ptr++));
83 L_sum += vo_mult32((*ptr1++), (*ptr++));
84 L_sum += vo_mult32((*ptr1++), (*ptr++));
85 L_sum += vo_mult32((*ptr1++), (*ptr++))
[all...] |
| /art/runtime/arch/arm64/ |
| fault_handler_arm64.cc | 121 uint8_t* ptr1 = ptr2 - 4; local
133 uint8_t* limit = ptr1 - 80; // Compiler will hoist to a max of 20 instructions.
135 while (ptr1 > limit) {
136 uint32_t inst1 = *reinterpret_cast<uint32_t*>(ptr1);
142 ptr1 -= 4;
|
| /bionic/linker/tests/ |
| linker_block_allocator_test.cpp | 54 test_struct_nominal* ptr1 = allocator.alloc(); local
55 ASSERT_TRUE(ptr1 != nullptr);
56 ASSERT_EQ(0U, reinterpret_cast<uintptr_t>(ptr1) % 16);
61 ASSERT_EQ(reinterpret_cast<uint8_t*>(ptr1)+16, reinterpret_cast<uint8_t*>(ptr2));
63 ptr1->value = 42;
65 allocator.free(ptr1);
72 char* ptr1 = reinterpret_cast<char*>(allocator.alloc()); local
75 ASSERT_TRUE(ptr1 != nullptr);
76 ASSERT_EQ(0U, reinterpret_cast<uintptr_t>(ptr1) % 16);
79 ASSERT_EQ(ptr1+16, ptr2); // aligned to 1
85 test_struct_larger* ptr1 = allocator.alloc(); local
[all...] |
| linker_memory_allocator_test.cpp | 124 test_struct_small* ptr1 = local
129 ASSERT_TRUE(ptr1 != nullptr);
130 ASSERT_EQ(0U, reinterpret_cast<uintptr_t>(ptr1) % 16);
134 ASSERT_EQ(reinterpret_cast<uintptr_t>(ptr1)+16, reinterpret_cast<uintptr_t>(ptr2));
135 ASSERT_TRUE(memcmp(ptr1, zeros, 16) == 0);
137 allocator.free(ptr1);
145 test_struct_huge* ptr1 = local
150 ASSERT_TRUE(ptr1 != nullptr);
151 ASSERT_EQ(0U, reinterpret_cast<uintptr_t>(ptr1) % 16);
156 reinterpret_cast<uintptr_t>(ptr1)/kPageSize != reinterpret_cast<uintptr_t>(ptr2)/kPageSize)
164 test_struct_large* ptr1 = local
[all...] |
| /external/deqp/framework/delibs/decpp/ |
| 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);
|
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| pvmp3_alias_reduction.cpp | 162 int32 *ptr1; local
212 ptr1 = ptr3;
225 int32 x = *ptr1 << 1;
226 *ptr1-- = fxp_msb32_Q32(fxp_mul32_Q32(x, csi1), y << 1, csa1);
229 x = *ptr1 << 1;
230 *ptr1 = fxp_msb32_Q32(fxp_mul32_Q32(x, csi2), y << 1, csa2);
232 ptr1 += 19;
235 x = *ptr1 << 1;
236 *ptr1-- = fxp_msb32_Q32(fxp_mul32_Q32(x, csi1), y << 1, csa1);
239 x = *ptr1 << 1
[all...] |
| /system/core/libmemunreachable/tests/ |
| Allocator_test.cpp | 50 void *ptr1 = allocator.allocate(); local
51 ASSERT_TRUE(ptr1 != NULL);
54 ASSERT_NE(ptr1, ptr2);
55 allocator.deallocate(ptr1);
57 ASSERT_EQ(ptr1, ptr3);
124 void* ptr1 = a.allocate(); local
129 b.deallocate(ptr1);
|
| /art/runtime/arch/arm/ |
| fault_handler_arm.cc | 148 uint8_t* ptr1 = ptr2 - 4; local
160 uint8_t* limit = ptr1 - 40; // Compiler will hoist to a max of 20 instructions.
162 while (ptr1 > limit) {
163 uint32_t inst1 = ((ptr1[0] | ptr1[1] << 8) << 16) | (ptr1[2] | ptr1[3] << 8);
169 ptr1 -= 2; // Min instruction size is 2 bytes.
|
| /external/clang/test/CXX/expr/expr.post/expr.const.cast/ |
| p1-0x.cpp | 17 int *&&ptr1 = const_cast<int *&&>(xvalue<const int*>()); local
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
| BT4.java | 133 int ptr1 = cyclicPos << 1; local
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; local
200 tree[ptr1] = 0;
214 tree[ptr1] = tree[pair];
223 tree[ptr1] = currentMatch
[all...] |
| /external/opencv3/samples/tapi/ |
| pyrlk_optical_flow.cpp | 124 UMat ptr0, ptr1; local
161 ptr1 = frame1Gray;
168 ptr1 = frame0Gray;
176 calcOpticalFlowPyrLK(ptr0, ptr1, pts, nextPts, status, err);
|
