Searched refs:qlink (Results 1 - 14 of 14) sorted by relevance
/darwin-on-arm/xnu/bsd/netat/ |
H A D | adsp_misc.c | 68 struct qlink **qhead; 69 struct qlink *qelem; 75 register struct qlink *q; 94 qelem->qlinkp = (struct qlink *) 0;
|
H A D | adsp_CLListen.c | 95 if (qAddToEnd((struct qlink **)&sp->opb, (struct qlink *)clpb)) /* Add to list of listeners */
|
H A D | adsp_Init.c | 86 qAddToEnd((struct qlink **)AT_ADSP_STREAMS, (struct qlink *)sp); /* Put on linked list of connections */
|
H A D | adsp_attention.c | 124 qAddToEnd((struct qlink **)&sp->sapb, (struct qlink *)pb); /* Just add to end of queue */
|
H A D | adsp_internal.h | 319 int qAddToEnd(struct qlink **qhead, struct qlink *qelem); 360 struct qlink { struct 361 struct qlink *qlinkp; 364 int qAddToEnd(struct qlink **, struct qlink *);
|
H A D | adsp_reset.c | 229 qAddToEnd((struct qlink **)&sp->frpb, (struct qlink *)rpb);
|
H A D | adsp_Read.c | 346 qAddToEnd((struct qlink **)&sp->rpb, (struct qlink *)pb); /* deliver data to user directly */ 360 qAddToEnd((struct qlink **)&sp->rpb, (struct qlink *)pb); /* and queue it for later */
|
H A D | adsp_Close.c | 459 qAddToEnd((struct qlink **)&sp->opb, (struct qlink *)pb); /* and save it */
|
/darwin-on-arm/xnu/osfmk/i386/ |
H A D | pmap_internal.h | 190 queue_head_t qlink; 197 queue_head_t qlink; 206 entry and then continues down the qlink onto the hashed entries. Code that is 215 queue_head_t qlink; member in struct:pv_rooted_entry 224 queue_head_t qlink; member in struct:pv_hashed_entry 288 pv_hashed_free_list = (pv_hashed_entry_t)(*pvh_ep)->qlink.next; 302 pvh_et->qlink.next = (queue_entry_t)pv_hashed_free_list; 315 pv_hashed_kern_free_list = (pv_hashed_entry_t)(*pvh_e)->qlink.next; 330 pvh_et->qlink.next = (queue_entry_t)pv_hashed_kern_free_list; 520 insque(&pvh_e->qlink, [all...] |
H A D | pmap_common.c | 243 pvh_e->qlink.next = (queue_entry_t)pvh_eh; 257 pvh_e->qlink.next = (queue_entry_t)pvh_eh; 305 pvh_e->qlink.next = (queue_entry_t)pvh_eh; 323 pvh_e->qlink.next = (queue_entry_t)pvh_eh;
|
H A D | pmap_x86_common.c | 367 nexth = (pv_hashed_entry_t)queue_next(&pvh_e->qlink); 702 queue_init(&pv_h->qlink); 960 pvh_e->qlink.next = (queue_entry_t) pvh_eh; 1185 nexth = (pv_hashed_entry_t) queue_next(&pvh_e->qlink); 1228 pvh_e->qlink.next = (queue_entry_t) pvh_eh; 1252 pvh_e = (pv_hashed_entry_t) queue_next(&pv_h->qlink); 1258 pvh_e->qlink.next = (queue_entry_t) pvh_eh; 1344 pv_e = (pv_hashed_entry_t)queue_next(&pv_e->qlink); 1429 pv_e = (pv_hashed_entry_t)queue_next(&pv_e->qlink);
|
H A D | pmap.c | 984 queue_init(&pv_e->qlink);
|
/darwin-on-arm/xnu/osfmk/arm/ |
H A D | pmap.c | 328 queue_head_t qlink; 334 queue_head_t qlink; 343 down the qlink onto the hashed entries. Code that is looking up a specific pv entry first 367 queue_head_t qlink; member in struct:pv_rooted_entry 378 queue_head_t qlink; member in struct:pv_hashed_entry 430 pv_hashed_free_list = (pv_hashed_entry_t)pvh_e->qlink.next; \ 441 pvh_et->qlink.next = (queue_entry_t)pv_hashed_free_list; \ 450 pv_hashed_kern_free_list = (pv_hashed_entry_t)pvh_e->qlink.next; \ 461 pvh_et->qlink.next = (queue_entry_t)pv_hashed_kern_free_list; \ 699 insque(&pvh_e->qlink, [all...] |
/darwin-on-arm/xnu/osfmk/x86_64/ |
H A D | pmap.c | 631 queue_init(&pv_e->qlink);
|
Completed in 102 milliseconds