Cross Reference: /illumos-gate/usr/src/cmd/fs.d/nfs/nfslog/dbtab.c

Lines Matching refs:next
71 	struct db_list	*next;		/* next db */
79 	struct link_keys	*next;
158  *		key for the file and to the previous and next hard link
164  *		would have prev and next links set to NULL.
167  *		to the head of the links list (i.e. prev = NULL, next =
189  *	   entries: the deleted link, the prev and next links if exist,
226 		p = p->next);
276 	newp->next = db_fs_list;
314 	for (dbp = db_fs_list; dbp != NULL; dbp = dbp->next) {
413 	(void) fprintf(fp, "offsets: fhkey %d, name %d, next %d, prev %d\n",
417 	debug_print_key(fp, "next", "", LN_NEXT(linkp), LN_NEXT_LEN(linkp));
751  * get_next_link - get and check the next link in the chain.
753  * to values for next link (*linksizep set to 0 if last link).
775 	/* Set linkkey to point to next record */
790 	lnp->next = *(struct link_keys **)cookiep;
795 	for (; lnp != NULL; lnp = lnp->next) {
800 			 * XXX This entry's next pointer points to
832 		lnp = lnp->next;
867 	 * next - link key for the next in the list - add at end so null.
934 	 * next - link key for the next link in the list - NULL if it's
1031 		/* No next - can exit now */
1033 			(void) printf("db_add_secondary: no next link\n");
1056 	 * newlink is the new head of the list, with its "next" pointing to
1058 	 * modify the "next" entry to have its "prev" point to the new entry.
1062 		debug_print_key(stderr, "db_add_secondary", "next key\n    ",
1065 	/* Get the next link entry from the database */
1067 			&error, "db_add_secondary next link");
1071 				"db_add_secondary: fetch next link failed\n");
1079 	 * Re-use link to update the next record.
1093  * Update the next link to point to the new prev.
1096  * *nextlinkpp contains the record for the next link, since
1108 			"update_next_link: malloc next Error %s"),
1114 			errorp, "update next");
1115 	/* if there is no next record - ok */
1140  * Update the prev link to point to the new next.
1150 	/* Update its next to the given one */
1153 	/* if error there is no next record - ok */
1159 	/* Change the len and set next - may push prev */
1176  * update_linked_list - update the next link to point back to prev, and vice
1178  * linked list of hard links for the file. next and prev are the keys of next
1182  * return the record for the next link, since
1197 			/* not an error if no next link */
1278 		/* Replace link data with the info for the next link */
1320 	for (; dbp != NULL; dbp = ((fh != &public_fh) ? NULL : dbp->next)) {
1483 	 * 1. Normal case - only one link to delete: the link next and
1491 	 *    delete the link and update the previous and next records
1495 	/* Get next and prev keys for linked list updates */
1545  * the next link in the chain into them (this would save a dbm_fetch op).
1574  * set the primary record for the next link. If it's the last one,
1592 	for (; dbp != NULL; dbp = ((dfh == &public_fh) ? dbp->next : NULL)) {
1619 	for (; dbp != NULL; dbp = ((fh == &public_fh) ? dbp->next : NULL)) {
1651 		dbp = ((from_dfh != &public_fh) ? NULL : dbp->next)) {
1697 	for (; dbp != NULL; dbp = ((fsidp != NULL) ? NULL : dbp->next)) {
1816 		struct thelist *next;
1824 	thelist.next = NULL;
1828 	for (pdb = db_fs_list; pdb; pdb = pdb->next) {
1861 				ptl->next = thelist.next;
1862 				thelist.next = ptl;
1878 		for (ptl = thelist.next; ptl; ptl = thelist.next) {
1879 			thelist.next = ptl->next;
1890 				/* Delete the link and get the next */
1895 					/* Delete the link and get the next */
1927 		thelist.next = NULL;