Searched refs:Node (Results 1 - 25 of 1596) sorted by relevance

1234567891011>>

/external/chromium_org/v8/src/compiler/
H A Dnode-properties.h20 static inline Node* GetValueInput(Node* node, int index);
21 static inline Node* GetContextInput(Node* node);
22 static inline Node* GetFrameStateInput(Node* node);
23 static inline Node* GetEffectInput(Node* node, int index = 0);
24 static inline Node* GetControlInput(Node* nod
[all...]
H A Dgraph-unittest.h33 Node* Parameter(int32_t index);
34 Node* Float32Constant(volatile float value);
35 Node* Float64Constant(volatile double value);
36 Node* Int32Constant(int32_t value);
37 Node* Int64Constant(int64_t value);
38 Node* NumberConstant(volatile double value);
39 Node* HeapConstant(const Unique<HeapObject>& value);
40 Node* FalseConstant();
41 Node* TrueConstant();
43 Matcher<Node*> IsFalseConstan
[all...]
H A Draw-machine-assembler.h59 Node* UndefinedConstant() {
66 Node* PointerConstant(void* value) {
69 Node* IntPtrConstant(intptr_t value) {
74 Node* Int32Constant(int32_t value) {
77 Node* Int64Constant(int64_t value) {
80 Node* NumberConstant(double value) {
83 Node* Float64Constant(double value) {
86 Node* HeapConstant(Handle<Object> object) {
91 Node* Projection(int index, Node*
[all...]
H A Dchange-lowering.h26 virtual Reduction Reduce(Node* node) OVERRIDE;
29 Node* HeapNumberValueIndexConstant();
30 Node* SmiMaxValueConstant();
31 Node* SmiShiftBitsConstant();
33 Node* AllocateHeapNumberWithValue(Node* value, Node* control);
34 Node* ChangeSmiToInt32(Node* value);
35 Node* LoadHeapNumberValu
[all...]
H A Dgraph.h23 class Graph : public GenericGraph<Node> {
28 Node* NewNode(const Operator* op, int input_count, Node** inputs);
31 Node* NewNode(const Operator* op) {
32 return NewNode(op, 0, static_cast<Node**>(NULL));
34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
35 Node* NewNode(const Operator* op, Node* n1, Node* n
[all...]
H A Dgraph-builder.h19 class Node;
27 Node* NewNode(const Operator* op) {
28 return MakeNode(op, 0, static_cast<Node**>(NULL));
31 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); }
33 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
34 Node* buffer[] = {n1, n2};
38 Node* NewNod
[all...]
H A Dsimplified-lowering.h25 void DoLoadField(Node* node);
26 void DoStoreField(Node* node);
27 void DoLoadElement(Node* node);
28 void DoStoreElement(Node* node);
29 void DoStringAdd(Node* node);
30 void DoStringEqual(Node* node);
31 void DoStringLessThan(Node* node);
32 void DoStringLessThanOrEqual(Node* node);
37 Node* SmiTag(Node* nod
[all...]
/external/chromium_org/third_party/WebKit/Source/core/inspector/
H A DInspectorNodeIds.h10 class Node;
14 static int idForNode(Node*);
15 static Node* nodeForId(int);
/external/chromium_org/v8/test/mjsunit/
H A Dthis-property-assignment.js31 function Node() { class
37 var n1 = new Node();
40 var n2 = new Node();
/external/clang/test/CXX/expr/expr.post/expr.ref/
H A Dp3.cpp4 template<typename T> struct Node { struct
8 Node<T> n[1];
14 Node<int> n;
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DNodeTraversal.h30 #include "core/dom/Node.h"
40 static Node* next(const Node& current) { return traverseNextTemplate(current); }
41 static Node* next(const ContainerNode& current) { return traverseNextTemplate(current); }
42 static Node* next(const Node& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
43 static Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNextTemplate(current, stayWithin); }
46 static Node* nextSkippingChildre
[all...]
H A DNodeRenderingTraversal.h58 ContainerNode* parent(const Node*, ParentDetails* = 0);
59 bool contains(const ContainerNode*, const Node*);
60 Node* nextSibling(const Node*);
61 Node* previousSibling(const Node*);
62 Node* previous(const Node*, const Node* stayWithin);
63 Node* nex
[all...]
H A DTreeWalker.h43 static PassRefPtrWillBeRawPtr<TreeWalker> create(PassRefPtrWillBeRawPtr<Node> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter)
48 Node* currentNode() const { return m_current.get(); }
49 void setCurrentNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&);
51 Node* parentNode(ExceptionState&);
52 Node* firstChild(ExceptionState&);
53 Node* lastChild(ExceptionState&);
54 Node* previousSibling(ExceptionState&);
55 Node* nextSibling(ExceptionState&);
56 Node* previousNode(ExceptionState&);
57 Node* nextNod
[all...]
H A DNodeTraversal.cpp32 Node* NodeTraversal::previousIncludingPseudo(const Node& current, const Node* stayWithin)
36 if (Node* previous = current.pseudoAwarePreviousSibling()) {
44 Node* NodeTraversal::nextIncludingPseudo(const Node& current, const Node* stayWithin)
46 if (Node* next = current.pseudoAwareFirstChild())
50 if (Node* next = current.pseudoAwareNextSibling())
52 for (Node* paren
[all...]
H A DWeakNodeMap.h14 class Node;
21 void put(Node*, int value);
22 int value(Node*);
23 Node* node(int value);
26 // FIXME: This should not be friends with Node, we should expose a proper API and not
28 friend class Node;
29 static void notifyNodeDestroyed(Node*);
32 void nodeDestroyed(Node*);
34 typedef HashMap<Node*, int> NodeToValue;
36 typedef HashMap<int, Node*> ValueToNod
[all...]
H A DTreeWalker.idl26 readonly attribute Node root;
30 [RaisesException=Setter] attribute Node currentNode;
32 [RaisesException] Node parentNode();
33 [RaisesException] Node firstChild();
34 [RaisesException] Node lastChild();
35 [RaisesException] Node previousSibling();
36 [RaisesException] Node nextSibling();
37 [RaisesException] Node previousNode();
38 [RaisesException] Node nextNode();
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathUtil.h34 class Node;
39 bool isRootDomNode(Node*);
42 String stringValue(Node*);
45 bool isValidContextNode(Node*);
H A DXPathUtil.cpp37 bool isRootDomNode(Node* node)
42 String stringValue(Node* node)
45 case Node::ATTRIBUTE_NODE:
46 case Node::PROCESSING_INSTRUCTION_NODE:
47 case Node::COMMENT_NODE:
48 case Node::TEXT_NODE:
49 case Node::CDATA_SECTION_NODE:
56 for (Node* n = node->firstChild(); n; n = NodeTraversal::next(*n, node)) {
70 bool isValidContextNode(Node* node)
75 case Node
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-99167.js30 eval("function Node() { this.a = 1; this.a = 3; }");
31 new Node;
33 for (var i = 0; i < 100000; ++i) new Node;
/external/chromium_org/third_party/skia/include/xml/
H A DSkDOM.h25 typedef SkDOMNode Node; typedef in class:SkDOM
30 const Node* build(const char doc[], size_t len);
31 const Node* copy(const SkDOM& dom, const Node* node);
33 const Node* getRootNode() const;
39 Type getType(const Node*) const;
41 const char* getName(const Node*) const;
42 const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
43 const Node* getNextSiblin
[all...]
/external/skia/include/xml/
H A DSkDOM.h25 typedef SkDOMNode Node; typedef in class:SkDOM
30 const Node* build(const char doc[], size_t len);
31 const Node* copy(const SkDOM& dom, const Node* node);
33 const Node* getRootNode() const;
39 Type getType(const Node*) const;
41 const char* getName(const Node*) const;
42 const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
43 const Node* getNextSiblin
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dsimplified-graph-builder.h35 void Return(Node* value);
40 Node* PointerConstant(void* value) {
45 Node* Int32Constant(int32_t value) {
48 Node* HeapConstant(Handle<Object> object) {
53 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); }
55 Node* NumberEqual(Node* a, Node* b) {
58 Node* NumberLessTha
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/src/org/chromium/devtools/jsdoc/
H A DDoDidNodeVisitor.java3 import com.google.javascript.rhino.Node;
10 void doVisit(Node node);
17 void didVisit(Node node);
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/
H A DComposedTreeWalker.h36 class Node;
50 ComposedTreeWalker(const Node*, StartPolicy = CannotStartFromShadowBoundary);
52 Node* get() const { return const_cast<Node*>(m_node.get()); }
65 Node* traverseParent(const Node*, ParentTraversalDetails* = 0) const;
68 ComposedTreeWalker(const Node*, ParentTraversalDetails*);
92 static Node* traverseNode(const Node*, TraversalDirection);
93 static Node* traverseLightChildre
[all...]
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DNodeConsumer.java23 import org.w3c.dom.Node;
39 public void setOriginatingNode(Node n);

Completed in 560 milliseconds

1234567891011>>