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