aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux/llist.h
diff options
context:
space:
mode:
authorHuang Ying <ying.huang@intel.com>2011-09-08 02:00:42 -0400
committerIngo Molnar <mingo@elte.hu>2011-10-04 05:30:53 -0400
commit1230db8e1543c0471dd165727d34647ab098cc1e (patch)
tree6667af62e0a0bb24b315f5b9e61ea7635293135b /include/linux/llist.h
parent22f92bacbeea24b20e447444c28e7cad9f1ac3f8 (diff)
llist: Make some llist functions inline
Because llist code will be used in performance critical scheduler code path, make llist_add() and llist_del_all() inline to avoid function calling overhead and related 'glue' overhead. Signed-off-by: Huang Ying <ying.huang@intel.com> Acked-by: Mathieu Desnoyers <mathieu.desnoyers@efficios.com> Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl> Link: http://lkml.kernel.org/r/1315461646-1379-2-git-send-email-ying.huang@intel.com Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'include/linux/llist.h')
-rw-r--r--include/linux/llist.h64
1 files changed, 58 insertions, 6 deletions
diff --git a/include/linux/llist.h b/include/linux/llist.h
index aa0c8b5b3cd0..3eccdfd66096 100644
--- a/include/linux/llist.h
+++ b/include/linux/llist.h
@@ -37,8 +37,28 @@
37 * architectures that don't have NMI-safe cmpxchg implementation, the 37 * architectures that don't have NMI-safe cmpxchg implementation, the
38 * list can NOT be used in NMI handler. So code uses the list in NMI 38 * list can NOT be used in NMI handler. So code uses the list in NMI
39 * handler should depend on CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG. 39 * handler should depend on CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG.
40 *
41 * Copyright 2010,2011 Intel Corp.
42 * Author: Huang Ying <ying.huang@intel.com>
43 *
44 * This program is free software; you can redistribute it and/or
45 * modify it under the terms of the GNU General Public License version
46 * 2 as published by the Free Software Foundation;
47 *
48 * This program is distributed in the hope that it will be useful,
49 * but WITHOUT ANY WARRANTY; without even the implied warranty of
50 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
51 * GNU General Public License for more details.
52 *
53 * You should have received a copy of the GNU General Public License
54 * along with this program; if not, write to the Free Software
55 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
40 */ 56 */
41 57
58#include <linux/kernel.h>
59#include <asm/system.h>
60#include <asm/processor.h>
61
42struct llist_head { 62struct llist_head {
43 struct llist_node *first; 63 struct llist_node *first;
44}; 64};
@@ -113,14 +133,46 @@ static inline void init_llist_head(struct llist_head *list)
113 * test whether the list is empty without deleting something from the 133 * test whether the list is empty without deleting something from the
114 * list. 134 * list.
115 */ 135 */
116static inline int llist_empty(const struct llist_head *head) 136static inline bool llist_empty(const struct llist_head *head)
117{ 137{
118 return ACCESS_ONCE(head->first) == NULL; 138 return ACCESS_ONCE(head->first) == NULL;
119} 139}
120 140
121void llist_add(struct llist_node *new, struct llist_head *head); 141/**
122void llist_add_batch(struct llist_node *new_first, struct llist_node *new_last, 142 * llist_add - add a new entry
123 struct llist_head *head); 143 * @new: new entry to be added
124struct llist_node *llist_del_first(struct llist_head *head); 144 * @head: the head for your lock-less list
125struct llist_node *llist_del_all(struct llist_head *head); 145 */
146static inline void llist_add(struct llist_node *new, struct llist_head *head)
147{
148 struct llist_node *entry, *old_entry;
149
150#ifndef CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG
151 BUG_ON(in_nmi());
152#endif
153
154 entry = head->first;
155 do {
156 old_entry = entry;
157 new->next = entry;
158 cpu_relax();
159 } while ((entry = cmpxchg(&head->first, old_entry, new)) != old_entry);
160}
161
162/**
163 * llist_del_all - delete all entries from lock-less list
164 * @head: the head of lock-less list to delete all entries
165 *
166 * If list is empty, return NULL, otherwise, delete all entries and
167 * return the pointer to the first entry. The order of entries
168 * deleted is from the newest to the oldest added one.
169 */
170static inline struct llist_node *llist_del_all(struct llist_head *head)
171{
172#ifndef CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG
173 BUG_ON(in_nmi());
174#endif
175
176 return xchg(&head->first, NULL);
177}
126#endif /* LLIST_H */ 178#endif /* LLIST_H */