Mercurial > hg > toybox
annotate toys/mke2fs.c @ 186:25447caf1b4b
Change command main() functions to return void, and exit(toys.exitval) from
the toybox infrastructure instead. Eliminates a return call from each command.
author | Rob Landley <rob@landley.net> |
---|---|
date | Thu, 29 Nov 2007 18:14:37 -0600 |
parents | 9cbb323f297f |
children | 30a6db5a95c2 |
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 * |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
5 * Copyright 2006 Rob Landley <rob@landley.net> |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
6 */ |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
7 |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
8 #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
|
9 |
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
|
10 // Shortcut to our global data structure, since we use it so much. |
76 | 11 #define TT toy.mke2fs |
12 | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
13 #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
|
14 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
15 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
|
16 { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
17 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
|
18 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
19 if (a%b) c++; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
20 return c; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
21 } |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
22 |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
23 // 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
|
24 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
25 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
|
26 { |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
27 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
|
28 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
|
29 |
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
|
30 // Fill out index blocks in inode. |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
31 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
32 if (blocklist) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
33 int i; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
34 |
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
|
35 // Direct index blocks |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
36 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
|
37 // Singly indirect index blocks |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
38 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
|
39 // Doubly indirect index blocks |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
40 idx = 13 + idx + (idx*idx); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
41 if (dblocks > idx) blocklist[14] = idx; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
42 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
43 return 0; |
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 |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
46 // 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
|
47 |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
48 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
|
49 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
|
50 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
|
51 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
|
52 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
|
53 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
|
54 } |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
55 } |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
56 |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
57 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
|
58 } |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
59 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
60 // 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
|
61 static struct dirtree *treenext(struct dirtree *this) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
62 { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
63 while (this && !this->next) this = this->parent; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
64 if (this) this = this->next; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
65 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
66 return this; |
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 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
69 // 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
|
70 // 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
|
71 // 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
|
72 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
73 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
|
74 { |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
75 long blocks; |
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 while (this) { |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
78 *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
|
79 |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
80 if (this->child) |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
81 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
|
82 else if (S_ISREG(this->st.st_mode)) { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
83 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
|
84 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
|
85 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
86 this = this->next; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
87 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
88 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
|
89 TT.treeinodes++; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
90 |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
91 return blocks; |
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 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
94 // Calculate inode numbers and link counts. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
95 // |
101
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
96 // 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
|
97 // 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
|
98 // 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
|
99 // 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
|
100 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
101 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
|
102 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
103 struct dirtree *this=tree, *that; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
104 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
|
105 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
106 while (this) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
107 ++inode; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
108 // 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
|
109 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
|
110 else { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
111 dev_t new = this->st.st_dev; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
112 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
113 if (!new) continue; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
114 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
115 this->st.st_nlink = 0; |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
116 for (that = tree; that; that = treenext(that)) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
117 if (this->st.st_ino == that->st.st_ino && |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
118 this->st.st_dev == that->st.st_dev) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
119 { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
120 this->st.st_nlink++; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
121 this->st.st_ino = inode; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
122 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
123 } |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
124 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
125 this->st.st_ino = inode; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
126 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
|
127 } |
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
128 } |
ff85a83e7d7e
Calculate st_nlink for each node, via a small but n^2 algorithm.
Rob Landley <rob@landley.net>
parents:
99
diff
changeset
|
129 |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
130 // 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
|
131 // 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
|
132 // 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
|
133 // 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
|
134 // |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
135 // 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
|
136 // 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
|
137 |
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
|
138 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
|
139 { |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
140 // 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
|
141 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
|
142 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
|
143 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
|
144 |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
145 // 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
|
146 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
|
147 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
|
148 |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
149 // 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
|
150 // 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
|
151 // 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
|
152 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
|
153 } |
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
154 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
155 // 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
|
156 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
|
157 { |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
158 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
|
159 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
160 // 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
|
161 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
|
162 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
|
163 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
|
164 } |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
165 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
166 // 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
|
167 |
82 | 168 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
|
169 { |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
170 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
|
171 |
82 | 172 // Set log_block_size and log_frag_size. |
76 | 173 |
82 | 174 for (temp = 0; temp < 4; temp++) if (TT.blocksize == 1024<<temp) break; |
175 if (temp==4) error_exit("bad blocksize"); | |
76 | 176 sb->log_block_size = sb->log_frag_size = SWAP_LE32(temp); |
177 | |
80
7a058d60faf1
One more field, minor shrinking, and start on block groups.
Rob Landley <rob@landley.net>
parents:
79
diff
changeset
|
178 // Fill out blocks_count, r_blocks_count, first_data_block |
76 | 179 |
180 sb->blocks_count = SWAP_LE32(TT.blocks); | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
181 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
|
182 temp = (TT.blocks * (uint64_t)TT.reserved_percent) / 100; |
76 | 183 sb->r_blocks_count = SWAP_LE32(temp); |
184 | |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
185 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
|
186 |
76 | 187 // Set blocks_per_group and frags_per_group, which is the size of an |
188 // allocation bitmap that fits in one block (I.E. how many bits per block)? | |
189 | |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
190 sb->blocks_per_group = sb->frags_per_group = SWAP_LE32(TT.blockbits); |
76 | 191 |
79
1aff4181427b
Filling out most of the ext2 superblock correctly now.
Rob Landley <rob@landley.net>
parents:
76
diff
changeset
|
192 // 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
|
193 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
|
194 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
|
195 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
196 // Determine free inodes. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
197 temp = TT.inodespg*TT.groups - INODES_RESERVED; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
198 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
|
199 sb->free_inodes_count = SWAP_LE32(temp - TT.treeinodes); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
200 |
79
1aff4181427b
Filling out most of the ext2 superblock correctly now.
Rob Landley <rob@landley.net>
parents:
76
diff
changeset
|
201 // Fill out the rest of the superblock. |
76 | 202 sb->max_mnt_count=0xFFFF; |
203 sb->wtime = sb->lastcheck = sb->mkfs_time = SWAP_LE32(time(NULL)); | |
204 sb->magic = SWAP_LE32(0xEF53); | |
205 sb->state = sb->errors = SWAP_LE16(1); | |
206 | |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
207 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
|
208 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
|
209 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
|
210 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
|
211 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
|
212 |
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
|
213 create_uuid(sb->uuid); |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
214 |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
215 // 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
|
216 |
75
89ca591a9236
More random progress on mke2fs. Nothing to see yet.
Rob Landley <rob@landley.net>
parents:
53
diff
changeset
|
217 //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
|
218 // 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
|
219 } |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
220 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
221 // 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
|
222 static int is_sb_group(uint32_t group) |
82 | 223 { |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
224 int i; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
225 |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
226 // 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
|
227 if(!group || group==1) return 1; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
228 for (i=3; i<9; i+=2) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
229 int j = i; |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
230 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
|
231 if (j==group) return 1; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
232 } |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
233 return 0; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
234 } |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
235 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
236 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
237 // 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
|
238 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
|
239 { |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
240 int used; |
82 | 241 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
242 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
|
243 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
244 // 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
|
245 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
|
246 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
|
247 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
|
248 // 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
|
249 used++; |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
250 // 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
|
251 if (!group && TT.blocksize == 1024) used++; |
82 | 252 |
253 return used; | |
254 } | |
255 | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
256 // 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
|
257 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
|
258 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
259 // Return superblock backup overhead (if any), plus block/inode |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
260 // allocation bitmaps, plus inode tables. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
261 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
|
262 / (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
|
263 } |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
264 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
265 // 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
|
266 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
|
267 { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
268 while(len) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
269 if ((start&7) || len<8) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
270 array[start/8]|=(1<<(start&7)); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
271 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
|
272 len--; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
273 } else { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
274 array[start/8]=255; |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
275 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
|
276 len-=8; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
277 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
278 } |
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 |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
281 // 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
|
282 // not seekable |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
283 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
|
284 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
285 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
|
286 memset(toybuf, 0, sizeof(toybuf)); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
287 while (len) { |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
288 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
|
289 xwrite(TT.fsfd, toybuf, out); |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
290 len -= out; |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
291 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
292 } |
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 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
295 // 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
|
296 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
|
297 { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
298 uint32_t fbu[15]; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
299 int temp; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
300 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
301 file_blocks_used(this->st.st_size, fbu); |
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 // If this inode needs data blocks allocated to it. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
304 if (this->st.st_size) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
305 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
|
306 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
307 // TODO: teach this about indirect blocks. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
308 for (i=0; i<15; i++) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
309 // 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
|
310 while (group >= TT.nextgroup) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
311 TT.nextblock += group_overhead(TT.nextgroup++); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
312 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
313 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
314 // 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
|
315 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
|
316 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
317 in->uid = SWAP_LE16(this->st.st_uid & 0xFFFF); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
318 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
|
319 in->gid = SWAP_LE16(this->st.st_gid & 0xFFFF); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
320 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
|
321 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
|
322 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
323 // 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
|
324 // 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
|
325 if (sizeof(this->st.st_size) > 4) temp = 32; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
326 else temp = 0; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
327 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
|
328 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
329 in->atime = SWAP_LE32(this->st.st_atime); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
330 in->ctime = SWAP_LE32(this->st.st_ctime); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
331 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
|
332 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
333 in->links_count = SWAP_LE16(this->st.st_nlink); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
334 in->blocks = SWAP_LE32(this->st.st_blocks); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
335 // in->faddr |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
336 } |
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
337 |
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
|
338 // 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
|
339 // 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
|
340 // 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
|
341 |
186
25447caf1b4b
Change command main() functions to return void, and exit(toys.exitval) from
Rob Landley <rob@landley.net>
parents:
143
diff
changeset
|
342 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
|
343 { |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
344 int i, temp; |
82 | 345 off_t length; |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
346 uint32_t usedblocks, usedinodes, dtiblk, dtbblk; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
347 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
|
348 |
81
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
349 // Handle command line arguments. |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
350 |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
351 if (toys.optargs[1]) { |
f95f6fd94eed
Move superblock initialization to a function. Trim unused padding from
Rob Landley <rob@landley.net>
parents:
80
diff
changeset
|
352 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
|
353 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
|
354 } 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
|
355 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
|
356 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
357 // 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
|
358 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
359 // 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
|
360 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
|
361 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
362 // 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
|
363 // (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
|
364 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
365 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
|
366 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
|
367 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
|
368 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
|
369 |
97
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
370 // 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
|
371 |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
372 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
|
373 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
|
374 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
|
375 } else { |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
376 dti = xzalloc(sizeof(struct dirtree)+11); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
377 strcpy(dti->name, "lost+found"); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
378 dti->st.st_mode = S_IFDIR|0755; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
379 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
|
380 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
381 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
382 // 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
|
383 // 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
|
384 // point back into this. |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
385 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
386 dtb = xzalloc(sizeof(struct dirtree)+1); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
387 dtb->st.st_mode = S_IFDIR|0755; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
388 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
|
389 dtb->child = dti; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
390 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
391 // 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
|
392 length = check_treesize(dtb, &(dtb->st.st_size)); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
393 check_treelinks(dtb); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
394 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
395 // Figure out how many total inodes we need. |
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 if (!TT.inodes) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
398 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
|
399 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
|
400 } |
4c81e6375719
Add parent pointer to dirtree, more work on mke2fs (populate dirtree, count
Rob Landley <rob@landley.net>
parents:
84
diff
changeset
|
401 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
402 // 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
|
403 // 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
|
404 // 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
|
405 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
|
406 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
|
407 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
408 for (;;) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
409 temp = TT.treeblocks; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
410 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
411 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
|
412 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
413 if (TT.blocks) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
414 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
|
415 break; |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
416 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
417 if (temp <= TT.groups * TT.blockbits) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
418 TT.blocks = temp; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
419 break; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
420 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
421 TT.groups++; |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
422 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
423 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
|
424 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
425 // 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
|
426 |
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
427 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
|
428 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
429 // 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
|
430 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
|
431 |
104
1c2f6d2e25de
Precalculate block and inode usage given a starting file tree. This compiles,
Rob Landley <rob@landley.net>
parents:
101
diff
changeset
|
432 // Loop through block groups, write out each one. |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
433 dtiblk = dtbblk = usedblocks = usedinodes = 0; |
82 | 434 for (i=0; i<TT.groups; i++) { |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
435 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
|
436 uint32_t start, itable, used, end; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
437 int j, slot; |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
438 |
84
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
439 // 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
|
440 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
|
441 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
|
442 |
bdbef4ab4ac6
This creates an almost valid empty ext2 filesystem, except for a few superblock
Rob Landley <rob@landley.net>
parents:
83
diff
changeset
|
443 // 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
|
444 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
|
445 |
82 | 446 // If a superblock goes here, write it out. |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
447 start = group_superblock_overhead(i); |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
448 if (start) { |
82 | 449 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
|
450 int treeblocks = TT.treeblocks, treeinodes = TT.treeinodes; |
82 | 451 |
452 TT.sb.block_group_nr = SWAP_LE16(i); | |
453 | |
454 // Write superblock and pad it up to block size | |
455 xwrite(TT.fsfd, &TT.sb, sizeof(struct ext2_superblock)); | |
456 temp = TT.blocksize - sizeof(struct ext2_superblock); | |
457 if (!i && TT.blocksize > 1024) temp -= 1024; | |
458 memset(toybuf, 0, TT.blocksize); | |
459 xwrite(TT.fsfd, toybuf, temp); | |
460 | |
461 // Loop through groups to write group descriptor table. | |
462 for(j=0; j<TT.groups; j++) { | |
463 | |
464 // Figure out what sector this group starts in. | |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
465 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
|
466 |
82 | 467 // 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
|
468 slot = j % (TT.blocksize/sizeof(struct ext2_group)); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
469 if (!slot) { |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
470 if (j) xwrite(TT.fsfd, bg, TT.blocksize); |
82 | 471 memset(bg, 0, TT.blocksize); |
472 } | |
473 | |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
474 // 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
|
475 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
|
476 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
|
477 if (temp > treeinodes) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
478 treeinodes -= temp; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
479 temp = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
480 } else { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
481 temp -= treeinodes; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
482 treeinodes = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
483 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
484 bg[slot].free_inodes_count = SWAP_LE16(temp); |
82 | 485 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
486 // 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
|
487 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
|
488 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
|
489 if (temp > treeblocks) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
490 treeblocks -= temp; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
491 temp = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
492 } else { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
493 temp -= treeblocks; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
494 treeblocks = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
495 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
496 bg[slot].free_blocks_count = SWAP_LE32(temp); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
497 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
498 // 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
|
499 used += j*TT.blockbits; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
500 bg[slot].block_bitmap = SWAP_LE32(used++); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
501 bg[slot].inode_bitmap = SWAP_LE32(used++); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
502 bg[slot].inode_table = SWAP_LE32(used); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
503 bg[slot].used_dirs_count = 0; // (TODO) |
82 | 504 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
505 xwrite(TT.fsfd, bg, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
506 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
507 |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
508 // 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
|
509 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
510 // Write block usage bitmap |
83
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 start += 2 + itable; |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
513 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
|
514 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
|
515 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
|
516 temp = TT.treeblocks - usedblocks; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
517 if (temp) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
518 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
|
519 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
|
520 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
521 xwrite(TT.fsfd, toybuf, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
522 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
523 // Write inode bitmap |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
524 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
|
525 j = 0; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
526 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
|
527 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
|
528 temp = TT.treeinodes - usedinodes; |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
529 if (temp) { |
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
530 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
|
531 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
|
532 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
533 xwrite(TT.fsfd, toybuf, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
534 |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
535 // 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
|
536 for (j = 0; j<TT.inodespg; j++) { |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
537 slot = j % (TT.blocksize/sizeof(struct ext2_inode)); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
538 if (!slot) { |
105
c5b6fb1fe3a4
Calculate block and inode usage in group table and bitmaps.
Rob Landley <rob@landley.net>
parents:
104
diff
changeset
|
539 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
|
540 memset(in, 0, TT.blocksize); |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
541 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
542 if (!i && j<INODES_RESERVED) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
543 // Write root inode |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
544 if (j == 2) fill_inode(in+slot, dtb); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
545 } else if (dti) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
546 fill_inode(in+slot, dti); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
547 dti = treenext(dti); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
548 } |
83
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
549 } |
4b25264da01b
mke2fs: Stopping for dinner. It compiles.
Rob Landley <rob@landley.net>
parents:
82
diff
changeset
|
550 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
|
551 |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
552 while (dtb) { |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
553 // TODO write index data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
554 // TODO write root directory data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
555 // TODO write directory data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
556 // TODO write file data block |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
557 put_zeroes(TT.blocksize); |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
558 start++; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
559 if (start == end) break; |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
560 } |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
561 // Write data blocks (TODO) |
99
97d717829ff0
More work on mke2fs.c. Random in-progress snapshot...
Rob Landley <rob@landley.net>
parents:
97
diff
changeset
|
562 put_zeroes((end-start) * TT.blocksize); |
82 | 563 } |
53
41d55b5d49fd
Add start of mke2fs/gene2fs, and some other stuff I've been working on.
Rob Landley <rob@landley.net>
parents:
diff
changeset
|
564 } |
112
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
565 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
566 // Scratch pad: |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
567 // b - block size (1024, 2048, 4096) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
568 // 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
|
569 // i - bytes per inode |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
570 // N - number of inodes |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
571 // m - reserved blocks percentage |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
572 // n - Don't write |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
573 // q - quiet |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
574 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
575 // L - volume label |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
576 // M - last mounted path |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
577 // o - creator os |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
578 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
579 // j - create journal |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
580 // J - journal options (size=1024-102400 blocks,device=) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
581 // device=/dev/blah or LABEL=label UUID=uuid |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
582 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
583 // E - extended options (stride=stripe-size blocks) |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
584 // 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
|
585 |
aadd28817955
Next iteration of mke2fs development.
Rob Landley <rob@landley.net>
parents:
105
diff
changeset
|
586 |