@@ -23,11 +23,11 @@ class S4Router[T <: Data](schedule: Array[Array[Int]], dt: T) extends Module {
2323
2424 // Just convert schedule table to a Chisel type table
2525 // unused slot is -1, convert to 0.U
26- val sched = Wire (Vec (schedule.length, Vec (Const .NR_OF_PORTS , UInt (3 .W ))))
26+ val sched = Wire (Vec (schedule.length, Vec (s4noc. Const .NR_OF_PORTS , UInt (3 .W ))))
2727 for (i <- 0 until schedule.length) {
28- for (j <- 0 until Const .NR_OF_PORTS ) {
28+ for (j <- 0 until s4noc. Const .NR_OF_PORTS ) {
2929 val s = schedule(i)(j)
30- val v = if (s == - 1 ) Const .INVALID else s
30+ val v = if (s == - 1 ) s4noc. Const .INVALID else s
3131 sched(i)(j) := v.U (3 .W )
3232 }
3333 }
@@ -38,9 +38,9 @@ class S4Router[T <: Data](schedule: Array[Array[Int]], dt: T) extends Module {
3838 // TODO: test if this movement of the register past the schedule table works, better here a register
3939 // val currentSched = RegNext(sched(regCounter))
4040
41- for (j <- 0 until Const .NR_OF_PORTS ) {
41+ for (j <- 0 until s4noc. Const .NR_OF_PORTS ) {
4242 io.ports(j).out.data := RegNext (io.ports(currentSched(j)).in.data)
43- io.ports(j).out.valid := RegNext (Mux (currentSched(j) === Const .INVALID .U , false .B , io.ports(currentSched(j)).in.valid), init = false .B )
43+ io.ports(j).out.valid := RegNext (Mux (currentSched(j) === s4noc. Const .INVALID .U , false .B , io.ports(currentSched(j)).in.valid), init = false .B )
4444 }
4545}
4646
0 commit comments