dmaengine.c 29.0 KB
Newer Older
C
Chris Leech 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
/*
 * Copyright(c) 2004 - 2006 Intel Corporation. All rights reserved.
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the Free
 * Software Foundation; either version 2 of the License, or (at your option)
 * any later version.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
 * more details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc., 59
 * Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * The full GNU General Public License is included in this distribution in the
 * file called COPYING.
 */

/*
 * This code implements the DMA subsystem. It provides a HW-neutral interface
 * for other kernel code to use asynchronous memory copy capabilities,
 * if present, and allows different HW DMA drivers to register as providing
 * this capability.
 *
 * Due to the fact we are accelerating what is already a relatively fast
 * operation, the code goes to great lengths to avoid additional overhead,
 * such as locking.
 *
 * LOCKING:
 *
 * The subsystem keeps two global lists, dma_device_list and dma_client_list.
 * Both of these are protected by a mutex, dma_list_mutex.
 *
 * Each device has a channels list, which runs unlocked but is never modified
 * once the device is registered, it's just setup by the driver.
 *
40 41
 * Each client is responsible for keeping track of the channels it uses.  See
 * the definition of dma_event_callback in dmaengine.h.
C
Chris Leech 已提交
42 43
 *
 * Each device has a kref, which is initialized to 1 when the device is
44
 * registered. A kref_get is done for each device registered.  When the
S
Sebastian Siewior 已提交
45
 * device is released, the corresponding kref_put is done in the release
C
Chris Leech 已提交
46
 * method. Every time one of the device's channels is allocated to a client,
S
Sebastian Siewior 已提交
47
 * a kref_get occurs.  When the channel is freed, the corresponding kref_put
C
Chris Leech 已提交
48
 * happens. The device's release function does a completion, so
49
 * unregister_device does a remove event, device_unregister, a kref_put
C
Chris Leech 已提交
50 51 52 53
 * for the first reference, then waits on the completion for all other
 * references to finish.
 *
 * Each channel has an open-coded implementation of Rusty Russell's "bigref,"
54 55
 * with a kref and a per_cpu local_t.  A dma_chan_get is called when a client
 * signals that it wants to use a channel, and dma_chan_put is called when
S
Sebastian Siewior 已提交
56
 * a channel is removed or a client using it is unregistered.  A client can
57 58 59
 * take extra references per outstanding transaction, as is the case with
 * the NET DMA client.  The release function does a kref_put on the device.
 *	-ChrisL, DanW
C
Chris Leech 已提交
60 61 62 63
 */

#include <linux/init.h>
#include <linux/module.h>
64
#include <linux/mm.h>
C
Chris Leech 已提交
65 66 67 68 69 70 71
#include <linux/device.h>
#include <linux/dmaengine.h>
#include <linux/hardirq.h>
#include <linux/spinlock.h>
#include <linux/percpu.h>
#include <linux/rcupdate.h>
#include <linux/mutex.h>
72
#include <linux/jiffies.h>
73
#include <linux/rculist.h>
C
Chris Leech 已提交
74 75 76 77

static DEFINE_MUTEX(dma_list_mutex);
static LIST_HEAD(dma_device_list);
static LIST_HEAD(dma_client_list);
78
static long dmaengine_ref_count;
C
Chris Leech 已提交
79 80 81

/* --- sysfs implementation --- */

82
static ssize_t show_memcpy_count(struct device *dev, struct device_attribute *attr, char *buf)
C
Chris Leech 已提交
83
{
84
	struct dma_chan *chan = to_dma_chan(dev);
C
Chris Leech 已提交
85 86 87
	unsigned long count = 0;
	int i;

88
	for_each_possible_cpu(i)
C
Chris Leech 已提交
89 90 91 92 93
		count += per_cpu_ptr(chan->local, i)->memcpy_count;

	return sprintf(buf, "%lu\n", count);
}

94 95
static ssize_t show_bytes_transferred(struct device *dev, struct device_attribute *attr,
				      char *buf)
C
Chris Leech 已提交
96
{
97
	struct dma_chan *chan = to_dma_chan(dev);
C
Chris Leech 已提交
98 99 100
	unsigned long count = 0;
	int i;

101
	for_each_possible_cpu(i)
C
Chris Leech 已提交
102 103 104 105 106
		count += per_cpu_ptr(chan->local, i)->bytes_transferred;

	return sprintf(buf, "%lu\n", count);
}

107
static ssize_t show_in_use(struct device *dev, struct device_attribute *attr, char *buf)
C
Chris Leech 已提交
108
{
109
	struct dma_chan *chan = to_dma_chan(dev);
C
Chris Leech 已提交
110

111
	return sprintf(buf, "%d\n", chan->client_count);
C
Chris Leech 已提交
112 113
}

114
static struct device_attribute dma_attrs[] = {
C
Chris Leech 已提交
115 116 117 118 119 120 121 122
	__ATTR(memcpy_count, S_IRUGO, show_memcpy_count, NULL),
	__ATTR(bytes_transferred, S_IRUGO, show_bytes_transferred, NULL),
	__ATTR(in_use, S_IRUGO, show_in_use, NULL),
	__ATTR_NULL
};

