2005-04-17 05:20:36 +07:00
|
|
|
/*
|
2007-07-12 01:04:50 +07:00
|
|
|
* linux/drivers/mmc/card/queue.c
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
|
|
|
* Copyright (C) 2003 Russell King, All Rights Reserved.
|
2006-12-24 02:03:02 +07:00
|
|
|
* Copyright 2006-2007 Pierre Ossman
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
*/
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 15:04:11 +07:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/blkdev.h>
|
2007-07-17 18:03:35 +07:00
|
|
|
#include <linux/freezer.h>
|
2006-11-14 02:23:52 +07:00
|
|
|
#include <linux/kthread.h>
|
2007-10-23 02:19:53 +07:00
|
|
|
#include <linux/scatterlist.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
#include <linux/mmc/card.h>
|
|
|
|
#include <linux/mmc/host.h>
|
2006-12-24 02:03:02 +07:00
|
|
|
#include "queue.h"
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2007-05-12 05:26:16 +07:00
|
|
|
#define MMC_QUEUE_BOUNCESZ 65536
|
|
|
|
|
2006-11-14 02:23:52 +07:00
|
|
|
#define MMC_QUEUE_SUSPENDED (1 << 0)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2007-05-16 22:29:21 +07:00
|
|
|
* Prepare a MMC request. This just filters out odd stuff.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
|
|
|
static int mmc_prep_request(struct request_queue *q, struct request *req)
|
|
|
|
{
|
2011-12-08 15:35:50 +07:00
|
|
|
struct mmc_queue *mq = q->queuedata;
|
|
|
|
|
2007-05-16 22:29:21 +07:00
|
|
|
/*
|
2010-08-12 04:17:47 +07:00
|
|
|
* We only like normal block requests and discards.
|
2007-05-16 22:29:21 +07:00
|
|
|
*/
|
2010-08-12 04:17:47 +07:00
|
|
|
if (req->cmd_type != REQ_TYPE_FS && !(req->cmd_flags & REQ_DISCARD)) {
|
2005-04-17 05:20:36 +07:00
|
|
|
blk_dump_rq_flags(req, "MMC bad request");
|
2007-05-16 22:29:21 +07:00
|
|
|
return BLKPREP_KILL;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2011-12-08 15:35:50 +07:00
|
|
|
if (mq && mmc_card_removed(mq->card))
|
|
|
|
return BLKPREP_KILL;
|
|
|
|
|
2007-05-16 22:29:21 +07:00
|
|
|
req->cmd_flags |= REQ_DONTPREP;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2007-05-16 22:29:21 +07:00
|
|
|
return BLKPREP_OK;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static int mmc_queue_thread(void *d)
|
|
|
|
{
|
|
|
|
struct mmc_queue *mq = d;
|
|
|
|
struct request_queue *q = mq->queue;
|
|
|
|
|
2007-07-17 18:03:35 +07:00
|
|
|
current->flags |= PF_MEMALLOC;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
down(&mq->thread_sem);
|
|
|
|
do {
|
|
|
|
struct request *req = NULL;
|
2011-07-01 23:55:33 +07:00
|
|
|
struct mmc_queue_req *tmp;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
spin_lock_irq(q->queue_lock);
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
2011-03-10 14:52:07 +07:00
|
|
|
req = blk_fetch_request(q);
|
2011-07-10 04:12:36 +07:00
|
|
|
mq->mqrq_cur->req = req;
|
2005-04-17 05:20:36 +07:00
|
|
|
spin_unlock_irq(q->queue_lock);
|
|
|
|
|
2011-07-01 23:55:33 +07:00
|
|
|
if (req || mq->mqrq_prev->req) {
|
|
|
|
set_current_state(TASK_RUNNING);
|
|
|
|
mq->issue_fn(mq, req);
|
|
|
|
} else {
|
2006-12-08 02:08:02 +07:00
|
|
|
if (kthread_should_stop()) {
|
|
|
|
set_current_state(TASK_RUNNING);
|
2005-04-17 05:20:36 +07:00
|
|
|
break;
|
2006-12-08 02:08:02 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
up(&mq->thread_sem);
|
|
|
|
schedule();
|
|
|
|
down(&mq->thread_sem);
|
|
|
|
}
|
|
|
|
|
2011-07-01 23:55:33 +07:00
|
|
|
/* Current request becomes previous request and vice versa. */
|
|
|
|
mq->mqrq_prev->brq.mrq.data = NULL;
|
|
|
|
mq->mqrq_prev->req = NULL;
|
|
|
|
tmp = mq->mqrq_prev;
|
|
|
|
mq->mqrq_prev = mq->mqrq_cur;
|
|
|
|
mq->mqrq_cur = tmp;
|
2005-04-17 05:20:36 +07:00
|
|
|
} while (1);
|
|
|
|
up(&mq->thread_sem);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Generic MMC request handler. This is called for any queue on a
|
|
|
|
* particular host. When the host is not busy, we look for a request
|
|
|
|
* on any queue on this host, and attempt to issue it. This may
|
|
|
|
* not be the queue we were asked to process.
|
|
|
|
*/
|
2007-07-24 14:28:11 +07:00
|
|
|
static void mmc_request(struct request_queue *q)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct mmc_queue *mq = q->queuedata;
|
2006-11-15 04:08:16 +07:00
|
|
|
struct request *req;
|
|
|
|
|
|
|
|
if (!mq) {
|
2010-01-09 05:43:00 +07:00
|
|
|
while ((req = blk_fetch_request(q)) != NULL) {
|
|
|
|
req->cmd_flags |= REQ_QUIET;
|
2009-05-08 09:54:15 +07:00
|
|
|
__blk_end_request_all(req, -EIO);
|
2010-01-09 05:43:00 +07:00
|
|
|
}
|
2006-11-15 04:08:16 +07:00
|
|
|
return;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2011-07-01 23:55:33 +07:00
|
|
|
if (!mq->mqrq_cur->req && !mq->mqrq_prev->req)
|
2006-11-14 02:23:52 +07:00
|
|
|
wake_up_process(mq->thread);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2011-08-23 22:46:02 +07:00
|
|
|
static struct scatterlist *mmc_alloc_sg(int sg_len, int *err)
|
2011-07-10 04:12:36 +07:00
|
|
|
{
|
|
|
|
struct scatterlist *sg;
|
|
|
|
|
|
|
|
sg = kmalloc(sizeof(struct scatterlist)*sg_len, GFP_KERNEL);
|
|
|
|
if (!sg)
|
|
|
|
*err = -ENOMEM;
|
|
|
|
else {
|
|
|
|
*err = 0;
|
|
|
|
sg_init_table(sg, sg_len);
|
|
|
|
}
|
|
|
|
|
|
|
|
return sg;
|
|
|
|
}
|
|
|
|
|
2011-06-28 21:16:02 +07:00
|
|
|
static void mmc_queue_setup_discard(struct request_queue *q,
|
|
|
|
struct mmc_card *card)
|
|
|
|
{
|
|
|
|
unsigned max_discard;
|
|
|
|
|
|
|
|
max_discard = mmc_calc_max_discard(card);
|
|
|
|
if (!max_discard)
|
|
|
|
return;
|
|
|
|
|
|
|
|
queue_flag_set_unlocked(QUEUE_FLAG_DISCARD, q);
|
|
|
|
q->limits.max_discard_sectors = max_discard;
|
|
|
|
if (card->erased_byte == 0)
|
|
|
|
q->limits.discard_zeroes_data = 1;
|
|
|
|
q->limits.discard_granularity = card->pref_erase << 9;
|
|
|
|
/* granularity must not be greater than max. discard */
|
|
|
|
if (card->pref_erase > max_discard)
|
|
|
|
q->limits.discard_granularity = 0;
|
2011-10-14 12:15:48 +07:00
|
|
|
if (mmc_can_secure_erase_trim(card) || mmc_can_sanitize(card))
|
2011-06-28 21:16:02 +07:00
|
|
|
queue_flag_set_unlocked(QUEUE_FLAG_SECDISCARD, q);
|
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/**
|
|
|
|
* mmc_init_queue - initialise a queue structure.
|
|
|
|
* @mq: mmc queue
|
|
|
|
* @card: mmc card to attach this queue
|
|
|
|
* @lock: queue lock
|
2011-06-23 17:40:28 +07:00
|
|
|
* @subname: partition subname
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
|
|
|
* Initialise a MMC card request queue.
|
|
|
|
*/
|
2011-06-23 17:40:28 +07:00
|
|
|
int mmc_init_queue(struct mmc_queue *mq, struct mmc_card *card,
|
|
|
|
spinlock_t *lock, const char *subname)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct mmc_host *host = card->host;
|
|
|
|
u64 limit = BLK_BOUNCE_HIGH;
|
|
|
|
int ret;
|
2011-07-10 04:12:36 +07:00
|
|
|
struct mmc_queue_req *mqrq_cur = &mq->mqrq[0];
|
2011-07-01 23:55:31 +07:00
|
|
|
struct mmc_queue_req *mqrq_prev = &mq->mqrq[1];
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2006-09-12 22:00:10 +07:00
|
|
|
if (mmc_dev(host)->dma_mask && *mmc_dev(host)->dma_mask)
|
|
|
|
limit = *mmc_dev(host)->dma_mask;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
mq->card = card;
|
|
|
|
mq->queue = blk_init_queue(mmc_request, lock);
|
|
|
|
if (!mq->queue)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
memset(&mq->mqrq_cur, 0, sizeof(mq->mqrq_cur));
|
2011-07-01 23:55:31 +07:00
|
|
|
memset(&mq->mqrq_prev, 0, sizeof(mq->mqrq_prev));
|
2011-07-10 04:12:36 +07:00
|
|
|
mq->mqrq_cur = mqrq_cur;
|
2011-07-01 23:55:31 +07:00
|
|
|
mq->mqrq_prev = mqrq_prev;
|
2005-04-17 05:20:36 +07:00
|
|
|
mq->queue->queuedata = mq;
|
|
|
|
|
2007-05-12 05:26:16 +07:00
|
|
|
blk_queue_prep_rq(mq->queue, mmc_prep_request);
|
2008-10-15 01:04:46 +07:00
|
|
|
queue_flag_set_unlocked(QUEUE_FLAG_NONROT, mq->queue);
|
2011-06-28 21:16:02 +07:00
|
|
|
if (mmc_can_erase(card))
|
|
|
|
mmc_queue_setup_discard(mq->queue, card);
|
2007-05-12 05:26:16 +07:00
|
|
|
|
|
|
|
#ifdef CONFIG_MMC_BLOCK_BOUNCE
|
2010-09-10 12:33:59 +07:00
|
|
|
if (host->max_segs == 1) {
|
2007-08-09 19:28:02 +07:00
|
|
|
unsigned int bouncesz;
|
|
|
|
|
2007-05-12 05:26:16 +07:00
|
|
|
bouncesz = MMC_QUEUE_BOUNCESZ;
|
|
|
|
|
|
|
|
if (bouncesz > host->max_req_size)
|
|
|
|
bouncesz = host->max_req_size;
|
|
|
|
if (bouncesz > host->max_seg_size)
|
|
|
|
bouncesz = host->max_seg_size;
|
2008-08-17 02:34:02 +07:00
|
|
|
if (bouncesz > (host->max_blk_count * 512))
|
|
|
|
bouncesz = host->max_blk_count * 512;
|
|
|
|
|
|
|
|
if (bouncesz > 512) {
|
2011-07-10 04:12:36 +07:00
|
|
|
mqrq_cur->bounce_buf = kmalloc(bouncesz, GFP_KERNEL);
|
|
|
|
if (!mqrq_cur->bounce_buf) {
|
2011-10-11 13:14:09 +07:00
|
|
|
pr_warning("%s: unable to "
|
2011-07-10 04:12:36 +07:00
|
|
|
"allocate bounce cur buffer\n",
|
2008-08-17 02:34:02 +07:00
|
|
|
mmc_card_name(card));
|
|
|
|
}
|
2011-07-01 23:55:31 +07:00
|
|
|
mqrq_prev->bounce_buf = kmalloc(bouncesz, GFP_KERNEL);
|
|
|
|
if (!mqrq_prev->bounce_buf) {
|
2011-10-11 13:14:09 +07:00
|
|
|
pr_warning("%s: unable to "
|
2011-07-01 23:55:31 +07:00
|
|
|
"allocate bounce prev buffer\n",
|
|
|
|
mmc_card_name(card));
|
|
|
|
kfree(mqrq_cur->bounce_buf);
|
|
|
|
mqrq_cur->bounce_buf = NULL;
|
|
|
|
}
|
2008-08-17 02:34:02 +07:00
|
|
|
}
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-01 23:55:31 +07:00
|
|
|
if (mqrq_cur->bounce_buf && mqrq_prev->bounce_buf) {
|
2008-07-22 19:35:42 +07:00
|
|
|
blk_queue_bounce_limit(mq->queue, BLK_BOUNCE_ANY);
|
2010-02-26 12:20:38 +07:00
|
|
|
blk_queue_max_hw_sectors(mq->queue, bouncesz / 512);
|
2010-02-26 12:20:39 +07:00
|
|
|
blk_queue_max_segments(mq->queue, bouncesz / 512);
|
2007-05-12 05:26:16 +07:00
|
|
|
blk_queue_max_segment_size(mq->queue, bouncesz);
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
mqrq_cur->sg = mmc_alloc_sg(1, &ret);
|
|
|
|
if (ret)
|
2007-08-09 19:28:02 +07:00
|
|
|
goto cleanup_queue;
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
mqrq_cur->bounce_sg =
|
|
|
|
mmc_alloc_sg(bouncesz / 512, &ret);
|
|
|
|
if (ret)
|
2007-08-09 19:28:02 +07:00
|
|
|
goto cleanup_queue;
|
2011-07-10 04:12:36 +07:00
|
|
|
|
2011-07-01 23:55:31 +07:00
|
|
|
mqrq_prev->sg = mmc_alloc_sg(1, &ret);
|
|
|
|
if (ret)
|
|
|
|
goto cleanup_queue;
|
|
|
|
|
|
|
|
mqrq_prev->bounce_sg =
|
|
|
|
mmc_alloc_sg(bouncesz / 512, &ret);
|
|
|
|
if (ret)
|
|
|
|
goto cleanup_queue;
|
2007-05-12 05:26:16 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2011-07-01 23:55:31 +07:00
|
|
|
if (!mqrq_cur->bounce_buf && !mqrq_prev->bounce_buf) {
|
2007-05-12 05:26:16 +07:00
|
|
|
blk_queue_bounce_limit(mq->queue, limit);
|
2010-02-26 12:20:38 +07:00
|
|
|
blk_queue_max_hw_sectors(mq->queue,
|
2008-08-17 02:34:02 +07:00
|
|
|
min(host->max_blk_count, host->max_req_size / 512));
|
2010-09-10 12:33:59 +07:00
|
|
|
blk_queue_max_segments(mq->queue, host->max_segs);
|
2007-05-12 05:26:16 +07:00
|
|
|
blk_queue_max_segment_size(mq->queue, host->max_seg_size);
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
mqrq_cur->sg = mmc_alloc_sg(host->max_segs, &ret);
|
|
|
|
if (ret)
|
2007-05-12 05:26:16 +07:00
|
|
|
goto cleanup_queue;
|
2011-07-10 04:12:36 +07:00
|
|
|
|
2011-07-01 23:55:31 +07:00
|
|
|
|
|
|
|
mqrq_prev->sg = mmc_alloc_sg(host->max_segs, &ret);
|
|
|
|
if (ret)
|
|
|
|
goto cleanup_queue;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2010-09-14 18:12:35 +07:00
|
|
|
sema_init(&mq->thread_sem, 1);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2011-06-23 17:40:28 +07:00
|
|
|
mq->thread = kthread_run(mmc_queue_thread, mq, "mmcqd/%d%s",
|
|
|
|
host->index, subname ? subname : "");
|
2010-10-01 05:40:27 +07:00
|
|
|
|
2006-11-14 02:23:52 +07:00
|
|
|
if (IS_ERR(mq->thread)) {
|
|
|
|
ret = PTR_ERR(mq->thread);
|
2007-05-12 05:26:16 +07:00
|
|
|
goto free_bounce_sg;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2006-11-14 02:23:52 +07:00
|
|
|
return 0;
|
2007-05-12 05:26:16 +07:00
|
|
|
free_bounce_sg:
|
2011-07-10 04:12:36 +07:00
|
|
|
kfree(mqrq_cur->bounce_sg);
|
|
|
|
mqrq_cur->bounce_sg = NULL;
|
2011-07-01 23:55:31 +07:00
|
|
|
kfree(mqrq_prev->bounce_sg);
|
|
|
|
mqrq_prev->bounce_sg = NULL;
|
2011-07-10 04:12:36 +07:00
|
|
|
|
2007-08-09 19:28:02 +07:00
|
|
|
cleanup_queue:
|
2011-07-10 04:12:36 +07:00
|
|
|
kfree(mqrq_cur->sg);
|
|
|
|
mqrq_cur->sg = NULL;
|
|
|
|
kfree(mqrq_cur->bounce_buf);
|
|
|
|
mqrq_cur->bounce_buf = NULL;
|
|
|
|
|
2011-07-01 23:55:31 +07:00
|
|
|
kfree(mqrq_prev->sg);
|
|
|
|
mqrq_prev->sg = NULL;
|
|
|
|
kfree(mqrq_prev->bounce_buf);
|
|
|
|
mqrq_prev->bounce_buf = NULL;
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
blk_cleanup_queue(mq->queue);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mmc_cleanup_queue(struct mmc_queue *mq)
|
|
|
|
{
|
2007-07-24 14:28:11 +07:00
|
|
|
struct request_queue *q = mq->queue;
|
2006-11-15 04:08:16 +07:00
|
|
|
unsigned long flags;
|
2011-07-10 04:12:36 +07:00
|
|
|
struct mmc_queue_req *mqrq_cur = mq->mqrq_cur;
|
2011-07-01 23:55:31 +07:00
|
|
|
struct mmc_queue_req *mqrq_prev = mq->mqrq_prev;
|
2006-11-15 04:08:16 +07:00
|
|
|
|
2007-04-28 21:52:12 +07:00
|
|
|
/* Make sure the queue isn't suspended, as that will deadlock */
|
|
|
|
mmc_queue_resume(mq);
|
|
|
|
|
2006-11-15 04:08:16 +07:00
|
|
|
/* Then terminate our worker thread */
|
2006-11-14 02:23:52 +07:00
|
|
|
kthread_stop(mq->thread);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2010-01-09 05:43:00 +07:00
|
|
|
/* Empty the queue */
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
q->queuedata = NULL;
|
|
|
|
blk_start_queue(q);
|
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
kfree(mqrq_cur->bounce_sg);
|
|
|
|
mqrq_cur->bounce_sg = NULL;
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
kfree(mqrq_cur->sg);
|
|
|
|
mqrq_cur->sg = NULL;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
kfree(mqrq_cur->bounce_buf);
|
|
|
|
mqrq_cur->bounce_buf = NULL;
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-01 23:55:31 +07:00
|
|
|
kfree(mqrq_prev->bounce_sg);
|
|
|
|
mqrq_prev->bounce_sg = NULL;
|
|
|
|
|
|
|
|
kfree(mqrq_prev->sg);
|
|
|
|
mqrq_prev->sg = NULL;
|
|
|
|
|
|
|
|
kfree(mqrq_prev->bounce_buf);
|
|
|
|
mqrq_prev->bounce_buf = NULL;
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
mq->card = NULL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(mmc_cleanup_queue);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mmc_queue_suspend - suspend a MMC request queue
|
|
|
|
* @mq: MMC queue to suspend
|
|
|
|
*
|
|
|
|
* Stop the block request queue, and wait for our thread to
|
|
|
|
* complete any outstanding requests. This ensures that we
|
|
|
|
* won't suspend while a request is being processed.
|
|
|
|
*/
|
|
|
|
void mmc_queue_suspend(struct mmc_queue *mq)
|
|
|
|
{
|
2007-07-24 14:28:11 +07:00
|
|
|
struct request_queue *q = mq->queue;
|
2005-04-17 05:20:36 +07:00
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (!(mq->flags & MMC_QUEUE_SUSPENDED)) {
|
|
|
|
mq->flags |= MMC_QUEUE_SUSPENDED;
|
|
|
|
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
blk_stop_queue(q);
|
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
|
|
|
|
down(&mq->thread_sem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mmc_queue_resume - resume a previously suspended MMC request queue
|
|
|
|
* @mq: MMC queue to resume
|
|
|
|
*/
|
|
|
|
void mmc_queue_resume(struct mmc_queue *mq)
|
|
|
|
{
|
2007-07-24 14:28:11 +07:00
|
|
|
struct request_queue *q = mq->queue;
|
2005-04-17 05:20:36 +07:00
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (mq->flags & MMC_QUEUE_SUSPENDED) {
|
|
|
|
mq->flags &= ~MMC_QUEUE_SUSPENDED;
|
|
|
|
|
|
|
|
up(&mq->thread_sem);
|
|
|
|
|
|
|
|
spin_lock_irqsave(q->queue_lock, flags);
|
|
|
|
blk_start_queue(q);
|
|
|
|
spin_unlock_irqrestore(q->queue_lock, flags);
|
|
|
|
}
|
|
|
|
}
|
2006-12-24 02:03:02 +07:00
|
|
|
|
2008-07-22 19:35:42 +07:00
|
|
|
/*
|
|
|
|
* Prepare the sg list(s) to be handed of to the host driver
|
|
|
|
*/
|
2011-07-10 04:12:36 +07:00
|
|
|
unsigned int mmc_queue_map_sg(struct mmc_queue *mq, struct mmc_queue_req *mqrq)
|
2007-05-12 05:26:16 +07:00
|
|
|
{
|
|
|
|
unsigned int sg_len;
|
2008-07-22 19:35:42 +07:00
|
|
|
size_t buflen;
|
|
|
|
struct scatterlist *sg;
|
|
|
|
int i;
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
if (!mqrq->bounce_buf)
|
|
|
|
return blk_rq_map_sg(mq->queue, mqrq->req, mqrq->sg);
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
BUG_ON(!mqrq->bounce_sg);
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
sg_len = blk_rq_map_sg(mq->queue, mqrq->req, mqrq->bounce_sg);
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
mqrq->bounce_sg_len = sg_len;
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2008-07-22 19:35:42 +07:00
|
|
|
buflen = 0;
|
2011-07-10 04:12:36 +07:00
|
|
|
for_each_sg(mqrq->bounce_sg, sg, sg_len, i)
|
2008-07-22 19:35:42 +07:00
|
|
|
buflen += sg->length;
|
2007-05-12 05:26:16 +07:00
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
sg_init_one(mqrq->sg, mqrq->bounce_buf, buflen);
|
2007-05-12 05:26:16 +07:00
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2008-07-22 19:35:42 +07:00
|
|
|
/*
|
|
|
|
* If writing, bounce the data to the buffer before the request
|
|
|
|
* is sent to the host driver
|
|
|
|
*/
|
2011-07-10 04:12:36 +07:00
|
|
|
void mmc_queue_bounce_pre(struct mmc_queue_req *mqrq)
|
2007-05-12 05:26:16 +07:00
|
|
|
{
|
2011-07-10 04:12:36 +07:00
|
|
|
if (!mqrq->bounce_buf)
|
2007-05-12 05:26:16 +07:00
|
|
|
return;
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
if (rq_data_dir(mqrq->req) != WRITE)
|
2007-05-12 05:26:16 +07:00
|
|
|
return;
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
sg_copy_to_buffer(mqrq->bounce_sg, mqrq->bounce_sg_len,
|
|
|
|
mqrq->bounce_buf, mqrq->sg[0].length);
|
2007-05-12 05:26:16 +07:00
|
|
|
}
|
|
|
|
|
2008-07-22 19:35:42 +07:00
|
|
|
/*
|
|
|
|
* If reading, bounce the data from the buffer after the request
|
|
|
|
* has been handled by the host driver
|
|
|
|
*/
|
2011-07-10 04:12:36 +07:00
|
|
|
void mmc_queue_bounce_post(struct mmc_queue_req *mqrq)
|
2007-05-12 05:26:16 +07:00
|
|
|
{
|
2011-07-10 04:12:36 +07:00
|
|
|
if (!mqrq->bounce_buf)
|
2007-05-12 05:26:16 +07:00
|
|
|
return;
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
if (rq_data_dir(mqrq->req) != READ)
|
2007-05-12 05:26:16 +07:00
|
|
|
return;
|
|
|
|
|
2011-07-10 04:12:36 +07:00
|
|
|
sg_copy_from_buffer(mqrq->bounce_sg, mqrq->bounce_sg_len,
|
|
|
|
mqrq->bounce_buf, mqrq->sg[0].length);
|
2007-05-12 05:26:16 +07:00
|
|
|
}
|