| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_dquot.c | 855 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget() local
944 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget_inode() local
748 xfs_qm_dqget_cache_lookup( struct xfs_mount *mp, struct xfs_quotainfo *qi, struct radix_tree_root *tree, xfs_dqid_t id) xfs_qm_dqget_cache_lookup() argument
789 xfs_qm_dqget_cache_insert( struct xfs_mount *mp, struct xfs_quotainfo *qi, struct radix_tree_root *tree, xfs_dqid_t id, struct xfs_dquot *dqp) xfs_qm_dqget_cache_insert() argument
[all...] |
| H A D | xfs_qm.c | 58 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dquot_walk() local
|
| /kernel/linux/linux-6.6/kernel/ |
| H A D | auditfilter.c | 943 struct audit_tree *tree in audit_add_rule() local
1026 struct audit_tree *tree = entry->rule.tree; audit_del_rule() local
[all...] |
| H A D | audit_tree.c | 95 struct audit_tree *tree; in alloc_tree() local
111 get_tree(struct audit_tree *tree) get_tree() argument
116 put_tree(struct audit_tree *tree) put_tree() argument
123 audit_tree_path(struct audit_tree *tree) audit_tree_path() argument
261 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) audit_tree_match() argument
397 create_chunk(struct inode *inode, struct audit_tree *tree) create_chunk() argument
458 tag_chunk(struct inode *inode, struct audit_tree *tree) tag_chunk() argument
542 kill_rules(struct audit_context *context, struct audit_tree *tree) kill_rules() argument
609 trim_marked(struct audit_tree *tree) trim_marked() argument
635 kill_rules(audit_context(), tree); trim_marked() local
649 struct audit_tree *tree; audit_remove_tree_rule() local
684 struct audit_tree *tree; audit_trim_trees() local
740 audit_put_tree(struct audit_tree *tree) audit_put_tree() argument
802 struct audit_tree *seed = rule->tree, *tree; audit_add_tree_rule() local
897 struct audit_tree *tree; audit_tag_tree() local
934 struct audit_tree *tree; audit_tag_tree() local
[all...] |
| /kernel/linux/linux-6.6/kernel/module/ |
| H A D | internal.h | 311 static inline struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find() argument
|
| /kernel/linux/linux-6.6/drivers/of/ |
| H A D | overlay.c | 1084 find_node(struct device_node *tree, struct device_node *np) find_node() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| H A D | bset.h | 173 struct bkey_float *tree; global() member
[all...] |
| /kernel/linux/linux-6.6/tools/perf/ui/stdio/ |
| H A D | hist.c | 305 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat() argument
356 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, in callchain__fprintf_folded() argument
|
| /kernel/linux/linux-6.6/tools/objtool/ |
| H A D | elf.c | 171 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; in find_symbol_by_offset() local
184 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; in find_func_by_offset() local
197 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; in find_symbol_containing() local
245 struct rb_root_cached *tree = (struct rb_root_cached *)&sec->symbol_tree; in find_func_containing() local
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | env.h | 114 struct rb_root tree; member
|
| /kernel/linux/linux-6.6/lib/zlib_deflate/ |
| H A D | deftree.c | 317 pqdownheap( deflate_state *s, ct_data *tree, int k ) pqdownheap() argument
358 ct_data *tree = desc->dyn_tree; gen_bitlen() local
441 gen_codes( ct_data *tree, int max_code, ush *bl_count ) gen_codes() argument
489 ct_data *tree = desc->dyn_tree; build_tree() local
572 scan_tree( deflate_state *s, ct_data *tree, int max_code ) scan_tree() argument
618 send_tree( deflate_state *s, ct_data *tree, int max_code ) send_tree() argument
[all...] |
| /third_party/gn/src/gn/ |
| H A D | desc_builder.cc | 121 BaseDescBuilder(const std::set<std::string>& what, bool all, bool tree, bool blame) BaseDescBuilder() argument
318 TargetDescBuilder(const Target* target, const std::set<std::string>& what, bool all, bool tree, bool blame) TargetDescBuilder() argument
919 DescriptionForTarget( const Target* target, const std::string& what, bool all, bool tree, bool blame) DescriptionForTarget() argument
|
| /third_party/node/deps/v8/third_party/zlib/ |
| H A D | trees.c | 490 ct_data *tree = desc->dyn_tree; global() local
619 ct_data *tree = desc->dyn_tree; global() local
[all...] |
| /third_party/node/deps/zlib/ |
| H A D | trees.c | 202 gen_codes(ct_data *tree, int max_code, ushf *bl_count) gen_codes() argument
507 pqdownheap(deflate_state *s, ct_data *tree, int k) pqdownheap() argument
539 ct_data *tree = desc->dyn_tree; gen_bitlen() local
626 ct_data *tree = desc->dyn_tree; build_tree() local
710 scan_tree(deflate_state *s, ct_data *tree, int max_code) scan_tree() argument
751 send_tree(deflate_state *s, ct_data *tree, int max_code) send_tree() argument
[all...] |
| /third_party/node/deps/brotli/c/enc/ |
| H A D | compress_fragment.c | 131 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode() local
|
| H A D | compress_fragment_two_pass.c | 74 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode() local
|
| /third_party/libwebsockets/win32port/zlib/ |
| H A D | trees.c | 498 ct_data *tree = desc->dyn_tree; global() local
627 ct_data *tree = desc->dyn_tree; global() local
[all...] |
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/ |
| H A D | RangeTree.java | 1057 union(RangeTree tree) union() argument
1062 intersect(RangeTree tree) intersect() argument
1067 subtract(RangeTree tree) subtract() argument
1091 containsAll(RangeTree tree) containsAll() argument
[all...] |
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| H A D | compress_fragment.c | 131 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode() local
|
| H A D | compress_fragment_two_pass.c | 74 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode() local
|
| /third_party/skia/third_party/externals/zlib/ |
| H A D | trees.c | 490 ct_data *tree = desc->dyn_tree; global() local
619 ct_data *tree = desc->dyn_tree; global() local
[all...] |
| /third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
| H A D | TextFormatTest.java | 1561 assertLocation( TextFormatParseInfoTree tree, final Descriptor descriptor, final String fieldName, int index, int line, int column) assertLocation() argument
[all...] |
| /third_party/protobuf/src/google/protobuf/ |
| H A D | text_format_unittest.cc | 1428 void ExpectLocation(TextFormat::ParseInfoTree* tree, const Descriptor* d, in ExpectLocation() argument
1480 TextFormat::ParseInfoTree tree; in TEST_F() local
[all...] |
| H A D | text_format.h | 553 void WriteLocationsTo(ParseInfoTree* tree) { parse_info_tree_ = tree; } in WriteLocationsTo() argument
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree.cc | 310 Propagate(CordRepBtree* tree, int depth, size_t length, OpResult result) Propagate() argument
351 DestroyLeaf(CordRepBtree* tree, size_t begin, size_t end) DestroyLeaf() argument
358 DestroyNonLeaf(CordRepBtree* tree, size_t begin, size_t end) DestroyNonLeaf() argument
366 IsValid(const CordRepBtree* tree, bool shallow) IsValid() argument
411 AssertValid(CordRepBtree* tree, bool shallow) AssertValid() argument
419 AssertValid(const CordRepBtree* tree, bool shallow) AssertValid() argument
463 AddCordRep(CordRepBtree* tree, CordRep* rep) AddCordRep() argument
545 AddData(CordRepBtree* tree, absl::string_view data, size_t extra) AddData() argument
907 AppendSlow(CordRepBtree* tree, CordRep* rep) AppendSlow() argument
919 PrependSlow(CordRepBtree* tree, CordRep* rep) PrependSlow() argument
931 Append(CordRepBtree* tree, absl::string_view data, size_t extra) Append() argument
936 Prepend(CordRepBtree* tree, absl::string_view data, size_t extra) Prepend() argument
[all...] |