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
|
// MIT License, Copyright (c) 2020 Marvin Borner
// EXT2 based filesystem
#include <def.h>
#include <fs.h>
#include <ide.h>
#include <mem.h>
#include <print.h>
#include <str.h>
void *buffer_read(int block)
{
return ide_read(malloc(BLOCK_SIZE), block);
}
struct superblock *get_superblock()
{
struct superblock *sb = buffer_read(EXT2_SUPER);
if (sb->magic != EXT2_MAGIC)
return NULL;
return sb;
}
struct bgd *get_bgd()
{
return buffer_read(EXT2_SUPER + 1);
}
struct inode *get_inode(int i)
{
struct superblock *s = get_superblock();
struct bgd *b = get_bgd();
int block_group = (i - 1) / s->inodes_per_group;
int index = (i - 1) % s->inodes_per_group;
int block = (index * INODE_SIZE) / BLOCK_SIZE;
b += block_group;
u32 *data = buffer_read(b->inode_table + block);
struct inode *in =
(struct inode *)((u32)data + (index % (BLOCK_SIZE / INODE_SIZE)) * INODE_SIZE);
return in;
}
u32 read_indirect(u32 indirect, u32 block_num)
{
char *data = buffer_read(indirect);
return *(u32 *)((u32)data + block_num * 4);
}
void *read_file(struct inode *in)
{
//assert(in);
if (!in)
return NULL;
int num_blocks = in->blocks / (BLOCK_SIZE / SECTOR_SIZE);
// assert(num_blocks != 0);
if (!num_blocks)
return NULL;
u32 sz = BLOCK_SIZE * num_blocks;
void *buf = malloc(sz);
//assert(buf != NULL);
int indirect = 0;
// Single indirect pointer
if (num_blocks > 12) {
indirect = in->block[12];
}
int blocknum = 0;
char *data;
for (int i = 0; i < num_blocks; i++) {
if (i < 12) {
blocknum = in->block[i];
data = buffer_read(blocknum);
memcpy((void *)((u32)buf + (i * BLOCK_SIZE)), data, BLOCK_SIZE);
}
if (i > 12) {
blocknum = read_indirect(indirect, i - 13);
data = buffer_read(blocknum);
memcpy((void *)((u32)buf + ((i - 1) * BLOCK_SIZE)), data, BLOCK_SIZE);
}
}
return buf;
}
int find_inode(const char *name, int dir_inode)
{
if (!dir_inode)
return -1;
struct inode *i = get_inode(dir_inode);
char *buf = malloc(BLOCK_SIZE * i->blocks / 2);
memset(buf, 0, BLOCK_SIZE * i->blocks / 2);
for (u32 q = 0; q < i->blocks / 2; q++) {
char *data = buffer_read(i->block[q]);
memcpy((void *)((u32)buf + (q * BLOCK_SIZE)), data, BLOCK_SIZE);
}
struct dirent *d = (struct dirent *)buf;
u32 sum = 0;
do {
// Calculate the 4byte aligned size of each entry
sum += d->total_len;
//printf("%2d %10s\t%2d %3d\n", (int)d->inode, d->name, d->name_len, d->rec_len);
if (strncmp((void *)d->name, name, d->name_len) == 0) {
free(buf);
return d->inode_num;
}
d = (struct dirent *)((u32)d + d->total_len);
} while (sum < (1024 * i->blocks / 2));
free(buf);
return -1;
}
void ls_root()
{
struct inode *i = get_inode(2);
char *buf = malloc(BLOCK_SIZE * i->blocks / 2);
for (u32 q = 0; q < i->blocks / 2; q++) {
char *data = buffer_read(i->block[q]);
memcpy((void *)((u32)buf + (q * BLOCK_SIZE)), data, BLOCK_SIZE);
}
struct dirent *d = (struct dirent *)buf;
int sum = 0;
int calc = 0;
printf("Root directory:\n");
do {
calc = (sizeof(struct dirent) + d->name_len + 4) & ~0x3;
sum += d->total_len;
printf("/%s\n", d->name);
if (d->total_len != calc && sum == 1024)
d->total_len = calc;
d = (struct dirent *)((u32)d + d->total_len);
} while (sum < 1024);
}
|
