Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 87) sorted by relevance

1234

/xnu-11215/osfmk/i386/
H A Dlocks_i386_opt.c125 uint32_t prev, state; in lck_mtx_lock() local
140 state = prev | LCK_MTX_ILOCKED_MSK | LCK_MTX_MLOCKED_MSK; in lck_mtx_lock()
175 uint32_t prev, state; in lck_mtx_try_lock() local
189 state = prev | LCK_MTX_ILOCKED_MSK | LCK_MTX_MLOCKED_MSK; in lck_mtx_try_lock()
231 uint32_t prev, state; in lck_mtx_lock_spin_always() local
250 state = prev | LCK_MTX_ILOCKED_MSK | LCK_MTX_SPIN_MSK; in lck_mtx_lock_spin_always()
314 uint32_t prev, state; in lck_mtx_try_lock_spin_always() local
330 state = prev | LCK_MTX_ILOCKED_MSK | LCK_MTX_SPIN_MSK; in lck_mtx_try_lock_spin_always()
389 uint32_t prev, state; in lck_mtx_unlock() local
413 prev |= LCK_MTX_MLOCKED_MSK; in lck_mtx_unlock()
[all …]
/xnu-11215/tests/bounded_ptr_src/
H A Darith.inc_dec.cpp90 auto prev = ptr++; in tests() local
91 _assert(&*prev == &array[0]); in tests()
95 auto prev = ptr++; in tests() local
100 auto prev = ptr++; in tests() local
105 auto prev = ptr++; in tests() local
110 auto prev = ptr++; in tests() local
115 auto prev = ptr--; in tests() local
120 auto prev = ptr--; in tests() local
125 auto prev = ptr--; in tests() local
130 auto prev = ptr--; in tests() local
[all …]
/xnu-11215/osfmk/kern/
H A Dsmr.h1202 if (*lastp != prev || smr_serialized_load(prev)) { in __smrq_serialized_insert()
1222 if (next != NULL && next->prev != prev) { in __smrq_serialized_insert()
1226 if (*lastp != prev || smr_serialized_load(prev)) { in __smrq_serialized_insert()
1232 elem->prev = prev; in __smrq_serialized_insert()
1252 if (*lastp != prev || smr_serialized_load(prev)) { in __smrq_serialized_insert_relaxed()
1272 if (next != NULL && next->prev != prev) { in __smrq_serialized_insert_relaxed()
1276 if (*lastp != prev || smr_serialized_load(prev)) { in __smrq_serialized_insert_relaxed()
1282 elem->prev = prev; in __smrq_serialized_insert_relaxed()
1350 next->prev = prev; in __smrq_serialized_remove_one()
1422 prev = old_elem->prev; in __smrq_serialized_replace()
[all …]
H A Dqueue.h224 if (elt->prev->next != elt || elt->next->prev != elt) { in __QUEUE_ELT_VALIDATE()
286 elt->prev = que; in enqueue_head()
302 que->prev = elt; in enqueue_tail()
332 elt = que->prev; in dequeue_tail()
366 entry->prev = pred; in insque()
406 elt->prev = que; in re_queue_head()
407 n_elt->prev = elt; in re_queue_head()
437 p_elt = que->prev; in re_queue_tail()
439 elt->prev = p_elt; in re_queue_tail()
441 que->prev = elt; in re_queue_tail()
[all …]
H A Dcircle_queue.h66 __builtin_assume(elt->prev != NULL); in circle_queue_last()
67 return elt->prev; in circle_queue_last()
98 cq->head = elt->next = elt->prev = elt; in circle_enqueue_tail()
104 elt->prev = tail; in circle_enqueue_tail()
106 head->prev = elt; in circle_enqueue_tail()
124 queue_entry_t elt_prev = elt->prev; in circle_dequeue()
134 elt_next->prev = elt_prev; in circle_dequeue()
174 s_tail = s_head->prev; in circle_queue_concat_tail()
185 d_tail = d_head->prev; in circle_queue_concat_tail()
191 s_head->prev = d_tail; in circle_queue_concat_tail()
[all …]
H A Dbits.h194 bitmap_t prev; in atomic_bit_set() local
195 prev = __c11_atomic_fetch_or(map, BIT(n), mem_order); in atomic_bit_set()
196 return bit_test(prev, n); in atomic_bit_set()
202 bitmap_t prev; in atomic_bit_clear() local
204 return bit_test(prev, n); in atomic_bit_clear()
431 if (prev == 0) { in bitmap_next()
435 int64_t i = bitmap_index(prev - 1); in bitmap_next()
436 int res = __bit_next(map[i], bits(prev, 5, 0)); in bitmap_next()
454 if ((prev + 1) >= nbits) { in bitmap_lsb_next()
458 uint64_t i = bitmap_index(prev + 1); in bitmap_lsb_next()
[all …]
H A Dmpsc_queue.h238 __mpsc_queue_append_was_empty(mpsc_queue_head_t q, mpsc_queue_chain_t prev) in __mpsc_queue_append_was_empty() argument
240 return &q->mpqh_head == prev; in __mpsc_queue_append_was_empty()
265 __mpsc_queue_append_update_prev(mpsc_queue_chain_t prev, mpsc_queue_chain_t elm) in __mpsc_queue_append_update_prev() argument
267 os_atomic_store(&prev->mpqc_next, elm, relaxed); in __mpsc_queue_append_update_prev()
298 mpsc_queue_chain_t prev = __mpsc_queue_append_update_tail(q, last); in mpsc_queue_append_list() local
299 __mpsc_queue_append_update_prev(prev, first); in mpsc_queue_append_list()
300 return __mpsc_queue_append_was_empty(q, prev); in mpsc_queue_append_list()
H A Dpriority_queue.h142 struct priority_queue_entry *prev; member
152 struct priority_queue_entry_deadline *prev; member
163 struct priority_queue_entry_sched *prev; member
173 struct priority_queue_entry_stable *prev; member
186 struct priority_queue_entry *prev; member
192 struct priority_queue_entry_deadline *prev; member
204 struct priority_queue_entry_sched *prev; member
211 struct priority_queue_entry_stable *prev; member
H A Dlock_rw.c748 uint32_t data, prev; in lck_rw_interlock_spin() local
788 uint32_t data, prev; variable
850 uint32_t data, prev; in lck_rw_drop() local
1406 uint32_t data, prev; variable
1712 uint32_t data, prev; in lck_rw_lock_shared_to_exclusive() local
1832 uint32_t data, prev; in lck_rw_lock_exclusive_to_shared() local
1852 if (!((prev & LCK_RW_W_WAITING) && (prev & LCK_RW_PRIV_EXCL))) { in lck_rw_lock_exclusive_to_shared()
1916 uint32_t data, prev; in lck_rw_try_lock_shared_internal_inline() local
2013 uint32_t data, prev; in lck_rw_try_lock_exclusive_internal_inline() local
2211 uint32_t data, prev; in lck_rw_done() local
[all …]
H A Dbtlog.c441 btref_smr_t *head, *prev; in __btlib_split_step() local
459 prev = &bts->bts_next; in __btlib_split_step()
465 smr_clear_store(prev); in __btlib_split_step()
685 btref_smr_t *prev; in __btlib_insert() local
722 prev = &bts->bts_next; in __btlib_insert()
768 btref_smr_t *prev; in __btlib_remove_locked() local
1213 *prev = bthe->bthe_next; in __btlog_hash_stailq_remove()
1241 uint32_t *prev; in __btlog_hash_remove() local
1249 ppos = *prev; in __btlog_hash_remove()
1313 uint32_t *prev; in __btlog_hash_erase() local
[all …]
H A Dsmr_hash.h930 __smrq_slink_t *prev; member
954 it.prev = &it.hd_next->first; in smr_hash_iter_begin()
955 it.link = smr_entered_load(it.prev); in smr_hash_iter_begin()
994 it->prev = &it->link->next; in smr_hash_iter_advance()
996 while ((it->link = smr_entered_load(it->prev)) == NULL) { in smr_hash_iter_advance()
1000 it->prev = &it->hd_next->first; in smr_hash_iter_advance()
1022 smr_serialized_store_relaxed(it->prev, it->link); in smr_hash_iter_serialized_erase()
1028 it->prev = &it->hd_next->first; in smr_hash_iter_serialized_erase()
1029 it->link = smr_serialized_load(it->prev); in smr_hash_iter_serialized_erase()
1484 __smrq_slink_t *prev; member
H A Dcompact_id.c229 uint32_t prev = compact_id_prev_max(sidx); variable
234 for (compact_id_t cid = prev; cid < prev + size; cid++) {
/xnu-11215/iokit/DriverKit/
H A Dqueue_implementation.h224 if (elt->prev->next != elt || elt->next->prev != elt) { in __QUEUE_ELT_VALIDATE()
286 elt->prev = que; in enqueue_head()
302 que->prev = elt; in enqueue_tail()
332 elt = que->prev; in dequeue_tail()
366 entry->prev = pred; in insque()
406 elt->prev = que; in re_queue_head()
407 n_elt->prev = elt; in re_queue_head()
437 p_elt = que->prev; in re_queue_tail()
439 elt->prev = p_elt; in re_queue_tail()
441 que->prev = elt; in re_queue_tail()
[all …]
/xnu-11215/tests/
H A Dturnstile_multihop_helper.h81 u32 prev; in ull_lock() local
93 prev = 0; in ull_lock()
95 if (prev == 0) { in ull_lock()
101 u32 value = prev; in ull_lock()
105 if (prev == value) { in ull_lock()
108 } else if (prev & ULL_WAITERS) { in ull_lock()
110 value = prev; in ull_lock()
157 u32 prev = ull_locked; in ull_unlock() local
159 if (prev == ull_locked) { in ull_unlock()
164 if (prev == 0) { in ull_unlock()
[all …]
/xnu-11215/osfmk/vm/
H A Dvm_page_internal.h167 elt->prev = que->prev; in vm_page_enqueue_tail()
185 next->prev = prev_pck; in vm_page_remque()
186 prev->next = next_pck; in vm_page_remque()
189 elt->prev = 0; in vm_page_remque()
228 if (prev == NULL) { in vm_page_queue_enter_clump()
246 prev = (vm_page_queue_entry_t)VM_PAGE_UNPACK_PTR(p->vmp_pageq.prev); in vm_page_queue_enter_clump()
256 if (prev == NULL) { in vm_page_queue_enter_clump()
257 prev = (vm_page_queue_entry_t)VM_PAGE_UNPACK_PTR(head->prev); in vm_page_queue_enter_clump()
263 elt->vmp_pageq.prev = next->prev; in vm_page_queue_enter_clump()
264 prev->next = next->prev = VM_PAGE_PACK_PTR(elt); in vm_page_queue_enter_clump()
[all …]
H A Dvm_page.h92 vm_page_packed_t prev; /* previous element */ member
439 (q)->prev = VM_PAGE_PACK_PTR(q); \
460 vm_page_packed_t __pck_prev = (head)->prev; \
469 (elt)->field.prev = __pck_prev; \
471 (head)->prev = __pck_elt; \
536 (head)->prev = __pck_elt; \
540 __next->field.prev = __pck_elt; \
608 (head)->prev = __pck_head; \
610 __next->field.prev = __pck_head; \
615 (entry)->field.prev = 0; \
[all …]
H A Dvm_purgeable.c64 token_idx_t prev; member
275 tokens[token].prev = 0; in vm_purgeable_token_add()
436 tokens[token].prev = 0; in vm_purgeable_token_delete_first()
450 tokens[token].prev = 0; in vm_purgeable_token_delete_last()
555 tokens[new_head].prev = 0; in vm_purgeable_token_remove_ripe()
651 tokens[token].prev = 0; in vm_purgeable_token_choose_and_delete_ripe()
773 object->objq.prev = NULL; in vm_purgeable_object_find_and_lock()
1024 object->objq.prev = NULL; in vm_purgeable_object_add()
1096 object->objq.prev = NULL; in vm_purgeable_object_remove()
1307 object->objq.prev = NULL; in vm_purgeable_queue_purge_task_owned()
[all …]
H A Dvm_map_store_rb.c65 vm_map_entry_t prev = VM_MAP_ENTRY_NULL; in vm_map_store_lookup_entry_rb() local
75 prev = cur; in vm_map_store_lookup_entry_rb()
80 if (prev == VM_MAP_ENTRY_NULL) { in vm_map_store_lookup_entry_rb()
81 prev = vm_map_to_entry(map); in vm_map_store_lookup_entry_rb()
83 *vm_entry = prev; in vm_map_store_lookup_entry_rb()
175 l_prev = (vm_map_entry_t) map->holes_list->prev; in vm_map_delete_hole()
421 new_hole_entry->prev = new_hole_entry->next = CAST_TO_VM_MAP_ENTRY(map->holes_list); in update_holes_on_entry_deletion()
424 l_prev = map->holes_list->prev; in update_holes_on_entry_deletion()
427 new_hole_entry->prev = l_prev; in update_holes_on_entry_deletion()
435 new_hole_entry->prev = hole_entry; in update_holes_on_entry_deletion()
[all …]
H A Dvm_resident.c2185 *prev = this->vmp_next_m; in vm_page_remove()
2944 mem->vmp_specialq.prev = 0; in vm_page_remove_from_specialq()
2964 mem->vmp_specialq.prev = 0; in vm_page_remove_from_specialq()
5310 sq->age_q.prev = aq->age_q.prev; in vm_page_speculate_ageit()
5322 t->vmp_pageq.prev = sq->age_q.prev; in vm_page_speculate_ageit()
5327 sq->age_q.prev = aq->age_q.prev; in vm_page_speculate_ageit()
9404 vm_allocation_site_t * prev; in vm_tag_alloc_locked() local
9424 if (!prev) { in vm_tag_alloc_locked()
9430 if (!prev->tag) { in vm_tag_alloc_locked()
9433 if (prev->total) { in vm_tag_alloc_locked()
[all …]
/xnu-11215/bsd/netinet/
H A Dtcp_timer.c2478 int32_t diff = (int32_t) (cur - *prev); in tcp_cumulative_stat()
2484 *prev = cur; in tcp_cumulative_stat()
2492 int64_t diff = (int64_t) (cur - *prev); in tcp_cumulative_stat64()
2498 *prev = cur; in tcp_cumulative_stat64()
2509 static struct tcp_last_report_stats prev; in tcp_report_stats() local
2611 &prev.tcps_ecn_lost_syn, &stat.ecn_lost_syn); in tcp_report_stats()
2615 &prev.tcps_ecn_recv_ce, &stat.ecn_recv_ce); in tcp_report_stats()
2617 &prev.tcps_ecn_recv_ece, &stat.ecn_recv_ece); in tcp_report_stats()
2619 &prev.tcps_ecn_recv_ece, &stat.ecn_recv_ece); in tcp_report_stats()
2621 &prev.tcps_ecn_sent_ece, &stat.ecn_sent_ece); in tcp_report_stats()
[all …]
H A Dmptcp.c442 if (prev == NULL) { in mptcp_input()
455 prev = iter; in mptcp_input()
509 prev = save; in mptcp_input()
512 if (prev) { in mptcp_input()
513 prev->m_next = NULL; in mptcp_input()
537 if (prev != NULL) { in mptcp_input()
538 tail = prev; in mptcp_input()
544 prev = save = NULL; in mptcp_input()
569 if (prev != NULL) { in mptcp_input()
570 tail = prev; in mptcp_input()
[all …]
/xnu-11215/libkern/c++/
H A Dpriority_queue.cpp174 child->prev = parent; in merge_pair_inline()
176 unpack_child(parent)->prev = child; in merge_pair_inline()
181 parent->prev = NULL; in merge_pair_inline()
214 pair_item_a->prev = pair_list; in meld_pair()
222 pair->prev = pair_list; in meld_pair()
228 elt = pair_list->prev; in meld_pair()
239 e->next = e->prev = NULL; in list_clear()
245 assert(elt->prev != NULL); in list_remove()
250 pack_child(elt->prev, elt->next); in list_remove()
252 elt->prev->next = elt->next; in list_remove()
[all …]
H A DOSUnserialize.y67 struct object *prev; member
185 | pairs pair { $2->next = $1; $1->prev = $2; $$ = $2; }
190 $$->prev = NULL;
209 $$->prev = NULL;
214 oo->prev = NULL;
215 $1->prev = oo;
554 o = o->prev; in buildOSDictionary()
580 o = o->prev; in buildOSArray()
/xnu-11215/bsd/kern/
H A Dkern_lockf.c836 prev = head; in lf_setlock()
857 *prev = lock; in lf_setlock()
888 *prev = lock; in lf_setlock()
921 *prev = lock; in lf_setlock()
923 prev = &lock->lf_next; in lf_setlock()
939 prev = &lock->lf_next; in lf_setlock()
949 *prev = lock; in lf_setlock()
1006 prev = head; in lf_clearlock()
1105 prev = head; in lf_transferlock()
1312 *prev = &lf->lf_next; in lf_findoverlap()
[all …]
/xnu-11215/tests/skywalk/
H A Dskt_nslots.c51 channel_slot_t prev, slot; in skt_nslots_common() local
167 prev = NULL; in skt_nslots_common()
185 prev = slot; in skt_nslots_common()
189 assert(prev); in skt_nslots_common()
191 error = os_channel_advance_slot(ring, prev); in skt_nslots_common()
237 prev = NULL; in skt_nslots_common()
249 prev = slot; in skt_nslots_common()
253 assert(prev); in skt_nslots_common()
255 error = os_channel_advance_slot(ring, prev); in skt_nslots_common()

1234