/illumos-gate/usr/src/man/man3head/ |
H A D | Makefile | 20 MANSECT= 3head 22 MANFILES= acct.h.3head \ 23 aio.h.3head \ 24 ar.h.3head \ 25 archives.h.3head \ 26 assert.h.3head \ 27 complex.h.3head \ 28 cpio.h.3head \ 29 dirent.h.3head \ 30 endian.h.3head \ [all...] |
/illumos-gate/usr/src/uts/common/io/drm/ |
H A D | drm_linux_list.h | 51 #define INIT_LIST_HEAD(head) { \ 52 (head)->next = head; \ 53 (head)->prev = head; \ 54 (head)->contain_ptr = (caddr_t)head; \ 57 #define list_add(entry, head, con_ptr) { \ 58 (head)->next->prev = entry; \ 59 (entry)->next = (head) [all...] |
H A D | queue.h | 46 * added to the list after an existing element or at the head of the list. 47 * Elements being removed from the head of the list should use the explicit 54 * head of the list and the other to the tail of the list. The elements are 57 * to the list after an existing element, at the head of the list, or at the 58 * end of the list. Elements being removed from the head of the tail queue 68 * or after an existing element or at the head of the list. A list 71 * A tail queue is headed by a pair of pointers, one to the head of the 75 * after an existing element, at the head of the list, or at the end of 105 /* Store the last 2 places the queue element or head was altered */ 116 #define QMD_TRACE_HEAD(head) d [all...] |
/illumos-gate/usr/src/cmd/syslogd/ |
H A D | llt.h | 41 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 D | list.c | 36 ll_init(llh_t *head) argument 38 head->back = &head->front; 39 head->front = NULL; 42 ll_enqueue(llh_t *head, ll_t *data) argument 45 *head->back = data; 46 head->back = &data->n; 54 ll_mapf(llh_t *head, void (*func)(void *)) argument 56 ll_t *t = head->front; 66 ll_peek(llh_t *head) argument 71 ll_dequeue(llh_t *head) argument 104 ll_check(llh_t *head) argument [all...] |
/illumos-gate/usr/src/lib/libsmbfs/smb/ |
H A D | queue.h | 68 #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/lib/libpp/common/ |
H A D | ppcomment.c | 31 ppcomment(char* head, char* comment, char* tail, int line) argument 34 ppprintf("%s%-.*s%s", head, MAXTOKEN - 4, comment, tail);
|
/illumos-gate/usr/src/cmd/sendmail/db/include/ |
H A D | queue.h | 56 * 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 D | shqueue.h | 55 #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/cmd/sendmail/include/sm/ |
H A D | tailq.h | 48 * 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 D | db-queue.h | 61 * 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 D | mr_sas_list.c | 38 * @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/uts/common/sys/ |
H A D | queue.h | 55 * head of the list. Elements being removed from the head of the list 65 * or after an existing element or at the head of the list. A list 68 * A simple queue is headed by a pair of pointers, one the head of the 71 * head of the list. New elements can be added to the list after 72 * an existing element, at the head of the list, or at the end of the 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 82 * A circle queue is headed by a pair of pointers, one to the head of the 86 * an existing element, at the head o [all...] |
/illumos-gate/usr/src/lib/libc/amd64/unwind/ |
H A D | thrp_unwind.c | 53 __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 D | unwind.c | 75 __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 D | dapl_llist.c | 37 * 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/uts/common/io/aggr/ |
H A D | aggr_recv.c | 84 mblk_t *cmp, *last, *head; local 90 head = cmp = mp; 94 if (head == cmp) { 96 head = cmp->b_next; 99 cmp = head; 105 head); 107 freemsgchain(head); 109 head = cmp->b_next; 112 cmp = head; 126 if (head [all...] |
/illumos-gate/usr/src/uts/common/io/mega_sas/ |
H A D | list.h | 94 * @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 D | queue.h | 45 * 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/lib/gss_mechs/mech_krb5/mech/ |
H A D | error_map.h | 34 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 D | req.flg | 26 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 D | resource.c | 37 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 D | pckaffspot.c | 46 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 D | pckrcvspot.c | 45 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/inet/tcp/ |
H A D | tcp_sack.c | 44 * sack_blk_t *head: pointer to the array of SACK blks. 50 tcp_sack_insert(sack_blk_t *head, tcp_seq begin, tcp_seq end, int32_t *num) argument 57 head[0].begin = begin; 58 head[0].end = end; 69 * 4. head part of new SACK blk overlaps with another blk. 73 * to head. 82 if (SEQ_LT(end, head[i].begin) || SEQ_GT(begin, head[i].end)) { 84 tmp[j].begin = head[i].begin; 85 tmp[j].end = head[ 133 tcp_sack_remove(sack_blk_t *head, tcp_seq end, int32_t *num) argument 192 tcp_notsack_insert(notsack_blk_t **head, tcp_seq begin, tcp_seq end, int32_t *num, uint32_t *sum) argument 337 tcp_notsack_remove(notsack_blk_t **head, tcp_seq end, int32_t *num, uint32_t *sum) argument 391 tcp_notsack_update(notsack_blk_t **head, tcp_seq begin, tcp_seq end, int32_t *num, uint32_t *sum) argument [all...] |