HomeSort by: relevance | last modified time | path
    Searched refs:blist (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/sys/
blist.h 1 /* $NetBSD: blist.h,v 1.8 2013/12/09 09:35:17 wiz Exp $ */
34 * blist = blist_create(blocks)
35 * (void) blist_destroy(blist)
36 * blkno = blist_alloc(blist, count)
37 * (void) blist_free(blist, blkno, count)
38 * nblks = blist_fill(blist, blkno, count)
39 * (void) blist_resize(&blist, count, freeextra)
49 * capable of managing up to (2^31) blocks per blist, though
54 * $FreeBSD: src/sys/sys/blist.h,v 1.9 2005/01/07 02:29:23 imp Exp $
75 typedef struct blist *blist_t
    [all...]
  /src/sbin/ldconfig/
ldconfig.c 376 struct hints_bucket *blist; local
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
    [all...]
  /src/usr.sbin/lpr/lpd/
lpd.c 124 char **blist; /* list of addresses to bind(2) to */ variable
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],
  /src/games/hunt/huntd/
shots.c 72 BULLET *blist; local
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/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/sys/uvm/
uvm_swap.c 55 #include <sys/blist.h>
143 blist_t swd_blist; /* blist for this swapdev */
1834 /* XXXMRG: ugh! blist should support this for us */

Completed in 29 milliseconds