| /onnv/onnv-gate/usr/src/uts/common/io/drm/ |
| drm_linux_list.h | 40 struct list_head *next, *prev; member in struct:list_head
48 (head)->prev = head; \
52 (entry)->prev = (head)->prev; \
54 (head)->prev->next = entry; \
55 (head)->prev = entry; \
59 (entry)->next->prev = (entry)->prev; \
60 (entry)->prev->next = (entry)->next; \
|
| /onnv/onnv-gate/usr/src/cmd/bnu/ |
| versys.c | 53 char *prev; local
58 prev = _uu_setlocale(LC_ALL, "C");
66 (void) _uu_resetlocale(LC_ALL, prev);
80 (void) _uu_resetlocale(LC_ALL, prev);
85 (void) _uu_resetlocale(LC_ALL, prev);
|
| getargs.c | 53 char *prev; local
55 prev = _uu_setlocale(LC_ALL, "C");
69 (void) _uu_resetlocale(LC_ALL, prev);
94 char *prev; local
96 prev = _uu_setlocale(LC_ALL, "C");
162 (void) _uu_resetlocale(LC_ALL, prev);
|
| /onnv/onnv-gate/usr/src/uts/common/io/mega_sas/ |
| list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev; member in struct:mlist_head
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
81 struct mlist_head *prev,
84 next->prev = new;
86 new->prev = prev;
87 prev->next = new;
115 __list_add(new, head->prev, head)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libntfs/common/include/ntfs/ |
| list.h | 33 * sometimes we already know the next/prev entries and we can
38 struct list_head *next, *prev; member in struct:list_head
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
53 * @prev:
56 * This is only for internal list manipulation where we know the prev/next
60 struct list_head * prev, struct list_head * next)
62 next->prev = new;
64 new->prev = prev;
65 prev->next = new
[all...] |
| /onnv/onnv-gate/usr/src/uts/intel/promif/ |
| prom_prop.c | 57 prom_decode_composite_string(void *buf, size_t buflen, char *prev)
62 if (prev == 0)
65 prev += strlen(prev) + 1;
66 if (prev >= ((char *)buf + buflen))
68 return (prev);
|
| /onnv/onnv-gate/usr/src/lib/libldap5/sources/ldap/common/ |
| reslist.c | 43 LDAPMessage *tmp, *prev = NULL; local
46 prev = tmp;
51 if ( prev == NULL )
54 prev->lm_chain = tmp->lm_chain;
|
| /onnv/onnv-gate/usr/src/uts/common/io/mr_sas/ |
| mr_sas_list.h | 53 * sometimes we already know the next/prev entries and we can
59 struct mlist_head *next, *prev; member in struct:mlist_head
70 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 * the prev/next entries already!
81 struct mlist_head *prev,
84 next->prev = new;
86 new->prev = prev;
87 prev->next = new;
115 __list_add(new, head->prev, head)
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/xge/hal/include/ |
| xge-list.h | 33 * @prev: Previous list item.
39 struct xge_list_t* prev; member in struct:xge_list_t
53 header->prev = header;
83 xge_assert(header->prev != NULL);
102 xge_assert(item->prev != NULL);
104 item->next->prev = item->prev;
105 item->prev->next = item->next;
107 item->next = item->prev = NULL;
128 new_item->prev = prev_item
[all...] |
| /onnv/onnv-gate/usr/src/lib/libresolv2/include/isc/ |
| list.h | 26 #define LINK(type) struct { type *prev, *next; }
29 (elt)->link.prev = (type *)(-1); \
34 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
45 (list).head->link.prev = (elt); \
48 (elt)->link.prev = NULL; \
60 (elt)->link.prev = (list).tail; \
69 (elt)->link.next->link.prev = (elt)->link.prev; \
72 (list).tail = (elt)->link.prev; \
74 if ((elt)->link.prev != NULL)
[all...] |
| /onnv/onnv-gate/usr/src/common/openssl/crypto/x509v3/ |
| tabtest.c | 71 int i, prev = -1, bad = 0; local
78 if((*tmp)->ext_nid < prev) bad = 1;
79 prev = (*tmp)->ext_nid;
|
| /onnv/onnv-gate/usr/src/lib/libast/common/misc/ |
| debug.c | 49 static double prev; local
54 return prev = tm;
55 return tm - prev;
|
| /onnv/onnv-gate/usr/src/uts/common/os/ |
| memlist_new.c | 134 new->prev = cur->prev;
135 cur->prev = new;
139 new->prev->next = new;
147 new->prev = last;
168 ASSERT(memlistp->prev == NULL);
171 if (memlistp->prev != NULL) {
172 ASSERT(memlistp->prev->next == memlistp);
173 memlistp->prev->next = memlistp->next;
176 ASSERT(memlistp->next->prev == memlistp)
205 struct memlist *prev, *next; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/sgs/librtld_db/rdb_demo/common/ |
| disasm.c | 42 FUNCPTR prtAddress, unsigned int next, unsigned int prev,
|
| /onnv/onnv-gate/usr/src/lib/libldap4/common/ |
| addentry.c | 41 LDAPMessage *tmp, *prev = NULL; local
44 prev = tmp;
49 if ( prev == NULL )
52 prev->lm_chain = tmp->lm_chain;
|
| /onnv/onnv-gate/usr/src/uts/intel/io/pci/ |
| pci_memlist.c | 30 * NOTE: We are only using the next-> link. The prev-> link is
88 struct memlist *prev = 0, *next; local
107 prev = next;
108 next = prev->next;
111 merge_left = (prev && addr == prev->address + prev->size);
114 prev->size += size + next->size;
115 prev->next = next->next;
121 prev->size += size
154 struct memlist *prev = 0; local
225 struct memlist *prev = 0, *next; local
294 struct memlist *head, *prev; local
327 struct memlist *head = 0, *prev = 0; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/lp/cmd/lpsched/ |
| rstatus.c | 53 r->prev = prs->prev;
54 if (r->prev)
55 r->prev->next = r;
57 prs->prev = r;
66 r->prev = prs;
83 r->next->prev = r->prev;
85 if (r->prev)
86 r->prev->next = r->next
[all...] |
| /onnv/onnv-gate/usr/src/cmd/mailx/ |
| myfopen.c | 106 register NODE *cur, *prev; local
108 for (prev = cur = fplist; cur != (NODE *)NULL; cur = cur->next) {
113 prev->next = cur->next;
114 cur = prev->next ? prev->next : prev;
117 curptr = prev;
121 prev = cur;
|
| /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/jfs/ |
| jfs_types.h | 299 struct type *prev;\
304 struct cdll_entry *prev; member in struct:cdll_entry
341 (elm)->field.prev = (void *)(header);\
345 (header)->head->field.prev = (elm);\
358 (elm)->field.prev = (header)->tail;\
376 (elm)->field.prev = (listelm);\
380 (listelm)->field.next->field.prev = (elm);\
394 (elm)->field.prev = (listelm)->field.prev;\
395 if ((listelm)->field.prev == (void *)(header))
[all...] |
| /onnv/onnv-gate/usr/src/cmd/syslogd/ |
| list.c | 83 ll_t **prev = &ptr->front; local
91 prev = &(t->n);
95 if ((*prev = t->n) == NULL)
96 ptr->back = prev;
108 ll_t **prev = &head->front; local
112 prev = &ptr->n;
115 assert(head->back == prev);
|
| /onnv/onnv-gate/usr/src/cmd/audio/utilities/ |
| AudioList.cc | 40 aptr(0), next(0), prev(0)
52 next->prev = prev;
54 if (prev != 0) {
55 prev->next = next;
78 prev = after;
82 next->prev = this;
307 AudioListEntry *prev; local
311 prev = &head; // this is the first extent
313 if (!getposition(pos, prev)) {
341 AudioListEntry *prev; local
[all...] |
| /onnv/onnv-gate/usr/src/cmd/powertop/common/ |
| suggestions.c | 95 new->prev = NULL;
129 new->prev = n;
137 new->prev = sugg;
138 sugg->prev = new;
146 new->prev = pos->prev;
147 pos->prev->next = new;
148 pos->prev = new;
172 sugg->prev = NULL;
177 n->prev->next = NULL
[all...] |
| /onnv/onnv-gate/usr/src/lib/libast/common/tm/ |
| tmzone.c | 52 register char* prev; local
69 prev = 0;
73 prev = zp->type;
74 if (!type || type == prev || !prev)
|
| /onnv/onnv-gate/usr/src/uts/common/fs/zfs/ |
| zfs_rlock.c | 268 zfs_range_add_reader(avl_tree_t *tree, rl_t *new, rl_t *prev, avl_index_t where)
275 * prev arrives either:
281 if (prev) {
282 if (prev->r_off + prev->r_len <= off) {
283 prev = NULL;
284 } else if (prev->r_off != off) {
289 prev = zfs_range_split(tree, prev, off);
290 prev = AVL_NEXT(tree, prev); /* move to rear range *
356 rl_t *prev, *next; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/sys/ |
| ddi_hp_impl.h | 108 type *curr, *prev = NULL; \
110 for (curr = (head); curr; prev = curr, curr = curr->next); \
111 if (prev == NULL) \
114 prev->next = (node); \
120 type *curr, *prev = NULL; \
121 for (curr = (head); curr; prev = curr, curr = curr->next) { \
126 if (prev == NULL) \
129 prev->next = curr->next; \
|
