1 // SPDX-License-Identifier: GPL-2.0
6 * Daniel Pirkl <daniel.pirkl@email.cz>
7 * Charles University, Faculty of Mathematics and Physics
10 #include <linux/string.h>
11 #include <linux/slab.h>
12 #include <linux/buffer_head.h>
19 struct ufs_buffer_head * _ubh_bread_ (struct ufs_sb_private_info * uspi,
20 struct super_block *sb, u64 fragment, u64 size)
22 struct ufs_buffer_head * ubh;
25 if (size & ~uspi->s_fmask)
27 count = size >> uspi->s_fshift;
28 if (count > UFS_MAXFRAG)
30 ubh = kmalloc (sizeof (struct ufs_buffer_head), GFP_NOFS);
33 ubh->fragment = fragment;
35 for (i = 0; i < count; i++)
36 if (!(ubh->bh[i] = sb_bread(sb, fragment + i)))
38 for (; i < UFS_MAXFRAG; i++)
42 for (j = 0; j < i; j++)
48 struct ufs_buffer_head * ubh_bread_uspi (struct ufs_sb_private_info * uspi,
49 struct super_block *sb, u64 fragment, u64 size)
53 if (size & ~uspi->s_fmask)
55 count = size >> uspi->s_fshift;
56 if (count <= 0 || count > UFS_MAXFRAG)
58 USPI_UBH(uspi)->fragment = fragment;
59 USPI_UBH(uspi)->count = count;
60 for (i = 0; i < count; i++)
61 if (!(USPI_UBH(uspi)->bh[i] = sb_bread(sb, fragment + i)))
63 for (; i < UFS_MAXFRAG; i++)
64 USPI_UBH(uspi)->bh[i] = NULL;
65 return USPI_UBH(uspi);
67 for (j = 0; j < i; j++)
68 brelse (USPI_UBH(uspi)->bh[j]);
72 void ubh_brelse (struct ufs_buffer_head * ubh)
77 for (i = 0; i < ubh->count; i++)
82 void ubh_brelse_uspi (struct ufs_sb_private_info * uspi)
87 for ( i = 0; i < USPI_UBH(uspi)->count; i++ ) {
88 brelse (USPI_UBH(uspi)->bh[i]);
89 USPI_UBH(uspi)->bh[i] = NULL;
93 void ubh_mark_buffer_dirty (struct ufs_buffer_head * ubh)
98 for ( i = 0; i < ubh->count; i++ )
99 mark_buffer_dirty (ubh->bh[i]);
102 void ubh_mark_buffer_uptodate (struct ufs_buffer_head * ubh, int flag)
108 for ( i = 0; i < ubh->count; i++ )
109 set_buffer_uptodate (ubh->bh[i]);
111 for ( i = 0; i < ubh->count; i++ )
112 clear_buffer_uptodate (ubh->bh[i]);
116 void ubh_sync_block(struct ufs_buffer_head *ubh)
121 for (i = 0; i < ubh->count; i++)
122 write_dirty_buffer(ubh->bh[i], 0);
124 for (i = 0; i < ubh->count; i++)
125 wait_on_buffer(ubh->bh[i]);
129 void ubh_bforget (struct ufs_buffer_head * ubh)
134 for ( i = 0; i < ubh->count; i++ ) if ( ubh->bh[i] )
135 bforget (ubh->bh[i]);
138 int ubh_buffer_dirty (struct ufs_buffer_head * ubh)
144 for ( i = 0; i < ubh->count; i++ )
145 result |= buffer_dirty(ubh->bh[i]);
149 void _ubh_ubhcpymem_(struct ufs_sb_private_info * uspi,
150 unsigned char * mem, struct ufs_buffer_head * ubh, unsigned size)
153 if (size > (ubh->count << uspi->s_fshift))
154 size = ubh->count << uspi->s_fshift;
157 len = min_t(unsigned int, size, uspi->s_fsize);
158 memcpy (mem, ubh->bh[bhno]->b_data, len);
159 mem += uspi->s_fsize;
165 void _ubh_memcpyubh_(struct ufs_sb_private_info * uspi,
166 struct ufs_buffer_head * ubh, unsigned char * mem, unsigned size)
169 if (size > (ubh->count << uspi->s_fshift))
170 size = ubh->count << uspi->s_fshift;
173 len = min_t(unsigned int, size, uspi->s_fsize);
174 memcpy (ubh->bh[bhno]->b_data, mem, len);
175 mem += uspi->s_fsize;
182 ufs_get_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi)
187 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
188 fs32 = fs32_to_cpu(sb, ufsi->i_u1.i_data[1]);
190 fs32 = fs32_to_cpu(sb, ufsi->i_u1.i_data[0]);
191 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
194 if ((fs32 & 0xffff0000) == 0 ||
195 (fs32 & 0xffff0000) == 0xffff0000)
196 dev = old_decode_dev(fs32 & 0x7fff);
198 dev = MKDEV(sysv_major(fs32), sysv_minor(fs32));
202 dev = old_decode_dev(fs32);
209 ufs_set_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi, dev_t dev)
213 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
216 fs32 = sysv_encode_dev(dev);
217 if ((fs32 & 0xffff8000) == 0) {
218 fs32 = old_encode_dev(dev);
223 fs32 = old_encode_dev(dev);
226 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
227 ufsi->i_u1.i_data[1] = cpu_to_fs32(sb, fs32);
229 ufsi->i_u1.i_data[0] = cpu_to_fs32(sb, fs32);
233 * ufs_get_locked_page() - locate, pin and lock a pagecache page, if not exist
235 * @mapping: the address_space to search
236 * @index: the page index
238 * Locates the desired pagecache page, if not exist we'll read it,
239 * locks it, increments its reference
240 * count and returns its address.
244 struct page *ufs_get_locked_page(struct address_space *mapping,
247 struct inode *inode = mapping->host;
248 struct page *page = find_lock_page(mapping, index);
250 page = read_mapping_page(mapping, index, NULL);
253 printk(KERN_ERR "ufs_change_blocknr: "
254 "read_mapping_page error: ino %lu, index: %lu\n",
255 mapping->host->i_ino, index);
261 if (unlikely(page->mapping == NULL)) {
262 /* Truncate got there first */
268 if (!PageUptodate(page) || PageError(page)) {
272 printk(KERN_ERR "ufs_change_blocknr: "
273 "can not read page: ino %lu, index: %lu\n",
274 inode->i_ino, index);
276 return ERR_PTR(-EIO);
279 if (!page_has_buffers(page))
280 create_empty_buffers(page, 1 << inode->i_blkbits, 0);