130 lines
4.2 KiB
Scala
130 lines
4.2 KiB
Scala
|
|
package BACK
|
||
|
|
|
||
|
|
import chisel3._
|
||
|
|
import chisel3.util._
|
||
|
|
|
||
|
|
|
||
|
|
trait BackBoardSlvQei{ this: BackBoardSlvLocal =>
|
||
|
|
val phaseA = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
val phaseB = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
val counter = for( i <- 0 until 2 ) yield { Reg(UInt(32.W)) }
|
||
|
|
val encordNxt = for( i <- 0 until 2 ) yield { Cat( phaseB(i), phaseA(i) ) }
|
||
|
|
val encordCur = for( i <- 0 until 2 ) yield { RegNext(encordNxt) }
|
||
|
|
|
||
|
|
val isEnable = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
val isSign = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
val isInit = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
val initVal = for( i <- 0 until 2 ) yield { Wire(UInt(32.W)) }
|
||
|
|
val mode = for( i <- 0 until 2 ) yield { Wire(UInt(2.W)) }
|
||
|
|
val overflow = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
val invDirect = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
val isAdvA = for( i <- 0 until 2 ) yield {
|
||
|
|
( encordCur(i) === "b00".U & encordNxt(i) === "b01".U & mode(i).extract(1)) |
|
||
|
|
( encordCur(i) === "b01".U & encordNxt(i) === "b11".U & mode(i) =/= "b00".U ) |
|
||
|
|
( encordCur(i) === "b11".U & encordNxt(i) === "b10".U & mode(i).extract(1)) |
|
||
|
|
( encordCur(i) === "b10".U & encordNxt(i) === "b00".U )
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
val isAdvB = for( i <- 0 until 2 ) yield {
|
||
|
|
( encordNxt(i) === "b00".U & encordCur(i) === "b01".U ) |
|
||
|
|
( encordNxt(i) === "b01".U & encordCur(i) === "b11".U & mode(i).extract(1)) |
|
||
|
|
( encordNxt(i) === "b11".U & encordCur(i) === "b10".U & mode(i) =/= "b00".U ) |
|
||
|
|
( encordNxt(i) === "b10".U & encordCur(i) === "b00".U & mode(i).extract(1))
|
||
|
|
}
|
||
|
|
|
||
|
|
val isMiss = for( i <- 0 until 2 ) yield { encordCur(i) === ~encordNxt(i) }
|
||
|
|
val isKeep = for( i <- 0 until 2 ) yield { encordCur(i) === encordNxt(i) }
|
||
|
|
val isOverflow = for( i <- 0 until 2 ) yield { Wire(Bool()) }
|
||
|
|
|
||
|
|
for( i <- 0 until 2 ){
|
||
|
|
|
||
|
|
|
||
|
|
isOverflow(i) := false.B
|
||
|
|
when(isEnable(i)){
|
||
|
|
when( isMiss(i) ){
|
||
|
|
printf("Warning! QEI Miss one pulse!\n")
|
||
|
|
} .elsewhen( isAdvA(i) ){
|
||
|
|
when( isSign(i) ) {
|
||
|
|
when( invDirect(i) ){
|
||
|
|
when( overflow & counter(i) === "h80000000".U ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) - 1.U
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
when( overflow & counter(i) === "h7FFFFFFF".U ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) + 1.U
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
when( invDirect(i) ){
|
||
|
|
when( overflow & counter(i) === 0.U ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) - 1.U
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
when( overflow & counter(i) === "hFFFFFFFF.U" ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) + 1.U
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} .elsewhen( isAdvB(i) ){
|
||
|
|
when( isSign(i) ) {
|
||
|
|
when( invDirect(i) ){
|
||
|
|
when( overflow & counter(i) === "h7FFFFFFF".U ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) + 1.U
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
when( overflow & counter(i) === "h80000000".U ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) - 1.U
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
when( invDirect(i) ){
|
||
|
|
when( overflow & counter(i) === "hFFFFFFFF.U" ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) + 1.U
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
when( overflow & counter(i) === 0.U ){
|
||
|
|
counter(i) := counter(i)
|
||
|
|
isOverflow(i) := true.B
|
||
|
|
} .otherwise{
|
||
|
|
counter(i) := counter(i) - 1.U
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} .otherwise{
|
||
|
|
assert( isKeep(i) )
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
|