File: utils.hh

package info (click to toggle)
ptl 2.3.3-2.1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,296 kB
  • sloc: cpp: 8,195; python: 246; sh: 7; makefile: 3
file content (300 lines) | stat: -rw-r--r-- 9,077 bytes parent folder | download | duplicates (2)
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
//
// MIT License
// Copyright (c) 2019 Jonathan R. Madsen
// 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
// 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 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.
//
// ---------------------------------------------------------------
//  PTL common header for examples
//
//
//============================================================================//

#include "PTL/Task.hh"
#include "PTL/TaskGroup.hh"
#include "PTL/TaskManager.hh"
#include "PTL/TaskRunManager.hh"
#include "PTL/Threading.hh"
#include "PTL/Timer.hh"
#include "PTL/Utility.hh"

using namespace PTL;

// C headers
#include <cstdlib>  // setenv
#include <stdlib.h>

// C++ headers
#include <fstream>
#include <iostream>
#include <limits>
#include <random>

#if defined(PTL_USE_GPERF)
#    include <gperftools/heap-checker.h>
#    include <gperftools/heap-profiler.h>
#    include <gperftools/profiler.h>
#endif

using std::cerr;
using std::cout;
using std::endl;
using std::string;

//============================================================================//

#if defined(PTL_USE_ITTNOTIFY)
#    include <ittnotify.h>
#    define _pause_collection __itt_pause()
#    define _resume_collection __itt_resume()
#else
#    define _pause_collection
#    define _resume_collection
#endif

#if defined(PTL_USE_GPERF)
#    define _cpu_profiler_start(fname) ProfilerStart(fname)
#    define _cpu_profiler_flush ProfilerFlush()
#    define _cpu_profiler_stop ProfilerStop()
#    define _heap_profiler_start(fname) HeapProfilerStart(fname)
#    define _heap_profiler_flush HeapProfilerFlush()
#    define _heap_profiler_stop HeapProfilerStop()
#else
#    define _cpu_profiler_start(fname)
#    define _cpu_profiler_flush
#    define _cpu_profiler_stop
#    define _heap_profiler_start(fname)
#    define _heap_profiler_flush
#    define _heap_profiler_stop
#endif

#ifdef _OPENMP
#    include <omp.h>
#endif

//============================================================================//

// some typedefs to simplify declarations
typedef std::vector<int64_t>       Array_t;
typedef std::default_random_engine random_engine_t;
typedef std::vector<float>         farray_t;
typedef std::vector<int64_t>       iarray_t;

//============================================================================//

// some constants
const string   prefix    = "\n\t### ==> ";
const string   cprefix   = "\t### ==> ";
static int16_t rng_range = 2;

//============================================================================//
//
// the first template parameter is the result type, the second
// template parameter is optional. It will default to the first
// template parameter is not specified. It is available for
// when the results of individual tasks need to be combined into
// a different data type. In the fibonacci calculation of order 43
// the result using int will overflow the max value for int,
// hence why I am using it here

#if defined(USE_TBB_TASKS)
const bool                                    useTBB = true;
typedef TBBTaskGroup<Array_t, const int64_t&> TaskGroup_t;
typedef tbb::task_group                       VoidGroup_t;
typedef TBBTaskGroup<long>                    LongGroup_t;
#else
const bool                                 useTBB = false;
typedef TaskGroup<Array_t, const int64_t&> TaskGroup_t;
typedef TaskGroup<void, void, 10>          VoidGroup_t;
typedef TaskGroup<long>                    LongGroup_t;
#endif

//============================================================================//

struct Measurement
{
    long   cutoff;
    long   num_task_groups;
    long   nthreads;
    double ncount         = 0.0;
    double real           = 0.0;
    double cpu            = 0.0;
    double cpu_per_thread = 0.0;
    double cpu_util       = 0.0;

    Measurement(long _cutoff, long _ntg, long _nthreads)
    : cutoff(_cutoff)
    , num_task_groups(_ntg)
    , nthreads(_nthreads)
    {}

