Searched refs:next (Results 151 - 175 of 1144) sorted by relevance

1234567891011>>

/osnet-11/usr/src/lib/libc/port/gen/
H A Dgetexecattr.c117 exec->next = NULL;
138 if ((exec->next = _dup_execstr(&nexec)) == NULL) {
139 _free_execstr(nexec.next);
283 } while (lookups && (lookups = lookups->next));
338 if ((pe->prev_exec->next = _dup_execstr(exec)) != NULL)
339 pe->prev_exec = pe->prev_exec->next;
429 new_exec->next = old_exec->next;
445 _free_execstr(exec->next);
532 prev->next
[all...]
H A Datexit.c112 p->next = arp->head;
132 arp->head = p->next;
204 atfork_t *next; local
212 next = atfp->forw;
235 udp->atforklist = atfork_q = next;
247 } while ((atfp = next) != atfork_q || start_again);
302 o->next = p->next;
304 arp->head = p->next;
311 p = p->next;
[all...]
H A Dgettxt.c66 struct db_list *next; member in struct:db_list
72 struct db_cache *next; member in struct:db_cache
136 dbl = dbl->next;
141 dbc = dbc->next;
157 dbc->next = db_cache;
195 dbl->next = dbc->info;
/osnet-11/usr/src/cmd/parted/
H A Dstrlist.c205 list->next = NULL;
214 str_list_destroy (list->next);
240 str_list_duplicate (list->next));
250 for (walk = a; walk && walk->next; walk = walk->next);
253 walk->next = b;
266 for (walk = list; walk->next; walk = walk->next);
267 walk->next = str_list_alloc ();
268 walk = walk->next;
[all...]
/osnet-11/usr/src/lib/librcm/
H A Dlibrcm_event.c164 struct door_result *next; member in struct:door_result
192 result->next = NULL;
204 while (tmp->next) {
205 tmp = tmp->next;
207 tmp->next = result;
224 tmp = tmp->next;
235 prev->next = tmp->next;
237 cook->results = tmp->next;
398 cookie->results = tmp->next;
[all...]
/osnet-11/usr/src/lib/libparted/common/libparted/fs/hfs/
H A Dcache.c101 HfsCPrivateCacheTable* next; local
105 next = list->next_cache;
107 list = next;
131 ext = ext->next);
165 ext->next = cache->linked_ref[idx];
186 ret = ret->next);
208 pext = pext->next);
223 ppext = &((*ppext)->next));
229 (*ppext) = pext->next;
233 pext->next
[all...]
/osnet-11/usr/src/lib/libdiskmgt/common/
H A Dinuse_mnt.c52 struct mntpnt_list *next; member in struct:mntpnt_list
113 listp = listp->next;
140 listp = listp->next;
152 listp = listp->next;
169 nextp = listp->next;
188 listp = listp->next;
250 prevp->next = currp;
253 currp->next = NULL;
304 prevp->next = currp;
307 currp->next
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/efiemu/
H A Dmain.c58 d = cur->next;
68 d2 = curhook->next;
93 cur = efiemu_config_tables->next;
101 for (prev = efiemu_config_tables, cur = prev->next; cur;)
106 prev->next = cur->next;
108 cur = prev->next;
113 cur = cur->next;
132 nhook->next = efiemu_prepare_hooks;
164 tbl->next
[all...]
/osnet-11/usr/src/lib/libast/common/comp/
H A Dwaitpid.c91 struct zombie* next;
119 if (pp) pp->next = zp->next;
120 else zombies = zp->next;
191 zp->next = zombies;
/osnet-11/usr/src/lib/udapl/udapl_tavor/common/
H A Ddapl_provider.c196 g_dapl_provider_list.head->next = g_dapl_provider_list.tail;
224 g_dapl_provider_list.head = cur_node->next;
276 cur_node->next = next_node;
279 prev_node->next = cur_node;
310 for (cur_node = g_dapl_provider_list.head->next;
312 cur_node = cur_node->next) {
337 for (cur_node = g_dapl_provider_list.head->next;
339 cur_node = cur_node->next) {
342 next_node = cur_node->next;
344 prev_node->next
[all...]
/osnet-11/usr/src/lib/libldap4/common/
H A Dcache.c146 LDAPMessage *m, *next; local
155 for ( m = ld->ld_cache->lc_requests; m != NULLMSG; m = next ) {
156 next = m->lm_next;
164 m != NULLMSG; m = next ) {
165 next = m->lm_next;
216 LDAPMessage *m, *prev, *next; local
228 for ( m = ld->ld_cache->lc_requests; m != NULLMSG; m = next ) {
229 next = m->lm_next;
233 ld->ld_cache->lc_requests = next;
235 prev->lm_next = next;
425 LDAPMessage *m, *new, *prev, *next; local
673 LDAPMessage *m, *prev, *next; local
[all...]
/osnet-11/usr/src/lib/libldap5/sources/ldap/util/
H A Dline64.c249 * str_getline - return the next "line" (minus newline) of input from a
266 str_getline( char **next )
272 if ( *next == NULL || **next == '\n' || **next == '\0' ) {
276 while ( **next == '#' ) { /* skip comment lines */
277 if (( *next = strchr( *next, '\n' )) == NULL ) {
280 (*next)++;
283 l = *next;
[all...]
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/profile/
H A Dprof_file.c91 for (d = g_shared_trees; d; d = d->next) { \
198 d->next = NULL;
258 for (data = g_shared_trees; data; data = data->next) {
305 data->next = g_shared_trees;
581 g_shared_trees = data->next;
583 prf_data_t prev, next; local
585 next = prev->next;
586 while (next) {
587 if (next
[all...]
/osnet-11/usr/src/lib/libadm/common/
H A Dckitem.c43 static struct _choice_ *next(struct _choice_ *);
263 chp = chp->next;
282 chp = chp->next;
328 chp = chp->next;
411 base = base->next;
414 last->next = chp;
428 base = base->next;
431 chp->next = last->next;
432 last->next
544 next(struct _choice_ *chp) function
[all...]
/osnet-11/usr/src/lib/libnisdb/
H A Ddb_index_entry_c.x39 % * via the 'next' pointer and form the hash bucket
69 db_index_entry* next;
86 % db_index_entry* next;
114 % index entries. These may be changed after the next call to 'lookup'
122 %/* Return the next entry in the bucket starting with this entry
126 %/* Return the next entry in the bucket. */
127 % db_index_entry* getnextentry() {return next;}
129 %/* Return the next entry in the 'next_result' chain. */
135 %/* Assign the given pointer as the next result after this entry. */
/osnet-11/usr/src/lib/libnsl/rpc/
H A Drpcb_prot.c96 rpcblist_ptr next; local
107 * the case of freeing we must remember the next object
111 next = (*rp)->rpcb_next;
116 next_copy = next;
121 * but next itself survives.
165 rpcb_entry_list_ptr next; local
176 * the case of freeing we must remember the next object
180 next = (*rp)->rpcb_entry_next;
186 next_copy = next;
191 * but next itsel
[all...]
/osnet-11/usr/src/lib/libpicltree/
H A Dptree_impl.h91 struct hash_elem *next; member in struct:hash_elem
108 struct prop_list *next; member in struct:prop_list
189 struct eventq *next; member in struct:eventq
204 struct eh_list *next; member in struct:eh_list
214 struct picld_plugin_reg_list *next; member in struct:picld_plugin_reg_list
221 struct picld_plinfo *next; member in struct:picld_plinfo
/osnet-11/usr/src/lib/librstp/common/
H A Dstpmgmt.c93 for (stpm = STP_stpm_get_the_list (); stpm; stpm = stpm->next) {
136 for (stpm = STP_stpm_get_the_list (); stpm; stpm = stpm->next) {
153 for (stpm = STP_stpm_get_the_list (); stpm; stpm = stpm->next) {
/osnet-11/usr/src/lib/libldap4/util/
H A Dline64.c232 * str_getline - return the next "line" (minus newline) of input from a
246 str_getline( char **next )
251 if ( *next == NULL || **next == '\n' || **next == '\0' ) {
255 l = *next;
256 while ( (*next = strchr( *next, '\n' )) != NULL ) {
257 c = *(*next + 1);
259 **next
[all...]
/osnet-11/usr/src/lib/efcode/engine/
H A Dinterp.c35 do_run(fcode_env_t *env, int next) argument
43 if (next) {
71 next = 1;
/osnet-11/usr/src/lib/libadutils/common/
H A Dadutils_impl.h87 struct adutils_entry *next; member in struct:adutils_entry
98 struct adutils_host *next; member in struct:adutils_host
138 struct adutils_query_state *next; member in struct:adutils_query_state
/osnet-11/usr/src/lib/libast/common/vmalloc/
H A Dvmprivate.c177 for(; sp; lastsp = sp, sp = sp->next)
180 seg->next = sp;
182 lastsp->next = seg;
256 { vd->seg = seg->next;
260 { for(last = vd->seg; last->next != seg; last = last->next)
262 last->next = seg->next;
271 { seg->next = last->next;
[all...]
/osnet-11/usr/src/lib/libprtdiag/inc/
H A Ddisplay_sun4u.h66 struct io_card *next; member in struct:io_card
/osnet-11/usr/src/lib/libresolv2/common/isc/
H A Dev_files.c126 id->next = ctx->files;
178 del->prev->next = del->next;
180 ctx->files = del->next;
181 if (del->next != NULL)
182 del->next->prev = del->prev;
222 cur = cur->next)
252 for (cur = ctx->files; cur; cur = cur->next)
257 /* If this was the fdNext, cycle that to the next entry. */
259 ctx->fdNext = del->next;
[all...]
H A Dlogging_p.h46 struct log_channel_list *next; member in struct:log_channel_list

Completed in 43 milliseconds

1234567891011>>