Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 25 of 257) sorted by relevance

1234567891011

/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
DSimpleCParser.h50 ANTLRCommonTree *tree; // start of memVars() variable
64 ANTLRCommonTree *tree; // start of memVars() variable
78 ANTLRCommonTree *tree; // start of memVars() variable
92 ANTLRCommonTree *tree; // start of memVars() variable
106 ANTLRCommonTree *tree; // start of memVars() variable
120 ANTLRCommonTree *tree; // start of memVars() variable
134 ANTLRCommonTree *tree; // start of memVars() variable
148 ANTLRCommonTree *tree; // start of memVars() variable
162 ANTLRCommonTree *tree; // start of memVars() variable
176 ANTLRCommonTree *tree; // start of memVars() variable
[all …]
/external/antlr/antlr-3.4/runtime/C/src/
Dantlr3commontree.c156 pANTLR3_COMMON_TREE tree; in newPoolTree() local
213 newFromTree(pANTLR3_ARBORETUM factory, pANTLR3_COMMON_TREE tree) in newFromTree()
289 antlr3SetCTAPI(pANTLR3_COMMON_TREE tree) in antlr3SetCTAPI()
339 pANTLR3_COMMON_TREE tree; in antlr3CommonTreeNew() local
374 createChildrenList (pANTLR3_BASE_TREE tree) in createChildrenList()
381 getToken (pANTLR3_BASE_TREE tree) in getToken()
393 dupNode (pANTLR3_BASE_TREE tree) in dupNode()
408 isNilNode (pANTLR3_BASE_TREE tree) in isNilNode()
423 getType (pANTLR3_BASE_TREE tree) in getType()
440 getText (pANTLR3_BASE_TREE tree) in getText()
[all …]
Dantlr3basetree.c58 antlr3BaseTreeNew(pANTLR3_BASE_TREE tree) in antlr3BaseTreeNew()
84 getCharPositionInLine (pANTLR3_BASE_TREE tree) in getCharPositionInLine()
90 getLine (pANTLR3_BASE_TREE tree) in getLine()
95 getFirstChildWithType (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 type) in getFirstChildWithType()
119 getChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i) in getChild()
131 getChildCount (pANTLR3_BASE_TREE tree) in getChildCount()
144 addChild (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child) in addChild()
222 addChildren (pANTLR3_BASE_TREE tree, pANTLR3_LIST kids) in addChildren()
236 setChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child) in setChild()
246 deleteChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i) in deleteChild()
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
DSimpleCParser.h68 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
87 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
106 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
125 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
144 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
163 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
182 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
201 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
220 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
239 ANTLRCommonTree *tree; /* ObjC start of memVars() */ variable
[all …]
/external/ltp/utils/ffsb-6.0-rc2/
Drbt.c219 void rbtree_init(rb_tree * tree) in rbtree_init()
230 rb_tree *tree = (rb_tree *) malloc(sizeof(rb_tree)); in rbtree_construct() local
241 void rbtree_clean(rb_tree * tree, destructor d) in rbtree_clean()
251 void rbtree_destruct(rb_tree * tree, destructor d) in rbtree_destruct()
259 int rbtree_size(rb_tree * tree) in rbtree_size()
266 int rbtree_depth(rb_tree * tree) in rbtree_depth()
275 int rbtree_contains(rb_tree * tree, datatype object) in rbtree_contains()
282 rb_node *rbtree_insert(rb_tree * tree, datatype object) in rbtree_insert()
360 rb_node *insert_successor_at(rb_tree * tree, rb_node * at_node, datatype object) in insert_successor_at()
419 rb_node *insert_predecessor_at(rb_tree * tree, rb_node * at_node, in insert_predecessor_at()
[all …]
/external/owasp/sanitizer/tools/findbugs/lib/
Dasm-tree-3.3.jar ... .tree public abstract org.objectweb.asm.tree.AbstractInsnNode extends java.lang.Object { public
Dasm-analysis-3.3.jar ... /MANIFEST.MF org/objectweb/asm/tree/analysis/Analyzer.class <Unknown> package ...
/external/doclava/src/com/google/doclava/
DInfoBuilder.java76 ParseTree tree = builder.getTree(); in parseFile() local
343 private void parseFile(ParseTree tree) { in parseFile()
393 private PackageInfo buildPackage(ParseTree tree) { in buildPackage()
413 private static String buildQualifiedName(ParseTree tree) { in buildQualifiedName()
428 private String buildImport(ParseTree tree) { in buildImport()
451 private ClassInfo buildClass(ParseTree tree, ClassInfo containingClass) { in buildClass()
521 private void parseInterfaces(ParseTree tree, ClassInfo cls) { in parseInterfaces()
555 private ClassInfo buildClassName(ParseTree tree, ClassInfo containingClass, Modifiers modifiers, in buildClassName()
624 private void buildClassBody(ParseTree tree, ClassInfo cls) { in buildClassBody()
683 private ArrayList<FieldInfo> buildFields(ParseTree tree, ClassInfo containingClass) { in buildFields()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Dwizard.rb341 def index( tree, map = {} ) argument
350 def find( tree, what ) argument
359 def find_token_type( tree, type ) argument
365 def find_pattern( tree, pattern ) argument
371 def visit( tree, what = nil, &block ) argument
386 def visit_all( tree, parent = nil, &block ) argument
394 def visit_type( tree, parent, type, &block ) argument
403 def visit_pattern( tree, pattern, &block ) argument
416 def match( tree, pattern ) argument
422 def match!( tree, pattern, labels = {} ) argument
[all …]
/external/boringssl/src/crypto/x509v3/
Dpcy_tree.c103 static void tree_print(char *str, X509_POLICY_TREE *tree, in tree_print()
149 X509_POLICY_TREE *tree; in tree_init() local
372 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_add_unmatched()
398 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_link_unmatched()
433 X509_POLICY_TREE *tree) in tree_link_any()
491 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune()
562 static int tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set()
606 static int tree_calculate_user_set(X509_POLICY_TREE *tree, in tree_calculate_user_set()
665 static int tree_evaluate(X509_POLICY_TREE *tree) in tree_evaluate()
695 void X509_policy_tree_free(X509_POLICY_TREE *tree) in X509_policy_tree_free()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb359 def set_child( index, tree ) argument
690 def add_child( tree, child ) argument
694 def child_count( tree ) argument
698 def child_index( tree ) argument
702 def child_of( tree, index ) argument
710 def copy_tree( tree, parent = nil ) argument
722 def delete_child( tree, index ) argument
727 def each_child( tree ) argument
735 def each_ancestor( tree, include_tree = true ) argument
744 def flat_list?( tree ) argument
[all …]
Ddot.rb91 def self.generate( tree, adaptor = nil, tree_template = TREE_TEMPLATE, argument
105 def to_dot( tree, adaptor = nil, tree_template = TREE_TEMPLATE, argument
117 def define_nodes( tree, adaptor, tree_template, known_nodes = nil ) argument
142 def define_edges( tree, adaptor, tree_template, edge_template ) argument
163 def node_template_for( adaptor, tree ) argument
/external/libvpx/libvpx/vp9/encoder/
Dvp9_treewriter.c13 static void tree2tok(struct vp9_token *tokens, const vpx_tree_index *tree, in tree2tok()
30 const vpx_tree_index *tree) { in vp9_tokens_from_tree()
34 static unsigned int convert_distribution(unsigned int i, vpx_tree tree, in convert_distribution()
54 void vp9_tree_probs_from_distribution(vpx_tree tree, in vp9_tree_probs_from_distribution()
Dvp9_context_tree.c62 static void alloc_tree_contexts(VP9_COMMON *cm, PC_TREE *tree, in alloc_tree_contexts()
77 static void free_tree_contexts(PC_TREE *tree) { in free_tree_contexts()
115 PC_TREE *const tree = &td->pc_tree[pc_tree_index]; in vp9_setup_pc_tree() local
126 PC_TREE *const tree = &td->pc_tree[pc_tree_index]; in vp9_setup_pc_tree() local
Dvp9_cost.c39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip()
/external/dtc/tests/
Dtrees.S20 #define TREE_HDR(tree) \ argument
40 #define EMPTY_RSVMAP(tree) \ argument
46 #define PROPHDR(tree, name, len) \ argument
51 #define PROP_INT(tree, name, val) \ argument
55 #define PROP_INT64(tree, name, val) \ argument
59 #define PROP_STR(tree, name, str) \ argument
74 #define STRING(tree, name, str) \ argument
/external/jemalloc/test/unit/
Drb.c47 tree_t tree; in TEST_BEGIN() local
115 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb()
143 tree_iterate(tree_t *tree) in tree_iterate()
154 tree_iterate_reverse(tree_t *tree) in tree_iterate_reverse()
165 node_remove(tree_t *tree, node_t *node, unsigned nnodes) in node_remove()
198 remove_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_iterate_cb()
209 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_reverse_iterate_cb()
235 tree_t tree; in TEST_BEGIN() local
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/
Devent-hub.rb63 def consume_hidden_token( tree ) argument
69 def consume_node( tree ) argument
75 def consume_token( tree ) argument
123 def error_node( tree ) argument
147 def flat_node( tree ) argument
159 def look( i, tree ) argument
195 def set_token_boundaries( tree, token_start_index, token_stop_index ) argument
Dtrace-event-listener.rb52 def consume_node( tree ) argument
57 def look( i, tree ) argument
62 def flat_node( tree ) argument
66 def create_node( tree, token = nil ) argument
86 def set_token_boundaries( tree, token_start_index, token_stop_index ) argument
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DDotTreeGenerator.cs95 public virtual string ToDot( object tree, ITreeAdaptor adaptor ) in ToDot()
120 public virtual string ToDot( ITree tree ) in ToDot()
124 protected virtual IEnumerable<string> DefineNodes( object tree, ITreeAdaptor adaptor ) in DefineNodes()
150 protected virtual IEnumerable<string> DefineEdges( object tree, ITreeAdaptor adaptor ) in DefineEdges()
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DDotTreeGenerator.cs95 public virtual string ToDot( object tree, ITreeAdaptor adaptor ) in ToDot()
120 public virtual string ToDot( ITree tree ) in ToDot()
124 protected virtual IEnumerable<string> DefineNodes( object tree, ITreeAdaptor adaptor ) in DefineNodes()
150 protected virtual IEnumerable<string> DefineEdges( object tree, ITreeAdaptor adaptor ) in DefineEdges()
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Utility/Antlr.Utility.Tree/
DDOTTreeGenerator.cs93 public virtual string ToDot(object tree, ITreeAdaptor adaptor) { in ToDot()
117 public virtual string ToDot(ITree tree) { in ToDot()
120 protected virtual IEnumerable<string> DefineNodes(object tree, ITreeAdaptor adaptor) { in DefineNodes()
143 protected virtual IEnumerable<string> DefineEdges(object tree, ITreeAdaptor adaptor) { in DefineEdges()
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DDOTTreeGenerator.java79 public StringTemplate toDOT(Object tree, in toDOT()
98 public StringTemplate toDOT(Object tree, in toDOT()
121 public StringTemplate toDOT(Tree tree) { in toDOT()
125 protected void toDOTDefineNodes(Object tree, in toDOTDefineNodes()
152 protected void toDOTDefineEdges(Object tree, in toDOTDefineEdges()
/external/protobuf/java/util/src/test/java/com/google/protobuf/util/
DFieldMaskTreeTest.java41 FieldMaskTree tree = new FieldMaskTree(); in testAddFieldPath() local
66 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testMergeFromFieldMask() local
73 FieldMaskTree tree = new FieldMaskTree(FieldMaskUtil.fromString("foo,bar.baz,bar.quz")); in testIntersectFieldPath() local
/external/antlr/antlr-3.4/runtime/Python/antlr3/
Ddottreegen.py80 def toDOT(self, tree, adaptor=None, treeST=_treeST, edgeST=_edgeST): argument
94 def toDOTDefineNodes(self, tree, adaptor, treeST, knownNodes=None): argument
127 def toDOTDefineEdges(self, tree, adaptor, treeST, edgeST): argument
174 def toDOT(tree, adaptor=None, treeST=DOTTreeGenerator._treeST, edgeST=DOTTreeGenerator._edgeST): argument

1234567891011