TestOpenCLSort.cpp 4.64 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/* -------------------------------------------------------------------------- *
 *                                   OpenMM                                   *
 * -------------------------------------------------------------------------- *
 * This is part of the OpenMM molecular simulation toolkit originating from   *
 * Simbios, the NIH National Center for Physics-Based Simulation of           *
 * Biological Structures at Stanford, funded under the NIH Roadmap for        *
 * Medical Research, grant U54 GM072970. See https://simtk.org.               *
 *                                                                            *
 * Portions copyright (c) 2008-2009 Stanford University and the Authors.      *
 * Authors: Peter Eastman                                                     *
 * Contributors:                                                              *
 *                                                                            *
 * Permission is hereby granted, free of charge, to any person obtaining a    *
 * copy of this software and associated documentation files (the "Software"), *
 * to deal in the Software without restriction, including without limitation  *
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,   *
 * and/or sell copies of the Software, and to permit persons to whom the      *
 * Software is furnished to do so, subject to the following conditions:       *
 *                                                                            *
 * The above copyright notice and this permission notice shall be included in *
 * all copies or substantial portions of the Software.                        *
 *                                                                            *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR *
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,   *
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL    *
 * THE AUTHORS, CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,    *
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR      *
 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE  *
 * USE OR OTHER DEALINGS IN THE SOFTWARE.                                     *
 * -------------------------------------------------------------------------- */

/**
 * This tests the OpenCL implementation of sorting.
 */

36
#include "openmm/internal/AssertionUtilities.h"
37
38
39
#include "../src/OpenCLArray.h"
#include "../src/OpenCLContext.h"
#include "../src/OpenCLSort.h"
40
#include "sfmt/SFMT.h"
41
42
43
44
45
46
47
48
#include "openmm/System.h"
#include <iostream>
#include <cmath>
#include <set>

using namespace OpenMM;
using namespace std;

49
50
51
52
53
54
55
56
57
58
59
struct SortTrait {
    typedef cl_float DataType;
    typedef cl_float KeyType;
    static const char* clDataType() {return "float";}
    static const char* clKeyType() {return "float";}
    static const char* clMinKey() {return "-MAXFLOAT";}
    static const char* clMaxKey() {return "MAXFLOAT";}
    static const char* clMaxValue() {return "MAXFLOAT";}
    static const char* clSortKey() {return "value";}
};

60
61
62
63
64
void verifySorting(vector<float> array) {
    // Sort the array.

    System system;
    system.addParticle(0.0);
Peter Eastman's avatar
Peter Eastman committed
65
    OpenCLPlatform::PlatformData platformData(system, "", "");
66
    OpenCLContext& context = *platformData.contexts[0];
67
68
69
    context.initialize(system);
    OpenCLArray<float> data(context, array.size(), "sortData");
    data.upload(array);
70
    OpenCLSort<SortTrait> sort(context, array.size());
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
    sort.sort(data);
    vector<float> sorted;
    data.download(sorted);

    // Verify that it is in sorted order.

    for (int i = 1; i < (int) sorted.size(); i++)
        ASSERT(sorted[i-1] <= sorted[i]);

    // Make sure the sorted array contains the same values as the original one.

    multiset<float> elements1(array.begin(), array.end());
    multiset<float> elements2(sorted.begin(), sorted.end());
    ASSERT(elements1 == elements2);
}

void testUniformValues()
{
89
90
91
    OpenMM_SFMT::SFMT sfmt;
    init_gen_rand(0, sfmt);

92
93
    vector<float> array(10000);
    for (int i = 0; i < (int) array.size(); i++)
94
        array[i] = (float) genrand_real2(sfmt);
95
96
97
98
99
    verifySorting(array);
}

void testLogValues()
{
100
101
102
    OpenMM_SFMT::SFMT sfmt;
    init_gen_rand(0, sfmt);

103
104
    vector<float> array(10000);
    for (int i = 0; i < (int) array.size(); i++)
105
        array[i] = (float) log(genrand_real2(sfmt));
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
    verifySorting(array);
}

int main() {
    try {
        testUniformValues();
        testLogValues();
    }
    catch(const exception& e) {
        cout << "exception: " << e.what() << endl;
        return 1;
    }
    cout << "Done" << endl;
    return 0;
}