2 /* Toybox infrastructure.
4 * Copyright 2006 Rob Landley <rob@landley.net>
9 // Populate toy_list[].
13 #define NEWTOY(name, opts, flags) {#name, name##_main, opts, flags},
14 #define OLDTOY(name, oldname, opts, flags) {#name, oldname##_main, opts, flags},
16 struct toy_list toy_list[] = {
17 #include "generated/newtoys.h"
20 #define TOY_LIST_LEN (sizeof(toy_list)/sizeof(struct toy_list))
22 // global context for this applet.
24 struct toy_context toys;
25 union global_union this;
28 struct toy_list *toy_find(char *name)
30 int top, bottom, middle;
32 // If the name starts with "toybox", accept that as a match. Otherwise
33 // skip the first entry, which is out of order.
35 if (!strncmp(name,"toybox",6)) return toy_list;
38 // Binary search to find this applet.
44 middle = (top+bottom)/2;
45 if (middle<bottom || middle>top) return NULL;
46 result = strcmp(name,toy_list[middle].name);
47 if (!result) return toy_list+middle;
48 if (result<0) top=--middle;
49 else bottom = ++middle;
53 // Figure out whether or not anything is using the option parsing logic,
54 // because the compiler can't figure out whether or not to optimize it away
59 #define NEWTOY(name, opts, flags) opts ||
60 #define OLDTOY(name, oldname, opts, flags) opts ||
61 static const int NEED_OPTIONS =
62 #include "generated/newtoys.h"
63 0; // Ends the opts || opts || opts...
65 void toy_init(struct toy_list *which, char *argv[])
67 // Free old toys contents here?
71 if (NEED_OPTIONS && which->options) get_optflags();
72 else toys.optargs = argv+1;
76 void toy_exec(char *argv[])
78 struct toy_list *which;
80 which = toy_find(argv[0]);
82 toy_init(which, argv);
83 toys.which->toy_main();
87 void toybox_main(void)
89 static char *toy_paths[]={"usr/","bin/","sbin/",0};
93 if (toys.argv[1][0]!='-') {
94 toy_exec(toys.argv+1);
95 toys.which = toy_list;
96 error_exit("Unknown command %s",toys.argv[1]);
100 // Output list of applets.
101 for (i=1; i<TOY_LIST_LEN; i++) {
102 int fl = toy_list[i].flags;
103 if (fl & TOYMASK_LOCATION) {
106 for (j=0; toy_paths[j]; j++)
107 if (fl & (1<<j)) len += printf("%s", toy_paths[j]);
109 len += printf("%s ",toy_list[i].name);
119 int main(int argc, char *argv[])
121 // Artificial scope to eat less stack for things we call
125 // Figure out which applet to call.
126 name = rindex(argv[0], '/');
127 if (!name) name=argv[0];