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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
//! Logical streams.
//!
//! [Reference]
//!
//! [Reference]: https://abs-tudelft.github.io/tydi/specification/logical.html
use crate::{
physical::{BitCount, Complexity, Fields, PhysicalStream},
util::log2_ceil,
Error, Name, NonNegative, PathName, Positive, PositiveReal, Result, Reverse,
};
use indexmap::IndexMap;
use std::str::FromStr;
use std::{
convert::{TryFrom, TryInto},
error,
};
/// Direction of a stream.
///
/// [Reference]
///
/// [Reference]: https://abs-tudelft.github.io/tydi/specification/logical.html#stream
#[derive(Copy, Clone, Debug, PartialEq, Eq)]
pub enum Direction {
/// Forward indicates that the child stream flows in the same direction as
/// its parent, complementing the data of its parent in some way.
Forward,
/// Reverse indicates that the child stream acts as a response channel for
/// the parent stream. If there is no parent stream, Forward indicates that
/// the stream flows in the natural source to sink direction of the logical
/// stream, while Reverse indicates a control channel in the opposite
/// direction. The latter may occur for instance when doing random read
/// access to a memory; the first stream carrying the read commands then
/// flows in the sink to source direction.
Reverse,
}
impl Default for Direction {
fn default() -> Self {
Direction::Forward
}
}
impl FromStr for Direction {
type Err = Error;
fn from_str(input: &str) -> Result<Self> {
match input {
"Forward" => Ok(Direction::Forward),
"Reverse" => Ok(Direction::Reverse),
_ => Err(Error::InvalidArgument(format!(
"{} is not a valid Direction",
input
))),
}
}
}
impl Reverse for Direction {
/// Reverse this direction.
///
/// # Examples
///
/// ```rust
/// use tydi::{Reverse, Reversed, logical::Direction};
///
/// let mut forward = Direction::Forward;
/// let mut reverse = Direction::Reverse;
///
/// forward.reverse();
/// assert_eq!(forward, reverse);
///
/// forward.reverse();
/// assert_eq!(forward, reverse.reversed());
/// ```
fn reverse(&mut self) {
*self = match self {
Direction::Forward => Direction::Reverse,
Direction::Reverse => Direction::Forward,
};
}
}
/// The synchronicity of the elements in the child stream with respect to the
/// elements in the parent stream.
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
pub enum Synchronicity {
/// Indicating that there is a one-to-one relation between the parent and
/// child elements, and the dimensionality information of the parent stream
/// is redundantly carried by the child stream as well.
Sync,
/// Indicating that there is a one-to-one relation between the parent and
/// child elements, and the dimensionality information of the parent stream
/// is omitted in the child stream.
Flatten,
/// Desync may be used if the relation between the elements in the child
/// and parent stream is dependent on context rather than the last flags
/// in either stream.
Desync,
/// FlatDesync, finally, does the same thing as Desync, but also strips the
/// dimensionality information from the parent. This means there the
/// relation between the two streams, if any, is fully user-defined.
FlatDesync,
}
impl Default for Synchronicity {
fn default() -> Self {
Synchronicity::Sync
}
}
impl FromStr for Synchronicity {
type Err = Error;
fn from_str(input: &str) -> Result<Self> {
match input {
"Sync" => Ok(Synchronicity::Sync),
"Flatten" => Ok(Synchronicity::Flatten),
"Desync" => Ok(Synchronicity::Desync),
"FlatDesync" => Ok(Synchronicity::FlatDesync),
_ => Err(Error::InvalidArgument(format!(
"{} is not a valid Synchronicity",
input
))),
}
}
}
/// The stream-manipulating logical stream type.
///
/// Defines a new physical stream.
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#stream)
#[derive(Debug, Clone, PartialEq)]
pub struct Stream {
/// Logical stream type of data elements carried by this stream.
///
/// Any logical stream type representing the data type carried by the
/// logical stream.
data: Box<LogicalStreamType>,
/// Throughput ratio of the stream.
///
/// Positive real number, representing the minimum number of elements that
/// should be transferrable on the child stream per element in the parent
/// stream, or if there is no parent stream, the minimum number of elements
/// that should be transferrable per clock cycle.
throughput: PositiveReal,
/// Dimensionality of the stream.
///
/// Nonnegative integer specifying the dimensionality of the child
/// stream with respect to the parent stream (with no parent, it is the
/// initial value).
dimensionality: NonNegative,
/// Synchronicity of the stream.
///
/// The synchronicity of the d-dimensional elements in the child stream
/// with respect to the elements in the parent stream.
synchronicity: Synchronicity,
/// Complexity level of the stream.
///
/// The complexity number for the physical stream interface, as defined
/// in the physical stream specification.
complexity: Complexity,
/// Direction of the stream.
///
/// The direction of the stream. If there is no parent stream, this
/// specifies the direction with respect to the natural direction of
/// the stream (source to sink).
direction: Direction,
/// Logical stream type of (optional) user data carried by this stream.
///
/// An optional logical stream type consisting of only
/// element-manipulating nodes, representing the user data carried by
/// this logical stream.
user: Option<Box<LogicalStreamType>>,
/// Stream carries extra information.
///
/// Keep specifies whether the stream carries "extra" information
/// beyond the data and user signal payloads. x is normally false,
/// which implies that the Stream node will not result in a physical
/// stream if both its data and user signals would be empty according
/// to the rest of this specification; it is effectively optimized
/// away. Setting keep to true simply overrides this behavior.
keep: bool,
}
impl Reverse for Stream {
/// Reverse the direction of this stream.
///
/// This flips the [`Direction`] of the stream.
///
/// [`Direction`]: ./enum.Direction.html
fn reverse(&mut self) {
self.direction.reverse();
}
}
impl Stream {
#[allow(clippy::too_many_arguments)]
pub fn new(
data: LogicalStreamType,
throughput: PositiveReal,
dimensionality: NonNegative,
synchronicity: Synchronicity,
complexity: impl Into<Complexity>,
direction: Direction,
user: Option<LogicalStreamType>,
keep: bool,
) -> Self {
Stream {
data: Box::new(data),
throughput,
dimensionality,
synchronicity,
complexity: complexity.into(),
direction,
user: user.map(Box::new),
keep,
}
}
pub fn new_basic(data: LogicalStreamType) -> Self {
Stream {
data: Box::new(data),
throughput: PositiveReal::new(1.).unwrap(),
dimensionality: 0,
synchronicity: Synchronicity::Sync,
complexity: Complexity::default(),
direction: Direction::Forward,
user: None,
keep: false,
}
}
pub fn data(&self) -> &LogicalStreamType {
&self.data
}
/// Returns the direction of this stream.
pub fn direction(&self) -> Direction {
self.direction
}
/// Returns the synchronicity of this stream.
pub fn synchronicity(&self) -> Synchronicity {
self.synchronicity
}
/// Returns the dimensionality of this stream.
pub fn dimensionality(&self) -> NonNegative {
self.dimensionality
}
/// Returns the throughput ratio of this stream.
pub fn throughput(&self) -> PositiveReal {
self.throughput
}
/// Returns true if this stream is null i.e. it results in no signals.
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#null-detection-function)
pub fn is_null(&self) -> bool {
self.data.is_null()
&& (self.user.is_some() && self.user.as_ref().unwrap().is_null())
&& !self.keep
}
/// Set the throughput ratio of this stream.
fn set_throughput(&mut self, throughput: PositiveReal) {
self.throughput = throughput;
}
/// Set the synchronicity of this stream.
fn set_synchronicity(&mut self, synchronicity: Synchronicity) {
self.synchronicity = synchronicity;
}
/// Set the dimensionality of this stream.
fn set_dimensionality(&mut self, dimensionality: NonNegative) {
self.dimensionality = dimensionality;
}
}
impl From<Stream> for LogicalStreamType {
/// Wraps this stream in a [`LogicalStreamType`].
///
/// [`LogicalStreamType`]: ./enum.LogicalStreamType.html
fn from(stream: Stream) -> Self {
LogicalStreamType::Stream(stream)
}
}
/// The Group stream type acts as a product type (composition).
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#group)
#[derive(Debug, Clone, PartialEq)]
pub struct Group(IndexMap<Name, LogicalStreamType>);
impl Group {
/// Returns a new Group logical stream type. Returns an error when either
/// the name or logical stream type conversion fails, or when there are
/// duplicate names.
pub fn try_new(
group: impl IntoIterator<
Item = (
impl TryInto<Name, Error = impl Into<Box<dyn error::Error>>>,
impl TryInto<LogicalStreamType, Error = impl Into<Box<dyn error::Error>>>,
),
>,
) -> Result<Self> {
let mut map = IndexMap::new();
for (name, stream) in group
.into_iter()
.map(
|(name, stream)| match (name.try_into(), stream.try_into()) {
(Ok(name), Ok(stream)) => Ok((name, stream)),
(Err(name), _) => Err(Error::from(name.into())),
(_, Err(stream)) => Err(Error::from(stream.into())),
},
)
.collect::<Result<Vec<_>>>()?
{
map.insert(name, stream)
.map(|_| -> Result<()> { Err(Error::UnexpectedDuplicate) })
.transpose()?;
}
Ok(Group(map))
}
/// Returns an iterator over the fields of the Group.
pub fn iter(&self) -> impl Iterator<Item = (&Name, &LogicalStreamType)> {
self.0.iter()
}
}
impl From<Group> for LogicalStreamType {
/// Wraps this group in a [`LogicalStreamType`].
///
/// [`LogicalStreamType`]: ./enum.LogicalStreamType.html
fn from(group: Group) -> Self {
LogicalStreamType::Group(group)
}
}
///
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#union)
#[derive(Debug, Clone, PartialEq)]
pub struct Union(IndexMap<Name, LogicalStreamType>);
impl Union {
/// Returns a new Union logical stream type. Returns an error when either
/// the name or logical stream type conversion fails, or when there are
/// duplicate names.
pub fn try_new(
union: impl IntoIterator<
Item = (
impl TryInto<Name, Error = impl Into<Box<dyn error::Error>>>,
impl TryInto<LogicalStreamType, Error = impl Into<Box<dyn error::Error>>>,
),
>,
) -> Result<Self> {
let mut map = IndexMap::new();
for (name, stream) in union
.into_iter()
.map(
|(name, stream)| match (name.try_into(), stream.try_into()) {
(Ok(name), Ok(stream)) => Ok((name, stream)),
(Err(name), _) => Err(Error::from(name.into())),
(_, Err(stream)) => Err(Error::from(stream.into())),
},
)
.collect::<Result<Vec<_>>>()?
{
map.insert(name, stream)
.map(|_| -> Result<()> { Err(Error::UnexpectedDuplicate) })
.transpose()?;
}
Ok(Union(map))
}
/// Returns the tag name and width of this union.
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html)
pub fn tag(&self) -> Option<(String, BitCount)> {
if self.0.len() > 1 {
Some((
"tag".to_string(),
BitCount::new(log2_ceil(
BitCount::new(self.0.len() as NonNegative).unwrap(),
))
.unwrap(),
))
} else {
None
}
}
/// Returns an iterator over the fields of the Union.
pub fn iter(&self) -> impl Iterator<Item = (&Name, &LogicalStreamType)> {
self.0.iter()
}
}
impl From<Union> for LogicalStreamType {
/// Wraps this union in a [`LogicalStreamType`].
///
/// [`LogicalStreamType`]: ./enum.LogicalStreamType.html
fn from(union: Union) -> Self {
LogicalStreamType::Union(union)
}
}
/// Types of logical streams.
///
/// This structure is at the heart of the logical stream specification. It is
/// used both to specify the type of a logical stream and internally for the
/// process of lowering the recursive structure down to physical streams and
/// signals.
///
/// The logical stream type is defined recursively by means of a number of
/// stream types. Two classes of stream types are defined: stream-manipulating
/// types, and element-manipulating types.
///
/// # Examples
///
/// ```rust
/// ```
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#logical-stream-type)
#[derive(Debug, Clone, PartialEq)]
pub enum LogicalStreamType {
/// The Null stream type indicates the transferrence of one-valued data: it
/// is only valid value is ∅ (null).
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#null)
Null,
/// The Bits stream type, defined as `Bits(b)`, indicates the transferrence
/// of `2^b`-valued data carried by means of a group of `b` bits, where`b`
/// is a positive integer.
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#bits)
Bits(Positive),
/// The Group stream type acts as a product type (composition).
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#group)
Group(Group),
/// The Union stream type acts as a sum type (exclusive disjunction).
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#union)
Union(Union),
/// The Stream type is used to define a new physical stream.
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#stream)
Stream(Stream),
}
impl TryFrom<NonNegative> for LogicalStreamType {
type Error = Error;
/// Returns a new Bits stream type with the provided bit count as number of
/// bits. Returns an error when the bit count is zero.
fn try_from(bit_count: NonNegative) -> Result<Self> {
LogicalStreamType::try_new_bits(bit_count)
}
}
impl From<Positive> for LogicalStreamType {
fn from(bit_count: Positive) -> Self {
LogicalStreamType::Bits(bit_count)
}
}
impl LogicalStreamType {
/// Returns a new Bits stream type with the provided bit count as number of
/// bits. Returns an error when the bit count is zero.
///
/// # Examples
///
/// ```rust
/// use tydi::{Error, logical::LogicalStreamType, Positive};
///
/// let bits = LogicalStreamType::try_new_bits(4);
/// let zero = LogicalStreamType::try_new_bits(0);
///
/// assert_eq!(bits, Ok(LogicalStreamType::Bits(Positive::new(4).unwrap())));
/// assert_eq!(zero, Err(Error::InvalidArgument("bit count cannot be zero".to_string())));
/// # Ok::<(), Box<dyn std::error::Error>>(())
/// ```
pub fn try_new_bits(bit_count: NonNegative) -> Result<Self> {
Ok(LogicalStreamType::Bits(
Positive::new(bit_count)
.ok_or_else(|| Error::InvalidArgument("bit count cannot be zero".to_string()))?,
))
}
/// Returns a new Group stream type from the provided iterator of names and
/// stream types. Returns an error when the values cannot be converted into
/// valid names, or valid logical stream types as required by [`Group`].
///
/// # Examples
///
/// ```rust
/// use tydi::{Error, logical::{Group, LogicalStreamType}};
///
/// let group = LogicalStreamType::try_new_group(
/// vec![
/// ("a", 4), // TryFrom<NonNegative> for LogicalStreamType::Bits.
/// ("b", 12),
/// ]
/// )?;
///
/// assert!(match group {
/// LogicalStreamType::Group(_) => true,
/// _ => false,
/// });
///
/// assert_eq!(
/// LogicalStreamType::try_new_group(vec![("1badname", 4)]),
/// Err(Error::InvalidArgument("name cannot start with a digit".to_string()))
/// );
/// assert_eq!(
/// LogicalStreamType::try_new_group(vec![("good_name", 0)]),
/// Err(Error::InvalidArgument("bit count cannot be zero".to_string()))
/// );
///
/// # Ok::<(), Box<dyn std::error::Error>>(())
/// ```
///
/// [`Group`]: ./struct.Group.html
pub fn try_new_group(
group: impl IntoIterator<
Item = (
impl TryInto<Name, Error = impl Into<Box<dyn error::Error>>>,
impl TryInto<LogicalStreamType, Error = impl Into<Box<dyn error::Error>>>,
),
>,
) -> Result<Self> {
Group::try_new(group).map(Into::into)
}
pub fn try_new_union(
union: impl IntoIterator<
Item = (
impl TryInto<Name, Error = impl Into<Box<dyn error::Error>>>,
impl TryInto<LogicalStreamType, Error = impl Into<Box<dyn error::Error>>>,
),
>,
) -> Result<Self> {
Union::try_new(union).map(Into::into)
}
/// Returns true if this logical stream consists of only element-
/// manipulating stream types. This recursively checks all inner stream
/// types.
///
/// # Examples
///
/// ```rust
/// use tydi::logical::LogicalStreamType;
///
/// assert!(LogicalStreamType::Null.is_element_only());
/// assert!(LogicalStreamType::try_new_bits(3)?.is_element_only());
///
/// # Ok::<(), Box<dyn std::error::Error>>(())
/// ```
pub fn is_element_only(&self) -> bool {
match self {
LogicalStreamType::Null | LogicalStreamType::Bits(_) => true,
LogicalStreamType::Group(Group(fields)) | LogicalStreamType::Union(Union(fields)) => {
fields.values().all(|stream| stream.is_element_only())
}
LogicalStreamType::Stream(stream) => stream.data.is_element_only(),
}
}
/// Returns true if and only if this logical stream does not result in any
/// signals.
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#null-detection-function)
pub fn is_null(&self) -> bool {
match self {
LogicalStreamType::Null => true,
LogicalStreamType::Group(Group(fields)) => {
fields.values().all(|stream| stream.is_null())
}
LogicalStreamType::Union(Union(fields)) => {
fields.len() == 1 && fields.values().all(|stream| stream.is_null())
}
LogicalStreamType::Stream(stream) => stream.is_null(),
LogicalStreamType::Bits(_) => false,
}
}
/// Splits a logical stream type into simplified stream types.
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#split-function)
pub(crate) fn split(&self) -> SplitStreams {
match self {
LogicalStreamType::Stream(stream_in) => {
let mut streams = IndexMap::new();
let split = stream_in.data.split();
let (element, rest) = (split.signals, split.streams);
if !element.is_null()
|| (stream_in.user.is_some() && !stream_in.user.as_ref().unwrap().is_null())
|| stream_in.keep
{
streams.insert(
PathName::new_empty(),
// todo: add method
Stream::new(
element,
stream_in.throughput,
stream_in.dimensionality,
stream_in.synchronicity,
stream_in.complexity.clone(),
stream_in.direction,
stream_in.user.clone().map(|stream| *stream),
stream_in.keep,
)
.into(),
);
}
streams.extend(rest.into_iter().map(|(name, stream)| match stream {
LogicalStreamType::Stream(mut stream) => {
if stream_in.direction == Direction::Reverse {
stream.reverse();
}
if stream_in.synchronicity == Synchronicity::Flatten
|| stream_in.synchronicity == Synchronicity::FlatDesync
{
stream.set_synchronicity(Synchronicity::FlatDesync);
}
if stream.synchronicity != Synchronicity::Flatten
&& stream_in.synchronicity != Synchronicity::FlatDesync
{
stream.set_dimensionality(
stream.dimensionality + stream_in.dimensionality,
);
};
stream.set_throughput(stream.throughput * stream_in.throughput);
(name, stream.into())
}
_ => unreachable!(),
}));
SplitStreams {
signals: LogicalStreamType::Null,
streams,
}
}
LogicalStreamType::Null | LogicalStreamType::Bits(_) => SplitStreams {
signals: self.clone(),
streams: IndexMap::new(),
},
LogicalStreamType::Group(Group(fields)) | LogicalStreamType::Union(Union(fields)) => {
let signals = fields
.into_iter()
.map(|(name, stream)| (name.clone(), stream.split().signals))
.collect();
SplitStreams {
signals: match self {
LogicalStreamType::Group(_) => LogicalStreamType::Group(Group(signals)),
LogicalStreamType::Union(_) => LogicalStreamType::Union(Union(signals)),
_ => unreachable!(),
},
streams: fields
.into_iter()
.map(|(name, stream)| {
stream.split().streams.into_iter().map(
move |(mut path_name, stream_)| {
path_name.push(name.clone());
(path_name, stream_)
},
)
})
.flatten()
.collect(),
}
}
}
}
/// Flattens a logical stream type consisting of Null, Bits, Group and
/// Union stream types into a [`Fields`].
///
/// [Reference](https://abs-tudelft.github.io/tydi/specification/logical.html#field-conversion-function)
///
/// [`Fields`]: ./struct.Fields.html
pub fn fields(&self) -> Fields {
let mut fields = Fields::new_empty();
match self {
LogicalStreamType::Null | LogicalStreamType::Stream(_) => fields,
LogicalStreamType::Bits(b) => {
fields.insert(PathName::new_empty(), *b).unwrap();
fields
}
LogicalStreamType::Group(Group(inner)) => {
inner.iter().for_each(|(name, stream)| {
stream.fields().iter().for_each(|(path_name, bit_count)| {
fields
.insert(path_name.with_parent(name.clone()), *bit_count)
.unwrap();
})
});
fields
}
LogicalStreamType::Union(Union(inner)) => {
if inner.len() > 1 {
fields
.insert(
PathName::try_new(vec!["tag"]).unwrap(),
BitCount::new(log2_ceil(
BitCount::new(inner.len() as NonNegative).unwrap(),
))
.unwrap(),
)
.unwrap();
}
let b = inner.iter().fold(0, |acc, (_, stream)| {
acc.max(
stream
.fields()
.values()
.fold(0, |acc, count| acc.max(count.get())),
)
});
if b > 0 {
fields
.insert(
PathName::try_new(vec!["union"]).unwrap(),
BitCount::new(b).unwrap(),
)
.unwrap();
}
fields
}
}
}
pub fn synthesize(&self) -> LogicalStream {
let split = self.split();
let (signals, rest) = (split.signals.fields(), split.streams);
LogicalStream {
signals,
streams: rest
.into_iter()
.map(|(path_name, stream)| match stream {
LogicalStreamType::Stream(stream) => (
path_name,
PhysicalStream::new(
stream.data.fields(),
Positive::new(stream.throughput.get().ceil() as NonNegative).unwrap(),
stream.dimensionality,
stream.complexity,
stream
.user
.map(|stream| stream.fields())
.unwrap_or_else(Fields::new_empty),
),
),
_ => unreachable!(),
})
.collect(),
}
}
pub fn compatible(&self, other: &LogicalStreamType) -> bool {
self == other
|| match other {
LogicalStreamType::Stream(other) => match self {
LogicalStreamType::Stream(stream) => {
stream.data.compatible(&other.data) && stream.complexity < other.complexity
}
_ => false,
},
_ => false,
}
|| match self {
LogicalStreamType::Group(Group(source))
| LogicalStreamType::Union(Union(source)) => match other {
LogicalStreamType::Group(Group(sink))
| LogicalStreamType::Union(Union(sink)) => {
source.len() == sink.len()
&& source.iter().zip(sink.iter()).all(
|((name, stream), (name_, stream_))| {
name == name_ && stream.compatible(&stream_)
},
)
}
_ => false,
},
_ => false,
}
}
}
#[derive(Debug, Clone, PartialEq)]
pub(crate) struct SplitStreams {
signals: LogicalStreamType,
streams: IndexMap<PathName, LogicalStreamType>,
}
impl SplitStreams {
pub fn streams(&self) -> impl Iterator<Item = (&PathName, &LogicalStreamType)> {
self.streams.iter()
}
pub fn signal(&self) -> &LogicalStreamType {
&self.signals
}
}
#[derive(Debug, Clone, PartialEq)]
pub struct LogicalStream {
signals: Fields,
streams: IndexMap<PathName, PhysicalStream>,
}
impl LogicalStream {
pub fn signals(&self) -> impl Iterator<Item = (&PathName, &BitCount)> {
self.signals.iter()
}
pub fn streams(&self) -> impl Iterator<Item = (&PathName, &PhysicalStream)> {
self.streams.iter()
}
}
#[cfg(test)]
pub(crate) mod tests {
use super::*;
/// Module containing functions that return common LogicalStreamTypes that are not streams.
/// To be used for testing purposes only.
pub(crate) mod elements {
use super::*;
pub(crate) fn prim(bits: u32) -> LogicalStreamType {
LogicalStreamType::try_new_bits(bits).unwrap()
}
pub(crate) fn group() -> LogicalStreamType {
LogicalStreamType::try_new_group(vec![("a", prim(42)), ("b", prim(1337))]).unwrap()
}
pub(crate) fn group_of_single() -> LogicalStreamType {
LogicalStreamType::try_new_group(vec![("a", prim(42))]).unwrap()
}
pub(crate) fn group_nested() -> LogicalStreamType {
LogicalStreamType::try_new_group(vec![("c", group()), ("d", group())]).unwrap()
}
}
/// Module containing functions that return common LogicalStreamTypes to be used for testing
/// purposed only.
pub(crate) mod streams {
use super::*;
pub(crate) fn prim(bits: u32) -> LogicalStreamType {
LogicalStreamType::from(Stream::new_basic(elements::prim(bits)))
}
pub(crate) fn group() -> LogicalStreamType {
LogicalStreamType::try_new_group(vec![("a", prim(42)), ("b", prim(1337))]).unwrap()
}
pub(crate) fn nested() -> LogicalStreamType {
LogicalStreamType::from(Stream::new_basic(LogicalStreamType::from(Stream {
data: Box::new(elements::prim(8)),
throughput: PositiveReal::new(1.).unwrap(),
dimensionality: 1,
synchronicity: Synchronicity::Sync,
complexity: Complexity::default(),
direction: Direction::Forward,
user: None,
keep: false,
})))
}
}
#[test]
fn union() -> Result<()> {
let b = LogicalStreamType::try_new_group(vec![("x", 2), ("y", 2)])?;
let c = Stream::new(
LogicalStreamType::Bits(Positive::new(4).unwrap()),
PositiveReal::new(1.).unwrap(),
1,
Synchronicity::Sync,
1,
Direction::Forward,
None,
false,
);
let u = LogicalStreamType::try_new_union(vec![
("a", 3.try_into()?),
("b", b.clone()),
("c", LogicalStreamType::Stream(c)),
])?;
let stream: LogicalStreamType = Stream::new(
u,
PositiveReal::new(1.).unwrap(),
1,
Synchronicity::Sync,
1,
Direction::Forward,
None,
false,
)
.into();
let logical_stream = stream.synthesize();
assert_eq!(logical_stream.streams.len(), 2);
assert_eq!(
logical_stream.streams.keys().collect::<Vec<_>>(),
vec![&PathName::new_empty(), &PathName::try_new(vec!["c"])?]
);
assert_eq!(
logical_stream
.streams
.values()
.map(|physical_stream| physical_stream.element_fields().iter())
.flatten()
.collect::<Vec<_>>(),
vec![
(&PathName::try_new(vec!["tag"])?, &Positive::new(2).unwrap()),
(
&PathName::try_new(vec!["union"])?,
&Positive::new(3).unwrap()
),
(&PathName::new_empty(), &Positive::new(4).unwrap()),
]
);
assert_eq!(
logical_stream
.streams
.values()
.map(|physical_stream| physical_stream.dimensionality())
.collect::<Vec<_>>(),
vec![1, 2]
);
let c = Stream::new(
LogicalStreamType::Bits(Positive::new(4).unwrap()),
PositiveReal::new(1.).unwrap(),
1,
Synchronicity::Flatten,
1,
Direction::Forward,
None,
false,
);
let u = LogicalStreamType::try_new_union(vec![
("a", 3.try_into()?),
("b", b.clone()),
("c", c.into()),
])?;
let stream: LogicalStreamType = Stream::new(
u,
PositiveReal::new(1.).unwrap(),
1,
Synchronicity::Sync,
1,
Direction::Forward,
None,
false,
)
.into();
let logical_stream = stream.synthesize();
assert_eq!(
logical_stream
.streams
.values()
.map(|physical_stream| physical_stream.dimensionality())
.collect::<Vec<_>>(),
vec![1, 1]
);
let c = Stream::new(
LogicalStreamType::Bits(Positive::new(4).unwrap()),
PositiveReal::new(1.).unwrap(),
1,
Synchronicity::Desync,
1,
Direction::Forward,
None,
false,
);
let u = LogicalStreamType::try_new_union(vec![
("a", 3.try_into()?),
("b", b),
("c", c.into()),
])?;
let stream: LogicalStreamType = Stream::new(
u,
PositiveReal::new(1.).unwrap(),
1,
Synchronicity::Sync,
1,
Direction::Forward,
None,
false,
)
.into();
let logical_stream = stream.synthesize();
assert_eq!(
logical_stream
.streams
.values()
.map(|physical_stream| physical_stream.dimensionality())
.collect::<Vec<_>>(),
vec![1, 2]
);
Ok(())
}
}