korg/linux
0
0
Fork 0
mirror of https://mirrors.bfsu.edu.cn/git/linux.git synced 2024-11-11 12:28:41 +08:00
Code Issues Packages Projects Releases Wiki Activity

[PATCH] use list_add_tail() instead of list_add()

Browse Source 
This patch converts list_add(A, B.prev) to list_add_tail(A, &B) for
readability.

Acked-by: Karsten Keil <kkeil@suse.de>
Cc: Jan Harkes <jaharkes@cs.cmu.edu>
Acked-by: Jan Kara <jack@suse.cz>
AOLed-by: David Woodhouse <dwmw2@infradead.org>
Cc: Sridhar Samudrala <sri@us.ibm.com>
Signed-off-by: Akinobu Mita <mita@miraclelinux.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
This commit is contained in:
Akinobu Mita 2006-06-26 00:24:37 -07:00 committed by Linus Torvalds
parent 38e13929c3
commit 8e13059a37
4 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
fs/coda/psdev.c
View File

@ -259,7 +259,7 @@ static ssize_t coda_psdev_read(struct file * file, char __user * buf,
/* If request was not a signal, enqueue and don't free */ /* If request was not a signal, enqueue and don't free */
if (!(req->uc_flags & REQ_ASYNC)) { if (!(req->uc_flags & REQ_ASYNC)) {
req->uc_flags |= REQ_READ; req->uc_flags |= REQ_READ;
list_add(&(req->uc_chain), vcp->vc_processing.prev); list_add_tail(&(req->uc_chain), &vcp->vc_processing);
goto out; goto out;
} }

2
fs/coda/upcall.c
View File

@ -725,7 +725,7 @@ static int coda_upcall(struct coda_sb_info *sbi,
((union inputArgs *)buffer)->ih.unique = req->uc_unique; ((union inputArgs *)buffer)->ih.unique = req->uc_unique;
/* Append msg to pending queue and poke Venus. */ /* Append msg to pending queue and poke Venus. */
list_add(&(req->uc_chain), vcommp->vc_pending.prev); list_add_tail(&(req->uc_chain), &vcommp->vc_pending);
wake_up_interruptible(&vcommp->vc_waitq); wake_up_interruptible(&vcommp->vc_waitq);
/* We can be interrupted while we wait for Venus to process /* We can be interrupted while we wait for Venus to process

2
fs/dcache.c
View File

@ -638,7 +638,7 @@ resume:
* of the unused list for prune_dcache * of the unused list for prune_dcache
*/ */
if (!atomic_read(&dentry->d_count)) { if (!atomic_read(&dentry->d_count)) {
list_add(&dentry->d_lru, dentry_unused.prev); list_add_tail(&dentry->d_lru, &dentry_unused);
dentry_stat.nr_unused++; dentry_stat.nr_unused++;
found++; found++;
} }

4
fs/dquot.c
View File

@ -250,7 +250,7 @@ static inline struct dquot *find_dquot(unsigned int hashent, struct super_block
/* Add a dquot to the tail of the free list */ /* Add a dquot to the tail of the free list */
static inline void put_dquot_last(struct dquot *dquot) static inline void put_dquot_last(struct dquot *dquot)
{ {
list_add(&dquot->dq_free, free_dquots.prev); list_add_tail(&dquot->dq_free, &free_dquots);
dqstats.free_dquots++; dqstats.free_dquots++;
} }
@ -266,7 +266,7 @@ static inline void put_inuse(struct dquot *dquot)
{ {
/* We add to the back of inuse list so we don't have to restart /* We add to the back of inuse list so we don't have to restart
* when traversing this list and we block */ * when traversing this list and we block */
list_add(&dquot->dq_inuse, inuse_list.prev); list_add_tail(&dquot->dq_inuse, &inuse_list);
dqstats.allocated_dquots++; dqstats.allocated_dquots++;
} }