Loading...
1/*
2 * linux/fs/ufs/util.c
3 *
4 * Copyright (C) 1998
5 * Daniel Pirkl <daniel.pirkl@email.cz>
6 * Charles University, Faculty of Mathematics and Physics
7 */
8
9#include <linux/string.h>
10#include <linux/slab.h>
11#include <linux/buffer_head.h>
12
13#include "ufs_fs.h"
14#include "ufs.h"
15#include "swab.h"
16#include "util.h"
17
18struct ufs_buffer_head * _ubh_bread_ (struct ufs_sb_private_info * uspi,
19 struct super_block *sb, u64 fragment, u64 size)
20{
21 struct ufs_buffer_head * ubh;
22 unsigned i, j ;
23 u64 count = 0;
24 if (size & ~uspi->s_fmask)
25 return NULL;
26 count = size >> uspi->s_fshift;
27 if (count > UFS_MAXFRAG)
28 return NULL;
29 ubh = kmalloc (sizeof (struct ufs_buffer_head), GFP_NOFS);
30 if (!ubh)
31 return NULL;
32 ubh->fragment = fragment;
33 ubh->count = count;
34 for (i = 0; i < count; i++)
35 if (!(ubh->bh[i] = sb_bread(sb, fragment + i)))
36 goto failed;
37 for (; i < UFS_MAXFRAG; i++)
38 ubh->bh[i] = NULL;
39 return ubh;
40failed:
41 for (j = 0; j < i; j++)
42 brelse (ubh->bh[j]);
43 kfree(ubh);
44 return NULL;
45}
46
47struct ufs_buffer_head * ubh_bread_uspi (struct ufs_sb_private_info * uspi,
48 struct super_block *sb, u64 fragment, u64 size)
49{
50 unsigned i, j;
51 u64 count = 0;
52 if (size & ~uspi->s_fmask)
53 return NULL;
54 count = size >> uspi->s_fshift;
55 if (count <= 0 || count > UFS_MAXFRAG)
56 return NULL;
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)))
61 goto failed;
62 for (; i < UFS_MAXFRAG; i++)
63 USPI_UBH(uspi)->bh[i] = NULL;
64 return USPI_UBH(uspi);
65failed:
66 for (j = 0; j < i; j++)
67 brelse (USPI_UBH(uspi)->bh[j]);
68 return NULL;
69}
70
71void ubh_brelse (struct ufs_buffer_head * ubh)
72{
73 unsigned i;
74 if (!ubh)
75 return;
76 for (i = 0; i < ubh->count; i++)
77 brelse (ubh->bh[i]);
78 kfree (ubh);
79}
80
81void ubh_brelse_uspi (struct ufs_sb_private_info * uspi)
82{
83 unsigned i;
84 if (!USPI_UBH(uspi))
85 return;
86 for ( i = 0; i < USPI_UBH(uspi)->count; i++ ) {
87 brelse (USPI_UBH(uspi)->bh[i]);
88 USPI_UBH(uspi)->bh[i] = NULL;
89 }
90}
91
92void ubh_mark_buffer_dirty (struct ufs_buffer_head * ubh)
93{
94 unsigned i;
95 if (!ubh)
96 return;
97 for ( i = 0; i < ubh->count; i++ )
98 mark_buffer_dirty (ubh->bh[i]);
99}
100
101void ubh_mark_buffer_uptodate (struct ufs_buffer_head * ubh, int flag)
102{
103 unsigned i;
104 if (!ubh)
105 return;
106 if (flag) {
107 for ( i = 0; i < ubh->count; i++ )
108 set_buffer_uptodate (ubh->bh[i]);
109 } else {
110 for ( i = 0; i < ubh->count; i++ )
111 clear_buffer_uptodate (ubh->bh[i]);
112 }
113}
114
115void ubh_sync_block(struct ufs_buffer_head *ubh)
116{
117 if (ubh) {
118 unsigned i;
119
120 for (i = 0; i < ubh->count; i++)
121 write_dirty_buffer(ubh->bh[i], 0);
122
123 for (i = 0; i < ubh->count; i++)
124 wait_on_buffer(ubh->bh[i]);
125 }
126}
127
128void ubh_bforget (struct ufs_buffer_head * ubh)
129{
130 unsigned i;
131 if (!ubh)
132 return;
133 for ( i = 0; i < ubh->count; i++ ) if ( ubh->bh[i] )
134 bforget (ubh->bh[i]);
135}
136
137int ubh_buffer_dirty (struct ufs_buffer_head * ubh)
138{
139 unsigned i;
140 unsigned result = 0;
141 if (!ubh)
142 return 0;
143 for ( i = 0; i < ubh->count; i++ )
144 result |= buffer_dirty(ubh->bh[i]);
145 return result;
146}
147
148void _ubh_ubhcpymem_(struct ufs_sb_private_info * uspi,
149 unsigned char * mem, struct ufs_buffer_head * ubh, unsigned size)
150{
151 unsigned len, bhno;
152 if (size > (ubh->count << uspi->s_fshift))
153 size = ubh->count << uspi->s_fshift;
154 bhno = 0;
155 while (size) {
156 len = min_t(unsigned int, size, uspi->s_fsize);
157 memcpy (mem, ubh->bh[bhno]->b_data, len);
158 mem += uspi->s_fsize;
159 size -= len;
160 bhno++;
161 }
162}
163
164void _ubh_memcpyubh_(struct ufs_sb_private_info * uspi,
165 struct ufs_buffer_head * ubh, unsigned char * mem, unsigned size)
166{
167 unsigned len, bhno;
168 if (size > (ubh->count << uspi->s_fshift))
169 size = ubh->count << uspi->s_fshift;
170 bhno = 0;
171 while (size) {
172 len = min_t(unsigned int, size, uspi->s_fsize);
173 memcpy (ubh->bh[bhno]->b_data, mem, len);
174 mem += uspi->s_fsize;
175 size -= len;
176 bhno++;
177 }
178}
179
180dev_t
181ufs_get_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi)
182{
183 __u32 fs32;
184 dev_t dev;
185
186 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
187 fs32 = fs32_to_cpu(sb, ufsi->i_u1.i_data[1]);
188 else
189 fs32 = fs32_to_cpu(sb, ufsi->i_u1.i_data[0]);
190 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
191 case UFS_ST_SUNx86:
192 case UFS_ST_SUN:
193 if ((fs32 & 0xffff0000) == 0 ||
194 (fs32 & 0xffff0000) == 0xffff0000)
195 dev = old_decode_dev(fs32 & 0x7fff);
196 else
197 dev = MKDEV(sysv_major(fs32), sysv_minor(fs32));
198 break;
199
200 default:
201 dev = old_decode_dev(fs32);
202 break;
203 }
204 return dev;
205}
206
207void
208ufs_set_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi, dev_t dev)
209{
210 __u32 fs32;
211
212 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
213 case UFS_ST_SUNx86:
214 case UFS_ST_SUN:
215 fs32 = sysv_encode_dev(dev);
216 if ((fs32 & 0xffff8000) == 0) {
217 fs32 = old_encode_dev(dev);
218 }
219 break;
220
221 default:
222 fs32 = old_encode_dev(dev);
223 break;
224 }
225 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
226 ufsi->i_u1.i_data[1] = cpu_to_fs32(sb, fs32);
227 else
228 ufsi->i_u1.i_data[0] = cpu_to_fs32(sb, fs32);
229}
230
231/**
232 * ufs_get_locked_page() - locate, pin and lock a pagecache page, if not exist
233 * read it from disk.
234 * @mapping: the address_space to search
235 * @index: the page index
236 *
237 * Locates the desired pagecache page, if not exist we'll read it,
238 * locks it, increments its reference
239 * count and returns its address.
240 *
241 */
242
243struct page *ufs_get_locked_page(struct address_space *mapping,
244 pgoff_t index)
245{
246 struct page *page;
247
248 page = find_lock_page(mapping, index);
249 if (!page) {
250 page = read_mapping_page(mapping, index, NULL);
251
252 if (IS_ERR(page)) {
253 printk(KERN_ERR "ufs_change_blocknr: "
254 "read_mapping_page error: ino %lu, index: %lu\n",
255 mapping->host->i_ino, index);
256 goto out;
257 }
258
259 lock_page(page);
260
261 if (unlikely(page->mapping == NULL)) {
262 /* Truncate got there first */
263 unlock_page(page);
264 put_page(page);
265 page = NULL;
266 goto out;
267 }
268
269 if (!PageUptodate(page) || PageError(page)) {
270 unlock_page(page);
271 put_page(page);
272
273 printk(KERN_ERR "ufs_change_blocknr: "
274 "can not read page: ino %lu, index: %lu\n",
275 mapping->host->i_ino, index);
276
277 page = ERR_PTR(-EIO);
278 }
279 }
280out:
281 return page;
282}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * linux/fs/ufs/util.c
4 *
5 * Copyright (C) 1998
6 * Daniel Pirkl <daniel.pirkl@email.cz>
7 * Charles University, Faculty of Mathematics and Physics
8 */
9
10#include <linux/string.h>
11#include <linux/slab.h>
12#include <linux/buffer_head.h>
13
14#include "ufs_fs.h"
15#include "ufs.h"
16#include "swab.h"
17#include "util.h"
18
19struct ufs_buffer_head * _ubh_bread_ (struct ufs_sb_private_info * uspi,
20 struct super_block *sb, u64 fragment, u64 size)
21{
22 struct ufs_buffer_head * ubh;
23 unsigned i, j ;
24 u64 count = 0;
25 if (size & ~uspi->s_fmask)
26 return NULL;
27 count = size >> uspi->s_fshift;
28 if (count > UFS_MAXFRAG)
29 return NULL;
30 ubh = kmalloc (sizeof (struct ufs_buffer_head), GFP_NOFS);
31 if (!ubh)
32 return NULL;
33 ubh->fragment = fragment;
34 ubh->count = count;
35 for (i = 0; i < count; i++)
36 if (!(ubh->bh[i] = sb_bread(sb, fragment + i)))
37 goto failed;
38 for (; i < UFS_MAXFRAG; i++)
39 ubh->bh[i] = NULL;
40 return ubh;
41failed:
42 for (j = 0; j < i; j++)
43 brelse (ubh->bh[j]);
44 kfree(ubh);
45 return NULL;
46}
47
48struct ufs_buffer_head * ubh_bread_uspi (struct ufs_sb_private_info * uspi,
49 struct super_block *sb, u64 fragment, u64 size)
50{
51 unsigned i, j;
52 u64 count = 0;
53 if (size & ~uspi->s_fmask)
54 return NULL;
55 count = size >> uspi->s_fshift;
56 if (count <= 0 || count > UFS_MAXFRAG)
57 return NULL;
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)))
62 goto failed;
63 for (; i < UFS_MAXFRAG; i++)
64 USPI_UBH(uspi)->bh[i] = NULL;
65 return USPI_UBH(uspi);
66failed:
67 for (j = 0; j < i; j++)
68 brelse (USPI_UBH(uspi)->bh[j]);
69 return NULL;
70}
71
72void ubh_brelse (struct ufs_buffer_head * ubh)
73{
74 unsigned i;
75 if (!ubh)
76 return;
77 for (i = 0; i < ubh->count; i++)
78 brelse (ubh->bh[i]);
79 kfree (ubh);
80}
81
82void ubh_brelse_uspi (struct ufs_sb_private_info * uspi)
83{
84 unsigned i;
85 if (!USPI_UBH(uspi))
86 return;
87 for ( i = 0; i < USPI_UBH(uspi)->count; i++ ) {
88 brelse (USPI_UBH(uspi)->bh[i]);
89 USPI_UBH(uspi)->bh[i] = NULL;
90 }
91}
92
93void ubh_mark_buffer_dirty (struct ufs_buffer_head * ubh)
94{
95 unsigned i;
96 if (!ubh)
97 return;
98 for ( i = 0; i < ubh->count; i++ )
99 mark_buffer_dirty (ubh->bh[i]);
100}
101
102void ubh_sync_block(struct ufs_buffer_head *ubh)
103{
104 if (ubh) {
105 unsigned i;
106
107 for (i = 0; i < ubh->count; i++)
108 write_dirty_buffer(ubh->bh[i], 0);
109
110 for (i = 0; i < ubh->count; i++)
111 wait_on_buffer(ubh->bh[i]);
112 }
113}
114
115void ubh_bforget (struct ufs_buffer_head * ubh)
116{
117 unsigned i;
118 if (!ubh)
119 return;
120 for ( i = 0; i < ubh->count; i++ ) if ( ubh->bh[i] )
121 bforget (ubh->bh[i]);
122}
123
124int ubh_buffer_dirty (struct ufs_buffer_head * ubh)
125{
126 unsigned i;
127 unsigned result = 0;
128 if (!ubh)
129 return 0;
130 for ( i = 0; i < ubh->count; i++ )
131 result |= buffer_dirty(ubh->bh[i]);
132 return result;
133}
134
135dev_t
136ufs_get_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi)
137{
138 __u32 fs32;
139 dev_t dev;
140
141 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
142 fs32 = fs32_to_cpu(sb, ufsi->i_u1.i_data[1]);
143 else
144 fs32 = fs32_to_cpu(sb, ufsi->i_u1.i_data[0]);
145 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
146 case UFS_ST_SUNx86:
147 case UFS_ST_SUN:
148 if ((fs32 & 0xffff0000) == 0 ||
149 (fs32 & 0xffff0000) == 0xffff0000)
150 dev = old_decode_dev(fs32 & 0x7fff);
151 else
152 dev = MKDEV(sysv_major(fs32), sysv_minor(fs32));
153 break;
154
155 default:
156 dev = old_decode_dev(fs32);
157 break;
158 }
159 return dev;
160}
161
162void
163ufs_set_inode_dev(struct super_block *sb, struct ufs_inode_info *ufsi, dev_t dev)
164{
165 __u32 fs32;
166
167 switch (UFS_SB(sb)->s_flags & UFS_ST_MASK) {
168 case UFS_ST_SUNx86:
169 case UFS_ST_SUN:
170 fs32 = sysv_encode_dev(dev);
171 if ((fs32 & 0xffff8000) == 0) {
172 fs32 = old_encode_dev(dev);
173 }
174 break;
175
176 default:
177 fs32 = old_encode_dev(dev);
178 break;
179 }
180 if ((UFS_SB(sb)->s_flags & UFS_ST_MASK) == UFS_ST_SUNx86)
181 ufsi->i_u1.i_data[1] = cpu_to_fs32(sb, fs32);
182 else
183 ufsi->i_u1.i_data[0] = cpu_to_fs32(sb, fs32);
184}
185
186/**
187 * ufs_get_locked_folio() - locate, pin and lock a pagecache folio, if not exist
188 * read it from disk.
189 * @mapping: the address_space to search
190 * @index: the page index
191 *
192 * Locates the desired pagecache folio, if not exist we'll read it,
193 * locks it, increments its reference
194 * count and returns its address.
195 *
196 */
197struct folio *ufs_get_locked_folio(struct address_space *mapping,
198 pgoff_t index)
199{
200 struct inode *inode = mapping->host;
201 struct folio *folio = filemap_lock_folio(mapping, index);
202 if (IS_ERR(folio)) {
203 folio = read_mapping_folio(mapping, index, NULL);
204
205 if (IS_ERR(folio)) {
206 printk(KERN_ERR "ufs_change_blocknr: read_mapping_folio error: ino %lu, index: %lu\n",
207 mapping->host->i_ino, index);
208 return folio;
209 }
210
211 folio_lock(folio);
212
213 if (unlikely(folio->mapping == NULL)) {
214 /* Truncate got there first */
215 folio_unlock(folio);
216 folio_put(folio);
217 return NULL;
218 }
219 }
220 if (!folio_buffers(folio))
221 create_empty_buffers(folio, 1 << inode->i_blkbits, 0);
222 return folio;
223}