]>
Commit | Line | Data |
---|---|---|
2bd0ea18 | 1 | /* |
da23017d NS |
2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
2bd0ea18 | 4 | * |
da23017d NS |
5 | * This program is free software; you can redistribute it and/or |
6 | * modify it under the terms of the GNU General Public License as | |
2bd0ea18 NS |
7 | * published by the Free Software Foundation. |
8 | * | |
da23017d NS |
9 | * This program is distributed in the hope that it would be useful, |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
12 | * GNU General Public License for more details. | |
2bd0ea18 | 13 | * |
da23017d NS |
14 | * You should have received a copy of the GNU General Public License |
15 | * along with this program; if not, write the Free Software Foundation, | |
16 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
2bd0ea18 NS |
17 | */ |
18 | ||
19 | /* | |
20 | * This header is effectively a "namespace multiplexor" for the | |
21 | * user level XFS code. It provides all of the necessary stuff | |
22 | * such that we can build some parts of the XFS kernel code in | |
23 | * user space in a controlled fashion, and translates the names | |
24 | * used in the kernel into the names which libxfs is going to | |
25 | * make available to user tools. | |
26 | * | |
27 | * It should only ever be #include'd by XFS "kernel" code being | |
28 | * compiled in user space. | |
dfc130f3 | 29 | * |
2bd0ea18 NS |
30 | * Our goals here are to... |
31 | * o "share" large amounts of complex code between user and | |
32 | * kernel space; | |
33 | * o shield the user tools from changes in the bleeding | |
34 | * edge kernel code, merging source changes when | |
35 | * convenient and not immediately (no symlinks); | |
36 | * o i.e. be able to merge changes to the kernel source back | |
37 | * into the affected user tools in a controlled fashion; | |
38 | * o provide a _minimalist_ life-support system for kernel | |
39 | * code in user land, not the "everything + the kitchen | |
40 | * sink" model which libsim had mutated into; | |
41 | * o allow the kernel code to be completely free of code | |
42 | * specifically there to support the user level build. | |
43 | */ | |
44 | ||
f616e2bf DC |
45 | /* |
46 | * define a guard and something we can check to determine what include context | |
47 | * we are running from. | |
48 | */ | |
b626fb59 DC |
49 | #ifndef __LIBXFS_INTERNAL_XFS_H__ |
50 | #define __LIBXFS_INTERNAL_XFS_H__ | |
f616e2bf | 51 | |
e515cca1 | 52 | #include "libxfs_api_defs.h" |
6b803e5a | 53 | #include "platform_defs.h" |
dcabd4e7 | 54 | #include "xfs.h" |
b626fb59 | 55 | |
6b803e5a CH |
56 | #include "list.h" |
57 | #include "hlist.h" | |
58 | #include "cache.h" | |
59 | #include "bitops.h" | |
60 | #include "kmem.h" | |
61 | #include "radix-tree.h" | |
62 | #include "atomic.h" | |
b626fb59 | 63 | |
6b803e5a CH |
64 | #include "xfs_types.h" |
65 | #include "xfs_arch.h" | |
b626fb59 | 66 | |
6b803e5a | 67 | #include "xfs_fs.h" |
b626fb59 DC |
68 | |
69 | /* CRC stuff, buffer API dependent on it */ | |
70 | extern uint32_t crc32_le(uint32_t crc, unsigned char const *p, size_t len); | |
71 | extern uint32_t crc32c_le(uint32_t crc, unsigned char const *p, size_t len); | |
72 | ||
73 | #define crc32(c,p,l) crc32_le((c),(unsigned char const *)(p),(l)) | |
74 | #define crc32c(c,p,l) crc32c_le((c),(unsigned char const *)(p),(l)) | |
75 | ||
6b803e5a | 76 | #include "xfs_cksum.h" |
b626fb59 DC |
77 | |
78 | /* | |
79 | * This mirrors the kernel include for xfs_buf.h - it's implicitly included in | |
80 | * every files via a similar include in the kernel xfs_linux.h. | |
81 | */ | |
897853d5 | 82 | #include "libxfs_io.h" |
b626fb59 DC |
83 | |
84 | /* for all the support code that uses progname in error messages */ | |
85 | extern char *progname; | |
2bd0ea18 | 86 | |
a2ceac1f DC |
87 | #undef ASSERT |
88 | #define ASSERT(ex) assert(ex) | |
5e656dbb | 89 | |
dc9b1f58 CH |
90 | /* |
91 | * We have no need for the "linux" dev_t in userspace, so these | |
92 | * are no-ops, and an xfs_dev_t is stored in VFS_I(ip)->i_rdev | |
93 | */ | |
94 | #define xfs_to_linux_dev_t(dev) dev | |
95 | #define linux_to_xfs_dev_t(dev) dev | |
551174eb | 96 | |
a2ceac1f DC |
97 | #ifndef EWRONGFS |
98 | #define EWRONGFS EINVAL | |
99 | #endif | |
5e656dbb | 100 | |
56b2de80 | 101 | #define xfs_error_level 0 |
5e656dbb BN |
102 | |
103 | #define STATIC static | |
5e656dbb | 104 | |
d7e71605 DW |
105 | /* |
106 | * Starting in Linux 4.15, the %p (raw pointer value) printk modifier | |
107 | * prints a hashed version of the pointer to avoid leaking kernel | |
108 | * pointers into dmesg. If we're trying to debug the kernel we want the | |
109 | * raw values, so override this behavior as best we can. | |
110 | * | |
111 | * In userspace we don't have this problem. | |
112 | */ | |
113 | #define PTR_FMT "%p" | |
114 | ||
b626fb59 DC |
115 | /* XXX: need to push these out to make LIBXFS_ATTR defines */ |
116 | #define ATTR_ROOT 0x0002 | |
117 | #define ATTR_SECURE 0x0008 | |
118 | #define ATTR_CREATE 0x0010 | |
119 | #define ATTR_REPLACE 0x0020 | |
5e656dbb BN |
120 | #define ATTR_KERNOTIME 0 |
121 | #define ATTR_KERNOVAL 0 | |
122 | ||
5dcd1db5 DC |
123 | #define XFS_IGET_CREATE 0x1 |
124 | #define XFS_IGET_UNTRUSTED 0x2 | |
125 | ||
b626fb59 DC |
126 | extern void cmn_err(int, char *, ...); |
127 | enum ce { CE_DEBUG, CE_CONT, CE_NOTE, CE_WARN, CE_ALERT, CE_PANIC }; | |
128 | ||
129 | #define xfs_notice(mp,fmt,args...) cmn_err(CE_NOTE,fmt, ## args) | |
130 | #define xfs_warn(mp,fmt,args...) cmn_err(CE_WARN,fmt, ## args) | |
131 | #define xfs_hex_dump(d,n) ((void) 0) | |
132 | ||
6f4c54a4 | 133 | #define xfs_force_shutdown(d,n) ((void) 0) |
b626fb59 | 134 | |
a2ceac1f | 135 | /* stop unused var warnings by assigning mp to itself */ |
15348e04 DW |
136 | |
137 | #define xfs_corruption_error(fu,e,l,mp,fi,ln,fa) do { \ | |
138 | (mp) = (mp); \ | |
139 | cmn_err(CE_ALERT, "%s: XFS_CORRUPTION_ERROR", (e)); \ | |
140 | } while (0) | |
141 | ||
e0607266 DC |
142 | #define XFS_CORRUPTION_ERROR(e,l,mp,m) do { \ |
143 | (mp) = (mp); \ | |
144 | cmn_err(CE_ALERT, "%s: XFS_CORRUPTION_ERROR", (e)); \ | |
145 | } while (0) | |
146 | ||
147 | #define XFS_ERROR_REPORT(e,l,mp) do { \ | |
148 | (mp) = (mp); \ | |
149 | cmn_err(CE_ALERT, "%s: XFS_ERROR_REPORT", (e)); \ | |
150 | } while (0) | |
151 | ||
5e656dbb BN |
152 | #define XFS_ERRLEVEL_LOW 1 |
153 | #define XFS_FORCED_SHUTDOWN(mp) 0 | |
154 | #define XFS_ILOCK_EXCL 0 | |
ece930fa CH |
155 | #define XFS_STATS_INC(mp, count) do { (mp) = (mp); } while (0) |
156 | #define XFS_STATS_DEC(mp, count, x) do { (mp) = (mp); } while (0) | |
157 | #define XFS_STATS_ADD(mp, count, x) do { (mp) = (mp); } while (0) | |
e2a190dd | 158 | #define XFS_TEST_ERROR(expr,a,b) ( expr ) |
23639f77 ES |
159 | #define XFS_WANT_CORRUPTED_GOTO(mp, expr, l) \ |
160 | { \ | |
161 | if (!(expr)) { \ | |
162 | if ((mp)->m_flags & LIBXFS_MOUNT_WANT_CORRUPTED) \ | |
163 | printf("WANT_CORRUPTED_GOTO at %s:%d\n", \ | |
164 | __func__, __LINE__); \ | |
165 | error = -EFSCORRUPTED; \ | |
166 | goto l; \ | |
167 | } \ | |
168 | } | |
169 | #define XFS_WANT_CORRUPTED_RETURN(mp, expr) \ | |
170 | { \ | |
171 | if (!(expr)) { \ | |
172 | if ((mp)->m_flags & LIBXFS_MOUNT_WANT_CORRUPTED) \ | |
173 | printf("WANT_CORRUPTED_RETURN at %s:%d\n", \ | |
174 | __func__, __LINE__); \ | |
175 | return -EFSCORRUPTED; \ | |
176 | } \ | |
177 | } | |
5e656dbb | 178 | |
5e656dbb BN |
179 | #ifdef __GNUC__ |
180 | #define __return_address __builtin_return_address(0) | |
b47beff8 DW |
181 | |
182 | /* | |
183 | * Return the address of a label. Use barrier() so that the optimizer | |
184 | * won't reorder code to refactor the error jumpouts into a single | |
185 | * return, which throws off the reported address. | |
186 | */ | |
187 | #define __this_address ({ __label__ __here; __here: barrier(); &&__here; }) | |
188 | /* Optimization barrier */ | |
189 | ||
190 | /* The "volatile" is due to gcc bugs */ | |
191 | #define barrier() __asm__ __volatile__("": : :"memory") | |
192 | #endif | |
193 | ||
194 | /* Optimization barrier */ | |
195 | #ifndef barrier | |
196 | # define barrier() __memory_barrier() | |
5e656dbb BN |
197 | #endif |
198 | ||
364e85ec DC |
199 | #define XFS_DQUOT_CLUSTER_SIZE_FSB (xfs_filblks_t)1 |
200 | ||
5e656dbb BN |
201 | /* miscellaneous kernel routines not in user space */ |
202 | #define down_read(a) ((void) 0) | |
203 | #define up_read(a) ((void) 0) | |
204 | #define spin_lock_init(a) ((void) 0) | |
205 | #define spin_lock(a) ((void) 0) | |
206 | #define spin_unlock(a) ((void) 0) | |
207 | #define likely(x) (x) | |
208 | #define unlikely(x) (x) | |
56b2de80 DC |
209 | #define rcu_read_lock() ((void) 0) |
210 | #define rcu_read_unlock() ((void) 0) | |
c1587ecf CH |
211 | /* Need to be able to handle this bare or in control flow */ |
212 | static inline bool WARN_ON_ONCE(bool expr) { | |
213 | return (expr); | |
214 | } | |
19ebedcf | 215 | |
cbf3beaa GW |
216 | #define percpu_counter_read(x) (*x) |
217 | #define percpu_counter_read_positive(x) ((*x) > 0 ? (*x) : 0) | |
218 | #define percpu_counter_sum(x) (*x) | |
5e656dbb | 219 | |
2bd0ea18 | 220 | /* |
49f693fa | 221 | * prandom_u32 is used for di_gen inode allocation, it must be zero for libxfs |
5e656dbb | 222 | * or all sorts of badness can occur! |
2bd0ea18 | 223 | */ |
49f693fa | 224 | #define prandom_u32() 0 |
2bd0ea18 | 225 | |
b2327e1a | 226 | #define PAGE_SIZE getpagesize() |
2bd0ea18 | 227 | |
d5105a89 JL |
228 | #define inode_peek_iversion(inode) (inode)->i_version |
229 | #define inode_set_iversion_queried(inode, version) do { \ | |
230 | (inode)->i_version = (version); \ | |
231 | } while (0) | |
232 | ||
5e656dbb BN |
233 | static inline int __do_div(unsigned long long *n, unsigned base) |
234 | { | |
235 | int __res; | |
236 | __res = (int)(((unsigned long) *n) % (unsigned) base); | |
237 | *n = ((unsigned long) *n) / (unsigned) base; | |
238 | return __res; | |
239 | } | |
240 | ||
241 | #define do_div(n,base) (__do_div((unsigned long long *)&(n), (base))) | |
242 | #define do_mod(a, b) ((a) % (b)) | |
243 | #define rol32(x,y) (((x) << (y)) | ((x) >> (32 - (y)))) | |
2bd0ea18 | 244 | |
e91df844 DW |
245 | /** |
246 | * div_u64_rem - unsigned 64bit divide with 32bit divisor with remainder | |
247 | * @dividend: unsigned 64bit dividend | |
248 | * @divisor: unsigned 32bit divisor | |
249 | * @remainder: pointer to unsigned 32bit remainder | |
250 | * | |
251 | * Return: sets ``*remainder``, then returns dividend / divisor | |
252 | * | |
253 | * This is commonly provided by 32bit archs to provide an optimized 64bit | |
254 | * divide. | |
255 | */ | |
256 | static inline uint64_t | |
257 | div_u64_rem(uint64_t dividend, uint32_t divisor, uint32_t *remainder) | |
258 | { | |
259 | *remainder = dividend % divisor; | |
260 | return dividend / divisor; | |
261 | } | |
262 | ||
5e656dbb BN |
263 | #define min_t(type,x,y) \ |
264 | ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; }) | |
265 | #define max_t(type,x,y) \ | |
266 | ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; }) | |
57c9fccb | 267 | |
91eba724 | 268 | |
7338c4b8 BF |
269 | #define __round_mask(x, y) ((__typeof__(x))((y)-1)) |
270 | #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) | |
271 | #define round_down(x, y) ((x) & ~__round_mask(x, y)) | |
272 | #define DIV_ROUND_UP(n,d) (((n) + (d) - 1) / (d)) | |
273 | ||
274 | /* | |
275 | * Handling for kernel bitmap types. | |
276 | */ | |
277 | #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, NBBY * sizeof(long)) | |
278 | #define DECLARE_BITMAP(name,bits) \ | |
279 | unsigned long name[BITS_TO_LONGS(bits)] | |
280 | #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1))) | |
281 | ||
282 | /* | |
283 | * This is a common helper function for find_next_bit and | |
284 | * find_next_zero_bit. The difference is the "invert" argument, which | |
285 | * is XORed with each fetched word before searching it for one bits. | |
286 | */ | |
287 | static inline unsigned long | |
288 | _find_next_bit(const unsigned long *addr, unsigned long nbits, | |
289 | unsigned long start, unsigned long invert) | |
290 | { | |
291 | unsigned long tmp; | |
292 | ||
293 | if (!nbits || start >= nbits) | |
294 | return nbits; | |
295 | ||
296 | tmp = addr[start / BITS_PER_LONG] ^ invert; | |
297 | ||
298 | /* Handle 1st word. */ | |
299 | tmp &= BITMAP_FIRST_WORD_MASK(start); | |
300 | start = round_down(start, BITS_PER_LONG); | |
301 | ||
302 | while (!tmp) { | |
303 | start += BITS_PER_LONG; | |
304 | if (start >= nbits) | |
305 | return nbits; | |
306 | ||
307 | tmp = addr[start / BITS_PER_LONG] ^ invert; | |
308 | } | |
309 | ||
310 | return min(start + ffs(tmp), nbits); | |
311 | } | |
312 | ||
313 | /* | |
314 | * Find the next set bit in a memory region. | |
315 | */ | |
316 | static inline unsigned long | |
317 | find_next_bit(const unsigned long *addr, unsigned long size, | |
318 | unsigned long offset) | |
319 | { | |
320 | return _find_next_bit(addr, size, offset, 0UL); | |
321 | } | |
322 | static inline unsigned long | |
323 | find_next_zero_bit(const unsigned long *addr, unsigned long size, | |
324 | unsigned long offset) | |
325 | { | |
326 | return _find_next_bit(addr, size, offset, ~0UL); | |
327 | } | |
328 | #define find_first_zero_bit(addr, size) find_next_zero_bit((addr), (size), 0) | |
91eba724 | 329 | |
5e656dbb BN |
330 | static inline __attribute__((const)) |
331 | int is_power_of_2(unsigned long n) | |
332 | { | |
333 | return (n != 0 && ((n & (n - 1)) == 0)); | |
334 | } | |
2bd0ea18 NS |
335 | |
336 | /* | |
5e656dbb | 337 | * xfs_iroundup: round up argument to next power of two |
2bd0ea18 | 338 | */ |
5e656dbb BN |
339 | static inline uint |
340 | roundup_pow_of_two(uint v) | |
341 | { | |
342 | int i; | |
343 | uint m; | |
344 | ||
345 | if ((v & (v - 1)) == 0) | |
346 | return v; | |
347 | ASSERT((v & 0x80000000) == 0); | |
348 | if ((v & (v + 1)) == 0) | |
349 | return v + 1; | |
350 | for (i = 0, m = 1; i < 31; i++, m <<= 1) { | |
351 | if (v & m) | |
352 | continue; | |
353 | v |= m; | |
354 | if ((v & (v + 1)) == 0) | |
355 | return v + 1; | |
356 | } | |
357 | ASSERT(0); | |
358 | return 0; | |
359 | } | |
2bd0ea18 | 360 | |
14f8b681 DW |
361 | static inline uint64_t |
362 | roundup_64(uint64_t x, uint32_t y) | |
88cd79be DC |
363 | { |
364 | x += y - 1; | |
365 | do_div(x, y); | |
366 | return x * y; | |
367 | } | |
368 | ||
2bd0ea18 | 369 | /* buffer management */ |
e8a1c983 | 370 | #define XBF_TRYLOCK 0 |
a2ceac1f | 371 | #define XBF_UNMAPPED 0 |
e9d35108 | 372 | #define XBF_DONE 0 |
a2ceac1f | 373 | #define xfs_buf_stale(bp) ((bp)->b_flags |= LIBXFS_B_STALE) |
f1b058f9 | 374 | #define XFS_BUF_UNDELAYWRITE(bp) ((bp)->b_flags &= ~LIBXFS_B_DIRTY) |
2bd0ea18 | 375 | #define XFS_BUF_SET_BDSTRAT_FUNC(a,b) ((void) 0) |
5e656dbb | 376 | |
9d6fabc0 DC |
377 | /* avoid gcc warning */ |
378 | #define xfs_incore(bt,blkno,len,lockit) ({ \ | |
379 | typeof(blkno) __foo = (blkno); \ | |
6bddecbc | 380 | typeof(len) __bar = (len); \ |
9d6fabc0 | 381 | (blkno) = __foo; \ |
6bddecbc | 382 | (len) = __bar; /* no set-but-unused warning */ \ |
9d6fabc0 DC |
383 | NULL; \ |
384 | }) | |
2bd0ea18 | 385 | #define xfs_buf_relse(bp) libxfs_putbuf(bp) |
75c8b434 | 386 | #define xfs_buf_get(devp,blkno,len,f) (libxfs_getbuf((devp), (blkno), (len))) |
9d6fabc0 | 387 | #define xfs_bwrite(bp) libxfs_writebuf((bp), 0) |
e9d35108 | 388 | #define xfs_buf_delwri_queue(bp, bl) libxfs_writebuf((bp), 0) |
57c9fccb | 389 | |
56b2de80 DC |
390 | #define XBRW_READ LIBXFS_BREAD |
391 | #define XBRW_WRITE LIBXFS_BWRITE | |
392 | #define xfs_buf_iomove(bp,off,len,data,f) libxfs_iomove(bp,off,len,data,f) | |
393 | #define xfs_buf_zero(bp,off,len) libxfs_iomove(bp,off,len,0,LIBXFS_BZERO) | |
2bd0ea18 | 394 | |
5e656dbb BN |
395 | /* mount stuff */ |
396 | #define XFS_MOUNT_32BITINODES LIBXFS_MOUNT_32BITINODES | |
397 | #define XFS_MOUNT_ATTR2 LIBXFS_MOUNT_ATTR2 | |
398 | #define XFS_MOUNT_SMALL_INUMS 0 /* ignored in userspace */ | |
399 | #define XFS_MOUNT_WSYNC 0 /* ignored in userspace */ | |
400 | #define XFS_MOUNT_NOALIGN 0 /* ignored in userspace */ | |
3439d03a | 401 | #define XFS_MOUNT_IKEEP 0 /* ignored in userspace */ |
ff105f75 DC |
402 | #define XFS_MOUNT_SWALLOC 0 /* ignored in userspace */ |
403 | #define XFS_MOUNT_RDONLY 0 /* ignored in userspace */ | |
5e656dbb | 404 | |
5e656dbb | 405 | |
5e656dbb BN |
406 | #define xfs_trans_set_sync(tp) ((void) 0) |
407 | #define xfs_trans_agblocks_delta(tp, d) | |
408 | #define xfs_trans_agflist_delta(tp, d) | |
409 | #define xfs_trans_agbtree_delta(tp, d) | |
6bddecbc DC |
410 | #define xfs_trans_buf_set_type(tp, bp, t) ({ \ |
411 | int __t = (t); \ | |
412 | __t = __t; /* no set-but-unused warning */ \ | |
fca3ed92 | 413 | tp = tp; /* no set-but-unused warning */ \ |
6bddecbc DC |
414 | }) |
415 | ||
8b4dc4a9 | 416 | #define xfs_trans_buf_copy_type(dbp, sbp) |
5e656dbb | 417 | |
10851b18 DC |
418 | /* no readahead, need to avoid set-but-unused var warnings. */ |
419 | #define xfs_buf_readahead(a,d,c,ops) ({ \ | |
420 | xfs_daddr_t __d = d; \ | |
421 | __d = __d; /* no set-but-unused warning */ \ | |
422 | }) | |
a2ceac1f | 423 | #define xfs_buf_readahead_map(a,b,c,ops) ((void) 0) /* no readahead */ |
5e656dbb | 424 | |
a2ceac1f DC |
425 | #define xfs_warn(mp,fmt,args...) cmn_err(CE_WARN,fmt, ## args) |
426 | #define xfs_alert(mp,fmt,args...) cmn_err(CE_ALERT,fmt, ## args) | |
427 | #define xfs_alert_tag(mp,tag,fmt,args...) cmn_err(CE_ALERT,fmt, ## args) | |
5e656dbb | 428 | |
5e656dbb | 429 | #define xfs_sort qsort |
2bd0ea18 | 430 | |
5e656dbb | 431 | #define xfs_ilock(ip,mode) ((void) 0) |
a2ceac1f DC |
432 | #define xfs_ilock_nowait(ip,mode) ((void) 0) |
433 | #define xfs_ilock_demote(ip,mode) ((void) 0) | |
ff105f75 DC |
434 | #define xfs_ilock_data_map_shared(ip) (0) |
435 | #define xfs_ilock_attr_map_shared(ip) (0) | |
436 | #define xfs_iunlock(ip,mode) ({ \ | |
437 | typeof(mode) __mode = mode; \ | |
438 | __mode = __mode; /* no set-but-unused warning */ \ | |
439 | }) | |
2bd0ea18 | 440 | |
5e656dbb | 441 | /* space allocation */ |
a2ceac1f | 442 | #define xfs_extent_busy_reuse(mp,ag,bno,len,user) ((void) 0) |
aefc06c1 ES |
443 | /* avoid unused variable warning */ |
444 | #define xfs_extent_busy_insert(tp,ag,bno,len,flags)({ \ | |
445 | xfs_agnumber_t __foo = ag; \ | |
446 | __foo = __foo; /* no set-but-unused warning */ \ | |
447 | }) | |
cd80de04 CH |
448 | #define xfs_extent_busy_trim(args,bno,len,busy_gen) ({ \ |
449 | unsigned __foo = *(busy_gen); \ | |
450 | *(busy_gen) = __foo; \ | |
451 | false; \ | |
452 | }) | |
b0a898fe | 453 | #define xfs_extent_busy_flush(mp,pag,busy_gen) ((void)(0)) |
a2ceac1f | 454 | |
5e656dbb | 455 | #define xfs_rotorstep 1 |
1f2ace68 | 456 | #define xfs_bmap_rtalloc(a) (-ENOSYS) |
5e656dbb | 457 | #define xfs_get_extsz_hint(ip) (0) |
10460994 | 458 | #define xfs_get_cowextsz_hint(ip) (0) |
5e656dbb BN |
459 | #define xfs_inode_is_filestream(ip) (0) |
460 | #define xfs_filestream_lookup_ag(ip) (0) | |
461 | #define xfs_filestream_new_ag(ip,ag) (0) | |
2bd0ea18 | 462 | |
a2ceac1f DC |
463 | #define xfs_log_force(mp,flags) ((void) 0) |
464 | #define XFS_LOG_SYNC 1 | |
465 | ||
466 | /* quota bits */ | |
467 | #define xfs_trans_mod_dquot_byino(t,i,f,d) ((void) 0) | |
468 | #define xfs_trans_reserve_quota_nblks(t,i,b,n,f) (0) | |
469 | #define xfs_trans_unreserve_quota_nblks(t,i,b,n,f) ((void) 0) | |
470 | #define xfs_qm_dqattach(i,f) (0) | |
471 | ||
5dfa5cd2 DC |
472 | #define uuid_copy(s,d) platform_uuid_copy((s),(d)) |
473 | #define uuid_equal(s,d) (platform_uuid_compare((s),(d)) == 0) | |
474 | ||
e9d35108 | 475 | #define xfs_icreate_log(tp, agno, agbno, cnt, isize, len, gen) ((void) 0) |
4896e6c8 | 476 | #define xfs_sb_validate_fsb_count(sbp, nblks) (0) |
e9d35108 | 477 | |
2bd0ea18 | 478 | /* |
5e656dbb | 479 | * Prototypes for kernel static functions that are aren't in their |
b626fb59 | 480 | * associated header files. |
2bd0ea18 | 481 | */ |
b626fb59 DC |
482 | struct xfs_da_args; |
483 | struct xfs_bmap_free; | |
484 | struct xfs_bmap_free_item; | |
485 | struct xfs_mount; | |
486 | struct xfs_sb; | |
487 | struct xfs_trans; | |
488 | struct xfs_inode; | |
489 | struct xfs_log_item; | |
490 | struct xfs_buf; | |
491 | struct xfs_buf_map; | |
492 | struct xfs_buf_log_item; | |
493 | struct xfs_buftarg; | |
2bd0ea18 | 494 | |
5e656dbb BN |
495 | /* xfs_attr.c */ |
496 | int xfs_attr_rmtval_get(struct xfs_da_args *); | |
2bd0ea18 NS |
497 | |
498 | /* xfs_bmap.c */ | |
2cf6d225 | 499 | void xfs_bmap_del_free(struct xfs_bmap_free *, struct xfs_bmap_free_item *); |
5e656dbb BN |
500 | |
501 | /* xfs_mount.c */ | |
b626fb59 DC |
502 | int xfs_initialize_perag_data(struct xfs_mount *, xfs_agnumber_t); |
503 | void xfs_mount_common(struct xfs_mount *, struct xfs_sb *); | |
5e656dbb BN |
504 | |
505 | /* | |
506 | * logitem.c and trans.c prototypes | |
507 | */ | |
4329aa4c | 508 | void xfs_trans_init(struct xfs_mount *); |
d67406c9 | 509 | int xfs_trans_roll(struct xfs_trans **); |
2bd0ea18 NS |
510 | |
511 | /* xfs_trans_item.c */ | |
c40bdaa2 DC |
512 | void xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *); |
513 | void xfs_trans_del_item(struct xfs_log_item *); | |
2bd0ea18 | 514 | |
2bd0ea18 | 515 | /* xfs_inode_item.c */ |
b626fb59 | 516 | void xfs_inode_item_init(struct xfs_inode *, struct xfs_mount *); |
2bd0ea18 NS |
517 | |
518 | /* xfs_buf_item.c */ | |
b626fb59 DC |
519 | void xfs_buf_item_init(struct xfs_buf *, struct xfs_mount *); |
520 | void xfs_buf_item_log(struct xfs_buf_log_item *, uint, uint); | |
2bd0ea18 | 521 | |
5e656dbb | 522 | /* xfs_trans_buf.c */ |
b626fb59 DC |
523 | struct xfs_buf *xfs_trans_buf_item_match(struct xfs_trans *, |
524 | struct xfs_buftarg *, struct xfs_buf_map *, int); | |
5e656dbb | 525 | |
2bd0ea18 | 526 | /* local source files */ |
19ebedcf DC |
527 | #define xfs_mod_fdblocks(mp, delta, rsvd) \ |
528 | libxfs_mod_incore_sb(mp, XFS_TRANS_SB_FDBLOCKS, delta, rsvd) | |
529 | #define xfs_mod_frextents(mp, delta) \ | |
530 | libxfs_mod_incore_sb(mp, XFS_TRANS_SB_FREXTENTS, delta, 0) | |
531 | int libxfs_mod_incore_sb(struct xfs_mount *, int, int64_t, int); | |
2dd13604 ES |
532 | /* percpu counters in mp are #defined to the superblock sb_ counters */ |
533 | #define xfs_reinit_percpu_counters(mp) | |
19ebedcf | 534 | |
b626fb59 | 535 | void xfs_trans_mod_sb(struct xfs_trans *, uint, long); |
15348e04 | 536 | |
1d3bac1f DW |
537 | void xfs_verifier_error(struct xfs_buf *bp, int error, |
538 | xfs_failaddr_t failaddr); | |
539 | void xfs_inode_verifier_error(struct xfs_inode *ip, int error, | |
540 | const char *name, void *buf, size_t bufsz, | |
541 | xfs_failaddr_t failaddr); | |
f616e2bf | 542 | |
43f7ceb5 DW |
543 | #define xfs_buf_verifier_error(bp,e,n,bu,bus,fa) \ |
544 | xfs_verifier_error(bp, e, fa) | |
545 | ||
b626fb59 DC |
546 | /* XXX: this is clearly a bug - a shared header needs to export this */ |
547 | /* xfs_rtalloc.c */ | |
548 | int libxfs_rtfree_extent(struct xfs_trans *, xfs_rtblock_t, xfs_extlen_t); | |
0cf6a3a9 | 549 | bool libxfs_verify_rtbno(struct xfs_mount *mp, xfs_rtblock_t rtbno); |
b626fb59 | 550 | |
0b10a7f4 DW |
551 | struct xfs_rtalloc_rec { |
552 | xfs_rtblock_t ar_startblock; | |
553 | xfs_rtblock_t ar_blockcount; | |
554 | }; | |
555 | ||
556 | typedef int (*xfs_rtalloc_query_range_fn)( | |
557 | struct xfs_trans *tp, | |
558 | struct xfs_rtalloc_rec *rec, | |
559 | void *priv); | |
560 | ||
9542ae13 DC |
561 | int libxfs_zero_extent(struct xfs_inode *ip, xfs_fsblock_t start_fsb, |
562 | xfs_off_t count_fsb); | |
563 | ||
a65d8d29 BF |
564 | bool xfs_log_check_lsn(struct xfs_mount *, xfs_lsn_t); |
565 | ||
f7b1a8b1 | 566 | /* xfs_icache.c */ |
9587a34c DW |
567 | #define xfs_inode_set_cowblocks_tag(ip) do { } while (0) |
568 | #define xfs_inode_set_eofblocks_tag(ip) do { } while (0) | |
f7b1a8b1 | 569 | |
5d8acc46 DC |
570 | /* xfs_stats.h */ |
571 | #define XFS_STATS_CALC_INDEX(member) 0 | |
572 | #define XFS_STATS_INC_OFF(mp, off) | |
573 | #define XFS_STATS_ADD_OFF(mp, off, val) | |
574 | ||
4a492e72 | 575 | typedef unsigned char u8; |
c7a710b7 | 576 | unsigned int hweight8(unsigned int w); |
5d8acc46 | 577 | |
b626fb59 | 578 | #endif /* __LIBXFS_INTERNAL_XFS_H__ */ |