static void dma_async_device_cleanup(struct kref *kref);

123
static void dma_dev_release(struct device *dev)
C
Chris Leech 已提交
124
{
125
	struct dma_chan *chan = to_dma_chan(dev);
C
Chris Leech 已提交
126 127 128 129
	kref_put(&chan->device->refcount, dma_async_device_cleanup);
}

static struct class dma_devclass = {
130 131 132
	.name		= "dma",
	.dev_attrs	= dma_attrs,
	.dev_release	= dma_dev_release,
C
Chris Leech 已提交
133 134 135 136
};

/* --- client and device registration --- */

137 138
#define dma_device_satisfies_mask(device, mask) \
	__dma_device_satisfies_mask((device), &(mask))
139
static int
140
__dma_device_satisfies_mask(struct dma_device *device, dma_cap_mask_t *want)
141 142 143
{
	dma_cap_mask_t has;

144
	bitmap_and(has.bits, want->bits, device->cap_mask.bits,
145 146 147 148
		DMA_TX_TYPE_END);
	return bitmap_equal(want->bits, has.bits, DMA_TX_TYPE_END);
}

149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197
static struct module *dma_chan_to_owner(struct dma_chan *chan)
{
	return chan->device->dev->driver->owner;
}

/**
 * balance_ref_count - catch up the channel reference count
 * @chan - channel to balance ->client_count versus dmaengine_ref_count
 *
 * balance_ref_count must be called under dma_list_mutex
 */
static void balance_ref_count(struct dma_chan *chan)
{
	struct module *owner = dma_chan_to_owner(chan);

	while (chan->client_count < dmaengine_ref_count) {
		__module_get(owner);
		chan->client_count++;
	}
}

/**
 * dma_chan_get - try to grab a dma channel's parent driver module
 * @chan - channel to grab
 *
 * Must be called under dma_list_mutex
 */
static int dma_chan_get(struct dma_chan *chan)
{
	int err = -ENODEV;
	struct module *owner = dma_chan_to_owner(chan);

	if (chan->client_count) {
		__module_get(owner);
		err = 0;
	} else if (try_module_get(owner))
		err = 0;

	if (err == 0)
		chan->client_count++;

	/* allocate upon first client reference */
	if (chan->client_count == 1 && err == 0) {
		int desc_cnt = chan->device->device_alloc_chan_resources(chan, NULL);

		if (desc_cnt < 0) {
			err = desc_cnt;
			chan->client_count = 0;
			module_put(owner);
198
		} else if (!dma_has_cap(DMA_PRIVATE, chan->device->cap_mask))
199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
			balance_ref_count(chan);
	}

	return err;
}

/**
 * dma_chan_put - drop a reference to a dma channel's parent driver module
 * @chan - channel to release
 *
 * Must be called under dma_list_mutex
 */
static void dma_chan_put(struct dma_chan *chan)
{
	if (!chan->client_count)
		return; /* this channel failed alloc_chan_resources */
	chan->client_count--;
	module_put(dma_chan_to_owner(chan));
	if (chan->client_count == 0)
		chan->device->device_free_chan_resources(chan);
}

C
Chris Leech 已提交
221
/**
222
 * dma_client_chan_alloc - try to allocate channels to a client
C
Chris Leech 已提交
223 224 225 226
 * @client: &dma_client
 *
 * Called with dma_list_mutex held.
 */
227
static void dma_client_chan_alloc(struct dma_client *client)
C
Chris Leech 已提交
228 229 230
{
	struct dma_device *device;
	struct dma_chan *chan;
231
	enum dma_state_client ack;
C
Chris Leech 已提交
232

233
	/* Find a channel */
234
	list_for_each_entry(device, &dma_device_list, global_node) {
235 236 237 238
		if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
			continue;
		if (!dma_device_satisfies_mask(device, client->cap_mask))
			continue;
239

C
Chris Leech 已提交
240
		list_for_each_entry(chan, &device->channels, device_node) {
241 242 243 244
			if (!chan->client_count)
				continue;
			ack = client->event_callback(client, chan,
						     DMA_RESOURCE_AVAILABLE);
C
Chris Leech 已提交
245

246 247 248 249 250
			/* we are done once this client rejects
			 * an available resource
			 */
			if (ack == DMA_NAK)
				return;
C
Chris Leech 已提交
251
		}
252
	}
C
Chris Leech 已提交
253 254
}

255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272
enum dma_status dma_sync_wait(struct dma_chan *chan, dma_cookie_t cookie)
{
	enum dma_status status;
	unsigned long dma_sync_wait_timeout = jiffies + msecs_to_jiffies(5000);

