/osnet-11/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);
|
/osnet-11/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...] |
/osnet-11/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...] |
/osnet-11/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...] |
/osnet-11/usr/src/lib/libdhcpsvc/ |
H A D | Makefile | 28 SUBDIRS = head $(STUBSUBDIRS) modules 35 @cd head; pwd; $(MAKE) $@
|
H A D | Makefile.com | 32 CPPFLAGS += -I$(SRC)/lib/libdhcpsvc/head -D_REENTRANT
|
/osnet-11/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...] |
/osnet-11/usr/src/lib/libc/port/unwind/ |
H A D | unwind.c | 73 __cleanup_t *head; local 91 if ((head = self->ul_clnup_hdr) != NULL && fp == head->fp) { 92 self->ul_clnup_hdr = head->next; 94 _ex_clnup_handler(head->arg, head->func); 102 } else if (head != NULL) {
|
/osnet-11/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...] |
H A D | dapl_ring_buffer_util.c | 85 rbuf->head = 0; 127 if (rbuf->head != rbuf->tail) { 208 pos = rbuf->head; 211 rbuf->head = (pos + 1) & rbuf->lim; 242 if (rbuf->head != rbuf->tail) { 273 int head; local 277 head = rbuf->head; 280 if (head == tail) 282 if (head > tai [all...] |
H A D | dapl_cookie.c | 51 * head index : index of next unallocated cookie 154 buffer->head = 0; 201 DAPL_ATOMIC head; local 223 head = curr_buffer->head; 226 while (head != tail) { 227 new_buffer->pool[index] = curr_buffer->pool[head]; 228 head = (head + 1) % curr_buffer->pool_size; 231 new_buffer->head [all...] |
/osnet-11/usr/src/lib/libntfs/common/include/ntfs/ |
H A D | list.h | 71 * @head: list head to add it after 73 * Insert a new entry after the specified head. 76 static __inline__ void list_add(struct list_head *new, struct list_head *head) argument 78 __list_add(new, head, head->next); 84 * @head: list head to add it before 86 * Insert a new entry before the specified head. 89 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) argument 137 list_empty(struct list_head *head) argument 147 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/mech/ |
H A D | error_map.h | 33 static inline int gsserrmap_init (struct gsserrmap__head *head) argument 35 head->first = NULL; 38 static inline void gsserrmap_destroy (struct gsserrmap__head *head) argument 43 for (e = head->first; e; e = e_next) { 51 head->first = NULL; 55 gsserrmap__find_node (struct gsserrmap__head *head, OM_uint32 key) argument 58 for (e = head->first; e; e = e->next) 65 gsserrmap_find (struct gsserrmap__head *head, OM_uint32 key) argument 67 struct gsserrmap__element *e = gsserrmap__find_node(head, key); 85 gsserrmap_replace_or_insert (struct gsserrmap__head *head, argument [all...] |
/osnet-11/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
|
/osnet-11/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...] |
/osnet-11/usr/src/grub/grub2/grub-core/kern/ |
H A D | list.c | 25 grub_list_push (grub_list_t *head, grub_list_t item) argument 27 item->next = *head; 28 *head = item; 32 grub_list_remove (grub_list_t *head, grub_list_t item) argument 36 for (p = head, q = *p; q; p = &(q->next), q = q->next) 45 grub_named_list_find (grub_named_list_t head, const char *name) argument 49 FOR_LIST_ELEMENTS (item, head) 57 grub_prio_list_insert (grub_prio_list_t *head, grub_prio_list_t nitem) argument 63 for (p = head, q = *p; q; p = &(q->next), q = q->next)
|
/osnet-11/usr/src/lib/libc/port/aio/ |
H A D | posix_aio.c | 110 _lio_listio_cleanup(aio_lio_t *head) argument 114 ASSERT(MUTEX_HELD(&head->lio_mutex)); 115 if (head->lio_refcnt == 0) { 116 ASSERT(head->lio_nent == 0); 119 head->lio_waiting = 0; 120 sig_mutex_unlock(&head->lio_mutex); 122 _aio_lio_free(head); 131 aio_lio_t *head = NULL; local 199 * If LIO_WAIT, or notification required, allocate a list head. 206 head 325 _lio_list_decr(aio_lio_t *head) argument 736 aio_lio_t *head; local 755 __aio_fsync_bar(aiocb_t *aiocbp, aio_lio_t *head, aio_worker_t *aiowp, int workerscnt) argument 781 aio_lio_t *head; local 1333 aio_lio_t *head = NULL; local 1631 __aio_fsync_bar64(aiocb64_t *aiocbp, aio_lio_t *head, aio_worker_t *aiowp, int workerscnt) argument 1657 aio_lio_t *head; local [all...] |
H A D | aio_alloc.c | 229 aio_lio_t *_lio_head_freelist = NULL; /* free list of lio head structures */ 237 * Allocate a listio head structure. 242 aio_lio_t *head; local 249 if ((head = _lio_head_freelist) == NULL) { 259 for (i = 0, head = _lio_head_freelist; i < nelem; i++, head++) 260 head->lio_next = head + 1; 261 _lio_head_freelast = head - 1; 265 head 285 _aio_lio_free(aio_lio_t *head) argument [all...] |
/osnet-11/usr/src/lib/libast/common/sfio/ |
H A D | sfpool.c | 97 /* move a stream to head */ 107 reg Sfio_t* head; local 116 head = p->sf[0]; 117 if(SFFROZEN(head) ) 120 SFLOCK(head,0); 123 if(!(p->mode&SF_SHARE) || (head->mode&SF_READ) || (f->mode&SF_READ) ) 124 { if(SFSYNC(head) < 0) 128 { if(SFMODE(head,1) != SF_WRITE && _sfmode(head,SF_WRITE,1) < 0) 132 v = head [all...] |
/osnet-11/usr/src/lib/libc/port/gen/ |
H A D | atfork.c | 55 atfork_t *head; local 70 if ((head = udp->atforklist) == NULL) { 74 head->back->forw = atfp; 75 atfp->forw = head; 76 atfp->back = head->back; 77 head->back = atfp;
|
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Apps/ |
H A D | httpdstat.d | 55 num = 0; get = 0; head = 0; post = 0; trac = 0; 105 head += stringof(this->str) == "HEAD" ? 1 : 0; 118 num, get, post, head, trac); 119 num = 0; get = 0; head = 0; post = 0; trac = 0;
|
/osnet-11/usr/src/cmd/dtrace_toolkit/DTT/Bin/ |
H A D | httpdstat.d | 55 num = 0; get = 0; head = 0; post = 0; trac = 0; 105 head += stringof(this->str) == "HEAD" ? 1 : 0; 118 num, get, post, head, trac); 119 num = 0; get = 0; head = 0; post = 0; trac = 0;
|
/osnet-11/usr/src/lib/mpapi/libmpscsi_vhci/common/ |
H A D | MP_SetTPGAccess.c | 46 MP_TPG_STATE_PAIR *head = pTpgStateList; local 99 if (head->tpgOid.ownerId != g_pluginOwnerID) { 111 if (head->tpgOid.objectType != 125 head++; 129 head = pTpgStateList; 138 = head->desiredState; 142 = head->tpgOid.objectSequenceNumber; 200 head++;
|
/osnet-11/usr/src/lib/libresolv2/include/isc/ |
H A D | list.h | 22 #define LIST(type) struct { type *head, *tail; } 24 do { (list).head = NULL; (list).tail = NULL; } while (0) 37 #define HEAD(list) ((list).head) 39 #define EMPTY(list) ((list).head == NULL) 44 if ((list).head != NULL) \ 45 (list).head->link.prev = (elt); \ 49 (elt)->link.next = (list).head; \ 50 (list).head = (elt); \ 59 (list).head = (elt); \ 77 INSIST((list).head [all...] |