HomeSort by relevance Sort by last modified time
    Searched refs:l_next (Results 1 - 25 of 50) sorted by null

1 2

  /onnv/onnv-gate/usr/src/cmd/fm/modules/sun4/cpumem-diagnosis/
cmd_list.c 35 * 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 == NULL)
    [all...]
cmd_list.h 38 struct cmd_list *l_next; member in struct:cmd_list
42 #define cmd_list_next(elem) ((void *)(((cmd_list_t *)(elem))->l_next))
  /onnv/onnv-gate/usr/src/cmd/fm/fmd/common/
fmd_list.c 35 * 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 = p
    [all...]
fmd_list.h 38 struct fmd_list *l_next; member in struct:fmd_list
42 #define fmd_list_next(elem) ((void *)(((fmd_list_t *)(elem))->l_next))
  /onnv/onnv-gate/usr/src/lib/libipmi/common/
ipmi_list.c 34 * 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 = p
    [all...]
ipmi_impl.h 38 struct ipmi_list *l_next; member in struct:ipmi_list
147 #define ipmi_list_next(elem) ((void *)(((ipmi_list_t *)(elem))->l_next))
  /onnv/onnv-gate/usr/src/common/ctf/
ctf_util.c 34 * 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 = p->l_next
    [all...]
  /onnv/onnv-gate/usr/src/cmd/sgs/link_audit/common/
env.h 32 struct elist * l_next; member in struct:elist
env.c 55 lp->l_next = *list;
80 for (; list; list = list->l_next) {
perfcnt.c 53 struct list *l_next; member in struct:list
91 new_list->l_next = 0;
96 prev = cur, cur = cur->l_next)
102 new_list->l_next = list_head;
106 prev->l_next = new_list;
107 new_list->l_next = cur;
265 for (cur = list_head; cur; cur = cur->l_next) {
  /onnv/onnv-gate/usr/src/lib/fm/topo/libtopo/common/
topo_list.c 41 * 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 = p
    [all...]
topo_list.h 38 #define topo_list_next(elem) ((void *)(((topo_list_t *)(elem))->l_next))
  /onnv/onnv-gate/usr/src/cmd/fm/modules/sun4v/generic-mem/
gmem_util.c 93 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 = p->l_next
    [all...]
gmem_util.h 40 struct gmem_list *l_next; member in struct:gmem_list
44 #define gmem_list_next(elem) ((void *)(((gmem_list_t *)(elem))->l_next))
  /onnv/onnv-gate/usr/src/tools/ctf/common/
list.c 42 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...]
  /onnv/onnv-gate/usr/src/cmd/wbem/provider/tools/rds/
rdtable.c 52 elm->l_next = lwpid_tbl[hash]; /* add in front of chain */
68 lwpid_tbl[hash] = elm->l_next;
70 elm_prev->l_next = elm->l_next;
75 elm = elm->l_next;
88 elm = elm->l_next;
112 elm = elm->l_next;
rdtable.h 65 struct lwpid *l_next; member in struct:lwpid
  /onnv/onnv-gate/usr/src/lib/abi/apptrace/common/
abienv.h 35 struct liblist *l_next; member in struct:liblist
abienv.c 74 lp->l_next = *list;
176 lp->l_next = NULL;
178 (*listend)->l_next = lp;
214 for (; list; list = list->l_next) {
  /onnv/onnv-gate/usr/src/cmd/filesync/
ignore.c 76 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;
  /onnv/onnv-gate/usr/src/cmd/prstat/
prtable.c 235 elm->l_next = plwp_tbl[hash]; /* add in front of chain */
251 plwp_tbl[hash] = elm->l_next;
253 elm_prev->l_next = elm->l_next;
258 elm = elm->l_next;
271 elm = elm->l_next;
295 elm = elm->l_next;
prtable.h 70 struct plwp *l_next; member in struct:plwp
  /onnv/onnv-gate/usr/src/stand/lib/fs/ufs/
lufsboot.c 183 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...]
  /onnv/onnv-gate/usr/src/uts/common/os/
flock.c 817 lock = lock->l_next;
841 lock = lock->l_next;
873 lock = lock->l_next;
931 lock = lock->l_next;
938 lock = lock->l_next;
957 lock = lock->l_next;
964 lock = lock->l_next;
1030 lock1 = lock->l_next;
    [all...]
  /onnv/onnv-gate/usr/src/lib/libtnfctl/
prb_lmap.c 90 lmap.l_next = NULL; /* makes lint happy */
93 lmapaddr = (uintptr_t) lmap.l_next) {

Completed in 5949 milliseconds

1 2