| /src/sys/kern/ |
| bufq_disksort.c | 110 int sortby; local in function:bufq_disksort_put
112 sortby = bufq->bq_flags & BUFQ_SORT_MASK;
128 if (buf_inorder(bp, bq, sortby)) {
135 if (buf_inorder(nbq, bq, sortby)) {
143 if (buf_inorder(bp, nbq, sortby))
169 if (buf_inorder(nbq, bq, sortby) ||
170 buf_inorder(bp, nbq, sortby))
|
| bufq_readprio.c | 113 int sortby; local in function:bufq_prio_put
115 sortby = bufq->bq_flags & BUFQ_SORT_MASK;
139 if (buf_inorder(prio->bq_write_next, bp, sortby))
146 while (bq != NULL && buf_inorder(bq, bp, sortby))
|
| bufq_disksort.c | 110 int sortby; local in function:bufq_disksort_put
112 sortby = bufq->bq_flags & BUFQ_SORT_MASK;
128 if (buf_inorder(bp, bq, sortby)) {
135 if (buf_inorder(nbq, bq, sortby)) {
143 if (buf_inorder(bp, nbq, sortby))
169 if (buf_inorder(nbq, bq, sortby) ||
170 buf_inorder(bp, nbq, sortby))
|
| bufq_readprio.c | 113 int sortby; local in function:bufq_prio_put
115 sortby = bufq->bq_flags & BUFQ_SORT_MASK;
139 if (buf_inorder(prio->bq_write_next, bp, sortby))
146 while (bq != NULL && buf_inorder(bq, bp, sortby))
|
| bufq_disksort.c | 110 int sortby; local in function:bufq_disksort_put
112 sortby = bufq->bq_flags & BUFQ_SORT_MASK;
128 if (buf_inorder(bp, bq, sortby)) {
135 if (buf_inorder(nbq, bq, sortby)) {
143 if (buf_inorder(bp, nbq, sortby))
169 if (buf_inorder(nbq, bq, sortby) ||
170 buf_inorder(bp, nbq, sortby))
|
| bufq_readprio.c | 113 int sortby; local in function:bufq_prio_put
115 sortby = bufq->bq_flags & BUFQ_SORT_MASK;
139 if (buf_inorder(prio->bq_write_next, bp, sortby))
146 while (bq != NULL && buf_inorder(bq, bp, sortby))
|
| bufq_priocscan.c | 62 buf_cmp(const struct buf *b1, const struct buf *b2, int sortby)
65 if (buf_inorder(b2, b1, sortby)) {
68 if (buf_inorder(b1, b2, sortby)) {
81 const int sortby = q->cq_sortby; local in function:cscan_tree_compare_nodes
82 const int diff = buf_cmp(b1, b2, sortby);
116 const int sortby = q->cq_sortby; local in function:cscan_tree_compare_key
118 return buf_cmp(b1, b2, sortby);
124 const int sortby = cq->cq_sortby; local in function:cscan_dump
128 if (sortby == BUFQ_SORT_RAWBLOCK) {
188 cscan_init(struct cscan_queue *q, int sortby)
430 const int sortby = bufq->bq_flags & BUFQ_SORT_MASK; local in function:bufq_priocscan_init
[all...] |
| bufq_priocscan.c | 62 buf_cmp(const struct buf *b1, const struct buf *b2, int sortby)
65 if (buf_inorder(b2, b1, sortby)) {
68 if (buf_inorder(b1, b2, sortby)) {
81 const int sortby = q->cq_sortby; local in function:cscan_tree_compare_nodes
82 const int diff = buf_cmp(b1, b2, sortby);
116 const int sortby = q->cq_sortby; local in function:cscan_tree_compare_key
118 return buf_cmp(b1, b2, sortby);
124 const int sortby = cq->cq_sortby; local in function:cscan_dump
128 if (sortby == BUFQ_SORT_RAWBLOCK) {
188 cscan_init(struct cscan_queue *q, int sortby)
430 const int sortby = bufq->bq_flags & BUFQ_SORT_MASK; local in function:bufq_priocscan_init
[all...] |
| bufq_priocscan.c | 62 buf_cmp(const struct buf *b1, const struct buf *b2, int sortby)
65 if (buf_inorder(b2, b1, sortby)) {
68 if (buf_inorder(b1, b2, sortby)) {
81 const int sortby = q->cq_sortby; local in function:cscan_tree_compare_nodes
82 const int diff = buf_cmp(b1, b2, sortby);
116 const int sortby = q->cq_sortby; local in function:cscan_tree_compare_key
118 return buf_cmp(b1, b2, sortby);
124 const int sortby = cq->cq_sortby; local in function:cscan_dump
128 if (sortby == BUFQ_SORT_RAWBLOCK) {
188 cscan_init(struct cscan_queue *q, int sortby)
430 const int sortby = bufq->bq_flags & BUFQ_SORT_MASK; local in function:bufq_priocscan_init
[all...] |
