15  * converted to 32-bit uids/gids using an id look up table.  This table is
16  * stored compressed into metadata blocks.  A second index table is used to
17  * locate these.  This second index table for speed of access (and because it
30  * Map uid/gid index into real 32-bit uid/gid using the id look up table
58  * Read uncompressed id lookup table indexes from disk into memory
66 	__le64 *table;  in squashfs_read_id_index_table()  local
78 	 * The computed size of the index table (length bytes) should exactly  in squashfs_read_id_index_table()
79 	 * match the table start and end points  in squashfs_read_id_index_table()
84 	table = squashfs_read_table(sb, id_table_start, length);  in squashfs_read_id_index_table()
85 	if (IS_ERR(table))  in squashfs_read_id_index_table()
86 		return table;  in squashfs_read_id_index_table()
89 	 * table[0], table[1], ... table[indexes - 1] store the locations  in squashfs_read_id_index_table()
91 	 * the next (i.e. table[0] < table[1]), and the difference between them  in squashfs_read_id_index_table()
92 	 * should be SQUASHFS_METADATA_SIZE or less.  table[indexes - 1]  in squashfs_read_id_index_table()
97 		start = le64_to_cpu(table[n]);  in squashfs_read_id_index_table()
98 		end = le64_to_cpu(table[n + 1]);  in squashfs_read_id_index_table()
102 			kfree(table);  in squashfs_read_id_index_table()
107 	start = le64_to_cpu(table[indexes - 1]);  in squashfs_read_id_index_table()
110 		kfree(table);  in squashfs_read_id_index_table()
114 	return table;  in squashfs_read_id_index_table()