/xnu-2422.115.4/osfmk/kern/ |
H A D | queue.c | 76 elt->prev = que; 77 elt->next->prev = elt; 90 elt->prev = que->prev; 91 elt->prev->next = elt; 92 que->prev = elt; 108 elt->next->prev = que; 122 if (que->prev == que) 125 elt = que->prev; 126 elt->prev [all...] |
H A D | queue.h | 98 struct queue_entry *prev; /* previous element */ member in struct:queue_entry 158 (elt)->prev = (queue_entry_t) 0; \ 170 elt->prev = que; 171 elt->next->prev = elt; 181 elt->prev = que->prev; 182 elt->prev->next = elt; 183 que->prev = elt; 194 elt->next->prev = que; 208 if (que->prev ! [all...] |
H A D | processor.c | 224 processor_set_t *prev, pset = kalloc(sizeof (*pset)); local 231 prev = &node->psets; 232 while (*prev != PROCESSOR_SET_NULL) 233 prev = &(*prev)->pset_list; 235 *prev = pset; 436 processor_t prev; local 438 prev = thread_bind(processor); 443 thread_bind(prev);
|
H A D | host_notify.c | 167 send_queue.next->prev = &send_queue; 168 send_queue.prev->next = &send_queue;
|
H A D | machine.c | 247 processor_t prev; local 253 prev = thread_bind(processor); 282 thread_bind(prev);
|
/xnu-2422.115.4/bsd/dev/dtrace/ |
H A D | dtrace_subr.c | 134 dtrace_invop_hdlr_t *hdlr = dtrace_invop_hdlr, *prev = NULL; local 143 prev = hdlr; 147 if (prev == NULL) { 152 prev->dtih_next = hdlr->dtih_next;
|
/xnu-2422.115.4/osfmk/vm/ |
H A D | vm_map_store_rb.c | 75 vm_map_entry_t prev = VM_MAP_ENTRY_NULL; local 87 prev = cur; 92 if( prev == VM_MAP_ENTRY_NULL){ 93 prev = vm_map_to_entry(map); 95 *vm_entry = prev; 131 vm_map_entry_t prev = entry; local 134 panic("VMSCIR1: INSERT FAILED: %d: %p, %p, %p, 0x%lx, 0x%lx, 0x%lx, 0x%lx, 0x%lx, 0x%lx",inserted, prev, entry, vm_map_copy_to_entry(copy), 135 (uintptr_t)prev->vme_start, (uintptr_t)prev->vme_end, (uintptr_t)entry->vme_start, (uintptr_t)entry->vme_end,
|
H A D | vm_purgeable.c | 37 token_idx_t prev; member in struct:token 238 tokens[token].prev = 0; 241 tokens[token].prev = queue->token_q_tail; 305 tokens[queue->token_q_head].prev = 0; 368 new_tail = tokens[token].prev; 411 tokens[token].prev = 0; 427 tokens[token].prev = 0; 536 tokens[queue->token_q_head].prev = 0; 539 tokens[new_head].prev = 0; 613 token_to_insert_after = tokens[token_to_insert_before].prev; [all...] |
H A D | vm_resident.c | 518 m->pageq.prev = NULL; 520 m->listq.prev = NULL; 1340 vm_page_t *prev; local 1342 for (prev = &this->next; 1343 (this = *prev) != mem; 1344 prev = &this->next) 1346 *prev = this->next; 1375 if (!mem->object->internal && (mem->object->objq.next || mem->object->objq.prev)) { 1889 mem->pageq.prev = NULL; 1935 assert(mem->listq.next == NULL && mem->listq.prev [all...] |
H A D | vm_object.c | 552 vm_object_template.memq.prev = NULL; 607 vm_object_template.cached_list.prev = NULL; 609 vm_object_template.msr_q.prev = NULL; 640 vm_object_template.uplq.prev = NULL; 649 vm_object_template.objq.prev=NULL; 1000 vm_object_cached_list.prev,0,0); 1204 object->objq.prev = NULL; 1215 if (object->objq.next || object->objq.prev) 1234 if (object->objq.next == NULL && object->objq.prev == NULL) { 1408 assert(p->pageq.next == NULL && p->pageq.prev [all...] |
/xnu-2422.115.4/libkern/c++/ |
H A D | OSUnserialize.y | 67 struct object *prev; 155 | pairs pair { $2->next = $1; $1->prev = $2; $$ = $2; } 160 $$->prev = NULL; 179 $$->prev = NULL; 184 oo->prev = NULL; 185 $1->prev = oo; 522 o = o->prev; 548 o = o->prev;
|
/xnu-2422.115.4/bsd/kern/ |
H A D | kern_lockf.c | 455 struct lockf **prev, *overlap, *ltmp; local 674 prev = head; 678 ovcase = lf_findoverlap(block, lock, SELF, &prev, &overlap); 693 *prev = lock; 721 *prev = lock; 760 *prev = lock; 762 prev = &lock->lf_next; 765 *prev = overlap->lf_next; 776 prev = &lock->lf_next; 786 *prev 828 struct lockf *overlap, **prev; local 969 struct lockf **prev, *overlap, *lf = *(lock->lf_head); local 1039 lf_findoverlap(struct lockf *lf, struct lockf *lock, int type, struct lockf ***prev, struct lockf **overlap) argument [all...] |
H A D | uipc_mbuf2.c | 137 static struct mbuf *prev = NULL; local 161 dlen = (prev == m) ? prevlen : m->m_len; 162 mlen = (prev == m) ? prevmlen : m->m_len + M_TRAILINGSPACE(m); 189 dlen = (prev == m) ? prevlen : m->m_len; 190 mlen = (prev == m) ? prevmlen : m->m_len + M_TRAILINGSPACE(m); 212 prev = m;
|
H A D | sysv_msg.c | 1228 struct msg **prev; local 1231 prev = &(msqptr->u.msg_first); 1232 while ((msghdr = *prev) != NULL) { 1263 *prev = msghdr->msg_next; 1266 if (prev != 1274 if (prev == 1284 prev = &(msghdr->msg_next);
|
/xnu-2422.115.4/bsd/netinet/ |
H A D | ip_fw2_compat.c | 2084 ipfw_insn *prev = NULL; local 2095 prev = cmd; 2102 prev = cmd; 2114 prev = cmd; 2144 prev = cmd; 2175 prev = cmd; 2187 prev = cmd; 2217 prev = cmd; 2249 prev = cmd; 2260 prev 2627 ipfw_insn *prev = NULL; local [all...] |
H A D | ip_fw2.c | 1344 * unlink a dynamic rule from a chain. prev is a pointer to 1349 #define UNLINK_DYN_RULE(prev, head, q) { \ 1358 if (prev != NULL) \ 1359 prev->next = q = q->next; \ 1386 ipfw_dyn_rule *prev, *q; local 1406 for (prev=NULL, q = ipfw_dyn_v[i] ; q ; ) { 1433 UNLINK_DYN_RULE(prev, ipfw_dyn_v[i], q); 1437 prev=q; 1465 ipfw_dyn_rule *prev, *q=NULL; local 1473 for (prev 2835 struct ip_fw *rule, *f, *prev; local 2920 delete_rule(struct ip_fw **head, struct ip_fw *prev, struct ip_fw *rule) argument 3006 struct ip_fw *rule, *prev; local 3036 mark_inactive(struct ip_fw **prev, struct ip_fw **rule) argument 3062 struct ip_fw *prev, *rule; local 3101 struct ip_fw *prev = NULL, *rule = *chain; local [all...] |
H A D | ip_dummynet.c | 1207 struct dn_flow_queue *q, *prev ; local 1218 for (prev=NULL, q = fs->rq[i] ; q != NULL ; ) 1220 prev = q ; 1225 if (prev != NULL) 1226 prev->next = q = q->next ; 1276 struct dn_flow_queue *q, *prev; local 1329 for (prev=NULL, q = fs->rq[i] ; q ; ) { 1354 if (prev != NULL) 1355 prev->next = q = q->next ; 1362 prev [all...] |
/xnu-2422.115.4/bsd/net/classq/ |
H A D | classq_red.c | 588 struct wtab *prev; local 595 else for (prev = wtab_list; prev->w_next != NULL; prev = prev->w_next) 596 if (prev->w_next == w) { 597 prev->w_next = w->w_next;
|
/xnu-2422.115.4/bsd/dev/random/YarrowCoreLib/src/ |
H A D | prng.c | 456 long int left,prev; 473 for(prev=0,left=outbuflen;left>0;prev+=20,left-=20) 477 memcpy(outbuf+prev,dig,(left>20)?20:left);
|
/xnu-2422.115.4/libkern/zlib/ |
H A D | deflate.c | 218 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \ 224 * prev[] will be initialized on the fly. 317 s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos)); 326 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL || 909 TRY_FREE(strm, strm->state->prev); 950 ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos)); 955 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL || 962 zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos)); 1071 Posf *prev local [all...] |
/xnu-2422.115.4/bsd/net/pktsched/ |
H A D | pktsched_fairq.c | 828 b = cl->cl_head->prev; 848 b->prev = b; 851 b->prev = cl->cl_head->prev; 852 b->prev->next = b; 853 b->next->prev = b; 1058 b->next->prev = b->prev; 1059 b->prev->next = b->next;
|
H A D | pktsched_fairq.h | 140 struct fairq_bucket *prev; /* circular list */ member in struct:fairq_bucket
|
/xnu-2422.115.4/bsd/net/ |
H A D | pf_osfp.c | 501 struct pf_os_fingerprint *f, *prev = NULL; local 506 prev = f; 507 if (prev) 508 SLIST_INSERT_AFTER(prev, ins, fp_next);
|
/xnu-2422.115.4/osfmk/chud/i386/ |
H A D | chud_thread_i386.c | 209 uint32_t prev; // this is really a user32-space pointer to the previous frame member in struct:_cframe_t 275 kr = chudxnu_kern_read(&tmpWord, (vm_offset_t)&fp->prev, sizeof(uint32_t)); 277 kr = chudxnu_task_read(task, &tmpWord, (vm_offset_t)&fp->prev, sizeof(uint32_t));
|
/xnu-2422.115.4/bsd/vfs/ |
H A D | vfs_journal.c | 555 transaction *ctr, *prev=NULL, *next; local 645 for (ctr = jnl->completed_trs; ctr; prev=ctr, ctr=next) { 648 if (prev) { 649 prev->next = ctr->next; 692 prev = NULL; 693 for (ctr = jnl->completed_trs; ctr && tr->journal_start > ctr->journal_start; prev=ctr, ctr=ctr->next) { 697 if (ctr == NULL && prev == NULL) { 704 tr->next = prev->next; 705 prev->next = tr; 2749 block_list_header *blhdr, *prev local [all...] |