ceph: client types

#ifndef _FS_CEPH_DEBUG_H

#define _FS_CEPH_DEBUG_H

#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

#ifdef CONFIG_CEPH_FS_PRETTYDEBUG

/*

 * wrap pr_debug to include a filename:lineno prefix on each line.

 * this incurs some overhead (kernel size and execution time) due to

 * the extra function call at each call site.

 */

# if defined(DEBUG) || defined(CONFIG_DYNAMIC_DEBUG)

extern const char *ceph_file_part(const char *s, int len);

#  define dout(fmt, ...)						\

	pr_debug(" %12.12s:%-4d : " fmt,				\

		 ceph_file_part(__FILE__, sizeof(__FILE__)),		\

		 __LINE__, ##__VA_ARGS__)

# else

/* faux printk call just to see any compiler warnings. */

#  define dout(fmt, ...)	do {				\

		if (0)						\

			printk(KERN_DEBUG fmt, ##__VA_ARGS__);	\

	} while (0)

# endif

#else

/*

 * or, just wrap pr_debug

 */

# define dout(fmt, ...)	pr_debug(" " fmt, ##__VA_ARGS__)

#endif

#endif

/*

 * Ceph 'frag' type

 */

#include "types.h"

int ceph_frag_compare(__u32 a, __u32 b)

{

	unsigned va = ceph_frag_value(a);

	unsigned vb = ceph_frag_value(b);

	if (va < vb)

		return -1;

	if (va > vb)

		return 1;

	va = ceph_frag_bits(a);

	vb = ceph_frag_bits(b);

	if (va < vb)

		return -1;

	if (va > vb)

		return 1;

	return 0;

}

#ifndef _FS_CEPH_FRAG_H

#define _FS_CEPH_FRAG_H

/*

 * "Frags" are a way to describe a subset of a 32-bit number space,

 * using a mask and a value to match against that mask.  Any given frag

 * (subset of the number space) can be partitioned into 2^n sub-frags.

 *

 * Frags are encoded into a 32-bit word:

 *   8 upper bits = "bits"

 *  24 lower bits = "value"

 * (We could go to 5+27 bits, but who cares.)

 *

 * We use the _most_ significant bits of the 24 bit value.  This makes

 * values logically sort.

 *

 * Unfortunately, because the "bits" field is still in the high bits, we

 * can't sort encoded frags numerically.  However, it does allow you

 * to feed encoded frags as values into frag_contains_value.

 */

static inline __u32 ceph_frag_make(__u32 b, __u32 v)

{

	return (b << 24) |

		(v & (0xffffffu << (24-b)) & 0xffffffu);

}

static inline __u32 ceph_frag_bits(__u32 f)

{

	return f >> 24;

}

static inline __u32 ceph_frag_value(__u32 f)

{

	return f & 0xffffffu;

}

static inline __u32 ceph_frag_mask(__u32 f)

{

	return (0xffffffu << (24-ceph_frag_bits(f))) & 0xffffffu;

}

static inline __u32 ceph_frag_mask_shift(__u32 f)

{

	return 24 - ceph_frag_bits(f);

}

static inline int ceph_frag_contains_value(__u32 f, __u32 v)

{

	return (v & ceph_frag_mask(f)) == ceph_frag_value(f);

}

static inline int ceph_frag_contains_frag(__u32 f, __u32 sub)

{

	/* is sub as specific as us, and contained by us? */

	return ceph_frag_bits(sub) >= ceph_frag_bits(f) &&

	       (ceph_frag_value(sub) & ceph_frag_mask(f)) == ceph_frag_value(f);

}

static inline __u32 ceph_frag_parent(__u32 f)

{

	return ceph_frag_make(ceph_frag_bits(f) - 1,

			 ceph_frag_value(f) & (ceph_frag_mask(f) << 1));

}

static inline int ceph_frag_is_left_child(__u32 f)

{

	return ceph_frag_bits(f) > 0 &&

		(ceph_frag_value(f) & (0x1000000 >> ceph_frag_bits(f))) == 0;

}

static inline int ceph_frag_is_right_child(__u32 f)

{

	return ceph_frag_bits(f) > 0 &&

		(ceph_frag_value(f) & (0x1000000 >> ceph_frag_bits(f))) == 1;

}

static inline __u32 ceph_frag_sibling(__u32 f)

{

	return ceph_frag_make(ceph_frag_bits(f),

		      ceph_frag_value(f) ^ (0x1000000 >> ceph_frag_bits(f)));

}

static inline __u32 ceph_frag_left_child(__u32 f)

{

	return ceph_frag_make(ceph_frag_bits(f)+1, ceph_frag_value(f));

}

static inline __u32 ceph_frag_right_child(__u32 f)

{

	return ceph_frag_make(ceph_frag_bits(f)+1,

	      ceph_frag_value(f) | (0x1000000 >> (1+ceph_frag_bits(f))));

}

static inline __u32 ceph_frag_make_child(__u32 f, int by, int i)

{

	int newbits = ceph_frag_bits(f) + by;

	return ceph_frag_make(newbits,

			 ceph_frag_value(f) | (i << (24 - newbits)));

}

static inline int ceph_frag_is_leftmost(__u32 f)

{

	return ceph_frag_value(f) == 0;

}

static inline int ceph_frag_is_rightmost(__u32 f)

{

	return ceph_frag_value(f) == ceph_frag_mask(f);

}

static inline __u32 ceph_frag_next(__u32 f)

{

	return ceph_frag_make(ceph_frag_bits(f),

			 ceph_frag_value(f) + (0x1000000 >> ceph_frag_bits(f)));

}

/*

 * comparator to sort frags logically, as when traversing the

 * number space in ascending order...

 */

int ceph_frag_compare(__u32 a, __u32 b);

#endif

#ifndef __CEPH_VERSION_H

#define __CEPH_VERSION_H

#define CEPH_GIT_VER 335cd8f952b457095ea2a66aee3db50efb63c91d

#endif