| /external/v8/src/compiler/ |
| typed-optimization.h | 42 Reduction Reduce(Node* node) final;
45 Reduction ReduceCheckHeapObject(Node* node);
46 Reduction ReduceCheckMaps(Node* node);
47 Reduction ReduceCheckString(Node* node);
48 Reduction ReduceLoadField(Node* node);
[all...] |
| control-flow-optimizer.h | 8 #include "src/compiler/node-marker.h"
20 class Node;
30 void Enqueue(Node* node);
31 void VisitNode(Node* node);
32 void VisitBranch(Node* node);
34 bool TryBuildSwitch(Node* node);
[all...] |
| js-context-specialization.h | 27 Reduction Reduce(Node* node) final;
30 Reduction ReduceJSLoadContext(Node* node);
31 Reduction ReduceJSStoreContext(Node* node);
33 Reduction SimplifyJSStoreContext(Node* node, Node* new_context,
35 Reduction SimplifyJSLoadContext(Node* node, Node* new_context
[all...] |
| graph-assembler.cc | 15 GraphAssembler::GraphAssembler(JSGraph* jsgraph, Node* effect, Node* control,
22 Node* GraphAssembler::IntPtrConstant(intptr_t value) {
26 Node* GraphAssembler::Int32Constant(int32_t value) {
30 Node* GraphAssembler::UniqueInt32Constant(int32_t value) {
34 Node* GraphAssembler::SmiConstant(int32_t value) {
38 Node* GraphAssembler::Uint32Constant(int32_t value) {
42 Node* GraphAssembler::Float64Constant(double value) {
46 Node* GraphAssembler::HeapConstant(Handle<HeapObject> object) {
51 Node* GraphAssembler::ExternalConstant(ExternalReference ref)
[all...] |
| load-elimination.h | 34 Reduction Reduce(Node* node) final;
49 AbstractChecks(Node* node, Zone* zone) : AbstractChecks(zone) {
50 nodes_[next_index_++] = node;
53 AbstractChecks const* Extend(Node* node, Zone* zone) const {
55 that->nodes_[that->next_index_] = node;
59 Node* Lookup(Node* node) const
[all...] |
| js-call-reducer.h | 46 Reduction Reduce(Node* node) final;
49 Reduction ReduceArrayConstructor(Node* node);
51 Node* node, Node* target,
53 Reduction ReduceNumberConstructor(Node* node);
54 Reduction ReduceFunctionPrototypeApply(Node* node)
[all...] |
| js-intrinsic-lowering.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
27 Reduction JSIntrinsicLowering::Reduce(Node* node) {
28 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange();
30 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id());
34 return ReduceCreateIterResultObject(node);
36 return ReduceDebugIsActive(node);
38 return ReduceDeoptimizeNow(node);
40 return ReduceGeneratorClose(node);
[all...] |
| node.h | 24 // Each node has a mark which is a monotonically increasing integer, and a
25 // {NodeMarker} has a range of values that indicate states of a node.
30 // out-of-line data associated with each node.
34 // A Node is the basic primitive of graphs. Nodes are chained together by
42 // by the Node's id.
43 class V8_EXPORT_PRIVATE Node final {
45 static Node* New(Zone* zone, NodeId id, const Operator* op, int input_count,
46 Node* const* inputs, bool has_extensible_inputs);
47 static Node* Clone(Zone* zone, NodeId id, const Node* node)
[all...] |
| code-assembler.cc | 13 #include "src/compiler/node-matchers.h"
86 void Decorate(Node* node) final {
87 if (node->id() == node_id_) {
163 Node* CodeAssembler::Int32Constant(int32_t value) {
167 Node* CodeAssembler::Int64Constant(int64_t value) {
171 Node* CodeAssembler::IntPtrConstant(intptr_t value) {
175 Node* CodeAssembler::NumberConstant(double value) {
179 Node* CodeAssembler::SmiConstant(Smi* value) {
183 Node* CodeAssembler::SmiConstant(int value)
766 Node* node = var->value_; local
[all...] |
| graph-assembler.h | 9 #include "src/compiler/node.h"
91 Node* PhiAt(size_t index);
123 // node entries.
124 Node** GetBindingsPtrFor(size_t phi_index) {
128 void SetBinding(size_t phi_index, size_t merge_index, Node* binding) {
138 Node** GetControlsPtr() { return controls_; }
140 Node** GetEffectsPtr() { return effects_; }
146 Node* effects_[MergeCount + 1]; // Extra element for control edge,
149 Node* controls_[MergeCount];
150 Node* bindings_[(MergeCount + 1) * VarCount + 1]
[all...] |
| /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...] |
| /external/v8/src/builtins/ |
| builtins-arguments.cc | 16 typedef compiler::Node Node;
18 std::tuple<Node*, Node*, Node*>
19 ArgumentsBuiltinsAssembler::GetArgumentsFrameAndCount(Node* function,
36 Node* frame_ptr_above = LoadBufferObject(
39 Node* shared =
41 Node* formal_parameter_count = LoadSharedFunctionInfoSpecialField(
44 Node* marker_or_function = LoadBufferObject
[all...] |
| builtins-handler.cc | 19 Node* receiver = Parameter(Descriptor::kReceiver);
20 Node* index = Parameter(Descriptor::kName);
21 Node* slot = Parameter(Descriptor::kSlot);
22 Node* vector = Parameter(Descriptor::kVector);
23 Node* context = Parameter(Descriptor::kContext);
27 Node* index_intptr = TryToIntptr(index, &miss);
28 Node* length = SmiUntag(LoadStringLength(receiver));
31 Node* code = StringCharCodeAt(receiver, index_intptr, INTPTR_PARAMETERS);
32 Node* result = StringFromCharCode(code);
43 Node* receiver = Parameter(Descriptor::kReceiver)
[all...] |
| /external/v8/src/interpreter/ |
| interpreter-intrinsics.h | 19 class Node;
56 compiler::Node* InvokeIntrinsic(compiler::Node* function_id,
57 compiler::Node* context,
58 compiler::Node* first_arg_reg,
59 compiler::Node* arg_count);
71 compiler::Node* IsInstanceType(compiler::Node* input, int type);
72 compiler::Node* CompareInstanceType(compiler::Node* map, int type
[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...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| DOTGraphTraits.h | 62 /// isNodeHidden - If the function returns true, the given node is not
64 static bool isNodeHidden(const void *Node) {
68 /// getNodeLabel - Given a node and a pointer to the top level graph, return
69 /// the label to print in the node.
71 std::string getNodeLabel(const void *Node, const GraphType& Graph) {
75 /// hasNodeAddressLabel - If this method returns true, the address of the node
76 /// is added to the label of the node.
78 static bool hasNodeAddressLabel(const void *Node, const GraphType& Graph) {
82 /// If you want to specify custom node attributes, this is the place to do so
85 static std::string getNodeAttributes(const void *Node,
[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/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| Trie.h | 36 class Node {
40 typedef std::vector<Node*> NodeVectorType;
54 bool operator() (Node* N1, Node* N2) {
57 bool operator() (Node* N, char Id) {
67 Node(const Node&);
68 Node& operator=(const Node&);
70 inline void addEdge(Node* N)
[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/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 | 67 static UBool hashNode(const void *node);
95 class Node;
99 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
101 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
146 * Makes sure that there is only one unique node registered that is
148 * @param newNode Input node. The builder takes ownership.
152 * an equivalent node if newNode is a duplicate.
155 Node *registerNode(Node *newNode, UErrorCode &errorCode);
159 * Avoids creating a node if the value is a duplicate
[all...] |
| /external/clang/include/clang/Tooling/ |
| FixIt.h | 41 /// \brief Returns the SourceRange of an given Node. \p Node is typically a
43 template <typename T> SourceRange getSourceRange(const T &Node) {
44 return Node.getSourceRange();
48 // \brief Returns a textual representation of \p Node.
50 StringRef getText(const T &Node, const ASTContext &Context) {
51 return internal::getText(internal::getSourceRange(Node), Context);
54 // \brief Returns a FixItHint to remove \p Node.
56 template <typename T> FixItHint createRemoval(const T &Node) {
57 return FixItHint::CreateRemoval(internal::getSourceRange(Node));
[all...] |
