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
|
/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include "tensorflow/c/c_api.h"
#include "tensorflow/core/framework/node_def_builder.h"
#include "tensorflow/core/framework/op.h"
#include "tensorflow/core/framework/shape_inference_testutil.h"
#include "tensorflow/core/lib/core/status_test_util.h"
#include "tensorflow/core/lib/strings/strcat.h"
#include "tensorflow/core/platform/test.h"
namespace tensorflow {
class LSTMOpsTest : public ::testing::Test {
public:
static void SetUpTestCase() {
TF_Status* status = TF_NewStatus();
auto* lib = TF_LoadLibrary(
"tensorflow/contrib/rnn/python/ops/_lstm_ops.so", status);
TF_Code code = TF_GetCode(status);
string status_msg(TF_Message(status));
TF_DeleteStatus(status);
ASSERT_EQ(TF_OK, code) << status_msg;
TF_DeleteLibraryHandle(lib);
}
};
static string JoinedCopies(const string& s, int copies) {
string res;
for (int i = 0; i < copies; ++i) {
strings::StrAppend(&res, i > 0 ? ";" : "", s);
}
return res;
}
TEST_F(LSTMOpsTest, LSTMBlockCell_ShapeFn) {
ShapeInferenceTestOp op("LSTMBlockCell");
// Last 6 inputs don't affect shape inference.
string input_suffix = strings::StrCat(";", JoinedCopies("?", 6));
// Rank checks.
INFER_ERROR("must be rank 2", op, "[?];?" + input_suffix);
INFER_ERROR("must be rank 2", op, "?;[?]" + input_suffix);
// Output
INFER_OK(op, "?;?" + input_suffix, JoinedCopies("[?,?]", 7));
INFER_OK(op, "[?,?];[?,?]" + input_suffix, JoinedCopies("[d0_0,d1_1]", 7));
}
TEST_F(LSTMOpsTest, LSTMBlockCellGrad_ShapeFn) {
ShapeInferenceTestOp op("LSTMBlockCellGrad");
// Last 14 inputs don't affect shape inference.
string input_suffix = strings::StrCat(";", JoinedCopies("?", 14));
// Rank checks.
INFER_ERROR("must be rank 2", op, "[?];?" + input_suffix);
INFER_ERROR("must be rank 2", op, "?;[?]" + input_suffix);
// Output
INFER_OK(op, "?;?" + input_suffix, "[?,?];[?,?];[?];[?];[?]");
INFER_OK(op, "[?,?];[?,?]" + input_suffix,
"[d0_0,d1_1];[d0_0,?];[d1_1];[d1_1];[d1_1]");
INFER_OK(op, "[1,2];[3,4]" + input_suffix,
"[d0_0,d1_1];[d0_0,16];[d1_1];[d1_1];[d1_1]");
}
TEST_F(LSTMOpsTest, BlockLSTM_ShapeFn) {
ShapeInferenceTestOp op("BlockLSTM");
TF_ASSERT_OK(NodeDefBuilder("test", "BlockLSTM")
.Input({"seq_len_max", 0, DT_INT64})
.Input({"x", 0, DT_FLOAT})
.Input({"cs_prev", 0, DT_FLOAT})
.Input({"h_prev", 0, DT_FLOAT})
.Input({"w", 0, DT_FLOAT})
.Input({"wci", 0, DT_FLOAT})
.Input({"wcf", 0, DT_FLOAT})
.Input({"wco", 0, DT_FLOAT})
.Input({"b", 0, DT_FLOAT})
.Finalize(&op.node_def));
// Middle inputs don't affect shape inference.
string infix = ";" + JoinedCopies("?", 6) + ";";
// Rank checks.
INFER_ERROR("must be rank 3", op, "?;[?]" + infix + "?");
INFER_ERROR("must be rank 1", op, "?;?" + infix + "[?,?]");
// Output
INFER_OK(op, "?;?" + infix + "?", JoinedCopies("[?,?,?]", 7));
INFER_OK(op, "?;[?,?,?]" + infix + "?", JoinedCopies("[d1_0,d1_1,?]", 7));
INFER_OK(op, "?;[?,?,?]" + infix + "[?]", JoinedCopies("[d1_0,d1_1,?]", 7));
INFER_OK(op, "?;[?,?,?]" + infix + "[20]", JoinedCopies("[d1_0,d1_1,5]", 7));
// cell_size must be divisible by 4.
INFER_ERROR("must be evenly divisible", op, "?;?" + infix + "[11]");
}
TEST_F(LSTMOpsTest, BlockLSTMGrad_ShapeFn) {
ShapeInferenceTestOp op("BlockLSTMGrad");
TF_ASSERT_OK(NodeDefBuilder("test", "BlockLSTMGrad")
.Input({"seq_len_max", 0, DT_INT64})
.Input({"x", 0, DT_FLOAT})
.Input({"cs_prev", 0, DT_FLOAT})
.Input({"h_prev", 0, DT_FLOAT})
.Input({"w", 0, DT_FLOAT})
.Input({"wci", 0, DT_FLOAT})
.Input({"wcf", 0, DT_FLOAT})
.Input({"wco", 0, DT_FLOAT})
.Input({"b", 0, DT_FLOAT})
.Input({"i", 0, DT_FLOAT})
.Input({"cs", 0, DT_FLOAT})
.Input({"f", 0, DT_FLOAT})
.Input({"o", 0, DT_FLOAT})
.Input({"ci", 0, DT_FLOAT})
.Input({"co", 0, DT_FLOAT})
.Input({"h", 0, DT_FLOAT})
.Input({"cs_grad", 0, DT_FLOAT})
.Input({"h_grad", 0, DT_FLOAT})
.Finalize(&op.node_def));
// Last inputs don't affect shape inference.
string suffix = ";" + JoinedCopies("?", 9);
// Rank check for x
INFER_ERROR("must be rank 3", op, "?;[?];?;?;?;?;?;?;?" + suffix);
// Rank checks for cs_prev through b.
INFER_ERROR("must be rank 2", op, "?;?;[1];?;?;?;?;?;?" + suffix);
INFER_ERROR("must be rank 2", op, "?;?;?;[1];?;?;?;?;?" + suffix);
INFER_ERROR("must be rank 2", op, "?;?;?;?;[1];?;?;?;?" + suffix);
INFER_ERROR("must be rank 1", op, "?;?;?;?;?;[1,?];?;?;?" + suffix);
INFER_ERROR("must be rank 1", op, "?;?;?;?;?;?;[1,?];?;?" + suffix);
INFER_ERROR("must be rank 1", op, "?;?;?;?;?;?;?;[1,?];?" + suffix);
INFER_ERROR("must be rank 1", op, "?;?;?;?;?;?;?;?;[1,?]" + suffix);
// Output with all input knowns makes known rank outputs.
INFER_OK(
op, JoinedCopies("?", 18),
"[?,?,?];" + JoinedCopies("[?,?]", 3) + ";" + JoinedCopies("[?]", 4));
// Output with copies input shapes to output.
string input = strings::StrCat("?;[?,?,?];", JoinedCopies("[?,?]", 3), ";",
JoinedCopies("[?]", 4), suffix);
string expected = "in1";
for (int i = 1; i < 8; ++i) {
strings::StrAppend(&expected, ";in", (i + 1));
}
INFER_OK(op, input, expected);
}
} // namespace tensorflow
|
