| /haiku-fatelf/src/bin/gdb/gdb/ |
| H A D | xcoffsolib.c | 47 for (vp = vp->nxt; vp; vp = vp->nxt)
73 if (vp == NULL || vp->nxt == NULL)
80 vp = vp->nxt;
85 for (; vp != NULL; vp = vp->nxt)
127 for (vp = vp->nxt; vp; vp = vp->nxt)
|
| H A D | xcoffsolib.h | 35 struct vmap *nxt; /* ptr to next in chain */ member in struct:vmap
|
| H A D | exec.c | 95 struct vmap *vp, *nxt; local
97 for (nxt = vmap; nxt != NULL;)
99 vp = nxt;
100 nxt = vp->nxt;
414 vp->nxt = 0;
424 for (vpp = &vmap; *vpp; vpp = &(*vpp)->nxt)
581 for (vp = vmap; vp; vp = vp->nxt)
|
| H A D | objfiles.h | 572 #define ALL_OBJFILES_SAFE(obj,nxt) \
574 (obj) != NULL? ((nxt)=(obj)->next,1) :0; \
575 (obj) = (nxt))
|
| H A D | rs6000-nat.c | 867 for (got_one = 0, vp = vmap; vp; vp = vp->nxt)
1228 for (vp = vmap; vp; vp = vp->nxt)
|
| /haiku-fatelf/src/bin/network/tcpdump/ |
| H A D | addrtoname.c | 87 struct hnamemem *nxt; member in struct:hnamemem
141 struct h6namemem *nxt; member in struct:h6namemem
234 for (; p->nxt; p = p->nxt) {
239 p->nxt = newhnamemem();
284 for (; p->nxt; p = p->nxt) {
289 p->nxt = newh6namemem();
547 for (tp = &eprototable[i & (HASHNAMESIZE-1)]; tp->nxt; tp = tp->nxt)
[all...] |
| H A D | print-tcp.c | 83 struct tcp_seq_hash *nxt; member in struct:tcp_seq_hash
386 th->nxt; th = th->nxt)
391 if (!th->nxt || (flags & TH_SYN)) {
393 if (th->nxt == NULL) {
394 th->nxt = (struct tcp_seq_hash *)
396 if (th->nxt == NULL)
747 u_int8_t nxt; local
773 nxt = 0;
774 MD5_Update(&ctx, (char *)&nxt, sizeo
[all...] |
| H A D | print-atalk.c | 533 struct hnamemem *nxt; member in struct:hnamemem
571 tp->nxt; tp = tp->nxt)
574 tp->nxt = newhnamemem();
580 for (tp = &hnametable[i & (HASHNAMESIZE-1)]; tp->nxt; tp = tp->nxt)
586 for (tp2 = &hnametable[i & (HASHNAMESIZE-1)]; tp2->nxt; tp2 = tp2->nxt)
589 tp->nxt = newhnamemem();
597 tp->nxt
[all...] |
| /haiku-fatelf/src/bin/zip/ |
| H A D | zipnote.c | 407 for (z = zfiles; z != NULL; z = z->nxt)
432 z = z->nxt; /* allow missing entries in order */
463 z = z->nxt; /* point to next entry */
487 for (z = zfiles; z != NULL; z = z->nxt) {
496 for (z = zfiles; z != NULL; z = z->nxt)
|
| H A D | zipcloak.c | 292 for (z = zfiles; z != NULL; z = z->nxt) {
336 for (z = zfiles; z != NULL; z = z->nxt) {
368 for (z = zfiles; z != NULL; z = z->nxt) {
|
| H A D | zip.c | 130 z = zfiles->nxt;
176 for (z = zfiles; z != NULL; z = z->nxt)
277 for (z = zfiles; z != NULL; z = z->nxt)
1622 for (z = zfiles; z != NULL; z = z->nxt) {
1761 for (z = zfiles; z != NULL; z = z->nxt)
1825 f = f->nxt;
2063 w = &z->nxt;
2078 v = z->nxt; /* delete entry from list */
2100 w = &z->nxt;
2114 z->nxt
[all...] |
| H A D | zipfile.c | 450 z->nxt = NULL;
451 x = &z->nxt;
752 z->nxt = NULL;
753 x = &z->nxt;
937 z = z->nxt;
1080 for (z = zfiles; z != NULL; z = z->nxt)
1440 for (z = zfiles; z != NULL; z = z->nxt)
1477 for (z = zfiles; z != NULL; z = z->nxt) {
|
| H A D | zip.h | 143 struct zlist far *nxt; /* Pointer to next header in list */ member in struct:zlist
151 struct flist far *nxt; /* Link to next name */ member in struct:flist
|
| H A D | fileio.c | 107 t = f->nxt;
241 for (j = 0, f = found; f != NULL; f = f->nxt)
507 f->nxt = NULL;
508 fnxt = &f->nxt;
|
| H A D | beos.c | 131 for (z = zfiles; z != NULL; z = z->nxt) {
|
| H A D | util.c | 772 for (z = zfiles; z != NULL; z = z->nxt)
|
| H A D | zipsplit.c | 582 for (j = 0, z = zfiles; j < zcount; j++, z = z->nxt)
|
| /haiku-fatelf/src/libs/ncurses/ncurses/tty/ |
| H A D | lib_mvcur.c | 566 int nxt, fr; local
568 for (fr = from_x; (nxt = NEXTTAB(fr)) <= to_x; fr = nxt) {
657 int nxt, fr; local
659 for (fr = from_x; (nxt = LASTTAB(fr)) >= to_x; fr = nxt) {
|
| /haiku-fatelf/src/add-ons/translators/exr/openexr/imath/ |
| H A D | ImathMatrixAlgo.h | 630 int nxt[3] = {1, 2, 0}; local
651 j = nxt[i];
652 k = nxt[j];
|
| /haiku-fatelf/src/libs/expat/lib/ |
| H A D | xmlparse.c | 4404 const char *nxt = (quant == XML_CQUANT_NONE local
4412 el = getElementType(parser, enc, s, nxt);
|