xref: /dragonfly/usr.sbin/fstyp/ufs.c (revision aabd9311)
1 /*-
2  * Copyright (c) 2016 The DragonFly Project
3  * Copyright (c) 2002, 2003 Gordon Tetlow
4  * Copyright (c) 2006 Pawel Jakub Dawidek <pjd@FreeBSD.org>
5  * Copyright (c) 2014 The FreeBSD Foundation
6  * All rights reserved.
7  *
8  * This software was developed by Edward Tomasz Napierala under sponsorship
9  * from the FreeBSD Foundation.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  *
20  * THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND
21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
24  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30  * SUCH DAMAGE.
31  */
32 
33 #include <sys/types.h>
34 #include <stdint.h>
35 #include <stdio.h>
36 #include <stdlib.h>
37 #include <string.h>
38 
39 typedef int64_t ufs_time_t;
40 typedef int64_t ufs2_daddr_t;
41 #include "../../sys/boot/common/fs.h"
42 
43 #include "fstyp.h"
44 
45 static const int superblocks[] = SBLOCKSEARCH;
46 
47 int
48 fstyp_ufs(FILE *fp, char *label, size_t labelsize)
49 {
50 	int sb, superblock;
51 	struct fs *fs;
52 
53 	/*
54 	 * Walk through the standard places that superblocks hide and look
55 	 * for UFS magic. If we find magic, then check that the size in the
56 	 * superblock corresponds to the size of the underlying provider.
57 	 * Finally, look for a volume label and create an appropriate
58 	 * provider based on that.
59 	 */
60 	for (sb = 0; (superblock = superblocks[sb]) != -1; sb++) {
61 		fs = (struct fs *)read_buf(fp, superblock, SBLOCKSIZE);
62 		if (fs == NULL)
63 			continue;
64 		/*
65 		 * Check for magic. We also need to check if file system size is equal
66 		 * to providers size, because sysinstall(8) used to bogusly put first
67 		 * partition at offset 0 instead of 16, and glabel/ufs would find file
68 		 * system on slice instead of partition.
69 		 */
70 #ifdef notyet
71 		if (fs->fs_magic == FS_UFS1_MAGIC && fs->fs_fsize > 0 &&
72 		    ((pp->mediasize / fs->fs_fsize == fs->fs_old_size) ||
73 		    (pp->mediasize / fs->fs_fsize == fs->fs_providersize))) {
74 		    	/* Valid UFS1. */
75 		} else if (fs->fs_magic == FS_UFS2_MAGIC && fs->fs_fsize > 0 &&
76 		    ((pp->mediasize / fs->fs_fsize == fs->fs_size) ||
77 		    (pp->mediasize / fs->fs_fsize == fs->fs_providersize))) {
78 		    	/* Valid UFS2. */
79 		} else {
80 			g_free(fs);
81 			continue;
82 		}
83 #else
84 		if (fs->fs_magic == FS_UFS1_MAGIC && fs->fs_fsize > 0) {
85 		    	/* Valid UFS1. */
86 		} else if (fs->fs_magic == FS_UFS2_MAGIC && fs->fs_fsize > 0) {
87 		    	/* Valid UFS2. */
88 		} else {
89 			free(fs);
90 			continue;
91 		}
92 #endif
93 		/*
94 		 * XXX: DragonFly
95 		 */
96 		if (/* fs->fs_sblockloc != superblock || */
97 		    fs->fs_ncg < 1 ||
98 		    fs->fs_bsize < MINBSIZE ||
99 		    (size_t)fs->fs_bsize < sizeof(struct fs)) {
100 			free(fs);
101 			continue;
102 		}
103 
104 		strlcpy(label, fs->fs_volname, labelsize);
105 
106 		free(fs);
107 		return (0);
108 	}
109 
110 	return (1);
111 }
112