HomeSort by relevance Sort by last modified time
    Searched refs:p0 (Results 226 - 250 of 404) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/ppp/pppd/plugins/pppoatm/
ans.c 195 static int cc_len(int p0,int p1)
224 if (cc_table[p0] == 1) return 1;
225 return cc_table[p0*10+p1];
  /external/skia/src/animator/
SkParseSVGPath.cpp 28 static void quadApprox(SkPath &fPath, const SkPoint &p0, const SkPoint &p1, const SkPoint &p2)
34 midPt(j, p0, c);
35 midPt(k, p0, p1);
  /external/skia/tests/
ColorTest.cpp 125 SkPMColor p0 = SkPreMultiplyColor(c0); local
127 SkColor c1 = SkUnPreMultiply::PMColorToColor(p0);
130 // we can't promise that c0 == c1, since c0 -> p0 is a many to one
131 // function, however, we can promise that p0 -> c1 -> p1 : p0 == p1
132 REPORTER_ASSERT(reporter, p0 == p1);
Writer32Test.cpp 87 void* p0 = reporter; local
93 writer.writePtr(p0);
106 REPORTER_ASSERT(reporter, reader.readPtr() == p0);
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
c2_11pf.cpp 634 Word16 *p0; local
811 p0 = h - codvec[0];
821 *p0++,
c2_9pf.cpp 892 Word16 *p0, *p1, *pt;
1005 Word16 *p0; local
    [all...]
c8_31pf.cpp 207 Word16 *p0; local
301 p0 = h - *(p_codvec++);
317 *p0++,
c3_14pf.cpp 687 Word16 *p0; local
775 p0 = h - codvec[0];
785 *p0++,
c4_17pf.cpp 757 Word16 *p0; local
842 p0 = h - codvec[0];
853 *p0++,
  /external/chromium/testing/gmock/test/
