blob: 32b911f4ee39e859d9a03d7b68b8ef7e33e11552 [file] [log] [blame]
Phillip Lougher1dc4bba2009-01-05 08:46:24 +00001/*
2 * Squashfs - a compressed read only filesystem for Linux
3 *
4 * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008
5 * Phillip Lougher <phillip@lougher.demon.co.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 * 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 *
21 * symlink.c
22 */
23
24/*
25 * This file implements code to handle symbolic links.
26 *
27 * The data contents of symbolic links are stored inside the symbolic
28 * link inode within the inode table. This allows the normally small symbolic
29 * link to be compressed as part of the inode table, achieving much greater
30 * compression than if the symbolic link was compressed individually.
31 */
32
33#include <linux/fs.h>
34#include <linux/vfs.h>
35#include <linux/kernel.h>
Phillip Lougher1dc4bba2009-01-05 08:46:24 +000036#include <linux/string.h>
37#include <linux/pagemap.h>
Phillip Lougher1dc4bba2009-01-05 08:46:24 +000038
39#include "squashfs_fs.h"
40#include "squashfs_fs_sb.h"
41#include "squashfs_fs_i.h"
42#include "squashfs.h"
43
44static int squashfs_symlink_readpage(struct file *file, struct page *page)
45{
46 struct inode *inode = page->mapping->host;
47 struct super_block *sb = inode->i_sb;
48 struct squashfs_sb_info *msblk = sb->s_fs_info;
49 int index = page->index << PAGE_CACHE_SHIFT;
50 u64 block = squashfs_i(inode)->start;
51 int offset = squashfs_i(inode)->offset;
52 int length = min_t(int, i_size_read(inode) - index, PAGE_CACHE_SIZE);
53 int bytes, copied;
54 void *pageaddr;
55 struct squashfs_cache_entry *entry;
56
57 TRACE("Entered squashfs_symlink_readpage, page index %ld, start block "
58 "%llx, offset %x\n", page->index, block, offset);
59
60 /*
61 * Skip index bytes into symlink metadata.
62 */
63 if (index) {
64 bytes = squashfs_read_metadata(sb, NULL, &block, &offset,
65 index);
66 if (bytes < 0) {
67 ERROR("Unable to read symlink [%llx:%x]\n",
68 squashfs_i(inode)->start,
69 squashfs_i(inode)->offset);
70 goto error_out;
71 }
72 }
73
74 /*
75 * Read length bytes from symlink metadata. Squashfs_read_metadata
76 * is not used here because it can sleep and we want to use
77 * kmap_atomic to map the page. Instead call the underlying
78 * squashfs_cache_get routine. As length bytes may overlap metadata
79 * blocks, we may need to call squashfs_cache_get multiple times.
80 */
81 for (bytes = 0; bytes < length; offset = 0, bytes += copied) {
82 entry = squashfs_cache_get(sb, msblk->block_cache, block, 0);
83 if (entry->error) {
84 ERROR("Unable to read symlink [%llx:%x]\n",
85 squashfs_i(inode)->start,
86 squashfs_i(inode)->offset);
87 squashfs_cache_put(entry);
88 goto error_out;
89 }
90
91 pageaddr = kmap_atomic(page, KM_USER0);
92 copied = squashfs_copy_data(pageaddr + bytes, entry, offset,
93 length - bytes);
94 if (copied == length - bytes)
95 memset(pageaddr + length, 0, PAGE_CACHE_SIZE - length);
96 else
97 block = entry->next_index;
98 kunmap_atomic(pageaddr, KM_USER0);
99 squashfs_cache_put(entry);
100 }
101
102 flush_dcache_page(page);
103 SetPageUptodate(page);
104 unlock_page(page);
105 return 0;
106
107error_out:
108 SetPageError(page);
109 unlock_page(page);
110 return 0;
111}
112
113
114const struct address_space_operations squashfs_symlink_aops = {
115 .readpage = squashfs_symlink_readpage
116};