Searched refs:p1 (Results 251 - 275 of 1077) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/v8/test/mjsunit/es6/debug-promises/
H A Dreject-caught-by-default-reject-handler.js20 var p1 = p0.then(function() { variable
24 var p2 = p1.then(function() {
25 log.push("p1.then");
47 // p1 is rejected, uncaught except for its default reject handler.
49 assertSame(p1, event_data.promise());
51 // p2 is rejected by p1's default reject handler.
H A Dthrow-caught-by-default-reject-handler.js20 var p1 = p0.then(function() { variable
24 var p2 = p1.then(function() {
25 log.push("p1.then");
47 // p1 is rejected, uncaught except for its default reject handler.
50 assertSame(p1, event_data.promise());
52 // p2 is rejected by p1's default reject handler.
/external/clang/test/Analysis/inlining/
H A Dinline-defensive-checks.cpp70 void test(int *p1, int *p2) { argument
71 idc(p1);
72 Foo f(p1);
/external/libcxx/test/algorithms/alg.sorting/alg.min.max/
H A Dminmax.pass.cpp54 constexpr auto p1 = std::minmax (x, y); local
55 static_assert(p1.first == y, "");
56 static_assert(p1.second == x, "");
H A Dminmax_comp.pass.cpp57 constexpr auto p1 = std::minmax(x, y, std::greater<>()); local
58 static_assert(p1.first == x, "");
59 static_assert(p1.second == y, "");
/external/openssl/crypto/rc2/
H A Drc2_cbc.c139 register RC2_INT *p0,*p1; local
153 p0=p1= &(key->data[0]);
170 x0+=p1[x3&0x3f];
171 x1+=p1[x0&0x3f];
172 x2+=p1[x1&0x3f];
173 x3+=p1[x2&0x3f];
184 register RC2_INT *p0,*p1; local
199 p1= &(key->data[0]);
216 x3=(x3-p1[x2&0x3f])&0xffff;
217 x2=(x2-p1[x
[all...]
/external/skia/gm/
H A Dpoints.cpp45 SkPaint p0, p1, p2, p3; local
49 p1.setColor(SK_ColorGREEN);
61 canvas->drawPoints(SkCanvas::kLines_PointMode, n, pts, p1);
/external/skia/samplecode/
H A DSamplePoints.cpp51 SkPaint p0, p1, p2, p3; local
55 p1.setColor(SK_ColorGREEN);
67 canvas->drawPoints(SkCanvas::kLines_PointMode, n, pts, p1);
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dtcmalloc_unittest.cc1020 void* p1 = rnd.alloc(0); local
1021 CHECK(p1 != NULL);
1024 CHECK(p1 != p2);
1025 free(p1);
1049 void* p1 = malloc(10); local
1050 CHECK(p1 != NULL); // force use of this variable
1053 size_t actual_p1_size = tc_malloc_size(p1);
1056 free(p1);
1060 p1 = calloc(10, 2);
1061 CHECK(p1 !
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
H A Dtcmalloc_unittest.cc1020 void* p1 = rnd.alloc(0); local
1021 CHECK(p1 != NULL);
1024 CHECK(p1 != p2);
1025 free(p1);
1049 void* p1 = malloc(10); local
1050 CHECK(p1 != NULL); // force use of this variable
1053 size_t actual_p1_size = tc_malloc_size(p1);
1056 free(p1);
1060 p1 = calloc(10, 2);
1061 CHECK(p1 !
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
H A Dvp9_loopfilter_filters.c23 uint8_t p1, uint8_t p0,
28 mask |= (abs(p2 - p1) > limit) * -1;
29 mask |= (abs(p1 - p0) > limit) * -1;
33 mask |= (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 > blimit) * -1;
39 uint8_t p1, uint8_t p0,
43 mask |= (abs(p1 - p0) > thresh) * -1;
54 uint8_t p2, uint8_t p1,
58 int8_t mask = ~flat_mask4(thresh, p3, p2, p1, p0, q0, q1, q2, q3);
65 static INLINE int8_t hev_mask(uint8_t thresh, uint8_t p1, uint8_t p0, argument
68 hev |= (abs(p1
21 filter_mask(uint8_t limit, uint8_t blimit, uint8_t p3, uint8_t p2, uint8_t p1, uint8_t p0, uint8_t q0, uint8_t q1, uint8_t q2, uint8_t q3) argument
37 flat_mask4(uint8_t thresh, uint8_t p3, uint8_t p2, uint8_t p1, uint8_t p0, uint8_t q0, uint8_t q1, uint8_t q2, uint8_t q3) argument
52 flat_mask5(uint8_t thresh, uint8_t p4, uint8_t p3, uint8_t p2, uint8_t p1, uint8_t p0, uint8_t q0, uint8_t q1, uint8_t q2, uint8_t q3, uint8_t q4) argument
113 const uint8_t p3 = s[-4 * p], p2 = s[-3 * p], p1 = s[-2 * p], p0 = s[-p]; local
138 const uint8_t p3 = s[-4], p2 = s[-3], p1 = s[-2], p0 = s[-1]; local
162 const uint8_t p3 = *op3, p2 = *op2, p1 = *op1, p0 = *op0; local
185 const uint8_t p3 = s[-4 * p], p2 = s[-3 * p], p1 = s[-2 * p], p0 = s[-p]; local
211 const uint8_t p3 = s[-4], p2 = s[-3], p1 = s[-2], p0 = s[-1]; local
243 p3 = *op3, p2 = *op2, p1 = *op1, p0 = *op0; local
290 const uint8_t p3 = s[-4 * p], p2 = s[-3 * p], p1 = s[-2 * p], p0 = s[-p]; local
316 const uint8_t p3 = s[-4], p2 = s[-3], p1 = s[-2], p0 = s[-1]; local
[all...]
/external/libvpx/libvpx/vp9/common/
H A Dvp9_loopfilter_filters.c23 uint8_t p1, uint8_t p0,
28 mask |= (abs(p2 - p1) > limit) * -1;
29 mask |= (abs(p1 - p0) > limit) * -1;
33 mask |= (abs(p0 - q0) * 2 + abs(p1 - q1) / 2 > blimit) * -1;
39 uint8_t p1, uint8_t p0,
43 mask |= (abs(p1 - p0) > thresh) * -1;
54 uint8_t p2, uint8_t p1,
58 int8_t mask = ~flat_mask4(thresh, p3, p2, p1, p0, q0, q1, q2, q3);
65 static INLINE int8_t hev_mask(uint8_t thresh, uint8_t p1, uint8_t p0, argument
68 hev |= (abs(p1
21 filter_mask(uint8_t limit, uint8_t blimit, uint8_t p3, uint8_t p2, uint8_t p1, uint8_t p0, uint8_t q0, uint8_t q1, uint8_t q2, uint8_t q3) argument
37 flat_mask4(uint8_t thresh, uint8_t p3, uint8_t p2, uint8_t p1, uint8_t p0, uint8_t q0, uint8_t q1, uint8_t q2, uint8_t q3) argument
52 flat_mask5(uint8_t thresh, uint8_t p4, uint8_t p3, uint8_t p2, uint8_t p1, uint8_t p0, uint8_t q0, uint8_t q1, uint8_t q2, uint8_t q3, uint8_t q4) argument
113 const uint8_t p3 = s[-4 * p], p2 = s[-3 * p], p1 = s[-2 * p], p0 = s[-p]; local
138 const uint8_t p3 = s[-4], p2 = s[-3], p1 = s[-2], p0 = s[-1]; local
162 const uint8_t p3 = *op3, p2 = *op2, p1 = *op1, p0 = *op0; local
185 const uint8_t p3 = s[-4 * p], p2 = s[-3 * p], p1 = s[-2 * p], p0 = s[-p]; local
211 const uint8_t p3 = s[-4], p2 = s[-3], p1 = s[-2], p0 = s[-1]; local
243 p3 = *op3, p2 = *op2, p1 = *op1, p0 = *op0; local
290 const uint8_t p3 = s[-4 * p], p2 = s[-3 * p], p1 = s[-2 * p], p0 = s[-p]; local
316 const uint8_t p3 = s[-4], p2 = s[-3], p1 = s[-2], p0 = s[-1]; local
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
H A DFloatRect.cpp169 void FloatRect::fitToPoints(const FloatPoint& p0, const FloatPoint& p1) argument
171 float left = std::min(p0.x(), p1.x());
172 float top = std::min(p0.y(), p1.y());
173 float right = std::max(p0.x(), p1.x());
174 float bottom = std::max(p0.y(), p1.y());
208 void FloatRect::fitToPoints(const FloatPoint& p0, const FloatPoint& p1, const FloatPoint& p2) argument
210 float left = min3(p0.x(), p1.x(), p2.x());
211 float top = min3(p0.y(), p1.y(), p2.y());
212 float right = max3(p0.x(), p1.x(), p2.x());
213 float bottom = max3(p0.y(), p1
218 fitToPoints(const FloatPoint& p0, const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& p3) argument
[all...]
H A DFloatQuad.h47 FloatQuad(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& p3, const FloatPoint& p4) argument
48 : m_p1(p1)
63 FloatPoint p1() const { return m_p1; } function in class:blink::FloatQuad
162 return a.p1() == b.p1() &&
170 return a.p1() != b.p1() ||
/external/chromium_org/third_party/libwebp/dsp/
H A Ddec_mips32.c29 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
30 const int a = 3 * (q0 - p0) + VP8ksclip1[p1 - q1];
39 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
44 p[-2 * step] = VP8kclip1[p1 + a3];
52 const int p2 = p[-3 * step], p1 = p[-2 * step], p0 = p[-step]; local
54 const int a = VP8ksclip1[3 * (q0 - p0) + VP8ksclip1[p1 - q1]];
59 p[-2 * step] = VP8kclip1[p1 + a2];
67 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
68 return (abs_mips32(p1 - p0) > thresh) || (abs_mips32(q1 - q0) > thresh);
72 const int p1 local
79 const int p1 = p[-2 * step], p0 = p[-step]; local
[all...]
/external/webp/src/dsp/
H A Ddec_mips32.c29 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
30 const int a = 3 * (q0 - p0) + VP8ksclip1[p1 - q1];
39 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
44 p[-2 * step] = VP8kclip1[p1 + a3];
52 const int p2 = p[-3 * step], p1 = p[-2 * step], p0 = p[-step]; local
54 const int a = VP8ksclip1[3 * (q0 - p0) + VP8ksclip1[p1 - q1]];
59 p[-2 * step] = VP8kclip1[p1 + a2];
67 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step]; local
68 return (abs_mips32(p1 - p0) > thresh) || (abs_mips32(q1 - q0) > thresh);
72 const int p1 local
79 const int p1 = p[-2 * step], p0 = p[-step]; local
[all...]
/external/chromium-trace/trace-viewer/src/tracing/
H A Dtimeline_track_view_test.js69 var p1 = model.getOrCreateProcess(1);
70 var t1 = p1.getOrCreateThread(1);
107 var p1 = model.getOrCreateProcess(1);
108 var t1 = p1.getOrCreateThread(1);
121 var p1 = model.getOrCreateProcess(1);
122 var ctr = p1.getOrCreateCounter('', 'a');
152 var p1 = model.getOrCreateProcess(1);
153 p1.getOrCreateCounter('', 'a');
166 var p1 = model.getOrCreateProcess(1);
167 var t1 = p1
[all...]
/external/chromium_org/build/android/pylib/base/
H A Dbase_test_result_unittest.py16 self.p1 = BaseTestResult('p1', ResultType.PASS, log='pass1')
17 other_p1 = BaseTestResult('p1', ResultType.PASS)
23 self.tr.AddResult(self.p1)
31 [self.p1, self.p2, self.f1, self.c1, self.u1]))
35 [self.p1, self.p2]))
43 other_p1 = BaseTestResult('p1', ResultType.PASS)
50 [self.p1, self.p2, self.f1, self.c1, self.u1, f2]))
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/promises/
H A DPromisesPanel.js71 * @param {!DebuggerAgent.PromiseDetails} p1
75 _comparePromises: function(p1, p2) {
76 if (p1.parentId < p2.parentId)
78 if (p1.parentId > p2.parentId)
80 if (p1.id < p2.id)
82 if (p1.id > p2.id)
/external/chromium_org/ui/gfx/geometry/
H A Drect.cc89 Rect BoundingRect(const Point& p1, const Point& p2) { argument
90 int rx = std::min(p1.x(), p2.x());
91 int ry = std::min(p1.y(), p2.y());
92 int rr = std::max(p1.x(), p2.x());
93 int rb = std::max(p1.y(), p2.y());
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/
H A DProperty.java214 public int compare(Property p1, Property p2) {
215 return p1.getName().compareTo(p2.getName());
222 public int compare(Property p1, Property p2) {
223 int delta = p1.mPriority - p2.mPriority;
228 return p1.getName().compareTo(p2.getName());
/external/nanopb-c/tests/site_scons/site_tools/
H A Dnanopb.py61 p1 = os.path.join(n, 'generator-bin', 'protoc' + env['PROGSUFFIX'])
62 if os.path.exists(p1):
64 return env['ESCAPE'](p1)
81 p1 = os.path.join(n, 'generator-bin', 'protoc' + env['PROGSUFFIX'])
82 if p == env['ESCAPE'](p1):
/external/skia/src/core/
H A DSkEdge.h39 int setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip,
42 inline int setLine(const SkPoint& p0, const SkPoint& p1, int shiftUp);
88 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, int shift) {
95 x1 = int(p1.fX * scale);
96 y1 = int(p1.fY * scale);
/external/jemalloc/test/include/test/
H A Dmath.h224 double e, aa, xx, c, ch, a, q, p1, p2, t, x, b, s1, s2, s3, s4, s5, s6; local
248 p1 = 0.222222 / df;
249 ch = df * pow(x * sqrt(p1) + 1.0 - p1, 3.0);
260 p1 = 1.0 + ch * (4.67 + ch);
262 t = -0.5 + (4.67 + 2.0 * ch) / p1 - (6.73 + ch
265 c * aa) * p2 / p1) / t;
275 p1 = 0.5 * ch;
276 if (p1 < 0.0)
278 p2 = p - i_gamma(p1, x
[all...]
/external/pixman/pixman/
H A Dpixman-linear-gradient.c68 dx = linear->p2.x - linear->p1.x;
69 dy = linear->p2.y - linear->p1.y;
132 dx = linear->p2.x - linear->p1.x;
133 dy = linear->p2.y - linear->p1.y;
156 (dx * linear->p1.x + dy * linear->p1.y) * v2) * invden;
206 (dx * linear->p1.x + dy * linear->p1.y) * v2) * invden;
259 pixman_image_create_linear_gradient (const pixman_point_fixed_t * p1, argument
280 linear->p1
[all...]

Completed in 958 milliseconds

<<11121314151617181920>>