    bool operator==(const Measurement& rhs) const
    {
        return num_task_groups == rhs.num_task_groups;
    }

    bool operator!=(const Measurement& rhs) const { return !(*this == rhs); }

    bool operator()(const Measurement& rhs) const
    {
        return num_task_groups < rhs.num_task_groups;
    }

    bool operator<(const Measurement& rhs) const
    {
        return num_task_groups < rhs.num_task_groups;
    }

    bool operator>(const Measurement& rhs) const
    {
        return !(*this < rhs || *this == rhs);
    }

    bool operator>=(const Measurement& rhs) const { return !(*this < rhs); }

    bool operator<=(const Measurement& rhs) const
    {
        return (*this < rhs || *this == rhs);
    }

    Measurement& operator+=(const Timer& _timer)
    {
        real += _timer.GetRealElapsed();
        double _cpu = _timer.GetUserElapsed() + _timer.GetSystemElapsed();
        cpu += _cpu;
        cpu_per_thread += _cpu / nthreads;
        cpu_util += (_cpu / _timer.GetRealElapsed()) * 100.0;
        ncount += 1.0;
        return *this;
    }

    friend std::ostream& operator<<(std::ostream& os, const Measurement& m)
    {
        os << m.cutoff << ", " << m.num_task_groups << ", " << (m.real / m.ncount) << ", "
           << (m.cpu / m.ncount) << ", " << (m.cpu_per_thread / m.ncount) << ", "
           << (m.cpu_util / m.ncount) << ", " << m.ncount;
        return os;
    }
};

//============================================================================//

inline void
message(TaskRunManager* runmanager)
{
    cout << "\n\t--> Running in multithreaded mode with "
         << runmanager->GetNumberOfThreads() << " threads\n"
         << endl;
}

//============================================================================//

inline uint32_t
get_seed()
{
    static const uint32_t        seed_base   = 6734525;
    static const uint32_t        seed_factor = 1000;
    static std::atomic<uint32_t> _counter;
    static thread_local uint32_t _tid = ++_counter;
    return seed_base + (_tid * seed_factor);
}

//============================================================================//

inline random_engine_t&
get_engine()
{
    static thread_local random_engine_t* _engine = new random_engine_t(get_seed());
    return (*_engine);
}

//============================================================================//

template <typename _Tp = double>
_Tp
get_random()
{
    return std::generate_canonical<_Tp, std::numeric_limits<_Tp>::digits>(get_engine());
}

//============================================================================//

inline int64_t
get_random_int(int64_t _range = rng_range)
{
    static thread_local std::uniform_int_distribution<int64_t>* _instance =
        new std::uniform_int_distribution<int64_t>(-_range, _range);
    return (*_instance)(get_engine());
}

//============================================================================//

inline int64_t
fibonacci(int64_t n)
{
    return (n < 2) ? n : (fibonacci(n - 1) + fibonacci(n - 2));
}

//============================================================================//

inline std::atomic_uintmax_t&
task_group_cnt()
{
    static std::atomic_uintmax_t _instance(0);
    return _instance;
}

//============================================================================//

inline int64_t
compute_sum(const Array_t& arr)
{
    int64_t _sum = 0;
    for(const auto& itr : arr)
    {
        _sum += itr;
    }
    return _sum;
}

//============================================================================//

inline void
append(Array_t& lhs, TaskGroup_t* rhs)
{
    if(rhs)
        for(auto& itr : rhs->join())
            lhs.push_back(itr);
}

//============================================================================//

inline std::string
get_gperf_filename(const char* arg0, const std::string& ftype)
{
    uintmax_t   n     = 0;
    std::string fname = "";
    while(fname.length() == 0)
    {
        std::ifstream     in;
        std::stringstream ss;
        ss << arg0 << ".gperf." << ftype << "." << n++;
        in.open(ss.str().c_str());
        if(!in)
            fname = ss.str();
    }
    return fname;
}
//============================================================================//