Introduce a handy list_first_entry macro (v2)
PATCH 1/1 Introduce a handy list_first_entry macro (v2)
There are many places in the kernel where the construction like
foo = list_entry(head->next, struct foo_struct, list);
are used.
The code might look more descriptive and neat if using the macro
list_first_entry(head, type, member) \
list_entry((head)->next, type, member)Here is the macro itself and the examples of its usage in the generic code. If it will turn out to be useful, I can prepare the set of patches to inject in into arch-specific code, drivers, networking, etc.
Added a comment to the macro as Randy asked.
Signed-off-by Pavel Emelianov <[email protected]>
Signed-off-by Kirill Korotaev <[email protected]>
Cc Randy Dunlap <[email protected]>
Cc Andi Kleen <[email protected]>
Cc Zach Brown <[email protected]>
---
fs/dquot.c +1 -1
@@ -474,7 +474,7 @@ int vfs_quota_sync(struct super_block *sspin_lock (&dq_list_lock); dirty = &dqopt->info[cnt].dqi_dirty_list;while (!list_empty (dirty)) { - dquot = list_entry(dirty->next, struct dquot, dq_dirty); + dquot = list_first_entry(dirty, struct dquot, dq_dirty);/* Dirty and inactive can be only bad dquot... */ if (!test_bit (DQ_ACTIVE_B , &dquot->dq_flags)) {clear_dquot_dirty (dquot);
fs/eventpoll.c +3 -3
@@ -371,7 +371,7 @@ static void ep_unregister_pollwait(strucif (nwait) {while (!list_empty (lsthead)) { - pwq = list_entry(lsthead->next, struct eppoll_entry, llink); + pwq = list_first_entry(lsthead, struct eppoll_entry, llink);list_del_init (&pwq->llink);remove_wait_queue (pwq->whead, &pwq->wait);
@@ -602,7 +602,7 @@ void eventpoll_release_file(struct filemutex_lock (&epmutex);while (!list_empty (lsthead)) { - epi = list_entry(lsthead->next, struct epitem, fllink); + epi = list_first_entry(lsthead, struct epitem, fllink); ep = epi->ep;list_del_init (&epi->fllink);
@@ -943,7 +943,7 @@ static int ep_send_events(struct eventpo* read. */ for (eventcnt =0 ; !list_empty (txlist) && eventcnt < maxevents;) { - epi = list_entry(txlist->next, struct epitem, rdllink); + epi = list_first_entry(txlist, struct epitem, rdllink);prefetch (epi->rdllink.next);/*
fs/inode.c +1 -1
@@ -286,7 +286,7 @@ static void dispose_list(struct list_heawhile (!list_empty (head)) {struct inode *inode; - inode = list_entry(head->next, struct inode, i_list); + inode = list_first_entry(head, struct inode, i_list);list_del (&inode->i_list);if (inode->i_data.nrpages)
fs/inotify.c +1 -1
@@ -509,7 +509,7 @@ void inotify_destroy(struct inotify_handmutex_unlock (&ih->mutex);break ; } - watch = list_entry(watches->next, struct inotify_watch, h_list); + watch = list_first_entry(watches, struct inotify_watch, h_list);get_inotify_watch (watch);mutex_unlock (&ih->mutex);
fs/namespace.c +2 -2
@@ -518,7 +518,7 @@ void release_mounts(struct list_head *he {struct vfsmount *mnt;while (!list_empty (head)) { - mnt = list_entry(head->next, struct vfsmount, mnt_hash); + mnt = list_first_entry(head, struct vfsmount, mnt_hash);list_del_init (&mnt->mnt_hash);if (mnt->mnt_parent != mnt) {struct dentry *dentry;
@@ -1196,7 +1196,7 @@ static void expire_mount_list(struct liswhile (!list_empty (graveyard)) {LIST_HEAD (umounts); - mnt = list_entry(graveyard->next, struct vfsmount, mnt_expire); + mnt = list_first_entry(graveyard, struct vfsmount, mnt_expire);list_del_init (&mnt->mnt_expire);/* don't do anything if the namespace is dead - all the
fs/pnode.c +1 -1
@@ -59,7 +59,7 @@ static int do_make_slave(struct vfsmount }else {struct list_head *p = &mnt->mnt_slave_list;while (!list_empty (p)) { - slave_mnt =list_entry (p->next, + slave_mnt =list_first_entry (p, struct vfsmount, mnt_slave);list_del_init (&slave_mnt->mnt_slave); slave_mnt->mnt_master =NULL ;
include/linux/list.h +11 -0
@@ -426,6 +426,17 @@ static inline void list_splice_init_rcu(container_of (ptr, type, member)/** +* list_first_entry - get the first element from a list +* @ptr: the list head to take the element from. +* @type: the type of the struct this is embedded in. +* @member: the name of the list_struct within the struct. +* +* Note, that list is expected to be not empty. + */ +#define list_first_entry (ptr, type, member) \ + list_entry((ptr)->next, type, member) + +/** * list_for_each - iterate over a list * @pos: the &struct list_head to use as a loop cursor. * @head: the head for your list.
kernel/posix-cpu-timers.c +7 -7
@@ -971,7 +971,7 @@ static void check_thread_timers(struct t maxfire =20 ; tsk->it_prof_expires = cputime_zero;while (!list_empty (timers)) { -struct cpu_timer_list *t =list_entry (timers->next, +struct cpu_timer_list *t =list_first_entry (timers, struct cpu_timer_list, entry);if (!--maxfire ||cputime_lt (prof_ticks (tsk), t->expires.cpu)) {
@@ -986,7 +986,7 @@ static void check_thread_timers(struct t maxfire =20 ; tsk->it_virt_expires = cputime_zero;while (!list_empty (timers)) { -struct cpu_timer_list *t =list_entry (timers->next, +struct cpu_timer_list *t =list_first_entry (timers, struct cpu_timer_list, entry);if (!--maxfire ||cputime_lt (virt_ticks (tsk), t->expires.cpu)) {
@@ -1001,7 +1001,7 @@ static void check_thread_timers(struct t maxfire =20 ; tsk->it_sched_expires =0 ;while (!list_empty (timers)) { -struct cpu_timer_list *t =list_entry (timers->next, +struct cpu_timer_list *t =list_first_entry (timers, struct cpu_timer_list, entry);if (!--maxfire || tsk->sched_time < t->expires.sched) {
@@ -1057,7 +1057,7 @@ static void check_process_timers(struct maxfire =20 ; prof_expires = cputime_zero;while (!list_empty (timers)) { -struct cpu_timer_list *t =list_entry (timers->next, +struct cpu_timer_list *t =list_first_entry (timers, struct cpu_timer_list, entry);if (!--maxfire ||cputime_lt (ptime, t->expires.cpu)) {
@@ -1072,7 +1072,7 @@ static void check_process_timers(struct maxfire =20 ; virt_expires = cputime_zero;while (!list_empty (timers)) { -struct cpu_timer_list *t =list_entry (timers->next, +struct cpu_timer_list *t =list_first_entry (timers, struct cpu_timer_list, entry);if (!--maxfire ||cputime_lt (utime, t->expires.cpu)) {
@@ -1087,7 +1087,7 @@ static void check_process_timers(struct maxfire =20 ; sched_expires =0 ;while (!list_empty (timers)) { -struct cpu_timer_list *t =list_entry (timers->next, +struct cpu_timer_list *t =list_first_entry (timers, struct cpu_timer_list, entry);if (!--maxfire || sched_time < t->expires.sched) {
@@ -1400,7 +1400,7 @@ void set_process_cpu_timer(struct task_s*/ head = &tsk->signal->cpu_timers[clock_idx];if (list_empty (head) || -cputime_ge (list_entry (head->next, +cputime_ge (list_first_entry (head, struct cpu_timer_list, entry)->expires.cpu, *newval)) {/*
kernel/timer.c +2 -2
@@ -627,7 +627,7 @@ static inline void __run_timers(tvec_basvoid (*fn)(unsigned long );unsigned long data; - timer = list_entry(head->next,struct timer_list,entry); + timer = list_first_entry(head, struct timer_list,entry); fn = timer->function; data = timer->data;
@@ -1246,7 +1246,7 @@ static void migrate_timer_list(tvec_basestruct timer_list *timer;while (!list_empty (head)) { - timer = list_entry(head->next, struct timer_list, entry); + timer = list_first_entry(head, struct timer_list, entry);detach_timer (timer,0 );timer_set_base (timer, new_base);internal_add_timer (new_base, timer);