Searched refs:p1 (Results 1 - 25 of 111) sorted by relevance

12345

/osnet-11/usr/src/lib/libeti/panel/inc/
H A Dprivate.h45 #define _panels_intersect(p1, p2) (!((p1)->wstarty > (p2)->wendy || \
46 (p1)->wendy < (p2)->wstarty || \
47 (p1)->wstartx > (p2)->wendx || \
48 (p1)->wendx < (p2)->wstartx))
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/
H A Dstrcasecmp.c36 const unsigned char *p1 = (const unsigned char *) s1; local
40 if (p1 == p2)
45 c1 = TOLOWER (*p1);
51 ++p1;
H A Dstrncasecmp.c36 register const unsigned char *p1 = (const unsigned char *) s1; local
40 if (p1 == p2 || n == 0)
45 c1 = TOLOWER (*p1);
51 ++p1;
/osnet-11/usr/src/lib/cfgadm_plugins/ac/common/
H A Dmema_test_subr.c67 struct mtest_alloc_ent **p, *p1; local
73 p1 = *p;
75 free(p1->buf);
76 free((void *)p1);
82 struct mtest_alloc_ent *p1; local
84 while ((p1 = handle->alloc_list) != NULL) {
85 handle->alloc_list = p1->next;
86 free(p1->buf);
87 free((void *)p1);
/osnet-11/usr/src/lib/pam_modules/dial_auth/
H A Ddial_auth.c61 char *p1 = NULL, *p2 = NULL; local
104 while ((p1 = fgets(line, sizeof (line), fp)) != NULL) {
105 while (*p1 != '\n' && *p1 != ' ' && *p1 != '\t')
106 p1++;
107 *p1 = '\0';
122 if (p1 == NULL) {
130 while ((p1 = fgets(line, sizeof (line)-1, fp)) != NULL) {
131 while (*p1
[all...]
/osnet-11/usr/src/lib/libcurses/screen/
H A Dtrace.c84 char *p1 = string; local
90 while (*p1 = *p2++)
91 p1++;
/osnet-11/usr/src/lib/libresolv2/common/isc/
H A Dtree.c187 tree *p1, *p2, *sub; local
235 p1 = (*ppr)->left;
236 if (p1->bal == -1) { /*%< LL */
238 (*ppr)->left = p1->right;
239 p1->right = *ppr;
241 *ppr = p1;
245 p2 = p1->right;
246 p1->right = p2->left;
247 p2->left = p1;
258 p1
417 tree *p1, *p2; local
477 tree *p1, *p2; local
[all...]
/osnet-11/usr/src/lib/libc/port/i18n/
H A Dwmemcpy.c39 wchar_t *p1, *p2; local
48 p1 = ws1;
56 (void) memcpy((void *)p1,
59 p1 += len;
H A Dwsprintf.c56 char *p1 = (char *)wstring; local
61 if (vsprintf(p1, format, ap) == -1) {
66 len = strlen(p1) + 1;
74 (void) strcpy(p2, p1);
/osnet-11/usr/src/lib/libslp/clib/
H A Dslp_utf8.c125 char *p1, *p2; local
129 p1 = p2 = NULL; wcs1 = wcs2 = NULL;
136 p1 = slp_fold_space(s1);
138 if (!p1 || !p2)
141 if ((diff = strcasecmp(p1, p2)) == 0)
148 if ((wcslen1 = mbstowcs(NULL, p1, 0)) == (size_t)-1)
163 if (mbstowcs(wcs1, p1, wcslen1 + 1) == (size_t)-1)
171 if (p1) free(p1);
/osnet-11/usr/src/cmd/sendmail/db/btree/
H A Dbt_compare.c150 u_int8_t *p1, *p2; local
165 for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2)
166 if (*p1 != *p2)
167 return ((long)*p1 - (long)*p2);
182 u_int8_t *p1, *p2; local
186 for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt)
187 if (*p1 != *p2)
/osnet-11/usr/src/lib/libgen/common/
H A Dreg_step.c160 step(char *p1, char *p2) argument
169 start = p1;
171 loc1 = p1;
172 ret = _advance(p1, p2);
180 if (*p1 != c)
182 if (_advance(p1, p2)) {
183 loc1 = p1;
187 } while (*p1++);
190 if (_advance(p1, p2)) {
191 loc1 = p1;
533 char *p1, *p2; local
560 char *p1, *p2; local
[all...]
/osnet-11/usr/src/lib/libsqlite/src/
H A Dfunc.c106 int p1, p2, len; local
110 p1 = atoi(argv[1]?argv[1]:0);
117 if( p1<0 ){
118 p1 += len;
119 if( p1<0 ){
120 p2 += p1;
121 p1 = 0;
123 }else if( p1>0 ){
124 p1--;
126 if( p1
[all...]
H A Dvdbe.h41 int p1; /* First operand */ member in struct:VdbeOp
58 signed char p1; /* First operand */ member in struct:VdbeOpList
/osnet-11/usr/src/lib/libeti/form/common/
H A Dregex.c86 char *p1, *p2; local
96 if (((p1 = __braslist[in]) != 0) && (__bravar[in] >= 0)) {
98 while (p1 < __braelist[in]) *p2++ = *p1++;
111 char *p1, *p2, c; local
114 p1 = addrl;
119 __loc1 = p1;
120 return ((i = __advance(p1, ++p2)) ? i : (intptr_t)addrl);
126 if (*p1 != c)
130 if (i = __advance(p1, p
[all...]
/osnet-11/usr/src/lib/libcmd/common/
H A Dcmp.c153 register unsigned char* p1 = 0; local
165 if ((c1 = e1 - p1) <= 0)
169 if (!(p1 = (unsigned char*)sfreserve(f1, SF_UNBOUND, 0)) || (c1 = sfvalue(f1)) <= 0)
189 e1 = p1 + c1;
211 if (memcmp(p1, p2, c1))
213 p1 += c1;
218 last = p1 + c1;
219 while (p1 < last)
221 if ((c1 = *p1++) != *p2++)
231 sfprintf(sfstdout, "%s %s differ: char %I*d, line %I*u\n", file1, file2, sizeof(pos), pos - (last - p1), sizeo
[all...]
/osnet-11/usr/src/grub/grub-0.97/docs/
H A Dkernel.c177 char *p1, *p2; local
204 p1 = buf;
206 while (p1 < p2)
208 char tmp = *p1;
209 *p1 = *p2;
211 p1++;
H A Dkernel.c.texi177 char *p1, *p2;
204 p1 = buf;
206 while (p1 < p2)
208 char tmp = *p1;
209 *p1 = *p2;
211 p1++;
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbt_utils.c220 register u_char *p1, *p2; local
229 for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2)
230 if (*p1 != *p2)
231 return ((int)*p1 - (int)*p2);
249 register u_char *p1, *p2; local
254 for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt)
255 if (*p1 != *p2)
/osnet-11/usr/src/lib/libcmdutils/common/
H A Davltree.c71 * const void *p1 (pointer to the 1st node to compare and
127 * id, then on the inode number. Return -1 when p1 < p2,
128 * 0 when p1 == p2, and 1 when p1 > p2. This function is invoked
129 * by avl_find. p1 is always the node we are trying to insert or
133 tnode_compare(const void *p1, const void *p2) argument
135 tree_node_t *n1 = (tree_node_t *)p1;
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Dprinc_comp.c116 const krb5_data *p1 = krb5_princ_component(context, princ1, i); local
122 eq = (krb5int_utf8_normcmp(p1, p2, KRB5_UTF8_CASEFOLD) == 0);
124 eq = (p1->length == p2->length
125 && strncasecmp(p1->data, p2->data, p2->length) == 0);
127 eq = data_eq(*p1, *p2);
/osnet-11/usr/src/lib/libc/port/gen/
H A Dregexpr.c273 re_exec(const char *p1) argument
288 return ((advance(p1, p2)));
295 if (*p1 != c)
297 if (rv = advance(p1, p2))
299 } while (*p1++);
306 if (rv = advance(p1, p2))
308 } while (*p1++);
/osnet-11/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c97 add_op(struct Sequence *seq, int op, int p1, int p2) argument
100 *(seq->end++) = p1;
106 /* No parameters, total is cost * p1. */
107 seq->cost += cur_term->_move[op]._cost * p1;
329 long p1, p2; local
337 p1 = *ptr++;
341 while (0 < p1--)
345 (void) TPUTS(tparm(cur_term->_move[op]._seq, p1, p2,
430 * Initialize an entry in cur_term->_move[] with parameters p1 and p2.
434 cost(char *cap, int index, int p1, in argument
[all...]
/osnet-11/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dtparm.c124 tparm(string, p1, p2, p3, p4, p5, p6, p7, p8, p9)
126 long p1, p2, p3, p4, p5, p6, p7, p8, p9;
153 parm[0] = p1;
H A Dmvcur.c94 add_op(seq, op, p1, p2)
96 int op, p1, p2;
99 *(seq->end++) = p1;
105 /* No parameters, total is cost * p1. */
106 seq->cost += cur_term->_move[op]._cost * p1;
333 long p1, p2; local
341 p1 = *ptr++;
345 while (0 < p1--)
352 cur_term->_move[op]._seq, p1, p2,
443 * Initialize an entry in cur_term->_move[] with parameters p1 an
[all...]

Completed in 241 milliseconds

12345