/external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
H A D | pcy_lib.c | 115 if (level->nodes) 116 n += sk_X509_POLICY_NODE_num(level->nodes); 130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
H A D | pcy_tree.c | 114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 316 /* Iterate through all in nodes linking matches */ 317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) 319 node = sk_X509_POLICY_NODE_value(last->nodes, i); 362 /* Look for matching nodes in previous level */ 426 /* Locate unmatched nodes */ 451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) 453 node = sk_X509_POLICY_NODE_value(last->nodes, i); 461 * nodes [all...] |
/external/freetype/src/cache/ |
H A D | ftcmru.c | 177 list->nodes = NULL; 187 while ( list->nodes ) 188 FTC_MruList_Remove( list, list->nodes ); 210 first = list->nodes; 221 FTC_MruNode_Up( &list->nodes, node ); 247 node = list->nodes->prev; 253 FTC_MruNode_Up( &list->nodes, node ); 260 FTC_MruNode_Remove( &list->nodes, node ); 273 FTC_MruNode_Prepend( &list->nodes, node ); 311 FTC_MruNode_Remove( &list->nodes, nod [all...] |
/external/openssl/crypto/x509v3/ |
H A D | pcy_lib.c | 115 if (level->nodes) 116 n += sk_X509_POLICY_NODE_num(level->nodes); 130 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
H A D | pcy_tree.c | 114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 316 /* Iterate through all in nodes linking matches */ 317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) 319 node = sk_X509_POLICY_NODE_value(last->nodes, i); 362 /* Look for matching nodes in previous level */ 426 /* Locate unmatched nodes */ 451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) 453 node = sk_X509_POLICY_NODE_value(last->nodes, i); 461 * nodes [all...] |
/external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
H A D | XpathResourceXmlLoader.java | 23 NodeList nodes = (NodeList) stringsXPath.evaluate(document, XPathConstants.NODESET); 24 for (int i = 0; i < nodes.getLength(); i++) { 25 Node node = nodes.item(i);
|
/external/chromium_org/third_party/jinja2/ |
H A D | parser.py | 11 from jinja2 import nodes namespace 107 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`.""" 109 rv = object.__new__(nodes.InternalName) 110 nodes.Node.__init__(rv, 'fi%d' % self._last_identifier, lineno=lineno) 174 return nodes.Assign(target, expr, lineno=lineno) 192 return nodes.For(target, iter, body, else_, test, 197 node = result = nodes.If(lineno=self.stream.expect('name:if').lineno) 204 new_node = nodes.If(lineno=self.stream.current.lineno) 217 node = nodes.Block(lineno=next(self.stream).lineno) 234 node = nodes [all...] |
/external/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_node_data.cc | 108 const std::vector<const BookmarkNode*>& nodes) { 109 ReadFromVector(nodes); 125 const std::vector<const BookmarkNode*>& nodes) { 128 if (nodes.empty()) 131 for (size_t i = 0; i < nodes.size(); ++i) 132 elements.push_back(Element(nodes[i])); 248 std::vector<const BookmarkNode*> nodes; local 251 return nodes; 256 nodes.clear(); 257 return nodes; 107 BookmarkNodeData( const std::vector<const BookmarkNode*>& nodes) argument 124 ReadFromVector( const std::vector<const BookmarkNode*>& nodes) argument 267 std::vector<const BookmarkNode*> nodes = GetNodes(model, profile_path); local [all...] |
H A D | bookmark_utils.h | 39 // Clones bookmark node, adding newly created nodes to |parent| starting at 49 // Copies nodes onto the clipboard. If |remove_nodes| is true the nodes are 50 // removed after copied to the clipboard. The nodes are copied in such a way 53 const std::vector<const BookmarkNode*>& nodes, 56 // Pastes from the clipboard. The new nodes are added to |parent|, unless 57 // |parent| is null in which case this does nothing. The nodes are inserted 58 // at |index|. If |index| is -1 the nodes are added to the end. 72 // only nodes of type url. 75 std::vector<const BookmarkNode*>* nodes); [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
H A D | basic.rb | 37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree ) 38 nodes.token_stream = tokens 39 walker = FlatListWalker::TreeParser.new( nodes ) 73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree ) 74 nodes.token_stream = tokens 75 walker = SimpleTreeWalker::TreeParser.new( nodes ) 112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree ) 113 nodes.token_stream = tokens 114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes ) 150 nodes [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | FuncKey.java | 61 XNodeSet nodes = null; 138 nodes = new XNodeSet(upi); 143 nodes = kmgr.getNodeSetDTMByKey(xctxt, docContext, keyname, 146 nodes.setRoot(xctxt.getCurrentNode(), xctxt); 149 return nodes;
|
/external/chromium_org/ui/accessibility/ |
H A D | ax_generated_tree_unittest.cc | 49 // A class to create all possible trees with <n> nodes and the ids [1...n]. 60 // The second part is the assignment of ids to the nodes in the tree. 73 // bugs that affect trees with >4 nodes that wouldn't affect a smaller tree 109 // Build an AXTreeUpdate. The first two nodes of the tree always 112 update.nodes.resize(node_count_); 113 update.nodes[0].id = permuted[0]; 114 update.nodes[0].role = AX_ROLE_ROOT_WEB_AREA; 115 update.nodes[0].child_ids.push_back(permuted[1]); 116 update.nodes[1].id = permuted[1]; 118 // The remaining nodes ar [all...] |
/external/smack/src/org/jivesoftware/smackx/provider/ |
H A D | VCardProvider.java | 142 List<Node> nodes = new ArrayList<Node>(childNodeCount); 144 nodes.add(childNodes.item(i)); 148 for (Node n : nodes) { 166 NodeList nodes = document.getElementsByTagName("USERID"); 167 if (nodes == null) return; 168 for (int i = 0; i < nodes.getLength(); i++) { 169 Element element = (Element) nodes.item(i); 183 NodeList nodes = allPhones.item(i).getChildNodes(); 187 for (int j = 0; j < nodes.getLength(); j++) { 188 Node node = nodes [all...] |
/external/chromium_org/cc/resources/ |
H A D | task_graph_runner.cc | 49 std::find_if(graph_->nodes.begin(), 50 graph_->nodes.end(), 53 DCHECK(it != graph_->nodes.end()); 125 nodes.swap(other->nodes); 130 nodes.clear(); 166 graph->nodes.size(), 171 DCHECK(std::find_if(graph->nodes.begin(), 172 graph->nodes.end(), 174 graph->nodes [all...] |
H A D | raster_worker_pool.cc | 230 for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); 231 it != graph->nodes.end(); 249 DCHECK(std::find_if(graph->nodes.begin(), 250 graph->nodes.end(), 252 graph->nodes.end()); 253 graph->nodes.push_back(TaskGraph::Node(task, priority, dependencies)); 278 std::find_if(graph->nodes.begin(), 279 graph->nodes.end(), 281 if (decode_it == graph->nodes.end())
|
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | math_semantic_tree.js | 74 /** Branch nodes can store additional nodes that can be useful. 86 * @return {!Array.<cvox.SemanticTree.Node>} The nodes in the tree for which the 125 * Translates a list of nodes into XML representation. 127 * @param {!Array.<!cvox.SemanticTree.Node>} nodes A list of nodes. 130 var xmlNodeList = function(tag, nodes) { 131 var xmlNodes = nodes.map(function(x) {return x.xml(xml, brief);}); 283 * Adds MathML nodes to the node's store of MathML nodes i [all...] |
/external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
H A D | bookmark_api_helpers.cc | 29 std::vector<linked_ptr<BookmarkTreeNode> >* nodes, 37 nodes->push_back(new_node); 97 std::vector<linked_ptr<BookmarkTreeNode> >* nodes, 99 return AddNodeHelper(client, node, nodes, recurse, false); 104 std::vector<linked_ptr<BookmarkTreeNode> >* nodes, 106 return AddNodeHelper(client, node, nodes, recurse, true); 27 AddNodeHelper(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse, bool only_folders) argument 95 AddNode(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument 102 AddNodeFoldersOnly(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument
|
/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathResult.cpp | 163 const NodeSet& nodes = m_value.toNodeSet(); local 165 return nodes.firstNode(); 166 return nodes.anyNode(); 217 const NodeSet& nodes = m_value.toNodeSet(); local 218 if (index >= nodes.size()) 221 return nodes[index];
|
/external/chromium_org/mojo/services/view_manager/ |
H A D | test_change_tracker.cc | 108 std::vector<std::string> node_strings(changes[0].nodes.size()); 109 for (size_t i = 0; i < changes[0].nodes.size(); ++i) 110 node_strings[i] = "[" + changes[0].nodes[i].ToString() + "]"; 151 Array<NodeDataPtr> nodes) { 157 NodeDatasToTestNodes(nodes, &change.nodes); 161 void TestChangeTracker::OnRootsAdded(Array<NodeDataPtr> nodes) { argument 164 NodeDatasToTestNodes(nodes, &change.nodes); 190 Array<NodeDataPtr> nodes) { 147 OnViewManagerConnectionEstablished( ConnectionSpecificId connection_id, const String& creator_url, Id next_server_change_id, Array<NodeDataPtr> nodes) argument 186 OnNodeHierarchyChanged(Id node_id, Id new_parent_id, Id old_parent_id, Id server_change_id, Array<NodeDataPtr> nodes) argument [all...] |
H A D | test_change_tracker.h | 52 std::vector<TestNode> nodes; member in struct:mojo::view_manager::service::Change 69 // Returns a string description of |changes[0].nodes|. Returns an empty string 103 Array<NodeDataPtr> nodes); 104 void OnRootsAdded(Array<NodeDataPtr> nodes); 111 Array<NodeDataPtr> nodes);
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestTreeNodeStream.java | 169 // stream has 7 real + 6 nav nodes 200 // stream has 7 real + 6 nav nodes 224 stream.mark(); // keep saving nodes though 245 // stream has 7 real + 6 nav nodes 284 // stream has 7 real + 6 nav nodes 307 // stream has 7 real + 6 nav nodes 328 // stream has 8 real + 10 nav nodes 330 CommonTree[] nodes = new CommonTree[n]; 332 nodes[i] = new CommonTree(new CommonToken((i+1)*10)); 334 Tree g = nodes[ 360 toNodesOnlyString(TreeNodeStream nodes) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/functions/ |
H A D | FuncId.java | 43 * Fill in a list with nodes that match a space delimited list if ID 47 * @param docContext The document where the nodes are being looked for. 49 * @param usedrefs List of references for which nodes were found. 50 * @param nodeSet Node set where the nodes will be added to. 51 * @param mayBeMore true if there is another set of nodes to be looked for. 118 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); 119 NodeSetDTM nodeSet = nodes.mutableNodeset(); 140 return nodes; 149 return nodes;
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | StaticNodeList.h | 44 static PassRefPtrWillBeRawPtr<StaticNodeList> adopt(WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes);
|
/external/chromium_org/third_party/WebKit/Source/core/inspector/ |
H A D | InspectorMemoryAgent.h | 53 virtual void getDOMCounters(ErrorString*, int* documents, int* nodes, int* jsEventListeners) OVERRIDE;
|
/external/libsepol/src/ |
H A D | node_internal.h | 5 #include <sepol/nodes.h>
|