blob: e3f6ddf4697a1ff0d6788c6d2d3fa0b10778de71 [file] [log] [blame]
landley13bab2f2006-09-27 00:45:05 -04001/* vi: set ts=4 :*/
2/* Toybox infrastructure.
3 *
4 * Copyright 2006 Rob Landley <rob@landley.net>
landley13bab2f2006-09-27 00:45:05 -04005 */
6
landleyc5621502006-09-28 17:18:51 -04007#include "toys.h"
8
Rob Landleyf2311a42006-11-04 17:45:18 -05009// Populate toy_list[].
landleyc5621502006-09-28 17:18:51 -040010
Rob Landleya6d696b2007-01-31 13:31:19 -050011#undef NEWTOY
12#undef OLDTOY
13#define NEWTOY(name, opts, flags) {#name, name##_main, opts, flags},
14#define OLDTOY(name, oldname, opts, flags) {#name, oldname##_main, opts, flags},
15
landleyc5621502006-09-28 17:18:51 -040016struct toy_list toy_list[] = {
Rob Landleyf2311a42006-11-04 17:45:18 -050017#include "toys/toylist.h"
landleyc5621502006-09-28 17:18:51 -040018};
19
landley4f344e32006-10-05 16:18:03 -040020#define TOY_LIST_LEN (sizeof(toy_list)/sizeof(struct toy_list))
21
landleyc5621502006-09-28 17:18:51 -040022// global context for this applet.
23
24struct toy_context toys;
Rob Landley5a60e262007-02-02 10:53:55 -050025union toy_union toy;
Rob Landley055cfcb2007-01-14 20:20:06 -050026char toybuf[4096];
landleyc5621502006-09-28 17:18:51 -040027
landley4f344e32006-10-05 16:18:03 -040028struct toy_list *toy_find(char *name)
landley13bab2f2006-09-27 00:45:05 -040029{
30 int top, bottom, middle;
31
32 // If the name starts with "toybox", accept that as a match. Otherwise
33 // skip the first entry, which is out of order.
34
35 if (!strncmp(name,"toybox",6)) return toy_list;
landley4f344e32006-10-05 16:18:03 -040036 bottom = 1;
landley13bab2f2006-09-27 00:45:05 -040037
38 // Binary search to find this applet.
39
landley4f344e32006-10-05 16:18:03 -040040 top = TOY_LIST_LEN-1;
41 for (;;) {
landley13bab2f2006-09-27 00:45:05 -040042 int result;
43
landley4f344e32006-10-05 16:18:03 -040044 middle = (top+bottom)/2;
45 if (middle<bottom || middle>top) return NULL;
landley13bab2f2006-09-27 00:45:05 -040046 result = strcmp(name,toy_list[middle].name);
landley4f344e32006-10-05 16:18:03 -040047 if (!result) return toy_list+middle;
48 if (result<0) top=--middle;
49 else bottom = ++middle;
landley13bab2f2006-09-27 00:45:05 -040050 }
51}
52
Rob Landleyfc2224b2007-06-01 14:31:45 -040053// 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
55// on its' own.
56
57#undef NEWTOY
58#undef OLDTOY
59#define NEWTOY(name, opts, flags) opts ||
60#define OLDTOY(name, oldname, opts, flags) opts ||
Rob Landley4307a7b2007-06-07 15:20:26 -040061static const int NEED_OPTIONS =
Rob Landleyfc2224b2007-06-01 14:31:45 -040062#include "toys/toylist.h"
630; // Ends the opts || opts || opts...
64
landleycd9dfc32006-10-18 18:38:16 -040065void toy_init(struct toy_list *which, char *argv[])
66{
67 // Free old toys contents here?
68
69 toys.which = which;
70 toys.argv = argv;
landleycd9dfc32006-10-18 18:38:16 -040071 toys.exitval = 1;
Rob Landleyfc2224b2007-06-01 14:31:45 -040072 if (NEED_OPTIONS && which->options) get_optflags();
Rob Landleyb841cd22007-06-01 13:41:24 -040073 else toys.optargs = argv+1;
landleycd9dfc32006-10-18 18:38:16 -040074}
75
landley4f344e32006-10-05 16:18:03 -040076// Run a toy.
77void toy_exec(char *argv[])
78{
79 struct toy_list *which;
Rob Landleyb841cd22007-06-01 13:41:24 -040080
landley4f344e32006-10-05 16:18:03 -040081 which = toy_find(argv[0]);
82 if (!which) return;
83
landleycd9dfc32006-10-18 18:38:16 -040084 toy_init(which, argv);
Rob Landleyb841cd22007-06-01 13:41:24 -040085
landley4f344e32006-10-05 16:18:03 -040086 exit(toys.which->toy_main());
87}
88
89int toybox_main(void)
90{
91 static char *toy_paths[]={"usr/","bin/","sbin/",0};
92 int i, len = 0;
93
94 if (toys.argv[1]) {
95 if (toys.argv[1][0]!='-') {
96 toy_exec(toys.argv+1);
97 error_exit("No behavior for %s\n",toys.argv[1]);
98 }
99 }
100
101 // Output list of applets.
102 for (i=1; i<TOY_LIST_LEN; i++) {
103 int fl = toy_list[i].flags;
104 if (fl & TOYMASK_LOCATION) {
105 if (toys.argv[1]) {
106 int j;
107 for (j=0; toy_paths[j]; j++)
108 if (fl & (1<<j)) len += printf("%s", toy_paths[j]);
109 }
110 len += printf("%s ",toy_list[i].name);
111 if (len>65) {
112 putchar('\n');
113 len=0;
114 }
115 }
116 }
117 putchar('\n');
118 return 0;
119}
120
landley13bab2f2006-09-27 00:45:05 -0400121int main(int argc, char *argv[])
122{
Rob Landley5aab9662007-01-18 22:00:46 -0500123 // Artificial scope to eat less stack for things we call
124 {
125 char *name;
landley13bab2f2006-09-27 00:45:05 -0400126
Rob Landley5aab9662007-01-18 22:00:46 -0500127 // Figure out which applet to call.
128 name = rindex(argv[0], '/');
129 if (!name) name=argv[0];
130 else name++;
131 argv[0] = name;
132 }
landley13bab2f2006-09-27 00:45:05 -0400133
landley4f344e32006-10-05 16:18:03 -0400134 toys.argv = argv-1;
135 return toybox_main();
landley13bab2f2006-09-27 00:45:05 -0400136}