| /external/llvm/include/llvm/CodeGen/ |
| MachinePassRegistry.h | 47 /// MachinePassRegistryNode - Machine pass node stored in registration list.
107 void Add(MachinePassRegistryNode *Node);
111 void Remove(MachinePassRegistryNode *Node);
133 for (RegistryClass *Node = RegistryClass::getList();
134 Node; Node = Node->getNext()) {
135 this->addLiteralOption(Node->getName(),
136 (typename RegistryClass::FunctionPassCtor)Node->getCtor(),
137 Node->getDescription())
[all...] |
| /external/llvm/include/llvm/Support/ |
| GraphWriter.h | 37 /// \brief Get a color string for this node number. Simply round-robin selects
67 // Writes the edge labels of the node to O and returns true if there are any
69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
70 child_iterator EI = GTraits::child_begin(Node);
71 child_iterator EE = GTraits::child_end(Node);
75 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
147 bool isNodeHidden(NodeType &Node) {
148 return isNodeHidden(&Node);
151 bool isNodeHidden(NodeType *const *Node) {
152 return isNodeHidden(*Node);
[all...] |
| /external/v8/src/compiler/ |
| select-lowering.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
26 Reduction SelectLowering::Reduce(Node* node) {
27 if (node->opcode() != IrOpcode::kSelect) return NoChange();
28 SelectParameters const p = SelectParametersOf(node->op());
30 Node* cond = node->InputAt(0);
31 Node* vthen = node->InputAt(1)
[all...] |
| common-node-cache.cc | 5 #include "src/compiler/common-node-cache.h"
8 #include "src/compiler/node.h"
14 Node** CommonNodeCache::FindExternalConstant(ExternalReference value) {
19 Node** CommonNodeCache::FindHeapConstant(Handle<HeapObject> value) {
24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) {
|
| js-frame-specialization.h | 28 Reduction Reduce(Node* node) final;
31 Reduction ReduceOsrValue(Node* node);
32 Reduction ReduceParameter(Node* node);
|
| escape-analysis-reducer.cc | 24 Reduction EscapeAnalysisReducer::Reduce(Node* node) {
25 switch (node->opcode()) {
28 return ReduceLoad(node);
31 return ReduceStore(node);
33 return ReduceAllocate(node);
35 return ReduceFinishRegion(node);
37 return ReduceReferenceEqual(node);
39 return ReduceObjectIsSmi(node);
43 // whether a node might have a frame state input
[all...] |
| js-typed-lowering.cc | 11 #include "src/compiler/node-matchers.h"
12 #include "src/compiler/node-properties.h"
29 AllocationBuilder(JSGraph* jsgraph, Node* effect, Node* control)
45 void Store(const FieldAccess& access, Node* value) {
51 void Store(ElementAccess const& access, Node* index, Node* value) {
74 void FinishAndChange(Node* node) {
75 NodeProperties::SetType(allocation_, NodeProperties::GetType(node));
[all...] |
| ast-graph-builder.cc | 14 #include "src/compiler/node-matchers.h"
15 #include "src/compiler/node-properties.h"
41 // Plug a node into this expression context. Call this function in tail
43 virtual void ProduceValue(Node* value) = 0;
45 // Unplugs a node from this expression context. Call this to retrieve the
47 virtual Node* ConsumeValue() = 0;
78 void ProduceValue(Node* value) final;
79 Node* ConsumeValue() final;
89 void ProduceValue(Node* value) final;
90 Node* ConsumeValue() final
482 Node* node = NewNode(op, graph()->start()); local
494 Node* node = NewNode(op, graph()->start()); local
506 Node* node = NewNode(op, graph()->start()); local
606 Node* node = NewNode(javascript()->StackCheck()); local
1524 Node* node = local
2957 Node* node = NewNode(javascript()->StackCheck()); local
3585 Node* node = NewNode(op, object, key, BuildLoadFeedbackVector()); local
3593 Node* node = NewNode(op, object, BuildLoadFeedbackVector()); local
3601 Node* node = NewNode(op, object, key, value, BuildLoadFeedbackVector()); local
3611 Node* node = NewNode(op, object, value, BuildLoadFeedbackVector()); local
3622 Node* node = NewNode(op, receiver, home_object, name_node, language); local
3633 Node* node = NewNode(op, receiver, home_object, key, language); local
3644 Node* node = NewNode(op, receiver, home_object, key, value); local
3656 Node* node = NewNode(op, receiver, home_object, name_node, value); local
3665 Node* node = NewNode(op, BuildLoadFeedbackVector()); local
3674 Node* node = NewNode(op, value, BuildLoadFeedbackVector()); local
[all...] |
| /external/v8/test/unittests/compiler/ |
| load-elimination-unittest.cc | 9 #include "test/unittests/compiler/node-test-utils.h"
21 Reduction Reduce(Node* node) {
25 return reducer.Reduce(node);
36 Node* object1 = Parameter(0);
37 Node* object2 = Parameter(1);
38 Node* value = Parameter(2);
39 Node* effect = graph()->start();
40 Node* control = graph()->start();
43 Node* store1 = graph()->NewNode(simplified()->StoreField(access1), object1
[all...] |
| select-lowering-unittest.cc | 7 #include "test/unittests/compiler/node-test-utils.h"
24 Reduction Reduce(Node* node) { return lowering_.Reduce(node); }
32 Node* const p0 = Parameter(0);
33 Node* const p1 = Parameter(1);
34 Node* const p2 = Parameter(2);
35 Node* const p3 = Parameter(3);
36 Node* const p4 = Parameter(4);
37 Node* const s0 = graph()->NewNode
[all...] |
| interpreter-assembler-unittest.cc | 9 #include "src/compiler/node.h"
13 #include "test/unittests/compiler/node-test-utils.h"
28 Matcher<Node*> IsIntPtrConstant(const intptr_t value) {
34 Matcher<Node*> IsIntPtrAdd(const Matcher<Node*>& lhs_matcher,
35 const Matcher<Node*>& rhs_matcher) {
41 Matcher<Node*> IsIntPtrSub(const Matcher<Node*>& lhs_matcher,
42 const Matcher<Node*>& rhs_matcher) {
48 Matcher<Node*> IsWordShl(const Matcher<Node*>& lhs_matcher
[all...] |
| tail-call-optimization-unittest.cc | 8 #include "test/unittests/compiler/node-test-utils.h"
21 Reduction Reduce(Node* node) {
23 return tco.Reduce(node);
39 Node* p0 = Parameter(0);
40 Node* p1 = Parameter(1);
41 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1,
43 Node* if_success = graph()->NewNode(common()->IfSuccess(), call);
44 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success);
61 Node* p0 = Parameter(0)
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 13 import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node;
57 private transient volatile Node head;
61 * method enq to add new wait node.
63 private transient volatile Node tail;
115 * Inserts node into queue, initializing if necessary. See picture above.
116 * @param node the node to insert
117 * @return node's predecessor
119 private Node enq(Node node)
141 Node node = new Node(mode); local
420 final Node node = addWaiter(Node.EXCLUSIVE); local
451 final Node node = addWaiter(Node.EXCLUSIVE); local
482 final Node node = addWaiter(Node.SHARED); local
513 final Node node = addWaiter(Node.SHARED); local
547 final Node node = addWaiter(Node.SHARED); local
1381 Node node = new Node(Node.CONDITION); local
1499 Node node = addConditionWaiter(); local
1562 Node node = addConditionWaiter(); local
1599 Node node = addConditionWaiter(); local
1642 Node node = addConditionWaiter(); local
1686 Node node = addConditionWaiter(); local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TransformState.java | 29 import org.w3c.dom.Node;
68 * This method retrieves the current context node
71 * @return the current context node in the source tree.
73 Node getCurrentNode();
104 * Retrieves the node in the source tree that matched
107 * @return the node in the source tree that matched
110 Node getMatchedNode();
113 * Get the current context node list.
115 * @return the current context node list.
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| ANoopCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
34 void removeChild(@SuppressWarnings("unused") Node child)
41 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| ANoopExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
34 void removeChild(@SuppressWarnings("unused") Node child)
41 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| /libcore/dom/src/test/java/org/w3c/domts/ |
| DOMLocatorImpl.java | 15 import org.w3c.dom.Node;
27 private final Node relatedNode;
70 /* Related node
73 public Node getRelatedNode() {
|
| UserDataMonitor.java | 17 import org.w3c.dom.Node;
54 Node src,
55 Node dst) {
|
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| binary-tree.go | 46 type Node struct {
48 left, right *Node
51 func bottomUpTree(item, depth int) *Node {
53 return &Node{item: item}
55 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
58 func (n *Node) itemCheck() int {
|
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| binary-tree.go | 46 type Node struct {
48 left, right *Node
51 func bottomUpTree(item, depth int) *Node {
53 return &Node{item: item}
55 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)}
58 func (n *Node) itemCheck() int {
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen_unittest.cc | 114 CodeGen::Node MakeInstruction(uint16_t code,
116 CodeGen::Node jt = CodeGen::kNullNode,
117 CodeGen::Node jf = CodeGen::kNullNode) {
118 CodeGen::Node res = gen_.MakeInstruction(code, k, jt, jf);
131 void RunTest(CodeGen::Node head) {
160 const Hash& Lookup(CodeGen::Node next) const {
166 ADD_FAILURE() << "No hash found for node " << next;
173 std::map<CodeGen::Node, Hash> node_hashes_;
181 CodeGen::Node head = MakeInstruction(BPF_RET + BPF_K, 0);
190 CodeGen::Node head = MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 42
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child
63 /// The bound nodes are generated by calling \c bind("id") on the node matchers
70 /// \brief Returns the AST node bound to \c ID.
72 /// Returns NULL if there was no node bound to \c ID or if there is a node but
111 /// \brief If the provided matcher matches a node, binds the node to \c ID.
131 /// \brief Matches any node.
189 SourceManager.getExpansionLoc(Node.getLocStart()));
209 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart())
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSet.java | 29 import org.w3c.dom.Node;
126 * Create a NodeSet which contains the given Node.
128 * @param node Single node to be added to the new set.
130 public NodeSet(Node node)
135 addNode(node);
139 * @return The root node of the Iterator, as specified when it was created.
142 public Node getRoot()
176 * This attribute determines which node types are presented via th
526 Node node = nodelist.item(i); local
550 Node node; local
580 Node node = nodelist.item(testIndex); local
1205 Node node = m_map[i]; local
1304 Node node = m_map[i]; local
1333 Node node = m_map[i]; local
1361 Node node = m_map[i]; local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| ExplodedRenderingHelper.java | 28 import org.w3c.dom.Node;
62 * @param root the root node (ie the top layout).
65 public ExplodedRenderingHelper(Node root, IProject iProject) {
84 * @param root the root node (ie the top layout).
87 public ExplodedRenderingHelper(Node root, Set<String> layoutNames) {
115 private void computePadding(Node view, int[] padding) {
123 Map<Node, int[]> childrenPadding = new HashMap<Node, int[]>(count);
125 Node child = children.item(i);
127 if (type == Node.ELEMENT_NODE) { // ignore TEXT/CDATA nodes
232 Node node = entry.getKey(); local
359 map.put(cleanUpIdReference(viewId), node); local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/extensions/ |
| ExpressionContext.java | 26 import org.w3c.dom.Node;
37 * Get the current context node.
38 * @return The current context node.
40 public Node getContextNode();
43 * Get the current context node list.
56 * Get the value of a node as a number.
57 * @param n Node to be converted to a number. May be null.
60 public double toNumber(Node n);
63 * Get the value of a node as a string.
64 * @param n Node to be converted to a string. May be null
[all...] |
