Reorder extent back refs to differentiate file data from btree blocks
[btrfs-progs-unstable.git] / bit-radix.h
blobaf14e803c95de3bd89fe54c591ee1953455f3853
1 /*
2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #ifndef __BIT_RADIX__
20 #define __BIT_RADIX__
21 #include "radix-tree.h"
23 int set_radix_bit(struct radix_tree_root *radix, unsigned long bit);
24 int test_radix_bit(struct radix_tree_root *radix, unsigned long bit);
25 int clear_radix_bit(struct radix_tree_root *radix, unsigned long bit);
26 int find_first_radix_bit(struct radix_tree_root *radix, unsigned long *retbits,
27 unsigned long start, int nr);
29 static inline void init_bit_radix(struct radix_tree_root *radix)
31 INIT_RADIX_TREE(radix, GFP_NOFS);
33 #endif