mariadb/ft/sort.cc

/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
#ident "Copyright (c) 2007-2012 Tokutek Inc.  All rights reserved."
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."

#include "includes.h"
#include "sort.h"

#if defined(HAVE_CILK)
#include <cilk/cilk.h>
#define cilk_worker_count (__cilkrts_get_nworkers())
#else
#define cilk_spawn
#define cilk_sync
#define cilk_for for
#define cilk_worker_count 1
#endif

static int
merge_c(void *vdest, void *va, int an, void *vb, int bn, int width,
        void *extra, int (*cmp)(void *, const void *, const void *))
{
    char *CAST_FROM_VOIDP(dest, vdest), *CAST_FROM_VOIDP(a, va), *CAST_FROM_VOIDP(b, vb);
    while (an > 0 && bn > 0) {
        if (cmp(extra, a, b) < 0) {
            memcpy(dest, a, width);
            dest += width; a += width; an--;
        } else {
            memcpy(dest, b, width);
            dest += width; b += width; bn--;
        }
    }
    if (an > 0) {
        memcpy(dest, a, an * width);
    }
    if (bn > 0) {
        memcpy(dest, b, bn * width);
    }
    return 0;
}

static int
binsearch(void *key, void *va, int n, int abefore, int width,
          void *extra, int (*cmp)(void *, const void *, const void *))
{
    if (n == 0) {
        return abefore;
    }
    char *CAST_FROM_VOIDP(a, va);
    int mid = n / 2;
    void *akey = &a[mid * width];
    int c = cmp(extra, key, akey);
    if (c < 0) {
        if (n == 1) {
            return abefore;
        } else {
            return binsearch(key, a, mid, abefore, width, extra, cmp);
        }
    } else if (c > 0) {
        if (n == 1) {
            return abefore + 1;
        } else {
            return binsearch(key, akey, n - mid, abefore + mid, width,
                             extra, cmp);
        }
    } else {
        // this won't happen because msns are unique, but is here for
        // completeness
        return abefore + mid;
    }
}

static int
merge(void *vdest, void *va, int an, void *vb, int bn, int width,
      void *extra, int (*cmp)(void *, const void *, const void *))
{
    if (an + bn < 10000) {
        return merge_c(vdest, va, an, vb, bn, width, extra, cmp);
    }

    char *CAST_FROM_VOIDP(dest, vdest), *CAST_FROM_VOIDP(a, va), *CAST_FROM_VOIDP(b, vb);
    if (an < bn) {
        char *tmp1 = a; a = b; b = tmp1;
        int tmp2 = an; an = bn; bn = tmp2;
    }
    int a2 = an / 2;
    void *akey = &a[a2 * width];
    int b2 = binsearch(akey, b, bn, 0, width, extra, cmp);
    int ra, rb;
    ra = cilk_spawn merge(dest, a, a2, b, b2, width, extra, cmp);
    rb = merge(&dest[(a2 + b2) * width], akey, an - a2, &b[b2 * width], bn - b2,
               width, extra, cmp);
    cilk_sync;
    if (ra != 0) return ra;
    return rb;
}

static inline void
swap(void *va, void *vb, int width)
{
    uint64_t *CAST_FROM_VOIDP(ia, va), *CAST_FROM_VOIDP(ib, vb), it;
    while ((unsigned int) width >= sizeof(uint64_t)) {
        it = *ia;
        *ia = *ib;
        *ib = it;
        width -= sizeof(uint64_t);
        ia++;
        ib++;
    }
    unsigned char *CAST_FROM_VOIDP(ca, (void *) ia), *CAST_FROM_VOIDP(cb, (void *) ib), ct;
    while (width > 0) {
        ct = *ca;
        *ca = *cb;
        *cb = ct;
        width--;
        ca++;
        cb++;
    }
}

static int
quicksort_r(void *va, int n, int width,
            void *extra, int (*cmp)(void *, const void *, const void *))
{
    if (n <= 1) { return 0; }
    unsigned char *CAST_FROM_VOIDP(a, va);
    unsigned char *lo = a;
    unsigned char *pivot = &a[(n / 2) * width];
    unsigned char *hi = &a[(n - 1) * width];
    if (cmp(extra, lo, pivot) > 0) {
        swap(lo, pivot, width);
    }
    if (cmp(extra, pivot, hi) > 0) {
        swap(pivot, hi, width);
        if (cmp(extra, lo, pivot) > 0) {
            swap(lo, pivot, width);
        }
    }
    unsigned char *lp = lo + width, *rp = hi - width;
    while (lp <= rp) {
        while (cmp(extra, lp, pivot) < 0) {
            lp += width;
        }
        while (cmp(extra, pivot, rp) < 0) {
            rp -= width;
        }
        if (lp < rp) {
            swap(lp, rp, width);
            // fix up pivot if we moved it
            if (pivot == lp) { pivot = rp; }
            else if (pivot == rp) { pivot = lp; }
            lp += width;
            rp -= width;
        } else if (lp == rp) {
            lp += width;
            rp -= width;
        }
    }

    int r = quicksort_r(lo, 1 + (rp - a) / width, width, extra, cmp);
    if (r != 0) { return r; }
    r = quicksort_r(lp, 1 + (hi - lp) / width, width, extra, cmp);
    return r;
}

int
mergesort_r(void *va, int n, int width,
            void *extra, int (*cmp)(void *, const void *, const void *))
{
    if (n <= 1) { return 0; }
    if (n < 10000) {
        return quicksort_r(va, n, width, extra, cmp);
    }
    unsigned char *CAST_FROM_VOIDP(a, va);
    int mid = n / 2;
    int r1 = cilk_spawn mergesort_r(a, mid, width, extra, cmp);
    int r2 = mergesort_r(&a[mid * width], n - mid, width, extra, cmp);
    cilk_sync;
    if (r1 != 0) return r1;
    if (r2 != 0) return r2;

    void *tmp = toku_xmalloc(n * width);
    int r = merge(tmp, a, mid, &a[mid * width], n - mid, width, extra, cmp);
    if (r == 0) {
        memcpy(a, tmp, n * width);
    }
    toku_free(tmp);
    return r;
}