|   /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ | 
| TStar.java  | 3 package com.google.clearsilver.jsilver.syntax.node;
  | 
| TUvar.java  | 3 package com.google.clearsilver.jsilver.syntax.node;
  | 
| TVar.java  | 3 package com.google.clearsilver.jsilver.syntax.node;
  | 
| TWith.java  | 3 package com.google.clearsilver.jsilver.syntax.node;
  | 
|   /external/libsepol/src/ | 
| assertion.c  | 37 	avtab_ptr_t node;  local  45 		for (node = avtab_search_node(te_avtab, &avkey); 46 		     node != NULL; 47 		     node = avtab_search_node_next(node, avkey.specified)) { 48 			if (node->datum.data & curperm->data) 51 		for (node = avtab_search_node(te_cond_avtab, &avkey); 52 		     node != NULL; 53 		     node = avtab_search_node_next(node, avkey.specified))      [all...] | 
|   /external/libxml2/include/libxml/ | 
| debugXML.h  | 41 				 xmlNodePtr node, 45 				 xmlNodePtr node, 49 				 xmlNodePtr node, 81 	xmlLsOneNode		(FILE *output, xmlNodePtr node); 83 	xmlLsCountNode		(xmlNodePtr node); 116     xmlNodePtr node;  member in struct:_xmlShellCtxt  127  * @node:  a first node 128  * @node2:  a second node 136 			     xmlNodePtr node,     [all...] | 
|   /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ | 
| rblist.c  | 99 	struct rb_node *node;  local  101 	for (node = rb_first(&rblist->entries); node; node = rb_next(node)) { 103 			return node;
  | 
|   /external/llvm/utils/ | 
| DSAextract.py  | 8 #problems will occur.  If node labels do not begin with 9 #Node this also will not work.  Since this is designed to work 11 #If you want to use this on other files rename the node labels 12 #to Node[.*] with a script or something.  This also relies on 13 #the length of a node name being 13 characters (as it is in all 16 #Note that the name of the node can be any substring of the actual 40 #construct a set of node names 52 nodeexp = re.compile('Node') 63 		#check to see if this is a node we are looking for 65 			#if this name is for the current node, add the dot variable nam 105  node = re.split('\\s+', buffer,2)[1]  variable      [all...] | 
|   /external/ltrace/ | 
| zero.c  | 97 		static struct expr_node node;  local  98 		expr_init_cb1(&node, &zero1_callback, 100 		nodep = &node;
  | 
|   /external/mesa3d/src/mesa/drivers/dri/i965/ | 
| brw_fs_live_variables.h  | 57       void *node;  local  59       node = rzalloc_size(ctx, size); 60       assert(node != NULL); 62       return node;
  | 
|   /external/openssl/crypto/x509v3/ | 
| pcy_node.c  | 98 	X509_POLICY_NODE *node;  local  102 		node = sk_X509_POLICY_NODE_value(level->nodes, i); 103 		if (node->parent == parent) 105 			if (!OBJ_cmp(node->data->valid_policy, id)) 106 				return node; 117 	X509_POLICY_NODE *node;  local  118 	node = OPENSSL_malloc(sizeof(X509_POLICY_NODE)); 119 	if (!node) 121 	node->data = data; 122 	node->parent = parent     [all...] | 
|   /external/qemu/include/qapi/qmp/ | 
| dispatch.h  | 40     QTAILQ_ENTRY(QmpCommand) node;  member in struct:QmpCommand 
  | 
|   /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ | 
| XTagXmlResourceLoader.java  | 9 import org.w3c.dom.Node; 46 			Node node = items.item( i );  local  47 			String name = node.getAttributes().getNamedItem( "name" ).getNodeValue(); 48 			processNode( node, name, isSystem ); 69 	protected abstract void processNode( Node node, String name, boolean isSystem );
  | 
| XpathResourceXmlLoader.java  | 4 import org.w3c.dom.Node; 25             Node node = nodes.item(i);  local  26             String name = node.getAttributes().getNamedItem("name").getNodeValue(); 27             processNode(node, name, isSystem); 31     protected abstract void processNode(Node node, String name, boolean isSystem) throws XPathExpressionException;
  | 
|   /external/smack/src/org/jivesoftware/smackx/entitycaps/provider/ | 
| CapsExtensionProvider.java  | 37         String node = null;  local  42             node = parser.getAttributeValue(null, "node"); 54         if (hash != null && version != null && node != null) { 55             return new CapsExtension(node, version, hash);
  | 
|   /external/smack/src/org/jivesoftware/smackx/packet/ | 
| OfflineMessageInfo.java  | 37     private String node = null;  field in class:OfflineMessageInfo  67         return node; 75      * @param node the stamp that uniquely identifies the offline message. 77     public void setNode(String node) { 78         this.node = node; 86             buf.append("<item node=\"").append(getNode()).append("\"/>"); 116                         info.setNode(parser.getAttributeValue("", "node"));
  | 
|   /external/smack/src/org/jivesoftware/smackx/provider/ | 
| CapsExtensionProvider.java  | 37         String node = null;  local  43                 node = parser.getAttributeValue(null, "node"); 59         if (hash != null && version != null && node != null) { 60             return new CapsExtension(node, version, hash);
  | 
| DiscoverItemsProvider.java  | 42         String node = "";  local  43         discoverItems.setNode(parser.getAttributeValue("", "node")); 51                 node = parser.getAttributeValue("", "node"); 58                 item.setNode(node);
  | 
| MultipleAddressesProvider.java  | 52                     String node = parser.getAttributeValue("", "node");  local  57                     multipleAddresses.addAddress(type, jid, node, desc, delivered, uri);
  | 
| PEPProvider.java  | 56     public void registerPEPParserExtension(String node, PacketExtensionProvider pepItemParser) { 57         nodeParsers.put(node, pepItemParser); 76                     // Figure out the node for this event. 77                     String node = parser.getAttributeValue("", "node");  local  78                     // Get the parser for this kind of node, and if found then parse the node. 79                     PacketExtensionProvider nodeParser = nodeParsers.get(node);
  | 
|   /external/smack/src/org/jivesoftware/smackx/pubsub/ | 
| NodeExtension.java  | 20  * schemas.  One which has a <b>node</b> as an attribute.  This class is 
 22  * node is a central concept to most pubsub functionality.
 29 	private String node;
  field in class:NodeExtension  33 	 * by {@link PubSubElementType} and the specified node id.
 36 	 * @param nodeId Specifies the id of the node
 41 		this.node = nodeId;
 56 	 * Gets the node id
 58 	 * @return The node id
 62 		return node;
 77 		return '<' + getElementName() + (node == null ? "" : " node='" + node + '\'') + "/>";     [all...] | 
|   /external/srec/seti/sltsEngine/src/ | 
| linklist_impl.c  | 34    2. each node is marked "used" when allocated; marked "unused" when deallocated 43   LNode node;  member in struct:LNodeAllocElement  56     n = &(g_LNodeAllocArray[i].node);   71 	  /* zero out the node first*/ 72 	  (g_LNodeAllocArray[i].node).data = NULL; 73 	  (g_LNodeAllocArray[i].node).prev = NULL; 74 	  (g_LNodeAllocArray[i].node).next = NULL; 76       return &(g_LNodeAllocArray[i].node); 90     addr = (long) (&(g_LNodeAllocArray[i].node)); 118    At return, current element will be point to newly created node     [all...] | 
|   /frameworks/compile/mclinker/unittests/ | 
| FactoriesTest.cpp  | 45 	NodeAlloc::NodeType* node = m_pNodeAlloc->produce();  local  48 	node = m_pNodeAlloc->produce(); 51 	node = m_pNodeAlloc->produce(); 57 	NodeAlloc::NodeType* node = 0;  local  59 		node = m_pNodeAlloc->produce(); 60 		node->data = (int*)malloc(sizeof(int)); 61 		*(node->data) = i; 76 	NodeAlloc::NodeType* node = 0;  local  78 		node = m_pNodeAlloc->produce(); 79 		node->data = (int*)malloc(sizeof(int)) 98  NodeAlloc::NodeType* node = 0;  local  122  NodeAlloc::NodeType* node = 0;  local  158  NodeAlloc::NodeType* node = 0;  local      [all...] | 
| GraphTest.cpp  | 44   ListDigraph::Node* u1 = graph.addNode(); 45   ListDigraph::Node* u2 = graph.addNode(); 46   ListDigraph::Node* u3 = graph.addNode(); 63   ListDigraph::Node* head = NULL; 92   ListDigraph::Node* u1 = graph.addNode(); 93   ListDigraph::Node* u2 = graph.addNode(); 94   ListDigraph::Node* u3 = graph.addNode(); 111   ListDigraph::Node* head = NULL; 140   ListDigraph::Node* u1 = graph.addNode(); 141   ListDigraph::Node* u2 = graph.addNode() 333  Digraph::Node node = graph.addNode();  local      [all...] | 
| InputTreeTest.cpp  | 78   InputTree::iterator node = m_pTestee->root();  local  79   InputTree::const_iterator const_node = node; 80   --node; 83   ASSERT_TRUE(isGroup(node)); 88   --node; 90   m_pTestee->enterGroup(node, InputTree::Downward); 92   InputTree::const_iterator const_node2 = node; 94   ASSERT_FALSE(node.isRoot()); 96   ASSERT_FALSE(isGroup(node)); 105   InputTree::iterator node = m_pTestee->root()  local  132  InputTree::iterator node = m_pTestee->root();  local  154  InputTree::iterator node = m_pTestee->root();  local      [all...] |