HelenOS-historicHelenOSHelenOS-doc

Català-Valencià – Catalan中文 – Chinese (Simplified)中文 – Chinese (Traditional)Česky – CzechDansk – DanishNederlands – DutchEnglish – EnglishSuomi – FinnishFrançais – FrenchDeutsch – Germanעברית – Hebrewहिंदी – HindiMagyar – HungarianBahasa Indonesia – IndonesianItaliano – Italian日本語 – Japanese한국어 – KoreanМакедонски – Macedonianमराठी – MarathiNorsk – NorwegianPolski – PolishPortuguês – PortuguesePortuguês – Portuguese (Brazil)Русский – RussianSlovenčina – SlovakSlovenščina – SlovenianEspañol – SpanishSvenska – SwedishTürkçe – TurkishУкраїнська – UkrainianOëzbekcha – Uzbek

Compare Revisions

• This comparison shows the changes necessary to convert path

  → / @ 334

  → / @ 335

  ↔ Reverse comparison

• Compare Path:	Rev

  With Path:	Rev

Ignore whitespace Rev 334 → Rev 335

/SPARTAN/trunk/src/lib/sort.c
29,13 → 29,51
#include <mm/heap.h>
#include <memstr.h>
#include <sort.h>
#include <panic.h>
static void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void * pivot, void * tmp);
/*
* Wrapper method for quicksort algorithm to decrease amount of allocations
*/
void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) {
void * tmp = (void *) malloc(e_size);
void * pivot = (void *) malloc(e_size);
if (!tmp || !pivot) {
panic("qsort(): Cannot allocate memory\n");
}
_qsort(data, n, e_size, cmp, pivot, tmp);
free(tmp);
free(pivot);
}
void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) {
bool done = false;
void * p;
void * slot = (void *) malloc(e_size);
while (!done) {
done = true;
for (p = data; p < data + e_size * (n - 1); p = p + e_size) {
if (cmp(p, p + e_size) == 1) {
memcpy(slot, p, e_size);
memcpy(p, p + e_size, e_size);
memcpy(p + e_size, slot, e_size);
done = false;
}
}
}
free(slot);
}
static void _qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b), void * pivot, void * tmp) {
if (n > 4) {
int i = 0, j = n - 1;
void * tmp = (void *) malloc(e_size);
void * pivot = (void *) malloc(e_size);
memcpy(pivot, data, e_size);
51,9 → 89,6
}
}
free(tmp);
free(pivot);
qsort(data, j + 1, e_size, cmp);
qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp);
} else {
62,26 → 97,7
}
void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) {
bool done = false;
void * p;
void * slot = (void *) malloc(e_size);
while (!done) {
done = true;
for (p = data; p < data + e_size * (n - 1); p = p + e_size) {
if (cmp(p, p + e_size) == 1) {
memcpy(slot, p, e_size);
memcpy(p, p + e_size, e_size);
memcpy(p + e_size, slot, e_size);
done = false;
}
}
}
free(slot);
}
/*
* Comparator returns 1 if a > b, 0 if a == b, -1 if a < b
*/