Searched refs:head (Results 1 - 25 of 82) sorted by relevance

1234

/haiku/src/add-ons/kernel/drivers/audio/ac97/auich/
H A Dqueue.h49 * head of the list. Elements being removed from the head of the list
59 * or after an existing element or at the head of the list. A list
62 * A simple queue is headed by a pair of pointers, one the head of the
65 * head of the list. New elements can be added to the list after
66 * an existing element, at the head of the list, or at the end of the
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
76 * A circle queue is headed by a pair of pointers, one to the head of the
80 * an existing element, at the head o
[all...]
/haiku/src/add-ons/kernel/drivers/audio/ac97/auvia/
H A Dqueue.h49 * head of the list. Elements being removed from the head of the list
59 * or after an existing element or at the head of the list. A list
62 * A simple queue is headed by a pair of pointers, one the head of the
65 * head of the list. New elements can be added to the list after
66 * an existing element, at the head of the list, or at the end of the
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
76 * A circle queue is headed by a pair of pointers, one to the head of the
80 * an existing element, at the head o
[all...]
/haiku/src/add-ons/kernel/drivers/audio/ac97/es1370/
H A Dqueue.h49 * head of the list. Elements being removed from the head of the list
59 * or after an existing element or at the head of the list. A list
62 * A simple queue is headed by a pair of pointers, one the head of the
65 * head of the list. New elements can be added to the list after
66 * an existing element, at the head of the list, or at the end of the
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
76 * A circle queue is headed by a pair of pointers, one to the head of the
80 * an existing element, at the head o
[all...]
/haiku/src/add-ons/kernel/drivers/audio/echo/
H A Dqueue.h49 * head of the list. Elements being removed from the head of the list
59 * or after an existing element or at the head of the list. A list
62 * A simple queue is headed by a pair of pointers, one the head of the
65 * head of the list. New elements can be added to the list after
66 * an existing element, at the head of the list, or at the end of the
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
76 * A circle queue is headed by a pair of pointers, one to the head of the
80 * an existing element, at the head o
[all...]
/haiku/src/add-ons/kernel/drivers/audio/emuxki/
H A Dqueue.h49 * head of the list. Elements being removed from the head of the list
59 * or after an existing element or at the head of the list. A list
62 * A simple queue is headed by a pair of pointers, one the head of the
65 * head of the list. New elements can be added to the list after
66 * an existing element, at the head of the list, or at the end of the
69 * A tail queue is headed by a pair of pointers, one to the head of the
73 * after an existing element, at the head of the list, or at the end of
76 * A circle queue is headed by a pair of pointers, one to the head of the
80 * an existing element, at the head o
[all...]
/haiku/headers/private/firewire/
H A Dqueue.h45 * added to the list after an existing element or at the head of the list.
46 * Elements being removed from the head of the list should use the explicit
53 * head of the list and the other to the tail of the list. The elements are
56 * to the list after an existing element, at the head of the list, or at the
57 * end of the list. Elements being removed from the head of the tail queue
67 * or after an existing element or at the head of the list. A list
70 * A tail queue is headed by a pair of pointers, one to the head of the
74 * after an existing element, at the head of the list, or at the end of
104 /* Store the last 2 places the queue element or head was altered */
115 #define QMD_TRACE_HEAD(head) d
591 *head = (struct quehead *)b; local
[all...]
/haiku/headers/compatibility/bsd/sys/
H A Dqueue.h50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
109 /* Store the last 2 places the queue element or head was altered */
120 #define QMD_TRACE_HEAD(head) d
596 *head = (struct quehead *)b; local
[all...]
/haiku/src/add-ons/kernel/file_systems/websearchfs/
H A Dlists.c19 struct _slist_entry *slist_find(struct _slist_entry *head, slist_compare_func func, void *id) argument
21 struct _slist_entry *p = head;
22 if (head == NULL)
32 status_t slist_insert_head(struct _slist_entry **head, struct _slist_entry *item) argument
35 if (head == NULL || item == NULL)
37 if (*head)
38 next = *head;
40 *head = item;
44 struct _slist_entry *slist_dequeue_tail(struct _slist_entry **head) argument
48 if (head
60 slist_remove(struct _slist_entry **head, struct _slist_entry *item) argument
[all...]
H A Dlists2.c12 void *sll_find(long nextoff, void *head, sll_compare_func func, void *id) argument
14 void *p = head;
16 if (head == NULL)
30 status_t sll_insert_head(long nextoff, void **head, void *item) argument
33 if (head == NULL || item == NULL)
35 if (*head)
36 next = *head;
38 *head = item;
42 status_t sll_insert_tail(long nextoff, void **head, void *item) argument
45 if (head
64 sll_dequeue_tail(long nextoff, void **head) argument
80 sll_remove(long nextoff, void **head, void *item) argument
[all...]
H A Dlists.h20 extern struct _slist_entry *slist_find(struct _slist_entry *head, slist_compare_func func, void *id);
21 extern status_t slist_insert_head(struct _slist_entry **head, struct _slist_entry *item);
22 extern struct _slist_entry *slist_dequeue_tail(struct _slist_entry **head);
23 extern status_t slist_remove(struct _slist_entry **head, struct _slist_entry *item);
H A Dlists2.h15 extern void *sll_find(long nextoff, void *head, sll_compare_func func, void *id);
16 extern status_t sll_insert_head(long nextoff, void **head, void *item);
17 extern status_t sll_insert_tail(long nextoff, void **head, void *item);
18 extern void *sll_dequeue_tail(long nextoff, void **head);
19 extern status_t sll_remove(long nextoff, void **head, void *item);
/haiku/src/add-ons/kernel/file_systems/websearchfs/bin/
H A Dimlucky2 open `query -v /Web/ '((name=="*'"$*"'*")&&(BEOS:TYPE=="application/x-vnd.Be-bookmark"))' | xargs catattr META:url | head -1`
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/
H A Dif_ath_descdma.h35 struct ath_descdma *dd, ath_bufhead *head, const char *name,
38 ath_bufhead *head, const char *name, int ds_size, int nbuf,
41 struct ath_descdma *dd, ath_bufhead *head, const char *name,
44 struct ath_descdma *dd, ath_bufhead *head);
/haiku/src/system/kernel/slab/
H A Dslab_private.h29 _pop(Type*& head) argument
31 Type* oldHead = head;
32 head = head->next;
39 _push(Type*& head, Type* object) argument
41 object->next = head;
42 head = object;
/haiku/src/libs/compat/freebsd_network/compat/sys/
H A Dqueue.h45 * added to the list after an existing element or at the head of the list.
46 * Elements being removed from the head of the list should use the explicit
53 * head of the list and the other to the tail of the list. The elements are
56 * to the list after an existing element, at the head of the list, or at the
57 * end of the list. Elements being removed from the head of the tail queue
67 * or after an existing element or at the head of the list. A list
70 * A tail queue is headed by a pair of pointers, one to the head of the
74 * after an existing element, at the head of the list, or at the end of
116 /* Store the last 2 places the queue element or head was altered */
129 #define QMD_TRACE_HEAD(head) d
[all...]
/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Ddl_list.h13 #define REMOVE_DL_LIST( item, head, prefix ) \
18 head = item->prefix##next; \
24 #define ADD_DL_LIST_HEAD( item, head, prefix ) \
26 item->prefix##next = head; \
29 if( (head) ) \
30 (head)->prefix##prev = item; \
32 (head) = item; \
35 #define REMOVE_CDL_LIST( item, head, prefix ) \
40 if( item == (head) ) { \
42 (head)
[all...]
/haiku/src/add-ons/kernel/generic/locked_pool/
H A Ddl_list.h13 #define REMOVE_DL_LIST( item, head, prefix ) \
18 head = item->prefix##next; \
24 #define ADD_DL_LIST_HEAD( item, head, prefix ) \
26 item->prefix##next = head; \
29 if( (head) ) \
30 (head)->prefix##prev = item; \
32 (head) = item; \
35 #define REMOVE_CDL_LIST( item, head, prefix ) \
40 if( item == (head) ) { \
42 (head)
[all...]
/haiku/src/add-ons/kernel/generic/scsi_periph/
H A Ddl_list.h13 #define REMOVE_DL_LIST( item, head, prefix ) \
18 head = item->prefix##next; \
24 #define ADD_DL_LIST_HEAD( item, head, prefix ) \
26 item->prefix##next = head; \
29 if( (head) ) \
30 (head)->prefix##prev = item; \
32 (head) = item; \
35 #define REMOVE_CDL_LIST( item, head, prefix ) \
40 if( item == (head) ) { \
42 (head)
[all...]
/haiku/src/system/kernel/util/
H A Dqueue.cpp18 queue_element *head; member in struct:queue_typed
27 q->head = q->tail = NULL;
40 temp = (queue_element *)q->head;
46 q->head = (queue_element*)temp->next;
69 q->head = elem;
86 elem = q->head;
87 if (q->head != NULL)
88 q->head = (queue_element*)q->head->next;
102 return q->head;
[all...]
/haiku/src/libs/compat/openbsd_wlan/sys/
H A Dtree.h79 #define SPLAY_ROOT(head) (head)->sph_root
80 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
86 (head)->sph_root = tmp; \
89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
90 SPLAY_RIGHT((head)
[all...]
/haiku/src/add-ons/kernel/file_cache/
H A Drule_based_prefetcher.cpp57 struct head { struct
58 head();
82 void AddHead(struct head *head);
85 struct head *FindHead(mount_id device, vnode_id node);
245 head::head() function in class:head
417 struct head *head = new ::head; local
466 struct head *head; local
479 AddHead(struct head *head) argument
499 struct head *head = NULL; local
528 struct head *head = NULL; local
544 struct head *head = NULL; local
648 struct head *head = state->rule->FindHead(device, node); local
[all...]
/haiku/src/add-ons/kernel/network/stack/
H A Dradix.h103 struct radix_node_head *head, struct radix_node nodes[]);
106 struct radix_node_head *head, struct radix_node nodes[]);
108 (void *v, void *mask, struct radix_node_head *head);
110 (void *v, void *mask, struct radix_node_head *head);
112 (void *v, struct radix_node_head *head);
114 (void *v, void *mask, struct radix_node_head *head);
116 (void *v, struct radix_node_head *head);
118 (struct radix_node_head *head, walktree_f_t *f, void *w);
120 (struct radix_node_head *head, void *a, void *m,
123 (struct radix_node *rn, struct radix_node_head *head);
[all...]
/haiku/headers/private/kernel/util/
H A Dqueue.h15 void *head; member in struct:queue
28 int head; member in struct:fixed_queue
/haiku/src/system/libnetwork/netresolv/include/isc/
H A Dlist.h24 #define LIST(type) struct { type *head, *tail; }
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
39 #define HEAD(list) ((list).head)
41 #define EMPTY(list) ((list).head == NULL)
46 if ((list).head != NULL) \
47 (list).head->link.prev = (elt); \
51 (elt)->link.next = (list).head; \
52 (list).head = (elt); \
61 (list).head = (elt); \
79 INSIST((list).head
[all...]
/haiku/src/system/boot/platform/riscv/
H A Dcrt0.S16 .section .text.head

Completed in 517 milliseconds

1234