HomeSort by relevance Sort by last modified time
    Searched refs:node (Results 576 - 600 of 5153) sorted by null

<<21222324252627282930>>

  /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/
fix_filter.py 53 def transform(self, node, results):
54 if self.should_skip(node):
70 if in_special_context(node):
72 new = node.clone()
75 new.prefix = node.prefix
  /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/
fix_filter.py 53 def transform(self, node, results):
54 if self.should_skip(node):
70 if in_special_context(node):
72 new = node.clone()
75 new.prefix = node.prefix
  /prebuilts/misc/darwin-x86_64/freetype/include/freetype2/
ftlist.h 84 /* Find the list node for a given listed object. */
91 /* List node. NULL if it wasn't found. */
108 /* node :: The node to append. */
112 FT_ListNode node );
125 /* node :: The node to insert. */
129 FT_ListNode node );
138 /* Remove a node from a list. This function doesn't check whether */
139 /* the node is in the list! *
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_filter.py 53 def transform(self, node, results):
54 if self.should_skip(node):
70 if in_special_context(node):
72 new = node.clone()
75 new.prefix = node.prefix
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_filter.py 53 def transform(self, node, results):
54 if self.should_skip(node):
70 if in_special_context(node):
72 new = node.clone()
75 new.prefix = node.prefix
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/
ImageViewRule.java 33 public void onCreate(@NonNull INode node, @NonNull INode parent,
35 super.onCreate(node, parent, insertType);
41 node.editXml("Set Image",
47 parent.removeChild(node);
53 node.setAttribute(ANDROID_URI, ATTR_SRC, getSampleImageSrc());
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/
SAX2DTM2.java 69 * Iterator that returns all immediate children of a given node
80 * or set current node to END, to indicate request-not-honored?
82 * @param node Sets the root of the iteration.
86 public DTMAxisIterator setStartNode(int node)
89 if (node == DTMDefaultBase.ROOTNODE)
90 node = getDocument();
93 _startNode = node;
94 _currentNode = (node == DTM.NULL) ? DTM.NULL
95 : _firstch2(makeNodeIdentity(node));
104 * Get the next node in the iteration
112 int node = _currentNode; local
268 int node = _currentNode; local
313 int node = _currentNode; local
375 final int node = _startNode; local
477 int node = _currentNode; local
536 final int node = _currentNode; local
599 final int node = _currentNode; local
690 final int node = _currentNode; local
727 int node = _currentNode; local
763 int node = _currentNode; local
983 int node = _currentNode; local
1116 int node = _currentNode; local
1169 int node; local
1577 int node = _currentNode; local
1665 int node = _currentNode; local
    [all...]
  /external/mesa3d/src/gallium/auxiliary/cso_cache/
cso_hash.c 102 static void cso_free_node(struct cso_node *node)
104 FREE(node);
112 struct cso_node *node = cso_data_allocate_node(hash->data.d); local
114 if (!node)
117 node->key = akey;
118 node->value = avalue;
120 node->next = (struct cso_node*)(*anextNode);
121 *anextNode = node;
123 return node;
205 struct cso_node **node; local
225 struct cso_node *node = cso_hash_create_node(hash, key, data, nextNode); local
385 struct cso_node **node = cso_hash_find_node(hash, akey); local
419 struct cso_node *node = iter.node; local
437 struct cso_node **node = cso_hash_find_node(hash, key); local
    [all...]
  /frameworks/opt/setupwizard/tools/docs/
jsilver.jar 
  /prebuilts/devtools/tools/lib/
jsilver-1.0.0.jar 
  /prebuilts/tools/common/m2/repository/com/google/jsilver/jsilver/1.0.0/
jsilver-1.0.0.jar 
  /libcore/luni/src/main/java/java/util/concurrent/locks/
AbstractQueuedLongSynchronizer.java 13 import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node;
57 private transient volatile Node head;
61 * method enq to add new wait node.
63 private transient volatile Node tail;
115 * Inserts node into queue, initializing if necessary. See picture above.
116 * @param node the node to insert
117 * @return node's predecessor
119 private Node enq(Node node)
141 Node node = new Node(mode); local
420 final Node node = addWaiter(Node.EXCLUSIVE); local
451 final Node node = addWaiter(Node.EXCLUSIVE); local
482 final Node node = addWaiter(Node.SHARED); local
513 final Node node = addWaiter(Node.SHARED); local
547 final Node node = addWaiter(Node.SHARED); local
1381 Node node = new Node(Node.CONDITION); local
1499 Node node = addConditionWaiter(); local
1562 Node node = addConditionWaiter(); local
1599 Node node = addConditionWaiter(); local
1642 Node node = addConditionWaiter(); local
1686 Node node = addConditionWaiter(); local
    [all...]
AbstractQueuedSynchronizer.java 274 * Wait queue node class.
280 * information about a thread in the predecessor of its node. A
281 * "status" field in each node keeps track of whether a thread
282 * should block. A node is signalled when its predecessor
283 * releases. Each node of the queue otherwise serves as a
308 * needed to handle cancellation. If a node is cancelled, its
315 * The thread id for each node is kept in its own node, so a
316 * predecessor signals the next node to wake up by traversing
321 * updated "tail" when a node's successor appears to be null
608 Node node = new Node(mode); local
888 final Node node = addWaiter(Node.EXCLUSIVE); local
919 final Node node = addWaiter(Node.EXCLUSIVE); local
950 final Node node = addWaiter(Node.SHARED); local
981 final Node node = addWaiter(Node.SHARED); local
1015 final Node node = addWaiter(Node.SHARED); local
1850 Node node = new Node(Node.CONDITION); local
1968 Node node = addConditionWaiter(); local
2031 Node node = addConditionWaiter(); local
2068 Node node = addConditionWaiter(); local
2111 Node node = addConditionWaiter(); local
2155 Node node = addConditionWaiter(); local
    [all...]
  /device/moto/shamu/camera/QCamera2/util/
QCameraCmdThread.cpp 133 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local
134 if (NULL == node) {
138 memset(node, 0, sizeof(camera_cmd_t));
139 node->cmd = cmd;
142 cmd_queue.enqueueWithPriority((void *)node);
144 cmd_queue.enqueue((void *)node);
167 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local
168 if (NULL == node) {
172 cmd = node->cmd;
173 free(node);
    [all...]
  /external/chromium-trace/catapult/third_party/closure_linter/closure_linter/common/
tokens.py 135 node = self
136 while node:
137 yield node
138 node = node.next
142 node = self
143 while node:
144 yield node
145 node = node.previou
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
BinaryTreeTraverser.java 36 * Returns the left child of the specified node, or {@link Optional#absent()} if the specified
37 * node has no left child.
42 * Returns the right child of the specified node, or {@link Optional#absent()} if the specified
43 * node has no right child.
48 * Returns the children of this node, in left-to-right order.
96 final T node;
99 InOrderNode(T node) {
100 this.node = checkNotNull(node);
119 pushIfPresent(rightChild(inOrderNode.node));
    [all...]
  /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/page/
MethodItemTest.java 30 private MethodCoverageImpl node; field in class:MethodItemTest
34 node = new MethodCoverageImpl("test", "()V", null);
39 final MethodItem item = new MethodItem(node, "test()", null);
40 assertSame(node, item.getNode());
45 final MethodItem item = new MethodItem(node, "test()", null);
51 final MethodItem item = new MethodItem(node, "test()", null);
57 final MethodItem item = new MethodItem(node, "test()", null);
63 final MethodItem item = new MethodItem(node, "test()", new SourceLink());
69 node.increment(CounterImpl.COUNTER_1_0, CounterImpl.COUNTER_0_0, 15);
70 final MethodItem item = new MethodItem(node, "test()", new SourceLink())
    [all...]
  /external/v8/src/compiler/
js-frame-specialization.cc 15 Reduction JSFrameSpecialization::Reduce(Node* node) {
16 switch (node->opcode()) {
18 return ReduceOsrValue(node);
20 return ReduceParameter(node);
28 Reduction JSFrameSpecialization::ReduceOsrValue(Node* node) {
29 DCHECK_EQ(IrOpcode::kOsrValue, node->opcode());
31 int const index = OpParameter<int>(node);
47 Reduction JSFrameSpecialization::ReduceParameter(Node* node)
    [all...]
js-typed-lowering.cc 11 #include "src/compiler/node-matchers.h"
12 #include "src/compiler/node-properties.h"
29 AllocationBuilder(JSGraph* jsgraph, Node* effect, Node* control)
45 void Store(const FieldAccess& access, Node* value) {
51 void Store(ElementAccess const& access, Node* index, Node* value) {
74 void FinishAndChange(Node* node) {
75 NodeProperties::SetType(allocation_, NodeProperties::GetType(node));
    [all...]
representation-change.cc 114 Node* RepresentationChanger::GetRepresentationFor(
115 Node* node, MachineRepresentation output_rep, Type* output_type,
119 return TypeError(node, output_rep, output_type, use_rep);
123 return node;
130 return node;
134 return GetTaggedRepresentationFor(node, output_rep, output_type);
136 return GetFloat32RepresentationFor(node, output_rep, output_type,
139 return GetFloat64RepresentationFor(node, output_rep, output_type,
142 return GetBitRepresentationFor(node, output_rep, output_type)
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/xml/etree/
ElementInclude.py 111 node = loader(href, parse)
112 if node is None:
116 node = copy.copy(node)
118 node.tail = (node.tail or "") + e.tail
119 elem[i] = node
127 node = elem[i-1]
128 node.tail = (node.tail or "") + text + (e.tail or ""
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/xml/etree/
ElementInclude.py 111 node = loader(href, parse)
112 if node is None:
116 node = copy.copy(node)
118 node.tail = (node.tail or "") + e.tail
119 elem[i] = node
127 node = elem[i-1]
128 node.tail = (node.tail or "") + text + (e.tail or ""
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/etree/
ElementInclude.py 111 node = loader(href, parse)
112 if node is None:
116 node = copy.copy(node)
118 node.tail = (node.tail or "") + e.tail
119 elem[i] = node
127 node = elem[i-1]
128 node.tail = (node.tail or "") + text + (e.tail or ""
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/etree/
ElementInclude.py 111 node = loader(href, parse)
112 if node is None:
116 node = copy.copy(node)
118 node.tail = (node.tail or "") + e.tail
119 elem[i] = node
127 node = elem[i-1]
128 node.tail = (node.tail or "") + text + (e.tail or ""
    [all...]
  /external/mesa3d/src/mesa/main/
APIspec.py 43 node = self.spec_node.children
44 while node:
45 if node.type == "element":
46 if node.name == "template":
47 self.tmpl_nodes[node.prop("name")] = node
48 elif node.name == "api":
49 self.api_nodes[node.prop("name")] = node
51 raise SpecError("unexpected node %s in apispec"
    [all...]

Completed in 1484 milliseconds

<<21222324252627282930>>