1 // SPDX-License-Identifier: GPL-2.0-or-later <<
2 /* 1 /*
3 * Squashfs - a compressed read only filesyste 2 * Squashfs - a compressed read only filesystem for Linux
4 * 3 *
5 * Copyright (c) 2010 4 * Copyright (c) 2010
6 * Phillip Lougher <phillip@squashfs.org.uk> 5 * Phillip Lougher <phillip@squashfs.org.uk>
7 * 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 * You should have received a copy of the GNU General Public License
>> 18 * along with this program; if not, write to the Free Software
>> 19 * Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
>> 20 *
8 * xattr_id.c 21 * xattr_id.c
9 */ 22 */
10 23
11 /* 24 /*
12 * This file implements code to map the 32-bit 25 * This file implements code to map the 32-bit xattr id stored in the inode
13 * into the on disk location of the xattr data 26 * into the on disk location of the xattr data.
14 */ 27 */
15 28
16 #include <linux/fs.h> 29 #include <linux/fs.h>
17 #include <linux/vfs.h> 30 #include <linux/vfs.h>
18 #include <linux/slab.h> 31 #include <linux/slab.h>
19 32
20 #include "squashfs_fs.h" 33 #include "squashfs_fs.h"
21 #include "squashfs_fs_sb.h" 34 #include "squashfs_fs_sb.h"
22 #include "squashfs.h" 35 #include "squashfs.h"
23 #include "xattr.h" 36 #include "xattr.h"
24 37
25 /* 38 /*
26 * Map xattr id using the xattr id look up tab 39 * Map xattr id using the xattr id look up table
27 */ 40 */
28 int squashfs_xattr_lookup(struct super_block * 41 int squashfs_xattr_lookup(struct super_block *sb, unsigned int index,
29 int *count, unsigned int *size 42 int *count, unsigned int *size, unsigned long long *xattr)
30 { 43 {
31 struct squashfs_sb_info *msblk = sb->s 44 struct squashfs_sb_info *msblk = sb->s_fs_info;
32 int block = SQUASHFS_XATTR_BLOCK(index 45 int block = SQUASHFS_XATTR_BLOCK(index);
33 int offset = SQUASHFS_XATTR_BLOCK_OFFS 46 int offset = SQUASHFS_XATTR_BLOCK_OFFSET(index);
34 u64 start_block; !! 47 u64 start_block = le64_to_cpu(msblk->xattr_id_table[block]);
35 struct squashfs_xattr_id id; 48 struct squashfs_xattr_id id;
36 int err; 49 int err;
37 50
38 if (index >= msblk->xattr_ids) <<
39 return -EINVAL; <<
40 <<
41 start_block = le64_to_cpu(msblk->xattr <<
42 <<
43 err = squashfs_read_metadata(sb, &id, 51 err = squashfs_read_metadata(sb, &id, &start_block, &offset,
44 52 sizeof(id));
45 if (err < 0) 53 if (err < 0)
46 return err; 54 return err;
47 55
48 *xattr = le64_to_cpu(id.xattr); 56 *xattr = le64_to_cpu(id.xattr);
49 *size = le32_to_cpu(id.size); 57 *size = le32_to_cpu(id.size);
50 *count = le32_to_cpu(id.count); 58 *count = le32_to_cpu(id.count);
51 return 0; 59 return 0;
52 } 60 }
53 61
54 62
55 /* 63 /*
56 * Read uncompressed xattr id lookup table ind 64 * Read uncompressed xattr id lookup table indexes from disk into memory
57 */ 65 */
58 __le64 *squashfs_read_xattr_id_table(struct su !! 66 __le64 *squashfs_read_xattr_id_table(struct super_block *sb, u64 start,
59 u64 *xattr_table_start, unsign !! 67 u64 *xattr_table_start, int *xattr_ids)
60 { 68 {
61 struct squashfs_sb_info *msblk = sb->s !! 69 unsigned int len;
62 unsigned int len, indexes; <<
63 struct squashfs_xattr_id_table *id_tab 70 struct squashfs_xattr_id_table *id_table;
64 __le64 *table; <<
65 u64 start, end; <<
66 int n; <<
67 71
68 id_table = squashfs_read_table(sb, tab !! 72 id_table = squashfs_read_table(sb, start, sizeof(*id_table));
69 if (IS_ERR(id_table)) 73 if (IS_ERR(id_table))
70 return (__le64 *) id_table; 74 return (__le64 *) id_table;
71 75
72 *xattr_table_start = le64_to_cpu(id_ta 76 *xattr_table_start = le64_to_cpu(id_table->xattr_table_start);
73 *xattr_ids = le32_to_cpu(id_table->xat 77 *xattr_ids = le32_to_cpu(id_table->xattr_ids);
74 kfree(id_table); 78 kfree(id_table);
75 79
76 /* Sanity check values */ 80 /* Sanity check values */
77 81
78 /* there is always at least one xattr 82 /* there is always at least one xattr id */
79 if (*xattr_ids == 0) 83 if (*xattr_ids == 0)
80 return ERR_PTR(-EINVAL); 84 return ERR_PTR(-EINVAL);
81 85
82 len = SQUASHFS_XATTR_BLOCK_BYTES(*xatt !! 86 /* xattr_table should be less than start */
83 indexes = SQUASHFS_XATTR_BLOCKS(*xattr !! 87 if (*xattr_table_start >= start)
84 <<
85 /* <<
86 * The computed size of the index tabl <<
87 * match the table start and end point <<
88 */ <<
89 start = table_start + sizeof(*id_table <<
90 end = msblk->bytes_used; <<
91 <<
92 if (len != (end - start)) <<
93 return ERR_PTR(-EINVAL); 88 return ERR_PTR(-EINVAL);
94 89
95 table = squashfs_read_table(sb, start, !! 90 len = SQUASHFS_XATTR_BLOCK_BYTES(*xattr_ids);
96 if (IS_ERR(table)) <<
97 return table; <<
98 <<
99 /* table[0], table[1], ... table[index <<
100 * of the compressed xattr id blocks. <<
101 * the next (i.e. table[0] < table[1]) <<
102 * should be SQUASHFS_METADATA_SIZE or <<
103 * should be less than table_start, an <<
104 * shouls be SQUASHFS_METADATA_SIZE or <<
105 * <<
106 * Finally xattr_table_start should be <<
107 */ <<
108 for (n = 0; n < (indexes - 1); n++) { <<
109 start = le64_to_cpu(table[n]); <<
110 end = le64_to_cpu(table[n + 1] <<
111 <<
112 if (start >= end || (end - sta <<
113 (SQUASHFS_META <<
114 kfree(table); <<
115 return ERR_PTR(-EINVAL <<
116 } <<
117 } <<
118 <<
119 start = le64_to_cpu(table[indexes - 1] <<
120 if (start >= table_start || (table_sta <<
121 (SQUASHFS_META <<
122 kfree(table); <<
123 return ERR_PTR(-EINVAL); <<
124 } <<
125 91
126 if (*xattr_table_start >= le64_to_cpu( !! 92 TRACE("In read_xattr_index_table, length %d\n", len);
127 kfree(table); <<
128 return ERR_PTR(-EINVAL); <<
129 } <<
130 93
131 return table; !! 94 return squashfs_read_table(sb, start + sizeof(*id_table), len);
132 } 95 }
133 96
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.