Home
last modified time | relevance | path

Searched refs:tree (Results 1 - 25 of 385) sorted by relevance

12345678910>>...16

/third_party/skia/third_party/externals/sfntly/java/src/com/google/typography/font/tools/conversion/eot/
H A DHuffmanEncoder.java28 private TreeNode[] tree; field in HuffmanEncoder
53 tree = new TreeNode[limit]; in HuffmanEncoder()
55 tree[i] = new TreeNode(); in HuffmanEncoder()
58 tree[i].up = (short)(i / 2); in HuffmanEncoder()
59 tree[i].weight = 1; in HuffmanEncoder()
62 tree[i].left = (short)(2 * i); in HuffmanEncoder()
63 tree[i].right = (short)(2 * i + 1); in HuffmanEncoder()
66 tree[i].code = -1; in HuffmanEncoder()
67 tree[range + i].code = (short)i; in HuffmanEncoder()
68 tree[rang in HuffmanEncoder()
[all...]
/third_party/python/Lib/test/
H A Dtest_type_comments.py248 for tree in self.parse_all(funcdef):
249 self.assertEqual(tree.body[0].type_comment, "() -> int")
250 self.assertEqual(tree.body[1].type_comment, "() -> None")
251 tree = self.classic_parse(funcdef)
252 self.assertEqual(tree.body[0].type_comment, None)
253 self.assertEqual(tree.body[1].type_comment, None)
256 for tree in self.parse_all(asyncdef, minver=5):
257 self.assertEqual(tree.body[0].type_comment, "() -> int")
258 self.assertEqual(tree.body[1].type_comment, "() -> int")
259 tree
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_test.cc164 // Recursively collects all leaf edges from `tree` and appends them to `edges`.
165 void GetLeafEdges(const CordRepBtree* tree, std::vector<CordRep*>& edges) { in GetLeafEdges() argument
166 if (tree->height() == 0) { in GetLeafEdges()
167 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
171 for (CordRep* edge : tree->Edges()) { in GetLeafEdges()
177 // Recursively collects and returns all leaf edges from `tree`.
178 std::vector<CordRep*> GetLeafEdges(const CordRepBtree* tree) { in GetLeafEdges() argument
180 GetLeafEdges(tree, edges); in GetLeafEdges()
200 CordRepBtree* tree = CordRepBtree::Create(MakeHexFlat(0)); in MakeTree() local
202 tree in MakeTree()
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...]
H A Dcord_rep_btree.h37 // CordRepBtree is as the name implies a btree implementation of a Cordrep tree.
41 // end of the tree only, it does not provide any 'insert' logic. This has the
45 // similar fashion, one side of the merged tree will typically have a 100% fill
47 // better, and the tree never needs balancing.
53 // call, simplifying the API. An example of building a tree:
55 // CordRepBtree* tree = CordRepBtree::Create(MakeFlat("Hello"));
56 // tree = CordRepBtree::Append(tree, MakeFlat("world"));
59 // `tree` reference count neutral. The returned `tree` valu
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...]
H A Dcord_rep_btree.cc52 // Prints the entire tree structure or 'rep'. External callers should
54 // Rep may be a CordRepBtree tree, or a SUBSTRING / EXTERNAL / FLAT node.
205 // Builds a `depth` levels deep stack starting at `tree` recording which nodes
207 inline CordRepBtree* BuildStack(CordRepBtree* tree, int depth) { in BuildStack()
208 assert(depth <= tree->height()); in BuildStack()
210 while (current_depth < depth && tree->refcount.IsOne()) { in BuildStack()
211 stack[current_depth++] = tree; in BuildStack()
212 tree = tree->Edge(edge_type)->btree(); in BuildStack()
214 share_depth = current_depth + (tree in BuildStack()
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 Dcord_rep_btree_reader_test.cc116 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST() local
117 tree = CordRepBtree::Append(tree, MakeFlat("def")); in TEST()
119 reader.Init(tree); in TEST()
122 CordRep::Unref(tree); in TEST()
149 CordRepBtree* tree = CordRepBtree::Create(MakeFlat("abc")); in TEST() local
150 tree = CordRepBtree::Append(tree, MakeFlat("def")); in TEST()
152 reader.Init(tree); in TEST()
157 CordRep::Unref(tree); in TEST()
165 CordRep* tree; TEST() local
256 CordRep* tree; TEST() local
[all...]
H A Dcord_rep_btree_navigator.h37 // `tree` on any of the initialization calls. Callers are responsible for
38 // guaranteeing the lifecycle of the provided tree. A navigator instance can
57 // `tree` contains the resulting tree which is identical to the result
58 // of calling CordRepBtree::SubTree(...) on the tree being navigated.
60 // edge of the tree.
62 CordRep* tree; member
69 // Returns the tree for this instance or nullptr if empty.
76 // Resets this navigator to `tree`, returning the first data edge in the tree
164 InitFirst(CordRepBtree* tree) InitFirst() argument
168 InitLast(CordRepBtree* tree) InitLast() argument
173 Init(CordRepBtree* tree) Init() argument
206 InitOffset( CordRepBtree* tree, size_t offset) InitOffset() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/tests/regres/cov/
H A Dcoverage_test.go49 tree := &cov.Tree{}
52 tree.Add(cov.Path{"a", "b"}, coverage(fileA, span0, span1))
59 checkSpans(t, tree.Spans(), span0, span1)
60 checkTests(t, tree, `{a:{b}}`)
61 checkCoverage(t, tree, fileA, `a:{[0,1]}`)
64 tree.Add(cov.Path{"a", "b", "d", "i"}, coverage(fileA, span0, span1))
74 checkSpans(t, tree.Spans(), span0, span1)
75 checkTests(t, tree, `{a:{b:{d:{i}}}}`)
76 checkCoverage(t, tree, fileA, `a:{[0,1]}`)
79 tree
[all...]
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dpcy_tree.c18 * If the maximum number of nodes in the policy tree isn't defined, set it to
21 * Defining this to be zero means unlimited policy tree growth which opens the
54 char *str, X509_POLICY_TREE *tree, in tree_print()
60 curr = tree->levels + tree->nlevel; in tree_print()
66 (long)(curr - tree->levels)); in tree_print()
67 for (plev = tree->levels; plev != curr; plev++) { in tree_print()
71 (long)(plev - tree->levels), plev->flags); in tree_print()
85 #define TREE_PRINT(str, tree, curr) \
87 tree_print(trc_out, "before tree_prune()", tree, cur
53 tree_print(BIO *channel, char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) tree_print() argument
100 X509_POLICY_TREE *tree; tree_init() local
257 tree_link_matching_nodes(X509_POLICY_LEVEL *curr, X509_POLICY_DATA *data, X509_POLICY_TREE *tree) tree_link_matching_nodes() argument
287 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) tree_link_nodes() argument
309 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) tree_add_unmatched() argument
338 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) tree_link_unmatched() argument
374 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) tree_link_any() argument
406 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) tree_prune() argument
481 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) tree_calculate_authority_set() argument
530 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) tree_calculate_user_set() argument
601 tree_evaluate(X509_POLICY_TREE *tree) tree_evaluate() argument
629 X509_policy_tree_free(X509_POLICY_TREE *tree) X509_policy_tree_free() argument
667 X509_POLICY_TREE *tree = NULL; X509_policy_check() local
[all...]
H A Dpcy_lib.c20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count() argument
22 if (!tree) in X509_policy_tree_level_count()
24 return tree->nlevel; 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() argument
30 if (!tree || (i < 0) || (i >= tree->nlevel)) in X509_policy_tree_get0_level()
32 return tree->levels + i; in X509_policy_tree_get0_level()
37 *tree) in STACK_OF()
39 if (!tree) in STACK_OF()
41 return tree in STACK_OF()
[all...]
/third_party/openssl/crypto/x509/
H A Dpcy_tree.c18 * If the maximum number of nodes in the policy tree isn't defined, set it to
21 * Defining this to be zero means unlimited policy tree growth which opens the
54 char *str, X509_POLICY_TREE *tree, in tree_print()
60 curr = tree->levels + tree->nlevel; in tree_print()
66 (long)(curr - tree->levels)); in tree_print()
67 for (plev = tree->levels; plev != curr; plev++) { in tree_print()
71 (long)(plev - tree->levels), plev->flags); in tree_print()
85 #define TREE_PRINT(str, tree, curr) \
87 tree_print(trc_out, "before tree_prune()", tree, cur
53 tree_print(BIO *channel, char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) tree_print() argument
100 X509_POLICY_TREE *tree; tree_init() local
257 tree_link_matching_nodes(X509_POLICY_LEVEL *curr, X509_POLICY_DATA *data, X509_POLICY_TREE *tree) tree_link_matching_nodes() argument
287 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) tree_link_nodes() argument
309 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) tree_add_unmatched() argument
338 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) tree_link_unmatched() argument
374 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) tree_link_any() argument
406 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) tree_prune() argument
481 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) tree_calculate_authority_set() argument
530 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) tree_calculate_user_set() argument
601 tree_evaluate(X509_POLICY_TREE *tree) tree_evaluate() argument
629 X509_policy_tree_free(X509_POLICY_TREE *tree) X509_policy_tree_free() argument
667 X509_POLICY_TREE *tree = NULL; X509_policy_check() local
[all...]
H A Dpcy_lib.c20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count() argument
22 if (!tree) in X509_policy_tree_level_count()
24 return tree->nlevel; 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() argument
30 if (!tree || (i < 0) || (i >= tree->nlevel)) in X509_policy_tree_get0_level()
32 return tree->levels + i; in X509_policy_tree_get0_level()
37 *tree) in STACK_OF()
39 if (!tree) in STACK_OF()
41 return tree in STACK_OF()
[all...]
/third_party/cJSON/tests/
H A Dparse_examples.c50 cJSON *tree = NULL; in do_test() local
76 tree = parse_file(test_path); in do_test()
77 TEST_ASSERT_NOT_NULL_MESSAGE(tree, "Failed to read of parse test."); in do_test()
79 /* print the parsed tree */ in do_test()
80 actual = cJSON_Print(tree); in do_test()
81 TEST_ASSERT_NOT_NULL_MESSAGE(actual, "Failed to print tree back to JSON."); in do_test()
91 if (tree != NULL) in do_test()
93 cJSON_Delete(tree); in do_test()
137 cJSON *tree = NULL; in file_test6_should_not_be_parsed() local
142 tree in file_test6_should_not_be_parsed()
185 cJSON *tree = NULL; test12_should_not_be_parsed() local
200 cJSON *tree = NULL; test13_should_be_parsed_without_null_termination() local
229 cJSON *tree = NULL; test14_should_not_be_parsed() local
[all...]
/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dhuffman_encode_utils.c5 // tree. An additional intellectual property rights grant can be found
7 // be found in the AUTHORS file in the root of the source tree.
30 // Huffman tree compression, especially its RLE-part, give smaller output.
135 static void SetBitDepths(const HuffmanTree* const tree, in SetBitDepths() argument
138 if (tree->pool_index_left_ >= 0) { in SetBitDepths()
139 SetBitDepths(&pool[tree->pool_index_left_], pool, bit_depths, level + 1); in SetBitDepths()
140 SetBitDepths(&pool[tree->pool_index_right_], pool, bit_depths, level + 1); in SetBitDepths()
142 bit_depths[tree->value_] = level; in SetBitDepths()
146 // Create an optimal Huffman tree.
154 // The catch here is that the tree canno
165 GenerateOptimalTree(const uint32_t* const histogram, int histogram_size, HuffmanTree* tree, int tree_depth_limit, uint8_t* const bit_depths) GenerateOptimalTree() argument
326 VP8LCreateCompressedHuffmanTree(const HuffmanTreeCode* const tree, HuffmanTreeToken* tokens, int max_tokens) VP8LCreateCompressedHuffmanTree() argument
374 ConvertBitDepthsToSymbols(HuffmanTreeCode* const tree) ConvertBitDepthsToSymbols() argument
[all...]
/third_party/protobuf/java/util/src/test/java/com/google/protobuf/util/
H A DFieldMaskTreeTest.java47 FieldMaskTree tree = new FieldMaskTree(); in testAddFieldPath()
48 assertThat(tree.toString()).isEmpty(); in testAddFieldPath()
49 tree.addFieldPath(""); in testAddFieldPath()
50 assertThat(tree.toString()).isEmpty(); in testAddFieldPath()
52 tree.addFieldPath("foo"); in testAddFieldPath()
53 assertEquals("foo", tree.toString()); in testAddFieldPath()
55 tree.addFieldPath("foo"); in testAddFieldPath()
56 assertEquals("foo", tree.toString()); in testAddFieldPath()
58 tree.addFieldPath("bar.baz"); in testAddFieldPath()
59 assertEquals("bar.baz,foo", tree in testAddFieldPath()
138 merge( FieldMaskTree tree, Message source, Message.Builder builder, FieldMaskUtil.MergeOptions options, boolean useDynamicMessage) merge() argument
[all...]
/third_party/node/tools/icu/
H A Dicutrim.py210 def queueForRemoval(tree):
212 if tree not in config.get("trees", {}):
214 mytree = trees[tree]
216 print("* %s: %d items" % (tree, len(mytree["locs"])))
217 # do varible substitution for this tree here
218 if isinstance(config["trees"][tree], basestring):
219 treeStr = config["trees"][tree]
221 print(" Substituting $%s for tree %s" % (treeStr, tree))
223 print(" ERROR: no variable: variables.%s for tree
277 tree = None global() variable
279 tree = "ROOT" global() variable
281 tree = treeprefix[0:-1] global() variable
[all...]
/third_party/node/deps/npm/node_modules/libnpmfund/lib/
H A Dindex.js44 function readTree (tree, opts) {
54 filterSet = arb.workspaceDependencySet(tree, opts.workspaces)
116 // avoids duplicated items within the funding tree
174 const treeDependencies = getFundingDependencies(tree)
181 (tree && tree.package && tree.package.name) ||
182 (tree && tree.name)
183 result.name = name || (tree
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dexpression.c148 static struct token *parse_type(struct token *token, struct expression **tree) in parse_type() argument
151 *tree = alloc_expression(token->pos, EXPR_TYPE); in parse_type()
157 (*tree)->symbol = sym; in parse_type()
162 struct expression **tree) in builtin_types_compatible_p_expr()
183 *tree = expr; in builtin_types_compatible_p_expr()
188 struct expression **tree) in builtin_offsetof_expr()
214 *tree = expr; in builtin_offsetof_expr()
388 static struct token *generic_selection(struct token *token, struct expression **tree) in generic_selection() argument
418 *tree = expr; in generic_selection()
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/ltp/
H A Dbuild.sh15 # TODO: open posix testsuite is currently broken in out-tree-build. Enable it once it's fixed.
57 local tree="$1"
62 echo "===== 32-bit ${tree}-tree build into $prefix ====="
84 eval configure_${tree}_tree
89 local tree="$1"
92 echo "===== native ${tree}-tree build into $prefix ====="
93 eval configure_${tree}_tree
98 local tree
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/bloat/
H A Dwebtreemap.js26 function focus(tree) {
27 focused = tree;
31 var root = tree;
43 for (var t = tree; t.parent; t = t.parent) {
50 layout(tree, level, width, height);
53 function makeDom(tree, level) {
57 if (tree.data['$symbol']) {
59 tree.data['$symbol'].replace(' ', '_'));
61 if (tree.data['$dominant_symbol']) {
63 tree
[all...]
/third_party/nghttp2/src/
H A Dshrpx_tls_test.cc39 auto tree = std::make_unique<tls::CertLookupTree>(); in test_shrpx_tls_create_lookup_tree() local
56 tree->add_cert(hostnames[idx], idx); in test_shrpx_tls_create_lookup_tree()
59 tree->dump(); in test_shrpx_tls_create_lookup_tree()
61 CU_ASSERT(0 == tree->lookup(hostnames[0])); in test_shrpx_tls_create_lookup_tree()
62 CU_ASSERT(1 == tree->lookup(hostnames[1])); in test_shrpx_tls_create_lookup_tree()
63 CU_ASSERT(2 == tree->lookup(StringRef::from_lit("2www.example.org"))); in test_shrpx_tls_create_lookup_tree()
64 CU_ASSERT(-1 == tree->lookup(StringRef::from_lit("www2.example.org"))); in test_shrpx_tls_create_lookup_tree()
65 CU_ASSERT(3 == tree->lookup(StringRef::from_lit("xy1.host.domain"))); in test_shrpx_tls_create_lookup_tree()
68 CU_ASSERT(-1 == tree->lookup(StringRef::from_lit("yy.host.domain"))); in test_shrpx_tls_create_lookup_tree()
69 CU_ASSERT(4 == tree in test_shrpx_tls_create_lookup_tree()
144 tls::CertLookupTree tree; test_shrpx_tls_cert_lookup_tree_add_ssl_ctx() local
[all...]
/third_party/mesa3d/src/util/tests/
H A Drb_tree_test.cpp73 validate_tree_order(struct rb_tree *tree, unsigned expected_count) in validate_tree_order() argument
78 rb_tree_foreach(struct rb_test_node, n, tree, node) { in validate_tree_order()
99 rb_tree_foreach_safe(struct rb_test_node, n, tree, node) { in validate_tree_order()
120 rb_tree_foreach_rev(struct rb_test_node, n, tree, node) { in validate_tree_order()
141 rb_tree_foreach_rev_safe(struct rb_test_node, n, tree, node) { in validate_tree_order()
161 validate_search(struct rb_tree *tree, int first_number, in validate_search() argument
169 n = rb_tree_search(tree, &test_numbers[i], rb_test_node_cmp_void); in validate_search()
173 n = rb_tree_search_sloppy(tree, &test_numbers[i], in validate_search()
180 n = rb_tree_search(tree, &missing_key, rb_test_node_cmp_void); in validate_search()
183 n = rb_tree_search_sloppy(tree, in validate_search()
211 struct rb_tree tree; TEST() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dpersistent-map.h19 // tree using the bits of a hash value as addresses). The map is a conceptually
46 // their unsigned value. This way, the order in the hash tree is compatible
60 // the hash tree.
71 const FocusedTree* tree = FindHash(key_hash); in Get() local
72 return GetFocusedValue(tree, key); in Get()
133 // Load value from the leaf node on the focused path of {tree}.
134 const Value& GetFocusedValue(const FocusedTree* tree, const Key& key) const;
137 // (bit==kRight) child of the node on the path of {tree} at tree level
139 static const FocusedTree* GetChild(const FocusedTree* tree, in
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/protobuf/csharp/src/Google.Protobuf.Test/
H A DFieldMaskTreeTest.cs46 FieldMaskTree tree = new FieldMaskTree(); in AddFieldPath()
47 RepeatedField<string> paths = tree.ToFieldMask().Paths; in AddFieldPath()
50 tree.AddFieldPath(""); in AddFieldPath()
51 paths = tree.ToFieldMask().Paths; in AddFieldPath()
56 tree.AddFieldPath("foo"); in AddFieldPath()
57 paths = tree.ToFieldMask().Paths; in AddFieldPath()
62 tree.AddFieldPath("foo"); in AddFieldPath()
63 paths = tree.ToFieldMask().Paths; in AddFieldPath()
67 tree.AddFieldPath("bar.baz"); in AddFieldPath()
68 paths = tree in AddFieldPath()
162 Merge(FieldMaskTree tree, IMessage source, IMessage destination, FieldMask.MergeOptions options, bool useDynamicMessage) Merge() argument
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dentropy_encode.c56 /* This function will create a Huffman tree.
58 The catch here is that the tree cannot be arbitrarily deep.
63 and this minimum value is raised until the tree matches the
74 HuffmanTree* tree, in BrotliCreateHuffmanTree()
92 InitHuffmanTree(&tree[n++], count, -1, (int16_t)i); in BrotliCreateHuffmanTree()
97 depth[tree[0].index_right_or_value_] = 1; /* Only one element. */ in BrotliCreateHuffmanTree()
101 SortHuffmanTreeItems(tree, n, SortHuffmanTree); in BrotliCreateHuffmanTree()
110 tree[n] = sentinel; in BrotliCreateHuffmanTree()
111 tree[n + 1] = sentinel; in BrotliCreateHuffmanTree()
117 if (tree[ in BrotliCreateHuffmanTree()
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...]

Completed in 13 milliseconds

12345678910>>...16