| /src/games/hunt/huntd/ |
| shots.c | 72 BULLET *blist; local in function:moveshots
85 blist = Bullets;
87 for (bp = blist; bp != NULL; bp = next) {
132 blist = Bullets;
134 for (bp = blist; bp != NULL; bp = next) {
986 zapshot(BULLET *blist, BULLET *obp)
992 for (bp = blist; bp != NULL; bp = bp->b_next) {
1002 explshot(blist, obp->b_y, obp->b_x);
1010 explshot(BULLET *blist, int y, int x)
1014 for (bp = blist; bp != NULL; bp = bp->b_next
[all...] |
| /src/sbin/ldconfig/ |
| ldconfig.c | 376 struct hints_bucket *blist; local in function:buildhints
408 blist = (struct hints_bucket *)xmalloc(n);
409 memset(blist, 0, n);
412 blist[i].hi_next = -1;
420 bp = blist +
425 if (blist[i].hi_pathx == 0)
433 bp = &blist[bp->hi_next];
435 bp = blist + i;
472 if ((size_t)write(fd, blist, hdr.hh_nbucket * sizeof(struct hints_bucket)) !=
501 free(blist);
519 struct hints_bucket *blist; local in function:readhints
[all...] |
| /src/sys/kern/ |
| subr_blist.c | 30 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting
57 * Unlike the rlist code, the blist code wires all necessary memory at
60 * on an rlist_free() call. The non-blocking features of the blist code
62 * rlist code uses a little less overall memory than the blist code (but
63 * due to swap interleaving not all that much less), but the blist code
98 #include <sys/blist.h>
119 #include "../sys/blist.h"
137 struct blist { struct
174 * blist_create() - create a blist capable of handling up to the specified
179 * The smallest blist consists of a single leaf node capable of
[all...] |
| /src/usr.sbin/lpr/lpd/ |
| lpd.c | 124 char **blist; /* list of addresses to bind(2) to */ variable in typeref:typename:char **
167 newblist = realloc(blist,
171 blist = newblist;
174 blist[blist_addrs++] = strdup(optarg);
288 if (blist != NULL) {
290 free(blist[i]);
291 free(blist);
751 error = getaddrinfo((blist_addrs == 0) ? NULL : blist[blidx],
755 syslog(LOG_ERR, "%s: %s", blist[blidx],
|
