2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* linux/fs/adfs/super.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1997-1999 Russell King
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*/
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/parser.h>
|
2008-02-08 12:21:35 +00:00
|
|
|
#include <linux/mount.h>
|
|
|
|
#include <linux/seq_file.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2009-06-16 18:52:13 +00:00
|
|
|
#include <linux/statfs.h>
|
2012-02-07 23:58:38 +00:00
|
|
|
#include <linux/user_namespace.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include "adfs.h"
|
|
|
|
#include "dir_f.h"
|
|
|
|
#include "dir_fplus.h"
|
|
|
|
|
2019-06-04 13:50:03 +00:00
|
|
|
#define ADFS_SB_FLAGS SB_NOATIME
|
|
|
|
|
2008-02-08 12:21:35 +00:00
|
|
|
#define ADFS_DEFAULT_OWNER_MASK S_IRWXU
|
|
|
|
#define ADFS_DEFAULT_OTHER_MASK (S_IRWXG | S_IRWXO)
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
void __adfs_error(struct super_block *sb, const char *function, const char *fmt, ...)
|
|
|
|
{
|
2019-06-04 13:49:47 +00:00
|
|
|
struct va_format vaf;
|
2005-04-16 22:20:36 +00:00
|
|
|
va_list args;
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
2019-06-04 13:49:47 +00:00
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-06-04 13:49:47 +00:00
|
|
|
printk(KERN_CRIT "ADFS-fs error (device %s)%s%s: %pV\n",
|
2005-04-16 22:20:36 +00:00
|
|
|
sb->s_id, function ? ": " : "",
|
2019-06-04 13:49:47 +00:00
|
|
|
function ? function : "", &vaf);
|
|
|
|
|
|
|
|
va_end(args);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2019-06-04 13:49:52 +00:00
|
|
|
void adfs_msg(struct super_block *sb, const char *pfx, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
struct va_format vaf;
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
|
|
|
vaf.fmt = fmt;
|
|
|
|
vaf.va = &args;
|
|
|
|
printk("%sADFS-fs (%s): %pV\n", pfx, sb->s_id, &vaf);
|
|
|
|
va_end(args);
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static int adfs_checkdiscrecord(struct adfs_discrecord *dr)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* sector size must be 256, 512 or 1024 bytes */
|
|
|
|
if (dr->log2secsize != 8 &&
|
|
|
|
dr->log2secsize != 9 &&
|
|
|
|
dr->log2secsize != 10)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/* idlen must be at least log2secsize + 3 */
|
|
|
|
if (dr->idlen < dr->log2secsize + 3)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/* we cannot have such a large disc that we
|
|
|
|
* are unable to represent sector offsets in
|
|
|
|
* 32 bits. This works out at 2.0 TB.
|
|
|
|
*/
|
|
|
|
if (le32_to_cpu(dr->disc_size_high) >> dr->log2secsize)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/* idlen must be no greater than 19 v2 [1.0] */
|
|
|
|
if (dr->idlen > 19)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/* reserved bytes should be zero */
|
|
|
|
for (i = 0; i < sizeof(dr->unused52); i++)
|
|
|
|
if (dr->unused52[i] != 0)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned char adfs_calczonecheck(struct super_block *sb, unsigned char *map)
|
|
|
|
{
|
|
|
|
unsigned int v0, v1, v2, v3;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
v0 = v1 = v2 = v3 = 0;
|
|
|
|
for (i = sb->s_blocksize - 4; i; i -= 4) {
|
|
|
|
v0 += map[i] + (v3 >> 8);
|
|
|
|
v3 &= 0xff;
|
|
|
|
v1 += map[i + 1] + (v0 >> 8);
|
|
|
|
v0 &= 0xff;
|
|
|
|
v2 += map[i + 2] + (v1 >> 8);
|
|
|
|
v1 &= 0xff;
|
|
|
|
v3 += map[i + 3] + (v2 >> 8);
|
|
|
|
v2 &= 0xff;
|
|
|
|
}
|
|
|
|
v0 += v3 >> 8;
|
|
|
|
v1 += map[1] + (v0 >> 8);
|
|
|
|
v2 += map[2] + (v1 >> 8);
|
|
|
|
v3 += map[3] + (v2 >> 8);
|
|
|
|
|
|
|
|
return v0 ^ v1 ^ v2 ^ v3;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int adfs_checkmap(struct super_block *sb, struct adfs_discmap *dm)
|
|
|
|
{
|
|
|
|
unsigned char crosscheck = 0, zonecheck = 1;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < ADFS_SB(sb)->s_map_size; i++) {
|
|
|
|
unsigned char *map;
|
|
|
|
|
|
|
|
map = dm[i].dm_bh->b_data;
|
|
|
|
|
|
|
|
if (adfs_calczonecheck(sb, map) != map[0]) {
|
|
|
|
adfs_error(sb, "zone %d fails zonecheck", i);
|
|
|
|
zonecheck = 0;
|
|
|
|
}
|
|
|
|
crosscheck ^= map[3];
|
|
|
|
}
|
|
|
|
if (crosscheck != 0xff)
|
|
|
|
adfs_error(sb, "crosscheck != 0xff");
|
|
|
|
return crosscheck == 0xff && zonecheck;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void adfs_put_super(struct super_block *sb)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct adfs_sb_info *asb = ADFS_SB(sb);
|
|
|
|
|
|
|
|
for (i = 0; i < asb->s_map_size; i++)
|
|
|
|
brelse(asb->s_map[i].dm_bh);
|
|
|
|
kfree(asb->s_map);
|
2013-10-03 16:37:18 +00:00
|
|
|
kfree_rcu(asb, rcu);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2011-12-09 02:32:45 +00:00
|
|
|
static int adfs_show_options(struct seq_file *seq, struct dentry *root)
|
2008-02-08 12:21:35 +00:00
|
|
|
{
|
2011-12-09 02:32:45 +00:00
|
|
|
struct adfs_sb_info *asb = ADFS_SB(root->d_sb);
|
2008-02-08 12:21:35 +00:00
|
|
|
|
2012-02-07 23:58:38 +00:00
|
|
|
if (!uid_eq(asb->s_uid, GLOBAL_ROOT_UID))
|
|
|
|
seq_printf(seq, ",uid=%u", from_kuid_munged(&init_user_ns, asb->s_uid));
|
|
|
|
if (!gid_eq(asb->s_gid, GLOBAL_ROOT_GID))
|
|
|
|
seq_printf(seq, ",gid=%u", from_kgid_munged(&init_user_ns, asb->s_gid));
|
2008-02-08 12:21:35 +00:00
|
|
|
if (asb->s_owner_mask != ADFS_DEFAULT_OWNER_MASK)
|
|
|
|
seq_printf(seq, ",ownmask=%o", asb->s_owner_mask);
|
|
|
|
if (asb->s_other_mask != ADFS_DEFAULT_OTHER_MASK)
|
|
|
|
seq_printf(seq, ",othmask=%o", asb->s_other_mask);
|
2011-03-22 23:35:06 +00:00
|
|
|
if (asb->s_ftsuffix != 0)
|
|
|
|
seq_printf(seq, ",ftsuffix=%u", asb->s_ftsuffix);
|
2008-02-08 12:21:35 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-03-22 23:35:06 +00:00
|
|
|
enum {Opt_uid, Opt_gid, Opt_ownmask, Opt_othmask, Opt_ftsuffix, Opt_err};
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-10-13 09:46:57 +00:00
|
|
|
static const match_table_t tokens = {
|
2005-04-16 22:20:36 +00:00
|
|
|
{Opt_uid, "uid=%u"},
|
|
|
|
{Opt_gid, "gid=%u"},
|
|
|
|
{Opt_ownmask, "ownmask=%o"},
|
|
|
|
{Opt_othmask, "othmask=%o"},
|
2011-03-22 23:35:06 +00:00
|
|
|
{Opt_ftsuffix, "ftsuffix=%u"},
|
2005-04-16 22:20:36 +00:00
|
|
|
{Opt_err, NULL}
|
|
|
|
};
|
|
|
|
|
2019-06-04 13:50:09 +00:00
|
|
|
static int parse_options(struct super_block *sb, struct adfs_sb_info *asb,
|
|
|
|
char *options)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
char *p;
|
|
|
|
int option;
|
|
|
|
|
|
|
|
if (!options)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
while ((p = strsep(&options, ",")) != NULL) {
|
|
|
|
substring_t args[MAX_OPT_ARGS];
|
|
|
|
int token;
|
|
|
|
if (!*p)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
token = match_token(p, tokens, args);
|
|
|
|
switch (token) {
|
|
|
|
case Opt_uid:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return -EINVAL;
|
2012-02-07 23:58:38 +00:00
|
|
|
asb->s_uid = make_kuid(current_user_ns(), option);
|
|
|
|
if (!uid_valid(asb->s_uid))
|
|
|
|
return -EINVAL;
|
2005-04-16 22:20:36 +00:00
|
|
|
break;
|
|
|
|
case Opt_gid:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return -EINVAL;
|
2012-02-07 23:58:38 +00:00
|
|
|
asb->s_gid = make_kgid(current_user_ns(), option);
|
|
|
|
if (!gid_valid(asb->s_gid))
|
|
|
|
return -EINVAL;
|
2005-04-16 22:20:36 +00:00
|
|
|
break;
|
|
|
|
case Opt_ownmask:
|
|
|
|
if (match_octal(args, &option))
|
|
|
|
return -EINVAL;
|
|
|
|
asb->s_owner_mask = option;
|
|
|
|
break;
|
|
|
|
case Opt_othmask:
|
|
|
|
if (match_octal(args, &option))
|
|
|
|
return -EINVAL;
|
|
|
|
asb->s_other_mask = option;
|
|
|
|
break;
|
2011-03-22 23:35:06 +00:00
|
|
|
case Opt_ftsuffix:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return -EINVAL;
|
|
|
|
asb->s_ftsuffix = option;
|
|
|
|
break;
|
2005-04-16 22:20:36 +00:00
|
|
|
default:
|
2019-06-04 13:49:52 +00:00
|
|
|
adfs_msg(sb, KERN_ERR,
|
|
|
|
"unrecognised mount option \"%s\" or missing value",
|
|
|
|
p);
|
2005-04-16 22:20:36 +00:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int adfs_remount(struct super_block *sb, int *flags, char *data)
|
|
|
|
{
|
2019-06-04 13:50:09 +00:00
|
|
|
struct adfs_sb_info temp_asb;
|
|
|
|
int ret;
|
|
|
|
|
2014-03-13 14:14:33 +00:00
|
|
|
sync_filesystem(sb);
|
2019-06-04 13:50:03 +00:00
|
|
|
*flags |= ADFS_SB_FLAGS;
|
2019-06-04 13:50:09 +00:00
|
|
|
|
|
|
|
temp_asb = *ADFS_SB(sb);
|
|
|
|
ret = parse_options(sb, &temp_asb, data);
|
|
|
|
if (ret == 0)
|
|
|
|
*ADFS_SB(sb) = temp_asb;
|
|
|
|
|
|
|
|
return ret;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2006-06-23 09:02:58 +00:00
|
|
|
static int adfs_statfs(struct dentry *dentry, struct kstatfs *buf)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2009-04-02 23:59:27 +00:00
|
|
|
struct super_block *sb = dentry->d_sb;
|
|
|
|
struct adfs_sb_info *sbi = ADFS_SB(sb);
|
2019-06-04 13:49:36 +00:00
|
|
|
struct adfs_discrecord *dr = adfs_map_discrecord(sbi->s_map);
|
2009-04-02 23:59:27 +00:00
|
|
|
u64 id = huge_encode_dev(sb->s_bdev->bd_dev);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
buf->f_type = ADFS_SUPER_MAGIC;
|
2009-04-02 23:59:27 +00:00
|
|
|
buf->f_namelen = sbi->s_namelen;
|
|
|
|
buf->f_bsize = sb->s_blocksize;
|
2019-06-04 13:49:36 +00:00
|
|
|
buf->f_blocks = adfs_disc_size(dr) >> sb->s_blocksize_bits;
|
2009-04-02 23:59:27 +00:00
|
|
|
buf->f_files = sbi->s_ids_per_zone * sbi->s_map_size;
|
2005-04-16 22:20:36 +00:00
|
|
|
buf->f_bavail =
|
2009-04-02 23:59:27 +00:00
|
|
|
buf->f_bfree = adfs_map_free(sb);
|
2005-04-16 22:20:36 +00:00
|
|
|
buf->f_ffree = (long)(buf->f_bfree * buf->f_files) / (long)buf->f_blocks;
|
2009-04-02 23:59:27 +00:00
|
|
|
buf->f_fsid.val[0] = (u32)id;
|
|
|
|
buf->f_fsid.val[1] = (u32)(id >> 32);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-12-07 04:33:20 +00:00
|
|
|
static struct kmem_cache *adfs_inode_cachep;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static struct inode *adfs_alloc_inode(struct super_block *sb)
|
|
|
|
{
|
|
|
|
struct adfs_inode_info *ei;
|
2015-06-30 21:57:52 +00:00
|
|
|
ei = kmem_cache_alloc(adfs_inode_cachep, GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!ei)
|
|
|
|
return NULL;
|
|
|
|
return &ei->vfs_inode;
|
|
|
|
}
|
|
|
|
|
2019-04-10 19:01:52 +00:00
|
|
|
static void adfs_free_inode(struct inode *inode)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
kmem_cache_free(adfs_inode_cachep, ADFS_I(inode));
|
|
|
|
}
|
|
|
|
|
2008-07-26 02:45:34 +00:00
|
|
|
static void init_once(void *foo)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct adfs_inode_info *ei = (struct adfs_inode_info *) foo;
|
|
|
|
|
2007-05-17 05:10:57 +00:00
|
|
|
inode_init_once(&ei->vfs_inode);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2007-07-20 01:11:58 +00:00
|
|
|
|
2014-04-07 22:38:58 +00:00
|
|
|
static int __init init_inodecache(void)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
adfs_inode_cachep = kmem_cache_create("adfs_inode_cache",
|
|
|
|
sizeof(struct adfs_inode_info),
|
2006-03-24 11:16:06 +00:00
|
|
|
0, (SLAB_RECLAIM_ACCOUNT|
|
2016-01-14 23:18:21 +00:00
|
|
|
SLAB_MEM_SPREAD|SLAB_ACCOUNT),
|
2007-07-20 01:11:58 +00:00
|
|
|
init_once);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (adfs_inode_cachep == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void destroy_inodecache(void)
|
|
|
|
{
|
2012-09-26 01:33:07 +00:00
|
|
|
/*
|
|
|
|
* Make sure all delayed rcu free inodes are flushed before we
|
|
|
|
* destroy cache.
|
|
|
|
*/
|
|
|
|
rcu_barrier();
|
2006-09-27 08:49:40 +00:00
|
|
|
kmem_cache_destroy(adfs_inode_cachep);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2007-02-12 08:55:41 +00:00
|
|
|
static const struct super_operations adfs_sops = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.alloc_inode = adfs_alloc_inode,
|
2019-04-10 19:01:52 +00:00
|
|
|
.free_inode = adfs_free_inode,
|
2018-06-30 07:15:49 +00:00
|
|
|
.drop_inode = generic_delete_inode,
|
2005-04-16 22:20:36 +00:00
|
|
|
.write_inode = adfs_write_inode,
|
|
|
|
.put_super = adfs_put_super,
|
|
|
|
.statfs = adfs_statfs,
|
|
|
|
.remount_fs = adfs_remount,
|
2008-02-08 12:21:35 +00:00
|
|
|
.show_options = adfs_show_options,
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct adfs_discmap *adfs_read_map(struct super_block *sb, struct adfs_discrecord *dr)
|
|
|
|
{
|
|
|
|
struct adfs_discmap *dm;
|
|
|
|
unsigned int map_addr, zone_size, nzones;
|
|
|
|
int i, zone;
|
|
|
|
struct adfs_sb_info *asb = ADFS_SB(sb);
|
|
|
|
|
|
|
|
nzones = asb->s_map_size;
|
|
|
|
zone_size = (8 << dr->log2secsize) - le16_to_cpu(dr->zone_spare);
|
|
|
|
map_addr = (nzones >> 1) * zone_size -
|
|
|
|
((nzones > 1) ? ADFS_DR_SIZE_BITS : 0);
|
|
|
|
map_addr = signed_asl(map_addr, asb->s_map2blk);
|
|
|
|
|
|
|
|
asb->s_ids_per_zone = zone_size / (asb->s_idlen + 1);
|
|
|
|
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 20:55:00 +00:00
|
|
|
dm = kmalloc_array(nzones, sizeof(*dm), GFP_KERNEL);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (dm == NULL) {
|
|
|
|
adfs_error(sb, "not enough memory");
|
2015-04-16 19:48:13 +00:00
|
|
|
return ERR_PTR(-ENOMEM);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for (zone = 0; zone < nzones; zone++, map_addr++) {
|
|
|
|
dm[zone].dm_startbit = 0;
|
|
|
|
dm[zone].dm_endbit = zone_size;
|
|
|
|
dm[zone].dm_startblk = zone * zone_size - ADFS_DR_SIZE_BITS;
|
|
|
|
dm[zone].dm_bh = sb_bread(sb, map_addr);
|
|
|
|
|
|
|
|
if (!dm[zone].dm_bh) {
|
|
|
|
adfs_error(sb, "unable to read map");
|
|
|
|
goto error_free;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* adjust the limits for the first and last map zones */
|
|
|
|
i = zone - 1;
|
|
|
|
dm[0].dm_startblk = 0;
|
|
|
|
dm[0].dm_startbit = ADFS_DR_SIZE_BITS;
|
2019-06-04 13:49:36 +00:00
|
|
|
dm[i].dm_endbit = (adfs_disc_size(dr) >> dr->log2bpmb) +
|
2005-04-16 22:20:36 +00:00
|
|
|
(ADFS_DR_SIZE_BITS - i * zone_size);
|
|
|
|
|
|
|
|
if (adfs_checkmap(sb, dm))
|
|
|
|
return dm;
|
|
|
|
|
2006-08-14 06:24:17 +00:00
|
|
|
adfs_error(sb, "map corrupted");
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
error_free:
|
|
|
|
while (--zone >= 0)
|
|
|
|
brelse(dm[zone].dm_bh);
|
|
|
|
|
|
|
|
kfree(dm);
|
2015-04-16 19:48:13 +00:00
|
|
|
return ERR_PTR(-EIO);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int adfs_fill_super(struct super_block *sb, void *data, int silent)
|
|
|
|
{
|
|
|
|
struct adfs_discrecord *dr;
|
|
|
|
struct buffer_head *bh;
|
|
|
|
struct object_info root_obj;
|
|
|
|
unsigned char *b_data;
|
2019-06-04 13:50:14 +00:00
|
|
|
unsigned int blocksize;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct adfs_sb_info *asb;
|
|
|
|
struct inode *root;
|
2015-04-16 19:48:13 +00:00
|
|
|
int ret = -EINVAL;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-06-04 13:50:03 +00:00
|
|
|
sb->s_flags |= ADFS_SB_FLAGS;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2006-09-27 08:49:37 +00:00
|
|
|
asb = kzalloc(sizeof(*asb), GFP_KERNEL);
|
2011-01-22 19:05:05 +00:00
|
|
|
if (!asb)
|
2005-04-16 22:20:36 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
sb->s_fs_info = asb;
|
|
|
|
|
|
|
|
/* set default options */
|
2012-02-07 23:58:38 +00:00
|
|
|
asb->s_uid = GLOBAL_ROOT_UID;
|
|
|
|
asb->s_gid = GLOBAL_ROOT_GID;
|
2008-02-08 12:21:35 +00:00
|
|
|
asb->s_owner_mask = ADFS_DEFAULT_OWNER_MASK;
|
|
|
|
asb->s_other_mask = ADFS_DEFAULT_OTHER_MASK;
|
2011-03-22 23:35:06 +00:00
|
|
|
asb->s_ftsuffix = 0;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-06-04 13:50:09 +00:00
|
|
|
if (parse_options(sb, asb, data))
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error;
|
|
|
|
|
|
|
|
sb_set_blocksize(sb, BLOCK_SIZE);
|
|
|
|
if (!(bh = sb_bread(sb, ADFS_DISCRECORD / BLOCK_SIZE))) {
|
2019-06-04 13:49:52 +00:00
|
|
|
adfs_msg(sb, KERN_ERR, "error: unable to read superblock");
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EIO;
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
b_data = bh->b_data + (ADFS_DISCRECORD % BLOCK_SIZE);
|
|
|
|
|
|
|
|
if (adfs_checkbblk(b_data)) {
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EINVAL;
|
2019-06-04 13:49:52 +00:00
|
|
|
goto error_badfs;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
dr = (struct adfs_discrecord *)(b_data + ADFS_DR_OFFSET);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do some sanity checks on the ADFS disc record
|
|
|
|
*/
|
|
|
|
if (adfs_checkdiscrecord(dr)) {
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EINVAL;
|
2019-06-04 13:49:52 +00:00
|
|
|
goto error_badfs;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2019-06-04 13:50:14 +00:00
|
|
|
blocksize = 1 << dr->log2secsize;
|
2005-04-16 22:20:36 +00:00
|
|
|
brelse(bh);
|
2019-06-04 13:50:14 +00:00
|
|
|
|
|
|
|
if (sb_set_blocksize(sb, blocksize)) {
|
2005-04-16 22:20:36 +00:00
|
|
|
bh = sb_bread(sb, ADFS_DISCRECORD / sb->s_blocksize);
|
|
|
|
if (!bh) {
|
2019-06-04 13:49:52 +00:00
|
|
|
adfs_msg(sb, KERN_ERR,
|
|
|
|
"error: couldn't read superblock on 2nd try.");
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EIO;
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
b_data = bh->b_data + (ADFS_DISCRECORD % sb->s_blocksize);
|
|
|
|
if (adfs_checkbblk(b_data)) {
|
2019-06-04 13:49:52 +00:00
|
|
|
adfs_msg(sb, KERN_ERR,
|
|
|
|
"error: disc record mismatch, very weird!");
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EINVAL;
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error_free_bh;
|
|
|
|
}
|
|
|
|
dr = (struct adfs_discrecord *)(b_data + ADFS_DR_OFFSET);
|
|
|
|
} else {
|
|
|
|
if (!silent)
|
2019-06-04 13:49:52 +00:00
|
|
|
adfs_msg(sb, KERN_ERR,
|
|
|
|
"error: unsupported blocksize");
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EINVAL;
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* blocksize on this device should now be set to the ADFS log2secsize
|
|
|
|
*/
|
|
|
|
|
|
|
|
sb->s_magic = ADFS_SUPER_MAGIC;
|
|
|
|
asb->s_idlen = dr->idlen;
|
|
|
|
asb->s_map_size = dr->nzones | (dr->nzones_high << 8);
|
|
|
|
asb->s_map2blk = dr->log2bpmb - dr->log2secsize;
|
|
|
|
asb->s_log2sharesize = dr->log2sharesize;
|
2015-04-16 19:48:13 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
asb->s_map = adfs_read_map(sb, dr);
|
2015-04-16 19:48:13 +00:00
|
|
|
if (IS_ERR(asb->s_map)) {
|
|
|
|
ret = PTR_ERR(asb->s_map);
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error_free_bh;
|
2015-04-16 19:48:13 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
brelse(bh);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* set up enough so that we can read an inode
|
|
|
|
*/
|
|
|
|
sb->s_op = &adfs_sops;
|
|
|
|
|
2019-06-04 13:49:30 +00:00
|
|
|
dr = adfs_map_discrecord(asb->s_map);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2019-06-04 13:49:57 +00:00
|
|
|
root_obj.parent_id = root_obj.indaddr = le32_to_cpu(dr->root);
|
2005-04-16 22:20:36 +00:00
|
|
|
root_obj.name_len = 0;
|
2011-03-22 23:35:06 +00:00
|
|
|
/* Set root object date as 01 Jan 1987 00:00:00 */
|
|
|
|
root_obj.loadaddr = 0xfff0003f;
|
|
|
|
root_obj.execaddr = 0xec22c000;
|
2005-04-16 22:20:36 +00:00
|
|
|
root_obj.size = ADFS_NEWDIR_SIZE;
|
|
|
|
root_obj.attr = ADFS_NDA_DIRECTORY | ADFS_NDA_OWNER_READ |
|
|
|
|
ADFS_NDA_OWNER_WRITE | ADFS_NDA_PUBLIC_READ;
|
2011-03-22 23:35:06 +00:00
|
|
|
root_obj.filetype = -1;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If this is a F+ disk with variable length directories,
|
|
|
|
* get the root_size from the disc record.
|
|
|
|
*/
|
2019-06-04 13:49:41 +00:00
|
|
|
if (dr->format_version) {
|
2005-04-16 22:20:36 +00:00
|
|
|
root_obj.size = le32_to_cpu(dr->root_size);
|
|
|
|
asb->s_dir = &adfs_fplus_dir_ops;
|
|
|
|
asb->s_namelen = ADFS_FPLUS_NAME_LEN;
|
|
|
|
} else {
|
|
|
|
asb->s_dir = &adfs_f_dir_ops;
|
|
|
|
asb->s_namelen = ADFS_F_NAME_LEN;
|
|
|
|
}
|
2011-03-22 23:35:06 +00:00
|
|
|
/*
|
|
|
|
* ,xyz hex filetype suffix may be added by driver
|
|
|
|
* to files that have valid RISC OS filetype
|
|
|
|
*/
|
|
|
|
if (asb->s_ftsuffix)
|
|
|
|
asb->s_namelen += 4;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-12-18 16:20:57 +00:00
|
|
|
sb->s_d_op = &adfs_dentry_operations;
|
2005-04-16 22:20:36 +00:00
|
|
|
root = adfs_iget(sb, &root_obj);
|
2012-01-09 03:15:13 +00:00
|
|
|
sb->s_root = d_make_root(root);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (!sb->s_root) {
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < asb->s_map_size; i++)
|
|
|
|
brelse(asb->s_map[i].dm_bh);
|
|
|
|
kfree(asb->s_map);
|
|
|
|
adfs_error(sb, "get root inode failed\n");
|
2015-04-16 19:48:13 +00:00
|
|
|
ret = -EIO;
|
2005-04-16 22:20:36 +00:00
|
|
|
goto error;
|
2010-12-18 16:20:57 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
|
|
|
|
2019-06-04 13:49:52 +00:00
|
|
|
error_badfs:
|
|
|
|
if (!silent)
|
|
|
|
adfs_msg(sb, KERN_ERR,
|
|
|
|
"error: can't find an ADFS filesystem on dev %s.",
|
|
|
|
sb->s_id);
|
2005-04-16 22:20:36 +00:00
|
|
|
error_free_bh:
|
|
|
|
brelse(bh);
|
|
|
|
error:
|
|
|
|
sb->s_fs_info = NULL;
|
|
|
|
kfree(asb);
|
2015-04-16 19:48:13 +00:00
|
|
|
return ret;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2010-07-24 20:46:55 +00:00
|
|
|
static struct dentry *adfs_mount(struct file_system_type *fs_type,
|
|
|
|
int flags, const char *dev_name, void *data)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2010-07-24 20:46:55 +00:00
|
|
|
return mount_bdev(fs_type, flags, dev_name, data, adfs_fill_super);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_system_type adfs_fs_type = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.name = "adfs",
|
2010-07-24 20:46:55 +00:00
|
|
|
.mount = adfs_mount,
|
2005-04-16 22:20:36 +00:00
|
|
|
.kill_sb = kill_block_super,
|
|
|
|
.fs_flags = FS_REQUIRES_DEV,
|
|
|
|
};
|
2013-03-03 03:39:14 +00:00
|
|
|
MODULE_ALIAS_FS("adfs");
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static int __init init_adfs_fs(void)
|
|
|
|
{
|
|
|
|
int err = init_inodecache();
|
|
|
|
if (err)
|
|
|
|
goto out1;
|
|
|
|
err = register_filesystem(&adfs_fs_type);
|
|
|
|
if (err)
|
|
|
|
goto out;
|
|
|
|
return 0;
|
|
|
|
out:
|
|
|
|
destroy_inodecache();
|
|
|
|
out1:
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __exit exit_adfs_fs(void)
|
|
|
|
{
|
|
|
|
unregister_filesystem(&adfs_fs_type);
|
|
|
|
destroy_inodecache();
|
|
|
|
}
|
|
|
|
|
|
|
|
module_init(init_adfs_fs)
|
|
|
|
module_exit(exit_adfs_fs)
|
2009-06-16 18:52:13 +00:00
|
|
|
MODULE_LICENSE("GPL");
|