forked from ktorch/ktorch
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathknn.cpp
More file actions
2288 lines (2119 loc) · 123 KB
/
Copy pathknn.cpp
File metadata and controls
2288 lines (2119 loc) · 123 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
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
#include "ktorch.h"
#include "knn.h"
namespace nn=torch::nn;
namespace fnn=torch::nn::functional;
// ---------------------------------------------------------------------------
// mname_ - given module reference, return access to private, optional name
// mname - given module reference return optional name
// - also, given layer variant/layer ptr, return name or null ptr
// mlabel - demangle and simplify module type for use in error messages
// ---------------------------------------------------------------------------
const
c10::optional<std::string>& mname_(const Module& m) {return access_private::name_(m);}
c10::optional<std::string>& mname_( Module& m) {return access_private::name_(m);}
S mname(const Module& m) {auto& s=access_private::name_(m); return const_cast<char*>(s ? (*s).c_str() : nullptr);}
std::string mlabel(const char *c) {
auto s=c10::demangle(c);
if(!s.find("struct ")) s.erase(s.begin(),s.begin()+7);
if(!s.find("class ")) s.erase(s.begin(),s.begin()+6);
if(!s.find("torch::nn::")) s.erase(s.begin(),s.begin()+11);
if(s.find("Impl",s.size()-4)==s.size()-4) s.erase(s.size()-4,s.size());
return s;
}
std::string mlabel(const Module& x) {
return mlabel(typeid(x).name());
}
std::string mlabel(const Moduleptr& x) {return mlabel(*x);}
std::string mlabel(Kmodule* x) {return mlabel(x->m);}
// ------------------------------------------------------------------
// argstart - return offset in k list to begin processing module args
// ------------------------------------------------------------------
J argstart(K x,S s) {return !x ? -1 : (xdict(x) ? 0 : (s ? 2 : 1));}
// ----------------------------------------------------------------------------
// msym - map to/from sym & enum for module, e.g. `conv3d <-> Cast::conv3d
// msyms - parse module & optional name from k arg(s), throw error if not found
// ----------------------------------------------------------------------------
S msym(Cast c) {
for(auto& m:env().modules) if(c==std::get<1>(m)) return std::get<0>(m);
TORCH_ERROR("unrecognized module: cannot translate enumeration ",(I)c," to symbol");
}
Cast msym(S s) {
for(const auto& m:env().modules) if(s==std::get<0>(m)) return std::get<1>(m);
TORCH_ERROR("unrecognized module type: `",s);
}
void msyms(K x,S& s,S& nm) {
nm=nullptr;
if(x->t == -KS) {
s=x->s;
} else if(x->t == KS) {
TORCH_CHECK(x->n>0, "module: empty symbol list");
s=kS(x)[0];
if(x->n>1) nm=kS(x)[1];
} else if(!x->t) {
TORCH_CHECK(x->n>0, "module: empty list");
TORCH_CHECK(kK(x)[0]->t==-KS, "module: no symbol found, ",kstring(x));
s=kK(x)[0]->s;
if(x->n>1 && kK(x)[1]->t==-KS) nm=kK(x)[1]->s;
} else {
TORCH_ERROR("module: unrecognized arg(s), ", kstring(x));
}
}
// -----------------------------------------------------------------------------------
// mkeys - keys for dict/table of module state: `depth`module`name`options`parms`buffers
// -----------------------------------------------------------------------------------
static K mkeys(bool b) {
K x=ktn(KS, b ? 6 : 4);
kS(x)[0]=statekey(State::depth);
kS(x)[1]=statekey(State::module);
kS(x)[2]=statekey(State::name);
kS(x)[3]=statekey(State::options);
if(b) {
kS(x)[4]=statekey(State::parms);
kS(x)[5]=statekey(State::buffers);
}
return x;
}
// ---------------------------------------------------------------------------
// mcast - given generic module/ptr, return api enumeration, e.g. Cast::linear
// mcast - given module ptr and flag, true returns first else last child
// msym - given generic module, return api symbol, e.g. `linear
// ---------------------------------------------------------------------------
static Cast mcast(size_t h) {
for(const auto& m:env().modules)
if(std::get<2>(m)==h) return std::get<1>(m);
return Cast::undefined;
}
Cast mcast(const Module& m) {
return m.as<knn::Callback>() ? Cast::callback : mcast(typeid(m).hash_code());
}
Cast mcast(const Moduleptr& m) {return mcast(*m);}
Cast mcast(const Moduleptr& m,bool b) {
const auto& v=m->children();
return v.size() ? mcast(b ? v.front() : v.back(),b) : mcast(*m);
}
static S msym(size_t h) {
for(const auto& m:env().modules)
if(std::get<2>(m)==h) return std::get<0>(m);
return nullsym();
}
S msym(const Module& m) {return msym(typeid(m).hash_code());}
// ---------------------------------------------------------------------------
// findtensor - given module & parm/buffer name, return tensor pointer or null
// --------------------------------------------------------------------------
static const Tensor *findtensor(const Module& m,const std::string& s,bool p) {
if(p) {
if(const auto *t=access_private::parameters_(m).find(s))
return t;
} else {
if(const auto *t=access_private::buffers_(m).find(s))
return t;
}
auto n=s.find_first_of('.');
if(n==std::string::npos)
return nullptr;
for(const auto& a:access_private::children_(m)) {
if(!s.rfind(a.key(),0) && n==a.key().size()) {
if(const auto* t=findtensor(*a.value(), s.substr(1+n), p))
return t;
}
}
return nullptr;
}
const Tensor *findtensor(const Module& m,const std::string& s,Cast c) {
const Tensor *t;
switch(c) {
case Cast::parameter: t=findtensor(m,s,true); break;
case Cast::buffer: t=findtensor(m,s,false); break;
case Cast::tensor: if(!(t=findtensor(m,s,true))) t=findtensor(m,s,false); break;
default: TORCH_ERROR("invalid tensor type, expecting tensor, parameter, or buffer");
}
return t;
}
// -------------------------------------------------------------------------------
// hasforward - return true if module has a non-templatized forward method defined
// forwardfind - look in module children for first/last module w'forward calc
// forwardoptions - define result,args and other properies of forward() function
// -------------------------------------------------------------------------------
static bool hasforward(Cast c) {
switch(c) {
case Cast::sequential:
case Cast::callback:
case Cast::moduledict:
case Cast::modulelist:
case Cast::parmdict:
return false;
default:
return true;
}
}
static void forwardfind(bool b,ForwardOptions& f,const Module& m) {
auto h=typeid(m).hash_code(); // run-time type of module
for(const auto& a:env().modules) {
if(std::get<2>(a)==h) {
if(std::get<4>(a)) { // if module has non-templatized forward
if(b) { // module in sequence that recieves input
f.in(std::get<1>(a)); // get enumeration of input module type
f.n(std::get<6>(a)); // get minimum required number of arguments
f.m(std::get<7>(a)); // get maximum required number of arguments
f.a(std::move(std::get<8>(a))); // get argument type(s)
} else {
f.f(true); // module in sequence that returns output
f.out(std::get<1>(a)); // get enumeration of output model type
f.r(std::get<5>(a)); // get result type
}
return;
} else {
auto const& x=access_private::children_(m);
if(x.size())
forwardfind(b, f, *(b ? x.front() : x.back()).value());
return;
}
}
}
TORCH_ERROR("unable to determine forward calculation for ",mlabel(m));
}
void forwardoptions(Cast c,ForwardOptions& f,const Module& m) {
if(hasforward(c)) { // module has non-templatized forward call,
for(const auto& a:env().modules)
if(std::get<1>(a)==c) {
f.in(c);
f.out(c);
TORCH_CHECK(std::get<4>(a), msym(c),": mismatch in module attributes, forward flag");
f.f(true);
f.r(std::get<5>(a));
f.n(std::get<6>(a));
f.m(std::get<7>(a));
f.a(std::move(std::get<8>(a)));
}
} else if(c==Cast::callback) { // callback has templatized forward, but more information
const auto& o=m.as<knn::Callback>()->options;
f.in(c);
f.out(c);
f.f(true);
f.r(o.out());
f.a(o.in());
f.n(f.a().size());
} else {
auto const& x=access_private::children_(m);
if(x.size()) {
forwardfind(true, f, *x.front().value());
forwardfind(false, f, *x.back().value());
}
}
}
// --------------------------------------------------------------------
// callbacks - return a list of callbacks based on result type & arg(s)
// fattr - placeholder function for functional calls without modules
// fwdattr - if non-templatized forward() derive result & arg types
// attrs - get attributes for modules
// moduleattrs - return list of all module attributes (for global env)
// --------------------------------------------------------------------
Callbacks callbacks() {return knn::callbacks();}
static Attrs fattr(size_t n,S s,Cast c,const char*d,const std::type_info& t) {
return std::make_tuple(s, c, t.hash_code(), d, true, Arg::tensor, n, n, Args{Arg::tensor});
}
template<class M,class R,class... A> static Attrs fwdattr(size_t n,S s,Cast c,const char *d,size_t h,R (M::*)(A...)) {
auto m=sizeof...(A);
static_assert(torch::detail::check_not_lvalue_references<A...>(), "module arg(s) must not take non-const references (use pointers)");
static_assert(!std::is_void<R>::value, "module forward calculation returns void (use dummy arg)");
if(!n) n=m;
return std::make_tuple(s, c, h, d, true, knn::argmap<R>(), n, m, knn::argvector<A...>());
}
template <class M,typename std::enable_if_t<!torch::detail::has_forward<M>::value>* = nullptr>
static Attrs attrs(size_t n,S s,Cast c,const char*d) {
return std::make_tuple(s, c, typeid(M).hash_code(), d, false, Arg::tensor, n, n, Args{Arg::tensor});
}
template <class M,typename std::enable_if_t<torch::detail::has_forward<M>::value>* = nullptr>
static Attrs attrs(size_t n,S s,Cast c,const char*d) {
return fwdattr(n, s, c, d, typeid(M).hash_code(), &M::forward);
}
// non-tensor arguments to forward() call:
// MultiHeadAttention uses a boolean flag
// ConvTranspose[1-3]d uses IntArrayRef for output size
// LSTM uses optional tuple with hidden state
// MaxPool and AdaptiveMaxPool have std::tuple<Tensor, Tensor> forward_with_indices(const Tensor& input);
// MaxUnpool has Tensor forward(const Tensor& input, const Tensor& indices, const c10::optional<std::vector<int64_t>>& output_size = c10::nullopt);
ModuleAttrs moduleattrs() {
return {{
attrs<nn::AdaptiveAvgPool1dImpl> (0, cs("adaptavg1d"), Cast::adaptavg1d, "torch.nn.AdaptiveAvgPool1d"),
attrs<nn::AdaptiveAvgPool2dImpl> (0, cs("adaptavg2d"), Cast::adaptavg2d, "torch.nn.AdaptiveAvgPool2d"),
attrs<nn::AdaptiveAvgPool3dImpl> (0, cs("adaptavg3d"), Cast::adaptavg3d, "torch.nn.AdaptiveAvgPool3d"),
attrs<nn::AdaptiveMaxPool1dImpl> (0, cs("adaptmax1d"), Cast::adaptmax1d, "torch.nn.AdaptiveMaxPool1d"),
attrs<nn::AdaptiveMaxPool2dImpl> (0, cs("adaptmax2d"), Cast::adaptmax2d, "torch.nn.AdaptiveMaxPool2d"),
attrs<nn::AdaptiveMaxPool3dImpl> (0, cs("adaptmax3d"), Cast::adaptmax3d, "torch.nn.AdaptiveMaxPool3d"),
attrs<nn::AlphaDropoutImpl> (0, cs("adrop"), Cast::adrop, "torch.nn.AlphaDropout"),
attrs<nn::MultiheadAttentionImpl> (3, cs("attention"), Cast::attention, "torch.nn.MultiheadAttention"),
attrs<nn::AvgPool1dImpl> (0, cs("avgpool1d"), Cast::avgpool1d, "torch.nn.AvgPool1d"),
attrs<nn::AvgPool2dImpl> (0, cs("avgpool2d"), Cast::avgpool2d, "torch.nn.AvgPool2d"),
attrs<nn::AvgPool3dImpl> (0, cs("avgpool3d"), Cast::avgpool3d, "torch.nn.AvgPool3d"),
attrs<nn::BatchNorm1dImpl> (0, cs("batchnorm1d"), Cast::batchnorm1d, "torch.nn.BatchNorm1d"),
attrs<nn::BatchNorm2dImpl> (0, cs("batchnorm2d"), Cast::batchnorm2d, "torch.nn.BatchNorm2d"),
attrs<nn::BatchNorm3dImpl> (0, cs("batchnorm3d"), Cast::batchnorm3d, "torch.nn.BatchNorm3d"),
attrs<nn::BilinearImpl> (0, cs("bilinear"), Cast::bilinear, "torch.nn.Bilinear"),
attrs<knn::CallbackImpl> (1, cs("callback"), Cast::callback, "knn.Callback"),
attrs<knn::CatImpl> (0, cs("cat"), Cast::cat, "torch.cat"),
attrs<nn::CELUImpl> (0, cs("celu"), Cast::celu, "torch.nn.CELU"),
attrs<nn::Conv1dImpl> (0, cs("conv1d"), Cast::conv1d, "torch.nn.Conv1d"),
attrs<nn::Conv2dImpl> (0, cs("conv2d"), Cast::conv2d, "torch.nn.Conv2d"),
attrs<nn::Conv3dImpl> (0, cs("conv3d"), Cast::conv3d, "torch.nn.Conv3d"),
attrs<nn::ConvTranspose1dImpl> (1, cs("convtranspose1d"), Cast::convtranspose1d, "torch.nn.ConvTranspose1d"),
attrs<nn::ConvTranspose2dImpl> (1, cs("convtranspose2d"), Cast::convtranspose2d, "torch.nn.ConvTranspose2d"),
attrs<nn::ConvTranspose3dImpl> (1, cs("convtranspose3d"), Cast::convtranspose3d, "torch.nn.ConvTranspose3d"),
attrs<nn::CrossMapLRN2dImpl> (0, cs("crossmap2d"), Cast::crossmap2d, "torch.nn.CrossMapLRN2d"),
attrs<nn::TransformerDecoderImpl> (2, cs("decoder"), Cast::decoder, "torch.nn.TransformerDecoder"),
attrs<nn::TransformerDecoderLayerImpl>(2, cs("decoderlayer"), Cast::decoderlayer, "torch.nn.TransformerDecoderLayer"),
attrs<nn::DropoutImpl> (0, cs("drop"), Cast::drop, "torch.nn.Dropout"),
attrs<nn::Dropout2dImpl> (0, cs("drop2d"), Cast::drop2d, "torch.nn.Dropout2d"),
attrs<nn::Dropout3dImpl> (0, cs("drop3d"), Cast::drop3d, "torch.nn.Dropout3d"),
attrs<knn::DropPathImpl> (0, cs("droppath"), Cast::droppath, "knn.DropPath"),
attrs<nn::ELUImpl> (0, cs("elu"), Cast::elu, "torch.nn.ELU"),
attrs<nn::EmbeddingImpl> (0, cs("embed"), Cast::embed, "torch.nn.Embedding"),
attrs<nn::EmbeddingBagImpl> (1, cs("embedbag"), Cast::embedbag, "torch.nn.EmbeddingBag"),
attrs<knn::EmbedPositionImpl> (0, cs("embedpos"), Cast::embedpos, "knn.EmbedPosition"),
attrs<knn::EmbedSequenceImpl> (0, cs("embedseq"), Cast::embedseq, "knn.EmbedSequence"),
attrs<nn::TransformerEncoderImpl> (1, cs("encoder"), Cast::encoder, "torch.nn.TransformerEncoder"),
attrs<nn::TransformerEncoderLayerImpl>(1, cs("encoderlayer"), Cast::encoderlayer, "torch.nn.TransformerEncoderLayer"),
attrs<knn::ExpandImpl> (0, cs("expand"), Cast::expand, "torch.Tensor.expand"),
attrs<nn::FeatureAlphaDropoutImpl> (0, cs("fadrop"), Cast::fadrop, "torch.nn.FeatureAlphaDropout"),
attrs<nn::FlattenImpl> (0, cs("flatten"), Cast::flatten, "torch.nn.Flatten"),
attrs<nn::FractionalMaxPool2dImpl> (0, cs("fmaxpool2d"), Cast::fmaxpool2d, "torch.nn.FractionalMaxPool2d"),
attrs<nn::FractionalMaxPool3dImpl> (0, cs("fmaxpool3d"), Cast::fmaxpool3d, "torch.nn.FractionalMaxPool3d"),
attrs<nn::FoldImpl> (0, cs("fold"), Cast::fold, "torch.nn.Fold"),
attrs<knn::ForkImpl> (0, cs("fork"), Cast::fork, "knn.Fork"),
attrs<nn::GELUImpl> (0, cs("gelu"), Cast::gelu, "torch.nn.GELU"),
attrs<nn::GLUImpl> (0, cs("glu"), Cast::glu, "torch.nn.GLU"),
attrs<nn::GroupNormImpl> (0, cs("groupnorm"), Cast::groupnorm, "torch.nn.GroupNorm"),
attrs<nn::GRUImpl> (1, cs("gru"), Cast::gru, "torch.nn.GRU"),
attrs<nn::HardshrinkImpl> (0, cs("hardshrink"), Cast::hardshrink, "torch.nn.Hardshrink"),
attrs<nn::HardtanhImpl> (0, cs("hardtanh"), Cast::hardtanh, "torch.nn.Hardtanh"),
attrs<nn::IdentityImpl> (0, cs("identity"), Cast::identity, "torch.nn.Identity"),
attrs<knn::IndexSelectImpl> (0, cs("indexselect"), Cast::indexselect, "torch.index_select"),
attrs<nn::InstanceNorm1dImpl> (0, cs("instancenorm1d"), Cast::instancenorm1d, "torch.nn.InstanceNorm1d"),
attrs<nn::InstanceNorm2dImpl> (0, cs("instancenorm2d"), Cast::instancenorm2d, "torch.nn.InstanceNorm2d"),
attrs<nn::InstanceNorm3dImpl> (0, cs("instancenorm3d"), Cast::instancenorm3d, "torch.nn.InstanceNorm3d"),
fattr (1, cs("interpolate"), Cast::interpolate, "torch.nn.functional.interpolate", typeid(fnn::interpolate)),
attrs<nn::LayerNormImpl> (0, cs("layernorm"), Cast::layernorm, "torch.nn.LayerNorm"),
attrs<nn::LeakyReLUImpl> (0, cs("leakyrelu"), Cast::leakyrelu, "torch.nn.LeakyReLU"),
attrs<nn::LinearImpl> (0, cs("linear"), Cast::linear, "torch.nn.Linear"),
attrs<nn::LocalResponseNormImpl> (0, cs("localnorm"), Cast::localnorm, "torch.nn.LocalResponseNorm"),
attrs<nn::LogSigmoidImpl> (0, cs("logsigmoid"), Cast::logsigmoid, "torch.nn.LogSigmoid"),
attrs<nn::LogSoftmaxImpl> (0, cs("logsoftmax"), Cast::logsoftmax, "torch.nn.LogSoftmax"),
attrs<nn::LPPool1dImpl> (0, cs("lppool1d"), Cast::lppool1d, "torch.nn.LPPool1d"),
attrs<nn::LPPool2dImpl> (0, cs("lppool2d"), Cast::lppool2d, "torch.nn.LPPool2d"),
attrs<nn::LSTMImpl> (1, cs("lstm"), Cast::lstm, "torch.nn.LSTM"),
attrs<knn::MatmulImpl> (0, cs("matmul"), Cast::matmul, "torch.matmul"),
attrs<nn::MaxPool1dImpl> (0, cs("maxpool1d"), Cast::maxpool1d, "torch.nn.MaxPool1d"),
attrs<nn::MaxPool2dImpl> (0, cs("maxpool2d"), Cast::maxpool2d, "torch.nn.MaxPool2d"),
attrs<nn::MaxPool3dImpl> (0, cs("maxpool3d"), Cast::maxpool3d, "torch.nn.MaxPool3d"),
attrs<nn::MishImpl> (0, cs("mish"), Cast::mish, "torch.nn.Mish"),
attrs<nn::ModuleDictImpl> (0, cs("moduledict"), Cast::moduledict, "torch.nn.ModuleDict"),
attrs<nn::ModuleListImpl> (0, cs("modulelist"), Cast::modulelist, "torch.nn.ModuleList"),
attrs<knn::MulImpl> (0, cs("mul"), Cast::mul, "torch.mul"),
attrs<knn::NBeatsImpl> (0, cs("nbeats"), Cast::nbeats, "knn.NBeats"),
fattr (1, cs("normalize"), Cast::normalize, "torch.nn.functional.normalize", typeid(fnn::normalize)),
attrs<knn::OneHotImpl> (0, cs("onehot"), Cast::onehot, "torch.nn.functional.one_hot"),
attrs<knn::PadImpl> (0, cs("pad"), Cast::pad, "torch.nn.functional.pad"),
attrs<nn::ConstantPad1dImpl> (0, cs("pad1d"), Cast::pad1d, "torch.nn.ConstantPad1d"),
attrs<nn::ConstantPad2dImpl> (0, cs("pad2d"), Cast::pad2d, "torch.nn.ConstantPad2d"),
attrs<nn::ConstantPad3dImpl> (0, cs("pad3d"), Cast::pad3d, "torch.nn.ConstantPad3d"),
attrs<nn::PairwiseDistanceImpl> (0, cs("pairwise"), Cast::pairwise, "torch.nn.PairwiseDistance"),
attrs<nn::ParameterDictImpl> (0, cs("parmdict"), Cast::parmdict, "torch.nn.ParameterDict"),
attrs<knn::PermuteImpl> (0, cs("permute"), Cast::permute, "torch.permute"),
attrs<nn::PReLUImpl> (0, cs("prelu"), Cast::prelu, "torch.nn.PReLU"),
attrs<knn::RandomCropImpl> (0, cs("randomcrop"), Cast::randomcrop, "torchvision.transforms"),
attrs<knn::RandomFlipImpl> (0, cs("randomflip"), Cast::randomflip, "torchvision.transforms"),
attrs<knn::RecurImpl> (1, cs("recur"), Cast::recur, "knn.Recur"),
attrs<nn::ReflectionPad1dImpl> (0, cs("reflect1d"), Cast::reflect1d, "torch.nn.ReflectionPad1d"),
attrs<nn::ReflectionPad2dImpl> (0, cs("reflect2d"), Cast::reflect2d, "torch.nn.ReflectionPad2d"),
attrs<nn::ReLUImpl> (0, cs("relu"), Cast::relu, "torch.nn.ReLU"),
attrs<nn::ReLU6Impl> (0, cs("relu6"), Cast::relu6, "torch.nn.ReLU6"),
attrs<nn::ReplicationPad1dImpl> (0, cs("replicate1d"), Cast::replicate1d, "torch.nn.ReplicationPad1d"),
attrs<nn::ReplicationPad2dImpl> (0, cs("replicate2d"), Cast::replicate2d, "torch.nn.ReplicationPad2d"),
attrs<nn::ReplicationPad3dImpl> (0, cs("replicate3d"), Cast::replicate3d, "torch.nn.ReplicationPad3d"),
attrs<knn::ReshapeImpl> (0, cs("reshape"), Cast::reshape, "torch.reshape"),
attrs<knn::ResidualImpl> (1, cs("residual"), Cast::residual, "knn.Residual"),
attrs<nn::RNNImpl> (1, cs("rnn"), Cast::rnn, "torch.nn.RNN"),
attrs<nn::RReLUImpl> (0, cs("rrelu"), Cast::rrelu, "torch.nn.RReLU"),
attrs<knn::SelectImpl> (0, cs("select"), Cast::select, "torcn.Tensor.select"),
attrs<knn::SelfAttentionImpl> (1, cs("selfattention"), Cast::selfattention, "knn.SelfAttention"),
attrs<nn::SELUImpl> (0, cs("selu"), Cast::selu, "torch.nn.SELU"),
attrs<knn::SeqJoinImpl> (1, cs("seqjoin"), Cast::seqjoin, "knn.SeqJoin"),
attrs<knn::SeqDictImpl> (1, cs("seqdict"), Cast::seqdict, "knn.SeqDict"),
attrs<knn::SeqListImpl> (1, cs("seqlist"), Cast::seqlist, "knn.SeqList"),
attrs<knn::SeqNestImpl> (1, cs("seqnest"), Cast::seqnest, "knn.SeqNest"),
attrs<nn::SequentialImpl> (1, cs("sequential"), Cast::sequential, "torch.nn.Sequential"),
attrs<nn::SigmoidImpl> (0, cs("sigmoid"), Cast::sigmoid, "torch.nn.Sigmoid"),
attrs<nn::SiLUImpl> (0, cs("silu"), Cast::silu, "torch.nn.SiLU"),
attrs<nn::CosineSimilarityImpl> (0, cs("similar"), Cast::similar, "torch.nn.CosineSimilarity"),
attrs<nn::SoftmaxImpl> (0, cs("softmax"), Cast::softmax, "torch.nn.Softmax"),
attrs<nn::Softmax2dImpl> (0, cs("softmax2d"), Cast::softmax2d, "torch.nn.Softmax2d"),
attrs<nn::SoftminImpl> (0, cs("softmin"), Cast::softmin, "torch.nn.Softmin"),
attrs<nn::SoftplusImpl> (0, cs("softplus"), Cast::softplus, "torch.nn.Softplus"),
attrs<nn::SoftshrinkImpl> (0, cs("softshrink"), Cast::softshrink, "torch.nn.Softshrink"),
attrs<nn::SoftsignImpl> (0, cs("softsign"), Cast::softsign, "torch.nn.Softsign"),
attrs<knn::SqueezeImpl> (0, cs("squeeze"), Cast::squeeze, "torch.squeeze"),
attrs<nn::TanhImpl> (0, cs("tanh"), Cast::tanh, "torch.nn.Tanh"),
attrs<nn::TanhshrinkImpl> (0, cs("tanhshrink"), Cast::tanhshrink, "torch.nn.Tanhshrink"),
attrs<nn::ThresholdImpl> (0, cs("threshold"), Cast::threshold, "torch.nn.Threshold"),
attrs<knn::TransformImpl> (0, cs("transform"), Cast::transform, "knn.Transform"),
attrs<nn::TransformerImpl> (2, cs("transformer"), Cast::transformer, "torch.nn.Transformer"),
attrs<knn::TransposeImpl> (0, cs("transpose"), Cast::transpose, "knn.Transpose"),
attrs<nn::UnfoldImpl> (0, cs("unfold"), Cast::unfold, "torch.nn.Unfold"),
attrs<knn::UnsqueezeImpl> (0, cs("unsqueeze"), Cast::unsqueeze, "torch.unsqueeze"),
attrs<nn::UpsampleImpl> (0, cs("upsample"), Cast::upsample, "torch.nn.Upsample"),
attrs<nn::ZeroPad2dImpl> (0, cs("zeropad2d"), Cast::zeropad2d, "torch.nn.ZeroPad2d"),
attrs<knn::ZscoreImpl> (0, cs("zscore"), Cast::zscore, "torchvision.transforms")
}};
}
// ------------------------------------------------------------------------------
// kmodule - allocate object to store a module pointer (class defaults to module)
// to - given module & options, change device/data type
// ------------------------------------------------------------------------------
K kmodule(Cast c,const Moduleptr& m,Class a) {return kptr(new Kmodule(a,c,m));}
K kmodule(Kmodule* m) {return kmodule(m->c,m->m,m->a);}
void to(Kmodule *m,const TensorOptions& o,bool a) {
TORCH_CHECK( !(o.has_layout() || o.has_requires_grad() || o.has_pinned_memory() || o.has_memory_format()),
"to: converts device & type, but cannot be used for layout,gradient,pinned memory or memory format");
auto s=torch::typeMetaToScalarType(o.dtype());
if(o.has_device() && o.has_dtype()) {
m->module().to(o.device(),s,a);
m->d=o.device();
} else if(o.has_device()) {
m->module().to(o.device(),a);
m->d=o.device();
} else {
m->module().to(s,a);
}
}
// --------------------------------------------------------------------------------------
// container - given module/module cast, return true if container module
// --------------------------------------------------------------------------------------
static bool container(Cast c) {
switch(c) {
case Cast::sequential:
case Cast::seqdict:
case Cast::seqlist:
case Cast::seqnest:
case Cast::seqjoin:
case Cast::moduledict:
case Cast::modulelist:
case Cast::parmdict:
case Cast::fork:
case Cast::nbeats:
case Cast::recur:
case Cast::residual:
case Cast::transform:
case Cast::callback:
return true;
default: return false;
}
}
static bool container(const Module& m) {
if (m.as<nn::Sequential>()) return true;
else if(m.as<knn::SeqNest>()) return true;
else if(m.as<knn::SeqJoin>()) return true;
else if(m.as<nn::ModuleDict>()) return true;
else if(m.as<nn::ModuleList>()) return true;
else if(m.as<nn::ParameterDict>()) return true;
else if(m.as<knn::Fork>()) return true;
else if(m.as<knn::NBeats>()) return true;
else if(m.as<knn::Recur>()) return true;
else if(m.as<knn::Residual>()) return true;
else if(m.as<knn::Transform>()) return true;
else if(m.as<knn::Callback>()) return true;
else return false;
}
static bool container(const Moduleptr& p) {return p ? container(*p) : false;}
// -----------------------------------------------------------------------------------
// seqlist - enlist x, only allow symbol scalar
// seq - convenience function to enlist all but 1st arg to build sequential arg list
// -----------------------------------------------------------------------------------
static K seqlist(K x) {
K r;
if(x->t<0) {
TORCH_CHECK(x->t == -KS, "scalar expected to be a symbol, given a ",kname(x));
r=ktn(KS,1), kS(r)[0]=x->s;
} else {
r=knk(1,r1(x));
}
return r;
}
KAPI seq(K x) {
KTRY
K r;
if(x->t<0) {
TORCH_CHECK(x->t==-KS, "seq: expecting module symbol, given ",kname(x),", ",kstring(x));
r=r1(x);
} else if(x->t>0) {
TORCH_CHECK(x->t==KS, "seq: expecting module symbols, given ",kname(x),", ",kstring(x));
TORCH_CHECK(x->n>0, "seq: expecting at least one module symbol, given empty list");
r=ktn(0,x->n); kK(r)[0]=ks(kS(x)[0]);
for(J i=1;i<x->n;++i) {
kK(r)[i]=ktn(KS,1); kS(kK(r)[i])[0]=kS(x)[i];
}
} else {
TORCH_CHECK(x->n>0, "seq: empty list");
r=ktn(0,x->n);
kK(r)[0]=r1(kK(x)[0]);
for(J i=1;i<x->n;++i)
kK(r)[i]=seqlist(kK(x)[i]);
}
return r;
KCATCH("seq");
}
// --------------------------------------------------------------------------------------
// parmdict - parameter dictionary handles "options" of dictionary of tensors or k arrays
// --------------------------------------------------------------------------------------
static Moduleptr parmdict(K x,J i) {
if(!x || xnone(x,i))
return nn::ParameterDict().ptr();
else if(auto *d=xtensordict(x,i))
return nn::ParameterDict(*d).ptr();
else if(xdict(x) || xdict(x,i))
return nn::ParameterDict(kputd(xdict(x) ? x : kK(x)[i])).ptr();
else
TORCH_ERROR("module: parameter dictionary expects a k dictionary or an allocated dictionary of tensors, given ",kname(x,i));
}
// -------------------------------------------------------------------------------------------------
// mstack - adjust stack given depth,then populate a stack of all intermediate container modules
// mfirst - return first module put on stack (pare down stack, signal error if given empty stack)
// mresult - if existing module, update result type & return null, else return new module structure
// -------------------------------------------------------------------------------------------------
static void mstack(size_t d,const Moduleptr& m,Modules& q) {
while(q.size()>d) q.pop();
if(container(m)) {
q.push(m);
for(const auto& i:m->children())
mstack(d+1,i,q);
}
}
static Modules mstack(Kmodule *m) {
Modules q;
if(m) {
if(container(m->m))
mstack(0,m->m,q);
else
q.push(m->m);
}
return q;
}
static Moduleptr mfirst(Modules& q) {
TORCH_CHECK(q.size(), "empty module stack -- cannot get originating module");
while(q.size()>1) q.pop();
return q.top();
}
static K mresult(Kmodule *m,Cast c,Modules& q) {
const auto& a=mfirst(q);
if(m) {
forwardoptions(m->c, m->f, m->module()); // update options on the forward call
return (K)0; // pointer already holds the updated module
} else { // else new module being defined
return kmodule(c,a); // return pointer to new module
}
}
// -----------------------------------------------------------------------------
// tensorargs - return true if all args to forward calculation are tensors
// argstring - return string of arg(s) given vector of enumerations
// -----------------------------------------------------------------------------
static bool tensorargs(const Args& a) {
for(auto i:a)
if(i != Arg::tensor)
return false;
return a.size();
}
static std::string argstring(const Args& a) {
std::string s;
for(auto i:a) s += argname(i), s += ",";
if(s.size()) s.pop_back();
return s;
}
// -----------------------------------------------------------------------
// rforward - sequential & callback forward calc w'different return types
// -----------------------------------------------------------------------
template<typename M,typename ...X> static Output rforward(Module& m,Arg r,X... x) {
switch(r) {
case Arg::tensor: return m.as<M>()->template forward(x...);
case Arg::tuple: return m.as<M>()->template forward<Tuple>(x...);
case Arg::nested: return m.as<M>()->template forward<Nested>(x...);
case Arg::vector: return m.as<M>()->template forward<TensorVector>(x...);
default: TORCH_ERROR(mlabel(m)," forward calculation returning ",argname(r)," not implemented");
}
}
// ------------------------------------------------------------------------
// tforward - given module, run forward calc on tensor x (most common case)
// ------------------------------------------------------------------------
Output tforward(Cast c,Kmodule *k,const Tensor& x) {
Module& m=k->module();
switch(c) {
case Cast::sequential: return rforward<nn::Sequential>(m, k->f.r(), x);
case Cast::adaptavg1d: return m.as<nn::AdaptiveAvgPool1d>()->forward(x);
case Cast::adaptavg2d: return m.as<nn::AdaptiveAvgPool2d>()->forward(x);
case Cast::adaptavg3d: return m.as<nn::AdaptiveAvgPool3d>()->forward(x);
case Cast::adaptmax1d: return m.as<nn::AdaptiveMaxPool1d>()->forward(x);
case Cast::adaptmax2d: return m.as<nn::AdaptiveMaxPool2d>()->forward(x);
case Cast::adaptmax3d: return m.as<nn::AdaptiveMaxPool3d>()->forward(x);
case Cast::adrop: return m.as<nn::AlphaDropout>()->forward(x);
case Cast::avgpool1d: return m.as<nn::AvgPool1d>()->forward(x);
case Cast::avgpool2d: return m.as<nn::AvgPool2d>()->forward(x);
case Cast::avgpool3d: return m.as<nn::AvgPool3d>()->forward(x);
case Cast::batchnorm1d: return m.as<nn::BatchNorm1d>()->forward(x);
case Cast::batchnorm2d: return m.as<nn::BatchNorm2d>()->forward(x);
case Cast::batchnorm3d: return m.as<nn::BatchNorm3d>()->forward(x);
case Cast::callback: return rforward<knn::Callback>(m, k->f.r(), x);
case Cast::celu: return m.as<nn::CELU>()->forward(x);
case Cast::conv1d: return m.as<nn::Conv1d>()->forward(x);
case Cast::conv2d: return m.as<nn::Conv2d>()->forward(x);
case Cast::conv3d: return m.as<nn::Conv3d>()->forward(x);
case Cast::convtranspose1d: return m.as<nn::ConvTranspose1d>()->forward(x);
case Cast::convtranspose2d: return m.as<nn::ConvTranspose2d>()->forward(x);
case Cast::convtranspose3d: return m.as<nn::ConvTranspose3d>()->forward(x);
case Cast::crossmap2d: return m.as<nn::CrossMapLRN2d>()->forward(x);
case Cast::drop: return m.as<nn::Dropout>()->forward(x);
case Cast::drop2d: return m.as<nn::Dropout2d>()->forward(x);
case Cast::drop3d: return m.as<nn::Dropout3d>()->forward(x);
case Cast::droppath: return m.as<knn::DropPath>()->forward(x);
case Cast::elu: return m.as<nn::ELU>()->forward(x);
case Cast::embed: return m.as<nn::Embedding>()->forward(x);
case Cast::embedbag: return m.as<nn::EmbeddingBag>()->forward(x);
case Cast::embedpos: return m.as<knn::EmbedPosition>()->forward(x);
case Cast::embedseq: return m.as<knn::EmbedSequence>()->forward(x);
case Cast::encoder: return m.as<nn::TransformerEncoder>()->forward(x);
case Cast::encoderlayer: return m.as<nn::TransformerEncoderLayer>()->forward(x);
case Cast::expand: return m.as<knn::Expand>()->forward(x);
case Cast::fadrop: return m.as<nn::FeatureAlphaDropout>()->forward(x);
case Cast::flatten: return m.as<nn::Flatten>()->forward(x);
case Cast::fmaxpool2d: return m.as<nn::FractionalMaxPool2d>()->forward(x);
case Cast::fmaxpool3d: return m.as<nn::FractionalMaxPool3d>()->forward(x);
case Cast::fold: return m.as<nn::Fold>()->forward(x);
case Cast::fork: return m.as<knn::Fork>()->forward(x);
case Cast::gelu: return m.as<nn::GELU>()->forward(x);
case Cast::glu: return m.as<nn::GLU>()->forward(x);
case Cast::groupnorm: return m.as<nn::GroupNorm>()->forward(x);
case Cast::gru: return m.as<nn::GRU>()->forward(x);
case Cast::hardshrink: return m.as<nn::Hardshrink>()->forward(x);
case Cast::hardtanh: return m.as<nn::Hardtanh>()->forward(x);
case Cast::identity: return m.as<nn::Identity>()->forward(x);
case Cast::indexselect: return m.as<knn::IndexSelect>()->forward(x);
case Cast::instancenorm1d: return m.as<nn::InstanceNorm1d>()->forward(x);
case Cast::instancenorm2d: return m.as<nn::InstanceNorm2d>()->forward(x);
case Cast::instancenorm3d: return m.as<nn::InstanceNorm3d>()->forward(x);
case Cast::layernorm: return m.as<nn::LayerNorm>()->forward(x);
case Cast::leakyrelu: return m.as<nn::LeakyReLU>()->forward(x);
case Cast::linear: return m.as<nn::Linear>()->forward(x);
case Cast::localnorm: return m.as<nn::LocalResponseNorm>()->forward(x);
case Cast::logsigmoid: return m.as<nn::LogSigmoid>()->forward(x);
case Cast::logsoftmax: return m.as<nn::LogSoftmax>()->forward(x);
case Cast::lppool1d: return m.as<nn::LPPool1d>()->forward(x);
case Cast::lppool2d: return m.as<nn::LPPool2d>()->forward(x);
case Cast::lstm: return m.as<nn::LSTM>()->forward(x);
case Cast::maxpool1d: return m.as<nn::MaxPool1d>()->forward(x);
case Cast::maxpool2d: return m.as<nn::MaxPool2d>()->forward(x);
case Cast::maxpool3d: return m.as<nn::MaxPool3d>()->forward(x);
case Cast::mish: return m.as<nn::Mish>()->forward(x);
case Cast::nbeats: return m.as<knn::NBeats>()->forward(x);
case Cast::onehot: return m.as<knn::OneHot>()->forward(x);
case Cast::pad: return m.as<knn::Pad>()->forward(x);
case Cast::pad1d: return m.as<nn::ConstantPad1d>()->forward(x);
case Cast::pad2d: return m.as<nn::ConstantPad2d>()->forward(x);
case Cast::pad3d: return m.as<nn::ConstantPad3d>()->forward(x);
case Cast::permute: return m.as<knn::Permute>()->forward(x);
case Cast::prelu: return m.as<nn::PReLU>()->forward(x);
case Cast::randomcrop: return m.as<knn::RandomCrop>()->forward(x);
case Cast::randomflip: return m.as<knn::RandomFlip>()->forward(x);
case Cast::recur: return m.as<knn::Recur>()->forward(x);
case Cast::reflect1d: return m.as<nn::ReflectionPad1d>()->forward(x);
case Cast::reflect2d: return m.as<nn::ReflectionPad2d>()->forward(x);
case Cast::relu: return m.as<nn::ReLU>()->forward(x);
case Cast::relu6: return m.as<nn::ReLU6>()->forward(x);
case Cast::replicate1d: return m.as<nn::ReplicationPad1d>()->forward(x);
case Cast::replicate2d: return m.as<nn::ReplicationPad2d>()->forward(x);
case Cast::replicate3d: return m.as<nn::ReplicationPad3d>()->forward(x);
case Cast::residual: return m.as<knn::Residual>()->forward(x);
case Cast::reshape: return m.as<knn::Reshape>()->forward(x);
case Cast::rnn: return m.as<nn::RNN>()->forward(x);
case Cast::rrelu: return m.as<nn::RReLU>()->forward(x);
case Cast::select: return m.as<knn::Select>()->forward(x);
case Cast::selfattention: return m.as<knn::SelfAttention>()->forward(x);
case Cast::selu: return m.as<nn::SELU>()->forward(x);
case Cast::seqjoin: return m.as<knn::SeqJoin>()->forward(x);
case Cast::seqlist: return m.as<knn::SeqList>()->forward(x);
case Cast::seqnest: return m.as<knn::SeqNest>()->forward(x);
case Cast::sigmoid: return m.as<nn::Sigmoid>()->forward(x);
case Cast::silu: return m.as<nn::SiLU>()->forward(x);
case Cast::softmax: return m.as<nn::Softmax>()->forward(x);
case Cast::softmax2d: return m.as<nn::Softmax2d>()->forward(x);
case Cast::softmin: return m.as<nn::Softmin>()->forward(x);
case Cast::softplus: return m.as<nn::Softplus>()->forward(x);
case Cast::softshrink: return m.as<nn::Softshrink>()->forward(x);
case Cast::softsign: return m.as<nn::Softsign>()->forward(x);
case Cast::squeeze: return m.as<knn::Squeeze>()->forward(x);
case Cast::tanh: return m.as<nn::Tanh>()->forward(x);
case Cast::tanhshrink: return m.as<nn::Tanhshrink>()->forward(x);
case Cast::threshold: return m.as<nn::Threshold>()->forward(x);
case Cast::transform: return m.as<knn::Transform>()->forward(x);
case Cast::transpose: return m.as<knn::Transpose>()->forward(x);
case Cast::unfold: return m.as<nn::Unfold>()->forward(x);
case Cast::unsqueeze: return m.as<knn::Unsqueeze>()->forward(x);
case Cast::upsample: return m.as<nn::Upsample>()->forward(x);
case Cast::zeropad2d: return m.as<nn::ZeroPad2d>()->forward(x);
case Cast::zscore: return m.as<knn::Zscore>()->forward(x);
default: TORCH_ERROR("forward calculation with a single tensor argument not implemented for ",msym(c)," module");
}
}
// ---------------------------------------------------------------------
// xforward - forward calculation for tuple, nested & tensor,tuple input
// ---------------------------------------------------------------------
static Output xforward(Cast c,Kmodule* k,const Tuple& x) {
TORCH_ERROR(msym(k->f.in()),": forward calculation with tuple input not implemented");
}
static Output xforward(Cast c,Kmodule* k,const Nested& x) {
TORCH_ERROR(msym(k->f.in()),": forward calculation with nested input not implemented");
}
static Output xforward(Cast c,Kmodule* k,const Tensor& x,const Tuple& y) {
auto& m=k->module();
switch(c) {
case Cast::sequential: return rforward<nn::Sequential>(m, k->f.r(), x, y);
case Cast::lstm: return m.as<nn::LSTM>()->forward(x,y);
default: TORCH_ERROR(msym(k->f.in()),": forward calculation with tensor,tuple input not implemented");
}
}
// -----------------------------------------------------------------
// vforward1 - forward calc with single arg of tensor vector
// vforward3 - forward calc on 2-3 tensors from tensor vector
// vforward6 - forward calc on 2-6 tensors from tensor vector
// vforward8 - forward calc on 2-8 tensors from tensor vector
// -----------------------------------------------------------------
static Output vforward1(Cast c,Arg r,Module& m,const TensorVector& x) {
switch(c) {
case Cast::sequential: return rforward<nn::Sequential>(m,r,x);
case Cast::callback: return rforward<knn::Callback>(m,r,x);
default: TORCH_ERROR(msym(c),": forward calculation with vector argument not implemented");
}
}
template<typename M> static Output vforward3(Cast c,Module& m,const TensorVector& x) {
switch(x.size()) {
case 2: return m.as<M>()->forward(x[0], x[1]);
case 3: return m.as<M>()->forward(x[0], x[1], x[2]);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
}
template<typename M> static Output vforward6(Cast c,Module& m,const TensorVector& x) {
switch(x.size()) {
case 2: return m.as<M>()->forward(x[0], x[1]);
case 3: return m.as<M>()->forward(x[0], x[1], x[2]);
case 4: return m.as<M>()->forward(x[0], x[1], x[2], x[3]);
case 5: return m.as<M>()->forward(x[0], x[1], x[2], x[3], x[4]);
case 6: return m.as<M>()->forward(x[0], x[1], x[2], x[3], x[4], x[5]);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
}
template<typename M> static Output vforward8(Cast c,Module& m,const TensorVector& x) {
switch(x.size()) {
case 2: return m.as<M>()->forward(x[0], x[1]);
case 3: return m.as<M>()->forward(x[0], x[1], x[2]);
case 4: return m.as<M>()->forward(x[0], x[1], x[2], x[3]);
case 5: return m.as<M>()->forward(x[0], x[1], x[2], x[3], x[4]);
case 6: return m.as<M>()->forward(x[0], x[1], x[2], x[3], x[4], x[5]);
case 7: return m.as<M>()->forward(x[0], x[1], x[2], x[3], x[4], x[5], x[6]);
case 8: return m.as<M>()->forward(x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7]);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
}
// -----------------------------------------------------------------
// vforward - forward calc with tensor vector w'two or more tensors
// -----------------------------------------------------------------
static Output vforward(Cast c,Kmodule *k,const TensorVector& x) {
TORCH_CHECK(x.size()>=2, "forward calculation expects 2 or more tensors, ",x.size()," supplied");
Module& m=k->module();
switch(c) {
case Cast::sequential:
switch(x.size()) {
case 2: return rforward<nn::Sequential>(m, k->f.r(), x[0], x[1]);
case 3: return rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2]);
case 4: return rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3]);
case 5: return k->f.in()==Cast::attention
? rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3], x[4].item<bool>())
: rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3], x[4]);
case 6: return k->f.in()==Cast::attention
? rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3], x[4].item<bool>(), x[5])
: rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3], x[4], x[5]);
case 7: return rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3], x[4], x[5], x[6]);
case 8: return rforward<nn::Sequential>(m, k->f.r(), x[0], x[1], x[2], x[3], x[4], x[5], x[6], x[7]);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
case Cast::callback:
switch(x.size()) {
case 2: return rforward<knn::Callback>(m, k->f.r(), x[0], x[1]);
case 3: return rforward<knn::Callback>(m, k->f.r(), x[0], x[1], x[2]);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
case Cast::attention: // needs special case due to 3 or more tensor args & boolean(???) arg mix
switch(x.size()) {
case 3: return m.as<nn::MultiheadAttention>()->forward(x[0], x[1], x[2]);
case 4: return m.as<nn::MultiheadAttention>()->forward(x[0], x[1], x[2], x[3]);
case 5: return m.as<nn::MultiheadAttention>()->forward(x[0], x[1], x[2], x[3], x[4].item<bool>());
case 6: return m.as<nn::MultiheadAttention>()->forward(x[0], x[1], x[2], x[3], x[4].item<bool>(), x[5]);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
case Cast::bilinear: return m.as<nn::Bilinear>()->forward(x[0],x[1]);
case Cast::cat: return m.as<knn::Cat>()->forward(x[0],x[1]);
case Cast::gru: return m.as<nn::GRU>()->forward(x[0],x[1]);
case Cast::mul: return m.as<knn::Mul>()->forward(x[0],x[1]);
case Cast::matmul: return m.as<knn::Matmul>()->forward(x[0],x[1]);
case Cast::pairwise: return m.as<nn::PairwiseDistance>()->forward(x[0],x[1]);
case Cast::rnn: return m.as<nn::RNN>()->forward(x[0],x[1]);
case Cast::seqjoin: return m.as<knn::SeqJoin>()->forward(x[0],x[1]);
case Cast::similar: return m.as<nn::CosineSimilarity>()->forward(x[0],x[1]);
case Cast::seqnest: return vforward3<knn::SeqNest>(c,m,x);
case Cast::recur: return vforward3<knn::Recur>(c,m,x);
case Cast::residual: return vforward3<knn::Residual>(c,m,x);
case Cast::selfattention: return vforward3<knn::SelfAttention>(c,m,x);
case Cast::encoder: return vforward3<nn::TransformerEncoder>(c,m,x);
case Cast::encoderlayer: return vforward3<nn::TransformerEncoderLayer>(c,m,x);
case Cast::decoder: return vforward6<nn::TransformerDecoder>(c,m,x);
case Cast::decoderlayer: return vforward6<nn::TransformerDecoderLayer>(c,m,x);
case Cast::transformer: return vforward8<nn::Transformer>(c,m,x);
case Cast::seqdict: return vforward8<knn::SeqDict>(c,m,x);
case Cast::seqlist: return vforward8<knn::SeqList>(c,m,x);
default: TORCH_ERROR(msym(c),": no forward calculation implemented for ",x.size()," tensor(s)");
}
}
// ------------------------------------------------------------------------
// vforward - handle vector input for various type of forward calculations
// ------------------------------------------------------------------------
static Output vforward(Kmodule *m,const TensorVector& v) {
auto f=m->f; auto c=m->c, i=f.in();
auto a=f.a(); auto n=f.n(); auto an=a.size(); auto vn=v.size();
if(an==1) {
switch(a.front()) {
case Arg::tensor:
TORCH_CHECK(vn==1, msym(i),": forward requires a single tensor, ",vn," tensors given");
tforward(c,m,v.front());
case Arg::vector:
return vforward1(c, f.r(), m->module(), v);
case Arg::tuple:
TORCH_CHECK(vn==2, msym(i),": forward calc requires tuple of 2 tensors, ",vn," given");
return xforward(c, m, std::make_tuple(v[0],v[1]));
case Arg::nested:
TORCH_CHECK(vn==3, msym(i),": forward calc requires nested tuple of 3 tensors, ",vn," given");
return xforward(c, m, std::make_tuple(v[0], std::make_tuple(v[1],v[2])));
default:
TORCH_ERROR(msym(i),": forward not implemented for ",argname(a.front()));
}
} else if(c==Cast::attention || tensorargs(a)) {
TORCH_CHECK(n<=vn, msym(i),": ",vn," tensor(s) supplied, but at least ",n," required");
TORCH_CHECK(vn<=an, msym(i),": ",vn," tensors supplied, but only ",an," expected");
if(vn==1)
return tforward(c,m,v.front());
else
return vforward(c,m,v);
} else if(an==2 && a.front()==Arg::tensor && a.back()==Arg::tuple) {
TORCH_CHECK(vn==3, msym(i),": expects 3 tensors for (tensor,tuple) input but ",vn," given");
return xforward(c, m, v[0], std::make_tuple(v[1],v[2]));
} else {
TORCH_ERROR(msym(i),": forward calculation with ",argstring(a)," input is not implemented");
}
}
// -----------------------------------------------------------------------------
// mforward - accepts k api module & input(s), determines form of forward() call
// -----------------------------------------------------------------------------
Output mforward(Kmodule *m,const Input& x) {
const auto& f=m->f; const auto& a=f.a(); Cast c=m->c,i=f.in(); auto n=f.n(); auto an=a.size();
TORCH_CHECK(f.f(), msym(c),": no forward calculation defined");
TORCH_CHECK(an, msym(c),": unable to run forward calculation, no argument types defined");
if(auto *p=std::get_if<Tensor>(&x)) {
TORCH_CHECK(n==1, msym(i),": ",n," args required for forward calculation, single tensor supplied");
TORCH_CHECK(a.front()==Arg::tensor, msym(i),": argument of ",argname(a.front())," expected, but tensor supplied");
return tforward(c,m,*p);
} else if(auto *p=std::get_if<TensorVector>(&x)) {
return vforward(m,*p);
} else {
TORCH_ERROR(msym(i),": forward(",argstring(a),") not implemented given ",inputname(x));
}
}
// -------------------------------------------------------------------
// normalize - pytorch has functional form only, no module as of v1.10
// fold & unfold: functional form of the Fold & Unfold modules
// interpolate - no module, pytorch functional form only
// linear,bilinear - invoke functional form
// -------------------------------------------------------------------
KAPI normalize(K x) {
KTRY
Tensor r,*t=nullptr;
if(x->t || (t=xten(x))) {
return kresult(t, fnn::normalize(t ? *t : kput(x), fnn::NormalizeFuncOptions()));
} else {
t=xten(x,0);
return kresult(t||r.defined(), fnn::normalize(t ? *t : kput(x,0), knn::normalize(x,1,Cast::normalize,r)));
}
KCATCH("normalize");
}
static K kfold(K x,Cast c) {
KTRY
TORCH_CHECK(!x->t, msym(c)," not implemented for ",kname(x->t));
Tensor r, *t=xten(x,0);
return kresult(t, c==Cast::fold
? fnn::fold (t ? *t : kput(x,0), knn::fold(x,1,c))
: fnn::unfold(t ? *t : kput(x,0), knn::unfold(x,1,c)));
KCATCH("fold");
}
KAPI fold(K x) {return kfold(x, Cast::fold);}
KAPI unfold(K x) {return kfold(x, Cast::unfold);}
KAPI interpolate(K x) {
KTRY
TORCH_CHECK(!x->t, "interpolate not implemented for ",kname(x->t));
Tensor r, *t=xten(x,0);
return kresult(t,
fnn::interpolate(t ? *t : kput(x,0),
knn::upsample<fnn::InterpolateFuncOptions>(x,1,Cast::interpolate)));
KCATCH("interpolate");
}
KAPI linear(K x) {
KTRY
TORCH_CHECK(!x->t, "linear not implemented for ",kname(x->t));
TORCH_CHECK(x->n==2 || x->n==3, "linear requires 2-3 args, (input; weight; optional bias)");
Tensor r, *a=xten(x,0), *w=xten(x,1), *b=xten(x,2);
if(x->n==2)
r=torch::linear(a ? *a : kput(x,0), w ? *w : kput(x,1));
else
r=torch::linear(a ? *a : kput(x,0), w ? *w : kput(x,1), b ? *b : kput(x,2));
return kresult(a||w||b, r);
KCATCH("linear");
}
KAPI bilinear(K x) {
KTRY
TORCH_CHECK(!x->t, "bilinear not implemented for ",kname(x->t));
TORCH_CHECK(x->n==3 || x->n==4, "blinear requires 3-4 args, (input1; input2; weight; optional bias)");
Tensor r, *x1=xten(x,0), *x2=xten(x,1), *w=xten(x,2), *b=xten(x,3);
return kresult(x1||x2||w||b, torch::bilinear(x1 ? *x1 : kput(x,0),
x2 ? *x2 : kput(x,1),
w ? *w : kput(x,2),
x->n==3 ? Tensor{} : (b ? *b : kput(x,3))));
KCATCH("bilinear");
}
// -----------------------------------
// functional form of pooling methods:
// -----------------------------------
static K pool(K x,Cast c) {
KTRY
TORCH_CHECK(!x->t, msym(c)," not implemented for ",kname(x->t));
Tensor r, *t=xten(x,0);
switch(c) {
case Cast::maxpool1d: r=fnn::max_pool1d(t ? *t : kput(x,0), knn::maxpool<1>(x,1,c)); break;
case Cast::maxpool2d: r=fnn::max_pool2d(t ? *t : kput(x,0), knn::maxpool<2>(x,1,c)); break;
case Cast::maxpool3d: r=fnn::max_pool3d(t ? *t : kput(x,0), knn::maxpool<3>(x,1,c)); break;
case Cast::avgpool1d: r=fnn::avg_pool1d(t ? *t : kput(x,0), knn::avgpool<1>(x,1,c)); break;
case Cast::avgpool2d: r=fnn::avg_pool2d(t ? *t : kput(x,0), knn::avgpool<2>(x,1,c)); break;
case Cast::avgpool3d: r=fnn::avg_pool3d(t ? *t : kput(x,0), knn::avgpool<3>(x,1,c)); break;
case Cast::adaptmax1d: r=fnn::adaptive_max_pool1d(t ? *t : kput(x,0), knn::adapt<1,nn::AdaptiveMaxPool1dOptions>(x,1,c)); break;
case Cast::adaptmax2d: r=fnn::adaptive_max_pool2d(t ? *t : kput(x,0), knn::adapt<2,nn::AdaptiveMaxPool2dOptions>(x,1,c)); break;
case Cast::adaptmax3d: r=fnn::adaptive_max_pool3d(t ? *t : kput(x,0), knn::adapt<3,nn::AdaptiveMaxPool3dOptions>(x,1,c)); break;
case Cast::adaptavg1d: r=fnn::adaptive_avg_pool1d(t ? *t : kput(x,0), knn::adapt<1,nn::AdaptiveAvgPool1dOptions>(x,1,c)); break;
case Cast::adaptavg2d: r=fnn::adaptive_avg_pool2d(t ? *t : kput(x,0), knn::adapt<2,nn::AdaptiveAvgPool2dOptions>(x,1,c)); break;
case Cast::adaptavg3d: r=fnn::adaptive_avg_pool3d(t ? *t : kput(x,0), knn::adapt<3,nn::AdaptiveAvgPool3dOptions>(x,1,c)); break;
case Cast::fmaxpool2d: r=fnn::fractional_max_pool2d(t ? *t : kput(x,0), knn::fpool<2>(x,1,c)); break;
case Cast::fmaxpool3d: r=fnn::fractional_max_pool3d(t ? *t : kput(x,0), knn::fpool<3>(x,1,c)); break;
case Cast::lppool1d: r=fnn::lp_pool1d(t ? *t : kput(x,0), knn::lppool<1>(x,1,c)); break;
case Cast::lppool2d: r=fnn::lp_pool2d(t ? *t : kput(x,0), knn::lppool<2>(x,1,c)); break;
default: TORCH_ERROR("unrecognized pooling function");
}
return kresult(t,r);
KCATCH("pool");
}
KAPI maxpool1d(K x) {return pool(x,Cast::maxpool1d);}
KAPI maxpool2d(K x) {return pool(x,Cast::maxpool2d);}
KAPI maxpool3d(K x) {return pool(x,Cast::maxpool3d);}
KAPI avgpool1d(K x) {return pool(x,Cast::avgpool1d);}
KAPI avgpool2d(K x) {return pool(x,Cast::avgpool2d);}
KAPI avgpool3d(K x) {return pool(x,Cast::avgpool3d);}
KAPI adaptmax1d(K x) {return pool(x,Cast::adaptmax1d);}
KAPI adaptmax2d(K x) {return pool(x,Cast::adaptmax2d);}
KAPI adaptmax3d(K x) {return pool(x,Cast::adaptmax3d);}
KAPI adaptavg1d(K x) {return pool(x,Cast::adaptavg1d);}
KAPI adaptavg2d(K x) {return pool(x,Cast::adaptavg2d);}
KAPI adaptavg3d(K x) {return pool(x,Cast::adaptavg3d);}
KAPI fmaxpool2d(K x) {return pool(x,Cast::fmaxpool2d);}