Files
kaizen/external/capstone/utils.c
T
iris 00cc9309cb Squashed 'external/ircolib/' changes from ce3cd726c..de6e324bd
de6e324bd separate emu thread
10d3daf86 Roms List improvements
95d202f37 Let's make the rom list process on a separate thread so the emulator doesnt take ages to load.
fc306967f Wow the ROM Header was just completely busted. Game list view works now
bad1691ee fuck this shit
2b59e5f46 game list in progress
d26417b83 remappable inputs in progress
ac4af8106 input
e72abc240 update readme
430139dc9 Qt6 frontend
3080d4d45 Fix this small bug too
08cd13b85 Cop0 unused functions do not actually pose a threat (as per manual). They don't do anything, so shall we.
61bb4fb44 make idle loop detection a little more specific with where the load goes
b037de4c3 SAZDFsdff
12e81e73e need to figure out why n64-systemtest loops indefinitely at some address that appears to be valid (i think it's me not invalidating the cache properly)
204f0e13b idle skipping seems to work!
cb8bb634a sdkfjlasdf
58e5c89c1 Fix compilation issue on my machine (no idea)
24fb2898e attempting more serious idle skipping
214719577 Place rsp.Step inside cached interpreter. Gains about 3 more fps
bb97dcc23 mmmmm
920b77d38 wjkhasdfjhkasdf
430ccdab4 it's a start...
4f42a673a Cached interpreter plays Mario 64. Start looking into RSP as well
c9a030787 idle skipping works!
5fbda03ce new idea
366637aba Idle skipping... maybe?
609fa2fb0 Cache instructions implemented but broken lmao. Commented out for now
e140a6d12 - Stop using inheritance for CPU, instead use composition. - Introduce KAIZEN_JIT_ENABLED optional define instead of relying on __aarch64__ and the like. - More cache work
68e613057 prep cache impl
811b4d809 fix clang format
fda755f7d idk
d5024ebbf small MI refactor in preparation of (eventually) implementing the RDRAM interface properly
694b45341 Merge commit '206dcdedf195fb320913584180edb12c7731e396' as 'external/SDL'
206dcdedf Squashed 'external/SDL/' content from commit 4d17b99d0a
4d16e1cb4 need to update sdl
848b19920 Fix compilation error
db61b5299 Merge commit 'e94a94559f28e49678fbcf72199a5258137b0fe9' as 'external/imgui'
e94a94559 Squashed 'external/imgui/' content from commit 02e9b8cac
52edb3757 need to update imgui
c1a705e86 Emulate weird JALR behaviour
4b4c32f4b Fix exception for "unusable COP1" in 4 instructions i missed accidentally (again)
df5828142 Bug putting 0s in the log everywhere
f8b580048 Make isviewer a sink to file
8241e9735 Fix exception for "unusable COP1" in 4 instructions i missed accidentally
b29715f20 small changes
d9a620bc1 make use of my new small utility library
0d1aa938e Add 'external/ircolib/' from commit 'ce3cd726c8df8388d554abf8bb55d55020eb4450'
e64eb40b3 Fuck git

git-subtree-dir: external/ircolib
git-subtree-split: de6e324bde
2026-06-15 11:56:38 +02:00

255 lines
6.5 KiB
C

/* Capstone Disassembly Engine */
/* By Nguyen Anh Quynh <aquynh@gmail.com>, 2013-2019 */
#if defined(CAPSTONE_HAS_OSXKERNEL)
#include <Availability.h>
#include <libkern/libkern.h>
#else
#include <stdlib.h>
#endif
#include <string.h>
#include <ctype.h>
#include "utils.h"
// count number of positive members in a list.
// NOTE: list must be guaranteed to end in 0
unsigned int count_positive(const uint16_t *list)
{
unsigned int c;
for (c = 0; list[c] > 0; c++);
return c;
}
// count number of positive members in a list.
// NOTE: list must be guaranteed to end in 0
unsigned int count_positive8(const unsigned char *list)
{
unsigned int c;
for (c = 0; list[c] > 0; c++);
return c;
}
char *cs_strdup(const char *str)
{
size_t len = strlen(str) + 1;
void *new = cs_mem_malloc(len);
if (new == NULL)
return NULL;
return (char *)memmove(new, str, len);
}
// we need this since Windows doesn't have snprintf()
int cs_snprintf(char *buffer, size_t size, const char *fmt, ...)
{
int ret;
va_list ap;
va_start(ap, fmt);
ret = cs_vsnprintf(buffer, size, fmt, ap);
va_end(ap);
return ret;
}
bool arr_exist8(unsigned char *arr, unsigned char max, unsigned int id)
{
int i;
for (i = 0; i < max; i++) {
if (arr[i] == id)
return true;
}
return false;
}
bool arr_exist(uint16_t *arr, unsigned char max, unsigned int id)
{
int i;
for (i = 0; i < max; i++) {
if (arr[i] == id)
return true;
}
return false;
}
/// @brief Checks if the @id is in the @table. @table has @table_size elements.
/// @param table The table with the values to compare to.
/// @param table_size The number elements in the table.
/// @param id The identifier to search for in the table.
/// @return True if @id is part of the @table, false otherwise.
bool arr_exist_int(int *table, size_t table_size, int id)
{
int i;
for (i = 0; i < table_size; i++) {
if (table[i] == id)
return true;
}
return false;
}
/// Reads 8 bytes in the endian order specified in MI->cs->mode.
uint64_t readBytes64(MCInst *MI, const uint8_t *Bytes)
{
assert(MI && Bytes);
uint64_t Insn;
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
Insn = ((uint64_t)Bytes[7] << 0) | ((uint64_t)Bytes[6] << 8) |
((uint64_t)Bytes[5] << 16) | ((uint64_t)Bytes[4] << 24) |
((uint64_t)Bytes[3] << 32) | ((uint64_t)Bytes[2] << 40) |
((uint64_t)Bytes[1] << 48) | ((uint64_t)Bytes[0] << 56);
else
Insn = ((uint64_t)Bytes[7] << 56) | ((uint64_t)Bytes[6] << 48) |
((uint64_t)Bytes[5] << 40) | ((uint64_t)Bytes[4] << 32) |
((uint64_t)Bytes[3] << 24) | ((uint64_t)Bytes[2] << 16) |
((uint64_t)Bytes[1] << 8) | ((uint64_t)Bytes[0] << 0);
return Insn;
}
/// Reads 6 bytes in the endian order specified in MI->cs->mode.
uint64_t readBytes48(MCInst *MI, const uint8_t *Bytes)
{
assert(MI && Bytes);
uint64_t Insn;
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
Insn = ((uint64_t)Bytes[5] << 0) | ((uint64_t)Bytes[4] << 8) |
((uint64_t)Bytes[3] << 16) | ((uint64_t)Bytes[2] << 24) |
((uint64_t)Bytes[1] << 32) | ((uint64_t)Bytes[0] << 40);
else
Insn = ((uint64_t)Bytes[5] << 40) | ((uint64_t)Bytes[4] << 32) |
((uint64_t)Bytes[3] << 24) | ((uint64_t)Bytes[2] << 16) |
((uint64_t)Bytes[1] << 8) | ((uint64_t)Bytes[0] << 0);
return Insn;
}
/// Reads 4 bytes in the endian order specified in MI->cs->mode.
uint32_t readBytes32(MCInst *MI, const uint8_t *Bytes)
{
assert(MI && Bytes);
uint32_t Insn;
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
Insn = (Bytes[3] << 0) | (Bytes[2] << 8) | (Bytes[1] << 16) |
((uint32_t)Bytes[0] << 24);
else
Insn = ((uint32_t)Bytes[3] << 24) | (Bytes[2] << 16) |
(Bytes[1] << 8) | (Bytes[0] << 0);
return Insn;
}
/// Reads 3 bytes in the endian order specified in MI->cs->mode.
uint32_t readBytes24(MCInst *MI, const uint8_t *Bytes)
{
assert(MI && Bytes);
uint32_t Insn;
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
Insn = (Bytes[2]) | (Bytes[1] << 8) |
((uint32_t)Bytes[0] << 16);
else
Insn = (Bytes[2] << 16) | (Bytes[1] << 8) |
((uint32_t)Bytes[0]);
return Insn;
}
/// Reads 2 bytes in the endian order specified in MI->cs->mode.
uint16_t readBytes16(MCInst *MI, const uint8_t *Bytes)
{
assert(MI && Bytes);
uint16_t Insn;
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
Insn = (Bytes[0] << 8) | Bytes[1];
else
Insn = (Bytes[1] << 8) | Bytes[0];
return Insn;
}
/// @brief Appends the string @p src to the string @p str. @p src is put to lower case.
/// @param str The string to append to.
/// @param str_size The length of @p str
/// @param src The string to append.
/// Does nothing if any of the given strings is NULL.
void append_to_str_lower(char *str, size_t str_size, const char *src) {
if (!str || !src) {
return;
}
char *dest = strchr(str, '\0');
if (dest - str >= str_size) {
assert("str_size does not match actual string length." && 0);
return;
}
int i = dest - str;
for (int j = 0; (i < str_size) && (j < strlen(src)); ++i, ++j) {
str[i] = tolower(src[j]);
}
str[i] = '\0';
}
/// @brief Appends the string @p src to the string @p dest.
/// @p dest is can be a stack allocated buffer.
///
/// @param dest The string to append to.
/// @param dest_buf_size Size of buffer @p str.
/// @param src The string to append.
/// Does nothing if any of the given strings is NULL.
void str_append_no_realloc(char *dest, size_t dest_buf_size, const char *src) {
if (!dest || !src) {
return;
}
if (strlen(dest) + strlen(src) + 1 > dest_buf_size) {
printf("str_size does not match actual string length.\n");
return;
}
strncat(dest, src, dest_buf_size - strlen(dest));
}
/// Allocates memory of strlen(str_a) + strlen(str_b) + 1 chars
/// and copies all strings into it as str_a + str_b
/// str_a is passed to realloc and should not be used afterwards.
/// Returns the concatenated string.
/// Returns NULL in case of failure.
char *str_append(char *str_a, const char *str_b) {
if (!str_a || !str_b) {
return NULL;
}
size_t asize = strlen(str_a) + strlen(str_b) + 1;
str_a = realloc(str_a, asize);
strncat(str_a, str_b, asize - strlen(str_a));
return str_a;
}
/// Returns the given byte sequence @bytes as a string of the
/// form: 0xXX,0xXX...
/// Returns NULL in case of failure.
char *byte_seq_to_str(uint8_t *bytes, size_t len)
{
if (!bytes) {
return NULL;
}
if (len == 0) {
return NULL;
}
char single_byte[8] = { 0 };
char *s = calloc(sizeof(char), 32);
for (size_t i = 0; i < len; ++i) {
cs_snprintf(single_byte, sizeof(single_byte), "0x%02" PRIx8 "%s",
bytes[i], i == len - 1 ? "" : ", ");
s = str_append(s, single_byte);
if (!s) {
return NULL;
}
}
return s;
}