forked from arrayfire/arrayfire
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathreorder.cpp
More file actions
123 lines (109 loc) · 3.93 KB
/
Copy pathreorder.cpp
File metadata and controls
123 lines (109 loc) · 3.93 KB
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
/*******************************************************
* Copyright (c) 2014, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
********************************************************/
#include <af/data.h>
#include <af/blas.h>
#include <common/err_common.hpp>
#include <handle.hpp>
#include <backend.hpp>
#include <common/ArrayInfo.hpp>
#include <reorder.hpp>
#include <transpose.hpp>
using af::dim4;
using namespace detail;
template<typename T>
static inline af_array reorder(const af_array in, const af::dim4 &rdims0)
{
Array<T> In = getArray<T>(in);
dim4 rdims = rdims0;
if (rdims[0] == 1 && rdims[1] == 0) {
In = transpose(In, false);
std::swap(rdims[0], rdims[1]);
}
const dim4 idims = In.dims();
const dim4 istrides = In.strides();
// Ensure all JIT nodes are evaled
In.eval();
af_array out;
if (rdims[0] == 0 &&
rdims[1] == 1 &&
rdims[2] == 2 &&
rdims[3] == 3) {
Array<T> Out = In;
out = getHandle(Out);
} else if (rdims[0] == 0) {
dim4 odims = dim4(1,1,1,1);
dim4 ostrides = dim4(1,1,1,1);
for(int i = 0; i < 4; i++) {
odims[i] = idims[rdims[i]];
ostrides[i] = istrides[rdims[i]];
}
Array<T> Out = In;
Out.modDims(odims);
Out.modStrides(ostrides);
out = getHandle(Out);
} else {
Array<T> Out = reorder<T>(In, rdims);
out = getHandle(Out);
}
return out;
}
af_err af_reorder(af_array *out, const af_array in, const af::dim4 &rdims)
{
try {
const ArrayInfo& info = getInfo(in);
af_dtype type = info.getType();
if(info.elements() == 0) {
return af_retain_array(out, in);
}
DIM_ASSERT(1, info.elements() > 0);
// Check that dimensions are not repeated
// allDims is to check if all dimensions are there exactly once
// If all dimensions are present, the allDims will be -1, -1, -1, -1
// after the loop
// Example:
// rdims = {2, 0, 3, 1}
// i = 0 => 2 found and cond is true so alldims[2] = -1
// i = 1 => 0 found and cond is true so alldims[0] = -1
// i = 2 => 3 found and cond is true so alldims[3] = -1
// i = 3 => 1 found and cond is true so alldims[1] = -1
// rdims = {2, 0, 3, 2} // Failure case
// i = 3 => 2 found so cond is false (since alldims[2] = -1 when i = 0) so failed.
dim_t allDims[] = {0, 1, 2, 3};
for(int i = 0; i < 4; i++) {
DIM_ASSERT(i + 2, rdims[i] == allDims[rdims[i]]);
allDims[rdims[i]] = -1;
}
af_array output;
switch(type) {
case f32: output = reorder<float >(in, rdims); break;
case c32: output = reorder<cfloat >(in, rdims); break;
case f64: output = reorder<double >(in, rdims); break;
case c64: output = reorder<cdouble>(in, rdims); break;
case b8: output = reorder<char >(in, rdims); break;
case s32: output = reorder<int >(in, rdims); break;
case u32: output = reorder<uint >(in, rdims); break;
case u8: output = reorder<uchar >(in, rdims); break;
case s64: output = reorder<intl >(in, rdims); break;
case u64: output = reorder<uintl >(in, rdims); break;
case s16: output = reorder<short >(in, rdims); break;
case u16: output = reorder<ushort >(in, rdims); break;
default: TYPE_ERROR(1, type);
}
std::swap(*out,output);
}
CATCHALL;
return AF_SUCCESS;
}
af_err af_reorder(af_array *out, const af_array in,
const unsigned x, const unsigned y,
const unsigned z, const unsigned w)
{
af::dim4 rdims(x, y, z, w);
return af_reorder(out, in, rdims);
}