/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.shared/util.smartptr.shared.cmp/ |
H A D | lt.pass.cpp | 23 int* ptr1(new int); 25 const std::shared_ptr<int> p1(ptr1); 28 assert((p1 < p2) == (ptr1 < ptr2));
|
H A D | eq.pass.cpp | 24 int* ptr1(new int); 26 const std::shared_ptr<int> p1(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/libopus/silk/fixed/ |
H A D | 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[ [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/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/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/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/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
H A D | filters_neon.c | 99 const int16_t* ptr1 = &x[i]; local 109 "vld1.16 {d22, d23}, [%[ptr1]]!\n\t" 117 [ptr1]"+r"(ptr1) 124 for (; ptr0 < &x[N - i]; ptr0++, ptr1++) { 126 "smulbb %[tmp], %[ptr0], %[ptr1]\n\t" 135 [ptr1]"r"(*ptr1)
|
H A D | lattice_neon.S | 19 @ int32_t* ptr1, 23 @ *ptr1 = input1 * (*ptr0) + input0 * (*ptr2); 50 ldr r4, [sp, #20] @ ptr1 96 vst1.32 {d18, d19}, [r4]! @ *ptr1 124 vst1.32 d19, [r4]! @ *ptr1 143 @ *ptr1 = input1 * (*ptr0) + input0 * (*ptr2); 149 str r5, [r4] @ Output (*ptr1)
|
H A D | codec.h | 144 int32_t* ptr1, 158 int32_t* ptr1, 175 int32_t* ptr1,
|
/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/lzma/CS/7zip/Compress/LZ/ |
H A D | LzBinTree.cs | 182 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 D | BinTree.java | 182 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 D | cvcontourtree.cpp | 81 _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...] |
H A D | cvsamplers.cpp | 648 const srctype *ptr0, *ptr1; \ 653 ptr0 = src + src_step*iys, ptr1 = ptr0 + src_step; \ 655 ptr0 = ptr1 = src + (iys < 0 ? 0 : src_size.height-1)*src_step; \ 660 p1 = cvt(ptr1[ixs])*a1 + cvt(ptr1[ixs+1])*a; \ 665 p0 = cvt(ptr0[ixs]); p1 = cvt(ptr1[ixs]); \ 733 const srctype *ptr0, *ptr1; \ 737 ptr0 = src + src_step*iys, ptr1 = ptr0 + src_step; \ 739 ptr0 = ptr1 = src + (iys < 0 ? 0 : src_size.height-1)*src_step; \ 745 ptr0 += ixs*3; ptr1 [all...] |
/external/toybox/toys/pending/ |
H A D | diff.c | 576 struct diff *t, *ptr1 = d, *ptr2 = d; local 581 if (ptr1->b < ptr1->a && ptr1->d < ptr1->c) { 586 a = ptr1->a; 587 b = ptr1->b; 590 if (i == x + 1) ptr1->suff = MAX(1,a - TT.ct); 592 if ((ptr1 - 1)->prev >= (ptr1 [all...] |
/external/clang/test/SemaCXX/ |
H A D | addr-of-overloaded-function.cpp | 182 void (*ptr1)(int, int) = &fun; // expected-error {{cannot initialize a variable of type 'void (*)(int, int)' with an rvalue of type 'void (*)(int)': different number of parameters (2 vs 1)}} 188 void (*ptr1)(double) = &fun; // expected-error {{cannot initialize a variable of type 'void (*)(double)' with an rvalue of type 'void (*)(int)': type mismatch at 1st parameter ('double' vs 'int')}} 194 int (*ptr1)(int) = &fun; // expected-error {{cannot initialize a variable of type 'int (*)(int)' with an rvalue of type 'void (*)(int)': different return type ('int' vs 'void')}}
|
/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/expat/lib/ |
H A D | xmltok.h | 229 #define XmlSameName(enc, ptr1, ptr2) (((enc)->sameName)(enc, ptr1, ptr2)) 231 #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \ 232 (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2))
|