Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
openeuler
Kernel
提交
4085e155
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看板
提交
4085e155
编写于
4月 06, 2012
作者:
A
Al Viro
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
hpfs: get rid of bitfields endianness wanking in extended_attribute
Signed-off-by:
N
Al Viro
<
viro@zeniv.linux.org.uk
>
上级
185553b2
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
35 addition
and
34 deletion
+35
-34
fs/hpfs/anode.c
fs/hpfs/anode.c
+2
-2
fs/hpfs/ea.c
fs/hpfs/ea.c
+17
-17
fs/hpfs/hpfs.h
fs/hpfs/hpfs.h
+16
-15
未找到文件。
fs/hpfs/anode.c
浏览文件 @
4085e155
...
...
@@ -483,8 +483,8 @@ void hpfs_remove_fnode(struct super_block *s, fnode_secno fno)
else
hpfs_remove_dtree
(
s
,
le32_to_cpu
(
fnode
->
u
.
external
[
0
].
disk_secno
));
ea_end
=
fnode_end_ea
(
fnode
);
for
(
ea
=
fnode_ea
(
fnode
);
ea
<
ea_end
;
ea
=
next_ea
(
ea
))
if
(
ea
->
indirect
)
hpfs_ea_remove
(
s
,
ea_sec
(
ea
),
ea
->
anode
,
ea_len
(
ea
));
if
(
ea
_indirect
(
ea
)
)
hpfs_ea_remove
(
s
,
ea_sec
(
ea
),
ea
_in_anode
(
ea
)
,
ea_len
(
ea
));
hpfs_ea_ext_remove
(
s
,
le32_to_cpu
(
fnode
->
ea_secno
),
fnode
->
ea_anode
,
le32_to_cpu
(
fnode
->
ea_size_l
));
brelse
(
bh
);
hpfs_free_sectors
(
s
,
fno
,
1
);
...
...
fs/hpfs/ea.c
浏览文件 @
4085e155
...
...
@@ -23,15 +23,15 @@ void hpfs_ea_ext_remove(struct super_block *s, secno a, int ano, unsigned len)
return
;
}
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
,
4
,
ex
))
return
;
if
(
ea
->
indirect
)
{
if
(
ea
_indirect
(
ea
)
)
{
if
(
ea_valuelen
(
ea
)
!=
8
)
{
hpfs_error
(
s
,
"ea
->indirect
set while ea->valuelen!=8, %s %08x, pos %08x"
,
hpfs_error
(
s
,
"ea
_indirect(ea)
set while ea->valuelen!=8, %s %08x, pos %08x"
,
ano
?
"anode"
:
"sectors"
,
a
,
pos
);
return
;
}
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
9
,
ex
+
4
))
return
;
hpfs_ea_remove
(
s
,
ea_sec
(
ea
),
ea
->
anode
,
ea_len
(
ea
));
hpfs_ea_remove
(
s
,
ea_sec
(
ea
),
ea
_in_anode
(
ea
)
,
ea_len
(
ea
));
}
pos
+=
ea
->
namelen
+
ea_valuelen
(
ea
)
+
5
;
}
...
...
@@ -81,7 +81,7 @@ int hpfs_read_ea(struct super_block *s, struct fnode *fnode, char *key,
struct
extended_attribute
*
ea_end
=
fnode_end_ea
(
fnode
);
for
(
ea
=
fnode_ea
(
fnode
);
ea
<
ea_end
;
ea
=
next_ea
(
ea
))
if
(
!
strcmp
(
ea
->
name
,
key
))
{
if
(
ea
->
indirect
)
if
(
ea
_indirect
(
ea
)
)
goto
indirect
;
if
(
ea_valuelen
(
ea
)
>=
size
)
return
-
EINVAL
;
...
...
@@ -101,10 +101,10 @@ int hpfs_read_ea(struct super_block *s, struct fnode *fnode, char *key,
return
-
EIO
;
}
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
,
4
,
ex
))
return
-
EIO
;
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
1
+
(
ea
->
indirect
?
8
:
0
),
ex
+
4
))
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
1
+
(
ea
_indirect
(
ea
)
?
8
:
0
),
ex
+
4
))
return
-
EIO
;
if
(
!
strcmp
(
ea
->
name
,
key
))
{
if
(
ea
->
indirect
)
if
(
ea
_indirect
(
ea
)
)
goto
indirect
;
if
(
ea_valuelen
(
ea
)
>=
size
)
return
-
EINVAL
;
...
...
@@ -119,7 +119,7 @@ int hpfs_read_ea(struct super_block *s, struct fnode *fnode, char *key,
indirect:
if
(
ea_len
(
ea
)
>=
size
)
return
-
EINVAL
;
if
(
hpfs_ea_read
(
s
,
ea_sec
(
ea
),
ea
->
anode
,
0
,
ea_len
(
ea
),
buf
))
if
(
hpfs_ea_read
(
s
,
ea_sec
(
ea
),
ea
_in_anode
(
ea
)
,
0
,
ea_len
(
ea
),
buf
))
return
-
EIO
;
buf
[
ea_len
(
ea
)]
=
0
;
return
0
;
...
...
@@ -136,8 +136,8 @@ char *hpfs_get_ea(struct super_block *s, struct fnode *fnode, char *key, int *si
struct
extended_attribute
*
ea_end
=
fnode_end_ea
(
fnode
);
for
(
ea
=
fnode_ea
(
fnode
);
ea
<
ea_end
;
ea
=
next_ea
(
ea
))
if
(
!
strcmp
(
ea
->
name
,
key
))
{
if
(
ea
->
indirect
)
return
get_indirect_ea
(
s
,
ea
->
anode
,
ea_sec
(
ea
),
*
size
=
ea_len
(
ea
));
if
(
ea
_indirect
(
ea
)
)
return
get_indirect_ea
(
s
,
ea
_in_anode
(
ea
)
,
ea_sec
(
ea
),
*
size
=
ea_len
(
ea
));
if
(
!
(
ret
=
kmalloc
((
*
size
=
ea_valuelen
(
ea
))
+
1
,
GFP_NOFS
)))
{
printk
(
"HPFS: out of memory for EA
\n
"
);
return
NULL
;
...
...
@@ -159,11 +159,11 @@ char *hpfs_get_ea(struct super_block *s, struct fnode *fnode, char *key, int *si
return
NULL
;
}
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
,
4
,
ex
))
return
NULL
;
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
1
+
(
ea
->
indirect
?
8
:
0
),
ex
+
4
))
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
1
+
(
ea
_indirect
(
ea
)
?
8
:
0
),
ex
+
4
))
return
NULL
;
if
(
!
strcmp
(
ea
->
name
,
key
))
{
if
(
ea
->
indirect
)
return
get_indirect_ea
(
s
,
ea
->
anode
,
ea_sec
(
ea
),
*
size
=
ea_len
(
ea
));
if
(
ea
_indirect
(
ea
)
)
return
get_indirect_ea
(
s
,
ea
_in_anode
(
ea
)
,
ea_sec
(
ea
),
*
size
=
ea_len
(
ea
));
if
(
!
(
ret
=
kmalloc
((
*
size
=
ea_valuelen
(
ea
))
+
1
,
GFP_NOFS
)))
{
printk
(
"HPFS: out of memory for EA
\n
"
);
return
NULL
;
...
...
@@ -199,9 +199,9 @@ void hpfs_set_ea(struct inode *inode, struct fnode *fnode, const char *key,
struct
extended_attribute
*
ea_end
=
fnode_end_ea
(
fnode
);
for
(
ea
=
fnode_ea
(
fnode
);
ea
<
ea_end
;
ea
=
next_ea
(
ea
))
if
(
!
strcmp
(
ea
->
name
,
key
))
{
if
(
ea
->
indirect
)
{
if
(
ea
_indirect
(
ea
)
)
{
if
(
ea_len
(
ea
)
==
size
)
set_indirect_ea
(
s
,
ea
->
anode
,
ea_sec
(
ea
),
data
,
size
);
set_indirect_ea
(
s
,
ea
_in_anode
(
ea
)
,
ea_sec
(
ea
),
data
,
size
);
}
else
if
(
ea_valuelen
(
ea
)
==
size
)
{
memcpy
(
ea_data
(
ea
),
data
,
size
);
}
...
...
@@ -220,12 +220,12 @@ void hpfs_set_ea(struct inode *inode, struct fnode *fnode, const char *key,
return
;
}
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
,
4
,
ex
))
return
;
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
1
+
(
ea
->
indirect
?
8
:
0
),
ex
+
4
))
if
(
hpfs_ea_read
(
s
,
a
,
ano
,
pos
+
4
,
ea
->
namelen
+
1
+
(
ea
_indirect
(
ea
)
?
8
:
0
),
ex
+
4
))
return
;
if
(
!
strcmp
(
ea
->
name
,
key
))
{
if
(
ea
->
indirect
)
{
if
(
ea
_indirect
(
ea
)
)
{
if
(
ea_len
(
ea
)
==
size
)
set_indirect_ea
(
s
,
ea
->
anode
,
ea_sec
(
ea
),
data
,
size
);
set_indirect_ea
(
s
,
ea
_in_anode
(
ea
)
,
ea_sec
(
ea
),
data
,
size
);
}
else
{
if
(
ea_valuelen
(
ea
)
==
size
)
...
...
fs/hpfs/hpfs.h
浏览文件 @
4085e155
...
...
@@ -528,32 +528,23 @@ struct anode
run, or in multiple runs. Flags in the fnode tell whether the EA list
is immediate, in a single run, or in multiple runs. */
enum
{
EA_indirect
=
1
,
EA_anode
=
2
,
EA_needea
=
128
};
struct
extended_attribute
{
#ifdef __LITTLE_ENDIAN
u8
indirect
:
1
;
/* 1 -> value gives sector number
u8
flags
;
/* bit 0 set -> value gives sector number
where real value starts */
u8
anode
:
1
;
/* 1 -> sector is an anode
that points to fragmented value */
u8
flag23456
:
5
;
u8
needea
:
1
;
/* required ea */
#else
u8
needea
:
1
;
/* required ea */
u8
flag23456
:
5
;
u8
anode
:
1
;
/* 1 -> sector is an anode
/* bit 1 set -> sector is an anode
that points to fragmented value */
u8
indirect
:
1
;
/* 1 -> value gives sector number
where real value starts */
#endif
/* bit 7 set -> required ea */
u8
namelen
;
/* length of name, bytes */
u8
valuelen_lo
;
/* length of value, bytes */
u8
valuelen_hi
;
/* length of value, bytes */
u8
name
[
0
];
u8
name
[];
/*
u8 name[namelen]; ascii attrib name
u8 nul; terminating '\0', not counted
u8 value[valuelen]; value, arbitrary
if this.
indirect
, valuelen is 8 and the value is
if this.
flags & 1
, valuelen is 8 and the value is
u32 length; real length of value, bytes
secno secno; sector address where it starts
if this.anode, the above sector number is the root of an anode tree
...
...
@@ -561,6 +552,16 @@ struct extended_attribute
*/
};
static
inline
bool
ea_indirect
(
struct
extended_attribute
*
ea
)
{
return
ea
->
flags
&
EA_indirect
;
}
static
inline
bool
ea_in_anode
(
struct
extended_attribute
*
ea
)
{
return
ea
->
flags
&
EA_anode
;
}
/*
Local Variables:
comment-column: 40
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录