	dma_async_issue_pending(chan);
	do {
		status = dma_async_is_tx_complete(chan, cookie, NULL, NULL);
		if (time_after_eq(jiffies, dma_sync_wait_timeout)) {
			printk(KERN_ERR "dma_sync_wait_timeout!\n");
			return DMA_ERROR;
		}
	} while (status == DMA_IN_PROGRESS);

	return status;
}
EXPORT_SYMBOL(dma_sync_wait);

C
Chris Leech 已提交
273
/**
274 275
 * dma_chan_cleanup - release a DMA channel's resources
 * @kref: kernel reference structure that contains the DMA channel device
C
Chris Leech 已提交
276 277 278 279 280 281
 */
void dma_chan_cleanup(struct kref *kref)
{
	struct dma_chan *chan = container_of(kref, struct dma_chan, refcount);
	kref_put(&chan->device->refcount, dma_async_device_cleanup);
}
282
EXPORT_SYMBOL(dma_chan_cleanup);
C
Chris Leech 已提交
283 284 285 286

static void dma_chan_free_rcu(struct rcu_head *rcu)
{
	struct dma_chan *chan = container_of(rcu, struct dma_chan, rcu);
287

C
Chris Leech 已提交
288 289 290
	kref_put(&chan->refcount, dma_chan_cleanup);
}

291
static void dma_chan_release(struct dma_chan *chan)
C
Chris Leech 已提交
292 293 294 295
{
	call_rcu(&chan->rcu, dma_chan_free_rcu);
}

296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320
/**
 * dma_cap_mask_all - enable iteration over all operation types
 */
static dma_cap_mask_t dma_cap_mask_all;

/**
 * dma_chan_tbl_ent - tracks channel allocations per core/operation
 * @chan - associated channel for this entry
 */
struct dma_chan_tbl_ent {
	struct dma_chan *chan;
};

/**
 * channel_table - percpu lookup table for memory-to-memory offload providers
 */
static struct dma_chan_tbl_ent *channel_table[DMA_TX_TYPE_END];

static int __init dma_channel_table_init(void)
{
	enum dma_transaction_type cap;
	int err = 0;

	bitmap_fill(dma_cap_mask_all.bits, DMA_TX_TYPE_END);

321 322 323
	/* 'interrupt', 'private', and 'slave' are channel capabilities,
	 * but are not associated with an operation so they do not need
	 * an entry in the channel_table
324 325
	 */
	clear_bit(DMA_INTERRUPT, dma_cap_mask_all.bits);
326
	clear_bit(DMA_PRIVATE, dma_cap_mask_all.bits);
327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
	clear_bit(DMA_SLAVE, dma_cap_mask_all.bits);

	for_each_dma_cap_mask(cap, dma_cap_mask_all) {
		channel_table[cap] = alloc_percpu(struct dma_chan_tbl_ent);
		if (!channel_table[cap]) {
			err = -ENOMEM;
			break;
		}
	}

	if (err) {
		pr_err("dmaengine: initialization failure\n");
		for_each_dma_cap_mask(cap, dma_cap_mask_all)
			if (channel_table[cap])
				free_percpu(channel_table[cap]);
	}

	return err;
}
subsys_initcall(dma_channel_table_init);

/**
 * dma_find_channel - find a channel to carry out the operation
 * @tx_type: transaction type
 */
struct dma_chan *dma_find_channel(enum dma_transaction_type tx_type)
{
	struct dma_chan *chan;
	int cpu;

	WARN_ONCE(dmaengine_ref_count == 0,
		  "client called %s without a reference", __func__);

	cpu = get_cpu();
	chan = per_cpu_ptr(channel_table[tx_type], cpu)->chan;
	put_cpu();

	return chan;
}
EXPORT_SYMBOL(dma_find_channel);

368 369 370 371 372 373 374 375 376 377 378 379
/**
 * dma_issue_pending_all - flush all pending operations across all channels
 */
void dma_issue_pending_all(void)
{
	struct dma_device *device;
	struct dma_chan *chan;

	WARN_ONCE(dmaengine_ref_count == 0,
		  "client called %s without a reference", __func__);

	rcu_read_lock();
380 381 382
	list_for_each_entry_rcu(device, &dma_device_list, global_node) {
		if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
			continue;
383 384 385
		list_for_each_entry(chan, &device->channels, device_node)
			if (chan->client_count)
				device->device_issue_pending(chan);
386
	}
387 388 389 390
	rcu_read_unlock();
}
EXPORT_SYMBOL(dma_issue_pending_all);

391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407
/**
 * nth_chan - returns the nth channel of the given capability
 * @cap: capability to match
 * @n: nth channel desired
 *
 * Defaults to returning the channel with the desired capability and the
 * lowest reference count when 'n' cannot be satisfied.  Must be called
 * under dma_list_mutex.
 */
static struct dma_chan *nth_chan(enum dma_transaction_type cap, int n)
{
	struct dma_device *device;
	struct dma_chan *chan;
	struct dma_chan *ret = NULL;
	struct dma_chan *min = NULL;

