rizin/librz/parse/p/parse_common.c
Dean 59b38e6efa
Add /*<type>*/ comments everywhere (#2986)
Adds /*<type>*/ comments and a linter check from rz-bindgen to enforce
their existence and consistency

Also includes the following fixes made when adding the annotations:
* removed unused intern_table arguments in pyc_dis.c, pyc_dis.h, asm_pyc.c
* removed unused classes argument from place_nodes in agraph.c
* removed unused recurse and recurse_bb functions in canalysis.c
* removed unused vars field from RzPrint struct
* removed unused RzAnalysisType* structs from rz_analysis.h
* removed unused list field from RzEgg struct
* fixed bug in bp_plugin.c where duplication-checking logic iterates over the wrong list
* removed unused q_regs field from RzDebug struct
* removed unused backtrace field from RzDebugPlugin struct
* removed unused classes_list field from RzBinNXOObj struct
* removed unused methods_list and classes_list fields from RzBinZimgObj struct
2022-09-11 13:04:53 +08:00

184 lines
4.5 KiB
C

// SPDX-FileCopyrightText: 2018-2021 deroad <wargio@libero.it>
// SPDX-License-Identifier: LGPL-3.0-only
/** \file parse_common.c
* This file contains a common code that can be used to convert any asm code
* into a pseudo code, via a generic grammar.
*
* The grammar is quite simple; Let's take a simple example
*
* Let's take the following assembly
* ; intel x86 asm
* ; rax = rax + 10
* add rax, 10
*
* The associated grammar will be "1 += 2" the number 1 will be changed to "rax" and 2 with "10"
*
* another example:
*
* ; mips asm
* ; t0 = 4097 << 16
* lui t0, 4097
*
* The associated grammar will be "1 = 2 << #16" to notice the `#` symbol.
* The `#` symbol is used to ignore any set of chars after this till next whitespace/end of the line
*
* the developer has to provide a tokenize method to split the assembly in various token strings
* and
*/
typedef struct {
const char *mnemonic;
size_t mnemonic_length;
const char *grammar;
} RzPseudoGrammar;
typedef struct {
const char *expected;
const char *pseudo;
} RzPseudoDirect;
typedef struct {
const char *expected;
const char *replace;
int flag; // 0 for first match, 1 for all matches
} RzPseudoReplace;
typedef struct {
const RzPseudoDirect *direct;
size_t direct_length;
const RzPseudoReplace *replace;
size_t replace_length;
const RzPseudoGrammar *lexicon;
size_t lexicon_length;
int max_args;
RzList /*<char *>*/ *(*tokenize)(const char *assembly, size_t length);
} RzPseudoConfig;
#define RZ_PSEUDO_DEFINE_GRAMMAR(x, y) \
{ .mnemonic = x, .mnemonic_length = sizeof(x) - 1, .grammar = y }
#define RZ_PSEUDO_DEFINE_DIRECT(x, y) \
{ .expected = x, .pseudo = y }
#define RZ_PSEUDO_DEFINE_REPLACE(x, y, f) \
{ .expected = x, .replace = y, .flag = f }
#define RZ_PSEUDO_DEFINE_CONFIG(d, l, r, m, t) \
{ \
.direct = d, \
.direct_length = RZ_ARRAY_SIZE(d), \
.replace = r, \
.replace_length = RZ_ARRAY_SIZE(r), \
.lexicon = l, \
.lexicon_length = RZ_ARRAY_SIZE(l), \
.max_args = m, \
.tokenize = t, \
}
#define RZ_PSEUDO_DEFINE_CONFIG_NO_DIRECT(l, r, m, t) \
{ \
.direct = NULL, \
.direct_length = 0, \
.replace = r, \
.replace_length = RZ_ARRAY_SIZE(r), \
.lexicon = l, \
.lexicon_length = RZ_ARRAY_SIZE(l), \
.max_args = m, \
.tokenize = t, \
}
#define RZ_PSEUDO_DEFINE_CONFIG_ONLY_LEXICON(l, m, t) \
{ \
.direct = NULL, \
.direct_length = 0, \
.replace = NULL, \
.replace_length = 0, \
.lexicon = l, \
.lexicon_length = RZ_ARRAY_SIZE(l), \
.max_args = m, \
.tokenize = t, \
}
static bool rz_pseudo_convert(const RzPseudoConfig *config, const char *assembly, RzStrBuf *sb) {
rz_return_val_if_fail(config && config->tokenize && config->lexicon, false);
size_t i, p;
const char *tmp = NULL;
const RzPseudoGrammar *gr = NULL;
const RzPseudoReplace *rp = NULL;
if (!strcmp(assembly, "invalid")) {
return true;
} else if (!strncmp(assembly, "trunc", 5)) {
return true;
} else if (!strcmp(assembly, "nop")) {
return true;
}
size_t length = strlen(assembly);
for (i = 0; i < config->direct_length; ++i) {
tmp = config->direct[i].expected;
if (!strcmp(assembly, tmp)) {
rz_strbuf_set(sb, config->direct[i].pseudo);
return true;
}
}
size_t mnemonic_length = length;
if ((tmp = strchr(assembly, ' '))) {
mnemonic_length = tmp - assembly;
}
for (i = 0; i < config->lexicon_length; ++i) {
gr = &config->lexicon[i];
if (gr->mnemonic_length == mnemonic_length && !strncmp(gr->mnemonic, assembly, mnemonic_length)) {
break;
}
gr = NULL;
}
if (!gr) {
rz_strbuf_setf(sb, "asm(\"%s\")", assembly);
return true;
}
RzList *tokens = config->tokenize(assembly, length);
if (!tokens) {
rz_strbuf_setf(sb, "asm(\"%s\")", assembly);
return true;
}
for (i = 0, p = 0; gr->grammar[p]; ++p) {
int index = gr->grammar[p] - '0';
if (index > 0 && index < config->max_args) {
tmp = (const char *)rz_list_get_n(tokens, index);
if (!tmp) {
tmp = "?";
}
rz_strbuf_append_n(sb, gr->grammar + i, p - i);
i = p + 1;
rz_strbuf_append(sb, tmp);
} else if (gr->grammar[p] == '#') {
rz_strbuf_append_n(sb, gr->grammar + i, p - i);
i = p + 1;
p++;
while (gr->grammar[p] && !IS_WHITESPACE(gr->grammar[p])) {
++p;
}
}
}
if (i < p) {
rz_strbuf_append_n(sb, gr->grammar + i, p - i);
}
char *result = rz_strbuf_drain_nofree(sb);
for (int i = 0; i < config->replace_length; ++i) {
rp = &config->replace[i];
result = rz_str_replace(result, rp->expected, rp->replace, rp->flag);
}
rz_strbuf_set(sb, result);
free(result);
rz_list_free(tokens);
return true;
}