diff options
author | Will Dyson <will.dyson@gmail.com> | 2005-11-08 10:54:53 -0500 |
---|---|---|
committer | Adrian Bunk <bunk@r063144.stusta.swh.mhn.de> | 2005-11-08 10:54:53 -0500 |
commit | 1b33724a442b5e390ddc7507df3aeeb914915571 (patch) | |
tree | 7bf0cf78ad4a80816432826bd122cd36cf6ad18a /fs/befs | |
parent | b88b09851f4553c13c532af2f822b517a40f2ed5 (diff) |
remove unused fs/befs/attribute.c
If anyone needs a fully-functional befs driver, the easiest route to
that would probably be getting Haiku's befs driver to compile in
userland as a FUSE fs.
At any rate, attribute.c can go. It is easy enough to add back in if
anyone ever wants to do the (relativly minor) refactoring nessisary to
get it working.
Signed-off-by: Will Dyson <will.dyson@gmail.com>
Signed-off-by: Adrian Bunk <bunk@stusta.de>
Diffstat (limited to 'fs/befs')
-rw-r--r-- | fs/befs/attribute.c | 117 |
1 files changed, 0 insertions, 117 deletions
diff --git a/fs/befs/attribute.c b/fs/befs/attribute.c deleted file mode 100644 index e329d727053e..000000000000 --- a/fs/befs/attribute.c +++ /dev/null | |||
@@ -1,117 +0,0 @@ | |||
1 | /* | ||
2 | * linux/fs/befs/attribute.c | ||
3 | * | ||
4 | * Copyright (C) 2002 Will Dyson <will_dyson@pobox.com> | ||
5 | * | ||
6 | * Many thanks to Dominic Giampaolo, author of "Practical File System | ||
7 | * Design with the Be File System", for such a helpful book. | ||
8 | * | ||
9 | */ | ||
10 | |||
11 | #include <linux/fs.h> | ||
12 | #include <linux/kernel.h> | ||
13 | #include <linux/string.h> | ||
14 | |||
15 | #include "befs.h" | ||
16 | #include "endian.h" | ||
17 | |||
18 | #define SD_DATA(sd)\ | ||
19 | (void*)((char*)sd + sizeof(*sd) + (sd->name_size - sizeof(sd->name))) | ||
20 | |||
21 | #define SD_NEXT(sd)\ | ||
22 | (befs_small_data*)((char*)sd + sizeof(*sd) + (sd->name_size - \ | ||
23 | sizeof(sd->name) + sd->data_size)) | ||
24 | |||
25 | int | ||
26 | list_small_data(struct super_block *sb, befs_inode * inode, filldir_t filldir); | ||
27 | |||
28 | befs_small_data * | ||
29 | find_small_data(struct super_block *sb, befs_inode * inode, | ||
30 | const char *name); | ||
31 | int | ||
32 | read_small_data(struct super_block *sb, befs_inode * inode, | ||
33 | befs_small_data * sdata, void *buf, size_t bufsize); | ||
34 | |||
35 | /** | ||
36 | * | ||
37 | * | ||
38 | * | ||
39 | * | ||
40 | * | ||
41 | */ | ||
42 | befs_small_data * | ||
43 | find_small_data(struct super_block *sb, befs_inode * inode, const char *name) | ||
44 | { | ||
45 | befs_small_data *sdata = inode->small_data; | ||
46 | |||
47 | while (sdata->type != 0) { | ||
48 | if (strcmp(name, sdata->name) != 0) { | ||
49 | return sdata; | ||
50 | } | ||
51 | sdata = SD_NEXT(sdata); | ||
52 | } | ||
53 | return NULL; | ||
54 | } | ||
55 | |||
56 | /** | ||
57 | * | ||
58 | * | ||
59 | * | ||
60 | * | ||
61 | * | ||
62 | */ | ||
63 | int | ||
64 | read_small_data(struct super_block *sb, befs_inode * inode, | ||
65 | const char *name, void *buf, size_t bufsize) | ||
66 | { | ||
67 | befs_small_data *sdata; | ||
68 | |||
69 | sdata = find_small_data(sb, inode, name); | ||
70 | if (sdata == NULL) | ||
71 | return BEFS_ERR; | ||
72 | else if (sdata->data_size > bufsize) | ||
73 | return BEFS_ERR; | ||
74 | |||
75 | memcpy(buf, SD_DATA(sdata), sdata->data_size); | ||
76 | |||
77 | return BEFS_OK; | ||
78 | } | ||
79 | |||
80 | /** | ||
81 | * | ||
82 | * | ||
83 | * | ||
84 | * | ||
85 | * | ||
86 | */ | ||
87 | int | ||
88 | list_small_data(struct super_block *sb, befs_inode * inode) | ||
89 | { | ||
90 | |||
91 | } | ||
92 | |||
93 | /** | ||
94 | * | ||
95 | * | ||
96 | * | ||
97 | * | ||
98 | * | ||
99 | */ | ||
100 | int | ||
101 | list_attr(struct super_block *sb, befs_inode * inode) | ||
102 | { | ||
103 | |||
104 | } | ||
105 | |||
106 | /** | ||
107 | * | ||
108 | * | ||
109 | * | ||
110 | * | ||
111 | * | ||
112 | */ | ||
113 | int | ||
114 | read_attr(struct super_block *sb, befs_inode * inode) | ||
115 | { | ||
116 | |||
117 | } | ||