	list_for_each_entry(device, &dma_device_list, global_node) {
408 409
		if (!dma_has_cap(cap, device->cap_mask) ||
		    dma_has_cap(DMA_PRIVATE, device->cap_mask))
410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457
			continue;
		list_for_each_entry(chan, &device->channels, device_node) {
			if (!chan->client_count)
				continue;
			if (!min)
				min = chan;
			else if (chan->table_count < min->table_count)
				min = chan;

			if (n-- == 0) {
				ret = chan;
				break; /* done */
			}
		}
		if (ret)
			break; /* done */
	}

	if (!ret)
		ret = min;

	if (ret)
		ret->table_count++;

	return ret;
}

/**
 * dma_channel_rebalance - redistribute the available channels
 *
 * Optimize for cpu isolation (each cpu gets a dedicated channel for an
 * operation type) in the SMP case,  and operation isolation (avoid
 * multi-tasking channels) in the non-SMP case.  Must be called under
 * dma_list_mutex.
 */
static void dma_channel_rebalance(void)
{
	struct dma_chan *chan;
	struct dma_device *device;
	int cpu;
	int cap;
	int n;

	/* undo the last distribution */
	for_each_dma_cap_mask(cap, dma_cap_mask_all)
		for_each_possible_cpu(cpu)
			per_cpu_ptr(channel_table[cap], cpu)->chan = NULL;

458 459 460
	list_for_each_entry(device, &dma_device_list, global_node) {
		if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
			continue;
461 462
		list_for_each_entry(chan, &device->channels, device_node)
			chan->table_count = 0;
463
	}
464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481

	/* don't populate the channel_table if no clients are available */
	if (!dmaengine_ref_count)
		return;

	/* redistribute available channels */
	n = 0;
	for_each_dma_cap_mask(cap, dma_cap_mask_all)
		for_each_online_cpu(cpu) {
			if (num_possible_cpus() > 1)
				chan = nth_chan(cap, n++);
			else
				chan = nth_chan(cap, -1);

			per_cpu_ptr(channel_table[cap], cpu)->chan = chan;
		}
}

482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
static struct dma_chan *private_candidate(dma_cap_mask_t *mask, struct dma_device *dev)
{
	struct dma_chan *chan;
	struct dma_chan *ret = NULL;

	if (!__dma_device_satisfies_mask(dev, mask)) {
		pr_debug("%s: wrong capabilities\n", __func__);
		return NULL;
	}
	/* devices with multiple channels need special handling as we need to
	 * ensure that all channels are either private or public.
	 */
	if (dev->chancnt > 1 && !dma_has_cap(DMA_PRIVATE, dev->cap_mask))
		list_for_each_entry(chan, &dev->channels, device_node) {
			/* some channels are already publicly allocated */
			if (chan->client_count)
				return NULL;
		}

	list_for_each_entry(chan, &dev->channels, device_node) {
		if (chan->client_count) {
			pr_debug("%s: %s busy\n",
				 __func__, dev_name(&chan->dev));
			continue;
		}
		ret = chan;
		break;
	}

	return ret;
}

/**
 * dma_request_channel - try to allocate an exclusive channel
 * @mask: capabilities that the channel must satisfy
 * @fn: optional callback to disposition available channels
 * @fn_param: opaque parameter to pass to dma_filter_fn
 */
struct dma_chan *__dma_request_channel(dma_cap_mask_t *mask, dma_filter_fn fn, void *fn_param)
{
	struct dma_device *device, *_d;
	struct dma_chan *chan = NULL;
	enum dma_state_client ack;
	int err;

	/* Find a channel */
	mutex_lock(&dma_list_mutex);
	list_for_each_entry_safe(device, _d, &dma_device_list, global_node) {
		chan = private_candidate(mask, device);
		if (!chan)
			continue;

		if (fn)
			ack = fn(chan, fn_param);
		else
			ack = DMA_ACK;

		if (ack == DMA_ACK) {
			/* Found a suitable channel, try to grab, prep, and
			 * return it.  We first set DMA_PRIVATE to disable
			 * balance_ref_count as this channel will not be
			 * published in the general-purpose allocator
			 */
			dma_cap_set(DMA_PRIVATE, device->cap_mask);
			err = dma_chan_get(chan);

			if (err == -ENODEV) {
				pr_debug("%s: %s module removed\n", __func__,
					 dev_name(&chan->dev));
				list_del_rcu(&device->global_node);
			} else if (err)
				pr_err("dmaengine: failed to get %s: (%d)\n",
				       dev_name(&chan->dev), err);
			else
				break;
		} else if (ack == DMA_DUP) {
			pr_debug("%s: %s filter said DMA_DUP\n",
				 __func__, dev_name(&chan->dev));
		} else if (ack == DMA_NAK) {
			pr_debug("%s: %s filter said DMA_NAK\n",
				 __func__, dev_name(&chan->dev));
			break;
		} else
			WARN_ONCE(1, "filter_fn: unknown response?\n");
		chan = NULL;
	}
	mutex_unlock(&dma_list_mutex);

