Home
last modified time | relevance | path

Searched refs:head (Results 51 – 75 of 714) sorted by relevance

12345678910>>...29

/illumos-gate/usr/src/uts/common/idmap/
H A Didmap_cache.c199 sid2pid_hb->head.flink = &sid2pid_hb->head; in kidmap_cache_create()
200 sid2pid_hb->head.blink = &sid2pid_hb->head; in kidmap_cache_create()
216 uid2sid_hb->head.flink = &uid2sid_hb->head; in kidmap_cache_create()
217 uid2sid_hb->head.blink = &uid2sid_hb->head; in kidmap_cache_create()
230 gid2sid_hb->head.flink = &gid2sid_hb->head; in kidmap_cache_create()
231 gid2sid_hb->head.blink = &gid2sid_hb->head; in kidmap_cache_create()
347 sid2pid_hb->head.flink = &sid2pid_hb->head; in kidmap_cache_purge()
348 sid2pid_hb->head.blink = &sid2pid_hb->head; in kidmap_cache_purge()
369 uid2sid_hb->head.flink = &uid2sid_hb->head; in kidmap_cache_purge()
370 uid2sid_hb->head.blink = &uid2sid_hb->head; in kidmap_cache_purge()
[all …]
/illumos-gate/usr/src/tools/smatch/src/
H A Dlib.h261 static inline void free_instruction_list(struct instruction_list **head) in free_instruction_list() argument
263 free_ptr_list(head); in free_instruction_list()
268 return undo_ptr_list_last((struct ptr_list **)head); in delete_last_instruction()
273 return first_ptr_list((struct ptr_list *)head); in first_basic_block()
275 static inline struct instruction *last_instruction(struct instruction_list *head) in last_instruction() argument
277 return last_ptr_list((struct ptr_list *)head); in last_instruction()
282 return first_ptr_list((struct ptr_list *)head); in first_instruction()
285 static inline struct expression *first_expression(struct expression_list *head) in first_expression() argument
287 return first_ptr_list((struct ptr_list *)head); in first_expression()
290 static inline pseudo_t first_pseudo(struct pseudo_list *head) in first_pseudo() argument
[all …]
/illumos-gate/usr/src/lib/libc/port/unwind/
H A Dunwind.c75 __cleanup_t *head; in _t_cancel() local
93 if ((head = self->ul_clnup_hdr) != NULL && fp == head->fp) { in _t_cancel()
94 self->ul_clnup_hdr = head->next; in _t_cancel()
96 _ex_clnup_handler(head->arg, head->func); in _t_cancel()
104 } else if (head != NULL) { in _t_cancel()
/illumos-gate/usr/src/cmd/backup/restore/
H A Dinteractive.c66 for (; alist.head < alist.last; alist.head++) in runcmdshell()
346 ap->head++; in getcmd()
437 ap->head++; in getcmd()
606 ap->head = &single; in expandarg()
607 ap->last = ap->head + 1; in expandarg()
615 qsort((char *)ap->head, (size_t)(ap->last - ap->head), in expandarg()
616 sizeof (*ap->head), in expandarg()
641 alist.head = &single; in printlist()
676 if (alist.head != 0) { in printlist()
690 alist.head = NULL; in printlist()
[all …]
/illumos-gate/usr/src/uts/common/net/
H A Dradix.h118 struct radix_node_head *head, struct radix_node nodes[]);
123 (void *v, void *mask, struct radix_node_head *head);
125 (void *v, void *mask, struct radix_node_head *head);
127 (void *v, struct radix_node_head *head);
130 (void *v, struct radix_node_head *head,
133 (void *v, void *mask, struct radix_node_head *head);
135 (void *v, struct radix_node_head *head);
137 (struct radix_node_head *head, walktree_f_t *f, void *w);
139 (struct radix_node_head *head, walktree_f_t *f, void *w,
143 (struct radix_node_head *head, void *a, void *m,
[all …]
/illumos-gate/usr/src/uts/common/io/usb/usba/
H A Dusba.c1084 head->prev = head->next = element; in usba_add_to_list()
1092 head->count++; in usba_add_to_list()
1096 (void *)head, (void *)element, head->count); in usba_add_to_list()
1116 (void *)head, (void *)element, head->count); in usba_rm_from_list()
1119 e = head->next; in usba_rm_from_list()
1172 head->count--; in usba_rm_from_list()
1176 (void *)head, (void *)element, head->count); in usba_rm_from_list()
1190 if (head) { in usba_rm_first_from_list()
1205 head->count--; in usba_rm_first_from_list()
1219 (void *)head, (void *)element, head->count); in usba_rm_first_from_list()
[all …]
/illumos-gate/usr/src/cmd/syslogd/
H A Dllt.h39 void ll_init(llh_t *head);
40 void ll_enqueue(llh_t *head, ll_t *data);
41 void ll_mapf(llh_t *head, void (*func)(void *));
42 ll_t * ll_peek(llh_t *head);
43 ll_t * ll_dequeue(llh_t *head);
45 int ll_check(llh_t *head);
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dlist.h22 #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 == (elt)); \
[all …]
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/mpool/
H A Dmpool.c120 struct _hqh *head; local
146 CIRCLEQ_INSERT_HEAD(head, bp, hq);
156 struct _hqh *head; local
171 CIRCLEQ_REMOVE(head, bp, hq);
188 struct _hqh *head; local
211 CIRCLEQ_REMOVE(head, bp, hq);
353 struct _hqh *head; local
378 CIRCLEQ_REMOVE(head, bp, hq);
449 struct _hqh *head; local
452 head = &mp->hqh[HASHKEY(pgno)];
[all …]
/illumos-gate/usr/src/lib/libdladm/common/
H A Dlibdlstat.c776 return (head); in i_dlstat_legacy_rx_lane_stats()
812 return (head); in i_dlstat_legacy_tx_lane_stats()
969 head = curr; in i_dlstat_query_stats()
975 return (head); in i_dlstat_query_stats()
1163 return (head); in i_dlstat_rx_bcast_stats()
1211 return (head); in i_dlstat_rx_defunctlane_stats()
1272 head = i_dlstat_join_lists(head, defunctlane_stats); in dlstat_rx_lane_stats()
1273 head = i_dlstat_join_lists(head, lane_stats); in dlstat_rx_lane_stats()
1275 return (head); in dlstat_rx_lane_stats()
1385 return (head); in i_dlstat_tx_bcast_stats()
[all …]
/illumos-gate/usr/src/lib/libidmap/common/
H A Didmap_cache.c69 #define list_insert(head, ele)\ argument
72 (head)->flink = (ele);\
86 #define list_move(head, ele) \ argument
90 list_insert(head, ele);\
138 sid2uid_gid_t head; member
150 pid2sid_winname_t head; member
162 winname2uid_gid_t head; member
297 idmap_cache.sid2uid_gid.head.flink = &idmap_cache.sid2uid_gid.head; in idmap_cache_create()
298 idmap_cache.sid2uid_gid.head.blink = &idmap_cache.sid2uid_gid.head; in idmap_cache_create()
366 idmap_cache.sid2uid_gid.head.flink = &idmap_cache.sid2uid_gid.head; in idmap_cache_purge()
[all …]
/illumos-gate/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_provider.c173 g_dapl_provider_list.head = dapl_os_alloc( in dapl_provider_list_create()
175 if (NULL == g_dapl_provider_list.head) { in dapl_provider_list_create()
181 (void) dapl_os_memzero(g_dapl_provider_list.head, in dapl_provider_list_create()
196 g_dapl_provider_list.head->next = g_dapl_provider_list.tail; in dapl_provider_list_create()
202 if (NULL != g_dapl_provider_list.head) { in dapl_provider_list_create()
203 dapl_os_free(g_dapl_provider_list.head, in dapl_provider_list_create()
222 while (NULL != g_dapl_provider_list.head) { in dapl_provider_list_destroy()
223 cur_node = g_dapl_provider_list.head; in dapl_provider_list_destroy()
224 g_dapl_provider_list.head = cur_node->next; in dapl_provider_list_destroy()
310 for (cur_node = g_dapl_provider_list.head->next; in dapl_provider_list_search()
[all …]
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dradix.h121 (void *v, void *mask, struct radix_node_head *head,
124 (void *v, void *mask, struct radix_node_head *head,
127 (void *v, void *mask, struct radix_node_head *head);
129 (void *v, void *mask, struct radix_node_head *head);
131 (void *v, struct radix_node_head *head);
133 (void *v, void *mask, struct radix_node_head *head);
135 (void *v, struct radix_node_head *head);
137 int (*rnh_walktree)(struct radix_node_head *head,
/illumos-gate/usr/src/lib/mpapi/libmpscsi_vhci/common/
H A DMP_SetTPGAccess.c46 MP_TPG_STATE_PAIR *head = pTpgStateList; in MP_SetTPGAccess() local
99 if (head->tpgOid.ownerId != g_pluginOwnerID) { in MP_SetTPGAccess()
111 if (head->tpgOid.objectType != in MP_SetTPGAccess()
125 head++; in MP_SetTPGAccess()
129 head = pTpgStateList; in MP_SetTPGAccess()
138 = head->desiredState; in MP_SetTPGAccess()
142 = head->tpgOid.objectSequenceNumber; in MP_SetTPGAccess()
200 head++; in MP_SetTPGAccess()
/illumos-gate/usr/src/lib/libslp/clib/
H A Dslp_queue.c59 slp_queue_entry_t *head; member
103 q->head = NULL; in slp_new_queue()
128 if (q->head != NULL) { /* queue is not emptry */ in slp_enqueue()
132 q->head = q->tail = qe; in slp_enqueue()
156 qe->next = q->head; in slp_enqueue_at_head()
157 q->head = qe; in slp_enqueue_at_head()
171 slp_queue_entry_t *qe = q->head; in dequeue_nolock()
177 q->head = q->tail = NULL; in dequeue_nolock()
179 q->head = qe->next; in dequeue_nolock()
241 for (p = q->head; p; p = pn) { in slp_flush_queue()
/illumos-gate/usr/src/lib/libtecla/common/
H A Dchrqueue.c73 CqCharBuff *head; /* The head of the list of output buffers */ member
108 cq->buffers.head = NULL; in _new_GlCharQueue()
236 cq->buffers.head = node; in _glq_append_chars()
280 cq->buffers.head = cq->buffers.tail = NULL; in _glq_empty_queue()
295 return (cq && cq->buffers.head) ? (cq->ntotal - cq->nflush) : 0; in _glq_char_count()
335 while(cq->buffers.head) { in _glq_flush_queue()
339 int is_tail = cq->buffers.head == cq->buffers.tail; in _glq_flush_queue()
362 int nnew = write_fn(data, cq->buffers.head->bytes + in _glq_flush_queue()
388 CqCharBuff *node = cq->buffers.head; in _glq_flush_queue()
392 cq->buffers.head = node->next; in _glq_flush_queue()
H A Dstringrp.c64 StringSegment *head; /* The list of character arrays */ member
109 sg->head = NULL; in _new_StringGroup()
135 for(node=sg->head; node; node=node->next) { in _del_StringGroup()
144 sg->head = NULL; /* Already deleted by deleting sg->node_mem */ in _del_StringGroup()
240 for(node=sg->head; node && node->unused <= length; node=node->next) in _sg_alloc_string()
264 node->next = sg->head; in _sg_alloc_string()
265 sg->head = node; in _sg_alloc_string()
291 for(node=sg->head; node; node=node->next) in _clr_StringGroup()
/illumos-gate/usr/src/cmd/fs.d/nfs/lib/
H A Dnfslogtab.c240 if (head == NULL) { in logtab_rement()
244 head = tail = tmpl; in logtab_rement()
271 for (tmpl = head; tmpl != NULL; tmpl = tmpl->lel_next) in logtab_rement()
275 logtab_ent_list_free(head); in logtab_rement()
323 if (head == NULL) { in logtab_deactivate()
327 head = tail = lelp; in logtab_deactivate()
354 for (lelp = head; lelp != NULL; lelp = lelp->lel_next) in logtab_deactivate()
358 logtab_ent_list_free(head); in logtab_deactivate()
399 logtab_ent_list_free(struct logtab_ent_list *head) in logtab_ent_list_free() argument
403 if (head == NULL) in logtab_ent_list_free()
[all …]
/illumos-gate/usr/src/lib/udapl/libdat/common/
H A Ddat_dictionary.c65 DAT_DICTIONARY_NODE *head; member
121 if (NULL == p_dictionary->head) { in dat_dictionary_create()
127 (void) dat_os_memset(p_dictionary->head, '\0', in dat_dictionary_create()
141 p_dictionary->head->next = p_dictionary->tail; in dat_dictionary_create()
149 if (NULL != p_dictionary->head) { in dat_dictionary_create()
150 dat_os_free(p_dictionary->head, in dat_dictionary_create()
180 while (NULL != p_dictionary->head) { in dat_dictionary_destroy()
181 cur_node = p_dictionary->head; in dat_dictionary_destroy()
182 p_dictionary->head = cur_node->next; in dat_dictionary_destroy()
317 for (cur_node = p_dictionary->head->next; in dat_dictionary_search()
[all …]
/illumos-gate/usr/src/uts/common/io/mr_sas/
H A Dmr_sas_list.h90 #define mlist_for_each(pos, head) \ argument
91 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
101 #define mlist_for_each_safe(pos, n, head) \ argument
102 for (pos = (head)->next, n = pos->next; pos != (head); \
/illumos-gate/usr/src/common/fs/
H A Dhsfs.c102 static fileid_t *head; variable
145 fileid_t *filep = head; in find_fp()
412 head = bkmem_alloc(sizeof (*head)); in bhsfs_mountroot()
413 bzero(head, sizeof (*head)); in bhsfs_mountroot()
414 head->fi_back = head->fi_forw = head; in bhsfs_mountroot()
418 head->fi_offset = 0; in bhsfs_mountroot()
420 head->fi_memp = head->fi_buf; in bhsfs_mountroot()
421 if (diskread(head)) { in bhsfs_mountroot()
428 bufp = head->fi_buf; in bhsfs_mountroot()
543 while ((filep = head->fi_forw) != head) in bhsfs_closeall()
[all …]
/illumos-gate/usr/src/cmd/mail/
H A Dgoback.c135 hdrlines[H_DAFWDFROM].head = hdrlines[H_AFWDFROM].head;
137 hdrlines[H_AFWDFROM].head = (struct hdrs *)NULL;
139 hdrlines[H_DRECEIVED].head = hdrlines[H_RECEIVED].head;
141 hdrlines[H_RECEIVED].head = (struct hdrs *)NULL;
143 hdrlines[H_DTCOPY].head = hdrlines[H_TCOPY].head;
145 hdrlines[H_TCOPY].head = (struct hdrs *)NULL;
/illumos-gate/usr/src/cmd/svr4pkg/libinst/
H A Dpathdup.c55 static struct dup *head, *tail, *new; variable
71 if (head == NULL) in pathinit()
75 tail = head->next; in pathinit()
81 tail = head; in pathinit()
98 if (head == NULL) in growstore()
99 head = new; in growstore()
/illumos-gate/usr/src/lib/libdwarf/common/
H A Ddwarf_rnglists.c60 Dwarf_Chain cur = head; in free_rnglists_chain()
63 if(!head) { in free_rnglists_chain()
504 Dwarf_Rnglists_Head head, in dwarf_get_rnglist_head_basics() argument
525 *rle_count = head->rh_count; in dwarf_get_rnglist_head_basics()
1129 Dwarf_Rnglists_Head head, in dwarf_get_rnglists_entry_fields() argument
1158 if (head->rh_first) { in _dwarf_free_rnglists_head()
1168 head->rh_first = 0; in _dwarf_free_rnglists_head()
1169 head->rh_last = 0; in _dwarf_free_rnglists_head()
1170 head->rh_count = 0; in _dwarf_free_rnglists_head()
1180 free(head->rh_rnglists); in _dwarf_free_rnglists_head()
[all …]
/illumos-gate/usr/src/uts/common/sys/
H A Dddi_hp_impl.h112 #define DDIHP_LIST_APPEND(type, head, node) \ argument
116 for (curr = (head); curr; prev = curr, curr = curr->next); \
118 (head) = (node); \
124 #define DDIHP_LIST_REMOVE(type, head, node) \ argument
127 for (curr = (head); curr; prev = curr, curr = curr->next) { \
133 (head) = (head)->next; \

12345678910>>...29