1 // SPDX-License-Identifier: GPL-2.0-or-later 1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* 2 /*
3 * Squashfs - a compressed read only filesyste 3 * Squashfs - a compressed read only filesystem for Linux
4 * 4 *
5 * Copyright (c) 2002, 2003, 2004, 2005, 2006, 5 * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008
6 * Phillip Lougher <phillip@squashfs.org.uk> 6 * Phillip Lougher <phillip@squashfs.org.uk>
7 * 7 *
8 * cache.c 8 * cache.c
9 */ 9 */
10 10
11 /* 11 /*
12 * Blocks in Squashfs are compressed. To avoi 12 * Blocks in Squashfs are compressed. To avoid repeatedly decompressing
13 * recently accessed data Squashfs uses two sm 13 * recently accessed data Squashfs uses two small metadata and fragment caches.
14 * 14 *
15 * This file implements a generic cache implem 15 * This file implements a generic cache implementation used for both caches,
16 * plus functions layered ontop of the generic 16 * plus functions layered ontop of the generic cache implementation to
17 * access the metadata and fragment caches. 17 * access the metadata and fragment caches.
18 * 18 *
19 * To avoid out of memory and fragmentation is 19 * To avoid out of memory and fragmentation issues with vmalloc the cache
20 * uses sequences of kmalloced PAGE_SIZE buffe 20 * uses sequences of kmalloced PAGE_SIZE buffers.
21 * 21 *
22 * It should be noted that the cache is not us 22 * It should be noted that the cache is not used for file datablocks, these
23 * are decompressed and cached in the page-cac 23 * are decompressed and cached in the page-cache in the normal way. The
24 * cache is only used to temporarily cache fra 24 * cache is only used to temporarily cache fragment and metadata blocks
25 * which have been read as as a result of a me 25 * which have been read as as a result of a metadata (i.e. inode or
26 * directory) or fragment access. Because met 26 * directory) or fragment access. Because metadata and fragments are packed
27 * together into blocks (to gain greater compr 27 * together into blocks (to gain greater compression) the read of a particular
28 * piece of metadata or fragment will retrieve 28 * piece of metadata or fragment will retrieve other metadata/fragments which
29 * have been packed with it, these because of 29 * have been packed with it, these because of locality-of-reference may be read
30 * in the near future. Temporarily caching the 30 * in the near future. Temporarily caching them ensures they are available for
31 * near future access without requiring an add 31 * near future access without requiring an additional read and decompress.
32 */ 32 */
33 33
34 #include <linux/fs.h> 34 #include <linux/fs.h>
35 #include <linux/vfs.h> 35 #include <linux/vfs.h>
36 #include <linux/slab.h> 36 #include <linux/slab.h>
37 #include <linux/vmalloc.h> 37 #include <linux/vmalloc.h>
38 #include <linux/sched.h> 38 #include <linux/sched.h>
39 #include <linux/spinlock.h> 39 #include <linux/spinlock.h>
40 #include <linux/wait.h> 40 #include <linux/wait.h>
41 #include <linux/pagemap.h> 41 #include <linux/pagemap.h>
42 42
43 #include "squashfs_fs.h" 43 #include "squashfs_fs.h"
44 #include "squashfs_fs_sb.h" 44 #include "squashfs_fs_sb.h"
45 #include "squashfs.h" 45 #include "squashfs.h"
46 #include "page_actor.h" 46 #include "page_actor.h"
47 47
48 /* 48 /*
49 * Look-up block in cache, and increment usage 49 * Look-up block in cache, and increment usage count. If not in cache, read
50 * and decompress it from disk. 50 * and decompress it from disk.
51 */ 51 */
52 struct squashfs_cache_entry *squashfs_cache_ge 52 struct squashfs_cache_entry *squashfs_cache_get(struct super_block *sb,
53 struct squashfs_cache *cache, u64 bloc 53 struct squashfs_cache *cache, u64 block, int length)
54 { 54 {
55 int i, n; 55 int i, n;
56 struct squashfs_cache_entry *entry; 56 struct squashfs_cache_entry *entry;
57 57
58 spin_lock(&cache->lock); 58 spin_lock(&cache->lock);
59 59
60 while (1) { 60 while (1) {
61 for (i = cache->curr_blk, n = 61 for (i = cache->curr_blk, n = 0; n < cache->entries; n++) {
62 if (cache->entry[i].bl 62 if (cache->entry[i].block == block) {
63 cache->curr_bl 63 cache->curr_blk = i;
64 break; 64 break;
65 } 65 }
66 i = (i + 1) % cache->e 66 i = (i + 1) % cache->entries;
67 } 67 }
68 68
69 if (n == cache->entries) { 69 if (n == cache->entries) {
70 /* 70 /*
71 * Block not in cache, 71 * Block not in cache, if all cache entries are used
72 * go to sleep waiting 72 * go to sleep waiting for one to become available.
73 */ 73 */
74 if (cache->unused == 0 74 if (cache->unused == 0) {
75 cache->num_wai 75 cache->num_waiters++;
76 spin_unlock(&c 76 spin_unlock(&cache->lock);
77 wait_event(cac 77 wait_event(cache->wait_queue, cache->unused);
78 spin_lock(&cac 78 spin_lock(&cache->lock);
79 cache->num_wai 79 cache->num_waiters--;
80 continue; 80 continue;
81 } 81 }
82 82
83 /* 83 /*
84 * At least one unused 84 * At least one unused cache entry. A simple
85 * round-robin strateg 85 * round-robin strategy is used to choose the entry to
86 * be evicted from the 86 * be evicted from the cache.
87 */ 87 */
88 i = cache->next_blk; 88 i = cache->next_blk;
89 for (n = 0; n < cache- 89 for (n = 0; n < cache->entries; n++) {
90 if (cache->ent 90 if (cache->entry[i].refcount == 0)
91 break; 91 break;
92 i = (i + 1) % 92 i = (i + 1) % cache->entries;
93 } 93 }
94 94
95 cache->next_blk = (i + 95 cache->next_blk = (i + 1) % cache->entries;
96 entry = &cache->entry[ 96 entry = &cache->entry[i];
97 97
98 /* 98 /*
99 * Initialise chosen c 99 * Initialise chosen cache entry, and fill it in from
100 * disk. 100 * disk.
101 */ 101 */
102 cache->unused--; 102 cache->unused--;
103 entry->block = block; 103 entry->block = block;
104 entry->refcount = 1; 104 entry->refcount = 1;
105 entry->pending = 1; 105 entry->pending = 1;
106 entry->num_waiters = 0 106 entry->num_waiters = 0;
107 entry->error = 0; 107 entry->error = 0;
108 spin_unlock(&cache->lo 108 spin_unlock(&cache->lock);
109 109
110 entry->length = squash 110 entry->length = squashfs_read_data(sb, block, length,
111 &entry->next_i 111 &entry->next_index, entry->actor);
112 112
113 spin_lock(&cache->lock 113 spin_lock(&cache->lock);
114 114
115 if (entry->length < 0) 115 if (entry->length < 0)
116 entry->error = 116 entry->error = entry->length;
117 117
118 entry->pending = 0; 118 entry->pending = 0;
119 119
120 /* 120 /*
121 * While filling this 121 * While filling this entry one or more other processes
122 * have looked it up i 122 * have looked it up in the cache, and have slept
123 * waiting for it to b 123 * waiting for it to become available.
124 */ 124 */
125 if (entry->num_waiters 125 if (entry->num_waiters) {
126 spin_unlock(&c 126 spin_unlock(&cache->lock);
127 wake_up_all(&e 127 wake_up_all(&entry->wait_queue);
128 } else 128 } else
129 spin_unlock(&c 129 spin_unlock(&cache->lock);
130 130
131 goto out; 131 goto out;
132 } 132 }
133 133
134 /* 134 /*
135 * Block already in cache. In 135 * Block already in cache. Increment refcount so it doesn't
136 * get reused until we're fini 136 * get reused until we're finished with it, if it was
137 * previously unused there's o 137 * previously unused there's one less cache entry available
138 * for reuse. 138 * for reuse.
139 */ 139 */
140 entry = &cache->entry[i]; 140 entry = &cache->entry[i];
141 if (entry->refcount == 0) 141 if (entry->refcount == 0)
142 cache->unused--; 142 cache->unused--;
143 entry->refcount++; 143 entry->refcount++;
144 144
145 /* 145 /*
146 * If the entry is currently b 146 * If the entry is currently being filled in by another process
147 * go to sleep waiting for it 147 * go to sleep waiting for it to become available.
148 */ 148 */
149 if (entry->pending) { 149 if (entry->pending) {
150 entry->num_waiters++; 150 entry->num_waiters++;
151 spin_unlock(&cache->lo 151 spin_unlock(&cache->lock);
152 wait_event(entry->wait 152 wait_event(entry->wait_queue, !entry->pending);
153 } else 153 } else
154 spin_unlock(&cache->lo 154 spin_unlock(&cache->lock);
155 155
156 goto out; 156 goto out;
157 } 157 }
158 158
159 out: 159 out:
160 TRACE("Got %s %d, start block %lld, re 160 TRACE("Got %s %d, start block %lld, refcount %d, error %d\n",
161 cache->name, i, entry->block, 161 cache->name, i, entry->block, entry->refcount, entry->error);
162 162
163 if (entry->error) 163 if (entry->error)
164 ERROR("Unable to read %s cache 164 ERROR("Unable to read %s cache entry [%llx]\n", cache->name,
165 165 block);
166 return entry; 166 return entry;
167 } 167 }
168 168
169 169
170 /* 170 /*
171 * Release cache entry, once usage count is ze 171 * Release cache entry, once usage count is zero it can be reused.
172 */ 172 */
173 void squashfs_cache_put(struct squashfs_cache_ 173 void squashfs_cache_put(struct squashfs_cache_entry *entry)
174 { 174 {
175 struct squashfs_cache *cache = entry-> 175 struct squashfs_cache *cache = entry->cache;
176 176
177 spin_lock(&cache->lock); 177 spin_lock(&cache->lock);
178 entry->refcount--; 178 entry->refcount--;
179 if (entry->refcount == 0) { 179 if (entry->refcount == 0) {
180 cache->unused++; 180 cache->unused++;
181 /* 181 /*
182 * If there's any processes wa 182 * If there's any processes waiting for a block to become
183 * available, wake one up. 183 * available, wake one up.
184 */ 184 */
185 if (cache->num_waiters) { 185 if (cache->num_waiters) {
186 spin_unlock(&cache->lo 186 spin_unlock(&cache->lock);
187 wake_up(&cache->wait_q 187 wake_up(&cache->wait_queue);
188 return; 188 return;
189 } 189 }
190 } 190 }
191 spin_unlock(&cache->lock); 191 spin_unlock(&cache->lock);
192 } 192 }
193 193
194 /* 194 /*
195 * Delete cache reclaiming all kmalloced buffe 195 * Delete cache reclaiming all kmalloced buffers.
196 */ 196 */
197 void squashfs_cache_delete(struct squashfs_cac 197 void squashfs_cache_delete(struct squashfs_cache *cache)
198 { 198 {
199 int i, j; 199 int i, j;
200 200
201 if (cache == NULL) 201 if (cache == NULL)
202 return; 202 return;
203 203
204 for (i = 0; i < cache->entries; i++) { 204 for (i = 0; i < cache->entries; i++) {
205 if (cache->entry[i].data) { 205 if (cache->entry[i].data) {
206 for (j = 0; j < cache- 206 for (j = 0; j < cache->pages; j++)
207 kfree(cache->e 207 kfree(cache->entry[i].data[j]);
208 kfree(cache->entry[i]. 208 kfree(cache->entry[i].data);
209 } 209 }
210 kfree(cache->entry[i].actor); 210 kfree(cache->entry[i].actor);
211 } 211 }
212 212
213 kfree(cache->entry); 213 kfree(cache->entry);
214 kfree(cache); 214 kfree(cache);
215 } 215 }
216 216
217 217
218 /* 218 /*
219 * Initialise cache allocating the specified n 219 * Initialise cache allocating the specified number of entries, each of
220 * size block_size. To avoid vmalloc fragment 220 * size block_size. To avoid vmalloc fragmentation issues each entry
221 * is allocated as a sequence of kmalloced PAG 221 * is allocated as a sequence of kmalloced PAGE_SIZE buffers.
222 */ 222 */
223 struct squashfs_cache *squashfs_cache_init(cha 223 struct squashfs_cache *squashfs_cache_init(char *name, int entries,
224 int block_size) 224 int block_size)
225 { 225 {
226 int i, j; 226 int i, j;
227 struct squashfs_cache *cache = kzalloc 227 struct squashfs_cache *cache = kzalloc(sizeof(*cache), GFP_KERNEL);
228 228
229 if (cache == NULL) { 229 if (cache == NULL) {
230 ERROR("Failed to allocate %s c 230 ERROR("Failed to allocate %s cache\n", name);
231 return NULL; 231 return NULL;
232 } 232 }
233 233
234 cache->entry = kcalloc(entries, sizeof 234 cache->entry = kcalloc(entries, sizeof(*(cache->entry)), GFP_KERNEL);
235 if (cache->entry == NULL) { 235 if (cache->entry == NULL) {
236 ERROR("Failed to allocate %s c 236 ERROR("Failed to allocate %s cache\n", name);
237 goto cleanup; 237 goto cleanup;
238 } 238 }
239 239
240 cache->curr_blk = 0; 240 cache->curr_blk = 0;
241 cache->next_blk = 0; 241 cache->next_blk = 0;
242 cache->unused = entries; 242 cache->unused = entries;
243 cache->entries = entries; 243 cache->entries = entries;
244 cache->block_size = block_size; 244 cache->block_size = block_size;
245 cache->pages = block_size >> PAGE_SHIF 245 cache->pages = block_size >> PAGE_SHIFT;
246 cache->pages = cache->pages ? cache->p 246 cache->pages = cache->pages ? cache->pages : 1;
247 cache->name = name; 247 cache->name = name;
248 cache->num_waiters = 0; 248 cache->num_waiters = 0;
249 spin_lock_init(&cache->lock); 249 spin_lock_init(&cache->lock);
250 init_waitqueue_head(&cache->wait_queue 250 init_waitqueue_head(&cache->wait_queue);
251 251
252 for (i = 0; i < entries; i++) { 252 for (i = 0; i < entries; i++) {
253 struct squashfs_cache_entry *e 253 struct squashfs_cache_entry *entry = &cache->entry[i];
254 254
255 init_waitqueue_head(&cache->en 255 init_waitqueue_head(&cache->entry[i].wait_queue);
256 entry->cache = cache; 256 entry->cache = cache;
257 entry->block = SQUASHFS_INVALI 257 entry->block = SQUASHFS_INVALID_BLK;
258 entry->data = kcalloc(cache->p 258 entry->data = kcalloc(cache->pages, sizeof(void *), GFP_KERNEL);
259 if (entry->data == NULL) { 259 if (entry->data == NULL) {
260 ERROR("Failed to alloc 260 ERROR("Failed to allocate %s cache entry\n", name);
261 goto cleanup; 261 goto cleanup;
262 } 262 }
263 263
264 for (j = 0; j < cache->pages; 264 for (j = 0; j < cache->pages; j++) {
265 entry->data[j] = kmall 265 entry->data[j] = kmalloc(PAGE_SIZE, GFP_KERNEL);
266 if (entry->data[j] == 266 if (entry->data[j] == NULL) {
267 ERROR("Failed 267 ERROR("Failed to allocate %s buffer\n", name);
268 goto cleanup; 268 goto cleanup;
269 } 269 }
270 } 270 }
271 271
272 entry->actor = squashfs_page_a 272 entry->actor = squashfs_page_actor_init(entry->data,
273 273 cache->pages, 0);
274 if (entry->actor == NULL) { 274 if (entry->actor == NULL) {
275 ERROR("Failed to alloc 275 ERROR("Failed to allocate %s cache entry\n", name);
276 goto cleanup; 276 goto cleanup;
277 } 277 }
278 } 278 }
279 279
280 return cache; 280 return cache;
281 281
282 cleanup: 282 cleanup:
283 squashfs_cache_delete(cache); 283 squashfs_cache_delete(cache);
284 return NULL; 284 return NULL;
285 } 285 }
286 286
287 287
288 /* 288 /*
289 * Copy up to length bytes from cache entry to 289 * Copy up to length bytes from cache entry to buffer starting at offset bytes
290 * into the cache entry. If there's not lengt 290 * into the cache entry. If there's not length bytes then copy the number of
291 * bytes available. In all cases return the n 291 * bytes available. In all cases return the number of bytes copied.
292 */ 292 */
293 int squashfs_copy_data(void *buffer, struct sq 293 int squashfs_copy_data(void *buffer, struct squashfs_cache_entry *entry,
294 int offset, int length) 294 int offset, int length)
295 { 295 {
296 int remaining = length; 296 int remaining = length;
297 297
298 if (length == 0) 298 if (length == 0)
299 return 0; 299 return 0;
300 else if (buffer == NULL) 300 else if (buffer == NULL)
301 return min(length, entry->leng 301 return min(length, entry->length - offset);
302 302
303 while (offset < entry->length) { 303 while (offset < entry->length) {
304 void *buff = entry->data[offse 304 void *buff = entry->data[offset / PAGE_SIZE]
305 + (offset % PA 305 + (offset % PAGE_SIZE);
306 int bytes = min_t(int, entry-> 306 int bytes = min_t(int, entry->length - offset,
307 PAGE_SIZE - (o 307 PAGE_SIZE - (offset % PAGE_SIZE));
308 308
309 if (bytes >= remaining) { 309 if (bytes >= remaining) {
310 memcpy(buffer, buff, r 310 memcpy(buffer, buff, remaining);
311 remaining = 0; 311 remaining = 0;
312 break; 312 break;
313 } 313 }
314 314
315 memcpy(buffer, buff, bytes); 315 memcpy(buffer, buff, bytes);
316 buffer += bytes; 316 buffer += bytes;
317 remaining -= bytes; 317 remaining -= bytes;
318 offset += bytes; 318 offset += bytes;
319 } 319 }
320 320
321 return length - remaining; 321 return length - remaining;
322 } 322 }
323 323
324 324
325 /* 325 /*
326 * Read length bytes from metadata position <b 326 * Read length bytes from metadata position <block, offset> (block is the
327 * start of the compressed block on disk, and 327 * start of the compressed block on disk, and offset is the offset into
328 * the block once decompressed). Data is pack 328 * the block once decompressed). Data is packed into consecutive blocks,
329 * and length bytes may require reading more t 329 * and length bytes may require reading more than one block.
330 */ 330 */
331 int squashfs_read_metadata(struct super_block 331 int squashfs_read_metadata(struct super_block *sb, void *buffer,
332 u64 *block, int *offset, int l 332 u64 *block, int *offset, int length)
333 { 333 {
334 struct squashfs_sb_info *msblk = sb->s 334 struct squashfs_sb_info *msblk = sb->s_fs_info;
335 int bytes, res = length; 335 int bytes, res = length;
336 struct squashfs_cache_entry *entry; 336 struct squashfs_cache_entry *entry;
337 337
338 TRACE("Entered squashfs_read_metadata 338 TRACE("Entered squashfs_read_metadata [%llx:%x]\n", *block, *offset);
339 339
340 if (unlikely(length < 0)) 340 if (unlikely(length < 0))
341 return -EIO; 341 return -EIO;
342 342
343 while (length) { 343 while (length) {
344 entry = squashfs_cache_get(sb, 344 entry = squashfs_cache_get(sb, msblk->block_cache, *block, 0);
345 if (entry->error) { 345 if (entry->error) {
346 res = entry->error; 346 res = entry->error;
347 goto error; 347 goto error;
348 } else if (*offset >= entry->l 348 } else if (*offset >= entry->length) {
349 res = -EIO; 349 res = -EIO;
350 goto error; 350 goto error;
351 } 351 }
352 352
353 bytes = squashfs_copy_data(buf 353 bytes = squashfs_copy_data(buffer, entry, *offset, length);
354 if (buffer) 354 if (buffer)
355 buffer += bytes; 355 buffer += bytes;
356 length -= bytes; 356 length -= bytes;
357 *offset += bytes; 357 *offset += bytes;
358 358
359 if (*offset == entry->length) 359 if (*offset == entry->length) {
360 *block = entry->next_i 360 *block = entry->next_index;
361 *offset = 0; 361 *offset = 0;
362 } 362 }
363 363
364 squashfs_cache_put(entry); 364 squashfs_cache_put(entry);
365 } 365 }
366 366
367 return res; 367 return res;
368 368
369 error: 369 error:
370 squashfs_cache_put(entry); 370 squashfs_cache_put(entry);
371 return res; 371 return res;
372 } 372 }
373 373
374 374
375 /* 375 /*
376 * Look-up in the fragmment cache the fragment 376 * Look-up in the fragmment cache the fragment located at <start_block> in the
377 * filesystem. If necessary read and decompre 377 * filesystem. If necessary read and decompress it from disk.
378 */ 378 */
379 struct squashfs_cache_entry *squashfs_get_frag 379 struct squashfs_cache_entry *squashfs_get_fragment(struct super_block *sb,
380 u64 start_bloc 380 u64 start_block, int length)
381 { 381 {
382 struct squashfs_sb_info *msblk = sb->s 382 struct squashfs_sb_info *msblk = sb->s_fs_info;
383 383
384 return squashfs_cache_get(sb, msblk->f 384 return squashfs_cache_get(sb, msblk->fragment_cache, start_block,
385 length); 385 length);
386 } 386 }
387 387
388 388
389 /* 389 /*
390 * Read and decompress the datablock located a 390 * Read and decompress the datablock located at <start_block> in the
391 * filesystem. The cache is used here to avoi 391 * filesystem. The cache is used here to avoid duplicating locking and
392 * read/decompress code. 392 * read/decompress code.
393 */ 393 */
394 struct squashfs_cache_entry *squashfs_get_data 394 struct squashfs_cache_entry *squashfs_get_datablock(struct super_block *sb,
395 u64 start_bloc 395 u64 start_block, int length)
396 { 396 {
397 struct squashfs_sb_info *msblk = sb->s 397 struct squashfs_sb_info *msblk = sb->s_fs_info;
398 398
399 return squashfs_cache_get(sb, msblk->r 399 return squashfs_cache_get(sb, msblk->read_page, start_block, length);
400 } 400 }
401 401
402 402
403 /* 403 /*
404 * Read a filesystem table (uncompressed seque 404 * Read a filesystem table (uncompressed sequence of bytes) from disk
405 */ 405 */
406 void *squashfs_read_table(struct super_block * 406 void *squashfs_read_table(struct super_block *sb, u64 block, int length)
407 { 407 {
408 int pages = (length + PAGE_SIZE - 1) > 408 int pages = (length + PAGE_SIZE - 1) >> PAGE_SHIFT;
409 int i, res; 409 int i, res;
410 void *table, *buffer, **data; 410 void *table, *buffer, **data;
411 struct squashfs_page_actor *actor; 411 struct squashfs_page_actor *actor;
412 412
413 table = buffer = kmalloc(length, GFP_K 413 table = buffer = kmalloc(length, GFP_KERNEL);
414 if (table == NULL) 414 if (table == NULL)
415 return ERR_PTR(-ENOMEM); 415 return ERR_PTR(-ENOMEM);
416 416
417 data = kcalloc(pages, sizeof(void *), 417 data = kcalloc(pages, sizeof(void *), GFP_KERNEL);
418 if (data == NULL) { 418 if (data == NULL) {
419 res = -ENOMEM; 419 res = -ENOMEM;
420 goto failed; 420 goto failed;
421 } 421 }
422 422
423 actor = squashfs_page_actor_init(data, 423 actor = squashfs_page_actor_init(data, pages, length);
424 if (actor == NULL) { 424 if (actor == NULL) {
425 res = -ENOMEM; 425 res = -ENOMEM;
426 goto failed2; 426 goto failed2;
427 } 427 }
428 428
429 for (i = 0; i < pages; i++, buffer += 429 for (i = 0; i < pages; i++, buffer += PAGE_SIZE)
430 data[i] = buffer; 430 data[i] = buffer;
431 431
432 res = squashfs_read_data(sb, block, le 432 res = squashfs_read_data(sb, block, length |
433 SQUASHFS_COMPRESSED_BIT_BLOCK, 433 SQUASHFS_COMPRESSED_BIT_BLOCK, NULL, actor);
434 434
435 kfree(data); 435 kfree(data);
436 kfree(actor); 436 kfree(actor);
437 437
438 if (res < 0) 438 if (res < 0)
439 goto failed; 439 goto failed;
440 440
441 return table; 441 return table;
442 442
443 failed2: 443 failed2:
444 kfree(data); 444 kfree(data);
445 failed: 445 failed:
446 kfree(table); 446 kfree(table);
447 return ERR_PTR(res); 447 return ERR_PTR(res);
448 } 448 }
449 449
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.