mirror of
https://git.FreeBSD.org/src.git
synced 2024-12-17 10:26:15 +00:00
1c85e6a35d
filesystem expands the inode to 256 bytes to make space for 64-bit block pointers. It also adds a file-creation time field, an ability to use jumbo blocks per inode to allow extent like pointer density, and space for extended attributes (up to twice the filesystem block size worth of attributes, e.g., on a 16K filesystem, there is space for 32K of attributes). UFS2 fully supports and runs existing UFS1 filesystems. New filesystems built using newfs can be built in either UFS1 or UFS2 format using the -O option. In this commit UFS1 is the default format, so if you want to build UFS2 format filesystems, you must specify -O 2. This default will be changed to UFS2 when UFS2 proves itself to be stable. In this commit the boot code for reading UFS2 filesystems is not compiled (see /sys/boot/common/ufsread.c) as there is insufficient space in the boot block. Once the size of the boot block is increased, this code can be defined. Things to note: the definition of SBSIZE has changed to SBLOCKSIZE. The header file <ufs/ufs/dinode.h> must be included before <ufs/ffs/fs.h> so as to get the definitions of ufs2_daddr_t and ufs_lbn_t. Still TODO: Verify that the first level bootstraps work for all the architectures. Convert the utility ffsinfo to understand UFS2 and test growfs. Add support for the extended attribute storage. Update soft updates to ensure integrity of extended attribute storage. Switch the current extended attribute interfaces to use the extended attribute storage. Add the extent like functionality (framework is there, but is currently never used). Sponsored by: DARPA & NAI Labs. Reviewed by: Poul-Henning Kamp <phk@freebsd.org>
266 lines
6.8 KiB
C
266 lines
6.8 KiB
C
/*-
|
|
* Copyright (c) 1980, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)itime.c 8.1 (Berkeley) 6/5/93";
|
|
#endif
|
|
static const char rcsid[] =
|
|
"$FreeBSD$";
|
|
#endif /* not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/queue.h>
|
|
#include <sys/time.h>
|
|
|
|
#include <ufs/ufs/dinode.h>
|
|
|
|
#include <protocols/dumprestore.h>
|
|
|
|
#include <errno.h>
|
|
#include <fcntl.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "dump.h"
|
|
|
|
struct dumptime {
|
|
struct dumpdates dt_value;
|
|
SLIST_ENTRY(dumptime) dt_list;
|
|
};
|
|
SLIST_HEAD(dthead, dumptime) dthead = SLIST_HEAD_INITIALIZER(dthead);
|
|
struct dumpdates **ddatev = 0;
|
|
int nddates = 0;
|
|
int ddates_in = 0;
|
|
|
|
static void dumprecout(FILE *, const struct dumpdates *);
|
|
static int getrecord(FILE *, struct dumpdates *);
|
|
static int makedumpdate(struct dumpdates *, const char *);
|
|
static void readdumptimes(FILE *);
|
|
|
|
void
|
|
initdumptimes(void)
|
|
{
|
|
FILE *df;
|
|
|
|
if ((df = fopen(dumpdates, "r")) == NULL) {
|
|
if (errno != ENOENT) {
|
|
msg("WARNING: cannot read %s: %s\n", dumpdates,
|
|
strerror(errno));
|
|
return;
|
|
}
|
|
/*
|
|
* Dumpdates does not exist, make an empty one.
|
|
*/
|
|
msg("WARNING: no file `%s', making an empty one\n", dumpdates);
|
|
if ((df = fopen(dumpdates, "w")) == NULL) {
|
|
msg("WARNING: cannot create %s: %s\n", dumpdates,
|
|
strerror(errno));
|
|
return;
|
|
}
|
|
(void) fclose(df);
|
|
if ((df = fopen(dumpdates, "r")) == NULL) {
|
|
quit("cannot read %s even after creating it: %s\n",
|
|
dumpdates, strerror(errno));
|
|
/* NOTREACHED */
|
|
}
|
|
}
|
|
(void) flock(fileno(df), LOCK_SH);
|
|
readdumptimes(df);
|
|
(void) fclose(df);
|
|
}
|
|
|
|
static void
|
|
readdumptimes(FILE *df)
|
|
{
|
|
int i;
|
|
struct dumptime *dtwalk;
|
|
|
|
for (;;) {
|
|
dtwalk = (struct dumptime *)calloc(1, sizeof (struct dumptime));
|
|
if (getrecord(df, &(dtwalk->dt_value)) < 0)
|
|
break;
|
|
nddates++;
|
|
SLIST_INSERT_HEAD(&dthead, dtwalk, dt_list);
|
|
}
|
|
|
|
ddates_in = 1;
|
|
/*
|
|
* arrayify the list, leaving enough room for the additional
|
|
* record that we may have to add to the ddate structure
|
|
*/
|
|
ddatev = (struct dumpdates **)
|
|
calloc((unsigned) (nddates + 1), sizeof (struct dumpdates *));
|
|
dtwalk = SLIST_FIRST(&dthead);
|
|
for (i = nddates - 1; i >= 0; i--, dtwalk = SLIST_NEXT(dtwalk, dt_list))
|
|
ddatev[i] = &dtwalk->dt_value;
|
|
}
|
|
|
|
void
|
|
getdumptime(void)
|
|
{
|
|
struct dumpdates *ddp;
|
|
int i;
|
|
char *fname;
|
|
|
|
fname = disk;
|
|
#ifdef FDEBUG
|
|
msg("Looking for name %s in dumpdates = %s for level = %c\n",
|
|
fname, dumpdates, level);
|
|
#endif
|
|
spcl.c_ddate = 0;
|
|
lastlevel = '0';
|
|
|
|
initdumptimes();
|
|
/*
|
|
* Go find the entry with the same name for a lower increment
|
|
* and older date
|
|
*/
|
|
ITITERATE(i, ddp) {
|
|
if (strncmp(fname, ddp->dd_name, sizeof (ddp->dd_name)) != 0)
|
|
continue;
|
|
if (ddp->dd_level >= level)
|
|
continue;
|
|
if (ddp->dd_ddate <= _time64_to_time(spcl.c_ddate))
|
|
continue;
|
|
spcl.c_ddate = _time_to_time64(ddp->dd_ddate);
|
|
lastlevel = ddp->dd_level;
|
|
}
|
|
}
|
|
|
|
void
|
|
putdumptime(void)
|
|
{
|
|
FILE *df;
|
|
struct dumpdates *dtwalk;
|
|
int i;
|
|
int fd;
|
|
char *fname;
|
|
char *tmsg;
|
|
|
|
if(uflag == 0)
|
|
return;
|
|
if ((df = fopen(dumpdates, "r+")) == NULL)
|
|
quit("cannot rewrite %s: %s\n", dumpdates, strerror(errno));
|
|
fd = fileno(df);
|
|
(void) flock(fd, LOCK_EX);
|
|
fname = disk;
|
|
free((char *)ddatev);
|
|
ddatev = 0;
|
|
nddates = 0;
|
|
ddates_in = 0;
|
|
readdumptimes(df);
|
|
if (fseek(df, 0L, 0) < 0)
|
|
quit("fseek: %s\n", strerror(errno));
|
|
spcl.c_ddate = 0;
|
|
ITITERATE(i, dtwalk) {
|
|
if (strncmp(fname, dtwalk->dd_name,
|
|
sizeof (dtwalk->dd_name)) != 0)
|
|
continue;
|
|
if (dtwalk->dd_level != level)
|
|
continue;
|
|
goto found;
|
|
}
|
|
/*
|
|
* construct the new upper bound;
|
|
* Enough room has been allocated.
|
|
*/
|
|
dtwalk = ddatev[nddates] =
|
|
(struct dumpdates *)calloc(1, sizeof (struct dumpdates));
|
|
nddates += 1;
|
|
found:
|
|
(void) strncpy(dtwalk->dd_name, fname, sizeof (dtwalk->dd_name));
|
|
dtwalk->dd_level = level;
|
|
dtwalk->dd_ddate = _time64_to_time(spcl.c_date);
|
|
|
|
ITITERATE(i, dtwalk) {
|
|
dumprecout(df, dtwalk);
|
|
}
|
|
if (fflush(df))
|
|
quit("%s: %s\n", dumpdates, strerror(errno));
|
|
if (ftruncate(fd, ftell(df)))
|
|
quit("ftruncate (%s): %s\n", dumpdates, strerror(errno));
|
|
(void) fclose(df);
|
|
if (spcl.c_date == 0) {
|
|
tmsg = "the epoch\n";
|
|
} else {
|
|
time_t t = _time64_to_time(spcl.c_date);
|
|
tmsg = ctime(&t);
|
|
}
|
|
msg("level %c dump on %s", level, tmsg);
|
|
}
|
|
|
|
static void
|
|
dumprecout(FILE *file, const struct dumpdates *what)
|
|
{
|
|
|
|
if (fprintf(file, DUMPOUTFMT, what->dd_name,
|
|
what->dd_level, ctime(&what->dd_ddate)) < 0)
|
|
quit("%s: %s\n", dumpdates, strerror(errno));
|
|
}
|
|
|
|
int recno;
|
|
|
|
static int
|
|
getrecord(FILE *df, struct dumpdates *ddatep)
|
|
{
|
|
char tbuf[BUFSIZ];
|
|
|
|
recno = 0;
|
|
if ( (fgets(tbuf, sizeof (tbuf), df)) != tbuf)
|
|
return(-1);
|
|
recno++;
|
|
if (makedumpdate(ddatep, tbuf) < 0)
|
|
msg("Unknown intermediate format in %s, line %d\n",
|
|
dumpdates, recno);
|
|
|
|
#ifdef FDEBUG
|
|
msg("getrecord: %s %c %s", ddatep->dd_name, ddatep->dd_level,
|
|
ddatep->dd_ddate == 0 ? "the epoch\n" : ctime(&ddatep->dd_ddate));
|
|
#endif
|
|
return(0);
|
|
}
|
|
|
|
static int
|
|
makedumpdate(struct dumpdates *ddp, const char *tbuf)
|
|
{
|
|
char un_buf[128];
|
|
|
|
(void) sscanf(tbuf, DUMPINFMT, ddp->dd_name, &ddp->dd_level, un_buf);
|
|
ddp->dd_ddate = unctime(un_buf);
|
|
if (ddp->dd_ddate < 0)
|
|
return(-1);
|
|
return(0);
|
|
}
|