Searched refs:head (Results 276 - 300 of 653) sorted by relevance

<<11121314151617181920>>

/illumos-gate/usr/src/uts/common/io/drm/
H A Ddrm_mm.c282 struct list_head *head = &mm->ml_entry; local
284 return (head->next->next == head);
/illumos-gate/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_osd.c375 while (NULL != g_dapl_provider_list.head) {
376 cur_node = g_dapl_provider_list.head;
377 g_dapl_provider_list.head = cur_node->next;
514 } /* end while (NULL != g_dapl_provider_list.head) */
/illumos-gate/usr/src/uts/common/io/scsi/adapters/scsi_vhci/
H A Dmpapi_impl.c590 obj_hdr_list[MP_OBJECT_TYPE_DEVICE_PRODUCT]->head;
635 obj_hdr_list[MP_OBJECT_TYPE_DEVICE_PRODUCT]->head;
677 ilist = vhci->mp_priv->obj_hdr_list[MP_OBJECT_TYPE_MULTIPATH_LU]->head;
726 ->head;
744 tpg_lu_list = mptpglu->lu_list->head;
798 ilist = vhci->mp_priv->obj_hdr_list[MP_OBJECT_TYPE_MULTIPATH_LU]->head;
816 mplu_tpg_list = mplutpg->tpg_list->head;
866 ilist = vhci->mp_priv->obj_hdr_list[MP_OBJECT_TYPE_MULTIPATH_LU]->head;
918 ilist = vhci->mp_priv->obj_hdr_list[MP_OBJECT_TYPE_MULTIPATH_LU]->head;
936 mplu_path_list = mplup->path_list->head;
[all...]
/illumos-gate/usr/src/lib/libast/common/vmalloc/
H A Dmalloc.c461 } head; member in union:_alloca_u
465 { union _alloca_u head; member in struct:_alloca_s
485 { if(( _stk_down && &array[0] > Frame->head.head.addr) ||
486 (!_stk_down && &array[0] < Frame->head.head.addr) )
488 Frame = f->head.head.next;
499 f->head.head
[all...]
/illumos-gate/usr/src/cmd/make/bin/
H A Dnse_printdep.cc41 static void print_deplist(Dependency head);
218 print_deplist(Dependency head) argument
222 for (dp = head; dp != NULL; dp = dp->next) {
/illumos-gate/usr/src/lib/libadm/common/
H A Dgetdev.c176 struct deviceent *head; member in struct:__anon2578
343 (devicelist.head)->next = NULL;
365 /* List has a dummy head node */
366 pdevice = (devicelist.head)->next;
423 p = devicelist.head;
638 for (p = devicelist.head->next; p; p = p->next) *q++ = p->name;
/illumos-gate/usr/src/uts/common/io/myri10ge/drv/
H A Dmyri10ge_var.h114 mblk_t *head; member in struct:myri10ge_mblkq
157 struct myri10ge_jpool_entry *head; member in struct:myri10ge_per_cpu_jpool
165 struct myri10ge_jpool_entry *head; member in struct:myri10ge_jpool_stuff
211 struct myri10ge_tx_dma_handle *head; member in struct:myri10ge_tx_dma_handle_head
374 mblk_t *head; member in struct:myri10ge_mblk_list
/illumos-gate/usr/src/uts/common/sys/
H A Dmac_soft_ring.h541 #define MAC_COUNT_CHAIN(mac_srs, head, tail, cnt, sz) { \
545 ASSERT((head) != NULL); \
550 tmp = tail = (head); \
551 if ((head)->b_next == NULL) { \
554 sz += msgdsize(head); \
/illumos-gate/usr/src/cmd/mdb/common/modules/nca/
H A Dnca.c470 for (tb_addr = ti.head; tb_addr != NULL; tb_addr = tb.next) {
481 if (!show_encap || tb.head == NULL)
485 for (te_addr = tb.head; te_addr != NULL; te_addr = te.next) {
835 if (connf.head != NULL) {
841 (uintptr_t)connf.head) == -1) {
842 mdb_warn("cannot read nca_conn_t at %p", connf.head);
845 status = wsp->walk_callback((uintptr_t)connf.head, &conn,
916 if (nodef.head != NULL) {
922 (uintptr_t)nodef.head) == -1) {
923 mdb_warn("cannot read node_t at %p", nodef.head);
[all...]
/illumos-gate/usr/src/lib/udapl/udapl_tavor/tavor/
H A Ddapl_tavor_wr.c129 uint32_t head, tail, size; local
143 * update the "head" and "full" indicators on the individual containers
166 * Grab the current "head", "tail" and "size" fields before
172 head = container->wl_head;
175 while ((head != tail) || (container->wl_full)) {
177 curr = &container->wl_wre[head];
178 head = ((head + 1) & (size - 1));
193 * "head == tail" condition can only mean that the container
199 if (head
571 uint32_t head; local
[all...]
H A Ddapl_arbel_hw.c1044 uint32_t head, tail, next_tail, qsize_msk; local
1065 head = qp->qp_sq_wqhdr->wq_head;
1082 if (next_tail == head) {
1182 uint32_t head, tail, next_tail, qsize_msk; local
1198 head = qp->qp_rq_wqhdr->wq_head;
1222 if (next_tail == head) {
1293 uint32_t head, next_head, qsize_msk; local
1320 head = srq->srq_wridlist->wl_freel_head;
1322 next_head = (head + 1) & qsize_msk;
1325 desc = srq->srq_wridlist->wl_free_list[head];
[all...]
/illumos-gate/usr/src/uts/common/io/usb/hcd/uhci/
H A Duhciutil.c136 * Reserve the first 63 queue head structures in the pool as static
150 * The next pointer in the host controller queue head
191 * Add a dummy TD to the static queue head 0. THis is used
912 * Allocate a queue head
938 * tree. Search for a blank Queue head in the QH buffer pool.
1405 * appropriate queue head list.
1495 * Insert a periodic Queue head i.e Interrupt queue head into the
1512 /* Find the lattice queue head */
1624 /* Insert the td onto the queue head */
2511 uhci_trans_wrapper_t *head; local
3655 uhci_td_t *head; local
4643 uhci_td_t *head, *tmp_td; local
[all...]
/illumos-gate/usr/src/lib/libnisdb/
H A Ddb_table.cc137 for (current = head; current != NULL; ) {
142 head = NULL;
152 if (head == NULL) {
156 db_free_entry* old_head = head;
157 entryp found = head->where;
158 head = head->next;
181 newentry->next = head;
182 head = newentry;
204 db_free_entry_p current = head;
[all...]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dexpand.c75 DirNode *head; /* The head of the list of used and unused cache nodes */ member in struct:__anon4069
76 DirNode *next; /* The next unused node between head and tail */
181 ef->cache.head = NULL;
252 for(dnode=ef->cache.head; dnode; dnode=dnode->next)
259 ef->cache.head = ef->cache.tail = ef->cache.next = NULL;
726 cache->head = node;
748 cache->head = node->next;
789 cache->head = cache->tail = node;
H A Dpcache.c155 PathNode *head; /* The head of the list of directories in the */ member in struct:PathCache
287 pc->head = NULL;
384 pc->head = NULL;
482 pc->head = pc->tail = NULL;
560 for(node=pc->head; node; node=node->next) {
864 if(pc->head) {
868 pc->head = pc->tail = node;
1049 for(node=pc->head; node; node=node->next) {
1290 for(node=pc->head; nod
[all...]
/illumos-gate/usr/src/cmd/fs.d/nfs/nfslog/
H A Dnfslogd.c692 * '*head' points to the list of entries that have been processed.
705 } *head, *next, *p; local
707 head = (struct list *)(*list);
712 for (p = head; p != NULL; p = next) {
716 head = NULL;
722 for (p = head; p != NULL; p = p->next) {
739 p->next = head;
740 head = p;
/illumos-gate/usr/src/uts/common/c2/
H A Daudit_io.c392 if (kctx->auk_queue.head)
395 kctx->auk_queue.head = m;
424 ASSERT(kctx->auk_queue.head != NULL);
427 l = m = kctx->auk_queue.head;
437 kctx->auk_queue.head = l;
656 if (!kctx->auk_queue.head)
662 cAR = kctx->auk_queue.head; /* start at head of queue */
/illumos-gate/usr/src/lib/libbsm/common/
H A Dadt.c1055 struct export_header head; local
1065 adrm_int32(&context, (int *)&head, 4);
1067 if ((internal->as_check = head.ax_check) != ADT_VALID) {
1071 offset = head.ax_link.ax_offset;
1072 version = head.ax_link.ax_version;
1073 length = head.ax_buffer_length;
1097 adrm_start(&context, (char *)(p + sizeof (head)));
1176 struct export_header head; local
1187 head.ax_check = ADT_VALID;
1188 head
[all...]
/illumos-gate/usr/src/cmd/keyserv/
H A Dkeyserv_cache.c679 struct cachekey_disklist **head,
687 *head = item->next;
708 struct cachekey_disklist **head,
716 *head = item->nexthash;
737 struct cachekey_disklist **head,
750 if (*head == 0)
751 *head = item;
753 item->next = *head;
757 *head = item;
766 struct cachekey_disklist **head,
677 list_remove( struct cachekey_disklist *item, struct cachekey_disklist **head, struct cachekey_disklist **tail, u_int *count) argument
706 list_remove_hash( struct cachekey_disklist *item, struct cachekey_disklist **head, struct cachekey_disklist **tail, u_int *count) argument
735 list_insert( struct cachekey_disklist *item, struct cachekey_disklist **head, struct cachekey_disklist **tail, u_int *count) argument
764 list_insert_hash( struct cachekey_disklist *item, struct cachekey_disklist **head, struct cachekey_disklist **tail, u_int *count) argument
[all...]
/illumos-gate/usr/src/cmd/rcm_daemon/common/
H A Drcm_script.c169 /* contains head to a queue of script_info structures */
1680 rcm_queue_t *head; local
1685 head = &module->client_q;
1687 for (q = head->next; q != head; q = q->next) {
1700 rcm_queue_t *head; local
1705 head = &module->client_q;
1707 for (q = head->next; q != head; q = q->next) {
1723 rcm_queue_t *head; local
1813 rcm_queue_t *head = &rsi->drreq_q; local
1837 rcm_queue_t *head = &rsi->drreq_q; local
[all...]
/illumos-gate/usr/src/lib/libdevinfo/
H A Ddevinfo.c441 if (!(devnm[major].head)) {
446 return (DI_NODE(pa + devnm[major].head));
785 struct node_list *head; /* node_list for tree walk */ local
792 if ((head = malloc(sizeof (struct node_list))) == NULL) {
797 head->next = NULL;
798 head->node = root;
803 while (head != NULL)
804 walk_one_node(&head, flag, arg, node_callback);
856 struct node_list *head; /* node_list for tree walk */ local
869 if ((head
3600 struct node_list *head; /* node_list for tree walk */ local
3665 struct node_list *head; /* node_list for tree walk */ local
[all...]
/illumos-gate/usr/src/uts/common/zmod/
H A Ddeflate.c179 * Insert string str in the dictionary and set match_head to the previous head
191 match_head = s->head[s->ins_h], \
192 s->head[s->ins_h] = (Pos)(str))
196 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
197 s->head[s->ins_h] = (Pos)(str))
205 s->head[s->hash_size-1] = NIL; \
206 (void) zmemzero((Bytef *)s->head, \
207 (unsigned)(s->hash_size-1)*sizeof(*s->head));
295 s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));
303 if (s->window == Z_NULL || s->prev == Z_NULL || s->head
[all...]
/illumos-gate/usr/src/cmd/rmformat/
H A Drmf_menu.c225 DPRINTF3("media cyl %d head %d sect %d\n",
1055 uint32_t cyl, head; local
1065 for (head = 0; head < med_info.sm_nhead; head++) {
1066 if (smedia_format_track(handle, cyl, head, SM_FORMAT_HD)
1086 uint32_t cyl, head; local
1095 for (head = 0; head < med_info.sm_nhead; head
[all...]
/illumos-gate/usr/src/lib/libast/common/comp/
H A Dconf.sh69 head='#include "FEATURE/standards"
119 ${head}
138 ${head}
786 ${head}
814 ${head}
855 ${head}
1092 ${head}
1107 ${head}
1251 ${head}
1536 ${head}
[all...]
/illumos-gate/usr/src/cmd/msgfmt/
H A Dxgettext.c1387 * Finds the head of domain nodes given domain name.
1716 * Reads existing po file into the linked list and returns the head
1887 write_one_file(struct domain_st *head) argument
1896 * If head is NULL, then it still has to create .po file
1909 if ((head != NULL) &&
1910 (head->dname != NULL)) {
1911 (void) strcpy(dname, head->dname);
1934 * If head is NULL, we don't have to change existing file.
1937 if (head == NULL) {
1941 head
[all...]

Completed in 136 milliseconds

<<11121314151617181920>>