Mercurial > hg > toybox
annotate toys/mke2fs.c @ 226:6aac63925eff
Update web pages.
author | Rob Landley <rob@landley.net> |
---|---|
date | Sat, 05 Jan 2008 18:09:49 -0600 |
parents | 30a6db5a95c2 |
children | d4176f3f3835 |
rev | line source |
---|---|
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
1 /* vi: set ts=4: |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
2 * |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
3 * mke2fs.c - Create an ext2 filesystem image. |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
4 * |
194
30a6db5a95c2
Add comments about SUSv3 specs (or lack thereof).
Rob Landley <rob@landley.net>
parents:
186
diff
changeset
|
5 * Copyright 2006, 2007 Rob Landley <rob@landley.net> |
30a6db5a95c2
Add comments about SUSv3 specs (or lack thereof).
Rob Landley <rob@landley.net>
parents:
186
diff
changeset
|
6 * |
30a6db5a95c2
Add comments about SUSv3 specs (or lack thereof).
Rob Landley <rob@landley.net>
parents:
186
diff
changeset
|
7 * Not in SUSv3. |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
8 */ |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
9 |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
10 #include "toys.h" |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
11 |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
12 // Shortcut to our global data structure, since we use it so much. |
76 | 13 #define TT toy.mke2fs |
14 | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
15 #define INODES_RESERVED 10 |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
16 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
17 static uint32_t div_round_up(uint32_t a, uint32_t b) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
18 { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
19 uint32_t c = a/b; |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
20 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
21 if (a%b) c++; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
22 return c; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
23 } |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
24 |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
25 // Calculate data blocks plus index blocks needed to hold a file. |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
26 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
27 static uint32_t file_blocks_used(uint64_t size, uint32_t *blocklist) |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
28 { |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
29 uint32_t dblocks = (uint32_t)((size+(TT.blocksize-1))/TT.blocksize); |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
30 uint32_t idx=TT.blocksize/4, iblocks=0, diblocks=0, tiblocks=0; |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
31 |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
32 // Fill out index blocks in inode. |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
33 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
34 if (blocklist) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
35 int i; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
36 |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
37 // Direct index blocks |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
38 for (i=0; i<13 && i<dblocks; i++) blocklist[i] = i; |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
39 // Singly indirect index blocks |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
40 if (dblocks > 13+idx) blocklist[13] = 13+idx; |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
41 // Doubly indirect index blocks |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
42 idx = 13 + idx + (idx*idx); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
43 if (dblocks > idx) blocklist[14] = idx; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
44 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
45 return 0; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
46 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
47 |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
48 // Account for direct, singly, doubly, and triply indirect index blocks |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
49 |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
50 if (dblocks > 12) { |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
51 iblocks = ((dblocks-13)/idx)+1; |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
52 if (iblocks > 1) { |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
53 diblocks = ((iblocks-2)/idx)+1; |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
54 if (diblocks > 1) |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
55 tiblocks = ((diblocks-2)/idx)+1; |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
56 } |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
57 } |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
58 |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
59 return dblocks + iblocks + diblocks + tiblocks; |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
60 } |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
61 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
62 // Use the parent pointer to iterate through the tree non-recursively. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
63 static struct dirtree *treenext(struct dirtree *this) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
64 { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
65 while (this && !this->next) this = this->parent; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
66 if (this) this = this->next; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
67 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
68 return this; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
69 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
70 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
71 // Recursively calculate the number of blocks used by each inode in the tree. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
72 // Returns blocks used by this directory, assigns bytes used to *size. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
73 // Writes total block count to TT.treeblocks and inode count to TT.treeinodes. |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
74 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
75 static long check_treesize(struct dirtree *this, off_t *size) |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
76 { |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
77 long blocks; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
78 |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
79 while (this) { |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
80 *size += sizeof(struct ext2_dentry) + strlen(this->name); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
81 |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
82 if (this->child) |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
83 this->st.st_blocks = check_treesize(this->child, &this->st.st_size); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
84 else if (S_ISREG(this->st.st_mode)) { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
85 this->st.st_blocks = file_blocks_used(this->st.st_size, 0); |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
86 TT.treeblocks += this->st.st_blocks; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
87 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
88 this = this->next; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
89 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
90 TT.treeblocks += blocks = file_blocks_used(*size, 0); |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
91 TT.treeinodes++; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
92 |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
93 return blocks; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
94 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
95 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
96 // Calculate inode numbers and link counts. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
97 // |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
98 // To do this right I need to copy the tree and sort it, but here's a really |
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
99 // ugly n^2 way of dealing with the problem that doesn't scale well to large |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
100 // numbers of files (> 100,000) but can be done in very little code. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
101 // This rewrites inode numbers to their final values, allocating depth first. |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
102 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
103 static void check_treelinks(struct dirtree *tree) |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
104 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
105 struct dirtree *this=tree, *that; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
106 long inode = INODES_RESERVED; |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
107 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
108 while (this) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
109 ++inode; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
110 // Since we can't hardlink to directories, we know their link count. |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
111 if (S_ISDIR(this->st.st_mode)) this->st.st_nlink = 2; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
112 else { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
113 dev_t new = this->st.st_dev; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
114 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
115 if (!new) continue; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
116 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
117 this->st.st_nlink = 0; |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
118 for (that = tree; that; that = treenext(that)) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
119 if (this->st.st_ino == that->st.st_ino && |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
120 this->st.st_dev == that->st.st_dev) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
121 { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
122 this->st.st_nlink++; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
123 this->st.st_ino = inode; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
124 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
125 } |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
126 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
127 this->st.st_ino = inode; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
128 this = treenext(this); |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
129 } |
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
130 } |
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
131 |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
132 // According to http://www.opengroup.org/onlinepubs/9629399/apdxa.htm |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
133 // we should generate a uuid structure by reading a clock with 100 nanosecond |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
134 // precision, normalizing it to the start of the gregorian calendar in 1582, |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
135 // and looking up our eth0 mac address. |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
136 // |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
137 // On the other hand, we have 128 bits to come up with a unique identifier, of |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
138 // which 6 have a defined value. /dev/urandom it is. |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
139 |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
140 static void create_uuid(char *uuid) |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
141 { |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
142 // Read 128 random bits |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
143 int fd = xopen("/dev/urandom", O_RDONLY); |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
144 xreadall(fd, uuid, 16); |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
145 close(fd); |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
146 |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
147 // Claim to be a DCE format UUID. |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
148 uuid[6] = (uuid[6] & 0x0F) | 0x40; |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
149 uuid[8] = (uuid[8] & 0x3F) | 0x80; |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
150 |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
151 // rfc2518 section 6.4.1 suggests if we're not using a macaddr, we should |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
152 // set bit 1 of the node ID, which is the mac multicast bit. This means we |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
153 // should never collide with anybody actually using a macaddr. |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
154 uuid[11] = uuid[11] | 128; |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
155 } |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
156 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
157 // Calculate inodes per group from total inodes. |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
158 static uint32_t get_inodespg(uint32_t inodes) |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
159 { |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
160 uint32_t temp; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
161 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
162 // Round up to fill complete inode blocks. |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
163 temp = (inodes + TT.groups - 1) / TT.groups; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
164 inodes = TT.blocksize/sizeof(struct ext2_inode); |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
165 return ((temp + inodes - 1)/inodes)*inodes; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
166 } |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
167 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
168 // Fill out superblock and TT structures. |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
169 |
82 | 170 static void init_superblock(struct ext2_superblock *sb) |
81
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
171 { |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
172 uint32_t temp; |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
173 |
82 | 174 // Set log_block_size and log_frag_size. |
76 | 175 |
82 | 176 for (temp = 0; temp < 4; temp++) if (TT.blocksize == 1024<<temp) break; |
177 if (temp==4) error_exit("bad blocksize"); | |
76 | 178 sb->log_block_size = sb->log_frag_size = SWAP_LE32(temp); |
179 | |
80
7a058d60faf1
One more field, minor shrinking, and start on block groups.
Rob Landley <rob@landley.net>
parents:
79
diff
changeset
|
180 // Fill out blocks_count, r_blocks_count, first_data_block |
76 | 181 |
182 sb->blocks_count = SWAP_LE32(TT.blocks); | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
183 sb->free_blocks_count = SWAP_LE32(TT.freeblocks); |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
184 temp = (TT.blocks * (uint64_t)TT.reserved_percent) / 100; |
76 | 185 sb->r_blocks_count = SWAP_LE32(temp); |
186 | |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
187 sb->first_data_block = SWAP_LE32(TT.blocksize == 1024 ? 1 : 0); |
80
7a058d60faf1
One more field, minor shrinking, and start on block groups.
Rob Landley <rob@landley.net>
parents:
79
diff
changeset
|
188 |
76 | 189 // Set blocks_per_group and frags_per_group, which is the size of an |
190 // allocation bitmap that fits in one block (I.E. how many bits per block)? | |
191 | |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
192 sb->blocks_per_group = sb->frags_per_group = SWAP_LE32(TT.blockbits); |
76 | 193 |
79
1aff4181427b
Filling out most of the ext2 superblock correctly now.
Rob Landley <rob@landley.net>
parents:
76
diff
changeset
|
194 // Set inodes_per_group and total inodes_count |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
195 sb->inodes_per_group = SWAP_LE32(TT.inodespg); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
196 sb->inodes_count = SWAP_LE32(TT.inodespg * TT.groups); |
79
1aff4181427b
Filling out most of the ext2 superblock correctly now.
Rob Landley <rob@landley.net>
parents:
76
diff
changeset
|
197 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
198 // Determine free inodes. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
199 temp = TT.inodespg*TT.groups - INODES_RESERVED; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
200 if (temp < TT.treeinodes) error_exit("Not enough inodes.\n"); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
201 sb->free_inodes_count = SWAP_LE32(temp - TT.treeinodes); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
202 |
79
1aff4181427b
Filling out most of the ext2 superblock correctly now.
Rob Landley <rob@landley.net>
parents:
76
diff
changeset
|
203 // Fill out the rest of the superblock. |
76 | 204 sb->max_mnt_count=0xFFFF; |
205 sb->wtime = sb->lastcheck = sb->mkfs_time = SWAP_LE32(time(NULL)); | |
206 sb->magic = SWAP_LE32(0xEF53); | |
207 sb->state = sb->errors = SWAP_LE16(1); | |
208 | |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
209 sb->rev_level = SWAP_LE32(1); |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
210 sb->first_ino = SWAP_LE32(INODES_RESERVED+1); |
81
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
211 sb->inode_size = SWAP_LE16(sizeof(struct ext2_inode)); |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
212 sb->feature_incompat = SWAP_LE32(EXT2_FEATURE_INCOMPAT_FILETYPE); |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
213 sb->feature_ro_compat = SWAP_LE32(EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER); |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
214 |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
215 create_uuid(sb->uuid); |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
216 |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
217 // TODO If we're called as mke3fs or mkfs.ext3, do a journal. |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
218 |
75
89ca591a9236
More random progress on mke2fs. Nothing to see yet.
Rob Landley <rob@landley.net>
parents:
53
diff
changeset
|
219 //if (strchr(toys.which->name,'3')) |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
220 // sb->feature_compat |= SWAP_LE32(EXT3_FEATURE_COMPAT_HAS_JOURNAL); |
81
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
221 } |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
222 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
223 // Does this group contain a superblock backup (and group descriptor table)? |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
224 static int is_sb_group(uint32_t group) |
82 | 225 { |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
226 int i; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
227 |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
228 // Superblock backups are on groups 0, 1, and powers of 3, 5, and 7. |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
229 if(!group || group==1) return 1; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
230 for (i=3; i<9; i+=2) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
231 int j = i; |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
232 while (j<group) j*=i; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
233 if (j==group) return 1; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
234 } |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
235 return 0; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
236 } |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
237 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
238 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
239 // Number of blocks used in group by optional superblock/group list backup. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
240 static int group_superblock_overhead(uint32_t group) |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
241 { |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
242 int used; |
82 | 243 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
244 if (!is_sb_group(group)) return 0; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
245 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
246 // How many blocks does the group descriptor table take up? |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
247 used = TT.groups * sizeof(struct ext2_group); |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
248 used += TT.blocksize - 1; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
249 used /= TT.blocksize; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
250 // Plus the superblock itself. |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
251 used++; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
252 // And a corner case. |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
253 if (!group && TT.blocksize == 1024) used++; |
82 | 254 |
255 return used; | |
256 } | |
257 | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
258 // Number of blocks used in group to store superblock/group/inode list |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
259 static int group_overhead(uint32_t group) |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
260 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
261 // Return superblock backup overhead (if any), plus block/inode |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
262 // allocation bitmaps, plus inode tables. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
263 return group_superblock_overhead(group) + 2 + get_inodespg(TT.inodespg) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
264 / (TT.blocksize/sizeof(struct ext2_inode)); |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
265 } |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
266 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
267 // In bitmap "array" set "len" bits starting at position "start" (from 0). |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
268 static void bits_set(char *array, int start, int len) |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
269 { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
270 while(len) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
271 if ((start&7) || len<8) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
272 array[start/8]|=(1<<(start&7)); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
273 start++; |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
274 len--; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
275 } else { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
276 array[start/8]=255; |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
277 start+=8; |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
278 len-=8; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
279 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
280 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
281 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
282 |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
283 // Seek past len bytes (to maintain sparse file), or write zeroes if output |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
284 // not seekable |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
285 static void put_zeroes(int len) |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
286 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
287 if(-1 == lseek(TT.fsfd, len, SEEK_SET)) { |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
288 memset(toybuf, 0, sizeof(toybuf)); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
289 while (len) { |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
290 int out = len > sizeof(toybuf) ? sizeof(toybuf) : len; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
291 xwrite(TT.fsfd, toybuf, out); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
292 len -= out; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
293 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
294 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
295 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
296 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
297 // Fill out an inode structure from struct stat info in dirtree. |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
298 static void fill_inode(struct ext2_inode *in, struct dirtree *this) |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
299 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
300 uint32_t fbu[15]; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
301 int temp; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
302 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
303 file_blocks_used(this->st.st_size, fbu); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
304 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
305 // If this inode needs data blocks allocated to it. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
306 if (this->st.st_size) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
307 int i, group = TT.nextblock/TT.blockbits; |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
308 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
309 // TODO: teach this about indirect blocks. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
310 for (i=0; i<15; i++) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
311 // If we just jumped into a new group, skip group overhead blocks. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
312 while (group >= TT.nextgroup) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
313 TT.nextblock += group_overhead(TT.nextgroup++); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
314 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
315 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
316 // TODO : S_ISREG/DIR/CHR/BLK/FIFO/LNK/SOCK(m) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
317 in->mode = SWAP_LE32(this->st.st_mode); |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
318 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
319 in->uid = SWAP_LE16(this->st.st_uid & 0xFFFF); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
320 in->uid_high = SWAP_LE16(this->st.st_uid >> 16); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
321 in->gid = SWAP_LE16(this->st.st_gid & 0xFFFF); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
322 in->gid_high = SWAP_LE16(this->st.st_gid >> 16); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
323 in->size = SWAP_LE32(this->st.st_size & 0xFFFFFFFF); |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
324 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
325 // Contortions to make the compiler not generate a warning for x>>32 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
326 // when x is 32 bits. The optimizer should clean this up. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
327 if (sizeof(this->st.st_size) > 4) temp = 32; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
328 else temp = 0; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
329 if (temp) in->dir_acl = SWAP_LE32(this->st.st_size >> temp); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
330 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
331 in->atime = SWAP_LE32(this->st.st_atime); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
332 in->ctime = SWAP_LE32(this->st.st_ctime); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
333 in->mtime = SWAP_LE32(this->st.st_mtime); |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
334 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
335 in->links_count = SWAP_LE16(this->st.st_nlink); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
336 in->blocks = SWAP_LE32(this->st.st_blocks); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
337 // in->faddr |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
338 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
339 |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
340 // Works like an archiver. |
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
341 // The first argument is the name of the file to create. If it already |
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
342 // exists, that size will be used. |
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
343 |
186
25447caf1b4b
Change command main() functions to return void, and exit(toys.exitval) from
Rob Landley <rob@landley.net>
parents:
143
diff
changeset
|
344 void mke2fs_main(void) |
81
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
345 { |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
346 int i, temp; |
82 | 347 off_t length; |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
348 uint32_t usedblocks, usedinodes, dtiblk, dtbblk; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
349 struct dirtree *dti, *dtb; |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
350 |
81
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
351 // Handle command line arguments. |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
352 |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
353 if (toys.optargs[1]) { |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
354 sscanf(toys.optargs[1], "%u", &TT.blocks); |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
355 temp = O_RDWR|O_CREAT; |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
356 } else temp = O_RDWR; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
357 if (!TT.reserved_percent) TT.reserved_percent = 5; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
358 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
359 // TODO: Check if filesystem is mounted here |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
360 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
361 // For mke?fs, open file. For gene?fs, create file. |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
362 TT.fsfd = xcreate(*toys.optargs, temp, 0777); |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
363 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
364 // Determine appropriate block size and block count from file length. |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
365 // (If no length, default to 4k. They can override it on the cmdline.) |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
366 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
367 length = fdlength(TT.fsfd); |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
368 if (!TT.blocksize) TT.blocksize = (length && length < 1<<29) ? 1024 : 4096; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
369 TT.blockbits = 8*TT.blocksize; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
370 if (!TT.blocks) TT.blocks = length/TT.blocksize; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
371 |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
372 // Collect gene2fs list or lost+found, calculate requirements. |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
373 |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
374 if (TT.gendir) { |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
375 strncpy(toybuf, TT.gendir, sizeof(toybuf)); |
143
9cbb323f297f
Break out dirtree.c and let it call a function instead of returning the data.
Rob Landley <rob@landley.net>
parents:
112
diff
changeset
|
376 dti = dirtree_read(toybuf, NULL, NULL); |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
377 } else { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
378 dti = xzalloc(sizeof(struct dirtree)+11); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
379 strcpy(dti->name, "lost+found"); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
380 dti->st.st_mode = S_IFDIR|0755; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
381 dti->st.st_ctime = dti->st.st_mtime = time(NULL); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
382 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
383 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
384 // Add root directory inode. This is iterated through for when finding |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
385 // blocks, but not when finding inodes. The tree's parent pointers don't |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
386 // point back into this. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
387 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
388 dtb = xzalloc(sizeof(struct dirtree)+1); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
389 dtb->st.st_mode = S_IFDIR|0755; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
390 dtb->st.st_ctime = dtb->st.st_mtime = time(NULL); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
391 dtb->child = dti; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
392 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
393 // Figure out how much space is used by preset files |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
394 length = check_treesize(dtb, &(dtb->st.st_size)); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
395 check_treelinks(dtb); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
396 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
397 // Figure out how many total inodes we need. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
398 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
399 if (!TT.inodes) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
400 if (!TT.bytes_per_inode) TT.bytes_per_inode = 8192; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
401 TT.inodes = (TT.blocks * (uint64_t)TT.blocksize) / TT.bytes_per_inode; |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
402 } |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
403 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
404 // If we're generating a filesystem and have no idea how many blocks it |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
405 // needs, start with a minimal guess, find the overhead of that many |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
406 // groups, and loop until this is enough groups to store this many blocks. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
407 if (!TT.blocks) TT.groups = (TT.treeblocks/TT.blockbits)+1; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
408 else TT.groups = div_round_up(TT.blocks, TT.blockbits); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
409 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
410 for (;;) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
411 temp = TT.treeblocks; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
412 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
413 for (i = 0; i<TT.groups; i++) temp += group_overhead(i); |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
414 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
415 if (TT.blocks) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
416 if (TT.blocks < temp) error_exit("Not enough space.\n"); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
417 break; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
418 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
419 if (temp <= TT.groups * TT.blockbits) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
420 TT.blocks = temp; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
421 break; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
422 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
423 TT.groups++; |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
424 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
425 TT.freeblocks = TT.blocks - temp; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
426 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
427 // Now we know all the TT data, initialize superblock structure. |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
428 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
429 init_superblock(&TT.sb); |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
430 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
431 // Start writing. Skip the first 1k to avoid the boot sector (if any). |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
432 put_zeroes(1024); |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
433 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
434 // Loop through block groups, write out each one. |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
435 dtiblk = dtbblk = usedblocks = usedinodes = 0; |
82 | 436 for (i=0; i<TT.groups; i++) { |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
437 struct ext2_inode *in = (struct ext2_inode *)toybuf; |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
438 uint32_t start, itable, used, end; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
439 int j, slot; |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
440 |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
441 // Where does this group end? |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
442 end = TT.blockbits; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
443 if ((i+1)*TT.blockbits > TT.blocks) end = TT.blocks & (TT.blockbits-1); |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
444 |
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
445 // Blocks used by inode table |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
446 itable = (TT.inodespg*sizeof(struct ext2_inode))/TT.blocksize; |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
447 |
82 | 448 // If a superblock goes here, write it out. |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
449 start = group_superblock_overhead(i); |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
450 if (start) { |
82 | 451 struct ext2_group *bg = (struct ext2_group *)toybuf; |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
452 int treeblocks = TT.treeblocks, treeinodes = TT.treeinodes; |
82 | 453 |
454 TT.sb.block_group_nr = SWAP_LE16(i); | |
455 | |
456 // Write superblock and pad it up to block size | |
457 xwrite(TT.fsfd, &TT.sb, sizeof(struct ext2_superblock)); | |
458 temp = TT.blocksize - sizeof(struct ext2_superblock); | |
459 if (!i && TT.blocksize > 1024) temp -= 1024; | |
460 memset(toybuf, 0, TT.blocksize); | |
461 xwrite(TT.fsfd, toybuf, temp); | |
462 | |
463 // Loop through groups to write group descriptor table. | |
464 for(j=0; j<TT.groups; j++) { | |
465 | |
466 // Figure out what sector this group starts in. | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
467 used = group_superblock_overhead(j); |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
468 |
82 | 469 // Find next array slot in this block (flush block if full). |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
470 slot = j % (TT.blocksize/sizeof(struct ext2_group)); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
471 if (!slot) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
472 if (j) xwrite(TT.fsfd, bg, TT.blocksize); |
82 | 473 memset(bg, 0, TT.blocksize); |
474 } | |
475 | |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
476 // How many free inodes in this group? |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
477 temp = TT.inodespg; |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
478 if (!i) temp -= INODES_RESERVED; |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
479 if (temp > treeinodes) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
480 treeinodes -= temp; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
481 temp = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
482 } else { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
483 temp -= treeinodes; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
484 treeinodes = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
485 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
486 bg[slot].free_inodes_count = SWAP_LE16(temp); |
82 | 487 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
488 // How many free blocks in this group? |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
489 temp = TT.inodespg/(TT.blocksize/sizeof(struct ext2_inode)) + 2; |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
490 temp = end-used-temp; |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
491 if (temp > treeblocks) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
492 treeblocks -= temp; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
493 temp = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
494 } else { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
495 temp -= treeblocks; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
496 treeblocks = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
497 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
498 bg[slot].free_blocks_count = SWAP_LE32(temp); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
499 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
500 // Fill out rest of group structure |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
501 used += j*TT.blockbits; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
502 bg[slot].block_bitmap = SWAP_LE32(used++); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
503 bg[slot].inode_bitmap = SWAP_LE32(used++); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
504 bg[slot].inode_table = SWAP_LE32(used); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
505 bg[slot].used_dirs_count = 0; // (TODO) |
82 | 506 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
507 xwrite(TT.fsfd, bg, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
508 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
509 |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
510 // Now write out stuff that every block group has. |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
511 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
512 // Write block usage bitmap |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
513 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
514 start += 2 + itable; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
515 memset(toybuf, 0, TT.blocksize); |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
516 bits_set(toybuf, 0, start); |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
517 bits_set(toybuf, end, TT.blockbits-end); |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
518 temp = TT.treeblocks - usedblocks; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
519 if (temp) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
520 if (end-start > temp) temp = end-start; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
521 bits_set(toybuf, start, temp); |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
522 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
523 xwrite(TT.fsfd, toybuf, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
524 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
525 // Write inode bitmap |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
526 memset(toybuf, 0, TT.blocksize); |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
527 j = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
528 if (!i) bits_set(toybuf, 0, j = INODES_RESERVED); |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
529 bits_set(toybuf, TT.inodespg, slot = TT.blockbits-TT.inodespg); |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
530 temp = TT.treeinodes - usedinodes; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
531 if (temp) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
532 if (slot-j > temp) temp = slot-j; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
533 bits_set(toybuf, j, temp); |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
534 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
535 xwrite(TT.fsfd, toybuf, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
536 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
537 // Write inode table for this group (TODO) |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
538 for (j = 0; j<TT.inodespg; j++) { |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
539 slot = j % (TT.blocksize/sizeof(struct ext2_inode)); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
540 if (!slot) { |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
541 if (j) xwrite(TT.fsfd, in, TT.blocksize); |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
542 memset(in, 0, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
543 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
544 if (!i && j<INODES_RESERVED) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
545 // Write root inode |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
546 if (j == 2) fill_inode(in+slot, dtb); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
547 } else if (dti) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
548 fill_inode(in+slot, dti); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
549 dti = treenext(dti); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
550 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
551 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
552 xwrite(TT.fsfd, in, TT.blocksize); |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
553 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
554 while (dtb) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
555 // TODO write index data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
556 // TODO write root directory data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
557 // TODO write directory data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
558 // TODO write file data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
559 put_zeroes(TT.blocksize); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
560 start++; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
561 if (start == end) break; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
562 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
563 // Write data blocks (TODO) |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
564 put_zeroes((end-start) * TT.blocksize); |
82 | 565 } |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
566 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
567 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
568 // Scratch pad: |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
569 // b - block size (1024, 2048, 4096) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
570 // F - force (run on mounted device or non-block device) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
571 // i - bytes per inode |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
572 // N - number of inodes |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
573 // m - reserved blocks percentage |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
574 // n - Don't write |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
575 // q - quiet |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
576 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
577 // L - volume label |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
578 // M - last mounted path |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
579 // o - creator os |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
580 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
581 // j - create journal |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
582 // J - journal options (size=1024-102400 blocks,device=) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
583 // device=/dev/blah or LABEL=label UUID=uuid |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
584 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
585 // E - extended options (stride=stripe-size blocks) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
586 // O - none,dir_index,filetype,has_journal,journal_dev,sparse_super |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
587 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
588 |