source: mainline/uspace/srv/fs/minixfs/mfs_inode.c@ bfbe16f

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since bfbe16f was bfbe16f, checked in by Maurizio Lombardi <m.lombardi85@…>, 14 years ago

fix inode_grow():

if size_grow parameter can't be zero
  • Property mode set to 100644
File size: 8.9 KB
Line 
1/*
2 * Copyright (c) 2011 Maurizio Lombardi
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * - The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup fs
30 * @{
31 */
32
33#include <stdlib.h>
34#include <assert.h>
35#include <errno.h>
36#include <mem.h>
37#include "mfs.h"
38#include "mfs_utils.h"
39
40static int
41mfs_write_inode_raw(struct mfs_node *mnode);
42
43static int
44mfs2_write_inode_raw(struct mfs_node *mnode);
45
46static struct mfs_ino_info *
47mfs_read_inode_raw(const struct mfs_instance *instance, uint16_t inum);
48
49static struct mfs_ino_info *
50mfs2_read_inode_raw(const struct mfs_instance *instance, uint32_t inum);
51
52
53int
54get_inode(struct mfs_instance *inst, struct mfs_ino_info **ino_i,
55 fs_index_t index)
56{
57 struct mfs_sb_info *sbi = inst->sbi;
58
59 if (sbi->fs_version == MFS_VERSION_V1) {
60 /*Read a MFS V1 inode*/
61 *ino_i = mfs_read_inode_raw(inst, index);
62 } else {
63 /*Read a MFS V2/V3 inode*/
64 *ino_i = mfs2_read_inode_raw(inst, index);
65 }
66
67 if (*ino_i == NULL)
68 return -1;
69
70 return EOK;
71}
72
73static struct mfs_ino_info *
74mfs_read_inode_raw(const struct mfs_instance *instance, uint16_t inum)
75{
76 struct mfs_inode *ino = NULL;
77 struct mfs_ino_info *ino_i = NULL;
78 struct mfs_sb_info *sbi;
79 block_t *b;
80 int i;
81
82 sbi = instance->sbi;
83 assert(sbi);
84
85 /*inode 0 does not exist*/
86 inum -= 1;
87
88 const int ino_off = inum % sbi->ino_per_block;
89 const size_t ino_size = sizeof(struct mfs_inode);
90
91 ino_i = malloc(sizeof(*ino_i));
92 ino = malloc(ino_size);
93
94 if (!ino || !ino_i)
95 goto out_err;
96
97 const int itable_off = sbi->itable_off;
98
99 if (block_get(&b, instance->handle,
100 itable_off + inum / sbi->ino_per_block,
101 BLOCK_FLAGS_NONE) != EOK)
102 goto out_err;
103
104 memcpy(ino, ((uint8_t *) b->data) + ino_off * ino_size, ino_size);
105
106 ino_i->i_mode = conv16(sbi->native, ino->i_mode);
107 ino_i->i_uid = conv16(sbi->native, ino->i_uid);
108 ino_i->i_size = conv32(sbi->native, ino->i_size);
109 ino_i->i_mtime = conv32(sbi->native, ino->i_mtime);
110 ino_i->i_nlinks = ino->i_nlinks;
111
112 for (i = 0; i < V1_NR_DIRECT_ZONES; ++i)
113 ino_i->i_dzone[i] = conv16(sbi->native, ino->i_dzone[i]);
114
115 for (i = 0; i < V1_NR_INDIRECT_ZONES; ++i)
116 ino_i->i_izone[i] = conv16(sbi->native, ino->i_izone[i]);
117
118 block_put(b);
119 free(ino);
120 ino_i->dirty = false;
121
122 return ino_i;
123
124out_err:
125 if (ino)
126 free(ino);
127 if (ino_i)
128 free(ino_i);
129 return NULL;
130}
131
132static struct mfs_ino_info *
133mfs2_read_inode_raw(const struct mfs_instance *instance, uint32_t inum)
134{
135 struct mfs2_inode *ino = NULL;
136 struct mfs_ino_info *ino_i = NULL;
137 struct mfs_sb_info *sbi;
138 block_t *b;
139 int i;
140
141 const size_t ino_size = sizeof(struct mfs2_inode);
142
143 ino = malloc(ino_size);
144 ino_i = malloc(sizeof(*ino_i));
145
146 if (!ino || !ino_i)
147 goto out_err;
148
149 sbi = instance->sbi;
150 assert(sbi);
151
152 /*inode 0 does not exist*/
153 inum -= 1;
154
155 const int itable_off = sbi->itable_off;
156 const int ino_off = inum % sbi->ino_per_block;
157
158 if (block_get(&b, instance->handle,
159 itable_off + inum / sbi->ino_per_block,
160 BLOCK_FLAGS_NONE) != EOK)
161 goto out_err;
162
163 memcpy(ino, ((uint8_t *)b->data) + ino_off * ino_size, ino_size);
164
165 ino_i->i_mode = conv16(sbi->native, ino->i_mode);
166 ino_i->i_nlinks = conv16(sbi->native, ino->i_nlinks);
167 ino_i->i_uid = conv16(sbi->native, ino->i_uid);
168 ino_i->i_gid = conv16(sbi->native, ino->i_gid);
169 ino_i->i_size = conv32(sbi->native, ino->i_size);
170 ino_i->i_atime = conv32(sbi->native, ino->i_atime);
171 ino_i->i_mtime = conv32(sbi->native, ino->i_mtime);
172 ino_i->i_ctime = conv32(sbi->native, ino->i_ctime);
173
174 for (i = 0; i < V2_NR_DIRECT_ZONES; ++i)
175 ino_i->i_dzone[i] = conv32(sbi->native, ino->i_dzone[i]);
176
177 for (i = 0; i < V2_NR_INDIRECT_ZONES; ++i)
178 ino_i->i_izone[i] = conv32(sbi->native, ino->i_izone[i]);
179
180 block_put(b);
181 free(ino);
182 ino_i->dirty = false;
183
184 return ino_i;
185
186out_err:
187 if (ino)
188 free(ino);
189 if (ino_i)
190 free(ino_i);
191 return NULL;
192}
193
194int
195put_inode(struct mfs_node *mnode)
196{
197 int rc = EOK;
198
199 assert(mnode);
200 assert(mnode->ino_i);
201
202 if (!mnode->ino_i->dirty)
203 goto out;
204
205 struct mfs_instance *inst = mnode->instance;
206 assert(inst);
207 struct mfs_sb_info *sbi = inst->sbi;
208 assert(sbi);
209
210 if (sbi->fs_version == MFS_VERSION_V1)
211 rc = mfs_write_inode_raw(mnode);
212 else
213 rc = mfs2_write_inode_raw(mnode);
214
215out:
216 return rc;
217}
218
219static int
220mfs_write_inode_raw(struct mfs_node *mnode)
221{
222 int i, r;
223 block_t *b;
224 struct mfs_ino_info *ino_i = mnode->ino_i;
225 struct mfs_sb_info *sbi = mnode->instance->sbi;
226
227 const uint32_t inum = ino_i->index - 1;
228 const int itable_off = sbi->itable_off;
229 const int ino_off = inum % sbi->ino_per_block;
230 const bool native = sbi->native;
231
232 r = block_get(&b, mnode->instance->handle,
233 itable_off + inum / sbi->ino_per_block,
234 BLOCK_FLAGS_NONE);
235
236 if (r != EOK)
237 goto out;
238
239 struct mfs_inode *ino = b->data;
240 ino += ino_off;
241
242 ino->i_mode = conv16(native, ino_i->i_mode);
243 ino->i_uid = conv16(native, ino_i->i_uid);
244 ino->i_gid = ino_i->i_gid;
245 ino->i_nlinks = ino_i->i_nlinks;
246 ino->i_size = conv32(native, ino_i->i_size);
247 ino->i_mtime = conv32(native, ino_i->i_mtime);
248
249 for (i = 0; i < V1_NR_DIRECT_ZONES; ++i)
250 ino->i_dzone[i] = conv16(native, ino_i->i_dzone[i]);
251 for (i = 0; i < V1_NR_INDIRECT_ZONES; ++i)
252 ino->i_izone[i] = conv16(native, ino_i->i_izone[i]);
253
254 b->dirty = true;
255 block_put(b);
256
257 ino_i->dirty = false;
258out:
259 return r;
260}
261
262static int
263mfs2_write_inode_raw(struct mfs_node *mnode)
264{
265 struct mfs_ino_info *ino_i = mnode->ino_i;
266 struct mfs_sb_info *sbi = mnode->instance->sbi;
267 block_t *b;
268 int i, r;
269
270 const uint32_t inum = ino_i->index - 1;
271 const int itable_off = sbi->itable_off;
272 const int ino_off = inum % sbi->ino_per_block;
273 const bool native = sbi->native;
274
275 r = block_get(&b, mnode->instance->handle,
276 itable_off + inum / sbi->ino_per_block,
277 BLOCK_FLAGS_NONE);
278
279 if (r != EOK)
280 goto out;
281
282 struct mfs2_inode *ino2 = b->data;
283 ino2 += ino_off;
284
285 ino2->i_mode = conv16(native, ino_i->i_mode);
286 ino2->i_nlinks = conv16(native, ino_i->i_mode);
287 ino2->i_uid = conv16(native, ino_i->i_uid);
288 ino2->i_gid = conv16(native, ino_i->i_gid);
289 ino2->i_size = conv32(native, ino_i->i_size);
290 ino2->i_atime = conv32(native, ino_i->i_atime);
291 ino2->i_mtime = conv32(native, ino_i->i_mtime);
292 ino2->i_ctime = conv32(native, ino_i->i_ctime);
293
294 for (i = 0; i < V2_NR_DIRECT_ZONES; ++i)
295 ino2->i_dzone[i] = conv32(native, ino_i->i_dzone[i]);
296
297 for (i = 0; i < V2_NR_INDIRECT_ZONES; ++i)
298 ino2->i_izone[i] = conv32(native, ino_i->i_izone[i]);
299
300 b->dirty = true;
301 block_put(b);
302 ino_i->dirty = false;
303
304out:
305 return r;
306}
307
308int
309inode_grow(struct mfs_node *mnode, size_t size_grow)
310{
311 unsigned i;
312 struct mfs_sb_info *sbi = mnode->instance->sbi;
313 struct mfs_ino_info *ino_i = mnode->ino_i;
314 const int bs = sbi->block_size;
315
316 const uint32_t old_size = ino_i->i_size;
317 const uint32_t new_size = old_size + size_grow;
318
319 assert(size_grow > 0);
320
321 /*Compute the number of zones to add to the inode*/
322 unsigned zones_to_add = 0;
323 if (old_size == 0)
324 ++zones_to_add;
325
326 zones_to_add += (new_size / bs) - (old_size / bs);
327
328 /*Compute the start zone*/
329 unsigned start_zone = old_size / bs;
330 start_zone += (old_size % bs) != 0;
331
332 mfsdebug("zones to add = %u\n", zones_to_add);
333
334 int r;
335 for (i = 0; i < zones_to_add; ++i) {
336 uint32_t new_zone;
337 uint32_t dummy;
338
339 r = mfs_alloc_bit(mnode->instance, &new_zone, BMAP_ZONE);
340 if (r != EOK)
341 return r;
342
343 mfsdebug("write_map = %d\n", (int) ((start_zone + i) * bs));
344
345 block_t *b;
346 r = block_get(&b, mnode->instance->handle, new_zone,
347 BLOCK_FLAGS_NOREAD);
348 if (r != EOK)
349 return r;
350
351 memset(b->data, 0, bs);
352 b->dirty = true;
353 block_put(b);
354
355 r = write_map(mnode, (start_zone + i) * bs,
356 new_zone, &dummy);
357 if (r != EOK)
358 return r;
359
360 ino_i->i_size += bs;
361 ino_i->dirty = true;
362 }
363
364 ino_i->i_size = new_size;
365 ino_i->dirty = true;
366
367 return EOK;
368}
369
370/**
371 * @}
372 */
373
Note: See TracBrowser for help on using the repository browser.