aboutsummaryrefslogtreecommitdiffstats
path: root/fs/befs/btree.c
diff options
context:
space:
mode:
authorSalah Triki <salah.triki@gmail.com>2016-07-26 23:11:53 -0400
committerLuis de Bethencourt <luisbg@osg.samsung.com>2016-10-08 05:01:20 -0400
commit4bb594329a35e90ed7ff38db24f54aef8680f346 (patch)
tree4a94bc40a3e895186f210e593309b06d7080a0f8 /fs/befs/btree.c
parentd84e4a5a09c320e209789d263a26617f6f7324e3 (diff)
fs: befs: Coding style fix
Constant has to be capitalized. Signed-off-by: Salah Triki <salah.triki@gmail.com> Acked-by: Luis de Bethencourt <luisbg@osg.samsung.com>
Diffstat (limited to 'fs/befs/btree.c')
-rw-r--r--fs/befs/btree.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/fs/befs/btree.c b/fs/befs/btree.c
index 97f5e242d3ab..85453e50bc6e 100644
--- a/fs/befs/btree.c
+++ b/fs/befs/btree.c
@@ -85,7 +85,7 @@ struct befs_btree_node {
85}; 85};
86 86
87/* local constants */ 87/* local constants */
88static const befs_off_t befs_bt_inval = 0xffffffffffffffffULL; 88static const befs_off_t BEFS_BT_INVAL = 0xffffffffffffffffULL;
89 89
90/* local functions */ 90/* local functions */
91static int befs_btree_seekleaf(struct super_block *sb, const befs_data_stream *ds, 91static int befs_btree_seekleaf(struct super_block *sb, const befs_data_stream *ds,
@@ -467,7 +467,7 @@ befs_btree_read(struct super_block *sb, const befs_data_stream *ds,
467 while (key_sum + this_node->head.all_key_count <= key_no) { 467 while (key_sum + this_node->head.all_key_count <= key_no) {
468 468
469 /* no more nodes to look in: key_no is too large */ 469 /* no more nodes to look in: key_no is too large */
470 if (this_node->head.right == befs_bt_inval) { 470 if (this_node->head.right == BEFS_BT_INVAL) {
471 *keysize = 0; 471 *keysize = 0;
472 *value = 0; 472 *value = 0;
473 befs_debug(sb, 473 befs_debug(sb,
@@ -608,7 +608,7 @@ static int
608befs_leafnode(struct befs_btree_node *node) 608befs_leafnode(struct befs_btree_node *node)
609{ 609{
610 /* all interior nodes (and only interior nodes) have an overflow node */ 610 /* all interior nodes (and only interior nodes) have an overflow node */
611 if (node->head.overflow == befs_bt_inval) 611 if (node->head.overflow == BEFS_BT_INVAL)
612 return 1; 612 return 1;
613 else 613 else
614 return 0; 614 return 0;