2014-04-29 11:21:04 +08:00
|
|
|
/* Capstone Disassembly Engine */
|
2015-03-04 17:45:23 +08:00
|
|
|
/* By Nguyen Anh Quynh <aquynh@gmail.com>, 2013-2015 */
|
2013-11-27 12:11:31 +08:00
|
|
|
|
2014-01-02 13:15:07 +08:00
|
|
|
#ifndef CS_UTILS_H
|
|
|
|
#define CS_UTILS_H
|
2013-11-27 12:11:31 +08:00
|
|
|
|
2017-03-08 19:40:22 +08:00
|
|
|
#if defined(CAPSTONE_HAS_OSXKERNEL)
|
|
|
|
#include <libkern/libkern.h>
|
|
|
|
#else
|
2014-06-17 14:58:39 +08:00
|
|
|
#include <stddef.h>
|
2015-02-24 11:55:55 +08:00
|
|
|
#include "include/capstone/capstone.h"
|
2017-03-08 19:40:22 +08:00
|
|
|
#endif
|
2014-01-05 11:35:47 +08:00
|
|
|
#include "cs_priv.h"
|
2013-11-27 12:11:31 +08:00
|
|
|
|
2013-12-11 17:35:27 +08:00
|
|
|
// threshold number, so above this number will be printed in hexa mode
|
|
|
|
#define HEX_THRESHOLD 9
|
|
|
|
|
2013-11-27 12:11:31 +08:00
|
|
|
// map instruction to its characteristics
|
|
|
|
typedef struct insn_map {
|
2014-01-01 00:02:42 +08:00
|
|
|
unsigned short id;
|
|
|
|
unsigned short mapid;
|
2014-02-22 23:26:27 +08:00
|
|
|
#ifndef CAPSTONE_DIET
|
2015-03-25 15:02:13 +08:00
|
|
|
uint16_t regs_use[12]; // list of implicit registers used by this instruction
|
|
|
|
uint16_t regs_mod[20]; // list of implicit registers modified by this instruction
|
2013-12-20 17:35:15 +08:00
|
|
|
unsigned char groups[8]; // list of group this instruction belong to
|
2013-11-27 12:11:31 +08:00
|
|
|
bool branch; // branch instruction?
|
|
|
|
bool indirect_branch; // indirect branch instruction?
|
2014-02-22 23:26:27 +08:00
|
|
|
#endif
|
2013-11-27 12:11:31 +08:00
|
|
|
} insn_map;
|
|
|
|
|
2014-01-03 17:08:58 +08:00
|
|
|
// look for @id in @m, given its size in @max. first time call will update @cache.
|
|
|
|
// return 0 if not found
|
|
|
|
unsigned short insn_find(insn_map *m, unsigned int max, unsigned int id, unsigned short **cache);
|
2013-11-27 12:11:31 +08:00
|
|
|
|
|
|
|
// map id to string
|
|
|
|
typedef struct name_map {
|
|
|
|
unsigned int id;
|
|
|
|
char *name;
|
|
|
|
} name_map;
|
|
|
|
|
|
|
|
// map a name to its ID
|
|
|
|
// return 0 if not found
|
2013-12-12 05:14:42 +08:00
|
|
|
int name2id(name_map* map, int max, const char *name);
|
2013-11-27 12:11:31 +08:00
|
|
|
|
2015-04-27 12:13:34 +08:00
|
|
|
// map ID to a name
|
|
|
|
// return NULL if not found
|
|
|
|
char *id2name(name_map* map, int max, const unsigned int id);
|
|
|
|
|
2013-12-03 11:10:26 +08:00
|
|
|
// count number of positive members in a list.
|
|
|
|
// NOTE: list must be guaranteed to end in 0
|
2015-03-25 15:02:13 +08:00
|
|
|
unsigned int count_positive(uint16_t *list);
|
|
|
|
unsigned int count_positive8(unsigned char *list);
|
2013-12-03 11:10:26 +08:00
|
|
|
|
2013-11-27 12:11:31 +08:00
|
|
|
#define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
|
|
|
|
|
2014-01-15 18:27:01 +08:00
|
|
|
char *cs_strdup(const char *str);
|
|
|
|
|
2014-04-27 13:38:04 +08:00
|
|
|
#define MIN(x, y) ((x) < (y) ? (x) : (y))
|
|
|
|
|
2014-08-26 15:57:04 +08:00
|
|
|
// we need this since Windows doesnt have snprintf()
|
|
|
|
int cs_snprintf(char *buffer, size_t size, const char *fmt, ...);
|
|
|
|
|
2015-03-25 15:02:13 +08:00
|
|
|
#define CS_AC_IGNORE (1 << 7)
|
|
|
|
|
2015-04-02 15:18:33 +08:00
|
|
|
// check if an id is existent in an array
|
|
|
|
bool arr_exist8(unsigned char *arr, unsigned char max, unsigned int id);
|
|
|
|
|
|
|
|
bool arr_exist(uint16_t *arr, unsigned char max, unsigned int id);
|
|
|
|
|
2013-11-27 12:11:31 +08:00
|
|
|
#endif
|
|
|
|
|