HomeSort by relevance Sort by last modified time
    Searched refs:Node (Results 451 - 475 of 3612) sorted by null

<<11121314151617181920>>

  /external/v8/src/compiler/
common-node-cache.cc 5 #include "src/compiler/common-node-cache.h"
8 #include "src/compiler/node.h"
14 Node** CommonNodeCache::FindExternalConstant(ExternalReference value) {
19 Node** CommonNodeCache::FindHeapConstant(Handle<HeapObject> value) {
24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) {
control-flow-optimizer.cc 9 #include "src/compiler/node-matchers.h"
10 #include "src/compiler/node-properties.h"
31 Node* node = queue_.front(); local
33 if (node->IsDead()) continue;
34 switch (node->opcode()) {
36 VisitBranch(node);
39 VisitNode(node);
46 void ControlFlowOptimizer::Enqueue(Node* node) {
    [all...]
graph-trimmer.h 8 #include "src/compiler/node-marker.h"
19 // Trims dead nodes from the node graph.
33 Node* const node = *begin++; local
34 if (!node->IsDead()) MarkAsLive(node);
40 V8_INLINE bool IsLive(Node* const node) { return is_live_.Get(node); }
41 V8_INLINE void MarkAsLive(Node* const node)
    [all...]
  /frameworks/base/tools/incident_report/
generic_message.h 45 struct Node {
61 typedef multimap<int32_t,Node>::const_iterator const_iterator;
67 multimap<int,Node> mNodes;
  /libcore/dom/src/test/java/org/w3c/domts/level1/core/
hc_attrgetvalue1.java 59 Node testNode;
64 Node retval;
65 Node lastChild;
hc_nodeappendchildgetnodename.java 31 * The "appendChild(newChild)" method returns the node
34 * Append a newly created node to the child list of the
66 Node employeeNode;
68 Node newChild;
69 Node appendNode;
hc_nodeclonegetparentnull.java 31 * The duplicate node returned by the "cloneNode(deep)"
36 * duplicate node returned should return null when the
65 Node employeeNode;
66 Node clonedNode;
67 Node parentNode;
hc_nodeclonetruecopytext.java 36 * duplicate node returned by the method should copy
37 * any text data contained in this node.
66 Node childNode;
67 Node clonedNode;
68 Node lastChildNode;
hc_nodegetnextsiblingnull.java 31 * If there is not a node immediately following this node the
64 Node employeeNode;
65 Node lcNode;
66 Node nsNode;
hc_nodegetprevioussiblingnull.java 31 * If there is not a node immediately preceding this node the
64 Node employeeNode;
65 Node fcNode;
66 Node psNode;
hc_noderemovechild.java 31 * The "removeChild(oldChild)" method removes the child node
37 * node returned by the "getParentNode()" method. It
68 Node childToRemove;
69 Node removedChild;
70 Node parentNode;
hc_noderemovechildoldchildnonexistent.java 33 * not a child of this node.
36 * node that is not one of its children. An attempt to
37 * remove such a node should raise the desired exception.
68 Node oldChild;
70 Node elementNode;
71 Node removedChild;
nodeappendchildgetnodename.java 31 * The "appendChild(newChild)" method returns the node
34 * Append a newly created node to the child list of the
66 Node employeeNode;
68 Node newChild;
69 Node appendNode;
nodeappendchildnodeancestor.java 32 * HIERARCHY_REQUEST_ERR DOMException if the node to
33 * append is one of this node's ancestors.
36 * an ancestor node(root node) to it.
70 Node newChild;
72 Node employeeNode;
73 Node appendedChild;
nodeappendchildnomodificationallowederrEE.java 33 * if the node is readonly.
67 Node entRef;
68 Node createdNode;
69 Node appendedNode;
nodechildnodesempty.java 32 * that contains all children of this node. If there
35 * Retrieve the Text node from the second child of the second
66 Node employeeNode;
68 Node secondCNode;
69 Node textNode;
nodeclonegetparentnull.java 31 * The duplicate node returned by the "cloneNode(deep)"
36 * duplicate node returned should return null when the
66 Node employeeNode;
67 Node clonedNode;
68 Node parentNode;
nodeclonetruecopytext.java 33 * duplicate node returned by the method should copy
34 * any text data contained in this node.
64 Node childNode;
65 Node clonedNode;
66 Node lastChildNode;
nodegetnextsiblingnull.java 31 * If there is not a node immediately following this node the
65 Node employeeNode;
66 Node lcNode;
67 Node nsNode;
nodegetprevioussiblingnull.java 31 * If there is not a node immediately preceding this node the
65 Node employeeNode;
66 Node fcNode;
67 Node psNode;
nodehaschildnodesfalse.java 31 * The "hasChildNodes()" method returns false if the node
34 * Retrieve the Text node inside the first child of the
66 Node child;
68 Node employeeNode;
69 Node textNode;
nodelistindexgetlengthofemptylist.java 34 * Create a list of all the children of the Text node
66 Node employeeNode;
68 Node childNode;
69 Node textNode;
noderemovechild.java 31 * The "removeChild(oldChild)" method removes the child node
37 * node returned by the "getParentNode()" method. It
68 Node childToRemove;
69 Node removedChild;
70 Node parentNode;
noderemovechildnomodificationallowederrEE.java 33 * if the node is readonly.
67 Node entRef;
68 Node entText;
69 Node removedNode;
noderemovechildoldchildnonexistent.java 33 * not a child of this node.
36 * node that is not one of its children. An attempt to
37 * remove such a node should raise the desired exception.
69 Node oldChild;
71 Node elementNode;
72 Node removedChild;

Completed in 906 milliseconds

<<11121314151617181920>>