	pr_debug("%s: %s (%s)\n", __func__, chan ? "success" : "fail",
		 chan ? dev_name(&chan->dev) : NULL);

	return chan;
}
EXPORT_SYMBOL_GPL(__dma_request_channel);

void dma_release_channel(struct dma_chan *chan)
{
	mutex_lock(&dma_list_mutex);
	WARN_ONCE(chan->client_count != 1,
		  "chan reference count %d != 1\n", chan->client_count);
	dma_chan_put(chan);
	mutex_unlock(&dma_list_mutex);
}
EXPORT_SYMBOL_GPL(dma_release_channel);

C
Chris Leech 已提交
587
/**
588
 * dma_chans_notify_available - broadcast available channels to the clients
C
Chris Leech 已提交
589
 */
590
static void dma_clients_notify_available(void)
C
Chris Leech 已提交
591 592 593 594 595
{
	struct dma_client *client;

	mutex_lock(&dma_list_mutex);

596 597
	list_for_each_entry(client, &dma_client_list, global_node)
		dma_client_chan_alloc(client);
C
Chris Leech 已提交
598 599 600 601

	mutex_unlock(&dma_list_mutex);
}

602 603 604 605 606 607
/**
 * dma_async_client_register - register a &dma_client
 * @client: ptr to a client structure with valid 'event_callback' and 'cap_mask'
 */
void dma_async_client_register(struct dma_client *client)
{
608 609 610 611
	struct dma_device *device, *_d;
	struct dma_chan *chan;
	int err;

C
Chris Leech 已提交
612
	mutex_lock(&dma_list_mutex);
613 614 615
	dmaengine_ref_count++;

	/* try to grab channels */
616 617 618
	list_for_each_entry_safe(device, _d, &dma_device_list, global_node) {
		if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
			continue;
619 620 621 622
		list_for_each_entry(chan, &device->channels, device_node) {
			err = dma_chan_get(chan);
			if (err == -ENODEV) {
				/* module removed before we could use it */
623
				list_del_rcu(&device->global_node);
624 625 626 627 628
				break;
			} else if (err)
				pr_err("dmaengine: failed to get %s: (%d)\n",
				       dev_name(&chan->dev), err);
		}
629
	}
630

631 632 633 634 635 636
	/* if this is the first reference and there were channels
	 * waiting we need to rebalance to get those channels
	 * incorporated into the channel table
	 */
	if (dmaengine_ref_count == 1)
		dma_channel_rebalance();
C
Chris Leech 已提交
637 638 639
	list_add_tail(&client->global_node, &dma_client_list);
	mutex_unlock(&dma_list_mutex);
}
640
EXPORT_SYMBOL(dma_async_client_register);
C
Chris Leech 已提交
641 642 643

/**
 * dma_async_client_unregister - unregister a client and free the &dma_client
644
 * @client: &dma_client to free
C
Chris Leech 已提交
645 646 647 648 649
 *
 * Force frees any allocated DMA channels, frees the &dma_client memory
 */
void dma_async_client_unregister(struct dma_client *client)
{
650
	struct dma_device *device;
C
Chris Leech 已提交
651 652 653 654 655 656
	struct dma_chan *chan;

	if (!client)
		return;

	mutex_lock(&dma_list_mutex);
657 658 659
	dmaengine_ref_count--;
	BUG_ON(dmaengine_ref_count < 0);
	/* drop channel references */
660 661 662
	list_for_each_entry(device, &dma_device_list, global_node) {
		if (dma_has_cap(DMA_PRIVATE, device->cap_mask))
			continue;
663 664
		list_for_each_entry(chan, &device->channels, device_node)
			dma_chan_put(chan);
665
	}
666

C
Chris Leech 已提交
667 668 669
	list_del(&client->global_node);
	mutex_unlock(&dma_list_mutex);
}
670
EXPORT_SYMBOL(dma_async_client_unregister);
C
Chris Leech 已提交
671 672

/**
673 674 675
 * dma_async_client_chan_request - send all available channels to the
 * client that satisfy the capability mask
 * @client - requester
C
Chris Leech 已提交
676
 */
677
void dma_async_client_chan_request(struct dma_client *client)
C
Chris Leech 已提交
678
{
679 680 681
	mutex_lock(&dma_list_mutex);
	dma_client_chan_alloc(client);
	mutex_unlock(&dma_list_mutex);
C
Chris Leech 已提交
682
}
683
EXPORT_SYMBOL(dma_async_client_chan_request);
C
Chris Leech 已提交
684 685

/**
686
 * dma_async_device_register - registers DMA devices found
C
Chris Leech 已提交
687 688 689 690 691
 * @device: &dma_device
 */
