Searched defs:p1 (Results 326 - 350 of 671) sorted by relevance

<<11121314151617181920>>

/external/libvpx/libvpx/vpx_dsp/mips/
H A Dloopfilter_4_msa.c20 v16u8 p3, p2, p1, p0, q3, q2, q1, q0, p1_out, p0_out, q0_out, q1_out; local
23 LD_UB8((src - 4 * pitch), pitch, p3, p2, p1, p0, q0, q1, q2, q3);
29 LPF_MASK_HEV(p3, p2, p1, p0, q0, q1, q2, q3, limit, b_limit, thresh, hev,
31 VP9_LPF_FILTER4_4W(p1, p0, q0, q1, mask, hev, p1_out, p0_out, q0_out, q1_out);
48 v16u8 p3, p2, p1, p0, q3, q2, q1, q0; local
51 LD_UB8((src - 4 * pitch), pitch, p3, p2, p1, p0, q0, q1, q2, q3);
65 LPF_MASK_HEV(p3, p2, p1, p0, q0, q1, q2, q3, limit0, b_limit0, thresh0, hev,
67 VP9_LPF_FILTER4_4W(p1, p0, q0, q1, mask, hev, p1, p0, q0, q1);
69 ST_UB4(p1, p
77 v16u8 p3, p2, p1, p0, q3, q2, q1, q0; local
109 v16u8 p3, p2, p1, p0, q3, q2, q1, q0; local
[all...]
/external/libxaac/decoder/
H A Dixheaacd_esbr_fft.c1061 FLOAT32 p1, p2, p3, p4; local
1075 p1 = add_r / 2.0f;
1080 temp = inp[0] - p1;
H A Dixheaacd_fft.c1581 WORD32 p1, p2, p3, p4; local
1595 p1 = add_r >> 1;
1600 temp = ixheaacd_sub32(inp[0], p1);
/external/ltp/utils/benchmark/ebizzy-0.3/
H A Debizzy.c340 static int compare(const void *p1, const void *p2) argument
342 return (*(record_t *) p1 - *(record_t *) p2);
/external/mesa3d/src/compiler/glsl/
H A Dlower_blend_equation_advanced.cpp397 * p1(As,Ad) = As*(1-Ad)
401 ir_variable *p1 = f.make_temp(glsl_type::float_type, "__blend_p1"); local
405 f.emit(assign(p1, mul(src_alpha, sub(imm1(1), dst_alpha))));
408 /* R = f(Rs',Rd')*p0(As,Ad) + Y*Rs'*p1(As,Ad) + Z*Rd'*p2(As,Ad)
409 * G = f(Gs',Gd')*p0(As,Ad) + Y*Gs'*p1(As,Ad) + Z*Gd'*p2(As,Ad)
410 * B = f(Bs',Bd')*p0(As,Ad) + Y*Bs'*p1(As,Ad) + Z*Bd'*p2(As,Ad)
411 * A = X*p0(As,Ad) + Y*p1(As,Ad) + Z*p2(As,Ad)
416 * RGB = factor * p0 + Cs * p1 + Cd * p2
417 * A = p0 + p1 + p2
420 add(add(mul(factor, p0), mul(src_rgb, p1)), mu
[all...]
/external/mksh/src/
H A Dos2.c110 char *p1; local
113 for (p1 = p - 1; p1 >= l &&
114 *p1 == '\\'; p1--)
/external/pdfium/third_party/lcms/src/
H A Dcmscam02.c247 cmsFloat64Number t, e, p1, p2, p3, p4, p5, hr, d2r; local
260 p1 = e / t;
267 p4 = p1 / sin(hr);
275 p5 = p1 / cos(hr);
/external/protobuf/src/google/protobuf/stubs/
H A Dcallback.h282 P1 p1)
283 : function_(function), self_deleting_(self_deleting), p1_(p1) {}
326 P1 p1)
327 : function_(function), self_deleting_(self_deleting), p1_(p1) {}
355 P1 p1, P2 p2, P3 p3, P4 p4, P5 p5)
359 p1_(p1),
481 inline ResultCallback<R>* NewCallback(R (*function)(P1), P1 p1) { argument
483 function, true, p1);
489 R (*function)(P1), P1 p1) {
491 function, false, p1);
281 FunctionResultCallback_1_0(FunctionType function, bool self_deleting, P1 p1) argument
325 FunctionResultCallback_1_1(FunctionType function, bool self_deleting, P1 p1) argument
354 MethodResultCallback_5_2(T* object, MethodType method, bool self_deleting, P1 p1, P2 p2, P3 p3, P4 p4, P5 p5) argument
488 NewPermanentCallback( R (function)P1), P1 p1) argument
508 NewCallback(R (function)P1, A1), P1 p1) argument
515 NewPermanentCallback( R (function)P1, A1), P1 p1) argument
524 NewPermanentCallback( T* object, R (T::*function)(P1, P2, P3, P4, P5, A1, A2), typename internal::InternalConstRef<P1>::type p1, typename internal::InternalConstRef<P2>::type p2, typename internal::InternalConstRef<P3>::type p3, typename internal::InternalConstRef<P4>::type p4, typename internal::InternalConstRef<P5>::type p5) argument
[all...]
/external/selinux/libsepol/cil/src/
H A Dcil_find.c154 struct cil_perm *p1 = i1->data; local
157 if (&p1->datum == &p2->datum) return CIL_TRUE;
/external/skia/src/core/
H A DSkEdgeClipper.cpp46 bool SkEdgeClipper::clipLine(SkPoint p0, SkPoint p1, const SkRect& clip) { argument
51 const SkPoint pts[] = { p0, p1 };
449 void SkEdgeClipper::appendLine(SkPoint p0, SkPoint p1) { argument
452 fCurrPoint[1] = p1;
/external/skia/src/gpu/ccpr/
H A DGrCCCoverageProcessor.h267 inline void GrCCCoverageProcessor::TriPointInstance::set(const SkPoint& p0, const SkPoint& p1, argument
270 Sk2f P1 = Sk2f::Load(&p1) + trans;
282 inline void GrCCCoverageProcessor::QuadPointInstance::set(const SkPoint& p0, const SkPoint& p1, argument
286 Sk2f P1 = Sk2f::Load(&p1) + trans;
/external/skia/src/gpu/ops/
H A DGrAAConvexTessellator.cpp36 const SkPoint& p1, const SkPoint& n1,
38 const SkPoint v = p1 - p0;
51 const SkPoint& p1, const SkPoint& perp) {
52 const SkPoint v = p1 - p0;
57 static bool duplicate_pt(const SkPoint& p0, const SkPoint& p1) { argument
58 SkScalar distSq = SkPointPriv::DistanceToSqd(p0, p1);
1012 static void draw_line(SkCanvas* canvas, const SkPoint& p0, const SkPoint& p1, SkColor color) {
1016 canvas->drawLine(p0.fX, p0.fY, p1.fX, p1.fY, p);
35 intersect(const SkPoint& p0, const SkPoint& n0, const SkPoint& p1, const SkPoint& n1, SkScalar* t) argument
50 perp_intersect(const SkPoint& p0, const SkPoint& n0, const SkPoint& p1, const SkPoint& perp) argument
/external/skia/tests/
H A DGeometryTest.cpp44 SkDebugf("%s [%d %g] p0 [%10.8f %10.8f] p1 [%10.8f %10.8f]\n",
76 SkPoint p0, p1; local
78 p1 = conic.evalAt(t);
79 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
/external/skqp/src/core/
H A DSkEdgeClipper.cpp46 bool SkEdgeClipper::clipLine(SkPoint p0, SkPoint p1, const SkRect& clip) { argument
51 const SkPoint pts[] = { p0, p1 };
449 void SkEdgeClipper::appendLine(SkPoint p0, SkPoint p1) { argument
452 fCurrPoint[1] = p1;
/external/skqp/src/gpu/ccpr/
H A DGrCCCoverageProcessor.h257 inline void GrCCCoverageProcessor::TriangleInstance::set(const SkPoint& p0, const SkPoint& p1, argument
260 Sk2f P1 = Sk2f::Load(&p1) + trans;
/external/skqp/src/gpu/ops/
H A DGrAAConvexTessellator.cpp36 const SkPoint& p1, const SkPoint& n1,
38 const SkPoint v = p1 - p0;
51 const SkPoint& p1, const SkPoint& perp) {
52 const SkPoint v = p1 - p0;
57 static bool duplicate_pt(const SkPoint& p0, const SkPoint& p1) { argument
58 SkScalar distSq = SkPointPriv::DistanceToSqd(p0, p1);
1012 static void draw_line(SkCanvas* canvas, const SkPoint& p0, const SkPoint& p1, SkColor color) {
1016 canvas->drawLine(p0.fX, p0.fY, p1.fX, p1.fY, p);
35 intersect(const SkPoint& p0, const SkPoint& n0, const SkPoint& p1, const SkPoint& n1, SkScalar* t) argument
50 perp_intersect(const SkPoint& p0, const SkPoint& n0, const SkPoint& p1, const SkPoint& perp) argument
/external/skqp/tests/
H A DGeometryTest.cpp44 SkDebugf("%s [%d %g] p0 [%10.8f %10.8f] p1 [%10.8f %10.8f]\n",
76 SkPoint p0, p1; local
78 p1 = conic.evalAt(t);
79 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
/external/tcpdump/
H A Dsmbutil.c32 uint32_t p0, p1, p2, p3; local
35 p1 = ((date & 0xFF00) >> 8) & 0xFF;
40 tp->tm_min = ((p0 >> 5) & 0xFF) + ((p1 & 0x7) << 3);
41 tp->tm_hour = (p1 >> 3) & 0xFF;
/external/tensorflow/tensorflow/compiler/xla/
H A Dutil.cc185 std::vector<int64> ComposePermutations(tensorflow::gtl::ArraySlice<int64> p1, argument
187 CHECK_EQ(p1.size(), p2.size());
189 for (size_t i = 0; i < p1.size(); ++i) {
190 output.push_back(p1[p2[i]]);
/external/tensorflow/tensorflow/core/lib/gtl/
H A Dflatmap_test.cc245 auto p1 = map.begin(); local
246 expected.insert(*p1);
247 ++p1;
248 expected.insert(*p1);
249 ++p1;
251 EXPECT_EQ(map.erase(p1, p2), map.end());
424 auto p1 = map.equal_range(3); local
425 EXPECT_TRUE(p1.first != p1.second);
426 EXPECT_EQ(p1
443 auto p1 = map.equal_range(3); local
[all...]
H A Dflatset_test.cc190 auto p1 = set.begin(); local
191 expected.insert(*p1);
192 ++p1;
193 expected.insert(*p1);
194 ++p1;
196 EXPECT_EQ(set.erase(p1, p2), set.end());
345 auto p1 = set.equal_range(3); local
346 EXPECT_TRUE(p1.first != p1.second);
347 EXPECT_EQ(*p1
363 auto p1 = set.equal_range(3); local
[all...]
/external/webp/src/dsp/
H A Ddec_mips32.c31 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
32 const int a = 3 * (q0 - p0) + VP8ksclip1[p1 - q1];
41 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
46 p[-2 * step] = VP8kclip1[p1 + a3];
54 const int p2 = p[-3 * step], p1 = p[-2 * step], p0 = p[-step]; local
56 const int a = VP8ksclip1[3 * (q0 - p0) + VP8ksclip1[p1 - q1]];
62 p[-2 * step] = VP8kclip1[p1 + a2];
70 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
71 return (abs_mips32(p1 - p0) > thresh) || (abs_mips32(q1 - q0) > thresh);
75 const int p1 local
82 const int p1 = p[-2 * step], p0 = p[-step]; local
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DMathUtils.java1971 * @param p1 the first point
1975 public static double distance1(double[] p1, double[] p2) { argument
1977 for (int i = 0; i < p1.length; i++) {
1978 sum += FastMath.abs(p1[i] - p2[i]);
1986 * @param p1 the first point
1990 public static int distance1(int[] p1, int[] p2) { argument
1992 for (int i = 0; i < p1.length; i++) {
1993 sum += FastMath.abs(p1[i] - p2[i]);
2001 * @param p1 the first point
2005 public static double distance(double[] p1, doubl argument
2021 distance(int[] p1, int[] p2) argument
2037 distanceInf(double[] p1, double[] p2) argument
2052 distanceInf(int[] p1, int[] p2) argument
[all...]
/external/boringssl/src/crypto/fipsmodule/bn/
H A Dexponentiation.c1323 int BN_mod_exp2_mont(BIGNUM *rr, const BIGNUM *a1, const BIGNUM *p1, argument
1344 if (!BN_mod_exp_mont(rr, a1, p1, m, ctx, mont) ||
/external/brotli/c/enc/
H A Dcompress_fragment_two_pass.c58 static BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2) { argument
60 BROTLI_UNALIGNED_LOAD32(p1) == BROTLI_UNALIGNED_LOAD32(p2) &&
61 p1[4] == p2[4] &&
62 p1[5] == p2[5]);

Completed in 610 milliseconds

<<11121314151617181920>>