]> git.proxmox.com Git - mirror_ubuntu-hirsute-kernel.git/blame - fs/btrfs/struct-funcs.c
btrfs: check-integrity: remove unnecessary failure messages during memory allocation
[mirror_ubuntu-hirsute-kernel.git] / fs / btrfs / struct-funcs.c
CommitLineData
c1d7c514 1// SPDX-License-Identifier: GPL-2.0
0f82731f
CM
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
0f82731f
CM
4 */
5
18077bb4 6#include <asm/unaligned.h>
d352ac68 7
18077bb4
LZ
8#include "ctree.h"
9
10static inline u8 get_unaligned_le8(const void *p)
11{
12 return *(u8 *)p;
13}
14
15static inline void put_unaligned_le8(u8 val, void *p)
16{
17 *(u8 *)p = val;
18}
19
5e394689
DS
20static bool check_setget_bounds(const struct extent_buffer *eb,
21 const void *ptr, unsigned off, int size)
22{
23 const unsigned long member_offset = (unsigned long)ptr + off;
24
25 if (member_offset > eb->len) {
26 btrfs_warn(eb->fs_info,
27 "bad eb member start: ptr 0x%lx start %llu member offset %lu size %d",
28 (unsigned long)ptr, eb->start, member_offset, size);
29 return false;
30 }
31 if (member_offset + size > eb->len) {
32 btrfs_warn(eb->fs_info,
33 "bad eb member end: ptr 0x%lx start %llu member offset %lu size %d",
34 (unsigned long)ptr, eb->start, member_offset, size);
35 return false;
36 }
37
38 return true;
39}
40
18077bb4 41/*
583e4a23
DS
42 * Macro templates that define helpers to read/write extent buffer data of a
43 * given size, that are also used via ctree.h for access to item members by
44 * specialized helpers.
d352ac68 45 *
583e4a23
DS
46 * Generic helpers:
47 * - btrfs_set_8 (for 8/16/32/64)
48 * - btrfs_get_8 (for 8/16/32/64)
d352ac68 49 *
583e4a23
DS
50 * Generic helpers with a token (cached address of the most recently accessed
51 * page):
52 * - btrfs_set_token_8 (for 8/16/32/64)
53 * - btrfs_get_token_8 (for 8/16/32/64)
d352ac68 54 *
583e4a23
DS
55 * The set/get functions handle data spanning two pages transparently, in case
56 * metadata block size is larger than page. Every pointer to metadata items is
57 * an offset into the extent buffer page array, cast to a specific type. This
58 * gives us all the type checking.
cb495113 59 *
583e4a23
DS
60 * The extent buffer pages stored in the array pages do not form a contiguous
61 * phyusical range, but the API functions assume the linear offset to the range
62 * from 0 to metadata node size.
d352ac68
CM
63 */
64
18077bb4 65#define DEFINE_BTRFS_SETGET_BITS(bits) \
cc4c13d5
DS
66u##bits btrfs_get_token_##bits(struct btrfs_map_token *token, \
67 const void *ptr, unsigned long off) \
0f82731f 68{ \
8f9da810
DS
69 const unsigned long member_offset = (unsigned long)ptr + off; \
70 const unsigned long idx = member_offset >> PAGE_SHIFT; \
71 const unsigned long oip = offset_in_page(member_offset); \
72 const int size = sizeof(u##bits); \
ba8a9a05
DS
73 u8 lebytes[sizeof(u##bits)]; \
74 const int part = PAGE_SIZE - oip; \
18077bb4 75 \
48bc3950 76 ASSERT(token); \
870b388d 77 ASSERT(token->kaddr); \
5e394689 78 ASSERT(check_setget_bounds(token->eb, ptr, off, size)); \
8f9da810
DS
79 if (token->offset <= member_offset && \
80 member_offset + size <= token->offset + PAGE_SIZE) { \
81 return get_unaligned_le##bits(token->kaddr + oip); \
18077bb4 82 } \
ba8a9a05
DS
83 token->kaddr = page_address(token->eb->pages[idx]); \
84 token->offset = idx << PAGE_SHIFT; \
85 if (oip + size <= PAGE_SIZE) \
8f9da810 86 return get_unaligned_le##bits(token->kaddr + oip); \
ba8a9a05
DS
87 \
88 memcpy(lebytes, token->kaddr + oip, part); \
8f9da810
DS
89 token->kaddr = page_address(token->eb->pages[idx + 1]); \
90 token->offset = (idx + 1) << PAGE_SHIFT; \
ba8a9a05
DS
91 memcpy(lebytes + part, token->kaddr, size - part); \
92 return get_unaligned_le##bits(lebytes); \
0f82731f 93} \
cb495113
DS
94u##bits btrfs_get_##bits(const struct extent_buffer *eb, \
95 const void *ptr, unsigned long off) \
96{ \
1441ed9b
DS
97 const unsigned long member_offset = (unsigned long)ptr + off; \
98 const unsigned long oip = offset_in_page(member_offset); \
84da071f
DS
99 const unsigned long idx = member_offset >> PAGE_SHIFT; \
100 char *kaddr = page_address(eb->pages[idx]); \
1441ed9b 101 const int size = sizeof(u##bits); \
84da071f
DS
102 const int part = PAGE_SIZE - oip; \
103 u8 lebytes[sizeof(u##bits)]; \
cb495113 104 \
5e394689 105 ASSERT(check_setget_bounds(eb, ptr, off, size)); \
84da071f 106 if (oip + size <= PAGE_SIZE) \
1441ed9b 107 return get_unaligned_le##bits(kaddr + oip); \
84da071f
DS
108 \
109 memcpy(lebytes, kaddr + oip, part); \
110 kaddr = page_address(eb->pages[idx + 1]); \
111 memcpy(lebytes + part, kaddr, size - part); \
112 return get_unaligned_le##bits(lebytes); \
cb495113 113} \
cc4c13d5 114void btrfs_set_token_##bits(struct btrfs_map_token *token, \
1cbb1f45 115 const void *ptr, unsigned long off, \
cc4c13d5 116 u##bits val) \
0f82731f 117{ \
ce7afe87
DS
118 const unsigned long member_offset = (unsigned long)ptr + off; \
119 const unsigned long idx = member_offset >> PAGE_SHIFT; \
120 const unsigned long oip = offset_in_page(member_offset); \
121 const int size = sizeof(u##bits); \
f472d3c2
DS
122 u8 lebytes[sizeof(u##bits)]; \
123 const int part = PAGE_SIZE - oip; \
18077bb4 124 \
48bc3950 125 ASSERT(token); \
870b388d 126 ASSERT(token->kaddr); \
5e394689 127 ASSERT(check_setget_bounds(token->eb, ptr, off, size)); \
ce7afe87
DS
128 if (token->offset <= member_offset && \
129 member_offset + size <= token->offset + PAGE_SIZE) { \
130 put_unaligned_le##bits(val, token->kaddr + oip); \
18077bb4
LZ
131 return; \
132 } \
f472d3c2
DS
133 token->kaddr = page_address(token->eb->pages[idx]); \
134 token->offset = idx << PAGE_SHIFT; \
ce7afe87 135 if (oip + size <= PAGE_SIZE) { \
ce7afe87 136 put_unaligned_le##bits(val, token->kaddr + oip); \
18077bb4
LZ
137 return; \
138 } \
f472d3c2
DS
139 put_unaligned_le##bits(val, lebytes); \
140 memcpy(token->kaddr + oip, lebytes, part); \
ce7afe87
DS
141 token->kaddr = page_address(token->eb->pages[idx + 1]); \
142 token->offset = (idx + 1) << PAGE_SHIFT; \
f472d3c2 143 memcpy(token->kaddr, lebytes + part, size - part); \
cb495113 144} \
2b48966a 145void btrfs_set_##bits(const struct extent_buffer *eb, void *ptr, \
cb495113
DS
146 unsigned long off, u##bits val) \
147{ \
029e4a42
DS
148 const unsigned long member_offset = (unsigned long)ptr + off; \
149 const unsigned long oip = offset_in_page(member_offset); \
f4ca8c51
DS
150 const unsigned long idx = member_offset >> PAGE_SHIFT; \
151 char *kaddr = page_address(eb->pages[idx]); \
029e4a42 152 const int size = sizeof(u##bits); \
f4ca8c51
DS
153 const int part = PAGE_SIZE - oip; \
154 u8 lebytes[sizeof(u##bits)]; \
cb495113 155 \
5e394689 156 ASSERT(check_setget_bounds(eb, ptr, off, size)); \
029e4a42 157 if (oip + size <= PAGE_SIZE) { \
029e4a42 158 put_unaligned_le##bits(val, kaddr + oip); \
cb495113
DS
159 return; \
160 } \
f4ca8c51
DS
161 \
162 put_unaligned_le##bits(val, lebytes); \
163 memcpy(kaddr + oip, lebytes, part); \
164 kaddr = page_address(eb->pages[idx + 1]); \
165 memcpy(kaddr, lebytes + part, size - part); \
18077bb4 166}
0f82731f 167
18077bb4
LZ
168DEFINE_BTRFS_SETGET_BITS(8)
169DEFINE_BTRFS_SETGET_BITS(16)
170DEFINE_BTRFS_SETGET_BITS(32)
171DEFINE_BTRFS_SETGET_BITS(64)
0f82731f 172
1cbb1f45 173void btrfs_node_key(const struct extent_buffer *eb,
e644d021
CM
174 struct btrfs_disk_key *disk_key, int nr)
175{
176 unsigned long ptr = btrfs_node_key_ptr_offset(nr);
e644d021
CM
177 read_eb_member(eb, (struct btrfs_key_ptr *)ptr,
178 struct btrfs_key_ptr, key, disk_key);
179}