| /external/v8/src/compiler/ |
| graph-reducer.h | 9 #include "src/compiler/node-marker.h"
19 class Node;
23 // out-of-line data associated with each node.
29 // Represents the result of trying to reduce a node in the graph.
32 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {}
34 Node* replacement() const { return replacement_; }
38 Node* replacement_;
42 // A reducer can reduce or simplify a given node based on its operator and
54 // Try to reduce a node if possible.
55 virtual Reduction Reduce(Node* node) = 0
147 Node* node; member in class:v8::internal::compiler::GraphReducer::State
[all...] |
| common-operator-reducer.h | 35 Reduction Reduce(Node* node) final;
38 Reduction ReduceBranch(Node* node);
39 Reduction ReduceDeoptimizeConditional(Node* node);
40 Reduction ReduceMerge(Node* node);
41 Reduction ReduceEffectPhi(Node* node);
[all...] |
| escape-analysis-reducer.h | 27 // Handle to a conceptually new mutable node. Tries to re-use existing nodes
31 // Construct a new node as a clone of [from].
32 Constructor(NodeHashCache* cache, Node* from)
34 // Construct a new node from scratch.
36 Node** inputs, Type type);
38 // Modify the new node.
39 void ReplaceValueInput(Node* input, int i) {
41 Node* node = MutableNode();
42 NodeProperties::ReplaceValueInput(node, input, i)
[all...] |
| bytecode-graph-builder.h | 57 // Get or create the node that represents the outer function closure.
58 Node* GetFunctionClosure();
61 Node* BuildLoadNativeContextField(int index);
71 // Node creation helpers
72 Node* NewNode(const Operator* op, bool incomplete = false) {
73 return MakeNode(op, 0, static_cast<Node**>(nullptr), incomplete);
76 Node* NewNode(const Operator* op, Node* n1) {
77 Node* buffer[] = {n1};
81 Node* NewNode(const Operator* op, Node* n1, Node* n2)
[all...] |
| js-inlining-heuristic.h | 30 Reduction Reduce(Node* node) final;
52 Node* node = nullptr; // The call site at which to inline. member in struct:v8::internal::compiler::final::Candidate
68 void CreateOrReuseDispatch(Node* node, Node* callee,
69 Candidate const& candidate, Node** if_successes,
70 Node** calls, Node** inputs, int input_count)
[all...] |
| js-inlining.h | 37 Reduction Reduce(Node* node) final;
41 Reduction ReduceJSCall(Node* node);
58 bool DetermineCallTarget(Node* node,
60 void DetermineCallContext(Node* node, Node*& context_out,
63 Node* CreateArtificialFrameState(Node* node, Node* outer_frame_state
[all...] |
| graph.h | 21 class Node;
26 // Each node has a mark which is a monotonically increasing integer, and a
27 // {NodeMarker} has a range of values that indicate states of a node.
32 // out-of-line data associated with each node.
53 Node* const start_;
54 Node* const end_;
60 Node* NewNodeUnchecked(const Operator* op, int input_count,
61 Node* const* inputs, bool incomplete = false);
64 Node* NewNode(const Operator* op, int input_count, Node* const* inputs
[all...] |
| loop-variable-optimizer.h | 9 #include "src/compiler/node-aux-data.h"
18 class Node;
22 Node* phi() const { return phi_; }
23 Node* effect_phi() const { return effect_phi_; }
24 Node* arith() const { return arith_; }
25 Node* increment() const { return increment_; }
26 Node* init_value() const { return init_value_; }
31 Bound(Node* bound, ConstraintKind kind) : bound(bound), kind(kind) {}
33 Node* bound;
45 InductionVariable(Node* phi, Node* effect_phi, Node* arith, Node* increment
[all...] |
| /external/apache-commons-bcel/src/main/java/org/apache/bcel/classfile/ |
| Node.java | 25 public interface Node {
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/ |
| TreeVisitor.java | 24 import com.github.javaparser.ast.Node;
34 * @param node the start node, and the first one that is passed to process(node).
36 public void visitDepthFirst(Node node) {
37 process(node);
38 for (Node child : node.getChildrenNodes()) {
43 public abstract void process(Node node)
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| PCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PCommand extends Node
|
| PExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PExpression extends Node
|
| PPosition.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PPosition extends Node
|
| PVariable.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PVariable extends Node
|
| /external/perfetto/src/traced/probes/filesystem/ |
| prefix_finder.h | 49 class Node {
52 Node(std::string name) : Node(std::move(name), nullptr) {}
53 Node(std::string name, Node* parent)
56 Node(const Node& that) = delete;
57 Node& operator=(const Node&) = delete;
64 // Add a new child to this node
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| AnchorNode.java | 18 public class AnchorNode extends Node {
20 private Node realNode;
22 public AnchorNode(Node realNode) {
32 public Node getRealNode() {
|
| /external/v8/src/interpreter/ |
| interpreter-intrinsics-generator.h | 14 class Node;
19 extern compiler::Node* GenerateInvokeIntrinsic(
20 InterpreterAssembler* assembler, compiler::Node* function_id,
21 compiler::Node* context, const InterpreterAssembler::RegListNodePair& args);
|
| /external/v8/src/builtins/ |
| builtins-boolean-gen.cc | 17 Node* context = Parameter(Descriptor::kContext);
18 Node* receiver = Parameter(Descriptor::kReceiver);
20 Node* value = ToThisValue(context, receiver, PrimitiveType::kBoolean,
22 Node* result = LoadObjectField(value, Oddball::kToStringOffset);
28 Node* context = Parameter(Descriptor::kContext);
29 Node* receiver = Parameter(Descriptor::kReceiver);
31 Node* result = ToThisValue(context, receiver, PrimitiveType::kBoolean,
|
| builtins-math-gen.h | 18 Node* MathPow(Node* context, Node* base, Node* exponent);
22 Node* context, Node* x,
25 Node* context, Node* x,
27 void MathMaxMin(Node* context, Node* argc
[all...] |
| builtins-string-gen.h | 19 Node* GetSubstitution(Node* context, Node* subject_string,
20 Node* match_start_index, Node* match_end_index,
21 Node* replace_string);
22 void StringEqual_Core(Node* context, Node* lhs, Node* lhs_instance_type,
23 Node* rhs, Node* rhs_instance_type
[all...] |
| builtins-async-iterator-gen.cc | 15 using compiler::Node;
23 void ThrowIfNotAsyncFromSyncIterator(Node* const context, Node* const object,
28 typedef std::function<void(Node* const context, Node* const promise,
31 typedef std::function<Node*(Node*)> SyncIteratorNodeGenerator;
33 Node* const context, Node* const iterator, Node* const sent_value
[all...] |
| builtins-symbol-gen.cc | 16 Node* context = Parameter(Descriptor::kContext);
17 Node* receiver = Parameter(Descriptor::kReceiver);
19 Node* value = ToThisValue(context, receiver, PrimitiveType::kSymbol,
21 Node* result = LoadObjectField(value, Symbol::kNameOffset);
27 Node* context = Parameter(Descriptor::kContext);
28 Node* receiver = Parameter(Descriptor::kReceiver);
30 Node* result = ToThisValue(context, receiver, PrimitiveType::kSymbol,
37 Node* context = Parameter(Descriptor::kContext);
38 Node* receiver = Parameter(Descriptor::kReceiver);
40 Node* value = ToThisValue(context, receiver, PrimitiveType::kSymbol
[all...] |
| /external/antlr/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
38 public static class Node<T> {
40 List<Node<T>> edges; // points at which nodes?
42 public Node(T payload) { this.payload = payload; }
44 public void addEdge(Node<T> n) {
45 if ( edges==null ) edges = new ArrayList<Node<T>>();
53 /** Map from node payload to node containing it */
54 protected Map<T,Node<T>> nodes = new HashMap<T,Node<T>>()
[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/swiftshader/third_party/llvm-7.0/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());
|
