dma/qcom/hidma.c

114 	struct hidma_desc *mdesc;
127 	list_for_each_entry_safe(mdesc, next, &list, node) {
132 		desc = &mdesc->desc;
135 		llstat = hidma_ll_status(mdma->lldev, mdesc->tre_ch);
153 		list_move(&mdesc->node, &mchan->free);
167 	struct hidma_desc *mdesc = data;
168 	struct hidma_chan *mchan = to_hidma_chan(mdesc->desc.chan);
175 	if (mdesc->node.next) {
177 		list_move_tail(&mdesc->node, &mchan->completed);
314 	struct hidma_desc *mdesc;
327 	mdesc = container_of(txd, struct hidma_desc, desc);
331 	list_move_tail(&mdesc->node, &mchan->queued);
345 	struct hidma_desc *mdesc, *tmp;
356 		mdesc = kzalloc(sizeof(struct hidma_desc), GFP_NOWAIT);
357 		if (!mdesc) {
361 		dma_async_tx_descriptor_init(&mdesc->desc, dmach);
362 		mdesc->desc.tx_submit = hidma_tx_submit;
365 				      "DMA engine", hidma_callback, mdesc,
366 				      &mdesc->tre_ch);
370 			kfree(mdesc);
373 		list_add_tail(&mdesc->node, &descs);
378 		list_for_each_entry_safe(mdesc, tmp, &descs, node) {
379 			hidma_ll_free(dmadev->lldev, mdesc->tre_ch);
380 			kfree(mdesc);
397 	struct hidma_desc *mdesc = NULL;
404 		mdesc = list_first_entry(&mchan->free, struct hidma_desc, node);
405 		list_del(&mdesc->node);
409 	if (!mdesc)
412 	mdesc->desc.flags = flags;
413 	hidma_ll_set_transfer_params(mdma->lldev, mdesc->tre_ch,
419 	list_add_tail(&mdesc->node, &mchan->prepared);
422 	return &mdesc->desc;
430 	struct hidma_desc *mdesc = NULL;
438 		mdesc = list_first_entry(&mchan->free, struct hidma_desc, node);
439 		list_del(&mdesc->node);
443 	if (!mdesc)
456 	mdesc->desc.flags = flags;
457 	hidma_ll_set_transfer_params(mdma->lldev, mdesc->tre_ch,
463 	list_add_tail(&mdesc->node, &mchan->prepared);
466 	return &mdesc->desc;
473 	struct hidma_desc *tmp, *mdesc;
498 	list_for_each_entry_safe(mdesc, tmp, &list, node) {
499 		struct dma_async_tx_descriptor *txd = &mdesc->desc;
506 		list_move(&mdesc->node, &mchan->free);
538 	struct hidma_desc *mdesc, *tmp;
551 	list_for_each_entry_safe(mdesc, tmp, &descs, node) {
552 		hidma_ll_free(mdma->lldev, mdesc->tre_ch);
553 		list_del(&mdesc->node);
554 		kfree(mdesc);