Searched refs:l_next (Results 1 - 25 of 52) sorted by relevance

123

/illumos-gate/usr/src/cmd/fm/modules/sun4/cpumem-diagnosis/
H A Dcmd_list.c35 * An additional cmd_list_t is used to store the head (l_next) and tail
51 q->l_next = NULL;
54 p->l_next = q;
56 lp->l_next = q;
63 cmd_list_t *q = lp->l_next; /* q = head list element */
65 lp->l_next = p;
67 p->l_next = q;
87 q->l_next = p;
89 q->l_prev->l_next = q;
98 if (p == NULL || p->l_next
[all...]
H A Dcmd_list.h38 struct cmd_list *l_next; member in struct:cmd_list
42 #define cmd_list_next(elem) ((void *)(((cmd_list_t *)(elem))->l_next))
/illumos-gate/usr/src/lib/libipmi/common/
H A Dipmi_list.c34 * An additional ipmi_list_t is used to store the head (l_next) and tail
50 q->l_next = NULL;
53 assert(p->l_next == NULL);
54 p->l_next = q;
56 assert(lp->l_next == NULL);
57 lp->l_next = q;
65 ipmi_list_t *q = lp->l_next; /* q = head list element */
67 lp->l_next = p;
69 p->l_next = q;
92 q->l_next
[all...]
H A Dipmi_impl.h39 struct ipmi_list *l_next; member in struct:ipmi_list
149 #define ipmi_list_next(elem) ((void *)(((ipmi_list_t *)(elem))->l_next))
/illumos-gate/usr/src/cmd/fm/fmd/common/
H A Dfmd_list.c35 * An additional fmd_list_t is used to store the head (l_next) and tail
57 q->l_next = NULL;
60 ASSERT(p->l_next == NULL);
61 p->l_next = q;
63 ASSERT(lp->l_next == NULL);
64 lp->l_next = q;
72 fmd_list_t *q = lp->l_next; /* q = head list element */
74 lp->l_next = p;
76 p->l_next = q;
99 q->l_next
[all...]
H A Dfmd_list.h38 struct fmd_list *l_next; member in struct:fmd_list
42 #define fmd_list_next(elem) ((void *)(((fmd_list_t *)(elem))->l_next))
/illumos-gate/usr/src/common/ctf/
H A Dctf_util.c34 * An additional ctf_list_t is used to store the head (l_next) and tail
46 q->l_next = NULL;
49 p->l_next = q;
51 lp->l_next = q;
62 ctf_list_t *q = lp->l_next; /* q = head list element */
64 lp->l_next = p;
66 p->l_next = q;
84 p->l_prev->l_next = p->l_next;
86 lp->l_next
[all...]
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Denv.h31 struct elist *l_next; member in struct:elist
H A Denv.c51 lp->l_next = *list;
76 for (; list; list = list->l_next) {
H A Dperfcnt.c49 struct list *l_next; member in struct:list
87 new_list->l_next = NULL;
92 prev = cur, cur = cur->l_next)
98 new_list->l_next = list_head;
102 prev->l_next = new_list;
103 new_list->l_next = cur;
261 for (cur = list_head; cur; cur = cur->l_next) {
/illumos-gate/usr/src/lib/fm/topo/libtopo/common/
H A Dtopo_list.c41 * An additional topo_list_t is used to store the head (l_next) and tail
61 q->l_next = NULL;
64 assert(p->l_next == NULL);
65 p->l_next = q;
67 assert(lp->l_next == NULL);
68 lp->l_next = q;
76 topo_list_t *q = lp->l_next; /* q = head list element */
78 lp->l_next = p;
80 p->l_next = q;
103 q->l_next
[all...]
H A Dtopo_list.h38 #define topo_list_next(elem) ((void *)(((topo_list_t *)(elem))->l_next))
/illumos-gate/usr/src/cmd/fm/modules/sun4v/generic-mem/
H A Dgmem_util.c93 q->l_next = NULL;
96 p->l_next = q;
98 lp->l_next = q;
105 gmem_list_t *q = lp->l_next; /* q = head list element */
107 lp->l_next = p;
109 p->l_next = q;
129 q->l_next = p;
131 q->l_prev->l_next = q;
140 if (p == NULL || p->l_next == NULL) {
145 q->l_next
[all...]
H A Dgmem_util.h40 struct gmem_list *l_next; member in struct:gmem_list
44 #define gmem_list_next(elem) ((void *)(((gmem_list_t *)(elem))->l_next))
/illumos-gate/usr/src/tools/ctf/common/
H A Dlist.c42 struct list *l_next; member in struct:list
53 le->l_next = *list;
63 for (nextp = list; *nextp; nextp = &((*nextp)->l_next)) {
88 for (le = *list, le2 = list; le; le2 = &le->l_next, le = le->l_next) {
90 *le2 = le->l_next;
107 list = list->l_next;
126 lnext = list->l_next;
158 for (; list; list = list->l_next) {
177 for (l = *list1, last = NULL; l; last = l, l = l->l_next)
[all...]
/illumos-gate/usr/src/lib/abi/apptrace/common/
H A Dabienv.h35 struct liblist *l_next; member in struct:liblist
H A Dabienv.c74 lp->l_next = *list;
176 lp->l_next = NULL;
178 (*listend)->l_next = lp;
214 for (; list; list = list->l_next) {
/illumos-gate/usr/src/cmd/filesync/
H A Dignore.c76 struct list *l_next; /* pointer to next element */ member in struct:list
128 for (lp = expr_list; lp; lp = lp->l_next) {
183 lp->l_next = expr_list;
270 pp = &(lp->l_next);
279 lp->l_next = 0;
350 np = lp->l_next;
359 np = lp->l_next;
/illumos-gate/usr/src/cmd/prstat/
H A Dprtable.c252 elm->l_next = plwp_tbl[hash]; /* add in front of chain */
268 plwp_tbl[hash] = elm->l_next;
270 elm_prev->l_next = elm->l_next;
275 elm = elm->l_next;
288 elm = elm->l_next;
312 elm = elm->l_next;
H A Dprtable.h72 struct plwp *l_next; member in struct:plwp
/illumos-gate/usr/src/stand/lib/fs/ufs/
H A Dlufsboot.c183 struct lb_mapentry *l_next; /* hash chaining */ member in struct:lb_mapentry
196 (*(lh))->l_prev->l_next = (l); \
197 (l)->l_next = (*(lh)); \
201 (l)->l_next = (l); \
207 if ((l)->l_next == (l)) { \
213 *(lh) = (l)->l_next; \
214 (l)->l_prev->l_next = (l)->l_next; \
215 (l)->l_next->l_prev = (l)->l_prev; \
322 lfreelist = lfreelist->l_next;
[all...]
/illumos-gate/usr/src/cmd/psrinfo/
H A Dpsrinfo.c55 struct link *l_next; member in struct:link
156 item->l_next = *ins;
176 ins = &l->l_next;
199 if ((l->l_next == NULL) ||
200 (l->l_next->l_id > (l->l_id + 1))) {
207 if (l->l_next)
211 l = l->l_next;
233 for (l1 = pchips; l1; l1 = l1->l_next) {
278 for (l2 = chip->p_cores; l2; l2 = l2->l_next) {
309 for (l = pchips; l != NULL; l = l->l_next) {
[all...]
/illumos-gate/usr/src/boot/sys/sys/
H A Dlink_elf.h64 struct link_map *l_next, *l_prev; /* linked list of of mapped libs */ member in struct:link_map
/illumos-gate/usr/src/uts/common/os/
H A Dflock.c486 nlock = lock->l_next;
499 nlock = lock->l_next;
1110 lock = lock->l_next;
1134 lock = lock->l_next;
1166 lock = lock->l_next;
1224 lock = lock->l_next;
1231 lock = lock->l_next;
1250 lock = lock->l_next;
1257 lock = lock->l_next;
1322 lock1 = lock->l_next;
[all...]
/illumos-gate/usr/src/lib/libtnfctl/
H A Dprb_lmap.c90 lmap.l_next = NULL; /* makes lint happy */
93 lmapaddr = (uintptr_t) lmap.l_next) {

Completed in 383 milliseconds

123