gmock-generated-actions_test.cc 801 ACTION_P4(Plus, p0, p1, p2, p3) { return arg0 + p0 + p1 + p2 + p3; }
808 ACTION_P5(Plus, p0, p1, p2, p3, p4) { return arg0 + p0 + p1 + p2 + p3 + p4; }
815 ACTION_P6(Plus, p0, p1, p2, p3, p4, p5) {
816 return arg0 + p0 + p1 + p2 + p3 + p4 + p5;
824 ACTION_P7(Plus, p0, p1, p2, p3, p4, p5, p6) {
825 return arg0 + p0 + p1 + p2 + p3 + p4 + p5 + p6;
833 ACTION_P8(Plus, p0, p1, p2, p3, p4, p5, p6, p7) {
834 return arg0 + p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7
    [all...]
  /external/bluetooth/bluedroid/main/
bte_logmsg.c 210 #define DBG_TRACE_WARNING2( m, p0, p1 ) BT_TRACE_2( TRACE_LAYER_BTM, (TRACE_ORG_APPL|TRACE_TYPE_WARNING), m, p0, p1 )
213 #define DBG_TRACE_WARNING2( m, p0, p1 )
215 #define DBG_TRACE_DEBUG2( m, p0, p1 ) BT_TRACE_2( TRACE_LAYER_BTM, (TRACE_ORG_APPL|TRACE_TYPE_DEBUG), m, p0, p1 )
  /external/chromium_org/third_party/skia/src/core/
SkEdge.cpp 34 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip,
41 x0 = int(p0.fX * scale);
42 y0 = int(p0.fY * scale);
47 x0 = p0.fX >> shift;
48 y0 = p0.fY >> shift;
164 // cheap calc of distance from center of p0-p2 to the center of the curve
239 * p0 (1 - t)^2 + p1 t(1 - t) + p2 t^2 ==> At^2 + Bt + C
241 * A = p0 - 2p1 + p2
242 * B = 2(p1 - p0)
243 * C = p0
    [all...]
SkScan_Antihair.cpp 674 SkPoint p0, p1;
676 p0.set(rect.fLeft, rect.fTop);
678 SkScan::AntiHairLine(p0, p1, clip, blitter);
679 p0.set(rect.fRight, rect.fBottom);
680 SkScan::AntiHairLine(p0, p1, clip, blitter);
682 SkScan::AntiHairLine(p0, p1, clip, blitter);
683 p0.set(rect.fLeft, rect.fTop);
684 SkScan::AntiHairLine(p0, p1, clip, blitter);
  /external/skia/gm/
techtalk1.cpp 65 static void drawLine(SkCanvas* canvas, const SkPoint& p0, const SkPoint& p1,
67 canvas->drawLine(p0.fX, p0.fY, p1.fX, p1.fY, paint);
88 static void show_mesh_between(SkCanvas* canvas, const SkPath& p0, const SkPath& p1) {
90 tesselate(p0, &d0);
  /external/skia/src/core/
SkEdge.cpp 34 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip,
41 x0 = int(p0.fX * scale);
42 y0 = int(p0.fY * scale);
47 x0 = p0.fX >> shift;
48 y0 = p0.fY >> shift;
164 // cheap calc of distance from center of p0-p2 to the center of the curve
239 * p0 (1 - t)^2 + p1 t(1 - t) + p2 t^2 ==> At^2 + Bt + C
241 * A = p0 - 2p1 + p2
242 * B = 2(p1 - p0)
243 * C = p0
    [all...]
  /external/libvpx/libvpx/vp9/common/arm/neon/
vp9_loopfilter_neon.asm 58 vld1.u8 {d6}, [r3@64], r1 ; p0
176 ; d6 p0
191 vabd.u8 d21, d5, d6 ; m3 = abs(p1 - p0)
200 vabd.u8 d17, d6, d7 ; abs(p0 - q0)
209 vcgt.u8 d21, d21, d2 ; (abs(p1 - p0) > thresh)*-1
214 vqadd.u8 d17, d17, d17 ; b = abs(p0 - q0) * 2
311 vld1.u8 {d6}, [r2@64], r1 ; p0
438 ; d6 p0
455 vabd.u8 d21, d5, d6 ; m3 = abs(p1 - p0)
464 vabd.u8 d25, d6, d4 ; m7 = abs(p0 - p2
    [all...]
  /external/libvpx/libvpx/test/
convolve_test.cc 323 const int p0 = filters[i][0] + filters[i][1]; local
327 EXPECT_LE(p0, 128);
331 EXPECT_LE(p0 + p3, 128);
332 EXPECT_LE(p0 + p3 + p1, 128);
333 EXPECT_LE(p0 + p3 + p1 + p2, 128);
334 EXPECT_EQ(p0 + p1 + p2 + p3, 128);
  /external/svox/pico/lib/
picokpr.c 435 picoos_uint32 p0, p1, p2, p3; local
437 p0 = *(p++);
442 c = p0 + (p1<<8) + (p2<<16) + (p3<<24);
472 picoos_uint32 p0, p1, p2, p3; local
474 p0 = *(p++);
479 c = p0 + (p1<<8) + (p2<<16) + (p3<<24);
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
bntest.c 1121 int p0[] = {163,7,6,3,0,-1}; local
1131 BN_GF2m_arr2poly(p0, b[0]);
1179 int p0[] = {163,7,6,3,0,-1}; local
1192 BN_GF2m_arr2poly(p0, b[0]);
1250 int p0[] = {163,7,6,3,0,-1}; local
1259 BN_GF2m_arr2poly(p0, b[0]);
1309 int p0[] = {163,7,6,3,0,-1}; local
1318 BN_GF2m_arr2poly(p0, b[0]);
1364 int p0[] = {163,7,6,3,0,-1}; local
1375 BN_GF2m_arr2poly(p0, b[0])
1427 int p0[] = {163,7,6,3,0,-1}; local
1498 int p0[] = {163,7,6,3,0,-1}; local
1557 int p0[] = {163,7,6,3,0,-1}; local
    [all...]
  /external/openssl/crypto/bn/
bntest.c 1121 int p0[] = {163,7,6,3,0,-1}; local
1131 BN_GF2m_arr2poly(p0, b[0]);
1179 int p0[] = {163,7,6,3,0,-1}; local
1192 BN_GF2m_arr2poly(p0, b[0]);
1250 int p0[] = {163,7,6,3,0,-1}; local
1259 BN_GF2m_arr2poly(p0, b[0]);
1309 int p0[] = {163,7,6,3,0,-1}; local
1318 BN_GF2m_arr2poly(p0, b[0]);
1364 int p0[] = {163,7,6,3,0,-1}; local
1375 BN_GF2m_arr2poly(p0, b[0])
1427 int p0[] = {163,7,6,3,0,-1}; local
1498 int p0[] = {163,7,6,3,0,-1}; local
1557 int p0[] = {163,7,6,3,0,-1}; local
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
fractions.py 243 p0, q0, p1, q1 = 0, 1, 1, 0
250 p0, q0, p1, q1 = p1, q1, p0+a*p1, q2
254 bound1 = Fraction(p0+k*p1, q0+k*q1)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
fractions.py 243 p0, q0, p1, q1 = 0, 1, 1, 0
250 p0, q0, p1, q1 = p1, q1, p0+a*p1, q2
254 bound1 = Fraction(p0+k*p1, q0+k*q1)
  /external/chromium_org/third_party/openssl/openssl/crypto/md5/asm/
md5-ia64.S 305 cmp.ne pOff, p0 = 0, InAlign
340 cmp.ne pAgain, p0 = 0, BlockCount
402 cmp.ne pAgain, p0 = 0, BlockCount ; \
424 cmp.eq pOff, p0 = 1, InAlign
428 cmp.eq pOff, p0 = 2, InAlign
615 cmp.ne pMore, p0 = 0, LTrip ; \
634 cmp.eq pMore, p0 = r0, r0
880 cmp.ne pMore, p0 = 0, LTrip ; \
900 cmp.eq pMore, p0 = r0, r0 ; \
  /external/openssl/crypto/md5/asm/
md5-ia64.S 305 cmp.ne pOff, p0 = 0, InAlign
340 cmp.ne pAgain, p0 = 0, BlockCount
402 cmp.ne pAgain, p0 = 0, BlockCount ; \
424 cmp.eq pOff, p0 = 1, InAlign
428 cmp.eq pOff, p0 = 2, InAlign
615 cmp.ne pMore, p0 = 0, LTrip ; \
634 cmp.eq pMore, p0 = r0, r0
880 cmp.ne pMore, p0 = 0, LTrip ; \
900 cmp.eq pMore, p0 = r0, r0 ; \
  /external/chromium_org/third_party/re2/re2/
bitstate.cc 140 // Try a search from instruction id0 in state p0.
142 bool BitState::TrySearch(int id0, const char* p0) {
146 Push(id0, p0, 0);

Completed in 410 milliseconds

1 2 3 4 5 6 7 8 91011>>