Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
wine-mirror
GitHub Repository: wine-mirror/wine
Path: blob/master/libs/capstone/utils.c
4389 views
1
/* Capstone Disassembly Engine */
2
/* By Nguyen Anh Quynh <[email protected]>, 2013-2019 */
3
4
#if defined(CAPSTONE_HAS_OSXKERNEL)
5
#include <Availability.h>
6
#include <libkern/libkern.h>
7
#else
8
#include <stdlib.h>
9
#endif
10
#include <string.h>
11
12
#include "utils.h"
13
14
// count number of positive members in a list.
15
// NOTE: list must be guaranteed to end in 0
16
unsigned int count_positive(const uint16_t *list)
17
{
18
unsigned int c;
19
20
for (c = 0; list[c] > 0; c++);
21
22
return c;
23
}
24
25
// count number of positive members in a list.
26
// NOTE: list must be guaranteed to end in 0
27
unsigned int count_positive8(const unsigned char *list)
28
{
29
unsigned int c;
30
31
for (c = 0; list[c] > 0; c++);
32
33
return c;
34
}
35
36
char *cs_strdup(const char *str)
37
{
38
size_t len = strlen(str) + 1;
39
void *new = cs_mem_malloc(len);
40
41
if (new == NULL)
42
return NULL;
43
44
return (char *)memmove(new, str, len);
45
}
46
47
// we need this since Windows doesn't have snprintf()
48
int cs_snprintf(char *buffer, size_t size, const char *fmt, ...)
49
{
50
int ret;
51
52
va_list ap;
53
va_start(ap, fmt);
54
ret = cs_vsnprintf(buffer, size, fmt, ap);
55
va_end(ap);
56
57
return ret;
58
}
59
60
bool arr_exist8(unsigned char *arr, unsigned char max, unsigned int id)
61
{
62
int i;
63
64
for (i = 0; i < max; i++) {
65
if (arr[i] == id)
66
return true;
67
}
68
69
return false;
70
}
71
72
bool arr_exist(uint16_t *arr, unsigned char max, unsigned int id)
73
{
74
int i;
75
76
for (i = 0; i < max; i++) {
77
if (arr[i] == id)
78
return true;
79
}
80
81
return false;
82
}
83
84
// binary search for encoding in IndexType array
85
// return -1 if not found, or index if found
86
unsigned int binsearch_IndexTypeEncoding(const struct IndexType *index, size_t size, uint16_t encoding)
87
{
88
// binary searching since the index is sorted in encoding order
89
size_t left, right, m;
90
91
right = size - 1;
92
93
if (encoding < index[0].encoding || encoding > index[right].encoding)
94
// not found
95
return -1;
96
97
left = 0;
98
99
while(left <= right) {
100
m = (left + right) / 2;
101
if (encoding == index[m].encoding) {
102
return m;
103
}
104
105
if (encoding < index[m].encoding)
106
right = m - 1;
107
else
108
left = m + 1;
109
}
110
111
// not found
112
return -1;
113
}
114
115
/// Reads 4 bytes in the endian order specified in MI->cs->mode.
116
uint32_t readBytes32(MCInst *MI, const uint8_t *Bytes)
117
{
118
assert(MI && Bytes);
119
uint32_t Insn;
120
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
121
Insn = (Bytes[3] << 0) | (Bytes[2] << 8) | (Bytes[1] << 16) |
122
((uint32_t)Bytes[0] << 24);
123
else
124
Insn = ((uint32_t)Bytes[3] << 24) | (Bytes[2] << 16) |
125
(Bytes[1] << 8) | (Bytes[0] << 0);
126
return Insn;
127
}
128
129
/// Reads 2 bytes in the endian order specified in MI->cs->mode.
130
uint16_t readBytes16(MCInst *MI, const uint8_t *Bytes)
131
{
132
assert(MI && Bytes);
133
uint16_t Insn;
134
if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
135
Insn = (Bytes[0] << 8) | Bytes[1];
136
else
137
Insn = (Bytes[1] << 8) | Bytes[0];
138
139
return Insn;
140
}
141
142