summaryrefslogtreecommitdiffstats
path: root/sys/gnu
diff options
context:
space:
mode:
authormjacob <mjacob@FreeBSD.org>2007-06-10 04:54:42 +0000
committermjacob <mjacob@FreeBSD.org>2007-06-10 04:54:42 +0000
commitc52fd057ffa6f7d5db27633fc42d845fc2154065 (patch)
treed94836d77bb1cfed61332d3a80bf9304f353f84f /sys/gnu
parent4698037127234416be7866d520f1f411c5238e2f (diff)
downloadFreeBSD-src-c52fd057ffa6f7d5db27633fc42d845fc2154065.zip
FreeBSD-src-c52fd057ffa6f7d5db27633fc42d845fc2154065.tar.gz
Remove 'inline' qualifiers from functions which are not, in fact, inlines.
Diffstat (limited to 'sys/gnu')
-rw-r--r--sys/gnu/fs/reiserfs/reiserfs_namei.c2
-rw-r--r--sys/gnu/fs/reiserfs/reiserfs_stree.c12
2 files changed, 7 insertions, 7 deletions
diff --git a/sys/gnu/fs/reiserfs/reiserfs_namei.c b/sys/gnu/fs/reiserfs/reiserfs_namei.c
index 88ad880..f1a2c20 100644
--- a/sys/gnu/fs/reiserfs/reiserfs_namei.c
+++ b/sys/gnu/fs/reiserfs/reiserfs_namei.c
@@ -409,7 +409,7 @@ set_de_item_location(struct reiserfs_dir_entry *de, struct path *path)
* de_bh, de_ih, de_deh (points to first element of array), de_item_num
* is set
*/
-inline void
+void
set_de_name_and_namelen(struct reiserfs_dir_entry *de)
{
struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
diff --git a/sys/gnu/fs/reiserfs/reiserfs_stree.c b/sys/gnu/fs/reiserfs/reiserfs_stree.c
index 5d5e4c4..d786ad8 100644
--- a/sys/gnu/fs/reiserfs/reiserfs_stree.c
+++ b/sys/gnu/fs/reiserfs/reiserfs_stree.c
@@ -24,7 +24,7 @@ const struct key MAX_KEY = {
};
/* Does the buffer contain a disk block which is in the tree. */
-inline int
+int
B_IS_IN_TREE(const struct buf *p_s_bp)
{
@@ -32,7 +32,7 @@ B_IS_IN_TREE(const struct buf *p_s_bp)
}
/* To gets item head in le form */
-inline void
+void
copy_item_head(struct item_head *p_v_to, const struct item_head *p_v_from)
{
@@ -120,7 +120,7 @@ pathrelse(struct path *p_s_search_path)
* This does not say which one is bigger, it only returns 1 if keys
* are not equal, 0 otherwise
*/
-inline int
+int
comp_le_keys(const struct key *k1, const struct key *k2)
{
@@ -144,7 +144,7 @@ comp_le_keys(const struct key *k1, const struct key *k2)
* cut the number of possible items it could be by one more than half
* rounded down, or we find it.
*/
-inline int
+int
bin_search(const void *p_v_key, /* Key to search for. */
const void *p_v_base, /* First item in the array. */
int p_n_num, /* Number of items in the array. */
@@ -191,7 +191,7 @@ bin_search(const void *p_v_key, /* Key to search for. */
* buffer in tree), and in this case we return a special key, either
* MIN_KEY or MAX_KEY.
*/
-inline const struct key *
+const struct key *
get_lkey(const struct path *p_s_chk_path,
const struct reiserfs_sb_info *p_s_sbi)
{
@@ -238,7 +238,7 @@ get_lkey(const struct path *p_s_chk_path,
}
/* Get delimiting key of the buffer at the path and its right neighbor. */
-inline const struct key *
+const struct key *
get_rkey(const struct path *p_s_chk_path,
const struct reiserfs_sb_info *p_s_sbi)
{
OpenPOWER on IntegriCloud