Coverage Report

Created: 2017-03-27 23:01

/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
661k
#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
661k
{
56
661k
    char *a1, *al, *am, *ah, *ls, *hs, *lo, *hi, *b;
57
661k
    size_t copied = 0;
58
661k
    size_t mid;
59
661k
60
661k
    mid = MID (low, high);
61
661k
62
661k
    if (mid + 1 < high)
63
203k
        msort (array, buf, mid + 1, high, size, compare, arg);
64
661k
65
661k
    if (mid > low)
66
319k
        msort (array, buf, low, mid, size, compare, arg);
67
661k
68
661k
    ah = ((char *) array) + ((high + 1) * size);
69
661k
    am = ((char *) array) + ((mid + 1) * size);
70
661k
    a1 = al = ((char *) array) + (low * size);
71
661k
72
661k
    b = (char *) buf;
73
661k
    lo = al;
74
661k
    hi = am;
75
661k
76
738k
    do {
77
738k
        ls = lo;
78
738k
        hs = hi;
79
738k
80
738k
        if (
lo > al || 738k
hi > am677k
)
{77.1k
81
77.1k
            /* our last loop already compared lo & hi and found lo <= hi */
82
77.1k
            lo += size;
83
77.1k
        }
84
738k
85
1.86M
        while (
lo < am && 1.86M
compare (lo, hi, arg) <= 01.33M
)
86
1.12M
            lo += size;
87
738k
88
738k
        if (
lo < am738k
)
{211k
89
211k
            if (
copied == 0211k
)
{161k
90
161k
                /* avoid copying the leading items */
91
161k
                a1 = lo;
92
161k
                ls = lo;
93
161k
            }
94
211k
95
211k
            /* our last compare tells us hi < lo */
96
211k
            hi += size;
97
211k
98
356k
            while (
hi < ah && 356k
compare (hi, lo, arg) < 0221k
)
99
144k
                hi += size;
100
211k
101
211k
            if (
lo > ls211k
)
{50.5k
102
50.5k
                memcpy (b, ls, lo - ls);
103
50.5k
                copied += (lo - ls);
104
50.5k
                b += (lo - ls);
105
50.5k
            }
106
211k
107
211k
            memcpy (b, hs, hi - hs);
108
211k
            copied += (hi - hs);
109
211k
            b += (hi - hs);
110
526k
        } else 
if (526k
copied526k
)
{26.6k
111
26.6k
            memcpy (b, ls, lo - ls);
112
26.6k
            copied += (lo - ls);
113
26.6k
            b += (lo - ls);
114
26.6k
115
26.6k
            /* copy everything we needed to re-order back into array */
116
26.6k
            memcpy (a1, buf, copied);
117
26.6k
            return;
118
499k
        } else {
119
499k
            /* everything already in order */
120
499k
            return;
121
499k
        }
122
211k
    } while (hi < ah);
123
661k
124
134k
    
if (134k
lo < am134k
)
{134k
125
134k
        memcpy (b, lo, am - lo);
126
134k
        copied += (am - lo);
127
134k
    }
128
134k
129
134k
    memcpy (a1, buf, copied);
130
134k
}
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
163k
{
136
163k
    void *tmp;
137
163k
138
163k
    if (nmemb < 2)
139
26.1k
        return 0;
140
163k
141
137k
    
if (137k
!(tmp = malloc (nmemb * size))137k
)
{0
142
0
        errno = ENOMEM;
143
0
        return -1;
144
0
    }
145
137k
146
137k
    msort (base, tmp, 0, nmemb - 1, size, compare, arg);
147
137k
148
137k
    free (tmp);
149
137k
150
137k
    return 0;
151
137k
}
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
163k
{
156
163k
    return MergeSort (pbase, total_elems, size, cmp, arg);
157
163k
}