Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
llist.c
Go to the documentation of this file.
1 /*
2  * Lock-less NULL terminated single linked list
3  *
4  * The basic atomic operation of this list is cmpxchg on long. On
5  * architectures that don't have NMI-safe cmpxchg implementation, the
6  * list can NOT be used in NMI handlers. So code that uses the list in
7  * an NMI handler should depend on CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG.
8  *
9  * Copyright 2010,2011 Intel Corp.
10  * Author: Huang Ying <[email protected]>
11  *
12  * This program is free software; you can redistribute it and/or
13  * modify it under the terms of the GNU General Public License version
14  * 2 as published by the Free Software Foundation;
15  *
16  * This program is distributed in the hope that it will be useful,
17  * but WITHOUT ANY WARRANTY; without even the implied warranty of
18  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19  * GNU General Public License for more details.
20  *
21  * You should have received a copy of the GNU General Public License
22  * along with this program; if not, write to the Free Software
23  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24  */
25 #include <linux/kernel.h>
26 #include <linux/export.h>
27 #include <linux/interrupt.h>
28 #include <linux/llist.h>
29 
30 
39 bool llist_add_batch(struct llist_node *new_first, struct llist_node *new_last,
40  struct llist_head *head)
41 {
42  struct llist_node *entry, *old_entry;
43 
44  entry = head->first;
45  for (;;) {
46  old_entry = entry;
47  new_last->next = entry;
48  entry = cmpxchg(&head->first, old_entry, new_first);
49  if (entry == old_entry)
50  break;
51  }
52 
53  return old_entry == NULL;
54 }
56 
72 {
73  struct llist_node *entry, *old_entry, *next;
74 
75  entry = head->first;
76  for (;;) {
77  if (entry == NULL)
78  return NULL;
79  old_entry = entry;
80  next = entry->next;
81  entry = cmpxchg(&head->first, old_entry, next);
82  if (entry == old_entry)
83  break;
84  }
85 
86  return entry;
87 }