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

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

rename functions to avoid conflicts
  • Property mode set to 100644
File size: 8.5 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
36static int
37mfs_write_inode_raw(struct mfs_node *mnode);
38
39static int
40mfs2_write_inode_raw(struct mfs_node *mnode);
41
42static int
43mfs_read_inode_raw(const struct mfs_instance *instance,
44 struct mfs_ino_info **ino_ptr, uint16_t inum);
45
46static int
47mfs2_read_inode_raw(const struct mfs_instance *instance,
48 struct mfs_ino_info **ino_ptr, uint32_t inum);
49
50
51int
52mfs_get_inode(struct mfs_instance *inst, struct mfs_ino_info **ino_i,
53 fs_index_t index)
54{
55 struct mfs_sb_info *sbi = inst->sbi;
56 int r;
57
58 if (sbi->fs_version == MFS_VERSION_V1) {
59 /*Read a MFS V1 inode*/
60 r = mfs_read_inode_raw(inst, ino_i, index);
61 } else {
62 /*Read a MFS V2/V3 inode*/
63 r = mfs2_read_inode_raw(inst, ino_i, index);
64 }
65
66 return r;
67}
68
69static int
70mfs_read_inode_raw(const struct mfs_instance *instance,
71 struct mfs_ino_info **ino_ptr, uint16_t inum) {
72 struct mfs_inode *ino;
73 struct mfs_ino_info *ino_i = NULL;
74 struct mfs_sb_info *sbi;
75 block_t *b;
76 int i, r;
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
86 ino_i = malloc(sizeof(*ino_i));
87
88 if (!ino_i) {
89 r = ENOMEM;
90 goto out_err;
91 }
92
93 const int itable_off = sbi->itable_off;
94
95 r = block_get(&b, instance->service_id,
96 itable_off + inum / sbi->ino_per_block,
97 BLOCK_FLAGS_NONE);
98 if (r != EOK)
99 goto out_err;
100
101 ino = b->data + ino_off * sizeof(struct mfs_inode);
102
103 ino_i->i_mode = conv16(sbi->native, ino->i_mode);
104 ino_i->i_uid = conv16(sbi->native, ino->i_uid);
105 ino_i->i_size = conv32(sbi->native, ino->i_size);
106 ino_i->i_mtime = conv32(sbi->native, ino->i_mtime);
107 ino_i->i_nlinks = ino->i_nlinks;
108
109 for (i = 0; i < V1_NR_DIRECT_ZONES; ++i)
110 ino_i->i_dzone[i] = conv16(sbi->native, ino->i_dzone[i]);
111
112 for (i = 0; i < V1_NR_INDIRECT_ZONES; ++i)
113 ino_i->i_izone[i] = conv16(sbi->native, ino->i_izone[i]);
114
115 r = block_put(b);
116 ino_i->dirty = false;
117 *ino_ptr = ino_i;
118
119 return r;
120
121out_err:
122 if (ino_i)
123 free(ino_i);
124 return EOK;
125}
126
127static int
128mfs2_read_inode_raw(const struct mfs_instance *instance,
129 struct mfs_ino_info **ino_ptr, uint32_t inum) {
130 struct mfs2_inode *ino;
131 struct mfs_ino_info *ino_i = NULL;
132 struct mfs_sb_info *sbi;
133 block_t *b;
134 int i, r;
135
136 ino_i = malloc(sizeof(*ino_i));
137
138 if (!ino_i) {
139 r = ENOMEM;
140 goto out_err;
141 }
142
143 sbi = instance->sbi;
144 assert(sbi);
145
146 /*inode 0 does not exist*/
147 inum -= 1;
148
149 const int itable_off = sbi->itable_off;
150 const int ino_off = inum % sbi->ino_per_block;
151
152 r = block_get(&b, instance->service_id,
153 itable_off + inum / sbi->ino_per_block,
154 BLOCK_FLAGS_NONE);
155 if (r != EOK)
156 goto out_err;
157
158 ino = b->data + ino_off * sizeof(struct mfs2_inode);
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 r = block_put(b);
176 ino_i->dirty = false;
177 *ino_ptr = ino_i;
178
179 return r;
180
181out_err:
182 if (ino_i)
183 free(ino_i);
184 return EOK;
185}
186
187int
188mfs_put_inode(struct mfs_node *mnode)
189{
190 int rc = EOK;
191
192 assert(mnode);
193 assert(mnode->ino_i);
194
195 if (!mnode->ino_i->dirty)
196 goto out;
197
198 struct mfs_instance *inst = mnode->instance;
199 assert(inst);
200 struct mfs_sb_info *sbi = inst->sbi;
201 assert(sbi);
202
203 if (sbi->fs_version == MFS_VERSION_V1)
204 rc = mfs_write_inode_raw(mnode);
205 else
206 rc = mfs2_write_inode_raw(mnode);
207
208out:
209 return rc;
210}
211
212static int
213mfs_write_inode_raw(struct mfs_node *mnode)
214{
215 int i, r;
216 block_t *b;
217 struct mfs_ino_info *ino_i = mnode->ino_i;
218 struct mfs_sb_info *sbi = mnode->instance->sbi;
219
220 const uint32_t inum = ino_i->index - 1;
221 const int itable_off = sbi->itable_off;
222 const int ino_off = inum % sbi->ino_per_block;
223 const bool native = sbi->native;
224
225 r = block_get(&b, mnode->instance->service_id,
226 itable_off + inum / sbi->ino_per_block,
227 BLOCK_FLAGS_NONE);
228
229 if (r != EOK)
230 goto out;
231
232 struct mfs_inode *ino = b->data;
233 ino += ino_off;
234
235 ino->i_mode = conv16(native, ino_i->i_mode);
236 ino->i_uid = conv16(native, ino_i->i_uid);
237 ino->i_gid = ino_i->i_gid;
238 ino->i_nlinks = ino_i->i_nlinks;
239 ino->i_size = conv32(native, ino_i->i_size);
240 ino->i_mtime = conv32(native, ino_i->i_mtime);
241
242 for (i = 0; i < V1_NR_DIRECT_ZONES; ++i)
243 ino->i_dzone[i] = conv16(native, ino_i->i_dzone[i]);
244 for (i = 0; i < V1_NR_INDIRECT_ZONES; ++i)
245 ino->i_izone[i] = conv16(native, ino_i->i_izone[i]);
246
247 b->dirty = true;
248 r = block_put(b);
249
250 ino_i->dirty = false;
251out:
252 return r;
253}
254
255static int
256mfs2_write_inode_raw(struct mfs_node *mnode)
257{
258 struct mfs_ino_info *ino_i = mnode->ino_i;
259 struct mfs_sb_info *sbi = mnode->instance->sbi;
260 block_t *b;
261 int i, r;
262
263 const uint32_t inum = ino_i->index - 1;
264 const int itable_off = sbi->itable_off;
265 const int ino_off = inum % sbi->ino_per_block;
266 const bool native = sbi->native;
267
268 r = block_get(&b, mnode->instance->service_id,
269 itable_off + inum / sbi->ino_per_block,
270 BLOCK_FLAGS_NONE);
271
272 if (r != EOK)
273 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_nlinks);
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 r = block_put(b);
295 ino_i->dirty = false;
296
297out:
298 return r;
299}
300
301int
302mfs_inode_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 if (size_shrink == 0) {
310 /*File is empty*/
311 return EOK;
312 }
313
314 const size_t old_size = ino_i->i_size;
315 const size_t new_size = ino_i->i_size - size_shrink;
316
317 assert(size_shrink <= old_size);
318
319 ino_i->dirty = true;
320
321 /*Compute the number of zones to free*/
322 unsigned zones_to_free;
323
324 size_t diff = old_size - new_size;
325 zones_to_free = diff / bs;
326
327 if (diff % bs != 0)
328 zones_to_free++;
329
330 uint32_t pos = old_size - 1;
331 unsigned i;
332 for (i = 0; i < zones_to_free; ++i, pos -= bs) {
333 uint32_t old_zone;
334
335 r = mfs_write_map(mnode, pos, 0, &old_zone);
336 if (r != EOK)
337 goto exit_error;
338
339 ino_i->i_size -= bs;
340
341 if (old_zone == 0)
342 continue; /*Sparse block*/
343
344 r = mfs_free_zone(mnode->instance, old_zone);
345 if (r != EOK)
346 goto exit_error;
347 }
348
349 ino_i->i_size = new_size;
350
351 return mfs_prune_ind_zones(mnode, new_size);
352
353exit_error:
354 return r;
355}
356
357/**
358 * @}
359 */
360
Note: See TracBrowser for help on using the repository browser.