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
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
|
/*
Copyright (C) 1994, 1995 Free Software Foundation, Inc.
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. */
#include <mach.h>
#include <hurd.h>
#include <hurd/ports.h>
#include <hurd/pager.h>
#include <hurd/fshelp.h>
#include <hurd/ioserver.h>
#include <hurd/diskfs.h>
#include <assert.h>
#include <rwlock.h>
#define __hurd__ /* Enable some hurd-specific fields. */
#include "ext2_fs.h"
#include "ext2_fs_i.h"
#undef __hurd__
/* Define this if memory objects should not be cached by the kernel.
Normally, don't define it, but defining it causes a much greater rate
of paging requests, which may be helpful in catching bugs. */
#undef DONT_CACHE_MEMORY_OBJECTS
int printf (const char *fmt, ...);
/* A block number. */
typedef unsigned long block_t;
/* ---------------------------------------------------------------- */
struct poke
{
vm_offset_t offset;
vm_size_t length;
struct poke *next;
};
struct pokel
{
struct poke *pokes, *free_pokes;
spin_lock_t lock;
struct pager *pager;
void *image;
};
void pokel_init (struct pokel *pokel, struct pager *pager, void *image);
/* Remember that data here on the disk has been modified. */
void pokel_add (struct pokel *pokel, void *loc, vm_size_t length);
/* Sync all the modified pieces of disk */
void pokel_sync (struct pokel *pokel, int wait);
/* ---------------------------------------------------------------- */
/* Bitmap routines. */
/* Returns TRUE if bit NUM is set in BITMAP. */
extern inline int
test_bit (unsigned num, char *bitmap)
{
return bitmap[num >> 3] & (1 << (num & 0x7));
}
/* Sets bit NUM in BITMAP, and returns the previous state of the bit. */
extern inline int
set_bit (unsigned num, char *bitmap)
{
char *p = bitmap + (num >> 3);
char byte = *p;
char mask = (1 << (num & 0x7));
if (byte & mask)
return 1;
else
{
*p = byte | mask;
return 0;
}
}
/* Clears bit NUM in BITMAP, and returns the previous state of the bit. */
extern inline int
clear_bit (unsigned num, char *bitmap)
{
char *p = bitmap + (num >> 3);
char byte = *p;
char mask = (1 << (num & 0x7));
if (byte & mask)
{
*p = byte & ~mask;
return 1;
}
else
return 0;
}
/* Counts the number of bits unset in MAP, a bitmap NUMCHARS long. */
unsigned long count_free (char * map, unsigned int numchars);
extern int find_first_zero_bit(void * addr, unsigned size);
extern int find_next_zero_bit (void * addr, int size, int offset);
extern unsigned long ffz(unsigned long word);
/* Returns a pointer to the first occurence of CH in the buffer BUF of len
LEN, or BUF + LEN if CH doesn't occur. */
void *memscan(void *buf, unsigned char ch, unsigned len);
/* ---------------------------------------------------------------- */
/* ext2fs specific per-file data. */
struct disknode
{
/* The inode number of this file. */
ino_t number;
/* For a directory, this array holds the number of directory entries in
each DIRBLKSIZE piece of the directory. */
int *dirents;
/* Links on hash list. */
struct node *hnext, **hprevp;
/* Lock to lock while fiddling with this inode's block allocation info. */
struct rwlock alloc_lock;
/* Where changes to our indirect blocks are added. */
struct pokel indir_pokel;
/* Random extra info used by the ext2 routines. */
struct ext2_inode_info info;
/* The upi structure for this file's file pager. */
struct user_pager_info *fileinfo;
/* True if the last page of the file has been made writable, but is only
partially allocated. */
int last_page_partially_writable;
/* True if the last block of this file (the one ending at allocsize bytes)
has actually been allocated. We must eventually do so to maintain a
consistent on-disk state, but delaying it can improveme allocation, and
it's an inconsistency easily fixed by fsck. */
int last_block_allocated;
};
struct user_pager_info
{
struct node *node;
enum pager_type
{
DISK,
FILE_DATA,
} type;
struct pager *p;
struct user_pager_info *next, **prevp;
};
/* ---------------------------------------------------------------- */
/* pager.c */
struct user_pager_info *disk_pager;
mach_port_t disk_pager_port;
void *disk_image;
/* Create the global disk pager. */
void create_disk_pager ();
/* Call this when we should turn off caching so that unused memory object
ports get freed. */
void drop_pager_softrefs (struct node *node);
/* Call this when we should turn on caching because it's no longer
important for unused memory object ports to get freed. */
void allow_pager_softrefs (struct node *node);
/* ---------------------------------------------------------------- */
/*
* These are the fs-independent mount-flags: up to 16 flags are supported
*/
#define MS_RDONLY 1 /* mount read-only */
#define MS_NOSUID 2 /* ignore suid and sgid bits */
#define MS_NODEV 4 /* disallow access to device special files */
#define MS_NOEXEC 8 /* disallow program execution */
#define MS_SYNCHRONOUS 16 /* writes are synced at once */
#define MS_REMOUNT 32 /* alter flags of a mounted FS */
/* Inode flags. */
#define S_APPEND 256 /* append-only file */
#define S_IMMUTABLE 512 /* immutable file */
#define IS_APPEND(node) ((node)->dn->info.i_flags & S_APPEND)
#define IS_IMMUTABLE(node) ((node)->dn->info.i_flags & S_IMMUTABLE)
/* ---------------------------------------------------------------- */
char *device_name;
mach_port_t device_port;
off_t device_size;
unsigned device_block_size;
/* Our in-core copy of the super-block. */
struct ext2_super_block *sblock;
/* True if sblock has been modified. */
int sblock_dirty;
/* Where the super-block is located on disk (at min-block 1). */
#define SBLOCK_BLOCK 1
#define SBLOCK_OFFS (SBLOCK_BLOCK * EXT2_MIN_BLOCK_SIZE)
#define SBLOCK_SIZE (sizeof (struct ext2_super_block))
/* The filesystem block-size. */
unsigned long block_size;
/* The log base 2 of BLOCK_SIZE. */
unsigned log2_block_size;
/* log2 of the number of device blocks (DEVICE_BLOCK_SIZE) in a filesystem
block (BLOCK_SIZE). */
unsigned log2_dev_blocks_per_fs_block;
/* log2 of the number of stat blocks (512 bytes) in a filesystem block. */
unsigned log2_stat_blocks_per_fs_block;
/* A handy page of page-aligned zeros. */
vm_address_t zeroblock;
/* Get the superblock from the disk, & setup various global info from it. */
error_t get_hypermetadata ();
/* ---------------------------------------------------------------- */
/* Returns a single page page-aligned buffer. */
vm_address_t get_page_buf ();
/* Frees a block returned by get_page_buf. */
void free_page_buf (vm_address_t buf);
/* ---------------------------------------------------------------- */
/* Random stuff calculated from the super block. */
unsigned long frag_size; /* Size of a fragment in bytes */
unsigned long frags_per_block; /* Number of fragments per block */
unsigned long inodes_per_block; /* Number of inodes per block */
unsigned long itb_per_group; /* Number of inode table blocks per group */
unsigned long db_per_group; /* Number of descriptor blocks per group */
unsigned long desc_per_block; /* Number of group descriptors per block */
unsigned long addr_per_block; /* Number of disk addresses per block */
unsigned long groups_count; /* Number of groups in the fs */
/* ---------------------------------------------------------------- */
spin_lock_t node_to_page_lock;
spin_lock_t generation_lock;
unsigned long next_generation;
/* ---------------------------------------------------------------- */
/* Functions for looking inside disk_image */
#define trunc_block(offs) (((offs) >> log2_block_size) << log2_block_size)
#define round_block(offs) \
((((offs) + block_size - 1) >> log2_block_size) << log2_block_size)
/* block num --> byte offset on disk */
#define boffs(block) ((block) << log2_block_size)
/* byte offset on disk --> block num */
#define boffs_block(offs) ((offs) >> log2_block_size)
/* byte offset on disk --> pointer to in-memory block */
#define boffs_ptr(offs) (((char *)disk_image) + (offs))
/* pointer to in-memory block --> byte offset on disk */
#define bptr_offs(ptr) ((char *)(ptr) - ((char *)disk_image))
/* block num --> pointer to in-memory block */
#define bptr(block) boffs_ptr(boffs(block))
/* pointer to in-memory block --> block num */
#define bptr_block(ptr) boffs_block(bptr_offs(ptr))
/* Get the descriptor for block group NUM. The block group descriptors are
stored starting in the block following the super block. */
extern inline struct ext2_group_desc *
group_desc(unsigned long num)
{
int desc_per_block = EXT2_DESC_PER_BLOCK(sblock);
unsigned long group_desc = num / desc_per_block;
unsigned long desc = num % desc_per_block;
return
((struct ext2_group_desc *)boffs_ptr(SBLOCK_OFFS + boffs(1 + group_desc)))
+ desc;
}
#define inode_group_num(inum) (((inum) - 1) / sblock->s_inodes_per_group)
/* Convert an inode number to the dinode on disk. */
extern inline struct ext2_inode *
dino (ino_t inum)
{
unsigned long inodes_per_group = sblock->s_inodes_per_group;
unsigned long bg_num = (inum - 1) / inodes_per_group;
unsigned long group_inum = (inum - 1) % inodes_per_group;
struct ext2_group_desc *bg = group_desc(bg_num);
unsigned long inodes_per_block = EXT2_INODES_PER_BLOCK(sblock);
block_t block = bg->bg_inode_table + (group_inum / inodes_per_block);
return ((struct ext2_inode *)bptr(block)) + group_inum % inodes_per_block;
}
/* ---------------------------------------------------------------- */
/* inode.c */
/* Write all active disknodes into the inode pager. */
void write_all_disknodes ();
/* Fetch inode INUM, set *NPP to the node structure; gain one user reference
and lock the node. */
error_t iget (ino_t inum, struct node **npp);
/* Lookup node INUM (which must have a reference already) and return it
without allocating any new references. */
struct node *ifind (ino_t inum);
void inode_init (void);
/* ---------------------------------------------------------------- */
/* What to lock if changing global data data (e.g., the superblock or block
group descriptors or bitmaps). */
spin_lock_t global_lock;
/* Where to record such changes. */
struct pokel global_pokel;
/* If the block size is less than the page size, then this bitmap is used to
record which disk blocks are actually modified, so we don't stomp on parts
of the disk which are backed by file pagers. */
char *modified_global_blocks;
spin_lock_t modified_global_blocks_lock;
/* Marks the global block BLOCK as being modified, and returns true if we
think it may have been clean before (but we may not be sure). Note that
this isn't enough to cause the block to be synced; you must call
record_global_poke to do that. */
extern inline int
global_block_modified (block_t block)
{
if (modified_global_blocks)
{
int was_clean;
spin_lock (&modified_global_blocks_lock);
was_clean = !set_bit(block, modified_global_blocks);
spin_unlock (&modified_global_blocks_lock);
return was_clean;
}
else
return 1;
}
/* This records a modification to a non-file block. */
extern inline void
record_global_poke (void *ptr)
{
int boffs = trunc_block (bptr_offs (ptr));
if (global_block_modified (boffs_block (boffs)))
pokel_add (&global_pokel, boffs_ptr(boffs), block_size);
}
/* This syncs a modification to a non-file block. */
extern inline void
sync_global_ptr (void *bptr, int wait)
{
vm_offset_t boffs = trunc_block (bptr_offs (bptr));
global_block_modified (boffs_block (boffs));
pager_sync_some (disk_pager->p, trunc_page (boffs), vm_page_size, wait);
}
/* This records a modification to one of a file's indirect blocks. */
extern inline void
record_indir_poke (struct node *node, void *ptr)
{
int boffs = trunc_block (bptr_offs (ptr));
if (global_block_modified (boffs_block (boffs)))
pokel_add (&node->dn->indir_pokel, boffs_ptr(boffs), block_size);
}
/* ---------------------------------------------------------------- */
extern inline void
sync_super_block ()
{
sblock_dirty = 0; /* It doesn't matter if this gets stomped. */
sync_global_ptr (sblock, 1);
}
extern inline void
sync_global_data ()
{
pokel_sync (&global_pokel, 1);
diskfs_set_hypermetadata (1, 0);
}
/* Sync all allocation information and node NP if diskfs_synchronous. */
extern inline void
alloc_sync (struct node *np)
{
if (diskfs_synchronous)
{
if (np)
{
diskfs_node_update (np, 1);
pokel_sync (&np->dn->indir_pokel, 1);
}
sync_global_data ();
}
}
/* ---------------------------------------------------------------- */
/* getblk.c */
void ext2_discard_prealloc (struct node *node);
/* Returns in DISK_BLOCK the disk block correspding to BLOCK in NODE. If
there is no such block yet, but CREATE is true, then it is created,
otherwise EINVAL is returned. */
error_t ext2_getblk (struct node *node, block_t block, int create, block_t *disk_block);
block_t ext2_new_block (block_t goal, u32 * prealloc_count, u32 * prealloc_block);
void ext2_free_blocks (block_t block, unsigned long count);
/* ---------------------------------------------------------------- */
/* Write disk block ADDR with DATA of LEN bytes, waiting for completion. */
error_t dev_write_sync (block_t addr, vm_address_t data, long len);
/* Write diskblock ADDR with DATA of LEN bytes; don't bother waiting
for completion. */
error_t dev_write (block_t addr, vm_address_t data, long len);
/* Read disk block ADDR; put the address of the data in DATA; read LEN
bytes. Always *DATA should be a full page no matter what. */
error_t dev_read_sync (block_t addr, vm_address_t *data, long len);
/* ---------------------------------------------------------------- */
extern void ext2_error (const char *, const char *, ...)
__attribute__ ((format (printf, 2, 3)));
extern void ext2_panic (const char *, const char *, ...)
__attribute__ ((format (printf, 2, 3)));
extern void ext2_warning (const char *, const char *, ...)
__attribute__ ((format (printf, 2, 3)));
/* Enable some more error checking. */
int check_strict;
|