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
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
|
/*
* This is a set of functions that provides minimal filesystem
* functionality to the Linux bootstrapper. All we can do is
* open and read files... but that's all we need 8-)
*
* This file has been ported from the DEC 32-bit Linux version
* by David Mosberger (davidm@cs.arizona.edu).
*/
#include <linux/stat.h>
#include <linux/types.h>
#include <linux/version.h>
#if LINUX_VERSION_CODE < KERNEL_VERSION(2,4,0)
# undef __KERNEL__
# include <linux/ext2_fs.h>
# define __KERNEL__
# include <linux/fs.h>
#else /* Linux 2.4.0 or later */
typedef unsigned short umode_t;
# undef __KERNEL__
# include <linux/ext2_fs.h>
# include <linux/fs.h>
# define __KERNEL__
#endif
#include "bootfs.h"
#include "cons.h"
#include "disklabel.h"
#include "utils.h"
#include "string.h"
#define MAX_OPEN_FILES 5
extern struct bootfs ext2fs;
static struct ext2_super_block sb;
static struct ext2_group_desc *gds;
static struct ext2_inode *root_inode = NULL;
static int ngroups = 0;
static int directlim; /* Maximum direct blkno */
static int ind1lim; /* Maximum single-indir blkno */
static int ind2lim; /* Maximum double-indir blkno */
static int ptrs_per_blk; /* ptrs/indirect block */
static char blkbuf[EXT2_MAX_BLOCK_SIZE];
static int cached_iblkno = -1;
static char iblkbuf[EXT2_MAX_BLOCK_SIZE];
static int cached_diblkno = -1;
static char diblkbuf[EXT2_MAX_BLOCK_SIZE];
static long dev = -1;
static long partition_offset;
static struct inode_table_entry {
struct ext2_inode inode;
int inumber;
int free;
unsigned short old_mode;
} inode_table[MAX_OPEN_FILES];
/*
* Initialize an ext2 partition starting at offset P_OFFSET; this is
* sort-of the same idea as "mounting" it. Read in the relevant
* control structures and make them available to the user. Returns 0
* if successful, -1 on failure.
*/
static int ext2_mount(long cons_dev, long p_offset, long quiet)
{
long sb_block = 1;
long sb_offset;
int i;
dev = cons_dev;
partition_offset = p_offset;
/* initialize the inode table */
for (i = 0; i < MAX_OPEN_FILES; i++) {
inode_table[i].free = 1;
inode_table[i].inumber = 0;
}
/* clear the root inode pointer (very important!) */
root_inode = NULL;
/* read in the first superblock */
sb_offset = sb_block * EXT2_MIN_BLOCK_SIZE;
if (cons_read(dev, &sb, sizeof(sb), partition_offset + sb_offset)
!= sizeof(sb))
{
printf("ext2 sb read failed\n");
return -1;
}
if (sb.s_magic != EXT2_SUPER_MAGIC) {
if (!quiet) {
printf("ext2_init: bad magic 0x%x\n", sb.s_magic);
}
return -1;
}
ngroups = (sb.s_blocks_count -
sb.s_first_data_block +
EXT2_BLOCKS_PER_GROUP(&sb) - 1)
/ EXT2_BLOCKS_PER_GROUP(&sb);
gds = (struct ext2_group_desc *)
malloc((size_t)(ngroups * sizeof(struct ext2_group_desc)));
ext2fs.blocksize = EXT2_BLOCK_SIZE(&sb);
/* read in the group descriptors (immediately follows superblock) */
cons_read(dev, gds, ngroups * sizeof(struct ext2_group_desc),
partition_offset +
ext2fs.blocksize * (EXT2_MIN_BLOCK_SIZE/ext2fs.blocksize + 1));
/*
* Calculate direct/indirect block limits for this file system
* (blocksize dependent):
*/
ext2fs.blocksize = EXT2_BLOCK_SIZE(&sb);
directlim = EXT2_NDIR_BLOCKS - 1;
ptrs_per_blk = ext2fs.blocksize/sizeof(unsigned int);
ind1lim = ptrs_per_blk + directlim;
ind2lim = (ptrs_per_blk * ptrs_per_blk) + directlim;
return 0;
}
/*
* Read the specified inode from the disk and return it to the user.
* Returns NULL if the inode can't be read...
*/
static struct ext2_inode *ext2_iget(int ino)
{
int i;
struct ext2_inode *ip;
struct inode_table_entry *itp = 0;
int group;
long offset;
ip = 0;
for (i = 0; i < MAX_OPEN_FILES; i++) {
#ifdef DEBUG_EXT2
printf("ext2_iget: looping, entry %d inode %d free %d\n",
i, inode_table[i].inumber, inode_table[i].free);
#endif
if (inode_table[i].free) {
itp = &inode_table[i];
ip = &itp->inode;
break;
}
}
if (!ip) {
printf("ext2_iget: no free inodes\n");
return NULL;
}
group = (ino-1) / sb.s_inodes_per_group;
#ifdef DEBUG_EXT2
printf("group is %d\n", group);
#endif
offset = partition_offset
+ ((long) gds[group].bg_inode_table * (long)ext2fs.blocksize)
+ (((ino - 1) % EXT2_INODES_PER_GROUP(&sb))
* EXT2_INODE_SIZE(&sb));
#ifdef DEBUG_EXT2
printf("ext2_iget: reading %ld bytes at offset %ld "
"(%ld + (%d * %d) + ((%d) %% %d) * %d) "
"(inode %d -> table %d)\n",
sizeof(struct ext2_inode), offset, partition_offset,
gds[group].bg_inode_table, ext2fs.blocksize,
ino - 1, EXT2_INODES_PER_GROUP(&sb), EXT2_INODE_SIZE(&sb),
ino, (int) (itp - inode_table));
#endif
if (cons_read(dev, ip, sizeof(struct ext2_inode), offset)
!= sizeof(struct ext2_inode))
{
printf("ext2_iget: read error\n");
return NULL;
}
itp->free = 0;
itp->inumber = ino;
itp->old_mode = ip->i_mode;
return ip;
}
/*
* Release our hold on an inode. Since this is a read-only application,
* don't worry about putting back any changes...
*/
static void ext2_iput(struct ext2_inode *ip)
{
struct inode_table_entry *itp;
/* Find and free the inode table slot we used... */
itp = (struct inode_table_entry *)ip;
#ifdef DEBUG_EXT2
printf("ext2_iput: inode %d table %d\n", itp->inumber,
(int) (itp - inode_table));
#endif
itp->inumber = 0;
itp->free = 1;
}
/*
* Map a block offset into a file into an absolute block number.
* (traverse the indirect blocks if necessary). Note: Double-indirect
* blocks allow us to map over 64Mb on a 1k file system. Therefore, for
* our purposes, we will NOT bother with triple indirect blocks.
*
* The "allocate" argument is set if we want to *allocate* a block
* and we don't already have one allocated.
*/
static int ext2_blkno(struct ext2_inode *ip, int blkoff)
{
unsigned int *lp;
unsigned int *ilp;
unsigned int *dlp;
int blkno;
int iblkno;
int diblkno;
unsigned long offset;
ilp = (unsigned int *)iblkbuf;
dlp = (unsigned int *)diblkbuf;
lp = (unsigned int *)blkbuf;
/* If it's a direct block, it's easy! */
if (blkoff <= directlim) {
return ip->i_block[blkoff];
}
/* Is it a single-indirect? */
if (blkoff <= ind1lim) {
iblkno = ip->i_block[EXT2_IND_BLOCK];
if (iblkno == 0) {
return 0;
}
/* Read the indirect block */
if (cached_iblkno != iblkno) {
offset = partition_offset + (long)iblkno * (long)ext2fs.blocksize;
if (cons_read(dev, iblkbuf, ext2fs.blocksize, offset)
!= ext2fs.blocksize)
{
printf("ext2_blkno: error on iblk read\n");
return 0;
}
cached_iblkno = iblkno;
}
blkno = ilp[blkoff-(directlim+1)];
return blkno;
}
/* Is it a double-indirect? */
if (blkoff <= ind2lim) {
/* Find the double-indirect block */
diblkno = ip->i_block[EXT2_DIND_BLOCK];
if (diblkno == 0) {
return 0;
}
/* Read in the double-indirect block */
if (cached_diblkno != diblkno) {
offset = partition_offset + (long) diblkno * (long) ext2fs.blocksize;
if (cons_read(dev, diblkbuf, ext2fs.blocksize, offset)
!= ext2fs.blocksize)
{
printf("ext2_blkno: err reading dindr blk\n");
return 0;
}
cached_diblkno = diblkno;
}
/* Find the single-indirect block pointer ... */
iblkno = dlp[(blkoff - (ind1lim+1)) / ptrs_per_blk];
if (iblkno == 0) {
return 0;
}
/* Read the indirect block */
if (cached_iblkno != iblkno) {
offset = partition_offset + (long) iblkno * (long) ext2fs.blocksize;
if (cons_read(dev, iblkbuf, ext2fs.blocksize, offset)
!= ext2fs.blocksize)
{
printf("ext2_blkno: err on iblk read\n");
return 0;
}
cached_iblkno = iblkno;
}
/* Find the block itself. */
blkno = ilp[(blkoff-(ind1lim+1)) % ptrs_per_blk];
return blkno;
}
if (blkoff > ind2lim) {
printf("ext2_blkno: block number too large: %d\n", blkoff);
return 0;
}
return -1;
}
static int ext2_breadi(struct ext2_inode *ip, long blkno, long nblks,
char *buffer)
{
long dev_blkno, ncontig, offset, nbytes, tot_bytes;
tot_bytes = 0;
if ((blkno+nblks)*ext2fs.blocksize > ip->i_size)
nblks = (ip->i_size + ext2fs.blocksize) / ext2fs.blocksize - blkno;
while (nblks) {
/*
* Contiguous reads are a lot faster, so we try to group
* as many blocks as possible:
*/
ncontig = 0; nbytes = 0;
dev_blkno = ext2_blkno(ip, blkno);
do {
++blkno; ++ncontig; --nblks;
nbytes += ext2fs.blocksize;
} while (nblks &&
ext2_blkno(ip, blkno) == dev_blkno + ncontig);
if (dev_blkno == 0) {
/* This is a "hole" */
memset(buffer, 0, nbytes);
} else {
/* Read it for real */
offset = partition_offset + (long) dev_blkno* (long) ext2fs.blocksize;
#ifdef DEBUG_EXT2
printf("ext2_bread: reading %ld bytes at offset %ld\n",
nbytes, offset);
#endif
if (cons_read(dev, buffer, nbytes, offset)
!= nbytes)
{
printf("ext2_bread: read error\n");
return -1;
}
}
buffer += nbytes;
tot_bytes += nbytes;
}
return tot_bytes;
}
static struct ext2_dir_entry_2 *ext2_readdiri(struct ext2_inode *dir_inode,
int rewind)
{
struct ext2_dir_entry_2 *dp;
static int diroffset = 0, blockoffset = 0;
/* Reading a different directory, invalidate previous state */
if (rewind) {
diroffset = 0;
blockoffset = 0;
/* read first block */
if (ext2_breadi(dir_inode, 0, 1, blkbuf) < 0)
return NULL;
}
#ifdef DEBUG_EXT2
printf("ext2_readdiri: blkoffset %d diroffset %d len %d\n",
blockoffset, diroffset, dir_inode->i_size);
#endif
if (blockoffset >= ext2fs.blocksize) {
diroffset += ext2fs.blocksize;
if (diroffset >= dir_inode->i_size)
return NULL;
#ifdef DEBUG_EXT2
printf("ext2_readdiri: reading block at %d\n",
diroffset);
#endif
/* assume that this will read the whole block */
if (ext2_breadi(dir_inode,
diroffset / ext2fs.blocksize,
1, blkbuf) < 0)
return NULL;
blockoffset = 0;
}
dp = (struct ext2_dir_entry_2 *) (blkbuf + blockoffset);
blockoffset += dp->rec_len;
#ifdef DEBUG_EXT2
printf("ext2_readdiri: returning %p = %.*s\n", dp, dp->name_len, dp->name);
#endif
return dp;
}
static struct ext2_inode *ext2_namei(const char *name)
{
char namebuf[256];
char *component;
struct ext2_inode *dir_inode;
struct ext2_dir_entry_2 *dp;
int next_ino;
/* squirrel away a copy of "namebuf" that we can modify: */
strcpy(namebuf, name);
/* start at the root: */
if (!root_inode)
root_inode = ext2_iget(EXT2_ROOT_INO);
dir_inode = root_inode;
if (!dir_inode)
return NULL;
component = strtok(namebuf, "/");
while (component) {
int component_length;
int rewind = 0;
/*
* Search for the specified component in the current
* directory inode.
*/
next_ino = -1;
component_length = strlen(component);
/* rewind the first time through */
while ((dp = ext2_readdiri(dir_inode, !rewind++))) {
if ((dp->name_len == component_length) &&
(strncmp(component, dp->name,
component_length) == 0))
{
/* Found it! */
#ifdef DEBUG_EXT2
printf("ext2_namei: found entry %s\n",
component);
#endif
next_ino = dp->inode;
break;
}
#ifdef DEBUG_EXT2
printf("ext2_namei: looping\n");
#endif
}
#ifdef DEBUG_EXT2
printf("ext2_namei: next_ino = %d\n", next_ino);
#endif
/*
* At this point, we're done with this directory whether
* we've succeeded or failed...
*/
if (dir_inode != root_inode)
ext2_iput(dir_inode);
/*
* If next_ino is negative, then we've failed (gone
* all the way through without finding anything)
*/
if (next_ino < 0) {
return NULL;
}
/*
* Otherwise, we can get this inode and find the next
* component string...
*/
dir_inode = ext2_iget(next_ino);
if (!dir_inode)
return NULL;
component = strtok(NULL, "/");
}
/*
* If we get here, then we got through all the components.
* Whatever we got must match up with the last one.
*/
return dir_inode;
}
/*
* Read block number "blkno" from the specified file.
*/
static int ext2_bread(int fd, long blkno, long nblks, char *buffer)
{
struct ext2_inode * ip;
ip = &inode_table[fd].inode;
return ext2_breadi(ip, blkno, nblks, buffer);
}
/*
* Note: don't mix any kind of file lookup or other I/O with this or
* you will lose horribly (as it reuses blkbuf)
*/
static const char * ext2_readdir(int fd, int rewind)
{
struct ext2_inode * ip = &inode_table[fd].inode;
struct ext2_dir_entry_2 * ent;
if (!S_ISDIR(ip->i_mode)) {
printf("fd %d (inode %d) is not a directory (mode %x)\n",
fd, inode_table[fd].inumber, ip->i_mode);
return NULL;
}
ent = ext2_readdiri(ip, rewind);
if (ent) {
ent->name[ent->name_len] = '\0';
return ent->name;
} else {
return NULL;
}
}
static int ext2_fstat(int fd, struct stat* buf)
{
struct ext2_inode * ip = &inode_table[fd].inode;
if (fd >= MAX_OPEN_FILES)
return -1;
memset(buf, 0, sizeof(struct stat));
/* fill in relevant fields */
buf->st_ino = inode_table[fd].inumber;
buf->st_mode = ip->i_mode;
buf->st_flags = ip->i_flags;
buf->st_nlink = ip->i_links_count;
buf->st_uid = ip->i_uid;
buf->st_gid = ip->i_gid;
buf->st_size = ip->i_size;
buf->st_blocks = ip->i_blocks;
buf->st_atime = ip->i_atime;
buf->st_mtime = ip->i_mtime;
buf->st_ctime = ip->i_ctime;
return 0; /* NOTHING CAN GO WROGN! */
}
static struct ext2_inode * ext2_follow_link(struct ext2_inode * from,
const char * base)
{
char *linkto;
if (from->i_blocks) {
linkto = blkbuf;
if (ext2_breadi(from, 0, 1, blkbuf) == -1)
return NULL;
#ifdef DEBUG_EXT2
printf("long link!\n");
#endif
} else {
linkto = (char*)from->i_block;
}
#ifdef DEBUG_EXT2
printf("symlink to %s\n", linkto);
#endif
/* Resolve relative links */
if (linkto[0] != '/') {
char *end = strrchr(base, '/');
if (end) {
char fullname[(end - base + 1) + strlen(linkto) + 1];
strncpy(fullname, base, end - base + 1);
fullname[end - base + 1] = '\0';
strcat(fullname, linkto);
#ifdef DEBUG_EXT2
printf("resolved to %s\n", fullname);
#endif
return ext2_namei(fullname);
} else {
/* Assume it's in the root */
return ext2_namei(linkto);
}
} else {
return ext2_namei(linkto);
}
}
static int ext2_open(const char *filename)
{
/*
* Unix-like open routine. Returns a small integer (actually
* an index into the inode table...
*/
struct ext2_inode * ip;
ip = ext2_namei(filename);
if (ip) {
struct inode_table_entry *itp;
while (S_ISLNK(ip->i_mode)) {
ip = ext2_follow_link(ip, filename);
if (!ip) return -1;
}
itp = (struct inode_table_entry *)ip;
return itp - inode_table;
} else
return -1;
}
static void ext2_close(int fd)
{
/* blah, hack, don't close the root inode ever */
if (&inode_table[fd].inode != root_inode)
ext2_iput(&inode_table[fd].inode);
}
struct bootfs ext2fs = {
FS_EXT2, 0,
ext2_mount,
ext2_open, ext2_bread, ext2_close,
ext2_readdir, ext2_fstat
};
|