Subversion Repositories HelenOS

Rev

Rev 331 | Rev 335 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.  * Copyright (C) 2005 Sergey Bondari
  3.  * All rights reserved.
  4.  *
  5.  * Redistribution and use in source and binary forms, with or without
  6.  * modification, are permitted provided that the following conditions
  7.  * are met:
  8.  *
  9.  * - Redistributions of source code must retain the above copyright
  10.  *   notice, this list of conditions and the following disclaimer.
  11.  * - Redistributions in binary form must reproduce the above copyright
  12.  *   notice, this list of conditions and the following disclaimer in the
  13.  *   documentation and/or other materials provided with the distribution.
  14.  * - The name of the author may not be used to endorse or promote products
  15.  *   derived from this software without specific prior written permission.
  16.  *
  17.  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18.  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19.  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20.  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21.  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22.  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23.  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24.  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25.  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26.  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27.  */
  28.  
  29. #include <mm/heap.h>
  30. #include <memstr.h>
  31. #include <sort.h>
  32.  
  33.  
  34. void qsort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) {
  35.     if (n > 4) {
  36.         int i = 0, j = n - 1;
  37.         void * tmp = (void *) malloc(e_size);
  38.         void * pivot = (void *) malloc(e_size);
  39.  
  40.         memcpy(pivot, data, e_size);
  41.  
  42.         while (1) {
  43.             while ((cmp(data + i * e_size, pivot) < 0) && i < n) i++;
  44.             while ((cmp(data + j * e_size, pivot) >=0) && j > 0) j--;
  45.             if (i<j) {
  46.                 memcpy(tmp, data + i * e_size, e_size);
  47.                 memcpy(data + i * e_size, data + j * e_size, e_size);
  48.                 memcpy(data + j * e_size, tmp, e_size);
  49.             } else {
  50.                 break;
  51.             }
  52.         }
  53.  
  54.         free(tmp);
  55.         free(pivot);
  56.  
  57.         qsort(data, j + 1, e_size, cmp);
  58.         qsort(data + (j + 1) * e_size, n - j - 1, e_size, cmp);
  59.     } else {
  60.         bubblesort(data, n, e_size, cmp);
  61.     }
  62. }
  63.  
  64.  
  65. void bubblesort(void * data, count_t n, size_t e_size, int (* cmp) (void * a, void * b)) {
  66.     bool done = false;
  67.     void * p;
  68.     void * slot = (void *) malloc(e_size);
  69.  
  70.     while (!done) {
  71.         done = true;
  72.         for (p = data; p < data + e_size * (n - 1); p = p + e_size) {
  73.             if (cmp(p, p + e_size) == 1) {
  74.                 memcpy(slot, p, e_size);
  75.                 memcpy(p, p + e_size, e_size);
  76.                 memcpy(p + e_size, slot, e_size);
  77.                 done = false;
  78.             }
  79.         }
  80.     }
  81.    
  82.     free(slot);
  83. }
  84.  
  85. /*
  86.  * Comparator returns 1 if a > b, 0 if a == b, -1 if a < b
  87.  */
  88. int int_cmp(void * a, void * b) {
  89.     return (* (int *) a > * (int*)b) ? 1 : (*(int *)a < * (int *)b) ? -1 : 0;
  90. }
  91.  
  92. int __u8_cmp(void * a, void * b) {
  93.     return (* (__u8 *) a > * (__u8 *)b) ? 1 : (*(__u8 *)a < * (__u8 *)b) ? -1 : 0;
  94. }
  95.  
  96. int __u16_cmp(void * a, void * b) {
  97.     return (* (__u16 *) a > * (__u16 *)b) ? 1 : (*(__u16 *)a < * (__u16 *)b) ? -1 : 0;
  98. }
  99.  
  100. int __u32_cmp(void * a, void * b) {
  101.     return (* (__u32 *) a > * (__u32 *)b) ? 1 : (*(__u32 *)a < * (__u32 *)b) ? -1 : 0;
  102. }
  103.  
  104.