2010-07-29 23:48:03 +02:00
|
|
|
/*
|
|
|
|
* AppArmor security module
|
|
|
|
*
|
|
|
|
* This file contains AppArmor /sys/kernel/security/apparmor interface functions
|
|
|
|
*
|
|
|
|
* Copyright (C) 1998-2008 Novell/SUSE
|
|
|
|
* Copyright 2009-2010 Canonical Ltd.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation, version 2 of the
|
|
|
|
* License.
|
|
|
|
*/
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
#include <linux/ctype.h>
|
2010-07-29 23:48:03 +02:00
|
|
|
#include <linux/security.h>
|
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/seq_file.h>
|
|
|
|
#include <linux/uaccess.h>
|
2017-01-16 09:42:45 +01:00
|
|
|
#include <linux/mount.h>
|
2010-07-29 23:48:03 +02:00
|
|
|
#include <linux/namei.h>
|
2012-01-27 01:29:21 +01:00
|
|
|
#include <linux/capability.h>
|
2013-07-11 06:18:43 +02:00
|
|
|
#include <linux/rcupdate.h>
|
2017-01-16 09:42:45 +01:00
|
|
|
#include <linux/fs.h>
|
2017-05-27 01:27:58 +02:00
|
|
|
#include <linux/poll.h>
|
2017-05-25 14:52:56 +02:00
|
|
|
#include <uapi/linux/major.h>
|
|
|
|
#include <uapi/linux/magic.h>
|
2010-07-29 23:48:03 +02:00
|
|
|
|
|
|
|
#include "include/apparmor.h"
|
|
|
|
#include "include/apparmorfs.h"
|
|
|
|
#include "include/audit.h"
|
2017-10-11 10:04:48 +02:00
|
|
|
#include "include/cred.h"
|
2013-08-14 20:27:36 +02:00
|
|
|
#include "include/crypto.h"
|
2017-07-19 07:56:22 +02:00
|
|
|
#include "include/ipc.h"
|
2017-06-09 22:55:38 +02:00
|
|
|
#include "include/label.h"
|
2010-07-29 23:48:03 +02:00
|
|
|
#include "include/policy.h"
|
2017-01-16 09:42:15 +01:00
|
|
|
#include "include/policy_ns.h"
|
2012-01-27 01:29:23 +01:00
|
|
|
#include "include/resource.h"
|
2017-01-16 09:42:55 +01:00
|
|
|
#include "include/policy_unpack.h"
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
/*
|
|
|
|
* The apparmor filesystem interface used for policy load and introspection
|
|
|
|
* The interface is split into two main components based on their function
|
|
|
|
* a securityfs component:
|
|
|
|
* used for static files that are always available, and which allows
|
|
|
|
* userspace to specificy the location of the security filesystem.
|
|
|
|
*
|
|
|
|
* fns and data are prefixed with
|
|
|
|
* aa_sfs_
|
|
|
|
*
|
|
|
|
* an apparmorfs component:
|
|
|
|
* used loaded policy content and introspection. It is not part of a
|
|
|
|
* regular mounted filesystem and is available only through the magic
|
|
|
|
* policy symlink in the root of the securityfs apparmor/ directory.
|
|
|
|
* Tasks queries will be magically redirected to the correct portion
|
|
|
|
* of the policy tree based on their confinement.
|
|
|
|
*
|
|
|
|
* fns and data are prefixed with
|
|
|
|
* aafs_
|
|
|
|
*
|
|
|
|
* The aa_fs_ prefix is used to indicate the fn is used by both the
|
|
|
|
* securityfs and apparmorfs filesystems.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* support fns
|
|
|
|
*/
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
/**
|
|
|
|
* aa_mangle_name - mangle a profile name to std profile layout form
|
|
|
|
* @name: profile name to mangle (NOT NULL)
|
|
|
|
* @target: buffer to store mangled name, same length as @name (MAYBE NULL)
|
|
|
|
*
|
|
|
|
* Returns: length of mangled name
|
|
|
|
*/
|
2017-01-16 09:42:30 +01:00
|
|
|
static int mangle_name(const char *name, char *target)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
|
|
|
char *t = target;
|
|
|
|
|
|
|
|
while (*name == '/' || *name == '.')
|
|
|
|
name++;
|
|
|
|
|
|
|
|
if (target) {
|
|
|
|
for (; *name; name++) {
|
|
|
|
if (*name == '/')
|
|
|
|
*(t)++ = '.';
|
|
|
|
else if (isspace(*name))
|
|
|
|
*(t)++ = '_';
|
|
|
|
else if (isalnum(*name) || strchr("._-", *name))
|
|
|
|
*(t)++ = *name;
|
|
|
|
}
|
|
|
|
|
|
|
|
*t = 0;
|
|
|
|
} else {
|
|
|
|
int len = 0;
|
|
|
|
for (; *name; name++) {
|
|
|
|
if (isalnum(*name) || isspace(*name) ||
|
|
|
|
strchr("/._-", *name))
|
|
|
|
len++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
return t - target;
|
|
|
|
}
|
|
|
|
|
2017-05-25 14:52:56 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* aafs - core fns and data for the policy tree
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define AAFS_NAME "apparmorfs"
|
|
|
|
static struct vfsmount *aafs_mnt;
|
|
|
|
static int aafs_count;
|
|
|
|
|
|
|
|
|
|
|
|
static int aafs_show_path(struct seq_file *seq, struct dentry *dentry)
|
|
|
|
{
|
2018-02-05 18:26:46 +01:00
|
|
|
seq_printf(seq, "%s:[%lu]", AAFS_NAME, d_inode(dentry)->i_ino);
|
2017-05-25 14:52:56 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void aafs_evict_inode(struct inode *inode)
|
|
|
|
{
|
|
|
|
truncate_inode_pages_final(&inode->i_data);
|
|
|
|
clear_inode(inode);
|
|
|
|
if (S_ISLNK(inode->i_mode))
|
|
|
|
kfree(inode->i_link);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct super_operations aafs_super_ops = {
|
|
|
|
.statfs = simple_statfs,
|
|
|
|
.evict_inode = aafs_evict_inode,
|
|
|
|
.show_path = aafs_show_path,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int fill_super(struct super_block *sb, void *data, int silent)
|
|
|
|
{
|
|
|
|
static struct tree_descr files[] = { {""} };
|
|
|
|
int error;
|
|
|
|
|
|
|
|
error = simple_fill_super(sb, AAFS_MAGIC, files);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
sb->s_op = &aafs_super_ops;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct dentry *aafs_mount(struct file_system_type *fs_type,
|
|
|
|
int flags, const char *dev_name, void *data)
|
|
|
|
{
|
|
|
|
return mount_single(fs_type, flags, data, fill_super);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_system_type aafs_ops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.name = AAFS_NAME,
|
|
|
|
.mount = aafs_mount,
|
|
|
|
.kill_sb = kill_anon_super,
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __aafs_setup_d_inode - basic inode setup for apparmorfs
|
|
|
|
* @dir: parent directory for the dentry
|
|
|
|
* @dentry: dentry we are seting the inode up for
|
|
|
|
* @mode: permissions the file should have
|
|
|
|
* @data: data to store on inode.i_private, available in open()
|
|
|
|
* @link: if symlink, symlink target string
|
|
|
|
* @fops: struct file_operations that should be used
|
|
|
|
* @iops: struct of inode_operations that should be used
|
|
|
|
*/
|
|
|
|
static int __aafs_setup_d_inode(struct inode *dir, struct dentry *dentry,
|
|
|
|
umode_t mode, void *data, char *link,
|
|
|
|
const struct file_operations *fops,
|
|
|
|
const struct inode_operations *iops)
|
|
|
|
{
|
|
|
|
struct inode *inode = new_inode(dir->i_sb);
|
|
|
|
|
|
|
|
AA_BUG(!dir);
|
|
|
|
AA_BUG(!dentry);
|
|
|
|
|
|
|
|
if (!inode)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
inode->i_ino = get_next_ino();
|
|
|
|
inode->i_mode = mode;
|
|
|
|
inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
|
|
|
|
inode->i_private = data;
|
|
|
|
if (S_ISDIR(mode)) {
|
|
|
|
inode->i_op = iops ? iops : &simple_dir_inode_operations;
|
|
|
|
inode->i_fop = &simple_dir_operations;
|
|
|
|
inc_nlink(inode);
|
|
|
|
inc_nlink(dir);
|
|
|
|
} else if (S_ISLNK(mode)) {
|
|
|
|
inode->i_op = iops ? iops : &simple_symlink_inode_operations;
|
|
|
|
inode->i_link = link;
|
|
|
|
} else {
|
|
|
|
inode->i_fop = fops;
|
|
|
|
}
|
|
|
|
d_instantiate(dentry, inode);
|
|
|
|
dget(dentry);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aafs_create - create a dentry in the apparmorfs filesystem
|
|
|
|
*
|
|
|
|
* @name: name of dentry to create
|
|
|
|
* @mode: permissions the file should have
|
|
|
|
* @parent: parent directory for this dentry
|
|
|
|
* @data: data to store on inode.i_private, available in open()
|
|
|
|
* @link: if symlink, symlink target string
|
|
|
|
* @fops: struct file_operations that should be used for
|
|
|
|
* @iops: struct of inode_operations that should be used
|
|
|
|
*
|
|
|
|
* This is the basic "create a xxx" function for apparmorfs.
|
|
|
|
*
|
|
|
|
* Returns a pointer to a dentry if it succeeds, that must be free with
|
|
|
|
* aafs_remove(). Will return ERR_PTR on failure.
|
|
|
|
*/
|
|
|
|
static struct dentry *aafs_create(const char *name, umode_t mode,
|
|
|
|
struct dentry *parent, void *data, void *link,
|
|
|
|
const struct file_operations *fops,
|
|
|
|
const struct inode_operations *iops)
|
|
|
|
{
|
|
|
|
struct dentry *dentry;
|
|
|
|
struct inode *dir;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
AA_BUG(!name);
|
|
|
|
AA_BUG(!parent);
|
|
|
|
|
|
|
|
if (!(mode & S_IFMT))
|
|
|
|
mode = (mode & S_IALLUGO) | S_IFREG;
|
|
|
|
|
|
|
|
error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
|
|
|
|
if (error)
|
|
|
|
return ERR_PTR(error);
|
|
|
|
|
|
|
|
dir = d_inode(parent);
|
|
|
|
|
|
|
|
inode_lock(dir);
|
|
|
|
dentry = lookup_one_len(name, parent, strlen(name));
|
2017-07-13 09:39:20 +02:00
|
|
|
if (IS_ERR(dentry)) {
|
|
|
|
error = PTR_ERR(dentry);
|
2017-05-25 14:52:56 +02:00
|
|
|
goto fail_lock;
|
2017-07-13 09:39:20 +02:00
|
|
|
}
|
2017-05-25 14:52:56 +02:00
|
|
|
|
|
|
|
if (d_really_is_positive(dentry)) {
|
|
|
|
error = -EEXIST;
|
|
|
|
goto fail_dentry;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = __aafs_setup_d_inode(dir, dentry, mode, data, link, fops, iops);
|
|
|
|
if (error)
|
|
|
|
goto fail_dentry;
|
|
|
|
inode_unlock(dir);
|
|
|
|
|
|
|
|
return dentry;
|
|
|
|
|
|
|
|
fail_dentry:
|
|
|
|
dput(dentry);
|
|
|
|
|
|
|
|
fail_lock:
|
|
|
|
inode_unlock(dir);
|
|
|
|
simple_release_fs(&aafs_mnt, &aafs_count);
|
|
|
|
|
|
|
|
return ERR_PTR(error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aafs_create_file - create a file in the apparmorfs filesystem
|
|
|
|
*
|
|
|
|
* @name: name of dentry to create
|
|
|
|
* @mode: permissions the file should have
|
|
|
|
* @parent: parent directory for this dentry
|
|
|
|
* @data: data to store on inode.i_private, available in open()
|
|
|
|
* @fops: struct file_operations that should be used for
|
|
|
|
*
|
|
|
|
* see aafs_create
|
|
|
|
*/
|
|
|
|
static struct dentry *aafs_create_file(const char *name, umode_t mode,
|
|
|
|
struct dentry *parent, void *data,
|
|
|
|
const struct file_operations *fops)
|
|
|
|
{
|
|
|
|
return aafs_create(name, mode, parent, data, NULL, fops, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aafs_create_dir - create a directory in the apparmorfs filesystem
|
|
|
|
*
|
|
|
|
* @name: name of dentry to create
|
|
|
|
* @parent: parent directory for this dentry
|
|
|
|
*
|
|
|
|
* see aafs_create
|
|
|
|
*/
|
|
|
|
static struct dentry *aafs_create_dir(const char *name, struct dentry *parent)
|
|
|
|
{
|
|
|
|
return aafs_create(name, S_IFDIR | 0755, parent, NULL, NULL, NULL,
|
|
|
|
NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aafs_create_symlink - create a symlink in the apparmorfs filesystem
|
|
|
|
* @name: name of dentry to create
|
|
|
|
* @parent: parent directory for this dentry
|
|
|
|
* @target: if symlink, symlink target string
|
|
|
|
* @iops: struct of inode_operations that should be used
|
|
|
|
*
|
|
|
|
* If @target parameter is %NULL, then the @iops parameter needs to be
|
|
|
|
* setup to handle .readlink and .get_link inode_operations.
|
|
|
|
*/
|
|
|
|
static struct dentry *aafs_create_symlink(const char *name,
|
|
|
|
struct dentry *parent,
|
|
|
|
const char *target,
|
|
|
|
const struct inode_operations *iops)
|
|
|
|
{
|
|
|
|
struct dentry *dent;
|
|
|
|
char *link = NULL;
|
|
|
|
|
|
|
|
if (target) {
|
|
|
|
link = kstrdup(target, GFP_KERNEL);
|
|
|
|
if (!link)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
}
|
|
|
|
dent = aafs_create(name, S_IFLNK | 0444, parent, NULL, link, NULL,
|
|
|
|
iops);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
kfree(link);
|
|
|
|
|
|
|
|
return dent;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aafs_remove - removes a file or directory from the apparmorfs filesystem
|
|
|
|
*
|
|
|
|
* @dentry: dentry of the file/directory/symlink to removed.
|
|
|
|
*/
|
|
|
|
static void aafs_remove(struct dentry *dentry)
|
|
|
|
{
|
|
|
|
struct inode *dir;
|
|
|
|
|
|
|
|
if (!dentry || IS_ERR(dentry))
|
|
|
|
return;
|
|
|
|
|
|
|
|
dir = d_inode(dentry->d_parent);
|
|
|
|
inode_lock(dir);
|
|
|
|
if (simple_positive(dentry)) {
|
|
|
|
if (d_is_dir(dentry))
|
|
|
|
simple_rmdir(dir, dentry);
|
|
|
|
else
|
|
|
|
simple_unlink(dir, dentry);
|
|
|
|
dput(dentry);
|
|
|
|
}
|
|
|
|
inode_unlock(dir);
|
|
|
|
simple_release_fs(&aafs_mnt, &aafs_count);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* aa_fs - policy load/replace/remove
|
|
|
|
*/
|
|
|
|
|
2010-07-29 23:48:03 +02:00
|
|
|
/**
|
|
|
|
* aa_simple_write_to_buffer - common routine for getting policy from user
|
|
|
|
* @userbuf: user buffer to copy data from (NOT NULL)
|
2010-10-09 09:47:53 +02:00
|
|
|
* @alloc_size: size of user buffer (REQUIRES: @alloc_size >= @copy_size)
|
2010-07-29 23:48:03 +02:00
|
|
|
* @copy_size: size of data to copy from user buffer
|
|
|
|
* @pos: position write is at in the file (NOT NULL)
|
|
|
|
*
|
|
|
|
* Returns: kernel buffer containing copy of user buffer data or an
|
|
|
|
* ERR_PTR on failure.
|
|
|
|
*/
|
2017-01-16 09:43:03 +01:00
|
|
|
static struct aa_loaddata *aa_simple_write_to_buffer(const char __user *userbuf,
|
2017-01-16 09:42:55 +01:00
|
|
|
size_t alloc_size,
|
|
|
|
size_t copy_size,
|
|
|
|
loff_t *pos)
|
2010-07-29 23:48:03 +02:00
|
|
|
{
|
2017-01-16 09:42:55 +01:00
|
|
|
struct aa_loaddata *data;
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2017-01-16 09:43:15 +01:00
|
|
|
AA_BUG(copy_size > alloc_size);
|
2010-10-09 09:47:53 +02:00
|
|
|
|
2010-07-29 23:48:03 +02:00
|
|
|
if (*pos != 0)
|
|
|
|
/* only writes from pos 0, that is complete writes */
|
|
|
|
return ERR_PTR(-ESPIPE);
|
|
|
|
|
|
|
|
/* freed by caller to simple_write_to_buffer */
|
2017-05-09 09:08:41 +02:00
|
|
|
data = aa_loaddata_alloc(alloc_size);
|
|
|
|
if (IS_ERR(data))
|
|
|
|
return data;
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
data->size = copy_size;
|
2017-01-16 09:42:55 +01:00
|
|
|
if (copy_from_user(data->data, userbuf, copy_size)) {
|
2010-07-29 23:48:03 +02:00
|
|
|
kvfree(data);
|
|
|
|
return ERR_PTR(-EFAULT);
|
|
|
|
}
|
|
|
|
|
|
|
|
return data;
|
|
|
|
}
|
|
|
|
|
2017-05-26 10:45:08 +02:00
|
|
|
static ssize_t policy_update(u32 mask, const char __user *buf, size_t size,
|
2017-01-16 09:42:58 +01:00
|
|
|
loff_t *pos, struct aa_ns *ns)
|
2010-07-29 23:48:03 +02:00
|
|
|
{
|
2017-01-16 09:42:55 +01:00
|
|
|
struct aa_loaddata *data;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label;
|
|
|
|
ssize_t error;
|
2017-06-09 11:08:28 +02:00
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
label = begin_current_label_crit_section();
|
2017-06-09 11:08:28 +02:00
|
|
|
|
2017-01-16 09:42:55 +01:00
|
|
|
/* high level check about policy management - fine grained in
|
|
|
|
* below after unpack
|
|
|
|
*/
|
2017-06-09 17:14:28 +02:00
|
|
|
error = aa_may_manage_policy(label, ns, mask);
|
2017-01-16 09:42:55 +01:00
|
|
|
if (error)
|
|
|
|
return error;
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2017-01-16 09:43:03 +01:00
|
|
|
data = aa_simple_write_to_buffer(buf, size, size, pos);
|
2010-07-29 23:48:03 +02:00
|
|
|
error = PTR_ERR(data);
|
|
|
|
if (!IS_ERR(data)) {
|
2017-06-09 17:14:28 +02:00
|
|
|
error = aa_replace_profiles(ns, label, mask, data);
|
2017-01-16 09:42:55 +01:00
|
|
|
aa_put_loaddata(data);
|
2010-07-29 23:48:03 +02:00
|
|
|
}
|
2017-06-09 17:14:28 +02:00
|
|
|
end_current_label_crit_section(label);
|
2010-07-29 23:48:03 +02:00
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
/* .load file hook fn to load policy */
|
2017-01-16 09:42:55 +01:00
|
|
|
static ssize_t profile_load(struct file *f, const char __user *buf, size_t size,
|
|
|
|
loff_t *pos)
|
|
|
|
{
|
2017-01-16 09:42:58 +01:00
|
|
|
struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
|
2017-05-26 10:45:08 +02:00
|
|
|
int error = policy_update(AA_MAY_LOAD_POLICY, buf, size, pos, ns);
|
2017-01-16 09:42:58 +01:00
|
|
|
|
|
|
|
aa_put_ns(ns);
|
2017-01-16 09:42:55 +01:00
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2010-07-29 23:48:03 +02:00
|
|
|
static const struct file_operations aa_fs_profile_load = {
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 18:52:59 +02:00
|
|
|
.write = profile_load,
|
|
|
|
.llseek = default_llseek,
|
2010-07-29 23:48:03 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* .replace file hook fn to load and/or replace policy */
|
|
|
|
static ssize_t profile_replace(struct file *f, const char __user *buf,
|
|
|
|
size_t size, loff_t *pos)
|
|
|
|
{
|
2017-01-16 09:42:58 +01:00
|
|
|
struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
|
2017-05-26 10:45:08 +02:00
|
|
|
int error = policy_update(AA_MAY_LOAD_POLICY | AA_MAY_REPLACE_POLICY,
|
|
|
|
buf, size, pos, ns);
|
2017-01-16 09:42:58 +01:00
|
|
|
aa_put_ns(ns);
|
2010-07-29 23:48:03 +02:00
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations aa_fs_profile_replace = {
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 18:52:59 +02:00
|
|
|
.write = profile_replace,
|
|
|
|
.llseek = default_llseek,
|
2010-07-29 23:48:03 +02:00
|
|
|
};
|
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
/* .remove file hook fn to remove loaded policy */
|
2010-07-29 23:48:03 +02:00
|
|
|
static ssize_t profile_remove(struct file *f, const char __user *buf,
|
|
|
|
size_t size, loff_t *pos)
|
|
|
|
{
|
2017-01-16 09:42:55 +01:00
|
|
|
struct aa_loaddata *data;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label;
|
2010-07-29 23:48:03 +02:00
|
|
|
ssize_t error;
|
2017-01-16 09:42:58 +01:00
|
|
|
struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
label = begin_current_label_crit_section();
|
2017-01-16 09:42:55 +01:00
|
|
|
/* high level check about policy management - fine grained in
|
|
|
|
* below after unpack
|
|
|
|
*/
|
2017-06-09 17:14:28 +02:00
|
|
|
error = aa_may_manage_policy(label, ns, AA_MAY_REMOVE_POLICY);
|
2017-01-16 09:42:55 +01:00
|
|
|
if (error)
|
|
|
|
goto out;
|
|
|
|
|
2010-07-29 23:48:03 +02:00
|
|
|
/*
|
|
|
|
* aa_remove_profile needs a null terminated string so 1 extra
|
|
|
|
* byte is allocated and the copied data is null terminated.
|
|
|
|
*/
|
2017-01-16 09:43:03 +01:00
|
|
|
data = aa_simple_write_to_buffer(buf, size + 1, size, pos);
|
2010-07-29 23:48:03 +02:00
|
|
|
|
|
|
|
error = PTR_ERR(data);
|
|
|
|
if (!IS_ERR(data)) {
|
2017-01-16 09:42:55 +01:00
|
|
|
data->data[size] = 0;
|
2017-06-09 17:14:28 +02:00
|
|
|
error = aa_remove_profiles(ns, label, data->data, size);
|
2017-01-16 09:42:55 +01:00
|
|
|
aa_put_loaddata(data);
|
2010-07-29 23:48:03 +02:00
|
|
|
}
|
2017-01-16 09:42:55 +01:00
|
|
|
out:
|
2017-06-09 17:14:28 +02:00
|
|
|
end_current_label_crit_section(label);
|
2017-01-16 09:42:58 +01:00
|
|
|
aa_put_ns(ns);
|
2010-07-29 23:48:03 +02:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations aa_fs_profile_remove = {
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 18:52:59 +02:00
|
|
|
.write = profile_remove,
|
|
|
|
.llseek = default_llseek,
|
2010-07-29 23:48:03 +02:00
|
|
|
};
|
|
|
|
|
2017-05-27 01:27:58 +02:00
|
|
|
struct aa_revision {
|
|
|
|
struct aa_ns *ns;
|
|
|
|
long last_read;
|
|
|
|
};
|
|
|
|
|
|
|
|
/* revision file hook fn for policy loads */
|
|
|
|
static int ns_revision_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct aa_revision *rev = file->private_data;
|
|
|
|
|
|
|
|
if (rev) {
|
|
|
|
aa_put_ns(rev->ns);
|
|
|
|
kfree(rev);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t ns_revision_read(struct file *file, char __user *buf,
|
|
|
|
size_t size, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct aa_revision *rev = file->private_data;
|
|
|
|
char buffer[32];
|
|
|
|
long last_read;
|
|
|
|
int avail;
|
|
|
|
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&rev->ns->lock, rev->ns->level);
|
2017-05-27 01:27:58 +02:00
|
|
|
last_read = rev->last_read;
|
|
|
|
if (last_read == rev->ns->revision) {
|
|
|
|
mutex_unlock(&rev->ns->lock);
|
|
|
|
if (file->f_flags & O_NONBLOCK)
|
|
|
|
return -EAGAIN;
|
|
|
|
if (wait_event_interruptible(rev->ns->wait,
|
|
|
|
last_read !=
|
|
|
|
READ_ONCE(rev->ns->revision)))
|
|
|
|
return -ERESTARTSYS;
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&rev->ns->lock, rev->ns->level);
|
2017-05-27 01:27:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
avail = sprintf(buffer, "%ld\n", rev->ns->revision);
|
|
|
|
if (*ppos + size > avail) {
|
|
|
|
rev->last_read = rev->ns->revision;
|
|
|
|
*ppos = 0;
|
|
|
|
}
|
|
|
|
mutex_unlock(&rev->ns->lock);
|
|
|
|
|
|
|
|
return simple_read_from_buffer(buf, size, ppos, buffer, avail);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ns_revision_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct aa_revision *rev = kzalloc(sizeof(*rev), GFP_KERNEL);
|
|
|
|
|
|
|
|
if (!rev)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
rev->ns = aa_get_ns(inode->i_private);
|
|
|
|
if (!rev->ns)
|
|
|
|
rev->ns = aa_get_current_ns();
|
|
|
|
file->private_data = rev;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int ns_revision_poll(struct file *file, poll_table *pt)
|
|
|
|
{
|
|
|
|
struct aa_revision *rev = file->private_data;
|
|
|
|
unsigned int mask = 0;
|
|
|
|
|
|
|
|
if (rev) {
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&rev->ns->lock, rev->ns->level);
|
2017-05-27 01:27:58 +02:00
|
|
|
poll_wait(file, &rev->ns->wait, pt);
|
|
|
|
if (rev->last_read < rev->ns->revision)
|
|
|
|
mask |= POLLIN | POLLRDNORM;
|
|
|
|
mutex_unlock(&rev->ns->lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
return mask;
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
void __aa_bump_ns_revision(struct aa_ns *ns)
|
|
|
|
{
|
|
|
|
ns->revision++;
|
2017-05-27 01:27:58 +02:00
|
|
|
wake_up_interruptible(&ns->wait);
|
2017-05-09 09:08:41 +02:00
|
|
|
}
|
|
|
|
|
2017-05-27 01:27:58 +02:00
|
|
|
static const struct file_operations aa_fs_ns_revision_fops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = ns_revision_open,
|
|
|
|
.poll = ns_revision_poll,
|
|
|
|
.read = ns_revision_read,
|
|
|
|
.llseek = generic_file_llseek,
|
|
|
|
.release = ns_revision_release,
|
|
|
|
};
|
|
|
|
|
2017-05-27 03:35:29 +02:00
|
|
|
static void profile_query_cb(struct aa_profile *profile, struct aa_perms *perms,
|
|
|
|
const char *match_str, size_t match_len)
|
|
|
|
{
|
|
|
|
struct aa_perms tmp;
|
|
|
|
struct aa_dfa *dfa;
|
|
|
|
unsigned int state = 0;
|
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
if (profile_unconfined(profile))
|
2017-05-27 03:35:29 +02:00
|
|
|
return;
|
|
|
|
if (profile->file.dfa && *match_str == AA_CLASS_FILE) {
|
|
|
|
dfa = profile->file.dfa;
|
|
|
|
state = aa_dfa_match_len(dfa, profile->file.start,
|
|
|
|
match_str + 1, match_len - 1);
|
|
|
|
tmp = nullperms;
|
|
|
|
if (state) {
|
|
|
|
struct path_cond cond = { };
|
|
|
|
|
|
|
|
tmp = aa_compute_fperms(dfa, state, &cond);
|
|
|
|
}
|
|
|
|
} else if (profile->policy.dfa) {
|
2018-03-03 10:59:02 +01:00
|
|
|
if (!PROFILE_MEDIATES(profile, *match_str))
|
2017-05-27 03:35:29 +02:00
|
|
|
return; /* no change to current perms */
|
|
|
|
dfa = profile->policy.dfa;
|
|
|
|
state = aa_dfa_match_len(dfa, profile->policy.start[0],
|
|
|
|
match_str, match_len);
|
|
|
|
if (state)
|
|
|
|
aa_compute_perms(dfa, state, &tmp);
|
|
|
|
else
|
|
|
|
tmp = nullperms;
|
|
|
|
}
|
|
|
|
aa_apply_modes_to_perms(profile, &tmp);
|
2017-06-09 22:55:38 +02:00
|
|
|
aa_perms_accum_raw(perms, &tmp);
|
2017-05-27 03:35:29 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-01-16 01:49:28 +01:00
|
|
|
/**
|
|
|
|
* query_data - queries a policy and writes its data to buf
|
|
|
|
* @buf: the resulting data is stored here (NOT NULL)
|
|
|
|
* @buf_len: size of buf
|
|
|
|
* @query: query string used to retrieve data
|
|
|
|
* @query_len: size of query including second NUL byte
|
|
|
|
*
|
|
|
|
* The buffers pointed to by buf and query may overlap. The query buffer is
|
|
|
|
* parsed before buf is written to.
|
|
|
|
*
|
|
|
|
* The query should look like "<LABEL>\0<KEY>\0", where <LABEL> is the name of
|
|
|
|
* the security confinement context and <KEY> is the name of the data to
|
|
|
|
* retrieve. <LABEL> and <KEY> must not be NUL-terminated.
|
|
|
|
*
|
|
|
|
* Don't expect the contents of buf to be preserved on failure.
|
|
|
|
*
|
|
|
|
* Returns: number of characters written to buf or -errno on failure
|
|
|
|
*/
|
|
|
|
static ssize_t query_data(char *buf, size_t buf_len,
|
|
|
|
char *query, size_t query_len)
|
|
|
|
{
|
|
|
|
char *out;
|
|
|
|
const char *key;
|
2017-06-09 22:55:38 +02:00
|
|
|
struct label_it i;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label, *curr;
|
2017-06-09 22:55:38 +02:00
|
|
|
struct aa_profile *profile;
|
2017-01-16 01:49:28 +01:00
|
|
|
struct aa_data *data;
|
|
|
|
u32 bytes, blocks;
|
|
|
|
__le32 outle32;
|
|
|
|
|
|
|
|
if (!query_len)
|
|
|
|
return -EINVAL; /* need a query */
|
|
|
|
|
|
|
|
key = query + strnlen(query, query_len) + 1;
|
|
|
|
if (key + 1 >= query + query_len)
|
|
|
|
return -EINVAL; /* not enough space for a non-empty key */
|
|
|
|
if (key + strnlen(key, query + query_len - key) >= query + query_len)
|
|
|
|
return -EINVAL; /* must end with NUL */
|
|
|
|
|
|
|
|
if (buf_len < sizeof(bytes) + sizeof(blocks))
|
|
|
|
return -EINVAL; /* not enough space */
|
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
curr = begin_current_label_crit_section();
|
|
|
|
label = aa_label_parse(curr, query, GFP_KERNEL, false, false);
|
|
|
|
end_current_label_crit_section(curr);
|
|
|
|
if (IS_ERR(label))
|
|
|
|
return PTR_ERR(label);
|
2017-01-16 01:49:28 +01:00
|
|
|
|
|
|
|
/* We are going to leave space for two numbers. The first is the total
|
|
|
|
* number of bytes we are writing after the first number. This is so
|
|
|
|
* users can read the full output without reallocation.
|
|
|
|
*
|
|
|
|
* The second number is the number of data blocks we're writing. An
|
|
|
|
* application might be confined by multiple policies having data in
|
|
|
|
* the same key.
|
|
|
|
*/
|
|
|
|
memset(buf, 0, sizeof(bytes) + sizeof(blocks));
|
|
|
|
out = buf + sizeof(bytes) + sizeof(blocks);
|
|
|
|
|
|
|
|
blocks = 0;
|
2017-06-09 22:55:38 +02:00
|
|
|
label_for_each_confined(i, label, profile) {
|
|
|
|
if (!profile->data)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
data = rhashtable_lookup_fast(profile->data, &key,
|
|
|
|
profile->data->p);
|
2017-01-16 01:49:28 +01:00
|
|
|
|
|
|
|
if (data) {
|
2017-06-09 22:55:38 +02:00
|
|
|
if (out + sizeof(outle32) + data->size > buf +
|
|
|
|
buf_len) {
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_put_label(label);
|
2017-01-16 01:49:28 +01:00
|
|
|
return -EINVAL; /* not enough space */
|
2017-06-09 17:14:28 +02:00
|
|
|
}
|
2017-01-16 01:49:28 +01:00
|
|
|
outle32 = __cpu_to_le32(data->size);
|
|
|
|
memcpy(out, &outle32, sizeof(outle32));
|
|
|
|
out += sizeof(outle32);
|
|
|
|
memcpy(out, data->data, data->size);
|
|
|
|
out += data->size;
|
|
|
|
blocks++;
|
|
|
|
}
|
|
|
|
}
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_put_label(label);
|
2017-01-16 01:49:28 +01:00
|
|
|
|
|
|
|
outle32 = __cpu_to_le32(out - buf - sizeof(bytes));
|
|
|
|
memcpy(buf, &outle32, sizeof(outle32));
|
|
|
|
outle32 = __cpu_to_le32(blocks);
|
|
|
|
memcpy(buf + sizeof(bytes), &outle32, sizeof(outle32));
|
|
|
|
|
|
|
|
return out - buf;
|
|
|
|
}
|
|
|
|
|
2017-05-27 03:35:29 +02:00
|
|
|
/**
|
|
|
|
* query_label - queries a label and writes permissions to buf
|
|
|
|
* @buf: the resulting permissions string is stored here (NOT NULL)
|
|
|
|
* @buf_len: size of buf
|
|
|
|
* @query: binary query string to match against the dfa
|
|
|
|
* @query_len: size of query
|
|
|
|
* @view_only: only compute for querier's view
|
|
|
|
*
|
|
|
|
* The buffers pointed to by buf and query may overlap. The query buffer is
|
|
|
|
* parsed before buf is written to.
|
|
|
|
*
|
|
|
|
* The query should look like "LABEL_NAME\0DFA_STRING" where LABEL_NAME is
|
|
|
|
* the name of the label, in the current namespace, that is to be queried and
|
|
|
|
* DFA_STRING is a binary string to match against the label(s)'s DFA.
|
|
|
|
*
|
|
|
|
* LABEL_NAME must be NUL terminated. DFA_STRING may contain NUL characters
|
|
|
|
* but must *not* be NUL terminated.
|
|
|
|
*
|
|
|
|
* Returns: number of characters written to buf or -errno on failure
|
|
|
|
*/
|
|
|
|
static ssize_t query_label(char *buf, size_t buf_len,
|
|
|
|
char *query, size_t query_len, bool view_only)
|
|
|
|
{
|
2017-06-09 22:55:38 +02:00
|
|
|
struct aa_profile *profile;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label, *curr;
|
2017-05-27 03:35:29 +02:00
|
|
|
char *label_name, *match_str;
|
|
|
|
size_t label_name_len, match_len;
|
|
|
|
struct aa_perms perms;
|
2017-06-09 22:55:38 +02:00
|
|
|
struct label_it i;
|
2017-05-27 03:35:29 +02:00
|
|
|
|
|
|
|
if (!query_len)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
label_name = query;
|
|
|
|
label_name_len = strnlen(query, query_len);
|
|
|
|
if (!label_name_len || label_name_len == query_len)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* The extra byte is to account for the null byte between the
|
|
|
|
* profile name and dfa string. profile_name_len is greater
|
|
|
|
* than zero and less than query_len, so a byte can be safely
|
|
|
|
* added or subtracted.
|
|
|
|
*/
|
|
|
|
match_str = label_name + label_name_len + 1;
|
|
|
|
match_len = query_len - label_name_len - 1;
|
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
curr = begin_current_label_crit_section();
|
|
|
|
label = aa_label_parse(curr, label_name, GFP_KERNEL, false, false);
|
|
|
|
end_current_label_crit_section(curr);
|
|
|
|
if (IS_ERR(label))
|
|
|
|
return PTR_ERR(label);
|
2017-05-27 03:35:29 +02:00
|
|
|
|
|
|
|
perms = allperms;
|
2017-06-09 22:55:38 +02:00
|
|
|
if (view_only) {
|
|
|
|
label_for_each_in_ns(i, labels_ns(label), label, profile) {
|
|
|
|
profile_query_cb(profile, &perms, match_str, match_len);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
label_for_each(i, label, profile) {
|
|
|
|
profile_query_cb(profile, &perms, match_str, match_len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
aa_put_label(label);
|
2017-05-27 03:35:29 +02:00
|
|
|
|
|
|
|
return scnprintf(buf, buf_len,
|
|
|
|
"allow 0x%08x\ndeny 0x%08x\naudit 0x%08x\nquiet 0x%08x\n",
|
|
|
|
perms.allow, perms.deny, perms.audit, perms.quiet);
|
|
|
|
}
|
|
|
|
|
2017-05-27 02:23:23 +02:00
|
|
|
/*
|
|
|
|
* Transaction based IO.
|
|
|
|
* The file expects a write which triggers the transaction, and then
|
|
|
|
* possibly a read(s) which collects the result - which is stored in a
|
|
|
|
* file-local buffer. Once a new write is performed, a new set of results
|
|
|
|
* are stored in the file-local buffer.
|
|
|
|
*/
|
|
|
|
struct multi_transaction {
|
|
|
|
struct kref count;
|
|
|
|
ssize_t size;
|
|
|
|
char data[0];
|
|
|
|
};
|
|
|
|
|
|
|
|
#define MULTI_TRANSACTION_LIMIT (PAGE_SIZE - sizeof(struct multi_transaction))
|
|
|
|
/* TODO: replace with per file lock */
|
|
|
|
static DEFINE_SPINLOCK(multi_transaction_lock);
|
|
|
|
|
|
|
|
static void multi_transaction_kref(struct kref *kref)
|
|
|
|
{
|
|
|
|
struct multi_transaction *t;
|
|
|
|
|
|
|
|
t = container_of(kref, struct multi_transaction, count);
|
|
|
|
free_page((unsigned long) t);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct multi_transaction *
|
|
|
|
get_multi_transaction(struct multi_transaction *t)
|
|
|
|
{
|
|
|
|
if (t)
|
|
|
|
kref_get(&(t->count));
|
|
|
|
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void put_multi_transaction(struct multi_transaction *t)
|
|
|
|
{
|
|
|
|
if (t)
|
|
|
|
kref_put(&(t->count), multi_transaction_kref);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* does not increment @new's count */
|
|
|
|
static void multi_transaction_set(struct file *file,
|
|
|
|
struct multi_transaction *new, size_t n)
|
|
|
|
{
|
|
|
|
struct multi_transaction *old;
|
|
|
|
|
|
|
|
AA_BUG(n > MULTI_TRANSACTION_LIMIT);
|
|
|
|
|
|
|
|
new->size = n;
|
|
|
|
spin_lock(&multi_transaction_lock);
|
|
|
|
old = (struct multi_transaction *) file->private_data;
|
|
|
|
file->private_data = new;
|
|
|
|
spin_unlock(&multi_transaction_lock);
|
|
|
|
put_multi_transaction(old);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct multi_transaction *multi_transaction_new(struct file *file,
|
|
|
|
const char __user *buf,
|
|
|
|
size_t size)
|
|
|
|
{
|
|
|
|
struct multi_transaction *t;
|
|
|
|
|
|
|
|
if (size > MULTI_TRANSACTION_LIMIT - 1)
|
|
|
|
return ERR_PTR(-EFBIG);
|
|
|
|
|
|
|
|
t = (struct multi_transaction *)get_zeroed_page(GFP_KERNEL);
|
|
|
|
if (!t)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
kref_init(&t->count);
|
|
|
|
if (copy_from_user(t->data, buf, size))
|
|
|
|
return ERR_PTR(-EFAULT);
|
|
|
|
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t multi_transaction_read(struct file *file, char __user *buf,
|
|
|
|
size_t size, loff_t *pos)
|
|
|
|
{
|
|
|
|
struct multi_transaction *t;
|
|
|
|
ssize_t ret;
|
|
|
|
|
|
|
|
spin_lock(&multi_transaction_lock);
|
|
|
|
t = get_multi_transaction(file->private_data);
|
|
|
|
spin_unlock(&multi_transaction_lock);
|
|
|
|
if (!t)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
ret = simple_read_from_buffer(buf, size, pos, t->data, t->size);
|
|
|
|
put_multi_transaction(t);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int multi_transaction_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
put_multi_transaction(file->private_data);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-06-09 22:55:38 +02:00
|
|
|
#define QUERY_CMD_LABEL "label\0"
|
|
|
|
#define QUERY_CMD_LABEL_LEN 6
|
2017-05-27 03:35:29 +02:00
|
|
|
#define QUERY_CMD_PROFILE "profile\0"
|
|
|
|
#define QUERY_CMD_PROFILE_LEN 8
|
2017-06-09 22:55:38 +02:00
|
|
|
#define QUERY_CMD_LABELALL "labelall\0"
|
|
|
|
#define QUERY_CMD_LABELALL_LEN 9
|
2017-01-16 01:49:28 +01:00
|
|
|
#define QUERY_CMD_DATA "data\0"
|
|
|
|
#define QUERY_CMD_DATA_LEN 5
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aa_write_access - generic permissions and data query
|
|
|
|
* @file: pointer to open apparmorfs/access file
|
|
|
|
* @ubuf: user buffer containing the complete query string (NOT NULL)
|
|
|
|
* @count: size of ubuf
|
|
|
|
* @ppos: position in the file (MUST BE ZERO)
|
|
|
|
*
|
|
|
|
* Allows for one permissions or data query per open(), write(), and read()
|
|
|
|
* sequence. The only queries currently supported are label-based queries for
|
|
|
|
* permissions or data.
|
|
|
|
*
|
|
|
|
* For permissions queries, ubuf must begin with "label\0", followed by the
|
|
|
|
* profile query specific format described in the query_label() function
|
|
|
|
* documentation.
|
|
|
|
*
|
|
|
|
* For data queries, ubuf must have the form "data\0<LABEL>\0<KEY>\0", where
|
|
|
|
* <LABEL> is the name of the security confinement context and <KEY> is the
|
|
|
|
* name of the data to retrieve.
|
|
|
|
*
|
|
|
|
* Returns: number of bytes written or -errno on failure
|
|
|
|
*/
|
|
|
|
static ssize_t aa_write_access(struct file *file, const char __user *ubuf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2017-05-27 02:23:23 +02:00
|
|
|
struct multi_transaction *t;
|
2017-01-16 01:49:28 +01:00
|
|
|
ssize_t len;
|
|
|
|
|
|
|
|
if (*ppos)
|
|
|
|
return -ESPIPE;
|
|
|
|
|
2017-05-27 02:23:23 +02:00
|
|
|
t = multi_transaction_new(file, ubuf, count);
|
|
|
|
if (IS_ERR(t))
|
|
|
|
return PTR_ERR(t);
|
2017-01-16 01:49:28 +01:00
|
|
|
|
2017-05-27 03:35:29 +02:00
|
|
|
if (count > QUERY_CMD_PROFILE_LEN &&
|
|
|
|
!memcmp(t->data, QUERY_CMD_PROFILE, QUERY_CMD_PROFILE_LEN)) {
|
|
|
|
len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
|
|
|
|
t->data + QUERY_CMD_PROFILE_LEN,
|
|
|
|
count - QUERY_CMD_PROFILE_LEN, true);
|
2017-06-09 22:55:38 +02:00
|
|
|
} else if (count > QUERY_CMD_LABEL_LEN &&
|
|
|
|
!memcmp(t->data, QUERY_CMD_LABEL, QUERY_CMD_LABEL_LEN)) {
|
|
|
|
len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
|
|
|
|
t->data + QUERY_CMD_LABEL_LEN,
|
|
|
|
count - QUERY_CMD_LABEL_LEN, true);
|
|
|
|
} else if (count > QUERY_CMD_LABELALL_LEN &&
|
|
|
|
!memcmp(t->data, QUERY_CMD_LABELALL,
|
|
|
|
QUERY_CMD_LABELALL_LEN)) {
|
|
|
|
len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
|
|
|
|
t->data + QUERY_CMD_LABELALL_LEN,
|
|
|
|
count - QUERY_CMD_LABELALL_LEN, false);
|
2017-05-27 03:35:29 +02:00
|
|
|
} else if (count > QUERY_CMD_DATA_LEN &&
|
2017-05-27 02:23:23 +02:00
|
|
|
!memcmp(t->data, QUERY_CMD_DATA, QUERY_CMD_DATA_LEN)) {
|
|
|
|
len = query_data(t->data, MULTI_TRANSACTION_LIMIT,
|
|
|
|
t->data + QUERY_CMD_DATA_LEN,
|
2017-01-16 01:49:28 +01:00
|
|
|
count - QUERY_CMD_DATA_LEN);
|
|
|
|
} else
|
|
|
|
len = -EINVAL;
|
|
|
|
|
2017-05-27 02:23:23 +02:00
|
|
|
if (len < 0) {
|
|
|
|
put_multi_transaction(t);
|
2017-01-16 01:49:28 +01:00
|
|
|
return len;
|
2017-05-27 02:23:23 +02:00
|
|
|
}
|
2017-01-16 01:49:28 +01:00
|
|
|
|
2017-05-27 02:23:23 +02:00
|
|
|
multi_transaction_set(file, t, len);
|
2017-01-16 01:49:28 +01:00
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static const struct file_operations aa_sfs_access = {
|
2017-01-16 01:49:28 +01:00
|
|
|
.write = aa_write_access,
|
2017-05-27 02:23:23 +02:00
|
|
|
.read = multi_transaction_read,
|
|
|
|
.release = multi_transaction_release,
|
2017-01-16 01:49:28 +01:00
|
|
|
.llseek = generic_file_llseek,
|
|
|
|
};
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static int aa_sfs_seq_show(struct seq_file *seq, void *v)
|
2012-01-27 01:29:21 +01:00
|
|
|
{
|
2017-05-25 15:23:42 +02:00
|
|
|
struct aa_sfs_entry *fs_file = seq->private;
|
2012-01-27 01:29:21 +01:00
|
|
|
|
|
|
|
if (!fs_file)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
switch (fs_file->v_type) {
|
2017-05-25 15:23:42 +02:00
|
|
|
case AA_SFS_TYPE_BOOLEAN:
|
2012-01-27 01:29:21 +01:00
|
|
|
seq_printf(seq, "%s\n", fs_file->v.boolean ? "yes" : "no");
|
|
|
|
break;
|
2017-05-25 15:23:42 +02:00
|
|
|
case AA_SFS_TYPE_STRING:
|
2012-01-27 01:29:22 +01:00
|
|
|
seq_printf(seq, "%s\n", fs_file->v.string);
|
|
|
|
break;
|
2017-05-25 15:23:42 +02:00
|
|
|
case AA_SFS_TYPE_U64:
|
2012-01-27 01:29:21 +01:00
|
|
|
seq_printf(seq, "%#08lx\n", fs_file->v.u64);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/* Ignore unpritable entry types. */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static int aa_sfs_seq_open(struct inode *inode, struct file *file)
|
2012-01-27 01:29:21 +01:00
|
|
|
{
|
2017-05-25 15:23:42 +02:00
|
|
|
return single_open(file, aa_sfs_seq_show, inode->i_private);
|
2012-01-27 01:29:21 +01:00
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
const struct file_operations aa_sfs_seq_file_ops = {
|
2012-01-27 01:29:21 +01:00
|
|
|
.owner = THIS_MODULE,
|
2017-05-25 15:23:42 +02:00
|
|
|
.open = aa_sfs_seq_open,
|
2012-01-27 01:29:21 +01:00
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
/*
|
|
|
|
* profile based file operations
|
|
|
|
* policy/profiles/XXXX/profiles/ *
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define SEQ_PROFILE_FOPS(NAME) \
|
|
|
|
static int seq_profile_ ##NAME ##_open(struct inode *inode, struct file *file)\
|
|
|
|
{ \
|
|
|
|
return seq_profile_open(inode, file, seq_profile_ ##NAME ##_show); \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
static const struct file_operations seq_profile_ ##NAME ##_fops = { \
|
|
|
|
.owner = THIS_MODULE, \
|
|
|
|
.open = seq_profile_ ##NAME ##_open, \
|
|
|
|
.read = seq_read, \
|
|
|
|
.llseek = seq_lseek, \
|
|
|
|
.release = seq_profile_release, \
|
|
|
|
} \
|
|
|
|
|
|
|
|
static int seq_profile_open(struct inode *inode, struct file *file,
|
|
|
|
int (*show)(struct seq_file *, void *))
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
2017-01-16 09:42:19 +01:00
|
|
|
struct aa_proxy *proxy = aa_get_proxy(inode->i_private);
|
|
|
|
int error = single_open(file, show, proxy);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
if (error) {
|
|
|
|
file->private_data = NULL;
|
2017-01-16 09:42:19 +01:00
|
|
|
aa_put_proxy(proxy);
|
2013-07-11 06:13:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
static int seq_profile_release(struct inode *inode, struct file *file)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
|
|
|
struct seq_file *seq = (struct seq_file *) file->private_data;
|
|
|
|
if (seq)
|
2017-01-16 09:42:19 +01:00
|
|
|
aa_put_proxy(seq->private);
|
2013-07-11 06:13:43 +02:00
|
|
|
return single_release(inode, file);
|
|
|
|
}
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
static int seq_profile_name_show(struct seq_file *seq, void *v)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
2017-01-16 09:42:19 +01:00
|
|
|
struct aa_proxy *proxy = seq->private;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label = aa_get_label_rcu(&proxy->label);
|
|
|
|
struct aa_profile *profile = labels_profile(label);
|
2013-07-11 06:13:43 +02:00
|
|
|
seq_printf(seq, "%s\n", profile->base.name);
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_put_label(label);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
static int seq_profile_mode_show(struct seq_file *seq, void *v)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
2017-01-16 09:42:19 +01:00
|
|
|
struct aa_proxy *proxy = seq->private;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label = aa_get_label_rcu(&proxy->label);
|
|
|
|
struct aa_profile *profile = labels_profile(label);
|
2013-07-11 06:13:43 +02:00
|
|
|
seq_printf(seq, "%s\n", aa_profile_mode_names[profile->mode]);
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_put_label(label);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
static int seq_profile_attach_show(struct seq_file *seq, void *v)
|
2013-07-11 06:17:43 +02:00
|
|
|
{
|
2017-01-16 09:42:19 +01:00
|
|
|
struct aa_proxy *proxy = seq->private;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label = aa_get_label_rcu(&proxy->label);
|
|
|
|
struct aa_profile *profile = labels_profile(label);
|
2013-07-11 06:17:43 +02:00
|
|
|
if (profile->attach)
|
|
|
|
seq_printf(seq, "%s\n", profile->attach);
|
|
|
|
else if (profile->xmatch)
|
|
|
|
seq_puts(seq, "<unknown>\n");
|
|
|
|
else
|
|
|
|
seq_printf(seq, "%s\n", profile->base.name);
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_put_label(label);
|
2013-07-11 06:17:43 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
static int seq_profile_hash_show(struct seq_file *seq, void *v)
|
2013-08-14 20:27:36 +02:00
|
|
|
{
|
2017-01-16 09:42:19 +01:00
|
|
|
struct aa_proxy *proxy = seq->private;
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label = aa_get_label_rcu(&proxy->label);
|
|
|
|
struct aa_profile *profile = labels_profile(label);
|
2013-08-14 20:27:36 +02:00
|
|
|
unsigned int i, size = aa_hash_size();
|
|
|
|
|
|
|
|
if (profile->hash) {
|
|
|
|
for (i = 0; i < size; i++)
|
|
|
|
seq_printf(seq, "%.2x", profile->hash[i]);
|
2017-05-07 13:50:28 +02:00
|
|
|
seq_putc(seq, '\n');
|
2013-08-14 20:27:36 +02:00
|
|
|
}
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_put_label(label);
|
2013-08-14 20:27:36 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
SEQ_PROFILE_FOPS(name);
|
|
|
|
SEQ_PROFILE_FOPS(mode);
|
|
|
|
SEQ_PROFILE_FOPS(attach);
|
|
|
|
SEQ_PROFILE_FOPS(hash);
|
2013-08-14 20:27:36 +02:00
|
|
|
|
2017-05-25 16:27:35 +02:00
|
|
|
/*
|
|
|
|
* namespace based files
|
|
|
|
* several root files and
|
|
|
|
* policy/ *
|
|
|
|
*/
|
2013-08-14 20:27:36 +02:00
|
|
|
|
2017-05-25 16:27:35 +02:00
|
|
|
#define SEQ_NS_FOPS(NAME) \
|
|
|
|
static int seq_ns_ ##NAME ##_open(struct inode *inode, struct file *file) \
|
|
|
|
{ \
|
|
|
|
return single_open(file, seq_ns_ ##NAME ##_show, inode->i_private); \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
static const struct file_operations seq_ns_ ##NAME ##_fops = { \
|
|
|
|
.owner = THIS_MODULE, \
|
|
|
|
.open = seq_ns_ ##NAME ##_open, \
|
|
|
|
.read = seq_read, \
|
|
|
|
.llseek = seq_lseek, \
|
|
|
|
.release = single_release, \
|
|
|
|
} \
|
2017-01-16 09:42:48 +01:00
|
|
|
|
2017-06-10 02:11:17 +02:00
|
|
|
static int seq_ns_stacked_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
struct aa_label *label;
|
|
|
|
|
|
|
|
label = begin_current_label_crit_section();
|
|
|
|
seq_printf(seq, "%s\n", label->size > 1 ? "yes" : "no");
|
|
|
|
end_current_label_crit_section(label);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int seq_ns_nsstacked_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
struct aa_label *label;
|
|
|
|
struct aa_profile *profile;
|
|
|
|
struct label_it it;
|
|
|
|
int count = 1;
|
|
|
|
|
|
|
|
label = begin_current_label_crit_section();
|
|
|
|
|
|
|
|
if (label->size > 1) {
|
|
|
|
label_for_each(it, label, profile)
|
|
|
|
if (profile->ns != labels_ns(label)) {
|
|
|
|
count++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
seq_printf(seq, "%s\n", count > 1 ? "yes" : "no");
|
|
|
|
end_current_label_crit_section(label);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 16:27:35 +02:00
|
|
|
static int seq_ns_level_show(struct seq_file *seq, void *v)
|
2017-01-16 09:42:45 +01:00
|
|
|
{
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label;
|
2017-01-16 09:42:45 +01:00
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
label = begin_current_label_crit_section();
|
|
|
|
seq_printf(seq, "%d\n", labels_ns(label)->level);
|
|
|
|
end_current_label_crit_section(label);
|
2017-01-16 09:42:45 +01:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 16:27:35 +02:00
|
|
|
static int seq_ns_name_show(struct seq_file *seq, void *v)
|
2017-01-16 09:42:48 +01:00
|
|
|
{
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label = begin_current_label_crit_section();
|
2018-01-23 10:47:42 +01:00
|
|
|
seq_printf(seq, "%s\n", labels_ns(label)->base.name);
|
2017-06-09 17:14:28 +02:00
|
|
|
end_current_label_crit_section(label);
|
2017-01-16 09:42:48 +01:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-06-10 02:11:17 +02:00
|
|
|
SEQ_NS_FOPS(stacked);
|
|
|
|
SEQ_NS_FOPS(nsstacked);
|
2017-05-25 16:27:35 +02:00
|
|
|
SEQ_NS_FOPS(level);
|
|
|
|
SEQ_NS_FOPS(name);
|
2017-01-16 09:42:48 +01:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
|
|
|
|
/* policy/raw_data/ * file ops */
|
|
|
|
|
|
|
|
#define SEQ_RAWDATA_FOPS(NAME) \
|
|
|
|
static int seq_rawdata_ ##NAME ##_open(struct inode *inode, struct file *file)\
|
|
|
|
{ \
|
|
|
|
return seq_rawdata_open(inode, file, seq_rawdata_ ##NAME ##_show); \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
static const struct file_operations seq_rawdata_ ##NAME ##_fops = { \
|
|
|
|
.owner = THIS_MODULE, \
|
|
|
|
.open = seq_rawdata_ ##NAME ##_open, \
|
|
|
|
.read = seq_read, \
|
|
|
|
.llseek = seq_lseek, \
|
|
|
|
.release = seq_rawdata_release, \
|
|
|
|
} \
|
|
|
|
|
|
|
|
static int seq_rawdata_open(struct inode *inode, struct file *file,
|
|
|
|
int (*show)(struct seq_file *, void *))
|
2017-01-16 09:42:55 +01:00
|
|
|
{
|
2017-05-09 09:08:41 +02:00
|
|
|
struct aa_loaddata *data = __aa_get_loaddata(inode->i_private);
|
|
|
|
int error;
|
2017-01-16 09:42:55 +01:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
if (!data)
|
|
|
|
/* lost race this ent is being reaped */
|
|
|
|
return -ENOENT;
|
|
|
|
|
|
|
|
error = single_open(file, show, data);
|
|
|
|
if (error) {
|
|
|
|
AA_BUG(file->private_data &&
|
|
|
|
((struct seq_file *)file->private_data)->private);
|
|
|
|
aa_put_loaddata(data);
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
2017-01-16 09:42:55 +01:00
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static int seq_rawdata_release(struct inode *inode, struct file *file)
|
2017-01-16 09:42:55 +01:00
|
|
|
{
|
2017-05-09 09:08:41 +02:00
|
|
|
struct seq_file *seq = (struct seq_file *) file->private_data;
|
2017-01-16 09:42:55 +01:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
if (seq)
|
|
|
|
aa_put_loaddata(seq->private);
|
2017-05-07 13:43:50 +02:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
return single_release(inode, file);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int seq_rawdata_abi_show(struct seq_file *seq, void *v)
|
|
|
|
{
|
|
|
|
struct aa_loaddata *data = seq->private;
|
|
|
|
|
|
|
|
seq_printf(seq, "v%d\n", data->abi);
|
2017-01-16 09:42:55 +01:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static int seq_rawdata_revision_show(struct seq_file *seq, void *v)
|
2017-01-16 09:42:55 +01:00
|
|
|
{
|
2017-05-09 09:08:41 +02:00
|
|
|
struct aa_loaddata *data = seq->private;
|
2017-01-16 09:42:55 +01:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
seq_printf(seq, "%ld\n", data->revision);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2017-01-16 09:42:55 +01:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static int seq_rawdata_hash_show(struct seq_file *seq, void *v)
|
2017-01-16 09:42:55 +01:00
|
|
|
{
|
2017-05-09 09:08:41 +02:00
|
|
|
struct aa_loaddata *data = seq->private;
|
2017-01-16 09:42:55 +01:00
|
|
|
unsigned int i, size = aa_hash_size();
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
if (data->hash) {
|
2017-01-16 09:42:55 +01:00
|
|
|
for (i = 0; i < size; i++)
|
2017-05-09 09:08:41 +02:00
|
|
|
seq_printf(seq, "%.2x", data->hash[i]);
|
2017-05-07 13:50:28 +02:00
|
|
|
seq_putc(seq, '\n');
|
2017-01-16 09:42:55 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
SEQ_RAWDATA_FOPS(abi);
|
|
|
|
SEQ_RAWDATA_FOPS(revision);
|
|
|
|
SEQ_RAWDATA_FOPS(hash);
|
2017-01-16 09:42:55 +01:00
|
|
|
|
|
|
|
static ssize_t rawdata_read(struct file *file, char __user *buf, size_t size,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct aa_loaddata *rawdata = file->private_data;
|
|
|
|
|
|
|
|
return simple_read_from_buffer(buf, size, ppos, rawdata->data,
|
|
|
|
rawdata->size);
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static int rawdata_release(struct inode *inode, struct file *file)
|
2017-01-16 09:42:55 +01:00
|
|
|
{
|
2017-05-09 09:08:41 +02:00
|
|
|
aa_put_loaddata(file->private_data);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2017-01-16 09:42:55 +01:00
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static int rawdata_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2017-01-16 09:42:55 +01:00
|
|
|
if (!policy_view_capable(NULL))
|
|
|
|
return -EACCES;
|
2017-05-09 09:08:41 +02:00
|
|
|
file->private_data = __aa_get_loaddata(inode->i_private);
|
|
|
|
if (!file->private_data)
|
|
|
|
/* lost race: this entry is being reaped */
|
|
|
|
return -ENOENT;
|
2017-01-16 09:42:55 +01:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static const struct file_operations rawdata_fops = {
|
2017-01-16 09:42:55 +01:00
|
|
|
.open = rawdata_open,
|
|
|
|
.read = rawdata_read,
|
|
|
|
.llseek = generic_file_llseek,
|
|
|
|
.release = rawdata_release,
|
|
|
|
};
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static void remove_rawdata_dents(struct aa_loaddata *rawdata)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < AAFS_LOADDATA_NDENTS; i++) {
|
|
|
|
if (!IS_ERR_OR_NULL(rawdata->dents[i])) {
|
|
|
|
/* no refcounts on i_private */
|
2017-05-25 15:35:38 +02:00
|
|
|
aafs_remove(rawdata->dents[i]);
|
2017-05-09 09:08:41 +02:00
|
|
|
rawdata->dents[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void __aa_fs_remove_rawdata(struct aa_loaddata *rawdata)
|
|
|
|
{
|
|
|
|
AA_BUG(rawdata->ns && !mutex_is_locked(&rawdata->ns->lock));
|
|
|
|
|
|
|
|
if (rawdata->ns) {
|
|
|
|
remove_rawdata_dents(rawdata);
|
|
|
|
list_del_init(&rawdata->list);
|
|
|
|
aa_put_ns(rawdata->ns);
|
|
|
|
rawdata->ns = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int __aa_fs_create_rawdata(struct aa_ns *ns, struct aa_loaddata *rawdata)
|
|
|
|
{
|
|
|
|
struct dentry *dent, *dir;
|
|
|
|
|
|
|
|
AA_BUG(!ns);
|
|
|
|
AA_BUG(!rawdata);
|
|
|
|
AA_BUG(!mutex_is_locked(&ns->lock));
|
|
|
|
AA_BUG(!ns_subdata_dir(ns));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* just use ns revision dir was originally created at. This is
|
|
|
|
* under ns->lock and if load is successful revision will be
|
|
|
|
* bumped and is guaranteed to be unique
|
|
|
|
*/
|
|
|
|
rawdata->name = kasprintf(GFP_KERNEL, "%ld", ns->revision);
|
|
|
|
if (!rawdata->name)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dir = aafs_create_dir(rawdata->name, ns_subdata_dir(ns));
|
2017-05-09 09:08:41 +02:00
|
|
|
if (IS_ERR(dir))
|
|
|
|
/* ->name freed when rawdata freed */
|
|
|
|
return PTR_ERR(dir);
|
|
|
|
rawdata->dents[AAFS_LOADDATA_DIR] = dir;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file("abi", S_IFREG | 0444, dir, rawdata,
|
2017-05-09 09:08:41 +02:00
|
|
|
&seq_rawdata_abi_fops);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
rawdata->dents[AAFS_LOADDATA_ABI] = dent;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file("revision", S_IFREG | 0444, dir, rawdata,
|
2017-05-09 09:08:41 +02:00
|
|
|
&seq_rawdata_revision_fops);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
rawdata->dents[AAFS_LOADDATA_REVISION] = dent;
|
|
|
|
|
|
|
|
if (aa_g_hash_policy) {
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file("sha1", S_IFREG | 0444, dir,
|
2017-05-09 09:08:41 +02:00
|
|
|
rawdata, &seq_rawdata_hash_fops);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
rawdata->dents[AAFS_LOADDATA_HASH] = dent;
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file("raw_data", S_IFREG | 0444,
|
2017-05-09 09:08:41 +02:00
|
|
|
dir, rawdata, &rawdata_fops);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
rawdata->dents[AAFS_LOADDATA_DATA] = dent;
|
|
|
|
d_inode(dent)->i_size = rawdata->size;
|
|
|
|
|
|
|
|
rawdata->ns = aa_get_ns(ns);
|
|
|
|
list_add(&rawdata->list, &ns->rawdata_list);
|
|
|
|
/* no refcount on inode rawdata */
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
remove_rawdata_dents(rawdata);
|
|
|
|
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
}
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
/** fns to setup dynamic per profile/namespace files **/
|
2017-05-25 15:23:42 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* Requires: @profile->ns->lock held
|
|
|
|
*/
|
|
|
|
void __aafs_profile_rmdir(struct aa_profile *profile)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
|
|
|
struct aa_profile *child;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (!profile)
|
|
|
|
return;
|
|
|
|
|
|
|
|
list_for_each_entry(child, &profile->base.profiles, base.list)
|
2017-05-25 15:23:42 +02:00
|
|
|
__aafs_profile_rmdir(child);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
for (i = AAFS_PROF_SIZEOF - 1; i >= 0; --i) {
|
2017-01-16 09:42:19 +01:00
|
|
|
struct aa_proxy *proxy;
|
2013-07-11 06:13:43 +02:00
|
|
|
if (!profile->dents[i])
|
|
|
|
continue;
|
|
|
|
|
2017-01-16 09:42:19 +01:00
|
|
|
proxy = d_inode(profile->dents[i])->i_private;
|
2017-05-25 15:35:38 +02:00
|
|
|
aafs_remove(profile->dents[i]);
|
2017-01-16 09:42:19 +01:00
|
|
|
aa_put_proxy(proxy);
|
2013-07-11 06:13:43 +02:00
|
|
|
profile->dents[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* Requires: @old->ns->lock held
|
|
|
|
*/
|
|
|
|
void __aafs_profile_migrate_dents(struct aa_profile *old,
|
|
|
|
struct aa_profile *new)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2017-07-19 08:41:13 +02:00
|
|
|
AA_BUG(!old);
|
|
|
|
AA_BUG(!new);
|
|
|
|
AA_BUG(!mutex_is_locked(&profiles_ns(old)->lock));
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
for (i = 0; i < AAFS_PROF_SIZEOF; i++) {
|
|
|
|
new->dents[i] = old->dents[i];
|
2014-07-25 13:01:56 +02:00
|
|
|
if (new->dents[i])
|
2016-09-14 16:48:04 +02:00
|
|
|
new->dents[i]->d_inode->i_mtime = current_time(new->dents[i]->d_inode);
|
2013-07-11 06:13:43 +02:00
|
|
|
old->dents[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct dentry *create_profile_file(struct dentry *dir, const char *name,
|
|
|
|
struct aa_profile *profile,
|
|
|
|
const struct file_operations *fops)
|
|
|
|
{
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_proxy *proxy = aa_get_proxy(profile->label.proxy);
|
2013-07-11 06:13:43 +02:00
|
|
|
struct dentry *dent;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file(name, S_IFREG | 0444, dir, proxy, fops);
|
2013-07-11 06:13:43 +02:00
|
|
|
if (IS_ERR(dent))
|
2017-01-16 09:42:19 +01:00
|
|
|
aa_put_proxy(proxy);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
return dent;
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static int profile_depth(struct aa_profile *profile)
|
|
|
|
{
|
|
|
|
int depth = 0;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
for (depth = 0; profile; profile = rcu_access_pointer(profile->parent))
|
|
|
|
depth++;
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return depth;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int gen_symlink_name(char *buffer, size_t bsize, int depth,
|
|
|
|
const char *dirname, const char *fname)
|
|
|
|
{
|
|
|
|
int error;
|
|
|
|
|
|
|
|
for (; depth > 0; depth--) {
|
|
|
|
if (bsize < 7)
|
|
|
|
return -ENAMETOOLONG;
|
|
|
|
strcpy(buffer, "../../");
|
|
|
|
buffer += 6;
|
|
|
|
bsize -= 6;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = snprintf(buffer, bsize, "raw_data/%s/%s", dirname, fname);
|
|
|
|
if (error >= bsize || error < 0)
|
|
|
|
return -ENAMETOOLONG;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Requires: @profile->ns->lock held
|
|
|
|
*/
|
2017-05-25 15:23:42 +02:00
|
|
|
int __aafs_profile_mkdir(struct aa_profile *profile, struct dentry *parent)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
|
|
|
struct aa_profile *child;
|
|
|
|
struct dentry *dent = NULL, *dir;
|
|
|
|
int error;
|
|
|
|
|
2017-07-19 08:41:13 +02:00
|
|
|
AA_BUG(!profile);
|
|
|
|
AA_BUG(!mutex_is_locked(&profiles_ns(profile)->lock));
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
if (!parent) {
|
|
|
|
struct aa_profile *p;
|
|
|
|
p = aa_deref_parent(profile);
|
|
|
|
dent = prof_dir(p);
|
|
|
|
/* adding to parent that previously didn't have children */
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_dir("profiles", dent);
|
2013-07-11 06:13:43 +02:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
prof_child_dir(p) = parent = dent;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!profile->dirname) {
|
|
|
|
int len, id_len;
|
|
|
|
len = mangle_name(profile->base.name, NULL);
|
|
|
|
id_len = snprintf(NULL, 0, ".%ld", profile->ns->uniq_id);
|
|
|
|
|
|
|
|
profile->dirname = kmalloc(len + id_len + 1, GFP_KERNEL);
|
2017-05-23 16:33:46 +02:00
|
|
|
if (!profile->dirname) {
|
|
|
|
error = -ENOMEM;
|
|
|
|
goto fail2;
|
|
|
|
}
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
mangle_name(profile->base.name, profile->dirname);
|
|
|
|
sprintf(profile->dirname + len, ".%ld", profile->ns->uniq_id++);
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_dir(profile->dirname, parent);
|
2013-07-11 06:13:43 +02:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
prof_dir(profile) = dir = dent;
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
dent = create_profile_file(dir, "name", profile,
|
|
|
|
&seq_profile_name_fops);
|
2013-07-11 06:13:43 +02:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_NAME] = dent;
|
|
|
|
|
2017-05-25 13:35:09 +02:00
|
|
|
dent = create_profile_file(dir, "mode", profile,
|
|
|
|
&seq_profile_mode_fops);
|
2013-07-11 06:13:43 +02:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_MODE] = dent;
|
|
|
|
|
2013-07-11 06:17:43 +02:00
|
|
|
dent = create_profile_file(dir, "attach", profile,
|
2017-05-25 13:35:09 +02:00
|
|
|
&seq_profile_attach_fops);
|
2013-07-11 06:17:43 +02:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_ATTACH] = dent;
|
|
|
|
|
2013-08-14 20:27:36 +02:00
|
|
|
if (profile->hash) {
|
|
|
|
dent = create_profile_file(dir, "sha1", profile,
|
2017-05-25 13:35:09 +02:00
|
|
|
&seq_profile_hash_fops);
|
2013-08-14 20:27:36 +02:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_HASH] = dent;
|
|
|
|
}
|
|
|
|
|
2017-01-16 09:42:55 +01:00
|
|
|
if (profile->rawdata) {
|
2017-05-09 09:08:41 +02:00
|
|
|
char target[64];
|
|
|
|
int depth = profile_depth(profile);
|
|
|
|
|
|
|
|
error = gen_symlink_name(target, sizeof(target), depth,
|
|
|
|
profile->rawdata->name, "sha1");
|
|
|
|
if (error < 0)
|
|
|
|
goto fail2;
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_symlink("raw_sha1", dir, target, NULL);
|
2017-01-16 09:42:55 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_RAW_HASH] = dent;
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
error = gen_symlink_name(target, sizeof(target), depth,
|
|
|
|
profile->rawdata->name, "abi");
|
|
|
|
if (error < 0)
|
|
|
|
goto fail2;
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_symlink("raw_abi", dir, target, NULL);
|
2017-01-16 09:42:55 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_RAW_ABI] = dent;
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
error = gen_symlink_name(target, sizeof(target), depth,
|
|
|
|
profile->rawdata->name, "raw_data");
|
|
|
|
if (error < 0)
|
|
|
|
goto fail2;
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_symlink("raw_data", dir, target, NULL);
|
2017-01-16 09:42:55 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
profile->dents[AAFS_PROF_RAW_DATA] = dent;
|
|
|
|
}
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
list_for_each_entry(child, &profile->base.profiles, base.list) {
|
2017-05-25 15:23:42 +02:00
|
|
|
error = __aafs_profile_mkdir(child, prof_child_dir(profile));
|
2013-07-11 06:13:43 +02:00
|
|
|
if (error)
|
|
|
|
goto fail2;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
error = PTR_ERR(dent);
|
|
|
|
|
|
|
|
fail2:
|
2017-05-25 15:23:42 +02:00
|
|
|
__aafs_profile_rmdir(profile);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2017-05-27 01:45:48 +02:00
|
|
|
static int ns_mkdir_op(struct inode *dir, struct dentry *dentry, umode_t mode)
|
|
|
|
{
|
|
|
|
struct aa_ns *ns, *parent;
|
|
|
|
/* TODO: improve permission check */
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
label = begin_current_label_crit_section();
|
|
|
|
error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
|
|
|
|
end_current_label_crit_section(label);
|
2017-05-27 01:45:48 +02:00
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
parent = aa_get_ns(dir->i_private);
|
|
|
|
AA_BUG(d_inode(ns_subns_dir(parent)) != dir);
|
|
|
|
|
|
|
|
/* we have to unlock and then relock to get locking order right
|
|
|
|
* for pin_fs
|
|
|
|
*/
|
|
|
|
inode_unlock(dir);
|
|
|
|
error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&parent->lock, parent->level);
|
2017-05-27 01:45:48 +02:00
|
|
|
inode_lock_nested(dir, I_MUTEX_PARENT);
|
|
|
|
if (error)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
error = __aafs_setup_d_inode(dir, dentry, mode | S_IFDIR, NULL,
|
|
|
|
NULL, NULL, NULL);
|
|
|
|
if (error)
|
|
|
|
goto out_pin;
|
|
|
|
|
|
|
|
ns = __aa_find_or_create_ns(parent, READ_ONCE(dentry->d_name.name),
|
|
|
|
dentry);
|
|
|
|
if (IS_ERR(ns)) {
|
|
|
|
error = PTR_ERR(ns);
|
|
|
|
ns = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
aa_put_ns(ns); /* list ref remains */
|
|
|
|
out_pin:
|
|
|
|
if (error)
|
|
|
|
simple_release_fs(&aafs_mnt, &aafs_count);
|
|
|
|
out:
|
|
|
|
mutex_unlock(&parent->lock);
|
|
|
|
aa_put_ns(parent);
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ns_rmdir_op(struct inode *dir, struct dentry *dentry)
|
|
|
|
{
|
|
|
|
struct aa_ns *ns, *parent;
|
|
|
|
/* TODO: improve permission check */
|
2017-06-09 17:14:28 +02:00
|
|
|
struct aa_label *label;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
label = begin_current_label_crit_section();
|
|
|
|
error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
|
|
|
|
end_current_label_crit_section(label);
|
2017-05-27 01:45:48 +02:00
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
parent = aa_get_ns(dir->i_private);
|
2017-05-27 01:45:48 +02:00
|
|
|
/* rmdir calls the generic securityfs functions to remove files
|
|
|
|
* from the apparmor dir. It is up to the apparmor ns locking
|
|
|
|
* to avoid races.
|
|
|
|
*/
|
|
|
|
inode_unlock(dir);
|
|
|
|
inode_unlock(dentry->d_inode);
|
|
|
|
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&parent->lock, parent->level);
|
2017-05-27 01:45:48 +02:00
|
|
|
ns = aa_get_ns(__aa_findn_ns(&parent->sub_ns, dentry->d_name.name,
|
|
|
|
dentry->d_name.len));
|
|
|
|
if (!ns) {
|
|
|
|
error = -ENOENT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
AA_BUG(ns_dir(ns) != dentry);
|
|
|
|
|
|
|
|
__aa_remove_ns(ns);
|
|
|
|
aa_put_ns(ns);
|
|
|
|
|
|
|
|
out:
|
|
|
|
mutex_unlock(&parent->lock);
|
|
|
|
inode_lock_nested(dir, I_MUTEX_PARENT);
|
|
|
|
inode_lock(dentry->d_inode);
|
|
|
|
aa_put_ns(parent);
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct inode_operations ns_dir_inode_operations = {
|
|
|
|
.lookup = simple_lookup,
|
|
|
|
.mkdir = ns_mkdir_op,
|
|
|
|
.rmdir = ns_rmdir_op,
|
|
|
|
};
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
static void __aa_fs_list_remove_rawdata(struct aa_ns *ns)
|
|
|
|
{
|
|
|
|
struct aa_loaddata *ent, *tmp;
|
|
|
|
|
|
|
|
AA_BUG(!mutex_is_locked(&ns->lock));
|
|
|
|
|
|
|
|
list_for_each_entry_safe(ent, tmp, &ns->rawdata_list, list)
|
|
|
|
__aa_fs_remove_rawdata(ent);
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* Requires: @ns->lock held
|
|
|
|
*/
|
|
|
|
void __aafs_ns_rmdir(struct aa_ns *ns)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *sub;
|
2013-07-11 06:13:43 +02:00
|
|
|
struct aa_profile *child;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (!ns)
|
|
|
|
return;
|
2017-07-19 08:41:13 +02:00
|
|
|
AA_BUG(!mutex_is_locked(&ns->lock));
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
list_for_each_entry(child, &ns->base.profiles, base.list)
|
2017-05-25 15:23:42 +02:00
|
|
|
__aafs_profile_rmdir(child);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
list_for_each_entry(sub, &ns->sub_ns, base.list) {
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&sub->lock, sub->level);
|
2017-05-25 15:23:42 +02:00
|
|
|
__aafs_ns_rmdir(sub);
|
2013-07-11 06:13:43 +02:00
|
|
|
mutex_unlock(&sub->lock);
|
|
|
|
}
|
|
|
|
|
2017-05-09 09:08:41 +02:00
|
|
|
__aa_fs_list_remove_rawdata(ns);
|
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
if (ns_subns_dir(ns)) {
|
|
|
|
sub = d_inode(ns_subns_dir(ns))->i_private;
|
|
|
|
aa_put_ns(sub);
|
|
|
|
}
|
|
|
|
if (ns_subload(ns)) {
|
|
|
|
sub = d_inode(ns_subload(ns))->i_private;
|
|
|
|
aa_put_ns(sub);
|
|
|
|
}
|
|
|
|
if (ns_subreplace(ns)) {
|
|
|
|
sub = d_inode(ns_subreplace(ns))->i_private;
|
|
|
|
aa_put_ns(sub);
|
|
|
|
}
|
|
|
|
if (ns_subremove(ns)) {
|
|
|
|
sub = d_inode(ns_subremove(ns))->i_private;
|
|
|
|
aa_put_ns(sub);
|
|
|
|
}
|
2017-05-27 01:27:58 +02:00
|
|
|
if (ns_subrevision(ns)) {
|
|
|
|
sub = d_inode(ns_subrevision(ns))->i_private;
|
|
|
|
aa_put_ns(sub);
|
|
|
|
}
|
2017-01-16 09:42:58 +01:00
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
for (i = AAFS_NS_SIZEOF - 1; i >= 0; --i) {
|
2017-05-25 15:35:38 +02:00
|
|
|
aafs_remove(ns->dents[i]);
|
2013-07-11 06:13:43 +02:00
|
|
|
ns->dents[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
/* assumes cleanup in caller */
|
2017-05-25 15:23:42 +02:00
|
|
|
static int __aafs_ns_mkdir_entries(struct aa_ns *ns, struct dentry *dir)
|
2017-01-16 09:42:58 +01:00
|
|
|
{
|
|
|
|
struct dentry *dent;
|
|
|
|
|
|
|
|
AA_BUG(!ns);
|
|
|
|
AA_BUG(!dir);
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_dir("profiles", dir);
|
2017-01-16 09:42:58 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
ns_subprofs_dir(ns) = dent;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_dir("raw_data", dir);
|
2017-01-16 09:42:58 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
ns_subdata_dir(ns) = dent;
|
|
|
|
|
2017-05-27 01:27:58 +02:00
|
|
|
dent = aafs_create_file("revision", 0444, dir, ns,
|
|
|
|
&aa_fs_ns_revision_fops);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
aa_get_ns(ns);
|
|
|
|
ns_subrevision(ns) = dent;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file(".load", 0640, dir, ns,
|
2017-01-16 09:42:58 +01:00
|
|
|
&aa_fs_profile_load);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
aa_get_ns(ns);
|
|
|
|
ns_subload(ns) = dent;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file(".replace", 0640, dir, ns,
|
2017-01-16 09:42:58 +01:00
|
|
|
&aa_fs_profile_replace);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
aa_get_ns(ns);
|
|
|
|
ns_subreplace(ns) = dent;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
dent = aafs_create_file(".remove", 0640, dir, ns,
|
2017-01-16 09:42:58 +01:00
|
|
|
&aa_fs_profile_remove);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
aa_get_ns(ns);
|
|
|
|
ns_subremove(ns) = dent;
|
|
|
|
|
2017-05-27 01:45:48 +02:00
|
|
|
/* use create_dentry so we can supply private data */
|
|
|
|
dent = aafs_create("namespaces", S_IFDIR | 0755, dir, ns, NULL, NULL,
|
|
|
|
&ns_dir_inode_operations);
|
2017-01-16 09:42:58 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
return PTR_ERR(dent);
|
|
|
|
aa_get_ns(ns);
|
|
|
|
ns_subns_dir(ns) = dent;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
/*
|
|
|
|
* Requires: @ns->lock held
|
|
|
|
*/
|
2017-05-25 15:31:46 +02:00
|
|
|
int __aafs_ns_mkdir(struct aa_ns *ns, struct dentry *parent, const char *name,
|
|
|
|
struct dentry *dent)
|
2013-07-11 06:13:43 +02:00
|
|
|
{
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *sub;
|
2013-07-11 06:13:43 +02:00
|
|
|
struct aa_profile *child;
|
2017-05-25 15:31:46 +02:00
|
|
|
struct dentry *dir;
|
2013-07-11 06:13:43 +02:00
|
|
|
int error;
|
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
AA_BUG(!ns);
|
|
|
|
AA_BUG(!parent);
|
|
|
|
AA_BUG(!mutex_is_locked(&ns->lock));
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
if (!name)
|
|
|
|
name = ns->base.name;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
if (!dent) {
|
|
|
|
/* create ns dir if it doesn't already exist */
|
|
|
|
dent = aafs_create_dir(name, parent);
|
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto fail;
|
|
|
|
} else
|
|
|
|
dget(dent);
|
2017-01-16 09:42:58 +01:00
|
|
|
ns_dir(ns) = dir = dent;
|
2017-05-25 15:23:42 +02:00
|
|
|
error = __aafs_ns_mkdir_entries(ns, dir);
|
2017-01-16 09:42:58 +01:00
|
|
|
if (error)
|
|
|
|
goto fail2;
|
2013-07-11 06:13:43 +02:00
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
/* profiles */
|
2013-07-11 06:13:43 +02:00
|
|
|
list_for_each_entry(child, &ns->base.profiles, base.list) {
|
2017-05-25 15:23:42 +02:00
|
|
|
error = __aafs_profile_mkdir(child, ns_subprofs_dir(ns));
|
2013-07-11 06:13:43 +02:00
|
|
|
if (error)
|
|
|
|
goto fail2;
|
|
|
|
}
|
|
|
|
|
2017-01-16 09:42:58 +01:00
|
|
|
/* subnamespaces */
|
2013-07-11 06:13:43 +02:00
|
|
|
list_for_each_entry(sub, &ns->sub_ns, base.list) {
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&sub->lock, sub->level);
|
2017-05-25 15:31:46 +02:00
|
|
|
error = __aafs_ns_mkdir(sub, ns_subns_dir(ns), NULL, NULL);
|
2013-07-11 06:13:43 +02:00
|
|
|
mutex_unlock(&sub->lock);
|
|
|
|
if (error)
|
|
|
|
goto fail2;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
error = PTR_ERR(dent);
|
|
|
|
|
|
|
|
fail2:
|
2017-05-25 15:23:42 +02:00
|
|
|
__aafs_ns_rmdir(ns);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-07-11 06:18:43 +02:00
|
|
|
#define list_entry_is_head(pos, head, member) (&pos->member == (head))
|
|
|
|
|
|
|
|
/**
|
2017-01-16 09:42:16 +01:00
|
|
|
* __next_ns - find the next namespace to list
|
2013-07-11 06:18:43 +02:00
|
|
|
* @root: root namespace to stop search at (NOT NULL)
|
|
|
|
* @ns: current ns position (NOT NULL)
|
|
|
|
*
|
|
|
|
* Find the next namespace from @ns under @root and handle all locking needed
|
|
|
|
* while switching current namespace.
|
|
|
|
*
|
|
|
|
* Returns: next namespace or NULL if at last namespace under @root
|
|
|
|
* Requires: ns->parent->lock to be held
|
|
|
|
* NOTE: will not unlock root->lock
|
|
|
|
*/
|
2017-01-16 09:42:16 +01:00
|
|
|
static struct aa_ns *__next_ns(struct aa_ns *root, struct aa_ns *ns)
|
2013-07-11 06:18:43 +02:00
|
|
|
{
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *parent, *next;
|
2013-07-11 06:18:43 +02:00
|
|
|
|
2017-07-19 08:41:13 +02:00
|
|
|
AA_BUG(!root);
|
|
|
|
AA_BUG(!ns);
|
|
|
|
AA_BUG(ns != root && !mutex_is_locked(&ns->parent->lock));
|
|
|
|
|
2013-07-11 06:18:43 +02:00
|
|
|
/* is next namespace a child */
|
|
|
|
if (!list_empty(&ns->sub_ns)) {
|
|
|
|
next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list);
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&next->lock, next->level);
|
2013-07-11 06:18:43 +02:00
|
|
|
return next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check if the next ns is a sibling, parent, gp, .. */
|
|
|
|
parent = ns->parent;
|
2013-10-14 20:46:27 +02:00
|
|
|
while (ns != root) {
|
2013-07-11 06:18:43 +02:00
|
|
|
mutex_unlock(&ns->lock);
|
2015-11-16 14:46:33 +01:00
|
|
|
next = list_next_entry(ns, base.list);
|
2013-07-11 06:18:43 +02:00
|
|
|
if (!list_entry_is_head(next, &parent->sub_ns, base.list)) {
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&next->lock, next->level);
|
2013-07-11 06:18:43 +02:00
|
|
|
return next;
|
|
|
|
}
|
|
|
|
ns = parent;
|
|
|
|
parent = parent->parent;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __first_profile - find the first profile in a namespace
|
|
|
|
* @root: namespace that is root of profiles being displayed (NOT NULL)
|
|
|
|
* @ns: namespace to start in (NOT NULL)
|
|
|
|
*
|
|
|
|
* Returns: unrefcounted profile or NULL if no profile
|
|
|
|
* Requires: profile->ns.lock to be held
|
|
|
|
*/
|
2017-01-16 09:42:16 +01:00
|
|
|
static struct aa_profile *__first_profile(struct aa_ns *root,
|
|
|
|
struct aa_ns *ns)
|
2013-07-11 06:18:43 +02:00
|
|
|
{
|
2017-07-19 08:41:13 +02:00
|
|
|
AA_BUG(!root);
|
|
|
|
AA_BUG(ns && !mutex_is_locked(&ns->lock));
|
|
|
|
|
2017-01-16 09:42:16 +01:00
|
|
|
for (; ns; ns = __next_ns(root, ns)) {
|
2013-07-11 06:18:43 +02:00
|
|
|
if (!list_empty(&ns->base.profiles))
|
|
|
|
return list_first_entry(&ns->base.profiles,
|
|
|
|
struct aa_profile, base.list);
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __next_profile - step to the next profile in a profile tree
|
|
|
|
* @profile: current profile in tree (NOT NULL)
|
|
|
|
*
|
|
|
|
* Perform a depth first traversal on the profile tree in a namespace
|
|
|
|
*
|
|
|
|
* Returns: next profile or NULL if done
|
|
|
|
* Requires: profile->ns.lock to be held
|
|
|
|
*/
|
|
|
|
static struct aa_profile *__next_profile(struct aa_profile *p)
|
|
|
|
{
|
|
|
|
struct aa_profile *parent;
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *ns = p->ns;
|
2013-07-11 06:18:43 +02:00
|
|
|
|
2017-07-19 08:41:13 +02:00
|
|
|
AA_BUG(!mutex_is_locked(&profiles_ns(p)->lock));
|
|
|
|
|
2013-07-11 06:18:43 +02:00
|
|
|
/* is next profile a child */
|
|
|
|
if (!list_empty(&p->base.profiles))
|
|
|
|
return list_first_entry(&p->base.profiles, typeof(*p),
|
|
|
|
base.list);
|
|
|
|
|
|
|
|
/* is next profile a sibling, parent sibling, gp, sibling, .. */
|
|
|
|
parent = rcu_dereference_protected(p->parent,
|
|
|
|
mutex_is_locked(&p->ns->lock));
|
|
|
|
while (parent) {
|
2015-11-16 14:46:33 +01:00
|
|
|
p = list_next_entry(p, base.list);
|
2013-07-11 06:18:43 +02:00
|
|
|
if (!list_entry_is_head(p, &parent->base.profiles, base.list))
|
|
|
|
return p;
|
|
|
|
p = parent;
|
|
|
|
parent = rcu_dereference_protected(parent->parent,
|
|
|
|
mutex_is_locked(&parent->ns->lock));
|
|
|
|
}
|
|
|
|
|
|
|
|
/* is next another profile in the namespace */
|
2015-11-16 14:46:33 +01:00
|
|
|
p = list_next_entry(p, base.list);
|
2013-07-11 06:18:43 +02:00
|
|
|
if (!list_entry_is_head(p, &ns->base.profiles, base.list))
|
|
|
|
return p;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* next_profile - step to the next profile in where ever it may be
|
|
|
|
* @root: root namespace (NOT NULL)
|
|
|
|
* @profile: current profile (NOT NULL)
|
|
|
|
*
|
|
|
|
* Returns: next profile or NULL if there isn't one
|
|
|
|
*/
|
2017-01-16 09:42:16 +01:00
|
|
|
static struct aa_profile *next_profile(struct aa_ns *root,
|
2013-07-11 06:18:43 +02:00
|
|
|
struct aa_profile *profile)
|
|
|
|
{
|
|
|
|
struct aa_profile *next = __next_profile(profile);
|
|
|
|
if (next)
|
|
|
|
return next;
|
|
|
|
|
|
|
|
/* finished all profiles in namespace move to next namespace */
|
2017-01-16 09:42:16 +01:00
|
|
|
return __first_profile(root, __next_ns(root, profile->ns));
|
2013-07-11 06:18:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* p_start - start a depth first traversal of profile tree
|
|
|
|
* @f: seq_file to fill
|
|
|
|
* @pos: current position
|
|
|
|
*
|
|
|
|
* Returns: first profile under current namespace or NULL if none found
|
|
|
|
*
|
|
|
|
* acquires first ns->lock
|
|
|
|
*/
|
|
|
|
static void *p_start(struct seq_file *f, loff_t *pos)
|
|
|
|
{
|
|
|
|
struct aa_profile *profile = NULL;
|
2017-06-09 11:08:28 +02:00
|
|
|
struct aa_ns *root = aa_get_current_ns();
|
2013-07-11 06:18:43 +02:00
|
|
|
loff_t l = *pos;
|
2017-06-09 11:08:28 +02:00
|
|
|
f->private = root;
|
2013-07-11 06:18:43 +02:00
|
|
|
|
|
|
|
/* find the first profile */
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&root->lock, root->level);
|
2013-07-11 06:18:43 +02:00
|
|
|
profile = __first_profile(root, root);
|
|
|
|
|
|
|
|
/* skip to position */
|
|
|
|
for (; profile && l > 0; l--)
|
|
|
|
profile = next_profile(root, profile);
|
|
|
|
|
|
|
|
return profile;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* p_next - read the next profile entry
|
|
|
|
* @f: seq_file to fill
|
|
|
|
* @p: profile previously returned
|
|
|
|
* @pos: current position
|
|
|
|
*
|
|
|
|
* Returns: next profile after @p or NULL if none
|
|
|
|
*
|
|
|
|
* may acquire/release locks in namespace tree as necessary
|
|
|
|
*/
|
|
|
|
static void *p_next(struct seq_file *f, void *p, loff_t *pos)
|
|
|
|
{
|
|
|
|
struct aa_profile *profile = p;
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *ns = f->private;
|
2013-07-11 06:18:43 +02:00
|
|
|
(*pos)++;
|
|
|
|
|
|
|
|
return next_profile(ns, profile);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* p_stop - stop depth first traversal
|
|
|
|
* @f: seq_file we are filling
|
|
|
|
* @p: the last profile writen
|
|
|
|
*
|
|
|
|
* Release all locking done by p_start/p_next on namespace tree
|
|
|
|
*/
|
|
|
|
static void p_stop(struct seq_file *f, void *p)
|
|
|
|
{
|
|
|
|
struct aa_profile *profile = p;
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *root = f->private, *ns;
|
2013-07-11 06:18:43 +02:00
|
|
|
|
|
|
|
if (profile) {
|
|
|
|
for (ns = profile->ns; ns && ns != root; ns = ns->parent)
|
|
|
|
mutex_unlock(&ns->lock);
|
|
|
|
}
|
|
|
|
mutex_unlock(&root->lock);
|
2017-01-16 09:42:16 +01:00
|
|
|
aa_put_ns(root);
|
2013-07-11 06:18:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* seq_show_profile - show a profile entry
|
|
|
|
* @f: seq_file to file
|
|
|
|
* @p: current position (profile) (NOT NULL)
|
|
|
|
*
|
|
|
|
* Returns: error on failure
|
|
|
|
*/
|
|
|
|
static int seq_show_profile(struct seq_file *f, void *p)
|
|
|
|
{
|
|
|
|
struct aa_profile *profile = (struct aa_profile *)p;
|
2017-01-16 09:42:16 +01:00
|
|
|
struct aa_ns *root = f->private;
|
2013-07-11 06:18:43 +02:00
|
|
|
|
2017-06-09 17:14:28 +02:00
|
|
|
aa_label_seq_xprint(f, root, &profile->label,
|
|
|
|
FLAG_SHOW_MODE | FLAG_VIEW_SUBNS, GFP_KERNEL);
|
|
|
|
seq_putc(f, '\n');
|
2013-07-11 06:18:43 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static const struct seq_operations aa_sfs_profiles_op = {
|
2013-07-11 06:18:43 +02:00
|
|
|
.start = p_start,
|
|
|
|
.next = p_next,
|
|
|
|
.stop = p_stop,
|
|
|
|
.show = seq_show_profile,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int profiles_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2017-01-16 09:42:55 +01:00
|
|
|
if (!policy_view_capable(NULL))
|
|
|
|
return -EACCES;
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
return seq_open(file, &aa_sfs_profiles_op);
|
2013-07-11 06:18:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int profiles_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return seq_release(inode, file);
|
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static const struct file_operations aa_sfs_profiles_fops = {
|
2013-07-11 06:18:43 +02:00
|
|
|
.open = profiles_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = profiles_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
/** Base file system setup **/
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_file[] = {
|
|
|
|
AA_SFS_FILE_STRING("mask",
|
|
|
|
"create read write exec append mmap_exec link lock"),
|
2012-01-27 01:29:22 +01:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-06-09 23:38:35 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_ptrace[] = {
|
|
|
|
AA_SFS_FILE_STRING("mask", "read trace"),
|
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-07-19 07:56:22 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_signal[] = {
|
|
|
|
AA_SFS_FILE_STRING("mask", AA_SFS_SIG_MASK),
|
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-12-13 00:28:05 +01:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_attach[] = {
|
|
|
|
AA_SFS_FILE_BOOLEAN("xattr", 1),
|
|
|
|
{ }
|
|
|
|
};
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_domain[] = {
|
|
|
|
AA_SFS_FILE_BOOLEAN("change_hat", 1),
|
|
|
|
AA_SFS_FILE_BOOLEAN("change_hatv", 1),
|
|
|
|
AA_SFS_FILE_BOOLEAN("change_onexec", 1),
|
|
|
|
AA_SFS_FILE_BOOLEAN("change_profile", 1),
|
2017-06-10 02:22:50 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("stack", 1),
|
2017-05-25 15:23:42 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("fix_binfmt_elf_mmap", 1),
|
2017-10-09 03:26:19 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("post_nnp_subset", 1),
|
2017-11-19 04:43:13 +01:00
|
|
|
AA_SFS_FILE_BOOLEAN("computed_longest_left", 1),
|
2017-12-13 00:28:05 +01:00
|
|
|
AA_SFS_DIR("attach_conditions", aa_sfs_entry_attach),
|
2017-05-25 15:23:42 +02:00
|
|
|
AA_SFS_FILE_STRING("version", "1.2"),
|
2012-01-27 01:29:21 +01:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_versions[] = {
|
|
|
|
AA_SFS_FILE_BOOLEAN("v5", 1),
|
2017-06-10 02:29:12 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("v6", 1),
|
|
|
|
AA_SFS_FILE_BOOLEAN("v7", 1),
|
2017-07-19 08:18:33 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("v8", 1),
|
2017-01-16 09:42:39 +01:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_policy[] = {
|
|
|
|
AA_SFS_DIR("versions", aa_sfs_entry_versions),
|
|
|
|
AA_SFS_FILE_BOOLEAN("set_load", 1),
|
2017-01-16 09:42:39 +01:00
|
|
|
{ }
|
2013-07-11 06:04:43 +02:00
|
|
|
};
|
|
|
|
|
apparmor: add mount mediation
Add basic mount mediation. That allows controlling based on basic
mount parameters. It does not include special mount parameters for
apparmor, super block labeling, or any triggers for apparmor namespace
parameter modifications on pivot root.
default userspace policy rules have the form of
MOUNT RULE = ( MOUNT | REMOUNT | UMOUNT )
MOUNT = [ QUALIFIERS ] 'mount' [ MOUNT CONDITIONS ] [ SOURCE FILEGLOB ]
[ '->' MOUNTPOINT FILEGLOB ]
REMOUNT = [ QUALIFIERS ] 'remount' [ MOUNT CONDITIONS ]
MOUNTPOINT FILEGLOB
UMOUNT = [ QUALIFIERS ] 'umount' [ MOUNT CONDITIONS ] MOUNTPOINT FILEGLOB
MOUNT CONDITIONS = [ ( 'fstype' | 'vfstype' ) ( '=' | 'in' )
MOUNT FSTYPE EXPRESSION ]
[ 'options' ( '=' | 'in' ) MOUNT FLAGS EXPRESSION ]
MOUNT FSTYPE EXPRESSION = ( MOUNT FSTYPE LIST | MOUNT EXPRESSION )
MOUNT FSTYPE LIST = Comma separated list of valid filesystem and
virtual filesystem types (eg ext4, debugfs, etc)
MOUNT FLAGS EXPRESSION = ( MOUNT FLAGS LIST | MOUNT EXPRESSION )
MOUNT FLAGS LIST = Comma separated list of MOUNT FLAGS.
MOUNT FLAGS = ( 'ro' | 'rw' | 'nosuid' | 'suid' | 'nodev' | 'dev' |
'noexec' | 'exec' | 'sync' | 'async' | 'remount' |
'mand' | 'nomand' | 'dirsync' | 'noatime' | 'atime' |
'nodiratime' | 'diratime' | 'bind' | 'rbind' | 'move' |
'verbose' | 'silent' | 'loud' | 'acl' | 'noacl' |
'unbindable' | 'runbindable' | 'private' | 'rprivate' |
'slave' | 'rslave' | 'shared' | 'rshared' |
'relatime' | 'norelatime' | 'iversion' | 'noiversion' |
'strictatime' | 'nouser' | 'user' )
MOUNT EXPRESSION = ( ALPHANUMERIC | AARE ) ...
PIVOT ROOT RULE = [ QUALIFIERS ] pivot_root [ oldroot=OLD PUT FILEGLOB ]
[ NEW ROOT FILEGLOB ]
SOURCE FILEGLOB = FILEGLOB
MOUNTPOINT FILEGLOB = FILEGLOB
eg.
mount,
mount /dev/foo,
mount options=ro /dev/foo -> /mnt/,
mount options in (ro,atime) /dev/foo -> /mnt/,
mount options=ro options=atime,
Signed-off-by: John Johansen <john.johansen@canonical.com>
Acked-by: Seth Arnold <seth.arnold@canonical.com>
2017-07-19 08:04:47 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_mount[] = {
|
|
|
|
AA_SFS_FILE_STRING("mask", "mount umount pivot_root"),
|
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-06-10 02:25:03 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_ns[] = {
|
|
|
|
AA_SFS_FILE_BOOLEAN("profile", 1),
|
apparmor: add mount mediation
Add basic mount mediation. That allows controlling based on basic
mount parameters. It does not include special mount parameters for
apparmor, super block labeling, or any triggers for apparmor namespace
parameter modifications on pivot root.
default userspace policy rules have the form of
MOUNT RULE = ( MOUNT | REMOUNT | UMOUNT )
MOUNT = [ QUALIFIERS ] 'mount' [ MOUNT CONDITIONS ] [ SOURCE FILEGLOB ]
[ '->' MOUNTPOINT FILEGLOB ]
REMOUNT = [ QUALIFIERS ] 'remount' [ MOUNT CONDITIONS ]
MOUNTPOINT FILEGLOB
UMOUNT = [ QUALIFIERS ] 'umount' [ MOUNT CONDITIONS ] MOUNTPOINT FILEGLOB
MOUNT CONDITIONS = [ ( 'fstype' | 'vfstype' ) ( '=' | 'in' )
MOUNT FSTYPE EXPRESSION ]
[ 'options' ( '=' | 'in' ) MOUNT FLAGS EXPRESSION ]
MOUNT FSTYPE EXPRESSION = ( MOUNT FSTYPE LIST | MOUNT EXPRESSION )
MOUNT FSTYPE LIST = Comma separated list of valid filesystem and
virtual filesystem types (eg ext4, debugfs, etc)
MOUNT FLAGS EXPRESSION = ( MOUNT FLAGS LIST | MOUNT EXPRESSION )
MOUNT FLAGS LIST = Comma separated list of MOUNT FLAGS.
MOUNT FLAGS = ( 'ro' | 'rw' | 'nosuid' | 'suid' | 'nodev' | 'dev' |
'noexec' | 'exec' | 'sync' | 'async' | 'remount' |
'mand' | 'nomand' | 'dirsync' | 'noatime' | 'atime' |
'nodiratime' | 'diratime' | 'bind' | 'rbind' | 'move' |
'verbose' | 'silent' | 'loud' | 'acl' | 'noacl' |
'unbindable' | 'runbindable' | 'private' | 'rprivate' |
'slave' | 'rslave' | 'shared' | 'rshared' |
'relatime' | 'norelatime' | 'iversion' | 'noiversion' |
'strictatime' | 'nouser' | 'user' )
MOUNT EXPRESSION = ( ALPHANUMERIC | AARE ) ...
PIVOT ROOT RULE = [ QUALIFIERS ] pivot_root [ oldroot=OLD PUT FILEGLOB ]
[ NEW ROOT FILEGLOB ]
SOURCE FILEGLOB = FILEGLOB
MOUNTPOINT FILEGLOB = FILEGLOB
eg.
mount,
mount /dev/foo,
mount options=ro /dev/foo -> /mnt/,
mount options in (ro,atime) /dev/foo -> /mnt/,
mount options=ro options=atime,
Signed-off-by: John Johansen <john.johansen@canonical.com>
Acked-by: Seth Arnold <seth.arnold@canonical.com>
2017-07-19 08:04:47 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("pivot_root", 0),
|
2017-06-10 02:25:03 +02:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-05-27 03:49:04 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_query_label[] = {
|
2017-05-27 03:35:29 +02:00
|
|
|
AA_SFS_FILE_STRING("perms", "allow deny audit quiet"),
|
2017-05-27 03:49:04 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("data", 1),
|
2017-05-27 02:23:23 +02:00
|
|
|
AA_SFS_FILE_BOOLEAN("multi_transaction", 1),
|
2017-05-27 03:49:04 +02:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct aa_sfs_entry aa_sfs_entry_query[] = {
|
|
|
|
AA_SFS_DIR("label", aa_sfs_entry_query_label),
|
|
|
|
{ }
|
|
|
|
};
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_features[] = {
|
|
|
|
AA_SFS_DIR("policy", aa_sfs_entry_policy),
|
|
|
|
AA_SFS_DIR("domain", aa_sfs_entry_domain),
|
|
|
|
AA_SFS_DIR("file", aa_sfs_entry_file),
|
2017-07-19 08:18:33 +02:00
|
|
|
AA_SFS_DIR("network_v8", aa_sfs_entry_network),
|
apparmor: add mount mediation
Add basic mount mediation. That allows controlling based on basic
mount parameters. It does not include special mount parameters for
apparmor, super block labeling, or any triggers for apparmor namespace
parameter modifications on pivot root.
default userspace policy rules have the form of
MOUNT RULE = ( MOUNT | REMOUNT | UMOUNT )
MOUNT = [ QUALIFIERS ] 'mount' [ MOUNT CONDITIONS ] [ SOURCE FILEGLOB ]
[ '->' MOUNTPOINT FILEGLOB ]
REMOUNT = [ QUALIFIERS ] 'remount' [ MOUNT CONDITIONS ]
MOUNTPOINT FILEGLOB
UMOUNT = [ QUALIFIERS ] 'umount' [ MOUNT CONDITIONS ] MOUNTPOINT FILEGLOB
MOUNT CONDITIONS = [ ( 'fstype' | 'vfstype' ) ( '=' | 'in' )
MOUNT FSTYPE EXPRESSION ]
[ 'options' ( '=' | 'in' ) MOUNT FLAGS EXPRESSION ]
MOUNT FSTYPE EXPRESSION = ( MOUNT FSTYPE LIST | MOUNT EXPRESSION )
MOUNT FSTYPE LIST = Comma separated list of valid filesystem and
virtual filesystem types (eg ext4, debugfs, etc)
MOUNT FLAGS EXPRESSION = ( MOUNT FLAGS LIST | MOUNT EXPRESSION )
MOUNT FLAGS LIST = Comma separated list of MOUNT FLAGS.
MOUNT FLAGS = ( 'ro' | 'rw' | 'nosuid' | 'suid' | 'nodev' | 'dev' |
'noexec' | 'exec' | 'sync' | 'async' | 'remount' |
'mand' | 'nomand' | 'dirsync' | 'noatime' | 'atime' |
'nodiratime' | 'diratime' | 'bind' | 'rbind' | 'move' |
'verbose' | 'silent' | 'loud' | 'acl' | 'noacl' |
'unbindable' | 'runbindable' | 'private' | 'rprivate' |
'slave' | 'rslave' | 'shared' | 'rshared' |
'relatime' | 'norelatime' | 'iversion' | 'noiversion' |
'strictatime' | 'nouser' | 'user' )
MOUNT EXPRESSION = ( ALPHANUMERIC | AARE ) ...
PIVOT ROOT RULE = [ QUALIFIERS ] pivot_root [ oldroot=OLD PUT FILEGLOB ]
[ NEW ROOT FILEGLOB ]
SOURCE FILEGLOB = FILEGLOB
MOUNTPOINT FILEGLOB = FILEGLOB
eg.
mount,
mount /dev/foo,
mount options=ro /dev/foo -> /mnt/,
mount options in (ro,atime) /dev/foo -> /mnt/,
mount options=ro options=atime,
Signed-off-by: John Johansen <john.johansen@canonical.com>
Acked-by: Seth Arnold <seth.arnold@canonical.com>
2017-07-19 08:04:47 +02:00
|
|
|
AA_SFS_DIR("mount", aa_sfs_entry_mount),
|
2017-06-10 02:25:03 +02:00
|
|
|
AA_SFS_DIR("namespaces", aa_sfs_entry_ns),
|
2017-05-25 15:23:42 +02:00
|
|
|
AA_SFS_FILE_U64("capability", VFS_CAP_FLAGS_MASK),
|
|
|
|
AA_SFS_DIR("rlimit", aa_sfs_entry_rlimit),
|
|
|
|
AA_SFS_DIR("caps", aa_sfs_entry_caps),
|
2017-06-09 23:38:35 +02:00
|
|
|
AA_SFS_DIR("ptrace", aa_sfs_entry_ptrace),
|
2017-07-19 07:56:22 +02:00
|
|
|
AA_SFS_DIR("signal", aa_sfs_entry_signal),
|
2017-05-27 03:49:04 +02:00
|
|
|
AA_SFS_DIR("query", aa_sfs_entry_query),
|
2012-01-27 01:29:21 +01:00
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry_apparmor[] = {
|
2017-08-31 18:54:43 +02:00
|
|
|
AA_SFS_FILE_FOPS(".access", 0666, &aa_sfs_access),
|
2017-06-10 02:22:50 +02:00
|
|
|
AA_SFS_FILE_FOPS(".stacked", 0444, &seq_ns_stacked_fops),
|
|
|
|
AA_SFS_FILE_FOPS(".ns_stacked", 0444, &seq_ns_nsstacked_fops),
|
2017-08-31 18:54:43 +02:00
|
|
|
AA_SFS_FILE_FOPS(".ns_level", 0444, &seq_ns_level_fops),
|
|
|
|
AA_SFS_FILE_FOPS(".ns_name", 0444, &seq_ns_name_fops),
|
|
|
|
AA_SFS_FILE_FOPS("profiles", 0444, &aa_sfs_profiles_fops),
|
2017-05-25 15:23:42 +02:00
|
|
|
AA_SFS_DIR("features", aa_sfs_entry_features),
|
2012-01-27 01:29:20 +01:00
|
|
|
{ }
|
|
|
|
};
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static struct aa_sfs_entry aa_sfs_entry =
|
|
|
|
AA_SFS_DIR("apparmor", aa_sfs_entry_apparmor);
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2012-01-27 01:29:20 +01:00
|
|
|
/**
|
2017-05-25 14:52:56 +02:00
|
|
|
* entry_create_file - create a file entry in the apparmor securityfs
|
2017-05-25 15:23:42 +02:00
|
|
|
* @fs_file: aa_sfs_entry to build an entry for (NOT NULL)
|
2012-01-27 01:29:20 +01:00
|
|
|
* @parent: the parent dentry in the securityfs
|
|
|
|
*
|
2017-05-25 14:52:56 +02:00
|
|
|
* Use entry_remove_file to remove entries created with this fn.
|
2012-01-27 01:29:20 +01:00
|
|
|
*/
|
2017-05-25 15:23:42 +02:00
|
|
|
static int __init entry_create_file(struct aa_sfs_entry *fs_file,
|
2017-05-25 14:52:56 +02:00
|
|
|
struct dentry *parent)
|
2012-01-27 01:29:20 +01:00
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
fs_file->dentry = securityfs_create_file(fs_file->name,
|
|
|
|
S_IFREG | fs_file->mode,
|
|
|
|
parent, fs_file,
|
|
|
|
fs_file->file_ops);
|
|
|
|
if (IS_ERR(fs_file->dentry)) {
|
|
|
|
error = PTR_ERR(fs_file->dentry);
|
|
|
|
fs_file->dentry = NULL;
|
2010-07-29 23:48:03 +02:00
|
|
|
}
|
2012-01-27 01:29:20 +01:00
|
|
|
return error;
|
2010-07-29 23:48:03 +02:00
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir);
|
2010-07-29 23:48:03 +02:00
|
|
|
/**
|
2017-05-25 14:52:56 +02:00
|
|
|
* entry_create_dir - recursively create a directory entry in the securityfs
|
2017-05-25 15:23:42 +02:00
|
|
|
* @fs_dir: aa_sfs_entry (and all child entries) to build (NOT NULL)
|
2012-01-27 01:29:20 +01:00
|
|
|
* @parent: the parent dentry in the securityfs
|
2010-07-29 23:48:03 +02:00
|
|
|
*
|
2017-05-25 14:52:56 +02:00
|
|
|
* Use entry_remove_dir to remove entries created with this fn.
|
2010-07-29 23:48:03 +02:00
|
|
|
*/
|
2017-05-25 15:23:42 +02:00
|
|
|
static int __init entry_create_dir(struct aa_sfs_entry *fs_dir,
|
|
|
|
struct dentry *parent)
|
2010-07-29 23:48:03 +02:00
|
|
|
{
|
2017-05-25 15:23:42 +02:00
|
|
|
struct aa_sfs_entry *fs_file;
|
2013-07-11 06:13:43 +02:00
|
|
|
struct dentry *dir;
|
|
|
|
int error;
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
dir = securityfs_create_dir(fs_dir->name, parent);
|
|
|
|
if (IS_ERR(dir))
|
|
|
|
return PTR_ERR(dir);
|
|
|
|
fs_dir->dentry = dir;
|
2010-07-29 23:48:03 +02:00
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
|
2017-05-25 15:23:42 +02:00
|
|
|
if (fs_file->v_type == AA_SFS_TYPE_DIR)
|
2017-05-25 14:52:56 +02:00
|
|
|
error = entry_create_dir(fs_file, fs_dir->dentry);
|
2012-01-27 01:29:20 +01:00
|
|
|
else
|
2017-05-25 14:52:56 +02:00
|
|
|
error = entry_create_file(fs_file, fs_dir->dentry);
|
2012-01-27 01:29:20 +01:00
|
|
|
if (error)
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
failed:
|
2017-05-25 14:52:56 +02:00
|
|
|
entry_remove_dir(fs_dir);
|
2013-07-11 06:13:43 +02:00
|
|
|
|
2012-01-27 01:29:20 +01:00
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2017-05-25 15:23:42 +02:00
|
|
|
* entry_remove_file - drop a single file entry in the apparmor securityfs
|
|
|
|
* @fs_file: aa_sfs_entry to detach from the securityfs (NOT NULL)
|
2012-01-27 01:29:20 +01:00
|
|
|
*/
|
2017-05-25 15:23:42 +02:00
|
|
|
static void __init entry_remove_file(struct aa_sfs_entry *fs_file)
|
2012-01-27 01:29:20 +01:00
|
|
|
{
|
|
|
|
if (!fs_file->dentry)
|
|
|
|
return;
|
|
|
|
|
|
|
|
securityfs_remove(fs_file->dentry);
|
|
|
|
fs_file->dentry = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2017-05-25 14:52:56 +02:00
|
|
|
* entry_remove_dir - recursively drop a directory entry from the securityfs
|
2017-05-25 15:23:42 +02:00
|
|
|
* @fs_dir: aa_sfs_entry (and all child entries) to detach (NOT NULL)
|
2012-01-27 01:29:20 +01:00
|
|
|
*/
|
2017-05-25 15:23:42 +02:00
|
|
|
static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir)
|
2012-01-27 01:29:20 +01:00
|
|
|
{
|
2017-05-25 15:23:42 +02:00
|
|
|
struct aa_sfs_entry *fs_file;
|
2012-01-27 01:29:20 +01:00
|
|
|
|
2013-07-11 06:13:43 +02:00
|
|
|
for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
|
2017-05-25 15:23:42 +02:00
|
|
|
if (fs_file->v_type == AA_SFS_TYPE_DIR)
|
2017-05-25 14:52:56 +02:00
|
|
|
entry_remove_dir(fs_file);
|
2012-01-27 01:29:20 +01:00
|
|
|
else
|
2017-05-25 15:23:42 +02:00
|
|
|
entry_remove_file(fs_file);
|
2012-01-27 01:29:20 +01:00
|
|
|
}
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
entry_remove_file(fs_dir);
|
2010-07-29 23:48:03 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* aa_destroy_aafs - cleanup and free aafs
|
|
|
|
*
|
|
|
|
* releases dentries allocated by aa_create_aafs
|
|
|
|
*/
|
|
|
|
void __init aa_destroy_aafs(void)
|
|
|
|
{
|
2017-05-25 15:23:42 +02:00
|
|
|
entry_remove_dir(&aa_sfs_entry);
|
2010-07-29 23:48:03 +02:00
|
|
|
}
|
|
|
|
|
2017-01-16 09:42:45 +01:00
|
|
|
|
|
|
|
#define NULL_FILE_NAME ".null"
|
|
|
|
struct path aa_null;
|
|
|
|
|
|
|
|
static int aa_mk_null_file(struct dentry *parent)
|
|
|
|
{
|
|
|
|
struct vfsmount *mount = NULL;
|
|
|
|
struct dentry *dentry;
|
|
|
|
struct inode *inode;
|
|
|
|
int count = 0;
|
|
|
|
int error = simple_pin_fs(parent->d_sb->s_type, &mount, &count);
|
|
|
|
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
inode_lock(d_inode(parent));
|
|
|
|
dentry = lookup_one_len(NULL_FILE_NAME, parent, strlen(NULL_FILE_NAME));
|
|
|
|
if (IS_ERR(dentry)) {
|
|
|
|
error = PTR_ERR(dentry);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
inode = new_inode(parent->d_inode->i_sb);
|
|
|
|
if (!inode) {
|
|
|
|
error = -ENOMEM;
|
|
|
|
goto out1;
|
|
|
|
}
|
|
|
|
|
|
|
|
inode->i_ino = get_next_ino();
|
|
|
|
inode->i_mode = S_IFCHR | S_IRUGO | S_IWUGO;
|
2017-05-09 00:59:31 +02:00
|
|
|
inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
|
2017-01-16 09:42:45 +01:00
|
|
|
init_special_inode(inode, S_IFCHR | S_IRUGO | S_IWUGO,
|
|
|
|
MKDEV(MEM_MAJOR, 3));
|
|
|
|
d_instantiate(dentry, inode);
|
|
|
|
aa_null.dentry = dget(dentry);
|
|
|
|
aa_null.mnt = mntget(mount);
|
|
|
|
|
|
|
|
error = 0;
|
|
|
|
|
|
|
|
out1:
|
|
|
|
dput(dentry);
|
|
|
|
out:
|
|
|
|
inode_unlock(d_inode(parent));
|
|
|
|
simple_release_fs(&mount, &count);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2017-05-25 14:52:56 +02:00
|
|
|
|
|
|
|
|
|
|
|
static const char *policy_get_link(struct dentry *dentry,
|
|
|
|
struct inode *inode,
|
|
|
|
struct delayed_call *done)
|
|
|
|
{
|
|
|
|
struct aa_ns *ns;
|
|
|
|
struct path path;
|
|
|
|
|
|
|
|
if (!dentry)
|
|
|
|
return ERR_PTR(-ECHILD);
|
|
|
|
ns = aa_get_current_ns();
|
|
|
|
path.mnt = mntget(aafs_mnt);
|
|
|
|
path.dentry = dget(ns_dir(ns));
|
|
|
|
nd_jump_link(&path);
|
|
|
|
aa_put_ns(ns);
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int policy_readlink(struct dentry *dentry, char __user *buffer,
|
|
|
|
int buflen)
|
|
|
|
{
|
|
|
|
char name[32];
|
|
|
|
int res;
|
|
|
|
|
2018-02-05 18:26:46 +01:00
|
|
|
res = snprintf(name, sizeof(name), "%s:[%lu]", AAFS_NAME,
|
|
|
|
d_inode(dentry)->i_ino);
|
|
|
|
if (res > 0 && res < sizeof(name))
|
2017-05-25 14:52:56 +02:00
|
|
|
res = readlink_copy(buffer, buflen, name);
|
2018-02-05 18:26:46 +01:00
|
|
|
else
|
|
|
|
res = -ENOENT;
|
2017-05-25 14:52:56 +02:00
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct inode_operations policy_link_iops = {
|
|
|
|
.readlink = policy_readlink,
|
|
|
|
.get_link = policy_get_link,
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2010-07-29 23:48:03 +02:00
|
|
|
/**
|
|
|
|
* aa_create_aafs - create the apparmor security filesystem
|
|
|
|
*
|
|
|
|
* dentries created here are released by aa_destroy_aafs
|
|
|
|
*
|
|
|
|
* Returns: error on failure
|
|
|
|
*/
|
2011-08-17 03:05:21 +02:00
|
|
|
static int __init aa_create_aafs(void)
|
2010-07-29 23:48:03 +02:00
|
|
|
{
|
2017-01-16 09:42:58 +01:00
|
|
|
struct dentry *dent;
|
2010-07-29 23:48:03 +02:00
|
|
|
int error;
|
|
|
|
|
|
|
|
if (!apparmor_initialized)
|
|
|
|
return 0;
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
if (aa_sfs_entry.dentry) {
|
2010-07-29 23:48:03 +02:00
|
|
|
AA_ERROR("%s: AppArmor securityfs already exists\n", __func__);
|
|
|
|
return -EEXIST;
|
|
|
|
}
|
|
|
|
|
2017-05-25 14:52:56 +02:00
|
|
|
/* setup apparmorfs used to virtualize policy/ */
|
|
|
|
aafs_mnt = kern_mount(&aafs_ops);
|
|
|
|
if (IS_ERR(aafs_mnt))
|
|
|
|
panic("can't set apparmorfs up\n");
|
2017-11-27 22:05:09 +01:00
|
|
|
aafs_mnt->mnt_sb->s_flags &= ~SB_NOUSER;
|
2017-05-25 14:52:56 +02:00
|
|
|
|
2012-01-27 01:29:20 +01:00
|
|
|
/* Populate fs tree. */
|
2017-05-25 15:23:42 +02:00
|
|
|
error = entry_create_dir(&aa_sfs_entry, NULL);
|
2010-07-29 23:48:03 +02:00
|
|
|
if (error)
|
|
|
|
goto error;
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
dent = securityfs_create_file(".load", 0666, aa_sfs_entry.dentry,
|
2017-01-16 09:42:58 +01:00
|
|
|
NULL, &aa_fs_profile_load);
|
2018-02-05 09:58:29 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto dent_error;
|
2017-01-16 09:42:58 +01:00
|
|
|
ns_subload(root_ns) = dent;
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
dent = securityfs_create_file(".replace", 0666, aa_sfs_entry.dentry,
|
2017-01-16 09:42:58 +01:00
|
|
|
NULL, &aa_fs_profile_replace);
|
2018-02-05 09:58:29 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto dent_error;
|
2017-01-16 09:42:58 +01:00
|
|
|
ns_subreplace(root_ns) = dent;
|
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
dent = securityfs_create_file(".remove", 0666, aa_sfs_entry.dentry,
|
2017-01-16 09:42:58 +01:00
|
|
|
NULL, &aa_fs_profile_remove);
|
2018-02-05 09:58:29 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto dent_error;
|
2017-01-16 09:42:58 +01:00
|
|
|
ns_subremove(root_ns) = dent;
|
|
|
|
|
2017-05-27 01:27:58 +02:00
|
|
|
dent = securityfs_create_file("revision", 0444, aa_sfs_entry.dentry,
|
|
|
|
NULL, &aa_fs_ns_revision_fops);
|
2018-02-05 09:58:29 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto dent_error;
|
2017-05-27 01:27:58 +02:00
|
|
|
ns_subrevision(root_ns) = dent;
|
|
|
|
|
|
|
|
/* policy tree referenced by magic policy symlink */
|
2017-11-21 08:24:09 +01:00
|
|
|
mutex_lock_nested(&root_ns->lock, root_ns->level);
|
2017-05-25 15:35:38 +02:00
|
|
|
error = __aafs_ns_mkdir(root_ns, aafs_mnt->mnt_root, ".policy",
|
|
|
|
aafs_mnt->mnt_root);
|
2017-01-16 09:42:58 +01:00
|
|
|
mutex_unlock(&root_ns->lock);
|
2013-07-11 06:13:43 +02:00
|
|
|
if (error)
|
|
|
|
goto error;
|
|
|
|
|
2017-05-25 15:35:38 +02:00
|
|
|
/* magic symlink similar to nsfs redirects based on task policy */
|
|
|
|
dent = securityfs_create_symlink("policy", aa_sfs_entry.dentry,
|
|
|
|
NULL, &policy_link_iops);
|
2018-02-05 09:58:29 +01:00
|
|
|
if (IS_ERR(dent))
|
|
|
|
goto dent_error;
|
2017-05-25 15:35:38 +02:00
|
|
|
|
2017-05-25 15:23:42 +02:00
|
|
|
error = aa_mk_null_file(aa_sfs_entry.dentry);
|
2017-01-16 09:42:45 +01:00
|
|
|
if (error)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
/* TODO: add default profile to apparmorfs */
|
2010-07-29 23:48:03 +02:00
|
|
|
|
|
|
|
/* Report that AppArmor fs is enabled */
|
|
|
|
aa_info_message("AppArmor Filesystem Enabled");
|
|
|
|
return 0;
|
|
|
|
|
2018-02-05 09:58:29 +01:00
|
|
|
dent_error:
|
|
|
|
error = PTR_ERR(dent);
|
2010-07-29 23:48:03 +02:00
|
|
|
error:
|
|
|
|
aa_destroy_aafs();
|
|
|
|
AA_ERROR("Error creating AppArmor securityfs\n");
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
fs_initcall(aa_create_aafs);
|