1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
|
/* Inode allocation routines.
Copyright (C) 1995 Free Software Foundation, Inc.
Converted to work under the hurd by Miles Bader <miles@gnu.ai.mit.edu>
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2, or (at
your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
/*
* linux/fs/ext2/ialloc.c
*
* Copyright (C) 1992, 1993, 1994, 1995
* Remy Card (card@masi.ibp.fr)
* Laboratoire MASI - Institut Blaise Pascal
* Universite Pierre et Marie Curie (Paris VI)
*
* BSD ufs-inspired inode and directory allocation by
* Stephen Tweedie (sct@dcs.ed.ac.uk), 1993
*/
/*
* The free inodes are managed by bitmaps. A file system contains several
* blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
* block for inodes, N blocks for the inode table and data blocks.
*
* The file system contains group descriptors which are located after the
* super block. Each descriptor contains the number of the bitmap block and
* the free blocks count in the block. The descriptors are loaded in memory
* when a file system is mounted (see ext2_read_super).
*/
#include "ext2fs.h"
/* ---------------------------------------------------------------- */
/* Free node NP; the on disk copy has already been synced with
diskfs_node_update (where NP->dn_stat.st_mode was 0). It's
mode used to be OLD_MODE. */
void
diskfs_free_node (struct node *np, mode_t old_mode)
{
char *bh;
unsigned long block_group;
unsigned long bit;
struct ext2_group_desc *gdp;
ino_t inum = np->dn->number;
ext2_debug ("freeing inode %lu\n", inum);
spin_lock (&global_lock);
if (inum < EXT2_FIRST_INO || inum > sblock->s_inodes_count)
{
ext2_error ("free_inode", "reserved inode or nonexistent inode");
spin_unlock (&global_lock);
return;
}
block_group = (inum - 1) / sblock->s_inodes_per_group;
bit = (inum - 1) % sblock->s_inodes_per_group;
gdp = group_desc (block_group);
bh = bptr (gdp->bg_inode_bitmap);
if (!clear_bit (bit, bh))
ext2_warning ("ext2_free_inode", "bit already cleared for inode %u", inum);
else
{
pokel_add (&global_pokel, bh, block_size);
gdp->bg_free_inodes_count++;
if (S_ISDIR (old_mode))
gdp->bg_used_dirs_count--;
pokel_add (&global_pokel, gdp, sizeof *gdp);
sblock->s_free_inodes_count++;
}
sblock_dirty = 1;
spin_unlock (&global_lock);
alloc_sync(0);
}
/* ---------------------------------------------------------------- */
/*
* There are two policies for allocating an inode. If the new inode is
* a directory, then a forward search is made for a block group with both
* free space and a low directory-to-inode ratio; if that fails, then of
* the groups with above-average free space, that group with the fewest
* directories already is chosen.
*
* For other inodes, search forward from the parent directory\'s block
* group to find a free inode.
*/
ino_t
ext2_alloc_inode (ino_t dir_inum, mode_t mode)
{
char *bh;
int i, j, inum, avefreei;
struct ext2_group_desc *gdp;
struct ext2_group_desc *tmp;
spin_lock (&global_lock);
repeat:
gdp = NULL;
i = 0;
if (S_ISDIR (mode))
{
avefreei = sblock->s_free_inodes_count / groups_count;
/* I am not yet convinced that this next bit is necessary.
i = inode_group_num(dir_inum);
for (j = 0; j < groups_count; j++)
{
tmp = group_desc (i);
if ((tmp->bg_used_dirs_count << 8) < tmp->bg_free_inodes_count)
{
gdp = tmp;
break;
}
else
i = ++i % groups_count;
}
*/
if (!gdp)
{
for (j = 0; j < groups_count; j++)
{
tmp = group_desc (j);
if (tmp->bg_free_inodes_count
&& tmp->bg_free_inodes_count >= avefreei)
{
if (!gdp ||
(tmp->bg_free_blocks_count > gdp->bg_free_blocks_count))
{
i = j;
gdp = tmp;
}
}
}
}
}
else
{
/*
* Try to place the inode in its parent directory
*/
i = inode_group_num(dir_inum);
tmp = group_desc (i);
if (tmp->bg_free_inodes_count)
gdp = tmp;
else
{
/*
* Use a quadratic hash to find a group with a
* free inode
*/
for (j = 1; j < groups_count; j <<= 1)
{
i += j;
if (i >= groups_count)
i -= groups_count;
tmp = group_desc (i);
if (tmp->bg_free_inodes_count)
{
gdp = tmp;
break;
}
}
}
if (!gdp)
{
/*
* That failed: try linear search for a free inode
*/
i = inode_group_num(dir_inum) + 1;
for (j = 2; j < groups_count; j++)
{
if (++i >= groups_count)
i = 0;
tmp = group_desc (i);
if (tmp->bg_free_inodes_count)
{
gdp = tmp;
break;
}
}
}
}
if (!gdp)
{
spin_unlock (&global_lock);
return 0;
}
bh = bptr (gdp->bg_inode_bitmap);
if ((inum =
find_first_zero_bit ((unsigned long *) bh, sblock->s_inodes_per_group))
< sblock->s_inodes_per_group)
{
if (set_bit (inum, bh))
{
ext2_warning ("ext2_new_inode",
"bit already set for inode %d", inum);
goto repeat;
}
pokel_add (&global_pokel, bh, block_size);
}
else
{
if (gdp->bg_free_inodes_count != 0)
{
ext2_error ("ext2_new_inode",
"Free inodes count corrupted in group %d", i);
inum = 0;
goto sync_out;
}
goto repeat;
}
inum += i * sblock->s_inodes_per_group + 1;
if (inum < EXT2_FIRST_INO || inum > sblock->s_inodes_count)
{
ext2_error ("ext2_new_inode",
"reserved inode or inode > inodes count - "
"block_group = %d,inode=%d", i, inum);
inum = 0;
goto sync_out;
}
gdp->bg_free_inodes_count--;
if (S_ISDIR (mode))
gdp->bg_used_dirs_count++;
pokel_add (&global_pokel, gdp, sizeof *gdp);
sblock->s_free_inodes_count--;
sblock_dirty = 1;
sync_out:
spin_unlock (&global_lock);
alloc_sync (0);
return inum;
}
/* ---------------------------------------------------------------- */
/* The user must define this function. Allocate a new node to be of
mode MODE in locked directory DP (don't actually set the mode or
modify the dir, that will be done by the caller); the user
responsible for the request can be identified with CRED. Set *NP
to be the newly allocated node. */
error_t
diskfs_alloc_node (struct node *dir, mode_t mode, struct node **node)
{
error_t err;
int sex;
struct node *np;
ino_t inum = ext2_alloc_inode (dir->dn->number, mode);
if (inum == 0)
return ENOSPC;
err = iget (inum, &np);
if (err)
return err;
if (np->dn_stat.st_mode)
ext2_panic("diskfs_alloc_node", "Duplicate inode: %d", inum);
if (np->dn_stat.st_blocks)
{
ext2_warning("diskfs_alloc_node",
"Free inode %d had %d blocks", inum, np->dn_stat.st_blocks);
np->dn_stat.st_blocks = 0;
np->dn_set_ctime = 1;
}
np->dn_stat.st_flags = 0;
/*
* Set up a new generation number for this inode.
*/
spin_lock (&generation_lock);
sex = diskfs_mtime->seconds;
if (++next_generation < (u_long)sex)
next_generation = sex;
np->dn_stat.st_gen = next_generation;
spin_unlock (&generation_lock);
alloc_sync (np);
*node = np;
return 0;
}
/* ---------------------------------------------------------------- */
unsigned long
ext2_count_free_inodes ()
{
#ifdef EXT2FS_DEBUG
struct ext2_super_block *es;
unsigned long desc_count, bitmap_count, x;
int bitmap_nr;
struct ext2_group_desc *gdp;
int i;
spin_lock (&global_lock);
desc_count = 0;
bitmap_count = 0;
gdp = NULL;
for (i = 0; i < groups_count; i++)
{
gdp = group_desc (i);
desc_count += gdp->bg_free_inodes_count;
x = count_free (gdp->bg_inode_bitmap, sblock->s_inodes_per_group / 8);
printf ("group %d: stored = %d, counted = %lu\n", i, gdp->bg_free_inodes_count, x);
bitmap_count += x;
}
printf ("ext2_count_free_inodes: stored = %lu, computed = %lu, %lu\n",
sblock->s_free_inodes_count, desc_count, bitmap_count);
spin_unlock (&global_lock);
return desc_count;
#else
return sblock->s_free_inodes_count;
#endif
}
/* ---------------------------------------------------------------- */
void
ext2_check_inodes_bitmap ()
{
int i;
struct ext2_group_desc *gdp;
unsigned long desc_count, bitmap_count, x;
spin_lock (&global_lock);
desc_count = 0;
bitmap_count = 0;
gdp = NULL;
for (i = 0; i < groups_count; i++)
{
gdp = group_desc (i);
desc_count += gdp->bg_free_inodes_count;
x = count_free (bptr (gdp->bg_inode_bitmap),
sblock->s_inodes_per_group / 8);
if (gdp->bg_free_inodes_count != x)
ext2_error ("ext2_check_inodes_bitmap",
"Wrong free inodes count in group %d, "
"stored = %d, counted = %lu", i,
gdp->bg_free_inodes_count, x);
bitmap_count += x;
}
if (sblock->s_free_inodes_count != bitmap_count)
ext2_error ("ext2_check_inodes_bitmap",
"Wrong free inodes count in super block, "
"stored = %lu, counted = %lu",
(unsigned long) sblock->s_free_inodes_count, bitmap_count);
spin_unlock (&global_lock);
}
|