Searched defs:p2 (Results 1 - 25 of 246) sorted by relevance

12345678910

/illumos-gate/usr/src/cmd/eqn/
H A Dsqrt.c20 sqrt(int p2) argument
25 nps = EFFPS(((eht[p2]*9)/10+(resolution/POINT-1))/(resolution/POINT));
27 yyval = p2;
32 yyval, p2, ebase[yyval], eht[yyval]);
36 nrwid(p2, ps, p2);
39 "(rn'\\v'.2m'\\s%d", yyval, ebase[p2], nps, p2, ps);
40 printf("\\v'%du'\\h'-\\n(%du'\\*(%d\n", -ebase[p2], p2, p
[all...]
H A Deqnbox.c20 eqnbox(int p1, int p2, int lu) argument
26 b = max(ebase[p1], ebase[p2]);
27 eht[yyval] = h = b + max(eht[p1]-ebase[p1], eht[p2]-ebase[p2]);
31 yyval, p1, p2, b, h);
32 if (rfont[p1] == ITAL && lfont[p2] == ROM)
40 printf(".as %d \"%s\\*(%d\n", yyval, sh, p2);
41 rfont[p1] = rfont[p2];
42 ofree(p2);
H A Dintegral.c21 integral(int p, int p1, int p2) argument
26 if (p2 != 0)
27 printf(".ds %d \\v'-0.3m'\\*(%d\\v'0.3m'\n", p2, p2);
29 if (p1 != 0 && p2 != 0)
30 shift2(p, p1, p2);
33 else if (p2 != 0)
34 bshiftb(p, SUP, p2);
H A Dover.c20 boverb(int p1, int p2) argument
28 h = eht[p1] + eht[p2] + d;
31 h = eht[p1] + eht[p2];
33 b = eht[p2] - d;
36 yyval, p1, p2, b, h);
38 nrwid(p2, ps, p2);
40 printf(".if \\n(%d>\\n(%d .nr %d \\n(%d\n", p2, treg, treg, p2);
45 yyval, eht[p2]
[all...]
H A Dfont.c41 font(int p1, int p2) argument
44 yyval = p2;
48 "rf=%c\n", yyval, ft, p2, p1, ebase[yyval], eht[yyval],
50 printf(".ds %d \\f%c\\*(%d\\f%c\n", yyval, ft, p2, p1);
H A Dfromto.c20 fromto(int p1, int p2, int p3) argument
32 if (p2 > 0) {
33 nrwid(p2, pss, p2);
35 p2, yyval, yyval, p2);
36 eht[yyval] += eht[p2];
37 b = eht[p2];
46 if (p2 > 0) {
48 eht[p2]
[all...]
H A Dsize.c32 size(int p1, int p2) argument
38 yyval = p2;
41 yyval, ps, p2, p1, ebase[yyval], eht[yyval]);
44 printf(".ds %d \\s%d\\*(%d\\s%d\n", yyval, effps, p2, effp1);
H A Dpile.c20 lpile(int type, int p1, int p2) argument
30 nlist = p2 - p1;
34 for (i = p1; i < p2; i++)
38 for (i = p2-1; i > mid; i--)
49 for (i = p1; i < p2; i++)
55 for (i = p1+1; i < p2; i++) {
62 for (i = p2-1; i >= p1; i--) {
86 for (i = p1; i < p2; i++)
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dnl_strncmp.c42 register char *p1, *p2; local
45 p2 = ns2;
49 *p2++ = *s2++;
51 *p1 = *p2 = '\0';
/illumos-gate/usr/src/ucbcmd/basename/
H A Dbasename.c24 char *p1, *p2, *p3; local
31 p2 = p1;
34 p2 = p1;
42 if (p1 <= p2 || *--p3 != *--p1)
48 (void) fputs(p2, stdout);
/illumos-gate/usr/src/boot/lib/libc/string/
H A Dbcmp.c44 char *p1, *p2; local
49 p2 = (char *)b2;
51 if (*p1++ != *p2++)
H A Dmemcmp.c48 const unsigned char *p1 = s1, *p2 = s2; local
51 if (*p1++ != *p2++)
52 return (*--p1 - *--p2);
/illumos-gate/usr/src/lib/libcurses/screen/
H A Dtrace.c85 char *p2; local
89 p2 = unctrl(c);
90 while (*p1 = *p2++)
/illumos-gate/usr/src/lib/libc/port/i18n/
H A Dwmemcpy.c39 wchar_t *p1, *p2; local
49 p2 = (wchar_t *)ws2;
57 (const void *)p2, len * sizeof (wchar_t));
60 p2 += len;
H A Dwsprintf.c53 char *p2; local
68 p2 = malloc(len);
69 if (p2 == NULL)
73 p2 = tempstring;
74 (void) strcpy(p2, p1);
76 if (mbstowcs(wstring, p2, len) == (size_t)-1) {
78 if ((retcode = mbtowc(wstring, p2, MB_CUR_MAX)) == -1) {
79 *wstring = (wchar_t)*p2 & 0xff;
80 p2++;
82 p2
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/krb/
H A Dprinc_comp.c67 register const krb5_data *p2 = krb5_princ_component(context, princ2, i); local
68 if (p1->length != p2->length ||
69 memcmp(p1->data, p2->data, p1->length))
96 register const krb5_data *p2 = krb5_princ_component(context, princ2, i); local
97 if (p1->length != p2->length ||
98 strncasecmp(p1->data, p2->data, p1->length))
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dvdbe.h42 int p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOp
59 short int p2; /* Second parameter (often the jump destination) */ member in struct:VdbeOpList
73 ** The following macro converts a relative address in the p2 field
/illumos-gate/usr/src/lib/libcmdutils/common/
H A Davltree.c74 * const void *p2 (pointer to the 2nd 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
133 tnode_compare(const void *p1, const void *p2) argument
136 tree_node_t *n2 = (tree_node_t *)p2;
/illumos-gate/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)
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbt_utils.c222 register u_char *p1, *p2; local
231 for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2)
232 if (*p1 != *p2)
233 return ((int)*p1 - (int)*p2);
251 register u_char *p1, *p2; local
256 for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt)
257 if (*p1 != *p2)
/illumos-gate/usr/src/cmd/lp/cmd/lpsched/
H A Drstatus.c130 rsort (RSTATUS **p1, RSTATUS **p2) argument
139 if ((*p2)->request->outcome & RS_IMMEDIATE)
140 if (later(*p1, *p2))
147 else if ((*p2)->request->outcome & RS_IMMEDIATE)
157 else if ((*p1)->request->priority == (*p2)->request->priority)
158 if (!later(*p1, *p2))
164 return ((*p1)->request->priority - (*p2)->request->priority);
/illumos-gate/usr/src/lib/libslp/clib/
H A Dslp_utf8.c125 char *p1, *p2; local
129 p1 = p2 = NULL; wcs1 = wcs2 = NULL;
137 p2 = slp_fold_space(s2);
138 if (!p1 || !p2)
141 if ((diff = strcasecmp(p1, p2)) == 0)
156 if ((wcslen2 = mbstowcs(NULL, p2, 0)) == (size_t)-1)
165 if (mbstowcs(wcs2, p2, wcslen2 + 1) == (size_t)-1)
172 if (p2) free(p2);
/illumos-gate/usr/src/lib/libm/common/R/
H A Dexpf.c42 * exp(x) = 1 + x + p1*x^2 + p2*x^3
337 #define p2 F[3] macro
355 return (one + (xf + (xf * xf) * (p1 + xf * p2)));
/illumos-gate/usr/src/lib/libmvec/common/vis/
H A D__vatan2.S39 .word 0x3fc99999,0x997a1559 ! p2
119 #define p2 %f58 define
138 ldd [%o0+0x18],p2
417 fmuld %f36,p2,%f2
462 fmuld %f38,p2,%f12
511 fmuld %f40,p2,%f22
/illumos-gate/usr/src/cmd/ipf/lib/common/
H A Dvar.c85 char c, *s, *p1, *p2, *p3, *newstring, *value; local
110 p2 = expand_string(value, line);
111 if (p2 == NULL)
114 len = strlen(newstring) + strlen(p2);
126 strcat(p1, p2);

Completed in 159 milliseconds

12345678910