10 unsigned int callsites:1;
12 unsigned int ignore_missing:1;
15 static int cmp_sym(const void *p1_, const void *p2_)
17 const struct sl_item *p1 = p1_, *p2 = p2_;
18 const char *s1 = p1->name, *s2 = p2->name;
22 if ((s1[i] | s2[i]) == 0)
28 if (s1[i] == 0 && s2[i] == '@')
30 if (s1[i] == '@' && s2[i] == 0)
39 static int cmp_sym_sort(const void *p1_, const void *p2_)
41 const struct sl_item *p1 = p1_, *p2 = p2_;
42 const char *s1 = p1->name, *s2 = p2->name;
45 ret = cmp_sym(p1_, p2_);
47 printf("%s: dupe sym: '%s' '%s'\n", __func__, s1, s2);
53 void read_list(struct sl_item **sl_in, int *cnt, int *alloc,
54 FILE *f, int callsites, int ignore_missing)
56 struct sl_item *sl = *sl_in;
61 while (fgets(line, sizeof(line), f) != NULL) {
62 next_word(word, sizeof(word), line);
63 if (word[0] == 0 || word[0] == ';' || word[0] == '#')
66 sl[c].name = strdup(word);
67 sl[c].callsites = callsites;
68 sl[c].ignore_missing = ignore_missing;
74 sl = realloc(sl, *alloc * sizeof(sl[0]));
75 my_assert_not(sl, NULL);
76 memset(sl + c, 0, (*alloc - c) * sizeof(sl[0]));
84 const char *sym_use(const struct sl_item *sym)
86 static char buf[256+3];
89 ret = snprintf(buf, sizeof(buf), "rm_%s", sym->name);
90 if (ret >= sizeof(buf)) {
91 printf("truncation detected: '%s'\n", buf);
98 #define IS(w, y) !strcasecmp(w, y)
99 #define IS_OR2(w, x, y) (IS(w, x) || IS(w, y))
100 #define IS_OR3(w, x, y, z) (IS(w, x) || IS(w, y) || IS(w, z))
102 int main(int argc, char *argv[])
104 struct sl_item *symlist, *sym, ssym = { NULL, };
105 int patch_callsites = 0;
106 int ignore_missing = 0;
107 FILE *fout, *fin, *f;
122 printf("usage:\n%s <asmf_out> <asmf_in> [[-c][-i] <listf>]*>\n",
124 printf(" -c - patch callsites\n"
125 " -i - ignore missing syms\n");
131 symlist = calloc(symlist_alloc, sizeof(symlist[0]));
132 my_assert_not(symlist, NULL);
134 for (i = 3; i < argc; i++) {
135 if (strcmp(argv[i], "-c") == 0) {
139 if (strcmp(argv[i], "-i") == 0) {
144 f = fopen(argv[i], "r");
145 my_assert_not(f, NULL);
146 read_list(&symlist, &symlist_cnt, &symlist_alloc,
147 f, patch_callsites, ignore_missing);
154 qsort(symlist, symlist_cnt, sizeof(symlist[0]), cmp_sym_sort);
157 printf("symlist:\n");
158 for (i = 0; i < symlist_cnt; i++)
159 printf("%d '%s'\n", symlist[i].callsites, symlist[i].name);
162 fin = fopen(argv[2], "r");
163 my_assert_not(fin, NULL);
165 fout = fopen(argv[1], "w");
166 my_assert_not(fout, NULL);
168 while (fgets(line, sizeof(line), fin))
171 if (*p == 0 || *p == ';')
174 p = sskip(next_word(word, sizeof(word), p));
175 if (*p == 0 || *p == ';')
176 goto pass; // need at least 2 words
178 p = next_word(word2, sizeof(word2), p);
180 if (IS_OR2(word2, "proc", "endp")) {
181 if (IS(word2, "proc"))
187 sym = bsearch(&ssym, symlist, symlist_cnt,
188 sizeof(symlist[0]), cmp_sym);
191 fprintf(fout, "rm_%s\t%s%s", word, word2, p);
196 if (IS_OR3(word, "call", "jmp", "public")) {
198 sym = bsearch(&ssym, symlist, symlist_cnt,
199 sizeof(symlist[0]), cmp_sym);
201 && (sym->callsites || IS(word2, func)))
203 fprintf(fout, "\t\t%s\t%s%s", word,
210 if (*p == 0 || *p == ';')
211 goto pass; // need at least 3 words
213 p = next_word(word3, sizeof(word3), p);
217 if ( (IS(word, "push") && IS(word2, "offset"))
218 || (word[0] == 'j' && IS(word2, "short")) ) {
220 sym = bsearch(&ssym, symlist, symlist_cnt,
221 sizeof(symlist[0]), cmp_sym);
223 && (sym->callsites || IS(word3, func)))
225 fprintf(fout, "\t\t%s %s %s%s",
226 word, word2, sym_use(sym), p);
232 if (IS(word, "dd") && IS(word2, "offset")) {
233 fprintf(fout, "\t\tdd");
239 if (*p == 0 || *p == ';')
240 goto pass; // need at least 4 words
242 p = next_word(word4, sizeof(word4), p);
244 // <name> dd offset <sym>
245 if (IS(word2, "dd") && IS(word3, "offset")) {
246 fprintf(fout, "%s\tdd", word);
251 // mov <something>, offset <sym>
252 // jcc <some> ptr <sym>
253 if ( (IS(word, "mov") && IS(word3, "offset"))
254 || (word[0] == 'j' && IS(word3, "ptr")) ) {
256 sym = bsearch(&ssym, symlist, symlist_cnt,
257 sizeof(symlist[0]), cmp_sym);
258 if (sym != NULL && sym->callsites) {
259 fprintf(fout, "\t\t%s\t%s %s %s%s",
267 if (*p == 0 || *p == ';')
268 goto pass; // need at least 5 words
270 p = next_word(word5, sizeof(word5), p);
273 if (*p == 0 || *p == ';')
274 goto pass; // need at least 6 words
276 p = next_word(word6, sizeof(word6), p);
278 // <op> dword ptr <something>, offset <sym>
279 if ( IS(word2, "dword") && IS(word3, "ptr")
280 && IS(word5, "offset") ) {
282 sym = bsearch(&ssym, symlist, symlist_cnt,
283 sizeof(symlist[0]), cmp_sym);
284 if (sym != NULL && sym->callsites) {
285 fprintf(fout, "\t\t%s\tdword ptr %s offset %s%s",
286 word, word4, sym_use(sym), p);
292 fwrite(line, 1, strlen(line), fout);
297 p2 = strchr(word, ',');
302 sym = bsearch(&ssym, symlist, symlist_cnt,
303 sizeof(symlist[0]), cmp_sym);
304 fprintf(fout, " offset %s%s",
305 (sym != NULL && sym->callsites) ? sym_use(sym) : word,
308 p2 = next_word(word, sizeof(word), p);
309 if (word[0] == 0 || word[0] == ';') {
312 if (!IS(word, "offset")) {
313 printf("could not handle offset array\n");
316 p = next_word(word, sizeof(word), p2);
318 fprintf(fout, "%s", p);
322 for (i = 0; i < symlist_cnt; i++) {
323 if (!symlist[i].found && !symlist[i].ignore_missing)
324 printf("warning: sym '%s' not found\n", symlist[i].name);
333 // vim:ts=2:shiftwidth=2