Cross Reference: /src/sbin/restore/restore.c

Lines Matching +defs:first +defs:name
15  * 3. Neither the name of the University nor the names of its contributors
59 listfile(const char *name, ino_t ino, int type)
66 	fprintf(stdout, "%10ju\t%s\n", (uintmax_t)ino, name);
75 addfile(const char *name, ino_t ino, int type)
82 		dprintf(stdout, "%s: not on the tape\n", name);
90 		name = buf;
92 			(void) genliteraldir(name, ino);
98 		if (strcmp(name, myname(ep)) == 0) {
104 	ep = addentry(name, ino, type);
117 deletefile(const char *name, ino_t ino, int type __unused)
124 	ep = lookupname(name);
136  * restore algorithm. The first removes old entries, the second
138  * cleans up link names missed by the first two, and the final
142  * other files in them which need to be moved out first. As
208 nodeupdates(const char *name, ino_t ino, int type)
217 #		define NAMEFND	0x4	/* name already exists */
222 	 * directory hierarchy, with a full path name.
231 	 * Check to see if the name exists, and if the name is a link.
233 	np = lookupname(name);
244 	 * corresponds to the name (if one was found).
257 	 * If both a name and an inode are found, but they do not
259 	 * been found and the inode corresponding to the name that
261 	 * is the new name for the inode that has been found. Since
264 	 * under a new name in this dump level. If it is a link, it
266 	 * temporary name in anticipation that it will be renamed
274 			dprintf(stdout, "name/inode conflict, mktempname %s\n",
289 	 * a name and inode are found that correspond to different files.
302 		dprintf(stdout, "[%s] %s: %s\n", keyval(key), name,
307 	 * A file on the tape has a name which is the same as a name
311 	 * under a new name in this dump level. If it is a link, it
313 	 * temporary name in anticipation that it will be renamed
331 	 * (Since the name is unused there can be no conflict)
334 		ep = addentry(name, ino, type);
338 		dprintf(stdout, "[%s] %s: %s\n", keyval(key), name,
344 	 * name has been found. If the other name has not already
346 	 * this must be a new name for the file, and it is renamed.
347 	 * If the other name has been found then this must be a
359 			renameit(myname(ip), name);
360 			moveentry(ip, name);
362 			dprintf(stdout, "[%s] %s: %s\n", keyval(key), name,
370 				name, myname(ip));
373 		ep = addentry(name, ino, type|LINK);
375 		dprintf(stdout, "[%s] %s: %s|LINK\n", keyval(key), name,
388 			ep = addentry(name, ino, type|LINK);
392 			dprintf(stdout, "[%s] %s: %s|LINK\n", keyval(key), name,
399 		dprintf(stdout, "[%s] %s: %s\n", keyval(key), name,
430 			ip = addentry(name, ino, type);
439 			ip = addentry(name, ino, type);
442 		dprintf(stdout, "[%s] %s: %s\n", keyval(key), name,
451 		dprintf(stdout, "[%s] %s: Extraneous name\n", keyval(key),
452 			name);
460 	 * for it, we discard the name knowing that it will be on the
465 			name, (uintmax_t)ino);
476 			name);
485 		panic("[%s] %s: impossible state\n", keyval(key), name);
529 				    "%s: remove unreferenced name\n",
545 				    "%s: remove unreferenced name\n",
596 	ino_t first;
605 	first = lowerbnd(UFS_ROOTINO);
608 		first = lowerbnd(first);
616 		while (first < curfile.ino) {
617 			ep = lookupino(first);
619 				panic("%ju: bad first\n",
620 				    (uintmax_t)first);
623 			first = lowerbnd(first);
629 		 * no name for it, we discard it knowing that it will be
632 		if (first != curfile.ino) {
634 			    (uintmax_t)first,
676 	ino_t first, next, last;
685 	first = lowerbnd(UFS_ROOTINO);
694 		first = lowerbnd(first);
699 		if (first > last)
751 		 * so extract it per its requested name.
782 	char name[BUFSIZ];
801 			(void) strcpy(name, myname(ep));
803 				(void) linkit(name, myname(np), SYMLINK);
805 				(void) linkit(name, myname(np), HARDLINK);
840 verifyfile(const char *name, ino_t ino, int type)
845 	ep = lookupname(name);
847 		fprintf(stderr, "Warning: missing name %s\n", name);