b102f1b8 Update Actions (#2593) 86293136 Fix LoongArch aliases and CS_OPT_SYNTAX_NO_DOLLAR support (#2594) 27da950c Clarify between machine used vs. Capstone module affected. (#2586) 186f7aa0 Fix linking issue on Windows. (#2587) e160cbc5 Fix complex atomic instructions handling (#2584) 9907b22d Update v6 to have Debian Packages (#2579) efbbc3bb cstest: use DOWNLOAD_EXTRACT_TIMESTAMP conditionally (#2581) be6be784 x86: update read/write registers for transfer instructions (#2578) 812e654c Update BPF arch (#2568) 2c4b05f6 Clean up the cstest documentation and build instructions. (#2580) 4dc14ba1 Fix 2572 (#2574) b25aa841 PPC regressions (#2575) 0a29bf80 Small arm64 compat header fixes (#2563) b42e0903 Make thumb, v8 and m-class positional cstool arguments. (#2557) 89aee400 Add arm64 and sysz compatibility layer to Python bindings (#2559) a4281337 Python bindings: Enable more archs + bump cibuildwheel action to the v2.22.0 (#2558) ef74d449 Arm regressions (#2556) 93a104c0 PPC LLVM 18 (#2540) e46838ed Merge branch 'v6' into next cf3600e7 Update Changelog Version to 6.0.0-Alpha2 (#2553) b295cf57 Prepare for update (#2552) fc59da4d fix xtensa DecodeMR23RegisterClass and add tests for MAC16 instru… (#2551) 7d01d7e7 Auto-Sync reproducability + ARM update (#2532) 6ad2608d Python package building rework (#2538) e3bc578d Move debian package generation to a dispatch only workflow (#2543) abbf32b4 fix coverity (#2546) 1ecfb5b0 xtensa: update to espressif/llvm-project (#2533) 379e2a41 Rename build arguments: (#2534) d7be5f9f Change CI to create Debian Package to Release (#2521) f6f96796 tricore: fixes #2474 (#2523) 09f35961 This time actually fix big endian issue. (#2530) 306d5716 Fix endianess issue during assignment. (#2528) 2cfca35e Add CC and VAS compatibility macros (#2525) 32519c01 Fix stringop-truncation warning some compilers raise. (#2522) 5026c2c4 Merge pull request #2507 from thestr4ng3r/no-varargs-aarch64 cecb5ede Fix #2509. (#2510) f97e2705 xtensa: Fix Branch Target (#2516) 1d13a12f AArch64: Replace vararg add_cs_detail by multiple concrete functions 8b618528 Update libcyaml dependency in cstest to 1.4.2 (#2508) ea081286 Tricore EA calculation (#2504) 7db9a080 Fix cstest build with Ninja (#2506) 76242699 Only trigger on released action. (#2497) 981d648b Add hard asserts to all SStream functions and memset MCInst. (#2501) d667a627 Update labeler with Xtensa and v6 files. (#2500) 52b54ee3 Fixing UB santizer, `LITBASE` and assert errors. (#2499) 97db712c Remove irrelevant changes. (#2496) 5bd05e34 Remove irrelevant changes. (#2495) 616488c7 Update changelog for V6.0.0-Alpha1 (#2493) (#2494) c5955b92 Update changelog for V6.0.0-Alpha1 (#2493) a424e709 Be ready for V6-Alpha1 (#2492) 235ba8e0 SystemZ fixes (#2488) 5dffa75b Fix LDR not assigning immediate as memory offset. (#2487) 21f7bc85 Xtensa Support (#2380) 29d87734 Several small fixups (#2489) a34901e9 Update sponsors and remove empty file. (#2485) 3120932d Fix Coverity CID 509730: overflow before widen (#2486) 1014864d Rename CS_OPT_NO_BRANCH_OFFSET and corresponding flag to better name. (#2482) 0c90fe13 Replace `assert` with `CS_ASSERT` in modules (#2478) 823bfd53 AArch64 issues (#2473) git-subtree-dir: external/capstone git-subtree-split: b102f1b89e0455c072a751d287ab64378c14205f
255 lines
6.5 KiB
C
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;
|
|
}
|