Searched refs:p2 (Results 276 - 300 of 419) sorted by relevance

<<11121314151617

/freebsd-11-stable/contrib/gcc/
H A Dbuiltins.c8367 const char *p1, *p2;
8387 p2 = c_getstr (arg2);
8391 if (host_integerp (len, 1) && p1 && p2
8393 && compare_tree_int (len, strlen (p2) + 1) <= 0)
8395 const int r = memcmp (p1, p2, tree_low_cst (len, 1));
8434 const char *p1, *p2;
8447 p2 = c_getstr (arg2);
8449 if (p1 && p2)
8451 const int i = strcmp (p1, p2);
8461 if (p2
8364 const char *p1, *p2; local
8431 const char *p1, *p2; local
8494 const char *p1, *p2; local
9424 const char *p1, *p2; local
9610 const char *p1, *p2; local
9768 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2); local
9812 const char *p1 = c_getstr (s1), *p2 = c_getstr (s2); local
[all...]
H A Dcgraph.c171 eq_node (const void *p1, const void *p2) argument
174 const struct cgraph_node *n2 = (const struct cgraph_node *) p2;
832 eq_varpool_node (const void *p1, const void *p2) argument
837 (const struct cgraph_varpool_node *) p2;
H A Dregclass.c501 enum reg_class *p1, *p2;
513 for (p2 = &reg_class_subclasses[j][0];
514 *p2 != LIM_REG_CLASSES;
515 p2++)
516 if (*p2 != i && contains_reg_of_mode [*p2][m])
517 cost = MAX (cost, move_cost [m][i][*p2]);
500 enum reg_class *p1, *p2; local
/freebsd-11-stable/contrib/gcc/config/soft-fp/
H A Dop-4.h352 #define umul_ppppmnnn(p3,p2,p1,p0,m,n2,n1,n0) \
356 umul_ppmm(p2,_t,m,n1); \
357 __FP_FRAC_ADDI_2(p2,p1,_t); \
359 __FP_FRAC_ADDI_2(p3,p2,_t); \
/freebsd-11-stable/sys/contrib/v4l/
H A Dvideodev.h243 int p2; member in struct:video_play_mode
300 /* p2: GENLOCK FINE DELAY value */
316 /* p1 = first active; p2 = last active */
/freebsd-11-stable/release/picobsd/tinyware/msh/
H A Dsh4.c31 _PROTOTYPE(static int xstrcmp, (char *p1, char *p2 ));
569 xstrcmp(p1, p2)
570 char *p1, *p2;
572 return(strcmp(*(char **)p1, *(char **)p2));
/freebsd-11-stable/crypto/heimdal/lib/krb5/
H A Dpac.c598 krb5_principal p2; local
680 ret = krb5_parse_name_flags(context, s, KRB5_PRINCIPAL_PARSE_NO_REALM, &p2);
685 if (krb5_principal_compare_any_realm(context, principal, p2) != TRUE) {
689 krb5_free_principal(context, p2);
H A Drd_req.c405 krb5_principal p1, p2; local
413 &p2,
416 res = krb5_principal_compare (context, p1, p2);
418 krb5_free_principal (context, p2);
/freebsd-11-stable/gnu/usr.bin/rcs/lib/
H A Drcsutil.c199 *p2 = (unsigned char const*)s2; local
202 while (i-- && !(r = (*p1++ - *p2++)))
216 register char const *p2 = (char const*)s2; local
218 *p1++ = *p2++;
/freebsd-11-stable/usr.bin/makewhatis/
H A Dmakewhatis.c818 const struct page_info *p2 = *(struct page_info * const *) b; local
819 if (p1->inode == p2->inode)
820 return strcmp(p1->name, p2->name);
821 return p1->inode - p2->inode;
/freebsd-11-stable/sys/arm64/arm64/
H A Dvm_machdep.c62 * Finish a fork operation, with process p2 nearly set up.
67 cpu_fork(struct thread *td1, struct proc *p2, struct thread *td2, int flags) argument
/freebsd-11-stable/crypto/openssl/crypto/dsa/
H A Ddsa.h137 BIGNUM *a2, BIGNUM *p2, BIGNUM *m, BN_CTX *ctx,
/freebsd-11-stable/usr.sbin/rpc.lockd/
H A Dlock_proc.c164 void *p1, *p2; local
172 p2 = &((struct sockaddr_in *)sa2)->sin_addr;
177 p2 = &((struct sockaddr_in6 *)sa2)->sin6_addr;
184 return memcmp(p1, p2, len);
/freebsd-11-stable/sbin/sconfig/
H A Dsconfig.c160 char *p1, *p2; local
183 p2 = &pttyname[9];
188 *p2 = '0';
192 *p2 = "0123456789abcdef"[j];
/freebsd-11-stable/crypto/heimdal/lib/sqlite/
H A Dsqlite3.c8213 int p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOp
8261 signed char p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOpList
8317 ** The following macro converts a relative address in the p2 field
10573 int p1, p2; /* Operands of the opcode used to ends the loop */ member in struct:WhereLevel
21313 /* a: p0<<14 | p2 (unmasked) */
21341 /* a: p0<<14 | p2 (masked) */
21343 /* 1:save off p0<<21 | p1<<14 | p2<<7 | p3 (masked) */
21348 /* s: p0<<14 | p2 (masked) */
21353 /* a: p0<<28 | p2<<14 | p4 (unmasked) */
21366 /* 2:save off p0<<21 | p1<<14 | p2<<
58443 sqlite3VdbeAddOp3(Vdbe *p, int op, int p1, int p2, int p3) argument
58480 sqlite3VdbeAddOp2(Vdbe *p, int op, int p1, int p2) argument
58488 sqlite3VdbeAddOp4( Vdbe *p, int op, int p1, int p2, int p3, const char *zP4, int p4type ) argument
58519 sqlite3VdbeAddOp4Int( Vdbe *p, int op, int p1, int p2, int p3, int p4 ) argument
58807 int p2 = pIn->p2; local
63693 int p2; /* Register to copy to */ member in struct:vdbeExecUnion::OP_Move_stack_vars
63732 int p2; member in struct:vdbeExecUnion::OP_Compare_stack_vars
63749 int p2; /* column number to retrieve */ member in struct:vdbeExecUnion::OP_Column_stack_vars
63829 int p2; member in struct:vdbeExecUnion::OP_OpenWrite_stack_vars
70624 VdbeSorterIter *p2; local
70743 vdbeSorterMerge( VdbeCursor *pCsr, SorterRecord *p1, SorterRecord *p2, SorterRecord **ppOut ) argument
84235 i64 p1, p2; local
101832 CollSeq *p2 = sqlite3ExprCollSeq(pParse, p); local
113159 sqlite3 *p2; local
115916 char *p2 = *pp2; local
116009 char *p2 = *pp2; local
116138 char *p2 = *pp2; local
116279 char *p2 = a2; local
116371 char *p2 = aRight; local
117691 char *p2 = aOut; local
117719 char *p2; local
118312 char *p2; local
121932 const sqlite3_tokenizer_module *p2; local
128474 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
128493 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
[all...]
/freebsd-11-stable/usr.sbin/ppp/
H A Dmp.c103 peerid_Equal(const struct peerid *p1, const struct peerid *p2) argument
105 return !strcmp(p1->authname, p2->authname) &&
106 p1->enddisc.class == p2->enddisc.class &&
107 p1->enddisc.len == p2->enddisc.len &&
108 !memcmp(p1->enddisc.address, p2->enddisc.address, p1->enddisc.len);
/freebsd-11-stable/contrib/ntp/libntp/
H A Dntp_calendar.c1191 uint32_t p1, p2, sf; local
1201 p2 = p1 >> 16;
1203 M_ADD(res.D_s.hi, res.D_s.lo, p2, p1);
1215 p2 = (uint32_t)-(lo < 0);
1217 M_ADD(res.D_s.hi, res.D_s.lo, p2, p1);
/freebsd-11-stable/contrib/gcc/cp/
H A Ddecl2.c318 tree p1, p2, i1, i2;
330 p2 = index_exp;
332 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
339 if ((p1 && i2) && (i1 && p2))
344 else if (i1 && p2)
345 array_expr = p2, index_exp = i1;
598 tree p1, p2;
602 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
622 && compparms (p1, p2)
317 tree p1, p2, i1, i2; local
597 tree p1, p2; local
/freebsd-11-stable/sys/dev/hptnr/
H A Dhptnr_osm_bsd.c1566 #define __DRIVER_MODULE(p1, p2, p3, p4, p5, p6) DRIVER_MODULE(p1, p2, p3, p4, p5, p6)
1567 #define __MODULE_VERSION(p1, p2) MODULE_VERSION(p1, p2)
1568 #define __MODULE_DEPEND(p1, p2, p3, p4, p5) MODULE_DEPEND(p1, p2, p3, p4, p5)
/freebsd-11-stable/sys/dev/hpt27xx/
H A Dhpt27xx_osm_bsd.c1384 #define __DRIVER_MODULE(p1, p2, p3, p4, p5, p6) DRIVER_MODULE(p1, p2, p3, p4, p5, p6)
1385 #define __MODULE_VERSION(p1, p2) MODULE_VERSION(p1, p2)
1386 #define __MODULE_DEPEND(p1, p2, p3, p4, p5) MODULE_DEPEND(p1, p2, p3, p4, p5)
/freebsd-11-stable/contrib/libbegemot/
H A Drpoll.c454 tim_cmp(const void *p1, const void *p2) argument
457 int t2 = *(const int *)p2;
/freebsd-11-stable/cddl/contrib/opensolaris/tools/ctf/cvt/
H A Dctfmerge.c459 debug(2, "%d: entering p2 completion barrier\n",
733 strcompare(const void *p1, const void *p2) argument
736 char *s2 = *((char **)p2);
/freebsd-11-stable/contrib/binutils/ld/
H A Dldcref.c346 const struct cref_hash_entry * const *p2 = a2; local
348 return strcmp ((*p1)->demangled, (*p2)->demangled);
/freebsd-11-stable/sys/dev/hptmv/
H A Dhptintf.h991 #define hpt_rebuild_mirror(p1, p2, p3) hpt_rebuild_data_block(p1, p2, p3)
/freebsd-11-stable/usr.sbin/lpr/lpr/
H A Dlpr.c617 card(int c, const char *p2) argument
624 while ((c = *p2++) != '\0' && len < sizeof(buf)) {

Completed in 503 milliseconds

<<11121314151617