/external/android-clat/ |
H A D | config.c | 41 * root - parsed configuration 45 char *config_item_str(cnode *root, const char *item_name, const char *defaultvar) { argument 48 if(!(tmp = config_str(root, item_name, defaultvar))) { 57 * root - parsed configuration 62 int16_t *config_item_int16_t(cnode *root, const char *item_name, const char *defaultvar, int16_t *ret_val_ptr) { argument 67 if(!(tmp = config_str(root, item_name, defaultvar))) { 96 * root - parsed configuration 101 struct in_addr *config_item_ip(cnode *root, const char *item_name, const char *defaultvar, struct in_addr *ret_val_ptr) { argument 105 if(!(tmp = config_str(root, item_name, defaultvar))) { 121 * root 126 config_item_ip6(cnode *root, const char *item_name, const char *defaultvar, struct in6_addr *ret_val_ptr) argument 302 cnode *root = config_node("", ""); local [all...] |
/external/ant-glob/src/org/apache/tools/ant/types/selectors/ |
H A D | SelectorUtils.java | 546 String root = null; 549 root = s[0]; 567 String[] l = new String[count + ((root == null) ? 0 : 1)]; 569 if (root != null) { 570 l[0] = root;
|
/external/ant-glob/src/org/apache/tools/ant/util/ |
H A D | FileUtils.java | 145 * @return String[] {root, remaining path}. 157 String root = null; 162 root = path.substring(0, next); 164 root += sep; 165 //remove the initial separator; the root has it. 180 root = (nextsep > 2) ? path.substring(0, nextsep + 1) : path; 181 path = path.substring(root.length()); 183 root = File.separator; 186 return new String[] {root, path};
|
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | BaseTreeAdaptor.as | 57 // ensure new subtree root has parent/child index set 82 /** If oldRoot is a nil root, just copy or move the children to newRoot. 83 * If not a nil root, make oldRoot a child of newRoot. 89 * child as the new root node. 100 * simple node or nil root with a single child node--it must be a root 125 throw new Error("more than one node as root (TODO: make exception hierarchy)"); 136 public function rulePostProcessing(root:Object):Object { 137 var r:Tree = Tree(root);
|
H A D | CommonTreeNodeStream.as | 73 protected var root:Object; 75 /** IF this tree (root) was created from a token stream, track it. */ 100 this.root = tree; 116 stream.root = parent.root; 129 fillBufferTo(root); 234 return root;
|
H A D | TreeAdaptor.as | 94 /** If oldRoot is a nil root, just copy or move the children to newRoot. 95 * If not a nil root, make oldRoot a child of newRoot. 101 * child as the new root node. 112 * simple node or nil root with a single child node--it must be a root 122 /** Given the root of the subtree created for this rule, post process 125 * as the setting of start/stop indexes relies on a single non-nil root 135 function rulePostProcessing(root:Object):Object; 192 * still usually have a nil root node just to hold the children list. 218 /** Who is the parent node of this node; if null, implies node is root [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3basetreeadaptor.h | 89 void * (*rulePostProcessing) (struct ANTLR3_BASE_TREE_ADAPTOR_struct * adaptor, void * root); 139 /// If parent is null, don't do anything; must be at root of overall tree.
|
H A D | antlr3collections.h | 377 pANTLR3_INT_TRIE_NODE root; /* Root node of this integer trie */ member in struct:ANTLR3_INT_TRIE_struct
|
H A D | antlr3commontreenodestream.h | 136 /// If parent is null, don't do anything; must be at root of overall tree. 203 pANTLR3_BASE_TREE root; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct 304 /// closed it will not free the root tree as this tree always
|
H A D | antlr3debugeventlistener.h | 352 /** Make a node the new root of an existing root. See 377 void (*addChild) (pANTLR3_DEBUG_EVENT_LISTENER delboy, pANTLR3_BASE_TREE root, pANTLR3_BASE_TREE child); 379 /** Set the token start/stop token index for a subtree root or node.
|
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3basetreeadaptor.c | 53 static pANTLR3_BASE_TREE rulePostProcessing (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE root); 481 // Ensure new subtree root has parent/child index set 587 /** If oldRoot is a nil root, just copy or move the children to newRoot. 588 * If not a nil root, make oldRoot a child of newRoot. 596 * child as the new root node. 611 * simple node or nil root with a single child node--it must be a root 633 /* root is just the new tree as is if there is no 634 * current root tree. 649 ANTLR3_FPRINTF(stderr, "More than one node as root! TOD 704 rulePostProcessing(pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE root) argument [all...] |
H A D | antlr3collections.c | 1779 /* Now we need to allocate the root node. This makes it easier 1781 * for the root node. 1783 trie->root = (pANTLR3_INT_TRIE_NODE) ANTLR3_CALLOC(1, sizeof(ANTLR3_INT_TRIE)); 1785 if (trie->root == NULL) 1796 /* Now we seed the root node with the index being the 1801 trie->root->bitNum = depth; 1804 * of the root node to point back to itself. 1806 trie->root->leftN = trie->root; 1807 trie->root [all...] |
H A D | antlr3commontreenodestream.c | 126 stream->root = tree; 256 // Reuse the root tree of the originating stream 258 stream->root = inStream->root; 457 /// Walk and fill the tree node buffer from the root tree 462 // Call the generic buffer routine with the root as the 465 fillBuffer(ctns, ctns->root); 471 // such as the root tree is. 609 return tns->ctns->root; 814 return tns->toStringSS(tns, tns->ctns->root, NUL [all...] |
H A D | antlr3debughandlers.c | 85 static void addChild (pANTLR3_DEBUG_EVENT_LISTENER delboy, pANTLR3_BASE_TREE root, pANTLR3_BASE_TREE child); 1025 addChild (pANTLR3_DEBUG_EVENT_LISTENER delboy, pANTLR3_BASE_TREE root, pANTLR3_BASE_TREE child) argument 1029 sprintf(buffer, "addChild\t%d\t%d\n", delboy->adaptor->getUniqueID(delboy->adaptor, root),
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
H A D | ITreeFixture.cs | 98 // Add child ^(nil 101 102 103) to root 5 100 CommonTree root = new CommonTree(new CommonToken(5)); 109 root.AddChild(r0); 111 Assert.IsNull(root.Parent); 112 Assert.AreEqual(-1, root.ChildIndex); 113 // check children of root all point at root 114 Assert.AreEqual(root, c0.Parent); 116 Assert.AreEqual(root, c0.Parent); 118 Assert.AreEqual(root, c [all...] |
H A D | ITreeNodeStreamFixture.cs | 95 ITree root = new CommonTree((IToken)null); 104 root.AddChild(t); 105 root.AddChild(u); 107 BufferedTreeNodeStream stream = new BufferedTreeNodeStream(root); 120 ITree root = new CommonTree((IToken)null); 122 root.AddChild(new CommonTree(new CommonToken(101))); 123 root.AddChild(new CommonTree(new CommonToken(102))); 124 root.AddChild(new CommonTree(new CommonToken(103))); 126 BufferedTreeNodeStream stream = new BufferedTreeNodeStream(root); 139 ITree root [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
H A D | BlankDebugEventListener.cs | 122 public virtual void AddChild(object root, object child) { argument
|
H A D | DebugEventHub.cs | 283 public virtual void AddChild(object root, object child) { argument 286 listener.AddChild(root, child);
|
H A D | DebugEventRepeater.cs | 152 public virtual void AddChild(object root, object child) { argument 153 _listener.AddChild(root, child);
|
H A D | DebugEventSocketProxy.cs | 342 public override void AddChild(object root, object child) { argument 343 int rootID = adaptor.GetUniqueID(root);
|
H A D | DebugTreeAdaptor.cs | 130 public virtual object RulePostProcessing(object root) { argument 131 return adaptor.RulePostProcessing(root);
|
H A D | IDebugEventListener.cs | 343 /** <summary>Make a node the new root of an existing root. See</summary> 372 void AddChild(object root, object child); argument 374 /** <summary>Set the token start/stop token index for a subtree root or node.</summary>
|
H A D | ParseTreeBuilder.cs | 50 ParseTree root = Create("<grammar " + grammarName + ">"); 51 callStack.Push(root);
|