Searched defs:p1 (Results 151 - 175 of 671) sorted by relevance

1234567891011>>

/external/clang/test/CodeGenCXX/
H A Ddelete.cpp140 void array_delete_incomplete(Incomplete *p1, Incomplete *p2) { argument
142 delete p1;
/external/clang/test/Headers/
H A Dstddefneeds.cpp12 ptrdiff_t p1; variable
/external/clang/test/SemaCXX/
H A Ddelete.cpp128 const T *p1 = nullptr; member in struct:MissingInitializer::Base::S
134 delete s.p1;
/external/cn-cbor/src/
H A Dcn-cbor.c27 cn_cbor* p1; local
28 while ((p1 = p->first_child)) { /* go down */
29 p = p1;
31 if (!(p1 = p->next)) { /* go up next */
32 if ((p1 = p->parent))
33 p1->first_child = 0;
36 p = p1;
/external/compiler-rt/lib/asan/tests/
H A Dasan_noinst_test.cc146 void *p1 = __asan::asan_malloc(size, &stack); local
147 __asan::asan_free(p1, &stack, __asan::FROM_MALLOC);
148 if (p1 == p) break;
/external/compiler-rt/test/profile/
H A Dinstrprof-value-prof.c73 int cmpaddr(const void *p1, const void *p2) { argument
74 CallerInfo *addr1 = (CallerInfo *)p1;
/external/dtc/tests/
H A Ddtbs_equal_unordered.c57 static int mem_rsv_cmp(const void *p1, const void *p2) argument
59 const struct fdt_reserve_entry *re1 = p1;
/external/eigen/Eigen/src/Geometry/
H A DParametrizedLine.h64 /** Constructs a parametrized line going from \a p0 to \a p1. */
65 EIGEN_DEVICE_FUNC static inline ParametrizedLine Through(const VectorType& p0, const VectorType& p1) argument
66 { return ParametrizedLine(p0, (p1-p0).normalized()); }
/external/eigen/test/
H A Dgeo_alignedbox.cpp35 VectorType p1 = VectorType::Random(dim); local
36 while( p1 == p0 ){
37 p1 = VectorType::Random(dim); }
46 kill_extra_precision(p1);
49 b0.extend(p1);
50 VERIFY(b0.contains(p0*s1+(Scalar(1)-s1)*p1));
52 VERIFY_IS_APPROX(b0.center(),(p0+p1)/Scalar(2));
96 VectorType p1 = VectorType::Random(dim); local
101 b0.extend(p1);
H A Dgeo_parametrizedline.cpp30 VectorType p1 = VectorType::Random(dim); local
41 VERIFY_IS_APPROX( (l0.projection(p1)-p1).norm(), l0.distance(p1) );
42 VERIFY_IS_MUCH_SMALLER_THAN( l0.distance(l0.projection(p1)), RealScalar(1) );
74 Line4a *p1 = ::new(reinterpret_cast<void*>(array1)) Line4a; local
78 p1->origin().setRandom();
79 p1->direction().setRandom();
80 *p2 = *p1;
81 *p3 = *p1;
[all...]
/external/elfutils/libdw/
H A Ddwarf_getaranges.c49 struct arangelist *const *p1 = a, *const *p2 = b; local
50 struct arangelist *l1 = *p1, *l2 = *p2;
/external/fio/oslib/
H A Dlibmtd_legacy.c110 char *p, *p1; local
130 p1 = memchr(p, '\"', pi->data_size - pos);
131 if (!p1)
133 pos = p1 - pi->buf;
137 len = p1 - p;
144 if (p1[1] != '\n')
146 pi->next = p1 + 2;
/external/freetype/src/base/
H A Dftbbox.c236 /* p1 :: The start coordinate. */
343 BBox_Cubic_Check( FT_Pos p1, argument
356 *max += cubic_peak( p1 - *max, p2 - *max, p3 - *max, p4 - *max );
360 *min -= cubic_peak( *min - p1, *min - p2, *min - p3, *min - p4 );
/external/google-breakpad/src/common/
H A Dscoped_ptr.h164 void swap(scoped_ptr<C>& p1, scoped_ptr<C>& p2) { argument
165 p1.swap(p2);
169 bool operator==(C* p1, const scoped_ptr<C>& p2) { argument
170 return p1 == p2.get();
174 bool operator!=(C* p1, const scoped_ptr<C>& p2) { argument
175 return p1 != p2.get();
269 void swap(scoped_array<C>& p1, scoped_array<C>& p2) { argument
270 p1.swap(p2);
274 bool operator==(C* p1, const scoped_array<C>& p2) { argument
275 return p1
279 operator !=(C* p1, const scoped_array<C>& p2) argument
[all...]
/external/google-breakpad/src/testing/test/
H A Dgmock-internal-utils_test.cc635 const int* const p1 = a1; local
637 ConstReference(make_tuple(p1, 3));
/external/iproute2/ip/
H A Dip6tunnel.c310 * @p1: user specified parameter
313 static int ip6_tnl_parm_match(const struct ip6_tnl_parm2 *p1, argument
316 return ((!p1->link || p1->link == p2->link) &&
317 (!p1->name[0] || strcmp(p1->name, p2->name) == 0) &&
318 (IN6_IS_ADDR_UNSPECIFIED(&p1->laddr) ||
319 IN6_ARE_ADDR_EQUAL(&p1->laddr, &p2->laddr)) &&
320 (IN6_IS_ADDR_UNSPECIFIED(&p1->raddr) ||
321 IN6_ARE_ADDR_EQUAL(&p1
353 struct ip6_tnl_parm2 p1 = {}; local
[all...]
/external/jemalloc/test/unit/
H A Djunk.c182 void *p1, *p2; local
184 p1 = mallocx(large_maxclass, 0);
185 assert_ptr_not_null(p1, "Unexpected mallocx() failure");
190 p2 = rallocx(p1, shrink_size(large_maxclass), 0);
191 assert_ptr_eq(p1, p2, "Unexpected move during shrink");
195 assert_ptr_eq(most_recently_trimmed, p1,
/external/libcxx/src/
H A Dmemory.cpp223 char* p1 = static_cast<char*>(ptr); local
224 char* p2 = reinterpret_cast<char*>(reinterpret_cast<size_t>(p1 + (alignment - 1)) & -alignment);
225 size_t d = static_cast<size_t>(p2 - p1);
/external/libcxx/test/std/strings/basic.string/string.cons/
H A Dcopy_alloc.pass.cpp113 const char * p1 = "This is my first string"; local
118 S s1(p1, A(&imp1));
121 assert(s1 == p1);
126 assert(s1 == p1);
/external/libese/libapdu/include/apdu/
H A Dapdu.h35 CommandApdu(uint8_t cla, uint8_t ins, uint8_t p1, uint8_t p2) argument
36 : CommandApdu(cla, ins, p1, p2, 0, 0) {}
37 CommandApdu(uint8_t cla, uint8_t ins, uint8_t p1, uint8_t p2, size_t lc, size_t le);
/external/libpng/arm/
H A Dfilter_neon_intrinsics.c251 uint16x8_t p1, pa, pb, pc; local
253 p1 = vaddl_u8(a, b); /* a + b */
257 pc = vabdq_u16(p1, pc); /* pc */
259 p1 = vcleq_u16(pa, pb); /* pa <= pb */
263 p1 = vandq_u16(p1, pa); /* pa <= pb && pa <= pc */
266 e = vmovn_u16(p1);
/external/libvpx/libvpx/vpx_dsp/mips/
H A Dconvolve2_avg_dspr2.c31 uint32_t p1, p2; local
63 "preceu.ph.qbr %[p1], %[load2] \n\t"
64 "precrq.ph.w %[p2], %[p1], %[scratch1] \n\t" /* pixel 2 */
65 "append %[p1], %[scratch1], 16 \n\t" /* pixel 1 */
67 "dpa.w.ph $ac0, %[p1], %[filter45] \n\t"
71 "preceu.ph.qbl %[p1], %[load2] \n\t"
72 "precrq.ph.w %[p2], %[p1], %[scratch1] \n\t" /* pixel 2 */
73 "append %[p1], %[scratch1], 16 \n\t" /* pixel 1 */
75 "dpa.w.ph $ac2, %[p1], %[filter45] \n\t"
105 : [load1] "=&r"(load1), [load2] "=&r"(load2), [p1] "
130 uint32_t p1, p2; local
[all...]
H A Dconvolve2_vert_dspr2.c31 uint32_t p1, p2; local
63 "preceu.ph.qbr %[p1], %[load2] \n\t"
65 "precrq.ph.w %[p2], %[p1], %[scratch1] \n\t" /* pixel 2 */
66 "append %[p1], %[scratch1], 16 \n\t" /* pixel 1 */
68 "dpa.w.ph $ac0, %[p1], %[filter45] \n\t"
72 "preceu.ph.qbl %[p1], %[load2] \n\t"
74 "precrq.ph.w %[p2], %[p1], %[scratch1] \n\t" /* pixel 2 */
75 "append %[p1], %[scratch1], 16 \n\t" /* pixel 1 */
77 "dpa.w.ph $ac2, %[p1], %[filter45] \n\t"
98 : [load1] "=&r"(load1), [load2] "=&r"(load2), [p1] "
121 uint32_t p1, p2; local
[all...]
H A Dconvolve8_vert_dspr2.c31 uint32_t p1, p2; local
72 "preceu.ph.qbr %[p1], %[load2] \n\t"
73 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
74 "append %[p1], %[scratch1], 16 \n\t" /* pixel 1 */
80 "dpa.w.ph $ac0, %[p1], %[vector1b] \n\t"
86 "preceu.ph.qbl %[p1], %[load2] \n\t"
87 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
88 "append %[p1], %[scratch1], 16 \n\t" /* pixel 1 */
94 "dpa.w.ph $ac2, %[p1], %[vector1b] \n\t"
109 "preceu.ph.qbr %[p1],
179 uint32_t p1, p2; local
[all...]
H A Dloopfilter_masks_dspr2.h28 uint32_t p1, uint32_t p0, uint32_t p3,
46 /* mask |= (abs(p2 - p1) > limit) */
47 "subu_s.qb %[c], %[p2], %[p1] \n\t"
48 "subu_s.qb %[r_k], %[p1], %[p2] \n\t"
53 /* mask |= (abs(p1 - p0) > limit)
54 * hev |= (abs(p1 - p0) > thresh)
56 "subu_s.qb %[c], %[p1], %[p0] \n\t"
57 "subu_s.qb %[r_k], %[p0], %[p1] \n\t"
91 : [limit] "r"(limit), [p3] "r"(p3), [p2] "r"(p2), [p1] "r"(p1),
27 filter_hev_mask_dspr2(uint32_t limit, uint32_t flimit, uint32_t p1, uint32_t p0, uint32_t p3, uint32_t p2, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t thresh, uint32_t *hev, uint32_t *mask) argument
128 filter_hev_mask_flatmask4_dspr2( uint32_t limit, uint32_t flimit, uint32_t thresh, uint32_t p1, uint32_t p0, uint32_t p3, uint32_t p2, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t *hev, uint32_t *mask, uint32_t *flat) argument
269 flatmask5(uint32_t p4, uint32_t p3, uint32_t p2, uint32_t p1, uint32_t p0, uint32_t q0, uint32_t q1, uint32_t q2, uint32_t q3, uint32_t q4, uint32_t *flat2) argument
[all...]

Completed in 806 milliseconds

1234567891011>>