/external/v8/src/compiler/ |
effect-control-linearizer.h | 9 #include "src/compiler/node.h" 38 void ProcessNode(Node* node, Node** frame_state, Node** effect, 39 Node** control); 42 Node* value; 43 Node* effect; 44 Node* control; 45 ValueEffectControl(Node* value, Node* effect, Node* control [all...] |
escape-analysis.h | 31 Node* GetReplacement(Node* node); 32 bool IsVirtual(Node* node); 33 bool IsEscaped(Node* node); 34 bool CompareVirtualObjects(Node* left, Node* right); 35 Node* GetOrCreateObjectState(Node* effect, Node* node) [all...] |
wasm-compiler.h | 23 class Node; 37 // Expose {Node} and {Graph} opaquely as {wasm::TFNode} and {wasm::TFGraph}. 38 typedef compiler::Node TFNode; 97 typedef ZoneVector<Node*> NodeVector; 104 Node** Buffer(size_t count) { 108 reinterpret_cast<Node**>(zone_->New(new_size * sizeof(Node*))); 117 Node* Error(); 118 Node* Start(unsigned params); 119 Node* Param(unsigned index, wasm::LocalType type) [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 | 30 Reduction Reduce(Node* node) override; 33 Node* Float32Constant(volatile float value); 34 Node* Float64Constant(volatile double value); 35 Node* Int32Constant(int32_t value); 36 Node* Int64Constant(int64_t value); 37 Node* Uint32Constant(uint32_t value) { 40 Node* Uint64Constant(uint64_t value) { 43 Node* Float64Mul(Node* lhs, Node* rhs) [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-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...] |
node-properties.h | 8 #include "src/compiler/node.h" 20 // A facade that simplifies access to the different kinds of inputs to a node. 26 // 0 [ values, context, frame state, effects, control ] node->InputCount() 28 static int FirstValueIndex(Node* node) { return 0; } 29 static int FirstContextIndex(Node* node) { return PastValueIndex(node); } 30 static int FirstFrameStateIndex(Node* node) { return PastContextIndex(node); [all...] |
js-create-lowering.h | 46 Reduction Reduce(Node* node) final; 49 Reduction ReduceJSCreate(Node* node); 50 Reduction ReduceJSCreateArguments(Node* node); 51 Reduction ReduceJSCreateArray(Node* node); 52 Reduction ReduceJSCreateClosure(Node* node); [all...] |
code-assembler.h | 33 class Node; 206 void Bind(Node* value); 207 Node* value() const; 225 Node* Int32Constant(int32_t value); 226 Node* Int64Constant(int64_t value); 227 Node* IntPtrConstant(intptr_t value); 228 Node* NumberConstant(double value); 229 Node* SmiConstant(Smi* value); 230 Node* SmiConstant(int value); 231 Node* HeapConstant(Handle<HeapObject> object) [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...] |
js-intrinsic-lowering.h | 39 Reduction Reduce(Node* node) final; 42 Reduction ReduceCreateIterResultObject(Node* node); 43 Reduction ReduceDeoptimizeNow(Node* node); 44 Reduction ReduceGeneratorClose(Node* node); 45 Reduction ReduceGeneratorGetInputOrDebugPos(Node* node); [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...] |
ast-graph-builder.h | 28 class Node; 50 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } 51 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } 52 Node* NewMerge() { return NewNode(common()->Merge(1), true); } 53 Node* NewLoop() { return NewNode(common()->Loop(1), true); } 54 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) { 59 #define DECLARE_VISIT(type) virtual void Visit##type(type* node); 99 SetOncePointer<Node> function_closure_; 100 SetOncePointer<Node> function_context_ [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* BytecodeOperandUImm(int operand_index); 41 compiler::Node* BytecodeOperandImm(int operand_index); 44 compiler::Node* BytecodeOperandReg(int operand_index); 47 compiler::Node* BytecodeOperandRuntimeId(int operand_index); 50 compiler::Node* BytecodeOperandIntrinsicId(int operand_index); 53 compiler::Node* GetAccumulator(); 54 void SetAccumulator(compiler::Node* value) [all...] |
/external/v8/src/ |
code-stub-assembler.h | 81 compiler::Node* UntagParameter(compiler::Node* value, ParameterMode mode) { 86 compiler::Node* TagParameter(compiler::Node* value, ParameterMode mode) { 91 compiler::Node* NoContextConstant(); 92 #define HEAP_CONSTANT_ACCESSOR(rootName, name) compiler::Node* name##Constant(); 97 compiler::Node* Is##name(compiler::Node* value); 101 compiler::Node* HashSeed(); 102 compiler::Node* StaleRegisterConstant() [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...] |
/packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
Node.java | 1 /* Generated By:JJTree: Do not edit this line. Node.java */ 9 public interface Node { 11 /** This method is called after the node has been made the current 12 node. It indicates that child nodes can now be added to it. */ 19 /** This pair of methods are used to inform the node of its 21 public void jjtSetParent(Node n); 22 public Node jjtGetParent(); 24 /** This method tells the node to add its argument to the node's 26 public void jjtAddChild(Node n, int i) [all...] |
/external/clang/test/CXX/expr/expr.post/expr.ref/ |
p3.cpp | 4 template<typename T> struct Node { 8 Node<T> n[1]; 14 Node<int> n;
|
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
Construct.java | 18 import org.yaml.snakeyaml.nodes.Node; 21 * Provide a way to construct a Java instance out of the composed Node. Support 23 * Node Graph) 33 * @param node 34 * composed Node 37 Object construct(Node node); 43 * @param node 44 * composed Node 47 * <code>construct(Node node)</code> for the provided Nod [all...] |
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
NodeTuple.java | 23 private Node keyNode; 24 private Node valueNode; 26 public NodeTuple(Node keyNode, Node valueNode) { 35 * Key node. 37 public Node getKeyNode() { 42 * Value node. 46 public Node getValueNode() {
|