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

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

cstyle

  • Property mode set to 100644
File size: 9.8 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 "mfs.h"
35#include "mfs_utils.h"
36
37static int
38mfs_write_inode_raw(struct mfs_node *mnode);
39
40static int
41mfs2_write_inode_raw(struct mfs_node *mnode);
42
43static struct mfs_ino_info *
44mfs_read_inode_raw(const struct mfs_instance *instance, uint16_t inum);
45
46static struct mfs_ino_info *
47mfs2_read_inode_raw(const struct mfs_instance *instance, uint32_t inum);
48
49
50int
51get_inode(struct mfs_instance *inst, struct mfs_ino_info **ino_i,
52 fs_index_t index)
53{
54 struct mfs_sb_info *sbi = inst->sbi;
55
56 if (sbi->fs_version == MFS_VERSION_V1) {
57 /*Read a MFS V1 inode*/
58 *ino_i = mfs_read_inode_raw(inst, index);
59 } else {
60 /*Read a MFS V2/V3 inode*/
61 *ino_i = mfs2_read_inode_raw(inst, index);
62 }
63
64 if (*ino_i == NULL)
65 return -1;
66
67 return EOK;
68}
69
70static struct mfs_ino_info *
71mfs_read_inode_raw(const struct mfs_instance *instance, uint16_t inum) {
72 struct mfs_inode *ino = NULL;
73 struct mfs_ino_info *ino_i = NULL;
74 struct mfs_sb_info *sbi;
75 block_t *b;
76 int i;
77
78 sbi = instance->sbi;
79 assert(sbi);
80
81 /*inode 0 does not exist*/
82 inum -= 1;
83
84 const int ino_off = inum % sbi->ino_per_block;
85 const size_t ino_size = sizeof(struct mfs_inode);
86
87 ino_i = malloc(sizeof(*ino_i));
88 ino = malloc(ino_size);
89
90 if (!ino || !ino_i)
91 goto out_err;
92
93 const int itable_off = sbi->itable_off;
94
95 if (block_get(&b, instance->handle,
96 itable_off + inum / sbi->ino_per_block,
97 BLOCK_FLAGS_NONE) != EOK)
98 goto out_err;
99
100 memcpy(ino, ((uint8_t *) b->data) + ino_off * ino_size, ino_size);
101
102 ino_i->i_mode = conv16(sbi->native, ino->i_mode);
103 ino_i->i_uid = conv16(sbi->native, ino->i_uid);
104 ino_i->i_size = conv32(sbi->native, ino->i_size);
105 ino_i->i_mtime = conv32(sbi->native, ino->i_mtime);
106 ino_i->i_nlinks = ino->i_nlinks;
107
108 for (i = 0; i < V1_NR_DIRECT_ZONES; ++i)
109 ino_i->i_dzone[i] = conv16(sbi->native, ino->i_dzone[i]);
110
111 for (i = 0; i < V1_NR_INDIRECT_ZONES; ++i)
112 ino_i->i_izone[i] = conv16(sbi->native, ino->i_izone[i]);
113
114 block_put(b);
115 free(ino);
116 ino_i->dirty = false;
117
118 return ino_i;
119
120out_err:
121 if (ino)
122 free(ino);
123 if (ino_i)
124 free(ino_i);
125 return NULL;
126}
127
128static struct mfs_ino_info *
129mfs2_read_inode_raw(const struct mfs_instance *instance, uint32_t inum) {
130 struct mfs2_inode *ino = NULL;
131 struct mfs_ino_info *ino_i = NULL;
132 struct mfs_sb_info *sbi;
133 block_t *b;
134 int i;
135
136 const size_t ino_size = sizeof(struct mfs2_inode);
137
138 ino = malloc(ino_size);
139 ino_i = malloc(sizeof(*ino_i));
140
141 if (!ino || !ino_i)
142 goto out_err;
143
144 sbi = instance->sbi;
145 assert(sbi);
146
147 /*inode 0 does not exist*/
148 inum -= 1;
149
150 const int itable_off = sbi->itable_off;
151 const int ino_off = inum % sbi->ino_per_block;
152
153 if (block_get(&b, instance->handle,
154 itable_off + inum / sbi->ino_per_block,
155 BLOCK_FLAGS_NONE) != EOK)
156 goto out_err;
157
158 memcpy(ino, ((uint8_t *)b->data) + ino_off * ino_size, ino_size);
159
160 ino_i->i_mode = conv16(sbi->native, ino->i_mode);
161 ino_i->i_nlinks = conv16(sbi->native, ino->i_nlinks);
162 ino_i->i_uid = conv16(sbi->native, ino->i_uid);
163 ino_i->i_gid = conv16(sbi->native, ino->i_gid);
164 ino_i->i_size = conv32(sbi->native, ino->i_size);
165 ino_i->i_atime = conv32(sbi->native, ino->i_atime);
166 ino_i->i_mtime = conv32(sbi->native, ino->i_mtime);
167 ino_i->i_ctime = conv32(sbi->native, ino->i_ctime);
168
169 for (i = 0; i < V2_NR_DIRECT_ZONES; ++i)
170 ino_i->i_dzone[i] = conv32(sbi->native, ino->i_dzone[i]);
171
172 for (i = 0; i < V2_NR_INDIRECT_ZONES; ++i)
173 ino_i->i_izone[i] = conv32(sbi->native, ino->i_izone[i]);
174
175 block_put(b);
176 free(ino);
177 ino_i->dirty = false;
178
179 return ino_i;
180
181out_err:
182 if (ino)
183 free(ino);
184 if (ino_i)
185 free(ino_i);
186 return NULL;
187}
188
189int
190put_inode(struct mfs_node *mnode)
191{
192 int rc = EOK;
193
194 assert(mnode);
195 assert(mnode->ino_i);
196
197 if (!mnode->ino_i->dirty)
198 goto out;
199
200 struct mfs_instance *inst = mnode->instance;
201 assert(inst);
202 struct mfs_sb_info *sbi = inst->sbi;
203 assert(sbi);
204
205 if (sbi->fs_version == MFS_VERSION_V1)
206 rc = mfs_write_inode_raw(mnode);
207 else
208 rc = mfs2_write_inode_raw(mnode);
209
210out:
211 return rc;
212}
213
214static int
215mfs_write_inode_raw(struct mfs_node *mnode)
216{
217 int i, r;
218 block_t *b;
219 struct mfs_ino_info *ino_i = mnode->ino_i;
220 struct mfs_sb_info *sbi = mnode->instance->sbi;
221
222 const uint32_t inum = ino_i->index - 1;
223 const int itable_off = sbi->itable_off;
224 const int ino_off = inum % sbi->ino_per_block;
225 const bool native = sbi->native;
226
227 r = block_get(&b, mnode->instance->handle,
228 itable_off + inum / sbi->ino_per_block,
229 BLOCK_FLAGS_NONE);
230
231 on_error(r, goto out);
232
233 struct mfs_inode *ino = b->data;
234 ino += ino_off;
235
236 ino->i_mode = conv16(native, ino_i->i_mode);
237 ino->i_uid = conv16(native, ino_i->i_uid);
238 ino->i_gid = ino_i->i_gid;
239 ino->i_nlinks = ino_i->i_nlinks;
240 ino->i_size = conv32(native, ino_i->i_size);
241 ino->i_mtime = conv32(native, ino_i->i_mtime);
242
243 for (i = 0; i < V1_NR_DIRECT_ZONES; ++i)
244 ino->i_dzone[i] = conv16(native, ino_i->i_dzone[i]);
245 for (i = 0; i < V1_NR_INDIRECT_ZONES; ++i)
246 ino->i_izone[i] = conv16(native, ino_i->i_izone[i]);
247
248 b->dirty = true;
249 block_put(b);
250
251 ino_i->dirty = false;
252out:
253 return r;
254}
255
256static int
257mfs2_write_inode_raw(struct mfs_node *mnode)
258{
259 struct mfs_ino_info *ino_i = mnode->ino_i;
260 struct mfs_sb_info *sbi = mnode->instance->sbi;
261 block_t *b;
262 int i, r;
263
264 const uint32_t inum = ino_i->index - 1;
265 const int itable_off = sbi->itable_off;
266 const int ino_off = inum % sbi->ino_per_block;
267 const bool native = sbi->native;
268
269 r = block_get(&b, mnode->instance->handle,
270 itable_off + inum / sbi->ino_per_block,
271 BLOCK_FLAGS_NONE);
272
273 on_error(r, goto out);
274
275 struct mfs2_inode *ino2 = b->data;
276 ino2 += ino_off;
277
278 ino2->i_mode = conv16(native, ino_i->i_mode);
279 ino2->i_nlinks = conv16(native, ino_i->i_mode);
280 ino2->i_uid = conv16(native, ino_i->i_uid);
281 ino2->i_gid = conv16(native, ino_i->i_gid);
282 ino2->i_size = conv32(native, ino_i->i_size);
283 ino2->i_atime = conv32(native, ino_i->i_atime);
284 ino2->i_mtime = conv32(native, ino_i->i_mtime);
285 ino2->i_ctime = conv32(native, ino_i->i_ctime);
286
287 for (i = 0; i < V2_NR_DIRECT_ZONES; ++i)
288 ino2->i_dzone[i] = conv32(native, ino_i->i_dzone[i]);
289
290 for (i = 0; i < V2_NR_INDIRECT_ZONES; ++i)
291 ino2->i_izone[i] = conv32(native, ino_i->i_izone[i]);
292
293 b->dirty = true;
294 block_put(b);
295 ino_i->dirty = false;
296
297out:
298 return r;
299}
300
301int
302inode_shrink(struct mfs_node *mnode, size_t size_shrink)
303{
304 struct mfs_sb_info *sbi = mnode->instance->sbi;
305 struct mfs_ino_info *ino_i = mnode->ino_i;
306 const size_t bs = sbi->block_size;
307 int r;
308
309 assert(size_shrink > 0);
310
311 const size_t old_size = ino_i->i_size;
312 const size_t new_size = ino_i->i_size - size_shrink;
313
314 assert(size_shrink <= old_size);
315
316 ino_i->dirty = true;
317
318 /*Compute the number of zones to free*/
319 unsigned zones_to_free = 0;
320 if (new_size == 0)
321 ++zones_to_free;
322
323 zones_to_free += (old_size / bs) - (new_size / bs);
324
325 mfsdebug("zones to free = %u\n", zones_to_free);
326
327 uint32_t pos = old_size - 1;
328 unsigned i;
329 for (i = 0; i < zones_to_free; ++i, pos -= bs) {
330 uint32_t old_zone;
331
332 r = write_map(mnode, pos, 0, &old_zone);
333 on_error(r, goto exit_error);
334
335 ino_i->i_size -= bs;
336
337 if (old_zone == 0)
338 continue; /*Sparse block*/
339
340 r = mfs_free_bit(mnode->instance, old_zone, BMAP_ZONE);
341 on_error(r, goto exit_error);
342 }
343
344 ino_i->i_size = new_size;
345 return EOK;
346
347exit_error:
348 return r;
349}
350
351int
352inode_grow(struct mfs_node *mnode, size_t size_grow)
353{
354 unsigned i;
355 struct mfs_sb_info *sbi = mnode->instance->sbi;
356 struct mfs_ino_info *ino_i = mnode->ino_i;
357 const int bs = sbi->block_size;
358
359 const uint32_t old_size = ino_i->i_size;
360 const uint32_t new_size = old_size + size_grow;
361
362 assert(size_grow > 0);
363
364 /*Compute the number of zones to add to the inode*/
365 unsigned zones_to_add = 0;
366 if (old_size == 0)
367 ++zones_to_add;
368
369 zones_to_add += (new_size / bs) - (old_size / bs);
370
371 /*Compute the start zone*/
372 unsigned start_zone = old_size / bs;
373 start_zone += (old_size % bs) != 0;
374
375 mfsdebug("zones to add = %u\n", zones_to_add);
376
377 int r;
378 for (i = 0; i < zones_to_add; ++i) {
379 uint32_t new_zone;
380 uint32_t dummy;
381
382 r = mfs_alloc_bit(mnode->instance, &new_zone, BMAP_ZONE);
383 on_error(r, return r);
384
385 mfsdebug("write_map = %d\n", (int) ((start_zone + i) * bs));
386
387 block_t *b;
388 r = block_get(&b, mnode->instance->handle, new_zone,
389 BLOCK_FLAGS_NOREAD);
390 on_error(r, return r);
391
392 memset(b->data, 0, bs);
393 b->dirty = true;
394 block_put(b);
395
396 r = write_map(mnode, (start_zone + i) * bs,
397 new_zone, &dummy);
398
399 on_error(r, return r);
400
401 ino_i->i_size += bs;
402 ino_i->dirty = true;
403 }
404
405 ino_i->i_size = new_size;
406 ino_i->dirty = true;
407
408 return EOK;
409}
410
411/**
412 * @}
413 */
414
Note: See TracBrowser for help on using the repository browser.