Magic-Mirror/capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/capstone.git synced 2024-11-27 23:40:25 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

use stdlib's qsort

Browse Source
This commit is contained in:
Jeffrey Crowell 2016-06-28 19:16:21 +00:00
parent d5bba1133b
commit bb436aeee9
1 changed files with 7 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
arch/X86/X86Mapping.c
View File

@ -4,6 +4,7 @@
#ifdef CAPSTONE_HAS_X86
#include <string.h>
#include <stdlib.h>
#include "X86Mapping.h"
#include "X86DisassemblerDecoder.h"
@ -2753,40 +2754,13 @@ static struct insn_reg2 insn_regs_intel2[] = {
struct insn_reg insn_regs_intel_sorted [ARR_SIZE(insn_regs_intel)];
static int partition_regs(struct insn_reg a[], int l, int r);
static void qsort_regs(struct insn_reg a[], int l, int r);
static void qsort_regs(struct insn_reg a[], int l, int r)
static void regs_cmp(const void *a, const void *b)
{
int j;
if (l < r) {
j = partition_regs(a, l, r);
qsort_regs(a, l, j-1);
qsort_regs(a, j+1, r);
}
uint16_t l = ((struct insn_reg *)a)->insn;
uint16_t r = ((struct insn_reg *)b)->insn;
return (l - r);
}
static int partition_regs(struct insn_reg a[], int l, int r) {
struct insn_reg pivot, t;
int i, j;
pivot = a[l];
i = l;
j = r+1;
while(1) {
do ++i; while(a[i].insn <= pivot.insn && i <= r);
do --j; while(a[j].insn > pivot.insn);
if (i >= j) {
break;
}
t = a[i]; a[i] = a[j]; a[j] = t;
}
t = a[l];
a[l] = a[j];
a[j] = t;
return j;
}
static bool intel_resgs_sorted = false;
// return register of given instruction id
// return 0 if not found
@ -2800,7 +2774,8 @@ x86_reg X86_insn_reg_intel(unsigned int id, enum cs_ac_type *access)
if (!intel_resgs_sorted) {
memcpy (insn_regs_intel_sorted, insn_regs_intel,
sizeof(insn_regs_intel_sorted));
qsort_regs (insn_regs_intel_sorted, first, last);
qsort ((void*)insn_regs_intel_sorted,
ARR_SIZE(insn_regs_intel_sorted), sizeof(struct insn_reg), regs_cmp);
intel_resgs_sorted = true;
}