/
shape_inference_test.cc
1905 lines (1635 loc) · 64.6 KB
/
shape_inference_test.cc
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
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with 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/core/framework/shape_inference.h"
#include <string>
#include "absl/strings/str_cat.h"
#include "tensorflow/core/framework/fake_input.h"
#include "tensorflow/core/framework/node_def_builder.h"
#include "tensorflow/core/framework/op_def_builder.h"
#include "tensorflow/core/framework/tensor_shape.pb.h"
#include "tensorflow/core/framework/tensor_testutil.h"
#include "tensorflow/core/framework/types.pb.h"
#include "tensorflow/core/lib/core/status_test_util.h"
#include "tensorflow/core/platform/status_matchers.h"
#include "tensorflow/core/platform/test.h"
#include "tensorflow/core/protobuf/error_codes.pb.h"
namespace tensorflow {
namespace shape_inference {
namespace {
using ::tensorflow::testing::StatusIs;
using ::testing::_;
using ::testing::AllOf;
using ::testing::HasSubstr;
OpDef MakeOpDefWithLists() {
OpRegistrationData op_reg_data;
TF_EXPECT_OK(OpDefBuilder("dummy")
.Input("input: N * float")
.Output("output: N * float")
.Attr("N:int >= 1")
.Finalize(&op_reg_data));
return op_reg_data.op_def;
}
PartialTensorShape S(std::initializer_list<int64_t> dims) {
return PartialTensorShape(dims);
}
PartialTensorShape Unknown() { return PartialTensorShape(); }
} // namespace
class ShapeInferenceTest : public ::testing::Test {
protected:
// These give access to private functions of DimensionHandle and ShapeHandle.
bool SameHandle(DimensionHandle a, DimensionHandle b) {
return a.SameHandle(b);
}
bool SameHandle(ShapeHandle a, ShapeHandle b) { return a.SameHandle(b); }
bool IsSet(DimensionHandle d) { return d.IsSet(); }
bool IsSet(ShapeHandle s) { return s.IsSet(); }
void Relax(InferenceContext* c, DimensionHandle d0, DimensionHandle d1,
DimensionHandle* out) {
c->Relax(d0, d1, out);
}
void Relax(InferenceContext* c, ShapeHandle s0, ShapeHandle s1,
ShapeHandle* out) {
c->Relax(s0, s1, out);
}
void TestMergeHandles(bool input_not_output);
void TestRelaxHandles(bool input_not_output);
static constexpr int kVersion = 0; // used for graph-def version.
};
namespace {
TEST_F(ShapeInferenceTest, InputOutputByName) {
// Setup test to contain an input tensor list of size 3.
OpDef op_def = MakeOpDefWithLists();
NodeDef def;
auto s = NodeDefBuilder("dummy", &op_def)
.Attr("N", 3)
.Input(FakeInput(DT_FLOAT))
.Finalize(&def);
InferenceContext c(kVersion, def, op_def, {S({1, 5}), S({2, 5}), S({1, 3})},
{}, {}, {});
EXPECT_EQ("5", c.DebugString(c.NumElements(c.input(0))));
EXPECT_EQ("10", c.DebugString(c.NumElements(c.input(1))));
EXPECT_EQ("3", c.DebugString(c.NumElements(c.input(2))));
// Test getters.
std::vector<ShapeHandle> shapes;
EXPECT_THAT(
c.input("nonexistent", &shapes),
StatusIs(error::INVALID_ARGUMENT, HasSubstr("Unknown input name")));
TF_EXPECT_OK(c.input("input", &shapes));
EXPECT_EQ("[1,5]", c.DebugString(shapes[0]));
EXPECT_EQ("[2,5]", c.DebugString(shapes[1]));
EXPECT_EQ("[1,3]", c.DebugString(shapes[2]));
// Test setters.
EXPECT_THAT(
c.set_output("nonexistent", shapes),
StatusIs(error::INVALID_ARGUMENT, HasSubstr("Unknown output name")));
TF_EXPECT_OK(c.set_output("output", shapes));
EXPECT_EQ("5", c.DebugString(c.NumElements(c.output(0))));
EXPECT_EQ("10", c.DebugString(c.NumElements(c.output(1))));
EXPECT_EQ("3", c.DebugString(c.NumElements(c.output(2))));
}
static OpDef MakeOpDef(int num_inputs, int num_outputs) {
OpRegistrationData op_reg_data;
OpDefBuilder b("dummy");
for (int i = 0; i < num_inputs; ++i) {
b.Input(absl::StrCat("i", i, ": float"));
}
for (int i = 0; i < num_outputs; ++i) {
b.Output(absl::StrCat("o", i, ": float"));
}
CHECK(b.Attr("foo:string").Finalize(&op_reg_data).ok());
return op_reg_data.op_def;
}
TEST_F(ShapeInferenceTest, DimensionOrConstant) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(1, 1), {Unknown()}, {}, {}, {});
EXPECT_EQ(InferenceContext::kUnknownDim,
c.Value(InferenceContext::kUnknownDim));
EXPECT_EQ(1, c.Value(1));
#ifndef NDEBUG
// Only run death test if DCHECKS are enabled.
EXPECT_DEATH(c.Value(-7), "Dimension must be non\\-negative or equal to");
#endif
}
TEST_F(ShapeInferenceTest, Run) {
NodeDef def;
def.set_name("foo");
def.set_op("foo_op");
InferenceContext c(kVersion, def, MakeOpDef(1, 2), {S({1})}, {}, {}, {});
TF_ASSERT_OK(c.construction_status());
{
auto fn = [](InferenceContext* c) {
ShapeHandle h;
TF_RETURN_IF_ERROR(c->WithRankAtMost(c->input(0), 6, &h));
c->set_output(0, c->input(0));
c->set_output(1, c->input(0));
return absl::OkStatus();
};
TF_ASSERT_OK(c.Run(fn));
}
{
auto fn = [](InferenceContext* c) {
ShapeHandle h;
TF_RETURN_IF_ERROR(c->WithRankAtMost(c->input(0), 0, &h));
c->set_output(0, c->input(0));
c->set_output(1, c->input(0));
return absl::OkStatus();
};
// Extra error message is attached when Run fails.
EXPECT_THAT(
c.Run(fn),
StatusIs(error::INVALID_ARGUMENT,
AllOf(HasSubstr("Shape must be at most rank 0 but is rank 1"),
HasSubstr("node foo"), HasSubstr("foo_op"))));
}
}
// Tests different context data added when Run returns error.
TEST_F(ShapeInferenceTest, AttachContext) {
NodeDef def;
def.set_name("foo");
def.set_op("foo_op");
// Error when no constant tensors were requested.
{
InferenceContext c(kVersion, def, MakeOpDef(1, 2), {S({1, 2, 3})}, {}, {},
{});
TF_ASSERT_OK(c.construction_status());
auto fn = [](InferenceContext* c) {
ShapeHandle h;
TF_RETURN_IF_ERROR(c->WithRankAtMost(c->input(0), 0, &h));
c->set_output(0, c->input(0));
return absl::OkStatus();
};
EXPECT_THAT(
c.Run(fn),
StatusIs(error::INVALID_ARGUMENT,
AllOf(HasSubstr("Shape must be at most rank 0 but is rank 3"),
HasSubstr("node foo"), HasSubstr("foo_op"),
HasSubstr("input shapes: [1,2,3]"))));
}
// Error when a constant tensor value was requested.
{
Tensor input_t =
::tensorflow::test::AsTensor<float>({1.1, 2.2, 3.3, 4.4, 5.5});
InferenceContext c(kVersion, def, MakeOpDef(2, 2),
{S({1, 2, 3}), S({4, 5})}, {nullptr, &input_t}, {}, {});
TF_ASSERT_OK(c.construction_status());
auto fn = [](InferenceContext* c) {
c->input_tensor(0); // It's null - will not appear in the error message.
c->input_tensor(1); // This will appear in the error message.
ShapeHandle h;
TF_RETURN_IF_ERROR(c->WithRankAtMost(c->input(0), 0, &h));
c->set_output(0, c->input(0));
return absl::OkStatus();
};
EXPECT_THAT(
c.Run(fn),
StatusIs(error::INVALID_ARGUMENT,
AllOf(HasSubstr("Shape must be at most rank 0 but is rank 3"),
HasSubstr("node foo"), HasSubstr("foo_op"),
HasSubstr("input shapes: [1,2,3], [4,5] and with "
"computed input tensors: "
"input[1] = <1.1 2.2 3.3 4.4 5.5>."))));
}
// Error when a constant tensor value as shape was requested, but no partial
// shapes provided.
{
Tensor input_t = ::tensorflow::test::AsTensor<int32>({1, 2, 3, 4, 5});
InferenceContext c(kVersion, def, MakeOpDef(2, 2), {S({3}), S({4})},
{nullptr, &input_t}, {}, {});
TF_ASSERT_OK(c.construction_status());
auto fn = [](InferenceContext* c) {
ShapeHandle s;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(0, &s));
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(1, &s));
ShapeHandle h;
TF_RETURN_IF_ERROR(c->WithRankAtMost(c->input(0), 0, &h));
c->set_output(0, c->input(0));
return absl::OkStatus();
};
EXPECT_THAT(
c.Run(fn),
StatusIs(error::INVALID_ARGUMENT,
AllOf(HasSubstr("Shape must be at most rank 0 but is rank 1"),
HasSubstr("node foo"), HasSubstr("foo_op"),
HasSubstr("with input shapes: [3], [4] and with "
"computed input tensors: input[1] "
"= <1 2 3 4 5>."))));
}
// Error when a constant tensor value as shape was requested, and a partial
// shape was provided.
{
Tensor input_t = ::tensorflow::test::AsTensor<int32>({1, 2, 3, 4, 5});
InferenceContext c(kVersion, def, MakeOpDef(2, 2), {S({3}), S({4})},
{nullptr, &input_t}, {S({10, -1, 5}), Unknown()}, {});
TF_ASSERT_OK(c.construction_status());
auto fn = [](InferenceContext* c) {
ShapeHandle s;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(0, &s));
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(1, &s));
ShapeHandle h;
TF_RETURN_IF_ERROR(c->WithRankAtMost(c->input(0), 0, &h));
c->set_output(0, c->input(0));
return absl::OkStatus();
};
EXPECT_THAT(
c.Run(fn),
StatusIs(
error::INVALID_ARGUMENT,
AllOf(HasSubstr("Shape must be at most rank 0 but is rank 1"),
HasSubstr("node foo"), HasSubstr("foo_op"),
HasSubstr("with input shapes: [3], [4] and with computed "
"input tensors: input[1] = <1 2 3 4 5> and with "
"input tensors computed "
"as partial shapes: input[0] = [10,?,5]."))));
}
}
TEST_F(ShapeInferenceTest, RankAndDimInspection) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(3, 2),
{Unknown(), S({1, -1, 3}), S({})}, {}, {}, {});
EXPECT_EQ(3, c.num_inputs());
EXPECT_EQ(2, c.num_outputs());
auto in0 = c.input(0);
EXPECT_EQ("?", c.DebugString(in0));
EXPECT_FALSE(c.RankKnown(in0));
EXPECT_EQ(InferenceContext::kUnknownRank, c.Rank(in0));
EXPECT_EQ("?", c.DebugString(c.Dim(in0, 0)));
EXPECT_EQ("?", c.DebugString(c.Dim(in0, -1)));
EXPECT_EQ("?", c.DebugString(c.Dim(in0, 1000)));
auto in1 = c.input(1);
EXPECT_EQ("[1,?,3]", c.DebugString(in1));
EXPECT_TRUE(c.RankKnown(in1));
EXPECT_EQ(3, c.Rank(in1));
auto d = c.Dim(in1, 0);
EXPECT_EQ(1, c.Value(d));
EXPECT_TRUE(SameHandle(d, c.Dim(in1, -3)));
EXPECT_TRUE(c.ValueKnown(d));
EXPECT_EQ("1", c.DebugString(d));
d = c.Dim(in1, 1);
EXPECT_EQ(InferenceContext::kUnknownDim, c.Value(d));
EXPECT_FALSE(c.ValueKnown(d));
EXPECT_TRUE(SameHandle(d, c.Dim(in1, -2)));
EXPECT_EQ("?", c.DebugString(d));
d = c.Dim(in1, 2);
EXPECT_EQ(3, c.Value(d));
EXPECT_TRUE(SameHandle(d, c.Dim(in1, -1)));
EXPECT_TRUE(c.ValueKnown(d));
EXPECT_EQ("3", c.DebugString(d));
auto in2 = c.input(2);
EXPECT_EQ("[]", c.DebugString(in2));
EXPECT_TRUE(c.RankKnown(in2));
EXPECT_EQ(0, c.Rank(in2));
}
TEST_F(ShapeInferenceTest, NumElements) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(3, 2),
{Unknown(), S({1, -1, 3}), S({5, 4, 3, 2})}, {}, {}, {});
EXPECT_EQ("?", c.DebugString(c.NumElements(c.input(0))));
EXPECT_EQ("?", c.DebugString(c.NumElements(c.input(1))));
// Different handles (not the same unknown value).
EXPECT_FALSE(SameHandle(c.Dim(c.input(1), 1), c.NumElements(c.input(1))));
EXPECT_EQ("120", c.DebugString(c.NumElements(c.input(2))));
}
TEST_F(ShapeInferenceTest, WithRank) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(2, 2), {Unknown(), S({1, -1, 3})},
{}, {}, {});
auto in0 = c.input(0);
auto in1 = c.input(1);
ShapeHandle s1;
ShapeHandle s2;
// WithRank on a shape with unknown dimensionality always succeeds.
TF_EXPECT_OK(c.WithRank(in0, 1, &s1));
EXPECT_EQ("[?]", c.DebugString(s1));
TF_EXPECT_OK(c.WithRank(in0, 2, &s2));
EXPECT_EQ("[?,?]", c.DebugString(s2));
EXPECT_FALSE(SameHandle(s1, s2));
EXPECT_FALSE(SameHandle(c.Dim(s2, 0), c.Dim(s2, 1)));
TF_EXPECT_OK(c.WithRank(in0, 1, &s2));
EXPECT_EQ("[?]", c.DebugString(s2));
EXPECT_FALSE(SameHandle(s1, s2));
TF_EXPECT_OK(c.WithRank(in0, 0, &s1));
EXPECT_EQ("[]", c.DebugString(s1));
// WithRank on shape with known dimensionality.
s1 = in1;
EXPECT_THAT(c.WithRank(in1, 2, &s1),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Shape must be rank 2 but is rank 3")));
EXPECT_FALSE(IsSet(s1));
TF_EXPECT_OK(c.WithRank(in1, 3, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
// Inputs are unchanged.
EXPECT_EQ("?", c.DebugString(in0));
EXPECT_EQ("[1,?,3]", c.DebugString(in1));
}
TEST_F(ShapeInferenceTest, WithRankAtMost) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(2, 2), {Unknown(), S({1, -1, 3})},
{}, {}, {});
auto in0 = c.input(0);
auto in1 = c.input(1);
ShapeHandle s1;
ShapeHandle s2;
// WithRankAtMost on a shape with unknown dimensionality always succeeds.
TF_EXPECT_OK(c.WithRankAtMost(in0, 1, &s1));
EXPECT_EQ("?", c.DebugString(s1));
EXPECT_TRUE(SameHandle(in0, s1));
TF_EXPECT_OK(c.WithRankAtMost(in0, 2, &s2));
EXPECT_EQ("?", c.DebugString(s2));
EXPECT_TRUE(SameHandle(s1, s2));
// WithRankAtMost on shape with known dimensionality.
s1 = in1;
EXPECT_THAT(
c.WithRankAtMost(in1, 2, &s1),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Shape must be at most rank 2 but is rank 3")));
EXPECT_FALSE(IsSet(s1));
TF_EXPECT_OK(c.WithRankAtMost(in1, 3, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
TF_EXPECT_OK(c.WithRankAtMost(in1, 4, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
TF_EXPECT_OK(c.WithRankAtMost(in1, 5, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
// Inputs are unchanged.
EXPECT_EQ("?", c.DebugString(in0));
EXPECT_EQ("[1,?,3]", c.DebugString(in1));
}
TEST_F(ShapeInferenceTest, WithRankAtLeast) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(2, 2), {Unknown(), S({1, -1, 3})},
{}, {}, {});
auto in0 = c.input(0);
auto in1 = c.input(1);
ShapeHandle s1;
ShapeHandle s2;
// WithRankAtLeast on a shape with unknown dimensionality always succeeds.
TF_EXPECT_OK(c.WithRankAtLeast(in0, 1, &s1));
EXPECT_EQ("?", c.DebugString(s1));
EXPECT_TRUE(SameHandle(in0, s1));
TF_EXPECT_OK(c.WithRankAtLeast(in0, 2, &s2));
EXPECT_EQ("?", c.DebugString(s2));
EXPECT_TRUE(SameHandle(s1, s2));
// WithRankAtLeast on shape with known dimensionality.
s1 = in1;
EXPECT_THAT(
c.WithRankAtLeast(in1, 4, &s1),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Shape must be at least rank 4 but is rank 3")));
EXPECT_FALSE(IsSet(s1));
TF_EXPECT_OK(c.WithRankAtLeast(in1, 3, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
TF_EXPECT_OK(c.WithRankAtLeast(in1, 2, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
TF_EXPECT_OK(c.WithRankAtLeast(in1, 0, &s1));
EXPECT_TRUE(SameHandle(s1, in1));
// Inputs are unchanged.
EXPECT_EQ("?", c.DebugString(in0));
EXPECT_EQ("[1,?,3]", c.DebugString(in1));
}
TEST_F(ShapeInferenceTest, WithValue) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(1, 2), {S({1, -1})}, {}, {}, {});
auto d0 = c.Dim(c.input(0), 0);
auto d1 = c.Dim(c.input(0), 1);
DimensionHandle out1;
DimensionHandle out2;
// WithValue on a dimension with unknown value always succeeds.
TF_EXPECT_OK(c.WithValue(d1, 1, &out1));
EXPECT_EQ(1, c.Value(out1));
TF_EXPECT_OK(c.WithValue(d1, 2, &out2));
EXPECT_EQ(2, c.Value(out2));
EXPECT_FALSE(SameHandle(out1, out2));
EXPECT_FALSE(SameHandle(out1, d1));
TF_EXPECT_OK(c.WithValue(d1, 1, &out2));
EXPECT_EQ(1, c.Value(out2));
EXPECT_FALSE(SameHandle(out1, out2));
// WithValue on dimension with known size.
out1 = d0;
EXPECT_THAT(c.WithValue(d0, 0, &out1),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Dimension must be 0 but is 1")));
EXPECT_FALSE(IsSet(out1));
out1 = d0;
EXPECT_THAT(c.WithValue(d0, 2, &out1),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Dimension must be 2 but is 1")));
EXPECT_FALSE(IsSet(out1));
TF_EXPECT_OK(c.WithValue(d0, 1, &out1));
EXPECT_TRUE(SameHandle(d0, out1));
// Inputs are unchanged.
EXPECT_EQ("1", c.DebugString(d0));
EXPECT_EQ("?", c.DebugString(d1));
}
TEST_F(ShapeInferenceTest, MergeDim) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(1, 2), {S({2, -1, 2, 1, -1})}, {},
{}, {});
auto d2 = c.Dim(c.input(0), 0);
auto d_unknown = c.Dim(c.input(0), 1);
auto d2_b = c.Dim(c.input(0), 2);
auto d1 = c.Dim(c.input(0), 3);
auto d_unknown_b = c.Dim(c.input(0), 4);
DimensionHandle out;
// Merging anything with unknown returns the same pointer.
TF_EXPECT_OK(c.Merge(d2, d_unknown, &out));
EXPECT_TRUE(SameHandle(d2, out));
TF_EXPECT_OK(c.Merge(d_unknown, d2, &out));
EXPECT_TRUE(SameHandle(d2, out));
TF_EXPECT_OK(c.Merge(d_unknown, d_unknown_b, &out));
EXPECT_TRUE(SameHandle(d_unknown, out));
auto merged_dims = c.MergedDims();
ASSERT_EQ(3, merged_dims.size());
EXPECT_TRUE(merged_dims[0].first.SameHandle(d2));
EXPECT_TRUE(merged_dims[0].second.SameHandle(d_unknown));
EXPECT_TRUE(merged_dims[1].first.SameHandle(d_unknown));
EXPECT_TRUE(merged_dims[1].second.SameHandle(d2));
EXPECT_TRUE(merged_dims[2].first.SameHandle(d_unknown));
EXPECT_TRUE(merged_dims[2].second.SameHandle(d_unknown_b));
// Merging with self is a no-op and returns self.
TF_EXPECT_OK(c.Merge(d2, d2, &out));
EXPECT_TRUE(SameHandle(d2, out));
TF_EXPECT_OK(c.Merge(d_unknown, d_unknown, &out));
EXPECT_TRUE(SameHandle(d_unknown, out));
merged_dims = c.MergedDims();
EXPECT_EQ(3, merged_dims.size());
// Merging equal values is a no op and returns first one.
TF_EXPECT_OK(c.Merge(d2, d2_b, &out));
EXPECT_TRUE(SameHandle(d2, out));
TF_EXPECT_OK(c.Merge(d2_b, d2, &out));
EXPECT_TRUE(SameHandle(d2_b, out));
merged_dims = c.MergedDims();
EXPECT_EQ(3, merged_dims.size());
// Merging unequal values is an error.
EXPECT_THAT(c.Merge(d2, d1, &out),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Dimensions must be equal, but are 2 and 1")));
EXPECT_FALSE(IsSet(out));
EXPECT_THAT(c.Merge(d1, d2, &out),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Dimensions must be equal, but are 1 and 2")));
EXPECT_FALSE(IsSet(out));
merged_dims = c.MergedDims();
EXPECT_EQ(3, merged_dims.size());
}
TEST_F(ShapeInferenceTest, RelaxDim) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(1, 2),
{S({2, InferenceContext::kUnknownDim, 2, 1,
InferenceContext::kUnknownDim})},
{}, {}, {});
auto d2 = c.Dim(c.input(0), 0);
auto d_unknown = c.Dim(c.input(0), 1);
auto d2_b = c.Dim(c.input(0), 2);
auto d1 = c.Dim(c.input(0), 3);
auto d_unknown_b = c.Dim(c.input(0), 4);
DimensionHandle out;
// Relaxing anything with unknown returns a new unknown or the existing
// unknown.
Relax(&c, d2, d_unknown, &out);
EXPECT_TRUE(SameHandle(d_unknown, out));
EXPECT_FALSE(SameHandle(d_unknown_b, out));
EXPECT_EQ(InferenceContext::kUnknownDim, c.Value(out));
Relax(&c, d_unknown, d2, &out);
EXPECT_FALSE(SameHandle(d_unknown, out));
EXPECT_EQ(InferenceContext::kUnknownDim, c.Value(out));
Relax(&c, d_unknown, d_unknown_b, &out);
EXPECT_FALSE(SameHandle(d_unknown, out));
EXPECT_TRUE(SameHandle(d_unknown_b, out));
EXPECT_EQ(InferenceContext::kUnknownDim, c.Value(out));
// Relaxing with self returns self.
Relax(&c, d2, d2, &out);
EXPECT_TRUE(SameHandle(d2, out));
Relax(&c, d_unknown, d_unknown, &out);
EXPECT_TRUE(SameHandle(d_unknown, out));
// Relaxing equal values returns first one.
Relax(&c, d2, d2_b, &out);
EXPECT_TRUE(SameHandle(d2, out));
Relax(&c, d2_b, d2, &out);
EXPECT_TRUE(SameHandle(d2_b, out));
// Relaxing unequal values returns a new unknown.
Relax(&c, d2, d1, &out);
EXPECT_EQ(InferenceContext::kUnknownDim, c.Value(out));
Relax(&c, d1, d2, &out);
EXPECT_EQ(InferenceContext::kUnknownDim, c.Value(out));
}
TEST_F(ShapeInferenceTest, RelaxShape) {
NodeDef def;
InferenceContext c(
kVersion, def, MakeOpDef(7, 2),
{Unknown(), S({1, 2}), S({InferenceContext::kUnknownDim, 2}),
S({1, InferenceContext::kUnknownDim}), S({1, 3}), Unknown(), S({1})},
{}, {}, {});
auto s_unknown = c.input(0);
auto s_1_2 = c.input(1);
auto s_u_2 = c.input(2);
auto s_1_u = c.input(3);
auto s_1_3 = c.input(4);
auto s_unknown_b = c.input(5);
auto s_1 = c.input(6);
ShapeHandle out;
// Relaxing any shape with unknown returns a new unknown.
Relax(&c, s_unknown, s_1_2, &out);
EXPECT_FALSE(SameHandle(s_u_2, s_unknown));
EXPECT_EQ("?", c.DebugString(out));
Relax(&c, s_u_2, s_unknown, &out);
EXPECT_FALSE(SameHandle(s_u_2, out));
EXPECT_EQ("?", c.DebugString(out));
Relax(&c, s_unknown, s_unknown_b, &out);
EXPECT_FALSE(SameHandle(s_unknown, out));
EXPECT_TRUE(SameHandle(s_unknown_b, out));
EXPECT_EQ("?", c.DebugString(out));
// Relaxing with self returns self.
Relax(&c, s_1_2, s_1_2, &out);
EXPECT_TRUE(SameHandle(out, s_1_2));
// Relaxing where one of the inputs has less information.
out = ShapeHandle();
Relax(&c, s_1_2, s_u_2, &out);
EXPECT_FALSE(SameHandle(s_u_2, out));
EXPECT_EQ("[?,2]", c.DebugString(out));
out = ShapeHandle();
Relax(&c, s_u_2, s_1_2, &out);
EXPECT_FALSE(SameHandle(s_u_2, out));
EXPECT_EQ("[?,2]", c.DebugString(out));
// Relaxing where each input has one distinct unknown dimension.
Relax(&c, s_u_2, s_1_u, &out);
EXPECT_EQ("[?,?]", c.DebugString(out));
EXPECT_FALSE(SameHandle(c.Dim(s_u_2, 0), c.Dim(out, 0)));
EXPECT_TRUE(SameHandle(c.Dim(s_1_u, 1), c.Dim(out, 1)));
auto s_u1 = c.UnknownShapeOfRank(1);
auto s_u2 = c.UnknownShapeOfRank(1);
Relax(&c, s_u1, s_u2, &out);
EXPECT_FALSE(SameHandle(s_u1, out));
// Relaxing with mismatched values in a dimension returns a shape with that
// dimension unknown.
out = s_unknown;
Relax(&c, s_u_2, s_1_3, &out);
EXPECT_FALSE(SameHandle(c.Dim(s_u_2, 0), c.Dim(out, 0)));
EXPECT_EQ("[?,?]", c.DebugString(out));
out = s_unknown;
Relax(&c, s_1_3, s_u_2, &out);
EXPECT_TRUE(SameHandle(c.Dim(s_u_2, 0), c.Dim(out, 0)));
EXPECT_EQ("[?,?]", c.DebugString(out));
out = s_unknown;
// Relaxing with mismatched ranks returns a new unknown.
Relax(&c, s_1, s_1_2, &out);
EXPECT_EQ("?", c.DebugString(out));
}
TEST_F(ShapeInferenceTest, MergeShape) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(7, 2),
{Unknown(), S({1, 2}), S({-1, 2}), S({1, -1}), S({1, 3}),
Unknown(), S({1})},
{}, {}, {});
auto s_unknown = c.input(0);
auto s_1_2 = c.input(1);
auto s_u_2 = c.input(2);
auto s_1_u = c.input(3);
auto s_1_3 = c.input(4);
auto s_unknown_b = c.input(5);
auto s_1 = c.input(6);
ShapeHandle out;
// Merging any shape with unknown returns the shape.
TF_EXPECT_OK(c.Merge(s_unknown, s_1_2, &out));
EXPECT_TRUE(SameHandle(s_1_2, out));
TF_EXPECT_OK(c.Merge(s_u_2, s_unknown, &out));
EXPECT_TRUE(SameHandle(s_u_2, out));
TF_EXPECT_OK(c.Merge(s_unknown, s_unknown_b, &out));
EXPECT_TRUE(SameHandle(s_unknown, out));
auto merged_shapes = c.MergedShapes();
ASSERT_EQ(3, merged_shapes.size());
EXPECT_TRUE(merged_shapes[0].first.SameHandle(s_unknown));
EXPECT_TRUE(merged_shapes[0].second.SameHandle(s_1_2));
EXPECT_TRUE(merged_shapes[1].first.SameHandle(s_u_2));
EXPECT_TRUE(merged_shapes[1].second.SameHandle(s_unknown));
EXPECT_TRUE(merged_shapes[2].first.SameHandle(s_unknown));
EXPECT_TRUE(merged_shapes[2].second.SameHandle(s_unknown_b));
// Merging with self returns self.
TF_EXPECT_OK(c.Merge(s_1_2, s_1_2, &out));
EXPECT_TRUE(SameHandle(out, s_1_2));
merged_shapes = c.MergedShapes();
EXPECT_EQ(3, merged_shapes.size());
// Merging where one of the inputs is the right answer - return that input.
out = ShapeHandle();
TF_EXPECT_OK(c.Merge(s_1_2, s_u_2, &out));
EXPECT_TRUE(SameHandle(s_1_2, out));
out = ShapeHandle();
TF_EXPECT_OK(c.Merge(s_u_2, s_1_2, &out));
EXPECT_TRUE(SameHandle(s_1_2, out));
merged_shapes = c.MergedShapes();
ASSERT_EQ(5, merged_shapes.size());
EXPECT_TRUE(merged_shapes[3].first.SameHandle(s_1_2));
EXPECT_TRUE(merged_shapes[3].second.SameHandle(s_u_2));
EXPECT_TRUE(merged_shapes[4].first.SameHandle(s_u_2));
EXPECT_TRUE(merged_shapes[4].second.SameHandle(s_1_2));
// Merging where neither input is the right answer.
TF_EXPECT_OK(c.Merge(s_u_2, s_1_u, &out));
EXPECT_FALSE(SameHandle(out, s_u_2));
EXPECT_FALSE(SameHandle(out, s_1_u));
EXPECT_EQ("[1,2]", c.DebugString(out));
EXPECT_TRUE(SameHandle(c.Dim(s_1_u, 0), c.Dim(out, 0)));
EXPECT_TRUE(SameHandle(c.Dim(s_u_2, 1), c.Dim(out, 1)));
merged_shapes = c.MergedShapes();
ASSERT_EQ(7, merged_shapes.size());
EXPECT_TRUE(merged_shapes[5].first.SameHandle(s_u_2));
EXPECT_TRUE(merged_shapes[5].second.SameHandle(s_1_u));
EXPECT_TRUE(merged_shapes[6].first.SameHandle(s_u_2));
EXPECT_TRUE(merged_shapes[6].second.SameHandle(out));
auto s_u1 = c.UnknownShapeOfRank(1);
auto s_u2 = c.UnknownShapeOfRank(1);
TF_EXPECT_OK(c.Merge(s_u1, s_u2, &out));
EXPECT_TRUE(SameHandle(s_u1, out));
merged_shapes = c.MergedShapes();
ASSERT_EQ(8, merged_shapes.size());
EXPECT_TRUE(merged_shapes[7].first.SameHandle(s_u1));
EXPECT_TRUE(merged_shapes[7].second.SameHandle(s_u2));
// Incompatible merges give errors and set out to nullptr.
out = s_unknown;
EXPECT_THAT(
c.Merge(s_u_2, s_1_3, &out),
StatusIs(
error::INVALID_ARGUMENT,
HasSubstr(
"Dimension 1 in both shapes must be equal, but are 2 and 3")));
EXPECT_FALSE(IsSet(out));
out = s_unknown;
EXPECT_THAT(
c.Merge(s_1_3, s_u_2, &out),
StatusIs(
error::INVALID_ARGUMENT,
HasSubstr(
"Dimension 1 in both shapes must be equal, but are 3 and 2")));
EXPECT_FALSE(IsSet(out));
out = s_unknown;
EXPECT_THAT(
c.Merge(s_1, s_1_2, &out),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Shapes must be equal rank, but are 1 and 2")));
EXPECT_FALSE(IsSet(out));
merged_shapes = c.MergedShapes();
EXPECT_EQ(8, merged_shapes.size());
}
TEST_F(ShapeInferenceTest, MergePrefix) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(4, 2),
{
Unknown(),
S({-1, 2}),
S({1, -1, 3}),
S({2, 4}),
},
{}, {}, {});
auto s_unknown = c.input(0);
auto s_u_2 = c.input(1);
auto s_1_u_3 = c.input(2);
auto s_2_4 = c.input(3);
ShapeHandle s_out;
ShapeHandle s_prefix_out;
// Merging with unknown returns the inputs.
TF_EXPECT_OK(c.MergePrefix(s_unknown, s_u_2, &s_out, &s_prefix_out));
EXPECT_TRUE(SameHandle(s_out, s_unknown));
EXPECT_TRUE(SameHandle(s_prefix_out, s_u_2));
TF_EXPECT_OK(c.MergePrefix(s_1_u_3, s_unknown, &s_out, &s_prefix_out));
EXPECT_TRUE(SameHandle(s_out, s_1_u_3));
EXPECT_TRUE(SameHandle(s_prefix_out, s_unknown));
TF_EXPECT_OK(c.MergePrefix(s_1_u_3, s_u_2, &s_out, &s_prefix_out));
EXPECT_FALSE(SameHandle(s_out, s_1_u_3));
EXPECT_EQ("[1,2]", c.DebugString(s_prefix_out));
EXPECT_EQ("[1,2,3]", c.DebugString(s_out));
EXPECT_TRUE(SameHandle(c.Dim(s_prefix_out, 0), c.Dim(s_out, 0)));
EXPECT_TRUE(SameHandle(c.Dim(s_out, 0), c.Dim(s_1_u_3, 0)));
EXPECT_TRUE(SameHandle(c.Dim(s_prefix_out, 1), c.Dim(s_out, 1)));
EXPECT_TRUE(SameHandle(c.Dim(s_prefix_out, 1), c.Dim(s_u_2, 1)));
// Incompatible merges give errors and set outs to nullptr.
s_out = s_unknown;
s_prefix_out = s_unknown;
EXPECT_THAT(c.MergePrefix(s_1_u_3, s_2_4, &s_out, &s_prefix_out),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Dimensions must be equal, but are 1 and 2")));
EXPECT_FALSE(IsSet(s_out));
EXPECT_FALSE(IsSet(s_prefix_out));
s_out = s_unknown;
s_prefix_out = s_unknown;
EXPECT_THAT(
c.MergePrefix(s_2_4, s_1_u_3, &s_out, &s_prefix_out),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Shape must be at least rank 3 but is rank 2")));
EXPECT_FALSE(IsSet(s_out));
EXPECT_FALSE(IsSet(s_prefix_out));
}
TEST_F(ShapeInferenceTest, Subshape) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(2, 2),
{S({1, 2, 3, -1, 5}), Unknown()}, {}, {}, {});
ShapeHandle unknown = c.input(1);
ShapeHandle out;
TF_EXPECT_OK(c.Subshape(unknown, 0, &out));
EXPECT_EQ("?", c.DebugString(out));
EXPECT_TRUE(SameHandle(out, unknown));
TF_EXPECT_OK(c.Subshape(unknown, 1, &out));
EXPECT_EQ("?", c.DebugString(out));
EXPECT_FALSE(SameHandle(out, unknown));
TF_EXPECT_OK(c.Subshape(unknown, 200, &out));
EXPECT_EQ("?", c.DebugString(out));
EXPECT_FALSE(SameHandle(out, unknown));
const int kFullRank = 5;
ShapeHandle out_arr[4];
auto in0 = c.input(0);
TF_EXPECT_OK(c.Subshape(in0, 0, &out));
EXPECT_EQ("[1,2,3,?,5]", c.DebugString(out));
EXPECT_TRUE(SameHandle(out, in0));
EXPECT_EQ(kFullRank, c.Rank(out));
for (int start = 0; start <= kFullRank + 1; ++start) {
for (int end = start; end <= kFullRank + 1; ++end) {
// Get subshapes using different start and end values that give the same
// range.
const int neg_start =
start >= kFullRank ? kFullRank : (start - kFullRank);
const int neg_end = end >= kFullRank ? kFullRank : (end - kFullRank);
TF_ASSERT_OK(c.Subshape(in0, start, end, &out_arr[0]));
TF_ASSERT_OK(c.Subshape(in0, neg_start, end, &out_arr[1]));
TF_ASSERT_OK(c.Subshape(in0, start, neg_end, &out_arr[2]));
TF_ASSERT_OK(c.Subshape(in0, neg_start, neg_end, &out_arr[3]));
// Verify all computed subshapes.
for (int arr_idx = 0; arr_idx < 4; ++arr_idx) {
out = out_arr[arr_idx];
ASSERT_EQ(std::min(kFullRank, end) - std::min(kFullRank, start),
c.Rank(out))
<< "start: " << start << " end: " << end << " arr_idx: " << arr_idx
<< " in0: " << c.DebugString(in0) << " out: " << c.DebugString(out);
for (int d = 0; d < c.Rank(out); ++d) {
EXPECT_TRUE(SameHandle(c.Dim(in0, start + d), c.Dim(out, d)))
<< "arr_idx: " << arr_idx;
}
}
}
}
// Errors.
out = unknown;
EXPECT_THAT(
c.Subshape(in0, 6, -3, &out),
StatusIs(error::INVALID_ARGUMENT,
HasSubstr("Subshape must have computed start <= end, but is 5 "
"and 2 (computed from start 6 and end -3 over shape "
"with rank 5)")));
EXPECT_FALSE(IsSet(out));
out = unknown;
EXPECT_THAT(
c.Subshape(in0, -50, 100, &out),
StatusIs(
error::INVALID_ARGUMENT,
HasSubstr(
"Subshape start out of bounds: -50, for shape with rank 5")));
EXPECT_FALSE(IsSet(out));
out = unknown;
EXPECT_THAT(
c.Subshape(in0, 0, -50, &out),
StatusIs(
error::INVALID_ARGUMENT,
HasSubstr("Subshape end out of bounds: -50, for shape with rank 5")));
EXPECT_FALSE(IsSet(out));
}
TEST_F(ShapeInferenceTest, Concatenate) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(3, 2),
{S({1, -1, 3}), S({4, 5}), Unknown()}, {}, {}, {});
auto in0 = c.input(0);
auto in1 = c.input(1);
ShapeHandle unknown = c.input(2);
ShapeHandle out;
TF_EXPECT_OK(c.Concatenate(unknown, unknown, &out));
EXPECT_EQ("?", c.DebugString(out));
EXPECT_FALSE(SameHandle(out, unknown));
TF_EXPECT_OK(c.Concatenate(unknown, in0, &out));
EXPECT_EQ("?", c.DebugString(out));
EXPECT_FALSE(SameHandle(out, unknown));
TF_EXPECT_OK(c.Concatenate(in0, in1, &out));
EXPECT_EQ("[1,?,3,4,5]", c.DebugString(out));
int out_i = 0;
for (int i = 0; i < c.Rank(in0); ++i, ++out_i) {
EXPECT_TRUE(SameHandle(c.Dim(in0, i), c.Dim(out, out_i)));
}
for (int i = 0; i < c.Rank(in1); ++i, ++out_i) {
EXPECT_TRUE(SameHandle(c.Dim(in1, i), c.Dim(out, out_i)));
}
}
TEST_F(ShapeInferenceTest, ReplaceDim) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(2, 0), {S({1, 2, 3}), Unknown()},
{}, {}, {});
auto in = c.input(0);
auto unknown = c.input(1);
ShapeHandle replaced;
TF_EXPECT_OK(c.ReplaceDim(in, 0, c.Dim(in, 1), &replaced));
EXPECT_EQ("[2,2,3]", c.DebugString(replaced));
TF_EXPECT_OK(c.ReplaceDim(in, 2, c.Dim(in, 1), &replaced));
EXPECT_EQ("[1,2,2]", c.DebugString(replaced));
TF_EXPECT_OK(c.ReplaceDim(in, 1, c.Dim(in, 2), &replaced));
EXPECT_EQ("[1,3,3]", c.DebugString(replaced));
TF_EXPECT_OK(c.ReplaceDim(unknown, 0, c.Dim(in, 1), &replaced));
EXPECT_EQ("?", c.DebugString(replaced));
// Negative indexing.
TF_EXPECT_OK(c.ReplaceDim(in, -1, c.Dim(in, 1), &replaced));
EXPECT_EQ("[1,2,2]", c.DebugString(replaced));
TF_EXPECT_OK(c.ReplaceDim(unknown, -1, c.Dim(in, 1), &replaced));
EXPECT_EQ("?", c.DebugString(replaced));
// out of range indexing.
EXPECT_THAT(
c.ReplaceDim(in, 3, c.Dim(in, 1), &replaced),
StatusIs(error::INVALID_ARGUMENT, HasSubstr("Out of range dim_index")));
EXPECT_FALSE(IsSet(replaced));
replaced = in;
EXPECT_THAT(
c.ReplaceDim(in, -4, c.Dim(in, 1), &replaced),
StatusIs(error::INVALID_ARGUMENT, HasSubstr("Out of range dim_index")));
EXPECT_FALSE(IsSet(replaced));
}
TEST_F(ShapeInferenceTest, MakeShape) {
NodeDef def;
InferenceContext c(kVersion, def, MakeOpDef(1, 2), {S({1, 2, 3, -1, 5})}, {},
{}, {});
std::vector<DimensionHandle> dims;
auto in0 = c.input(0);
const int rank = c.Rank(in0);
dims.reserve(rank);
for (int i = 0; i < rank; ++i) {
dims.push_back(c.Dim(in0, rank - i - 1));
}