2002-10-22 14:53:18 +00:00
|
|
|
/*
|
|
|
|
opcodes.c
|
2001-06-04 02:41:45 +00:00
|
|
|
|
2002-10-22 14:53:18 +00:00
|
|
|
opcode searching
|
2001-06-04 02:41:45 +00:00
|
|
|
|
2002-10-22 14:53:18 +00:00
|
|
|
Copyright (C) 2002 Bill Currie <bill@taniwha.org>
|
2001-06-04 02:41:45 +00:00
|
|
|
|
2002-10-22 14:53:18 +00:00
|
|
|
Author: Bill Currie <bill@taniwha.org>
|
|
|
|
Date: 2002/06/01
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU General Public License
|
|
|
|
as published by the Free Software Foundation; either version 2
|
|
|
|
of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
|
|
|
|
See the GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to:
|
|
|
|
|
|
|
|
Free Software Foundation, Inc.
|
|
|
|
59 Temple Place - Suite 330
|
|
|
|
Boston, MA 02111-1307, USA
|
2001-06-04 02:41:45 +00:00
|
|
|
|
|
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include "config.h"
|
|
|
|
#endif
|
2003-01-15 15:31:36 +00:00
|
|
|
|
2002-06-01 04:41:25 +00:00
|
|
|
#ifdef HAVE_STRING_H
|
|
|
|
# include <string.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_STRINGS_H
|
|
|
|
# include <strings.h>
|
|
|
|
#endif
|
|
|
|
#include <stdlib.h>
|
2001-06-04 02:41:45 +00:00
|
|
|
|
|
|
|
#include <QF/hash.h>
|
|
|
|
|
2020-06-21 14:15:17 +00:00
|
|
|
#include "tools/qfcc/include/opcodes.h"
|
|
|
|
#include "tools/qfcc/include/options.h"
|
|
|
|
#include "tools/qfcc/include/qfcc.h"
|
|
|
|
#include "tools/qfcc/include/statements.h"
|
|
|
|
#include "tools/qfcc/include/type.h"
|
2001-06-04 02:41:45 +00:00
|
|
|
|
2022-01-19 09:08:58 +00:00
|
|
|
typedef struct v6p_uint_opcode_s {
|
|
|
|
pr_opcode_v6p_e op;
|
|
|
|
v6p_opcode_t opcode;
|
|
|
|
} v6p_uint_opcode_t;
|
|
|
|
|
|
|
|
static v6p_uint_opcode_t v6p_uint_opcodes[] = {
|
|
|
|
{OP_LOAD_I_v6p, {".", "load.i", ev_entity, ev_field, ev_uint }},
|
|
|
|
{OP_LOADBI_I_v6p, {".", "loadbi.i", ev_ptr, ev_short, ev_uint }},
|
|
|
|
{OP_ADDRESS_I_v6p, {"&", "address.i", ev_uint, ev_invalid, ev_ptr }},
|
|
|
|
{OP_STORE_I_v6p, {"=", "store.i", ev_uint, ev_uint, ev_invalid }},
|
|
|
|
{OP_STOREP_I_v6p, {".=", "storep.i", ev_uint, ev_ptr, ev_invalid }},
|
|
|
|
{OP_STOREB_I_v6p, {".=", "storeb.i", ev_uint, ev_ptr, ev_int }},
|
|
|
|
{OP_STOREBI_I_v6p, {".=", "storebi.i", ev_uint, ev_ptr, ev_short }},
|
|
|
|
{OP_IF_v6p, {"<IF>", "if", ev_uint, ev_short, ev_invalid }},
|
|
|
|
{OP_IFNOT_v6p, {"<IFNOT>", "ifnot", ev_uint, ev_short, ev_invalid }},
|
|
|
|
{OP_ADD_I_v6p, {"+", "add.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_SUB_I_v6p, {"-", "sub.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_MUL_I_v6p, {"*", "mul.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_DIV_I_v6p, {"/", "div.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_BITAND_I_v6p, {"&", "bitand.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_BITOR_I_v6p, {"|", "bitor.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_BITXOR_I_v6p, {"^", "bitxor.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_REM_I_v6p, {"%", "rem.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_MOD_I_v6p, {"%%", "mod.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_SHL_I_v6p, {"<<", "shl.i", ev_uint, ev_uint, ev_uint }},
|
|
|
|
{OP_BITNOT_I_v6p, {"<<", "bitnot.i", ev_uint, ev_invalid, ev_int }},
|
|
|
|
{}
|
|
|
|
};
|
|
|
|
|
2022-01-07 10:56:15 +00:00
|
|
|
static hashtab_t *v6p_opcode_type_table;
|
|
|
|
static hashtab_t *v6p_opcode_void_table;
|
2022-01-19 09:08:58 +00:00
|
|
|
static hashtab_t *v6p_opcode_uint_table;
|
2022-01-07 10:56:15 +00:00
|
|
|
static v6p_opcode_t *v6p_opcode_map;
|
|
|
|
|
|
|
|
static hashtab_t *rua_opcode_type_table;
|
|
|
|
static hashtab_t *rua_opcode_void_table;
|
2001-06-04 02:41:45 +00:00
|
|
|
|
2011-01-26 23:58:50 +00:00
|
|
|
#define ROTL(x,n) ((((unsigned)(x))<<(n))|((unsigned)(x))>>(32-n))
|
2001-08-16 02:51:53 +00:00
|
|
|
|
2007-04-04 11:22:48 +00:00
|
|
|
static uintptr_t
|
2022-01-07 10:56:15 +00:00
|
|
|
v6p_get_hash (const void *_op, void *_tab)
|
2001-06-04 02:41:45 +00:00
|
|
|
{
|
2022-01-02 12:06:14 +00:00
|
|
|
v6p_opcode_t *op = (v6p_opcode_t *) _op;
|
2007-04-04 11:22:48 +00:00
|
|
|
uintptr_t hash;
|
2001-08-16 02:51:53 +00:00
|
|
|
|
2011-01-25 06:46:48 +00:00
|
|
|
hash = ROTL (~op->type_a, 8) + ROTL (~op->type_b, 16)
|
|
|
|
+ ROTL (~op->type_c, 24);
|
2002-11-20 21:44:04 +00:00
|
|
|
return hash + Hash_String (op->name);
|
2001-08-16 02:51:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2022-01-07 10:56:15 +00:00
|
|
|
v6p_compare (const void *_opa, const void *_opb, void *unused)
|
2001-08-16 02:51:53 +00:00
|
|
|
{
|
2022-01-02 12:06:14 +00:00
|
|
|
v6p_opcode_t *opa = (v6p_opcode_t *) _opa;
|
|
|
|
v6p_opcode_t *opb = (v6p_opcode_t *) _opb;
|
2001-12-06 19:49:40 +00:00
|
|
|
int cmp;
|
2001-06-04 02:41:45 +00:00
|
|
|
|
2011-01-25 06:46:48 +00:00
|
|
|
cmp = (opa->type_a == opb->type_a)
|
|
|
|
&& (opa->type_b == opb->type_b)
|
|
|
|
&& (opa->type_c == opb->type_c);
|
2001-08-16 02:51:53 +00:00
|
|
|
return cmp && !strcmp (opa->name, opb->name);
|
2001-06-04 02:41:45 +00:00
|
|
|
}
|
|
|
|
|
2011-01-27 05:47:33 +00:00
|
|
|
static const char *
|
2022-01-07 10:56:15 +00:00
|
|
|
v6p_get_key (const void *op, void *unused)
|
2011-01-27 05:47:33 +00:00
|
|
|
{
|
2022-01-02 12:06:14 +00:00
|
|
|
return ((v6p_opcode_t *) op)->name;
|
2011-01-27 05:47:33 +00:00
|
|
|
}
|
|
|
|
|
2022-01-19 09:08:58 +00:00
|
|
|
static uintptr_t
|
|
|
|
v6p_uint_get_hash (const void *_op, void *_tab)
|
|
|
|
{
|
|
|
|
__auto_type uint_op = (v6p_uint_opcode_t *) _op;
|
|
|
|
return v6p_get_hash (&uint_op->opcode, _tab);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
v6p_uint_compare (const void *_opa, const void *_opb, void *data)
|
|
|
|
{
|
|
|
|
__auto_type uint_opa = (v6p_uint_opcode_t *) _opa;
|
|
|
|
__auto_type uint_opb = (v6p_uint_opcode_t *) _opb;
|
|
|
|
return v6p_compare (&uint_opa->opcode, &uint_opb->opcode, data);
|
|
|
|
}
|
|
|
|
|
2022-01-07 10:56:15 +00:00
|
|
|
static uintptr_t
|
|
|
|
rua_get_hash (const void *_op, void *_tab)
|
|
|
|
{
|
|
|
|
opcode_t *op = (opcode_t *) _op;
|
|
|
|
uintptr_t hash;
|
|
|
|
|
|
|
|
hash = ROTL (~op->types[0], 8) + ROTL (~op->types[1], 16)
|
|
|
|
+ ROTL (~op->types[2], 24);
|
|
|
|
return hash + Hash_String (op->opname);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
rua_compare (const void *_opa, const void *_opb, void *unused)
|
|
|
|
{
|
|
|
|
opcode_t *opa = (opcode_t *) _opa;
|
|
|
|
opcode_t *opb = (opcode_t *) _opb;
|
|
|
|
int cmp;
|
|
|
|
|
|
|
|
cmp = (opa->types[0] == opb->types[0])
|
|
|
|
&& (opa->types[1] == opb->types[1])
|
|
|
|
&& (opa->types[2] == opb->types[2]);
|
|
|
|
return cmp && !strcmp (opa->opname, opb->opname);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
rua_get_key (const void *op, void *unused)
|
|
|
|
{
|
|
|
|
return ((opcode_t *) op)->opname;
|
|
|
|
}
|
|
|
|
|
2011-01-27 05:47:33 +00:00
|
|
|
static int
|
|
|
|
check_operand_type (etype_t ot1, etype_t ot2)
|
|
|
|
{
|
|
|
|
if ((ot1 == ev_void && ot2 != ev_invalid)
|
|
|
|
|| ot1 == ot2)
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2022-01-07 10:05:26 +00:00
|
|
|
pr_ushort_t
|
|
|
|
opcode_get (instruction_t *op)
|
|
|
|
{
|
2022-01-07 10:56:15 +00:00
|
|
|
if (options.code.progsversion < PROG_VERSION) {
|
|
|
|
return (v6p_opcode_t *) op - v6p_opcode_map;
|
|
|
|
} else {
|
|
|
|
return (opcode_t *) op - pr_opcodes;
|
|
|
|
}
|
2022-01-07 10:05:26 +00:00
|
|
|
}
|
|
|
|
|
2022-01-07 10:56:15 +00:00
|
|
|
static v6p_opcode_t *
|
|
|
|
v6p_opcode_find (const char *name, operand_t *op_a, operand_t *op_b,
|
|
|
|
operand_t *op_c)
|
2001-06-04 02:41:45 +00:00
|
|
|
{
|
2022-01-19 09:08:58 +00:00
|
|
|
v6p_uint_opcode_t search_op = {
|
|
|
|
.opcode = {
|
|
|
|
.name = name,
|
|
|
|
.type_a = op_a ? low_level_type (op_a->type) : ev_invalid,
|
|
|
|
.type_b = op_b ? low_level_type (op_b->type) : ev_invalid,
|
|
|
|
.type_c = op_c ? low_level_type (op_c->type) : ev_invalid,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
v6p_uint_opcode_t *uint_op;
|
2022-01-02 12:06:14 +00:00
|
|
|
v6p_opcode_t *op;
|
|
|
|
v6p_opcode_t *sop;
|
2011-01-27 05:47:33 +00:00
|
|
|
void **op_list;
|
|
|
|
int i;
|
|
|
|
|
2022-01-19 09:08:58 +00:00
|
|
|
uint_op = Hash_FindElement (v6p_opcode_uint_table, &search_op);
|
|
|
|
if (uint_op) {
|
|
|
|
return v6p_opcode_map + uint_op->op;
|
|
|
|
}
|
|
|
|
op = Hash_FindElement (v6p_opcode_type_table, &search_op.opcode);
|
2011-01-27 05:47:33 +00:00
|
|
|
if (op)
|
2022-01-07 10:56:15 +00:00
|
|
|
return op;
|
|
|
|
op_list = Hash_FindList (v6p_opcode_void_table, name);
|
2011-01-27 05:47:33 +00:00
|
|
|
if (!op_list)
|
2022-01-07 10:56:15 +00:00
|
|
|
return op;
|
2011-01-27 05:47:33 +00:00
|
|
|
for (i = 0; !op && op_list[i]; i++) {
|
|
|
|
sop = op_list[i];
|
2022-01-19 09:08:58 +00:00
|
|
|
if (check_operand_type (sop->type_a, search_op.opcode.type_a)
|
|
|
|
&& check_operand_type (sop->type_b, search_op.opcode.type_b)
|
|
|
|
&& check_operand_type (sop->type_c, search_op.opcode.type_c))
|
2011-01-27 05:47:33 +00:00
|
|
|
op = sop;
|
|
|
|
}
|
|
|
|
free (op_list);
|
2022-01-07 10:56:15 +00:00
|
|
|
return op;
|
2001-06-04 02:41:45 +00:00
|
|
|
}
|
|
|
|
|
2022-01-07 10:56:15 +00:00
|
|
|
static opcode_t *
|
|
|
|
rua_opcode_find (const char *name, operand_t *op_a, operand_t *op_b,
|
|
|
|
operand_t *op_c)
|
|
|
|
{
|
|
|
|
opcode_t search_op = {};
|
|
|
|
opcode_t *op;
|
|
|
|
opcode_t *sop;
|
|
|
|
void **op_list;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
search_op.opname = name;
|
|
|
|
search_op.types[0] = op_a ? low_level_type (op_a->type) : ev_invalid;
|
|
|
|
search_op.types[1] = op_b ? low_level_type (op_b->type) : ev_invalid;
|
|
|
|
search_op.types[2] = op_c ? low_level_type (op_c->type) : ev_invalid;
|
|
|
|
op = Hash_FindElement (rua_opcode_type_table, &search_op);
|
|
|
|
if (op)
|
|
|
|
return op;
|
|
|
|
op_list = Hash_FindList (rua_opcode_void_table, name);
|
|
|
|
if (!op_list)
|
|
|
|
return op;
|
|
|
|
for (i = 0; !op && op_list[i]; i++) {
|
|
|
|
sop = op_list[i];
|
|
|
|
if (check_operand_type (sop->types[0], search_op.types[0])
|
|
|
|
&& check_operand_type (sop->types[1], search_op.types[1])
|
|
|
|
&& check_operand_type (sop->types[2], search_op.types[2]))
|
|
|
|
op = sop;
|
|
|
|
}
|
|
|
|
free (op_list);
|
|
|
|
return op;
|
|
|
|
}
|
|
|
|
|
|
|
|
instruction_t *
|
|
|
|
opcode_find (const char *name, operand_t *op_a, operand_t *op_b,
|
|
|
|
operand_t *op_c)
|
|
|
|
{
|
|
|
|
if (options.code.progsversion < PROG_VERSION) {
|
|
|
|
return (instruction_t *) v6p_opcode_find (name, op_a, op_b, op_c);
|
|
|
|
} else {
|
|
|
|
return (instruction_t *) rua_opcode_find (name, op_a, op_b, op_c);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
v6p_opcode_init (void)
|
2001-06-04 02:41:45 +00:00
|
|
|
{
|
2022-01-02 12:06:14 +00:00
|
|
|
const v6p_opcode_t *op;
|
|
|
|
v6p_opcode_t *mop;
|
2012-11-22 11:42:00 +00:00
|
|
|
|
2022-01-07 10:56:15 +00:00
|
|
|
if (v6p_opcode_type_table) {
|
|
|
|
Hash_FlushTable (v6p_opcode_void_table);
|
|
|
|
Hash_FlushTable (v6p_opcode_type_table);
|
2022-01-19 09:08:58 +00:00
|
|
|
Hash_FlushTable (v6p_opcode_uint_table);
|
2012-11-22 11:42:00 +00:00
|
|
|
} else {
|
2022-01-07 10:56:15 +00:00
|
|
|
v6p_opcode_type_table = Hash_NewTable (1021, 0, 0, 0, 0);
|
|
|
|
Hash_SetHashCompare (v6p_opcode_type_table, v6p_get_hash, v6p_compare);
|
|
|
|
v6p_opcode_void_table = Hash_NewTable (1021, v6p_get_key, 0, 0, 0);
|
2022-01-19 09:08:58 +00:00
|
|
|
v6p_opcode_uint_table = Hash_NewTable (1021, 0, 0, 0, 0);
|
|
|
|
Hash_SetHashCompare (v6p_opcode_uint_table,
|
|
|
|
v6p_uint_get_hash, v6p_uint_compare);
|
2012-11-22 11:42:00 +00:00
|
|
|
}
|
2021-12-31 10:16:02 +00:00
|
|
|
|
|
|
|
int num_opcodes = 0;
|
2022-01-02 12:06:14 +00:00
|
|
|
for (op = pr_v6p_opcodes; op->name; op++) {
|
2021-12-31 10:16:02 +00:00
|
|
|
num_opcodes++;
|
|
|
|
}
|
2022-01-07 10:56:15 +00:00
|
|
|
if (!v6p_opcode_map) {
|
|
|
|
v6p_opcode_map = calloc (num_opcodes, sizeof (v6p_opcode_t));
|
2021-12-31 10:16:02 +00:00
|
|
|
}
|
|
|
|
for (int i = 0; i < num_opcodes; i++) {
|
2022-01-02 12:06:14 +00:00
|
|
|
op = pr_v6p_opcodes + i;
|
2001-10-26 06:43:56 +00:00
|
|
|
if (op->min_version > options.code.progsversion)
|
2001-06-09 06:25:33 +00:00
|
|
|
continue;
|
2022-01-07 10:56:15 +00:00
|
|
|
mop = v6p_opcode_map + i;
|
2012-11-22 11:42:00 +00:00
|
|
|
*mop = *op;
|
2011-01-27 00:00:11 +00:00
|
|
|
if (options.code.progsversion == PROG_ID_VERSION) {
|
|
|
|
// v6 progs have no concept of integer, but the QF engine
|
|
|
|
// treats the operands of certain operands as integers
|
|
|
|
// irrespective the progs version, so convert the engine's
|
|
|
|
// view of the operands to the prog's view.
|
2022-01-18 04:21:06 +00:00
|
|
|
if (mop->type_a == ev_int)
|
2012-11-22 11:42:00 +00:00
|
|
|
mop->type_a = ev_float;
|
2022-01-18 04:21:06 +00:00
|
|
|
if (mop->type_b == ev_int)
|
2012-11-22 11:42:00 +00:00
|
|
|
mop->type_b = ev_float;
|
2022-01-18 04:21:06 +00:00
|
|
|
if (mop->type_c == ev_int)
|
2012-11-22 11:42:00 +00:00
|
|
|
mop->type_c = ev_float;
|
2011-01-27 00:00:11 +00:00
|
|
|
}
|
2022-01-07 10:56:15 +00:00
|
|
|
Hash_AddElement (v6p_opcode_type_table, mop);
|
2012-11-22 11:42:00 +00:00
|
|
|
if (mop->type_a == ev_void || mop->type_b == ev_void
|
|
|
|
|| mop->type_c == ev_void)
|
2022-01-07 10:56:15 +00:00
|
|
|
Hash_Add (v6p_opcode_void_table, mop);
|
|
|
|
}
|
2022-01-19 09:08:58 +00:00
|
|
|
if (options.code.progsversion != PROG_ID_VERSION) {
|
|
|
|
for (__auto_type uiop = &v6p_uint_opcodes[0]; uiop->op; uiop++) {
|
|
|
|
Hash_AddElement (v6p_opcode_uint_table, uiop);
|
|
|
|
}
|
|
|
|
}
|
2022-01-07 10:56:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
rua_opcode_init (void)
|
|
|
|
{
|
|
|
|
if (rua_opcode_type_table) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
rua_opcode_type_table = Hash_NewTable (1021, 0, 0, 0, 0);
|
|
|
|
Hash_SetHashCompare (rua_opcode_type_table, rua_get_hash, rua_compare);
|
|
|
|
rua_opcode_void_table = Hash_NewTable (1021, rua_get_key, 0, 0, 0);
|
|
|
|
|
|
|
|
int num_opcodes = sizeof (pr_opcodes) / sizeof (pr_opcodes[0]);
|
|
|
|
for (int i = 0; i < num_opcodes; i++) {
|
|
|
|
const opcode_t *op = pr_opcodes + i;
|
|
|
|
if (!op->opname) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
Hash_AddElement (rua_opcode_type_table, (opcode_t *) op);
|
|
|
|
if (op->types[0] == ev_void || op->types[1] == ev_void
|
|
|
|
|| op->types[2] == ev_void) {
|
|
|
|
Hash_Add (rua_opcode_void_table, (opcode_t *) op);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
opcode_init (void)
|
|
|
|
{
|
|
|
|
if (options.code.progsversion < PROG_VERSION) {
|
|
|
|
v6p_opcode_init ();
|
|
|
|
} else {
|
|
|
|
rua_opcode_init ();
|
2001-06-04 02:41:45 +00:00
|
|
|
}
|
|
|
|
}
|