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
|
#include "shared.rsh"
// Same as reduce.rs, except this test case places the pragmas after
// the functions (backward reference), and the other test case places
// the pragmas before the functions (forward reference).
float negInf, posInf;
/////////////////////////////////////////////////////////////////////////
static void aiAccum(int *accum, int val) { *accum += val; }
#pragma rs reduce(addint) \
accumulator(aiAccum)
/////////////////////////////////////////////////////////////////////////
static void dpAccum(float *accum, float in1, float in2) {
*accum += in1*in2;
}
// combiner function
static void dpSum(float *accum, const float *val) { *accum += *val; }
#pragma rs reduce(dp) \
accumulator(dpAccum) combiner(dpSum)
/////////////////////////////////////////////////////////////////////////
typedef struct {
float val;
int idx;
} IndexedVal;
typedef struct {
IndexedVal min, max;
} MinAndMax;
static void fMMInit(MinAndMax *accum) {
accum->min.val = posInf;
accum->min.idx = -1;
accum->max.val = negInf;
accum->max.idx = -1;
}
static void fMMAccumulator(MinAndMax *accum, float in, int x) {
IndexedVal me;
me.val = in;
me.idx = x;
if (me.val < accum->min.val)
accum->min = me;
if (me.val > accum->max.val)
accum->max = me;
}
static void fMMCombiner(MinAndMax *accum,
const MinAndMax *val) {
fMMAccumulator(accum, val->min.val, val->min.idx);
fMMAccumulator(accum, val->max.val, val->max.idx);
}
static void fMMOutConverter(int2 *result,
const MinAndMax *val) {
result->x = val->min.idx;
result->y = val->max.idx;
}
#pragma rs reduce(findMinAndMax) \
initializer(fMMInit) accumulator(fMMAccumulator) \
combiner(fMMCombiner) outconverter(fMMOutConverter)
/////////////////////////////////////////////////////////////////////////
static void fzInit(int *accumIdx) { *accumIdx = -1; }
static void fzAccum(int *accumIdx,
int inVal, int x /* special arg */) {
if (inVal==0) *accumIdx = x;
}
static void fzCombine(int *accumIdx, const int *accumIdx2) {
if (*accumIdx2 >= 0) *accumIdx = *accumIdx2;
}
#pragma rs reduce(fz) \
initializer(fzInit) \
accumulator(fzAccum) combiner(fzCombine)
/////////////////////////////////////////////////////////////////////////
static void fz2Init(int2 *accum) { accum->x = accum->y = -1; }
static void fz2Accum(int2 *accum,
int inVal,
int x /* special arg */,
int y /* special arg */) {
if (inVal==0) {
accum->x = x;
accum->y = y;
}
}
static void fz2Combine(int2 *accum, const int2 *accum2) {
if (accum2->x >= 0) *accum = *accum2;
}
#pragma rs reduce(fz2) \
initializer(fz2Init) \
accumulator(fz2Accum) combiner(fz2Combine)
/////////////////////////////////////////////////////////////////////////
static void fz3Init(int3 *accum) { accum->x = accum->y = accum->z = -1; }
static void fz3Accum(int3 *accum,
int inVal,
int x /* special arg */,
int y /* special arg */,
int z /* special arg */) {
if (inVal==0) {
accum->x = x;
accum->y = y;
accum->z = z;
}
}
static void fz3Combine(int3 *accum, const int3 *accum2) {
if (accum->x >= 0) *accum = *accum2;
}
#pragma rs reduce(fz3) \
initializer(fz3Init) \
accumulator(fz3Accum) combiner(fz3Combine)
/////////////////////////////////////////////////////////////////////////
#define BUCKETS 256
typedef uint32_t Histogram[BUCKETS];
static void hsgAccum(Histogram *h, uchar in) { ++(*h)[in]; }
static void hsgCombine(Histogram *accum, const Histogram *addend) {
for (int i = 0; i < BUCKETS; ++i)
(*accum)[i] += (*addend)[i];
}
#pragma rs reduce(histogram) \
accumulator(hsgAccum) combiner(hsgCombine)
static void modeOutConvert(int2 *result, const Histogram *h) {
uint32_t mode = 0;
for (int i = 1; i < BUCKETS; ++i)
if ((*h)[i] > (*h)[mode]) mode = i;
result->x = mode;
result->y = (*h)[mode];
}
#pragma rs reduce(mode) \
accumulator(hsgAccum) combiner(hsgCombine) \
outconverter(modeOutConvert)
|
