Lines Matching refs:lock
39 * This is an implementation of Anderson's array-based queuing lock.
58 ck_spinlock_anderson_init(struct ck_spinlock_anderson *lock,
71 lock->slots = slots;
72 lock->count = count;
73 lock->mask = count - 1;
74 lock->next = 0;
82 lock->wrap = (UINT_MAX % count) + 1;
84 lock->wrap = 0;
91 ck_spinlock_anderson_locked(struct ck_spinlock_anderson *lock)
96 position = ck_pr_load_uint(&lock->next) & lock->mask;
97 r = ck_pr_load_uint(&lock->slots[position].locked);
103 ck_spinlock_anderson_lock(struct ck_spinlock_anderson *lock,
107 unsigned int count = lock->count;
114 if (lock->wrap != 0) {
115 position = ck_pr_load_uint(&lock->next);
119 next = lock->wrap;
122 } while (ck_pr_cas_uint_value(&lock->next, position,
127 position = ck_pr_faa_uint(&lock->next, 1);
128 position &= lock->mask;
138 while (ck_pr_load_uint(&lock->slots[position].locked) == true)
142 ck_pr_store_uint(&lock->slots[position].locked, true);
145 *slot = lock->slots + position;
150 ck_spinlock_anderson_unlock(struct ck_spinlock_anderson *lock,
158 if (lock->wrap == 0)
159 position = (slot->position + 1) & lock->mask;
161 position = (slot->position + 1) % lock->count;
163 ck_pr_store_uint(&lock->slots[position].locked, false);