File Coverage

djbsort_src/int64_sort.c

Criterion	Covered	Total	%
statement	31	40	77.5
branch	24	32	75.0
condition			n/a
subroutine			n/a
pod			n/a
total	55	72	76.3

#include "crypto_int64.h"
#include "int64_sort.h"
#define int64 crypto_int64
#define int64_MINMAX(a,b) crypto_int64_minmax(&(a),&(b))

void int64_sort(int64 *x,long long n)
{
  long long top,p,q,r,i,j;

  if (n < 2) return;
  top = 1;
  while (top < n - top) top += top;

  for (p = top;p >= 1;p >>= 1) {
    i = 0;
    while (i + 2 * p <= n) {
      for (j = i;j < i + p;++j)
        int64_MINMAX(x[j],x[j+p]);
      i += 2 * p;
    }
    for (j = i;j < n - p;++j)
      int64_MINMAX(x[j],x[j+p]);

    i = 0;
    j = 0;
    for (q = top;q > p;q >>= 1) {
      if (j != i) for (;;) {
        if (j == n - q) goto done;
        int64 a = x[j + p];
        for (r = q;r > p;r >>= 1)
          int64_MINMAX(a,x[j + r]);
        x[j + p] = a;
        ++j;
        if (j == i + p) {
          i += 2 * p;
          break;
        }
      }
      while (i + p <= n - q) {
        for (j = i;j < i + p;++j) {
          int64 a = x[j + p];
          for (r = q;r > p;r >>= 1)
            int64_MINMAX(a,x[j+r]);
          x[j + p] = a;
        }
        i += 2 * p;
      }
      /* now i + p > n - q */
      j = i;
      while (j < n - q) {
        int64 a = x[j + p];
        for (r = q;r > p;r >>= 1)
          int64_MINMAX(a,x[j+r]);
        x[j + p] = a;
        ++j;
      }

      done: ;
    }
  }
}