Home
last modified time | relevance | path

Searched refs:tp2 (Results 1 – 6 of 6) sorted by relevance

/mirbsd/src/lib/libc/stdlib/
Dmerge.c98 u_char *f1, *f2, *t, *b, *tp2, *q, *l1, *l2; in mergesort() local
124 for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) { in mergesort()
182 ICOPY_LIST(f2, tp2, b); in mergesort()
183 ICOPY_ELT(f1, tp2, i); in mergesort()
185 CCOPY_LIST(f2, tp2, b); in mergesort()
186 CCOPY_ELT(f1, tp2, i); in mergesort()
190 ICOPY_LIST(f1, tp2, b); in mergesort()
191 ICOPY_ELT(f2, tp2, i); in mergesort()
193 CCOPY_LIST(f1, tp2, b); in mergesort()
194 CCOPY_ELT(f2, tp2, i); in mergesort()
[all …]
/mirbsd/src/usr.bin/xlint/lint2/
Dchk.c344 type_t *tp1, *tp2; in chkvtui() local
359 tp2 = TP(call->f_type)->t_subt; in chkvtui()
360 eq = eqtype(tp1, tp2, 1, 0, 0, (warn = 0, &warn)); in chkvtui()
404 type_t *tp1, *tp2; in chkvtdi() local
418 tp2 = TP(sym->s_type); in chkvtdi()
420 if (tp1->t_tspec == FUNC && tp2->t_tspec == FUNC) { in chkvtdi()
421 eq = eqtype(tp1->t_subt, tp2->t_subt, 1, 0, 0, &warn); in chkvtdi()
423 eq = eqtype(tp1, tp2, 0, 0, 0, &warn); in chkvtdi()
442 type_t *tp1, *tp2, **ap1, **ap2; in chkfaui() local
479 if ((tp2 = TP(call->f_type))->t_tspec != FUNC) in chkfaui()
[all …]
/mirbsd/src/usr.bin/ftp/
Dcmds.c335 char *cp, *tp2, tmpbuf[MAXPATHLEN]; in mput() local
350 tp2 = tmpbuf; in mput()
351 while ((*tp2 = *tp) != '\0') { in mput()
352 if (isupper(*tp2)) { in mput()
353 *tp2 = in mput()
354 tolower(*tp2); in mput()
357 tp2++; in mput()
481 char *tp = argv[1], *tp2, tmpbuf[MAXPATHLEN]; in getit() local
488 tp2 = tmpbuf; in getit()
489 while ((*tp2 = *tp) != '\0') { in getit()
[all …]
/mirbsd/src/usr.bin/xlint/lint1/
Ddecl.c2070 eqtype(type_t *tp1, type_t *tp2, int ignqual, int promot, int *warn) in eqtype() argument
2074 while (tp1 != NULL && tp2 != NULL) { in eqtype()
2097 if (t != tp2->t_tspec) in eqtype()
2100 if (tp1->t_const != tp2->t_const && !ignqual) in eqtype()
2103 if (tp1->t_volatile != tp2->t_volatile && !ignqual) in eqtype()
2106 if (tp1->t_restrict != tp2->t_restrict && !ignqual) in eqtype()
2110 return (tp1->t_str == tp2->t_str); in eqtype()
2112 if (t == ARRAY && tp1->t_dim != tp2->t_dim) { in eqtype()
2113 if (tp1->t_dim != 0 && tp2->t_dim != 0) in eqtype()
2119 if (tp1->t_proto && tp2->t_proto) { in eqtype()
[all …]
Dtree.c228 type_t *tp2; in incref() local
230 tp2 = getblk(sizeof (type_t)); in incref()
231 tp2->t_tspec = t; in incref()
232 tp2->t_subt = tp; in incref()
233 return (tp2); in incref()
242 type_t *tp2; in tincref() local
244 tp2 = tgetblk(sizeof (type_t)); in tincref()
245 tp2->t_tspec = t; in tincref()
246 tp2->t_subt = tp; in tincref()
247 return (tp2); in tincref()
[all …]
/mirbsd/src/gnu/usr.bin/perl/
Dpp_sort.c398 register gptr *l1, *l2, *tp2; in S_mergesortsv() local
401 p = tp2 = list2 + offset; /* where merged run will go */ in S_mergesortsv()
478 FROMTOUPTO(f2, tp2, t); in S_mergesortsv()
479 *tp2++ = *f1++; in S_mergesortsv()
481 FROMTOUPTO(f1, tp2, t); in S_mergesortsv()
482 *tp2++ = *f2++; in S_mergesortsv()
489 if (f2 < l2) FROMTOUPTO(f2, tp2, l2); in S_mergesortsv()
490 } else FROMTOUPTO(f1, tp2, l1); in S_mergesortsv()
491 p1 = NEXT(p1) = POTHER(tp2, list2, list1); in S_mergesortsv()