Lines Matching refs:bsq
860 int bsq_audit(int where, struct host_bsq* bsq, int scheme, int magn)
865 buffer = bsq->freebuf;
892 if (count != bsq->freebuf_count) {
894 where, scheme, magn, count, bsq->freebuf_count);
906 struct host_bsq* bsq;
913 bsq = &fore200e->host_bsq[ scheme ][ magn ];
916 bsq_audit(1, bsq, scheme, magn);
918 while (bsq->freebuf_count >= RBD_BLK_SIZE) {
921 RBD_BLK_SIZE, scheme, magn, bsq->freebuf_count);
923 entry = &bsq->host_entry[ bsq->head ];
928 buffer = bsq->freebuf;
931 scheme, magn, bsq->freebuf_count);
934 bsq->freebuf = buffer->next;
946 FORE200E_NEXT_ENTRY(bsq->head, QUEUE_SIZE_BS);
949 bsq->freebuf_count -= RBD_BLK_SIZE;
1054 struct host_bsq* bsq;
1063 bsq = &fore200e->host_bsq[ buffer->scheme ][ buffer->magn ];
1066 bsq_audit(2, bsq, buffer->scheme, buffer->magn);
1075 buffer->next = bsq->freebuf;
1076 bsq->freebuf = buffer;
1079 bsq->freebuf_count++;
1986 struct host_bsq* bsq;
1992 bsq = &fore200e->host_bsq[ scheme ][ magn ];
2000 buffer = bsq->buffer = kcalloc(nbr, sizeof(struct buffer),
2006 bsq->freebuf = NULL;
2030 buffer[ i ].next = bsq->freebuf;
2031 bsq->freebuf = &buffer[ i ];
2034 bsq->freebuf_count = nbr;
2037 bsq_audit(3, bsq, scheme, magn);
2051 struct host_bsq* bsq;
2059 bsq = &fore200e->host_bsq[ scheme ][ magn ];
2063 &bsq->status,
2072 &bsq->rbd_block,
2077 fore200e_dma_chunk_free(fore200e, &bsq->status);
2088 bsq->host_entry[ i ].status =
2089 FORE200E_INDEX(bsq->status.align_addr, enum status, i);
2090 bsq->host_entry[ i ].rbd_block =
2091 FORE200E_INDEX(bsq->rbd_block.align_addr, struct rbd_block, i);
2092 bsq->host_entry[ i ].rbd_block_dma =
2093 FORE200E_DMA_INDEX(bsq->rbd_block.dma_addr, struct rbd_block, i);
2094 bsq->host_entry[ i ].cp_entry = &cp_entry[ i ];
2096 *bsq->host_entry[ i ].status = STATUS_FREE;
2098 fore200e->bus->write(FORE200E_DMA_INDEX(bsq->status.dma_addr, enum status, i),