| /linux-6.15/include/linux/ |
| H A D | rbtree.h | 195 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add()
229 int c; in rb_find_add_cached() local
260 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add()
265 int c; in rb_find_add() local
301 int c; in rb_find_add_rcu() local
329 rb_find(const void *key, const struct rb_root *tree, in rb_find()
335 int c = cmp(key, node); in rb_find() local
360 rb_find_rcu(const void *key, const struct rb_root *tree, in rb_find_rcu()
366 int c = cmp(key, node); in rb_find_rcu() local
395 int c = cmp(key, node); in rb_find_first() local
[all …]
|
| H A D | rbtree_latch.h | 46 struct rb_root tree[2]; member
111 int c; in __lt_find() local
|
| /linux-6.15/tools/include/linux/ |
| H A D | rbtree.h | 178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
206 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add()
234 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add()
239 int c; in rb_find_add() local
267 rb_find(const void *key, const struct rb_root *tree, in rb_find()
273 int c = cmp(key, node); in rb_find() local
295 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first()
302 int c = cmp(key, node); in rb_find_first() local
341 #define rb_for_each(node, key, tree, cmp) \ argument
|
| /linux-6.15/scripts/dtc/ |
| H A D | livetree.c | 400 struct node *tree, uint32_t boot_cpuid_phys) in build_dt_info()
452 struct node *c; in get_property_by_label() local
479 struct node *c; in get_marker_label() local
658 uint32_t guess_boot_cpuid(struct node *tree) in guess_boot_cpuid()
804 struct node *c; in sort_node() local
846 struct node *c; in any_label_tree() local
863 struct node *c; in generate_label_tree_internal() local
901 struct node *c; in any_fixup_tree() local
952 struct node *c; in generate_fixups_tree_internal() local
972 struct node *c; in any_local_fixup_tree() local
[all …]
|
| H A D | treesource.c | 42 static bool isstring(char c) in isstring()
60 char c = *s++; in write_propval_string() local
299 static void write_tree_source_node(FILE *f, struct node *tree, int level) in write_tree_source_node()
|
| /linux-6.15/lib/zlib_deflate/ |
| H A D | deftree.c | 150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
154 # define send_code(s, c, tree) \ argument
296 #define pqremove(s, tree, top) \ argument
307 #define smaller(tree, n, m, depth) \ argument
319 ct_data *tree, /* the tree to restore */ in pqdownheap()
358 ct_data *tree = desc->dyn_tree; in gen_bitlen() local
442 ct_data *tree, /* the tree to decorate */ in gen_codes()
489 ct_data *tree = desc->dyn_tree; in build_tree() local
574 ct_data *tree, /* the tree to be scanned */ in scan_tree()
620 ct_data *tree, /* the tree to be scanned */ in send_tree()
|
| /linux-6.15/fs/btrfs/ |
| H A D | extent-io-tree.c | 56 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
59 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range()
80 #define btrfs_debug_check_extent_io_range(c, s, e) do {} while (0) argument
87 static bool is_inode_io_tree(const struct extent_io_tree *tree) in is_inode_io_tree()
93 struct btrfs_inode *extent_io_tree_to_inode(struct extent_io_tree *tree) in extent_io_tree_to_inode()
117 struct extent_io_tree *tree, unsigned int owner) in extent_io_tree_init()
132 void extent_io_tree_release(struct extent_io_tree *tree) in extent_io_tree_release()
409 static void set_state_bits(struct extent_io_tree *tree, in set_state_bits()
499 static void insert_state_fast(struct extent_io_tree *tree, in insert_state_fast()
895 bool find_first_extent_bit(struct extent_io_tree *tree, u64 start, in find_first_extent_bit()
[all …]
|
| H A D | backref.c | 434 struct preftree *tree = &preftrees->indirect; in add_indirect_ref() local
841 struct preftree *tree = &preftrees->indirect_missing_keys; in add_missing_keys() local
2533 const size_t c = 3 * sizeof(u64); in build_ino_list() local
3108 void btrfs_backref_drop_node(struct btrfs_backref_cache *tree, in btrfs_backref_drop_node()
|
| H A D | extent_io.c | 314 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; in find_lock_delalloc_range() local
2589 int extent_invalidate_folio(struct extent_io_tree *tree, in extent_invalidate_folio()
2621 static bool try_release_extent_state(struct extent_io_tree *tree, in try_release_extent_state()
3963 static void memset_extent_buffer(const struct extent_buffer *eb, int c, in memset_extent_buffer()
|
| /linux-6.15/fs/unicode/ |
| H A D | mkutf8data.c | 345 struct tree { struct
350 struct tree *next; argument
355 int *(*leaf_index)(struct tree *, void *); argument
378 * Example lookup function for a tree. argument
417 static void tree_walk(struct tree *tree) in tree_walk()
654 static void prune(struct tree *tree) in prune()
1048 static int size_nodes(struct tree *tree) in size_nodes()
1745 static void verify(struct tree *tree) in verify()
2794 unsigned char c = *s; in utf8clen() local
2967 struct tree *tree; member
[all …]
|
| /linux-6.15/fs/bcachefs/ |
| H A D | quota.c | 485 struct bch_fs *c = trans->c; in bch2_fs_quota_read_inode() local
488 u32 tree = bch2_snapshot_tree(c, k.k->p.snapshot); in bch2_fs_quota_read_inode() local
523 int bch2_fs_quota_read(struct bch_fs *c) in bch2_fs_quota_read()
551 struct bch_fs *c = sb->s_fs_info; in bch2_quota_enable() local
597 struct bch_fs *c = sb->s_fs_info; in bch2_quota_disable() local
620 struct bch_fs *c = sb->s_fs_info; in bch2_quota_remove() local
671 struct bch_fs *c = sb->s_fs_info; in bch2_quota_get_state() local
701 struct bch_fs *c = sb->s_fs_info; in bch2_quota_set_info() local
778 struct bch_fs *c = sb->s_fs_info; in bch2_get_quota() local
797 struct bch_fs *c = sb->s_fs_info; in bch2_get_next_quota() local
[all …]
|
| H A D | snapshot.c | 289 struct bch_fs *c = trans->c; in __bch2_mark_snapshot() local
415 struct bch_fs *c = trans->c; in bch2_snapshot_tree_master_subvol() local
459 struct bch_fs *c = trans->c; in check_snapshot_tree() local
632 struct bch_fs *c = trans->c; in snapshot_tree_ptr_repair() local
685 struct bch_fs *c = trans->c; in check_snapshot() local
844 struct bch_fs *c = trans->c; in check_snapshot_exists() local
1019 struct bch_fs *c = trans->c; in bch2_check_key_has_snapshot() local
1073 struct bch_fs *c = trans->c; in bch2_snapshot_node_delete() local
1178 static int create_snapids(struct btree_trans *trans, u32 parent, u32 tree, in create_snapids()
1183 struct bch_fs *c = trans->c; in create_snapids() local
[all …]
|
| /linux-6.15/drivers/sh/intc/ |
| H A D | internals.h | 24 #define INTC_REG(d, x, c) (d->reg[(x)] + ((d->smp[(x)] & 0xff) * c)) argument
28 #define INTC_REG(d, x, c) (d->reg[(x)]) argument
57 struct radix_tree_root tree; member
|
| /linux-6.15/fs/smb/client/ |
| H A D | dir.c | 82 const char *tree, int tree_len, in __build_path_from_dentry_optional_prefix()
832 wchar_t c; local
|
| /linux-6.15/kernel/ |
| H A D | audit.h | 307 #define auditsc_get_stamp(c, t, s) 0 argument
328 #define audit_put_tree(tree) do { } while (0) argument
338 #define audit_filter_inodes(t, c) do { } while (0) argument
|
| H A D | auditsc.c | 118 struct audit_chunk *c[31]; member
310 static int match_tree_refs(struct audit_context *ctx, struct audit_tree *tree) in match_tree_refs()
|
| /linux-6.15/drivers/md/ |
| H A D | dm-writecache.c | 119 struct rb_root tree; member
474 struct completion c; member
1670 struct copy_struct *c = ptr; in writecache_copy_endio() local
1723 struct copy_struct *c; in __writecache_endio_ssd() local
1898 struct copy_struct *c; in __writecache_writeback_ssd() local
|
| /linux-6.15/fs/ |
| H A D | namespace.c | 2331 struct mount *tree; in collect_mounts() local
4098 char c; in copy_mount_options() local
|