| /external/v8/src/compiler/ |
| effect-control-linearizer.h | 9 #include "src/compiler/node.h"
33 void ProcessNode(Node* node, Node** frame_state, Node** effect,
34 Node** control);
37 Node* value;
38 Node* effect;
39 Node* control;
40 ValueEffectControl(Node* value, Node* effect, Node* control
[all...] |
| raw-machine-assembler.h | 13 #include "src/compiler/node.h"
62 Node* NullConstant() {
66 Node* UndefinedConstant() {
71 Node* PointerConstant(void* value) {
74 Node* IntPtrConstant(intptr_t value) {
79 Node* RelocatableIntPtrConstant(intptr_t value, RelocInfo::Mode rmode);
80 Node* Int32Constant(int32_t value) {
83 Node* StackSlot(MachineRepresentation rep) {
86 Node* Int64Constant(int64_t value) {
89 Node* NumberConstant(double value)
[all...] |
| wasm-compiler.h | 20 class Node;
34 // Expose {Node} and {Graph} opaquely as {wasm::TFNode} and {wasm::TFGraph}.
35 typedef compiler::Node TFNode;
101 Node** Buffer(size_t count) {
105 reinterpret_cast<Node**>(zone_->New(new_size * sizeof(Node*)));
114 Node* Error();
115 Node* Start(unsigned params);
116 Node* Param(unsigned index, wasm::LocalType type);
117 Node* Loop(Node* entry)
[all...] |
| escape-analysis.h | 30 Node* GetReplacement(Node* node);
31 bool IsVirtual(Node* node);
32 bool IsEscaped(Node* node);
33 bool CompareVirtualObjects(Node* left, Node* right);
34 Node* GetOrCreateObjectState(Node* effect, Node* node)
[all...] |
| machine-operator-reducer.h | 27 Reduction Reduce(Node* node) override;
30 Node* Float32Constant(volatile float value);
31 Node* Float64Constant(volatile double value);
32 Node* Int32Constant(int32_t value);
33 Node* Int64Constant(int64_t value);
34 Node* Uint32Constant(uint32_t value) {
37 Node* Word32And(Node* lhs, Node* rhs)
[all...] |
| js-intrinsic-lowering.h | 37 Reduction Reduce(Node* node) final;
40 Reduction ReduceCreateIterResultObject(Node* node);
41 Reduction ReduceDeoptimizeNow(Node* node);
42 Reduction ReduceDoubleHi(Node* node);
43 Reduction ReduceDoubleLo(Node* node);
[all...] |
| node-properties.h | 8 #include "src/compiler/node.h"
19 // A facade that simplifies access to the different kinds of inputs to a node.
25 // 0 [ values, context, frame state, effects, control ] node->InputCount()
27 static int FirstValueIndex(Node* node) { return 0; }
28 static int FirstContextIndex(Node* node) { return PastValueIndex(node); }
29 static int FirstFrameStateIndex(Node* node) { return PastContextIndex(node);
[all...] |
| graph-reducer.h | 8 #include "src/compiler/node-marker.h"
17 class Node;
21 // out-of-line data associated with each node.
25 // Represents the result of trying to reduce a node in the graph.
28 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {}
30 Node* replacement() const { return replacement_; }
34 Node* replacement_;
38 // A reducer can reduce or simplify a given node based on its operator and
47 // Try to reduce a node if possible.
48 virtual Reduction Reduce(Node* node) = 0
139 Node* node; member in class:v8::internal::compiler::GraphReducer::State
[all...] |
| js-builtin-reducer.h | 29 Reduction Reduce(Node* node) final;
32 Reduction ReduceMathAbs(Node* node);
33 Reduction ReduceMathAtan(Node* node);
34 Reduction ReduceMathAtan2(Node* node);
35 Reduction ReduceMathAtanh(Node* node);
[all...] |
| js-inlining.h | 32 Reduction Reduce(Node* node) final;
36 Reduction ReduceJSCall(Node* node, Handle<JSFunction> function);
46 Node* CreateArtificialFrameState(Node* node, Node* outer_frame_state,
51 Node* CreateTailCallerFrameState(Node* node, Node* outer_frame_state)
[all...] |
| code-assembler.h | 32 class Node;
183 void Bind(Node* value);
184 Node* value() const;
208 Node* Int32Constant(int32_t value);
209 Node* Int64Constant(int64_t value);
210 Node* IntPtrConstant(intptr_t value);
211 Node* NumberConstant(double value);
212 Node* SmiConstant(Smi* value);
213 Node* HeapConstant(Handle<HeapObject> object);
214 Node* BooleanConstant(bool value)
[all...] |
| graph.h | 17 class Node;
22 // Each node has a mark which is a monotonically increasing integer, and a
23 // {NodeMarker} has a range of values that indicate states of a node.
28 // out-of-line data associated with each node.
49 Node* const start_;
50 Node* const end_;
56 Node* NewNodeUnchecked(const Operator* op, int input_count,
57 Node* const* inputs, bool incomplete = false);
60 Node* NewNode(const Operator* op, int input_count, Node* const* inputs
[all...] |
| js-create-lowering.h | 42 Reduction Reduce(Node* node) final;
45 Reduction ReduceJSCreate(Node* node);
46 Reduction ReduceJSCreateArguments(Node* node);
47 Reduction ReduceJSCreateArray(Node* node);
48 Reduction ReduceJSCreateClosure(Node* node);
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-test-utils.h | 32 class Node;
38 Matcher<Node*> IsDead();
39 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher);
40 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
41 const Matcher<Node*>& control1_matcher);
42 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
43 const Matcher<Node*>& control1_matcher
[all...] |
| graph-reducer-unittest.h | 16 MOCK_METHOD1(Revisit, void(Node*));
17 MOCK_METHOD2(Replace, void(Node*, Node*));
18 MOCK_METHOD4(ReplaceWithValue, void(Node*, Node*, Node*, Node*));
|
| graph-unittest.h | 32 Node* start() { return graph()->start(); }
33 Node* end() { return graph()->end(); }
35 Node* Parameter(int32_t index = 0);
36 Node* Float32Constant(volatile float value);
37 Node* Float64Constant(volatile double value);
38 Node* Int32Constant(int32_t value);
39 Node* Uint32Constant(uint32_t value) {
42 Node* Int64Constant(int64_t value);
43 Node* NumberConstant(volatile double value);
44 Node* HeapConstant(const Handle<HeapObject>& value)
[all...] |
| /ndk/sources/host-tools/nawk-20071023/ |
| proto.h | 32 extern int constnode(Node *);
33 extern char *strnode(Node *);
34 extern Node *notnull(Node *);
49 extern void penter(Node *);
50 extern void freetr(Node *);
55 extern void cfoll(fa *, Node *);
56 extern int first(Node *);
57 extern void follow(Node *);
62 extern Node *reparse(const char *)
[all...] |
| parse.c | 32 Node *nodealloc(int n)
34 Node *x;
36 x = (Node *) malloc(sizeof(Node) + (n-1)*sizeof(Node *));
44 Node *exptostat(Node *a)
50 Node *node1(int a, Node *b)
52 Node *x
[all...] |
| /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/v8/src/ |
| code-stub-assembler.h | 39 compiler::Node* BooleanMapConstant();
40 compiler::Node* EmptyStringConstant();
41 compiler::Node* HeapNumberMapConstant();
42 compiler::Node* NoContextConstant();
43 compiler::Node* NullConstant();
44 compiler::Node* UndefinedConstant();
45 compiler::Node* TheHoleConstant();
46 compiler::Node* HashSeed();
47 compiler::Node* StaleRegisterConstant();
50 compiler::Node* Float64Ceil(compiler::Node* x)
[all...] |
| /external/v8/src/interpreter/ |
| interpreter-assembler.h | 28 compiler::Node* BytecodeOperandCount(int operand_index);
31 compiler::Node* BytecodeOperandFlag(int operand_index);
34 compiler::Node* BytecodeOperandIdx(int operand_index);
37 compiler::Node* BytecodeOperandImm(int operand_index);
40 compiler::Node* BytecodeOperandReg(int operand_index);
43 compiler::Node* BytecodeOperandRuntimeId(int operand_index);
46 compiler::Node* BytecodeOperandIntrinsicId(int operand_index);
49 compiler::Node* GetAccumulator();
50 void SetAccumulator(compiler::Node* value);
53 compiler::Node* GetContext()
[all...] |
| /external/skia/include/xml/ |
| SkDOM.h | 28 typedef SkDOMNode Node;
33 const Node* build(const char doc[], size_t len);
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...] |
