Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 2249) sorted by relevance

12345678910>>...90

/external/python/cpython2/Modules/
Dparsermodule.c633 static int validate_expr_tree(node *tree);
634 static int validate_file_input(node *tree);
635 static int validate_encoding_decl(node *tree);
656 node *tree; in parser_tuple2st() local
671 tree = build_node_tree(tuple); in parser_tuple2st()
672 if (tree != 0) { in parser_tuple2st()
673 int start_sym = TYPE(tree); in parser_tuple2st()
676 if (validate_expr_tree(tree)) in parser_tuple2st()
677 st = parser_newstobject(tree, PyST_EXPR); in parser_tuple2st()
679 PyNode_Free(tree); in parser_tuple2st()
[all …]
/external/antlr/antlr-3.4/runtime/C/src/
Dantlr3basetree.c36 static void * getChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i);
37 static ANTLR3_UINT32 getChildCount (pANTLR3_BASE_TREE tree);
39 (pANTLR3_BASE_TREE tree);
40 static ANTLR3_UINT32 getLine (pANTLR3_BASE_TREE tree);
43 (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 type);
44 static void addChild (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child);
45 static void addChildren (pANTLR3_BASE_TREE tree, pANTLR3_LIST kids);
48 static void freshenPACIndexesAll(pANTLR3_BASE_TREE tree);
49 static void freshenPACIndexes (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 offset);
51 static void setChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child);
[all …]
Dantlr3commontree.c41 static pANTLR3_COMMON_TOKEN getToken (pANTLR3_BASE_TREE tree);
42 static pANTLR3_BASE_TREE dupNode (pANTLR3_BASE_TREE tree);
43 static ANTLR3_BOOLEAN isNilNode (pANTLR3_BASE_TREE tree);
44 static ANTLR3_UINT32 getType (pANTLR3_BASE_TREE tree);
45 static pANTLR3_STRING getText (pANTLR3_BASE_TREE tree);
46 static ANTLR3_UINT32 getLine (pANTLR3_BASE_TREE tree);
47 static ANTLR3_UINT32 getCharPositionInLine (pANTLR3_BASE_TREE tree);
48 static pANTLR3_STRING toString (pANTLR3_BASE_TREE tree);
49 static pANTLR3_BASE_TREE getParent (pANTLR3_BASE_TREE tree);
50 static void setParent (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE parent);
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/
Dtree-rewrite.rb1010 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1014 stree = result.tree.nil? ? '' : result.tree.inspect
1024 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1028 stree = result.tree.nil? ? '' : result.tree.inspect
1038 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1041 result = walker.a.tree
1048 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1051 result = walker.a.tree
1061 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1065 stree = result.tree.nil? ? '' : result.tree.inspect
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-tree-wizard.rb95 tree = Wizard::PatternParser.parse( 'ID', Tokens, @adaptor )
97 assert_instance_of(CommonTree, tree)
98 assert_equal( ID, tree.type )
99 assert_equal( 'ID', tree.text )
103 tree = Wizard::PatternParser.parse( 'ID[foo]', Tokens, @adaptor )
105 assert_instance_of( CommonTree, tree )
106 assert_equal( ID, tree.type )
107 assert_equal( 'foo', tree.text )
111 tree = Wizard::PatternParser.parse( '(A B)', Tokens, @adaptor )
113 assert_instance_of( CommonTree, tree )
[all …]
/external/syslinux/com32/sysdump/
Drbtree.c49 struct rbtree *rb_search(struct rbtree *tree, uint64_t key) in rb_search() argument
53 while (tree) { in rb_search()
54 if (tree->key == key) in rb_search()
55 return tree; in rb_search()
56 else if (tree->key > key) in rb_search()
57 tree = tree->left; in rb_search()
59 best = tree; in rb_search()
60 tree = tree->right; in rb_search()
98 struct rbtree *rb_insert(struct rbtree *tree, struct rbtree *node) in rb_insert() argument
103 if (!tree) { in rb_insert()
[all …]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTreeAdaptor.cs82 public virtual bool IsNil( object tree ) in IsNil() argument
84 return ( (ITree)tree ).IsNil; in IsNil()
109 public virtual object DupTree( object tree ) in DupTree() argument
111 return DupTree( tree, null ); in DupTree()
282 ITree tree = GetTree(t); in GetType()
283 if (tree == null) in GetType()
286 return tree.Type; in GetType()
296 ITree tree = GetTree(t); in GetText()
297 if (tree == null) in GetText()
300 return tree.Text; in GetText()
[all …]
DTreeIterator.cs46 protected object tree; field in Antlr.Runtime.Tree.TreeIterator
60 public TreeIterator( CommonTree tree ) in TreeIterator() argument
61 : this( new CommonTreeAdaptor(), tree ) in TreeIterator()
65 public TreeIterator( ITreeAdaptor adaptor, object tree ) in TreeIterator() argument
68 this.tree = tree; in TreeIterator()
69 this.root = tree; in TreeIterator()
102 if ( adaptor.GetChildCount( tree ) == 0 ) in MoveNext()
107 Current = tree; in MoveNext()
119 if ( tree == null ) in MoveNext()
126 if ( adaptor.GetChildCount( tree ) > 0 ) in MoveNext()
[all …]
/external/antlr/antlr-3.4/runtime/Python/tests/
Dt042ast.py42 r.tree.toStringTree(),
50 r.tree.toStringTree(),
58 r.tree.toStringTree(),
66 r.tree.toStringTree(),
74 r.tree.toStringTree(),
82 r.tree.toStringTree(),
90 r.tree.toStringTree(),
98 r.tree.toStringTree(),
106 r.tree.toStringTree(),
114 r.tree.toStringTree(),
[all …]
/external/python/cpython2/Demo/tkinter/ttk/
Ddirbrowser.py10 def populate_tree(tree, node): argument
11 if tree.set(node, "type") != 'directory':
14 path = tree.set(node, "fullpath")
15 tree.delete(*tree.get_children(node))
17 parent = tree.parent(node)
27 id = tree.insert(node, "end", text=fname, values=[p, ptype])
31 tree.insert(id, 0, text="dummy")
32 tree.item(id, text=fname)
35 tree.set(id, "size", "%d bytes" % size)
38 def populate_roots(tree): argument
[all …]
/external/ltp/utils/ffsb-6.0-rc2/
Drbt.c219 void rbtree_init(rb_tree * tree) in rbtree_init() argument
222 tree->isize = 0; in rbtree_init()
223 tree->root = NULL; in rbtree_init()
230 rb_tree *tree = (rb_tree *) malloc(sizeof(rb_tree)); in rbtree_construct() local
231 if (!tree) { in rbtree_construct()
235 rbtree_init(tree); in rbtree_construct()
236 return tree; in rbtree_construct()
241 void rbtree_clean(rb_tree * tree, destructor d) in rbtree_clean() argument
243 if (tree->root) in rbtree_clean()
244 rbnode_destruct(tree->root, d); in rbtree_clean()
[all …]
Drbt.h156 void rbtree_init(rb_tree *tree);
169 extern void rbtree_clean(rb_tree *tree, destructor d);
175 extern void rbtree_destruct(rb_tree *tree, destructor d);
182 extern int rbtree_size(rb_tree *tree);
189 extern int rbtree_depth(rb_tree *tree);
197 extern int rbtree_contains(rb_tree *tree, datatype object);
205 extern rb_node *rbtree_insert(rb_tree *tree, datatype object);
212 extern rb_node *insert_successor_at(rb_tree *tree, rb_node *at_node,
220 extern rb_node *insert_predecessor_at(rb_tree *tree, rb_node *at_node,
229 extern void rbtree_remove(rb_tree *tree, datatype object, destructor d);
[all …]
/external/boringssl/src/crypto/x509v3/
Dpcy_tree.c103 static void tree_print(char *str, X509_POLICY_TREE *tree, in tree_print() argument
112 curr = tree->levels + tree->nlevel; in tree_print()
116 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); in tree_print()
117 for (plev = tree->levels; plev != curr; plev++) { in tree_print()
119 plev - tree->levels, plev->flags); in tree_print()
152 X509_POLICY_TREE *tree; in tree_init() local
228 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE)); in tree_init()
230 if (!tree) in tree_init()
233 tree->flags = 0; in tree_init()
234 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); in tree_init()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Dwizard.rb341 def index( tree, map = {} ) argument
342 tree or return( map )
343 type = @adaptor.type_of( tree )
345 elements << tree
346 @adaptor.each_child( tree ) { | child | index( child, map ) }
350 def find( tree, what ) argument
352 when Integer then find_token_type( tree, what )
353 when String then find_pattern( tree, what )
354 when Symbol then find_token_type( tree, @token_scheme[ what ] )
359 def find_token_type( tree, type ) argument
[all …]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DTreeIterator.java28 package org.antlr.runtime.tree;
44 protected Object tree; field in TreeIterator
57 public TreeIterator(Object tree) { in TreeIterator() argument
58 this(new CommonTreeAdaptor(),tree); in TreeIterator()
61 public TreeIterator(TreeAdaptor adaptor, Object tree) { in TreeIterator() argument
63 this.tree = tree; in TreeIterator()
64 this.root = tree; in TreeIterator()
73 tree = root; in reset()
80 if ( tree==null ) return false; in hasNext()
81 if ( adaptor.getChildCount(tree)>0 ) return true; in hasNext()
[all …]
/external/antlr/antlr-3.4/runtime/C/include/
Dantlr3basetree.h81 pANTLR3_COMMON_TOKEN (*getToken) (struct ANTLR3_BASE_TREE_struct * tree);
83 void (*addChild) (struct ANTLR3_BASE_TREE_struct * tree, void * child);
85 void (*addChildren) (struct ANTLR3_BASE_TREE_struct * tree, pANTLR3_LIST kids);
87 void (*createChildrenList) (struct ANTLR3_BASE_TREE_struct * tree);
89 void * (*deleteChild) (struct ANTLR3_BASE_TREE_struct * tree, ANTLR3_UINT32 i);
95 void * (*dupTree) (struct ANTLR3_BASE_TREE_struct * tree);
97 ANTLR3_UINT32 (*getCharPositionInLine) (struct ANTLR3_BASE_TREE_struct * tree);
99 void * (*getChild) (struct ANTLR3_BASE_TREE_struct * tree, ANTLR3_UINT32 i);
101 void (*setChildIndex) (struct ANTLR3_BASE_TREE_struct * tree, ANTLR3_INT32 );
103 ANTLR3_INT32 (*getChildIndex) (struct ANTLR3_BASE_TREE_struct * tree );
[all …]
/external/jemalloc/test/unit/
Drb.c47 tree_t tree; in TEST_BEGIN() local
50 tree_new(&tree); in TEST_BEGIN()
52 assert_true(tree_empty(&tree), "Tree should be empty"); in TEST_BEGIN()
53 assert_ptr_null(tree_first(&tree), "Unexpected node"); in TEST_BEGIN()
54 assert_ptr_null(tree_last(&tree), "Unexpected node"); in TEST_BEGIN()
58 assert_ptr_null(tree_search(&tree, &key), "Unexpected node"); in TEST_BEGIN()
62 assert_ptr_null(tree_nsearch(&tree, &key), "Unexpected node"); in TEST_BEGIN()
66 assert_ptr_null(tree_psearch(&tree, &key), "Unexpected node"); in TEST_BEGIN()
115 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb() argument
123 search_node = tree_search(tree, node); in tree_iterate_cb()
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/tree/
DANTLRCommonTreeTest.m21 ANTLRCommonTree *tree = [ANTLRCommonTree newTree];
22 STAssertNotNil(tree, @"Tree was nil");
29 ANTLRCommonTree *tree = [ANTLRCommonTree newTree];
30 STAssertNotNil(tree, @"Tree was nil");
31 if (tree != nil)
32 …STAssertEquals([tree getType], (NSInteger)ANTLRTokenTypeInvalid, @"Tree should have an invalid tok…
33 // [tree release];
43 ANTLRCommonTree *tree = [ANTLRCommonTree newTreeWithToken:token];
44 STAssertNotNil(tree, @"Tree was nil");
45 if (tree != nil)
[all …]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DTreeIterator.cs44 protected object tree; field in Antlr.Runtime.Tree.TreeIterator
57 public TreeIterator(object tree) in TreeIterator() argument
58 : this(new CommonTreeAdaptor(), tree) { in TreeIterator()
61 public TreeIterator(ITreeAdaptor adaptor, object tree) { in TreeIterator() argument
63 this.tree = tree; in TreeIterator()
64 this.root = tree; in TreeIterator()
93 if (adaptor.GetChildCount(tree) == 0) { in MoveNext()
97 Current = tree; in MoveNext()
104 if (tree == null) { in MoveNext()
108 if (adaptor.GetChildCount(tree) > 0) { in MoveNext()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/
Dtrace-event-listener.rb52 def consume_node( tree ) argument
53 record '(%s) unique_id=%s text=%p type=%s[%s]', __method__, @adaptor.unique_id( tree ),
54 @adaptor.text_of( tree ), @adaptor.type_name( tree ), @adaptor.type_of( tree )
57 def look( i, tree ) argument
58 record '(%s): k=%s unique_id=%s text=%p type=%s[%s]', __method__, i, @adaptor.unique_id( tree ),
59 @adaptor.text_of( tree ), @adaptor.type_name( tree ), @adaptor.type_of( tree )
62 def flat_node( tree ) argument
63 record '(%s): unique_id=%s', __method__, @adaptor.unique_id( tree )
66 def create_node( tree, token = nil ) argument
68 record '(%s): unique_id=%s text=%p type=%s[%s]', __method__, @adaptor.unique_id( tree ),
[all …]
/external/mesa3d/src/compiler/nir/
Dnir_search.c336 bitsize_tree *tree = rzalloc(mem_ctx, bitsize_tree); in build_bitsize_tree() local
342 tree->num_srcs = info.num_inputs; in build_bitsize_tree()
343 tree->common_size = 0; in build_bitsize_tree()
345 tree->is_src_sized[i] = !!nir_alu_type_get_type_size(info.input_types[i]); in build_bitsize_tree()
346 if (tree->is_src_sized[i]) in build_bitsize_tree()
347 tree->src_size[i] = nir_alu_type_get_type_size(info.input_types[i]); in build_bitsize_tree()
348 tree->srcs[i] = build_bitsize_tree(mem_ctx, state, expr->srcs[i]); in build_bitsize_tree()
350 tree->is_dest_sized = !!nir_alu_type_get_type_size(info.output_type); in build_bitsize_tree()
351 if (tree->is_dest_sized) in build_bitsize_tree()
352 tree->dest_size = nir_alu_type_get_type_size(info.output_type); in build_bitsize_tree()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb359 def set_child( index, tree ) argument
360 return if tree.nil?
361 tree.flat_list? and raise ArgumentError, "Can't set single child to a list"
362 tree.parent = self
363 tree.child_index = index
364 self[ index ] = tree
690 def add_child( tree, child ) argument
691 tree.add_child( child ) if tree and child
694 def child_count( tree ) argument
695 tree.child_count
[all …]
/external/dtc/tests/
Dtrees.S20 #define TREE_HDR(tree) \ argument
22 .globl _##tree ; \
23 _##tree: \
24 tree: \
26 FDTLONG(tree##_end - tree) ; \
27 FDTLONG(tree##_struct - tree) ; \
28 FDTLONG(tree##_strings - tree) ; \
29 FDTLONG(tree##_rsvmap - tree) ; \
33 FDTLONG(tree##_strings_end - tree##_strings) ; \
34 FDTLONG(tree##_struct_end - tree##_struct) ;
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
DSimpleCParser.h50 ANTLRCommonTree *tree; // start of memVars() variable
54 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
64 ANTLRCommonTree *tree; // start of memVars() variable
68 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
78 ANTLRCommonTree *tree; // start of memVars() variable
82 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
92 ANTLRCommonTree *tree; // start of memVars() variable
96 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
106 ANTLRCommonTree *tree; // start of memVars() variable
110 @property (retain, getter=getTree, setter=setTree:) ANTLRCommonTree *tree;
[all …]
/external/libvpx/libvpx/vp9/encoder/
Dvp9_treewriter.c13 static void tree2tok(struct vp9_token *tokens, const vpx_tree_index *tree, in tree2tok() argument
19 const vpx_tree_index j = tree[i++]; in tree2tok()
24 tree2tok(tokens, tree, j, v, l); in tree2tok()
30 const vpx_tree_index *tree) { in vp9_tokens_from_tree() argument
31 tree2tok(tokens, tree, 0, 0, 0); in vp9_tokens_from_tree()
34 static unsigned int convert_distribution(unsigned int i, vpx_tree tree, in convert_distribution() argument
39 if (tree[i] <= 0) in convert_distribution()
40 left = num_events[-tree[i]]; in convert_distribution()
42 left = convert_distribution(tree[i], tree, branch_ct, num_events); in convert_distribution()
44 if (tree[i + 1] <= 0) in convert_distribution()
[all …]

12345678910>>...90