Coverage Report

Created: 2023-09-25 06:24

/src/capstonev5/utils.c
Line
Count
Source (jump to first uncovered line)
1
/* Capstone Disassembly Engine */
2
/* By Nguyen Anh Quynh <aquynh@gmail.com>, 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
1.87M
{
18
1.87M
  unsigned int c;
19
20
2.46M
  for (c = 0; list[c] > 0; c++);
21
22
1.87M
  return c;
23
1.87M
}
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
939k
{
29
939k
  unsigned int c;
30
31
1.73M
  for (c = 0; list[c] > 0; c++);
32
33
939k
  return c;
34
939k
}
35
36
char *cs_strdup(const char *str)
37
42.2k
{
38
42.2k
  size_t len = strlen(str) + 1;
39
42.2k
  void *new = cs_mem_malloc(len);
40
41
42.2k
  if (new == NULL)
42
0
    return NULL;
43
44
42.2k
  return (char *)memmove(new, str, len);
45
42.2k
}
46
47
// we need this since Windows doesn't have snprintf()
48
int cs_snprintf(char *buffer, size_t size, const char *fmt, ...)
49
18.7k
{
50
18.7k
  int ret;
51
52
18.7k
  va_list ap;
53
18.7k
  va_start(ap, fmt);
54
18.7k
  ret = cs_vsnprintf(buffer, size, fmt, ap);
55
18.7k
  va_end(ap);
56
57
18.7k
  return ret;
58
18.7k
}
59
60
bool arr_exist8(unsigned char *arr, unsigned char max, unsigned int id)
61
0
{
62
0
  int i;
63
64
0
  for (i = 0; i < max; i++) {
65
0
    if (arr[i] == id)
66
0
      return true;
67
0
  }
68
69
0
  return false;
70
0
}
71
72
bool arr_exist(uint16_t *arr, unsigned char max, unsigned int id)
73
428k
{
74
428k
  int i;
75
76
460k
  for (i = 0; i < max; i++) {
77
74.3k
    if (arr[i] == id)
78
41.7k
      return true;
79
74.3k
  }
80
81
386k
  return false;
82
428k
}
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
13.7k
{
88
  // binary searching since the index is sorted in encoding order
89
13.7k
  size_t left, right, m;
90
91
13.7k
  right = size - 1;
92
93
13.7k
  if (encoding < index[0].encoding || encoding > index[right].encoding)
94
    // not found
95
2.04k
    return -1;
96
97
11.7k
  left = 0;
98
99
48.6k
  while(left <= right) {
100
45.3k
    m = (left + right) / 2;
101
45.3k
    if (encoding == index[m].encoding) {
102
8.41k
      return m;
103
8.41k
    }
104
105
36.9k
    if (encoding < index[m].encoding)
106
18.1k
      right = m - 1;
107
18.7k
    else
108
18.7k
      left = m + 1;
109
36.9k
  }
110
111
  // not found
112
3.28k
  return -1;
113
11.7k
}
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
0
{
118
0
  assert(MI && Bytes);
119
0
  uint32_t Insn;
120
0
  if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
121
0
    Insn = (Bytes[3] << 0) | (Bytes[2] << 8) | (Bytes[1] << 16) |
122
0
           ((uint32_t)Bytes[0] << 24);
123
0
  else
124
0
    Insn = ((uint32_t)Bytes[3] << 24) | (Bytes[2] << 16) |
125
0
           (Bytes[1] << 8) | (Bytes[0] << 0);
126
0
  return Insn;
127
0
}
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
0
{
132
0
  assert(MI && Bytes);
133
0
  uint16_t Insn;
134
0
  if (MODE_IS_BIG_ENDIAN(MI->csh->mode))
135
0
    Insn = (Bytes[0] << 8) | Bytes[1];
136
0
  else
137
0
    Insn = (Bytes[1] << 8) | Bytes[0];
138
139
0
  return Insn;
140
0
}