fe5e6e2cc5
The algorithm for laying out new directories was devised in the 1980s and markedly improved the performance of the filesystem. In those days large disks had at most 100 cylinder groups and often as few as 10-20. Modern multi-terrabyte disks have thousands of cylinder groups. The original algorithm does not handle these large sizes well. This change attempts to expand the scope of the original algorithm to work well with these much larger disks while still retaining the properties of the original algorithm for small disks. The filesystem implementation is divided into policy routines and implementation routines. The policy routines can be changed in any way desired without risk of corrupting the filesystem. The policy requests are handled by the implementation layer. If the policy asks for an available resource, it is granted. But if it asks for an already in-use resource, then the implementation will provide an available one nearby the request. Thus it is impossible for a policy to double allocate. This change is limited to the policy implementation. This change updates the ffs_dirpref() routine which is responsible for selecting the cylinder group into which a new directory should be placed. If we are near the root of the filesystem we aim to spread them out as much as possible. As we descend deeper from the root we cluster them closer together around their parent as we expect them to be more closely interactive. Higher-level directories like usr/src/sys and usr/src/bin should be separated while the directories in these areas are more likely to be accessed together so should be closer. And directories within commands or kernel subsystems should be closer still. We pick a range of cylinder groups around the cylinder group of the directory in which we are being created. The size of the range for our search is based on our depth from the root of our filesystem. We then probe that range based on how many directories are already present. The first new directory is at 1/2 (middle) of the range; the second is in the first 1/4 of the range, then at 3/4, 1/8, 3/8, 5/8, 7/8, 1/16, 3/16, 5/16, etc. It is desirable to store the depth of a directory in its on-disk inode so that it is available when we need it. We add a new field di_dirdepth to track the depth of each directory. Because there are few spare fields left in the inode, we choose to share an existing field in the inode rather than having one of our own. Specifically we create a union with the di_freelink field. The di_freelink field is used to track inodes that have been unlinked but remain referenced. It is not needed until a rmdir(2) operation has been done on a directory. At that point, the directory has no contents and even if it is kept active as a current directory is no longer able to have any new directories or files created in it. Thus the use of di_dirdepth and di_freelink will never coincide. Reported by: Timo Voelker Reviewed by: kib Tested by: Peter Holm MFC after: 2 weeks Sponsored by: The FreeBSD Foundation Differential Revision: https://reviews.freebsd.org/D39246
135 lines
4.3 KiB
C
135 lines
4.3 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*
|
|
* Copyright (c) 1980, 1986, 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. 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.
|
|
*/
|
|
|
|
#if 0
|
|
#ifndef lint
|
|
static const char sccsid[] = "@(#)pass3.c 8.2 (Berkeley) 4/27/95";
|
|
#endif /* not lint */
|
|
#endif
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <ufs/ufs/dinode.h>
|
|
#include <ufs/ufs/dir.h>
|
|
#include <ufs/ffs/fs.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include "fsck.h"
|
|
|
|
void
|
|
pass3(void)
|
|
{
|
|
struct inoinfo *inp;
|
|
int loopcnt, inpindex, state;
|
|
ino_t orphan;
|
|
struct inode ip;
|
|
struct inodesc idesc;
|
|
char namebuf[UFS_MAXNAMLEN+1];
|
|
|
|
for (inpindex = inplast - 1; inpindex >= 0; inpindex--) {
|
|
if (got_siginfo) {
|
|
printf("%s: phase 3: dir %d of %d (%d%%)\n", cdevname,
|
|
(int)(inplast - inpindex - 1), (int)inplast,
|
|
(int)((inplast - inpindex - 1) * 100 / inplast));
|
|
got_siginfo = 0;
|
|
}
|
|
if (got_sigalarm) {
|
|
setproctitle("%s p3 %d%%", cdevname,
|
|
(int)((inplast - inpindex - 1) * 100 / inplast));
|
|
got_sigalarm = 0;
|
|
}
|
|
inp = inpsort[inpindex];
|
|
state = inoinfo(inp->i_number)->ino_state;
|
|
if (inp->i_number == UFS_ROOTINO ||
|
|
(inp->i_parent != 0 && !S_IS_DUNFOUND(state)))
|
|
continue;
|
|
if (state == DCLEAR || state == DZLINK)
|
|
continue;
|
|
/*
|
|
* If we are running with soft updates and we come
|
|
* across unreferenced directories, we just leave
|
|
* them in DSTATE which will cause them to be pitched
|
|
* in pass 4.
|
|
*/
|
|
if ((preen || bkgrdflag) &&
|
|
resolved && usedsoftdep && S_IS_DUNFOUND(state)) {
|
|
if (inp->i_dotdot >= UFS_ROOTINO)
|
|
inoinfo(inp->i_dotdot)->ino_linkcnt++;
|
|
continue;
|
|
}
|
|
for (loopcnt = 0; ; loopcnt++) {
|
|
orphan = inp->i_number;
|
|
if (inp->i_parent == 0 ||
|
|
!INO_IS_DUNFOUND(inp->i_parent) ||
|
|
loopcnt > countdirs)
|
|
break;
|
|
inp = getinoinfo(inp->i_parent);
|
|
}
|
|
if (loopcnt <= countdirs) {
|
|
if (linkup(orphan, inp->i_dotdot, NULL)) {
|
|
inp->i_parent = inp->i_dotdot = lfdir;
|
|
inoinfo(lfdir)->ino_linkcnt--;
|
|
}
|
|
inoinfo(orphan)->ino_state = DFOUND;
|
|
check_dirdepth(inp);
|
|
propagate();
|
|
continue;
|
|
}
|
|
pfatal("ORPHANED DIRECTORY LOOP DETECTED I=%lu",
|
|
(u_long)orphan);
|
|
if (reply("RECONNECT") == 0)
|
|
continue;
|
|
memset(&idesc, 0, sizeof(struct inodesc));
|
|
idesc.id_type = DATA;
|
|
idesc.id_number = inp->i_parent;
|
|
idesc.id_parent = orphan;
|
|
idesc.id_func = findname;
|
|
idesc.id_name = namebuf;
|
|
ginode(inp->i_parent, &ip);
|
|
if ((ckinode(ip.i_dp, &idesc) & FOUND) == 0)
|
|
pfatal("COULD NOT FIND NAME IN PARENT DIRECTORY");
|
|
if (linkup(orphan, inp->i_parent, namebuf)) {
|
|
idesc.id_func = clearentry;
|
|
if (ckinode(ip.i_dp, &idesc) & FOUND)
|
|
inoinfo(orphan)->ino_linkcnt++;
|
|
inp->i_parent = inp->i_dotdot = lfdir;
|
|
inoinfo(lfdir)->ino_linkcnt--;
|
|
}
|
|
irelse(&ip);
|
|
inoinfo(orphan)->ino_state = DFOUND;
|
|
check_dirdepth(inp);
|
|
propagate();
|
|
}
|
|
}
|