/third_party/ltp/testcases/kernel/fs/inode/ |
H A D | inode02.c | 225 int tree(void) in tree() function [all...] |
/third_party/node/deps/brotli/c/enc/ |
H A D | entropy_encode.c | 71 BrotliCreateHuffmanTree(const uint32_t* data, const size_t length, const int tree_limit, HuffmanTree* tree, uint8_t* depth) BrotliCreateHuffmanTree() argument 163 BrotliWriteHuffmanTreeRepetitions( const uint8_t previous_value, const uint8_t value, size_t repetitions, size_t* tree_size, uint8_t* tree, uint8_t* extra_bits_data) BrotliWriteHuffmanTreeRepetitions() argument 208 BrotliWriteHuffmanTreeRepetitionsZeros( size_t repetitions, size_t* tree_size, uint8_t* tree, uint8_t* extra_bits_data) BrotliWriteHuffmanTreeRepetitionsZeros() argument 405 BrotliWriteHuffmanTree(const uint8_t* depth, size_t length, size_t* tree_size, uint8_t* tree, uint8_t* extra_bits_data) BrotliWriteHuffmanTree() argument [all...] |
/third_party/ltp/tools/sparse/sparse-src/ |
H A D | expression.c | 148 static struct token *parse_type(struct token *token, struct expression **tree) in parse_type() argument 388 static struct token *generic_selection(struct token *token, struct expression **tree) in generic_selection() argument 422 struct token *primary_expression(struct token *token, struct expression **tree) in primary_expression() argument 161 builtin_types_compatible_p_expr(struct token *token, struct expression **tree) builtin_types_compatible_p_expr() argument 187 builtin_offsetof_expr(struct token *token, struct expression **tree) builtin_offsetof_expr() argument 551 postfix_expression(struct token *token, struct expression **tree, struct expression *cast_init_expr) postfix_expression() argument 628 type_info_expression(struct token *token, struct expression **tree, int type) type_info_expression() argument 667 unary_expression(struct token *token, struct expression **tree) unary_expression() argument 757 cast_expression(struct token *token, struct expression **tree) cast_expression() argument 832 multiplicative_expression(struct token *token, struct expression **tree) multiplicative_expression() argument 840 additive_expression(struct token *token, struct expression **tree) additive_expression() argument 848 shift_expression(struct token *token, struct expression **tree) shift_expression() argument 856 relational_expression(struct token *token, struct expression **tree) relational_expression() argument 865 equality_expression(struct token *token, struct expression **tree) equality_expression() argument 873 bitwise_and_expression(struct token *token, struct expression **tree) bitwise_and_expression() argument 881 bitwise_xor_expression(struct token *token, struct expression **tree) bitwise_xor_expression() argument 889 bitwise_or_expression(struct token *token, struct expression **tree) bitwise_or_expression() argument 897 logical_and_expression(struct token *token, struct expression **tree) logical_and_expression() argument 905 logical_or_expression(struct token *token, struct expression **tree) logical_or_expression() argument 913 conditional_expression(struct token *token, struct expression **tree) conditional_expression() argument 928 assignment_expression(struct token *token, struct expression **tree) assignment_expression() argument 956 comma_expression(struct token *token, struct expression **tree) comma_expression() argument 964 parse_expression(struct token *token, struct expression **tree) parse_expression() argument [all...] |
/third_party/node/deps/v8/src/compiler/ |
H A D | persistent-map.h | 71 const FocusedTree* tree = FindHash(key_hash); in Get() local 149 PersistentMap(const FocusedTree* tree, Zone* zone, Value def_value) PersistentMap() argument 293 begin(const FocusedTree* tree, Value def_value) begin() argument 398 FocusedTree* tree = new (zone_->Allocate<FocusedTree>(size)) global() local 413 const FocusedTree* tree = tree_; FindHash() local 430 const FocusedTree* tree = tree_; FindHash() local 453 GetFocusedValue( const FocusedTree* tree, const Key& key) const GetFocusedValue() argument 475 GetChild(const FocusedTree* tree, int level, Bit bit) GetChild() argument [all...] |
/third_party/node/deps/v8/src/regexp/experimental/ |
H A D | experimental-compiler.cc | 26 static bool Check(RegExpTree* tree, RegExpFlags flags, int capture_count) { in Check() argument 177 bool ExperimentalRegExpCompiler::CanBeHandled(RegExpTree* tree, in CanBeHandled() argument 298 static ZoneList<RegExpInstruction> Compile(RegExpTree* tree, in Compile() argument 630 Compile( RegExpTree* tree, RegExpFlags flags, Zone* zone) Compile() argument [all...] |
/third_party/skia/third_party/externals/brotli/c/enc/ |
H A D | entropy_encode.c | 71 BrotliCreateHuffmanTree(const uint32_t* data, const size_t length, const int tree_limit, HuffmanTree* tree, uint8_t* depth) BrotliCreateHuffmanTree() argument 163 BrotliWriteHuffmanTreeRepetitions( const uint8_t previous_value, const uint8_t value, size_t repetitions, size_t* tree_size, uint8_t* tree, uint8_t* extra_bits_data) BrotliWriteHuffmanTreeRepetitions() argument 208 BrotliWriteHuffmanTreeRepetitionsZeros( size_t repetitions, size_t* tree_size, uint8_t* tree, uint8_t* extra_bits_data) BrotliWriteHuffmanTreeRepetitionsZeros() argument 405 BrotliWriteHuffmanTree(const uint8_t* depth, size_t length, size_t* tree_size, uint8_t* tree, uint8_t* extra_bits_data) BrotliWriteHuffmanTree() argument [all...] |
/third_party/protobuf/src/google/protobuf/util/ |
H A D | field_mask_util.cc | 626 FieldMaskTree tree; ToCanonicalForm() local 634 FieldMaskTree tree; Union() local 643 FieldMaskTree tree, intersection; Intersect() local 659 FieldMaskTree tree; Subtract() local 691 FieldMaskTree tree; MergeMessageTo() local 699 FieldMaskTree tree; TrimMessage() local 708 FieldMaskTree tree; TrimMessage() local [all...] |
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
H A D | cord_rep_btree.h | 134 CordRepBtree* tree; global() member 388 Delete(CordRepBtree* tree) Delete() argument 584 CordRepBtree* tree = new CordRepBtree; New() local 591 CordRepBtree* tree = new CordRepBtree; New() local 602 CordRepBtree* tree = new CordRepBtree; New() local 610 DestroyTree(CordRepBtree* tree, size_t begin, size_t end) DestroyTree() argument 619 Destroy(CordRepBtree* tree) Destroy() argument 624 auto* tree = static_cast<CordRepBtree*>(::operator new(sizeof(CordRepBtree))); CopyRaw() local 631 CordRepBtree* tree = CopyRaw(); Copy() local 640 CordRepBtree* tree = CopyRaw(); CopyToEndFrom() local 651 CordRepBtree* tree = CopyRaw(); CopyBeginTo() local 785 CordRepBtree* tree = this; GetAppendBuffer() local 839 Append(CordRepBtree* tree, CordRep* rep) Append() argument 846 Prepend(CordRepBtree* tree, CordRep* rep) Prepend() argument 855 AssertValid(CordRepBtree* tree, bool ) AssertValid() argument 860 AssertValid(const CordRepBtree* tree, bool ) AssertValid() argument [all...] |
/kernel/linux/linux-5.10/drivers/md/bcache/ |
H A D | bset.h | 173 struct bkey_float *tree; global() member [all...] |
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gem/ |
H A D | i915_gem_object_types.h | 115 struct rb_root tree; member
|
/kernel/linux/linux-5.10/drivers/of/ |
H A D | overlay.c | 730 init_overlay_changeset(struct overlay_changeset *ovcs, const void *fdt, struct device_node *tree) init_overlay_changeset() argument 914 of_overlay_apply(const void *fdt, struct device_node *tree, int *ovcs_id) of_overlay_apply() argument 1075 find_node(struct device_node *tree, struct device_node *np) find_node() argument [all...] |
/kernel/linux/linux-5.10/tools/objtool/ |
H A D | elf.c | 46 static void rb_add(struct rb_root *tree, struct rb_node *node, in rb_add() argument 64 static struct rb_node *rb_find_first(const struct rb_root *tree, const void *key, in rb_find_first() argument
|
/kernel/linux/linux-5.10/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-5.10/tools/perf/util/ |
H A D | srcline.c | 614 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert() argument 644 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find() argument 663 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete() argument 705 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert() argument 728 inlines__tree_find(struct rb_root_cached *tree, u64 addr) inlines__tree_find() argument 747 inlines__tree_delete(struct rb_root_cached *tree) inlines__tree_delete() argument [all...] |
/kernel/linux/linux-5.10/fs/jfs/ |
H A D | jfs_dmap.h | 151 struct dmaptree tree; /* 360: dmap tree */ global() member [all...] |
/kernel/linux/linux-5.10/fs/btrfs/ |
H A D | ordered-data.c | 134 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument 169 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; __btrfs_add_ordered_extent() local 291 struct btrfs_ordered_inode_tree *tree; btrfs_add_ordered_sum() local 316 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_dec_test_first_ordered_pending() local 385 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_dec_test_ordered_pending() local 469 struct btrfs_ordered_inode_tree *tree; btrfs_remove_ordered_extent() local 745 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_extent() local 771 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_range() local 812 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_get_ordered_extents_for_logging() local 840 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_first_ordered_extent() local 868 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_find_ordered_sum() local [all...] |
/kernel/linux/linux-5.10/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...] |
/kernel/linux/linux-5.10/lib/zstd/ |
H A D | huf_compress.c | 420 size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize) in HUF_buildCTable_wksp() argument
|
/kernel/linux/linux-5.10/kernel/ |
H A D | auditfilter.c | 934 struct audit_tree *tree in audit_add_rule() local 1016 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 936 struct audit_tree *tree; audit_tag_tree() local [all...] |
/kernel/linux/linux-5.10/fs/xfs/ |
H A D | xfs_dquot.c | 881 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget() local 970 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget_inode() local 770 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 811 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 | 55 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dquot_walk() local
|
/kernel/linux/linux-6.6/fs/btrfs/ |
H A D | backref.h | 517 btrfs_backref_drop_node(struct btrfs_backref_cache *tree, struct btrfs_backref_node *node) btrfs_backref_drop_node() argument [all...] |
H A D | ordered-data.c | 127 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument 212 struct btrfs_ordered_inode_tree *tree in insert_ordered_extent() local 291 struct btrfs_ordered_inode_tree *tree; btrfs_add_ordered_sum() local 408 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_mark_ordered_io_finished() local 501 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_dec_test_ordered_pending() local 582 struct btrfs_ordered_inode_tree *tree; btrfs_remove_ordered_extent() local 881 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_extent() local 910 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_range() local 953 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_get_ordered_extents_for_logging() local 982 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_first_ordered_extent() local 1012 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_lookup_first_ordered_range() local 1153 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_split_ordered_extent() local [all...] |
/kernel/linux/linux-6.6/fs/dlm/ |
H A D | debug_fs.c | 478 struct rb_root *tree; in table_seq_start() local 562 struct rb_root *tree; in table_seq_next() local [all...] |