| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncId.java | 50 * @param nodeSet Node set where the nodes will be added to.
80 int node = dtm.getElementById(ref); local
82 if (DTM.NULL != node)
83 nodeSet.addNodeInDocOrder(node, xctxt);
|
| /external/avahi/avahi-core/ |
| timeeventq.c | 35 AvahiPrioQueueNode *node; member in struct:AvahiTimeEvent
90 avahi_prio_queue_shuffle(q->prioq, e->node);
194 if (!(e->node = avahi_prio_queue_put(q->prioq, e))) {
209 avahi_prio_queue_remove(q->prioq, e->node);
221 avahi_prio_queue_shuffle(e->queue->prioq, e->node);
|
| /external/boringssl/src/crypto/lhash/ |
| lhash_test.c | 69 struct dummy_lhash_node *node, *cur; local
79 node = malloc(sizeof(struct dummy_lhash_node));
81 node->s = s;
82 node->next = lh->head;
83 lh->head = node;
|
| /external/clang/test/Modules/Inputs/ |
| templates-top.h | 7 struct node {}; struct in class:List
8 node *head;
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 55 uptr node = t1.getAndClearFirstOne(); local
56 if (v[node].setBit(to))
58 added_edges[res++] = node;
109 // Returns true if there is a path from the node 'from'
|
| /external/deqp/framework/common/ |
| tcuTestHierarchyIterator.cpp | 94 // Init traverse state and "seek" to first reportable node.
106 TestNode* const node = iter->node; local
107 const TestNodeType nodeType = node->getNodeType();
112 case NODETYPE_PACKAGE: m_inflater.leaveTestPackage(static_cast<TestPackage*>(node)); break;
113 case NODETYPE_GROUP: m_inflater.leaveGroupNode(static_cast<TestCaseGroup*>(node)); break;
138 return m_sessionStack.back().node;
155 nodePath += iter.node->getName();
165 TestNode* const node = iter.node; local
[all...] |
| tcuTestHierarchyIterator.hpp | 85 * STATE_ENTER_NODE: A test node has been entered to for the first time.
86 * Node can be queried with getNode() and its full path with getNodePath().
87 * For group nodes the iterator will next enter first matching child node.
89 * immediately after entering that node.
91 * STATE_LEAVE_NODE: Iterator is leaving a node. In case of group nodes this
94 * or leave the parent group if the reported node was last child of that
97 * Root node is never reported, but instead iteration will start on first
98 * matching test package node, if there is any.
101 * Upon entering a group node, after STATE_ENTER_NODE has been signaled,
103 * Upon exiting a group node, before STATE_LEAVE_NODE is called, inflate
176 TestNode* node; member in struct:tcu::TestHierarchyIterator::NodeIter
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| DomFront.java | 84 SsaBasicBlock node = nodes.get(i); local
86 + node.getPredecessors());
127 SsaBasicBlock node = nodes.get(i); local
132 for (SsaBasicBlock child : node.getDomChildren()) {
141 System.out.println("domChildren[" + node + "]: "
148 * is for each node. This sweeps the node list and builds the proper
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| sample3-inl.h | 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
85 // 1. Deletes every node.
86 QueueNode<E>* node = head_; local
87 QueueNode<E>* next = node->next();
89 delete node;
90 node = next
[all...] |
| /external/icu/icu4c/source/common/ |
| ucharstrie.cpp | 35 int32_t node; local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos; local
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++
113 int32_t node=*pos; local
123 int32_t node=*pos++; local
164 int32_t node; local
195 int32_t node; local
215 int32_t node; local
233 int32_t node=*pos++; local
296 int32_t node=*pos++; local
322 int32_t node=*pos++; local
373 int32_t node=*pos++; local
[all...] |
| /external/icu/icu4c/source/tools/genrb/ |
| rle.c | 300 int32_t node = 0; local
344 * if we could look ahead, but we can't, so we use 'node' to
347 switch (node) {
349 /* Normal idle node */
351 node = 1;
363 node = 0;
367 node = 2;
384 node = 0;
390 if (node != 0){
|
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/page/ |
| NodePageTest.java | 31 private CoverageNodeImpl node; field in class:NodePageTest
37 protected TestNodePage(ICoverageNode node, ReportPage parent) {
38 super(node, parent, rootFolder, NodePageTest.this.context);
56 node = new CoverageNodeImpl(ElementType.GROUP, "Test");
57 page = new TestNodePage(node, null);
62 assertSame(node, page.getNode());
77 final TestNodePage group = new TestNodePage(node, page);
|
| PackagePageTest.java | 37 private IPackageCoverage node; field in class:PackagePageTest
69 node = new PackageCoverageImpl("org/jacoco/example", Arrays.asList(
72 page = new PackagePage(node, null, sourceLocator, rootFolder, context);
104 node = new PackageCoverageImpl("org/jacoco/example", Arrays.asList(
107 page = new PackagePage(node, null, sourceLocator, rootFolder, context);
|
| PackageSourcePageTest.java | 41 private PackageCoverageImpl node; field in class:PackageSourcePageTest
55 node = new PackageCoverageImpl("org/jacoco/example",
90 page = new PackageSourcePage(node, null, sourceLocator, rootFolder,
113 page = new PackageSourcePage(node, null, sourceLocator, rootFolder,
|
| /external/jemalloc/src/ |
| android_je_iterate.c | 45 extent_node_t *node; local
47 node = chunk_lookup((void *)ptr, false);
48 if (node == NULL) {
53 assert(extent_node_achunk_get(node) ||
54 (uintptr_t)extent_node_addr_get(node) == ptr);
57 if (extent_node_achunk_get(node)) {
62 if (&chunk->node != node) {
68 } else if ((uintptr_t)extent_node_addr_get(node) == ptr) {
70 callback(ptr, extent_node_size_get(node), arg)
[all...] |
| base.c | 20 extent_node_t *node; local
24 node = base_nodes;
25 base_nodes = *(extent_node_t **)node;
26 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
27 return (node);
32 base_node_dalloc(extent_node_t *node)
35 JEMALLOC_VALGRIND_MAKE_MEM_UNDEFINED(node, sizeof(extent_node_t));
36 *(extent_node_t **)node = base_nodes;
37 base_nodes = node;
44 extent_node_t *node; local
83 extent_node_t *node; local
[all...] |
| /external/jetty/src/java/org/eclipse/jetty/webapp/ |
| IterativeDescriptorProcessor.java | 35 public static final Class<?>[] __signature = new Class[]{WebAppContext.class, Descriptor.class, XmlParser.Node.class};
41 * Register a method to be called back when visiting the node with the given name.
43 * public void method (Descriptor descriptor, XmlParser.Node node)
64 XmlParser.Node root = descriptor.getRoot();
66 XmlParser.Node node = null; local
70 if (!(o instanceof XmlParser.Node)) continue;
71 node = (XmlParser.Node) o
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| AMultipleCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
66 void removeChild(@SuppressWarnings("unused") Node child)
78 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| ASequenceExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
66 void removeChild(@SuppressWarnings("unused") Node child)
78 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| Node.java | 3 package com.google.clearsilver.jsilver.syntax.node;
8 public abstract class Node implements Switchable, Cloneable
10 private Node parent;
15 public Node parent()
20 void parent(@SuppressWarnings("hiding") Node parent)
25 abstract void removeChild(Node child);
26 abstract void replaceChild(Node oldChild, Node newChild);
28 public void replaceBy(Node node)
[all...] |
| /external/libchrome/base/trace_event/ |
| heap_profiler_stack_frame_deduplicator.cc | 36 auto node = nodes->find(frame); local
37 if (node == nodes->end()) {
38 // There is no tree node for this frame yet, create it. The parent node
39 // is the node associated with the previous frame.
42 // The new frame node will be appended, so its index is the current size
46 // Add the node to the trie so it will be found next time.
49 // Append the node after modifying |nodes|, because the |frames_| vector
53 // A tree node for this frame exists. Look for the next one.
54 frame_index = node->second
[all...] |
| /external/libxml2/ |
| testC14N.c | 244 xmlNodePtr node; local
268 node = doc->children;
269 while(node != NULL && !xmlStrEqual(node->name, (const xmlChar *)"XPath")) {
270 node = node->next;
273 if(node == NULL) {
279 expr = xmlNodeGetContent(node);
297 ns = node->nsDef;
347 fprintf(stderr, "namespace \"%s\"=\"%s\" for node %s:%s\n"
[all...] |
| /external/ltrace/ |
| expr.h | 54 } node; member in union:expr_node::__anon19851
79 void expr_init_self(struct expr_node *node);
83 void expr_init_named(struct expr_node *node,
87 void expr_init_argno(struct expr_node *node, size_t num);
90 * copied into NODE and owned by it. */
91 void expr_init_const(struct expr_node *node, struct value *val);
92 void expr_init_const_word(struct expr_node *node, long l,
97 void expr_init_index(struct expr_node *node,
103 void expr_init_up(struct expr_node *node, struct expr_node *lhs, int own_lhs);
107 void expr_init_cb1(struct expr_node *node,
[all...] |
| /external/mesa3d/src/mesa/vbo/ |
| vbo_save_draw.c | 51 const struct vbo_save_vertex_list *node)
58 if (node->current_size == 0)
61 if (node->current_data) {
62 data = node->current_data;
67 if (node->count)
68 offset = (node->buffer_offset +
69 (node->count-1) * node->vertex_size * sizeof(GLfloat));
71 offset = node->buffer_offset;
74 node->vertex_size * sizeof(GLfloat),
259 const struct vbo_save_vertex_list *node = local
[all...] |
| /external/opencv3/3rdparty/libjasper/ |
| jpc_tagtree.c | 99 jpc_tagtreenode_t *node; local
134 node = tree->nodes_;
142 node->parent_ = parentnode;
143 ++node;
145 node->parent_ = parentnode;
146 ++node;
158 node->parent_ = 0;
225 jpc_tagtreenode_t *node; local
228 node = tree->nodes_;
231 node->value_ = INT_MAX
244 jpc_tagtreenode_t *node; local
272 jpc_tagtreenode_t *node; local
332 jpc_tagtreenode_t *node; local
382 jpc_tagtreenode_t *node; local
[all...] |
