Lines Matching refs:buf_count
377 if (entry->buf_count) {
378 for (i = 0; i < entry->buf_count; i++) {
386 entry->buf_count *
389 entry->buf_count = 0;
443 if (entry->buf_count) {
457 while (entry->buf_count < count) {
458 buf = &entry->buflist[entry->buf_count];
459 buf->idx = dma->buf_count + entry->buf_count;
475 entry->buf_count = count;
481 entry->buf_count++;
486 (dma->buf_count + entry->buf_count) * sizeof (*dma->buflist),
497 dma->buf_count * sizeof (*dma->buflist));
498 kmem_free(dma->buflist, dma->buf_count * sizeof (*dma->buflist));
501 for (i = 0; i < entry->buf_count; i++) {
502 dma->buflist[i + dma->buf_count] = &entry->buflist[i];
505 dma->buf_count += entry->buf_count;
510 request->count = entry->buf_count;
557 while (entry->buf_count < count) {
558 buf = &entry->buflist[entry->buf_count];
559 buf->idx = dma->buf_count + entry->buf_count;
576 entry->buf_count = count;
582 entry->buf_count++;
587 dma->buf_count * sizeof (*dma->buflist),
588 (dma->buf_count + entry->buf_count)
596 for (i = 0; i < entry->buf_count; i++) {
597 dma->buflist[i + dma->buf_count] = &entry->buflist[i];
600 dma->buf_count += entry->buf_count;
602 request->count = entry->buf_count;
633 if (dev->dma->bufs[order].buf_count != 0) {
670 if (dev->dma->bufs[order].buf_count != 0) {
757 if (idx < 0 || idx >= dma->buf_count) {
759 idx, dma->buf_count - 1);
824 if (request.count < dma->buf_count)
849 for (i = 0; i < dma->buf_count; i++) {
874 for (i = 0; i < dma->buf_count; i++) {
899 request32.count = dma->buf_count;
905 request.count = dma->buf_count;