int dma_async_device_register(struct dma_device *device)
{
	static int id;
J
Jeff Garzik 已提交
692
	int chancnt = 0, rc;
C
Chris Leech 已提交
693 694 695 696 697
	struct dma_chan* chan;

	if (!device)
		return -ENODEV;

698 699 700 701 702 703 704 705 706
	/* validate device routines */
	BUG_ON(dma_has_cap(DMA_MEMCPY, device->cap_mask) &&
		!device->device_prep_dma_memcpy);
	BUG_ON(dma_has_cap(DMA_XOR, device->cap_mask) &&
		!device->device_prep_dma_xor);
	BUG_ON(dma_has_cap(DMA_ZERO_SUM, device->cap_mask) &&
		!device->device_prep_dma_zero_sum);
	BUG_ON(dma_has_cap(DMA_MEMSET, device->cap_mask) &&
		!device->device_prep_dma_memset);
707
	BUG_ON(dma_has_cap(DMA_INTERRUPT, device->cap_mask) &&
708
		!device->device_prep_dma_interrupt);
709 710 711 712
	BUG_ON(dma_has_cap(DMA_SLAVE, device->cap_mask) &&
		!device->device_prep_slave_sg);
	BUG_ON(dma_has_cap(DMA_SLAVE, device->cap_mask) &&
		!device->device_terminate_all);
713 714 715 716 717 718 719

	BUG_ON(!device->device_alloc_chan_resources);
	BUG_ON(!device->device_free_chan_resources);
	BUG_ON(!device->device_is_tx_complete);
	BUG_ON(!device->device_issue_pending);
	BUG_ON(!device->dev);

C
Chris Leech 已提交
720 721
	init_completion(&device->done);
	kref_init(&device->refcount);
722 723

	mutex_lock(&dma_list_mutex);
C
Chris Leech 已提交
724
	device->dev_id = id++;
725
	mutex_unlock(&dma_list_mutex);
C
Chris Leech 已提交
726 727 728 729 730 731 732 733

	/* represent channels in sysfs. Probably want devs too */
	list_for_each_entry(chan, &device->channels, device_node) {
		chan->local = alloc_percpu(typeof(*chan->local));
		if (chan->local == NULL)
			continue;

		chan->chan_id = chancnt++;
734
		chan->dev.class = &dma_devclass;
735
		chan->dev.parent = device->dev;
736 737
		dev_set_name(&chan->dev, "dma%dchan%d",
			     device->dev_id, chan->chan_id);
C
Chris Leech 已提交
738

739
		rc = device_register(&chan->dev);
J
Jeff Garzik 已提交
740 741 742 743 744 745 746
		if (rc) {
			chancnt--;
			free_percpu(chan->local);
			chan->local = NULL;
			goto err_out;
		}

747 748
		/* One for the channel, one of the class device */
		kref_get(&device->refcount);
C
Chris Leech 已提交
749
		kref_get(&device->refcount);
750
		kref_init(&chan->refcount);
751
		chan->client_count = 0;
752 753
		chan->slow_ref = 0;
		INIT_RCU_HEAD(&chan->rcu);
C
Chris Leech 已提交
754
	}
755
	device->chancnt = chancnt;
C
Chris Leech 已提交
756 757

	mutex_lock(&dma_list_mutex);
758 759
	/* take references on public channels */
	if (dmaengine_ref_count && !dma_has_cap(DMA_PRIVATE, device->cap_mask))
760 761 762 763 764 765 766 767 768 769 770 771 772 773
		list_for_each_entry(chan, &device->channels, device_node) {
			/* if clients are already waiting for channels we need
			 * to take references on their behalf
			 */
			if (dma_chan_get(chan) == -ENODEV) {
				/* note we can only get here for the first
				 * channel as the remaining channels are
				 * guaranteed to get a reference
				 */
				rc = -ENODEV;
				mutex_unlock(&dma_list_mutex);
				goto err_out;
			}
		}
774
	list_add_tail_rcu(&device->global_node, &dma_device_list);
775
	dma_channel_rebalance();
C
Chris Leech 已提交
776 777
	mutex_unlock(&dma_list_mutex);

778
	dma_clients_notify_available();
C
Chris Leech 已提交
779 780

	return 0;
J
Jeff Garzik 已提交
781 782 783 784 785 786

err_out:
	list_for_each_entry(chan, &device->channels, device_node) {
		if (chan->local == NULL)
			continue;
		kref_put(&device->refcount, dma_async_device_cleanup);
787
		device_unregister(&chan->dev);
J
Jeff Garzik 已提交
788 789 790 791
		chancnt--;
		free_percpu(chan->local);
	}
	return rc;
C
Chris Leech 已提交
792
}
793
EXPORT_SYMBOL(dma_async_device_register);
C
Chris Leech 已提交
794 795

/**
796 797
 * dma_async_device_cleanup - function called when all references are released
 * @kref: kernel reference object
C
Chris Leech 已提交
798 799 800 801 802 803 804 805 806
 */
static void dma_async_device_cleanup(struct kref *kref)
{
	struct dma_device *device;

	device = container_of(kref, struct dma_device, refcount);
	complete(&device->done);
}

807
/**
808
 * dma_async_device_unregister - unregister a DMA device
809 810 811
 * @device: &dma_device
 */
