Linux quad-clini-stageVM 5.4.0-1109-azure #115~18.04.1-Ubuntu SMP Mon May 22 20:06:37 UTC 2023 x86_64
Apache/2.4.29 (Ubuntu)
: 10.2.0.4 | : 18.226.180.158
Cant Read [ /etc/named.conf ]
7.4.25
www-data
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
include /
btrfs /
[ HOME SHELL ]
Name
Size
Permission
Action
btrfs-list.h
4.55
KB
-rw-r--r--
btrfsck.h
4.92
KB
-rw-r--r--
crc32c.h
1.07
KB
-rw-r--r--
ctree.h
89.45
KB
-rw-r--r--
extent-cache.h
3.52
KB
-rw-r--r--
extent_io.h
5.9
KB
-rw-r--r--
ioctl.h
25.89
KB
-rw-r--r--
kerncompat.h
10.17
KB
-rw-r--r--
list.h
14.29
KB
-rw-r--r--
radix-tree.h
3.26
KB
-rw-r--r--
raid56.h
1.98
KB
-rw-r--r--
rbtree.h
3.81
KB
-rw-r--r--
send-stream.h
2.74
KB
-rw-r--r--
send-utils.h
3.61
KB
-rw-r--r--
send.h
3.02
KB
-rw-r--r--
sizes.h
1.19
KB
-rw-r--r--
version.h
363
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : extent-cache.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. */ #ifndef __BTRFS_EXTENT_CACHE_H__ #define __BTRFS_EXTENT_CACHE_H__ #if BTRFS_FLAT_INCLUDES #include "kerncompat.h" #include "rbtree.h" #else #include <btrfs/kerncompat.h> #include <btrfs/rbtree.h> #endif /* BTRFS_FLAT_INCLUDES */ struct cache_tree { struct rb_root root; }; struct cache_extent { struct rb_node rb_node; u64 objectid; u64 start; u64 size; }; void cache_tree_init(struct cache_tree *tree); struct cache_extent *first_cache_extent(struct cache_tree *tree); struct cache_extent *last_cache_extent(struct cache_tree *tree); struct cache_extent *prev_cache_extent(struct cache_extent *pe); struct cache_extent *next_cache_extent(struct cache_extent *pe); /* * Find a cache_extent which covers start. * * If not found, return next cache_extent if possible. */ struct cache_extent *search_cache_extent(struct cache_tree *tree, u64 start); /* * Find a cache_extent which restrictly covers start. * * If not found, return NULL. */ struct cache_extent *lookup_cache_extent(struct cache_tree *tree, u64 start, u64 size); /* * Add an non-overlap extent into cache tree * * If [start, start+size) overlap with existing one, it will return -EEXIST. */ int add_cache_extent(struct cache_tree *tree, u64 start, u64 size); /* * Same with add_cache_extent, but with cache_extent strcut. */ int insert_cache_extent(struct cache_tree *tree, struct cache_extent *pe); void remove_cache_extent(struct cache_tree *tree, struct cache_extent *pe); static inline int cache_tree_empty(struct cache_tree *tree) { return RB_EMPTY_ROOT(&tree->root); } typedef void (*free_cache_extent)(struct cache_extent *pe); void cache_tree_free_extents(struct cache_tree *tree, free_cache_extent free_func); #define FREE_EXTENT_CACHE_BASED_TREE(name, free_func) \ static void free_##name##_tree(struct cache_tree *tree) \ { \ cache_tree_free_extents(tree, free_func); \ } void free_extent_cache_tree(struct cache_tree *tree); /* * Search a cache_extent with same objectid, and covers start. * * If not found, return next if possible. */ struct cache_extent *search_cache_extent2(struct cache_tree *tree, u64 objectid, u64 start); /* * Search a cache_extent with same objectid, and covers the range * [start, start + size) * * If not found, return next cache_extent if possible. */ struct cache_extent *lookup_cache_extent2(struct cache_tree *tree, u64 objectid, u64 start, u64 size); int add_cache_extent2(struct cache_tree *tree, u64 objectid, u64 start, u64 size); int insert_cache_extent2(struct cache_tree *tree, struct cache_extent *pe); /* * Insert a cache_extent range [start, start + size). * * This function may merge with existing cache_extent. * NOTE: caller must ensure the inserted range won't cover with any existing * range. */ int add_merge_cache_extent(struct cache_tree *tree, u64 start, u64 size); #endif
Close