HomeSort by: relevance | last modified time | path
    Searched defs:bufq (Results 1 - 10 of 10) sorted by relevancy

  /src/sys/kern/
subr_bufq.c 77 #include <sys/bufq.h>
137 struct bufq_state *bufq; local
184 /* Try to autoload the bufq strategy module */
215 *bufqp = bufq = kmem_zalloc(sizeof(*bufq), KM_SLEEP);
216 bufq->bq_flags = flags;
217 bufq->bq_strat = bsp;
218 (*bsp->bs_initfn)(bufq);
225 bufq_put(struct bufq_state *bufq, struct buf *bp)
228 (*bufq->bq_put)(bufq, bp)
    [all...]
subr_bufq.c 77 #include <sys/bufq.h>
137 struct bufq_state *bufq; local
184 /* Try to autoload the bufq strategy module */
215 *bufqp = bufq = kmem_zalloc(sizeof(*bufq), KM_SLEEP);
216 bufq->bq_flags = flags;
217 bufq->bq_strat = bsp;
218 (*bsp->bs_initfn)(bufq);
225 bufq_put(struct bufq_state *bufq, struct buf *bp)
228 (*bufq->bq_put)(bufq, bp)
    [all...]
vfs_bio.c 1022 struct bqueue *bufq; local
1117 bufq = &bufqueues[BQ_AGE];
1118 binsheadfree(bp, bufq);
1130 bufq = &bufqueues[BQ_LOCKED];
1133 bufq = &bufqueues[BQ_LRU];
1136 bufq = &bufqueues[BQ_AGE];
1138 binstailfree(bp, bufq);
vfs_bio.c 1022 struct bqueue *bufq; local
1117 bufq = &bufqueues[BQ_AGE];
1118 binsheadfree(bp, bufq);
1130 bufq = &bufqueues[BQ_LOCKED];
1133 bufq = &bufqueues[BQ_LRU];
1136 bufq = &bufqueues[BQ_AGE];
1138 binstailfree(bp, bufq);
  /src/external/bsd/tmux/dist/compat/
imsg-buffer.c 1004 ibufq_init(struct ibufqueue *bufq)
1006 TAILQ_INIT(&bufq->bufs);
1007 bufq->queued = 0;
1013 struct ibufqueue *bufq; local
1015 if ((bufq = calloc(1, sizeof(*bufq))) == NULL)
1017 ibufq_init(bufq);
1018 return bufq;
1022 ibufq_free(struct ibufqueue *bufq)
1024 if (bufq == NULL
    [all...]
imsg-buffer.c 1004 ibufq_init(struct ibufqueue *bufq)
1006 TAILQ_INIT(&bufq->bufs);
1007 bufq->queued = 0;
1013 struct ibufqueue *bufq; local
1015 if ((bufq = calloc(1, sizeof(*bufq))) == NULL)
1017 ibufq_init(bufq);
1018 return bufq;
1022 ibufq_free(struct ibufqueue *bufq)
1024 if (bufq == NULL
    [all...]
  /src/sys/arch/atari/dev/
fd.c 54 #include <sys/bufq.h>
135 struct bufq_state *bufq; /* queue of buf's */ member in struct:fd_softc
514 bufq_alloc(&sc->bufq, "disksort", BUFQ_SORT_RAWBLOCK);
634 bufq_put(sc->bufq, bp); /* XXX disksort_cylinder */
690 bp = bufq_peek(sc->bufq);
727 bp = bufq_get(sc->bufq);
756 if (bufq_peek(sc1->bufq) != NULL)
997 bp = bufq_peek(sc->bufq);
fd.c 54 #include <sys/bufq.h>
135 struct bufq_state *bufq; /* queue of buf's */ member in struct:fd_softc
514 bufq_alloc(&sc->bufq, "disksort", BUFQ_SORT_RAWBLOCK);
634 bufq_put(sc->bufq, bp); /* XXX disksort_cylinder */
690 bp = bufq_peek(sc->bufq);
727 bp = bufq_get(sc->bufq);
756 if (bufq_peek(sc1->bufq) != NULL)
997 bp = bufq_peek(sc->bufq);
  /src/sys/arch/amiga/dev/
fd.c 44 #include <sys/bufq.h>
149 struct bufq_state *bufq;/* queue pending I/O operations */ member in struct:fd_softc
419 bufq_alloc(&sc->bufq, "disksort", BUFQ_SORT_CYLINDER);
694 bufq_put(sc->bufq, bp);
1194 if ((bp = bufq_peek(sc->bufq)) == NULL) {
1225 bp = bufq_get(sc->bufq);
1227 if (bufq_peek(sc->bufq) == NULL)
1234 bufq_put(sc->bufq, bp);
1309 bp = bufq_peek(sc->bufq);
1549 if ((bp = bufq_peek(sc->bufq)) == NULL
    [all...]
fd.c 44 #include <sys/bufq.h>
149 struct bufq_state *bufq;/* queue pending I/O operations */ member in struct:fd_softc
419 bufq_alloc(&sc->bufq, "disksort", BUFQ_SORT_CYLINDER);
694 bufq_put(sc->bufq, bp);
1194 if ((bp = bufq_peek(sc->bufq)) == NULL) {
1225 bp = bufq_get(sc->bufq);
1227 if (bufq_peek(sc->bufq) == NULL)
1234 bufq_put(sc->bufq, bp);
1309 bp = bufq_peek(sc->bufq);
1549 if ((bp = bufq_peek(sc->bufq)) == NULL
    [all...]

Completed in 49 milliseconds