#ifndef CS_UTILS_H
#define CS_UTILS_H
#if defined(CAPSTONE_HAS_OSXKERNEL)
#include <libkern/libkern.h>
#else
#include <stddef.h>
#include "include/capstone/capstone.h"
#endif
#include "cs_priv.h"
#define HEX_THRESHOLD 9
typedef struct insn_map {
unsigned short id;
unsigned short mapid;
#ifndef CAPSTONE_DIET
uint16_t regs_use[12]; uint16_t regs_mod[20]; unsigned char groups[8]; bool branch; bool indirect_branch; #endif
} insn_map;
unsigned short insn_find(const insn_map *m, unsigned int max, unsigned int id, unsigned short **cache);
typedef struct name_map {
unsigned int id;
const char *name;
} name_map;
int name2id(const name_map* map, int max, const char *name);
const char *id2name(const name_map* map, int max, const unsigned int id);
unsigned int count_positive(const uint16_t *list);
unsigned int count_positive8(const unsigned char *list);
#define ARR_SIZE(a) (sizeof(a)/sizeof(a[0]))
#define MATRIX_SIZE(a) (sizeof(a[0])/sizeof(a[0][0]))
char *cs_strdup(const char *str);
#define MIN(x, y) ((x) < (y) ? (x) : (y))
int cs_snprintf(char *buffer, size_t size, const char *fmt, ...);
#define CS_AC_IGNORE (1 << 7)
bool arr_exist8(unsigned char *arr, unsigned char max, unsigned int id);
bool arr_exist(uint16_t *arr, unsigned char max, unsigned int id);
struct IndexType {
uint16_t encoding;
unsigned index;
};
unsigned int binsearch_IndexTypeEncoding(const struct IndexType *index, size_t size, uint16_t encoding);
#endif