| /external/v8/src/compiler/ |
| effect-control-linearizer.h | 10 #include "src/compiler/node.h"
39 void ProcessNode(Node* node, Node** frame_state, Node** effect,
40 Node** control);
42 bool TryWireInStateEffect(Node* node, Node* frame_state, Node** effect
[all...] |
| escape-analysis.h | 31 Node* GetReplacement(Node* node);
32 Node* ResolveReplacement(Node* node);
33 bool IsVirtual(Node* node);
34 bool IsEscaped(Node* node);
[all...] |
| raw-machine-assembler.h | 13 #include "src/compiler/node.h"
66 Node* NullConstant() {
70 Node* UndefinedConstant() {
75 Node* PointerConstant(void* value) {
78 Node* IntPtrConstant(intptr_t value) {
83 Node* RelocatableIntPtrConstant(intptr_t value, RelocInfo::Mode rmode);
84 Node* Int32Constant(int32_t value) {
87 Node* StackSlot(MachineRepresentation rep) {
90 Node* Int64Constant(int64_t value) {
93 Node* NumberConstant(double value)
[all...] |
| graph.h | 19 class Node;
24 // Each node has a mark which is a monotonically increasing integer, and a
25 // {NodeMarker} has a range of values that indicate states of a node.
30 // out-of-line data associated with each node.
51 Node* const start_;
52 Node* const end_;
58 Node* NewNodeUnchecked(const Operator* op, int input_count,
59 Node* const* inputs, bool incomplete = false);
62 Node* NewNode(const Operator* op, int input_count, Node* const* inputs
[all...] |
| wasm-compiler.h | 25 class Node;
41 // Expose {Node} and {Graph} opaquely as {wasm::TFNode} and {wasm::TFGraph}.
42 typedef compiler::Node TFNode;
116 typedef ZoneVector<Node*> NodeVector;
123 Node** Buffer(size_t count) {
127 reinterpret_cast<Node**>(zone_->New(new_size * sizeof(Node*)));
136 Node* Error();
137 Node* Start(unsigned params);
138 Node* Param(unsigned index)
[all...] |
| node-properties.h | 8 #include "src/compiler/node.h"
21 // A facade that simplifies access to the different kinds of inputs to a node.
27 // 0 [ values, context, frame state, effects, control ] node->InputCount()
29 static int FirstValueIndex(Node* node) { return 0; }
30 static int FirstContextIndex(Node* node) { return PastValueIndex(node); }
31 static int FirstFrameStateIndex(Node* node) { return PastContextIndex(node);
[all...] |
| simplified-lowering.h | 10 #include "src/compiler/node.h"
31 void DoMax(Node* node, Operator const* op, MachineRepresentation rep);
32 void DoMin(Node* node, Operator const* op, MachineRepresentation rep);
33 void DoJSToNumberTruncatesToFloat64(Node* node,
35 void DoJSToNumberTruncatesToWord32(Node* node,
38 // representation analysis is stored in the node bounds
[all...] |
| machine-operator-reducer.h | 31 Reduction Reduce(Node* node) override;
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* Uint32Constant(uint32_t value) {
41 Node* Uint64Constant(uint64_t value) {
44 Node* Float64Mul(Node* lhs, Node* rhs)
[all...] |
| js-intrinsic-lowering.h | 40 Reduction Reduce(Node* node) final;
43 Reduction ReduceCreateIterResultObject(Node* node);
44 Reduction ReduceDebugIsActive(Node* node);
45 Reduction ReduceDeoptimizeNow(Node* node);
46 Reduction ReduceGeneratorClose(Node* node);
[all...] |
| graph-reducer.h | 9 #include "src/compiler/node-marker.h"
19 class Node;
23 // out-of-line data associated with each node.
27 // Represents the result of trying to reduce a node in the graph.
30 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {}
32 Node* replacement() const { return replacement_; }
36 Node* replacement_;
40 // A reducer can reduce or simplify a given node based on its operator and
49 // Try to reduce a node if possible.
50 virtual Reduction Reduce(Node* node) = 0
142 Node* node; member in class:v8::internal::compiler::GraphReducer::State
[all...] |
| js-create-lowering.h | 47 Reduction Reduce(Node* node) final;
50 Reduction ReduceJSCreate(Node* node);
51 Reduction ReduceJSCreateArguments(Node* node);
52 Reduction ReduceJSCreateArray(Node* node);
53 Reduction ReduceJSCreateIterResultObject(Node* node);
[all...] |
| /external/v8/src/builtins/ |
| builtins-arguments.h | 10 typedef compiler::Node Node;
19 Node* EmitFastNewStrictArguments(Node* context, Node* function);
20 Node* EmitFastNewSloppyArguments(Node* context, Node* function);
21 Node* EmitFastNewRestParameter(Node* context, Node* function)
[all...] |
| builtins-promise.h | 14 typedef compiler::Node Node;
58 Node* AllocateAndInitJSPromise(Node* context);
61 Node* AllocateAndInitJSPromise(Node* context, Node* parent);
65 Node* AllocateAndSetJSPromise(Node* context, Node* status, Node* result)
[all...] |
| builtins-regexp.h | 13 typedef compiler::Node Node;
22 void BranchIfFastRegExp(Node* const context, Node* const object,
23 Node* const map, Label* const if_isunmodified,
27 Node* FastLoadLastIndex(Node* regexp);
28 Node* SlowLoadLastIndex(Node* context, Node* regexp)
[all...] |
| builtins-constructor.h | 10 typedef compiler::Node Node;
19 Node* EmitFastNewClosure(Node* shared_info, Node* feedback_vector, Node* slot,
20 Node* context);
21 Node* EmitFastNewFunctionContext(Node* closure, Node* slots, Node* context
[all...] |
| builtins-async.h | 19 typedef std::function<Node*(Node*)> NodeGenerator1;
26 Node* Await(Node* context, Node* generator, Node* value, Node* outer_promise,
|
| builtins-object.h | 16 std::tuple<Node*, Node*, Node*> EmitForInPrepare(Node* object, Node* context,
21 void IsString(Node* object, Label* if_string, Label* if_notstring);
22 void ReturnToStringFormat(Node* context, Node* string);
|
| /external/v8/src/ |
| code-stub-assembler.h | 58 typedef compiler::Node Node;
92 Node* ParameterToWord(Node* value, ParameterMode mode) {
97 Node* WordToParameter(Node* value, ParameterMode mode) {
102 Node* ParameterToTagged(Node* value, ParameterMode mode) {
107 Node* TaggedToParameter(Node* value, ParameterMode mode)
[all...] |
| /external/v8/src/interpreter/ |
| interpreter-assembler.h | 29 compiler::Node* BytecodeOperandCount(int operand_index);
32 compiler::Node* BytecodeOperandFlag(int operand_index);
35 compiler::Node* BytecodeOperandIdx(int operand_index);
38 compiler::Node* BytecodeOperandIdxSmi(int operand_index);
41 compiler::Node* BytecodeOperandUImm(int operand_index);
44 compiler::Node* BytecodeOperandUImmWord(int operand_index);
47 compiler::Node* BytecodeOperandImm(int operand_index);
50 compiler::Node* BytecodeOperandImmIntPtr(int operand_index);
53 compiler::Node* BytecodeOperandImmSmi(int operand_index);
56 compiler::Node* BytecodeOperandReg(int operand_index)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| MachinePassRegistry.cpp | 22 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) {
23 Node->setNext(List);
24 List = Node;
25 if (Listener) Listener->NotifyAdd(Node->getName(),
26 Node->getCtor(),
27 Node->getDescription());
33 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) {
35 if (*I == Node) {
36 if (Listener) Listener->NotifyRemove(Node->getName());
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| NamedNodeMap.java | 29 * Retrieves a node specified by name.
30 * @param name The <code>nodeName</code> of a node to retrieve.
31 * @return A <code>Node</code> (of any type) with the specified
33 * any node in this map.
35 public Node getNamedItem(String name);
38 * Adds a node using its <code>nodeName</code> attribute. If a node with
40 * one. Replacing a node by itself has no effect.
42 * which the node must be stored under, multiple nodes of certain types
46 * @param arg A node to store in this map. The node will later b
[all...] |
| DocumentFragment.java | 21 * which can hold such fragments and it is quite natural to use a Node for
28 * of another <code>Node</code> -- may take <code>DocumentFragment</code>
30 * <code>DocumentFragment</code> being moved to the child list of this node.
31 * <p>The children of a <code>DocumentFragment</code> node are zero or more
37 * child and that child node could be a <code>Text</code> node. Such a
41 * <code>Document</code> (or indeed any other <code>Node</code> that may
44 * <code>Node</code>. This makes the <code>DocumentFragment</code> very
47 * the user can use the standard methods from the <code>Node</code>
48 * interface, such as <code>Node.insertBefore</code> an
[all...] |
| EntityReference.java | 24 * <code>EntityReference</code> node that represents a reference to a known
26 * <code>EntityReference</code> node is a copy of the <code>Entity</code>
27 * node subtree. However, the latter may not be true when an entity contains
30 * the <code>EntityReference</code> node may be bound to different namespace
31 * URIs. When an <code>EntityReference</code> node represents a reference to
32 * an unknown entity, the node has no children and its replacement value,
42 public interface EntityReference extends Node {
|
| /external/skia/src/xml/ |
| SkDOM.h | 28 typedef SkDOMNode Node;
33 const Node* build(SkStream&);
34 const Node* copy(const SkDOM& dom, const Node* node);
36 const Node* getRootNode() const;
39 const Node* finishParsing();
45 Type getType(const Node*) const;
47 const char* getName(const Node*) const;
48 const Node* getFirstChild(const Node*, const char elem[] = NULL) const
[all...] |
| /external/v8/src/ic/ |
| accessor-assembler.h | 21 typedef compiler::Node Node;
43 void TryProbeStubCache(StubCache* stub_cache, Node* receiver, Node* name,
47 Node* StubCachePrimaryOffsetForTesting(Node* name, Node* map) {
50 Node* StubCacheSecondaryOffsetForTesting(Node* name, Node* map)
[all...] |
