xref: /dragonfly/lib/libhammer/info.c (revision 277350a0)
1 /*
2  * Copyright (c) 2011 The DragonFly Project.  All rights reserved.
3  *
4  * This code is derived from software contributed to The DragonFly Project
5  * by Antonio Huete <tuxillo@quantumachine.net>
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  *
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in
15  *    the documentation and/or other materials provided with the
16  *    distribution.
17  * 3. Neither the name of The DragonFly Project nor the names of its
18  *    contributors may be used to endorse or promote products derived
19  *    from this software without specific, prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
25  * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26  * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31  * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  */
34 
35 #include <dirent.h>
36 #include <err.h>
37 #include <errno.h>
38 #include <fcntl.h>
39 #include <stdio.h>
40 #include <stdlib.h>
41 #include <string.h>
42 #include <sys/param.h>
43 #include <sys/stat.h>
44 #include <unistd.h>
45 
46 #include "libhammer.h"
47 
48 libhammer_fsinfo_t
49 libhammer_get_fsinfo(const char *path)
50 {
51 	struct hammer_pseudofs_data *pfs_od;
52 	struct hammer_ioc_pfs_iterate pi;
53 	struct hammer_ioc_info info;
54 	libhammer_pfsinfo_t pip;
55 	libhammer_fsinfo_t fip;
56 	int error = 0;
57 	int fd;
58 
59 	if ((fd = open(path, O_RDONLY)) < 0)
60 		return NULL;
61 
62 	fip = _libhammer_malloc(sizeof(*fip));
63 	TAILQ_INIT(&fip->list_pseudo);
64 	if ((ioctl(fd, HAMMERIOC_GET_INFO, &info)) < 0) {
65 		libhammer_free_fsinfo(fip);
66 		close(fd);
67 		return NULL;
68 	}
69 
70 	/* Fill filesystem information */
71 	snprintf(fip->vol_name, TXTLEN, "%s", info.vol_label);
72 	fip->vol_fsid = info.vol_fsid;
73 	fip->version = info.version;
74 	fip->nvolumes = info.nvolumes;
75 	fip->rootvol = info.rootvol;
76 	fip->inodes = info.inodes;
77 	fip->bigblocks = info.bigblocks;
78 	fip->freebigblocks = info.freebigblocks;
79 	fip->rsvbigblocks = info.rsvbigblocks;
80 
81 	bzero(&pi, sizeof(pi));
82 	pi.ondisk = _libhammer_malloc(sizeof(*pfs_od));
83 	while(error == 0) {
84 		error = ioctl(fd, HAMMERIOC_PFS_ITERATE, &pi);
85 		if (error == 0 && !hammer_is_pfs_deleted(pi.ondisk)) {
86 			pip = _libhammer_malloc(sizeof(*pip));
87 			pfs_od = pi.ondisk;
88 			pip->ismaster = hammer_is_pfs_master(pfs_od);
89 
90 			/*
91 			 * Fill in structs used in the library. We don't rely on
92 			 * HAMMER structs but we do fill our own.
93 			 */
94 			pip->version = fip->version;
95 			pip->pfs_id = pi.pos;
96 			pip->mirror_flags = pfs_od->mirror_flags;
97 			pip->beg_tid = pfs_od->sync_beg_tid;
98 			pip->end_tid = pfs_od->sync_end_tid;
99 			pip->mountedon =
100 			    libhammer_find_pfs_mount(&pfs_od->unique_uuid);
101 			if (fip->version < 3) {
102 				libhammer_compat_old_snapcount(pip);
103 			} else {
104 				TAILQ_INIT(&pip->list_snap);
105 				if (libhammer_pfs_get_snapshots(fip, pip) < 0)
106 					pip->snapcount = 0;
107 			}
108 
109 			/*
110 			 * PFS retrieval goes 0..n so inserting in the tail
111 			 * leaves the TAILQ sorted by pfs_id.
112 			 * This is important since quickly getting PFS #0 is
113 			 * required for some functions so *DO NOT CHANGE IT*.
114 			 */
115 			TAILQ_INSERT_TAIL(&fip->list_pseudo, pip, entries);
116 
117 		}
118 		pi.pos++;
119 	}
120 	free(pi.ondisk);
121 
122 	close (fd);
123 
124 	return (fip);
125 }
126 
127 void
128 libhammer_free_fsinfo(libhammer_fsinfo_t fip)
129 {
130 	struct libhammer_pfsinfo *pfstmp;
131 
132 	while(!TAILQ_EMPTY(&fip->list_pseudo)) {
133 		pfstmp = TAILQ_FIRST(&fip->list_pseudo);
134 		libhammer_pfs_free_snapshots(pfstmp);
135 		if (pfstmp->mountedon)
136 			free(pfstmp->mountedon);
137 		TAILQ_REMOVE(&fip->list_pseudo, pfstmp, entries);
138 		free(pfstmp);
139 	}
140 	free(fip);
141 }
142