| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| Token.java | 3 package com.google.clearsilver.jsilver.syntax.node;
6 public abstract class Token extends Node
49 void removeChild(@SuppressWarnings("unused") Node child)
55 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| /external/libcxx/test/libcxx/containers/associative/ |
| tree_left_rotate.pass.cpp | 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node* __parent_unsafe() const { return __parent_; }
27 void __set_parent(Node* x) { __parent_ = x;}
29 Node() : __left_(), __right_(), __parent_() {}
35 Node root;
36 Node x;
37 Node y
[all...] |
| tree_right_rotate.pass.cpp | 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node* __parent_unsafe() const { return __parent_; }
27 void __set_parent(Node* x) { __parent_ = x;}
29 Node() : __left_(), __right_(), __parent_() {}
35 Node root;
36 Node x;
37 Node y
[all...] |
| /external/skia/src/core/ |
| SkSinglyLinkedList.h | 15 struct Node;
22 Node* node = fHead; local
23 while (node) {
24 Node* next = node->fNext;
25 SkASSERT(next != nullptr || node == fTail);
26 delete node;
27 node = next;
38 for (Node* node = fHead; node; node = node->fNext)
[all...] |
| /external/v8/src/builtins/ |
| builtins-symbol.cc | 73 typedef compiler::Node Node;
76 Node* receiver = assembler.Parameter(0);
77 Node* context = assembler.Parameter(4);
79 Node* result =
88 typedef compiler::Node Node;
91 Node* receiver = assembler.Parameter(0);
92 Node* context = assembler.Parameter(3);
94 Node* value = assembler.ToThisValue(context, receiver, PrimitiveType::kSymbol
[all...] |
| builtins-boolean.cc | 42 typedef compiler::Node Node;
45 Node* receiver = assembler.Parameter(0);
46 Node* context = assembler.Parameter(3);
48 Node* value = assembler.ToThisValue(
50 Node* result = assembler.LoadObjectField(value, Oddball::kToStringOffset);
57 typedef compiler::Node Node;
60 Node* receiver = assembler.Parameter(0);
61 Node* context = assembler.Parameter(3)
[all...] |
| /external/v8/src/compiler/ |
| all-nodes.h | 8 #include "src/compiler/node.h"
22 AllNodes(Zone* local_zone, Node* end, const Graph* graph,
25 // reachable from the End node.
28 bool IsLive(Node* node) {
30 return IsReachable(node);
33 bool IsReachable(Node* node) {
34 if (!node) return false;
35 size_t id = node->id()
[all...] |
| js-frame-specialization.h | 28 Reduction Reduce(Node* node) final;
31 Reduction ReduceOsrValue(Node* node);
32 Reduction ReduceOsrGuard(Node* node);
33 Reduction ReduceParameter(Node* node);
|
| js-type-hint-lowering.h | 32 Reduction ReduceBinaryOperation(const Operator* op, Node* left, Node* right,
33 Node* effect, Node* control,
|
| value-numbering-reducer.h | 22 Reduction Reduce(Node* node) override;
27 Reduction ReplaceIfTypesMatch(Node* node, Node* replacement);
32 Node** entries_;
|
| effect-control-linearizer.cc | 12 #include "src/compiler/node-matchers.h"
13 #include "src/compiler/node-properties.h"
14 #include "src/compiler/node.h"
45 Node* current_effect = nullptr; // New effect.
46 Node* current_control = nullptr; // New control.
47 Node* current_frame_state = nullptr; // New frame state.
71 Node* effect_phi;
74 PendingEffectPhi(Node* effect_phi, BasicBlock* block)
78 void UpdateEffectPhi(Node* node, BasicBlock* block
335 Node* node = block->NodeAt(instr); local
439 Node* node = block->NodeAt(instr); local
[all...] |
| instruction-selector.h | 14 #include "src/compiler/node.h"
36 PushParameter(Node* node, MachineType type) : node_(node), type_(type) {}
38 Node* node() const { return node_; } function in class:v8::internal::compiler::PushParameter
42 Node* node_;
118 DeoptimizeReason reason, Node* frame_state);
122 Node* frame_state);
126 DeoptimizeReason reason, Node* frame_state)
[all...] |
| js-builtin-reducer.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
28 explicit JSCallReduction(Node* node) : node_(node) {}
30 // Determines whether the node is a JSCall operation that targets a
78 Node* receiver() { return NodeProperties::GetValueInput(node_, 1); }
79 Node* left() { return GetJSCallInput(0); }
80 Node* right() { return GetJSCallInput(1); }
88 Node* GetJSCallInput(int index)
[all...] |
| representation-change.h | 106 // The {UseInfo} class is used to describe a use of an input of a node.
110 // 1. During propagation, the use info is used to inform the input node
236 Node* GetRepresentationFor(Node* node, MachineRepresentation output_rep,
237 Type* output_type, Node* use_node,
265 Node* GetTaggedSignedRepresentationFor(Node* node,
267 Type* output_type, Node* use_node
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ |
| DOMLocator.java | 47 * The node this locator is pointing to, or <code>null</code> if no node
50 public Node getRelatedNode();
|
| ProcessingInstruction.java | 27 public interface ProcessingInstruction extends Node {
46 * NO_MODIFICATION_ALLOWED_ERR: Raised when the node is readonly.
|
| /libcore/luni/src/main/java/org/w3c/dom/ls/ |
| LSSerializer.java | 17 import org.w3c.dom.Node;
28 * <code>namespaceURI</code> of a <code>Node</code> is empty string, the
31 * <p> <code>LSSerializer</code> accepts any node type for serialization. For
35 * was created). The serialized output for these node types is either as a
46 * <code>Document</code> node serializes the entire document.
61 * corresponding <code>Entity</code> node or the corresponding
83 * <li> All other node types (Element, Text,
87 * <p ><b>Note:</b> The serialization of a <code>Node</code> does not always
112 * "wf-invalid-character-in-node-name" (as proposed in "<a href='http://www.w3.org/TR/DOM-Level-3-Core/core.html#parameter-well-formed'>
151 * errors and warnings that can occur while serializing a DOM node, but som
[all...] |
| /external/v8/src/interpreter/ |
| interpreter-assembler.cc | 25 using compiler::Node;
67 Node* InterpreterAssembler::GetInterpretedFramePointer() {
78 Node* InterpreterAssembler::GetAccumulatorUnchecked() {
82 Node* InterpreterAssembler::GetAccumulator() {
88 void InterpreterAssembler::SetAccumulator(Node* value) {
94 Node* InterpreterAssembler::GetContext() {
98 void InterpreterAssembler::SetContext(Node* value) {
102 Node* InterpreterAssembler::GetContextAtDepth(Node* context, Node* depth)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTMdefaultNamespaceDeclarationNode.java | 30 import org.w3c.dom.Node;
37 * DOM2DTM model. Basically, it creates a proxy node in DOM space to
49 * %REVIEW% An alternative solution would be to create the node _only_
80 public Node getParentNode() {return null;}
81 public Node getFirstChild() {return null;}
82 public Node getLastChild() {return null;}
83 public Node getPreviousSibling() {return null;}
84 public Node getNextSibling() {return null;}
89 public short getNodeType() {return Node.ATTRIBUTE_NODE;}
93 public Node insertBefore(Node a, Node b) {throw new DTMException(NOT_SUPPORTED_ERR);
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| RegionIterator.h | 50 PointerIntPair<NodeType*, 2, enum ItMode> Node;
55 // advanceRegionSucc - A region node has only one successor. It reaches end
58 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
59 Node.setInt(ItRgEnd);
62 NodeType* getNode() const{ return Node.getPointer(); }
65 bool isRegionMode() const { return Node.getInt() != ItBB; }
78 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
92 inline RNSuccIterator(NodeType* node)
93 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /external/llvm/lib/Target/BPF/ |
| BPFISelDAGToDAG.cpp | 76 // If the first operand is a FI, get the TargetFI Node
104 // If the first operand is a FI, get the TargetFI Node
118 void BPFDAGToDAGISel::Select(SDNode *Node) {
119 unsigned Opcode = Node->getOpcode();
121 // Dump information about the Node being selected
122 DEBUG(dbgs() << "Selecting: "; Node->dump(CurDAG); dbgs() << '\n');
124 // If we have a custom node, we already have selected!
125 if (Node->isMachineOpcode()) {
126 DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
135 const DebugLoc &DL = Node->getDebugLoc()
[all...] |
| /external/v8/src/ic/ |
| keyed-store-generic.cc | 18 using compiler::Node;
34 void EmitGenericElementStore(Node* receiver, Node* receiver_map,
35 Node* instance_type, Node* intptr_index,
36 Node* value, Node* context, Label* slow);
38 void EmitGenericPropertyStore(Node* receiver, Node* receiver_map,
42 void BranchIfPrototypesHaveNonFastElements(Node* receiver_map
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 34 static std::string getSimpleNodeLabel(const BasicBlock *Node,
36 if (!Node->getName().empty())
37 return Node->getName().str();
42 Node->printAsOperand(OS, false);
46 static std::string getCompleteNodeLabel(const BasicBlock *Node,
52 if (Node->getName().empty()) {
53 Node->printAsOperand(OS, false);
57 OS << *Node;
91 std::string getNodeLabel(const BasicBlock *Node,
94 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /external/llvm/unittests/ADT/ |
| ilistTest.cpp | 20 struct Node : ilist_node<Node> {
23 Node() {}
24 Node(int Value) : Value(Value) {}
25 Node(const Node&) = default;
26 ~Node() { Value = -1; }
30 ilist<Node> List;
31 List.push_back(Node(1));
36 List.push_back(Node(2))
[all...] |
| /external/v8/src/ |
| code-stub-assembler.cc | 12 using compiler::Node;
22 // FLAG_csa_trap_on_node should be in a form "STUB,NODE" where STUB is a
23 // string specifying the name of a stub and NODE is number specifying node id.
40 // Bad node id.
58 Node* condition = codition_body();
83 Node* CodeStubAssembler::Select(Node* condition, const NodeGenerator& true_body,
105 Node* CodeStubAssembler::SelectConstant(Node* condition, Node* true_value
[all...] |
