/* * For slave DMA we assume, that there is a finite number of DMA slaves in the * system, and that each such slave can only use a finite number of channels. * We use slave channel IDs to make sure, that no such slave channel ID is * allocated more than once.
*/ staticunsignedint slave_num = 256;
module_param(slave_num, uint, 0444);
/* A bitmask with slave_num bits */ staticunsignedlong *shdma_slave_used;
/* Mark all chunks of this descriptor as submitted, move to the queue */
list_for_each_entry_safe(chunk, c, desc->node.prev, node) { /* * All chunks are on the global ld_free, so, we have to find * the end of the chain ourselves
*/ if (chunk != desc && (chunk->mark == DESC_IDLE ||
chunk->async_tx.cookie > 0 ||
chunk->async_tx.cookie == -EBUSY ||
&chunk->node == &schan->ld_free)) break;
chunk->mark = DESC_SUBMITTED; if (chunk->chunks == 1) {
chunk->async_tx.callback = callback;
chunk->async_tx.callback_param = tx->callback_param;
} else { /* Callback goes to the last chunk */
chunk->async_tx.callback = NULL;
}
chunk->cookie = cookie;
list_move_tail(&chunk->node, &schan->ld_queue);
dev_dbg(schan->dev, "submit #%d@%p on %d\n",
tx->cookie, &chunk->async_tx, schan->id);
}
if (power_up) { int ret;
schan->pm_state = SHDMA_PM_BUSY;
ret = pm_runtime_get(schan->dev);
spin_unlock_irq(&schan->chan_lock); if (ret < 0)
dev_err(schan->dev, "%s(): GET = %d\n", __func__, ret);
pm_runtime_barrier(schan->dev);
spin_lock_irq(&schan->chan_lock);
/* Have we been reset, while waiting? */ if (schan->pm_state != SHDMA_PM_ESTABLISHED) { struct shdma_dev *sdev =
to_shdma_dev(schan->dma_chan.device); conststruct shdma_ops *ops = sdev->ops;
dev_dbg(schan->dev, "Bring up channel %d\n",
schan->id);
ret = ops->setup_xfer(schan, schan->slave_id); if (ret < 0) {
dev_err(schan->dev, "setup_xfer failed: %d\n", ret);
/* Remove chunks from the queue and mark them as idle */
list_for_each_entry_safe(chunk, c, &schan->ld_queue, node) { if (chunk->cookie == cookie) {
chunk->mark = DESC_IDLE;
list_move(&chunk->node, &schan->ld_free);
}
}
schan->pm_state = SHDMA_PM_ESTABLISHED;
ret = pm_runtime_put(schan->dev);
spin_unlock_irq(&schan->chan_lock); return ret;
}
if (schan->pm_state == SHDMA_PM_PENDING)
shdma_chan_xfer_ld_queue(schan);
schan->pm_state = SHDMA_PM_ESTABLISHED;
}
} else { /* * Tell .device_issue_pending() not to run the queue, interrupts * will do it anyway
*/
schan->pm_state = SHDMA_PM_PENDING;
}
spin_unlock_irq(&schan->chan_lock);
return cookie;
}
/* Called with desc_lock held */ staticstruct shdma_desc *shdma_get_desc(struct shdma_chan *schan)
{ struct shdma_desc *sdesc;
if (schan->dev->of_node) {
match = schan->hw_req;
ret = ops->set_slave(schan, match, slave_addr, true); if (ret < 0) return ret;
} else {
match = schan->real_slave_id;
}
if (schan->real_slave_id < 0 || schan->real_slave_id >= slave_num) return -EINVAL;
if (test_and_set_bit(schan->real_slave_id, shdma_slave_used)) return -EBUSY;
ret = ops->set_slave(schan, match, slave_addr, false); if (ret < 0) {
clear_bit(schan->real_slave_id, shdma_slave_used); return ret;
}
/* * This relies on the guarantee from dmaengine that alloc_chan_resources * never runs concurrently with itself or free_chan_resources.
*/ if (slave) { /* Legacy mode: .private is set in filter */
schan->real_slave_id = slave->slave_id;
ret = shdma_setup_slave(schan, 0); if (ret < 0) goto esetslave;
} else { /* Normal mode: real_slave_id was set by filter */
schan->slave_id = -EINVAL;
}
schan->desc = kcalloc(NR_DESCS_PER_CHANNEL,
sdev->desc_size, GFP_KERNEL); if (!schan->desc) {
ret = -ENOMEM; goto edescalloc;
}
schan->desc_num = NR_DESCS_PER_CHANNEL;
for (i = 0; i < NR_DESCS_PER_CHANNEL; i++) {
desc = ops->embedded_desc(schan->desc, i);
dma_async_tx_descriptor_init(&desc->async_tx,
&schan->dma_chan);
desc->async_tx.tx_submit = shdma_tx_submit;
desc->mark = DESC_IDLE;
/* * This is the standard shdma filter function to be used as a replacement to the * "old" method, using the .private pointer. * You always have to pass a valid slave id as the argument, old drivers that * pass ERR_PTR(-EINVAL) as a filter parameter and set it up in dma_slave_config * need to be updated so we can remove the slave_id field from dma_slave_config. * parameter. If this filter is used, the slave driver, after calling * dma_request_channel(), will also have to call dmaengine_slave_config() with * .direction, and either .src_addr or .dst_addr set. * * NOTE: this filter doesn't support multiple DMAC drivers with the DMA_SLAVE * capability! If this becomes a requirement, hardware glue drivers, using this * services would have to provide their own filters, which first would check * the device driver, similar to how other DMAC drivers, e.g., sa11x0-dma.c, do * this, and only then, in case of a match, call this common filter. * NOTE 2: This filter function is also used in the DT case by shdma_of_xlate(). * In that case the MID-RID value is used for slave channel filtering and is * passed to this function in the "arg" parameter.
*/ bool shdma_chan_filter(struct dma_chan *chan, void *arg)
{ struct shdma_chan *schan; struct shdma_dev *sdev; int slave_id = (long)arg; int ret;
/* Only support channels handled by this driver. */ if (chan->device->device_alloc_chan_resources !=
shdma_alloc_chan_resources) returnfalse;
/* * For DT, the schan->slave_id field is generated by the * set_slave function from the slave ID that is passed in * from xlate. For the non-DT case, the slave ID is * directly passed into the filter function by the driver
*/ if (schan->dev->of_node) {
ret = sdev->ops->set_slave(schan, slave_id, 0, true); if (ret < 0) returnfalse;
/* * queue is ordered, and we use this loop to (1) clean up all * completed descriptors, and to (2) update descriptor flags of * any chunks in a (partially) completed chain
*/ if (!all && desc->mark == DESC_SUBMITTED &&
desc->cookie != cookie) break;
if (all && !callback) /* * Terminating and the loop completed normally: forgive * uncompleted cookies
*/
schan->dma_chan.completed_cookie = schan->dma_chan.cookie;
list_splice_tail(&cyclic_list, &schan->ld_queue);
spin_unlock_irqrestore(&schan->chan_lock, flags);
dmaengine_desc_callback_invoke(&cb, NULL);
return callback;
}
/* * shdma_chan_ld_cleanup - Clean up link descriptors * * Clean up the ld_queue of DMA channel.
*/ staticvoid shdma_chan_ld_cleanup(struct shdma_chan *schan, bool all)
{ while (__ld_cleanup(schan, all))
;
}
/** * shdma_add_desc - get, set up and return one transfer descriptor * @schan: DMA channel * @flags: DMA transfer flags * @dst: destination DMA address, incremented when direction equals * DMA_DEV_TO_MEM or DMA_MEM_TO_MEM * @src: source DMA address, incremented when direction equals * DMA_MEM_TO_DEV or DMA_MEM_TO_MEM * @len: DMA transfer length * @first: if NULL, set to the current descriptor and cookie set to -EBUSY * @direction: needed for slave DMA to decide which address to keep constant, * equals DMA_MEM_TO_MEM for MEMCPY * Returns 0 or an error * Locks: called with desc_lock held
*/ staticstruct shdma_desc *shdma_add_desc(struct shdma_chan *schan, unsignedlong flags, dma_addr_t *dst, dma_addr_t *src, size_t *len, struct shdma_desc **first, enum dma_transfer_direction direction)
{ struct shdma_dev *sdev = to_shdma_dev(schan->dma_chan.device); conststruct shdma_ops *ops = sdev->ops; struct shdma_desc *new;
size_t copy_size = *len;
if (!copy_size) return NULL;
/* Allocate the link descriptor from the free list */ new = shdma_get_desc(schan); if (!new) {
dev_err(schan->dev, "No free link descriptor available\n"); return NULL;
}
if (!*first) { /* First desc */
new->async_tx.cookie = -EBUSY;
*first = new;
} else { /* Other desc - invisible to the user */
new->async_tx.cookie = -EINVAL;
}
*len -= copy_size; if (direction == DMA_MEM_TO_MEM || direction == DMA_MEM_TO_DEV)
*src += copy_size; if (direction == DMA_MEM_TO_MEM || direction == DMA_DEV_TO_MEM)
*dst += copy_size;
returnnew;
}
/* * shdma_prep_sg - prepare transfer descriptors from an SG list * * Common routine for public (MEMCPY) and slave DMA. The MEMCPY case is also * converted to scatter-gather to guarantee consistent locking and a correct * list manipulation. For slave DMA direction carries the usual meaning, and, * logically, the SG list is RAM and the addr variable contains slave address, * e.g., the FIFO I/O register. For MEMCPY direction equals DMA_MEM_TO_MEM * and the SG list contains only one element and points at the source buffer.
*/ staticstruct dma_async_tx_descriptor *shdma_prep_sg(struct shdma_chan *schan, struct scatterlist *sgl, unsignedint sg_len, dma_addr_t *addr, enum dma_transfer_direction direction, unsignedlong flags, bool cyclic)
{ struct scatterlist *sg; struct shdma_desc *first = NULL, *new = NULL /* compiler... */;
LIST_HEAD(tx_list); int chunks = 0; unsignedlong irq_flags; int i;
/* Have to lock the whole loop to protect against concurrent release */
spin_lock_irqsave(&schan->chan_lock, irq_flags);
/* * Chaining: * first descriptor is what user is dealing with in all API calls, its * cookie is at first set to -EBUSY, at tx-submit to a positive * number * if more than one chunk is needed further chunks have cookie = -EINVAL * the last chunk, if not equal to the first, has cookie = -ENOSPC * all chunks are linked onto the tx_list head with their .node heads * only during this function, then they are immediately spliced * back onto the free list in form of a chain
*/
for_each_sg(sgl, sg, sg_len, i) {
dma_addr_t sg_addr = sg_dma_address(sg);
size_t len = sg_dma_len(sg);
if (!len) goto err_get_desc;
do {
dev_dbg(schan->dev, "Add SG #%d@%p[%zu], dma %pad\n",
i, sg, len, &sg_addr);
if (direction == DMA_DEV_TO_MEM) new = shdma_add_desc(schan, flags,
&sg_addr, addr, &len, &first,
direction); else new = shdma_add_desc(schan, flags,
addr, &sg_addr, &len, &first,
direction); if (!new) goto err_get_desc;
new->cyclic = cyclic; if (cyclic)
new->chunks = 1; else
new->chunks = chunks--;
list_add_tail(&new->node, &tx_list);
} while (len);
}
if (new != first)
new->async_tx.cookie = -ENOSPC;
/* Put them back on the free list, so, they don't get lost */
list_splice_tail(&tx_list, &schan->ld_free);
/* Someone calling slave DMA on a generic channel? */ if (slave_id < 0 || (buf_len < period_len)) {
dev_warn(schan->dev, "%s: bad parameter: buf_len=%zu, period_len=%zu, id=%d\n",
__func__, buf_len, period_len, slave_id); return NULL;
}
slave_addr = ops->slave_addr(schan);
/* * Allocate the sg list dynamically as it would consume too much stack * space.
*/
sgl = kmalloc_array(sg_len, sizeof(*sgl), GFP_KERNEL); if (!sgl) return NULL;
sg_init_table(sgl, sg_len);
for (i = 0; i < sg_len; i++) {
dma_addr_t src = buf_addr + (period_len * i);
/* * So far only .slave_id is used, but the slave drivers are * encouraged to also set a transfer direction and an address.
*/ if (!config) return -EINVAL;
/* * We could lock this, but you shouldn't be configuring the * channel, while using it...
*/ return shdma_setup_slave(schan,
config->direction == DMA_DEV_TO_MEM ?
config->src_addr : config->dst_addr);
}
status = dma_cookie_status(chan, cookie, txstate);
/* * If we don't find cookie on the queue, it has been aborted and we have * to report error
*/ if (status != DMA_COMPLETE) { struct shdma_desc *sdesc;
status = DMA_ERROR;
list_for_each_entry(sdesc, &schan->ld_queue, node) if (sdesc->cookie == cookie) {
status = DMA_IN_PROGRESS; break;
}
}
spin_unlock_irqrestore(&schan->chan_lock, flags);
return status;
}
/* Called from error IRQ or NMI */ bool shdma_reset(struct shdma_dev *sdev)
{ conststruct shdma_ops *ops = sdev->ops; struct shdma_chan *schan; unsignedint handled = 0; int i;
int shdma_init(struct device *dev, struct shdma_dev *sdev, int chan_num)
{ struct dma_device *dma_dev = &sdev->dma_dev;
/* * Require all call-backs for now, they can trivially be made optional * later as required
*/ if (!sdev->ops ||
!sdev->desc_size ||
!sdev->ops->embedded_desc ||
!sdev->ops->start_xfer ||
!sdev->ops->setup_xfer ||
!sdev->ops->set_slave ||
!sdev->ops->desc_setup ||
!sdev->ops->slave_addr ||
!sdev->ops->channel_busy ||
!sdev->ops->halt_channel ||
!sdev->ops->desc_completed) return -EINVAL;
sdev->schan = kcalloc(chan_num, sizeof(*sdev->schan), GFP_KERNEL); if (!sdev->schan) return -ENOMEM;
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.