Nguyen Anh Quynh | 26ee41a | 2013-11-27 12:11:31 +0800 | [diff] [blame] | 1 | /* Capstone Disassembler Engine */ |
| 2 | /* By Nguyen Anh Quynh <aquynh@gmail.com>, 2013> */ |
| 3 | |
| 4 | #include <string.h> |
| 5 | |
| 6 | #include "utils.h" |
| 7 | |
Nguyen Anh Quynh | bed9091 | 2013-12-13 18:28:38 +0800 | [diff] [blame] | 8 | // return the position of a string in a list of strings |
| 9 | // or -1 if given string is not in the list |
| 10 | int str_in_list(char **list, char *s) |
Nguyen Anh Quynh | 26ee41a | 2013-11-27 12:11:31 +0800 | [diff] [blame] | 11 | { |
| 12 | char **l; |
| 13 | |
Nguyen Anh Quynh | bed9091 | 2013-12-13 18:28:38 +0800 | [diff] [blame] | 14 | int c = 0; |
| 15 | for(l = list; *l; c++, l++) { |
Nguyen Anh Quynh | 26ee41a | 2013-11-27 12:11:31 +0800 | [diff] [blame] | 16 | if (!strcasecmp(*l, s)) |
Nguyen Anh Quynh | bed9091 | 2013-12-13 18:28:38 +0800 | [diff] [blame] | 17 | return c; |
| 18 | } |
Nguyen Anh Quynh | 26ee41a | 2013-11-27 12:11:31 +0800 | [diff] [blame] | 19 | |
Nguyen Anh Quynh | bed9091 | 2013-12-13 18:28:38 +0800 | [diff] [blame] | 20 | return -1; |
Nguyen Anh Quynh | 26ee41a | 2013-11-27 12:11:31 +0800 | [diff] [blame] | 21 | } |
| 22 | |
| 23 | // binary searching |
| 24 | int insn_find(insn_map *m, unsigned int max, unsigned int id) |
| 25 | { |
| 26 | unsigned int i, begin, end; |
| 27 | |
| 28 | begin = 0; |
| 29 | end = max; |
| 30 | |
| 31 | while(begin <= end) { |
| 32 | i = (begin + end) / 2; |
| 33 | if (id == m[i].id) |
| 34 | return i; |
| 35 | else if (id < m[i].id) |
| 36 | end = i - 1; |
| 37 | else |
| 38 | begin = i + 1; |
| 39 | } |
| 40 | |
| 41 | // found nothing |
| 42 | return -1; |
| 43 | } |
| 44 | |
pancake | f0e4eed | 2013-12-11 22:14:42 +0100 | [diff] [blame] | 45 | int name2id(name_map* map, int max, const char *name) |
Nguyen Anh Quynh | 26ee41a | 2013-11-27 12:11:31 +0800 | [diff] [blame] | 46 | { |
| 47 | int i; |
| 48 | |
| 49 | for (i = 0; i < max; i++) { |
| 50 | if (!strcasecmp(map[i].name, name)) { |
| 51 | return map[i].id; |
| 52 | } |
| 53 | } |
| 54 | |
| 55 | // nothing match |
| 56 | return -1; |
| 57 | } |
| 58 | |
| 59 | unsigned int insn_reverse_id(insn_map *insns, unsigned int max, unsigned int id) |
| 60 | { |
| 61 | unsigned int i; |
| 62 | |
| 63 | for (i = 0; i < max; i++) { |
| 64 | if (id == insns[i].mapid) |
| 65 | return insns[i].id; |
| 66 | } |
| 67 | |
| 68 | // found nothing |
| 69 | return 0; |
| 70 | } |
| 71 | |
Nguyen Anh Quynh | f35e2ad | 2013-12-03 11:10:26 +0800 | [diff] [blame] | 72 | // count number of positive members in a list. |
| 73 | // NOTE: list must be guaranteed to end in 0 |
| 74 | unsigned int count_positive(unsigned int *list) |
| 75 | { |
| 76 | unsigned int c; |
| 77 | |
| 78 | for (c = 0; list[c] > 0; c++); |
| 79 | |
| 80 | return c; |
| 81 | } |