| /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...] |
| H A D | cord_rep_btree_test.cc | 165 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges() argument 178 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges() argument 200 CordRepBtree* tree = CordRepBtree::Create(MakeHexFlat(0)); in MakeTree() local 211 CordRepBtree* tree = CordRepBtree::Create(*it); CreateTree() local 219 CordRepBtree* tree = CordRepBtree::Create(*rit); CreateTreeReverse() local 276 auto* tree = CordRepBtree::New(); TEST() local 284 auto* tree = CordRepBtree::New(3); TEST() local 360 CordRepBtree* tree = CordRepBtree::New(leaf); TEST() local 463 CordRepBtree* tree = CordRepBtree::Create(flats.back()); TEST_P() local 474 refs.RefIf(shared(), tree); TEST_P() local 493 CordRepBtree* tree = CordRepBtree::Create(flats.back()); TEST_P() local 504 refs.RefIf(shared(), tree); TEST_P() local 524 CordRepBtree* tree = CordRepBtree::Create(flats.back()); TEST_P() local 535 refs.RefIf(shared(), tree); TEST_P() local 554 CordRepBtree* tree = CordRepBtree::Create(flats.back()); TEST_P() local 565 refs.RefIf(shared(), tree); TEST_P() local 597 CordRepBtree* tree = use_append ? CordRepBtree::Append(left, right) TEST_P() local 621 CordRepBtree* tree = use_append ? CordRepBtree::Append(left, right) TEST_P() local 646 CordRepBtree* tree = use_append ? CordRepBtree::Append(left, right) TEST_P() local 674 CordRepBtree* tree = use_append ? CordRepBtree::Append(left, right) TEST_P() local 702 CordRepBtree* tree = use_append ? CordRepBtree::Append(left, right) TEST_P() local 713 RefEdgesAt(size_t depth, AutoUnref& refs, CordRepBtree* tree) RefEdgesAt() argument 756 CordRepBtree* tree = CordRepBtree::Append(left, right); TEST() local 841 CordRepBtree* tree = refs.RefIf(shared(), CreateTree(data, 3)); TEST_P() local 856 CordRepBtree* tree = refs.RefIf(shared(), CreateTreeReverse(data, 3)); TEST_P() local 878 CordRepBtree* tree = CordRepBtree::Create(MakeFlat(consumer.Next(3))); TEST_P() local 885 refs.RefIf(shared(), tree); TEST_P() local 892 refs.RefIf(shared(), tree); TEST_P() local 900 refs.RefIf(shared(), tree); TEST_P() local 908 refs.RefIf(shared(), tree); TEST_P() local 991 CordRepBtree* tree = MakeLeaf(); TEST_P() local 999 refs.RefIf(shared(), tree); TEST_P() local 1009 CordRepBtree* tree = CreateTree(data, 3); TEST() local 1043 CordRepBtree* tree = CreateTree(data, 3); TEST() local 1078 CordRepBtree* tree = CordRepBtree::Create(MakeExternal("Foo")); TEST_P() local 1088 CordRepBtree* tree = CordRepBtree::Create(MakeExternal("Foo")); TEST_P() local 1098 CordRepBtree* tree = CordRepBtree::Create(CordRep::Ref(flat)); TEST_P() local 1111 CordRepBtree* tree = CordRepBtree::Create(CordRep::Ref(flat)); TEST_P() local 1124 CordRepBtree* tree = CordRepBtree::Create(flat); TEST_P() local 1134 CordRepBtree* tree = CordRepBtree::Create(flat); TEST_P() local 1167 CordRepBtree* tree = CordRepBtree::Create(flat); TEST() local 1252 CordRepBtree* tree = as_tree ? CordRepBtree::New(leaf) : nullptr; TEST() local 1327 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); TEST() local 1361 CordRepBtree* tree = CordRepBtree::Create(flat); TEST() local [all...] |
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/ |
| H A D | utils_module_tests.c | 847 const char *tree; member
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/ |
| H A D | utils_module_tests.c | 848 const char *tree; member
|
| /third_party/zlib/ |
| H A D | trees.c | 214 gen_codes(ct_data *tree, int max_code, ushf *bl_count) gen_codes() argument 524 pqdownheap(deflate_state *s, ct_data *tree, int k) pqdownheap() argument 558 ct_data *tree = desc->dyn_tree; gen_bitlen() local 646 ct_data *tree = desc->dyn_tree; build_tree() local 730 scan_tree(deflate_state *s, ct_data *tree, int max_code) scan_tree() argument 772 send_tree(deflate_state *s, ct_data *tree, int max_code) send_tree() argument [all...] |
| /kernel/linux/linux-5.10/block/ |
| H A D | bfq-wf2q.c | 23 static struct bfq_entity *bfq_root_active_entity(struct rb_root *tree) in bfq_root_active_entity() argument [all...] |
| /kernel/linux/linux-5.10/net/tipc/ |
| H A D | group.c | 198 struct rb_root *tree = &grp->members; in tipc_group_join() local 213 struct rb_root *tree = &grp->members; in tipc_group_delete() local
|
| /kernel/linux/linux-5.10/scripts/dtc/ |
| H A D | flattree.c | 235 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree() argument 809 struct node *tree; dt_from_blob() local [all...] |