| /external/v8/src/compiler/ |
| js-builtin-reducer.h | 45 Reduction Reduce(Node* node) final;
48 Reduction ReduceArrayIterator(Node* node, IterationKind kind);
49 Reduction ReduceTypedArrayIterator(Node* node, IterationKind kind);
50 Reduction ReduceArrayIterator(Handle<Map> receiver_map, Node* node,
53 Reduction ReduceArrayIteratorNext(Node* node);
[all...] |
| ast-graph-builder.h | 28 class Node;
48 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
49 Node* NewIfFalse() { return NewNode(common()->IfFalse()); }
50 Node* NewMerge() { return NewNode(common()->Merge(1), true); }
51 Node* NewLoop() { return NewNode(common()->Loop(1), true); }
52 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) {
57 #define DECLARE_VISIT(type) virtual void Visit##type(type* node);
95 SetOncePointer<Node> function_closure_;
96 SetOncePointer<Node> function_context_
[all...] |
| js-typed-lowering.h | 45 Reduction Reduce(Node* node) final;
50 Reduction ReduceJSAdd(Node* node);
51 Reduction ReduceJSComparison(Node* node);
52 Reduction ReduceJSLoadNamed(Node* node);
53 Reduction ReduceJSLoadProperty(Node* node);
[all...] |
| memory-optimizer.h | 21 class Node;
25 // out-of-line data associated with each node.
44 AllocationGroup(Node* node, PretenureFlag pretenure, Zone* zone);
45 AllocationGroup(Node* node, PretenureFlag pretenure, Node* size,
49 void Add(Node* object);
50 bool Contains(Node* object) const;
54 Node* size() const { return size_;
104 Node* node; member in struct:v8::internal::compiler::final::Token
[all...] |
| common-operator-reducer.h | 32 Reduction Reduce(Node* node) final;
35 Reduction ReduceBranch(Node* node);
36 Reduction ReduceDeoptimizeConditional(Node* node);
37 Reduction ReduceMerge(Node* node);
38 Reduction ReduceEffectPhi(Node* node);
[all...] |
| escape-analysis-reducer.h | 27 Reduction Reduce(Node* node) final;
36 Reduction ReduceNode(Node* node);
37 Reduction ReduceLoad(Node* node);
38 Reduction ReduceStore(Node* node);
39 Reduction ReduceAllocate(Node* node);
[all...] |
| code-assembler.h | 37 class Node;
212 Node* Int32Constant(int32_t value);
213 Node* Int64Constant(int64_t value);
214 Node* IntPtrConstant(intptr_t value);
215 Node* NumberConstant(double value);
216 Node* SmiConstant(Smi* value);
217 Node* SmiConstant(int value);
218 Node* HeapConstant(Handle<HeapObject> object);
219 Node* CStringConstant(const char* str);
220 Node* BooleanConstant(bool value)
[all...] |
| dead-code-elimination.h | 31 Reduction Reduce(Node* node) final;
34 Reduction ReduceEnd(Node* node);
35 Reduction ReduceLoopOrMerge(Node* node);
36 Reduction ReduceLoopExit(Node* node);
37 Reduction ReduceNode(Node* node);
[all...] |
| bytecode-graph-builder.h | 42 // Get or create the node that represents the outer function closure.
43 Node* GetFunctionClosure();
45 // Get or create the node that represents the outer function context.
46 Node* GetFunctionContext();
48 // Get or create the node that represents the incoming new target value.
49 Node* GetNewTarget();
52 Node* BuildLoadNativeContextField(int index);
62 // Node creation helpers
63 Node* NewNode(const Operator* op, bool incomplete = false) {
64 return MakeNode(op, 0, static_cast<Node**>(nullptr), incomplete)
[all...] |
| branch-elimination.h | 26 Reduction Reduce(Node* node) final;
30 Node* condition;
34 BranchCondition(Node* condition, bool is_true, BranchCondition* next)
43 Maybe<bool> LookupCondition(Node* condition) const;
45 const ControlPathConditions* AddCondition(Zone* zone, Node* condition,
65 // Maps each control node to the condition information known about the node.
72 const ControlPathConditions* Get(Node* node);
[all...] |
| redundancy-elimination.h | 19 Reduction Reduce(Node* node) final;
23 Check(Node* node, Check* next) : node(node), next(next) {}
24 Node* node; member in struct:v8::internal::compiler::final::Check
35 EffectPathChecks const* AddCheck(Zone* zone, Node* node) const
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/ |
| UserDataNotification.java | 14 import org.w3c.dom.Node;
25 private final Node src;
26 private final Node dst;
35 Node src,
36 Node dst) {
76 public final Node getSrc() {
85 public final Node getDst() {
|
| /external/tensorflow/tensorflow/core/graph/ |
| testlib.cc | 58 Node* Send(Graph* g, Node* input, const string& tensor, const string& sender,
60 Node* ret;
72 Node* Recv(Graph* g, const string& tensor, const string& type,
75 Node* ret;
89 Node* Constant(Graph* g, const Tensor& tensor) {
90 Node* ret;
98 Node* Constant(Graph* g, const Tensor& tensor, const string& name) {
99 Node* ret;
107 Node* HostConstant(Graph* g, const Tensor& tensor)
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ |
| Node.java | 16 * The <code>Node</code> interface is the primary datatype for the entire
17 * Document Object Model. It represents a single node in the document tree.
18 * While all objects implementing the <code>Node</code> interface expose
20 * <code>Node</code> interface may have children. For example,
24 * <code>attributes</code> are included as a mechanism to get at node
34 * node type as follows:
130 * of the text node</td>
136 public interface Node {
139 * The node is an <code>Element</code>.
143 * The node is an <code>Attr</code>
[all...] |
| /external/perfetto/src/traced/probes/filesystem/ |
| prefix_finder.h | 48 class Node {
51 Node(std::string name, Node* parent) : name_(name), parent_(parent) {}
53 Node(const Node& that) = delete;
54 Node& operator=(const Node&) = delete;
65 bool operator()(const Node& one, const Node& other) const {
70 // Add a new child to this node
[all...] |
| /external/v8/src/builtins/ |
| builtins-async-iterator.cc | 28 void ThrowIfNotAsyncFromSyncIterator(Node* const context, Node* const object,
33 typedef std::function<void(Node* const context, Node* const promise,
37 Node* const context, Node* const iterator, Node* const sent_value,
41 Node* const initial_exception_value = nullptr);
43 Node* AllocateAsyncIteratorValueUnwrapContext(Node* native_context
[all...] |
| builtins-async-function.cc | 14 typedef compiler::Node Node;
24 void AsyncFunctionAwait(Node* const context, Node* const generator,
25 Node* const awaited, Node* const outer_promise,
29 Node* const context, Node* const sent_value,
46 Node* context, Node* sent_value
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachinePassRegistry.cpp | 36 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) {
37 Node->setNext(List);
38 List = Node;
39 if (Listener) Listener->NotifyAdd(Node->getName(),
40 Node->getCtor(),
41 Node->getDescription());
47 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) {
49 if (*I == Node) {
50 if (Listener) Listener->NotifyRemove(Node->getName());
|
| /external/valgrind/memcheck/tests/ |
| leak-cases.c | 46 } Node;
48 Node* mk(Node* next)
52 Node* x = malloc(2 * sizeof(Node));
58 Node* p1;
59 Node* p2;
60 Node* p3;
61 Node* p4;
62 Node* p5
[all...] |
| /external/v8/src/interpreter/ |
| interpreter-intrinsics.cc | 14 using compiler::Node;
65 Node* IntrinsicsHelper::InvokeIntrinsic(Node* function_id, Node* context,
66 Node* first_arg_reg, Node* arg_count) {
107 Node* IntrinsicsHelper::CompareInstanceType(Node* object, int type,
109 Node* instance_type = __ LoadInstanceType(object);
119 Node* IntrinsicsHelper::IsInstanceType(Node* input, int type)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SDNodeOrdering.h | 36 void add(const SDNode *Node, unsigned O) {
37 OrderMap[Node] = O;
39 void remove(const SDNode *Node) {
40 DenseMap<const SDNode*, unsigned>::iterator Itr = OrderMap.find(Node);
47 unsigned getOrder(const SDNode *Node) {
48 return OrderMap[Node];
|
| ScheduleDAGSDNodes.h | 50 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
52 static bool isPassiveNode(SDNode *Node) {
53 if (isa<ConstantSDNode>(Node)) return true;
54 if (isa<ConstantFPSDNode>(Node)) return true;
55 if (isa<RegisterSDNode>(Node)) return true;
56 if (isa<GlobalAddressSDNode>(Node)) return true;
57 if (isa<BasicBlockSDNode>(Node)) return true;
58 if (isa<FrameIndexSDNode>(Node)) return true;
59 if (isa<ConstantPoolSDNode>(Node)) return true;
60 if (isa<JumpTableSDNode>(Node)) return true
[all...] |
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| DOMSource.java | 23 import org.w3c.dom.Node;
41 * <p><code>Node</code> to serve as DOM source.</p>
43 private Node node; field in class:DOMSource
60 * no DOM source is set using {@link #setNode(Node node)} , then the
70 * Create a new input source with a DOM node. The operation
71 * will be applied to the subtree rooted at this node. In XSLT,
74 * from the root node also.
76 * @param n The DOM node that will contain the Source tree
[all...] |
| DOMResult.java | 23 import org.w3c.dom.Node;
28 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation,
45 * <p><code>node</code>,
57 * <p>Use a DOM node to create a new output target.</p>
59 * <p>In practice, the node should be
60 * a {@link org.w3c.dom.Document} node,
61 * a {@link org.w3c.dom.DocumentFragment} node, or
62 * a {@link org.w3c.dom.Element} node.
63 * In other words, a node that accepts children.</p>
69 * @param node The DOM node that will contain the result tree
337 private Node node = null; field in class:DOMResult
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeListBase.java | 22 import org.w3c.dom.Node;
66 * @return The node at the <code>index</code>th position in the
70 public Node item(int index) {
75 * The number of nodes in the list. The range of valid child node indices
|
