ReceiveTempSMS
/
Sweden-Number
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

ntdll: Rename mergesort to NTDLL_mergesort.

This commit is contained in:
Marcus Meissner 2010-05-12 07:53:39 +02:00 committed by Alexandre Julliard
parent 9847d28753
commit 364242fcf3
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
dlls/ntdll/misc.c
View File

@ -254,14 +254,15 @@ double CDECL NTDLL_tan( double d )
/* Merge Sort. Algorithm taken from http://www.linux-related.de/index.html?/coding/sort/sort_merge.htm */ /* Merge Sort. Algorithm taken from http://www.linux-related.de/index.html?/coding/sort/sort_merge.htm */
static void mergesort( void *arr, void *barr, int elemsize, int(__cdecl *compar)(const void *, const void *), static void
int left, int right ) NTDLL_mergesort( void *arr, void *barr, int elemsize, int(__cdecl *compar)(const void *, const void *),
int left, int right )
{ {
if(right>left) { if(right>left) {
int i, j, k, m; int i, j, k, m;
m=(right+left)/2; m=(right+left)/2;
mergesort( arr, barr, elemsize, compar, left, m); NTDLL_mergesort( arr, barr, elemsize, compar, left, m);
mergesort( arr, barr, elemsize, compar, m+1, right); NTDLL_mergesort( arr, barr, elemsize, compar, m+1, right);
#define X(a,i) ((char*)a+elemsize*(i)) #define X(a,i) ((char*)a+elemsize*(i))
for (i=m+1; i>left; i--) for (i=m+1; i>left; i--)
@ -290,6 +291,6 @@ void __cdecl NTDLL_qsort( void *base, size_t nmemb, size_t size,
int(__cdecl *compar)(const void *, const void *) ) int(__cdecl *compar)(const void *, const void *) )
{ {
void *secondarr = RtlAllocateHeap (GetProcessHeap(), 0, nmemb*size); void *secondarr = RtlAllocateHeap (GetProcessHeap(), 0, nmemb*size);
mergesort( base, secondarr, size, compar, 0, nmemb-1 ); NTDLL_mergesort( base, secondarr, size, compar, 0, nmemb-1 );
RtlFreeHeap (GetProcessHeap(),0, secondarr); RtlFreeHeap (GetProcessHeap(),0, secondarr);
} }