aboutsummaryrefslogtreecommitdiffstats
path: root/fs/befs/endian.h
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
commit1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 (patch)
tree0bba044c4ce775e45a88a51686b5d9f90697ea9d /fs/befs/endian.h
Linux-2.6.12-rc2v2.6.12-rc2
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
Diffstat (limited to 'fs/befs/endian.h')
-rw-r--r--fs/befs/endian.h126
1 files changed, 126 insertions, 0 deletions
diff --git a/fs/befs/endian.h b/fs/befs/endian.h
new file mode 100644
index 000000000000..9ecaea4e3325
--- /dev/null
+++ b/fs/befs/endian.h
@@ -0,0 +1,126 @@
1/*
2 * linux/fs/befs/endian.h
3 *
4 * Copyright (C) 2001 Will Dyson <will_dyson@pobox.com>
5 *
6 * Partially based on similar funtions in the sysv driver.
7 */
8
9#ifndef LINUX_BEFS_ENDIAN
10#define LINUX_BEFS_ENDIAN
11
12#include <linux/byteorder/generic.h>
13#include "befs.h"
14
15static inline u64
16fs64_to_cpu(const struct super_block *sb, u64 n)
17{
18 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE)
19 return le64_to_cpu(n);
20 else
21 return be64_to_cpu(n);
22}
23
24static inline u64
25cpu_to_fs64(const struct super_block *sb, u64 n)
26{
27 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE)
28 return cpu_to_le64(n);
29 else
30 return cpu_to_be64(n);
31}
32
33static inline u32
34fs32_to_cpu(const struct super_block *sb, u32 n)
35{
36 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE)
37 return le32_to_cpu(n);
38 else
39 return be32_to_cpu(n);
40}
41
42static inline u32
43cpu_to_fs32(const struct super_block *sb, u32 n)
44{
45 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE)
46 return cpu_to_le32(n);
47 else
48 return cpu_to_be32(n);
49}
50
51static inline u16
52fs16_to_cpu(const struct super_block *sb, u16 n)
53{
54 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE)
55 return le16_to_cpu(n);
56 else
57 return be16_to_cpu(n);
58}
59
60static inline u16
61cpu_to_fs16(const struct super_block *sb, u16 n)
62{
63 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE)
64 return cpu_to_le16(n);
65 else
66 return cpu_to_be16(n);
67}
68
69/* Composite types below here */
70
71static inline befs_block_run
72fsrun_to_cpu(const struct super_block *sb, befs_block_run n)
73{
74 befs_block_run run;
75
76 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE) {
77 run.allocation_group = le32_to_cpu(n.allocation_group);
78 run.start = le16_to_cpu(n.start);
79 run.len = le16_to_cpu(n.len);
80 } else {
81 run.allocation_group = be32_to_cpu(n.allocation_group);
82 run.start = be16_to_cpu(n.start);
83 run.len = be16_to_cpu(n.len);
84 }
85 return run;
86}
87
88static inline befs_block_run
89cpu_to_fsrun(const struct super_block *sb, befs_block_run n)
90{
91 befs_block_run run;
92
93 if (BEFS_SB(sb)->byte_order == BEFS_BYTESEX_LE) {
94 run.allocation_group = cpu_to_le32(n.allocation_group);
95 run.start = cpu_to_le16(n.start);
96 run.len = cpu_to_le16(n.len);
97 } else {
98 run.allocation_group = cpu_to_be32(n.allocation_group);
99 run.start = cpu_to_be16(n.start);
100 run.len = cpu_to_be16(n.len);
101 }
102 return run;
103}
104
105static inline befs_data_stream
106fsds_to_cpu(const struct super_block *sb, befs_data_stream n)
107{
108 befs_data_stream data;
109 int i;
110
111 for (i = 0; i < BEFS_NUM_DIRECT_BLOCKS; ++i)
112 data.direct[i] = fsrun_to_cpu(sb, n.direct[i]);
113
114 data.max_direct_range = fs64_to_cpu(sb, n.max_direct_range);
115 data.indirect = fsrun_to_cpu(sb, n.indirect);
116 data.max_indirect_range = fs64_to_cpu(sb, n.max_indirect_range);
117 data.double_indirect = fsrun_to_cpu(sb, n.double_indirect);
118 data.max_double_indirect_range = fs64_to_cpu(sb,
119 n.
120 max_double_indirect_range);
121 data.size = fs64_to_cpu(sb, n.size);
122
123 return data;
124}
125
126#endif //LINUX_BEFS_ENDIAN