/third_party/protobuf/src/google/protobuf/stubs/ |
H A D | callback.h | 279 template<typename R, typename P1> 282 typedef R (*FunctionType)(P1); 285 P1 p1) in FunctionResultCallback_1_0() 299 P1 p1_; 323 template<typename R, typename P1, typename A1> 326 typedef R (*FunctionType)(P1, A1); 329 P1 p1) in FunctionResultCallback_1_1() 343 P1 p1_; 375 template <typename R, typename T, typename P1, typename P2, typename P3, 379 typedef R (T::*MethodType)(P1, P [all...] |
/third_party/protobuf/ruby/ext/google/protobuf_c/ |
H A D | upb.h | 4447 template <class R, class P1, R F(P1), class I> 4451 static R Call(P1 p1) { return F(p1); } in Call() 4454 template <class R, class P1, class P2, R F(P1, P2), class I> 4458 static R Call(P1 p1, P2 p2) { return F(p1, p2); } in Call() 4461 template <class R, class P1, class P2, class P3, R F(P1, P2, P3), class I> 4465 static R Call(P1 p1, P2 p2, P3 p3) { return F(p1, p2, p3); } in Call() 4468 template <class R, class P1, clas [all...] |
/third_party/jerryscript/tests/jerry/ |
H A D | function-prototype-bind.js | 60 var P1 = P.bind({}, 2); 61 var _p1 = new P1(); 65 assert (_p1 instanceof P1); 67 var P2 = P1.bind(null); 80 assert (_p2 instanceof P1); 88 assert (_p3 instanceof P1);
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
H A D | CostAllocator.h | 81 static bool isEqual(PoolEntry *P1, PoolEntry *P2) { in isEqual() argument 82 if (P1 == getEmptyKey() || P1 == getTombstoneKey()) in isEqual() 83 return P1 == P2; in isEqual() 84 return isEqual(P1->getValue(), P2); in isEqual()
|
/third_party/typescript/tests/baselines/reference/ |
H A D | crashIntypeCheckInvocationExpression.js | 3 function doCompile<P0, P1, P2>(fileset: P0, moduleType: P1) { 7 export var compileServer = task<number, number, any>(<P0, P1, P2>() => {
|
H A D | conditionalTypeAssignabilityWhenDeferred.js | 102 type InferBecauseWhyNot<T> = [T] extends [(p: infer P1) => any] 103 ? P1 | T 110 type InferBecauseWhyNotDistributive<T> = T extends (p: infer P1) => any 111 ? P1 | T
|
H A D | varianceRepeatedlyPropegatesWithUnreliableFlag.js | 5 type P1<T> = { data: X<T> }; 9 fn<K extends keyof T>(p1: P1<Pick<T, K>>, p2: P2<Pick<T, K>>): void;
|
H A D | templateLiteralTypes1.js | 133 declare function getProp<T, P0 extends keyof T & string, P1 extends keyof T[P0] & string, P2 extends keyof T[P0][P1] & string>(obj: T, path: `${P0}.${P1}.${P2}`): T[P0][P1][P2]; 134 declare function getProp<T, P0 extends keyof T & string, P1 extends keyof T[P0] & string>(obj: T, path: `${P0}.${P1}`): T[P0][P1];
|
/third_party/backends/sanei/ |
H A D | sanei_ir.c | 158 double *P1 = NULL; /* cumulative normalized histogram */ in sanei_ir_threshold_yen() local 167 P1 = sanei_ir_accumulate_norm_histo (norm_histo); in sanei_ir_threshold_yen() 170 if (!P1 || !P1_sq || !P2_sq) in sanei_ir_threshold_yen() 191 2 * SAFE_LOG (P1[i] * (1.0 - P1[i])); in sanei_ir_threshold_yen() 218 if (P1) in sanei_ir_threshold_yen() 219 free (P1); in sanei_ir_threshold_yen() 323 double *P1; /* cumulative normalized histogram */ in sanei_ir_threshold_maxentropy() local 330 P1 = sanei_ir_accumulate_norm_histo (norm_histo); in sanei_ir_threshold_maxentropy() 332 if (!P1 || !P in sanei_ir_threshold_maxentropy() [all...] |
/third_party/skia/third_party/externals/swiftshader/src/Device/ |
H A D | Renderer.cpp | 860 const float4 &P1 = v1.position; in setupLine() local 862 if(P0.w <= 0 && P1.w <= 0) in setupLine() 872 float dx = W * (P1.x / P1.w - P0.x / P0.w); in setupLine() 873 float dy = H * (P1.y / P1.w - P0.y / P0.w); in setupLine() 888 P[1] = P1; in setupLine() 889 P[2] = P1; in setupLine() 900 float dx1h = dx * P1.w / H; in setupLine() 901 float dy1w = dy * P1 in setupLine() [all...] |
H A D | Polygon.hpp | 24 Polygon(const float4 *P0, const float4 *P1, const float4 *P2) in Polygon() 27 P[0][1] = P1; in Polygon()
|
/third_party/skia/third_party/externals/libwebp/src/dsp/ |
H A D | lossless_enc_mips32.c | 295 // P2 = P0 + P1 301 #define ADD_TO_OUT(A, B, C, D, E, P0, P1, P2) \ 306 "ulw %[temp4], " #A "(%[" #P1 "]) \n\t" \ 307 "ulw %[temp5], " #B "(%[" #P1 "]) \n\t" \ 308 "ulw %[temp6], " #C "(%[" #P1 "]) \n\t" \ 309 "ulw %[temp7], " #D "(%[" #P1 "]) \n\t" \ 316 "addiu %[" #P1 "], %[" #P1 "], 16 \n\t" \
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
H A D | CmpInstAnalysis.cpp | 60 bool llvm::predicatesFoldable(ICmpInst::Predicate P1, ICmpInst::Predicate P2) { in predicatesFoldable() argument 61 return (CmpInst::isSigned(P1) == CmpInst::isSigned(P2)) || in predicatesFoldable() 62 (CmpInst::isSigned(P1) && ICmpInst::isEquality(P2)) || in predicatesFoldable() 63 (CmpInst::isSigned(P2) && ICmpInst::isEquality(P1)); in predicatesFoldable()
|
/third_party/ffmpeg/libavcodec/ |
H A D | cavsdsp.c | 39 #define P1 p0_p[-2*stride] macro 50 if(abs(p0-q0)<alpha && abs(P1-p0)<beta && abs(Q1-q0)<beta) { in loop_filter_l2() 54 P0 = (P1 + p0 + s) >> 2; in loop_filter_l2() 55 P1 = (2*P1 + s) >> 2; in loop_filter_l2() 57 P0 = (2*P1 + s) >> 2; in loop_filter_l2() 71 if(abs(p0-q0)<alpha && abs(P1-p0)<beta && abs(Q1-q0)<beta) { in loop_filter_l1() 72 int delta = av_clip(((q0-p0)*3+P1-Q1+4)>>3,-tc, tc); in loop_filter_l1() 76 delta = av_clip(((P0-P1)*3+P2-Q0+4)>>3, -tc, tc); in loop_filter_l1() 77 P1 in loop_filter_l1() 116 #undef P1 global() macro [all...] |
/third_party/node/deps/brotli/c/common/ |
H A D | context.h | 111 #define BROTLI_CONTEXT(P1, P2, LUT) ((LUT)[P1] | ((LUT) + 256)[P2])
|
/third_party/skia/third_party/externals/brotli/c/common/ |
H A D | context.h | 111 #define BROTLI_CONTEXT(P1, P2, LUT) ((LUT)[P1] | ((LUT) + 256)[P2])
|
/third_party/ffmpeg/libavcodec/x86/ |
H A D | vp9lpf.asm | 324 %define P1 dstq + 2* strideq + %1 339 %define P1 rsp + 2*mmsize + %1 421 movx m6, [P1] 461 mova [P1], m6 475 TRANSPOSE8x8B 0, 1, 2, 3, 4, 5, 6, 7, [P1], u, [rsp+%3+%4], [rsp+64], [rsp+80] 480 movh [P1], m3 504 movh [P1], m3 538 mova [P1], m4 548 mova m6, [P1] 554 mova [P1], m [all...] |
/third_party/skia/third_party/externals/swiftshader/src/Renderer/ |
H A D | Polygon.hpp | 24 Polygon(const float4 *P0, const float4 *P1, const float4 *P2) in Polygon() 27 P[0][1] = P1; in Polygon()
|
/third_party/jerryscript/jerry-libm/ |
H A D | exp.c | 50 * R(z) ~ 2.0 + P1*z + P2*z**2 + P3*z**3 + P4*z**4 + P5*z**5 51 * (where z=r*r, and the values of P1 to P5 are listed below) 54 * | 2.0+P1*z+...+P5*z - R(z) | <= 2 65 * R1(r) = r - (P1*r + P2*r + ... + P5*r ). 114 #define P1 1.66666666666666019037e-01 /* 0x3FC55555, 0x5555553E */ macro 189 c = x - t * (P1 + t * (P2 + t * (P3 + t * (P4 + t * P5)))); in exp() 216 #undef P1 macro
|
/third_party/skia/src/core/ |
H A D | SkGeometry.h | 400 Sk2s P1 = from_point(src[1]); in SkQuadCoeff() local 402 fB = times_2(P1 - fC); in SkQuadCoeff() 403 fA = P2 - times_2(P1) + fC; in SkQuadCoeff() 451 Sk2s P1 = from_point(src[1]); in SkCubicCoeff() local 455 fA = P3 + three * (P1 - P2) - P0; in SkCubicCoeff() 456 fB = three * (P2 - times_2(P1) + P0); in SkCubicCoeff() 457 fC = three * (P1 - P0); in SkCubicCoeff()
|
/third_party/ltp/testcases/kernel/containers/utsname/ |
H A D | utstest.c | 21 P1: A=gethostname 26 P1: sethostname(A); 31 P1: A=gethostname; unshare(utsname); sethostname(newname); C=gethostname 36 P1: A=gethostname; unshare(utsname); (wait); C=gethostname 41 P1: drop_privs(); unshare(utsname); (wait); C=gethostname 116 int P1(void *vtest) in P1() function 258 tst_resm(TPASS, "P2: P1 claims error"); in P2() 323 r = do_clone_unshare_tests(T_NONE, 0, P1, vtest, P2, vtest); in main() 328 P1, vtest, P2, vtest); in main() 341 P1, vtes in main() [all...] |
/third_party/vk-gl-cts/framework/delibs/decpp/ |
H A D | deUniquePtr.hpp | 177 template<typename T, typename P0, typename P1> 178 inline MovePtr<T> newMovePtr (P0 p0, P1 p1) { return MovePtr<T>(new T(p0, p1)); } in newMovePtr() 179 template<typename T, typename P0, typename P1, typename P2> 180 inline MovePtr<T> newMovePtr (P0 p0, P1 p1, P2 p2) { return MovePtr<T>(new T(p0, p1, p2)); } in newMovePtr()
|
/third_party/lame/misc/ |
H A D | abx.c | 1018 float P1 [MAX] [2]; in cross_analyze() local 1069 P1 [i][0] = tmp1; in cross_analyze() 1071 P1 [i][1] = 0.; in cross_analyze() 1075 fft (P1, MAX); in cross_analyze() 1079 double a0 = P1 [i][0]; in cross_analyze() 1080 double a1 = P1 [i][1]; in cross_analyze() 1083 P1 [i][0] = a0*b0 - a1*b1; in cross_analyze() 1084 P1 [i][1] = a0*b1 + a1*b0; in cross_analyze() 1087 fft (P1, MAX); in cross_analyze() 1089 max = P1 [maxinde in cross_analyze() [all...] |
/third_party/musl/src/math/ |
H A D | cbrt.c | 28 P1 = -1.88497979543377169875, /* 0xbffe28e0, 0x92f02420 */ variable 80 t = t*((P0+r*(P1+r*P2))+((r*r)*r)*(P3+r*P4)); in cbrt()
|
/third_party/musl/porting/liteos_a/kernel/src/math/ |
H A D | cbrt.c | 28 P1 = -1.88497979543377169875, /* 0xbffe28e0, 0x92f02420 */ variable 80 t = t*((P0+r*(P1+r*P2))+((r*r)*r)*(P3+r*P4)); in cbrt()
|