Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
Kernel
提交
37859a75
K
Kernel
项目概览
openeuler
/
Kernel
1 年多 前同步成功
通知
8
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
K
Kernel
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
提交
37859a75
编写于
3月 20, 2013
作者:
R
Rafał Miłecki
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
b43: N-PHY: use more friendly variables names in RSSI code
Signed-off-by:
N
Rafał Miłecki
<
zajec5@gmail.com
>
上级
e5ab1fd7
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
36 addition
and
28 deletion
+36
-28
drivers/net/wireless/b43/phy_n.c
drivers/net/wireless/b43/phy_n.c
+36
-28
未找到文件。
drivers/net/wireless/b43/phy_n.c
浏览文件 @
37859a75
...
...
@@ -1590,7 +1590,7 @@ static void b43_nphy_rev3_rssi_cal(struct b43_wldev *dev)
u16
r
;
/* routing */
u8
rx_core_state
;
u8
core
,
i
,
j
;
int
core
,
i
,
j
,
vcm
;
class
=
b43_nphy_classifier
(
dev
,
0
,
0
);
b43_nphy_classifier
(
dev
,
7
,
4
);
...
...
@@ -1624,33 +1624,40 @@ static void b43_nphy_rev3_rssi_cal(struct b43_wldev *dev)
r
=
core
?
B2056_RX1
:
B2056_RX0
;
b43_nphy_scale_offset_rssi
(
dev
,
0
,
0
,
core
+
1
,
N_RAIL_I
,
2
);
b43_nphy_scale_offset_rssi
(
dev
,
0
,
0
,
core
+
1
,
N_RAIL_Q
,
2
);
for
(
i
=
0
;
i
<
8
;
i
++
)
{
/* Grab RSSI results for every possible VCM */
for
(
vcm
=
0
;
vcm
<
8
;
vcm
++
)
{
b43_radio_maskset
(
dev
,
r
|
B2056_RX_RSSI_MISC
,
0xE3
,
i
<<
2
);
b43_nphy_poll_rssi
(
dev
,
2
,
results
[
i
],
8
);
vcm
<<
2
);
b43_nphy_poll_rssi
(
dev
,
2
,
results
[
vcm
],
8
);
}
/* Find out which VCM got the best results */
for
(
i
=
0
;
i
<
4
;
i
+=
2
)
{
s32
curr
;
s32
curr
d
;
s32
mind
=
0x100000
;
s32
minpoll
=
249
;
u8
minvcm
=
0
;
if
(
2
*
core
!=
i
)
continue
;
for
(
j
=
0
;
j
<
8
;
j
++
)
{
curr
=
results
[
j
][
i
]
*
results
[
j
][
i
]
+
results
[
j
][
i
+
1
]
*
results
[
j
][
i
];
if
(
curr
<
mind
)
{
mind
=
curr
;
minvcm
=
j
;
for
(
vcm
=
0
;
vcm
<
8
;
vcm
++
)
{
curr
d
=
results
[
vcm
][
i
]
*
results
[
vcm
][
i
]
+
results
[
vcm
][
i
+
1
]
*
results
[
vcm
][
i
];
if
(
curr
d
<
mind
)
{
mind
=
curr
d
;
minvcm
=
vcm
;
}
if
(
results
[
j
][
i
]
<
minpoll
)
minpoll
=
results
[
j
][
i
];
if
(
results
[
vcm
][
i
]
<
minpoll
)
minpoll
=
results
[
vcm
][
i
];
}
vcm_final
=
minvcm
;
results_min
[
i
]
=
minpoll
;
}
/* Select the best VCM */
b43_radio_maskset
(
dev
,
r
|
B2056_RX_RSSI_MISC
,
0xE3
,
vcm_final
<<
2
);
for
(
i
=
0
;
i
<
4
;
i
++
)
{
if
(
core
!=
i
/
2
)
continue
;
...
...
@@ -1667,6 +1674,7 @@ static void b43_nphy_rev3_rssi_cal(struct b43_wldev *dev)
2
);
}
}
for
(
core
=
0
;
core
<
2
;
core
++
)
{
if
(
!
(
rx_core_state
&
(
1
<<
core
)))
continue
;
...
...
@@ -1743,7 +1751,7 @@ static void b43_nphy_rev3_rssi_cal(struct b43_wldev *dev)
/* http://bcm-v4.sipsolutions.net/802.11/PHY/N/RSSICal */
static
void
b43_nphy_rev2_rssi_cal
(
struct
b43_wldev
*
dev
,
u8
type
)
{
int
i
,
j
;
int
i
,
j
,
vcm
;
u8
state
[
4
];
u8
code
,
val
;
u16
class
,
override
;
...
...
@@ -1803,37 +1811,37 @@ static void b43_nphy_rev2_rssi_cal(struct b43_wldev *dev, u8 type)
b43_nphy_scale_offset_rssi
(
dev
,
0
,
0
,
5
,
N_RAIL_I
,
type
);
b43_nphy_scale_offset_rssi
(
dev
,
0
,
0
,
5
,
N_RAIL_Q
,
type
);
for
(
i
=
0
;
i
<
4
;
i
++
)
{
for
(
vcm
=
0
;
vcm
<
4
;
vcm
++
)
{
u8
tmp
[
4
];
for
(
j
=
0
;
j
<
4
;
j
++
)
tmp
[
j
]
=
i
;
tmp
[
j
]
=
vcm
;
if
(
type
!=
1
)
b43_nphy_set_rssi_2055_vcm
(
dev
,
type
,
tmp
);
b43_nphy_poll_rssi
(
dev
,
type
,
results
[
i
],
8
);
b43_nphy_poll_rssi
(
dev
,
type
,
results
[
vcm
],
8
);
if
(
type
<
2
)
for
(
j
=
0
;
j
<
2
;
j
++
)
miniq
[
i
][
j
]
=
min
(
results
[
i
][
2
*
j
],
results
[
i
][
2
*
j
+
1
]);
miniq
[
vcm
][
j
]
=
min
(
results
[
vcm
][
2
*
j
],
results
[
vcm
][
2
*
j
+
1
]);
}
for
(
i
=
0
;
i
<
4
;
i
++
)
{
s32
mind
=
0x100000
;
u8
minvcm
=
0
;
s32
minpoll
=
249
;
s32
curr
;
for
(
j
=
0
;
j
<
4
;
j
++
)
{
s32
curr
d
;
for
(
vcm
=
0
;
vcm
<
4
;
vcm
++
)
{
if
(
type
==
2
)
curr
=
abs
(
results
[
j
][
i
]);
curr
d
=
abs
(
results
[
vcm
][
i
]);
else
curr
=
abs
(
miniq
[
j
][
i
/
2
]
-
code
*
8
);
curr
d
=
abs
(
miniq
[
vcm
][
i
/
2
]
-
code
*
8
);
if
(
curr
<
mind
)
{
mind
=
curr
;
minvcm
=
j
;
if
(
curr
d
<
mind
)
{
mind
=
curr
d
;
minvcm
=
vcm
;
}
if
(
results
[
j
][
i
]
<
minpoll
)
minpoll
=
results
[
j
][
i
];
if
(
results
[
vcm
][
i
]
<
minpoll
)
minpoll
=
results
[
vcm
][
i
];
}
results_min
[
i
]
=
minpoll
;
vcm_final
[
i
]
=
minvcm
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录