109 lines
2.8 KiB
Python
109 lines
2.8 KiB
Python
result = """
|
|
//
|
|
// Generated using code_generating_script.py
|
|
//
|
|
"""
|
|
|
|
sizes = ["64", "32", "16", "8"]
|
|
types = ["S64", "U64", "F64"]
|
|
print_sign = ["%lld", "%llu", "%f"]
|
|
operations = [
|
|
["+", "ADD"], ["-", "SUB"], ["/", "DIV"], ["*", "MUL"], ["%", "MOD"],
|
|
[">>", "SHR"], ["<<", "SHL"], ["&", "BITAND"], ["|", "BITOR"], ["^", "BITXOR"],
|
|
["~", "BITNOT"], ["==", "EQ"], ["!=", "NEQ"], [">", "GT"], ["<", "LT"], ["||", "OR"],
|
|
[">=", "GTE"], ["<=", "LTE"]
|
|
]
|
|
|
|
def should_skip(T, op):
|
|
if T == "F64":
|
|
if op != "DIV" and op != "SUB" and op != "ADD" and op != "MUL" and op != "EQ" and op != "NEQ"\
|
|
and op != "GT" and op != "LT" and op != "GTE" and op != "LTE":
|
|
return True
|
|
|
|
|
|
#
|
|
# Generate enum
|
|
#
|
|
if False:
|
|
enum_members = []
|
|
enum_members.append("BC_END_OF_INSTRUCTIONS")
|
|
enum_members.append("BC_POP_STACK")
|
|
enum_members.append("BC_PUSH_STACK")
|
|
enum_members.append("BC_LOAD_CONSTANT")
|
|
|
|
load_store = ["LOAD_FROM_MEMORY", "STORE_TO_MEMORY"]
|
|
for op in load_store:
|
|
for size in sizes:
|
|
enum_members.append(f"BC_{op}{size}")
|
|
|
|
for T in types:
|
|
for _, op in operations:
|
|
if should_skip(T, op):
|
|
continue
|
|
enum_members.append(f"BC_{op}_{T}")
|
|
result += "\n"
|
|
|
|
result += "enum Operation: U16{\n"
|
|
for i in enum_members:
|
|
result += f" {i},\n"
|
|
result += "};\n"
|
|
|
|
result += "const char *op_name[] = {\n"
|
|
for i in enum_members:
|
|
result += f" \"{i}\",\n"
|
|
result += "};\n"
|
|
|
|
#
|
|
# Generate switch cases
|
|
#
|
|
if True:
|
|
for sign, T in zip(print_sign, types):
|
|
t = T.lower()
|
|
|
|
# Generate arithmetic
|
|
for symbol, op_name in operations:
|
|
if should_skip(T, op_name):
|
|
continue
|
|
|
|
###################################
|
|
# Unary operator special case
|
|
if symbol == "~":
|
|
result += f"""
|
|
case BC_{op_name}_{T}:{{
|
|
{T} left = ({T})b->registers[instr->left].{t};
|
|
{T} result = {symbol}left;
|
|
{T} *dst = b->registers[instr->dst].pointer_{t};
|
|
*dst = result;
|
|
bc_log("{symbol} [{sign}] = [{sign}]", left, result);
|
|
}}break;
|
|
"""
|
|
continue
|
|
################################
|
|
|
|
################################
|
|
# Binary operation
|
|
result += f"""
|
|
case BC_{op_name}_{T}:{{
|
|
{T} left = b->registers[instr->left].{t};
|
|
{T} right = b->registers[instr->right].{t};
|
|
{T} result = left {symbol} right;
|
|
b->registers[instr->dst].{t} = result;
|
|
bc_log("r%u + r%u = r%u => [{sign}] {symbol} [{sign}] = [{sign}]", instr->left, instr->right, instr->dst, left, right, result);
|
|
}}break;
|
|
"""
|
|
################################
|
|
|
|
result += """
|
|
//
|
|
// **End** of generated using code_generating_script.py
|
|
//
|
|
"""
|
|
|
|
|
|
#
|
|
# Copy to **WINDOWS** clipboard
|
|
#
|
|
import subprocess
|
|
subprocess.run("clip", universal_newlines=True, input=result)
|
|
|