void dma_async_device_unregister(struct dma_device *device)
C
Chris Leech 已提交
812 813 814 815
{
	struct dma_chan *chan;

	mutex_lock(&dma_list_mutex);
816
	list_del_rcu(&device->global_node);
817
	dma_channel_rebalance();
C
Chris Leech 已提交
818 819 820
	mutex_unlock(&dma_list_mutex);

	list_for_each_entry(chan, &device->channels, device_node) {
821 822 823
		WARN_ONCE(chan->client_count,
			  "%s called while %d clients hold a reference\n",
			  __func__, chan->client_count);
824
		device_unregister(&chan->dev);
825
		dma_chan_release(chan);
C
Chris Leech 已提交
826 827 828 829 830
	}

	kref_put(&device->refcount, dma_async_device_cleanup);
	wait_for_completion(&device->done);
}
831
EXPORT_SYMBOL(dma_async_device_unregister);
C
Chris Leech 已提交
832

833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850
/**
 * dma_async_memcpy_buf_to_buf - offloaded copy between virtual addresses
 * @chan: DMA channel to offload copy to
 * @dest: destination address (virtual)
 * @src: source address (virtual)
 * @len: length
 *
 * Both @dest and @src must be mappable to a bus address according to the
 * DMA mapping API rules for streaming mappings.
 * Both @dest and @src must stay memory resident (kernel memory or locked
 * user space pages).
 */
dma_cookie_t
dma_async_memcpy_buf_to_buf(struct dma_chan *chan, void *dest,
			void *src, size_t len)
{
	struct dma_device *dev = chan->device;
	struct dma_async_tx_descriptor *tx;
851
	dma_addr_t dma_dest, dma_src;
852 853 854
	dma_cookie_t cookie;
	int cpu;

855 856
	dma_src = dma_map_single(dev->dev, src, len, DMA_TO_DEVICE);
	dma_dest = dma_map_single(dev->dev, dest, len, DMA_FROM_DEVICE);
857 858
	tx = dev->device_prep_dma_memcpy(chan, dma_dest, dma_src, len,
					 DMA_CTRL_ACK);
859 860 861 862

	if (!tx) {
		dma_unmap_single(dev->dev, dma_src, len, DMA_TO_DEVICE);
		dma_unmap_single(dev->dev, dma_dest, len, DMA_FROM_DEVICE);
863
		return -ENOMEM;
864
	}
865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896

	tx->callback = NULL;
	cookie = tx->tx_submit(tx);

	cpu = get_cpu();
	per_cpu_ptr(chan->local, cpu)->bytes_transferred += len;
	per_cpu_ptr(chan->local, cpu)->memcpy_count++;
	put_cpu();

	return cookie;
}
EXPORT_SYMBOL(dma_async_memcpy_buf_to_buf);

/**
 * dma_async_memcpy_buf_to_pg - offloaded copy from address to page
 * @chan: DMA channel to offload copy to
 * @page: destination page
 * @offset: offset in page to copy to
 * @kdata: source address (virtual)
 * @len: length
 *
 * Both @page/@offset and @kdata must be mappable to a bus address according
 * to the DMA mapping API rules for streaming mappings.
 * Both @page/@offset and @kdata must stay memory resident (kernel memory or
 * locked user space pages)
 */
dma_cookie_t
dma_async_memcpy_buf_to_pg(struct dma_chan *chan, struct page *page,
			unsigned int offset, void *kdata, size_t len)
{
	struct dma_device *dev = chan->device;
	struct dma_async_tx_descriptor *tx;
897
	dma_addr_t dma_dest, dma_src;
898 899 900
	dma_cookie_t cookie;
	int cpu;

901 902
	dma_src = dma_map_single(dev->dev, kdata, len, DMA_TO_DEVICE);
	dma_dest = dma_map_page(dev->dev, page, offset, len, DMA_FROM_DEVICE);
903 904
	tx = dev->device_prep_dma_memcpy(chan, dma_dest, dma_src, len,
					 DMA_CTRL_ACK);
905 906 907 908

	if (!tx) {
		dma_unmap_single(dev->dev, dma_src, len, DMA_TO_DEVICE);
		dma_unmap_page(dev->dev, dma_dest, len, DMA_FROM_DEVICE);
909
		return -ENOMEM;
910
	}
911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944

	tx->callback = NULL;
	cookie = tx->tx_submit(tx);

	cpu = get_cpu();
	per_cpu_ptr(chan->local, cpu)->bytes_transferred += len;
	per_cpu_ptr(chan->local, cpu)->memcpy_count++;
	put_cpu();

	return cookie;
}
EXPORT_SYMBOL(dma_async_memcpy_buf_to_pg);

/**
 * dma_async_memcpy_pg_to_pg - offloaded copy from page to page
 * @chan: DMA channel to offload copy to
 * @dest_pg: destination page
 * @dest_off: offset in page to copy to
 * @src_pg: source page
 * @src_off: offset in page to copy from
 * @len: length
 *
 * Both @dest_page/@dest_off and @src_page/@src_off must be mappable to a bus
 * address according to the DMA mapping API rules for streaming mappings.
 * Both @dest_page/@dest_off and @src_page/@src_off must stay memory resident
 * (kernel memory or locked user space pages).
 */
