| /external/v8/src/interpreter/ |
| interpreter-assembler.cc | 25 using compiler::Node;
67 Node* InterpreterAssembler::GetInterpretedFramePointer() {
78 Node* InterpreterAssembler::GetAccumulatorUnchecked() {
82 Node* InterpreterAssembler::GetAccumulator() {
88 void InterpreterAssembler::SetAccumulator(Node* value) {
94 Node* InterpreterAssembler::GetContext() {
98 void InterpreterAssembler::SetContext(Node* value) {
102 Node* InterpreterAssembler::GetContextAtDepth(Node* context, Node* depth)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| pgen_test.go | 28 func markUsed(n *Node) *Node {
33 func markNeedZero(n *Node) *Node {
38 func nodeWithClass(n Node, c Class) *Node {
47 a, b *Node
51 nodeWithClass(Node{}, PAUTO),
52 nodeWithClass(Node{}, PFUNC),
56 nodeWithClass(Node{}, PFUNC)
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| pgen_test.go | 28 func markUsed(n *Node) *Node {
33 func markNeedZero(n *Node) *Node {
38 func nodeWithClass(n Node, c Class) *Node {
47 a, b *Node
51 nodeWithClass(Node{}, PAUTO),
52 nodeWithClass(Node{}, PFUNC),
56 nodeWithClass(Node{}, PFUNC)
[all...] |
| /external/v8/src/compiler/ |
| effect-control-linearizer.cc | 12 #include "src/compiler/node-matchers.h"
13 #include "src/compiler/node-properties.h"
14 #include "src/compiler/node.h"
45 Node* current_effect = nullptr; // New effect.
46 Node* current_control = nullptr; // New control.
47 Node* current_frame_state = nullptr; // New frame state.
71 Node* effect_phi;
74 PendingEffectPhi(Node* effect_phi, BasicBlock* block)
78 void UpdateEffectPhi(Node* node, BasicBlock* block
335 Node* node = block->NodeAt(instr); local
439 Node* node = block->NodeAt(instr); local
[all...] |
| instruction-selector.h | 14 #include "src/compiler/node.h"
36 PushParameter(Node* node, MachineType type) : node_(node), type_(type) {}
38 Node* node() const { return node_; } function in class:v8::internal::compiler::PushParameter
42 Node* node_;
118 DeoptimizeReason reason, Node* frame_state);
122 Node* frame_state);
126 DeoptimizeReason reason, Node* frame_state)
[all...] |
| js-builtin-reducer.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
28 explicit JSCallReduction(Node* node) : node_(node) {}
30 // Determines whether the node is a JSCall operation that targets a
78 Node* receiver() { return NodeProperties::GetValueInput(node_, 1); }
79 Node* left() { return GetJSCallInput(0); }
80 Node* right() { return GetJSCallInput(1); }
88 Node* GetJSCallInput(int index)
[all...] |
| representation-change.h | 106 // The {UseInfo} class is used to describe a use of an input of a node.
110 // 1. During propagation, the use info is used to inform the input node
236 Node* GetRepresentationFor(Node* node, MachineRepresentation output_rep,
237 Type* output_type, Node* use_node,
265 Node* GetTaggedSignedRepresentationFor(Node* node,
267 Type* output_type, Node* use_node
[all...] |
| common-node-cache.h | 8 #include "src/compiler/node-cache.h"
28 Node** FindInt32Constant(int32_t value) {
32 Node** FindInt64Constant(int64_t value) {
36 Node** FindFloat32Constant(float value) {
41 Node** FindFloat64Constant(double value) {
46 Node** FindExternalConstant(ExternalReference value);
48 Node** FindPointerConstant(intptr_t value) {
52 Node** FindNumberConstant(double value) {
57 Node** FindHeapConstant(Handle<HeapObject> value);
59 Node** FindRelocatableInt32Constant(int32_t value, RelocInfoMode rmode)
[all...] |
| raw-machine-assembler.cc | 7 #include "src/compiler/node-properties.h"
29 // Add an extra input for the JSFunction parameter to the start node.
38 Node* RawMachineAssembler::RelocatableIntPtrConstant(intptr_t value,
67 Node* RawMachineAssembler::Parameter(size_t index) {
80 void RawMachineAssembler::Branch(Node* condition, RawMachineLabel* true_val,
83 Node* branch = MakeNode(common()->Branch(), 1, &condition);
88 void RawMachineAssembler::Continuations(Node* call, RawMachineLabel* if_success,
96 void RawMachineAssembler::Switch(Node* index, RawMachineLabel* default_label,
102 Node* switch_node = AddNode(common()->Switch(succ_count), index);
107 Node* case_node
330 Node* node = MakeNode(op, input_count, inputs); local
331 schedule()->AddNode(CurrentBlock(), node); local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTMdefaultNamespaceDeclarationNode.java | 30 import org.w3c.dom.Node;
37 * DOM2DTM model. Basically, it creates a proxy node in DOM space to
49 * %REVIEW% An alternative solution would be to create the node _only_
80 public Node getParentNode() {return null;}
81 public Node getFirstChild() {return null;}
82 public Node getLastChild() {return null;}
83 public Node getPreviousSibling() {return null;}
84 public Node getNextSibling() {return null;}
89 public short getNodeType() {return Node.ATTRIBUTE_NODE;}
93 public Node insertBefore(Node a, Node b) {throw new DTMException(NOT_SUPPORTED_ERR);
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| RegionIterator.h | 50 PointerIntPair<NodeType*, 2, enum ItMode> Node;
55 // advanceRegionSucc - A region node has only one successor. It reaches end
58 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
59 Node.setInt(ItRgEnd);
62 NodeType* getNode() const{ return Node.getPointer(); }
65 bool isRegionMode() const { return Node.getInt() != ItBB; }
78 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
92 inline RNSuccIterator(NodeType* node)
93 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /external/llvm/lib/Target/BPF/ |
| BPFISelDAGToDAG.cpp | 76 // If the first operand is a FI, get the TargetFI Node
104 // If the first operand is a FI, get the TargetFI Node
118 void BPFDAGToDAGISel::Select(SDNode *Node) {
119 unsigned Opcode = Node->getOpcode();
121 // Dump information about the Node being selected
122 DEBUG(dbgs() << "Selecting: "; Node->dump(CurDAG); dbgs() << '\n');
124 // If we have a custom node, we already have selected!
125 if (Node->isMachineOpcode()) {
126 DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
135 const DebugLoc &DL = Node->getDebugLoc()
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| costmodel.h | 40 // * The total number of times a node has executed.
41 // * The accumulated execution time (in microseconds) of a node.
42 // * The accumulated size (in bytes) of each node's output.
47 // If "global" is true, maintains costs based on Node::cost_id, otherwise
48 // maintains costs based on Node::id.
53 // Assigns min_count_ as a function of the median count for a Node.
61 inline int Id(const Node* n) const {
82 // Sets the number of outputs of "node".
83 void SetNumOutputs(const Node* node, int num_outputs)
[all...] |
| /external/v8/src/ic/ |
| keyed-store-generic.cc | 18 using compiler::Node;
34 void EmitGenericElementStore(Node* receiver, Node* receiver_map,
35 Node* instance_type, Node* intptr_index,
36 Node* value, Node* context, Label* slow);
38 void EmitGenericPropertyStore(Node* receiver, Node* receiver_map,
42 void BranchIfPrototypesHaveNonFastElements(Node* receiver_map
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/ |
| Node.java | 49 import static com.github.javaparser.ast.Node.Parsedness.PARSED;
50 import static com.github.javaparser.ast.Node.TreeTraversal.PREORDER;
54 import com.github.javaparser.ast.Node;
71 * ... and use the various methods on the node to initialize it further, if needed.
73 * <p>The parent node field is managed automatically and can be seen as read only.
75 * and trying to use the same node in two places will lead to unexpected behaviour.
76 * It is advised to clone() a node before moving it around.
78 * <p>Each Node can have one associated comment which describes it and
95 * A visitor can be "run" by calling accept on a node:
96 * <pre>node.accept(visitor, argument);</pre
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 34 static std::string getSimpleNodeLabel(const BasicBlock *Node,
36 if (!Node->getName().empty())
37 return Node->getName().str();
42 Node->printAsOperand(OS, false);
46 static std::string getCompleteNodeLabel(const BasicBlock *Node,
52 if (Node->getName().empty()) {
53 Node->printAsOperand(OS, false);
57 OS << *Node;
91 std::string getNodeLabel(const BasicBlock *Node,
94 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /external/llvm/unittests/ADT/ |
| ilistTest.cpp | 20 struct Node : ilist_node<Node> {
23 Node() {}
24 Node(int Value) : Value(Value) {}
25 Node(const Node&) = default;
26 ~Node() { Value = -1; }
30 ilist<Node> List;
31 List.push_back(Node(1));
36 List.push_back(Node(2))
[all...] |
| /external/v8/src/ |
| code-stub-assembler.cc | 12 using compiler::Node;
22 // FLAG_csa_trap_on_node should be in a form "STUB,NODE" where STUB is a
23 // string specifying the name of a stub and NODE is number specifying node id.
40 // Bad node id.
58 Node* condition = codition_body();
83 Node* CodeStubAssembler::Select(Node* condition, const NodeGenerator& true_body,
105 Node* CodeStubAssembler::SelectConstant(Node* condition, Node* true_value
[all...] |
| locked-queue-inl.h | 15 struct LockedQueue<Record>::Node : Malloced {
16 Node() : next(nullptr) {}
18 base::AtomicValue<Node*> next;
24 head_ = new Node();
33 Node* old_node = nullptr;
34 Node* cur_node = head_;
45 Node* n = new Node();
58 Node* old_head = nullptr;
62 Node* const next_node = head_->next.Value()
[all...] |
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_nodeiteratortemplate_unittest.cpp | 16 class Node {
20 static Node* GetFirstChild(Node* pNode) {
24 static Node* GetNextSibling(Node* pNode) {
27 static Node* GetParent(Node* pNode) {
32 explicit Node(Node* parent) : parent_(parent), next_sibling_(nullptr) {
41 Node* parent_
[all...] |
| /external/v8/src/builtins/ |
| builtins-boolean.cc | 42 typedef compiler::Node Node;
45 Node* receiver = assembler.Parameter(0);
46 Node* context = assembler.Parameter(3);
48 Node* value = assembler.ToThisValue(
50 Node* result = assembler.LoadObjectField(value, Oddball::kToStringOffset);
57 typedef compiler::Node Node;
60 Node* receiver = assembler.Parameter(0);
61 Node* context = assembler.Parameter(3)
[all...] |
| /libcore/luni/src/test/java/libcore/xml/ |
| NodeTest.java | 22 import org.w3c.dom.Node;
36 * For bug 779: Node#getNextSibling throws IndexOutOfBoundsException.
43 Node root = document.getDocumentElement();
55 for (Node node : flattenSubtree(documentElement)) {
56 if (node.getNodeType() == Node.ELEMENT_NODE
57 || node.getNodeType() == Node.DOCUMENT_NODE) {
58 assertFileUriEquals(file, node.getBaseURI())
[all...] |
| /packages/apps/Dialer/java/com/android/dialer/searchfragment/cp2/ |
| ContactTernarySearchTree.java | 26 private Node root;
29 * Add {@code value} to all middle and end {@link Node#values} that correspond to {@code key}.
32 * "O". But if the traversal required visiting {@link Node#left} or {@link Node#right}, {@code
42 private Node put(Node node, String key, int value, int position) {
44 if (node == null) {
45 node = new Node();
[all...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Compatibility/FrameworkHiiOnUefiHiiThunk/ |
| UefiIfrDefault.c | 28 Set the data position at Offset with Width in Node->Buffer based
31 @param Node The Buffer Storage Node.
33 @param Offset The offset in Node->Buffer for the update.
39 OUT UEFI_IFR_BUFFER_STORAGE_NODE *Node,
45 ASSERT (Node->Signature == UEFI_IFR_BUFFER_STORAGE_NODE_SIGNATURE);
46 ASSERT (Offset + Width <= Node->Size);
48 CopyMem (Node->Buffer + Offset, &Value->Value.u8, Width);
63 @param Node Var storage buffer to store the got default value.
73 OUT UEFI_IFR_BUFFER_STORAGE_NODE *Node
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/nodeTypes/ |
| NodeWithCondition.java | 3 import com.github.javaparser.ast.Node;
6 public interface NodeWithCondition<N extends Node> {
|
