/illumos-gate/usr/src/lib/libast/i386/include/ast/ |
H A D | stack.h | 48 struct stackblock* prev; /* previous block in list */ member in struct:stackblock
|
/illumos-gate/usr/src/lib/libast/sparc/include/ast/ |
H A D | stack.h | 48 struct stackblock* prev; /* previous block in list */ member in struct:stackblock
|
/illumos-gate/usr/src/lib/libast/sparcv9/include/ast/ |
H A D | stack.h | 48 struct stackblock* prev; /* previous block in list */ member in struct:stackblock
|
/illumos-gate/usr/src/uts/common/io/mega_sas/ |
H A D | 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, 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/lib/libnisdb/ |
H A D | nisdb_rw.c | 464 __nisdb_rl_t *rr, *prev; local 498 for (rr = &rw->reader, prev = 0; rr != 0; prev = rr, rr = rr->next) { 515 prev->next = rr->next;
|
/illumos-gate/usr/src/lib/librstp/common/ |
H A D | stpm.c | 179 register STPM_T* prev; local 198 prev = NULL; 201 if (prev) { 202 prev->next = this->next; 212 prev = tmp;
|
/illumos-gate/usr/src/lib/libeti/form/common/ |
H A D | chg_field.c | 62 /* prev - return previous active field on page before f */ 64 prev(FIELD *f) function 196 return (_set_current_field(f, prev(C(f)))); 208 return (_set_current_field(f, prev(first(f))));
|
/illumos-gate/usr/src/lib/libc/port/stdio/ |
H A D | popen.c | 259 node_t *prev; local 262 for (prev = curr = head; curr != NULL; curr = curr->next) { 276 prev = curr; 286 prev->next = new; 311 node_t *prev; local 317 for (prev = curr = head; curr != NULL; curr = curr->next) { 322 prev->next = curr->next; 328 prev = curr;
|
/illumos-gate/usr/src/cmd/vscan/vscand/ |
H A D | vs_stats.c | 276 vs_stats_t prev; local 280 (void) memcpy(&prev, &vscan_stats, sizeof (vs_stats_t)); 293 previd = prev.vss_eng[j].vss_engid; 296 prev.vss_eng[j].vss_errors;
|
/illumos-gate/usr/src/cmd/ypcmd/revnetgroup/ |
H A D | revnetgroup.c | 228 stringlist cur, prev; local 230 for (cur = grlist->groups; cur; prev = cur, cur = cur->next) { 235 prev->next = MALLOC(stringnode); 236 cur = prev->next;
|
/illumos-gate/usr/src/cmd/ndmpd/tlm/ |
H A D | tlm_info.c | 276 tlm_chain_link_t *prev; local 280 * the prev and next pointers point to one element in 284 * either of the 'prev' or 'next' pointers point to 299 prev = link->tc_prev; 300 prev->tc_next = next; 301 next->tc_prev = prev;
|
/illumos-gate/usr/src/cmd/rcm_daemon/common/ |
H A D | ttymux_rcm_impl.h | 58 * (ie the next and prev fields). 67 struct rsrc *prev; member in struct:rsrc
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/wpad/ |
H A D | eloop.c | 95 struct eloop_timeout *timeout, *tmp, *prev; local 117 prev = NULL; 122 prev = tmp; 126 if (prev == NULL) { 130 timeout->next = prev->next; 131 prev->next = timeout; 146 struct eloop_timeout *timeout, *prev, *next; local 148 prev = NULL; 158 if (prev == NULL) 161 prev 311 struct eloop_timeout *timeout, *prev; local [all...] |
/illumos-gate/usr/src/cmd/cdrw/ |
H A D | dae.c | 129 uchar_t *tmp, *buf, *prev, *previous_end; local 150 prev = (uchar_t *)my_zalloc(BLOCK_SIZE * read_burst_size); 271 (void) memcpy(prev, buf, read_burst_size * BLOCK_SIZE); 276 buf = prev; 277 prev = tmp; 290 free(prev);
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppd/ |
H A D | demand.c | 308 struct packet *pkt, *prev, *nextpkt; local 310 prev = NULL; 319 if (prev == NULL) 322 prev->next = pkt; 323 prev = pkt; 326 pend_qtail = prev; 327 if (prev != NULL) 328 prev->next = NULL;
|
/illumos-gate/usr/src/cmd/fs.d/nfs/mountd/ |
H A D | hashset.c | 227 ENTRY *e, *prev; local 229 for (e = h->h_table[indx], prev = NULL; e; prev = e, e = e->e_next) { 232 if (prev) 233 prev->e_next = e->e_next;
|
/illumos-gate/usr/src/cmd/fs.d/nfs/nfslog/ |
H A D | buffer_list.c | 244 struct buffer_ent *p, *prev; local 246 for (p = prev = *be_listpp; p != NULL; p = p->be_next) { 251 prev->be_next = bep->be_next; 255 prev = p; 305 struct sharepnt_ent *p, *prev; local 307 for (p = prev = *se_listpp; p != NULL; p = p->se_next) { 312 prev->se_next = sep->se_next; 316 prev = p;
|
/illumos-gate/usr/src/cmd/isns/isnsd/ |
H A D | isns_msgq.h | 64 struct msg_text *prev; member in struct:msg_text
|
/illumos-gate/usr/src/cmd/krb5/kadmin/ktutil/ |
H A D | ktutil_funcs.c | 54 krb5_kt_list lp, prev; local 62 prev = lp; 64 free((char *)prev); 78 krb5_kt_list lp, prev; local 81 for (lp = *list, i = 1; lp; prev = lp, lp = lp->next, i++) { 86 prev->next = lp->next; 110 krb5_kt_list lp = NULL, prev = NULL; local 159 prev = lp; 237 if (prev) 238 prev 478 krb5_kt_list lp, lp1, prev, pruned = NULL; local [all...] |
/illumos-gate/usr/src/cmd/ldapcachemgr/ |
H A D | cachemgr.h | 71 struct waiting_list *prev; /* previous node in the */ member in struct:waiting_list
|
/illumos-gate/usr/src/cmd/tbl/ |
H A D | tu.c | 48 while (i>0 && vspand(prev(i),cl,1)) 51 if (i>0 && vspand(prev(i),cr,1)) 185 i=prev(li=i); 186 if (prev(li)== -1) li=0; 229 prev(int i) function
|
/illumos-gate/usr/src/cmd/truss/ |
H A D | htbl.c | 71 hentry_t *prev; local 80 prev = tmp; 83 free(prev->key); 84 prev->key = NULL; 85 free(prev->lib); 86 prev->lib = NULL; 88 free((char *)prev); 90 tmp->prev = NULL; 156 new->prev = NULL; 160 tmp->prev [all...] |
H A D | htbl.h | 40 struct hentry *prev; /* previous entry in hash chain */ member in struct:hentry
|
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | multilist.c | 297 * the list with its "prev" pointer. If the given object is already at the 308 void *prev = list_prev(&mls->mls_list, obj); local 314 if (prev == NULL) 318 list_insert_before(&mls->mls_list, prev, obj);
|
H A D | zfs_rlock.c | 271 zfs_range_add_reader(avl_tree_t *tree, rl_t *new, rl_t *prev, avl_index_t where) argument 278 * prev arrives either: 284 if (prev) { 285 if (prev->r_off + prev->r_len <= off) { 286 prev = NULL; 287 } else if (prev->r_off != off) { 292 prev = zfs_range_split(tree, prev, off); 293 prev 359 rl_t *prev, *next; local [all...] |