next               21 examples/libsmbclient/testbrowse2.c     smbitem	*next;
next               34 examples/libsmbclient/testbrowse2.c 	list = list->next;
next               45 examples/libsmbclient/testbrowse2.c 	list = list->next;
next               62 examples/libsmbclient/testbrowse2.c 	list = list->next;
next               66 examples/libsmbclient/testbrowse2.c     for(i = 0; i < count - 1; i++) array[i]->next = array[i + 1];
next               67 examples/libsmbclient/testbrowse2.c     array[count - 1]->next = NULL;
next              127 examples/libsmbclient/testbrowse2.c 	item->next = list;
next              190 examples/libsmbclient/testbrowse2.c 	list = list->next;
next              478 examples/libsmbclient/tree.c     i = i->next;
next              198 lib/async_req/async_req.c 	struct async_queue_entry *prev, *next;
next               46 lib/popt/popt.c 	con->os->next,
next               47 lib/popt/popt.c 	(con->os->argv && con->os->argv[con->os->next]
next               48 lib/popt/popt.c 		? con->os->argv[con->os->next] : ""));
next              170 lib/popt/popt.c 	con->os->next = 1;			/* skip argv[0] */
next              226 lib/popt/popt.c     con->os->next = 1;			/* skip argv[0] */
next              352 lib/popt/popt.c     con->os->next = 0;
next              541 lib/popt/popt.c 	while (os->next == os->argc && os > con->optionStack) os--;
next              542 lib/popt/popt.c 	if (os->next == os->argc && os == con->optionStack) break;
next              544 lib/popt/popt.c 	for (i = os->next; i < os->argc; i++) {
next              706 lib/popt/popt.c 	while (!con->os->nextCharArg && con->os->next == con->os->argc
next              710 lib/popt/popt.c 	if (!con->os->nextCharArg && con->os->next == con->os->argc) {
next              724 lib/popt/popt.c 	    if (con->os->argb && PBM_ISSET(con->os->next, con->os->argb)) {
next              725 lib/popt/popt.c 		con->os->next++;
next              729 lib/popt/popt.c 	    thisopt = con->os->next;
next              731 lib/popt/popt.c 	    origOptString = con->os->argv[con->os->next++];
next              855 lib/popt/popt.c 		while (con->os->next == con->os->argc &&
next              859 lib/popt/popt.c 		if (con->os->next == con->os->argc) {
next              874 lib/popt/popt.c 			poptStripArg(con, con->os->next);
next              879 lib/popt/popt.c 			longArg = con->os->argv[con->os->next++];
next             1165 lib/popt/popt.c     return (os && os->argv ? os->argv[os->next - 1] : NULL);
next             1209 lib/popt/popt.c     con->os->next = 0;
next               51 lib/popt/poptint.h     int next;
next              320 lib/replace/getaddrinfo.c 	struct addrinfo *next = NULL;
next              322 lib/replace/getaddrinfo.c 	for (;res; res = next) {
next              323 lib/replace/getaddrinfo.c 		next = res->ai_next;
next              324 lib/replace/getifaddrs.c 	next:
next              219 lib/replace/snprintf.c 	struct pr_chunk *next;
next              276 lib/replace/snprintf.c 				cnk->next = new_chunk();
next              277 lib/replace/snprintf.c 				cnk = cnk->next;
next              734 lib/replace/snprintf.c 		cnk = cnk->next;
next              748 lib/replace/snprintf.c 		cnk = chunks->next;
next             1130 lib/replace/snprintf.c 	new_c->next = NULL;
next               78 lib/socket_wrapper/socket_wrapper.c 		(item)->next	= NULL; \
next               82 lib/socket_wrapper/socket_wrapper.c 		(item)->next	= (list); \
next               90 lib/socket_wrapper/socket_wrapper.c 		(list)		= (item)->next; \
next               96 lib/socket_wrapper/socket_wrapper.c 			(item)->prev->next	= (item)->next; \
next               98 lib/socket_wrapper/socket_wrapper.c 		if ((item)->next) { \
next               99 lib/socket_wrapper/socket_wrapper.c 			(item)->next->prev	= (item)->prev; \
next              103 lib/socket_wrapper/socket_wrapper.c 	(item)->next	= NULL; \
next              236 lib/socket_wrapper/socket_wrapper.c 	struct socket_info *prev, *next;
next              573 lib/socket_wrapper/socket_wrapper.c 	for (i = sockets; i; i = i->next) {
next              108 lib/talloc/talloc.c 	struct talloc_reference_handle *next, *prev;
next              115 lib/talloc/talloc.c 	struct talloc_chunk *next, *prev;
next              187 lib/talloc/talloc.c 		(p)->next = (p)->prev = NULL; \
next              190 lib/talloc/talloc.c 		(p)->next = (list); \
next              200 lib/talloc/talloc.c 		(list) = (p)->next; \
next              203 lib/talloc/talloc.c 		if ((p)->prev) (p)->prev->next = (p)->next; \
next              204 lib/talloc/talloc.c 		if ((p)->next) (p)->next->prev = (p)->prev; \
next              206 lib/talloc/talloc.c 	if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
next              355 lib/talloc/talloc.c 			tc->next = parent->child;
next              356 lib/talloc/talloc.c 			tc->next->prev = tc;
next              358 lib/talloc/talloc.c 			tc->next = NULL;
next              364 lib/talloc/talloc.c 		tc->next = tc->prev = tc->parent = NULL;
next              544 lib/talloc/talloc.c 		if (tc->prev) tc->prev->next = tc->next;
next              545 lib/talloc/talloc.c 		if (tc->next) tc->next->prev = tc->prev;
next              624 lib/talloc/talloc.c 			if (tc->prev) tc->prev->next = tc->next;
next              625 lib/talloc/talloc.c 			if (tc->next) tc->next->prev = tc->prev;
next              628 lib/talloc/talloc.c 		tc->parent = tc->next = tc->prev = NULL;
next              644 lib/talloc/talloc.c 		if (tc->prev) tc->prev->next = tc->next;
next              645 lib/talloc/talloc.c 		if (tc->next) tc->next->prev = tc->prev;
next              671 lib/talloc/talloc.c 	for (h=tc->refs;h;h=h->next) {
next             1064 lib/talloc/talloc.c 		tc->prev->next = tc;
next             1066 lib/talloc/talloc.c 	if (tc->next) {
next             1067 lib/talloc/talloc.c 		tc->next->prev = tc;
next             1112 lib/talloc/talloc.c 	for (c=tc->child;c;c=c->next) {
next             1136 lib/talloc/talloc.c 	for (c=tc->child;c;c=c->next) {
next             1154 lib/talloc/talloc.c 	for (h=tc->refs;h;h=h->next) {
next             1190 lib/talloc/talloc.c 	for (c=tc->child;c;c=c->next) {
next               44 lib/tdb/common/dump.c 	       hash, offset, rec.next, rec.rec_len, rec.key_len, rec.data_len,
next               51 lib/tdb/common/dump.c 		return rec.next;
next               58 lib/tdb/common/dump.c 	return rec.next;
next              130 lib/tdb/common/dump.c 		rec_ptr = rec.next;
next               59 lib/tdb/common/freelist.c 	if (tdb->methods->tdb_oob(tdb, rec->next+sizeof(*rec), 0) != 0)
next               67 lib/tdb/common/freelist.c static int remove_from_freelist(struct tdb_context *tdb, tdb_off_t off, tdb_off_t next)
next               76 lib/tdb/common/freelist.c 			return tdb_ofs_write(tdb, last_ptr, &next);
next              126 lib/tdb/common/freelist.c 			if (remove_from_freelist(tdb, right, r.next) == -1) {
next              194 lib/tdb/common/freelist.c 	if (tdb_ofs_read(tdb, FREELIST_TOP, &rec->next) == -1 ||
next              230 lib/tdb/common/freelist.c 		if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1) {
next              323 lib/tdb/common/freelist.c 		rec_ptr = rec->next;
next               96 lib/tdb/common/freelistcheck.c 		rec_ptr = rec.next;
next              449 lib/tdb/common/io.c 	return tdb->methods->tdb_oob(tdb, rec->next+sizeof(*rec), 0);
next              522 lib/tdb/common/lock.c 	for (i = &tdb->travlocks; i; i = i->next)
next              549 lib/tdb/common/lock.c 	for (i = &tdb->travlocks; i; i = i->next)
next              113 lib/tdb/common/open.c 	for (i = tdbs; i; i = i->next) {
next              322 lib/tdb/common/open.c 	tdb->next = tdbs;
next              383 lib/tdb/common/open.c 	for (i = &tdbs; *i; i = &(*i)->next) {
next              385 lib/tdb/common/open.c 			*i = tdb->next;
next              471 lib/tdb/common/open.c 	for (tdb=tdbs; tdb; tdb = tdb->next) {
next              100 lib/tdb/common/tdb.c 		if (rec_ptr == r->next) {
next              104 lib/tdb/common/tdb.c 		rec_ptr = r->next;
next              263 lib/tdb/common/tdb.c 	for (last_ptr = 0; i != rec_ptr; last_ptr = i, i = lastrec.next)
next              270 lib/tdb/common/tdb.c 	if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1)
next              296 lib/tdb/common/tdb.c 		rec_ptr = rec.next;
next              319 lib/tdb/common/tdb.c 		tdb_off_t next;
next              325 lib/tdb/common/tdb.c 		next = rec.next;
next              331 lib/tdb/common/tdb.c 		rec_ptr = next;
next              422 lib/tdb/common/tdb.c 		rec_ptr = r->next;
next              541 lib/tdb/common/tdb.c 	if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec.next) == -1)
next               90 lib/tdb/common/tdb_private.h 	tdb_off_t next; /* offset of the next record in the list */
next              127 lib/tdb/common/tdb_private.h 	struct tdb_traverse_lock *next;
next              158 lib/tdb/common/tdb_private.h 	struct tdb_context *next; /* all tdbs to avoid multiple opens */
next              427 lib/tdb/common/transaction.c 	if (tdb->travlocks.next != NULL) {
next               91 lib/tdb/common/traverse.c 			tlock->off = rec->next;
next              101 lib/tdb/common/traverse.c 			if (tlock->off == rec->next) {
next              115 lib/tdb/common/traverse.c 			tlock->off = rec->next;
next              149 lib/tdb/common/traverse.c 	tl->next = tdb->travlocks.next;
next              152 lib/tdb/common/traverse.c 	tdb->travlocks.next = tl;
next              191 lib/tdb/common/traverse.c 	tdb->travlocks.next = tl->next;
next              109 lib/tdb/tools/tdbtorture.c 		goto next;
next              116 lib/tdb/tools/tdbtorture.c 		goto next;
next              123 lib/tdb/tools/tdbtorture.c 		goto next;
next              130 lib/tdb/tools/tdbtorture.c 		goto next;
next              137 lib/tdb/tools/tdbtorture.c 		goto next;
next              146 lib/tdb/tools/tdbtorture.c 		goto next;
next              155 lib/tdb/tools/tdbtorture.c 		goto next;
next              168 lib/tdb/tools/tdbtorture.c 		goto next;
next              175 lib/tdb/tools/tdbtorture.c 		goto next;
next              182 lib/tdb/tools/tdbtorture.c 		goto next;
next              189 lib/tdb/tools/tdbtorture.c next:
next               68 lib/tevent/tevent.c 	struct tevent_ops_list *next, *prev;
next               84 lib/tevent/tevent.c 	for (e = tevent_backends; e != NULL; e = e->next) {
next              133 lib/tevent/tevent.c 	for (e=tevent_backends;e;e=e->next) {
next              157 lib/tevent/tevent.c 		fn = fd->next;
next              163 lib/tevent/tevent.c 		tn = te->next;
next              169 lib/tevent/tevent.c 		in = ie->next;
next              176 lib/tevent/tevent.c 		sn = se->next;
next              243 lib/tevent/tevent.c 	for (e=tevent_backends;e;e=e->next) {
next              382 lib/tevent/tevent.c 	im->next		= NULL;
next              113 lib/tevent/tevent_epoll.c 	for (fde=epoll_ev->ev->fd_events;fde;fde=fde->next) {
next              153 lib/tevent/tevent_internal.h 	struct tevent_fd *prev, *next;
next              170 lib/tevent/tevent_internal.h 	struct tevent_timer *prev, *next;
next              184 lib/tevent/tevent_internal.h 	struct tevent_immediate *prev, *next;
next              199 lib/tevent/tevent_internal.h 	struct tevent_signal *prev, *next;
next               31 lib/tevent/tevent_queue.c 	struct tevent_queue_entry *prev, *next;
next               66 lib/tevent/tevent_select.c 	for (fde = select_ev->ev->fd_events; fde; fde = fde->next) {
next              145 lib/tevent/tevent_select.c 	for (fde = select_ev->ev->fd_events; fde; fde = fde->next) {
next              189 lib/tevent/tevent_select.c 		for (fde = select_ev->ev->fd_events; fde; fde = fde->next) {
next               52 lib/tevent/tevent_signal.c 	struct tevent_common_signal_list *prev, *next;
next               94 lib/tevent/tevent_signal.c 	for (sl = sig_state->sig_handlers[signum]; sl; sl = sl->next) {
next              324 lib/tevent/tevent_signal.c 		struct tevent_common_signal_list *sl, *next;
next              336 lib/tevent/tevent_signal.c 		for (sl=sig_state->sig_handlers[i];sl;sl=next) {
next              338 lib/tevent/tevent_signal.c 			next = sl->next;
next              130 lib/tevent/tevent_standard.c 	for (fde=std_ev->ev->fd_events;fde;fde=fde->next) {
next              351 lib/tevent/tevent_standard.c 	for (fde = std_ev->ev->fd_events; fde; fde = fde->next) {
next              459 lib/tevent/tevent_standard.c 	for (fde = std_ev->ev->fd_events; fde; fde = fde->next) {
next              503 lib/tevent/tevent_standard.c 		for (fde = std_ev->ev->fd_events; fde; fde = fde->next) {
next              178 lib/tevent/tevent_timed.c 	for (cur_te = ev->timer_events; cur_te; cur_te = cur_te->next) {
next               33 lib/tevent/tevent_util.h 		(p)->next = (p)->prev = NULL; \
next               36 lib/tevent/tevent_util.h 		(p)->next = (list); \
next               46 lib/tevent/tevent_util.h 		(list) = (p)->next; \
next               49 lib/tevent/tevent_util.h 		if ((p)->prev) (p)->prev->next = (p)->next; \
next               50 lib/tevent/tevent_util.h 		if ((p)->next) (p)->next->prev = (p)->prev; \
next               52 lib/tevent/tevent_util.h 	if ((p) != (list)) (p)->next = (p)->prev = NULL; \
next               67 lib/tevent/tevent_util.h 			(p)->next = (p)->prev = NULL; \
next               70 lib/tevent/tevent_util.h 			for (tmp = (list); tmp->next; tmp = tmp->next) ; \
next               71 lib/tevent/tevent_util.h 			tmp->next = (p); \
next               72 lib/tevent/tevent_util.h 			(p)->next = NULL; \
next               85 lib/tevent/tevent_util.h 		p->next = el->next; \
next               86 lib/tevent/tevent_util.h 		el->next = p; \
next               87 lib/tevent/tevent_util.h 		if (p->next) p->next->prev = p; \
next              106 lib/tevent/tevent_util.h 			for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
next              107 lib/tevent/tevent_util.h 			tmp->next = (list2); \
next              269 lib/torture/torture.c 	for (tcase = suite->testcases; tcase; tcase = tcase->next) {
next              273 lib/torture/torture.c 	for (tsuite = suite->children; tsuite; tsuite = tsuite->next) {
next              399 lib/torture/torture.c 	for (test = tcase->tests; test; test = test->next) {
next              558 lib/torture/torture.c 	for (child = parent->children; child; child = child->next) 
next              129 lib/torture/torture.h 	struct torture_test *prev, *next;
next              150 lib/torture/torture.h 	struct torture_tcase *prev, *next;
next              161 lib/torture/torture.h 	struct torture_suite *prev, *next;
next               78 lib/util/asn1.c 	nesting->next = data->nesting;
next              135 lib/util/asn1.c 	data->nesting = nesting->next;
next              462 lib/util/asn1.c 	nesting->next = data->nesting;
next              488 lib/util/asn1.c 	data->nesting = nesting->next;
next               26 lib/util/asn1.h 	struct nesting *next;
next               53 lib/util/charset/charset.h 	struct charset_functions *prev, *next;
next               90 lib/util/charset/iconv.c 	for (c = charsets; c != NULL; c = c->next) {
next               97 lib/util/charset/iconv.c 	funcs->next = funcs->prev = NULL;
next              199 lib/util/charset/iconv.c 		for (from=charsets; from; from=from->next) {
next              205 lib/util/charset/iconv.c 		for (to=charsets; to; to=to->next) {
next               40 lib/util/data_blob.h 	struct data_blob_list_item *prev,*next;
next               32 lib/util/dlinklist.h 		(p)->next = (p)->prev = NULL; \
next               35 lib/util/dlinklist.h 		(p)->next = (list); \
next               45 lib/util/dlinklist.h 		(list) = (p)->next; \
next               48 lib/util/dlinklist.h 		if ((p)->prev) (p)->prev->next = (p)->next; \
next               49 lib/util/dlinklist.h 		if ((p)->next) (p)->next->prev = (p)->prev; \
next               51 lib/util/dlinklist.h 	if ((p) != (list)) (p)->next = (p)->prev = NULL; \
next               66 lib/util/dlinklist.h 			(p)->next = (p)->prev = NULL; \
next               69 lib/util/dlinklist.h 			for (tmp = (list); tmp->next; tmp = tmp->next) ; \
next               70 lib/util/dlinklist.h 			tmp->next = (p); \
next               71 lib/util/dlinklist.h 			(p)->next = NULL; \
next               84 lib/util/dlinklist.h 		p->next = el->next; \
next               85 lib/util/dlinklist.h 		el->next = p; \
next               86 lib/util/dlinklist.h 		if (p->next) p->next->prev = p; \
next              105 lib/util/dlinklist.h 			for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
next              106 lib/util/dlinklist.h 			tmp->next = (list2); \
next               82 lib/util/util_getent.c 			gent->next = malloc_p(struct sys_grent);
next               83 lib/util/util_getent.c 			if (gent->next == NULL)
next               85 lib/util/util_getent.c 			gent = gent->next;
next              120 lib/util/util_getent.c 		glist = glist->next;
next              172 lib/util/util_getent.c 			pent->next = malloc_p(struct sys_pwent);
next              173 lib/util/util_getent.c 			if (pent->next == NULL)
next              175 lib/util/util_getent.c 			pent = pent->next;
next              207 lib/util/util_getent.c 		plist = plist->next;
next               72 lib/util/xfile.c 	f->next = NULL;
next               94 lib/util/xfile.c 	f->next = f->buf;
next              307 lib/util/xfile.c 	f->next = f->buf;
next              324 lib/util/xfile.c 	ret = *(uint8_t *)(f->next);
next              325 lib/util/xfile.c 	f->next++;
next              348 lib/util/xfile.c 		memcpy((char *)p+total, f->next, thistime);
next              350 lib/util/xfile.c 		f->next += thistime;
next               29 lib/util/xfile.h 	char *next;
next               50 lib/zlib/contrib/blast/blast.c     unsigned next;              /* index of next write location in out[] */
next              132 lib/zlib/contrib/blast/blast.c     short *next;        /* next number of codes */
next              138 lib/zlib/contrib/blast/blast.c     next = h->count + 1;
next              143 lib/zlib/contrib/blast/blast.c             count = *next++;
next              336 lib/zlib/contrib/blast/blast.c             if (s->first && dist > s->next)
next              341 lib/zlib/contrib/blast/blast.c                 to = s->out + s->next;
next              344 lib/zlib/contrib/blast/blast.c                 if (s->next < dist) {
next              348 lib/zlib/contrib/blast/blast.c                 copy -= s->next;
next              351 lib/zlib/contrib/blast/blast.c                 s->next += copy;
next              355 lib/zlib/contrib/blast/blast.c                 if (s->next == MAXWIN) {
next              356 lib/zlib/contrib/blast/blast.c                     if (s->outfun(s->outhow, s->out, s->next)) return 1;
next              357 lib/zlib/contrib/blast/blast.c                     s->next = 0;
next              365 lib/zlib/contrib/blast/blast.c             s->out[s->next++] = symbol;
next              366 lib/zlib/contrib/blast/blast.c             if (s->next == MAXWIN) {
next              367 lib/zlib/contrib/blast/blast.c                 if (s->outfun(s->outhow, s->out, s->next)) return 1;
next              368 lib/zlib/contrib/blast/blast.c                 s->next = 0;
next              392 lib/zlib/contrib/blast/blast.c     s.next = 0;
next              402 lib/zlib/contrib/blast/blast.c     if (err != 1 && s.next && s.outfun(s.outhow, s.out, s.next) && err == 0)
next               57 lib/zlib/contrib/infback9/infback9.c     code *next, *lenfix, *distfix;
next               67 lib/zlib/contrib/infback9/infback9.c     next = fixed;
next               68 lib/zlib/contrib/infback9/infback9.c     lenfix = next;
next               70 lib/zlib/contrib/infback9/infback9.c     inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
next               75 lib/zlib/contrib/infback9/infback9.c     distfix = next;
next               77 lib/zlib/contrib/infback9/infback9.c     inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
next              128 lib/zlib/contrib/infback9/infback9.c             have = in(in_desc, &next); \
next              130 lib/zlib/contrib/infback9/infback9.c                 next = Z_NULL; \
next              143 lib/zlib/contrib/infback9/infback9.c         hold += (unsigned long)(*next++) << bits; \
next              225 lib/zlib/contrib/infback9/infback9.c     unsigned char FAR *next;    /* next input */
next              265 lib/zlib/contrib/infback9/infback9.c     next = strm->next_in;
next              266 lib/zlib/contrib/infback9/infback9.c     have = next != Z_NULL ? strm->avail_in : 0;
next              335 lib/zlib/contrib/infback9/infback9.c                 zmemcpy(put, next, copy);
next              337 lib/zlib/contrib/infback9/infback9.c                 next += copy;
next              371 lib/zlib/contrib/infback9/infback9.c             state->next = state->codes;
next              372 lib/zlib/contrib/infback9/infback9.c             lencode = (code const FAR *)(state->next);
next              374 lib/zlib/contrib/infback9/infback9.c             ret = inflate_table9(CODES, state->lens, 19, &(state->next),
next              437 lib/zlib/contrib/infback9/infback9.c             state->next = state->codes;
next              438 lib/zlib/contrib/infback9/infback9.c             lencode = (code const FAR *)(state->next);
next              441 lib/zlib/contrib/infback9/infback9.c                             &(state->next), &(lenbits), state->work);
next              447 lib/zlib/contrib/infback9/infback9.c             distcode = (code const FAR *)(state->next);
next              450 lib/zlib/contrib/infback9/infback9.c                             state->ndist, &(state->next), &(distbits),
next              594 lib/zlib/contrib/infback9/infback9.c     strm->next_in = next;
next               43 lib/zlib/contrib/infback9/inflate9.h     code FAR *next;             /* next available space in codes[] */
next               54 lib/zlib/contrib/infback9/inftree9.c     code FAR *next;             /* next available space in table */
next              198 lib/zlib/contrib/infback9/inftree9.c     next = *table;              /* current table to fill in */
next              231 lib/zlib/contrib/infback9/inftree9.c             next[(huff >> drop) + fill] = this;
next              259 lib/zlib/contrib/infback9/inftree9.c             next += 1U << curr;
next              280 lib/zlib/contrib/infback9/inftree9.c             (*table)[low].val = (unsigned short)(next - *table);
next              299 lib/zlib/contrib/infback9/inftree9.c             next = *table;
next              305 lib/zlib/contrib/infback9/inftree9.c         next[huff >> drop] = this;
next              254 lib/zlib/contrib/puff/puff.c     short *next;        /* next number of codes */
next              260 lib/zlib/contrib/puff/puff.c     next = h->count + 1;
next              265 lib/zlib/contrib/puff/puff.c             count = *next++;
next               97 lib/zlib/contrib/untgz/untgz.c   struct attr_item  *next;
next              263 lib/zlib/contrib/untgz/untgz.c   item->next  = *list;
next              279 lib/zlib/contrib/untgz/untgz.c       item = item->next;
next               89 lib/zlib/examples/gun.c     unsigned char *next;
next               92 lib/zlib/examples/gun.c     next = me->inbuf;
next               93 lib/zlib/examples/gun.c     *buf = next;
next               99 lib/zlib/examples/gun.c         ret = (int)read(me->infile, next, ret);
next              104 lib/zlib/examples/gun.c         next += ret;
next              151 lib/zlib/examples/gun.c #define NEXT() (have ? 0 : (have = in(indp, &next)), \
next              152 lib/zlib/examples/gun.c                 last = have ? (have--, (int)(*next++)) : -1)
next              183 lib/zlib/examples/gun.c         next += chunk; \
next              196 lib/zlib/examples/gun.c local int lunpipe(unsigned have, unsigned char *next, struct ind *indp,
next              378 lib/zlib/examples/gun.c     unsigned char *next;
next              406 lib/zlib/examples/gun.c             ret = lunpipe(have, next, indp, outfile, strm);
next              443 lib/zlib/examples/gun.c             next += len;
next              464 lib/zlib/examples/gun.c         strm->next_in = next;
next              468 lib/zlib/examples/gun.c         next = strm->next_in;
next              173 lib/zlib/examples/gzappend.c     unsigned char *next;        /* next byte in buffer */
next              185 lib/zlib/examples/gzappend.c     in->next = in->buf;
next              197 lib/zlib/examples/gzappend.c                    in->left--, *(in->next)++)
next              217 lib/zlib/examples/gzappend.c     in->next += n;
next              292 lib/zlib/examples/gzappend.c     strm->next_in = gz.next;
next              300 lib/zlib/examples/gzappend.c             strm->next_in = gz.next;
next              335 lib/zlib/examples/gzappend.c     gz.next = strm->next_in;
next               81 lib/zlib/examples/gzjoin.c     unsigned char *next;    /* next byte to read */
next              113 lib/zlib/examples/gzjoin.c     in->next = in->buf;
next              128 lib/zlib/examples/gzjoin.c     in->next = in->buf;
next              140 lib/zlib/examples/gzjoin.c                   in->left ? (in->left--, *(in->next)++) : \
next              165 lib/zlib/examples/gzjoin.c         in->next += skip;
next              197 lib/zlib/examples/gzjoin.c     in->next += skip;
next              260 lib/zlib/examples/gzjoin.c     strm->next_in = in->next;
next              374 lib/zlib/examples/gzjoin.c     in->next = strm.next_in;
next              378 lib/zlib/examples/gzjoin.c     fwrite(start, 1, in->next - start - 1, out);
next              379 lib/zlib/examples/gzjoin.c     last = in->next[-1];
next               90 lib/zlib/examples/zran.c     struct point *next;
next              108 lib/zlib/examples/zran.c         next = realloc(index->list, sizeof(struct point) * index->size);
next              109 lib/zlib/examples/zran.c         if (next == NULL) {
next              113 lib/zlib/examples/zran.c         index->list = next;
next              117 lib/zlib/examples/zran.c     next = index->list + index->have;
next              118 lib/zlib/examples/zran.c     next->bits = bits;
next              119 lib/zlib/examples/zran.c     next->in = in;
next              120 lib/zlib/examples/zran.c     next->out = out;
next              122 lib/zlib/examples/zran.c         memcpy(next->window, window + WINSIZE - left, left);
next              124 lib/zlib/examples/zran.c         memcpy(next->window + left, window, WINSIZE - left);
next               84 lib/zlib/infback.c         static code *next;
next               92 lib/zlib/infback.c         next = fixed;
next               93 lib/zlib/infback.c         lenfix = next;
next               95 lib/zlib/infback.c         inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
next              100 lib/zlib/infback.c         distfix = next;
next              102 lib/zlib/infback.c         inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
next              123 lib/zlib/infback.c         next = strm->next_in; \
next              134 lib/zlib/infback.c         strm->next_in = next; \
next              152 lib/zlib/infback.c             have = in(in_desc, &next); \
next              154 lib/zlib/infback.c                 next = Z_NULL; \
next              167 lib/zlib/infback.c         hold += (unsigned long)(*next++) << bits; \
next              249 lib/zlib/infback.c     unsigned const char FAR *next; /* next input */
next              273 lib/zlib/infback.c     next = strm->next_in;
next              274 lib/zlib/infback.c     have = next != Z_NULL ? strm->avail_in : 0;
next              338 lib/zlib/infback.c                 zmemcpy(put, next, copy);
next              340 lib/zlib/infback.c                 next += copy;
next              376 lib/zlib/infback.c             state->next = state->codes;
next              377 lib/zlib/infback.c             state->lencode = (code const FAR *)(state->next);
next              379 lib/zlib/infback.c             ret = inflate_table(CODES, state->lens, 19, &(state->next),
next              442 lib/zlib/infback.c             state->next = state->codes;
next              443 lib/zlib/infback.c             state->lencode = (code const FAR *)(state->next);
next              445 lib/zlib/infback.c             ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
next              452 lib/zlib/infback.c             state->distcode = (code const FAR *)(state->next);
next              455 lib/zlib/infback.c                             &(state->next), &(state->distbits), state->work);
next              609 lib/zlib/infback.c     strm->next_in = next;
next              123 lib/zlib/inflate.c     state->lencode = state->distcode = state->next = state->codes;
next              216 lib/zlib/inflate.c         static code *next;
next              224 lib/zlib/inflate.c         next = fixed;
next              225 lib/zlib/inflate.c         lenfix = next;
next              227 lib/zlib/inflate.c         inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
next              232 lib/zlib/inflate.c         distfix = next;
next              234 lib/zlib/inflate.c         inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
next              407 lib/zlib/inflate.c         next = strm->next_in; \
next              418 lib/zlib/inflate.c         strm->next_in = next; \
next              437 lib/zlib/inflate.c         hold += (unsigned long)(*next++) << bits; \
next              559 lib/zlib/inflate.c     unsigned const char FAR *next;    /* next input */
next              688 lib/zlib/inflate.c                         zmemcpy(state->head->extra + len, next,
next              693 lib/zlib/inflate.c                         state->check = crc32(state->check, next, copy);
next              695 lib/zlib/inflate.c                     next += copy;
next              707 lib/zlib/inflate.c                     len = (unsigned)(next[copy++]);
next              714 lib/zlib/inflate.c                     state->check = crc32(state->check, next, copy);
next              716 lib/zlib/inflate.c                 next += copy;
next              728 lib/zlib/inflate.c                     len = (unsigned)(next[copy++]);
next              735 lib/zlib/inflate.c                     state->check = crc32(state->check, next, copy);
next              737 lib/zlib/inflate.c                 next += copy;
next              826 lib/zlib/inflate.c                 zmemcpy(put, next, copy);
next              828 lib/zlib/inflate.c                 next += copy;
next              863 lib/zlib/inflate.c             state->next = state->codes;
next              864 lib/zlib/inflate.c             state->lencode = (code const FAR *)(state->next);
next              866 lib/zlib/inflate.c             ret = inflate_table(CODES, state->lens, 19, &(state->next),
next              929 lib/zlib/inflate.c             state->next = state->codes;
next              930 lib/zlib/inflate.c             state->lencode = (code const FAR *)(state->next);
next              932 lib/zlib/inflate.c             ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
next              939 lib/zlib/inflate.c             state->distcode = (code const FAR *)(state->next);
next              942 lib/zlib/inflate.c                             &(state->next), &(state->distbits), state->work);
next             1245 lib/zlib/inflate.c     unsigned next;
next             1248 lib/zlib/inflate.c     next = 0;
next             1249 lib/zlib/inflate.c     while (next < len && got < 4) {
next             1250 lib/zlib/inflate.c         if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
next             1252 lib/zlib/inflate.c         else if (buf[next])
next             1256 lib/zlib/inflate.c         next++;
next             1259 lib/zlib/inflate.c     return next;
next             1360 lib/zlib/inflate.c     copy->next = copy->codes + (state->next - state->codes);
next              111 lib/zlib/inflate.h     code FAR *next;             /* next available space in codes[] */
next               54 lib/zlib/inftrees.c     code FAR *next;             /* next available space in table */
next              204 lib/zlib/inftrees.c     next = *table;              /* current table to fill in */
next              238 lib/zlib/inftrees.c             next[(huff >> drop) + fill] = this;
next              266 lib/zlib/inftrees.c             next += min;            /* here min is 1 << curr */
next              287 lib/zlib/inftrees.c             (*table)[low].val = (unsigned short)(next - *table);
next              306 lib/zlib/inftrees.c             next = *table;
next              311 lib/zlib/inftrees.c         next[huff >> drop] = this;
next               41 libcli/nbt/libnbt.h 	struct nbt_name_request *next, *prev;
next              404 librpc/gen_ndr/drsblobs.h 	struct ExtendedErrorInfo *next;/* [unique] */
next             1058 librpc/gen_ndr/drsuapi.h 	struct drsuapi_DsAddEntryErrorListItem1 *next;/* [unique] */
next             3369 librpc/gen_ndr/ndr_drsblobs.c 		NDR_CHECK(ndr_push_unique_ptr(ndr, r->next));
next             3383 librpc/gen_ndr/ndr_drsblobs.c 		if (r->next) {
next             3384 librpc/gen_ndr/ndr_drsblobs.c 			NDR_CHECK(ndr_push_ExtendedErrorInfo(ndr, NDR_SCALARS|NDR_BUFFERS, r->next));
next             3405 librpc/gen_ndr/ndr_drsblobs.c 			NDR_PULL_ALLOC(ndr, r->next);
next             3407 librpc/gen_ndr/ndr_drsblobs.c 			r->next = NULL;
next             3429 librpc/gen_ndr/ndr_drsblobs.c 		if (r->next) {
next             3431 librpc/gen_ndr/ndr_drsblobs.c 			NDR_PULL_SET_MEM_CTX(ndr, r->next, 0);
next             3432 librpc/gen_ndr/ndr_drsblobs.c 			NDR_CHECK(ndr_pull_ExtendedErrorInfo(ndr, NDR_SCALARS|NDR_BUFFERS, r->next));
next             3451 librpc/gen_ndr/ndr_drsblobs.c 	ndr_print_ptr(ndr, "next", r->next);
next             3453 librpc/gen_ndr/ndr_drsblobs.c 	if (r->next) {
next             3454 librpc/gen_ndr/ndr_drsblobs.c 		ndr_print_ExtendedErrorInfo(ndr, "next", r->next);
next             7625 librpc/gen_ndr/ndr_drsuapi.c 		NDR_CHECK(ndr_push_unique_ptr(ndr, r->next));
next             7629 librpc/gen_ndr/ndr_drsuapi.c 		if (r->next) {
next             7630 librpc/gen_ndr/ndr_drsuapi.c 			NDR_CHECK(ndr_push_drsuapi_DsAddEntryErrorListItem1(ndr, NDR_SCALARS|NDR_BUFFERS, r->next));
next             7645 librpc/gen_ndr/ndr_drsuapi.c 			NDR_PULL_ALLOC(ndr, r->next);
next             7647 librpc/gen_ndr/ndr_drsuapi.c 			r->next = NULL;
next             7652 librpc/gen_ndr/ndr_drsuapi.c 		if (r->next) {
next             7654 librpc/gen_ndr/ndr_drsuapi.c 			NDR_PULL_SET_MEM_CTX(ndr, r->next, 0);
next             7655 librpc/gen_ndr/ndr_drsuapi.c 			NDR_CHECK(ndr_pull_drsuapi_DsAddEntryErrorListItem1(ndr, NDR_SCALARS|NDR_BUFFERS, r->next));
next             7667 librpc/gen_ndr/ndr_drsuapi.c 	ndr_print_ptr(ndr, "next", r->next);
next             7669 librpc/gen_ndr/ndr_drsuapi.c 	if (r->next) {
next             7670 librpc/gen_ndr/ndr_drsuapi.c 		ndr_print_drsuapi_DsAddEntryErrorListItem1(ndr, "next", r->next);
next               44 librpc/ndr/libndr.h 	struct ndr_token_list *next, *prev;
next              337 librpc/ndr/libndr.h 	struct ndr_interface_list *prev, *next;
next              679 librpc/ndr/ndr.c 	for (tok=*list;tok;tok=tok->next) {
next               38 librpc/ndr/ndr_table.c 	for (l = ndr_interfaces; l; l = l->next) {
next               61 librpc/ndr/ndr_table.c 	for (l=ndr_table_list();l;l=l->next) {
next               76 librpc/ndr/ndr_table.c 	for (l=ndr_interfaces;l;l=l->next){
next               92 librpc/ndr/ndr_table.c 	for (l=ndr_interfaces;l;l=l->next) {
next              106 librpc/ndr/ndr_table.c 	for (l=ndr_interfaces;l;l=l->next) {
next               57 librpc/tools/ndrdump.c 	for (l=ndr_table_list();l;l=l->next) {
next              647 nsswitch/libwbclient/wbc_sid.c 	const char *next;
next              666 nsswitch/libwbclient/wbc_sid.c 	next = (const char *)response.extra_data.data;
next              667 nsswitch/libwbclient/wbc_sid.c 	while (next) {
next              669 nsswitch/libwbclient/wbc_sid.c 		const char *current = next;
next              670 nsswitch/libwbclient/wbc_sid.c 		char *k = strchr(next, ',');
next              673 nsswitch/libwbclient/wbc_sid.c 			next = k+1;
next              675 nsswitch/libwbclient/wbc_sid.c 			next = NULL;
next              715 nsswitch/libwbclient/wbc_sid.c 	const char *next;
next              734 nsswitch/libwbclient/wbc_sid.c 	next = (const char *)response.extra_data.data;
next              735 nsswitch/libwbclient/wbc_sid.c 	while (next) {
next              737 nsswitch/libwbclient/wbc_sid.c 		const char *current = next;
next              738 nsswitch/libwbclient/wbc_sid.c 		char *k = strchr(next, ',');
next              741 nsswitch/libwbclient/wbc_sid.c 			next = k+1;
next              743 nsswitch/libwbclient/wbc_sid.c 			next = NULL;
next              441 nsswitch/libwbclient/wbc_util.c 		char *next = strchr(p, '\n');
next              443 nsswitch/libwbclient/wbc_util.c 		if (next) {
next              444 nsswitch/libwbclient/wbc_util.c 			*next = '\0';
next              445 nsswitch/libwbclient/wbc_util.c 			next++;
next              451 nsswitch/libwbclient/wbc_util.c 		p = next;
next               66 nsswitch/winbind_nss_irix.c 	struct winbind_xid	*next;
next               88 nsswitch/winbind_nss_irix.c 	new->next = winbind_xids;
next              105 nsswitch/winbind_nss_irix.c             last = &dx->next, dx = dx->next);
next              107 nsswitch/winbind_nss_irix.c                 *last = dx->next;
next               68 source3/auth/auth.c 		entry = entry->next;
next               96 source3/auth/auth.c 	for (auth_method = auth_context->auth_method_list; auth_method; auth_method = auth_method->next) {
next              252 source3/auth/auth.c 	for (auth_method = auth_context->auth_method_list;auth_method; auth_method = auth_method->next) {
next              336 source3/auth/auth.c 		for (auth_method = (*auth_context)->auth_method_list; auth_method; auth_method = auth_method->next) {
next              200 source3/auth/pampass.c 	struct chat_struct *next, *prev;
next              318 source3/auth/pampass.c 			for (t=pw_chat; t; t=t->next) {
next              349 source3/auth/pampass.c 			for (t=pw_chat; t; t=t->next) {
next             1781 source3/client/client.c 	struct file_list *prev, *next;
next             1792 source3/client/client.c 	struct file_list *list, *next;
next             1794 source3/client/client.c 	for (list = l_head; list; list = next) {
next             1795 source3/client/client.c 		next = list->next;
next             1814 source3/client/client.c 		list = list->next;
next             1932 source3/client/client.c 		     temp_list = temp_list->next) {
next               55 source3/client/clitar.c 	file_info2 *next, *prev;  /* Used in the stack ... */
next              474 source3/client/tree.c     i = i->next;
next               37 source3/include/async_smb.h 	struct cli_request *prev, *next;
next              106 source3/include/auth.h 	struct auth_methods *prev, *next;
next              136 source3/include/auth.h 	struct auth_init_function_entry *prev, *next;
next              117 source3/include/client.h 	struct rpc_pipe_client *prev, *next;
next              175 source3/include/client.h         struct cli_state *prev, *next;
next               32 source3/include/eventlog.h 	struct elog_tdb *prev, *next;
next               63 source3/include/gpo.h 	struct GROUP_POLICY_OBJECT *next, *prev;
next              103 source3/include/gpo.h 	struct GP_EXT *next, *prev;
next               79 source3/include/libsmb_internal.h 	SMBCSRV *next, *prev;
next               87 source3/include/libsmb_internal.h 	struct smbc_dir_list *next;
next              104 source3/include/libsmb_internal.h 	SMBCFILE *next, *prev;
next               84 source3/include/locking.h 	struct blocking_lock_record *next;
next              219 source3/include/nameserv.h 	struct name_record *prev, *next;
next              227 source3/include/nameserv.h 	struct browse_cache_record *prev, *next;
next              239 source3/include/nameserv.h 	struct server_record *next;
next              250 source3/include/nameserv.h 	struct work_record *next;
next              377 source3/include/nameserv.h 	struct response_record *next;
next              420 source3/include/nameserv.h 	struct subnet_record *next;
next              528 source3/include/nameserv.h 	struct packet_struct *next;
next              600 source3/include/nameserv.h #define NEXT_SUBNET_EXCLUDING_UNICAST(x) ((x)->next)
next               38 source3/include/nss_info.h 	struct nss_function_entry *prev, *next;
next               48 source3/include/nss_info.h 	struct nss_domain_entry *prev, *next;
next              428 source3/include/nt_printing.h 	struct _Printer *prev, *next;
next              118 source3/include/ntdomain.h 	struct policy *next, *prev;
next              152 source3/include/ntdomain.h 	struct pipe_rpc_fns *next, *prev;
next              208 source3/include/ntdomain.h 	struct pipes_struct *next, *prev;
next               79 source3/include/ntquotas.h 	struct _SMB_NTQUOTA_LIST *prev,*next;
next              393 source3/include/passdb.h 	struct pdb_init_function_entry *prev, *next;
next               91 source3/include/printing.h 	struct tdb_print_db *next, *prev;
next               62 source3/include/regfio.h 	struct regf_hbin *prev, *next;
next              117 source3/include/regfio.h 	struct _regf_sk_rec *next, *prev;
next              368 source3/include/smb.h     struct vfs_fsp_data *next;
next              417 source3/include/smb.h 	struct files_struct *next, *prev;
next              489 source3/include/smb.h 	struct trans_state *next, *prev;
next              552 source3/include/smb.h 	struct connection_struct *next, *prev;
next              717 source3/include/smb.h 	struct interface *next, *prev;
next              727 source3/include/smb.h 	struct pending_message_list *next, *prev;
next             1772 source3/include/smb.h 	struct pending_auth_data *prev, *next;
next             1780 source3/include/smb.h 	struct user_struct *next, *prev;
next             1880 source3/include/smb.h 	struct ea_list *next, *prev;
next               53 source3/include/smb_acls.h 	int	next;
next               32 source3/include/util_getent.h 	struct sys_grent *next;
next               47 source3/include/util_getent.h 	struct sys_pwent *next;
next               56 source3/include/util_getent.h 	struct sys_userlist *next, *prev;
next               32 source3/include/util_tdb.h 	struct tdb_wrap *next, *prev;
next              686 source3/include/vfs.h 	struct vfs_handle_struct  *next, *prev;
next              153 source3/lib/adt_tree.c 	TREE_NODE *next = NULL;
next              174 source3/lib/adt_tree.c 			next = node->children[i];
next              185 source3/lib/adt_tree.c 		next ? "Found" : "Did not find", key ));	
next              187 source3/lib/adt_tree.c 	return next;
next              197 source3/lib/adt_tree.c 	TREE_NODE *current, *next;
next              242 source3/lib/adt_tree.c 		next = pathtree_find_child( current, base );
next              243 source3/lib/adt_tree.c 		if ( !next ) {
next              244 source3/lib/adt_tree.c 			next = pathtree_birth_child( current, base );
next              245 source3/lib/adt_tree.c 			if ( !next ) {
next              251 source3/lib/adt_tree.c 		current = next;
next              335 source3/lib/eventlog/eventlog.c 	for ( ptr=open_elog_list; ptr; ptr=ptr->next ) {
next               57 source3/lib/events.c 	for (fde = ev->fd_events; fde; fde = fde->next) {
next              119 source3/lib/events.c 	for (fde = ev->fd_events; fde; fde = fde->next) {
next              214 source3/lib/events.c 	for (te = ev->timer_events; te; te = te->next) {
next              225 source3/lib/events.c 	for (fe = ev->fd_events; fe; fe = fe->next) {
next               92 source3/lib/iconv.c 		c = c->next;
next              111 source3/lib/iconv.c 	funcs->next = funcs->prev = NULL;
next               35 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next               63 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next               83 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next               95 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next              127 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next              142 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next              162 source3/lib/interface.c 	for (i=local_interfaces;i ;i=i->next) {
next              184 source3/lib/interface.c 	for (i=local_interfaces;i && n;i=i->next) {
next              202 source3/lib/interface.c 	for (i=local_interfaces;i && n;i=i->next) {
next              220 source3/lib/interface.c 	for (i=local_interfaces;i && n;i=i->next) {
next              238 source3/lib/interface.c 	for (i=local_interfaces;i && n;i=i->next) {
next              256 source3/lib/interface.c 	for (i=local_interfaces;i && n;i=i->next) {
next              281 source3/lib/interface.c 	for (i=local_interfaces;i;i=i->next) {
next               62 source3/lib/ldb/common/ldb.c 	struct ldb_backend *prev, *next;
next               70 source3/lib/ldb/common/ldb.c 	for (backend = ldb_backends; backend; backend = backend->next) {
next              255 source3/lib/ldb/common/ldb.c 	while (module && module->ops->op == NULL) module = module->next; \
next             1105 source3/lib/ldb/common/ldb.c 	for (o=ldb->opaque;o;o=o->next) {
next             1117 source3/lib/ldb/common/ldb.c 	o->next = ldb->opaque;
next             1130 source3/lib/ldb/common/ldb.c 	for (o=ldb->opaque;o;o=o->next) {
next              122 source3/lib/ldb/common/ldb_modules.c 	struct ops_list_entry *next;	
next              129 source3/lib/ldb/common/ldb_modules.c 	for (e = registered_modules; e; e = e->next) {
next              197 source3/lib/ldb/common/ldb_modules.c 	entry->next = registered_modules;
next              299 source3/lib/ldb/common/ldb_modules.c 		module = module->next;
next              387 source3/lib/ldb/common/ldb_modules.c 	module = module->next; \
next              388 source3/lib/ldb/common/ldb_modules.c 	while (module && module->ops->op == NULL) module = module->next; \
next              432 source3/lib/ldb/common/ldb_modules.c 	module = module->next;
next              435 source3/lib/ldb/common/ldb_modules.c 		module = module->next;
next              469 source3/lib/ldb/common/ldb_parse.c 	struct ldb_parse_tree *ret, *next;
next              510 source3/lib/ldb/common/ldb_parse.c 	while (*p && (next = ldb_parse_filter(ret->u.list.elements, &p))) {
next              521 source3/lib/ldb/common/ldb_parse.c 		ret->u.list.elements[ret->u.list.num_elements] = next;
next               29 source3/lib/ldb/include/dlinklist.h 		(p)->next = (p)->prev = NULL; \
next               32 source3/lib/ldb/include/dlinklist.h 		(p)->next = (list); \
next               43 source3/lib/ldb/include/dlinklist.h 		(list) = (p)->next; \
next               46 source3/lib/ldb/include/dlinklist.h 		if ((p)->prev) (p)->prev->next = (p)->next; \
next               47 source3/lib/ldb/include/dlinklist.h 		if ((p)->next) (p)->next->prev = (p)->prev; \
next               49 source3/lib/ldb/include/dlinklist.h 	if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
next               65 source3/lib/ldb/include/dlinklist.h 			(p)->next = (p)->prev = NULL; \
next               68 source3/lib/ldb/include/dlinklist.h 			for (tmp = (list); tmp->next; tmp = tmp->next) ; \
next               69 source3/lib/ldb/include/dlinklist.h 			tmp->next = (p); \
next               70 source3/lib/ldb/include/dlinklist.h 			(p)->next = NULL; \
next               83 source3/lib/ldb/include/dlinklist.h 		p->next = el->next; \
next               84 source3/lib/ldb/include/dlinklist.h 		el->next = p; \
next               85 source3/lib/ldb/include/dlinklist.h 		if (p->next) p->next->prev = p; \
next              104 source3/lib/ldb/include/dlinklist.h 			for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
next              105 source3/lib/ldb/include/dlinklist.h 			tmp->next = (list2); \
next               46 source3/lib/ldb/include/ldb_private.h 	struct ldb_module *prev, *next;
next              107 source3/lib/ldb/include/ldb_private.h 		struct ldb_opaque *next;
next              782 source3/lib/ldb/ldb_ildap/ldb_ildap.c 	(*module)->prev = (*module)->next = NULL;
next              830 source3/lib/ldb/ldb_ldap/ldb_ldap.c 	(*module)->prev = (*module)->next = NULL;
next             1871 source3/lib/ldb/ldb_sqlite3/ldb_sqlite3.c 	(*module)->prev = (*module)->next = NULL;
next             1068 source3/lib/ldb/ldb_tdb/ldb_tdb.c 	(*module)->prev = (*module)->next = NULL;
next               36 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 	struct ltdb_wrap *next, *prev;
next               48 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 	if (w->next) {
next               49 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		w->next->prev = w->prev;
next               52 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		w->prev->next = w->next;
next               55 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		tdb_list = w->next;
next              113 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		for (w=tdb_list;w;w=w->next) {
next              145 source3/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 	w->next = tdb_list;
next             1044 source3/lib/ldb/modules/ldb_map.c 	map_next_function next;
next             1096 source3/lib/ldb/modules/ldb_map.c 		next = map_get_next(ac);
next             1097 source3/lib/ldb/modules/ldb_map.c 		if (next) {
next             1098 source3/lib/ldb/modules/ldb_map.c 			return next(handle);
next               54 source3/lib/ldb/modules/objectclass.c 	struct class_list *prev, *next;
next              154 source3/lib/ldb/modules/objectclass.c 		for (current = parent_class; unsorted && current; current = current->next) {
next              159 source3/lib/ldb/modules/objectclass.c 				struct class_list *next;
next              162 source3/lib/ldb/modules/objectclass.c 				next = poss_subclass->next;
next              172 source3/lib/ldb/modules/objectclass.c 				poss_subclass = next;
next              263 source3/lib/ldb/modules/objectclass.c 	for (current = sorted; current; current = current->next) {
next              361 source3/lib/ldb/modules/objectclass.c 		for (current = sorted; current; current = current->next) {
next              547 source3/lib/ldb/modules/objectclass.c 	for (current = sorted; current; current = current->next) {
next               43 source3/lib/ldb/modules/paged_results.c 	struct message_store *next;
next               56 source3/lib/ldb/modules/paged_results.c 	struct results_store *next;
next               82 source3/lib/ldb/modules/paged_results.c 		store->prev->next = store->next;
next               84 source3/lib/ldb/modules/paged_results.c 	if (store->next) {
next               85 source3/lib/ldb/modules/paged_results.c 		store->next->prev = store->prev;
next              124 source3/lib/ldb/modules/paged_results.c 	newr->next = priv->store;
next              192 source3/lib/ldb/modules/paged_results.c 			ac->store->last->next = talloc(ac->store, struct message_store);
next              193 source3/lib/ldb/modules/paged_results.c 			ac->store->last = ac->store->last->next;
next              202 source3/lib/ldb/modules/paged_results.c 		ac->store->last->next = NULL;
next              209 source3/lib/ldb/modules/paged_results.c 			ac->store->last_ref->next = talloc(ac->store, struct message_store);
next              210 source3/lib/ldb/modules/paged_results.c 			ac->store->last_ref = ac->store->last_ref->next;
next              217 source3/lib/ldb/modules/paged_results.c 		ac->store->last_ref->next = NULL;
next              308 source3/lib/ldb/modules/paged_results.c 		for (current = private_data->store; current; current = current->next) {
next              361 source3/lib/ldb/modules/paged_results.c 		ac->store->first = msg->next;
next              378 source3/lib/ldb/modules/paged_results.c 		ac->store->first_ref = msg->next;
next               27 source3/lib/memcache.c 	struct memcache_element *prev, *next;
next               62 source3/lib/memcache.c 	struct memcache_element *e, *next;
next               64 source3/lib/memcache.c 	for (e = cache->mru; e != NULL; e = next) {
next               65 source3/lib/memcache.c 		next = e->next;
next              385 source3/lib/memcache.c 		struct rb_node *next;
next              392 source3/lib/memcache.c 			next = node->rb_right;
next              395 source3/lib/memcache.c 			next = node->rb_left;
next              397 source3/lib/memcache.c 		if (next == NULL) {
next              400 source3/lib/memcache.c 		node = next;
next              427 source3/lib/memcache.c 		struct rb_node *next = rb_next(node);
next              434 source3/lib/memcache.c 		node = next;
next               53 source3/lib/messages.c 	struct messaging_callback *prev, *next;
next              288 source3/lib/messages.c 	for (cb = msg_ctx->callbacks; cb != NULL; cb = cb->next) {
next              322 source3/lib/messages.c 	struct messaging_callback *cb, *next;
next              324 source3/lib/messages.c 	for (cb = ctx->callbacks; cb; cb = next) {
next              325 source3/lib/messages.c 		next = cb->next;
next              368 source3/lib/messages.c 	struct messaging_callback *cb, *next;
next              370 source3/lib/messages.c 	for (cb = msg_ctx->callbacks; cb != NULL; cb = next) {
next              371 source3/lib/messages.c 		next = cb->next;
next               86 source3/lib/netapi/cm.c 	struct client_pipe_connection *prev, *next;
next              100 source3/lib/netapi/cm.c 	for (p = pipe_connections; p; p = p->next) {
next              116 source3/lib/netapi/cm.c 	for (p = pipe_connections; p; p = p->next) {
next              586 source3/lib/smbldap.c 	struct smbldap_state_lookup *prev, *next;
next              595 source3/lib/smbldap.c 	for (t = smbldap_state_lookup_list; t; t = t->next) {
next              607 source3/lib/smbldap.c 	for (t = smbldap_state_lookup_list; t; t = t->next) {
next               55 source3/lib/sysacls.c 		acl_d->next = 0;
next               58 source3/lib/sysacls.c 	if (acl_d->next < 0) {
next               63 source3/lib/sysacls.c 	if (acl_d->next >= acl_d->count) {
next               67 source3/lib/sysacls.c 	*entry_p = &acl_d->acl[acl_d->next++];
next              254 source3/lib/sysacls.c 	a->next = -1;
next             1055 source3/lib/system.c 	struct _popen_list *next;
next             1117 source3/lib/system.c 		for (p = popen_chain; p; p = p->next)
next             1132 source3/lib/system.c 	entry->next = popen_chain;
next             1160 source3/lib/system.c 	for ( ; *ptr != NULL; ptr = &(*ptr)->next) {
next             1163 source3/lib/system.c 			*ptr = (*ptr)->next;
next              551 source3/lib/util_tdb.c 	for (w=tdb_list;w;w=w->next) {
next              543 source3/lib/wbclient.c 	struct wb_trans_state *prev, *next;
next              318 source3/libaddns/dns.h 	struct dns_domain_label *next;
next              154 source3/libaddns/dnsmarshall.c 	for (label = name->pLabelList; label != NULL; label = label->next) {
next              234 source3/libaddns/dnsmarshall.c 	dns_unmarshall_label(label, level+1, buf, &label->next);
next               88 source3/libaddns/dnsutils.c 		DNS_ERROR err = LabelList(result, dot+1, &result->next);
next             1081 source3/libads/ldap.c 		LDAPMessage *msg, *next;
next             1090 source3/libads/ldap.c 		for (msg = ads_first_message(ads, res2); msg; msg = next) {
next             1091 source3/libads/ldap.c 			next = ads_next_message(ads, msg);
next               67 source3/libgpo/gpext/gpext.c 	for (b = be; b; b = b->next) {
next               84 source3/libgpo/gpext/gpext.c 	for (b = be; b; b = b->next) {
next              531 source3/libgpo/gpext/gpext.c 	for (ext = extensions; ext; ext = ext->next) {
next              631 source3/libgpo/gpext/gpext.c 		ext_next = ext->next;
next              707 source3/libgpo/gpext/gpext.c 	for (ext = extensions; ext; ext = ext->next) {
next               30 source3/libgpo/gpext/gpext.h 	struct gp_extension *prev, *next;
next              519 source3/libgpo/gpo_reg.c 	for (gpo = gpo_list; gpo; gpo = gpo->next) {
next              329 source3/libgpo/gpo_util.c 	for (gpo = gpo_list; gpo; gpo = gpo->next) {
next              504 source3/libgpo/gpo_util.c 	for (gpo = gpo_list; gpo; gpo = gpo->next) {
next              572 source3/libgpo/gpo_util.c 	for (gp_ext = gp_ext_list; gp_ext; gp_ext = gp_ext->next) {
next              737 source3/libgpo/gpo_util.c 	for (gpo = gpo_list; gpo; gpo = gpo->next) {
next               88 source3/libsmb/async_smb.c 		for (req = cli->outstanding_requests; req; req = req->next) {
next              888 source3/libsmb/async_smb.c 	struct cli_request *req, *next;
next              965 source3/libsmb/async_smb.c 	for (req = cli->outstanding_requests; req; req = req->next) {
next             1011 source3/libsmb/async_smb.c 	for (req = cli->outstanding_requests; req; req = next) {
next             1012 source3/libsmb/async_smb.c 		next = req->next;
next             1032 source3/libsmb/async_smb.c 	struct cli_request *req, *next;
next             1041 source3/libsmb/async_smb.c 		for (req = cli->outstanding_requests; req; req = req->next) {
next             1139 source3/libsmb/async_smb.c 	for (req = cli->outstanding_requests; req; req = next) {
next             1142 source3/libsmb/async_smb.c 		next = req->next;
next              369 source3/libsmb/clidfs.c 	for (p = cli->next; p; p = p->next) {
next              429 source3/libsmb/clidfs.c 	for (i=0; cli; cli = cli->next,i++ ) {
next              608 source3/libsmb/clientgen.c 		struct cli_state *p, *next;
next              610 source3/libsmb/clientgen.c 		for (p = cli->next; p; p = next) {
next              611 source3/libsmb/clientgen.c 			next = p->next;
next              634 source3/libsmb/cliquota.c 	for (cur = *qtl;cur;cur = cur->next) {
next               38 source3/libsmb/libsmb_cache.c 	struct smbc_server_cache *next, *prev;
next              121 source3/libsmb/libsmb_cache.c 	for (srv = context->internal->server_cache; srv; srv = srv->next) {
next              203 source3/libsmb/libsmb_cache.c 	for (srv = context->internal->server_cache; srv; srv = srv->next) {
next              229 source3/libsmb/libsmb_cache.c 	struct smbc_server_cache * next;
next              233 source3/libsmb/libsmb_cache.c                      next = (srv ? srv->next :NULL);
next              235 source3/libsmb/libsmb_cache.c              srv = next,
next              236 source3/libsmb/libsmb_cache.c                      next = (srv ? srv->next : NULL)) {
next               31 source3/libsmb/libsmb_compat.c 	struct smbc_compat_fdlist *next, *prev;
next               48 source3/libsmb/libsmb_compat.c 		f = f->next;
next              102 source3/libsmb/libsmb_compat.c 		f = f->next;
next              147 source3/libsmb/libsmb_context.c                         f = f->next;
next              154 source3/libsmb/libsmb_context.c                         SMBCSRV * next;
next              164 source3/libsmb/libsmb_context.c                                 next = s->next;
next              167 source3/libsmb/libsmb_context.c                                 s = next;
next              359 source3/libsmb/libsmb_context.c                 for (s = context->internal->servers; s; s = s->next) {
next               43 source3/libsmb/libsmb_dir.c 		f = d; d = d->next;
next               99 source3/libsmb/libsmb_dir.c 		dir->dir_end->next = SMB_MALLOC_P(struct smbc_dir_list);
next              101 source3/libsmb/libsmb_dir.c 		if (!dir->dir_end->next) {
next              108 source3/libsmb/libsmb_dir.c 		ZERO_STRUCTP(dir->dir_end->next);
next              110 source3/libsmb/libsmb_dir.c 		dir->dir_end = dir->dir_end->next;
next              113 source3/libsmb/libsmb_dir.c 	dir->dir_end->next = NULL;
next              160 source3/libsmb/libsmb_dir.c              dir_list = dir_list->next) {
next              167 source3/libsmb/libsmb_dir.c                 if (do_remove && dir_list->next == dir->dir_end) {
next              170 source3/libsmb/libsmb_dir.c                         free(dir_list->next);
next              172 source3/libsmb/libsmb_dir.c                         dir_list->next = NULL;
next              994 source3/libsmb/libsmb_dir.c         dir->dir_next = dir->dir_next->next;
next             1098 source3/libsmb/libsmb_dir.c 		dir->dir_next = dirlist = dirlist -> next;
next             1414 source3/libsmb/libsmb_dir.c 			tmp = tmp->next;
next               39 source3/libsmb/libsmb_misc.c 		list = list->next;
next               66 source3/libsmb/libsmb_server.c 	for (file = context->internal->files; file; file = file->next) {
next               40 source3/libsmb/libsmb_xattr.c              pipe_hnd = pipe_hnd->next) {
next              742 source3/libsmb/nmblib.c 	p->next = NULL;
next               25 source3/libsmb/smb_signing.c 	struct outstanding_packet_lookup *prev, *next;
next               43 source3/libsmb/smb_signing.c 	for (t = *list; t; t = t->next) {
next               76 source3/libsmb/smb_signing.c 	for (t = *list; t; t = t->next) {
next               95 source3/libsmb/smb_signing.c 	for (t = *list; t; t = t->next) {
next              449 source3/libsmb/smb_signing.c 	struct outstanding_packet_lookup *next;
next              451 source3/libsmb/smb_signing.c 	for (list = data->outstanding_packet_list; list; list = next) {
next              452 source3/libsmb/smb_signing.c 		next = list->next;
next              695 source3/locking/posix.c 	struct lock_list *next;
next              768 source3/locking/posix.c 				l_curr = l_curr->next;
next              786 source3/locking/posix.c 				struct lock_list *ul_next = l_curr->next;
next              824 source3/locking/posix.c 				l_curr = l_curr->next;
next              852 source3/locking/posix.c 				l_curr = l_curr->next;
next              898 source3/locking/posix.c 				l_new->next = l_curr->next;
next              899 source3/locking/posix.c 				l_curr->next = l_new;
next              902 source3/locking/posix.c 				l_curr = l_new->next;
next             1022 source3/locking/posix.c 	for (lock_count = 0, ll = llist; ll; ll = ll->next, lock_count++) {
next             1044 source3/locking/posix.c 		for (ll = llist; lock_count; ll = ll->next, lock_count--) {
next             1144 source3/locking/posix.c 			(!ulist || ulist->next != NULL || ulist->start != offset || ulist->size != count)) {
next             1160 source3/locking/posix.c 	for(; ulist; ulist = ulist->next) {
next             1294 source3/locking/posix.c 	for(; ulist; ulist = ulist->next) {
next               35 source3/modules/nfs4_acls.c 	void	*next;
next              120 source3/modules/nfs4_acls.c 		aclint->last->next = (void *)ace;
next              143 source3/modules/nfs4_acls.c 	return (SMB4ACE_T *)aceint->next;
next              230 source3/modules/nfs4_acls.c 	for (aceint=aclint->first; aceint!=NULL; aceint=(SMB_ACE4_INT_T *)aceint->next) {
next              415 source3/modules/nfs4_acls.c 	for(aceint = aclint->first; aceint!=NULL; aceint=(SMB_ACE4_INT_T *)aceint->next) {
next              438 source3/modules/nfs4_acls.c 	for(aceint = aclint->first; aceint!=NULL; aceint=(SMB_ACE4_INT_T *)aceint->next) {
next               94 source3/modules/onefs_cbrl.c 	for (blr = blocking_lock_queue; blr; blr = blr->next)
next              105 source3/modules/onefs_cbrl.c 	for (blr = blocking_lock_queue; blr; blr = blr->next) {
next               50 source3/modules/onefs_dir.c 	struct rdp_dir_state *next, *prev;
next               83 source3/modules/onefs_dir.c 	for(dsp = dirstatelist; dsp; dsp = dsp->next)
next               27 source3/modules/perfcount_onefs.c 	struct onefs_op_counter *next;
next              306 source3/modules/perfcount_onefs.c 	for (tmp = ctxt->ops_chain; tmp; tmp = tmp->next) {
next               41 source3/modules/perfcount_test.c 	struct perfcount_test_counter *next;
next               74 source3/modules/perfcount_test.c 		for (head = g_list[ptc->op]; head != NULL; head = head->next) {
next               80 source3/modules/perfcount_test.c 				tmp = ptc->next;
next               91 source3/modules/perfcount_test.c 			tmp = ptc->next;
next              180 source3/modules/perfcount_test.c 	       for (head = g_list[i]; head != NULL; head = head->next) {
next              317 source3/modules/perfcount_test.c 	for (ctr = ctxt->ops; ctr != NULL; ctr = ctr->next) {
next              324 source3/modules/perfcount_test.c 		new_ctr->next = NULL;
next              335 source3/modules/perfcount_test.c 		new_ctr = ctr->next;
next               52 source3/modules/vfs_afsacl.c 	struct afs_ace *next;
next               97 source3/modules/vfs_afsacl.c 	result->next = NULL;
next              196 source3/modules/vfs_afsacl.c 	for (ace = acl->acelist; ace != NULL; ace = ace->next) {
next              206 source3/modules/vfs_afsacl.c 	ace->next = acl->acelist;
next              310 source3/modules/vfs_afsacl.c 		ace = ace->next;
next              324 source3/modules/vfs_afsacl.c 		ace = ace->next;
next              403 source3/modules/vfs_afsacl.c 	for (ace = acl->acelist; ace != NULL; ace = ace->next) {
next              431 source3/modules/vfs_afsacl.c 	for (ace = dir_acl->acelist; ace != NULL; ace = ace->next) {
next              437 source3/modules/vfs_afsacl.c 		     file_ace = file_ace->next) {
next              451 source3/modules/vfs_afsacl.c 	for (ace = file_acl->acelist; ace != NULL; ace = ace->next) {
next              457 source3/modules/vfs_afsacl.c 		     dir_ace = dir_ace->next) {
next              625 source3/modules/vfs_afsacl.c 			afs_ace = afs_ace->next;
next              637 source3/modules/vfs_afsacl.c 		afs_ace = afs_ace->next;
next              867 source3/modules/vfs_afsacl.c 	for (ace = src->acelist; ace != NULL; ace = ace->next)
next              886 source3/modules/vfs_afsacl.c 		copy->next = dst->acelist;
next               85 source3/modules/vfs_aio_fork.c 	struct aio_child *prev, *next;
next              224 source3/modules/vfs_aio_fork.c 	struct aio_child *child, *next;
next              228 source3/modules/vfs_aio_fork.c 	for (child = list->children; child != NULL; child = next) {
next              229 source3/modules/vfs_aio_fork.c 		next = child->next;
next              527 source3/modules/vfs_aio_fork.c 	for (child = children->children; child != NULL; child = child->next) {
next              647 source3/modules/vfs_aio_fork.c 	for (child = children->children; child != NULL; child = child->next) {
next              690 source3/modules/vfs_aio_fork.c 	for (child = children->children; child != NULL; child = child->next) {
next               47 source3/modules/vfs_notify_fam.c 	struct fam_watch_context *prev, *next;
next              127 source3/modules/vfs_notify_fam.c 	for (ctx = notify_list; ctx; ctx = ctx->next) {
next              173 source3/modules/vfs_notify_fam.c 	for (ctx = fam_notify_list; ctx; ctx = ctx->next) {
next              146 source3/modules/vfs_smb_traffic_analyzer.c 	struct refcounted_sock *next, *prev;
next              282 source3/modules/vfs_smb_traffic_analyzer.c 	for (rf_sock = sock_list; rf_sock; rf_sock = rf_sock->next) {
next              262 source3/nmbd/asyncdns.c 				p->prev->next = p->next;
next              264 source3/nmbd/asyncdns.c 				dns_queue = p->next;
next              265 source3/nmbd/asyncdns.c 			if (p->next)
next              266 source3/nmbd/asyncdns.c 				p->next->prev = p->prev;
next              267 source3/nmbd/asyncdns.c 			p2 = p->next;
next              271 source3/nmbd/asyncdns.c 			p = p->next;
next              277 source3/nmbd/asyncdns.c 		dns_queue = dns_queue->next;
next              280 source3/nmbd/asyncdns.c 		dns_current->next = NULL;
next              307 source3/nmbd/asyncdns.c 		p->next = dns_queue;
next              309 source3/nmbd/asyncdns.c 		if (p->next)
next              310 source3/nmbd/asyncdns.c 			p->next->prev = p;
next              270 source3/nmbd/nmbd.c 		for (subrec=subnetlist; subrec; subrec=subrec->next) {
next              289 source3/nmbd/nmbd.c 	for (subrec=subnetlist; subrec; subrec=subrec->next) {
next              370 source3/nmbd/nmbd_become_lmb.c 	for( sl = work->serverlist; sl != NULL; sl = sl->next)
next              141 source3/nmbd/nmbd_browserdb.c 	for( browc = lmb_browserlist; browc; browc = browc->next ) {
next              165 source3/nmbd/nmbd_browserdb.c 		nextbrowc = browc->next;
next               89 source3/nmbd/nmbd_browsesync.c 	for( browc = lmb_browserlist; browc; browc = browc->next ) {
next              641 source3/nmbd/nmbd_browsesync.c 	for (work=unicast_subnet->workgrouplist; work; work = work->next) {
next              648 source3/nmbd/nmbd_browsesync.c 	for (work=unicast_subnet->workgrouplist; work; work = work->next) {
next              143 source3/nmbd/nmbd_elections.c 		for (work = subrec->workgrouplist; work; work = work->next) {
next              178 source3/nmbd/nmbd_elections.c 		for (work = subrec->workgrouplist; work; work = work->next) {
next              335 source3/nmbd/nmbd_elections.c 		for (work = subrec->workgrouplist; work; work = work->next) {
next              389 source3/nmbd/nmbd_elections.c 		for (work = subrec->workgrouplist; work; work = work->next) {
next               45 source3/nmbd/nmbd_incomingdgrams.c     for (work = subrec->workgrouplist; work; work = work->next)
next               51 source3/nmbd/nmbd_incomingdgrams.c       for (servrec = work->serverlist; servrec; servrec = servrec->next)
next              590 source3/nmbd/nmbd_incomingdgrams.c   for (servrec = work->serverlist; servrec; servrec = servrec->next)
next              740 source3/nmbd/nmbd_incomingdgrams.c 			for (work = sr->workgrouplist; work; work = work->next) {
next              391 source3/nmbd/nmbd_incomingrequests.c 		namerec = namerec->next;
next              162 source3/nmbd/nmbd_mynames.c 			for(subrec = FIRST_SUBNET; subrec; subrec = subrec->next) {
next              217 source3/nmbd/nmbd_mynames.c 		nextnamerec = namerec->next;
next              236 source3/nmbd/nmbd_mynames.c 	for (namerec = unicast_subnet->namelist; namerec; namerec = namerec->next) {
next              111 source3/nmbd/nmbd_namelistdb.c 	for( name_ret = subrec->namelist; name_ret; name_ret = name_ret->next) {
next              450 source3/nmbd/nmbd_namelistdb.c 		next_namerec = namerec->next;
next              620 source3/nmbd/nmbd_namelistdb.c 	for( namerec = subrec->namelist; namerec; namerec = namerec->next) {
next             1011 source3/nmbd/nmbd_packets.c 		packet->next = NULL;
next             1017 source3/nmbd/nmbd_packets.c 	for (p=packet_queue;p->next;p=p->next)
next             1020 source3/nmbd/nmbd_packets.c 	p->next = packet;
next             1021 source3/nmbd/nmbd_packets.c 	packet->next = NULL;
next             1578 source3/nmbd/nmbd_packets.c 		packet_queue = p->next;
next             1581 source3/nmbd/nmbd_packets.c 		p->next = p->prev = NULL;
next             1617 source3/nmbd/nmbd_packets.c 			nextrrec = rrec->next;
next               56 source3/nmbd/nmbd_responserecordsdb.c 	for (p = subrec->responselist; p; p = p->next) {
next              175 source3/nmbd/nmbd_responserecordsdb.c 	for (rrec = subrec->responselist; rrec; rrec = rrec->next) {
next              230 source3/nmbd/nmbd_responserecordsdb.c 	for (rrec = subrec->responselist; rrec; rrec = rrec->next) {
next              294 source3/nmbd/nmbd_sendannounce.c 			for (servrec = work->serverlist; servrec; servrec = servrec->next) {
next              338 source3/nmbd/nmbd_sendannounce.c 			for (servrec = work->serverlist; servrec; servrec = servrec->next) {
next              391 source3/nmbd/nmbd_sendannounce.c 		for (work = subrec->workgrouplist; work; work = work->next) {
next              416 source3/nmbd/nmbd_sendannounce.c 		for (work = subrec->workgrouplist; work; work = work->next) {
next              420 source3/nmbd/nmbd_sendannounce.c 			for (servrec = work->serverlist; servrec; servrec = servrec->next) {
next               38 source3/nmbd/nmbd_serverlistdb.c 		nexts = servrec->next;
next               41 source3/nmbd/nmbd_serverlistdb.c 			servrec->prev->next = servrec->next;
next               42 source3/nmbd/nmbd_serverlistdb.c 		if (servrec->next)
next               43 source3/nmbd/nmbd_serverlistdb.c 			servrec->next->prev = servrec->prev;
next               46 source3/nmbd/nmbd_serverlistdb.c 			work->serverlist = servrec->next;
next               67 source3/nmbd/nmbd_serverlistdb.c 		servrec->next = NULL;
next               71 source3/nmbd/nmbd_serverlistdb.c 	for (servrec2 = work->serverlist; servrec2->next; servrec2 = servrec2->next)
next               74 source3/nmbd/nmbd_serverlistdb.c 	servrec2->next = servrec;
next               75 source3/nmbd/nmbd_serverlistdb.c 	servrec->next = NULL;
next               88 source3/nmbd/nmbd_serverlistdb.c 	for (ret = work->serverlist; ret; ret = ret->next) {
next              103 source3/nmbd/nmbd_serverlistdb.c 		servrec->prev->next = servrec->next;
next              104 source3/nmbd/nmbd_serverlistdb.c 	if (servrec->next)
next              105 source3/nmbd/nmbd_serverlistdb.c 		servrec->next->prev = servrec->prev;
next              108 source3/nmbd/nmbd_serverlistdb.c 		work->serverlist = servrec->next; 
next              192 source3/nmbd/nmbd_serverlistdb.c 		nexts = servrec->next;
next              217 source3/nmbd/nmbd_serverlistdb.c 		for(iwork = ssub->workgrouplist; iwork; iwork = iwork->next) {
next              390 source3/nmbd/nmbd_serverlistdb.c 		for (work = subrec->workgrouplist; work ; work = work->next) {
next              402 source3/nmbd/nmbd_serverlistdb.c 			for (servrec = work->serverlist; servrec ; servrec = servrec->next) {
next              361 source3/nmbd/nmbd_subnetdb.c 	else if((subrec->next == NULL) && we_are_a_wins_client())
next              364 source3/nmbd/nmbd_subnetdb.c 		return subrec->next;
next              386 source3/nmbd/nmbd_subnetdb.c 	if((subrec->next == NULL) && we_are_a_wins_client())
next              389 source3/nmbd/nmbd_subnetdb.c 		return subrec->next;
next               32 source3/nmbd/nmbd_synclists.c 	struct sync_record *next, *prev;
next              311 source3/nmbd/nmbd_synclists.c 	struct sync_record *s, *next;
next              313 source3/nmbd/nmbd_synclists.c 	for (s=syncs;s;s=next) {
next              314 source3/nmbd/nmbd_synclists.c 		next = s->next;
next               47 source3/nmbd/nmbd_winsserver.c 		nrnext = nr->next;
next              247 source3/nmbd/nmbd_winsserver.c 	for( nr = wins_server_subnet->namelist; nr; nr = nr->next) {
next             1801 source3/nmbd/nmbd_winsserver.c 	for( namerec = subrec->namelist; namerec; namerec = namerec->next ) {
next             1827 source3/nmbd/nmbd_winsserver.c 	for( namerec = subrec->namelist; namerec; namerec = namerec->next ) {
next               97 source3/nmbd/nmbd_workgroupdb.c 		for (w = subrec->workgrouplist; w && t == -1; w = w->next) {
next              137 source3/nmbd/nmbd_workgroupdb.c 	ret_work = work->next;
next              143 source3/nmbd/nmbd_workgroupdb.c 			work->prev->next = work->next;
next              144 source3/nmbd/nmbd_workgroupdb.c 		if (work->next)
next              145 source3/nmbd/nmbd_workgroupdb.c 			work->next->prev = work->prev;
next              148 source3/nmbd/nmbd_workgroupdb.c 			subrec->workgrouplist = work->next; 
next              174 source3/nmbd/nmbd_workgroupdb.c 	for (ret = subrec->workgrouplist; ret; ret = ret->next) {
next              287 source3/nmbd/nmbd_workgroupdb.c 			for (work = subrec->workgrouplist; work; work = work->next) {
next              292 source3/nmbd/nmbd_workgroupdb.c 					for (servrec = work->serverlist; servrec; servrec = servrec->next) {
next              318 source3/nmbd/nmbd_workgroupdb.c 			nextwork = work->next;
next              104 source3/param/loadparm.c 	struct param_opt_struct *prev, *next;
next             5664 source3/param/loadparm.c 		data = data->next;
next             5676 source3/param/loadparm.c 			data = data->next;
next             5906 source3/param/loadparm.c 		next_opt = opt->next;
next             6639 source3/param/loadparm.c 		opt = opt->next;
next             6714 source3/param/loadparm.c 		data = data->next;
next             6913 source3/param/loadparm.c 	struct file_lists *next;
next             6931 source3/param/loadparm.c 		f = f->next;
next             6938 source3/param/loadparm.c 		f->next = file_lists;
next             6964 source3/param/loadparm.c 	struct file_lists *next;
next             6968 source3/param/loadparm.c 		next = f->next;
next             6972 source3/param/loadparm.c 		f = next;
next             7049 source3/param/loadparm.c 		f = f->next;
next             7801 source3/param/loadparm.c 			data = data->next;
next             7866 source3/param/loadparm.c 				data = data->next;
next               86 source3/passdb/pdb_interface.c 		entry = entry->next;
next               30 source3/printing/notify.c 	struct notify_queue *next, *prev;
next              135 source3/printing/notify.c 	for (pq = notify_queue_head; pq; pq = pq->next) {
next              161 source3/printing/notify.c 		pq_next = pq->next;
next              280 source3/printing/notify.c 		for (tmp_ptr = notify_queue_head; tmp_ptr; tmp_ptr = tmp_ptr->next) 
next               69 source3/printing/pcap.c 	struct pcap_cache *next;
next               88 source3/printing/pcap.c 	p->next = *ppcache;
next               96 source3/printing/pcap.c 	struct pcap_cache *p, *next;
next               98 source3/printing/pcap.c 	for (p = *pp_cache; p != NULL; p = next) {
next               99 source3/printing/pcap.c 		next = p->next;
next              123 source3/printing/pcap.c 	for (p = pcache; p; p = p->next) {
next              260 source3/printing/pcap.c 	for (p = pcap_cache; p != NULL; p = p->next)
next              277 source3/printing/pcap.c 	for (p = pc; p != NULL; p = p->next)
next              223 source3/printing/print_cups.c 			attr = attr->next;
next              256 source3/printing/print_cups.c         		attr = attr->next;
next              315 source3/printing/print_cups.c 			attr = attr->next;
next              348 source3/printing/print_cups.c         		attr = attr->next;
next             1183 source3/printing/print_cups.c         for (attr = response->attrs; attr != NULL; attr = attr->next) {
next             1189 source3/printing/print_cups.c         		attr = attr->next;
next             1226 source3/printing/print_cups.c 				attr = attr->next;
next             1270 source3/printing/print_cups.c         		attr = attr->next;
next             1703 source3/printing/print_cups.c 			attr = attr->next;
next             1761 source3/printing/print_cups.c         		attr = attr->next;
next              238 source3/printing/print_iprint.c 			attr = attr->next;
next              288 source3/printing/print_iprint.c 			attr = attr->next;
next              376 source3/printing/print_iprint.c 			attr = attr->next;
next              402 source3/printing/print_iprint.c 			attr = attr->next;
next             1061 source3/printing/print_iprint.c 	for (attr = response->attrs; attr != NULL; attr = attr->next) {
next             1067 source3/printing/print_iprint.c 			attr = attr->next;
next             1104 source3/printing/print_iprint.c 				attr = attr->next;
next             1150 source3/printing/print_iprint.c 			attr = attr->next;
next               41 source3/printing/printing_db.c 	for (p = print_db_head, last_entry = print_db_head; p; p = p->next) {
next               43 source3/printing/printing_db.c 		SMB_ASSERT(p->next != print_db_head);
next               61 source3/printing/printing_db.c 		for (p = print_db_head; p; p = p->next) {
next              145 source3/printing/printing_db.c 		next_p = p->next;
next              184 source3/registry/regfio.c 	for ( p=file->block_list; p && p!=hbin; p=p->next )
next              568 source3/registry/regfio.c 	for ( hbin=file->block_list; hbin; hbin=hbin->next ) {
next              945 source3/registry/regfio.c 	for ( p_sk=file->sec_desc_list; p_sk; p_sk=p_sk->next ) {
next              960 source3/registry/regfio.c 	for ( p=file->sec_desc_list; p; p=p->next ) {
next             1264 source3/registry/regfio.c 		for ( sk=file->sec_desc_list; sk; sk=sk->next ) {
next             1319 source3/registry/regfio.c 	for ( hbin=file->block_list; hbin; hbin=hbin->next ) {
next             1485 source3/registry/regfio.c 	for ( hbin=file->block_list; hbin!=NULL; hbin=hbin->next ) {
next             1515 source3/registry/regfio.c 			for ( p_hbin=file->block_list; p_hbin!=NULL; p_hbin=p_hbin->next ) {
next              178 source3/rpc_server/srv_lsa_hnd.c 	for (i = 0, pol=p->pipe_handles->Policy;pol;pol=pol->next, i++) {
next             2210 source3/rpc_server/srv_pipe.c 	for (fns=list; fns; fns=fns->next ) {
next             2227 source3/rpc_server/srv_pipe.c 		tmp2 = tmp->next;
next               55 source3/rpc_server/srv_pipe_hnd.c 	return p->next;
next               59 source3/rpc_server/srv_spoolss_nt.c 	struct _counter_printer_0 *next;
next              964 source3/rpc_server/srv_spoolss_nt.c 	for (p = printers_list; p; p = p->next) {
next             1339 source3/rpc_server/srv_spoolss_nt.c 		printer = printer->next;
next             3802 source3/rpc_server/srv_spoolss_nt.c 	for (session_counter = counter_list; session_counter; session_counter = session_counter->next) {
next               40 source3/rpcclient/rpcclient.c 	struct cmd_list *prev, *next;
next              100 source3/rpcclient/rpcclient.c 		commands = commands->next;
next              214 source3/rpcclient/rpcclient.c 	for (tmp = cmd_list; tmp; tmp = tmp->next) 
next              259 source3/rpcclient/rpcclient.c                 for (tmp = cmd_list; tmp; tmp = tmp->next) {
next              284 source3/rpcclient/rpcclient.c 	for (tmp = cmd_list; tmp; tmp = tmp->next) {
next              333 source3/rpcclient/rpcclient.c 	for (tmp = cmd_list; tmp; tmp = tmp->next) {
next              430 source3/rpcclient/rpcclient.c 		for (tmp = cmd_list; tmp; tmp = tmp->next) {
next              713 source3/rpcclient/rpcclient.c 	for (temp_list = cmd_list; temp_list; temp_list = temp_list->next) {
next               46 source3/smbd/aio.c 	struct aio_extra *next, *prev;
next               99 source3/smbd/aio.c 	for( p = aio_list_head; p; p = p->next) {
next              582 source3/smbd/aio.c 		for( aio_ex = aio_list_head; aio_ex; aio_ex = aio_ex->next) {
next              603 source3/smbd/aio.c 		     aio_ex = aio_ex->next) {
next              676 source3/smbd/aio.c 	for( aio_ex = aio_list_head; aio_ex; aio_ex = aio_ex->next) {
next               80 source3/smbd/blocking.c 	for (blr = blocking_lock_queue; blr; blr = blr->next) {
next              157 source3/smbd/blocking.c 	blr->next = NULL;
next              531 source3/smbd/blocking.c 	struct blocking_lock_record *blr, *blr_cancelled, *next = NULL;
next              533 source3/smbd/blocking.c 	for(blr = blocking_lock_queue; blr; blr = next) {
next              536 source3/smbd/blocking.c 		next = blr->next;
next              579 source3/smbd/blocking.c 	struct blocking_lock_record *blr, *next = NULL;
next              581 source3/smbd/blocking.c 	for(blr = blocking_lock_queue; blr; blr = next) {
next              585 source3/smbd/blocking.c 		next = blr->next;
next              622 source3/smbd/blocking.c 	struct blocking_lock_record *blr, *next = NULL;
next              624 source3/smbd/blocking.c 	for(blr = blocking_lock_queue; blr; blr = next) {
next              625 source3/smbd/blocking.c 		next = blr->next;
next              654 source3/smbd/blocking.c 	struct blocking_lock_record *blr, *next = NULL;
next              661 source3/smbd/blocking.c 	for (blr = blocking_lock_queue; blr; blr = next) {
next              663 source3/smbd/blocking.c 		next = blr->next;
next              803 source3/smbd/blocking.c 	for (blr = blocking_lock_queue; blr; blr = blr->next) {
next               53 source3/smbd/conn.c 	for (conn=Connections;conn;conn=conn->next) {
next               70 source3/smbd/conn.c 	for (conn=Connections;conn;conn=conn->next,count++) {
next              164 source3/smbd/conn.c 	connection_struct *conn, *next;
next              166 source3/smbd/conn.c 	for (conn=Connections;conn;conn=next) {
next              167 source3/smbd/conn.c 		next=conn->next;
next              188 source3/smbd/conn.c 	for (conn=Connections;conn;conn=conn->next) {
next              231 source3/smbd/conn.c 	for (conn=Connections;conn;conn=conn->next) {
next              251 source3/smbd/conn.c 		thandle = handle->next;
next              259 source3/smbd/conn.c 	for (state = conn->pending_trans; state; state = state->next) {
next              306 source3/smbd/conn.c 	connection_struct *conn, *next;
next              317 source3/smbd/conn.c 	for (conn=Connections;conn;conn=next) {
next              318 source3/smbd/conn.c 		next=conn->next;
next               52 source3/smbd/dir.c 	struct dptr_struct *next, *prev;
next              152 source3/smbd/dir.c 	for(dptr = dirptrs; dptr && dptr->next; dptr = dptr->next)
next              180 source3/smbd/dir.c 	for(dptr = dirptrs; dptr; dptr = dptr->next) {
next              280 source3/smbd/dir.c 		struct dptr_struct *next;
next              281 source3/smbd/dir.c 		for(dptr = dirptrs; dptr; dptr = next) {
next              282 source3/smbd/dir.c 			next = dptr->next;
next              307 source3/smbd/dir.c 	struct dptr_struct *dptr, *next;
next              308 source3/smbd/dir.c 	for(dptr = dirptrs; dptr; dptr = next) {
next              309 source3/smbd/dir.c 		next = dptr->next;
next              322 source3/smbd/dir.c 	for(dptr = dirptrs; dptr; dptr = dptr->next) {
next              334 source3/smbd/dir.c 	struct dptr_struct *dptr, *next;
next              335 source3/smbd/dir.c 	for(dptr = dirptrs; dptr; dptr = next) {
next              336 source3/smbd/dir.c 		next = dptr->next;
next              355 source3/smbd/dir.c 	for(dptr = dirptrs; dptr && dptr->next; dptr = dptr->next)
next              128 source3/smbd/files.c 	files_struct *fsp, *next;
next              130 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=next) {
next              131 source3/smbd/files.c 		next = fsp->next;
next              144 source3/smbd/files.c 	files_struct *fsp, *next;
next              146 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=next) {
next              147 source3/smbd/files.c 		next = fsp->next;
next              197 source3/smbd/files.c 	files_struct *fsp, *next;
next              199 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=next) {
next              200 source3/smbd/files.c 		next=fsp->next;
next              216 source3/smbd/files.c 	struct files_struct *fsp, *next;
next              218 source3/smbd/files.c 	for (fsp = Files; fsp; fsp = next) {
next              220 source3/smbd/files.c 		next = fsp->next;
next              238 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next,count++) {
next              254 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next,count++) {
next              275 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next,count++) {
next              308 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next) {
next              333 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next) {
next              354 source3/smbd/files.c 	for (fsp = start_fsp->next;fsp;fsp=fsp->next) {
next              371 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next) {
next              398 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next) {
next              433 source3/smbd/files.c 	files_struct *fsp, *next;
next              435 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=next) {
next              436 source3/smbd/files.c 		next=fsp->next;
next              510 source3/smbd/files.c 	for (fsp=Files;fsp;fsp=fsp->next, count++) {
next              796 source3/smbd/ipc.c 	     state = state->next) {
next               26 source3/smbd/notify.c 	struct notify_change_request *prev, *next;
next               43 source3/smbd/notify.c 	struct notify_mid_map *prev, *next;
next              283 source3/smbd/notify.c 	for (req = fsp->notify->requests; req; req = req->next) {
next              306 source3/smbd/notify.c 	for (map = notify_changes_by_mid; map; map = map->next) {
next               81 source3/smbd/notify_inotify.c 	struct inotify_watch_context *next, *prev;
next              158 source3/smbd/notify_inotify.c 	struct inotify_watch_context *w, *next;
next              197 source3/smbd/notify_inotify.c 	for (w=in->watches;w;w=next) {
next              198 source3/smbd/notify_inotify.c 		next = w->next;
next              215 source3/smbd/notify_inotify.c 	for (w=in->watches;w;w=next) {
next              216 source3/smbd/notify_inotify.c 		next = w->next;
next              350 source3/smbd/notify_inotify.c 	for (w=in->watches;w;w=w->next) {
next               42 source3/smbd/notify_internal.c 	struct notify_list *next, *prev;
next              268 source3/smbd/notify_internal.c 	for (listel=notify->list;listel;listel=listel->next) {
next              445 source3/smbd/notify_internal.c 	for (listel=notify->list;listel;listel=listel->next) {
next              150 source3/smbd/ntquotas.c 	for (tmp_list=qt_list;tmp_list!=NULL;tmp_list=tmp_list->next) {
next             2222 source3/smbd/nttrans.c 				tmp_list=tmp_list->next,entry+=entry_len,qt_len+=entry_len) {
next             2849 source3/smbd/nttrans.c 	     state = state->next) {
next               47 source3/smbd/oplock_onefs.c 	struct onefs_callback_record *prev, *next;
next              104 source3/smbd/oplock_onefs.c 	for (rec = callback_recs; rec; rec = rec->next) {
next              127 source3/smbd/oplock_onefs.c 	for (rec = callback_recs; rec; rec = rec->next) {
next              165 source3/smbd/oplock_onefs.c 	for (rec = callback_recs; rec; rec = rec->next) {
next               37 source3/smbd/password.c 	for (usp=validated_users;usp;usp=usp->next,count++) {
next               28 source3/smbd/perfcount.c 	struct smb_perfcount_module *prev, *next;
next               54 source3/smbd/perfcount.c 		entry = entry->next;
next               44 source3/smbd/posix_acls.c 	struct canon_ace *next, *prev;
next              116 source3/smbd/posix_acls.c 	struct pai_entry *next, *prev;
next              185 source3/smbd/posix_acls.c 	for (ace_list = file_ace_list; ace_list; ace_list = ace_list->next) {
next              189 source3/smbd/posix_acls.c 	for (ace_list = dir_ace_list; ace_list; ace_list = ace_list->next) {
next              212 source3/smbd/posix_acls.c 	for (ace_list = file_ace_list; ace_list; ace_list = ace_list->next) {
next              222 source3/smbd/posix_acls.c 	for (ace_list = dir_ace_list; ace_list; ace_list = ace_list->next) {
next              283 source3/smbd/posix_acls.c 			paie_next = paie->next;
next              287 source3/smbd/posix_acls.c 			paie_next = paie->next;
next              307 source3/smbd/posix_acls.c 	for (paie = (default_ace ? pal->def_entry_list : pal->entry_list); paie; paie = paie->next) {
next              728 source3/smbd/posix_acls.c 	for (ace = l_head; ace; ace = ace->next)
next              740 source3/smbd/posix_acls.c 	canon_ace *list, *next;
next              742 source3/smbd/posix_acls.c 	for (list = l_head; list; list = next) {
next              743 source3/smbd/posix_acls.c 		next = list->next;
next              761 source3/smbd/posix_acls.c 	dst_ace->prev = dst_ace->next = NULL;
next              819 source3/smbd/posix_acls.c 		for (;ace_list; ace_list = ace_list->next, count++)
next              933 source3/smbd/posix_acls.c 		curr_ace_outer_next = curr_ace_outer->next; /* Save the link in case we delete. */
next              935 source3/smbd/posix_acls.c 		for (curr_ace = curr_ace_outer->next; curr_ace; curr_ace = curr_ace_next) {
next              937 source3/smbd/posix_acls.c 			curr_ace_next = curr_ace->next; /* Save the link in case of delete. */
next              953 source3/smbd/posix_acls.c 				curr_ace_outer_next = curr_ace_outer->next; /* We may have deleted the link. */
next              968 source3/smbd/posix_acls.c 		curr_ace_outer_next = curr_ace_outer->next; /* Save the link in case we delete. */
next              970 source3/smbd/posix_acls.c 		for (curr_ace = curr_ace_outer->next; curr_ace; curr_ace = curr_ace_next) {
next              972 source3/smbd/posix_acls.c 			curr_ace_next = curr_ace->next; /* Save the link in case of delete. */
next              998 source3/smbd/posix_acls.c 					curr_ace_outer_next = curr_ace_outer->next; /* We may have deleted the link. */
next             1333 source3/smbd/posix_acls.c 	for (pace = *pp_ace; pace; pace = pace->next) {
next             1383 source3/smbd/posix_acls.c 			for (pace_iter = *pp_ace; pace_iter; pace_iter = pace_iter->next) {
next             1474 source3/smbd/posix_acls.c 	for (i=0, current_ace = ace; i < entries; i++, current_ace = current_ace->next) {
next             1485 source3/smbd/posix_acls.c 	for (i=0, current_ace = ace; i < entries; i++, current_ace = current_ace->next) {
next             1962 source3/smbd/posix_acls.c 		curr_ace_next = curr_ace->next; /* So we can't lose the link. */
next             1992 source3/smbd/posix_acls.c 				prev_entry->next = NULL;
next             2000 source3/smbd/posix_acls.c 		for (allow_ace_p = curr_ace->next; allow_ace_p; allow_ace_p = allow_ace_p->next) {
next             2025 source3/smbd/posix_acls.c 		curr_ace_next = curr_ace->next; /* So we can't lose the link. */
next             2046 source3/smbd/posix_acls.c 		for (allow_ace_p = curr_ace->next; allow_ace_p; allow_ace_p = allow_ace_p->next) {
next             2076 source3/smbd/posix_acls.c 		curr_ace_next = curr_ace->next; /* So we can't lose the link. */
next             2084 source3/smbd/posix_acls.c 		for (allow_ace_p = curr_ace->next; allow_ace_p; allow_ace_p = allow_ace_p->next) {
next             2130 source3/smbd/posix_acls.c 		curr_ace_next = curr_ace->next; /* So we can't lose the link. */
next             2138 source3/smbd/posix_acls.c 		for (allow_ace_p = ace_list; allow_ace_p; allow_ace_p = allow_ace_p->next) {
next             2334 source3/smbd/posix_acls.c 	for (ace = l_head; ace; ace = ace->next) {
next             2501 source3/smbd/posix_acls.c 		next_ace = ace->next;
next             2611 source3/smbd/posix_acls.c 		for (i = 0, p_ace = the_ace; p_ace; p_ace = p_ace->next, i++ ) {
next             2616 source3/smbd/posix_acls.c 	for (i = 0, p_ace = the_ace; p_ace; p_ace = p_ace->next, i++ ) {
next             2830 source3/smbd/posix_acls.c 		list = list->next;
next             2875 source3/smbd/posix_acls.c 	for (ace_p = file_ace_list; ace_p; ace_p = ace_p->next) {
next             3178 source3/smbd/posix_acls.c 			for (ace = file_ace; ace != NULL; ace = ace->next) {
next             3199 source3/smbd/posix_acls.c 			for (ace = dir_ace; ace != NULL; ace = ace->next) {
next              514 source3/smbd/process.c 	for (pml = deferred_open_queue; pml; pml = pml->next) {
next              537 source3/smbd/process.c 	for (pml = deferred_open_queue; pml; pml = pml->next) {
next              588 source3/smbd/process.c 	for (pml = deferred_open_queue; pml; pml = pml->next) {
next              604 source3/smbd/process.c 	for (pml = deferred_open_queue; pml; pml = pml->next) {
next              847 source3/smbd/process.c 	for (; list != NULL; list = list->next) {
next              185 source3/smbd/server.c 	struct child_pid *prev, *next;
next              228 source3/smbd/server.c 	for (child = children; child != NULL; child = child->next) {
next              309 source3/smbd/server.c 	struct smbd_open_socket *prev, *next;
next              964 source3/smbd/sesssetup.c 	for (pad = pd_list; pad; pad = pad->next) {
next              337 source3/smbd/trans2.c 	for (p = pdata + 4; ea_list; ea_list = ea_list->next) {
next              392 source3/smbd/trans2.c 	for (; ea_list; ea_list = ea_list->next) {
next              412 source3/smbd/trans2.c 	for (;ea_list; ea_list = ea_list->next) {
next              610 source3/smbd/trans2.c 	for (listp = ealist; listp; listp = listp->next) {
next              632 source3/smbd/trans2.c 	for (nlistp = name_list; nlistp; nlistp = nlistp->next) {
next              633 source3/smbd/trans2.c 		for (flistp = file_list; flistp; flistp = flistp->next) {
next             7883 source3/smbd/trans2.c 	     state = state->next) {
next               36 source3/smbd/vfs.c 	struct vfs_init_function_entry *prev, *next;
next               51 source3/smbd/vfs.c 		entry = entry->next;
next              242 source3/smbd/vfs.c 	ext->next = fsp->vfs_extension;
next              255 source3/smbd/vfs.c 	     prev = curr, curr = curr->next) {
next              258 source3/smbd/vfs.c 			    prev->next = curr->next;
next              260 source3/smbd/vfs.c 			    fsp->vfs_extension = curr->next;
next              275 source3/smbd/vfs.c 	for (head = fsp->vfs_extension; head; head = head->next) {
next               56 source3/torture/masktest.c 			if ((*n == '.' && n[1] != '.') || ! *n) goto next;
next               66 source3/torture/masktest.c 			if (! *n) goto next;
next              105 source3/torture/masktest.c next:
next               31 source3/torture/vfstest.c 	struct cmd_list *prev, *next;
next               80 source3/torture/vfstest.c 		commands = commands->next;
next              143 source3/torture/vfstest.c 		for (tmp = cmd_list; tmp; tmp = tmp->next) {
next              168 source3/torture/vfstest.c 	for (tmp = cmd_list; tmp; tmp = tmp->next) {
next              353 source3/torture/vfstest.c 	for (temp_list = cmd_list; temp_list; temp_list = temp_list->next) {
next              121 source3/utils/net_ads_gpo.c 		for (gpo = gpo_list; gpo; gpo = gpo->next) {
next              166 source3/utils/net_ads_gpo.c 		for (gpo = read_list; gpo; gpo = gpo->next) {
next              195 source3/utils/net_usershare.c 	struct file_list *next, *prev;
next              303 source3/utils/net_usershare.c 	for (fl = flist; fl; fl = fl->next) {
next               34 source3/utils/smbtree.c         struct smb_name_list *prev, *next;
next              232 source3/utils/smbtree.c         for (wg = workgroups; wg; wg = wg->next) {
next              245 source3/utils/smbtree.c                 for (sv = servers; sv; sv = sv->next) {
next              259 source3/utils/smbtree.c                         for (sh = shares; sh; sh = sh->next) {
next               31 source3/web/statuspage.c 	PIDMAP	*next, *prev;
next               46 source3/web/statuspage.c 		PIDMAP *p, *next;
next               48 source3/web/statuspage.c 		for (p = pidmap; p != NULL; p = next) {
next               49 source3/web/statuspage.c 			next = p->next;
next               87 source3/web/statuspage.c 		for (map = pidmap; map != NULL; map = map->next) {
next               39 source3/winbindd/idmap.c 	struct idmap_backend *prev, *next;
next               50 source3/winbindd/idmap.c 	struct idmap_alloc_backend *prev, *next;
next               88 source3/winbindd/idmap.c 	for (b = backends; b; b = b->next) {
next              101 source3/winbindd/idmap.c 	for (b = alloc_backends; b; b = b->next) {
next              146 source3/winbindd/idmap.c 	for (entry = backends; entry != NULL; entry = entry->next) {
next               28 source3/winbindd/idmap_adex/domain_util.c 	struct dc_info *prev, *next;
next               64 source3/winbindd/idmap_adex/domain_util.c 		dc = dc->next;
next              102 source3/winbindd/idmap_adex/domain_util.c 		struct dc_info *p = dc->next;
next              199 source3/winbindd/idmap_adex/domain_util.c 		dc = dc->next;
next              172 source3/winbindd/idmap_adex/gc_util.c 		find_gc = find_gc->next;
next              196 source3/winbindd/idmap_adex/gc_util.c 		find_gc = find_gc->next;
next              284 source3/winbindd/idmap_adex/gc_util.c 		struct gc_info *p = gc->next;
next              476 source3/winbindd/idmap_adex/gc_util.c 			gc = gc->next;
next              491 source3/winbindd/idmap_adex/gc_util.c 		gc = gc->next;
next              121 source3/winbindd/idmap_adex/idmap_adex.h 	struct likewise_cell *prev, *next;
next              139 source3/winbindd/idmap_adex/idmap_adex.h 	struct gc_info *prev, *next;
next               62 source3/winbindd/idmap_adex/likewise_cell.c 		struct likewise_cell *q = p->next;
next              503 source3/winbindd/idmap_adex/provider_unified.c 			gc = gc->next;
next              512 source3/winbindd/idmap_adex/provider_unified.c 		gc = gc->next;
next              588 source3/winbindd/idmap_adex/provider_unified.c 		cell = cell->next;
next               37 source3/winbindd/nss_info.c 	for(entry = backends; entry; entry = entry->next) {
next              267 source3/winbindd/nss_info.c 	for ( p=nss_domain_list; p; p=p->next ) {
next              381 source3/winbindd/nss_info.c 		p = p->next;
next              111 source3/winbindd/winbindd.c 		for(tmp = winbindd_client_list(); tmp; tmp = tmp->next) {
next              586 source3/winbindd/winbindd.c 	for (match=fd_events; match; match=match->next ) {
next              938 source3/winbindd/winbindd.c 	for (state = winbindd_client_list(); state; state = state->next) {
next             1087 source3/winbindd/winbindd.c 	for (ev = fd_events; ev; ev = ev->next) {
next             1125 source3/winbindd/winbindd.c 		struct winbindd_fd_event *next = ev->next;
next             1135 source3/winbindd/winbindd.c 		ev = next;
next             1448 source3/winbindd/winbindd.c 			struct winbindd_cli_state *next = state->next;
next             1454 source3/winbindd/winbindd.c 			state = next;
next               43 source3/winbindd/winbindd.h 	struct winbindd_fd_event *next, *prev;
next               62 source3/winbindd/winbindd.h 	struct winbindd_cli_state *prev, *next;   /* Linked list pointers */
next               85 source3/winbindd/winbindd.h 	struct getent_state *prev, *next;
next              145 source3/winbindd/winbindd.h 	struct winbindd_child *next, *prev;
next              232 source3/winbindd/winbindd.h 	struct winbindd_domain *prev, *next;
next              374 source3/winbindd/winbindd.h 	struct WINBINDD_MEMORY_CREDS *next, *prev;
next              385 source3/winbindd/winbindd.h 	struct WINBINDD_CCACHE_ENTRY *next, *prev;
next             2513 source3/winbindd/winbindd_cache.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             2533 source3/winbindd/winbindd_cache.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             2939 source3/winbindd/winbindd_cache.c 	struct cred_list *prev, *next;
next             3004 source3/winbindd/winbindd_cache.c 	for (cred = wcache_cred_list; cred; cred = cred->next) {
next               99 source3/winbindd/winbindd_cm.c 	for (domain = domain_list(); domain; domain = domain->next) {
next              138 source3/winbindd/winbindd_cm.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             1581 source3/winbindd/winbindd_cm.c 	for (domain = domain_list(); domain; domain = domain->next) {
next               57 source3/winbindd/winbindd_cred_cache.c 	for (entry = ccache_list; entry; entry = entry->next) {
next               74 source3/winbindd/winbindd_cred_cache.c 	for (entry = ccache_list; entry; entry = entry->next) {
next               82 source3/winbindd/winbindd_cred_cache.c 	struct WINBINDD_CCACHE_ENTRY *cur, *next;
next               84 source3/winbindd/winbindd_cred_cache.c 	for (cur = ccache_list; cur; cur = next) {
next               85 source3/winbindd/winbindd_cred_cache.c 		next = cur->next;
next              410 source3/winbindd/winbindd_cred_cache.c 	for (cur = ccache_list; cur; cur = cur->next) {
next              752 source3/winbindd/winbindd_cred_cache.c 	for (p = memory_creds_list; p; p = p->next) {
next               95 source3/winbindd/winbindd_dual.c 	struct winbindd_async_request *next, *prev;
next              320 source3/winbindd/winbindd_dual.c 			struct winbindd_async_request *next = request->next;
next              323 source3/winbindd/winbindd_dual.c 			request = next;
next              488 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
next              551 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
next              588 source3/winbindd/winbindd_dual.c 	for (domain = domain_list(); domain; domain = domain->next) {
next              596 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
next              646 source3/winbindd/winbindd_dual.c 	for (domain = domain_list(); domain; domain = domain->next) {
next              672 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
next              707 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
next              733 source3/winbindd/winbindd_dual.c 	for (child = children; child != NULL; child = child->next) {
next              802 source3/winbindd/winbindd_dual.c 	for (dom = domain_list(); dom; dom=dom->next) {
next             1003 source3/winbindd/winbindd_dual.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             1050 source3/winbindd/winbindd_dual.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             1083 source3/winbindd/winbindd_dual.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             1194 source3/winbindd/winbindd_dual.c 	for (domain = domain_list(); domain; domain = domain->next) {
next             1204 source3/winbindd/winbindd_dual.c 	for (cl = children; cl != NULL; cl = cl->next) {
next             1207 source3/winbindd/winbindd_dual.c 		for (request = cl->requests; request; request = request->next) {
next             1273 source3/winbindd/winbindd_dual.c 		child->next = child->prev = NULL;
next             1059 source3/winbindd/winbindd_group.c 	for (domain = domain_list(); domain != NULL; domain = domain->next) {
next             1327 source3/winbindd/winbindd_group.c 				next_ent = ent->next;
next              420 source3/winbindd/winbindd_idmap.c 	for (domain = domain_list(); domain != NULL; domain = domain->next) {
next              488 source3/winbindd/winbindd_idmap.c 	for (domain = domain_list(); domain != NULL; domain = domain->next) {
next              152 source3/winbindd/winbindd_misc.c 	for (domain = domain_list(); domain; domain = domain->next) {
next              170 source3/winbindd/winbindd_misc.c 	for (domain = domain_list(); domain; domain = domain->next) {
next              603 source3/winbindd/winbindd_misc.c 	state->domain = state->domain->next;
next               35 source3/winbindd/winbindd_ndr.c 	ndr_print_ptr(ndr, "next", r->next);
next              603 source3/winbindd/winbindd_user.c 	for(domain = domain_list(); domain != NULL; domain = domain->next) {
next              818 source3/winbindd/winbindd_user.c 				next_ent = ent->next;
next               74 source3/winbindd/winbindd_util.c 		struct winbindd_domain *next = domain->next;
next               78 source3/winbindd/winbindd_util.c 		domain = next;
next              132 source3/winbindd/winbindd_util.c 	for (domain = _domain_list; domain; domain = domain->next) {
next              868 source3/winbindd/winbindd_util.c 	for (domain = domain_list(); domain != NULL; domain = domain->next) {
next              904 source3/winbindd/winbindd_util.c 	for (domain = domain_list(); domain != NULL; domain = domain->next) {
next              937 source3/winbindd/winbindd_util.c 	for (domain = domain_list(); domain != NULL; domain = domain->next) {
next             1095 source3/winbindd/winbindd_util.c 		struct getent_state *next = temp->next;
next             1103 source3/winbindd/winbindd_util.c 		temp = next;
next             1359 source3/winbindd/winbindd_util.c 		struct winbindd_cli_state *next;
next             1361 source3/winbindd/winbindd_util.c 		next = cl->next;
next             1363 source3/winbindd/winbindd_util.c 		cl = next;
next              157 source4/auth/auth.h 	struct auth_method_context *prev, *next;
next               66 source4/auth/ntlm/auth.c 	for (method = auth_ctx->methods; method; method = method->next) {
next              118 source4/auth/ntlm/auth.c 	for (method = auth_ctx->methods; method; method = method->next) {
next              302 source4/auth/ntlm/auth.c 	for (method = auth_ctx->methods; method; method = method->next) {
next             1246 source4/client/client.c 	struct file_list *prev, *next;
next             1279 source4/client/client.c 		list = list->next;
next             1424 source4/client/client.c 		     temp_list = temp_list->next) {
next              473 source4/client/tree.c     i = i->next;
next               61 source4/dsdb/repl/drepl_out_pull.c 	for (cur = p->sources; cur; cur = cur->next) {
next               74 source4/dsdb/repl/drepl_out_pull.c 	for (p = s->partitions; p; p = p->next) {
next              111 source4/dsdb/repl/drepl_partitions.c 	for (cur = s->connections; cur; cur = cur->next) {		
next              264 source4/dsdb/repl/drepl_partitions.c 	for (p = s->partitions; p; p = p->next) {
next               43 source4/dsdb/repl/drepl_service.h 	struct dreplsrv_out_connection *prev, *next;
next               57 source4/dsdb/repl/drepl_service.h 	struct dreplsrv_partition_source_dsa *prev, *next;
next               77 source4/dsdb/repl/drepl_service.h 	struct dreplsrv_partition *prev, *next;
next              101 source4/dsdb/repl/drepl_service.h 	struct dreplsrv_out_operation *prev, *next;
next              156 source4/dsdb/samdb/ldb_modules/anr.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next              613 source4/dsdb/samdb/ldb_modules/extended_dn_out.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next               49 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 	struct extended_dn_replace_list *next;
next              131 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 		if (os->next) {
next              132 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			struct extended_dn_replace_list *next;
next              134 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			next = os->next;
next              138 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			os = next;
next              139 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			return ldb_next_request(os->ac->module, next->search_req);
next              182 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 		if (os->next) {
next              183 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			struct extended_dn_replace_list *next;
next              185 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			next = os->next;
next              189 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			os = next;
next              190 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 			return ldb_next_request(os->ac->module, next->search_req);
next              264 source4/dsdb/samdb/ldb_modules/extended_dn_store.c 		ac->cur->next = os;
next               37 source4/dsdb/samdb/ldb_modules/linked_attributes.c 	struct la_op_store *next;
next               66 source4/dsdb/samdb/ldb_modules/local_password.c 	struct lpdb_reply *next;
next              869 source4/dsdb/samdb/ldb_modules/local_password.c 		if (lr->next->remote->type == LDB_REPLY_DONE) {
next              872 source4/dsdb/samdb/ldb_modules/local_password.c 						lr->next->remote->controls,
next              873 source4/dsdb/samdb/ldb_modules/local_password.c 						lr->next->remote->response,
next              874 source4/dsdb/samdb/ldb_modules/local_password.c 						lr->next->remote->error);
next              877 source4/dsdb/samdb/ldb_modules/local_password.c 			ac->current = lr->next;
next              967 source4/dsdb/samdb/ldb_modules/local_password.c 			ac->current->next = lr;
next              994 source4/dsdb/samdb/ldb_modules/local_password.c 		ac->current->next = lr;
next               57 source4/dsdb/samdb/ldb_modules/objectclass.c 	struct class_list *prev, *next;
next              159 source4/dsdb/samdb/ldb_modules/objectclass.c 	for (current = unsorted; schema && current; current = current->next) {
next              160 source4/dsdb/samdb/ldb_modules/objectclass.c 		for (poss_parent = unsorted; poss_parent; poss_parent = poss_parent->next) {
next              183 source4/dsdb/samdb/ldb_modules/objectclass.c 		for (current = parent_class; schema && unsorted && current; current = current->next) {
next              186 source4/dsdb/samdb/ldb_modules/objectclass.c 				struct class_list *next;
next              189 source4/dsdb/samdb/ldb_modules/objectclass.c 				next = poss_subclass->next;
next              197 source4/dsdb/samdb/ldb_modules/objectclass.c 				poss_subclass = next;
next              556 source4/dsdb/samdb/ldb_modules/objectclass.c 		for (current = sorted; current; current = current->next) {
next              572 source4/dsdb/samdb/ldb_modules/objectclass.c 			if (!current->next) {
next              761 source4/dsdb/samdb/ldb_modules/objectclass.c 		for (current = sorted; current; current = current->next) {
next              938 source4/dsdb/samdb/ldb_modules/objectclass.c 	for (current = sorted; current; current = current->next) {
next               78 source4/dsdb/samdb/ldb_modules/partition.c         while (module && module->ops->op == NULL) module = module->next; \
next              343 source4/dsdb/samdb/ldb_modules/partition.c 		ac->part_req[ac->num_requests].module = ac->module->next;
next              635 source4/dsdb/samdb/ldb_modules/partition.c 		struct ldb_module *next = data->partitions[i]->module;
next              636 source4/dsdb/samdb/ldb_modules/partition.c 		PARTITION_FIND_OP(next, start_transaction);
next              638 source4/dsdb/samdb/ldb_modules/partition.c 		ret = next->ops->start_transaction(next);
next              642 source4/dsdb/samdb/ldb_modules/partition.c 				next = data->partitions[i]->module;
next              643 source4/dsdb/samdb/ldb_modules/partition.c 				PARTITION_FIND_OP(next, del_transaction);
next              645 source4/dsdb/samdb/ldb_modules/partition.c 				next->ops->del_transaction(next);
next              669 source4/dsdb/samdb/ldb_modules/partition.c 		struct ldb_module *next = data->partitions[i]->module;
next              670 source4/dsdb/samdb/ldb_modules/partition.c 		PARTITION_FIND_OP(next, end_transaction);
next              672 source4/dsdb/samdb/ldb_modules/partition.c 		ret = next->ops->end_transaction(next);
next              676 source4/dsdb/samdb/ldb_modules/partition.c 				next = data->partitions[i]->module;
next              677 source4/dsdb/samdb/ldb_modules/partition.c 				PARTITION_FIND_OP(next, del_transaction);
next              679 source4/dsdb/samdb/ldb_modules/partition.c 				next->ops->del_transaction(next);
next              704 source4/dsdb/samdb/ldb_modules/partition.c 		struct ldb_module *next = data->partitions[i]->module;
next              705 source4/dsdb/samdb/ldb_modules/partition.c 		PARTITION_FIND_OP(next, del_transaction);
next              707 source4/dsdb/samdb/ldb_modules/partition.c 		ret = next->ops->del_transaction(next);
next              135 source4/dsdb/samdb/ldb_modules/rootdse.c 		for (cur = schema->attributes; cur; cur = cur->next) {
next              149 source4/dsdb/samdb/ldb_modules/rootdse.c 		for (cur = schema->classes; cur; cur = cur->next) {
next               49 source4/dsdb/samdb/ldb_modules/samldb.c 	struct samldb_step *next;
next              113 source4/dsdb/samdb/ldb_modules/samldb.c 		ac->curstep->next = step;
next              134 source4/dsdb/samdb/ldb_modules/samldb.c 	if (ac->curstep->next) {
next              135 source4/dsdb/samdb/ldb_modules/samldb.c 		ac->curstep = ac->curstep->next;
next              297 source4/dsdb/samdb/ldb_modules/schema_fsmo.c 	for (sclass = schema->classes; sclass; sclass = sclass->next) {
next              311 source4/dsdb/samdb/ldb_modules/schema_fsmo.c 	for (attribute = schema->attributes; attribute; attribute = attribute->next) {
next              326 source4/dsdb/samdb/ldb_modules/schema_fsmo.c 	for (sclass = schema->classes; sclass; sclass = sclass->next) {
next              349 source4/dsdb/samdb/ldb_modules/schema_fsmo.c 	for (attribute = schema->attributes; attribute; attribute = attribute->next) {
next              372 source4/dsdb/samdb/ldb_modules/schema_fsmo.c 	for (sclass = schema->classes; sclass; sclass = sclass->next) {
next               34 source4/dsdb/samdb/ldb_modules/subtree_rename.c 	struct subren_msg_store *next;
next              132 source4/dsdb/samdb/ldb_modules/subtree_rename.c 	ac->current = ac->current->next;
next              170 source4/dsdb/samdb/ldb_modules/subtree_rename.c 		ac->current->next = store;
next               39 source4/dsdb/samdb/ldb_modules/update_keytab.c 	struct dn_list *prev, *next;
next              390 source4/dsdb/samdb/ldb_modules/update_keytab.c 	for (p=data->changed_dns; p; p = p->next) {
next               55 source4/dsdb/schema/schema.h 	struct dsdb_attribute *prev, *next;
next               97 source4/dsdb/schema/schema.h 	struct dsdb_class *prev, *next;
next               38 source4/dsdb/schema/schema_query.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next               55 source4/dsdb/schema/schema_query.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next               72 source4/dsdb/schema/schema_query.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next               87 source4/dsdb/schema/schema_query.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next              108 source4/dsdb/schema/schema_query.c 	for (cur = schema->classes; cur; cur = cur->next) {
next              125 source4/dsdb/schema/schema_query.c 	for (cur = schema->classes; cur; cur = cur->next) {
next              142 source4/dsdb/schema/schema_query.c 	for (cur = schema->classes; cur; cur = cur->next) {
next              159 source4/dsdb/schema/schema_query.c 	for (cur = schema->classes; cur; cur = cur->next) {
next              200 source4/dsdb/schema/schema_query.c 	for (cur = schema->attributes; cur; cur = cur->next) {
next               67 source4/dsdb/schema/schema_set.c 	for (attr = schema->attributes; attr; attr = attr->next) {
next               52 source4/heimdal/lib/asn1/gen.c     struct import *next;
next               63 source4/heimdal/lib/asn1/gen.c     tmp->next   = imports;
next              302 source4/heimdal/lib/asn1/gen.c 	for (o = s->value->u.objectidentifiervalue; o != NULL; o = o->next)
next              312 source4/heimdal/lib/asn1/gen.c 	for (o = s->value->u.objectidentifiervalue; o != NULL; o = o->next)
next               79 source4/heimdal/lib/asn1/hash.c 	 hptr = hptr->next)
next              116 source4/heimdal/lib/asn1/hash.c 	h->next = *tabptr;
next              119 source4/heimdal/lib/asn1/hash.c 	if (h->next)
next              120 source4/heimdal/lib/asn1/hash.c 	    h->next->prev = &h->next;
next              139 source4/heimdal/lib/asn1/hash.c 	if ((*(h->prev) = h->next))
next              140 source4/heimdal/lib/asn1/hash.c 	    h->next->prev = h->prev;
next              158 source4/heimdal/lib/asn1/hash.c 	for (g = *h; g; g = g->next)
next               42 source4/heimdal/lib/asn1/hash.h      struct hashentry *next;
next              276 source4/heimdal/lib/asn1/parse.c     struct string_list *next;
next             1790 source4/heimdal/lib/asn1/parse.c 		    for(sl = (yyvsp[(1) - (4)].sl); sl != NULL; sl = sl->next) {
next             1803 source4/heimdal/lib/asn1/parse.c 		    (yyval.sl)->next = (yyvsp[(3) - (3)].sl);
next             1812 source4/heimdal/lib/asn1/parse.c 		    (yyval.sl)->next = NULL;
next             2769 source4/heimdal/lib/asn1/parse.c     s->next = NULL;
next             2778 source4/heimdal/lib/asn1/parse.c     while (o->next)
next             2779 source4/heimdal/lib/asn1/parse.c 	o = o->next;
next             2780 source4/heimdal/lib/asn1/parse.c     o->next = tail;
next               60 source4/heimdal/lib/asn1/parse.y     struct string_list *next;
next              272 source4/heimdal/lib/asn1/parse.y 		    for(sl = $1; sl != NULL; sl = sl->next) {
next              292 source4/heimdal/lib/asn1/parse.y 		    $$->next = $3;
next              298 source4/heimdal/lib/asn1/parse.y 		    $$->next = NULL;
next              954 source4/heimdal/lib/asn1/parse.y     s->next = NULL;
next              963 source4/heimdal/lib/asn1/parse.y     while (o->next)
next              964 source4/heimdal/lib/asn1/parse.y 	o = o->next;
next              965 source4/heimdal/lib/asn1/parse.y     o->next = tail;
next              144 source4/heimdal/lib/asn1/symbol.h     struct objid *next;
next              165 source4/heimdal/lib/com_err/com_err.c     for (et = _et_list; et; et = et->next) {
next              170 source4/heimdal/lib/com_err/com_err.c     new_table->next = _et_list;
next               49 source4/heimdal/lib/com_err/com_right.h     struct et_list *next;
next               90 source4/heimdal/lib/com_err/compile_et.c     for(ec = codes, n = 0; ec; ec = ec->next, n++) {
next              161 source4/heimdal/lib/com_err/compile_et.c     for(ec = codes; ec; ec = ec->next) {
next              163 source4/heimdal/lib/com_err/compile_et.c 		(ec->next != NULL) ? "," : "");
next               63 source4/heimdal/lib/com_err/compile_et.h     struct error_code *next, **tail;
next               72 source4/heimdal/lib/com_err/compile_et.h 	(L)->tail = &(V)->next;			\
next               73 source4/heimdal/lib/com_err/compile_et.h 	(L)->next = NULL;			\
next               76 source4/heimdal/lib/com_err/compile_et.h 	(L)->tail = &(V)->next;			\
next               53 source4/heimdal/lib/com_err/error.c     for (p = list; p; p = p->next) {
next               80 source4/heimdal/lib/com_err/error.c     for (end = list, et = *list; et; end = &et->next, et = et->next)
next               91 source4/heimdal/lib/com_err/error.c     et->next = NULL;
next              101 source4/heimdal/lib/com_err/error.c 	et = et->next;
next             1445 source4/heimdal/lib/com_err/parse.c 		    ec->next = NULL;
next              123 source4/heimdal/lib/com_err/parse.y 		    ec->next = NULL;
next               46 source4/heimdal/lib/hdb/dbinfo.c     struct hdb_dbinfo *next;
next              116 source4/heimdal/lib/hdb/dbinfo.c 	    dt = &di->next;
next              119 source4/heimdal/lib/hdb/dbinfo.c 	for ( ; db_binding != NULL; db_binding = db_binding->next) {
next              136 source4/heimdal/lib/hdb/dbinfo.c 	    dt = &di->next;
next              148 source4/heimdal/lib/hdb/dbinfo.c     for(di = databases; di; di = di->next) {
next              179 source4/heimdal/lib/hdb/dbinfo.c 	return dbprevp->next;
next              230 source4/heimdal/lib/hdb/dbinfo.c 	ndi = di->next;
next               44 source4/heimdal/lib/hdb/mkey.c     struct hdb_master_key_data *next;
next               56 source4/heimdal/lib/hdb/mkey.c 	mkey = mkey->next;
next              101 source4/heimdal/lib/hdb/mkey.c     for(p = *inout; p; p = p->next)
next              107 source4/heimdal/lib/hdb/mkey.c     p->next = *inout;
next              139 source4/heimdal/lib/hdb/mkey.c 	p->next = *mkey;
next              354 source4/heimdal/lib/hdb/mkey.c     for(p = mkey; p; p = p->next) {
next              375 source4/heimdal/lib/hdb/mkey.c 	mkey = mkey->next;
next               69 source4/heimdal/lib/hx509/env.c     n->next = NULL;
next               85 source4/heimdal/lib/hx509/env.c 	while (e->next)
next               86 source4/heimdal/lib/hx509/env.c 	    e = e->next;
next               87 source4/heimdal/lib/hx509/env.c 	e->next = n;
next              120 source4/heimdal/lib/hx509/env.c     n->next = NULL;
next              131 source4/heimdal/lib/hx509/env.c 	while (e->next)
next              132 source4/heimdal/lib/hx509/env.c 	    e = e->next;
next              133 source4/heimdal/lib/hx509/env.c 	e->next = n;
next              162 source4/heimdal/lib/hx509/env.c 	env = env->next;
next              185 source4/heimdal/lib/hx509/env.c 	env = env->next;
next              210 source4/heimdal/lib/hx509/env.c 	env = env->next;
next              219 source4/heimdal/lib/hx509/env.c 	hx509_env next = b->next;
next              228 source4/heimdal/lib/hx509/env.c 	b = next;
next               44 source4/heimdal/lib/hx509/error.c     hx509_error next;
next               53 source4/heimdal/lib/hx509/error.c 	hx509_error m2 = msg->next;
next              109 source4/heimdal/lib/hx509/error.c 	msg->next = context->error;
next              174 source4/heimdal/lib/hx509/error.c     for (msg = context->error; msg; msg = msg->next)
next              176 source4/heimdal/lib/hx509/error.c 			     msg->next != NULL ? "; " : "");
next               91 source4/heimdal/lib/hx509/file.c 		headers->next ? "" : "\n");
next               92 source4/heimdal/lib/hx509/file.c 	headers = headers->next;
next              144 source4/heimdal/lib/hx509/file.c     h->next = *headers;
next              156 source4/heimdal/lib/hx509/file.c 	headers = headers->next;
next              173 source4/heimdal/lib/hx509/file.c 	h = h->next;
next               98 source4/heimdal/lib/hx509/hx509.h     struct hx509_pem_header *next;
next              202 source4/heimdal/lib/hx509/hx_locl.h     struct hx509_env_data *next;
next             1474 source4/heimdal/lib/hx509/revoke.c 	time_t next = crl->expire;
next             1475 source4/heimdal/lib/hx509/revoke.c 	if (next == 0)
next             1476 source4/heimdal/lib/hx509/revoke.c 	    next = time(NULL) + 24 * 3600 * 365;
next             1479 source4/heimdal/lib/hx509/revoke.c 	c.tbsCertList.nextUpdate->u.generalTime = next;
next              144 source4/heimdal/lib/hx509/sel.c 		subenv = subenv->next;
next              562 source4/heimdal/lib/krb5/acache.c 	    error = (*iter->func->next)(iter, &ccred);
next              718 source4/heimdal/lib/krb5/acache.c 	error = (*iter->func->next)(iter, &cred);
next              786 source4/heimdal/lib/krb5/acache.c 	error = (*iter->func->next)(iter, &ccred);
next              791 source4/heimdal/lib/krb5/acache.c 	    goto next;
next              796 source4/heimdal/lib/krb5/acache.c 	    goto next;
next              799 source4/heimdal/lib/krb5/acache.c 	    goto next;
next              803 source4/heimdal/lib/krb5/acache.c     next:
next              882 source4/heimdal/lib/krb5/acache.c     error = (*iter->iter->func->next)(iter->iter, &cache);
next               87 source4/heimdal/lib/krb5/config_file.c     for(q = parent; *q != NULL; q = &(*q)->next)
next              357 source4/heimdal/lib/krb5/config_file.c 	next_b = b->next;
next              396 source4/heimdal/lib/krb5/config_file.c 	    previous->next = d;
next              399 source4/heimdal/lib/krb5/config_file.c 	c = c->next;
next              440 source4/heimdal/lib/krb5/config_file.c 	b = b->next;
next              472 source4/heimdal/lib/krb5/config_file.c     for (b = (*pointer)->next; b != NULL; b = b->next) {
next               47 source4/heimdal/lib/krb5/config_file_netinfo.c     krb5_config_section **next = NULL;
next               60 source4/heimdal/lib/krb5/config_file_netinfo.c 	    b->next = NULL;
next               65 source4/heimdal/lib/krb5/config_file_netinfo.c 	    if (next == NULL) {
next               68 source4/heimdal/lib/krb5/config_file_netinfo.c 		*next = b;
next               70 source4/heimdal/lib/krb5/config_file_netinfo.c 	    next = &b->next;
next               81 source4/heimdal/lib/krb5/config_file_netinfo.c     krb5_config_section **next;
next              105 source4/heimdal/lib/krb5/config_file_netinfo.c 	    *next = b;
next              110 source4/heimdal/lib/krb5/config_file_netinfo.c 	b->next = NULL;
next              122 source4/heimdal/lib/krb5/config_file_netinfo.c 	nis = ni_proplist2binding(&pl, b->u.list == NULL ? &b->u.list : &b->u.list->next);
next              127 source4/heimdal/lib/krb5/config_file_netinfo.c 	next = &b->next;
next               60 source4/heimdal/lib/krb5/get_host_realm.c     for(n = 0, rr = head; rr; rr = rr->next)
next               74 source4/heimdal/lib/krb5/get_host_realm.c     for (i = 0, rr = head; rr; rr = rr->next) {
next               41 source4/heimdal/lib/krb5/keytab_any.c     struct any_data *next;
next               47 source4/heimdal/lib/krb5/keytab_any.c     struct any_data *next;
next               49 source4/heimdal/lib/krb5/keytab_any.c     for (; a != NULL; a = next) {
next               50 source4/heimdal/lib/krb5/keytab_any.c 	next = a->next;
next               82 source4/heimdal/lib/krb5/keytab_any.c 	    prev->next = a;
next               83 source4/heimdal/lib/krb5/keytab_any.c 	a->next = NULL;
next              141 source4/heimdal/lib/krb5/keytab_any.c     for (ed->a = a; ed->a != NULL; ed->a = ed->a->next) {
next              175 source4/heimdal/lib/krb5/keytab_any.c 	while ((ed->a = ed->a->next) != NULL) {
next              218 source4/heimdal/lib/krb5/keytab_any.c 	a = a->next;
next              244 source4/heimdal/lib/krb5/keytab_any.c 	a = a->next;
next               45 source4/heimdal/lib/krb5/keytab_memory.c     struct mkt_data *next;
next               62 source4/heimdal/lib/krb5/keytab_memory.c     for (d = mkt_head; d != NULL; d = d->next)
next               93 source4/heimdal/lib/krb5/keytab_memory.c     d->next = mkt_head;
next              115 source4/heimdal/lib/krb5/keytab_memory.c     for (dp = &mkt_head; *dp != NULL; dp = &(*dp)->next) {
next              117 source4/heimdal/lib/krb5/keytab_memory.c 	    *dp = d->next;
next              437 source4/heimdal/lib/krb5/krb5.h     struct krb5_config_binding *next;
next              717 source4/heimdal/lib/krb5/krb5.h     struct krb5_krbhst_info *next;
next              162 source4/heimdal/lib/krb5/krb5_ccapi.h     cc_int32 (*next)(cc_credentials_iterator_t, cc_credentials_t*);
next              171 source4/heimdal/lib/krb5/krb5_ccapi.h     cc_int32 (*next)(cc_ccache_iterator_t, cc_ccache_t*);
next               94 source4/heimdal/lib/krb5/krbhst.c     for(num_srv = 0, rr = r->head; rr; rr = rr->next)
next              108 source4/heimdal/lib/krb5/krbhst.c     for(num_srv = 0, rr = r->head; rr; rr = rr->next)
next              263 source4/heimdal/lib/krb5/krbhst.c     (*to)->next = NULL;
next              274 source4/heimdal/lib/krb5/krbhst.c     for(h = kd->hosts; h; h = h->next)
next              282 source4/heimdal/lib/krb5/krbhst.c     kd->end = &host->next;
next              369 source4/heimdal/lib/krb5/krbhst.c 	kd->index = &(*kd->index)->next;
next              818 source4/heimdal/lib/krb5/krbhst.c     krb5_error_code (*next)(krb5_context, struct krb5_krbhst_data *,
next              824 source4/heimdal/lib/krb5/krbhst.c 	next = kdc_get_next;
next              828 source4/heimdal/lib/krb5/krbhst.c 	next = admin_get_next;
next              833 source4/heimdal/lib/krb5/krbhst.c 	next = kpasswd_get_next;
next              838 source4/heimdal/lib/krb5/krbhst.c 	next = krb524_get_next;
next              848 source4/heimdal/lib/krb5/krbhst.c     kd->get_next = next;
next              898 source4/heimdal/lib/krb5/krbhst.c     krb5_krbhst_info *h, *next;
next              903 source4/heimdal/lib/krb5/krbhst.c     for (h = handle->hosts; h != NULL; h = next) {
next              904 source4/heimdal/lib/krb5/krbhst.c 	next = h->next;
next               45 source4/heimdal/lib/krb5/mcache.c 	struct link *next;
next               47 source4/heimdal/lib/krb5/mcache.c     struct krb5_mcache *next;
next               83 source4/heimdal/lib/krb5/mcache.c     for (m_c = mcc_head; m_c != NULL; m_c = m_c->next)
next               98 source4/heimdal/lib/krb5/mcache.c     m->next = mcc_head;
next              110 source4/heimdal/lib/krb5/mcache.c     for (m = mcc_head; m != NULL; m = m->next)
next              204 source4/heimdal/lib/krb5/mcache.c 	for(n = &mcc_head; n && *n; n = &(*n)->next) {
next              206 source4/heimdal/lib/krb5/mcache.c 		*n = m->next;
next              223 source4/heimdal/lib/krb5/mcache.c 	    l = l->next;
next              249 source4/heimdal/lib/krb5/mcache.c     l->next = m->creds;
next              254 source4/heimdal/lib/krb5/mcache.c 	m->creds = l->next;
next              304 source4/heimdal/lib/krb5/mcache.c 	*cursor = l->next;
next              330 source4/heimdal/lib/krb5/mcache.c 	    *q = p->next;
next              335 source4/heimdal/lib/krb5/mcache.c 	    q = &p->next;
next              386 source4/heimdal/lib/krb5/mcache.c     if (m->next)
next              387 source4/heimdal/lib/krb5/mcache.c 	m->next->refcnt++;
next              388 source4/heimdal/lib/krb5/mcache.c     iter->cache = m->next;
next              424 source4/heimdal/lib/krb5/mcache.c     for(n = &mcc_head; n && *n; n = &(*n)->next) {
next              426 source4/heimdal/lib/krb5/mcache.c 	    *n = mfrom->next;
next               44 source4/heimdal/lib/krb5/plugin.c     struct krb5_plugin *next;
next               51 source4/heimdal/lib/krb5/plugin.c     struct plugin *next;
next               72 source4/heimdal/lib/krb5/plugin.c     return p->next;
next              141 source4/heimdal/lib/krb5/plugin.c     for (e = registered; e != NULL; e = e->next)
next              160 source4/heimdal/lib/krb5/plugin.c     e->next = registered;
next              186 source4/heimdal/lib/krb5/plugin.c     for (p = registered; p != NULL; p = p->next) {
next              199 source4/heimdal/lib/krb5/plugin.c 	e->next = *list;
next              232 source4/heimdal/lib/krb5/plugin.c 	    e->next = *list;
next              262 source4/heimdal/lib/krb5/plugin.c     struct krb5_plugin *next;
next              264 source4/heimdal/lib/krb5/plugin.c 	next = list->next;
next              268 source4/heimdal/lib/krb5/plugin.c 	list = next;
next             1143 source4/heimdal/lib/krb5/principal.c 	l = l->next;
next               48 source4/heimdal/lib/krb5/transited.c     struct tr_realm *next;
next               57 source4/heimdal/lib/krb5/transited.c 	r = r->next;
next               68 source4/heimdal/lib/krb5/transited.c     struct tr_realm *path = r->next;
next               95 source4/heimdal/lib/krb5/transited.c 	    tmp->next = path;
next               99 source4/heimdal/lib/krb5/transited.c 		r->next = path; /* XXX */
next              110 source4/heimdal/lib/krb5/transited.c 		r->next = path; /* XXX */
next              121 source4/heimdal/lib/krb5/transited.c 	    tmp->next = path;
next              125 source4/heimdal/lib/krb5/transited.c 		r->next = path; /* XXX */
next              138 source4/heimdal/lib/krb5/transited.c     r->next = path;
next              152 source4/heimdal/lib/krb5/transited.c     for(r = realms; r; r = r->next){
next              157 source4/heimdal/lib/krb5/transited.c 	    while(r->next && r->next->realm[0] == '\0')
next              158 source4/heimdal/lib/krb5/transited.c 		r = r->next;
next              159 source4/heimdal/lib/krb5/transited.c 	    if(r->next)
next              160 source4/heimdal/lib/krb5/transited.c 		next_realm = r->next->realm;
next              180 source4/heimdal/lib/krb5/transited.c     for(r = realms; r; r = r->next){
next              263 source4/heimdal/lib/krb5/transited.c 	r->next = NULL;
next              267 source4/heimdal/lib/krb5/transited.c     while(p->next) p = p->next;
next              268 source4/heimdal/lib/krb5/transited.c     p->next = r;
next              369 source4/heimdal/lib/krb5/transited.c 	    *q = p->next;
next              373 source4/heimdal/lib/krb5/transited.c 	    q = &p->next;
next              374 source4/heimdal/lib/krb5/transited.c 	    p = p->next;
next              389 source4/heimdal/lib/krb5/transited.c 	    p = r->next;
next               77 source4/heimdal/lib/roken/parse_units.c 	char *next;
next               86 source4/heimdal/lib/roken/parse_units.c 	val = strtod (p, &next); /* strtol(p, &next, 0); */
next               87 source4/heimdal/lib/roken/parse_units.c 	if (p == next) {
next               93 source4/heimdal/lib/roken/parse_units.c 	p = next;
next              281 source4/heimdal/lib/roken/parse_units.c 	const struct units *next;
next              283 source4/heimdal/lib/roken/parse_units.c 	for (next = u + 1; next->name && next->mult == u->mult; ++next)
next              286 source4/heimdal/lib/roken/parse_units.c 	if (next->name) {
next              287 source4/heimdal/lib/roken/parse_units.c 	    for (u2 = next;
next              298 source4/heimdal/lib/roken/parse_units.c 	u = next;
next              120 source4/heimdal/lib/roken/resolve.c 	rr = rr->next;
next              476 source4/heimdal/lib/roken/resolve.c 	rr = &(*rr)->next;
next              483 source4/heimdal/lib/roken/resolve.c 	rr = &(*rr)->next;
next              490 source4/heimdal/lib/roken/resolve.c 	rr = &(*rr)->next;
next              618 source4/heimdal/lib/roken/resolve.c     for(rr = r->head; rr; rr = rr->next)
next              634 source4/heimdal/lib/roken/resolve.c 	    *headp = (*headp)->next;
next              635 source4/heimdal/lib/roken/resolve.c 	    (*ss)->next = NULL;
next              638 source4/heimdal/lib/roken/resolve.c 	    headp = &(*headp)->next;
next              677 source4/heimdal/lib/roken/resolve.c 	    (*tt)->next = *headp;
next              679 source4/heimdal/lib/roken/resolve.c 	    headp = &(*tt)->next;
next              257 source4/heimdal/lib/roken/resolve.h     struct resource_record *next;
next               59 source4/heimdal/lib/roken/rkpty.c     struct command *next;
next               66 source4/heimdal/lib/roken/rkpty.c static struct command *commands, **next = &commands;
next              134 source4/heimdal/lib/roken/rkpty.c 	(*next) = c;
next              135 source4/heimdal/lib/roken/rkpty.c 	next = &(c->next);
next              166 source4/heimdal/lib/roken/rkpty.c     for (c = commands; c != NULL; c = c->next) {
next               52 source4/kdc/kdc.c 	struct kdc_reply *next, *prev;
next               59 source4/ldap_server/ldap_server.h 		struct ldapsrv_reply *prev, *next;
next               35 source4/lib/com/com.h                 struct com_extension *prev, *next;
next               34 source4/lib/com/dcom/dcom.h 		struct dcom_server_credentials *prev, *next;
next               42 source4/lib/com/dcom/dcom.h 		struct dcom_object_exporter *prev, *next;
next               78 source4/lib/com/dcom/main.c 	for (c = ctx->dcom->credentials; c; c = c->next) {
next              101 source4/lib/com/dcom/main.c 	for (c = ctx->dcom->credentials; c; c = c->next) {
next              219 source4/lib/com/dcom/main.c 	for (ox = ctx->dcom->object_exporters; ox; ox = ox->next) {
next               29 source4/lib/com/dcom/tables.c 	struct dcom_proxy *prev, *next;
next               45 source4/lib/com/dcom/tables.c 	for (p = proxies; p; p = p->next) {
next               57 source4/lib/com/dcom/tables.c 	struct dcom_marshal *prev, *next;
next               74 source4/lib/com/dcom/tables.c 	for (p = marshals; p; p = p->next) {
next               85 source4/lib/com/dcom/tables.c 	for (p = marshals; p; p = p->next) {
next               33 source4/lib/com/tables.c 	struct com_class *prev, *next;
next               46 source4/lib/com/tables.c 		c = c->next;
next              287 source4/lib/ldb/common/ldb.c 	while (module && module->ops->op == NULL) module = module->next; \
next             1401 source4/lib/ldb/common/ldb.c 	for (o=ldb->opaque;o;o=o->next) {
next             1413 source4/lib/ldb/common/ldb.c 	o->next = ldb->opaque;
next             1426 source4/lib/ldb/common/ldb.c 	for (o=ldb->opaque;o;o=o->next) {
next              125 source4/lib/ldb/common/ldb_modules.c 	struct backends_list_entry *prev, *next;
next              130 source4/lib/ldb/common/ldb_modules.c 	struct ops_list_entry *next;	
next              152 source4/lib/ldb/common/ldb_modules.c 	for (backend = ldb_backends; backend; backend = backend->next) {
next              268 source4/lib/ldb/common/ldb_modules.c 	for (e = registered_modules; e; e = e->next) {
next              288 source4/lib/ldb/common/ldb_modules.c 	entry->next = registered_modules;
next              377 source4/lib/ldb/common/ldb_modules.c 		module = module->next;
next              477 source4/lib/ldb/common/ldb_modules.c 	module = module->next; \
next              478 source4/lib/ldb/common/ldb_modules.c 	while (module && module->ops->op == NULL) module = module->next; \
next              500 source4/lib/ldb/common/ldb_modules.c 	module->prev = module->next = NULL;
next              581 source4/lib/ldb/common/ldb_modules.c 	module = module->next;
next              470 source4/lib/ldb/common/ldb_parse.c 	struct ldb_parse_tree *ret, *next;
next              511 source4/lib/ldb/common/ldb_parse.c 	while (*p && (next = ldb_parse_filter(ret->u.list.elements, &p))) {
next              522 source4/lib/ldb/common/ldb_parse.c 		ret->u.list.elements[ret->u.list.num_elements] = next;
next               31 source4/lib/ldb/include/dlinklist.h 		(p)->next = (p)->prev = NULL; \
next               34 source4/lib/ldb/include/dlinklist.h 		(p)->next = (list); \
next               45 source4/lib/ldb/include/dlinklist.h 		(list) = (p)->next; \
next               48 source4/lib/ldb/include/dlinklist.h 		if ((p)->prev) (p)->prev->next = (p)->next; \
next               49 source4/lib/ldb/include/dlinklist.h 		if ((p)->next) (p)->next->prev = (p)->prev; \
next               51 source4/lib/ldb/include/dlinklist.h 	if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
next               67 source4/lib/ldb/include/dlinklist.h 			(p)->next = (p)->prev = NULL; \
next               70 source4/lib/ldb/include/dlinklist.h 			for (tmp = (list); tmp->next; tmp = tmp->next) ; \
next               71 source4/lib/ldb/include/dlinklist.h 			tmp->next = (p); \
next               72 source4/lib/ldb/include/dlinklist.h 			(p)->next = NULL; \
next               85 source4/lib/ldb/include/dlinklist.h 		p->next = el->next; \
next               86 source4/lib/ldb/include/dlinklist.h 		el->next = p; \
next               87 source4/lib/ldb/include/dlinklist.h 		if (p->next) p->next->prev = p; \
next              106 source4/lib/ldb/include/dlinklist.h 			for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
next              107 source4/lib/ldb/include/dlinklist.h 			tmp->next = (list2); \
next               58 source4/lib/ldb/include/ldb_private.h 	struct ldb_module *prev, *next;
next               91 source4/lib/ldb/include/ldb_private.h 		struct ldb_opaque *next;
next             1038 source4/lib/ldb/ldb_map/ldb_map_outbound.c 		ac->r_current->next = mr;
next             1357 source4/lib/ldb/ldb_map/ldb_map_outbound.c 		if (ac->r_current->next != NULL) {
next             1358 source4/lib/ldb/ldb_map/ldb_map_outbound.c 			ac->r_current = ac->r_current->next;
next               18 source4/lib/ldb/ldb_map/ldb_map_private.h 	struct map_reply *next;
next               56 source4/lib/ldb/ldb_tdb/ldb_index.c 	struct ldb_index_pointer *next, *prev;
next              141 source4/lib/ldb/ldb_tdb/ldb_index.c 	for (i=0, tmp = ptr; tmp; tmp=tmp->next) {
next              154 source4/lib/ldb/ldb_tdb/ldb_index.c 	for (i=0, tmp = ptr; tmp; tmp=tmp->next, i++) {
next               33 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 	struct ltdb_wrap *next, *prev;
next               45 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 	if (w->next) {
next               46 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		w->next->prev = w->prev;
next               49 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		w->prev->next = w->next;
next               52 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		tdb_list = w->next;
next              114 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 		for (w=tdb_list;w;w=w->next) {
next              146 source4/lib/ldb/ldb_tdb/ldb_tdb_wrap.c 	w->next = tdb_list;
next               43 source4/lib/ldb/modules/paged_results.c 	struct message_store *next;
next               55 source4/lib/ldb/modules/paged_results.c 	struct results_store *next;
next               80 source4/lib/ldb/modules/paged_results.c 		priv->store = del->next;
next               84 source4/lib/ldb/modules/paged_results.c 	for (loop = priv->store; loop; loop = loop->next) {
next               85 source4/lib/ldb/modules/paged_results.c 		if (loop->next == del) {
next               86 source4/lib/ldb/modules/paged_results.c 			loop->next = del->next;
next              122 source4/lib/ldb/modules/paged_results.c 	newr->next = priv->store;
next              156 source4/lib/ldb/modules/paged_results.c 		ac->store->first = msg->next;
next              169 source4/lib/ldb/modules/paged_results.c 		ac->store->first_ref = msg->next;
next              250 source4/lib/ldb/modules/paged_results.c 		msg_store->next = NULL;
next              256 source4/lib/ldb/modules/paged_results.c 			ac->store->last->next = msg_store;
next              270 source4/lib/ldb/modules/paged_results.c 		msg_store->next = NULL;
next              276 source4/lib/ldb/modules/paged_results.c 			ac->store->last_ref->next = msg_store;
next              364 source4/lib/ldb/modules/paged_results.c 		for (current = private_data->store; current; current = current->next) {
next              914 source4/lib/ldb/pyldb.c 	for (mod = ldb->modules; mod; mod = mod->next) {
next             1974 source4/lib/ldb/pyldb.c 	py_next = PyLdbModule_FromModule(mod->next);
next               65 source4/lib/messaging/messaging.c 	struct dispatch_fn *next, *prev;
next               73 source4/lib/messaging/messaging.c 	struct messaging_rec *next, *prev;
next              135 source4/lib/messaging/messaging.c 	struct dispatch_fn *d, *next;
next              147 source4/lib/messaging/messaging.c 	for (; d; d = next) {
next              149 source4/lib/messaging/messaging.c 		next = d->next;
next              419 source4/lib/messaging/messaging.c 	struct dispatch_fn *d, *next;
next              430 source4/lib/messaging/messaging.c 	for (d = msg->dispatch[msg_type]; d; d = next) {
next              431 source4/lib/messaging/messaging.c 		next = d->next;
next              629 source4/lib/messaging/messaging.c 	struct irpc_list *next, *prev;
next              648 source4/lib/messaging/messaging.c 	for (irpc=msg_ctx->irpc; irpc; irpc=irpc->next) {
next              748 source4/lib/messaging/messaging.c 	for (i=msg_ctx->irpc; i; i=i->next) {
next               37 source4/lib/registry/local.c 		struct mountpoint *prev, *next;
next              132 source4/lib/registry/local.c 	for (mp = rctx->mountpoints; mp != NULL; mp = mp->next) {
next              334 source4/lib/registry/local.c 	mp->prev = mp->next = NULL;
next              135 source4/lib/socket/connect_multi.c 	int next = multi->num_connects_sent;
next              137 source4/lib/socket/connect_multi.c 	if (next == multi->num_ports) {
next              153 source4/lib/socket/connect_multi.c 						  multi->server_address, multi->ports[next]);
next               29 source4/lib/socket/interface.c 	struct interface *next, *prev;
next               53 source4/lib/socket/interface.c 	for (i=interfaces;i;i=i->next)
next              242 source4/lib/socket/interface.c 	for (i=ifaces;i;i=i->next)
next              254 source4/lib/socket/interface.c 	for (i=ifaces;i && n;i=i->next)
next              270 source4/lib/socket/interface.c 	for (i=ifaces;i && n;i=i->next)
next              286 source4/lib/socket/interface.c 	for (i=ifaces;i && n;i=i->next)
next               53 source4/lib/stream/packet.c 		struct send_element *next, *prev;
next               92 source4/lib/tdb_wrap.c 	for (w=tdb_list;w;w=w->next) {
next               31 source4/lib/tdb_wrap.h 	struct tdb_wrap *next, *prev;
next              226 source4/lib/wmi/wbemdata.c 	struct pair_guid_ptr *next, *prev;
next              231 source4/lib/wmi/wbemdata.c 	for (; list; list = list->next) {
next              328 source4/lib/wmi/wmi_wrap.c   struct swig_cast_info  *next;			/* pointer to next cast in linked list */
next              338 source4/lib/wmi/wmi_wrap.c   struct swig_module_info *next;		/* Pointer to next element in circularly linked list */
next              409 source4/lib/wmi/wmi_wrap.c         iter->prev->next = iter->next;                  \
next              410 source4/lib/wmi/wmi_wrap.c         if (iter->next)                                 \
next              411 source4/lib/wmi/wmi_wrap.c           iter->next->prev = iter->prev;                \
next              412 source4/lib/wmi/wmi_wrap.c         iter->next = ty->cast;                          \
next              418 source4/lib/wmi/wmi_wrap.c       iter = iter->next;                                \
next              505 source4/lib/wmi/wmi_wrap.c     cast = cast->next;
next              553 source4/lib/wmi/wmi_wrap.c     iter = iter->next;
next              585 source4/lib/wmi/wmi_wrap.c       iter = iter->next;
next             1310 source4/lib/wmi/wmi_wrap.c   PyObject *next;
next             1360 source4/lib/wmi/wmi_wrap.c   if (v->next) {
next             1362 source4/lib/wmi/wmi_wrap.c     PyObject *nrep = PySwigObject_repr((PySwigObject *)v->next);
next             1364 source4/lib/wmi/wmi_wrap.c     PyObject *nrep = PySwigObject_repr((PySwigObject *)v->next, args);
next             1425 source4/lib/wmi/wmi_wrap.c   PyObject *next = sobj->next;
next             1452 source4/lib/wmi/wmi_wrap.c   Py_XDECREF(next);
next             1457 source4/lib/wmi/wmi_wrap.c PySwigObject_append(PyObject* v, PyObject* next)
next             1462 source4/lib/wmi/wmi_wrap.c   if (!PyArg_ParseTuple(next,(char *)"O:append", &tmp)) return NULL;
next             1463 source4/lib/wmi/wmi_wrap.c   next = tmp;
next             1465 source4/lib/wmi/wmi_wrap.c   if (!PySwigObject_Check(next)) {
next             1468 source4/lib/wmi/wmi_wrap.c   sobj->next = next;
next             1469 source4/lib/wmi/wmi_wrap.c   Py_INCREF(next);
next             1481 source4/lib/wmi/wmi_wrap.c   if (sobj->next) {    
next             1482 source4/lib/wmi/wmi_wrap.c     Py_INCREF(sobj->next);
next             1483 source4/lib/wmi/wmi_wrap.c     return sobj->next;
next             1696 source4/lib/wmi/wmi_wrap.c     sobj->next = 0;
next             1989 source4/lib/wmi/wmi_wrap.c 	    sobj = (PySwigObject *)sobj->next;
next             3840 source4/lib/wmi/wmi_wrap.c   if (swig_module.next==0) {
next             3844 source4/lib/wmi/wmi_wrap.c     swig_module.next = &swig_module;
next             3866 source4/lib/wmi/wmi_wrap.c       iter=iter->next;
next             3872 source4/lib/wmi/wmi_wrap.c     swig_module.next = module_head->next;
next             3873 source4/lib/wmi/wmi_wrap.c     module_head->next = &swig_module;
next             3896 source4/lib/wmi/wmi_wrap.c     if (swig_module.next != &swig_module) {
next             3897 source4/lib/wmi/wmi_wrap.c       type = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, swig_module.type_initial[i]->name);
next             3922 source4/lib/wmi/wmi_wrap.c       if (swig_module.next != &swig_module) {
next             3923 source4/lib/wmi/wmi_wrap.c         ret = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, cast->type->name);
next             3951 source4/lib/wmi/wmi_wrap.c           cast->next = type->cast;
next             4001 source4/lib/wmi/wmi_wrap.c         equiv = equiv->next;
next             4034 source4/lib/wmi/wmi_wrap.c     struct swig_globalvar *next;
next             4051 source4/lib/wmi/wmi_wrap.c     for (var = v->vars; var; var=var->next) {
next             4053 source4/lib/wmi/wmi_wrap.c       if (var->next) PyString_ConcatAndDel(&str,PyString_FromString(", "));
next             4072 source4/lib/wmi/wmi_wrap.c       swig_globalvar *n = var->next;
next             4088 source4/lib/wmi/wmi_wrap.c       var = var->next;
next             4105 source4/lib/wmi/wmi_wrap.c       var = var->next;
next             4185 source4/lib/wmi/wmi_wrap.c         gv->next = v->vars;
next              226 source4/libcli/auth/credentials.c 				struct netr_Authenticator *next)
next              231 source4/libcli/auth/credentials.c 	next->cred = creds->client;
next              232 source4/libcli/auth/credentials.c 	next->timestamp = creds->sequence;
next               36 source4/libcli/cldap/cldap.h 	struct cldap_request *next, *prev;
next               28 source4/libcli/dgram/libdgram.h 	struct nbt_dgram_request *next, *prev;
next               76 source4/libcli/dgram/libdgram.h 	struct dgram_mailslot_handler *next, *prev;
next               86 source4/libcli/dgram/mailslot.c 	for (h=dgmsock->mailslot_handlers;h;h=h->next) {
next              122 source4/libcli/ldap/ldap_client.c 	for (req=conn->pending; req; req=req->next) {
next               30 source4/libcli/ldap/ldap_client.h 	struct ldap_request *next, *prev;
next              299 source4/libcli/raw/clitransport.c 	for (req=transport->pending_recv; req; req=req->next) {
next              315 source4/libcli/raw/clitransport.c 	struct timeval next = timeval_add(&t, 0, transport->idle.period);
next              318 source4/libcli/raw/clitransport.c 						      next,
next              397 source4/libcli/raw/clitransport.c 	for (req=transport->pending_recv; req; req=req->next) {
next              227 source4/libcli/raw/libcliraw.h 	struct smbcli_request *next, *prev;
next               77 source4/libcli/raw/rawnotify.c 		uint32_t next = IVAL(nt.out.params.data, ofs);
next               79 source4/libcli/raw/rawnotify.c 		if (next == 0 ||
next               80 source4/libcli/raw/rawnotify.c 		    ofs + next >= nt.out.params.length) break;
next               81 source4/libcli/raw/rawnotify.c 		ofs += next;
next              108 source4/libcli/resolve/dns_ex.c 	for (rr=reply->head; rr; rr=rr->next) {
next              163 source4/libcli/resolve/dns_ex.c 	for (rr=reply->head;rr;rr=rr->next) {
next              205 source4/libcli/resolve/dns_ex.c 		for (rr=reply->head;rr;rr=rr->next) {
next               50 source4/libcli/resolve/resolve.c 		struct resolve_method *prev, *next;
next               92 source4/libcli/resolve/resolve.c 		state->method = state->method->next;
next              123 source4/libcli/resolve/resolve.c 		if (creq == NULL && state->method) state->method = state->method->next;
next               40 source4/libcli/smb2/create.c 		uint32_t next;
next               51 source4/libcli/smb2/create.c 		next        = IVAL(data, 0);
next               58 source4/libcli/smb2/create.c 		if ((next & 0x7) != 0 ||
next               59 source4/libcli/smb2/create.c 		    next > remaining ||
next               83 source4/libcli/smb2/create.c 		if (next == 0) break;
next               85 source4/libcli/smb2/create.c 		remaining -= next;
next               86 source4/libcli/smb2/create.c 		data += next;
next               83 source4/libcli/smb2/notify.c 		uint32_t next = IVAL(blob.data, ofs);
next               85 source4/libcli/smb2/notify.c 		if (next == 0 || (ofs + next) >= blob.length) break;
next               86 source4/libcli/smb2/notify.c 		ofs += next;
next               90 source4/libcli/smb2/request.c 	req->next = req->prev = NULL;
next              142 source4/libcli/smb2/smb2.h 	struct smb2_request *next, *prev;
next              217 source4/libcli/smb2/transport.c 	for (req=transport->pending_recv; req; req=req->next) {
next              388 source4/libcli/smb2/transport.c 	struct timeval next = timeval_add(&t, 0, transport->idle.period);
next              391 source4/libcli/smb2/transport.c 						      next,
next              449 source4/libcli/wrepl/winsrepl.c 	for (; req; req = req->next) {
next               72 source4/libcli/wrepl/winsrepl.h 	struct wrepl_request *next, *prev;
next               31 source4/libnet/libnet_samdump.c 	struct samdump_secret *prev, *next;
next               38 source4/libnet/libnet_samdump.c 	struct samdump_trusted_domain *prev, *next;
next              181 source4/libnet/libnet_samdump.c 	for (t=samdump_state->trusted_domains; t; t=t->next) {
next              183 source4/libnet/libnet_samdump.c 		for (s=samdump_state->secrets; s; s=s->next) {
next               38 source4/libnet/libnet_samsync_ldb.c 	struct samsync_ldb_secret *prev, *next;
next               45 source4/libnet/libnet_samsync_ldb.c 	struct samsync_ldb_trusted_domain *prev, *next;
next              838 source4/librpc/rpc/dcerpc.c 	for (req=c->pending;req;req=req->next) {
next              206 source4/librpc/rpc/dcerpc.h 	struct rpc_request *next, *prev;
next              107 source4/nbt_server/interfaces.c 		for (i = nbtsrv->interfaces; i; i = i->next) {
next              139 source4/nbt_server/interfaces.c 	for (iname=iface->names;iname;iname=iname->next) {
next              353 source4/nbt_server/interfaces.c 	for (iface2=nbtsrv->interfaces;iface2;iface2=iface2->next) {
next              382 source4/nbt_server/interfaces.c 	for (cur=nbtd_server->interfaces;cur;cur=cur->next) {
next               32 source4/nbt_server/nbt_server.h 	struct nbtd_iface_name *next, *prev;
next               48 source4/nbt_server/nbt_server.h 	struct nbtd_interface *next, *prev;
next               45 source4/nbt_server/nodestatus.c 	for (iname=iface->names;iname;iname=iname->next) {
next               72 source4/nbt_server/nodestatus.c 	for (iname=iface->names;iname;iname=iname->next) {
next               88 source4/nbt_server/packet.c 	for (iface=nbtsrv->interfaces;iface;iface=iface->next) {
next              238 source4/nbt_server/register.c 	for (iface=nbtsrv->interfaces;iface;iface=iface->next) {
next              185 source4/nbt_server/wins/winsserver.c 	struct nbtd_wins_wack_state *prev, *next;
next              210 source4/nbt_server/wins/winsserver.c 	for (s= iface->wack_queue; s; s = s->next) {
next               39 source4/ntvfs/cifs/vfs_cifs.c 	struct cvfs_file *prev, *next;
next               58 source4/ntvfs/cifs/vfs_cifs.c 	struct async_info *next, *prev;
next              118 source4/ntvfs/cifs/vfs_cifs.c 	for (f=p->files; f; f=f->next) {
next              265 source4/ntvfs/cifs/vfs_cifs.c 		an = a->next;
next              869 source4/ntvfs/cifs/vfs_cifs.c 	for (a=p->pending;a;a=a->next) {
next               27 source4/ntvfs/cifs_posix_cli/cifsposix.h 	struct cifspsx_file *next, *prev;
next               34 source4/ntvfs/cifs_posix_cli/cifsposix.h 	struct search_state *next, *prev;
next              593 source4/ntvfs/cifs_posix_cli/vfs_cifs_posix.c 		for (f=p->open_files;f;f=f->next) {
next              923 source4/ntvfs/cifs_posix_cli/vfs_cifs_posix.c 	for (search=p->search; search; search = search->next) {
next             1001 source4/ntvfs/cifs_posix_cli/vfs_cifs_posix.c 	for (search=p->search; search; search = search->next) {
next               53 source4/ntvfs/common/notify.c 	struct notify_list *next, *prev;
next              272 source4/ntvfs/common/notify.c 	for (listel=notify->list;listel;listel=listel->next) {
next              443 source4/ntvfs/common/notify.c 	for (listel=notify->list;listel;listel=listel->next) {
next               46 source4/ntvfs/ipc/vfs_ipc.c 		struct pipe_state *next, *prev;
next              538 source4/ntvfs/ipc/vfs_ipc.c 	struct pipe_state *p, *next;
next              540 source4/ntvfs/ipc/vfs_ipc.c 	for (p=ipriv->pipe_list; p; p=next) {
next              541 source4/ntvfs/ipc/vfs_ipc.c 		next = p->next;
next              558 source4/ntvfs/ipc/vfs_ipc.c 	struct pipe_state *p, *next;
next              560 source4/ntvfs/ipc/vfs_ipc.c 	for (p=ipriv->pipe_list; p; p=next) {
next              561 source4/ntvfs/ipc/vfs_ipc.c 		next = p->next;
next              168 source4/ntvfs/ntvfs.h 	struct ntvfs_module_context *prev, *next;
next              247 source4/ntvfs/ntvfs.h 	struct ntvfs_async_state *prev, *next;
next              298 source4/ntvfs/ntvfs.h 		struct ntvfs_handle_data *prev, *next;
next              340 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->connect) {
next              343 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->connect(ntvfs->next, req, sharename);
next              348 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->disconnect) {
next              351 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->disconnect(ntvfs->next);
next              359 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->async_setup) {
next              362 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->async_setup(ntvfs->next, req, private_data);
next              370 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->fsinfo) {
next              373 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->fsinfo(ntvfs->next, req, fs);
next              381 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->unlink) {
next              384 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->unlink(ntvfs->next, req, unl);
next              391 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->chkpath) {
next              394 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->chkpath(ntvfs->next, req, cp);
next              401 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->qpathinfo) {
next              404 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->qpathinfo(ntvfs->next, req, st);
next              411 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->setpathinfo) {
next              414 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->setpathinfo(ntvfs->next, req, st);
next              421 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->mkdir) {
next              424 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->mkdir(ntvfs->next, req, md);
next              431 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->rmdir) {
next              434 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->rmdir(ntvfs->next, req, rd);
next              441 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->rename) {
next              444 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->rename(ntvfs->next, req, ren);
next              451 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->copy) {
next              454 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->copy(ntvfs->next, req, cp);
next              461 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->open) {
next              464 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->open(ntvfs->next, req, oi);
next              474 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->search_first) {
next              477 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->search_first(ntvfs->next, req, io, private_data, callback);
next              485 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->search_next) {
next              488 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->search_next(ntvfs->next, req, io, private_data, callback);
next              495 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->search_close) {
next              498 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->search_close(ntvfs->next, req, io);
next              506 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->ioctl) {
next              509 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->ioctl(ntvfs->next, req, io);
next              516 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->read) {
next              519 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->read(ntvfs->next, req, io);
next              526 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->write) {
next              529 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->write(ntvfs->next, req, io);
next              536 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->seek) {
next              539 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->seek(ntvfs->next, req, io);
next              546 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->flush) {
next              549 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->flush(ntvfs->next, req, flush);
next              556 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->lock) {
next              559 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->lock(ntvfs->next, req, lck);
next              566 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->qfileinfo) {
next              569 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->qfileinfo(ntvfs->next, req, info);
next              576 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->setfileinfo) {
next              579 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->setfileinfo(ntvfs->next, req, info);
next              586 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->close) {
next              589 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->close(ntvfs->next, req, io);
next              597 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->trans) {
next              600 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->trans(ntvfs->next, req, trans);
next              608 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->trans2) {
next              611 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->trans2(ntvfs->next, req, trans2);
next              621 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->notify) {
next              624 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->notify(ntvfs->next, req, info);
next              631 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->cancel) {
next              634 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->cancel(ntvfs->next, req);
next              642 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->lpq) {
next              645 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->lpq(ntvfs->next, req, lpq);
next              653 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->logoff) {
next              656 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->logoff(ntvfs->next, req);
next              662 source4/ntvfs/ntvfs_interface.c 	if (!ntvfs->next || !ntvfs->next->ops->exit) {
next              665 source4/ntvfs/ntvfs_interface.c 	return ntvfs->next->ops->exit(ntvfs->next, req);
next              118 source4/ntvfs/ntvfs_util.c 	for (d=h->backend_data; d; d = d->next) {
next              145 source4/ntvfs/ntvfs_util.c 	for (d=h->backend_data; d; d = d->next) {
next              159 source4/ntvfs/ntvfs_util.c 		n = d->next;
next               70 source4/ntvfs/posix/pvfs_flush.c 		for (f=pvfs->files.list;f;f=f->next) {
next               50 source4/ntvfs/posix/pvfs_lock.c 	struct pvfs_pending_lock *next, *prev;
next              219 source4/ntvfs/posix/pvfs_lock.c 	struct pvfs_pending_lock *p, *next;
next              230 source4/ntvfs/posix/pvfs_lock.c 	for (p=f->pending_list;p;p=next) {
next              231 source4/ntvfs/posix/pvfs_lock.c 		next = p->next;
next              247 source4/ntvfs/posix/pvfs_lock.c 	for (p=f->pending_list;p;p=p->next) {
next               40 source4/ntvfs/posix/pvfs_notify.c 		struct notify_pending *next, *prev;
next             1060 source4/ntvfs/posix/pvfs_open.c 	for (f2=pvfs->files.list;f2;f2=f2->next) {
next             1695 source4/ntvfs/posix/pvfs_open.c 	struct pvfs_file *f, *next;
next             1697 source4/ntvfs/posix/pvfs_open.c 	for (f=pvfs->files.list;f;f=next) {
next             1698 source4/ntvfs/posix/pvfs_open.c 		next = f->next;
next             1716 source4/ntvfs/posix/pvfs_open.c 	struct pvfs_file *f, *next;
next             1718 source4/ntvfs/posix/pvfs_open.c 	for (f=pvfs->files.list;f;f=next) {
next             1719 source4/ntvfs/posix/pvfs_open.c 		next = f->next;
next               31 source4/ntvfs/posix/pvfs_wait.c 	struct pvfs_wait *next, *prev;
next              191 source4/ntvfs/posix/pvfs_wait.c 	for (pwait=pvfs->wait_list;pwait;pwait=pwait->next) {
next              152 source4/ntvfs/posix/vfs_posix.c 		fn = f->next;
next              157 source4/ntvfs/posix/vfs_posix.c 		sn = s->next;
next              189 source4/ntvfs/posix/vfs_posix.h 	struct pvfs_file *next, *prev;
next              218 source4/ntvfs/posix/vfs_posix.h 	struct pvfs_search_state *prev, *next;
next               27 source4/ntvfs/simple/svfs.h 	struct svfs_file *next, *prev;
next               34 source4/ntvfs/simple/svfs.h 	struct search_state *next, *prev;
next              590 source4/ntvfs/simple/vfs_simple.c 		for (f=p->open_files;f;f=f->next) {
next              920 source4/ntvfs/simple/vfs_simple.c 	for (search=p->search; search; search = search->next) {
next              998 source4/ntvfs/simple/vfs_simple.c 	for (search=p->search; search; search = search->next) {
next               45 source4/ntvfs/smb2/vfs_smb2.c 	struct cvfs_file *prev, *next;
next               68 source4/ntvfs/smb2/vfs_smb2.c 	struct async_info *next, *prev;
next              108 source4/ntvfs/smb2/vfs_smb2.c 	for (f=p->files; f; f=f->next) {
next              271 source4/ntvfs/smb2/vfs_smb2.c 		an = a->next;
next               76 source4/ntvfs/sysdep/inotify.c 	struct inotify_watch_context *next, *prev;
next              138 source4/ntvfs/sysdep/inotify.c 	struct inotify_watch_context *w, *next;
next              171 source4/ntvfs/sysdep/inotify.c 	for (w=in->watches;w;w=next) {
next              172 source4/ntvfs/sysdep/inotify.c 		next = w->next;
next              189 source4/ntvfs/sysdep/inotify.c 	for (w=in->watches;w;w=next) {
next              190 source4/ntvfs/sysdep/inotify.c 		next = w->next;
next              326 source4/ntvfs/sysdep/inotify.c 	for (w=in->watches;w;w=w->next) {
next               36 source4/ntvfs/sysdep/sys_lease_linux.c 	struct linux_lease_pending *prev, *next;
next               55 source4/ntvfs/sysdep/sys_lease_linux.c 	for (c = leases; c; c = c->next) {
next              156 source4/ntvfs/sysdep/sys_lease_linux.c 	for (c = leases; c; c = c->next) {
next              183 source4/ntvfs/sysdep/sys_lease_linux.c 	for (c = leases; c; c = c->next) {
next               32 source4/param/generic.c 	for (sect = ctx->sections; sect; sect = sect->next) {
next               45 source4/param/generic.c 	for (p = section->parameters; p; p = p->next) {
next              249 source4/param/generic.c 	for (section = ctx->sections; section; section = section->next) {
next              252 source4/param/generic.c 		for (param = section->parameters; param; param = param->next) {
next              281 source4/param/generic.c 	for (section = ctx->sections; section; section = section->next) {
next              285 source4/param/generic.c 		for (param = section->parameters; param; param = param->next) {
next              509 source4/param/loadparm.c 		struct file_lists *next;
next              767 source4/param/loadparm.c 		data = data->next;
next              774 source4/param/loadparm.c 		     data = data->next) {
next             1036 source4/param/loadparm.c 				pdata = data->next;
next             1328 source4/param/loadparm.c 			pdata = pdata->next;
next             1338 source4/param/loadparm.c 		data = data->next;
next             1392 source4/param/loadparm.c 		f = f->next;
next             1399 source4/param/loadparm.c 		f->next = lp_ctx->file_lists;
next             1427 source4/param/loadparm.c 	for (f = lp_ctx->file_lists; f != NULL; f = f->next) {
next             1569 source4/param/loadparm.c 	for (paramo=data; paramo; paramo=paramo->next) {
next             2067 source4/param/loadparm.c 		     data = data->next) {
next             2109 source4/param/loadparm.c 		for (data = pService->param_opt; data; data = data->next) {
next             2220 source4/param/loadparm.c 		struct param_opt *next;
next             2221 source4/param/loadparm.c 		for (data = lp_ctx->globals->param_opt; data; data=next) {
next             2222 source4/param/loadparm.c 			next = data->next;
next               24 source4/param/param.h 	struct param_opt *prev, *next;
next               36 source4/param/param.h 	struct param_section *prev, *next;
next               70 source4/rpc_server/dcerpc_server.c 	for (ep=dce_ctx->endpoint_list; ep; ep=ep->next) {
next               85 source4/rpc_server/dcerpc_server.c 	for (c=conn->contexts;c;c=c->next) {
next              108 source4/rpc_server/dcerpc_server.c 	for (ifl=endpoint->interface_list; ifl; ifl=ifl->next) {
next              133 source4/rpc_server/dcerpc_server.c 	for (ifl=endpoint->interface_list; ifl; ifl=ifl->next) {
next              147 source4/rpc_server/dcerpc_server.c 	for (c=dce_conn->incoming_fragmented_call_list;c;c=c->next) {
next               81 source4/rpc_server/dcerpc_server.h 	struct dcesrv_call_state *next, *prev;
next              138 source4/rpc_server/dcerpc_server.h 	struct dcesrv_handle *next, *prev;
next              153 source4/rpc_server/dcerpc_server.h 	struct dcesrv_connection_context *next, *prev;
next              258 source4/rpc_server/dcerpc_server.h 		struct dcesrv_endpoint *next, *prev;
next              265 source4/rpc_server/dcerpc_server.h 			struct dcesrv_if_list *next, *prev;
next               40 source4/rpc_server/dcesrv_mgmt.c 	for (l = ep->interface_list; l; l = l->next) {
next               52 source4/rpc_server/epmapper/rpc_epmapper.c 	for (d=endpoint_list; d; d=d->next) {
next               56 source4/rpc_server/epmapper/rpc_epmapper.c 		for (iface=d->interface_list;iface;iface=iface->next) {
next               76 source4/rpc_server/handles.c 	for (h=context->handles; h; h=h->next) {
next              280 source4/rpc_server/remote/dcesrv_remote.c 	for (l=ndr_table_list();l;l=l->next) {
next              444 source4/rpc_server/service_rpc.c 	for (e=dce_ctx->endpoint_list;e;e=e->next) {
next               41 source4/smb_server/management.c 	for (sess=smb_conn->sessions.list; sess; sess=sess->next) {
next               49 source4/smb_server/management.c 	for (sess=smb_conn->sessions.list; sess; sess=sess->next) {
next               85 source4/smb_server/management.c 	for (tcon=smb_conn->smb_tcons.list; tcon; tcon=tcon->next) {
next               93 source4/smb_server/management.c 	for (tcon=smb_conn->smb_tcons.list; tcon; tcon=tcon->next) {
next              602 source4/smb_server/smb/nttrans.c 	for (count=0,tp=req->smb_conn->trans_partial;tp;tp=tp->next) count++;
next              728 source4/smb_server/smb/nttrans.c 	for (tp=req->smb_conn->trans_partial;tp;tp=tp->next) {
next             1236 source4/smb_server/smb/reply.c 		nh = h->next;
next             2029 source4/smb_server/smb/reply.c 		ni = i->next;
next             2041 source4/smb_server/smb/reply.c 	for (tcon=req->smb_conn->smb_tcons.list;tcon;tcon=tcon->next) {
next             2072 source4/smb_server/smb/reply.c 		ni = i->next;
next             2082 source4/smb_server/smb/reply.c 	for (tcon=req->smb_conn->smb_tcons.list;tcon;tcon=tcon->next) {
next             2230 source4/smb_server/smb/reply.c 	for (r = req->smb_conn->requests; r; r = r->next) {
next             1057 source4/smb_server/smb/trans2.c 	for (count=0,tp=req->smb_conn->trans_partial;tp;tp=tp->next) count++;
next             1313 source4/smb_server/smb/trans2.c 	for (tp=req->smb_conn->trans_partial;tp;tp=tp->next) {
next               24 source4/smb_server/smb2/smb2_server.h 	struct smb2srv_request *next, *prev;
next               77 source4/smb_server/smb_server.h 	struct smbsrv_session *prev, *next;
next              125 source4/smb_server/smb_server.h 	struct smbsrv_tcon *next, *prev;
next              168 source4/smb_server/smb_server.h 	struct smbsrv_handle *next, *prev;
next              186 source4/smb_server/smb_server.h 		struct smbsrv_handle_session_item *prev, *next;
next              225 source4/smb_server/smb_server.h 	struct smbsrv_request *next, *prev;
next              362 source4/smb_server/smb_server.h 		struct smbsrv_trans_partial *next, *prev;
next               31 source4/smbd/service.c 	struct registered_server *next, *prev;
next               61 source4/smbd/service.c 	for (srv=registered_servers; srv; srv=srv->next) {
next               31 source4/torture/basic/aliases.c 	struct trans2_blobs *next, *prev;
next               68 source4/torture/basic/aliases.c 	for (t2b=alias_blobs; t2b; t2b=t2b->next) {
next               69 source4/torture/basic/aliases.c 		for (t2b2=alias_blobs; t2b2; t2b2=t2b2->next) {
next              287 source4/torture/ldap/schema.c 	for (a=schema->attributes; a; a = a->next) {
next              303 source4/torture/ldap/schema.c 	for (a=schema->attributes; a; a = a->next) {
next              320 source4/torture/ldap/schema.c 	for (a=schema->attributes; a; a = a->next) {
next              358 source4/torture/ldap/schema.c 		for (a=schema->attributes; a; a = a->next) {
next               45 source4/torture/nbench/nbio.c 	struct lock_info *next, *prev;
next               58 source4/torture/nbench/nbio.c 	struct ftable *next, *prev;
next              123 source4/torture/nbench/nbio.c 		linfo = linfo->next;
next              154 source4/torture/nbench/nbio.c 		f = f->next;
next              279 source4/torture/nbench/nbio.c 		goto next;
next              291 source4/torture/nbench/nbio.c 		goto next;
next              312 source4/torture/nbench/nbio.c next:
next              341 source4/torture/nbench/nbio.c 		linfo = linfo->next;
next              351 source4/torture/nbench/nbio.c 	for (f=ftable;f;f=f->next) {
next             1885 source4/torture/raw/acls.c 		CHECK_STATUS_FOR_BIT_ACTION(status, open_bits, goto next);
next             1974 source4/torture/raw/acls.c next:
next              122 source4/torture/rpc/countcalls.c 	for (l=ndr_table_list();l;l=l->next) {		
next              212 source4/torture/rpc/mgmt.c 	for (l=ndr_table_list();l;l=l->next) {		
next              139 source4/torture/rpc/samsync.c 	struct samsync_secret *prev, *next;
next              146 source4/torture/rpc/samsync.c 	struct samsync_trusted_domain *prev, *next;
next             1299 source4/torture/rpc/samsync.c 	for (t=samsync_state->trusted_domains; t; t=t->next) {
next             1301 source4/torture/rpc/samsync.c 		for (s=samsync_state->secrets; s; s=s->next) {
next              112 source4/torture/rpc/scanner.c 	for (l=ndr_table_list();l;l=l->next) {		
next               78 source4/torture/rpc/spoolss_notify.c 	struct received_packet *prev, *next;
next               52 source4/torture/smbtorture.c 		for (o = (torture_root == NULL?NULL:torture_root->children); o; o = o->next) {
next               67 source4/torture/smbtorture.c 		for (c = suite->children; c; c = c->next) {
next               84 source4/torture/smbtorture.c 		for (t = suite->testcases; t; t = t->next) {
next              112 source4/torture/smbtorture.c 		for (o = torture_root->children; o; o = o->next) {
next              203 source4/torture/smbtorture.c 	for (o = torture_root->children; o; o = o->next) {
next              204 source4/torture/smbtorture.c 		for (s = o->children; s; s = s->next) {
next              208 source4/torture/smbtorture.c 		for (t = o->testcases; t; t = t->next) {
next              278 source4/torture/smbtorture.c 	for (o = torture_root->children; o; o = o->next) {
next              282 source4/torture/smbtorture.c 		for (s = o->children; s; s = s->next) {
next              290 source4/torture/smbtorture.c 		for (t = o->testcases; t; t = t->next) {
next              222 source4/utils/ad2oLschema.c 	for (attribute=schema->attributes; attribute; attribute = attribute->next) {
next              302 source4/utils/ad2oLschema.c 	for (objectclass=schema->classes; objectclass; objectclass = objectclass->next) {
next               87 source4/web_server/web_server.c 	for (hdr = headers; hdr; hdr = hdr->next) {
next               34 source4/web_server/web_server.h 	struct http_header *prev, *next;
next              301 source4/web_server/wsgi.c 	for (hdr = headers; hdr; hdr = hdr->next) {
next               60 source4/winbind/wb_server.h 	struct wbsrv_domain *next, *prev;
next               36 source4/winbind/wb_sid2domain.c 	for (domain = service->domains; domain!=NULL; domain = domain->next) {
next              126 source4/wrepl_server/wrepl_out_pull.c 	for (partner = service->partners; partner; partner = partner->next) {
next              127 source4/wrepl_server/wrepl_out_push.c 	for (partner = service->partners; partner; partner = partner->next) {
next              124 source4/wrepl_server/wrepl_server.c 	for (cur = service->partners; cur; cur = cur->next) {
next              164 source4/wrepl_server/wrepl_server.c 	for (partner=service->partners; partner; partner = partner->next) {
next              239 source4/wrepl_server/wrepl_server.c 	for (cur = service->table; cur; cur = cur->next) {
next              254 source4/wrepl_server/wrepl_server.c 	for (cur = service->table; cur && i < table_out->partner_count; cur = cur->next) {
next              285 source4/wrepl_server/wrepl_server.c 	for (cur = table; cur; cur = cur->next) {
next               44 source4/wrepl_server/wrepl_server.h 	struct wreplsrv_in_connection *prev,*next;
next              108 source4/wrepl_server/wrepl_server.h 	struct wreplsrv_partner *prev,*next;
next              190 source4/wrepl_server/wrepl_server.h 	struct wreplsrv_owner *prev,*next;