/* * Return the number of idal words needed for an address/length pair.
*/ staticinlineunsignedint idal_nr_words(void *vaddr, unsignedint length)
{ unsignedint cidaw;
/* * Return the number of 2K IDA words needed for an address/length pair.
*/ staticinlineunsignedint idal_2k_nr_words(void *vaddr, unsignedint length)
{ unsignedint cidaw;
/* * Create the list of idal words for an address/length pair.
*/ staticinline dma64_t *idal_create_words(dma64_t *idaws, void *vaddr, unsignedint length)
{
dma64_t paddr = virt_to_dma64(vaddr); unsignedint cidaw;
/* * Sets the address of the data in CCW. * If necessary it allocates an IDAL and sets the appropriate flags.
*/ staticinlineint set_normalized_cda(struct ccw1 *ccw, void *vaddr)
{ unsignedint nridaws;
dma64_t *idal;
/* * Allocate an idal buffer
*/ staticinlinestruct idal_buffer *idal_buffer_alloc(size_t size, int page_order)
{ int nr_chunks, nr_ptrs, i; struct idal_buffer *ib; void *vaddr;
nr_ptrs = (size + IDA_BLOCK_SIZE - 1) >> IDA_SIZE_SHIFT;
nr_chunks = (PAGE_SIZE << page_order) >> IDA_SIZE_SHIFT;
ib = kmalloc(struct_size(ib, data, nr_ptrs), GFP_DMA | GFP_KERNEL); if (!ib) return ERR_PTR(-ENOMEM);
ib->size = size;
ib->page_order = page_order; for (i = 0; i < nr_ptrs; i++) { if (i & (nr_chunks - 1)) {
ib->data[i] = dma64_add(ib->data[i - 1], IDA_BLOCK_SIZE); continue;
}
vaddr = (void *)__get_free_pages(GFP_KERNEL, page_order); if (!vaddr) goto error;
ib->data[i] = virt_to_dma64(vaddr);
} return ib;
error: while (i >= nr_chunks) {
i -= nr_chunks;
vaddr = dma64_to_virt(ib->data[i]);
free_pages((unsignedlong)vaddr, ib->page_order);
}
kfree(ib); return ERR_PTR(-ENOMEM);
}
/* * Free an idal buffer.
*/ staticinlinevoid idal_buffer_free(struct idal_buffer *ib)
{ int nr_chunks, nr_ptrs, i; void *vaddr;
nr_ptrs = (ib->size + IDA_BLOCK_SIZE - 1) >> IDA_SIZE_SHIFT;
nr_chunks = (PAGE_SIZE << ib->page_order) >> IDA_SIZE_SHIFT; for (i = 0; i < nr_ptrs; i += nr_chunks) {
vaddr = dma64_to_virt(ib->data[i]);
free_pages((unsignedlong)vaddr, ib->page_order);
}
kfree(ib);
}
/* * Test if a idal list is really needed.
*/ staticinlinebool __idal_buffer_is_needed(struct idal_buffer *ib)
{ if (ib->size > (PAGE_SIZE << ib->page_order)) returntrue; return idal_is_needed(dma64_to_virt(ib->data[0]), ib->size);
}
/* * Set channel data address to idal buffer.
*/ staticinlinevoid idal_buffer_set_cda(struct idal_buffer *ib, struct ccw1 *ccw)
{ void *vaddr;
if (__idal_buffer_is_needed(ib)) { /* Setup idals */
ccw->cda = virt_to_dma32(ib->data);
ccw->flags |= CCW_FLAG_IDA;
} else { /* * No idals needed - use direct addressing. Convert from * dma64_t to virt and then to dma32_t only because of type * checking. The physical address is known to be below 2GB.
*/
vaddr = dma64_to_virt(ib->data[0]);
ccw->cda = virt_to_dma32(vaddr);
}
ccw->count = ib->size;
}
/* * Copy count bytes from an idal buffer to user memory
*/ staticinline size_t idal_buffer_to_user(struct idal_buffer *ib, void __user *to, size_t count)
{
size_t left; void *vaddr; int i;
BUG_ON(count > ib->size); for (i = 0; count > IDA_BLOCK_SIZE; i++) {
vaddr = dma64_to_virt(ib->data[i]);
left = copy_to_user(to, vaddr, IDA_BLOCK_SIZE); if (left) return left + count - IDA_BLOCK_SIZE;
to = (void __user *)to + IDA_BLOCK_SIZE;
count -= IDA_BLOCK_SIZE;
}
vaddr = dma64_to_virt(ib->data[i]); return copy_to_user(to, vaddr, count);
}
/* * Copy count bytes from user memory to an idal buffer
*/ staticinline size_t idal_buffer_from_user(struct idal_buffer *ib, constvoid __user *from, size_t count)
{
size_t left; void *vaddr; int i;
BUG_ON(count > ib->size); for (i = 0; count > IDA_BLOCK_SIZE; i++) {
vaddr = dma64_to_virt(ib->data[i]);
left = copy_from_user(vaddr, from, IDA_BLOCK_SIZE); if (left) return left + count - IDA_BLOCK_SIZE;
from = (void __user *)from + IDA_BLOCK_SIZE;
count -= IDA_BLOCK_SIZE;
}
vaddr = dma64_to_virt(ib->data[i]); return copy_from_user(vaddr, from, count);
}
#endif
Messung V0.5
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.13Bemerkung:
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.