1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
|
/*
* Copyright (c) 2012 Dave Vasilevsky <dave@vasilevsky.ca>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "xattr.h"
#include "fs.h"
#include "nonstd.h"
#include "swap.h"
#include <string.h>
#include <stdlib.h>
#define SQFS_XATTR_PREFIX_MAX SQUASHFS_XATTR_SECURITY
typedef struct {
const char *pref;
size_t len;
} sqfs_prefix;
sqfs_prefix sqfs_xattr_prefixes[] = {
{"user.", 5},
{"trusted.", 8},
{"security.", 9},
};
typedef enum {
CURS_VSIZE = 1,
CURS_VAL = 2,
CURS_NEXT = 4
} sqfs_xattr_curs;
sqfs_err sqfs_xattr_init(sqfs *fs) {
sqfs_off_t start = fs->sb.xattr_id_table_start;
size_t bread;
if (start == SQUASHFS_INVALID_BLK)
return SQFS_OK;
bread = sqfs_pread(fs->fd, &fs->xattr_info, sizeof(fs->xattr_info),
start + fs->offset);
if (bread != sizeof(fs->xattr_info))
return SQFS_ERR;
sqfs_swapin_xattr_id_table(&fs->xattr_info);
return sqfs_table_init(&fs->xattr_table, fs->fd,
start + sizeof(fs->xattr_info) + fs->offset, sizeof(struct squashfs_xattr_id),
fs->xattr_info.xattr_ids);
}
sqfs_err sqfs_xattr_open(sqfs *fs, sqfs_inode *inode, sqfs_xattr *x) {
sqfs_err err;
x->remain = 0; /* assume none exist */
if (fs->xattr_info.xattr_ids == 0 || inode->xattr == SQUASHFS_INVALID_XATTR)
return SQFS_OK;
err = sqfs_table_get(&fs->xattr_table, fs, inode->xattr,
&x->info);
if (err)
return SQFS_ERR;
sqfs_swapin_xattr_id(&x->info);
sqfs_md_cursor_inode(&x->c_next, x->info.xattr,
fs->xattr_info.xattr_table_start);
x->fs = fs;
x->remain = x->info.count;
x->cursors = CURS_NEXT;
return SQFS_OK;
}
sqfs_err sqfs_xattr_read(sqfs_xattr *x) {
sqfs_err err;
if (x->remain == 0)
return SQFS_ERR;
if (!(x->cursors & CURS_NEXT)) {
x->ool = false; /* force inline */
if ((err = sqfs_xattr_value(x, NULL)))
return err;
}
x->c_name = x->c_next;
if ((err = sqfs_md_read(x->fs, &x->c_name, &x->entry, sizeof(x->entry))))
return err;
sqfs_swapin_xattr_entry(&x->entry);
x->type = x->entry.type & SQUASHFS_XATTR_PREFIX_MASK;
x->ool = x->entry.type & SQUASHFS_XATTR_VALUE_OOL;
if (x->type > SQFS_XATTR_PREFIX_MAX)
return SQFS_ERR;
--(x->remain);
x->cursors = 0;
return err;
}
size_t sqfs_xattr_name_size(sqfs_xattr *x) {
return x->entry.size + sqfs_xattr_prefixes[x->type].len;
}
sqfs_err sqfs_xattr_name(sqfs_xattr *x, char *name, bool prefix) {
sqfs_err err;
if (name && prefix) {
sqfs_prefix *p = &sqfs_xattr_prefixes[x->type];
memcpy(name, p->pref, p->len);
name += p->len;
}
x->c_vsize = x->c_name;
err = sqfs_md_read(x->fs, &x->c_vsize, name, x->entry.size);
if (err)
return err;
x->cursors |= CURS_VSIZE;
return err;
}
sqfs_err sqfs_xattr_value_size(sqfs_xattr *x, size_t *size) {
sqfs_err err;
if (!(x->cursors & CURS_VSIZE))
if ((err = sqfs_xattr_name(x, NULL, false)))
return err;
x->c_val = x->c_vsize;
if ((err = sqfs_md_read(x->fs, &x->c_val, &x->val, sizeof(x->val))))
return err;
sqfs_swapin_xattr_val(&x->val);
if (x->ool) {
uint64_t pos;
x->c_next = x->c_val;
if ((err = sqfs_md_read(x->fs, &x->c_next, &pos, sizeof(pos))))
return err;
sqfs_swapin64(&pos);
x->cursors |= CURS_NEXT;
sqfs_md_cursor_inode(&x->c_val, pos,
x->fs->xattr_info.xattr_table_start);
if ((err = sqfs_md_read(x->fs, &x->c_val, &x->val, sizeof(x->val))))
return err;
sqfs_swapin_xattr_val(&x->val);
}
if (size)
*size = x->val.vsize;
x->cursors |= CURS_VAL;
return err;
}
sqfs_err sqfs_xattr_value(sqfs_xattr *x, void *buf) {
sqfs_err err;
sqfs_md_cursor c;
if (!(x->cursors & CURS_VAL))
if ((err = sqfs_xattr_value_size(x, NULL)))
return err;
c = x->c_val;
if ((err = sqfs_md_read(x->fs, &c, buf, x->val.vsize)))
return err;
if (!x->ool) {
x->c_next = c;
x->cursors |= CURS_NEXT;
}
return err;
}
static sqfs_err sqfs_xattr_find_prefix(const char *name, uint16_t *type) {
int i;
for (i = 0; i <= SQFS_XATTR_PREFIX_MAX; ++i) {
sqfs_prefix *p = &sqfs_xattr_prefixes[i];
if (strncmp(name, p->pref, p->len) == 0) {
*type = i;
return SQFS_OK;
}
}
return SQFS_ERR;
}
/* FIXME: Indicate EINVAL, ENOMEM? */
sqfs_err sqfs_xattr_find(sqfs_xattr *x, const char *name, bool *found) {
sqfs_err err;
char *cmp = NULL;
uint16_t type;
size_t len;
if ((err = sqfs_xattr_find_prefix(name, &type))) {
/* Consider an invalid prefix to just be not found, or OS X
* Finder complains. */
*found = false;
return SQFS_OK;
}
name += sqfs_xattr_prefixes[type].len;
len = strlen(name);
if (!(cmp = malloc(len)))
return SQFS_ERR;
while (x->remain) {
if ((err = sqfs_xattr_read(x)))
goto done;
if (x->type != type && x->entry.size != len)
continue;
if ((err = sqfs_xattr_name(x, cmp, false)))
goto done;
if (strncmp(name, cmp, len) == 0) {
*found = true;
goto done;
}
}
*found = false;
done:
free(cmp);
return err;
}
sqfs_err sqfs_xattr_lookup(sqfs *fs, sqfs_inode *inode, const char *name,
void *buf, size_t *size) {
sqfs_err err = SQFS_OK;
sqfs_xattr xattr;
if ((err = sqfs_xattr_open(fs, inode, &xattr)))
return err;
bool found = false;
if ((err = sqfs_xattr_find(&xattr, name, &found)))
return err;
if (!found) {
*size = 0;
return err;
}
size_t real;
if ((err = sqfs_xattr_value_size(&xattr, &real)))
return err;
if (buf && *size >= real) {
if ((err = sqfs_xattr_value(&xattr, buf)))
return err;
}
*size = real;
return err;
}
|