Home
last modified time | relevance | path

Searched refs:l_next (Results 1 – 25 of 41) sorted by relevance

12

/illumos-gate/usr/src/cmd/fm/fmd/common/
H A Dfmd_list.c55 q->l_next = NULL; in fmd_list_append()
58 ASSERT(p->l_next == NULL); in fmd_list_append()
59 p->l_next = q; in fmd_list_append()
61 ASSERT(lp->l_next == NULL); in fmd_list_append()
62 lp->l_next = q; in fmd_list_append()
70 fmd_list_t *q = lp->l_next; /* q = head list element */ in fmd_list_prepend()
72 lp->l_next = p; in fmd_list_prepend()
74 p->l_next = q; in fmd_list_prepend()
97 q->l_next = p; in fmd_list_insert_before()
99 q->l_prev->l_next = q; in fmd_list_insert_before()
[all …]
H A Dfmd_list.h36 struct fmd_list *l_next; member
40 #define fmd_list_next(elem) ((void *)(((fmd_list_t *)(elem))->l_next))
H A Dfmd_mdb.c82 for (addr = (uintptr_t)F.d_thr_list.l_next; addr != 0; in trwalk_init()
83 addr = (uintptr_t)thr.thr_list.l_next) { in trwalk_init()
680 wsp->walk_addr = (uintptr_t)F.d_thr_list.l_next; in thread_walk_init()
698 wsp->walk_addr = (uintptr_t)t.thr_list.l_next; in thread_walk_step()
739 wsp->walk_addr = (uintptr_t)F.d_mod_list.l_next; in mod_walk_init()
757 wsp->walk_addr = (uintptr_t)m.mod_list.l_next; in mod_walk_step()
805 wsp->walk_addr = (uintptr_t)mod.mod_cases.l_next; in case_walk_init()
837 wsp->walk_addr = (uintptr_t)ci.ci_list.l_next; in case_walk_step()
1387 wsp->walk_addr = (uintptr_t)tmq.tmq_list.l_next; in tmq_walk_init()
1405 wsp->walk_addr = (uintptr_t)tmr.tmr_list.l_next; in tmq_walk_step()
[all …]
/illumos-gate/usr/src/lib/libipmi/common/
H A Dipmi_list.c48 q->l_next = NULL; in ipmi_list_append()
51 assert(p->l_next == NULL); in ipmi_list_append()
52 p->l_next = q; in ipmi_list_append()
54 assert(lp->l_next == NULL); in ipmi_list_append()
55 lp->l_next = q; in ipmi_list_append()
63 ipmi_list_t *q = lp->l_next; /* q = head list element */ in ipmi_list_prepend()
65 lp->l_next = p; in ipmi_list_prepend()
67 p->l_next = q; in ipmi_list_prepend()
90 q->l_next = p; in ipmi_list_insert_before()
92 q->l_prev->l_next = q; in ipmi_list_insert_before()
[all …]
H A Dipmi_impl.h39 struct ipmi_list *l_next; member
149 #define ipmi_list_next(elem) ((void *)(((ipmi_list_t *)(elem))->l_next))
/illumos-gate/usr/src/lib/fm/topo/libtopo/common/
H A Dtopo_list.c64 q->l_next = NULL; in topo_list_append()
67 assert(p->l_next == NULL); in topo_list_append()
68 p->l_next = q; in topo_list_append()
70 assert(lp->l_next == NULL); in topo_list_append()
71 lp->l_next = q; in topo_list_append()
79 topo_list_t *q = lp->l_next; /* q = head list element */ in topo_list_prepend()
81 lp->l_next = p; in topo_list_prepend()
83 p->l_next = q; in topo_list_prepend()
106 q->l_next = p; in topo_list_insert_before()
108 q->l_prev->l_next = q; in topo_list_insert_before()
[all …]
H A Dtopo_list.h39 #define topo_list_next(elem) ((void *)(((topo_list_t *)(elem))->l_next))
/illumos-gate/usr/src/common/ctf/
H A Dctf_util.c48 q->l_next = NULL; in ctf_list_append()
51 p->l_next = q; in ctf_list_append()
53 lp->l_next = q; in ctf_list_append()
64 ctf_list_t *q = lp->l_next; /* q = head list element */ in ctf_list_prepend()
66 lp->l_next = p; in ctf_list_prepend()
68 p->l_next = q; in ctf_list_prepend()
84 new->l_next = lp; in ctf_list_insert_before()
87 prev->l_next = new; in ctf_list_insert_before()
89 ASSERT(head->l_next == lp); in ctf_list_insert_before()
90 head->l_next = new; in ctf_list_insert_before()
[all …]
/illumos-gate/usr/src/uts/common/os/
H A Dflock.c486 nlock = lock->l_next; in ofdcleanlock()
499 nlock = lock->l_next; in ofdcleanlock()
1120 lock = lock->l_next; in flk_process_request()
1144 lock = lock->l_next; in flk_process_request()
1176 lock = lock->l_next; in flk_process_request()
1234 lock = lock->l_next; in flk_process_request()
1241 lock = lock->l_next; in flk_process_request()
1260 lock = lock->l_next; in flk_process_request()
1267 lock = lock->l_next; in flk_process_request()
1332 lock1 = lock->l_next; in flk_execute_request()
[all …]
/illumos-gate/usr/src/stand/lib/fs/ufs/
H A Dlufsboot.c181 struct lb_mapentry *l_next; /* hash chaining */ member
194 (*(lh))->l_prev->l_next = (l); \
195 (l)->l_next = (*(lh)); \
199 (l)->l_next = (l); \
205 if ((l)->l_next == (l)) { \
211 *(lh) = (l)->l_next; \
212 (l)->l_prev->l_next = (l)->l_next; \
213 (l)->l_next->l_prev = (l)->l_prev; \
320 lfreelist = lfreelist->l_next; in lufs_alloc_from_logbuf()
658 lnext = l->l_next; in lufs_logscan_freecancel()
[all …]
/illumos-gate/usr/src/cmd/filesync/
H A Dignore.c76 struct list *l_next; /* pointer to next element */ member
128 for (lp = expr_list; lp; lp = lp->l_next) { in ignore_check()
183 lp->l_next = expr_list; in ignore_expr()
270 pp = &(lp->l_next); in ign_hash()
279 lp->l_next = 0; in ign_hash()
350 np = lp->l_next; in ignore_reset()
359 np = lp->l_next; in ignore_reset()
/illumos-gate/usr/src/cmd/psrinfo/
H A Dpsrinfo.c64 struct link *l_next; member
172 item->l_next = *ins; in ins_link()
192 ins = &l->l_next; in find_link()
215 if ((l->l_next == NULL) || in print_links()
216 (l->l_next->l_id > (l->l_id + 1))) { in print_links()
223 if (l->l_next) in print_links()
227 l = l->l_next; in print_links()
249 for (l1 = pchips; l1; l1 = l1->l_next) { in print_vp()
290 for (l2 = chip->p_cores; l2; l2 = l2->l_next) { in print_vp()
326 for (l = pchips; l != NULL; l = l->l_next) { in print_ps()
[all …]
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Dperfcnt.c49 struct list *l_next; member
87 new_list->l_next = NULL; in list_insert()
92 prev = cur, cur = cur->l_next) in list_insert()
98 new_list->l_next = list_head; in list_insert()
102 prev->l_next = new_list; in list_insert()
103 new_list->l_next = cur; in list_insert()
261 for (cur = list_head; cur; cur = cur->l_next) { in cleanup()
H A Denv.c51 lp->l_next = *list; in build_env_list()
76 for (; list; list = list->l_next) { in check_list()
H A Denv.h31 struct elist *l_next; member
/illumos-gate/usr/src/cmd/prstat/
H A Dprtable.c252 elm->l_next = plwp_tbl[hash]; /* add in front of chain */ in lwpid_add()
268 plwp_tbl[hash] = elm->l_next; in lwpid_del()
270 elm_prev->l_next = elm->l_next; in lwpid_del()
275 elm = elm->l_next; in lwpid_del()
288 elm = elm->l_next; in lwpid_getptr()
312 elm = elm->l_next; in lwpid_pidcheck()
/illumos-gate/usr/src/cmd/mdb/common/modules/libtopo/
H A Dlibtopo.c138 mdb_printf(" %-12s 0x%-34p %-30s\n", "l_next", th.th_trees.l_next, in topo_handle()
311 mdb_printf(" %-12s 0x%-34p\n", "l_next", tn.tn_children.l_next); in topo_node()
586 wsp->walk_addr = (uintptr_t)th.th_trees.l_next; in ttree_walk_init()
613 wsp->walk_addr = (uintptr_t)tree->tt_list.l_next; in ttree_walk_step()
723 wsp->walk_addr = (uintptr_t)node.tn_pgroups.l_next; in tpg_walk_init()
751 wsp->walk_addr = (uintptr_t)tpgp->tpg_list.l_next; in tpg_walk_step()
779 wsp->walk_addr = (uintptr_t)pg.tpg_pvals.l_next; in tpl_walk_init()
807 wsp->walk_addr = (uintptr_t)plp->tp_list.l_next; in tpl_walk_step()
838 state->curr_hash = (topo_nodehash_t *)node.tn_children.l_next; in tnh_walk_init()
880 (topo_nodehash_t *)(state->hash.th_list.l_next); in tnh_walk_step()
[all …]
/illumos-gate/usr/src/uts/common/sys/
H A Dflock_impl.h63 struct lock_descriptor *l_next; /* next active/sleep lock */ member
236 for ((lock) = SLEEPING_HEAD((gp))->l_next; ((lock) != SLEEPING_HEAD((gp)) && \
237 (lock)->l_vnode != (vp)); (lock) = (lock)->l_next) \
365 (lock)->l_next->l_prev = (lock)->l_prev; \
366 (lock)->l_prev->l_next = (lock)->l_next; \
367 (lock)->l_next = (lock)->l_prev = (lock_descriptor_t *)NULL; \
/illumos-gate/usr/src/lib/abi/apptrace/common/
H A Dabienv.c72 lp->l_next = *list; in build_env_list()
174 lp->l_next = NULL; in appendlist()
176 (*listend)->l_next = lp; in appendlist()
212 for (; list; list = list->l_next) { in check_list()
H A Dabienv.h33 struct liblist *l_next; member
/illumos-gate/usr/src/tools/protocmp/
H A Dprotodir.c47 char *l_next; in resolve_relative() local
60 l_next = index(l_pos, '/'); in resolve_relative()
70 if (l_next) { in resolve_relative()
72 (l_next - l_pos)); in resolve_relative()
76 l_pos = l_next + 1; in resolve_relative()
77 } while (l_next); in resolve_relative()
/illumos-gate/usr/src/lib/libresolv2/common/irs/
H A Dlcl_ng.c63 struct linelist *l_next; /*%< Chain ptr. */ member
240 lp = lp->l_next; in freelists()
283 lp = lp->l_next; in parse_netgrp()
429 lp->l_next = pvt->linehead; in read_for_group()
/illumos-gate/usr/src/cmd/fs.d/nfs/nfslog/
H A Dprocess_buffer.c53 struct nfs_log_list *l_next; member
415 for (p = badtag_list; p != NULL; p = p->l_next) { in badtag_notify()
433 lp->l_next = badtag_list; in badtag_notify()
/illumos-gate/usr/src/uts/sun4u/opl/io/oplmsu/
H A Doplmsu_cmn_func.c140 last_lpath->l_next = add_lpath; in oplmsu_link_lpath()
145 add_lpath->l_next = NULL; in oplmsu_link_lpath()
168 del_lpath->l_prev->l_next = del_lpath->l_next; in oplmsu_unlink_lpath()
169 del_lpath->l_next->l_prev = del_lpath->l_prev; in oplmsu_unlink_lpath()
172 *first = (*first)->l_next; in oplmsu_unlink_lpath()
181 (*last)->l_next = NULL; in oplmsu_unlink_lpath()
186 del_lpath->l_next = NULL; in oplmsu_unlink_lpath()
242 lpath = lpath->l_next; in oplmsu_check_lpath_usable()
1090 lpath = lpath->l_next; in oplmsu_cmn_bufcb()
/illumos-gate/usr/src/lib/libproc/common/
H A DPzone.c57 struct lofs_mnttab *l_next; member
76 next = lmt->l_next; in rebuild_lofs_cache()
104 lmt->l_next = lofs_mnttab; in rebuild_lofs_cache()
118 for (lmt = lofs_mnttab; lmt != NULL; lmt = lmt->l_next) { in lookup_lofs_mount_point()

12