| /third_party/openssl/crypto/x509/ |
| D | pcy_tree.c | 54 char *str, X509_POLICY_TREE *tree, in tree_print()
85 #define TREE_PRINT(str, tree, curr) \ argument
100 X509_POLICY_TREE *tree; in tree_init() local
259 X509_POLICY_TREE *tree) in tree_link_matching_nodes()
289 X509_POLICY_TREE *tree) in tree_link_nodes()
312 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_add_unmatched()
340 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_link_unmatched()
376 X509_POLICY_TREE *tree) in tree_link_any()
406 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune()
481 static int tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set()
[all …]
|
| D | pcy_lib.c | 20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count()
27 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, in X509_policy_tree_get0_level()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree.h | 134 CordRepBtree* tree; member
388 static void Delete(CordRepBtree* tree) { delete tree; } in Delete()
584 CordRepBtree* tree = new CordRepBtree; in New() local
591 CordRepBtree* tree = new CordRepBtree; in New() local
602 CordRepBtree* tree = new CordRepBtree; in New() local
610 inline void CordRepBtree::DestroyTree(CordRepBtree* tree, size_t begin, in DestroyTree()
619 inline void CordRepBtree::Destroy(CordRepBtree* tree) { in Destroy()
624 auto* tree = static_cast<CordRepBtree*>(::operator new(sizeof(CordRepBtree))); in CopyRaw() local
631 CordRepBtree* tree = CopyRaw(); in Copy() local
640 CordRepBtree* tree = CopyRaw(); in CopyToEndFrom() local
[all …]
|
| D | cord_rep_btree_test.cc | 165 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges()
178 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges()
200 CordRepBtree* tree = CordRepBtree::Create(MakeHexFlat(0)); in MakeTree() local
211 CordRepBtree* tree = CordRepBtree::Create(*it); in CreateTree() local
219 CordRepBtree* tree = CordRepBtree::Create(*rit); in CreateTreeReverse() local
276 auto* tree = CordRepBtree::New(); in TEST() local
284 auto* tree = CordRepBtree::New(3); in TEST() local
360 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST() local
463 CordRepBtree* tree = CordRepBtree::Create(flats.back()); in TEST_P() local
493 CordRepBtree* tree = CordRepBtree::Create(flats.back()); in TEST_P() local
[all …]
|
| D | cord_rep_btree_navigator.h | 62 CordRep* tree; member
164 inline CordRep* CordRepBtreeNavigator::InitFirst(CordRepBtree* tree) { in InitFirst()
168 inline CordRep* CordRepBtreeNavigator::InitLast(CordRepBtree* tree) { in InitLast()
173 inline CordRep* CordRepBtreeNavigator::Init(CordRepBtree* tree) { in Init()
207 CordRepBtree* tree, size_t offset) { in InitOffset()
|
| D | cord_rep_consume_test.cc | 89 CordRep* tree = CreateTestTree(); in TEST() local
106 CordRep* tree = CreateTestTree(); in TEST() local
124 CordRep* tree = CreateTestTree(); in TEST() local
141 CordRep* tree = CreateTestTree(); in TEST() local
162 CordRepSubstring* tree = CreateSubstring(concat, 15, 10); in TEST() local
|
| D | cord_rep_btree.cc | 351 void CordRepBtree::DestroyLeaf(CordRepBtree* tree, size_t begin, size_t end) { in DestroyLeaf()
358 void CordRepBtree::DestroyNonLeaf(CordRepBtree* tree, size_t begin, in DestroyNonLeaf()
366 bool CordRepBtree::IsValid(const CordRepBtree* tree, bool shallow) { in IsValid()
411 CordRepBtree* CordRepBtree::AssertValid(CordRepBtree* tree, bool shallow) { in AssertValid()
419 const CordRepBtree* CordRepBtree::AssertValid(const CordRepBtree* tree, in AssertValid()
463 CordRepBtree* CordRepBtree::AddCordRep(CordRepBtree* tree, CordRep* rep) { in AddCordRep()
545 CordRepBtree* CordRepBtree::AddData(CordRepBtree* tree, absl::string_view data, in AddData()
907 CordRepBtree* CordRepBtree::AppendSlow(CordRepBtree* tree, CordRep* rep) { in AppendSlow()
919 CordRepBtree* CordRepBtree::PrependSlow(CordRepBtree* tree, CordRep* rep) { in PrependSlow()
931 CordRepBtree* CordRepBtree::Append(CordRepBtree* tree, absl::string_view data, in Append()
[all …]
|
| /third_party/protobuf/java/util/src/test/java/com/google/protobuf/util/ |
| D | FieldMaskTreeTest.java | 47 FieldMaskTree tree = new FieldMaskTree(); in testAddFieldPath() local
72 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testMergeFromFieldMask() local
80 FieldMaskTree tree; in testRemoveFieldPath() local
114 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testRemoveFromFieldMask() local
121 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testIntersectFieldPath() local
151 FieldMaskTree tree, in merge()
|
| /third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/testing/ |
| D | RangeTreeSubject.java | 35 public static RangeTreeSubject assertThat(@Nullable RangeTree tree) { in assertThat()
39 public static RangeTreeSubject assertThat(@Nullable PrefixTree tree) { in assertThat()
43 public static RangeTreeSubject assertWithMessageThat( in assertWithMessageThat()
92 RangeTree tree = RangeTree.from(spec); in containsExactly() local
99 RangeTree tree = RangeTree.from(specs); in containsExactly() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/dominator_tree/ |
| D | generated.cpp | 128 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
193 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
295 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
337 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
416 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
492 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
613 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
743 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
778 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
848 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/test/opt/dominator_tree/ |
| D | generated.cpp | 128 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
193 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
295 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
337 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
416 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
492 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
613 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
743 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
778 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
848 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
[all …]
|
| /third_party/spirv-tools/test/opt/dominator_tree/ |
| D | generated.cpp | 127 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
192 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
294 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
336 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
415 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
491 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
612 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
742 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
777 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
847 DominatorTree& tree = dom_tree.GetDomTree(); in TEST_F() local
[all …]
|
| /third_party/skia/infra/bots/gen_tasks_logic/ |
| D | compile_cas.go | 185 type tree struct { struct
186 root *node
198 func (t *tree) add(p string) {
205 func (t *tree) entries() []string {
|
| /third_party/cJSON/tests/ |
| D | parse_examples.c | 50 cJSON *tree = NULL; in do_test() local
137 cJSON *tree = NULL; in file_test6_should_not_be_parsed() local
185 cJSON *tree = NULL; in test12_should_not_be_parsed() local
200 cJSON *tree = NULL; in test13_should_be_parsed_without_null_termination() local
229 cJSON *tree = NULL; in test14_should_not_be_parsed() local
|
| /third_party/skia/tests/graphite/ |
| D | IntersectionTreeTest.cpp | 36 IntersectionTree tree; in DEF_GRAPHITE_TEST() local
50 IntersectionTree tree; in DEF_GRAPHITE_TEST() local
64 IntersectionTree tree; in DEF_GRAPHITE_TEST() local
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/plugin/device/gpu/kernel/cuda_impl/rl/ |
| D | priority_replay_buffer.cu | 61 __global__ void SumTreeInitKernel(T *tree, float *max_priority, size_t size) { in SumTreeInitKernel()
72 __forceinline__ __device__ void SumTreeInsert(T *tree, size_t idx, float priority) { in SumTreeInsert()
84 __global__ void SumTreePushKernel(T *tree, float alpha, size_t idx, float *priority, float *max_pri… in SumTreePushKernel()
97 __forceinline__ __device__ size_t GetPrefixSumIdx(T *tree, size_t capacity, float prefix_sum) { in GetPrefixSumIdx()
112 __global__ void SumTreeSampleKernel(T *tree, curandState *state, size_t capacity, float *beta, size… in SumTreeSampleKernel()
134 __global__ void SumTreeUpdateKernel(T *tree, size_t capacity, size_t last_idx, float alpha, float *… in SumTreeUpdateKernel()
151 cudaError_t SumTreeInit(T *tree, float *max_priority, const size_t &capacity, cudaStream_t stream) { in SumTreeInit()
161 cudaError_t SumTreePush(T *tree, const float &alpha, const size_t &idx, const size_t &capacity, flo… in SumTreePush()
170 cudaError_t SumTreeSample(T *tree, curandState *state, const size_t &capacity, float *beta, const s… in SumTreeSample()
188 cudaError_t SumTreeUpdate(T *tree, const size_t &capacity, const size_t &last_idx, const float &alp… in SumTreeUpdate()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/subzero/bloat/ |
| D | webtreemap.js | 26 function focus(tree) { argument
53 function makeDom(tree, level) { argument
137 function layout(tree, level, width, height) { argument
|
| /third_party/toybox/toys/other/ |
| D | acpi.c | 44 static int acpi_callback(struct dirtree *tree) in acpi_callback()
85 static int temp_callback(struct dirtree *tree) in temp_callback()
108 static int cool_callback(struct dirtree *tree) in cool_callback()
|
| /third_party/selinux/libsepol/cil/test/unit/ |
| D | test_cil_fqn.c | 49 struct cil_tree *tree; in test_cil_qualify_name() local
65 struct cil_tree *tree; in test_cil_qualify_name_cil_flavor() local
|
| /third_party/libwebsockets/win32port/zlib/ |
| D | trees.c | 168 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
172 # define send_code(s, c, tree) \ argument
438 #define pqremove(s, tree, top) \ argument
449 #define smaller(tree, n, m, depth) \ argument
459 local void pqdownheap(s, tree, k) in pqdownheap() argument
498 ct_data *tree = desc->dyn_tree; local
581 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
627 ct_data *tree = desc->dyn_tree; local
711 local void scan_tree (s, tree, max_code) in scan_tree() argument
756 local void send_tree (s, tree, max_code) in send_tree() argument
|
| /third_party/skia/third_party/externals/zlib/ |
| D | trees.c | 161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
165 # define send_code(s, c, tree) \ argument
430 #define pqremove(s, tree, top) \ argument
441 #define smaller(tree, n, m, depth) \ argument
451 local void pqdownheap(s, tree, k) in pqdownheap() argument
490 ct_data *tree = desc->dyn_tree; local
572 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
619 ct_data *tree = desc->dyn_tree; local
703 local void scan_tree (s, tree, max_code) in scan_tree() argument
748 local void send_tree (s, tree, max_code) in send_tree() argument
|
| /third_party/mindspore/mindspore-src/source/mindspore/python/mindspore/rewrite/sparsify/ |
| D | sparsify.py | 28 def get_user_defined_rules(sparse_rules, global_vars, tree): argument
57 def sparsify_tree(tree, arg_types, sparse_rules, f): argument
|
| /third_party/zlib/ |
| D | trees.c | 214 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) in gen_codes()
251 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
255 # define send_code(s, c, tree) \ argument
503 #define pqremove(s, tree, top) \ argument
514 #define smaller(tree, n, m, depth) \ argument
524 local void pqdownheap(deflate_state *s, ct_data *tree, int k) in pqdownheap()
558 ct_data *tree = desc->dyn_tree; in gen_bitlen() local
646 ct_data *tree = desc->dyn_tree; in build_tree() local
730 local void scan_tree(deflate_state *s, ct_data *tree, int max_code) in scan_tree()
772 local void send_tree(deflate_state *s, ct_data *tree, int max_code) in send_tree()
|
| /third_party/FreeBSD/sys/dev/usb/implementation/ |
| D | usb_btree.c | 213 usbd_per_order_probe(usbd_bt_tree tree, char *devname, uint8_t *port_num) in usbd_per_order_probe()
226 usbd_insert_bt_node(usbd_bt_node *node, usbd_bt_tree tree, struct node_info *parent_info) in usbd_insert_bt_node()
254 usbd_remove_bt_node(usbd_bt_tree tree, struct node_info *p_info, struct node_info *rm_info) in usbd_remove_bt_node()
|
| /third_party/mesa3d/src/util/tests/ |
| D | rb_tree_test.cpp | 73 validate_tree_order(struct rb_tree *tree, unsigned expected_count) in validate_tree_order()
161 validate_search(struct rb_tree *tree, int first_number, in validate_search()
211 struct rb_tree tree; in TEST() local
|