/external/skia/include/core/ |
SkPath.h | 249 p1, and ending at p2. If no moveTo() call has been made for this 253 @param p2 The end point on a quadratic curve 255 void quadTo(const SkPoint& p1, const SkPoint& p2) { 256 this->quadTo(p1.fX, p1.fY, p2.fX, p2.fY); 289 and p2, and ending at p3. If no moveTo() call has been made for this 293 @param p2 The 2nd control point on a cubic curve 296 void cubicTo(const SkPoint& p1, const SkPoint& p2, const SkPoint& p3) { 297 this->cubicTo(p1.fX, p1.fY, p2.fX, p2.fY, p3.fX, p3.fY) [all...] |
/libcore/luni/src/test/java/tests/api/javax/security/auth/ |
PrivateCredentialPermissionTest.java | 121 PrivateCredentialPermission p2 = new PrivateCredentialPermission("a.b.Credential P1 \"abc\"", "read"); local 123 PrivateCredentialPermission p4 = new PrivateCredentialPermission("C1 P1 \"abc\" P2 \"abcd\"", "read"); 126 PrivateCredentialPermission p7 = new PrivateCredentialPermission("a.b.Credential P2 \"abc\"", "read"); 127 PrivateCredentialPermission p8 = new PrivateCredentialPermission("a.b.Credential1 P2 \"abc\"", "read"); 128 PrivateCredentialPermission p9 = new PrivateCredentialPermission("a.b.Credential1 P2 \"*\"", "read"); 130 PrivateCredentialPermission[][] arr = { { p1, p2 }, 131 { p2, p1 }, 134 { p6, p2 }, 135 { p2, p7 }, 192 PrivateCredentialPermission p2 = new PrivateCredentialPermission(name3, "read") local 227 PrivateCredentialPermission p2 = new PrivateCredentialPermission(name1, "read"); local [all...] |
/device/samsung/crespo/alsa-lib/src/alisp/ |
alisp.c | 1108 struct alisp_object *p1 = car(args), *p2; local 1113 p2 = car(p1); 1115 return p2; 1123 struct alisp_object *p1 = car(args), *p2; local 1128 p2 = cdr(p1); 1130 return p2; 1358 struct alisp_object * p1, * p2, * p3; local 1405 struct alisp_object * p1, * p2; local 1444 struct alisp_object * p1, * p2; local 1483 struct alisp_object * p1, * p2; local 1522 struct alisp_object * p1, * p2; local 1561 struct alisp_object * p1, * p2; local 1614 struct alisp_object * p1, * p2; local 1848 struct alisp_object * p1, * p2; local 1871 struct alisp_object * p1, * p2; local 1972 struct alisp_object * p = args, * p1, * p2, * p3; local 2005 struct alisp_object * p1, * p2, * p3; local 2030 struct alisp_object * p1, * p2; local 2051 struct alisp_object * p1, * p2; local 2071 struct alisp_object * p1, * p2, * p3; local 2166 * p2 = eval(instance, car(cdr(args))); local 2205 struct alisp_object * p = args, * p1, * p2 = NULL, *n; local 2259 * p2 = car(cdr(args)), local 2295 struct alisp_object * p1, * p2, * p3, * p4; local 2749 struct alisp_object * p1, * p2, * n; local 2779 struct alisp_object * p1, *p2, * n; local 2809 struct alisp_object * p1, * p2, * n; local 2839 struct alisp_object * p1, * p2, * n; local 2876 struct alisp_object * p1, * p2, * n; local 3098 struct alisp_object * p1 = car(p), * p2; local 3474 struct alisp_object * p2; local [all...] |
/external/qemu/audio/ |
fmodaudio.c | 101 void *p1 = 0, *p2 = 0; local 109 &p2, 134 status = FSOUND_Sample_Unlock (fmd->fmod_sample, p1, p2, len1, len2); 167 static int fmod_unlock_sample (FSOUND_SAMPLE *sample, void *p1, void *p2, 170 int status = FSOUND_Sample_Unlock (sample, p1, p2, blen1, blen2); 184 void **p2, 196 p2, 210 fmod_unlock_sample (sample, *p1, *p2, *blen1, *blen2); 213 *p2 = NULL - 1; 224 if (!p2 && *blen2) 236 void *p1 = 0, *p2 = 0; local 473 void *p1, *p2; local [all...] |
dsound_template.h | 45 LPVOID p2, 52 hr = glue (IFACE, _Unlock) (buf, p1, blen1, p2, blen2); 75 LPVOID p1 = NULL, p2 = NULL; local 91 &p2, 118 if ((p1 && (blen1 & info->align)) || (p2 && (blen2 & info->align))) { 121 glue (dsound_unlock_, TYPE) (buf, p1, p2, blen1, blen2); 130 if (!p2 && blen2) { 131 dolog ("warning: !p2 && blen2=%ld\n", blen2); 136 *p2p = p2;
|
/external/v8/src/arm/ |
simulator-arm.h | 44 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ 45 (entry(p0, p1, p2, p3, p4)) 66 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ 67 entry(p0, p1, p2, p3, p4, p5, p6) 77 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ 80 p0, p1, p2, p3, p4)) 82 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ 84 FUNCTION_ADDR(entry), 7, p0, p1, p2, p3, p4, p5, p6)
|
/external/v8/src/mips/ |
simulator-mips.h | 44 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ 45 entry(p0, p1, p2, p3, p4); 75 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ 76 entry(p0, p1, p2, p3, p4, p5, p6) 86 #define CALL_GENERATED_CODE(entry, p0, p1, p2, p3, p4) \ 89 p0, p1, p2, p3, p4)) 91 #define CALL_GENERATED_REGEXP_CODE(entry, p0, p1, p2, p3, p4, p5, p6) \ 93 FUNCTION_ADDR(entry), 7, p0, p1, p2, p3, p4, p5, p6)
|
/external/webkit/WebCore/WebCore.gyp/scripts/ |
action_maketokenizer.py | 90 p2 = subprocess.Popen(['perl', maketokenizer], stdin=p1.stdout, stdout=outfile) 93 r2 = p2.wait()
|
/frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
c2t64fx.c | 59 Word16 *p0, *p1, *p2, *psign;
local 99 p2 = dn2;
104 *p2++ = s >> 7;
106 *p2++ = s >> 7;
108 *p2++ = s >> 7;
110 *p2++ = s >> 7;
225 p2 = rrixiy;
240 alp2 = add1(alp1, add1(*p1++, *p2++));
|
/frameworks/base/core/jni/android/opengl/ |
poly_clip.cpp | 112 Poly p2, *p, *q, *r; local 138 * at each step toggling between polygons p1 and p2 141 q = &p2; 149 /* if result ended up in p2 then copy it to p1 */ 150 if (p==&p2) 151 memcpy(p1, &p2, sizeof(Poly)-(POLY_NMAX-p2.n)*sizeof(Poly_vert));
|
/system/wlan/ti/sta_dk_4_0_4_32/pform/linux/src/ |
bmtrace.c | 54 unsigned long p2; /* Parameter 2 */ member in struct:__anon16926 100 len += sprintf(page+len, "loc delta ts p1 p2\n"); 117 bme->p1, bme->p2); 169 void bm_trace(int loc, unsigned long p1, unsigned long p2) 181 bm_control->entry[pos].p2 = p2;
|
/external/quake/quake/src/QW/client/ |
pmovetst.c | 176 qboolean PM_RecursiveHullCheck (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, pmtrace_t *trace)
215 t2 = p2[plane->type] - plane->dist;
220 t2 = DotProduct (plane->normal, p2) - plane->dist;
225 return PM_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
227 return PM_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
230 return PM_RecursiveHullCheck (hull, node->children[0], p1f, p2f, p1, p2, trace);
232 return PM_RecursiveHullCheck (hull, node->children[1], p1f, p2f, p1, p2, trace);
247 mid[i] = p1[i] + frac*(p2[i] - p1[i]);
267 return PM_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace);
299 mid[i] = p1[i] + frac*(p2[i] - p1[i]); [all...] |
/libcore/luni/src/test/java/tests/api/java/util/concurrent/ |
ThreadPoolExecutorSubclassTest.java | 211 ThreadPoolExecutor p2 = new CustomTPE(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 212 assertEquals(0, p2.getActiveCount()); 213 p2.execute(new MediumRunnable()); 215 assertEquals(1, p2.getActiveCount()); 216 joinPool(p2); 223 ThreadPoolExecutor p2 = new CustomTPE(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 224 assertEquals(0, p2.getPoolSize()); 225 assertTrue(p2.prestartCoreThread()); 226 assertEquals(1, p2.getPoolSize()); 227 assertTrue(p2.prestartCoreThread()) 238 ThreadPoolExecutor p2 = new CustomTPE(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 252 ThreadPoolExecutor p2 = new CustomTPE(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 274 ThreadPoolExecutor p2 = new CustomTPE(2, 2, 1000, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 359 ThreadPoolExecutor p2 = new CustomTPE(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 373 ThreadPoolExecutor p2 = new CustomTPE(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local [all...] |
ThreadPoolExecutorTest.java | 67 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 68 assertEquals(0, p2.getActiveCount()); 69 p2.execute(new MediumRunnable()); 71 assertEquals(1, p2.getActiveCount()); 72 joinPool(p2); 79 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 80 assertEquals(0, p2.getPoolSize()); 81 assertTrue(p2.prestartCoreThread()); 82 assertEquals(1, p2.getPoolSize()); 83 assertTrue(p2.prestartCoreThread()) 94 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 108 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 130 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, 1000, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 215 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local 229 ThreadPoolExecutor p2 = new ThreadPoolExecutor(2, 2, LONG_DELAY_MS, MILLISECONDS, new ArrayBlockingQueue<Runnable>(10)); local [all...] |
/external/openssl/crypto/ec/ |
ec_pmeth.c | 204 static int pkey_ec_ctrl(EVP_PKEY_CTX *ctx, int type, int p1, void *p2) 223 if (EVP_MD_type((const EVP_MD *)p2) != NID_sha1 && 224 EVP_MD_type((const EVP_MD *)p2) != NID_sha224 && 225 EVP_MD_type((const EVP_MD *)p2) != NID_sha256 && 226 EVP_MD_type((const EVP_MD *)p2) != NID_sha384 && 227 EVP_MD_type((const EVP_MD *)p2) != NID_sha512) 232 dctx->md = p2;
|
/external/openssl/crypto/perlasm/ |
cbc.pl | 28 local($name,$enc_func,$dec_func,$swap,$iv_off,$enc_off,$p1,$p2,$p3)=@_; 34 # p1,p2,p3 are the offsets for parameters to be passed to the 51 $data_off+=4 if ($p2 > 0); 82 if ($p2 > 0) 84 &comment("get and push parameter $p2"); 85 if ($enc_off != $p2) 86 { &mov("eax", &wparam($p2)); &push("eax"); } 316 $total+=4 if ($p2 > 0);
|
/external/iproute2/ip/ |
ip6tunnel.c | 232 * @p2: database entry 235 const struct ip6_tnl_parm *p2) 237 return ((!p1->link || p1->link == p2->link) && 238 (!p1->name[0] || strcmp(p1->name, p2->name) == 0) && 240 memcmp(&p1->laddr, &p2->laddr, sizeof(p1->laddr)) == 0) && 242 memcmp(&p1->raddr, &p2->raddr, sizeof(p1->raddr)) == 0) && 243 (!p1->proto || !p2->proto || p1->proto == p2->proto) && 244 (!p1->encap_limit || p1->encap_limit == p2->encap_limit) && 245 (!p1->hop_limit || p1->hop_limit == p2->hop_limit) & [all...] |
/external/stlport/test/eh/ |
test_insert.h | 264 typename C::const_iterator p2 = result.begin(); local 267 for ( size_t n = 0; n < insPos; n++, ++p1, ++p2) 268 EH_ASSERT( *p1 == *p2 ); 270 for (; tmp != lastNew; ++p2, ++tmp ) { 271 EH_ASSERT(p2 != result.end()); 272 EH_ASSERT(*p2 == *tmp); 275 for (; p2 != result.end(); ++p1, ++p2 ) 276 EH_ASSERT( *p1 == *p2 ); 297 typename C::const_iterator p2 = result.begin() local [all...] |
/external/openssl/crypto/hmac/ |
hm_pmeth.c | 173 static int pkey_hmac_ctrl(EVP_PKEY_CTX *ctx, int type, int p1, void *p2) 181 if ((!p2 && p1 > 0) || (p1 < -1)) 183 if (!ASN1_OCTET_STRING_set(&hctx->ktmp, p2, p1)) 188 hctx->md = p2;
|
/libcore/support/src/test/java/tests/support/ |
Support_TimeZone.java | 75 public int getOffset(int p1, int p2, int p3, int p4, int p5, int p6) {
|
/external/bluetooth/bluez/sbc/ |
sbcinfo.c | 178 int n, p1, p2, fd, size, num; local 252 p2 = -1; 256 if (p2 < 0 && (frame_len[n] == 0 || frame_len[n] == len)) 257 p2 = n; 261 if (p2 >= 0) 262 frame_len[p2] = len;
|
/external/bluetooth/glib/tests/ |
patterntest.c | 170 GPatternSpec *p2 = g_pattern_spec_new (pattern2); local 171 gboolean equal = g_pattern_spec_equal (p1, p2); 180 match_type_name (p2->match_type), p2->pattern_length, p2->pattern); 186 g_pattern_spec_free (p2);
|
/external/e2fsprogs/intl/ |
localealias.c | 393 const unsigned char *p2 = (const unsigned char *) map2->alias; 396 if (p1 == p2) 404 c2 = isupper (*p2) ? tolower (*p2) : *p2; 408 ++p2;
|
/external/nist-sip/java/gov/nist/javax/sip/header/ |
ParametersHeader.java | 583 String p2 = other.getParameter( pname ); local 587 if (p1 == null ^ p2 == null) return false; 588 else if (p1 != null && !p1.equalsIgnoreCase(p2) ) return false; 596 String p2 = this.getParameter( pname ); local 600 // if (p2==null) return false; 605 if (p1 == null ^ p2 == null) return false; 606 else if (p1 != null && !p1.equalsIgnoreCase(p2) ) return false;
|
/external/openssl/crypto/bn/ |
bn_exp2.c | 119 const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m, 133 bn_check_top(p2); 142 bits2=BN_num_bits(p2); 270 if (BN_is_bit_set(p2, b)) 274 while (!BN_is_bit_set(p2, i)) 281 if (BN_is_bit_set(p2, i))
|