next              200 gtags-cscope/global-cscope.h 	struct	cmd *prev, *next;	/**< list ptrs */
next               60 gtags-cscope/history.c 		tail->next = h;
next               61 gtags-cscope/history.c 		h->next = 0;
next               66 gtags-cscope/history.c 		h->next = h->prev = 0;
next               93 gtags-cscope/history.c 		if( current->next)	/* stay on first item */
next               94 gtags-cscope/history.c 			return current = current->next;
next              405 gtags-cscope/mouse.c 	int  c, next;
next              408 gtags-cscope/mouse.c 	next = 0;
next              410 gtags-cscope/mouse.c 		next = 95;
next              416 gtags-cscope/mouse.c 	return (next + c - ' ');
next              215 htags/src2html.c 		const char *next = p + strlen(p) + 1;
next              217 htags/src2html.c 		if (next > limit) {
next               88 libdb/bt_search.c 				goto next;
next              129 libdb/bt_search.c next:		BT_PUSH(t, h->pgno, index);
next             3089 libglibc/regex.c   const char *next = p;
next             3090 libglibc/regex.c   boolean next_backslash = *next == '\\';
next             3095 libglibc/regex.c        (syntax & RE_NO_BK_PARENS ? *next == ')'
next             3098 libglibc/regex.c     || (syntax & RE_NO_BK_VBAR ? *next == '|'
next              111 libltdl/libltdl/lt__private.h   lt_dlhandle		next;
next               58 libltdl/libltdl/slist.h   struct slist *next;		/* chain forward pointer*/
next               99 libltdl/loaders/preopen.c   struct symlist_chain *next;
next              166 libltdl/loaders/preopen.c   for (lists = preloaded_symlists; lists; lists = lists->next)
next              245 libltdl/loaders/preopen.c       symlist_chain *next = lists->next;
next              247 libltdl/loaders/preopen.c       lists = next;
next              263 libltdl/loaders/preopen.c        lists && lists->symlist != symlist; lists = lists->next)
next              274 libltdl/loaders/preopen.c 	  tmp->next = preloaded_symlists;
next              336 libltdl/loaders/preopen.c   for (list = preloaded_symlists; list; list = list->next)
next              134 libltdl/lt_dlloader.c   return (lt_dlloader) (item ? item->next : loaders);
next              286 libltdl/ltdl.c 	  handles = handles->next;
next              298 libltdl/ltdl.c 	      cur = cur->next;
next              314 libltdl/ltdl.c 			  for (tmp = handles; tmp; tmp = tmp->next)
next              337 libltdl/ltdl.c 	  lt_dlloader *next   = (lt_dlloader *) lt_dlloader_next (loader);
next              353 libltdl/ltdl.c 	  loader = next;
next              384 libltdl/ltdl.c   for (;handle; handle = handle->next)
next             1496 libltdl/ltdl.c       (*phandle)->next	= handles;
next             1952 libltdl/ltdl.c       cur = cur->next;
next             1975 libltdl/ltdl.c 	  last->next = cur->next;
next             1979 libltdl/ltdl.c 	  handles = cur->next;
next             2408 libltdl/ltdl.c     handle = handle->next;
next             2414 libltdl/ltdl.c       handle = handle->next;
next             2456 libltdl/ltdl.c 	  cur = cur->next;
next               60 libltdl/slist.c       SList *next = head->next;
next               62 libltdl/slist.c       head = next;
next               93 libltdl/slist.c       *phead = stale->next;
next               99 libltdl/slist.c       for (head = *phead; head->next; head = head->next)
next              101 libltdl/slist.c 	  result = (*find) (head->next, matchdata);
next              104 libltdl/slist.c 	      stale		= head->next;
next              105 libltdl/slist.c 	      head->next	= stale->next;
next              124 libltdl/slist.c   for (; slist; slist = slist->next)
next              152 libltdl/slist.c   while (last->next)
next              153 libltdl/slist.c     last = last->next;
next              155 libltdl/slist.c   last->next = tail;
next              175 libltdl/slist.c   assert (!item->next);
next              177 libltdl/slist.c   item->next = slist;
next              185 libltdl/slist.c   return slist ? slist->next : NULL;
next              197 libltdl/slist.c     slist = slist->next;
next              210 libltdl/slist.c     slist = slist->next;
next              226 libltdl/slist.c   SList *next;
next              230 libltdl/slist.c       next		= slist->next;
next              231 libltdl/slist.c       slist->next	= result;
next              233 libltdl/slist.c       slist 		= next;
next              250 libltdl/slist.c       SList *next = slist->next;
next              256 libltdl/slist.c       slist = next;
next              284 libltdl/slist.c 	  insert = insert->next = left;
next              285 libltdl/slist.c 	  left = left->next;
next              289 libltdl/slist.c 	  insert = insert->next = right;
next              290 libltdl/slist.c 	  right = right->next;
next              294 libltdl/slist.c   insert->next = left ? left : right;
next              296 libltdl/slist.c   return merged.next;
next              316 libltdl/slist.c   right = slist->next;
next              323 libltdl/slist.c   while (right && (right = right->next))
next              325 libltdl/slist.c       if (!right || !(right = right->next))
next              327 libltdl/slist.c       slist = slist->next;
next              329 libltdl/slist.c   right = slist->next;
next              330 libltdl/slist.c   slist->next = 0;
next              357 libltdl/slist.c       item->next     = 0;
next              120 libparser/parser.c 	STAILQ_ENTRY(plugin_entry) next;
next              190 libparser/parser.c 		STAILQ_INSERT_TAIL(&plugin_list, pent, next);
next              209 libparser/parser.c 		STAILQ_REMOVE_HEAD(&plugin_list, next);
next              247 libparser/parser.c 	STAILQ_FOREACH(pent, &plugin_list, next) {
next              100 libutil/statistics.c 	STAILQ_ENTRY(statistics_time) next;
next              186 libutil/statistics.c 	STAILQ_INSERT_TAIL(&statistics_time_list, t, next);
next              230 libutil/statistics.c 	STAILQ_FOREACH(t, &statistics_time_list, next) {
next              455 libutil/statistics.c 		STAILQ_REMOVE_HEAD(&statistics_time_list, next);