mirror of
https://github.com/linux-msm/laptops-kernel.git
synced 2026-08-13 14:19:53 -07:00
Revert "fs: Remove NTFS classic"
This reverts commit 7ffa8f3d30.
Reverts the removal of the classic read-only ntfs driver to
serve as the base for a new read-write ntfs implementation.
If we stack changes on top of the revert patch, It will significantly
reduce the diff size, making the review easier.
This revert intentionally excludes the restoration of Kconfig and
Makefile. The Kconfig and Makefile will be added back in the final patch
of this series, enabling the driver only after all features and
improvements have been applied.
Acked-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Namjae Jeon <linkinjeon@kernel.org>
This commit is contained in:
Namjae Jeon
@@ -71,11 +71,6 @@ D: dosfs, LILO, some fd features, ATM, various other hacks here and there
|
|||||||
S: Buenos Aires
|
S: Buenos Aires
|
||||||
S: Argentina
|
S: Argentina
|
||||||
|
|
||||||
NTFS FILESYSTEM
|
|
||||||
N: Anton Altaparmakov
|
|
||||||
E: anton@tuxera.com
|
|
||||||
D: NTFS filesystem
|
|
||||||
|
|
||||||
N: Tim Alpaerts
|
N: Tim Alpaerts
|
||||||
E: tim_alpaerts@toyota-motor-europe.com
|
E: tim_alpaerts@toyota-motor-europe.com
|
||||||
D: 802.2 class II logical link control layer,
|
D: 802.2 class II logical link control layer,
|
||||||
|
|||||||
@@ -0,0 +1,466 @@
|
|||||||
|
.. SPDX-License-Identifier: GPL-2.0
|
||||||
|
|
||||||
|
================================
|
||||||
|
The Linux NTFS filesystem driver
|
||||||
|
================================
|
||||||
|
|
||||||
|
|
||||||
|
.. Table of contents
|
||||||
|
|
||||||
|
- Overview
|
||||||
|
- Web site
|
||||||
|
- Features
|
||||||
|
- Supported mount options
|
||||||
|
- Known bugs and (mis-)features
|
||||||
|
- Using NTFS volume and stripe sets
|
||||||
|
- The Device-Mapper driver
|
||||||
|
- The Software RAID / MD driver
|
||||||
|
- Limitations when using the MD driver
|
||||||
|
|
||||||
|
|
||||||
|
Overview
|
||||||
|
========
|
||||||
|
|
||||||
|
Linux-NTFS comes with a number of user-space programs known as ntfsprogs.
|
||||||
|
These include mkntfs, a full-featured ntfs filesystem format utility,
|
||||||
|
ntfsundelete used for recovering files that were unintentionally deleted
|
||||||
|
from an NTFS volume and ntfsresize which is used to resize an NTFS partition.
|
||||||
|
See the web site for more information.
|
||||||
|
|
||||||
|
To mount an NTFS 1.2/3.x (Windows NT4/2000/XP/2003) volume, use the file
|
||||||
|
system type 'ntfs'. The driver currently supports read-only mode (with no
|
||||||
|
fault-tolerance, encryption or journalling) and very limited, but safe, write
|
||||||
|
support.
|
||||||
|
|
||||||
|
For fault tolerance and raid support (i.e. volume and stripe sets), you can
|
||||||
|
use the kernel's Software RAID / MD driver. See section "Using Software RAID
|
||||||
|
with NTFS" for details.
|
||||||
|
|
||||||
|
|
||||||
|
Web site
|
||||||
|
========
|
||||||
|
|
||||||
|
There is plenty of additional information on the linux-ntfs web site
|
||||||
|
at http://www.linux-ntfs.org/
|
||||||
|
|
||||||
|
The web site has a lot of additional information, such as a comprehensive
|
||||||
|
FAQ, documentation on the NTFS on-disk format, information on the Linux-NTFS
|
||||||
|
userspace utilities, etc.
|
||||||
|
|
||||||
|
|
||||||
|
Features
|
||||||
|
========
|
||||||
|
|
||||||
|
- This is a complete rewrite of the NTFS driver that used to be in the 2.4 and
|
||||||
|
earlier kernels. This new driver implements NTFS read support and is
|
||||||
|
functionally equivalent to the old ntfs driver and it also implements limited
|
||||||
|
write support. The biggest limitation at present is that files/directories
|
||||||
|
cannot be created or deleted. See below for the list of write features that
|
||||||
|
are so far supported. Another limitation is that writing to compressed files
|
||||||
|
is not implemented at all. Also, neither read nor write access to encrypted
|
||||||
|
files is so far implemented.
|
||||||
|
- The new driver has full support for sparse files on NTFS 3.x volumes which
|
||||||
|
the old driver isn't happy with.
|
||||||
|
- The new driver supports execution of binaries due to mmap() now being
|
||||||
|
supported.
|
||||||
|
- The new driver supports loopback mounting of files on NTFS which is used by
|
||||||
|
some Linux distributions to enable the user to run Linux from an NTFS
|
||||||
|
partition by creating a large file while in Windows and then loopback
|
||||||
|
mounting the file while in Linux and creating a Linux filesystem on it that
|
||||||
|
is used to install Linux on it.
|
||||||
|
- A comparison of the two drivers using::
|
||||||
|
|
||||||
|
time find . -type f -exec md5sum "{}" \;
|
||||||
|
|
||||||
|
run three times in sequence with each driver (after a reboot) on a 1.4GiB
|
||||||
|
NTFS partition, showed the new driver to be 20% faster in total time elapsed
|
||||||
|
(from 9:43 minutes on average down to 7:53). The time spent in user space
|
||||||
|
was unchanged but the time spent in the kernel was decreased by a factor of
|
||||||
|
2.5 (from 85 CPU seconds down to 33).
|
||||||
|
- The driver does not support short file names in general. For backwards
|
||||||
|
compatibility, we implement access to files using their short file names if
|
||||||
|
they exist. The driver will not create short file names however, and a
|
||||||
|
rename will discard any existing short file name.
|
||||||
|
- The new driver supports exporting of mounted NTFS volumes via NFS.
|
||||||
|
- The new driver supports async io (aio).
|
||||||
|
- The new driver supports fsync(2), fdatasync(2), and msync(2).
|
||||||
|
- The new driver supports readv(2) and writev(2).
|
||||||
|
- The new driver supports access time updates (including mtime and ctime).
|
||||||
|
- The new driver supports truncate(2) and open(2) with O_TRUNC. But at present
|
||||||
|
only very limited support for highly fragmented files, i.e. ones which have
|
||||||
|
their data attribute split across multiple extents, is included. Another
|
||||||
|
limitation is that at present truncate(2) will never create sparse files,
|
||||||
|
since to mark a file sparse we need to modify the directory entry for the
|
||||||
|
file and we do not implement directory modifications yet.
|
||||||
|
- The new driver supports write(2) which can both overwrite existing data and
|
||||||
|
extend the file size so that you can write beyond the existing data. Also,
|
||||||
|
writing into sparse regions is supported and the holes are filled in with
|
||||||
|
clusters. But at present only limited support for highly fragmented files,
|
||||||
|
i.e. ones which have their data attribute split across multiple extents, is
|
||||||
|
included. Another limitation is that write(2) will never create sparse
|
||||||
|
files, since to mark a file sparse we need to modify the directory entry for
|
||||||
|
the file and we do not implement directory modifications yet.
|
||||||
|
|
||||||
|
Supported mount options
|
||||||
|
=======================
|
||||||
|
|
||||||
|
In addition to the generic mount options described by the manual page for the
|
||||||
|
mount command (man 8 mount, also see man 5 fstab), the NTFS driver supports the
|
||||||
|
following mount options:
|
||||||
|
|
||||||
|
======================= =======================================================
|
||||||
|
iocharset=name Deprecated option. Still supported but please use
|
||||||
|
nls=name in the future. See description for nls=name.
|
||||||
|
|
||||||
|
nls=name Character set to use when returning file names.
|
||||||
|
Unlike VFAT, NTFS suppresses names that contain
|
||||||
|
unconvertible characters. Note that most character
|
||||||
|
sets contain insufficient characters to represent all
|
||||||
|
possible Unicode characters that can exist on NTFS.
|
||||||
|
To be sure you are not missing any files, you are
|
||||||
|
advised to use nls=utf8 which is capable of
|
||||||
|
representing all Unicode characters.
|
||||||
|
|
||||||
|
utf8=<bool> Option no longer supported. Currently mapped to
|
||||||
|
nls=utf8 but please use nls=utf8 in the future and
|
||||||
|
make sure utf8 is compiled either as module or into
|
||||||
|
the kernel. See description for nls=name.
|
||||||
|
|
||||||
|
uid=
|
||||||
|
gid=
|
||||||
|
umask= Provide default owner, group, and access mode mask.
|
||||||
|
These options work as documented in mount(8). By
|
||||||
|
default, the files/directories are owned by root and
|
||||||
|
he/she has read and write permissions, as well as
|
||||||
|
browse permission for directories. No one else has any
|
||||||
|
access permissions. I.e. the mode on all files is by
|
||||||
|
default rw------- and for directories rwx------, a
|
||||||
|
consequence of the default fmask=0177 and dmask=0077.
|
||||||
|
Using a umask of zero will grant all permissions to
|
||||||
|
everyone, i.e. all files and directories will have mode
|
||||||
|
rwxrwxrwx.
|
||||||
|
|
||||||
|
fmask=
|
||||||
|
dmask= Instead of specifying umask which applies both to
|
||||||
|
files and directories, fmask applies only to files and
|
||||||
|
dmask only to directories.
|
||||||
|
|
||||||
|
sloppy=<BOOL> If sloppy is specified, ignore unknown mount options.
|
||||||
|
Otherwise the default behaviour is to abort mount if
|
||||||
|
any unknown options are found.
|
||||||
|
|
||||||
|
show_sys_files=<BOOL> If show_sys_files is specified, show the system files
|
||||||
|
in directory listings. Otherwise the default behaviour
|
||||||
|
is to hide the system files.
|
||||||
|
Note that even when show_sys_files is specified, "$MFT"
|
||||||
|
will not be visible due to bugs/mis-features in glibc.
|
||||||
|
Further, note that irrespective of show_sys_files, all
|
||||||
|
files are accessible by name, i.e. you can always do
|
||||||
|
"ls -l \$UpCase" for example to specifically show the
|
||||||
|
system file containing the Unicode upcase table.
|
||||||
|
|
||||||
|
case_sensitive=<BOOL> If case_sensitive is specified, treat all file names as
|
||||||
|
case sensitive and create file names in the POSIX
|
||||||
|
namespace. Otherwise the default behaviour is to treat
|
||||||
|
file names as case insensitive and to create file names
|
||||||
|
in the WIN32/LONG name space. Note, the Linux NTFS
|
||||||
|
driver will never create short file names and will
|
||||||
|
remove them on rename/delete of the corresponding long
|
||||||
|
file name.
|
||||||
|
Note that files remain accessible via their short file
|
||||||
|
name, if it exists. If case_sensitive, you will need
|
||||||
|
to provide the correct case of the short file name.
|
||||||
|
|
||||||
|
disable_sparse=<BOOL> If disable_sparse is specified, creation of sparse
|
||||||
|
regions, i.e. holes, inside files is disabled for the
|
||||||
|
volume (for the duration of this mount only). By
|
||||||
|
default, creation of sparse regions is enabled, which
|
||||||
|
is consistent with the behaviour of traditional Unix
|
||||||
|
filesystems.
|
||||||
|
|
||||||
|
errors=opt What to do when critical filesystem errors are found.
|
||||||
|
Following values can be used for "opt":
|
||||||
|
|
||||||
|
======== =========================================
|
||||||
|
continue DEFAULT, try to clean-up as much as
|
||||||
|
possible, e.g. marking a corrupt inode as
|
||||||
|
bad so it is no longer accessed, and then
|
||||||
|
continue.
|
||||||
|
recover At present only supported is recovery of
|
||||||
|
the boot sector from the backup copy.
|
||||||
|
If read-only mount, the recovery is done
|
||||||
|
in memory only and not written to disk.
|
||||||
|
======== =========================================
|
||||||
|
|
||||||
|
Note that the options are additive, i.e. specifying::
|
||||||
|
|
||||||
|
errors=continue,errors=recover
|
||||||
|
|
||||||
|
means the driver will attempt to recover and if that
|
||||||
|
fails it will clean-up as much as possible and
|
||||||
|
continue.
|
||||||
|
|
||||||
|
mft_zone_multiplier= Set the MFT zone multiplier for the volume (this
|
||||||
|
setting is not persistent across mounts and can be
|
||||||
|
changed from mount to mount but cannot be changed on
|
||||||
|
remount). Values of 1 to 4 are allowed, 1 being the
|
||||||
|
default. The MFT zone multiplier determines how much
|
||||||
|
space is reserved for the MFT on the volume. If all
|
||||||
|
other space is used up, then the MFT zone will be
|
||||||
|
shrunk dynamically, so this has no impact on the
|
||||||
|
amount of free space. However, it can have an impact
|
||||||
|
on performance by affecting fragmentation of the MFT.
|
||||||
|
In general use the default. If you have a lot of small
|
||||||
|
files then use a higher value. The values have the
|
||||||
|
following meaning:
|
||||||
|
|
||||||
|
===== =================================
|
||||||
|
Value MFT zone size (% of volume size)
|
||||||
|
===== =================================
|
||||||
|
1 12.5%
|
||||||
|
2 25%
|
||||||
|
3 37.5%
|
||||||
|
4 50%
|
||||||
|
===== =================================
|
||||||
|
|
||||||
|
Note this option is irrelevant for read-only mounts.
|
||||||
|
======================= =======================================================
|
||||||
|
|
||||||
|
|
||||||
|
Known bugs and (mis-)features
|
||||||
|
=============================
|
||||||
|
|
||||||
|
- The link count on each directory inode entry is set to 1, due to Linux not
|
||||||
|
supporting directory hard links. This may well confuse some user space
|
||||||
|
applications, since the directory names will have the same inode numbers.
|
||||||
|
This also speeds up ntfs_read_inode() immensely. And we haven't found any
|
||||||
|
problems with this approach so far. If you find a problem with this, please
|
||||||
|
let us know.
|
||||||
|
|
||||||
|
|
||||||
|
Please send bug reports/comments/feedback/abuse to the Linux-NTFS development
|
||||||
|
list at sourceforge: linux-ntfs-dev@lists.sourceforge.net
|
||||||
|
|
||||||
|
|
||||||
|
Using NTFS volume and stripe sets
|
||||||
|
=================================
|
||||||
|
|
||||||
|
For support of volume and stripe sets, you can either use the kernel's
|
||||||
|
Device-Mapper driver or the kernel's Software RAID / MD driver. The former is
|
||||||
|
the recommended one to use for linear raid. But the latter is required for
|
||||||
|
raid level 5. For striping and mirroring, either driver should work fine.
|
||||||
|
|
||||||
|
|
||||||
|
The Device-Mapper driver
|
||||||
|
------------------------
|
||||||
|
|
||||||
|
You will need to create a table of the components of the volume/stripe set and
|
||||||
|
how they fit together and load this into the kernel using the dmsetup utility
|
||||||
|
(see man 8 dmsetup).
|
||||||
|
|
||||||
|
Linear volume sets, i.e. linear raid, has been tested and works fine. Even
|
||||||
|
though untested, there is no reason why stripe sets, i.e. raid level 0, and
|
||||||
|
mirrors, i.e. raid level 1 should not work, too. Stripes with parity, i.e.
|
||||||
|
raid level 5, unfortunately cannot work yet because the current version of the
|
||||||
|
Device-Mapper driver does not support raid level 5. You may be able to use the
|
||||||
|
Software RAID / MD driver for raid level 5, see the next section for details.
|
||||||
|
|
||||||
|
To create the table describing your volume you will need to know each of its
|
||||||
|
components and their sizes in sectors, i.e. multiples of 512-byte blocks.
|
||||||
|
|
||||||
|
For NT4 fault tolerant volumes you can obtain the sizes using fdisk. So for
|
||||||
|
example if one of your partitions is /dev/hda2 you would do::
|
||||||
|
|
||||||
|
$ fdisk -ul /dev/hda
|
||||||
|
|
||||||
|
Disk /dev/hda: 81.9 GB, 81964302336 bytes
|
||||||
|
255 heads, 63 sectors/track, 9964 cylinders, total 160086528 sectors
|
||||||
|
Units = sectors of 1 * 512 = 512 bytes
|
||||||
|
|
||||||
|
Device Boot Start End Blocks Id System
|
||||||
|
/dev/hda1 * 63 4209029 2104483+ 83 Linux
|
||||||
|
/dev/hda2 4209030 37768814 16779892+ 86 NTFS
|
||||||
|
/dev/hda3 37768815 46170809 4200997+ 83 Linux
|
||||||
|
|
||||||
|
And you would know that /dev/hda2 has a size of 37768814 - 4209030 + 1 =
|
||||||
|
33559785 sectors.
|
||||||
|
|
||||||
|
For Win2k and later dynamic disks, you can for example use the ldminfo utility
|
||||||
|
which is part of the Linux LDM tools (the latest version at the time of
|
||||||
|
writing is linux-ldm-0.0.8.tar.bz2). You can download it from:
|
||||||
|
|
||||||
|
http://www.linux-ntfs.org/
|
||||||
|
|
||||||
|
Simply extract the downloaded archive (tar xvjf linux-ldm-0.0.8.tar.bz2), go
|
||||||
|
into it (cd linux-ldm-0.0.8) and change to the test directory (cd test). You
|
||||||
|
will find the precompiled (i386) ldminfo utility there. NOTE: You will not be
|
||||||
|
able to compile this yourself easily so use the binary version!
|
||||||
|
|
||||||
|
Then you would use ldminfo in dump mode to obtain the necessary information::
|
||||||
|
|
||||||
|
$ ./ldminfo --dump /dev/hda
|
||||||
|
|
||||||
|
This would dump the LDM database found on /dev/hda which describes all of your
|
||||||
|
dynamic disks and all the volumes on them. At the bottom you will see the
|
||||||
|
VOLUME DEFINITIONS section which is all you really need. You may need to look
|
||||||
|
further above to determine which of the disks in the volume definitions is
|
||||||
|
which device in Linux. Hint: Run ldminfo on each of your dynamic disks and
|
||||||
|
look at the Disk Id close to the top of the output for each (the PRIVATE HEADER
|
||||||
|
section). You can then find these Disk Ids in the VBLK DATABASE section in the
|
||||||
|
<Disk> components where you will get the LDM Name for the disk that is found in
|
||||||
|
the VOLUME DEFINITIONS section.
|
||||||
|
|
||||||
|
Note you will also need to enable the LDM driver in the Linux kernel. If your
|
||||||
|
distribution did not enable it, you will need to recompile the kernel with it
|
||||||
|
enabled. This will create the LDM partitions on each device at boot time. You
|
||||||
|
would then use those devices (for /dev/hda they would be /dev/hda1, 2, 3, etc)
|
||||||
|
in the Device-Mapper table.
|
||||||
|
|
||||||
|
You can also bypass using the LDM driver by using the main device (e.g.
|
||||||
|
/dev/hda) and then using the offsets of the LDM partitions into this device as
|
||||||
|
the "Start sector of device" when creating the table. Once again ldminfo would
|
||||||
|
give you the correct information to do this.
|
||||||
|
|
||||||
|
Assuming you know all your devices and their sizes things are easy.
|
||||||
|
|
||||||
|
For a linear raid the table would look like this (note all values are in
|
||||||
|
512-byte sectors)::
|
||||||
|
|
||||||
|
# Offset into Size of this Raid type Device Start sector
|
||||||
|
# volume device of device
|
||||||
|
0 1028161 linear /dev/hda1 0
|
||||||
|
1028161 3903762 linear /dev/hdb2 0
|
||||||
|
4931923 2103211 linear /dev/hdc1 0
|
||||||
|
|
||||||
|
For a striped volume, i.e. raid level 0, you will need to know the chunk size
|
||||||
|
you used when creating the volume. Windows uses 64kiB as the default, so it
|
||||||
|
will probably be this unless you changes the defaults when creating the array.
|
||||||
|
|
||||||
|
For a raid level 0 the table would look like this (note all values are in
|
||||||
|
512-byte sectors)::
|
||||||
|
|
||||||
|
# Offset Size Raid Number Chunk 1st Start 2nd Start
|
||||||
|
# into of the type of size Device in Device in
|
||||||
|
# volume volume stripes device device
|
||||||
|
0 2056320 striped 2 128 /dev/hda1 0 /dev/hdb1 0
|
||||||
|
|
||||||
|
If there are more than two devices, just add each of them to the end of the
|
||||||
|
line.
|
||||||
|
|
||||||
|
Finally, for a mirrored volume, i.e. raid level 1, the table would look like
|
||||||
|
this (note all values are in 512-byte sectors)::
|
||||||
|
|
||||||
|
# Ofs Size Raid Log Number Region Should Number Source Start Target Start
|
||||||
|
# in of the type type of log size sync? of Device in Device in
|
||||||
|
# vol volume params mirrors Device Device
|
||||||
|
0 2056320 mirror core 2 16 nosync 2 /dev/hda1 0 /dev/hdb1 0
|
||||||
|
|
||||||
|
If you are mirroring to multiple devices you can specify further targets at the
|
||||||
|
end of the line.
|
||||||
|
|
||||||
|
Note the "Should sync?" parameter "nosync" means that the two mirrors are
|
||||||
|
already in sync which will be the case on a clean shutdown of Windows. If the
|
||||||
|
mirrors are not clean, you can specify the "sync" option instead of "nosync"
|
||||||
|
and the Device-Mapper driver will then copy the entirety of the "Source Device"
|
||||||
|
to the "Target Device" or if you specified multiple target devices to all of
|
||||||
|
them.
|
||||||
|
|
||||||
|
Once you have your table, save it in a file somewhere (e.g. /etc/ntfsvolume1),
|
||||||
|
and hand it over to dmsetup to work with, like so::
|
||||||
|
|
||||||
|
$ dmsetup create myvolume1 /etc/ntfsvolume1
|
||||||
|
|
||||||
|
You can obviously replace "myvolume1" with whatever name you like.
|
||||||
|
|
||||||
|
If it all worked, you will now have the device /dev/device-mapper/myvolume1
|
||||||
|
which you can then just use as an argument to the mount command as usual to
|
||||||
|
mount the ntfs volume. For example::
|
||||||
|
|
||||||
|
$ mount -t ntfs -o ro /dev/device-mapper/myvolume1 /mnt/myvol1
|
||||||
|
|
||||||
|
(You need to create the directory /mnt/myvol1 first and of course you can use
|
||||||
|
anything you like instead of /mnt/myvol1 as long as it is an existing
|
||||||
|
directory.)
|
||||||
|
|
||||||
|
It is advisable to do the mount read-only to see if the volume has been setup
|
||||||
|
correctly to avoid the possibility of causing damage to the data on the ntfs
|
||||||
|
volume.
|
||||||
|
|
||||||
|
|
||||||
|
The Software RAID / MD driver
|
||||||
|
-----------------------------
|
||||||
|
|
||||||
|
An alternative to using the Device-Mapper driver is to use the kernel's
|
||||||
|
Software RAID / MD driver. For which you need to set up your /etc/raidtab
|
||||||
|
appropriately (see man 5 raidtab).
|
||||||
|
|
||||||
|
Linear volume sets, i.e. linear raid, as well as stripe sets, i.e. raid level
|
||||||
|
0, have been tested and work fine (though see section "Limitations when using
|
||||||
|
the MD driver with NTFS volumes" especially if you want to use linear raid).
|
||||||
|
Even though untested, there is no reason why mirrors, i.e. raid level 1, and
|
||||||
|
stripes with parity, i.e. raid level 5, should not work, too.
|
||||||
|
|
||||||
|
You have to use the "persistent-superblock 0" option for each raid-disk in the
|
||||||
|
NTFS volume/stripe you are configuring in /etc/raidtab as the persistent
|
||||||
|
superblock used by the MD driver would damage the NTFS volume.
|
||||||
|
|
||||||
|
Windows by default uses a stripe chunk size of 64k, so you probably want the
|
||||||
|
"chunk-size 64k" option for each raid-disk, too.
|
||||||
|
|
||||||
|
For example, if you have a stripe set consisting of two partitions /dev/hda5
|
||||||
|
and /dev/hdb1 your /etc/raidtab would look like this::
|
||||||
|
|
||||||
|
raiddev /dev/md0
|
||||||
|
raid-level 0
|
||||||
|
nr-raid-disks 2
|
||||||
|
nr-spare-disks 0
|
||||||
|
persistent-superblock 0
|
||||||
|
chunk-size 64k
|
||||||
|
device /dev/hda5
|
||||||
|
raid-disk 0
|
||||||
|
device /dev/hdb1
|
||||||
|
raid-disk 1
|
||||||
|
|
||||||
|
For linear raid, just change the raid-level above to "raid-level linear", for
|
||||||
|
mirrors, change it to "raid-level 1", and for stripe sets with parity, change
|
||||||
|
it to "raid-level 5".
|
||||||
|
|
||||||
|
Note for stripe sets with parity you will also need to tell the MD driver
|
||||||
|
which parity algorithm to use by specifying the option "parity-algorithm
|
||||||
|
which", where you need to replace "which" with the name of the algorithm to
|
||||||
|
use (see man 5 raidtab for available algorithms) and you will have to try the
|
||||||
|
different available algorithms until you find one that works. Make sure you
|
||||||
|
are working read-only when playing with this as you may damage your data
|
||||||
|
otherwise. If you find which algorithm works please let us know (email the
|
||||||
|
linux-ntfs developers list linux-ntfs-dev@lists.sourceforge.net or drop in on
|
||||||
|
IRC in channel #ntfs on the irc.freenode.net network) so we can update this
|
||||||
|
documentation.
|
||||||
|
|
||||||
|
Once the raidtab is setup, run for example raid0run -a to start all devices or
|
||||||
|
raid0run /dev/md0 to start a particular md device, in this case /dev/md0.
|
||||||
|
|
||||||
|
Then just use the mount command as usual to mount the ntfs volume using for
|
||||||
|
example::
|
||||||
|
|
||||||
|
mount -t ntfs -o ro /dev/md0 /mnt/myntfsvolume
|
||||||
|
|
||||||
|
It is advisable to do the mount read-only to see if the md volume has been
|
||||||
|
setup correctly to avoid the possibility of causing damage to the data on the
|
||||||
|
ntfs volume.
|
||||||
|
|
||||||
|
|
||||||
|
Limitations when using the Software RAID / MD driver
|
||||||
|
-----------------------------------------------------
|
||||||
|
|
||||||
|
Using the md driver will not work properly if any of your NTFS partitions have
|
||||||
|
an odd number of sectors. This is especially important for linear raid as all
|
||||||
|
data after the first partition with an odd number of sectors will be offset by
|
||||||
|
one or more sectors so if you mount such a partition with write support you
|
||||||
|
will cause massive damage to the data on the volume which will only become
|
||||||
|
apparent when you try to use the volume again under Windows.
|
||||||
|
|
||||||
|
So when using linear raid, make sure that all your partitions have an even
|
||||||
|
number of sectors BEFORE attempting to use it. You have been warned!
|
||||||
|
|
||||||
|
Even better is to simply use the Device-Mapper for linear raid and then you do
|
||||||
|
not have this problem with odd numbers of sectors.
|
||||||
+10
@@ -18867,6 +18867,16 @@ W: https://github.com/davejiang/linux/wiki
|
|||||||
T: git https://github.com/davejiang/linux.git
|
T: git https://github.com/davejiang/linux.git
|
||||||
F: drivers/ntb/hw/intel/
|
F: drivers/ntb/hw/intel/
|
||||||
|
|
||||||
|
NTFS FILESYSTEM
|
||||||
|
M: Anton Altaparmakov <anton@tuxera.com>
|
||||||
|
R: Namjae Jeon <linkinjeon@kernel.org>
|
||||||
|
L: linux-ntfs-dev@lists.sourceforge.net
|
||||||
|
S: Supported
|
||||||
|
W: http://www.tuxera.com/
|
||||||
|
T: git git://git.kernel.org/pub/scm/linux/kernel/git/aia21/ntfs.git
|
||||||
|
F: Documentation/filesystems/ntfs.rst
|
||||||
|
F: fs/ntfs/
|
||||||
|
|
||||||
NTFS3 FILESYSTEM
|
NTFS3 FILESYSTEM
|
||||||
M: Konstantin Komarov <almaz.alexandrovich@paragon-software.com>
|
M: Konstantin Komarov <almaz.alexandrovich@paragon-software.com>
|
||||||
L: ntfs3@lists.linux.dev
|
L: ntfs3@lists.linux.dev
|
||||||
|
|||||||
+1744
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,88 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* aops.h - Defines for NTFS kernel address space operations and page cache
|
||||||
|
* handling. Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2001-2004 Anton Altaparmakov
|
||||||
|
* Copyright (c) 2002 Richard Russon
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_AOPS_H
|
||||||
|
#define _LINUX_NTFS_AOPS_H
|
||||||
|
|
||||||
|
#include <linux/mm.h>
|
||||||
|
#include <linux/highmem.h>
|
||||||
|
#include <linux/pagemap.h>
|
||||||
|
#include <linux/fs.h>
|
||||||
|
|
||||||
|
#include "inode.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_unmap_page - release a page that was mapped using ntfs_map_page()
|
||||||
|
* @page: the page to release
|
||||||
|
*
|
||||||
|
* Unpin, unmap and release a page that was obtained from ntfs_map_page().
|
||||||
|
*/
|
||||||
|
static inline void ntfs_unmap_page(struct page *page)
|
||||||
|
{
|
||||||
|
kunmap(page);
|
||||||
|
put_page(page);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_map_page - map a page into accessible memory, reading it if necessary
|
||||||
|
* @mapping: address space for which to obtain the page
|
||||||
|
* @index: index into the page cache for @mapping of the page to map
|
||||||
|
*
|
||||||
|
* Read a page from the page cache of the address space @mapping at position
|
||||||
|
* @index, where @index is in units of PAGE_SIZE, and not in bytes.
|
||||||
|
*
|
||||||
|
* If the page is not in memory it is loaded from disk first using the
|
||||||
|
* read_folio method defined in the address space operations of @mapping
|
||||||
|
* and the page is added to the page cache of @mapping in the process.
|
||||||
|
*
|
||||||
|
* If the page belongs to an mst protected attribute and it is marked as such
|
||||||
|
* in its ntfs inode (NInoMstProtected()) the mst fixups are applied but no
|
||||||
|
* error checking is performed. This means the caller has to verify whether
|
||||||
|
* the ntfs record(s) contained in the page are valid or not using one of the
|
||||||
|
* ntfs_is_XXXX_record{,p}() macros, where XXXX is the record type you are
|
||||||
|
* expecting to see. (For details of the macros, see fs/ntfs/layout.h.)
|
||||||
|
*
|
||||||
|
* If the page is in high memory it is mapped into memory directly addressible
|
||||||
|
* by the kernel.
|
||||||
|
*
|
||||||
|
* Finally the page count is incremented, thus pinning the page into place.
|
||||||
|
*
|
||||||
|
* The above means that page_address(page) can be used on all pages obtained
|
||||||
|
* with ntfs_map_page() to get the kernel virtual address of the page.
|
||||||
|
*
|
||||||
|
* When finished with the page, the caller has to call ntfs_unmap_page() to
|
||||||
|
* unpin, unmap and release the page.
|
||||||
|
*
|
||||||
|
* Note this does not grant exclusive access. If such is desired, the caller
|
||||||
|
* must provide it independently of the ntfs_{un}map_page() calls by using
|
||||||
|
* a {rw_}semaphore or other means of serialization. A spin lock cannot be
|
||||||
|
* used as ntfs_map_page() can block.
|
||||||
|
*
|
||||||
|
* The unlocked and uptodate page is returned on success or an encoded error
|
||||||
|
* on failure. Caller has to test for error using the IS_ERR() macro on the
|
||||||
|
* return value. If that evaluates to 'true', the negative error code can be
|
||||||
|
* obtained using PTR_ERR() on the return value of ntfs_map_page().
|
||||||
|
*/
|
||||||
|
static inline struct page *ntfs_map_page(struct address_space *mapping,
|
||||||
|
unsigned long index)
|
||||||
|
{
|
||||||
|
struct page *page = read_mapping_page(mapping, index, NULL);
|
||||||
|
|
||||||
|
if (!IS_ERR(page))
|
||||||
|
kmap(page);
|
||||||
|
return page;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef NTFS_RW
|
||||||
|
|
||||||
|
extern void mark_ntfs_record_dirty(struct page *page, const unsigned int ofs);
|
||||||
|
|
||||||
|
#endif /* NTFS_RW */
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_AOPS_H */
|
||||||
+2624
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,102 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* attrib.h - Defines for attribute handling in NTFS Linux kernel driver.
|
||||||
|
* Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2001-2005 Anton Altaparmakov
|
||||||
|
* Copyright (c) 2002 Richard Russon
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_ATTRIB_H
|
||||||
|
#define _LINUX_NTFS_ATTRIB_H
|
||||||
|
|
||||||
|
#include "endian.h"
|
||||||
|
#include "types.h"
|
||||||
|
#include "layout.h"
|
||||||
|
#include "inode.h"
|
||||||
|
#include "runlist.h"
|
||||||
|
#include "volume.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_attr_search_ctx - used in attribute search functions
|
||||||
|
* @mrec: buffer containing mft record to search
|
||||||
|
* @attr: attribute record in @mrec where to begin/continue search
|
||||||
|
* @is_first: if true ntfs_attr_lookup() begins search with @attr, else after
|
||||||
|
*
|
||||||
|
* Structure must be initialized to zero before the first call to one of the
|
||||||
|
* attribute search functions. Initialize @mrec to point to the mft record to
|
||||||
|
* search, and @attr to point to the first attribute within @mrec (not necessary
|
||||||
|
* if calling the _first() functions), and set @is_first to 'true' (not necessary
|
||||||
|
* if calling the _first() functions).
|
||||||
|
*
|
||||||
|
* If @is_first is 'true', the search begins with @attr. If @is_first is 'false',
|
||||||
|
* the search begins after @attr. This is so that, after the first call to one
|
||||||
|
* of the search attribute functions, we can call the function again, without
|
||||||
|
* any modification of the search context, to automagically get the next
|
||||||
|
* matching attribute.
|
||||||
|
*/
|
||||||
|
typedef struct {
|
||||||
|
MFT_RECORD *mrec;
|
||||||
|
ATTR_RECORD *attr;
|
||||||
|
bool is_first;
|
||||||
|
ntfs_inode *ntfs_ino;
|
||||||
|
ATTR_LIST_ENTRY *al_entry;
|
||||||
|
ntfs_inode *base_ntfs_ino;
|
||||||
|
MFT_RECORD *base_mrec;
|
||||||
|
ATTR_RECORD *base_attr;
|
||||||
|
} ntfs_attr_search_ctx;
|
||||||
|
|
||||||
|
extern int ntfs_map_runlist_nolock(ntfs_inode *ni, VCN vcn,
|
||||||
|
ntfs_attr_search_ctx *ctx);
|
||||||
|
extern int ntfs_map_runlist(ntfs_inode *ni, VCN vcn);
|
||||||
|
|
||||||
|
extern LCN ntfs_attr_vcn_to_lcn_nolock(ntfs_inode *ni, const VCN vcn,
|
||||||
|
const bool write_locked);
|
||||||
|
|
||||||
|
extern runlist_element *ntfs_attr_find_vcn_nolock(ntfs_inode *ni,
|
||||||
|
const VCN vcn, ntfs_attr_search_ctx *ctx);
|
||||||
|
|
||||||
|
int ntfs_attr_lookup(const ATTR_TYPE type, const ntfschar *name,
|
||||||
|
const u32 name_len, const IGNORE_CASE_BOOL ic,
|
||||||
|
const VCN lowest_vcn, const u8 *val, const u32 val_len,
|
||||||
|
ntfs_attr_search_ctx *ctx);
|
||||||
|
|
||||||
|
extern int load_attribute_list(ntfs_volume *vol, runlist *rl, u8 *al_start,
|
||||||
|
const s64 size, const s64 initialized_size);
|
||||||
|
|
||||||
|
static inline s64 ntfs_attr_size(const ATTR_RECORD *a)
|
||||||
|
{
|
||||||
|
if (!a->non_resident)
|
||||||
|
return (s64)le32_to_cpu(a->data.resident.value_length);
|
||||||
|
return sle64_to_cpu(a->data.non_resident.data_size);
|
||||||
|
}
|
||||||
|
|
||||||
|
extern void ntfs_attr_reinit_search_ctx(ntfs_attr_search_ctx *ctx);
|
||||||
|
extern ntfs_attr_search_ctx *ntfs_attr_get_search_ctx(ntfs_inode *ni,
|
||||||
|
MFT_RECORD *mrec);
|
||||||
|
extern void ntfs_attr_put_search_ctx(ntfs_attr_search_ctx *ctx);
|
||||||
|
|
||||||
|
#ifdef NTFS_RW
|
||||||
|
|
||||||
|
extern int ntfs_attr_size_bounds_check(const ntfs_volume *vol,
|
||||||
|
const ATTR_TYPE type, const s64 size);
|
||||||
|
extern int ntfs_attr_can_be_non_resident(const ntfs_volume *vol,
|
||||||
|
const ATTR_TYPE type);
|
||||||
|
extern int ntfs_attr_can_be_resident(const ntfs_volume *vol,
|
||||||
|
const ATTR_TYPE type);
|
||||||
|
|
||||||
|
extern int ntfs_attr_record_resize(MFT_RECORD *m, ATTR_RECORD *a, u32 new_size);
|
||||||
|
extern int ntfs_resident_attr_value_resize(MFT_RECORD *m, ATTR_RECORD *a,
|
||||||
|
const u32 new_size);
|
||||||
|
|
||||||
|
extern int ntfs_attr_make_non_resident(ntfs_inode *ni, const u32 data_size);
|
||||||
|
|
||||||
|
extern s64 ntfs_attr_extend_allocation(ntfs_inode *ni, s64 new_alloc_size,
|
||||||
|
const s64 new_data_size, const s64 data_start);
|
||||||
|
|
||||||
|
extern int ntfs_attr_set(ntfs_inode *ni, const s64 ofs, const s64 cnt,
|
||||||
|
const u8 val);
|
||||||
|
|
||||||
|
#endif /* NTFS_RW */
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_ATTRIB_H */
|
||||||
@@ -0,0 +1,179 @@
|
|||||||
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
||||||
|
/*
|
||||||
|
* bitmap.c - NTFS kernel bitmap handling. Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2004-2005 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifdef NTFS_RW
|
||||||
|
|
||||||
|
#include <linux/pagemap.h>
|
||||||
|
|
||||||
|
#include "bitmap.h"
|
||||||
|
#include "debug.h"
|
||||||
|
#include "aops.h"
|
||||||
|
#include "ntfs.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* __ntfs_bitmap_set_bits_in_run - set a run of bits in a bitmap to a value
|
||||||
|
* @vi: vfs inode describing the bitmap
|
||||||
|
* @start_bit: first bit to set
|
||||||
|
* @count: number of bits to set
|
||||||
|
* @value: value to set the bits to (i.e. 0 or 1)
|
||||||
|
* @is_rollback: if 'true' this is a rollback operation
|
||||||
|
*
|
||||||
|
* Set @count bits starting at bit @start_bit in the bitmap described by the
|
||||||
|
* vfs inode @vi to @value, where @value is either 0 or 1.
|
||||||
|
*
|
||||||
|
* @is_rollback should always be 'false', it is for internal use to rollback
|
||||||
|
* errors. You probably want to use ntfs_bitmap_set_bits_in_run() instead.
|
||||||
|
*
|
||||||
|
* Return 0 on success and -errno on error.
|
||||||
|
*/
|
||||||
|
int __ntfs_bitmap_set_bits_in_run(struct inode *vi, const s64 start_bit,
|
||||||
|
const s64 count, const u8 value, const bool is_rollback)
|
||||||
|
{
|
||||||
|
s64 cnt = count;
|
||||||
|
pgoff_t index, end_index;
|
||||||
|
struct address_space *mapping;
|
||||||
|
struct page *page;
|
||||||
|
u8 *kaddr;
|
||||||
|
int pos, len;
|
||||||
|
u8 bit;
|
||||||
|
|
||||||
|
BUG_ON(!vi);
|
||||||
|
ntfs_debug("Entering for i_ino 0x%lx, start_bit 0x%llx, count 0x%llx, "
|
||||||
|
"value %u.%s", vi->i_ino, (unsigned long long)start_bit,
|
||||||
|
(unsigned long long)cnt, (unsigned int)value,
|
||||||
|
is_rollback ? " (rollback)" : "");
|
||||||
|
BUG_ON(start_bit < 0);
|
||||||
|
BUG_ON(cnt < 0);
|
||||||
|
BUG_ON(value > 1);
|
||||||
|
/*
|
||||||
|
* Calculate the indices for the pages containing the first and last
|
||||||
|
* bits, i.e. @start_bit and @start_bit + @cnt - 1, respectively.
|
||||||
|
*/
|
||||||
|
index = start_bit >> (3 + PAGE_SHIFT);
|
||||||
|
end_index = (start_bit + cnt - 1) >> (3 + PAGE_SHIFT);
|
||||||
|
|
||||||
|
/* Get the page containing the first bit (@start_bit). */
|
||||||
|
mapping = vi->i_mapping;
|
||||||
|
page = ntfs_map_page(mapping, index);
|
||||||
|
if (IS_ERR(page)) {
|
||||||
|
if (!is_rollback)
|
||||||
|
ntfs_error(vi->i_sb, "Failed to map first page (error "
|
||||||
|
"%li), aborting.", PTR_ERR(page));
|
||||||
|
return PTR_ERR(page);
|
||||||
|
}
|
||||||
|
kaddr = page_address(page);
|
||||||
|
|
||||||
|
/* Set @pos to the position of the byte containing @start_bit. */
|
||||||
|
pos = (start_bit >> 3) & ~PAGE_MASK;
|
||||||
|
|
||||||
|
/* Calculate the position of @start_bit in the first byte. */
|
||||||
|
bit = start_bit & 7;
|
||||||
|
|
||||||
|
/* If the first byte is partial, modify the appropriate bits in it. */
|
||||||
|
if (bit) {
|
||||||
|
u8 *byte = kaddr + pos;
|
||||||
|
while ((bit & 7) && cnt) {
|
||||||
|
cnt--;
|
||||||
|
if (value)
|
||||||
|
*byte |= 1 << bit++;
|
||||||
|
else
|
||||||
|
*byte &= ~(1 << bit++);
|
||||||
|
}
|
||||||
|
/* If we are done, unmap the page and return success. */
|
||||||
|
if (!cnt)
|
||||||
|
goto done;
|
||||||
|
|
||||||
|
/* Update @pos to the new position. */
|
||||||
|
pos++;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* Depending on @value, modify all remaining whole bytes in the page up
|
||||||
|
* to @cnt.
|
||||||
|
*/
|
||||||
|
len = min_t(s64, cnt >> 3, PAGE_SIZE - pos);
|
||||||
|
memset(kaddr + pos, value ? 0xff : 0, len);
|
||||||
|
cnt -= len << 3;
|
||||||
|
|
||||||
|
/* Update @len to point to the first not-done byte in the page. */
|
||||||
|
if (cnt < 8)
|
||||||
|
len += pos;
|
||||||
|
|
||||||
|
/* If we are not in the last page, deal with all subsequent pages. */
|
||||||
|
while (index < end_index) {
|
||||||
|
BUG_ON(cnt <= 0);
|
||||||
|
|
||||||
|
/* Update @index and get the next page. */
|
||||||
|
flush_dcache_page(page);
|
||||||
|
set_page_dirty(page);
|
||||||
|
ntfs_unmap_page(page);
|
||||||
|
page = ntfs_map_page(mapping, ++index);
|
||||||
|
if (IS_ERR(page))
|
||||||
|
goto rollback;
|
||||||
|
kaddr = page_address(page);
|
||||||
|
/*
|
||||||
|
* Depending on @value, modify all remaining whole bytes in the
|
||||||
|
* page up to @cnt.
|
||||||
|
*/
|
||||||
|
len = min_t(s64, cnt >> 3, PAGE_SIZE);
|
||||||
|
memset(kaddr, value ? 0xff : 0, len);
|
||||||
|
cnt -= len << 3;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* The currently mapped page is the last one. If the last byte is
|
||||||
|
* partial, modify the appropriate bits in it. Note, @len is the
|
||||||
|
* position of the last byte inside the page.
|
||||||
|
*/
|
||||||
|
if (cnt) {
|
||||||
|
u8 *byte;
|
||||||
|
|
||||||
|
BUG_ON(cnt > 7);
|
||||||
|
|
||||||
|
bit = cnt;
|
||||||
|
byte = kaddr + len;
|
||||||
|
while (bit--) {
|
||||||
|
if (value)
|
||||||
|
*byte |= 1 << bit;
|
||||||
|
else
|
||||||
|
*byte &= ~(1 << bit);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
done:
|
||||||
|
/* We are done. Unmap the page and return success. */
|
||||||
|
flush_dcache_page(page);
|
||||||
|
set_page_dirty(page);
|
||||||
|
ntfs_unmap_page(page);
|
||||||
|
ntfs_debug("Done.");
|
||||||
|
return 0;
|
||||||
|
rollback:
|
||||||
|
/*
|
||||||
|
* Current state:
|
||||||
|
* - no pages are mapped
|
||||||
|
* - @count - @cnt is the number of bits that have been modified
|
||||||
|
*/
|
||||||
|
if (is_rollback)
|
||||||
|
return PTR_ERR(page);
|
||||||
|
if (count != cnt)
|
||||||
|
pos = __ntfs_bitmap_set_bits_in_run(vi, start_bit, count - cnt,
|
||||||
|
value ? 0 : 1, true);
|
||||||
|
else
|
||||||
|
pos = 0;
|
||||||
|
if (!pos) {
|
||||||
|
/* Rollback was successful. */
|
||||||
|
ntfs_error(vi->i_sb, "Failed to map subsequent page (error "
|
||||||
|
"%li), aborting.", PTR_ERR(page));
|
||||||
|
} else {
|
||||||
|
/* Rollback failed. */
|
||||||
|
ntfs_error(vi->i_sb, "Failed to map subsequent page (error "
|
||||||
|
"%li) and rollback failed (error %i). "
|
||||||
|
"Aborting and leaving inconsistent metadata. "
|
||||||
|
"Unmount and run chkdsk.", PTR_ERR(page), pos);
|
||||||
|
NVolSetErrors(NTFS_SB(vi->i_sb));
|
||||||
|
}
|
||||||
|
return PTR_ERR(page);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* NTFS_RW */
|
||||||
@@ -0,0 +1,104 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* bitmap.h - Defines for NTFS kernel bitmap handling. Part of the Linux-NTFS
|
||||||
|
* project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_BITMAP_H
|
||||||
|
#define _LINUX_NTFS_BITMAP_H
|
||||||
|
|
||||||
|
#ifdef NTFS_RW
|
||||||
|
|
||||||
|
#include <linux/fs.h>
|
||||||
|
|
||||||
|
#include "types.h"
|
||||||
|
|
||||||
|
extern int __ntfs_bitmap_set_bits_in_run(struct inode *vi, const s64 start_bit,
|
||||||
|
const s64 count, const u8 value, const bool is_rollback);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_bitmap_set_bits_in_run - set a run of bits in a bitmap to a value
|
||||||
|
* @vi: vfs inode describing the bitmap
|
||||||
|
* @start_bit: first bit to set
|
||||||
|
* @count: number of bits to set
|
||||||
|
* @value: value to set the bits to (i.e. 0 or 1)
|
||||||
|
*
|
||||||
|
* Set @count bits starting at bit @start_bit in the bitmap described by the
|
||||||
|
* vfs inode @vi to @value, where @value is either 0 or 1.
|
||||||
|
*
|
||||||
|
* Return 0 on success and -errno on error.
|
||||||
|
*/
|
||||||
|
static inline int ntfs_bitmap_set_bits_in_run(struct inode *vi,
|
||||||
|
const s64 start_bit, const s64 count, const u8 value)
|
||||||
|
{
|
||||||
|
return __ntfs_bitmap_set_bits_in_run(vi, start_bit, count, value,
|
||||||
|
false);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_bitmap_set_run - set a run of bits in a bitmap
|
||||||
|
* @vi: vfs inode describing the bitmap
|
||||||
|
* @start_bit: first bit to set
|
||||||
|
* @count: number of bits to set
|
||||||
|
*
|
||||||
|
* Set @count bits starting at bit @start_bit in the bitmap described by the
|
||||||
|
* vfs inode @vi.
|
||||||
|
*
|
||||||
|
* Return 0 on success and -errno on error.
|
||||||
|
*/
|
||||||
|
static inline int ntfs_bitmap_set_run(struct inode *vi, const s64 start_bit,
|
||||||
|
const s64 count)
|
||||||
|
{
|
||||||
|
return ntfs_bitmap_set_bits_in_run(vi, start_bit, count, 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_bitmap_clear_run - clear a run of bits in a bitmap
|
||||||
|
* @vi: vfs inode describing the bitmap
|
||||||
|
* @start_bit: first bit to clear
|
||||||
|
* @count: number of bits to clear
|
||||||
|
*
|
||||||
|
* Clear @count bits starting at bit @start_bit in the bitmap described by the
|
||||||
|
* vfs inode @vi.
|
||||||
|
*
|
||||||
|
* Return 0 on success and -errno on error.
|
||||||
|
*/
|
||||||
|
static inline int ntfs_bitmap_clear_run(struct inode *vi, const s64 start_bit,
|
||||||
|
const s64 count)
|
||||||
|
{
|
||||||
|
return ntfs_bitmap_set_bits_in_run(vi, start_bit, count, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_bitmap_set_bit - set a bit in a bitmap
|
||||||
|
* @vi: vfs inode describing the bitmap
|
||||||
|
* @bit: bit to set
|
||||||
|
*
|
||||||
|
* Set bit @bit in the bitmap described by the vfs inode @vi.
|
||||||
|
*
|
||||||
|
* Return 0 on success and -errno on error.
|
||||||
|
*/
|
||||||
|
static inline int ntfs_bitmap_set_bit(struct inode *vi, const s64 bit)
|
||||||
|
{
|
||||||
|
return ntfs_bitmap_set_run(vi, bit, 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_bitmap_clear_bit - clear a bit in a bitmap
|
||||||
|
* @vi: vfs inode describing the bitmap
|
||||||
|
* @bit: bit to clear
|
||||||
|
*
|
||||||
|
* Clear bit @bit in the bitmap described by the vfs inode @vi.
|
||||||
|
*
|
||||||
|
* Return 0 on success and -errno on error.
|
||||||
|
*/
|
||||||
|
static inline int ntfs_bitmap_clear_bit(struct inode *vi, const s64 bit)
|
||||||
|
{
|
||||||
|
return ntfs_bitmap_clear_run(vi, bit, 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* NTFS_RW */
|
||||||
|
|
||||||
|
#endif /* defined _LINUX_NTFS_BITMAP_H */
|
||||||
@@ -0,0 +1,110 @@
|
|||||||
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
||||||
|
/*
|
||||||
|
* collate.c - NTFS kernel collation handling. Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "collate.h"
|
||||||
|
#include "debug.h"
|
||||||
|
#include "ntfs.h"
|
||||||
|
|
||||||
|
static int ntfs_collate_binary(ntfs_volume *vol,
|
||||||
|
const void *data1, const int data1_len,
|
||||||
|
const void *data2, const int data2_len)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
|
||||||
|
ntfs_debug("Entering.");
|
||||||
|
rc = memcmp(data1, data2, min(data1_len, data2_len));
|
||||||
|
if (!rc && (data1_len != data2_len)) {
|
||||||
|
if (data1_len < data2_len)
|
||||||
|
rc = -1;
|
||||||
|
else
|
||||||
|
rc = 1;
|
||||||
|
}
|
||||||
|
ntfs_debug("Done, returning %i", rc);
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int ntfs_collate_ntofs_ulong(ntfs_volume *vol,
|
||||||
|
const void *data1, const int data1_len,
|
||||||
|
const void *data2, const int data2_len)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
u32 d1, d2;
|
||||||
|
|
||||||
|
ntfs_debug("Entering.");
|
||||||
|
// FIXME: We don't really want to bug here.
|
||||||
|
BUG_ON(data1_len != data2_len);
|
||||||
|
BUG_ON(data1_len != 4);
|
||||||
|
d1 = le32_to_cpup(data1);
|
||||||
|
d2 = le32_to_cpup(data2);
|
||||||
|
if (d1 < d2)
|
||||||
|
rc = -1;
|
||||||
|
else {
|
||||||
|
if (d1 == d2)
|
||||||
|
rc = 0;
|
||||||
|
else
|
||||||
|
rc = 1;
|
||||||
|
}
|
||||||
|
ntfs_debug("Done, returning %i", rc);
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
typedef int (*ntfs_collate_func_t)(ntfs_volume *, const void *, const int,
|
||||||
|
const void *, const int);
|
||||||
|
|
||||||
|
static ntfs_collate_func_t ntfs_do_collate0x0[3] = {
|
||||||
|
ntfs_collate_binary,
|
||||||
|
NULL/*ntfs_collate_file_name*/,
|
||||||
|
NULL/*ntfs_collate_unicode_string*/,
|
||||||
|
};
|
||||||
|
|
||||||
|
static ntfs_collate_func_t ntfs_do_collate0x1[4] = {
|
||||||
|
ntfs_collate_ntofs_ulong,
|
||||||
|
NULL/*ntfs_collate_ntofs_sid*/,
|
||||||
|
NULL/*ntfs_collate_ntofs_security_hash*/,
|
||||||
|
NULL/*ntfs_collate_ntofs_ulongs*/,
|
||||||
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_collate - collate two data items using a specified collation rule
|
||||||
|
* @vol: ntfs volume to which the data items belong
|
||||||
|
* @cr: collation rule to use when comparing the items
|
||||||
|
* @data1: first data item to collate
|
||||||
|
* @data1_len: length in bytes of @data1
|
||||||
|
* @data2: second data item to collate
|
||||||
|
* @data2_len: length in bytes of @data2
|
||||||
|
*
|
||||||
|
* Collate the two data items @data1 and @data2 using the collation rule @cr
|
||||||
|
* and return -1, 0, ir 1 if @data1 is found, respectively, to collate before,
|
||||||
|
* to match, or to collate after @data2.
|
||||||
|
*
|
||||||
|
* For speed we use the collation rule @cr as an index into two tables of
|
||||||
|
* function pointers to call the appropriate collation function.
|
||||||
|
*/
|
||||||
|
int ntfs_collate(ntfs_volume *vol, COLLATION_RULE cr,
|
||||||
|
const void *data1, const int data1_len,
|
||||||
|
const void *data2, const int data2_len) {
|
||||||
|
int i;
|
||||||
|
|
||||||
|
ntfs_debug("Entering.");
|
||||||
|
/*
|
||||||
|
* FIXME: At the moment we only support COLLATION_BINARY and
|
||||||
|
* COLLATION_NTOFS_ULONG, so we BUG() for everything else for now.
|
||||||
|
*/
|
||||||
|
BUG_ON(cr != COLLATION_BINARY && cr != COLLATION_NTOFS_ULONG);
|
||||||
|
i = le32_to_cpu(cr);
|
||||||
|
BUG_ON(i < 0);
|
||||||
|
if (i <= 0x02)
|
||||||
|
return ntfs_do_collate0x0[i](vol, data1, data1_len,
|
||||||
|
data2, data2_len);
|
||||||
|
BUG_ON(i < 0x10);
|
||||||
|
i -= 0x10;
|
||||||
|
if (likely(i <= 3))
|
||||||
|
return ntfs_do_collate0x1[i](vol, data1, data1_len,
|
||||||
|
data2, data2_len);
|
||||||
|
BUG();
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
@@ -0,0 +1,36 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* collate.h - Defines for NTFS kernel collation handling. Part of the
|
||||||
|
* Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_COLLATE_H
|
||||||
|
#define _LINUX_NTFS_COLLATE_H
|
||||||
|
|
||||||
|
#include "types.h"
|
||||||
|
#include "volume.h"
|
||||||
|
|
||||||
|
static inline bool ntfs_is_collation_rule_supported(COLLATION_RULE cr) {
|
||||||
|
int i;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* FIXME: At the moment we only support COLLATION_BINARY and
|
||||||
|
* COLLATION_NTOFS_ULONG, so we return false for everything else for
|
||||||
|
* now.
|
||||||
|
*/
|
||||||
|
if (unlikely(cr != COLLATION_BINARY && cr != COLLATION_NTOFS_ULONG))
|
||||||
|
return false;
|
||||||
|
i = le32_to_cpu(cr);
|
||||||
|
if (likely(((i >= 0) && (i <= 0x02)) ||
|
||||||
|
((i >= 0x10) && (i <= 0x13))))
|
||||||
|
return true;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
extern int ntfs_collate(ntfs_volume *vol, COLLATION_RULE cr,
|
||||||
|
const void *data1, const int data1_len,
|
||||||
|
const void *data2, const int data2_len);
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_COLLATE_H */
|
||||||
File diff suppressed because it is too large
Load Diff
+159
@@ -0,0 +1,159 @@
|
|||||||
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
||||||
|
/*
|
||||||
|
* debug.c - NTFS kernel debug support. Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2001-2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
||||||
|
#include "debug.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* __ntfs_warning - output a warning to the syslog
|
||||||
|
* @function: name of function outputting the warning
|
||||||
|
* @sb: super block of mounted ntfs filesystem
|
||||||
|
* @fmt: warning string containing format specifications
|
||||||
|
* @...: a variable number of arguments specified in @fmt
|
||||||
|
*
|
||||||
|
* Outputs a warning to the syslog for the mounted ntfs filesystem described
|
||||||
|
* by @sb.
|
||||||
|
*
|
||||||
|
* @fmt and the corresponding @... is printf style format string containing
|
||||||
|
* the warning string and the corresponding format arguments, respectively.
|
||||||
|
*
|
||||||
|
* @function is the name of the function from which __ntfs_warning is being
|
||||||
|
* called.
|
||||||
|
*
|
||||||
|
* Note, you should be using debug.h::ntfs_warning(@sb, @fmt, @...) instead
|
||||||
|
* as this provides the @function parameter automatically.
|
||||||
|
*/
|
||||||
|
void __ntfs_warning(const char *function, const struct super_block *sb,
|
||||||
|
const char *fmt, ...)
|
||||||
|
{
|
||||||
|
struct va_format vaf;
|
||||||
|
va_list args;
|
||||||
|
int flen = 0;
|
||||||
|
|
||||||
|
#ifndef DEBUG
|
||||||
|
if (!printk_ratelimit())
|
||||||
|
return;
|
||||||
|
#endif
|
||||||
|
if (function)
|
||||||
|
flen = strlen(function);
|
||||||
|
va_start(args, fmt);
|
||||||
|
vaf.fmt = fmt;
|
||||||
|
vaf.va = &args;
|
||||||
|
if (sb)
|
||||||
|
pr_warn("(device %s): %s(): %pV\n",
|
||||||
|
sb->s_id, flen ? function : "", &vaf);
|
||||||
|
else
|
||||||
|
pr_warn("%s(): %pV\n", flen ? function : "", &vaf);
|
||||||
|
va_end(args);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* __ntfs_error - output an error to the syslog
|
||||||
|
* @function: name of function outputting the error
|
||||||
|
* @sb: super block of mounted ntfs filesystem
|
||||||
|
* @fmt: error string containing format specifications
|
||||||
|
* @...: a variable number of arguments specified in @fmt
|
||||||
|
*
|
||||||
|
* Outputs an error to the syslog for the mounted ntfs filesystem described
|
||||||
|
* by @sb.
|
||||||
|
*
|
||||||
|
* @fmt and the corresponding @... is printf style format string containing
|
||||||
|
* the error string and the corresponding format arguments, respectively.
|
||||||
|
*
|
||||||
|
* @function is the name of the function from which __ntfs_error is being
|
||||||
|
* called.
|
||||||
|
*
|
||||||
|
* Note, you should be using debug.h::ntfs_error(@sb, @fmt, @...) instead
|
||||||
|
* as this provides the @function parameter automatically.
|
||||||
|
*/
|
||||||
|
void __ntfs_error(const char *function, const struct super_block *sb,
|
||||||
|
const char *fmt, ...)
|
||||||
|
{
|
||||||
|
struct va_format vaf;
|
||||||
|
va_list args;
|
||||||
|
int flen = 0;
|
||||||
|
|
||||||
|
#ifndef DEBUG
|
||||||
|
if (!printk_ratelimit())
|
||||||
|
return;
|
||||||
|
#endif
|
||||||
|
if (function)
|
||||||
|
flen = strlen(function);
|
||||||
|
va_start(args, fmt);
|
||||||
|
vaf.fmt = fmt;
|
||||||
|
vaf.va = &args;
|
||||||
|
if (sb)
|
||||||
|
pr_err("(device %s): %s(): %pV\n",
|
||||||
|
sb->s_id, flen ? function : "", &vaf);
|
||||||
|
else
|
||||||
|
pr_err("%s(): %pV\n", flen ? function : "", &vaf);
|
||||||
|
va_end(args);
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef DEBUG
|
||||||
|
|
||||||
|
/* If 1, output debug messages, and if 0, don't. */
|
||||||
|
int debug_msgs = 0;
|
||||||
|
|
||||||
|
void __ntfs_debug(const char *file, int line, const char *function,
|
||||||
|
const char *fmt, ...)
|
||||||
|
{
|
||||||
|
struct va_format vaf;
|
||||||
|
va_list args;
|
||||||
|
int flen = 0;
|
||||||
|
|
||||||
|
if (!debug_msgs)
|
||||||
|
return;
|
||||||
|
if (function)
|
||||||
|
flen = strlen(function);
|
||||||
|
va_start(args, fmt);
|
||||||
|
vaf.fmt = fmt;
|
||||||
|
vaf.va = &args;
|
||||||
|
pr_debug("(%s, %d): %s(): %pV", file, line, flen ? function : "", &vaf);
|
||||||
|
va_end(args);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Dump a runlist. Caller has to provide synchronisation for @rl. */
|
||||||
|
void ntfs_debug_dump_runlist(const runlist_element *rl)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
const char *lcn_str[5] = { "LCN_HOLE ", "LCN_RL_NOT_MAPPED",
|
||||||
|
"LCN_ENOENT ", "LCN_unknown " };
|
||||||
|
|
||||||
|
if (!debug_msgs)
|
||||||
|
return;
|
||||||
|
pr_debug("Dumping runlist (values in hex):\n");
|
||||||
|
if (!rl) {
|
||||||
|
pr_debug("Run list not present.\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
pr_debug("VCN LCN Run length\n");
|
||||||
|
for (i = 0; ; i++) {
|
||||||
|
LCN lcn = (rl + i)->lcn;
|
||||||
|
|
||||||
|
if (lcn < (LCN)0) {
|
||||||
|
int index = -lcn - 1;
|
||||||
|
|
||||||
|
if (index > -LCN_ENOENT - 1)
|
||||||
|
index = 3;
|
||||||
|
pr_debug("%-16Lx %s %-16Lx%s\n",
|
||||||
|
(long long)(rl + i)->vcn, lcn_str[index],
|
||||||
|
(long long)(rl + i)->length,
|
||||||
|
(rl + i)->length ? "" :
|
||||||
|
" (runlist end)");
|
||||||
|
} else
|
||||||
|
pr_debug("%-16Lx %-16Lx %-16Lx%s\n",
|
||||||
|
(long long)(rl + i)->vcn,
|
||||||
|
(long long)(rl + i)->lcn,
|
||||||
|
(long long)(rl + i)->length,
|
||||||
|
(rl + i)->length ? "" :
|
||||||
|
" (runlist end)");
|
||||||
|
if (!(rl + i)->length)
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
@@ -0,0 +1,57 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* debug.h - NTFS kernel debug support. Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2001-2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_DEBUG_H
|
||||||
|
#define _LINUX_NTFS_DEBUG_H
|
||||||
|
|
||||||
|
#include <linux/fs.h>
|
||||||
|
|
||||||
|
#include "runlist.h"
|
||||||
|
|
||||||
|
#ifdef DEBUG
|
||||||
|
|
||||||
|
extern int debug_msgs;
|
||||||
|
|
||||||
|
extern __printf(4, 5)
|
||||||
|
void __ntfs_debug(const char *file, int line, const char *function,
|
||||||
|
const char *format, ...);
|
||||||
|
/**
|
||||||
|
* ntfs_debug - write a debug level message to syslog
|
||||||
|
* @f: a printf format string containing the message
|
||||||
|
* @...: the variables to substitute into @f
|
||||||
|
*
|
||||||
|
* ntfs_debug() writes a DEBUG level message to the syslog but only if the
|
||||||
|
* driver was compiled with -DDEBUG. Otherwise, the call turns into a NOP.
|
||||||
|
*/
|
||||||
|
#define ntfs_debug(f, a...) \
|
||||||
|
__ntfs_debug(__FILE__, __LINE__, __func__, f, ##a)
|
||||||
|
|
||||||
|
extern void ntfs_debug_dump_runlist(const runlist_element *rl);
|
||||||
|
|
||||||
|
#else /* !DEBUG */
|
||||||
|
|
||||||
|
#define ntfs_debug(fmt, ...) \
|
||||||
|
do { \
|
||||||
|
if (0) \
|
||||||
|
no_printk(fmt, ##__VA_ARGS__); \
|
||||||
|
} while (0)
|
||||||
|
|
||||||
|
#define ntfs_debug_dump_runlist(rl) do {} while (0)
|
||||||
|
|
||||||
|
#endif /* !DEBUG */
|
||||||
|
|
||||||
|
extern __printf(3, 4)
|
||||||
|
void __ntfs_warning(const char *function, const struct super_block *sb,
|
||||||
|
const char *fmt, ...);
|
||||||
|
#define ntfs_warning(sb, f, a...) __ntfs_warning(__func__, sb, f, ##a)
|
||||||
|
|
||||||
|
extern __printf(3, 4)
|
||||||
|
void __ntfs_error(const char *function, const struct super_block *sb,
|
||||||
|
const char *fmt, ...);
|
||||||
|
#define ntfs_error(sb, f, a...) __ntfs_error(__func__, sb, f, ##a)
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_DEBUG_H */
|
||||||
+1540
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,34 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* dir.h - Defines for directory handling in NTFS Linux kernel driver. Part of
|
||||||
|
* the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2002-2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_DIR_H
|
||||||
|
#define _LINUX_NTFS_DIR_H
|
||||||
|
|
||||||
|
#include "layout.h"
|
||||||
|
#include "inode.h"
|
||||||
|
#include "types.h"
|
||||||
|
|
||||||
|
/*
|
||||||
|
* ntfs_name is used to return the file name to the caller of
|
||||||
|
* ntfs_lookup_inode_by_name() in order for the caller (namei.c::ntfs_lookup())
|
||||||
|
* to be able to deal with dcache aliasing issues.
|
||||||
|
*/
|
||||||
|
typedef struct {
|
||||||
|
MFT_REF mref;
|
||||||
|
FILE_NAME_TYPE_FLAGS type;
|
||||||
|
u8 len;
|
||||||
|
ntfschar name[0];
|
||||||
|
} __attribute__ ((__packed__)) ntfs_name;
|
||||||
|
|
||||||
|
/* The little endian Unicode string $I30 as a global constant. */
|
||||||
|
extern ntfschar I30[5];
|
||||||
|
|
||||||
|
extern MFT_REF ntfs_lookup_inode_by_name(ntfs_inode *dir_ni,
|
||||||
|
const ntfschar *uname, const int uname_len, ntfs_name **res);
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_FS_DIR_H */
|
||||||
@@ -0,0 +1,79 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* endian.h - Defines for endianness handling in NTFS Linux kernel driver.
|
||||||
|
* Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2001-2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_ENDIAN_H
|
||||||
|
#define _LINUX_NTFS_ENDIAN_H
|
||||||
|
|
||||||
|
#include <asm/byteorder.h>
|
||||||
|
#include "types.h"
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Signed endianness conversion functions.
|
||||||
|
*/
|
||||||
|
|
||||||
|
static inline s16 sle16_to_cpu(sle16 x)
|
||||||
|
{
|
||||||
|
return le16_to_cpu((__force le16)x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline s32 sle32_to_cpu(sle32 x)
|
||||||
|
{
|
||||||
|
return le32_to_cpu((__force le32)x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline s64 sle64_to_cpu(sle64 x)
|
||||||
|
{
|
||||||
|
return le64_to_cpu((__force le64)x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline s16 sle16_to_cpup(sle16 *x)
|
||||||
|
{
|
||||||
|
return le16_to_cpu(*(__force le16*)x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline s32 sle32_to_cpup(sle32 *x)
|
||||||
|
{
|
||||||
|
return le32_to_cpu(*(__force le32*)x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline s64 sle64_to_cpup(sle64 *x)
|
||||||
|
{
|
||||||
|
return le64_to_cpu(*(__force le64*)x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline sle16 cpu_to_sle16(s16 x)
|
||||||
|
{
|
||||||
|
return (__force sle16)cpu_to_le16(x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline sle32 cpu_to_sle32(s32 x)
|
||||||
|
{
|
||||||
|
return (__force sle32)cpu_to_le32(x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline sle64 cpu_to_sle64(s64 x)
|
||||||
|
{
|
||||||
|
return (__force sle64)cpu_to_le64(x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline sle16 cpu_to_sle16p(s16 *x)
|
||||||
|
{
|
||||||
|
return (__force sle16)cpu_to_le16(*x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline sle32 cpu_to_sle32p(s32 *x)
|
||||||
|
{
|
||||||
|
return (__force sle32)cpu_to_le32(*x);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline sle64 cpu_to_sle64p(s64 *x)
|
||||||
|
{
|
||||||
|
return (__force sle64)cpu_to_le64(*x);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_ENDIAN_H */
|
||||||
+1997
File diff suppressed because it is too large
Load Diff
+440
@@ -0,0 +1,440 @@
|
|||||||
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
||||||
|
/*
|
||||||
|
* index.c - NTFS kernel index handling. Part of the Linux-NTFS project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2004-2005 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <linux/slab.h>
|
||||||
|
|
||||||
|
#include "aops.h"
|
||||||
|
#include "collate.h"
|
||||||
|
#include "debug.h"
|
||||||
|
#include "index.h"
|
||||||
|
#include "ntfs.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_index_ctx_get - allocate and initialize a new index context
|
||||||
|
* @idx_ni: ntfs index inode with which to initialize the context
|
||||||
|
*
|
||||||
|
* Allocate a new index context, initialize it with @idx_ni and return it.
|
||||||
|
* Return NULL if allocation failed.
|
||||||
|
*
|
||||||
|
* Locking: Caller must hold i_mutex on the index inode.
|
||||||
|
*/
|
||||||
|
ntfs_index_context *ntfs_index_ctx_get(ntfs_inode *idx_ni)
|
||||||
|
{
|
||||||
|
ntfs_index_context *ictx;
|
||||||
|
|
||||||
|
ictx = kmem_cache_alloc(ntfs_index_ctx_cache, GFP_NOFS);
|
||||||
|
if (ictx)
|
||||||
|
*ictx = (ntfs_index_context){ .idx_ni = idx_ni };
|
||||||
|
return ictx;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_index_ctx_put - release an index context
|
||||||
|
* @ictx: index context to free
|
||||||
|
*
|
||||||
|
* Release the index context @ictx, releasing all associated resources.
|
||||||
|
*
|
||||||
|
* Locking: Caller must hold i_mutex on the index inode.
|
||||||
|
*/
|
||||||
|
void ntfs_index_ctx_put(ntfs_index_context *ictx)
|
||||||
|
{
|
||||||
|
if (ictx->entry) {
|
||||||
|
if (ictx->is_in_root) {
|
||||||
|
if (ictx->actx)
|
||||||
|
ntfs_attr_put_search_ctx(ictx->actx);
|
||||||
|
if (ictx->base_ni)
|
||||||
|
unmap_mft_record(ictx->base_ni);
|
||||||
|
} else {
|
||||||
|
struct page *page = ictx->page;
|
||||||
|
if (page) {
|
||||||
|
BUG_ON(!PageLocked(page));
|
||||||
|
unlock_page(page);
|
||||||
|
ntfs_unmap_page(page);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
kmem_cache_free(ntfs_index_ctx_cache, ictx);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_index_lookup - find a key in an index and return its index entry
|
||||||
|
* @key: [IN] key for which to search in the index
|
||||||
|
* @key_len: [IN] length of @key in bytes
|
||||||
|
* @ictx: [IN/OUT] context describing the index and the returned entry
|
||||||
|
*
|
||||||
|
* Before calling ntfs_index_lookup(), @ictx must have been obtained from a
|
||||||
|
* call to ntfs_index_ctx_get().
|
||||||
|
*
|
||||||
|
* Look for the @key in the index specified by the index lookup context @ictx.
|
||||||
|
* ntfs_index_lookup() walks the contents of the index looking for the @key.
|
||||||
|
*
|
||||||
|
* If the @key is found in the index, 0 is returned and @ictx is setup to
|
||||||
|
* describe the index entry containing the matching @key. @ictx->entry is the
|
||||||
|
* index entry and @ictx->data and @ictx->data_len are the index entry data and
|
||||||
|
* its length in bytes, respectively.
|
||||||
|
*
|
||||||
|
* If the @key is not found in the index, -ENOENT is returned and @ictx is
|
||||||
|
* setup to describe the index entry whose key collates immediately after the
|
||||||
|
* search @key, i.e. this is the position in the index at which an index entry
|
||||||
|
* with a key of @key would need to be inserted.
|
||||||
|
*
|
||||||
|
* If an error occurs return the negative error code and @ictx is left
|
||||||
|
* untouched.
|
||||||
|
*
|
||||||
|
* When finished with the entry and its data, call ntfs_index_ctx_put() to free
|
||||||
|
* the context and other associated resources.
|
||||||
|
*
|
||||||
|
* If the index entry was modified, call flush_dcache_index_entry_page()
|
||||||
|
* immediately after the modification and either ntfs_index_entry_mark_dirty()
|
||||||
|
* or ntfs_index_entry_write() before the call to ntfs_index_ctx_put() to
|
||||||
|
* ensure that the changes are written to disk.
|
||||||
|
*
|
||||||
|
* Locking: - Caller must hold i_mutex on the index inode.
|
||||||
|
* - Each page cache page in the index allocation mapping must be
|
||||||
|
* locked whilst being accessed otherwise we may find a corrupt
|
||||||
|
* page due to it being under ->writepage at the moment which
|
||||||
|
* applies the mst protection fixups before writing out and then
|
||||||
|
* removes them again after the write is complete after which it
|
||||||
|
* unlocks the page.
|
||||||
|
*/
|
||||||
|
int ntfs_index_lookup(const void *key, const int key_len,
|
||||||
|
ntfs_index_context *ictx)
|
||||||
|
{
|
||||||
|
VCN vcn, old_vcn;
|
||||||
|
ntfs_inode *idx_ni = ictx->idx_ni;
|
||||||
|
ntfs_volume *vol = idx_ni->vol;
|
||||||
|
struct super_block *sb = vol->sb;
|
||||||
|
ntfs_inode *base_ni = idx_ni->ext.base_ntfs_ino;
|
||||||
|
MFT_RECORD *m;
|
||||||
|
INDEX_ROOT *ir;
|
||||||
|
INDEX_ENTRY *ie;
|
||||||
|
INDEX_ALLOCATION *ia;
|
||||||
|
u8 *index_end, *kaddr;
|
||||||
|
ntfs_attr_search_ctx *actx;
|
||||||
|
struct address_space *ia_mapping;
|
||||||
|
struct page *page;
|
||||||
|
int rc, err = 0;
|
||||||
|
|
||||||
|
ntfs_debug("Entering.");
|
||||||
|
BUG_ON(!NInoAttr(idx_ni));
|
||||||
|
BUG_ON(idx_ni->type != AT_INDEX_ALLOCATION);
|
||||||
|
BUG_ON(idx_ni->nr_extents != -1);
|
||||||
|
BUG_ON(!base_ni);
|
||||||
|
BUG_ON(!key);
|
||||||
|
BUG_ON(key_len <= 0);
|
||||||
|
if (!ntfs_is_collation_rule_supported(
|
||||||
|
idx_ni->itype.index.collation_rule)) {
|
||||||
|
ntfs_error(sb, "Index uses unsupported collation rule 0x%x. "
|
||||||
|
"Aborting lookup.", le32_to_cpu(
|
||||||
|
idx_ni->itype.index.collation_rule));
|
||||||
|
return -EOPNOTSUPP;
|
||||||
|
}
|
||||||
|
/* Get hold of the mft record for the index inode. */
|
||||||
|
m = map_mft_record(base_ni);
|
||||||
|
if (IS_ERR(m)) {
|
||||||
|
ntfs_error(sb, "map_mft_record() failed with error code %ld.",
|
||||||
|
-PTR_ERR(m));
|
||||||
|
return PTR_ERR(m);
|
||||||
|
}
|
||||||
|
actx = ntfs_attr_get_search_ctx(base_ni, m);
|
||||||
|
if (unlikely(!actx)) {
|
||||||
|
err = -ENOMEM;
|
||||||
|
goto err_out;
|
||||||
|
}
|
||||||
|
/* Find the index root attribute in the mft record. */
|
||||||
|
err = ntfs_attr_lookup(AT_INDEX_ROOT, idx_ni->name, idx_ni->name_len,
|
||||||
|
CASE_SENSITIVE, 0, NULL, 0, actx);
|
||||||
|
if (unlikely(err)) {
|
||||||
|
if (err == -ENOENT) {
|
||||||
|
ntfs_error(sb, "Index root attribute missing in inode "
|
||||||
|
"0x%lx.", idx_ni->mft_no);
|
||||||
|
err = -EIO;
|
||||||
|
}
|
||||||
|
goto err_out;
|
||||||
|
}
|
||||||
|
/* Get to the index root value (it has been verified in read_inode). */
|
||||||
|
ir = (INDEX_ROOT*)((u8*)actx->attr +
|
||||||
|
le16_to_cpu(actx->attr->data.resident.value_offset));
|
||||||
|
index_end = (u8*)&ir->index + le32_to_cpu(ir->index.index_length);
|
||||||
|
/* The first index entry. */
|
||||||
|
ie = (INDEX_ENTRY*)((u8*)&ir->index +
|
||||||
|
le32_to_cpu(ir->index.entries_offset));
|
||||||
|
/*
|
||||||
|
* Loop until we exceed valid memory (corruption case) or until we
|
||||||
|
* reach the last entry.
|
||||||
|
*/
|
||||||
|
for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) {
|
||||||
|
/* Bounds checks. */
|
||||||
|
if ((u8*)ie < (u8*)actx->mrec || (u8*)ie +
|
||||||
|
sizeof(INDEX_ENTRY_HEADER) > index_end ||
|
||||||
|
(u8*)ie + le16_to_cpu(ie->length) > index_end)
|
||||||
|
goto idx_err_out;
|
||||||
|
/*
|
||||||
|
* The last entry cannot contain a key. It can however contain
|
||||||
|
* a pointer to a child node in the B+tree so we just break out.
|
||||||
|
*/
|
||||||
|
if (ie->flags & INDEX_ENTRY_END)
|
||||||
|
break;
|
||||||
|
/* Further bounds checks. */
|
||||||
|
if ((u32)sizeof(INDEX_ENTRY_HEADER) +
|
||||||
|
le16_to_cpu(ie->key_length) >
|
||||||
|
le16_to_cpu(ie->data.vi.data_offset) ||
|
||||||
|
(u32)le16_to_cpu(ie->data.vi.data_offset) +
|
||||||
|
le16_to_cpu(ie->data.vi.data_length) >
|
||||||
|
le16_to_cpu(ie->length))
|
||||||
|
goto idx_err_out;
|
||||||
|
/* If the keys match perfectly, we setup @ictx and return 0. */
|
||||||
|
if ((key_len == le16_to_cpu(ie->key_length)) && !memcmp(key,
|
||||||
|
&ie->key, key_len)) {
|
||||||
|
ir_done:
|
||||||
|
ictx->is_in_root = true;
|
||||||
|
ictx->ir = ir;
|
||||||
|
ictx->actx = actx;
|
||||||
|
ictx->base_ni = base_ni;
|
||||||
|
ictx->ia = NULL;
|
||||||
|
ictx->page = NULL;
|
||||||
|
done:
|
||||||
|
ictx->entry = ie;
|
||||||
|
ictx->data = (u8*)ie +
|
||||||
|
le16_to_cpu(ie->data.vi.data_offset);
|
||||||
|
ictx->data_len = le16_to_cpu(ie->data.vi.data_length);
|
||||||
|
ntfs_debug("Done.");
|
||||||
|
return err;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* Not a perfect match, need to do full blown collation so we
|
||||||
|
* know which way in the B+tree we have to go.
|
||||||
|
*/
|
||||||
|
rc = ntfs_collate(vol, idx_ni->itype.index.collation_rule, key,
|
||||||
|
key_len, &ie->key, le16_to_cpu(ie->key_length));
|
||||||
|
/*
|
||||||
|
* If @key collates before the key of the current entry, there
|
||||||
|
* is definitely no such key in this index but we might need to
|
||||||
|
* descend into the B+tree so we just break out of the loop.
|
||||||
|
*/
|
||||||
|
if (rc == -1)
|
||||||
|
break;
|
||||||
|
/*
|
||||||
|
* A match should never happen as the memcmp() call should have
|
||||||
|
* cought it, but we still treat it correctly.
|
||||||
|
*/
|
||||||
|
if (!rc)
|
||||||
|
goto ir_done;
|
||||||
|
/* The keys are not equal, continue the search. */
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* We have finished with this index without success. Check for the
|
||||||
|
* presence of a child node and if not present setup @ictx and return
|
||||||
|
* -ENOENT.
|
||||||
|
*/
|
||||||
|
if (!(ie->flags & INDEX_ENTRY_NODE)) {
|
||||||
|
ntfs_debug("Entry not found.");
|
||||||
|
err = -ENOENT;
|
||||||
|
goto ir_done;
|
||||||
|
} /* Child node present, descend into it. */
|
||||||
|
/* Consistency check: Verify that an index allocation exists. */
|
||||||
|
if (!NInoIndexAllocPresent(idx_ni)) {
|
||||||
|
ntfs_error(sb, "No index allocation attribute but index entry "
|
||||||
|
"requires one. Inode 0x%lx is corrupt or "
|
||||||
|
"driver bug.", idx_ni->mft_no);
|
||||||
|
goto err_out;
|
||||||
|
}
|
||||||
|
/* Get the starting vcn of the index_block holding the child node. */
|
||||||
|
vcn = sle64_to_cpup((sle64*)((u8*)ie + le16_to_cpu(ie->length) - 8));
|
||||||
|
ia_mapping = VFS_I(idx_ni)->i_mapping;
|
||||||
|
/*
|
||||||
|
* We are done with the index root and the mft record. Release them,
|
||||||
|
* otherwise we deadlock with ntfs_map_page().
|
||||||
|
*/
|
||||||
|
ntfs_attr_put_search_ctx(actx);
|
||||||
|
unmap_mft_record(base_ni);
|
||||||
|
m = NULL;
|
||||||
|
actx = NULL;
|
||||||
|
descend_into_child_node:
|
||||||
|
/*
|
||||||
|
* Convert vcn to index into the index allocation attribute in units
|
||||||
|
* of PAGE_SIZE and map the page cache page, reading it from
|
||||||
|
* disk if necessary.
|
||||||
|
*/
|
||||||
|
page = ntfs_map_page(ia_mapping, vcn <<
|
||||||
|
idx_ni->itype.index.vcn_size_bits >> PAGE_SHIFT);
|
||||||
|
if (IS_ERR(page)) {
|
||||||
|
ntfs_error(sb, "Failed to map index page, error %ld.",
|
||||||
|
-PTR_ERR(page));
|
||||||
|
err = PTR_ERR(page);
|
||||||
|
goto err_out;
|
||||||
|
}
|
||||||
|
lock_page(page);
|
||||||
|
kaddr = (u8*)page_address(page);
|
||||||
|
fast_descend_into_child_node:
|
||||||
|
/* Get to the index allocation block. */
|
||||||
|
ia = (INDEX_ALLOCATION*)(kaddr + ((vcn <<
|
||||||
|
idx_ni->itype.index.vcn_size_bits) & ~PAGE_MASK));
|
||||||
|
/* Bounds checks. */
|
||||||
|
if ((u8*)ia < kaddr || (u8*)ia > kaddr + PAGE_SIZE) {
|
||||||
|
ntfs_error(sb, "Out of bounds check failed. Corrupt inode "
|
||||||
|
"0x%lx or driver bug.", idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
/* Catch multi sector transfer fixup errors. */
|
||||||
|
if (unlikely(!ntfs_is_indx_record(ia->magic))) {
|
||||||
|
ntfs_error(sb, "Index record with vcn 0x%llx is corrupt. "
|
||||||
|
"Corrupt inode 0x%lx. Run chkdsk.",
|
||||||
|
(long long)vcn, idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
if (sle64_to_cpu(ia->index_block_vcn) != vcn) {
|
||||||
|
ntfs_error(sb, "Actual VCN (0x%llx) of index buffer is "
|
||||||
|
"different from expected VCN (0x%llx). Inode "
|
||||||
|
"0x%lx is corrupt or driver bug.",
|
||||||
|
(unsigned long long)
|
||||||
|
sle64_to_cpu(ia->index_block_vcn),
|
||||||
|
(unsigned long long)vcn, idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
if (le32_to_cpu(ia->index.allocated_size) + 0x18 !=
|
||||||
|
idx_ni->itype.index.block_size) {
|
||||||
|
ntfs_error(sb, "Index buffer (VCN 0x%llx) of inode 0x%lx has "
|
||||||
|
"a size (%u) differing from the index "
|
||||||
|
"specified size (%u). Inode is corrupt or "
|
||||||
|
"driver bug.", (unsigned long long)vcn,
|
||||||
|
idx_ni->mft_no,
|
||||||
|
le32_to_cpu(ia->index.allocated_size) + 0x18,
|
||||||
|
idx_ni->itype.index.block_size);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
index_end = (u8*)ia + idx_ni->itype.index.block_size;
|
||||||
|
if (index_end > kaddr + PAGE_SIZE) {
|
||||||
|
ntfs_error(sb, "Index buffer (VCN 0x%llx) of inode 0x%lx "
|
||||||
|
"crosses page boundary. Impossible! Cannot "
|
||||||
|
"access! This is probably a bug in the "
|
||||||
|
"driver.", (unsigned long long)vcn,
|
||||||
|
idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length);
|
||||||
|
if (index_end > (u8*)ia + idx_ni->itype.index.block_size) {
|
||||||
|
ntfs_error(sb, "Size of index buffer (VCN 0x%llx) of inode "
|
||||||
|
"0x%lx exceeds maximum size.",
|
||||||
|
(unsigned long long)vcn, idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
/* The first index entry. */
|
||||||
|
ie = (INDEX_ENTRY*)((u8*)&ia->index +
|
||||||
|
le32_to_cpu(ia->index.entries_offset));
|
||||||
|
/*
|
||||||
|
* Iterate similar to above big loop but applied to index buffer, thus
|
||||||
|
* loop until we exceed valid memory (corruption case) or until we
|
||||||
|
* reach the last entry.
|
||||||
|
*/
|
||||||
|
for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) {
|
||||||
|
/* Bounds checks. */
|
||||||
|
if ((u8*)ie < (u8*)ia || (u8*)ie +
|
||||||
|
sizeof(INDEX_ENTRY_HEADER) > index_end ||
|
||||||
|
(u8*)ie + le16_to_cpu(ie->length) > index_end) {
|
||||||
|
ntfs_error(sb, "Index entry out of bounds in inode "
|
||||||
|
"0x%lx.", idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* The last entry cannot contain a key. It can however contain
|
||||||
|
* a pointer to a child node in the B+tree so we just break out.
|
||||||
|
*/
|
||||||
|
if (ie->flags & INDEX_ENTRY_END)
|
||||||
|
break;
|
||||||
|
/* Further bounds checks. */
|
||||||
|
if ((u32)sizeof(INDEX_ENTRY_HEADER) +
|
||||||
|
le16_to_cpu(ie->key_length) >
|
||||||
|
le16_to_cpu(ie->data.vi.data_offset) ||
|
||||||
|
(u32)le16_to_cpu(ie->data.vi.data_offset) +
|
||||||
|
le16_to_cpu(ie->data.vi.data_length) >
|
||||||
|
le16_to_cpu(ie->length)) {
|
||||||
|
ntfs_error(sb, "Index entry out of bounds in inode "
|
||||||
|
"0x%lx.", idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
/* If the keys match perfectly, we setup @ictx and return 0. */
|
||||||
|
if ((key_len == le16_to_cpu(ie->key_length)) && !memcmp(key,
|
||||||
|
&ie->key, key_len)) {
|
||||||
|
ia_done:
|
||||||
|
ictx->is_in_root = false;
|
||||||
|
ictx->actx = NULL;
|
||||||
|
ictx->base_ni = NULL;
|
||||||
|
ictx->ia = ia;
|
||||||
|
ictx->page = page;
|
||||||
|
goto done;
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* Not a perfect match, need to do full blown collation so we
|
||||||
|
* know which way in the B+tree we have to go.
|
||||||
|
*/
|
||||||
|
rc = ntfs_collate(vol, idx_ni->itype.index.collation_rule, key,
|
||||||
|
key_len, &ie->key, le16_to_cpu(ie->key_length));
|
||||||
|
/*
|
||||||
|
* If @key collates before the key of the current entry, there
|
||||||
|
* is definitely no such key in this index but we might need to
|
||||||
|
* descend into the B+tree so we just break out of the loop.
|
||||||
|
*/
|
||||||
|
if (rc == -1)
|
||||||
|
break;
|
||||||
|
/*
|
||||||
|
* A match should never happen as the memcmp() call should have
|
||||||
|
* cought it, but we still treat it correctly.
|
||||||
|
*/
|
||||||
|
if (!rc)
|
||||||
|
goto ia_done;
|
||||||
|
/* The keys are not equal, continue the search. */
|
||||||
|
}
|
||||||
|
/*
|
||||||
|
* We have finished with this index buffer without success. Check for
|
||||||
|
* the presence of a child node and if not present return -ENOENT.
|
||||||
|
*/
|
||||||
|
if (!(ie->flags & INDEX_ENTRY_NODE)) {
|
||||||
|
ntfs_debug("Entry not found.");
|
||||||
|
err = -ENOENT;
|
||||||
|
goto ia_done;
|
||||||
|
}
|
||||||
|
if ((ia->index.flags & NODE_MASK) == LEAF_NODE) {
|
||||||
|
ntfs_error(sb, "Index entry with child node found in a leaf "
|
||||||
|
"node in inode 0x%lx.", idx_ni->mft_no);
|
||||||
|
goto unm_err_out;
|
||||||
|
}
|
||||||
|
/* Child node present, descend into it. */
|
||||||
|
old_vcn = vcn;
|
||||||
|
vcn = sle64_to_cpup((sle64*)((u8*)ie + le16_to_cpu(ie->length) - 8));
|
||||||
|
if (vcn >= 0) {
|
||||||
|
/*
|
||||||
|
* If vcn is in the same page cache page as old_vcn we recycle
|
||||||
|
* the mapped page.
|
||||||
|
*/
|
||||||
|
if (old_vcn << vol->cluster_size_bits >>
|
||||||
|
PAGE_SHIFT == vcn <<
|
||||||
|
vol->cluster_size_bits >>
|
||||||
|
PAGE_SHIFT)
|
||||||
|
goto fast_descend_into_child_node;
|
||||||
|
unlock_page(page);
|
||||||
|
ntfs_unmap_page(page);
|
||||||
|
goto descend_into_child_node;
|
||||||
|
}
|
||||||
|
ntfs_error(sb, "Negative child node vcn in inode 0x%lx.",
|
||||||
|
idx_ni->mft_no);
|
||||||
|
unm_err_out:
|
||||||
|
unlock_page(page);
|
||||||
|
ntfs_unmap_page(page);
|
||||||
|
err_out:
|
||||||
|
if (!err)
|
||||||
|
err = -EIO;
|
||||||
|
if (actx)
|
||||||
|
ntfs_attr_put_search_ctx(actx);
|
||||||
|
if (m)
|
||||||
|
unmap_mft_record(base_ni);
|
||||||
|
return err;
|
||||||
|
idx_err_out:
|
||||||
|
ntfs_error(sb, "Corrupt index. Aborting lookup.");
|
||||||
|
goto err_out;
|
||||||
|
}
|
||||||
+134
@@ -0,0 +1,134 @@
|
|||||||
|
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
||||||
|
/*
|
||||||
|
* index.h - Defines for NTFS kernel index handling. Part of the Linux-NTFS
|
||||||
|
* project.
|
||||||
|
*
|
||||||
|
* Copyright (c) 2004 Anton Altaparmakov
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _LINUX_NTFS_INDEX_H
|
||||||
|
#define _LINUX_NTFS_INDEX_H
|
||||||
|
|
||||||
|
#include <linux/fs.h>
|
||||||
|
|
||||||
|
#include "types.h"
|
||||||
|
#include "layout.h"
|
||||||
|
#include "inode.h"
|
||||||
|
#include "attrib.h"
|
||||||
|
#include "mft.h"
|
||||||
|
#include "aops.h"
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @idx_ni: index inode containing the @entry described by this context
|
||||||
|
* @entry: index entry (points into @ir or @ia)
|
||||||
|
* @data: index entry data (points into @entry)
|
||||||
|
* @data_len: length in bytes of @data
|
||||||
|
* @is_in_root: 'true' if @entry is in @ir and 'false' if it is in @ia
|
||||||
|
* @ir: index root if @is_in_root and NULL otherwise
|
||||||
|
* @actx: attribute search context if @is_in_root and NULL otherwise
|
||||||
|
* @base_ni: base inode if @is_in_root and NULL otherwise
|
||||||
|
* @ia: index block if @is_in_root is 'false' and NULL otherwise
|
||||||
|
* @page: page if @is_in_root is 'false' and NULL otherwise
|
||||||
|
*
|
||||||
|
* @idx_ni is the index inode this context belongs to.
|
||||||
|
*
|
||||||
|
* @entry is the index entry described by this context. @data and @data_len
|
||||||
|
* are the index entry data and its length in bytes, respectively. @data
|
||||||
|
* simply points into @entry. This is probably what the user is interested in.
|
||||||
|
*
|
||||||
|
* If @is_in_root is 'true', @entry is in the index root attribute @ir described
|
||||||
|
* by the attribute search context @actx and the base inode @base_ni. @ia and
|
||||||
|
* @page are NULL in this case.
|
||||||
|
*
|
||||||
|
* If @is_in_root is 'false', @entry is in the index allocation attribute and @ia
|
||||||
|
* and @page point to the index allocation block and the mapped, locked page it
|
||||||
|
* is in, respectively. @ir, @actx and @base_ni are NULL in this case.
|
||||||
|
*
|
||||||
|
* To obtain a context call ntfs_index_ctx_get().
|
||||||
|
*
|
||||||
|
* We use this context to allow ntfs_index_lookup() to return the found index
|
||||||
|
* @entry and its @data without having to allocate a buffer and copy the @entry
|
||||||
|
* and/or its @data into it.
|
||||||
|
*
|
||||||
|
* When finished with the @entry and its @data, call ntfs_index_ctx_put() to
|
||||||
|
* free the context and other associated resources.
|
||||||
|
*
|
||||||
|
* If the index entry was modified, call flush_dcache_index_entry_page()
|
||||||
|
* immediately after the modification and either ntfs_index_entry_mark_dirty()
|
||||||
|
* or ntfs_index_entry_write() before the call to ntfs_index_ctx_put() to
|
||||||
|
* ensure that the changes are written to disk.
|
||||||
|
*/
|
||||||
|
typedef struct {
|
||||||
|
ntfs_inode *idx_ni;
|
||||||
|
INDEX_ENTRY *entry;
|
||||||
|
void *data;
|
||||||
|
u16 data_len;
|
||||||
|
bool is_in_root;
|
||||||
|
INDEX_ROOT *ir;
|
||||||
|
ntfs_attr_search_ctx *actx;
|
||||||
|
ntfs_inode *base_ni;
|
||||||
|
INDEX_ALLOCATION *ia;
|
||||||
|
struct page *page;
|
||||||
|
} ntfs_index_context;
|
||||||
|
|
||||||
|
extern ntfs_index_context *ntfs_index_ctx_get(ntfs_inode *idx_ni);
|
||||||
|
extern void ntfs_index_ctx_put(ntfs_index_context *ictx);
|
||||||
|
|
||||||
|
extern int ntfs_index_lookup(const void *key, const int key_len,
|
||||||
|
ntfs_index_context *ictx);
|
||||||
|
|
||||||
|
#ifdef NTFS_RW
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_index_entry_flush_dcache_page - flush_dcache_page() for index entries
|
||||||
|
* @ictx: ntfs index context describing the index entry
|
||||||
|
*
|
||||||
|
* Call flush_dcache_page() for the page in which an index entry resides.
|
||||||
|
*
|
||||||
|
* This must be called every time an index entry is modified, just after the
|
||||||
|
* modification.
|
||||||
|
*
|
||||||
|
* If the index entry is in the index root attribute, simply flush the page
|
||||||
|
* containing the mft record containing the index root attribute.
|
||||||
|
*
|
||||||
|
* If the index entry is in an index block belonging to the index allocation
|
||||||
|
* attribute, simply flush the page cache page containing the index block.
|
||||||
|
*/
|
||||||
|
static inline void ntfs_index_entry_flush_dcache_page(ntfs_index_context *ictx)
|
||||||
|
{
|
||||||
|
if (ictx->is_in_root)
|
||||||
|
flush_dcache_mft_record_page(ictx->actx->ntfs_ino);
|
||||||
|
else
|
||||||
|
flush_dcache_page(ictx->page);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ntfs_index_entry_mark_dirty - mark an index entry dirty
|
||||||
|
* @ictx: ntfs index context describing the index entry
|
||||||
|
*
|
||||||
|
* Mark the index entry described by the index entry context @ictx dirty.
|
||||||
|
*
|
||||||
|
* If the index entry is in the index root attribute, simply mark the mft
|
||||||
|
* record containing the index root attribute dirty. This ensures the mft
|
||||||
|
* record, and hence the index root attribute, will be written out to disk
|
||||||
|
* later.
|
||||||
|
*
|
||||||
|
* If the index entry is in an index block belonging to the index allocation
|
||||||
|
* attribute, mark the buffers belonging to the index record as well as the
|
||||||
|
* page cache page the index block is in dirty. This automatically marks the
|
||||||
|
* VFS inode of the ntfs index inode to which the index entry belongs dirty,
|
||||||
|
* too (I_DIRTY_PAGES) and this in turn ensures the page buffers, and hence the
|
||||||
|
* dirty index block, will be written out to disk later.
|
||||||
|
*/
|
||||||
|
static inline void ntfs_index_entry_mark_dirty(ntfs_index_context *ictx)
|
||||||
|
{
|
||||||
|
if (ictx->is_in_root)
|
||||||
|
mark_mft_record_dirty(ictx->actx->ntfs_ino);
|
||||||
|
else
|
||||||
|
mark_ntfs_record_dirty(ictx->page,
|
||||||
|
(u8*)ictx->ia - (u8*)page_address(ictx->page));
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* NTFS_RW */
|
||||||
|
|
||||||
|
#endif /* _LINUX_NTFS_INDEX_H */
|
||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user