/external/clang/test/Index/Inputs/ |
H A D | preamble.h | 3 float *ptr1; local 4 ptr = ptr1;
|
/external/libcxx/test/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/chromium_org/third_party/opus/src/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/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/chromium_org/third_party/opus/src/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...] |
/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...] |
/external/libcxx/test/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/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/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/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)
|
/external/linux-tools-perf/perf-3.12.0/arch/ia64/lib/ |
H A D | memset.S | 30 #define ptr1 r28 define 74 mov ptr1 = dest 86 (p_unalgn) add ptr1 = (MIN1+1), ptr2 // after alignment 131 mov ptr9 = ptr1 // used for prefetching 139 add ptr2 = 8, ptr1 // start of stores (beyond prefetch stores) 140 add ptr1 = tmp, ptr1 // first address beyond total range 184 cmp.lt p_scr, p0 = ptr9, ptr1 // do we need more prefetching? 201 mov ptr9 = ptr1 // used for prefetching 209 add ptr2 = 16, ptr1 // star [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | HashSetTest.cpp | 101 Dummy* ptr1 = new Dummy(deleted1); local 105 HashSet<OwnPtr<Dummy> >::AddResult res1 = set.add(adoptPtr(ptr1)); 106 EXPECT_EQ(ptr1, res1.storedValue->get()); 111 OwnPtrSet::iterator it1 = set.find(ptr1); 113 EXPECT_EQ(ptr1, (*it1)); 127 set.remove(ptr1); 148 ptr1 = new Dummy(deleted1); 152 set.add(adoptPtr(ptr1)); 154 ownPtr1 = set.take(ptr1); 162 EXPECT_EQ(ptr1, ownPtr [all...] |
/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/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
H A D | lattice_mips.c | 121 // *ptr1 = input1 * (*ptr0) + input0 * (*ptr2); 129 int32_t* ptr1, // Sample buffer 202 "sw %[t0], 0(%[ptr1]) \n\t" 203 "sw %[t1], 4(%[ptr1]) \n\t" 204 "sw %[t2], 8(%[ptr1]) \n\t" 205 "sw %[t3], 12(%[ptr1]) \n\t" 207 " addiu %[ptr1], %[ptr1], 16 \n\t" 227 "sw %[t0], 0(%[ptr1]) \n\t" 229 " addiu %[ptr1], 125 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 | codec.h | 164 int32_t* ptr1, 178 int32_t* ptr1, 193 int32_t* ptr1, 210 int32_t* ptr1,
|
/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/icu/icu4c/source/test/intltest/ |
H A D | lrucachetest.cpp | 138 const CopyOnWriteForTesting* ptr1 = NULL; local 143 cache.get("foo", ptr1, status); 146 verifySharedPointer(ptr1, "foo", "little"); 153 verifyReferences(ptr1, 2, 1, 4); 171 ptr1->removeRef(); 172 ptr1 = NULL; 226 SharedObject::clearPtr(ptr1); 236 const CopyOnWriteForTesting *ptr1; local 237 cache.get("error", ptr1, status);
|
/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...] |