blob: 350930f73c5821ca5619101985bb9110d033ade4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/* SPDX-License-Identifier: GPL-2.0-or-later
* Copyright 2018 Blender Foundation. All rights reserved. */
/** \file
* \ingroup bli
*/
#include "MEM_guardedalloc.h"
#include "BLI_linklist_lockfree.h"
#include "BLI_strict_flags.h"
#include "atomic_ops.h"
void BLI_linklist_lockfree_init(LockfreeLinkList *list)
{
list->dummy_node.next = NULL;
list->head = list->tail = &list->dummy_node;
}
void BLI_linklist_lockfree_free(LockfreeLinkList *list, LockfreeeLinkNodeFreeFP free_func)
{
if (free_func != NULL) {
/* NOTE: We start from a first user-added node. */
LockfreeLinkNode *node = list->head->next;
while (node != NULL) {
LockfreeLinkNode *node_next = node->next;
free_func(node);
node = node_next;
}
}
}
void BLI_linklist_lockfree_clear(LockfreeLinkList *list, LockfreeeLinkNodeFreeFP free_func)
{
BLI_linklist_lockfree_free(list, free_func);
BLI_linklist_lockfree_init(list);
}
void BLI_linklist_lockfree_insert(LockfreeLinkList *list, LockfreeLinkNode *node)
{
/* Based on:
*
* John D. Valois
* Implementing Lock-Free Queues
*
* http://people.csail.mit.edu/bushl2/rpi/portfolio/lockfree-grape/documents/lock-free-linked-lists.pdf
*/
bool keep_working;
LockfreeLinkNode *tail_node;
node->next = NULL;
do {
tail_node = list->tail;
keep_working = (atomic_cas_ptr((void **)&tail_node->next, NULL, node) != NULL);
if (keep_working) {
atomic_cas_ptr((void **)&list->tail, tail_node, tail_node->next);
}
} while (keep_working);
atomic_cas_ptr((void **)&list->tail, tail_node, node);
}
LockfreeLinkNode *BLI_linklist_lockfree_begin(LockfreeLinkList *list)
{
return list->head->next;
}
|
