OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	10/28/2024 06:50:42 AM	rwxr-xr-x
📄 btrfs-list.h	4.55 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 btrfsck.h	4.92 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 crc32c.h	1.07 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 ctree.h	89.45 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 extent-cache.h	3.52 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 extent_io.h	5.9 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 ioctl.h	25.89 KB	02/16/2018 04:01:17 PM	rw-r--r--
📄 kerncompat.h	10.17 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 list.h	14.29 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 radix-tree.h	3.26 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 raid56.h	1.98 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 rbtree.h	3.81 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 send-stream.h	2.74 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 send-utils.h	3.61 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 send.h	3.02 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 sizes.h	1.19 KB	03/12/2018 11:04:27 PM	rw-r--r--
📄 version.h	363 bytes	03/12/2018 11:04:27 PM	rw-r--r--

Editing: radix-tree.h

/*
 * Copyright (C) 2007 Oracle.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 021110-1307, USA.
 */

/*
 * Copyright (C) 2001 Momchil Velikov
 * Portions Copyright (C) 2001 Christoph Hellwig
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2, or (at
 * your option) any later version.
 * 
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */
#ifndef _LINUX_RADIX_TREE_H
#define _LINUX_RADIX_TREE_H

#if BTRFS_FLAT_INCLUDES
#include "kerncompat.h"
#else
#include <btrfs/kerncompat.h>
#endif /* BTRFS_FLAT_INCLUDES */

#define RADIX_TREE_MAX_TAGS 2

/* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */
struct radix_tree_root {
	unsigned int		height;
	gfp_t			gfp_mask;
	struct radix_tree_node	*rnode;
};

#define RADIX_TREE_INIT(mask)	{					\
	.height = 0,							\
	.gfp_mask = (mask),						\
	.rnode = NULL,							\
}

#define RADIX_TREE(name, mask) \
	struct radix_tree_root name = RADIX_TREE_INIT(mask)

#define INIT_RADIX_TREE(root, mask)					\
do {									\
	(root)->height = 0;						\
	(root)->gfp_mask = (mask);					\
	(root)->rnode = NULL;						\
} while (0)

int radix_tree_insert(struct radix_tree_root *, unsigned long, void *);
void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long);
void *radix_tree_delete(struct radix_tree_root *, unsigned long);
unsigned int
radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
			unsigned long first_index, unsigned int max_items);
int radix_tree_preload(gfp_t gfp_mask);
void radix_tree_init(void);
void *radix_tree_tag_set(struct radix_tree_root *root,
			unsigned long index, unsigned int tag);
void *radix_tree_tag_clear(struct radix_tree_root *root,
			unsigned long index, unsigned int tag);
int radix_tree_tag_get(struct radix_tree_root *root,
			unsigned long index, unsigned int tag);
unsigned int
radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
		unsigned long first_index, unsigned int max_items,
		unsigned int tag);
int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);

static inline void radix_tree_preload_end(void)
{
	preempt_enable();
}

#endif /* _LINUX_RADIX_TREE_H */