Searched refs:prev (Results 1 - 25 of 698) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/uts/common/io/mr_sas/
H A Dmr_sas_list.c23 * the prev/next entries already!
26 __list_add(struct mlist_head *new, struct mlist_head *prev, argument
29 next->prev = new;
31 new->prev = prev;
32 prev->next = new;
60 __list_add(new, head->prev, head);
64 * Delete a list entry by making the prev/next entries
68 * the prev/next entries already!
71 __list_del(struct mlist_head *prev, struc argument
[all...]
/illumos-gate/usr/src/cmd/bnu/
H A Dversys.c53 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);
H A Dgetargs.c53 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);
/illumos-gate/usr/src/uts/common/io/qede/
H A Dqede_list.h41 struct qede_list_s *prev; member in struct:qede_list_s
88 list->prev = list;
95 qede_list_t *prev,
98 next->prev = new;
100 new->prev = prev;
101 prev->next = new;
111 qede_list_del(qede_list_t *prev, qede_list_t *next) argument
113 next->prev = prev;
94 qede_list_add(qede_list_t *new, qede_list_t *prev, qede_list_t *next) argument
136 list_splice(const qede_list_t *list, qede_list_t *prev, qede_list_t *next) argument
[all...]
/illumos-gate/usr/src/uts/common/io/mega_sas/
H A Dlist.h53 * 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, hea
80 __list_add(struct mlist_head *new, struct mlist_head *prev, struct mlist_head *next) argument
127 __list_del(struct mlist_head *prev, struct mlist_head *next) argument
[all...]
/illumos-gate/usr/src/uts/intel/promif/
H A Dprom_prop.c57 prom_decode_composite_string(void *buf, size_t buflen, char *prev) argument
62 if (prev == 0)
65 prev += strlen(prev) + 1;
66 if (prev >= ((char *)buf + buflen))
68 return (prev);
/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/
H A Dreslist.c43 LDAPMessage *tmp, *prev = NULL; local
46 prev = tmp;
51 if ( prev == NULL )
54 prev->lm_chain = tmp->lm_chain;
/illumos-gate/usr/src/uts/common/io/xge/hal/include/
H A Dxge-list.h33 * @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
[all...]
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dlist.h26 #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 !
[all...]
/illumos-gate/usr/src/lib/libast/common/misc/
H A Ddebug.c49 static double prev; local
54 return prev = tm;
55 return tm - prev;
/illumos-gate/usr/src/cmd/sgs/librtld_db/demo/common/
H A Ddisasm.c37 unsigned int next, unsigned int prev, int vers)
36 disassemble(unsigned int instr, unsigned long pc, FUNCPTR prtAddress, unsigned int next, unsigned int prev, int vers) argument
/illumos-gate/usr/src/test/util-tests/tests/ctf/
H A Dtest-forward.c25 struct foo *prev; member in struct:forward
/illumos-gate/usr/src/uts/intel/io/pci/
H A Dpci_memlist.c33 * NOTE: We are only using the next-> link. The prev-> link is
91 struct memlist *prev = 0, *next; local
110 prev = next;
111 next = prev->ml_next;
114 merge_left = (prev && addr == prev->ml_address + prev->ml_size);
117 prev->ml_size += size + next->ml_size;
118 prev->ml_next = next->ml_next;
124 prev
157 struct memlist *prev = 0; local
228 struct memlist *prev = 0, *next; local
297 struct memlist *head, *prev; local
330 struct memlist *head = 0, *prev = 0; local
[all...]
/illumos-gate/usr/src/cmd/lp/cmd/lpsched/
H A Drstatus.c53 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
[all...]
/illumos-gate/usr/src/cmd/mailx/
H A Dmyfopen.c106 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;
/illumos-gate/usr/src/lib/libdwarf/common/
H A Dpro_alloc.c102 lp->next = lp->prev = lp;
111 lp->prev = dbglp;
113 nextblock->prev = lp;
161 lp->prev = 0;
163 } else if (lp->next == lp->prev) {
168 remaining->prev = remaining;
171 lp->prev->next = lp->next;
172 lp->next->prev = lp->prev;
173 lp->prev
[all...]
/illumos-gate/usr/src/cmd/syslogd/
H A Dlist.c87 ll_t **prev = &ptr->front; local
95 prev = &(t->n);
99 if ((*prev = t->n) == NULL)
100 ptr->back = prev;
114 ll_t **prev = &head->front; local
120 prev = &ptr->n;
124 assert(head->back == prev);
/illumos-gate/usr/src/cmd/audio/utilities/
H A DAudioList.cc40 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...]
/illumos-gate/usr/src/tools/smatch/src/
H A Dptrlist.c109 list = head->prev;
113 list = list->prev;
195 struct ptr_list *prev; local
201 prev = entry->prev;
202 prev->next = next;
203 next->prev = prev;
233 next->prev = newlist;
234 newlist->prev
462 struct ptr_list *prev = tail; local
[all...]
/illumos-gate/usr/src/cmd/powertop/common/
H A Dsuggestions.c95 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
[all...]
/illumos-gate/usr/src/lib/libast/common/tm/
H A Dtmzone.c52 register char* prev; local
69 prev = 0;
73 prev = zp->type;
74 if (!type || type == prev || !prev)
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dzfs_rlock.c289 locked_range_t *prev, avl_index_t where)
296 * prev arrives either:
302 if (prev != NULL) {
303 if (prev->lr_offset + prev->lr_length <= off) {
304 prev = NULL;
305 } else if (prev->lr_offset != off) {
310 prev = rangelock_split(tree, prev, off);
311 prev
288 rangelock_add_reader(avl_tree_t *tree, locked_range_t *new, locked_range_t *prev, avl_index_t where) argument
381 locked_range_t *prev, *next; local
[all...]
/illumos-gate/usr/src/uts/common/io/ib/clients/of/sol_ofs/
H A Dsol_ofs_gen_util.c62 new_entry->prev = list->tail;
83 if (entry->prev) {
84 entry->prev->next = entry->next;
90 entry->next->prev = entry->prev;
92 list->tail = entry->prev;
96 entry->prev = entry->next = NULL;
149 entry->prev = list->tail;
/illumos-gate/usr/src/uts/common/sys/
H A Dddi_hp_impl.h108 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; \
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dev_waits.c104 evWait *this, *prev; local
112 for (prev = NULL, this = wl->first;
114 prev = this, this = this->next)
117 if (prev != NULL)
118 prev->next = this->next;
122 wl->last = prev;
131 for (prev = NULL, this = ctx->waitDone.first;
133 prev = this, this = this->next)
136 if (prev != NULL)
137 prev
[all...]

Completed in 127 milliseconds

1234567891011>>