/src/barebox/fs/squashfs/id.c
Line | Count | Source |
1 | | /* |
2 | | * Squashfs - a compressed read only filesystem for Linux |
3 | | * |
4 | | * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008 |
5 | | * Phillip Lougher <phillip@squashfs.org.uk> |
6 | | * |
7 | | * This program is free software; you can redistribute it and/or |
8 | | * modify it under the terms of the GNU General Public License |
9 | | * as published by the Free Software Foundation; either version 2, |
10 | | * or (at your option) any later version. |
11 | | * |
12 | | * This program is distributed in the hope that it will be useful, |
13 | | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | | * GNU General Public License for more details. |
16 | | * |
17 | | * id.c |
18 | | */ |
19 | | |
20 | | /* |
21 | | * This file implements code to handle uids and gids. |
22 | | * |
23 | | * For space efficiency regular files store uid and gid indexes, which are |
24 | | * converted to 32-bit uids/gids using an id look up table. This table is |
25 | | * stored compressed into metadata blocks. A second index table is used to |
26 | | * locate these. This second index table for speed of access (and because it |
27 | | * is small) is read at mount time and cached in memory. |
28 | | */ |
29 | | |
30 | | #include <linux/barebox-wrapper.h> |
31 | | #include <linux/fs.h> |
32 | | #include <malloc.h> |
33 | | |
34 | | #include "squashfs_fs.h" |
35 | | #include "squashfs_fs_sb.h" |
36 | | #include "squashfs.h" |
37 | | |
38 | | /* |
39 | | * Map uid/gid index into real 32-bit uid/gid using the id look up table |
40 | | */ |
41 | | int squashfs_get_id(struct super_block *sb, unsigned int index, |
42 | | unsigned int *id) |
43 | 0 | { |
44 | 0 | struct squashfs_sb_info *msblk = sb->s_fs_info; |
45 | 0 | int block = SQUASHFS_ID_BLOCK(index); |
46 | 0 | int offset = SQUASHFS_ID_BLOCK_OFFSET(index); |
47 | 0 | u64 start_block = le64_to_cpu(msblk->id_table[block]); |
48 | 0 | __le32 disk_id; |
49 | 0 | int err; |
50 | |
|
51 | 0 | err = squashfs_read_metadata(sb, &disk_id, &start_block, &offset, |
52 | 0 | sizeof(disk_id)); |
53 | 0 | if (err < 0) |
54 | 0 | return err; |
55 | | |
56 | 0 | *id = le32_to_cpu(disk_id); |
57 | 0 | return 0; |
58 | 0 | } |
59 | | |
60 | | |
61 | | /* |
62 | | * Read uncompressed id lookup table indexes from disk into memory |
63 | | */ |
64 | | __le64 *squashfs_read_id_index_table(struct super_block *sb, |
65 | | u64 id_table_start, u64 next_table, unsigned short no_ids) |
66 | 0 | { |
67 | 0 | unsigned int length = SQUASHFS_ID_BLOCK_BYTES(no_ids); |
68 | 0 | __le64 *table; |
69 | |
|
70 | 0 | TRACE("In read_id_index_table, length %d\n", length); |
71 | | |
72 | | /* Sanity check values */ |
73 | | |
74 | | /* there should always be at least one id */ |
75 | 0 | if (no_ids == 0) |
76 | 0 | return ERR_PTR(-EINVAL); |
77 | | |
78 | | /* |
79 | | * length bytes should not extend into the next table - this check |
80 | | * also traps instances where id_table_start is incorrectly larger |
81 | | * than the next table start |
82 | | */ |
83 | 0 | if (id_table_start + length > next_table) |
84 | 0 | return ERR_PTR(-EINVAL); |
85 | | |
86 | 0 | table = squashfs_read_table(sb, id_table_start, length); |
87 | | |
88 | | /* |
89 | | * table[0] points to the first id lookup table metadata block, this |
90 | | * should be less than id_table_start |
91 | | */ |
92 | 0 | if (!IS_ERR(table) && le64_to_cpu(table[0]) >= id_table_start) { |
93 | 0 | kfree(table); |
94 | 0 | return ERR_PTR(-EINVAL); |
95 | 0 | } |
96 | | |
97 | 0 | return table; |
98 | 0 | } |