Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenXiangShan
XiangShan
提交
a925ff18
X
XiangShan
项目概览
OpenXiangShan
/
XiangShan
11 个月 前同步成功
通知
1183
Star
3914
Fork
526
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
X
XiangShan
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
未验证
提交
a925ff18
编写于
11月 22, 2020
作者:
Y
Yinan Xu
提交者:
GitHub
11月 22, 2020
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #255 from RISCVERS/sbuffer-test
SbufferLRU update one time
上级
cdd5c498
f4e4f867
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
11 addition
and
19 deletion
+11
-19
src/main/scala/utils/Replacement.scala
src/main/scala/utils/Replacement.scala
+11
-19
未找到文件。
src/main/scala/utils/Replacement.scala
浏览文件 @
a925ff18
...
...
@@ -170,35 +170,30 @@ class SbufferLRU(n_ways: Int) {
private
val
state_reg
=
RegInit
(
0.
U
(
nBits
.
W
))
def
state_read
=
WireDefault
(
state_reg
)
def
get_next_state
(
state
:
UInt
,
touch_way
:
UInt
)
:
UInt
=
{
// set the row touched with 1, column with 0
def
get_next_state
(
state
:
UInt
,
touch_ways
:
Seq
[
Valid
[
UInt
]])
:
UInt
=
{
val
nextState
=
Wire
(
Vec
(
n_ways
,
UInt
(
n_ways
.
W
)))
val
moreRecentVec
=
state
.
asTypeOf
(
Vec
(
n_ways
,
UInt
(
n_ways
.
W
)))
val
wayDec
=
UIntToOH
(
touch_way
,
n_ways
)
val
wayDecs
=
touch_ways
.
map
(
w
=>
Mux
(
w
.
valid
,
UIntToOH
(
w
.
bits
,
n_ways
),
0.
U
)
)
val
wayDec
=
ParallelOR
(
wayDecs
)
val
wayUpd
=
(~
wayDec
).
asUInt
()
nextState
.
zipWithIndex
.
foreach
{
case
(
e
,
i
)
=>
e
:=
Mux
(
i
.
U
===
touch_way
,
wayUpd
,
moreRecentVec
(
i
)
&
wayUpd
)
e
:=
Mux
(
wayDec
(
i
),
wayUpd
,
moreRecentVec
(
i
)
&
wayUpd
)
}
nextState
.
asUInt
()
}
def
get_next_state
(
state
:
UInt
,
touch_ways
:
Seq
[
Valid
[
UInt
]])
:
UInt
=
{
touch_ways
.
foldLeft
(
state
)((
prev
,
touch_way
)
=>
Mux
(
touch_way
.
valid
,
get_next_state
(
prev
,
touch_way
.
bits
),
prev
))
}
def
access
(
touch_way
:
UInt
)
{
state_reg
:=
get_next_state
(
state_reg
,
touch_way
)
}
// update the stateRect
def
access
(
touch_ways
:
Seq
[
Valid
[
UInt
]])
{
when
(
ParallelOR
(
touch_ways
.
map
(
_
.
valid
)))
{
state_reg
:=
get_next_state
(
state_reg
,
touch_ways
)
}
}
// get the index of the smallest value from a set of numbers
def
get_min_value
(
xs
:
Seq
[(
UInt
,
UInt
)])
:
(
UInt
,
UInt
)
=
{
xs
match
{
case
Seq
(
a
)
=>
a
...
...
@@ -208,6 +203,7 @@ class SbufferLRU(n_ways: Int) {
}
}
// get the way which is valid and has the least 1
def
get_replace_way
(
state
:
UInt
,
sbufferState
:
Seq
[
Bool
])
:
UInt
=
{
val
moreRecentVec
=
state
.
asTypeOf
(
Vec
(
n_ways
,
UInt
(
n_ways
.
W
)))
val
count
=
Wire
(
Vec
(
n_ways
,
UInt
(
log2Up
(
n_ways
).
W
)))
...
...
@@ -218,11 +214,7 @@ class SbufferLRU(n_ways: Int) {
get_min_value
(
count
.
zip
((
0
until
n_ways
).
map
(
_
.
U
))).
_2
}
def
way
(
sbufferState
:
Seq
[
Bool
])
=
get_replace_way
(
state_reg
,
sbufferState
)
//def miss = access(way)
def
way
(
sbufferState
:
Seq
[
Bool
])
=
get_replace_way
(
state_reg
,
sbufferState
)
def
hit
=
{}
def
flush
()
=
{
state_reg
:=
0.
U
(
nBits
.
W
)
}
//@deprecated("replace 'replace' with 'way' from abstract class ReplacementPolicy","Rocket Chip 2020.05")
//def replace: UInt = way
}
\ No newline at end of file
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录