diff options
author | Tudor Florea <tudor.florea@enea.com> | 2014-10-16 03:05:19 +0200 |
---|---|---|
committer | Tudor Florea <tudor.florea@enea.com> | 2014-10-16 03:05:19 +0200 |
commit | c527fd1f14c27855a37f2e8ac5346ce8d940ced2 (patch) | |
tree | bb002c1fdf011c41dbd2f0927bed23ecb5f83c97 /meta/recipes-devtools/makedevs/makedevs | |
download | poky-c527fd1f14c27855a37f2e8ac5346ce8d940ced2.tar.gz |
initial commit for Enea Linux 4.0-140929daisy-140929
Migrated from the internal git server on the daisy-enea-point-release branch
Signed-off-by: Tudor Florea <tudor.florea@enea.com>
Diffstat (limited to 'meta/recipes-devtools/makedevs/makedevs')
-rw-r--r-- | meta/recipes-devtools/makedevs/makedevs/COPYING.patch | 346 | ||||
-rw-r--r-- | meta/recipes-devtools/makedevs/makedevs/makedevs.c | 589 |
2 files changed, 935 insertions, 0 deletions
diff --git a/meta/recipes-devtools/makedevs/makedevs/COPYING.patch b/meta/recipes-devtools/makedevs/makedevs/COPYING.patch new file mode 100644 index 0000000000..3a8902b97a --- /dev/null +++ b/meta/recipes-devtools/makedevs/makedevs/COPYING.patch | |||
@@ -0,0 +1,346 @@ | |||
1 | Upstream-Status: Inappropriate [licensing] | ||
2 | |||
3 | diff -ruN makedevs-1.0.0-orig/COPYING makedevs-1.0.0/COPYING | ||
4 | --- makedevs-1.0.0-orig/COPYING 1970-01-01 08:00:00.000000000 +0800 | ||
5 | +++ makedevs-1.0.0/COPYING 2010-12-09 16:42:20.274984665 +0800 | ||
6 | @@ -0,0 +1,340 @@ | ||
7 | + GNU GENERAL PUBLIC LICENSE | ||
8 | + Version 2, June 1991 | ||
9 | + | ||
10 | + Copyright (C) 1989, 1991 Free Software Foundation, Inc. | ||
11 | + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | ||
12 | + Everyone is permitted to copy and distribute verbatim copies | ||
13 | + of this license document, but changing it is not allowed. | ||
14 | + | ||
15 | + Preamble | ||
16 | + | ||
17 | + The licenses for most software are designed to take away your | ||
18 | +freedom to share and change it. By contrast, the GNU General Public | ||
19 | +License is intended to guarantee your freedom to share and change free | ||
20 | +software--to make sure the software is free for all its users. This | ||
21 | +General Public License applies to most of the Free Software | ||
22 | +Foundation's software and to any other program whose authors commit to | ||
23 | +using it. (Some other Free Software Foundation software is covered by | ||
24 | +the GNU Library General Public License instead.) You can apply it to | ||
25 | +your programs, too. | ||
26 | + | ||
27 | + When we speak of free software, we are referring to freedom, not | ||
28 | +price. Our General Public Licenses are designed to make sure that you | ||
29 | +have the freedom to distribute copies of free software (and charge for | ||
30 | +this service if you wish), that you receive source code or can get it | ||
31 | +if you want it, that you can change the software or use pieces of it | ||
32 | +in new free programs; and that you know you can do these things. | ||
33 | + | ||
34 | + To protect your rights, we need to make restrictions that forbid | ||
35 | +anyone to deny you these rights or to ask you to surrender the rights. | ||
36 | +These restrictions translate to certain responsibilities for you if you | ||
37 | +distribute copies of the software, or if you modify it. | ||
38 | + | ||
39 | + For example, if you distribute copies of such a program, whether | ||
40 | +gratis or for a fee, you must give the recipients all the rights that | ||
41 | +you have. You must make sure that they, too, receive or can get the | ||
42 | +source code. And you must show them these terms so they know their | ||
43 | +rights. | ||
44 | + | ||
45 | + We protect your rights with two steps: (1) copyright the software, and | ||
46 | +(2) offer you this license which gives you legal permission to copy, | ||
47 | +distribute and/or modify the software. | ||
48 | + | ||
49 | + Also, for each author's protection and ours, we want to make certain | ||
50 | +that everyone understands that there is no warranty for this free | ||
51 | +software. If the software is modified by someone else and passed on, we | ||
52 | +want its recipients to know that what they have is not the original, so | ||
53 | +that any problems introduced by others will not reflect on the original | ||
54 | +authors' reputations. | ||
55 | + | ||
56 | + Finally, any free program is threatened constantly by software | ||
57 | +patents. We wish to avoid the danger that redistributors of a free | ||
58 | +program will individually obtain patent licenses, in effect making the | ||
59 | +program proprietary. To prevent this, we have made it clear that any | ||
60 | +patent must be licensed for everyone's free use or not licensed at all. | ||
61 | + | ||
62 | + The precise terms and conditions for copying, distribution and | ||
63 | +modification follow. | ||
64 | + | ||
65 | + GNU GENERAL PUBLIC LICENSE | ||
66 | + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION | ||
67 | + | ||
68 | + 0. This License applies to any program or other work which contains | ||
69 | +a notice placed by the copyright holder saying it may be distributed | ||
70 | +under the terms of this General Public License. The "Program", below, | ||
71 | +refers to any such program or work, and a "work based on the Program" | ||
72 | +means either the Program or any derivative work under copyright law: | ||
73 | +that is to say, a work containing the Program or a portion of it, | ||
74 | +either verbatim or with modifications and/or translated into another | ||
75 | +language. (Hereinafter, translation is included without limitation in | ||
76 | +the term "modification".) Each licensee is addressed as "you". | ||
77 | + | ||
78 | +Activities other than copying, distribution and modification are not | ||
79 | +covered by this License; they are outside its scope. The act of | ||
80 | +running the Program is not restricted, and the output from the Program | ||
81 | +is covered only if its contents constitute a work based on the | ||
82 | +Program (independent of having been made by running the Program). | ||
83 | +Whether that is true depends on what the Program does. | ||
84 | + | ||
85 | + 1. You may copy and distribute verbatim copies of the Program's | ||
86 | +source code as you receive it, in any medium, provided that you | ||
87 | +conspicuously and appropriately publish on each copy an appropriate | ||
88 | +copyright notice and disclaimer of warranty; keep intact all the | ||
89 | +notices that refer to this License and to the absence of any warranty; | ||
90 | +and give any other recipients of the Program a copy of this License | ||
91 | +along with the Program. | ||
92 | + | ||
93 | +You may charge a fee for the physical act of transferring a copy, and | ||
94 | +you may at your option offer warranty protection in exchange for a fee. | ||
95 | + | ||
96 | + 2. You may modify your copy or copies of the Program or any portion | ||
97 | +of it, thus forming a work based on the Program, and copy and | ||
98 | +distribute such modifications or work under the terms of Section 1 | ||
99 | +above, provided that you also meet all of these conditions: | ||
100 | + | ||
101 | + a) You must cause the modified files to carry prominent notices | ||
102 | + stating that you changed the files and the date of any change. | ||
103 | + | ||
104 | + b) You must cause any work that you distribute or publish, that in | ||
105 | + whole or in part contains or is derived from the Program or any | ||
106 | + part thereof, to be licensed as a whole at no charge to all third | ||
107 | + parties under the terms of this License. | ||
108 | + | ||
109 | + c) If the modified program normally reads commands interactively | ||
110 | + when run, you must cause it, when started running for such | ||
111 | + interactive use in the most ordinary way, to print or display an | ||
112 | + announcement including an appropriate copyright notice and a | ||
113 | + notice that there is no warranty (or else, saying that you provide | ||
114 | + a warranty) and that users may redistribute the program under | ||
115 | + these conditions, and telling the user how to view a copy of this | ||
116 | + License. (Exception: if the Program itself is interactive but | ||
117 | + does not normally print such an announcement, your work based on | ||
118 | + the Program is not required to print an announcement.) | ||
119 | + | ||
120 | +These requirements apply to the modified work as a whole. If | ||
121 | +identifiable sections of that work are not derived from the Program, | ||
122 | +and can be reasonably considered independent and separate works in | ||
123 | +themselves, then this License, and its terms, do not apply to those | ||
124 | +sections when you distribute them as separate works. But when you | ||
125 | +distribute the same sections as part of a whole which is a work based | ||
126 | +on the Program, the distribution of the whole must be on the terms of | ||
127 | +this License, whose permissions for other licensees extend to the | ||
128 | +entire whole, and thus to each and every part regardless of who wrote it. | ||
129 | + | ||
130 | +Thus, it is not the intent of this section to claim rights or contest | ||
131 | +your rights to work written entirely by you; rather, the intent is to | ||
132 | +exercise the right to control the distribution of derivative or | ||
133 | +collective works based on the Program. | ||
134 | + | ||
135 | +In addition, mere aggregation of another work not based on the Program | ||
136 | +with the Program (or with a work based on the Program) on a volume of | ||
137 | +a storage or distribution medium does not bring the other work under | ||
138 | +the scope of this License. | ||
139 | + | ||
140 | + 3. You may copy and distribute the Program (or a work based on it, | ||
141 | +under Section 2) in object code or executable form under the terms of | ||
142 | +Sections 1 and 2 above provided that you also do one of the following: | ||
143 | + | ||
144 | + a) Accompany it with the complete corresponding machine-readable | ||
145 | + source code, which must be distributed under the terms of Sections | ||
146 | + 1 and 2 above on a medium customarily used for software interchange; or, | ||
147 | + | ||
148 | + b) Accompany it with a written offer, valid for at least three | ||
149 | + years, to give any third party, for a charge no more than your | ||
150 | + cost of physically performing source distribution, a complete | ||
151 | + machine-readable copy of the corresponding source code, to be | ||
152 | + distributed under the terms of Sections 1 and 2 above on a medium | ||
153 | + customarily used for software interchange; or, | ||
154 | + | ||
155 | + c) Accompany it with the information you received as to the offer | ||
156 | + to distribute corresponding source code. (This alternative is | ||
157 | + allowed only for noncommercial distribution and only if you | ||
158 | + received the program in object code or executable form with such | ||
159 | + an offer, in accord with Subsection b above.) | ||
160 | + | ||
161 | +The source code for a work means the preferred form of the work for | ||
162 | +making modifications to it. For an executable work, complete source | ||
163 | +code means all the source code for all modules it contains, plus any | ||
164 | +associated interface definition files, plus the scripts used to | ||
165 | +control compilation and installation of the executable. However, as a | ||
166 | +special exception, the source code distributed need not include | ||
167 | +anything that is normally distributed (in either source or binary | ||
168 | +form) with the major components (compiler, kernel, and so on) of the | ||
169 | +operating system on which the executable runs, unless that component | ||
170 | +itself accompanies the executable. | ||
171 | + | ||
172 | +If distribution of executable or object code is made by offering | ||
173 | +access to copy from a designated place, then offering equivalent | ||
174 | +access to copy the source code from the same place counts as | ||
175 | +distribution of the source code, even though third parties are not | ||
176 | +compelled to copy the source along with the object code. | ||
177 | + | ||
178 | + 4. You may not copy, modify, sublicense, or distribute the Program | ||
179 | +except as expressly provided under this License. Any attempt | ||
180 | +otherwise to copy, modify, sublicense or distribute the Program is | ||
181 | +void, and will automatically terminate your rights under this License. | ||
182 | +However, parties who have received copies, or rights, from you under | ||
183 | +this License will not have their licenses terminated so long as such | ||
184 | +parties remain in full compliance. | ||
185 | + | ||
186 | + 5. You are not required to accept this License, since you have not | ||
187 | +signed it. However, nothing else grants you permission to modify or | ||
188 | +distribute the Program or its derivative works. These actions are | ||
189 | +prohibited by law if you do not accept this License. Therefore, by | ||
190 | +modifying or distributing the Program (or any work based on the | ||
191 | +Program), you indicate your acceptance of this License to do so, and | ||
192 | +all its terms and conditions for copying, distributing or modifying | ||
193 | +the Program or works based on it. | ||
194 | + | ||
195 | + 6. Each time you redistribute the Program (or any work based on the | ||
196 | +Program), the recipient automatically receives a license from the | ||
197 | +original licensor to copy, distribute or modify the Program subject to | ||
198 | +these terms and conditions. You may not impose any further | ||
199 | +restrictions on the recipients' exercise of the rights granted herein. | ||
200 | +You are not responsible for enforcing compliance by third parties to | ||
201 | +this License. | ||
202 | + | ||
203 | + 7. If, as a consequence of a court judgment or allegation of patent | ||
204 | +infringement or for any other reason (not limited to patent issues), | ||
205 | +conditions are imposed on you (whether by court order, agreement or | ||
206 | +otherwise) that contradict the conditions of this License, they do not | ||
207 | +excuse you from the conditions of this License. If you cannot | ||
208 | +distribute so as to satisfy simultaneously your obligations under this | ||
209 | +License and any other pertinent obligations, then as a consequence you | ||
210 | +may not distribute the Program at all. For example, if a patent | ||
211 | +license would not permit royalty-free redistribution of the Program by | ||
212 | +all those who receive copies directly or indirectly through you, then | ||
213 | +the only way you could satisfy both it and this License would be to | ||
214 | +refrain entirely from distribution of the Program. | ||
215 | + | ||
216 | +If any portion of this section is held invalid or unenforceable under | ||
217 | +any particular circumstance, the balance of the section is intended to | ||
218 | +apply and the section as a whole is intended to apply in other | ||
219 | +circumstances. | ||
220 | + | ||
221 | +It is not the purpose of this section to induce you to infringe any | ||
222 | +patents or other property right claims or to contest validity of any | ||
223 | +such claims; this section has the sole purpose of protecting the | ||
224 | +integrity of the free software distribution system, which is | ||
225 | +implemented by public license practices. Many people have made | ||
226 | +generous contributions to the wide range of software distributed | ||
227 | +through that system in reliance on consistent application of that | ||
228 | +system; it is up to the author/donor to decide if he or she is willing | ||
229 | +to distribute software through any other system and a licensee cannot | ||
230 | +impose that choice. | ||
231 | + | ||
232 | +This section is intended to make thoroughly clear what is believed to | ||
233 | +be a consequence of the rest of this License. | ||
234 | + | ||
235 | + 8. If the distribution and/or use of the Program is restricted in | ||
236 | +certain countries either by patents or by copyrighted interfaces, the | ||
237 | +original copyright holder who places the Program under this License | ||
238 | +may add an explicit geographical distribution limitation excluding | ||
239 | +those countries, so that distribution is permitted only in or among | ||
240 | +countries not thus excluded. In such case, this License incorporates | ||
241 | +the limitation as if written in the body of this License. | ||
242 | + | ||
243 | + 9. The Free Software Foundation may publish revised and/or new versions | ||
244 | +of the General Public License from time to time. Such new versions will | ||
245 | +be similar in spirit to the present version, but may differ in detail to | ||
246 | +address new problems or concerns. | ||
247 | + | ||
248 | +Each version is given a distinguishing version number. If the Program | ||
249 | +specifies a version number of this License which applies to it and "any | ||
250 | +later version", you have the option of following the terms and conditions | ||
251 | +either of that version or of any later version published by the Free | ||
252 | +Software Foundation. If the Program does not specify a version number of | ||
253 | +this License, you may choose any version ever published by the Free Software | ||
254 | +Foundation. | ||
255 | + | ||
256 | + 10. If you wish to incorporate parts of the Program into other free | ||
257 | +programs whose distribution conditions are different, write to the author | ||
258 | +to ask for permission. For software which is copyrighted by the Free | ||
259 | +Software Foundation, write to the Free Software Foundation; we sometimes | ||
260 | +make exceptions for this. Our decision will be guided by the two goals | ||
261 | +of preserving the free status of all derivatives of our free software and | ||
262 | +of promoting the sharing and reuse of software generally. | ||
263 | + | ||
264 | + NO WARRANTY | ||
265 | + | ||
266 | + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY | ||
267 | +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN | ||
268 | +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES | ||
269 | +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED | ||
270 | +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | ||
271 | +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS | ||
272 | +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE | ||
273 | +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, | ||
274 | +REPAIR OR CORRECTION. | ||
275 | + | ||
276 | + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING | ||
277 | +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR | ||
278 | +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, | ||
279 | +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING | ||
280 | +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED | ||
281 | +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY | ||
282 | +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER | ||
283 | +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE | ||
284 | +POSSIBILITY OF SUCH DAMAGES. | ||
285 | + | ||
286 | + END OF TERMS AND CONDITIONS | ||
287 | + | ||
288 | + How to Apply These Terms to Your New Programs | ||
289 | + | ||
290 | + If you develop a new program, and you want it to be of the greatest | ||
291 | +possible use to the public, the best way to achieve this is to make it | ||
292 | +free software which everyone can redistribute and change under these terms. | ||
293 | + | ||
294 | + To do so, attach the following notices to the program. It is safest | ||
295 | +to attach them to the start of each source file to most effectively | ||
296 | +convey the exclusion of warranty; and each file should have at least | ||
297 | +the "copyright" line and a pointer to where the full notice is found. | ||
298 | + | ||
299 | + <one line to give the program's name and a brief idea of what it does.> | ||
300 | + Copyright (C) <year> <name of author> | ||
301 | + | ||
302 | + This program is free software; you can redistribute it and/or modify | ||
303 | + it under the terms of the GNU General Public License as published by | ||
304 | + the Free Software Foundation; either version 2 of the License, or | ||
305 | + (at your option) any later version. | ||
306 | + | ||
307 | + This program is distributed in the hope that it will be useful, | ||
308 | + but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
309 | + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
310 | + GNU General Public License for more details. | ||
311 | + | ||
312 | + You should have received a copy of the GNU General Public License | ||
313 | + along with this program; if not, write to the Free Software | ||
314 | + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | ||
315 | + | ||
316 | + | ||
317 | +Also add information on how to contact you by electronic and paper mail. | ||
318 | + | ||
319 | +If the program is interactive, make it output a short notice like this | ||
320 | +when it starts in an interactive mode: | ||
321 | + | ||
322 | + Gnomovision version 69, Copyright (C) year name of author | ||
323 | + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. | ||
324 | + This is free software, and you are welcome to redistribute it | ||
325 | + under certain conditions; type `show c' for details. | ||
326 | + | ||
327 | +The hypothetical commands `show w' and `show c' should show the appropriate | ||
328 | +parts of the General Public License. Of course, the commands you use may | ||
329 | +be called something other than `show w' and `show c'; they could even be | ||
330 | +mouse-clicks or menu items--whatever suits your program. | ||
331 | + | ||
332 | +You should also get your employer (if you work as a programmer) or your | ||
333 | +school, if any, to sign a "copyright disclaimer" for the program, if | ||
334 | +necessary. Here is a sample; alter the names: | ||
335 | + | ||
336 | + Yoyodyne, Inc., hereby disclaims all copyright interest in the program | ||
337 | + `Gnomovision' (which makes passes at compilers) written by James Hacker. | ||
338 | + | ||
339 | + <signature of Ty Coon>, 1 April 1989 | ||
340 | + Ty Coon, President of Vice | ||
341 | + | ||
342 | +This General Public License does not permit incorporating your program into | ||
343 | +proprietary programs. If your program is a subroutine library, you may | ||
344 | +consider it more useful to permit linking proprietary applications with the | ||
345 | +library. If this is what you want to do, use the GNU Library General | ||
346 | +Public License instead of this License. | ||
diff --git a/meta/recipes-devtools/makedevs/makedevs/makedevs.c b/meta/recipes-devtools/makedevs/makedevs/makedevs.c new file mode 100644 index 0000000000..771f33ef5a --- /dev/null +++ b/meta/recipes-devtools/makedevs/makedevs/makedevs.c | |||
@@ -0,0 +1,589 @@ | |||
1 | #define _GNU_SOURCE | ||
2 | #include <stdio.h> | ||
3 | #include <errno.h> | ||
4 | #include <string.h> | ||
5 | #include <stdarg.h> | ||
6 | #include <stdlib.h> | ||
7 | #include <ctype.h> | ||
8 | #include <fcntl.h> | ||
9 | #include <dirent.h> | ||
10 | #include <unistd.h> | ||
11 | #include <time.h> | ||
12 | #include <getopt.h> | ||
13 | #include <libgen.h> | ||
14 | #include <sys/types.h> | ||
15 | #include <sys/stat.h> | ||
16 | |||
17 | #define MINORBITS 8 | ||
18 | #define MKDEV(ma,mi) (((ma) << MINORBITS) | (mi)) | ||
19 | #define MAX_ID_LEN 40 | ||
20 | #define MAX_NAME_LEN 40 | ||
21 | #ifndef PATH_MAX | ||
22 | #define PATH_MAX 4096 | ||
23 | #endif | ||
24 | #define VERSION "1.0.1" | ||
25 | |||
26 | /* These are all stolen from busybox's libbb to make | ||
27 | * error handling simpler (and since I maintain busybox, | ||
28 | * I'm rather partial to these for error handling). | ||
29 | * -Erik | ||
30 | */ | ||
31 | static const char *const app_name = "makedevs"; | ||
32 | static const char *const memory_exhausted = "memory exhausted"; | ||
33 | static char default_rootdir[]="."; | ||
34 | static char *rootdir = default_rootdir; | ||
35 | static int trace = 0; | ||
36 | |||
37 | struct name_id { | ||
38 | char name[MAX_NAME_LEN+1]; | ||
39 | unsigned long id; | ||
40 | struct name_id *next; | ||
41 | }; | ||
42 | |||
43 | static struct name_id *usr_list = NULL; | ||
44 | static struct name_id *grp_list = NULL; | ||
45 | |||
46 | static void verror_msg(const char *s, va_list p) | ||
47 | { | ||
48 | fflush(stdout); | ||
49 | fprintf(stderr, "%s: ", app_name); | ||
50 | vfprintf(stderr, s, p); | ||
51 | } | ||
52 | |||
53 | static void error_msg_and_die(const char *s, ...) | ||
54 | { | ||
55 | va_list p; | ||
56 | |||
57 | va_start(p, s); | ||
58 | verror_msg(s, p); | ||
59 | va_end(p); | ||
60 | putc('\n', stderr); | ||
61 | exit(EXIT_FAILURE); | ||
62 | } | ||
63 | |||
64 | static void vperror_msg(const char *s, va_list p) | ||
65 | { | ||
66 | int err = errno; | ||
67 | |||
68 | if (s == 0) | ||
69 | s = ""; | ||
70 | verror_msg(s, p); | ||
71 | if (*s) | ||
72 | s = ": "; | ||
73 | fprintf(stderr, "%s%s\n", s, strerror(err)); | ||
74 | } | ||
75 | |||
76 | static void perror_msg_and_die(const char *s, ...) | ||
77 | { | ||
78 | va_list p; | ||
79 | |||
80 | va_start(p, s); | ||
81 | vperror_msg(s, p); | ||
82 | va_end(p); | ||
83 | exit(EXIT_FAILURE); | ||
84 | } | ||
85 | |||
86 | static FILE *xfopen(const char *path, const char *mode) | ||
87 | { | ||
88 | FILE *fp; | ||
89 | |||
90 | if ((fp = fopen(path, mode)) == NULL) | ||
91 | perror_msg_and_die("%s", path); | ||
92 | return fp; | ||
93 | } | ||
94 | |||
95 | static char *xstrdup(const char *s) | ||
96 | { | ||
97 | char *t; | ||
98 | |||
99 | if (s == NULL) | ||
100 | return NULL; | ||
101 | |||
102 | t = strdup(s); | ||
103 | |||
104 | if (t == NULL) | ||
105 | error_msg_and_die(memory_exhausted); | ||
106 | |||
107 | return t; | ||
108 | } | ||
109 | |||
110 | static struct name_id* alloc_node(void) | ||
111 | { | ||
112 | struct name_id *node; | ||
113 | node = (struct name_id*)malloc(sizeof(struct name_id)); | ||
114 | if (node == NULL) { | ||
115 | error_msg_and_die(memory_exhausted); | ||
116 | } | ||
117 | memset((void *)node->name, 0, MAX_NAME_LEN+1); | ||
118 | node->id = 0xffffffff; | ||
119 | node->next = NULL; | ||
120 | return node; | ||
121 | } | ||
122 | |||
123 | static struct name_id* parse_line(char *line) | ||
124 | { | ||
125 | char *p; | ||
126 | int i; | ||
127 | char id_buf[MAX_ID_LEN+1]; | ||
128 | struct name_id *node; | ||
129 | node = alloc_node(); | ||
130 | p = line; | ||
131 | i = 0; | ||
132 | // Get name field | ||
133 | while (*p != ':') { | ||
134 | if (i > MAX_NAME_LEN) | ||
135 | error_msg_and_die("Name field too long"); | ||
136 | node->name[i++] = *p++; | ||
137 | } | ||
138 | node->name[i] = '\0'; | ||
139 | p++; | ||
140 | // Skip the second field | ||
141 | while (*p != ':') | ||
142 | p++; | ||
143 | p++; | ||
144 | // Get id field | ||
145 | i = 0; | ||
146 | while (*p != ':') { | ||
147 | if (i > MAX_ID_LEN) | ||
148 | error_msg_and_die("ID filed too long"); | ||
149 | id_buf[i++] = *p++; | ||
150 | } | ||
151 | id_buf[i] = '\0'; | ||
152 | node->id = atol(id_buf); | ||
153 | return node; | ||
154 | } | ||
155 | |||
156 | static void get_list_from_file(FILE *file, struct name_id **plist) | ||
157 | { | ||
158 | char *line; | ||
159 | int len = 0; | ||
160 | size_t length = 256; | ||
161 | struct name_id *node, *cur; | ||
162 | |||
163 | if((line = (char *)malloc(length)) == NULL) { | ||
164 | error_msg_and_die(memory_exhausted); | ||
165 | } | ||
166 | |||
167 | while ((len = getline(&line, &length, file)) != -1) { | ||
168 | node = parse_line(line); | ||
169 | if (*plist == NULL) { | ||
170 | *plist = node; | ||
171 | cur = *plist; | ||
172 | } else { | ||
173 | cur->next = node; | ||
174 | cur = cur->next; | ||
175 | } | ||
176 | } | ||
177 | |||
178 | if (line) | ||
179 | free(line); | ||
180 | } | ||
181 | |||
182 | static unsigned long convert2guid(char *id_buf, struct name_id *search_list) | ||
183 | { | ||
184 | char *p; | ||
185 | int isnum; | ||
186 | struct name_id *node; | ||
187 | p = id_buf; | ||
188 | isnum = 1; | ||
189 | while (*p != '\0') { | ||
190 | if (!isdigit(*p)) { | ||
191 | isnum = 0; | ||
192 | break; | ||
193 | } | ||
194 | p++; | ||
195 | } | ||
196 | if (isnum) { | ||
197 | // Check for bad user/group name | ||
198 | node = search_list; | ||
199 | while (node != NULL) { | ||
200 | if (!strncmp(node->name, id_buf, strlen(id_buf))) { | ||
201 | fprintf(stderr, "WARNING: Bad user/group name %s detected\n", id_buf); | ||
202 | break; | ||
203 | } | ||
204 | node = node->next; | ||
205 | } | ||
206 | return (unsigned long)atol(id_buf); | ||
207 | } else { | ||
208 | node = search_list; | ||
209 | while (node != NULL) { | ||
210 | if (!strncmp(node->name, id_buf, strlen(id_buf))) | ||
211 | return node->id; | ||
212 | node = node->next; | ||
213 | } | ||
214 | error_msg_and_die("No entry for %s in search list", id_buf); | ||
215 | } | ||
216 | } | ||
217 | |||
218 | static void free_list(struct name_id *list) | ||
219 | { | ||
220 | struct name_id *cur; | ||
221 | cur = list; | ||
222 | while (cur != NULL) { | ||
223 | list = cur; | ||
224 | cur = cur->next; | ||
225 | free(list); | ||
226 | } | ||
227 | } | ||
228 | |||
229 | static void add_new_directory(char *name, char *path, | ||
230 | unsigned long uid, unsigned long gid, unsigned long mode) | ||
231 | { | ||
232 | if (trace) | ||
233 | fprintf(stderr, "Directory: %s %s UID: %ld GID %ld MODE: %04lo", path, name, uid, gid, mode); | ||
234 | |||
235 | if (mkdir(path, mode) < 0) { | ||
236 | if (EEXIST == errno) { | ||
237 | /* Unconditionally apply the mode setting to the existing directory. | ||
238 | * XXX should output something when trace */ | ||
239 | chmod(path, mode & ~S_IFMT); | ||
240 | } | ||
241 | } | ||
242 | if (trace) | ||
243 | putc('\n', stderr); | ||
244 | chown(path, uid, gid); | ||
245 | } | ||
246 | |||
247 | static void add_new_device(char *name, char *path, unsigned long uid, | ||
248 | unsigned long gid, unsigned long mode, dev_t rdev) | ||
249 | { | ||
250 | int status; | ||
251 | struct stat sb; | ||
252 | |||
253 | if (trace) { | ||
254 | fprintf(stderr, "Device: %s %s UID: %ld GID: %ld MODE: %04lo MAJOR: %d MINOR: %d", | ||
255 | path, name, uid, gid, mode, (short)(rdev >> 8), (short)(rdev & 0xff)); | ||
256 | } | ||
257 | |||
258 | memset(&sb, 0, sizeof(struct stat)); | ||
259 | status = lstat(path, &sb); | ||
260 | if (status >= 0) { | ||
261 | /* It is ok for some types of files to not exit on disk (such as | ||
262 | * device nodes), but if they _do_ exist, the file type bits had | ||
263 | * better match those of the actual file or strange things will happen... */ | ||
264 | if ((mode & S_IFMT) != (sb.st_mode & S_IFMT)) { | ||
265 | if (trace) | ||
266 | putc('\n', stderr); | ||
267 | error_msg_and_die("%s: existing file (04%o) type does not match specified file type (04%lo)!", | ||
268 | path, (sb.st_mode & S_IFMT), (mode & S_IFMT)); | ||
269 | } | ||
270 | if (mode != sb.st_mode) { | ||
271 | if (trace) | ||
272 | fprintf(stderr, " -- applying new mode 04%lo (old was 04%o)\n", mode & ~S_IFMT, sb.st_mode & ~S_IFMT); | ||
273 | /* Apply the mode setting to the existing device node */ | ||
274 | chmod(path, mode & ~S_IFMT); | ||
275 | } | ||
276 | else { | ||
277 | if (trace) | ||
278 | fprintf(stderr, " -- extraneous entry in table\n", path); | ||
279 | } | ||
280 | } | ||
281 | else { | ||
282 | mknod(path, mode, rdev); | ||
283 | if (trace) | ||
284 | putc('\n', stderr); | ||
285 | |||
286 | } | ||
287 | |||
288 | chown(path, uid, gid); | ||
289 | } | ||
290 | |||
291 | static void add_new_file(char *name, char *path, unsigned long uid, | ||
292 | unsigned long gid, unsigned long mode) | ||
293 | { | ||
294 | if (trace) { | ||
295 | fprintf(stderr, "File: %s %s UID: %ld GID: %ld MODE: %04lo\n", | ||
296 | path, name, gid, uid, mode); | ||
297 | } | ||
298 | |||
299 | int fd = open(path,O_CREAT | O_WRONLY, mode); | ||
300 | if (fd < 0) { | ||
301 | error_msg_and_die("%s: file can not be created!", path); | ||
302 | } else { | ||
303 | close(fd); | ||
304 | } | ||
305 | chmod(path, mode); | ||
306 | chown(path, uid, gid); | ||
307 | } | ||
308 | |||
309 | |||
310 | static void add_new_fifo(char *name, char *path, unsigned long uid, | ||
311 | unsigned long gid, unsigned long mode) | ||
312 | { | ||
313 | if (trace) { | ||
314 | printf("Fifo: %s %s UID: %ld GID: %ld MODE: %04lo\n", | ||
315 | path, name, gid, uid, mode); | ||
316 | } | ||
317 | |||
318 | int status; | ||
319 | struct stat sb; | ||
320 | |||
321 | memset(&sb, 0, sizeof(struct stat)); | ||
322 | status = stat(path, &sb); | ||
323 | |||
324 | |||
325 | /* Update the mode if we exist and are a fifo already */ | ||
326 | if (status >= 0 && S_ISFIFO(sb.st_mode)) { | ||
327 | chmod(path, mode); | ||
328 | } else { | ||
329 | if (mknod(path, mode, 0)) | ||
330 | error_msg_and_die("%s: file can not be created with mknod!", path); | ||
331 | } | ||
332 | chown(path, uid, gid); | ||
333 | } | ||
334 | |||
335 | |||
336 | /* device table entries take the form of: | ||
337 | <path> <type> <mode> <usr> <grp> <major> <minor> <start> <inc> <count> | ||
338 | /dev/mem c 640 0 0 1 1 0 0 - | ||
339 | /dev/zero c 644 root root 1 5 - - - | ||
340 | |||
341 | type can be one of: | ||
342 | f A regular file | ||
343 | d Directory | ||
344 | c Character special device file | ||
345 | b Block special device file | ||
346 | p Fifo (named pipe) | ||
347 | |||
348 | I don't bother with symlinks (permissions are irrelevant), hard | ||
349 | links (special cases of regular files), or sockets (why bother). | ||
350 | |||
351 | Regular files must exist in the target root directory. If a char, | ||
352 | block, fifo, or directory does not exist, it will be created. | ||
353 | */ | ||
354 | static int interpret_table_entry(char *line) | ||
355 | { | ||
356 | char *name; | ||
357 | char usr_buf[MAX_ID_LEN]; | ||
358 | char grp_buf[MAX_ID_LEN]; | ||
359 | char path[4096], type; | ||
360 | unsigned long mode = 0755, uid = 0, gid = 0, major = 0, minor = 0; | ||
361 | unsigned long start = 0, increment = 1, count = 0; | ||
362 | |||
363 | if (0 > sscanf(line, "%40s %c %lo %40s %40s %lu %lu %lu %lu %lu", path, | ||
364 | &type, &mode, usr_buf, grp_buf, &major, &minor, &start, | ||
365 | &increment, &count)) | ||
366 | { | ||
367 | fprintf(stderr, "%s: sscanf returned < 0 for line '%s'\n", app_name, line); | ||
368 | return 1; | ||
369 | } | ||
370 | |||
371 | uid = convert2guid(usr_buf, usr_list); | ||
372 | gid = convert2guid(grp_buf, grp_list); | ||
373 | |||
374 | if (strncmp(path, "/", 1)) { | ||
375 | error_msg_and_die("Device table entries require absolute paths"); | ||
376 | } | ||
377 | name = xstrdup(path + 1); | ||
378 | /* prefix path with rootdir */ | ||
379 | sprintf(path, "%s/%s", rootdir, name); | ||
380 | |||
381 | /* XXX Why is name passed into all of the add_new_*() routines? */ | ||
382 | switch (type) { | ||
383 | case 'd': | ||
384 | mode |= S_IFDIR; | ||
385 | add_new_directory(name, path, uid, gid, mode); | ||
386 | break; | ||
387 | case 'f': | ||
388 | mode |= S_IFREG; | ||
389 | add_new_file(name, path, uid, gid, mode); | ||
390 | break; | ||
391 | case 'p': | ||
392 | mode |= S_IFIFO; | ||
393 | add_new_fifo(name, path, uid, gid, mode); | ||
394 | break; | ||
395 | case 'c': | ||
396 | case 'b': | ||
397 | mode |= (type == 'c') ? S_IFCHR : S_IFBLK; | ||
398 | if (count > 0) { | ||
399 | int i; | ||
400 | dev_t rdev; | ||
401 | char buf[80]; | ||
402 | |||
403 | for (i = start; i < start + count; i++) { | ||
404 | sprintf(buf, "%s%d", name, i); | ||
405 | sprintf(path, "%s/%s%d", rootdir, name, i); | ||
406 | /* FIXME: MKDEV uses illicit insider knowledge of kernel | ||
407 | * major/minor representation... */ | ||
408 | rdev = MKDEV(major, minor + (i - start) * increment); | ||
409 | sprintf(path, "%s/%s\0", rootdir, buf); | ||
410 | add_new_device(buf, path, uid, gid, mode, rdev); | ||
411 | } | ||
412 | } else { | ||
413 | /* FIXME: MKDEV uses illicit insider knowledge of kernel | ||
414 | * major/minor representation... */ | ||
415 | dev_t rdev = MKDEV(major, minor); | ||
416 | add_new_device(name, path, uid, gid, mode, rdev); | ||
417 | } | ||
418 | break; | ||
419 | default: | ||
420 | error_msg_and_die("Unsupported file type"); | ||
421 | } | ||
422 | if (name) free(name); | ||
423 | return 0; | ||
424 | } | ||
425 | |||
426 | |||
427 | static void parse_device_table(FILE * file) | ||
428 | { | ||
429 | char *line; | ||
430 | size_t length = 256; | ||
431 | int len = 0; | ||
432 | |||
433 | if((line = (char *)malloc(length)) == NULL) { | ||
434 | error_msg_and_die(memory_exhausted); | ||
435 | } | ||
436 | /* Looks ok so far. The general plan now is to read in one | ||
437 | * line at a time, trim off leading and trailing whitespace, | ||
438 | * check for leading comment delimiters ('#') or a blank line, | ||
439 | * then try and parse the line as a device table entry. If we fail | ||
440 | * to parse things, try and help the poor fool to fix their | ||
441 | * device table with a useful error msg... */ | ||
442 | |||
443 | while ((len = getline(&line, &length, file)) != -1) { | ||
444 | /* First trim off any whitespace */ | ||
445 | |||
446 | /* trim trailing whitespace */ | ||
447 | while (len > 0 && isspace(line[len - 1])) | ||
448 | line[--len] = '\0'; | ||
449 | |||
450 | /* trim leading whitespace */ | ||
451 | memmove(line, &line[strspn(line, " \n\r\t\v")], len + 1); | ||
452 | |||
453 | /* If this is NOT a comment or an empty line, try to interpret it */ | ||
454 | if (*line != '#' && *line != '\0') interpret_table_entry(line); | ||
455 | } | ||
456 | |||
457 | if (line) | ||
458 | free(line); | ||
459 | } | ||
460 | |||
461 | static int parse_devtable(FILE * devtable) | ||
462 | { | ||
463 | struct stat sb; | ||
464 | |||
465 | if (lstat(rootdir, &sb)) { | ||
466 | perror_msg_and_die("%s", rootdir); | ||
467 | } | ||
468 | if (chdir(rootdir)) | ||
469 | perror_msg_and_die("%s", rootdir); | ||
470 | |||
471 | if (devtable) | ||
472 | parse_device_table(devtable); | ||
473 | |||
474 | return 0; | ||
475 | } | ||
476 | |||
477 | |||
478 | static struct option long_options[] = { | ||
479 | {"root", 1, NULL, 'r'}, | ||
480 | {"help", 0, NULL, 'h'}, | ||
481 | {"trace", 0, NULL, 't'}, | ||
482 | {"version", 0, NULL, 'v'}, | ||
483 | {"devtable", 1, NULL, 'D'}, | ||
484 | {NULL, 0, NULL, 0} | ||
485 | }; | ||
486 | |||
487 | static char *helptext = | ||
488 | "Usage: makedevs [OPTIONS]\n" | ||
489 | "Build entries based upon device_table.txt\n\n" | ||
490 | "Options:\n" | ||
491 | " -r, -d, --root=DIR Build filesystem from directory DIR (default: cwd)\n" | ||
492 | " -D, --devtable=FILE Use the named FILE as a device table file\n" | ||
493 | " -h, --help Display this help text\n" | ||
494 | " -t, --trace Be verbose\n" | ||
495 | " -v, --version Display version information\n\n"; | ||
496 | |||
497 | |||
498 | int main(int argc, char **argv) | ||
499 | { | ||
500 | int c, opt; | ||
501 | extern char *optarg; | ||
502 | struct stat statbuf; | ||
503 | char passwd_path[PATH_MAX]; | ||
504 | char group_path[PATH_MAX]; | ||
505 | FILE *passwd_file = NULL; | ||
506 | FILE *group_file = NULL; | ||
507 | FILE *devtable = NULL; | ||
508 | DIR *dir = NULL; | ||
509 | |||
510 | umask (0); | ||
511 | |||
512 | if (argc==1) { | ||
513 | fprintf(stderr, helptext); | ||
514 | exit(1); | ||
515 | } | ||
516 | |||
517 | while ((opt = getopt_long(argc, argv, "D:d:r:htv", | ||
518 | long_options, &c)) >= 0) { | ||
519 | switch (opt) { | ||
520 | case 'D': | ||
521 | devtable = xfopen(optarg, "r"); | ||
522 | if (fstat(fileno(devtable), &statbuf) < 0) | ||
523 | perror_msg_and_die(optarg); | ||
524 | if (statbuf.st_size < 10) | ||
525 | error_msg_and_die("%s: not a proper device table file", optarg); | ||
526 | break; | ||
527 | case 'h': | ||
528 | printf(helptext); | ||
529 | exit(0); | ||
530 | case 'r': | ||
531 | case 'd': /* for compatibility with mkfs.jffs, genext2fs, etc... */ | ||
532 | if (rootdir != default_rootdir) { | ||
533 | error_msg_and_die("root directory specified more than once"); | ||
534 | } | ||
535 | if ((dir = opendir(optarg)) == NULL) { | ||
536 | perror_msg_and_die(optarg); | ||
537 | } else { | ||
538 | closedir(dir); | ||
539 | } | ||
540 | /* If "/" is specified, use "" because rootdir is always prepended to a | ||
541 | * string that starts with "/" */ | ||
542 | if (0 == strcmp(optarg, "/")) | ||
543 | rootdir = xstrdup(""); | ||
544 | else | ||
545 | rootdir = xstrdup(optarg); | ||
546 | break; | ||
547 | |||
548 | case 't': | ||
549 | trace = 1; | ||
550 | break; | ||
551 | |||
552 | case 'v': | ||
553 | printf("%s: %s\n", app_name, VERSION); | ||
554 | exit(0); | ||
555 | default: | ||
556 | fprintf(stderr, helptext); | ||
557 | exit(1); | ||
558 | } | ||
559 | } | ||
560 | |||
561 | if (argv[optind] != NULL) { | ||
562 | fprintf(stderr, helptext); | ||
563 | exit(1); | ||
564 | } | ||
565 | |||
566 | // Get name-id mapping | ||
567 | sprintf(passwd_path, "%s/etc/passwd", rootdir); | ||
568 | sprintf(group_path, "%s/etc/group", rootdir); | ||
569 | if ((passwd_file = fopen(passwd_path, "r")) != NULL) { | ||
570 | get_list_from_file(passwd_file, &usr_list); | ||
571 | fclose(passwd_file); | ||
572 | } | ||
573 | if ((group_file = fopen(group_path, "r")) != NULL) { | ||
574 | get_list_from_file(group_file, &grp_list); | ||
575 | fclose(group_file); | ||
576 | } | ||
577 | |||
578 | // Parse devtable | ||
579 | if(devtable) { | ||
580 | parse_devtable(devtable); | ||
581 | fclose(devtable); | ||
582 | } | ||
583 | |||
584 | // Free list | ||
585 | free_list(usr_list); | ||
586 | free_list(grp_list); | ||
587 | |||
588 | return 0; | ||
589 | } | ||