aboutsummaryrefslogtreecommitdiff
path: root/applets/applet_tables.c
diff options
context:
space:
mode:
authorRon Yorston <rmy@pobox.com>2016-03-30 00:42:05 +0200
committerDenys Vlasenko <vda.linux@googlemail.com>2016-03-30 00:44:11 +0200
commit610c4c385b38280c7bde7a48d95ec019cbfe1ab4 (patch)
tree82ad4366ce9e927f64efa89d178c4dd2bfea1435 /applets/applet_tables.c
parent9844d7e830a2c55421e27e8828d2067c50f57c23 (diff)
downloadbusybox-w32-610c4c385b38280c7bde7a48d95ec019cbfe1ab4.tar.gz
busybox-w32-610c4c385b38280c7bde7a48d95ec019cbfe1ab4.tar.bz2
busybox-w32-610c4c385b38280c7bde7a48d95ec019cbfe1ab4.zip
applet_tables: save space by removing applet name offsets
The array applet_nameofs consumes two bytes per applet. It encodes nofork/noexec flags suid flags the offset of the applet name in the applet_name string Change the applet_table build tool to store the flags in two separate arrays (applet_flags and applet_suid). Replace applet_nameofs[] with a smaller version that only stores a limited number of offsets. This requires changes to the macros APPLET_IS_NOFORK, APPLET_IS_NOEXEC and APPLET_SUID. According to Valgrind the original find_applet_by_name required 353 cycles per call, averaged over all names. Adjusting the number of known offsets allows space to be traded off against execution time: KNOWN_OFFSETS cycles bytes (wrt KNOWN_OFFSETS = 0) 0 9057 - 2 4604 32 4 2407 75 8 1342 98 16 908 130 32 884 194 This patch uses KNOWN_OFFSETS = 8. v2: Remove some dead code from the applet_table tool; Treat the applet in the middle of the table as a special case. v3: Use the middle applet to adjust the start of the linear search as well as the last applet found. v4: Use an augmented linear search in find_applet_by_name. Drop the special treatment of the middle name from get_applet_name: most of the advantage now derives from the last stored value. v5: Don't store index in applet_nameofs, it can be calculated. v6: Tweaks by Denys function old new delta find_applet_by_name 25 125 +100 applet_suid - 92 +92 run_applet_no_and_exit 452 460 +8 run_applet_and_exit 695 697 +2 applet_name_compare 31 - -31 applet_nameofs 734 14 -720 ------------------------------------------------------------------------------ (add/remove: 1/1 grow/shrink: 3/1 up/down: 202/-751) Total: -549 bytes text data bss dec hex filename 925464 906 17160 943530 e65aa busybox_old 924915 906 17160 942981 e6385 busybox_unstripped Signed-off-by: Ron Yorston <rmy@pobox.com> Signed-off-by: Denys Vlasenko <vda.linux@googlemail.com>
Diffstat (limited to 'applets/applet_tables.c')
-rw-r--r--applets/applet_tables.c78
1 files changed, 60 insertions, 18 deletions
diff --git a/applets/applet_tables.c b/applets/applet_tables.c
index 92bf1e447..48544f08d 100644
--- a/applets/applet_tables.c
+++ b/applets/applet_tables.c
@@ -41,8 +41,6 @@ struct bb_applet {
41 41
42enum { NUM_APPLETS = ARRAY_SIZE(applets) }; 42enum { NUM_APPLETS = ARRAY_SIZE(applets) };
43 43
44static int offset[NUM_APPLETS];
45
46static int cmp_name(const void *a, const void *b) 44static int cmp_name(const void *a, const void *b)
47{ 45{
48 const struct bb_applet *aa = a; 46 const struct bb_applet *aa = a;
@@ -60,22 +58,37 @@ static int str_isalnum_(const char *s)
60 return 1; 58 return 1;
61} 59}
62 60
61// Before linear search, narrow it down by looking at N "equidistant" names:
62// KNOWN_APPNAME_OFFSETS cycles code_size
63// 0 9057
64// 2 4604 +32
65// 4 2407 +75
66// 8 1342 +98
67// 16 908 +130
68// 32 884 +194
69// With 8, applet_nameofs[] table has 7 elements.
70#define KNOWN_APPNAME_OFFSETS 8
71
63int main(int argc, char **argv) 72int main(int argc, char **argv)
64{ 73{
65 int i; 74 int i, j;
66 int ofs; 75 int ofs, offset[KNOWN_APPNAME_OFFSETS], index[KNOWN_APPNAME_OFFSETS];
67// unsigned MAX_APPLET_NAME_LEN = 1; 76// unsigned MAX_APPLET_NAME_LEN = 1;
68 77
69 qsort(applets, NUM_APPLETS, sizeof(applets[0]), cmp_name); 78 qsort(applets, NUM_APPLETS, sizeof(applets[0]), cmp_name);
70 79
80 for (i = 0; i < KNOWN_APPNAME_OFFSETS; i++)
81 index[i] = i * NUM_APPLETS / KNOWN_APPNAME_OFFSETS;
82
71 ofs = 0; 83 ofs = 0;
72 for (i = 0; i < NUM_APPLETS; i++) { 84 for (i = 0; i < NUM_APPLETS; i++) {
73 offset[i] = ofs; 85 for (j = 0; j < KNOWN_APPNAME_OFFSETS; j++)
86 if (i == index[j])
87 offset[j] = ofs;
74 ofs += strlen(applets[i].name) + 1; 88 ofs += strlen(applets[i].name) + 1;
75 } 89 }
76 /* We reuse 4 high-order bits of offset array for other purposes, 90 /* If the list of names is too long refuse to proceed */
77 * so if they are indeed needed, refuse to proceed */ 91 if (ofs > 0xffff)
78 if (ofs > 0xfff)
79 return 1; 92 return 1;
80 if (!argv[1]) 93 if (!argv[1])
81 return 1; 94 return 1;
@@ -94,7 +107,17 @@ int main(int argc, char **argv)
94 printf("#define SINGLE_APPLET_STR \"%s\"\n", applets[0].name); 107 printf("#define SINGLE_APPLET_STR \"%s\"\n", applets[0].name);
95 printf("#define SINGLE_APPLET_MAIN %s_main\n", applets[0].main); 108 printf("#define SINGLE_APPLET_MAIN %s_main\n", applets[0].main);
96 } 109 }
97 printf("\n"); 110
111 if (KNOWN_APPNAME_OFFSETS > 0 && NUM_APPLETS > 2*KNOWN_APPNAME_OFFSETS) {
112 printf("#define KNOWN_APPNAME_OFFSETS %u\n\n", KNOWN_APPNAME_OFFSETS);
113 printf("const uint16_t applet_nameofs[] ALIGN2 = {\n");
114 for (i = 1; i < KNOWN_APPNAME_OFFSETS; i++)
115 printf("%d,\n", offset[i]);
116 printf("};\n\n");
117 }
118 else {
119 printf("#define KNOWN_APPNAME_OFFSETS 0\n\n");
120 }
98 121
99 //printf("#ifndef SKIP_definitions\n"); 122 //printf("#ifndef SKIP_definitions\n");
100 printf("const char applet_names[] ALIGN1 = \"\"\n"); 123 printf("const char applet_names[] ALIGN1 = \"\"\n");
@@ -119,20 +142,39 @@ int main(int argc, char **argv)
119 printf("};\n"); 142 printf("};\n");
120 printf("#endif\n\n"); 143 printf("#endif\n\n");
121 144
122 printf("const uint16_t applet_nameofs[] ALIGN2 = {\n");
123 for (i = 0; i < NUM_APPLETS; i++) {
124 printf("0x%04x,\n",
125 offset[i]
126#if ENABLE_FEATURE_PREFER_APPLETS 145#if ENABLE_FEATURE_PREFER_APPLETS
127 + (applets[i].nofork << 12) 146 printf("const uint8_t applet_flags[] ALIGN1 = {\n");
128 + (applets[i].noexec << 13) 147 i = 0;
148 while (i < NUM_APPLETS) {
149 int v = applets[i].nofork + (applets[i].noexec << 1);
150 if (++i < NUM_APPLETS)
151 v |= (applets[i].nofork + (applets[i].noexec << 1)) << 2;
152 if (++i < NUM_APPLETS)
153 v |= (applets[i].nofork + (applets[i].noexec << 1)) << 4;
154 if (++i < NUM_APPLETS)
155 v |= (applets[i].nofork + (applets[i].noexec << 1)) << 6;
156 printf("0x%02x,\n", v);
157 i++;
158 }
159 printf("};\n\n");
129#endif 160#endif
161
130#if ENABLE_FEATURE_SUID 162#if ENABLE_FEATURE_SUID
131 + (applets[i].need_suid << 14) /* 2 bits */ 163 printf("const uint8_t applet_suid[] ALIGN1 = {\n");
132#endif 164 i = 0;
133 ); 165 while (i < NUM_APPLETS) {
166 int v = applets[i].need_suid; /* 2 bits */
167 if (++i < NUM_APPLETS)
168 v |= applets[i].need_suid << 2;
169 if (++i < NUM_APPLETS)
170 v |= applets[i].need_suid << 4;
171 if (++i < NUM_APPLETS)
172 v |= applets[i].need_suid << 6;
173 printf("0x%02x,\n", v);
174 i++;
134 } 175 }
135 printf("};\n\n"); 176 printf("};\n\n");
177#endif
136 178
137#if ENABLE_FEATURE_INSTALLER 179#if ENABLE_FEATURE_INSTALLER
138 printf("const uint8_t applet_install_loc[] ALIGN1 = {\n"); 180 printf("const uint8_t applet_install_loc[] ALIGN1 = {\n");