dma_cookie_t
dma_async_memcpy_pg_to_pg(struct dma_chan *chan, struct page *dest_pg,
	unsigned int dest_off, struct page *src_pg, unsigned int src_off,
	size_t len)
{
	struct dma_device *dev = chan->device;
	struct dma_async_tx_descriptor *tx;
945
	dma_addr_t dma_dest, dma_src;
946 947 948
	dma_cookie_t cookie;
	int cpu;

949 950 951
	dma_src = dma_map_page(dev->dev, src_pg, src_off, len, DMA_TO_DEVICE);
	dma_dest = dma_map_page(dev->dev, dest_pg, dest_off, len,
				DMA_FROM_DEVICE);
952 953
	tx = dev->device_prep_dma_memcpy(chan, dma_dest, dma_src, len,
					 DMA_CTRL_ACK);
954 955 956 957

	if (!tx) {
		dma_unmap_page(dev->dev, dma_src, len, DMA_TO_DEVICE);
		dma_unmap_page(dev->dev, dma_dest, len, DMA_FROM_DEVICE);
958
		return -ENOMEM;
959
	}
960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980

	tx->callback = NULL;
	cookie = tx->tx_submit(tx);

	cpu = get_cpu();
	per_cpu_ptr(chan->local, cpu)->bytes_transferred += len;
	per_cpu_ptr(chan->local, cpu)->memcpy_count++;
	put_cpu();

	return cookie;
}
EXPORT_SYMBOL(dma_async_memcpy_pg_to_pg);

void dma_async_tx_descriptor_init(struct dma_async_tx_descriptor *tx,
	struct dma_chan *chan)
{
	tx->chan = chan;
	spin_lock_init(&tx->lock);
}
EXPORT_SYMBOL(dma_async_tx_descriptor_init);

981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064
/* dma_wait_for_async_tx - spin wait for a transaction to complete
 * @tx: in-flight transaction to wait on
 *
 * This routine assumes that tx was obtained from a call to async_memcpy,
 * async_xor, async_memset, etc which ensures that tx is "in-flight" (prepped
 * and submitted).  Walking the parent chain is only meant to cover for DMA
 * drivers that do not implement the DMA_INTERRUPT capability and may race with
 * the driver's descriptor cleanup routine.
 */
enum dma_status
dma_wait_for_async_tx(struct dma_async_tx_descriptor *tx)
{
	enum dma_status status;
	struct dma_async_tx_descriptor *iter;
	struct dma_async_tx_descriptor *parent;

	if (!tx)
		return DMA_SUCCESS;

	WARN_ONCE(tx->parent, "%s: speculatively walking dependency chain for"
		  " %s\n", __func__, dev_name(&tx->chan->dev));

	/* poll through the dependency chain, return when tx is complete */
	do {
		iter = tx;

		/* find the root of the unsubmitted dependency chain */
		do {
			parent = iter->parent;
			if (!parent)
				break;
			else
				iter = parent;
		} while (parent);

		/* there is a small window for ->parent == NULL and
		 * ->cookie == -EBUSY
		 */
		while (iter->cookie == -EBUSY)
			cpu_relax();

		status = dma_sync_wait(iter->chan, iter->cookie);
	} while (status == DMA_IN_PROGRESS || (iter != tx));

	return status;
}
EXPORT_SYMBOL_GPL(dma_wait_for_async_tx);

/* dma_run_dependencies - helper routine for dma drivers to process
 *	(start) dependent operations on their target channel
 * @tx: transaction with dependencies
 */
void dma_run_dependencies(struct dma_async_tx_descriptor *tx)
{
	struct dma_async_tx_descriptor *dep = tx->next;
	struct dma_async_tx_descriptor *dep_next;
	struct dma_chan *chan;

	if (!dep)
		return;

	chan = dep->chan;

	/* keep submitting up until a channel switch is detected
	 * in that case we will be called again as a result of
	 * processing the interrupt from async_tx_channel_switch
	 */
	for (; dep; dep = dep_next) {
		spin_lock_bh(&dep->lock);
		dep->parent = NULL;
		dep_next = dep->next;
		if (dep_next && dep_next->chan == chan)
			dep->next = NULL; /* ->next will be submitted */
		else
			dep_next = NULL; /* submit current dep and terminate */
		spin_unlock_bh(&dep->lock);

		dep->tx_submit(dep);
	}

	chan->device->device_issue_pending(chan);
}
EXPORT_SYMBOL_GPL(dma_run_dependencies);

C
Chris Leech 已提交
1065 1066 1067 1068 1069 1070 1071
static int __init dma_bus_init(void)
{
	mutex_init(&dma_list_mutex);
	return class_register(&dma_devclass);
}
subsys_initcall(dma_bus_init);

1072