/external/clang/test/Analysis/ |
H A D | Malloc+MismatchedDeallocator_intersections.cpp | 25 int *p4 = new int; local 26 delete p4; 27 int j = *p4; // no-warning
|
H A D | NewDelete+MismatchedDeallocator_intersections.cpp | 26 int *p4 = (int *)malloc(sizeof(int)); local 27 free(p4); 28 int j = *p4; // no warn
|
H A D | NewDelete-variadic.cpp | 22 int *p4 = new (x) int[0]; // no warn local
|
/external/compiler-rt/test/tsan/ |
H A D | aligned_vs_unaligned_race.cc | 19 u_uint64_t *p4 = reinterpret_cast<u_uint64_t *>(p1 + 1); local 20 (*p4).val++;
|
/external/apache-harmony/support/src/test/java/tests/support/ |
H A D | Support_TimeZone.java | 74 public int getOffset(int p1, int p2, int p3, int p4, int p5, int p6) { argument
|
/external/clang/test/SemaCXX/ |
H A D | cxx11-ast-print.cpp | 27 // CHECK: const char *p4 = 297_bar; 28 const char *p4 = 0x129_bar; variable
|
H A D | trailing-return-0x.cpp | 73 only<double> p4 = xx.get_nested<double>().h(0L, 1.0, 3.14f); variable
|
/external/llvm/unittests/ADT/ |
H A D | MakeUniqueTest.cpp | 34 auto p4 = make_unique<std::tuple<int, int, int, int>>(0, 1, 2, 3); local 35 EXPECT_TRUE((bool)p4); 36 EXPECT_EQ(std::make_tuple(0, 1, 2, 3), *p4);
|
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_perf.c | 49 float p1, p2, p3, p4, p5, p6; local 93 p4 = 100.0 * (float) lp_count.nr_non_empty_4 / (float) total_4; 99 debug_printf("llvmpipe: nr_non_empty_4x4: %9u (%3.0f%% of %u)\n", lp_count.nr_non_empty_4, p4, total_4);
|
/external/v8/test/mjsunit/es6/debug-promises/ |
H A D | events.js | 64 var p4 = p3.then(); // event variable 98 assertAsync(result[4].promise === p4, "result[4].promise");
|
/external/webrtc/src/system_wrappers/interface/ |
H A D | ref_count.h | 58 RefCountImpl(P1 p1, P2 p2, P3 p3, P4 p4) : T(p1, p2, p3, p4), ref_count_(0) {} argument 61 RefCountImpl(P1 p1, P2 p2, P3 p3, P4 p4, P5 p5) argument 62 : T(p1, p2, p3, p4, p5), ref_count_(0) {}
|
/external/valgrind/memcheck/tests/ |
H A D | leak-cases.c | 11 // p4 AAA ---> BBB DL / I IL / L 61 Node* p4; variable
|
/external/ceres-solver/include/ceres/internal/ |
H A D | manual_constructor.h | 139 inline void Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4) { argument 140 new(space()) Type(p1, p2, p3, p4); 144 inline void Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, argument 146 new(space()) Type(p1, p2, p3, p4, p5); 151 inline void Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, argument 153 new(space()) Type(p1, p2, p3, p4, p5, p6); 158 inline void Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, argument 160 new(space()) Type(p1, p2, p3, p4, p5, p6, p7); 165 inline void Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, argument 167 new(space()) Type(p1, p2, p3, p4, p 172 Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, const T5& p5, const T6& p6, const T7& p7, const T8& p8, const T9& p9) argument 180 Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, const T5& p5, const T6& p6, const T7& p7, const T8& p8, const T9& p9, const T10& p10) argument 189 Init(const T1& p1, const T2& p2, const T3& p3, const T4& p4, const T5& p5, const T6& p6, const T7& p7, const T8& p8, const T9& p9, const T10& p10, const T11& p11) argument [all...] |
/external/clang/test/CodeGen/ |
H A D | ppc64-struct-onefloat.c | 32 SSf p4 = { { 22.63f } }; local 34 bar(p1, p2, p4, p5); 42 // CHECK: %{{[a-zA-Z0-9.]+}} = getelementptr %struct.s4, %struct.s4* %p4, i32 0, i32 0
|
/external/skia/experimental/StrokePathRenderer/ |
H A D | GrStrokePathRenderer.cpp | 25 const SkPoint& p3, const SkPoint& p4, 29 SkScalar x1 = p1.x(), x2 = p2.x(), x3 = p3.x(), x4 = p4.x(); 30 SkScalar y1 = p1.y(), y2 = p2.y(), y3 = p3.y(), y4 = p4.y(); 24 intersection(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3, const SkPoint& p4, SkPoint& res) argument
|
/external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.type/dcl.type.simple/ |
H A D | p5-cxx0x.cpp | 107 decltype(consume(make<3, false>())) *p4; // expected-note {{here}} member in namespace:RequireCompleteType
|
/external/clang/test/CXX/lex/lex.charset/ |
H A D | p2-cxx11.cpp | 37 const char16_t *p4 = u"\u0000\u0012\u004e\u007f\u0080\u009f\u00a0\ud799\ue000"; variable
|
/external/clang/test/Headers/ |
H A D | stddefneeds.cpp | 39 ptrdiff_t p4; variable
|
/external/freetype/src/base/ |
H A D | ftbbox.c | 242 /* p4 :: The end coordinate. */ 346 FT_Pos p4, 356 *max += cubic_peak( p1 - *max, p2 - *max, p3 - *max, p4 - *max ); 360 *min -= cubic_peak( *min - p1, *min - p2, *min - p3, *min - p4 ); 343 BBox_Cubic_Check( FT_Pos p1, FT_Pos p2, FT_Pos p3, FT_Pos p4, FT_Pos* min, FT_Pos* max ) argument
|
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_loopfilter_masks_dspr2.h | 282 static INLINE void vp9_flatmask5(uint32_t p4, uint32_t p3, argument 294 /* flat |= (abs(p4 - p0) > thresh) */ 295 "subu_s.qb %[c], %[p4], %[p0] \n\t" 296 "subu_s.qb %[r_k], %[p0], %[p4] \n\t" 360 : [p4] "r" (p4), [p3] "r" (p3), [p2] "r" (p2),
|
/external/pdfium/third_party/freetype/src/base/ |
H A D | ftbbox.c | 242 /* p4 :: The end coordinate. */ 343 FT_Pos p4, 353 *max += cubic_peak( p1 - *max, p2 - *max, p3 - *max, p4 - *max ); 357 *min -= cubic_peak( *min - p1, *min - p2, *min - p3, *min - p4 ); 340 BBox_Cubic_Check( FT_Pos p1, FT_Pos p2, FT_Pos p3, FT_Pos p4, FT_Pos* min, FT_Pos* max ) argument
|
/external/skia/gm/ |
H A D | polygons.cpp | 43 SkPoint p4[32]; // circle-like polygons with 32-edges. variable 50 for (size_t i = 0; i < SK_ARRAY_COUNT(p4); ++i) { 51 SkScalar angle = 2 * SK_ScalarPI * i / SK_ARRAY_COUNT(p4); 52 p4[i].set(20 * SkScalarCos(angle) + 20, 20 * SkScalarSin(angle) + 20); 63 { p4, SK_ARRAY_COUNT(p4) },
|
/external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.type/dcl.spec.auto/ |
H A D | p6.cpp | 71 auto p4 = &S::g; // expected-error {{incompatible initializer of type '<overloaded function type>'}} local
|
/external/guava/guava/src/com/google/common/cache/ |
H A D | Striped64.java | 97 volatile long p0, p1, p2, p3, p4, p5, p6; field in class:Striped64.Cell
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | Row.java | 32 public static <C0, C1, C2, C3, C4> R5<C0,C1,C2,C3,C4> of(C0 p0, C1 p1, C2 p2, C3 p3, C4 p4) { argument 33 return new R5<C0,C1,C2,C3,C4>(p0,p1,p2,p3,p4);
|