diff options
author | Linus Torvalds <torvalds@linux-foundation.org> | 2016-12-14 20:25:18 -0500 |
---|---|---|
committer | Linus Torvalds <torvalds@linux-foundation.org> | 2016-12-14 20:25:18 -0500 |
commit | a57cb1c1d7974c62a5c80f7869e35b492ace12cd (patch) | |
tree | 5a42ee9a668f171143464bc86013954c1bbe94ad /fs/btrfs/super.c | |
parent | cf1b3341afab9d3ad02a76b3a619ea027dcf4e28 (diff) | |
parent | e1e14ab8411df344a17687821f8f78f0a1e73cbb (diff) |
Merge branch 'akpm' (patches from Andrew)
Merge more updates from Andrew Morton:
- a few misc things
- kexec updates
- DMA-mapping updates to better support networking DMA operations
- IPC updates
- various MM changes to improve DAX fault handling
- lots of radix-tree changes, mainly to the test suite. All leading up
to reimplementing the IDA/IDR code to be a wrapper layer over the
radix-tree. However the final trigger-pulling patch is held off for
4.11.
* emailed patches from Andrew Morton <akpm@linux-foundation.org>: (114 commits)
radix tree test suite: delete unused rcupdate.c
radix tree test suite: add new tag check
radix-tree: ensure counts are initialised
radix tree test suite: cache recently freed objects
radix tree test suite: add some more functionality
idr: reduce the number of bits per level from 8 to 6
rxrpc: abstract away knowledge of IDR internals
tpm: use idr_find(), not idr_find_slowpath()
idr: add ida_is_empty
radix tree test suite: check multiorder iteration
radix-tree: fix replacement for multiorder entries
radix-tree: add radix_tree_split_preload()
radix-tree: add radix_tree_split
radix-tree: add radix_tree_join
radix-tree: delete radix_tree_range_tag_if_tagged()
radix-tree: delete radix_tree_locate_item()
radix-tree: improve multiorder iterators
btrfs: fix race in btrfs_free_dummy_fs_info()
radix-tree: improve dump output
radix-tree: make radix_tree_find_next_bit more useful
...
Diffstat (limited to 'fs/btrfs/super.c')
-rw-r--r-- | fs/btrfs/super.c | 12 |
1 files changed, 3 insertions, 9 deletions
diff --git a/fs/btrfs/super.c b/fs/btrfs/super.c index 180f910339f4..3b713b6fcc26 100644 --- a/fs/btrfs/super.c +++ b/fs/btrfs/super.c | |||
@@ -202,12 +202,12 @@ static struct ratelimit_state printk_limits[] = { | |||
202 | void btrfs_printk(const struct btrfs_fs_info *fs_info, const char *fmt, ...) | 202 | void btrfs_printk(const struct btrfs_fs_info *fs_info, const char *fmt, ...) |
203 | { | 203 | { |
204 | struct super_block *sb = fs_info->sb; | 204 | struct super_block *sb = fs_info->sb; |
205 | char lvl[PRINTK_MAX_SINGLE_HEADER_LEN + 1]; | 205 | char lvl[PRINTK_MAX_SINGLE_HEADER_LEN + 1] = "\0"; |
206 | struct va_format vaf; | 206 | struct va_format vaf; |
207 | va_list args; | 207 | va_list args; |
208 | const char *type = NULL; | ||
209 | int kern_level; | 208 | int kern_level; |
210 | struct ratelimit_state *ratelimit; | 209 | const char *type = logtypes[4]; |
210 | struct ratelimit_state *ratelimit = &printk_limits[4]; | ||
211 | 211 | ||
212 | va_start(args, fmt); | 212 | va_start(args, fmt); |
213 | 213 | ||
@@ -223,12 +223,6 @@ void btrfs_printk(const struct btrfs_fs_info *fs_info, const char *fmt, ...) | |||
223 | fmt += size; | 223 | fmt += size; |
224 | } | 224 | } |
225 | 225 | ||
226 | if (!type) { | ||
227 | *lvl = '\0'; | ||
228 | type = logtypes[4]; | ||
229 | ratelimit = &printk_limits[4]; | ||
230 | } | ||
231 | |||
232 | vaf.fmt = fmt; | 226 | vaf.fmt = fmt; |
233 | vaf.va = &args; | 227 | vaf.va = &args; |
234 | 228 | ||