Blame view
lib/llist.c
3.14 KB
f49f23abf lib, Add lock-les... |
1 2 3 4 5 |
/* * Lock-less NULL terminated single linked list * * The basic atomic operation of this list is cmpxchg on long. On * architectures that don't have NMI-safe cmpxchg implementation, the |
2c30245c6 llist: Remove the... |
6 7 |
* list can NOT be used in NMI handlers. So code that uses the list in * an NMI handler should depend on CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG. |
f49f23abf lib, Add lock-les... |
8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 |
* * Copyright 2010,2011 Intel Corp. * Author: Huang Ying <ying.huang@intel.com> * * 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; * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include <linux/kernel.h> |
8bc3bcc93 lib: reduce the u... |
26 |
#include <linux/export.h> |
f49f23abf lib, Add lock-les... |
27 28 |
#include <linux/interrupt.h> #include <linux/llist.h> |
f49f23abf lib, Add lock-les... |
29 30 |
/** |
f49f23abf lib, Add lock-les... |
31 32 33 34 |
* llist_add_batch - add several linked entries in batch * @new_first: first entry in batch to be added * @new_last: last entry in batch to be added * @head: the head for your lock-less list |
781f7fd91 llist: Return whe... |
35 36 |
* * Return whether list is empty before adding. |
f49f23abf lib, Add lock-les... |
37 |
*/ |
781f7fd91 llist: Return whe... |
38 |
bool llist_add_batch(struct llist_node *new_first, struct llist_node *new_last, |
f49f23abf lib, Add lock-les... |
39 40 |
struct llist_head *head) { |
fb4214db5 llist: fix/simpli... |
41 |
struct llist_node *first; |
f49f23abf lib, Add lock-les... |
42 |
|
fb4214db5 llist: fix/simpli... |
43 44 45 |
do { new_last->next = first = ACCESS_ONCE(head->first); } while (cmpxchg(&head->first, first, new_first) != first); |
781f7fd91 llist: Return whe... |
46 |
|
fb4214db5 llist: fix/simpli... |
47 |
return !first; |
f49f23abf lib, Add lock-les... |
48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 |
} EXPORT_SYMBOL_GPL(llist_add_batch); /** * llist_del_first - delete the first entry of lock-less list * @head: the head for your lock-less list * * If list is empty, return NULL, otherwise, return the first entry * deleted, this is the newest added one. * * Only one llist_del_first user can be used simultaneously with * multiple llist_add users without lock. Because otherwise * llist_del_first, llist_add, llist_add (or llist_del_all, llist_add, * llist_add) sequence in another user may change @head->first->next, * but keep @head->first. If multiple consumers are needed, please * use llist_del_all or use lock between consumers. */ struct llist_node *llist_del_first(struct llist_head *head) { struct llist_node *entry, *old_entry, *next; |
f49f23abf lib, Add lock-les... |
68 |
entry = head->first; |
a3127336b llist: Move cpu_r... |
69 |
for (;;) { |
f49f23abf lib, Add lock-les... |
70 71 72 73 |
if (entry == NULL) return NULL; old_entry = entry; next = entry->next; |
a3127336b llist: Move cpu_r... |
74 75 76 |
entry = cmpxchg(&head->first, old_entry, next); if (entry == old_entry) break; |
a3127336b llist: Move cpu_r... |
77 |
} |
f49f23abf lib, Add lock-les... |
78 79 80 81 |
return entry; } EXPORT_SYMBOL_GPL(llist_del_first); |
b89241e8c llists: move llis... |
82 83 84 85 86 |
/** * llist_reverse_order - reverse order of a llist chain * @head: first item of the list to be reversed * |
0791a6057 llists-move-llist... |
87 |
* Reverse the order of a chain of llist entries and return the |
b89241e8c llists: move llis... |
88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 |
* new first entry. */ struct llist_node *llist_reverse_order(struct llist_node *head) { struct llist_node *new_head = NULL; while (head) { struct llist_node *tmp = head; head = head->next; tmp->next = new_head; new_head = tmp; } return new_head; } EXPORT_SYMBOL_GPL(llist_reverse_order); |