xref: /aosp_15_r20/external/capstone/utils.h (revision 9a0e4156d50a75a99ec4f1653a0e9602a5d45c18)
1*9a0e4156SSadaf Ebrahimi /* Capstone Disassembly Engine */
2*9a0e4156SSadaf Ebrahimi /* By Nguyen Anh Quynh <[email protected]>, 2013-2015 */
3*9a0e4156SSadaf Ebrahimi 
4*9a0e4156SSadaf Ebrahimi #ifndef CS_UTILS_H
5*9a0e4156SSadaf Ebrahimi #define CS_UTILS_H
6*9a0e4156SSadaf Ebrahimi 
7*9a0e4156SSadaf Ebrahimi #if defined(CAPSTONE_HAS_OSXKERNEL)
8*9a0e4156SSadaf Ebrahimi #include <libkern/libkern.h>
9*9a0e4156SSadaf Ebrahimi #else
10*9a0e4156SSadaf Ebrahimi #include <stddef.h>
11*9a0e4156SSadaf Ebrahimi #include "include/capstone/capstone.h"
12*9a0e4156SSadaf Ebrahimi #endif
13*9a0e4156SSadaf Ebrahimi #include "cs_priv.h"
14*9a0e4156SSadaf Ebrahimi 
15*9a0e4156SSadaf Ebrahimi // threshold number, so above this number will be printed in hexa mode
16*9a0e4156SSadaf Ebrahimi #define HEX_THRESHOLD 9
17*9a0e4156SSadaf Ebrahimi 
18*9a0e4156SSadaf Ebrahimi // map instruction to its characteristics
19*9a0e4156SSadaf Ebrahimi typedef struct insn_map {
20*9a0e4156SSadaf Ebrahimi 	unsigned short id;
21*9a0e4156SSadaf Ebrahimi 	unsigned short mapid;
22*9a0e4156SSadaf Ebrahimi #ifndef CAPSTONE_DIET
23*9a0e4156SSadaf Ebrahimi 	uint16_t regs_use[12]; // list of implicit registers used by this instruction
24*9a0e4156SSadaf Ebrahimi 	uint16_t regs_mod[20]; // list of implicit registers modified by this instruction
25*9a0e4156SSadaf Ebrahimi 	unsigned char groups[8]; // list of group this instruction belong to
26*9a0e4156SSadaf Ebrahimi 	bool branch;	// branch instruction?
27*9a0e4156SSadaf Ebrahimi 	bool indirect_branch;	// indirect branch instruction?
28*9a0e4156SSadaf Ebrahimi #endif
29*9a0e4156SSadaf Ebrahimi } insn_map;
30*9a0e4156SSadaf Ebrahimi 
31*9a0e4156SSadaf Ebrahimi // look for @id in @m, given its size in @max. first time call will update @cache.
32*9a0e4156SSadaf Ebrahimi // return 0 if not found
33*9a0e4156SSadaf Ebrahimi unsigned short insn_find(const insn_map *m, unsigned int max, unsigned int id, unsigned short **cache);
34*9a0e4156SSadaf Ebrahimi 
35*9a0e4156SSadaf Ebrahimi // map id to string
36*9a0e4156SSadaf Ebrahimi typedef struct name_map {
37*9a0e4156SSadaf Ebrahimi 	unsigned int id;
38*9a0e4156SSadaf Ebrahimi 	const char *name;
39*9a0e4156SSadaf Ebrahimi } name_map;
40*9a0e4156SSadaf Ebrahimi 
41*9a0e4156SSadaf Ebrahimi // map a name to its ID
42*9a0e4156SSadaf Ebrahimi // return 0 if not found
43*9a0e4156SSadaf Ebrahimi int name2id(const name_map* map, int max, const char *name);
44*9a0e4156SSadaf Ebrahimi 
45*9a0e4156SSadaf Ebrahimi // map ID to a name
46*9a0e4156SSadaf Ebrahimi // return NULL if not found
47*9a0e4156SSadaf Ebrahimi const char *id2name(const name_map* map, int max, const unsigned int id);
48*9a0e4156SSadaf Ebrahimi 
49*9a0e4156SSadaf Ebrahimi // count number of positive members in a list.
50*9a0e4156SSadaf Ebrahimi // NOTE: list must be guaranteed to end in 0
51*9a0e4156SSadaf Ebrahimi unsigned int count_positive(const uint16_t *list);
52*9a0e4156SSadaf Ebrahimi unsigned int count_positive8(const unsigned char *list);
53*9a0e4156SSadaf Ebrahimi 
54*9a0e4156SSadaf Ebrahimi #define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
55*9a0e4156SSadaf Ebrahimi #define MATRIX_SIZE(a) (sizeof(a[0])/sizeof(a[0][0]))
56*9a0e4156SSadaf Ebrahimi 
57*9a0e4156SSadaf Ebrahimi char *cs_strdup(const char *str);
58*9a0e4156SSadaf Ebrahimi 
59*9a0e4156SSadaf Ebrahimi #define MIN(x, y) ((x) < (y) ? (x) : (y))
60*9a0e4156SSadaf Ebrahimi 
61*9a0e4156SSadaf Ebrahimi // we need this since Windows doesn't have snprintf()
62*9a0e4156SSadaf Ebrahimi int cs_snprintf(char *buffer, size_t size, const char *fmt, ...);
63*9a0e4156SSadaf Ebrahimi 
64*9a0e4156SSadaf Ebrahimi #define CS_AC_IGNORE (1 << 7)
65*9a0e4156SSadaf Ebrahimi 
66*9a0e4156SSadaf Ebrahimi // check if an id is existent in an array
67*9a0e4156SSadaf Ebrahimi bool arr_exist8(unsigned char *arr, unsigned char max, unsigned int id);
68*9a0e4156SSadaf Ebrahimi 
69*9a0e4156SSadaf Ebrahimi bool arr_exist(uint16_t *arr, unsigned char max, unsigned int id);
70*9a0e4156SSadaf Ebrahimi 
71*9a0e4156SSadaf Ebrahimi #endif
72*9a0e4156SSadaf Ebrahimi 
73