Coverage Report

Created: 2017-08-21 19:50

/Users/buildslave/jenkins/sharedspace/clang-stage2-coverage-R@2/llvm/tools/polly/lib/External/isl/isl_sort.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * The code of this file was taken from http://jeffreystedfast.blogspot.be,
3
 * where it was posted in 2011 by Jeffrey Stedfast under the MIT license.
4
 * The MIT license text is as follows:
5
 *
6
 * Permission is hereby granted, free of charge, to any person obtaining a copy
7
 * of this software and associated documentation files (the "Software"), to
8
 * deal in the Software without restriction, including without limitation the
9
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10
 * sell copies of the Software, and to permit persons to whom the Software is
11
 * furnished to do so, subject to the following conditions:
12
 *
13
 * The above copyright notice and this permission notice shall be included in
14
 * all copies or substantial portions of the Software.
15
 *
16
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
22
 * IN THE SOFTWARE.
23
 */
24
25
#include <errno.h>
26
#include <string.h>
27
#include <stdlib.h>
28
#include <isl_sort.h>
29
30
980k
#define MID(lo, hi) (lo + ((hi - lo) >> 1))
31
32
/* The code here is an optimized merge sort. Starting from a generic merge sort
33
 * the following optimizations were applied:
34
 *
35
 * o Batching of memcpy() calls: Instead of calling memcpy() to copy each and
36
 *   every element into a temporary buffer, blocks of elements are copied
37
 *   at a time.
38
 *
39
 * o To reduce the number of memcpy() calls further, copying leading
40
 *   and trailing elements into our temporary buffer is avoided, in case it is
41
 *   not necessary to merge them.
42
 *
43
 * A further optimization could be to specialize memcpy calls based on the
44
 * size of the types we compare. For now, this code does not include the
45
 * relevant optimization, as clang e.g. inlines a very efficient memcpy()
46
 * implementation. It is not clear, that the specialized version as provided in
47
 * the blog post, is really superior to the one that will be inlined by
48
 * default. So we decided to keep the code simple until this optimization was
49
 * proven to be beneficial.
50
 */
51
52
static void
53
msort (void *array, void *buf, size_t low, size_t high, size_t size,
54
       int (* compare) (const void *, const void *, void *), void *arg)
55
980k
{
56
980k
    char *a1, *al, *am, *ah, *ls, *hs, *lo, *hi, *b;
57
980k
    size_t copied = 0;
58
980k
    size_t mid;
59
980k
60
980k
    mid = MID (low, high);
61
980k
62
980k
    if (mid + 1 < high)
63
308k
        msort (array, buf, mid + 1, high, size, compare, arg);
64
980k
65
980k
    if (mid > low)
66
482k
        msort (array, buf, low, mid, size, compare, arg);
67
980k
68
980k
    ah = ((char *) array) + ((high + 1) * size);
69
980k
    am = ((char *) array) + ((mid + 1) * size);
70
980k
    a1 = al = ((char *) array) + (low * size);
71
980k
72
980k
    b = (char *) buf;
73
980k
    lo = al;
74
980k
    hi = am;
75
980k
76
1.08M
    do {
77
1.08M
        ls = lo;
78
1.08M
        hs = hi;
79
1.08M
80
1.08M
        if (
lo > al || 1.08M
hi > am1.00M
)
{103k
81
103k
            /* our last loop already compared lo & hi and found lo <= hi */
82
103k
            lo += size;
83
1.08M
        }
84
1.08M
85
2.84M
        while (
lo < am && 2.84M
compare (lo, hi, arg) <= 02.06M
)
86
1.76M
            lo += size;
87
1.08M
88
1.08M
        if (
lo < am1.08M
)
{297k
89
297k
            if (
copied == 0297k
)
{231k
90
231k
                /* avoid copying the leading items */
91
231k
                a1 = lo;
92
231k
                ls = lo;
93
297k
            }
94
297k
95
297k
            /* our last compare tells us hi < lo */
96
297k
            hi += size;
97
297k
98
511k
            while (
hi < ah && 511k
compare (hi, lo, arg) < 0316k
)
99
213k
                hi += size;
100
297k
101
297k
            if (
lo > ls297k
)
{65.9k
102
65.9k
                memcpy (b, ls, lo - ls);
103
65.9k
                copied += (lo - ls);
104
65.9k
                b += (lo - ls);
105
297k
            }
106
297k
107
297k
            memcpy (b, hs, hi - hs);
108
297k
            copied += (hi - hs);
109
297k
            b += (hi - hs);
110
1.08M
        } else 
if (785k
copied785k
)
{37.0k
111
37.0k
            memcpy (b, ls, lo - ls);
112
37.0k
            copied += (lo - ls);
113
37.0k
            b += (lo - ls);
114
37.0k
115
37.0k
            /* copy everything we needed to re-order back into array */
116
37.0k
            memcpy (a1, buf, copied);
117
37.0k
            return;
118
785k
        } else {
119
748k
            /* everything already in order */
120
748k
            return;
121
1.08M
        }
122
980k
    } while (hi < ah);
123
980k
124
194k
    
if (194k
lo < am194k
)
{194k
125
194k
        memcpy (b, lo, am - lo);
126
194k
        copied += (am - lo);
127
194k
    }
128
194k
129
194k
    memcpy (a1, buf, copied);
130
980k
}
131
132
static int
133
MergeSort (void *base, size_t nmemb, size_t size,
134
           int (* compare) (const void *, const void *, void *), void *arg)
135
223k
{
136
223k
    void *tmp;
137
223k
138
223k
    if (nmemb < 2)
139
34.8k
        return 0;
140
223k
141
188k
    
if (188k
!(tmp = malloc (nmemb * size))188k
)
{0
142
0
        errno = ENOMEM;
143
0
        return -1;
144
188k
    }
145
188k
146
188k
    msort (base, tmp, 0, nmemb - 1, size, compare, arg);
147
188k
148
188k
    free (tmp);
149
188k
150
188k
    return 0;
151
223k
}
152
153
int isl_sort(void *const pbase, size_t total_elems, size_t size,
154
  int (*cmp)(const void *, const void *, void *arg), void *arg)
155
223k
{
156
223k
    return MergeSort (pbase, total_elems, size, cmp, arg);
157
223k
}