5 * Daniel Pirkl <daniel.pirkl@email.cz>
6 * Charles University, Faculty of Mathematics and Physics
9 #include <linux/string.h>
10 #include <linux/slab.h>
11 #include <linux/ufs_fs.h>
12 #include <linux/buffer_head.h>
17 struct ufs_buffer_head * _ubh_bread_ (struct ufs_sb_private_info * uspi,
18 struct super_block *sb, u64 fragment, u64 size)
20 struct ufs_buffer_head * ubh;
23 if (size & ~uspi->s_fmask)
25 count = size >> uspi->s_fshift;
26 if (count > UFS_MAXFRAG)
28 ubh = (struct ufs_buffer_head *)
29 kmalloc (sizeof (struct ufs_buffer_head), GFP_KERNEL);
32 ubh->fragment = fragment;
34 for (i = 0; i < count; i++)
35 if (!(ubh->bh[i] = sb_bread(sb, fragment + i)))
37 for (; i < UFS_MAXFRAG; i++)
41 for (j = 0; j < i; j++)
47 struct ufs_buffer_head * ubh_bread_uspi (struct ufs_sb_private_info * uspi,
48 struct super_block *sb, u64 fragment, u64 size)
52 if (size & ~uspi->s_fmask)
54 count = size >> uspi->s_fshift;
55 if (count <= 0 || count > UFS_MAXFRAG)
57 USPI_UBH(uspi)->fragment = fragment;
58 USPI_UBH(uspi)->count = count;
59 for (i = 0; i < count; i++)
60 if (!(USPI_UBH(uspi)->bh[i] = sb_bread(sb, fragment + i)))
62 for (; i < UFS_MAXFRAG; i++)
63 USPI_UBH(uspi)->bh[i] = NULL;
64 return USPI_UBH(uspi);
66 for (j = 0; j < i; j++)
67 brelse (USPI_UBH(uspi)->bh[j]);
71 void ubh_brelse (struct ufs_buffer_head * ubh)
76 for (i = 0; i < ubh->count; i++)
81 void ubh_brelse_uspi (struct ufs_sb_private_info * uspi)
86 for ( i = 0; i < USPI_UBH(uspi)->count; i++ ) {
87 brelse (USPI_UBH(uspi)->bh[i]);
88 USPI_UBH(uspi)->bh[i] = NULL;
92 void ubh_mark_buffer_dirty (struct ufs_buffer_head * ubh)
97 for ( i = 0; i < ubh->count; i++ )
98 mark_buffer_dirty (ubh->bh[i]);
101 void ubh_mark_buffer_uptodate (struct ufs_buffer_head * ubh, int flag)
107 for ( i = 0; i < ubh->count; i++ )
108 set_buffer_uptodate (ubh->bh[i]);
110 for ( i = 0; i < ubh->count; i++ )
111 clear_buffer_uptodate (ubh->bh[i]);
115 void ubh_ll_rw_block (int rw, unsigned nr, struct ufs_buffer_head * ubh[])
120 for ( i = 0; i < nr; i++ )
121 ll_rw_block (rw, ubh[i]->count, ubh[i]->bh);
124 void ubh_wait_on_buffer (struct ufs_buffer_head * ubh)
129 for ( i = 0; i < ubh->count; i++ )
130 wait_on_buffer (ubh->bh[i]);
133 void ubh_bforget (struct ufs_buffer_head * ubh)
138 for ( i = 0; i < ubh->count; i++ ) if ( ubh->bh[i] )
139 bforget (ubh->bh[i]);
142 int ubh_buffer_dirty (struct ufs_buffer_head * ubh)
148 for ( i = 0; i < ubh->count; i++ )
149 result |= buffer_dirty(ubh->bh[i]);
153 void _ubh_ubhcpymem_(struct ufs_sb_private_info * uspi,
154 unsigned char * mem, struct ufs_buffer_head * ubh, unsigned size)
157 if (size > (ubh->count << uspi->s_fshift))
158 size = ubh->count << uspi->s_fshift;
161 len = min_t(unsigned int, size, uspi->s_fsize);
162 memcpy (mem, ubh->bh[bhno]->b_data, len);
163 mem += uspi->s_fsize;
169 void _ubh_memcpyubh_(struct ufs_sb_private_info * uspi,
170 struct ufs_buffer_head * ubh, unsigned char * mem, unsigned size)
173 if (size > (ubh->count << uspi->s_fshift))
174 size = ubh->count << uspi->s_fshift;
177 len = min_t(unsigned int, size, uspi->s_fsize);
178 memcpy (ubh->bh[bhno]->b_data, mem, len);
179 mem += uspi->s_fsize;
186 ufs_get_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi)
191 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
192 fs32 = ufsi->i_u1.i_data[1];
194 fs32 = ufsi->i_u1.i_data[0];
195 fs32 = fs32_to_cpu(sb, fs32);
196 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
199 if ((fs32 & 0xffff0000) == 0 ||
200 (fs32 & 0xffff0000) == 0xffff0000)
201 dev = old_decode_dev(fs32 & 0x7fff);
203 dev = MKDEV(sysv_major(fs32), sysv_minor(fs32));
207 dev = old_decode_dev(fs32);
214 ufs_set_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi, dev_t dev)
218 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
221 fs32 = sysv_encode_dev(dev);
222 if ((fs32 & 0xffff8000) == 0) {
223 fs32 = old_encode_dev(dev);
228 fs32 = old_encode_dev(dev);
231 fs32 = cpu_to_fs32(sb, fs32);
232 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
233 ufsi->i_u1.i_data[1] = fs32;
235 ufsi->i_u1.i_data[0] = fs32;