| /external/v8/test/unittests/compiler/ |
| node-test-utils.cc | 5 #include "test/unittests/compiler/node-test-utils.h"
12 #include "src/compiler/node-properties.h"
50 class NodeMatcher : public MatcherInterface<Node*> {
55 *os << "is a " << IrOpcode::Mnemonic(opcode_) << " node";
58 bool MatchAndExplain(Node* node,
60 if (node == NULL) {
64 if (node->opcode() != opcode_) {
65 *listener << "whose opcode is " << IrOpcode::Mnemonic(node->opcode())
79 IsBranchMatcher(const Matcher<Node*>& value_matcher
[all...] |
| escape-analysis-unittest.cc | 10 #include "src/compiler/node-properties.h"
44 // ---------------------------------Node Creation Helper----------------------
46 Node* BeginRegion(Node* effect = nullptr) {
54 Node* FinishRegion(Node* value, Node* effect = nullptr) {
61 Node* Allocate(Node* size, Node* effect = nullptr, Node* control = nullptr)
[all...] |
| common-operator-reducer-unittest.cc | 13 #include "test/unittests/compiler/node-test-utils.h"
29 AdvancedReducer::Editor* editor, Node* node,
34 return reducer.Reduce(node);
37 Reduction Reduce(Node* node, MachineOperatorBuilder::Flags flags =
40 return Reduce(&editor, node, flags);
76 Node* const control = graph()->start();
77 Node* const branch =
79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch)
[all...] |
| branch-elimination-unittest.cc | 8 #include "src/compiler/node-properties.h"
11 #include "test/unittests/compiler/node-test-utils.h"
46 Node* condition = Parameter(0);
47 Node* outer_branch =
50 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
51 Node* inner_branch =
53 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
54 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch);
55 Node* inner_merge =
57 Node* inner_phi
[all...] |
| /external/v8/src/compiler/ |
| state-values-utils.h | 21 Node* GetNodeForValues(Node** values, size_t count);
27 Node* node; member in struct:v8::internal::compiler::StateValuesCache::NodeKey
29 explicit NodeKey(Node* node) : node(node) {}
33 // ValueArray - array of nodes ({node} has to be nullptr).
35 Node** values
66 Node* node; member in struct:v8::internal::compiler::StateValuesAccess::TypedNode
90 Node* node; member in struct:v8::internal::compiler::StateValuesAccess::iterator::StatePos
[all...] |
| js-builtin-reducer.h | 26 Reduction Reduce(Node* node) final;
29 Reduction ReduceFunctionCall(Node* node);
30 Reduction ReduceMathMax(Node* node);
31 Reduction ReduceMathImul(Node* node);
32 Reduction ReduceMathFround(Node* node);
[all...] |
| verifier.h | 16 class Node;
20 // each node, etc.
28 // Verifies consistency of node inputs and uses:
29 // - node inputs should agree with the input count computed from
30 // the node's operator.
34 // - if the node has control uses, it should produce control.
35 // - if the node has effect uses, it should produce effect.
36 // - if the node has frame state uses, it must be a frame state.
37 static void VerifyNode(Node* node);
[all...] |
| interpreter-assembler.cc | 73 Node* InterpreterAssembler::GetAccumulator() { return accumulator_; }
76 void InterpreterAssembler::SetAccumulator(Node* value) { accumulator_ = value; }
79 Node* InterpreterAssembler::GetContext() { return context_; }
82 void InterpreterAssembler::SetContext(Node* value) { context_ = value; }
85 Node* InterpreterAssembler::BytecodeOffset() { return bytecode_offset_; }
88 Node* InterpreterAssembler::RegisterFileRawPointer() {
93 Node* InterpreterAssembler::BytecodeArrayTaggedPointer() {
98 Node* InterpreterAssembler::DispatchTableRawPointer() {
103 Node* InterpreterAssembler::RegisterLocation(Node* reg_index)
[all...] |
| control-flow-optimizer.h | 8 #include "src/compiler/node-marker.h"
19 class Node;
30 void Enqueue(Node* node);
31 void VisitNode(Node* node);
32 void VisitBranch(Node* node);
34 bool TryBuildSwitch(Node* node);
[all...] |
| js-intrinsic-lowering.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
32 Reduction JSIntrinsicLowering::Reduce(Node* node) {
33 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange();
35 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id());
39 return ReduceConstructDouble(node);
41 return ReduceCreateIterResultObject(node);
43 return ReduceDeoptimizeNow(node);
45 return ReduceDoubleHi(node);
[all...] |
| raw-machine-assembler.cc | 8 #include "src/compiler/node-properties.h"
29 // Add an extra input for the JSFunction parameter to the start node.
50 Node* RawMachineAssembler::Parameter(size_t index) {
63 void RawMachineAssembler::Branch(Node* condition, RawMachineLabel* true_val,
66 Node* branch = AddNode(common()->Branch(), condition);
72 void RawMachineAssembler::Switch(Node* index, RawMachineLabel* default_label,
78 Node* switch_node = AddNode(common()->Switch(succ_count), index);
83 Node* case_node =
89 Node* default_node = graph()->NewNode(common()->IfDefault(), switch_node);
97 void RawMachineAssembler::Return(Node* value)
362 Node* node = MakeNode(op, input_count, inputs); local
363 schedule()->AddNode(CurrentBlock(), node); local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
38 class Node;
53 Edge(Node *dst, Node *src, Type kind);
56 inline Node *getOrigin() const { return origin; }
57 inline Node *getTarget() const { return target; }
63 Node *origin;
64 Node *target;
93 inline Node *getNode() const { assert(e); return d ?
105 class Node
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.h | 53 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
55 static bool isPassiveNode(SDNode *Node) {
56 if (isa<ConstantSDNode>(Node)) return true;
57 if (isa<ConstantFPSDNode>(Node)) return true;
58 if (isa<RegisterSDNode>(Node)) return true;
59 if (isa<RegisterMaskSDNode>(Node)) return true;
60 if (isa<GlobalAddressSDNode>(Node)) return true;
61 if (isa<BasicBlockSDNode>(Node)) return true;
62 if (isa<FrameIndexSDNode>(Node)) return true;
63 if (isa<ConstantPoolSDNode>(Node)) return true
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| LeafNodeImpl.java | 19 import org.w3c.dom.Node;
31 * This class represents a Node that has a parent Node, but no children.
45 public Node getNextSibling() {
53 public Node getParentNode() {
57 public Node getPreviousSibling() {
65 boolean isParentOf(Node node) {
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| PathMatcher.java | 26 private Node mRoot = new Node();
29 mRoot = new Node();
34 Node current = mRoot;
44 Node current = mRoot;
46 Node next = current.getChild(segments[i]);
72 private static class Node {
73 private HashMap<String, Node> mMap;
76 Node addChild(String segment) {
78 mMap = new HashMap<String, Node>();
80 Node node = mMap.get(segment); local
[all...] |
| /frameworks/base/core/tests/benchmarks/src/com/android/internal/util/ |
| IndentingPrintWriterBenchmark.java | 33 private Node mSimple;
34 private Node mComplex;
42 final Node manyChildren = Node.build("ManyChildren", Node.build("1"), Node.build("2"),
43 Node.build("3"), Node.build("4"), Node.build("5"), Node.build("6"), Node.build("7")
106 Node node = new Node(); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockNamedNodeMap.java | 21 import org.w3c.dom.Node;
29 private final HashMap<String, HashMap<String, Node>> mNodeMap =
30 new HashMap<String, HashMap<String, Node>>();
33 private final ArrayList<Node> mNodeList = new ArrayList<Node>();
36 MockXmlNode node = new MockXmlNode(namespace, localName, value); local
43 HashMap<String, Node> map = mNodeMap.get(namespace);
45 map = new HashMap<String, Node>();
50 map.put(localName, node);
51 mNodeList.add(node);
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| Node.java | 3 package com.google.clearsilver.jsilver.syntax.node;
8 public abstract class Node implements Switchable, Cloneable
10 private Node parent;
15 public Node parent()
20 void parent(@SuppressWarnings("hiding") Node parent)
25 abstract void removeChild(Node child);
26 abstract void replaceChild(Node oldChild, Node newChild);
28 public void replaceBy(Node node)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/aux_/ |
| iterator.hpp | 29 template< typename Node >
36 template< typename Node >
37 struct deref< l_iter<Node> >
39 typedef typename Node::item type;
42 template< typename Node >
43 struct next< l_iter<Node> >
45 typedef l_iter< typename Node::next > type;
50 template< typename Node >
55 typedef typename Node::item type;
56 typedef l_iter< typename mpl::next<Node>::type > next
[all...] |
| /external/v8/src/profiler/ |
| unbound-queue-inl.h | 14 struct UnboundQueue<Record>::Node: public Malloced {
15 explicit Node(const Record& value)
20 Node* next;
26 first_ = new Node(Record());
39 Node* tmp = first_;
48 Node* next = reinterpret_cast<Node*>(divider_)->next;
57 Node*& next = reinterpret_cast<Node*>(last_)->next;
58 next = new Node(rec)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_stackdepotbase.h | 24 template <class Node, int kReservedBits, int kTabSizeLog>
27 typedef typename Node::args_type args_type;
28 typedef typename Node::handle_type handle_type;
40 static Node *find(Node *s, args_type args, u32 hash);
41 static Node *lock(atomic_uintptr_t *p);
42 static void unlock(atomic_uintptr_t *p, Node *s);
52 atomic_uintptr_t tab[kTabSize]; // Hash table of Node's.
60 template <class Node, int kReservedBits, int kTabSizeLog>
61 Node *StackDepotBase<Node, kReservedBits, kTabSizeLog>::find(Node *s
107 Node *node = find(s, args, h); local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 105 class Node;
107 typedef SmallVector<PointerUnion<Function *, Node *>, 4> NodeVectorT;
108 typedef SmallVectorImpl<PointerUnion<Function *, Node *>> NodeVectorImplT;
118 std::forward_iterator_tag, Node> {
120 friend class LazyCallGraph::Node;
125 // Build the iterator for a specific position in a node list.
145 if (I->is<Node *>())
146 return *I->get<Node *>();
149 Node &ChildN = G->get(*F);
155 /// \brief A node in the call graph
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| CachedXPathAPI.java | 30 import org.w3c.dom.Node;
111 * Use an XPath string to select a single node. XPath namespace
112 * prefixes are resolved from the context node, which may not
115 * @param contextNode The node to start searching from.
117 * @return The first node found that matches the XPath, or null.
121 public Node selectSingleNode(Node contextNode, String str)
128 * Use an XPath string to select a single node.
131 * @param contextNode The node to start searching from.
133 * @param namespaceNode The node from which prefixes in the XPath will be resolved to namespaces
[all...] |
| XPathAPI.java | 30 import org.w3c.dom.Node;
56 * Use an XPath string to select a single node. XPath namespace
57 * prefixes are resolved from the context node, which may not
60 * @param contextNode The node to start searching from.
62 * @return The first node found that matches the XPath, or null.
66 public static Node selectSingleNode(Node contextNode, String str)
73 * Use an XPath string to select a single node.
76 * @param contextNode The node to start searching from.
78 * @param namespaceNode The node from which prefixes in the XPath will be resolved to namespaces
[all...] |
| /external/icu/icu4c/source/common/unicode/ |
| stringtriebuilder.h | 65 static UBool hashNode(const void *node);
93 class Node;
97 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
99 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
144 * Makes sure that there is only one unique node registered that is
146 * @param newNode Input node. The builder takes ownership.
150 * an equivalent node if newNode is a duplicate.
153 Node *registerNode(Node *newNode, UErrorCode &errorCode);
157 * Avoids creating a node if the value is a duplicate
[all...] |
