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

1234567891011>>

/illumos-gate/usr/src/man/man3head/
H A DMakefile21 MANSECT= 3head
23 MANFILES= acct.h.3head \
24 aio.h.3head \
25 ar.h.3head \
26 archives.h.3head \
27 assert.h.3head \
28 complex.h.3head \
29 cpio.h.3head \
30 dirent.h.3head \
31 endian.h.3head \
[all...]
/illumos-gate/usr/src/cmd/syslogd/
H A Dllt.h41 void ll_init(llh_t *head);
42 void ll_enqueue(llh_t *head, ll_t *data);
43 void ll_mapf(llh_t *head, void (*func)(void *));
44 ll_t * ll_peek(llh_t *head);
45 ll_t * ll_dequeue(llh_t *head);
47 int ll_check(llh_t *head);
H A Dlist.c35 ll_init(llh_t *head) argument
37 head->back = &head->front;
38 head->front = NULL;
42 ll_enqueue(llh_t *head, ll_t *data) argument
45 *head->back = data;
46 head->back = &data->n;
55 ll_mapf(llh_t *head, void (*func)(void *)) argument
57 ll_t *t = head->front;
68 ll_peek(llh_t *head) argument
74 ll_dequeue(llh_t *head) argument
109 ll_check(llh_t *head) argument
[all...]
/illumos-gate/usr/src/lib/libpp/common/
H A Dppcomment.c31 ppcomment(char* head, char* comment, char* tail, int line) argument
34 ppprintf("%s%-.*s%s", head, MAXTOKEN - 4, comment, tail);
/illumos-gate/usr/src/lib/libsmbfs/smb/
H A Dqueue.h68 #define SLIST_EMPTY(head) ((head)->slh_first == NULL)
70 #define SLIST_FIRST(head) ((head)->slh_first)
72 #define SLIST_FOREACH(var, head, field) \
73 for ((var) = SLIST_FIRST((head)); \
77 #define SLIST_INIT(head) do { \
78 SLIST_FIRST((head)) = NULL; \
86 #define SLIST_INSERT_HEAD(head, elm, field) do { \
87 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
[all...]
/illumos-gate/usr/src/cmd/sendmail/db/include/
H A Dqueue.h56 * or after an existing element or at the head of the list. A list
59 * A tail queue is headed by a pair of pointers, one to the head of the
63 * after an existing element, at the head of the list, or at the end of
66 * A circle queue is headed by a pair of pointers, one to the head of the
70 * an existing element, at the head of the list, or at the end of the list.
91 #define LIST_FIRST(head) ((head)->lh_first)
93 #define LIST_END(head) NULL
98 #define LIST_INIT(head) { \
99 (head)
[all...]
H A Dshqueue.h55 #define SH_LIST_FIRSTP(head, type) \
56 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first))
58 #define SH_LIST_FIRST(head, type) \
59 ((head)->slh_first == -1 ? NULL : \
60 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first)))
75 #define SH_LIST_END(head) NULL
85 #define SH_LIST_INIT(head) (head)
[all...]
/illumos-gate/usr/src/uts/common/sys/
H A Dqueue.h54 * head of the list. Elements being removed from the head of the list
64 * or after an existing element or at the head of the list. A list
67 * A simple queue is headed by a pair of pointers, one the head of the
70 * head of the list. New elements can be added to the list after
71 * an existing element, at the head of the list, or at the end of the
74 * A tail queue is headed by a pair of pointers, one to the head of the
78 * after an existing element, at the head of the list, or at the end of
81 * A circle queue is headed by a pair of pointers, one to the head of the
85 * an existing element, at the head o
[all...]
/illumos-gate/usr/src/cmd/sendmail/include/sm/
H A Dtailq.h48 * A tail queue is headed by a pair of pointers, one to the head of the
52 * after an existing element, at the head of the list, or at the end of
65 #define SM_TAILQ_HEAD_INITIALIZER(head) \
66 { NULL, &(head).tqh_first }
77 #define SM_TAILQ_FIRST(head) ((head)->tqh_first)
78 #define SM_TAILQ_END(head) NULL
80 #define SM_TAILQ_LAST(head, headname) \
81 (*(((struct headname *)((head)->tqh_last))->tqh_last))
85 #define SM_TAILQ_EMPTY(head) \
[all...]
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/include/
H A Ddb-queue.h61 * an existing element or at the head of the list. A list may only be
64 * A tail queue is headed by a pair of pointers, one to the head of the
68 * an existing element, at the head of the list, or at the end of the
71 * A circle queue is headed by a pair of pointers, one to the head of the
75 * an existing element, at the head of the list, or at the end of the list.
99 #define LIST_INIT(head) { \
100 (head)->lh_first = NULL; \
111 #define LIST_INSERT_HEAD(head, elm, field) { \
112 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
113 (head)
[all...]
/illumos-gate/usr/src/uts/common/io/mr_sas/
H A Dmr_sas_list.c38 * @head: list head to add it after
40 * Insert a new entry after the specified head.
44 mlist_add(struct mlist_head *new, struct mlist_head *head) argument
46 __list_add(new, head, head->next);
52 * @head: list head to add it before
54 * Insert a new entry before the specified head.
58 mlist_add_tail(struct mlist_head *new, struct mlist_head *head) argument
93 mlist_empty(struct mlist_head *head) argument
104 mlist_splice(struct mlist_head *list, struct mlist_head *head) argument
[all...]
/illumos-gate/usr/src/lib/libc/amd64/unwind/
H A Dthrp_unwind.c53 __cleanup_t *head; local
69 while ((head = *headp) != NULL &&
70 (caddr_t)cfa == head->fp + CFA_ADJUST) {
71 *headp = head->next;
72 (*head->func)(head->arg);
91 __cleanup_t *head; local
114 while ((head = *headp) != NULL) {
115 *headp = head->next;
116 (*head
[all...]
/illumos-gate/usr/src/lib/libc/port/unwind/
H A Dunwind.c75 __cleanup_t *head; local
93 if ((head = self->ul_clnup_hdr) != NULL && fp == head->fp) {
94 self->ul_clnup_hdr = head->next;
96 _ex_clnup_handler(head->arg, head->func);
104 } else if (head != NULL) {
/illumos-gate/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_llist.c37 * A link list head points to the first member of a linked list, but
61 * Purpose: initialize a linked list head
64 dapl_llist_init_head(DAPL_LLIST_HEAD *head) argument
66 *head = NULL;
89 dapl_llist_is_empty(DAPL_LLIST_HEAD *head) argument
91 return (*head == NULL);
97 * Purpose: Add an entry to the head of a linked list
100 dapl_llist_add_head(DAPL_LLIST_HEAD *head, argument
107 if (dapl_llist_is_empty(head)) {
111 first = *head;
129 dapl_llist_add_tail(DAPL_LLIST_HEAD *head, DAPL_LLIST_ENTRY *entry, void *data) argument
158 dapl_llist_add_entry(DAPL_LLIST_HEAD * head, DAPL_LLIST_ENTRY * entry, DAPL_LLIST_ENTRY * new_entry, void * data) argument
189 dapl_llist_remove_head(DAPL_LLIST_HEAD *head) argument
216 dapl_llist_remove_tail(DAPL_LLIST_HEAD *head) argument
243 dapl_llist_remove_entry(DAPL_LLIST_HEAD *head, DAPL_LLIST_ENTRY *entry) argument
296 dapl_llist_peek_head(DAPL_LLIST_HEAD *head) argument
314 dapl_llist_next_entry(IN DAPL_LLIST_HEAD *head, IN DAPL_LLIST_ENTRY *cur_ent) argument
337 dapl_llist_debug_print_list(DAPL_LLIST_HEAD *head) argument
[all...]
/illumos-gate/usr/src/tools/smatch/src/
H A Dptrlist.c25 // @head: the head of the list
26 // @return: the size of the list given by @head.
27 int ptr_list_size(struct ptr_list *head) argument
31 if (head) {
32 struct ptr_list *list = head;
35 } while ((list = list->next) != head);
42 // @head: the head of the list
44 bool ptr_list_empty(const struct ptr_list *head) argument
63 ptr_list_multiple(const struct ptr_list *head) argument
84 first_ptr_list(struct ptr_list *head) argument
103 last_ptr_list(struct ptr_list *head) argument
124 struct ptr_list *head = list; local
154 linearize_ptr_list(struct ptr_list *head, void **arr, int max) argument
186 struct ptr_list *head = *listp; local
224 split_ptr_list_head(struct ptr_list *head) argument
309 lookup_ptr_list_entry(const struct ptr_list *head, const void *entry) argument
376 undo_ptr_list_last(struct ptr_list **head) argument
400 delete_ptr_list_last(struct ptr_list **head) argument
439 struct ptr_list *head, *tail; local
[all...]
/illumos-gate/usr/src/uts/common/io/mega_sas/
H A Dlist.h94 * @head: list head to add it after
96 * Insert a new entry after the specified head.
99 static void mlist_add(struct mlist_head *new, struct mlist_head *head) argument
101 __list_add(new, head, head->next);
108 * @head: list head to add it before
110 * Insert a new entry before the specified head.
113 static void mlist_add_tail(struct mlist_head *new, struct mlist_head *head) argument
165 mlist_empty(struct mlist_head *head) argument
176 mlist_splice(struct mlist_head *list, struct mlist_head *head) argument
[all...]
/illumos-gate/usr/src/boot/sys/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
112 /* Store the last 2 places the queue element or head was altered */
125 #define QMD_TRACE_HEAD(head) d
[all...]
/illumos-gate/usr/src/contrib/bhyve/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...]
H A Dtree.h3 /* $FreeBSD: head/sys/sys/tree.h 189204 2009-03-01 04:57:23Z bms $ */
82 #define SPLAY_ROOT(head) (head)->sph_root
83 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
86 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
87 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
88 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
89 (head)->sph_root = tmp; \
92 #define SPLAY_ROTATE_LEFT(head, tm
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/mech/
H A Derror_map.h34 static inline int gsserrmap_init (struct gsserrmap__head *head) argument
36 head->first = NULL;
39 static inline void gsserrmap_destroy (struct gsserrmap__head *head) argument
44 for (e = head->first; e; e = e_next) {
52 head->first = NULL;
56 gsserrmap__find_node (struct gsserrmap__head *head, OM_uint32 key) argument
59 for (e = head->first; e; e = e->next)
66 gsserrmap_find (struct gsserrmap__head *head, OM_uint32 key) argument
68 struct gsserrmap__element *e = gsserrmap__find_node(head, key);
86 gsserrmap_replace_or_insert (struct gsserrmap__head *head, argument
[all...]
/illumos-gate/usr/src/lib/libnsl/
H A Dreq.flg26 echo_file usr/src/head/Makefile
27 echo_file usr/src/head/rpcsvc/nis.x
28 echo_file usr/src/head/rpcsvc/nis_object.x
/illumos-gate/usr/src/lib/efcode/engine/
H A Dresource.c37 find_resource(fc_resource_t **head, void *ptr, int (cmp)(void *, void *)) argument
39 fc_resource_t *f, *prev, *r = *head;
50 *head = r->next;
68 add_resource(fc_resource_t **head, void *ptr, int (cmp)(void *, void *)) argument
72 r = find_resource(head, ptr, cmp);
76 r->next = *head;
77 *head = r;
85 free_resource(fc_resource_t **head, void *ptr, int (cmp)(void *, void *)) argument
89 if ((r = find_resource(head, ptr, cmp)) != NULL)
108 fc_resource_t **head; local
[all...]
/illumos-gate/usr/src/cmd/mail/
H A Dpckaffspot.c46 if (hdrlines[H_AFWDFROM].head == (struct hdrs *)NULL) {
51 if (hdrlines[H_EOH].head != (struct hdrs *)NULL) {
52 if (hdrlines[H_DATE].head != (struct hdrs *)NULL) {
59 (hdrlines[H_EOH].head != (struct hdrs *)NULL)) {
H A Dpckrcvspot.c45 if (hdrlines[H_RECEIVED].head == (struct hdrs *)NULL) {
52 if (hdrlines[H_EOH].head != (struct hdrs *)NULL) {
53 if (hdrlines[H_DATE].head != (struct hdrs *)NULL) {
60 (hdrlines[H_EOH].head != (struct hdrs *)NULL)) {
/illumos-gate/usr/src/uts/common/io/qede/
H A Dqede_list.h65 qede_list_t head; member in struct:qede_phys_mem_list
75 qede_list_t head; member in struct:qede_mcast_list
118 QEDE_LIST_ADD(qede_list_t *new, qede_list_t *head) argument
120 qede_list_add(new, head, head->next);
124 QEDE_LIST_ADD_TAIL(qede_list_t *new, qede_list_t *head) argument
126 qede_list_add(new, head->prev, head);
130 QEDE_LIST_REMOVE(qede_list_t *entry, qede_list_t *head) argument
152 qede_list_t *head)
151 qede_list_splice(qede_list_t *list, qede_list_t *head) argument
160 qede_list_splice_tail(qede_list_t *list, qede_list_t *head) argument
[all...]

Completed in 67 milliseconds

1234567891011>>