| /external/v8/src/compiler/ |
| change-lowering.h | 27 Reduction Reduce(Node* node) final;
30 Node* HeapNumberValueIndexConstant();
31 Node* SmiMaxValueConstant();
32 Node* SmiShiftBitsConstant();
34 Node* AllocateHeapNumberWithValue(Node* value, Node* control);
35 Node* ChangeInt32ToFloat64(Node* value)
[all...] |
| wasm-compiler.h | 18 class Node;
29 // Expose {Node} and {Graph} opaquely as {wasm::TFNode} and {wasm::TFGraph}.
30 typedef compiler::Node TFNode;
58 Node** Buffer(size_t count) {
62 reinterpret_cast<Node**>(zone_->New(new_size * sizeof(Node*)));
71 Node* Error();
72 Node* Start(unsigned params);
73 Node* Param(unsigned index, wasm::LocalType type);
74 Node* Loop(Node* entry)
[all...] |
| code-stub-assembler.h | 25 class Node;
40 Node* Int32Constant(int value);
41 Node* IntPtrConstant(intptr_t value);
42 Node* NumberConstant(double value);
43 Node* HeapConstant(Handle<HeapObject> object);
44 Node* BooleanConstant(bool value);
46 Node* Parameter(int value);
47 void Return(Node* value);
50 Node* SmiTag(Node* value)
[all...] |
| interpreter-assembler.h | 28 class Node;
43 Node* BytecodeOperandCount(int operand_index);
46 Node* BytecodeOperandIdx(int operand_index);
49 Node* BytecodeOperandImm(int operand_index);
52 Node* BytecodeOperandReg(int operand_index);
55 Node* GetAccumulator();
56 void SetAccumulator(Node* value);
59 Node* GetContext();
60 void SetContext(Node* value);
63 Node* LoadRegister(int offset)
[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* Int32Constant(int32_t value) {
82 Node* Int64Constant(int64_t value) {
85 Node* NumberConstant(double value) {
88 Node* Float32Constant(float value) {
91 Node* Float64Constant(double value)
[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-typed-lowering.h | 46 Reduction Reduce(Node* node) final;
51 Reduction ReduceJSAdd(Node* node);
52 Reduction ReduceJSModulus(Node* node);
53 Reduction ReduceJSBitwiseOr(Node* node);
54 Reduction ReduceJSMultiply(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
140 Node* node; member in class:v8::internal::compiler::GraphReducer::State
[all...] |
| escape-analysis.h | 38 bool IsVirtual(Node* node);
39 bool IsEscaped(Node* node);
40 bool IsAllocation(Node* node);
49 void Process(Node* node);
50 void ProcessAllocate(Node* node);
[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.
37 Node* NewNodeUnchecked(const Operator* op, int input_count, Node** inputs,
41 Node* NewNode(const Operator* op, int input_count, Node** inputs,
45 Node* NewNode(const Operator* op) {
46 return NewNode(op, 0, static_cast<Node**>(nullptr))
[all...] |
| js-intrinsic-lowering.h | 38 Reduction Reduce(Node* node) final;
41 Reduction ReduceConstructDouble(Node* node);
42 Reduction ReduceCreateIterResultObject(Node* node);
43 Reduction ReduceDeoptimizeNow(Node* node);
44 Reduction ReduceDoubleHi(Node* node);
[all...] |
| ast-graph-builder.h | 27 class Node;
45 Node* NewIfTrue() { return NewNode(common()->IfTrue()); }
46 Node* NewIfFalse() { return NewNode(common()->IfFalse()); }
47 Node* NewMerge() { return NewNode(common()->Merge(1), true); }
48 Node* NewLoop() { return NewNode(common()->Loop(1), true); }
49 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) {
54 #define DECLARE_VISIT(type) void Visit##type(type* node) override;
94 SetOncePointer<Node> function_closure_;
95 SetOncePointer<Node> function_context_
[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...] |
| /external/v8/test/unittests/compiler/ |
| 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*));
|
| node-test-utils.h | 34 class Node;
40 Matcher<Node*> IsDead();
41 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher);
42 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
43 const Matcher<Node*>& control1_matcher);
44 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
45 const Matcher<Node*>& control1_matcher
[all...] |
| graph-unittest.h | 33 Node* start() { return graph()->start(); }
34 Node* end() { return graph()->end(); }
36 Node* Parameter(int32_t index = 0);
37 Node* Float32Constant(volatile float value);
38 Node* Float64Constant(volatile double value);
39 Node* Int32Constant(int32_t value);
40 Node* Uint32Constant(uint32_t value) {
43 Node* Int64Constant(int64_t value);
44 Node* NumberConstant(volatile double value);
45 Node* HeapConstant(const Handle<HeapObject>& value)
[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/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...] |
| /packages/services/Telephony/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;
|
