Home
last modified time | relevance | path

Searched refs:ck_pr_load_uint (Results 1 – 25 of 28) sorted by relevance

12

/freebsd/sys/contrib/ck/include/
H A Dck_rwlock.h67 r = ck_pr_load_uint(&rw->writer); in ck_rwlock_locked_writer()
86 l = ck_pr_load_uint(&rw->n_readers) | in ck_rwlock_locked()
87 ck_pr_load_uint(&rw->writer); in ck_rwlock_locked()
101 if (ck_pr_load_uint(&rw->n_readers) != 0) { in ck_rwlock_write_trylock()
122 while (ck_pr_load_uint(&rw->n_readers) != 0) in CK_ELIDE_TRYLOCK_PROTOTYPE()
137 if (ck_pr_load_uint(&rw->writer) != 0) in CK_ELIDE_PROTOTYPE()
148 if (ck_pr_load_uint(&rw->writer) == 0) { in CK_ELIDE_PROTOTYPE()
165 while (ck_pr_load_uint(&rw->writer) != 0) in CK_ELIDE_TRYLOCK_PROTOTYPE()
176 if (ck_pr_load_uint(&rw->writer) == 0) in CK_ELIDE_TRYLOCK_PROTOTYPE()
192 return ck_pr_load_uint(&rw->n_readers); in ck_rwlock_locked_reader()
[all …]
H A Dck_bitmap.h214 block = ck_pr_load_uint(CK_BITMAP_PTR(bitmap->map, n)); in ck_bitmap_test()
234 ck_pr_load_uint(&src->map[n])); in ck_bitmap_union()
259 ck_pr_load_uint(&src->map[n])); in ck_bitmap_intersection()
286 (~ck_pr_load_uint(&src->map[n]))); in ck_bitmap_intersection_negate()
325 if (ck_pr_load_uint(&bitmap->map[i]) != 0) { in ck_bitmap_empty()
333 word = ck_pr_load_uint(&bitmap->map[i]); in ck_bitmap_empty()
357 if (ck_pr_load_uint(&bitmap->map[i]) != -1U) in ck_bitmap_full()
364 word = ~ck_pr_load_uint(&bitmap->map[i]); in ck_bitmap_full()
387 count += ck_cc_popcount(ck_pr_load_uint(&bitmap->map[i])); in ck_bitmap_count()
392 word = ck_pr_load_uint(&bitmap->map[i]); in ck_bitmap_count()
[all …]
H A Dck_bytelock.h107 while (ck_pr_load_uint(&bytelock->n_readers) != 0) in ck_bytelock_write_lock()
131 if (ck_pr_load_uint(&bytelock->owner) == slot) { in ck_bytelock_read_lock()
143 if (ck_pr_load_uint(&bytelock->owner) == 0) in ck_bytelock_read_lock()
147 while (ck_pr_load_uint(&bytelock->owner) != 0) in ck_bytelock_read_lock()
170 if (ck_pr_load_uint(&bytelock->owner) == 0) in ck_bytelock_read_lock()
174 while (ck_pr_load_uint(&bytelock->owner) != 0) in ck_bytelock_read_lock()
H A Dck_brlock.h90 while (ck_pr_load_uint(&cursor->n_readers) != 0) in ck_brlock_write_lock()
127 while (ck_pr_load_uint(&cursor->n_readers) != 0) { in ck_brlock_write_trylock()
188 while (ck_pr_load_uint(&br->writer) == true) in ck_brlock_read_lock()
209 if (ck_pr_load_uint(&br->writer) == false) in ck_brlock_read_lock()
232 while (ck_pr_load_uint(&br->writer) == true) { in ck_brlock_read_trylock()
257 if (ck_pr_load_uint(&br->writer) == false) in ck_brlock_read_trylock()
H A Dck_ring.h61 c = ck_pr_load_uint(&ring->c_head); in ck_ring_size()
62 p = ck_pr_load_uint(&ring->p_tail); in ck_ring_size()
148 consumer = ck_pr_load_uint(&ring->c_head); in _ck_ring_enqueue_reserve_sp()
183 consumer = ck_pr_load_uint(&ring->c_head); in _ck_ring_enqueue_sp()
229 producer = ck_pr_load_uint(&ring->p_tail); in _ck_ring_dequeue_sc()
262 producer = ck_pr_load_uint(&ring->p_head); in _ck_ring_enqueue_reserve_mp()
266 consumer = ck_pr_load_uint(&ring->c_head); in _ck_ring_enqueue_reserve_mp()
279 new_producer = ck_pr_load_uint(&ring->p_head); in _ck_ring_enqueue_reserve_mp()
303 while (ck_pr_load_uint(&ring->p_tail) != producer) in _ck_ring_enqueue_commit_mp()
322 producer = ck_pr_load_uint(&ring->p_head); in _ck_ring_enqueue_mp()
[all …]
H A Dck_epoch.h157 g_epoch = ck_pr_load_uint(&epoch->epoch); in ck_epoch_begin()
201 unsigned int e = ck_pr_load_uint(&epoch->epoch); in ck_epoch_call()
219 unsigned int e = ck_pr_load_uint(&epoch->epoch); in ck_epoch_call_strict()
245 return ck_pr_load_uint(&ep->epoch); in ck_epoch_value()
H A Dck_rwcohort.h78 while (ck_pr_load_uint(&rw_cohort->write_barrier) > 0) \
83 while (ck_pr_load_uint(&rw_cohort->read_counter) > 0) \
186 if (ck_pr_load_uint(&rw_cohort->read_counter) == 0) \
190 while (ck_pr_load_uint(&rw_cohort->read_counter) > 0) { \
220 while (ck_pr_load_uint(&rw_cohort->read_barrier) > 0) \
279 while (ck_pr_load_uint(&rw_cohort->read_counter) > 0) { \
H A Dck_sequence.h55 version = ck_pr_load_uint(&sq->sequence); in ck_sequence_read_begin()
85 return ck_pr_load_uint(&sq->sequence) != version; in ck_sequence_read_retry()
H A Dck_array.h72 return ck_pr_load_uint(&a->n_committed); in ck_array_length()
81 *length = ck_pr_load_uint(&a->n_committed); in ck_array_buffer()
H A Dck_cohort.h102 if (ck_pr_load_uint(&cohort->waiting_threads) > 0 \
/freebsd/sys/contrib/ck/src/
H A Dck_epoch.c193 epoch = ck_pr_load_uint(&global->epoch); in _ck_epoch_addref()
246 if (ck_pr_load_uint(&global->n_free) == 0) in ck_epoch_recycle()
252 if (ck_pr_load_uint(&record->state) == CK_EPOCH_STATE_FREE) { in ck_epoch_recycle()
341 state = ck_pr_load_uint(&cr->state); in ck_epoch_scan()
347 active = ck_pr_load_uint(&cr->active); in ck_epoch_scan()
350 if (active != 0 && ck_pr_load_uint(&cr->epoch) != epoch) in ck_epoch_scan()
381 n_peak = ck_pr_load_uint(&record->n_peak); in ck_epoch_dispatch()
382 n_pending = ck_pr_load_uint(&record->n_pending); in ck_epoch_dispatch()
443 delta = epoch = ck_pr_load_uint(&global->epoch); in ck_epoch_synchronize_wait()
463 e_d = ck_pr_load_uint(&global->epoch); in ck_epoch_synchronize_wait()
[all …]
H A Dck_barrier_mcs.c88 if (ck_pr_load_uint(&childnotready[0]) != 0) in ck_barrier_mcs_check_children()
90 if (ck_pr_load_uint(&childnotready[1]) != 0) in ck_barrier_mcs_check_children()
92 if (ck_pr_load_uint(&childnotready[2]) != 0) in ck_barrier_mcs_check_children()
94 if (ck_pr_load_uint(&childnotready[3]) != 0) in ck_barrier_mcs_check_children()
131 while (ck_pr_load_uint(&barrier[state->vpid].parentsense) != state->sense) in ck_barrier_mcs()
H A Dck_barrier_tournament.c127 while (ck_pr_load_uint(&rounds[state->vpid][round].flag) != state->sense) in ck_barrier_tournament()
141 while (ck_pr_load_uint(&rounds[state->vpid][round].flag) != state->sense) in ck_barrier_tournament()
150 while (ck_pr_load_uint(&rounds[state->vpid][round].flag) != state->sense) in ck_barrier_tournament()
H A Dck_barrier_centralized.c54 while (sense != ck_pr_load_uint(&barrier->sense)) in ck_barrier_centralized()
H A Dck_hs.c324 r = ck_pr_load_uint(&m->probe_maximum); in ck_hs_map_bound_get()
326 r = ck_pr_load_uint(&m->probe_maximum); in ck_hs_map_bound_get()
889 g = ck_pr_load_uint(generation); in ck_hs_get()
896 g_p = ck_pr_load_uint(generation); in ck_hs_get()
H A Dck_barrier_dissemination.c113 while (ck_pr_load_uint(tflag) != state->sense) in ck_barrier_dissemination()
H A Dck_barrier_combining.c188 while (sense != ck_pr_load_uint(&tnode->sense)) in ck_barrier_combining_aux()
/freebsd/sys/contrib/ck/include/spinlock/
H A Dhclh.h68 r = ck_pr_load_uint(&head->wait); in ck_spinlock_hclh_locked()
97 while (ck_pr_load_uint(&previous->wait) == true && in ck_spinlock_hclh_lock()
99 ck_pr_load_uint(&previous->splice) == false) in ck_spinlock_hclh_lock()
104 ck_pr_load_uint(&previous->splice) == false) in ck_spinlock_hclh_lock()
115 while (ck_pr_load_uint(&previous->wait) == true) in ck_spinlock_hclh_lock()
H A Danderson.h96 position = ck_pr_load_uint(&lock->next) & lock->mask; in ck_spinlock_anderson_locked()
97 r = ck_pr_load_uint(&lock->slots[position].locked); in ck_spinlock_anderson_locked()
115 position = ck_pr_load_uint(&lock->next); in ck_spinlock_anderson_lock()
138 while (ck_pr_load_uint(&lock->slots[position].locked) == true) in ck_spinlock_anderson_lock()
H A Dticket.h215 r = ck_pr_load_uint(&ticket->position) != in ck_spinlock_ticket_locked()
216 ck_pr_load_uint(&ticket->next); in ck_spinlock_ticket_locked()
234 while (ck_pr_load_uint(&ticket->position) != request) in ck_spinlock_ticket_lock()
250 position = ck_pr_load_uint(&ticket->position); in ck_spinlock_ticket_lock_pb()
282 update = ck_pr_load_uint(&ticket->position); in ck_spinlock_ticket_unlock()
H A Ddec.h74 r = ck_pr_load_uint(&lock->value) != 1; in ck_spinlock_dec_locked()
95 while (ck_pr_load_uint(&lock->value) != 1) in ck_spinlock_dec_lock()
114 while (ck_pr_load_uint(&lock->value) != 1) in ck_spinlock_dec_lock_eb()
H A Dclh.h63 r = ck_pr_load_uint(&head->wait); in ck_spinlock_clh_locked()
86 while (ck_pr_load_uint(&previous->wait) == true) in ck_spinlock_clh_lock()
H A Dcas.h70 bool r = ck_pr_load_uint(&lock->value); in ck_spinlock_cas_locked()
81 while (ck_pr_load_uint(&lock->value) == true) in ck_spinlock_cas_lock()
H A Dfas.h71 r = ck_pr_load_uint(&lock->value); in ck_spinlock_fas_locked()
83 } while (ck_pr_load_uint(&lock->value) == true); in ck_spinlock_fas_lock()
H A Dmcs.h107 while (ck_pr_load_uint(&node->locked) == true) in ck_spinlock_mcs_lock()

12