b
#define __FGT(g, b, p, f) \
#define FGT(g, b, p) __FGT(g, b, p, __NO_FGF__)
#define FGT(g, b, p) __FGT(g, b, p, __NO_FGF__)
#define SR_FGF_RANGE(sr, e, g, b, p, f) \
.tc = __FGT(g, b, p, f), \
#define SR_FGF(sr, g, b, p, f) SR_FGF_RANGE(sr, sr, g, b, p, f)
#define SR_FGF(sr, g, b, p, f) SR_FGF_RANGE(sr, sr, g, b, p, f)
#define SR_FGT(sr, g, b, p) SR_FGF_RANGE(sr, sr, g, b, p, __NO_FGF__)
#define SR_FGT(sr, g, b, p) SR_FGF_RANGE(sr, sr, g, b, p, __NO_FGF__)
#define SR_FGT_RANGE(sr, end, g, b, p) \
SR_FGF_RANGE(sr, end, g, b, p, __NO_FGF__)
#define b %r9d
void (*end_io)(struct dm_buffer *b, blk_status_t bs);
unsigned int index = cache_index(b, lh->no_previous); /* no_previous is num_locks */
return w->pred(b, w->context);
struct dm_buffer *b;
return b;
struct dm_buffer *b;
return b;
struct dm_buffer *b, int list_mode)
struct dm_buffer *b;
typedef enum it_action (*iter_fn)(struct dm_buffer *b, void *context);
r = __cache_insert(&tree->root, b);
struct dm_buffer *b;
return b;
best = b;
struct dm_buffer *b;
break;
release(b);
struct b {
struct b {
int b(void)