Rev 3019 | Rev 3028 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3019 | Rev 3021 | ||
---|---|---|---|
1 | #!/usr/bin/env python |
1 | #!/usr/bin/env python |
2 | # |
2 | # |
3 | # Copyright (c) 2008 Martin Decky |
3 | # Copyright (c) 2008 Martin Decky |
4 | # All rights reserved. |
4 | # All rights reserved. |
5 | # |
5 | # |
6 | # Redistribution and use in source and binary forms, with or without |
6 | # Redistribution and use in source and binary forms, with or without |
7 | # modification, are permitted provided that the following conditions |
7 | # modification, are permitted provided that the following conditions |
8 | # are met: |
8 | # are met: |
9 | # |
9 | # |
10 | # - Redistributions of source code must retain the above copyright |
10 | # - Redistributions of source code must retain the above copyright |
11 | # notice, this list of conditions and the following disclaimer. |
11 | # notice, this list of conditions and the following disclaimer. |
12 | # - Redistributions in binary form must reproduce the above copyright |
12 | # - Redistributions in binary form must reproduce the above copyright |
13 | # notice, this list of conditions and the following disclaimer in the |
13 | # notice, this list of conditions and the following disclaimer in the |
14 | # documentation and/or other materials provided with the distribution. |
14 | # documentation and/or other materials provided with the distribution. |
15 | # - The name of the author may not be used to endorse or promote products |
15 | # - The name of the author may not be used to endorse or promote products |
16 | # derived from this software without specific prior written permission. |
16 | # derived from this software without specific prior written permission. |
17 | # |
17 | # |
18 | # THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | # THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | # IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | # IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | # OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | # OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | # IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | # IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | # NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | # NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | # THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | # THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | # |
28 | # |
29 | """ |
29 | """ |
30 | TMPFS creator |
30 | TMPFS creator |
31 | """ |
31 | """ |
32 | 32 | ||
33 | import sys |
33 | import sys |
34 | import os |
34 | import os |
35 | import struct |
35 | import struct |
36 | 36 | ||
- | 37 | def align_up(size, alignment): |
|
- | 38 | return (((size) + ((alignment) - 1)) & ~((alignment) - 1)) |
|
- | 39 | ||
37 | def usage(prname): |
40 | def usage(prname): |
38 | "Print usage syntax" |
41 | "Print usage syntax" |
39 | print prname + " <PATH> <IMAGE>" |
42 | print prname + " <ALIGNMENT> <PATH> <IMAGE>" |
40 | 43 | ||
41 | def main(): |
44 | def main(): |
42 | if (len(sys.argv) < 3): |
45 | if (len(sys.argv) < 4): |
43 | usage(sys.argv[0]) |
46 | usage(sys.argv[0]) |
44 | return |
47 | return |
45 | 48 | ||
- | 49 | if (not sys.argv[1].isdigit()): |
|
- | 50 | print "<ALIGNMENT> must be a number" |
|
- | 51 | return |
|
- | 52 | ||
- | 53 | align = int(sys.argv[1], 0) |
|
46 | path = os.path.abspath(sys.argv[1]); |
54 | path = os.path.abspath(sys.argv[2]) |
47 | if (not os.path.isdir(path)): |
55 | if (not os.path.isdir(path)): |
48 | print "<PATH> must be a directory" |
56 | print "<PATH> must be a directory" |
49 | return |
57 | return |
50 | 58 | ||
51 | header_size = 18 |
59 | header_size = align_up(18, align) |
52 | payload_size = 0 |
60 | payload_size = 0 |
53 | outf = file(sys.argv[2], "w") |
61 | outf = file(sys.argv[3], "w") |
54 | outf.write(struct.pack("<" + ("%d" % header_size) + "x")) |
62 | outf.write(struct.pack("<" + ("%d" % header_size) + "x")) |
55 | 63 | ||
56 | for root, dirs, files in os.walk(path): |
64 | for root, dirs, files in os.walk(path): |
57 | relpath = root[len(path):len(root)] |
65 | relpath = root[len(path):len(root)] |
58 | for name in files: |
66 | for name in files: |
59 | canon = os.path.join(relpath, name) |
67 | canon = os.path.join(relpath, name) |
60 | outf.write(struct.pack("<BL" + ("%d" % len(canon)) + "s", 1, len(canon), canon)) |
68 | outf.write(struct.pack("<BL" + ("%d" % len(canon)) + "s", 1, len(canon), canon)) |
61 | payload_size += 5 + len(canon) |
69 | payload_size += 5 + len(canon) |
62 | 70 | ||
63 | fn = os.path.join(root, name) |
71 | fn = os.path.join(root, name) |
64 | size = os.path.getsize(fn) |
72 | size = os.path.getsize(fn) |
65 | rd = 0; |
73 | rd = 0; |
66 | outf.write(struct.pack("<L", size)) |
74 | outf.write(struct.pack("<L", size)) |
67 | payload_size += 4 |
75 | payload_size += 4 |
68 | 76 | ||
69 | inf = file(fn, "r") |
77 | inf = file(fn, "r") |
70 | while (rd < size): |
78 | while (rd < size): |
71 | data = inf.read(4096); |
79 | data = inf.read(4096); |
72 | outf.write(data) |
80 | outf.write(data) |
73 | payload_size += len(data) |
81 | payload_size += len(data) |
74 | rd += len(data) |
82 | rd += len(data) |
75 | inf.close() |
83 | inf.close() |
76 | 84 | ||
77 | for name in dirs: |
85 | for name in dirs: |
78 | canon = os.path.join(relpath, name) |
86 | canon = os.path.join(relpath, name) |
79 | outf.write(struct.pack("<BL" + ("%d" % len(canon)) + "s", 2, len(canon), canon)) |
87 | outf.write(struct.pack("<BL" + ("%d" % len(canon)) + "s", 2, len(canon), canon)) |
80 | payload_size += 5 + len(canon) |
88 | payload_size += 5 + len(canon) |
81 | 89 | ||
- | 90 | aligned_size = align_up(payload_size, align) |
|
- | 91 | ||
- | 92 | if (aligned_size - payload_size > 0): |
|
- | 93 | outf.write(struct.pack("<" + ("%d" % (aligned_size - payload_size)) + "x")) |
|
- | 94 | ||
82 | outf.seek(0) |
95 | outf.seek(0) |
83 | outf.write(struct.pack("<4sBBLQ", "HORD", 1, 1, header_size, payload_size)) |
96 | outf.write(struct.pack("<4sBBLQ", "HORD", 1, 1, header_size, aligned_size)) |
84 | outf.close() |
97 | outf.close() |
85 | 98 | ||
86 | if __name__ == '__main__': |
99 | if __name__ == '__main__': |
87 | main() |
100 | main() |
88 | 101 |