| /external/v8/test/unittests/compiler/ |
| dead-code-elimination-unittest.cc | 9 #include "test/unittests/compiler/node-test-utils.h"
25 Reduction Reduce(AdvancedReducer::Editor* editor, Node* node) {
27 return reducer.Reduce(node);
30 Reduction Reduce(Node* node) {
32 return Reduce(&editor, node);
59 Node* const value = Parameter(0);
60 Node* const effect = graph()->start();
61 Node* const dead = graph()->NewNode(common()->Dead())
62 Node* const node = graph()->NewNode(&kOp0, value, effect, dead); local
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| LinkedList.java | 90 * Pointer to first node.
94 transient Node<E> first;
97 * Pointer to last node.
101 transient Node<E> last;
126 final Node<E> f = first;
127 final Node<E> newNode = new Node<>(null, e, f);
141 final Node<E> l = last;
142 final Node<E> newNode = new Node<>(l, e, null)
566 Node<E> node(int index) { method in class:LinkedList
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| DOM3Serializer.java | 27 import org.w3c.dom.Node;
117 * Serializes the Level 3 DOM node. Throws an exception only if an I/O
122 * @param node the Level 3 DOM node to serialize
125 public void serializeDOM3(Node node) throws IOException;
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ContextNodeList.java | 23 import org.w3c.dom.Node;
28 * <a href="http://www.w3.org/TR/xslt#dt-current-node-list">current node list</a>,
29 * also refered to here as a <term>context node list</term>.
36 * Get the <a href="http://www.w3.org/TR/xslt#dt-current-node">current node</a>.
39 * @return The current node, or null.
41 public Node getCurrentNode();
50 * <a href="http://www.w3.org/TR/xslt#dt-current-node">current node</a
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| InterfaceNode.java | 20 * Node for an interface type that has been bound to an implementation class or instance.
26 public class InterfaceNode extends Node {
31 @Override public Node copy(NodeId id) {
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/ |
| NumberAnchorGenerator.java | 18 import org.yaml.snakeyaml.nodes.Node;
30 public String nextAnchor(Node node) {
|
| /external/snakeyaml/src/test/java/examples/jodatime/ |
| JodaTimeRepresenter.java | 21 import org.yaml.snakeyaml.nodes.Node;
31 public Node representData(Object data) {
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue9/ |
| BeanConstructor3.java | 19 import org.yaml.snakeyaml.nodes.Node;
30 public Object construct(Node node) {
|
| /external/v8/src/compiler/ |
| loop-peeling.h | 19 // Maps {node} to its corresponding copy in the peeled iteration, if
20 // the node was part of the body of the loop. Returns {node} otherwise.
21 Node* map(Node* node);
|
| value-numbering-reducer.h | 19 Reduction Reduce(Node* node) override;
27 Node** entries_;
|
| load-elimination.cc | 7 #include "src/compiler/node-properties.h"
17 Reduction LoadElimination::Reduce(Node* node) {
18 switch (node->opcode()) {
20 return ReduceLoadField(node);
28 Reduction LoadElimination::ReduceLoadField(Node* node) {
29 DCHECK_EQ(IrOpcode::kLoadField, node->opcode());
30 FieldAccess const access = FieldAccessOf(node->op());
31 Node* object = NodeProperties::GetValueInput(node, 0)
[all...] |
| node-matchers.cc | 5 #include "src/compiler/node-matchers.h"
16 BranchMatcher::BranchMatcher(Node* branch)
19 for (Node* use : branch->uses()) {
31 DiamondMatcher::DiamondMatcher(Node* merge)
38 Node* input0 = merge->InputAt(0);
40 Node* input1 = merge->InputAt(1);
42 Node* branch = input0->InputAt(0);
|
| control-flow-optimizer.cc | 9 #include "src/compiler/node-matchers.h"
10 #include "src/compiler/node-properties.h"
31 Node* node = queue_.front(); local
33 if (node->IsDead()) continue;
34 switch (node->opcode()) {
36 VisitBranch(node);
39 VisitNode(node);
46 void ControlFlowOptimizer::Enqueue(Node* node) {
[all...] |
| /external/v8/src/profiler/ |
| unbound-queue.h | 35 struct Node;
37 Node* first_;
38 base::AtomicWord divider_; // Node*
39 base::AtomicWord last_; // Node*
|
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| CommentImpl.java | 20 import org.w3c.dom.Node;
45 return Node.COMMENT_NODE;
|
| EntityReferenceImpl.java | 20 import org.w3c.dom.Node;
48 return Node.ENTITY_REFERENCE_NODE;
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeFilter.java | 15 import org.w3c.dom.Node;
21 * node. If the filter says to accept the node, the traversal logic returns
22 * it; otherwise, traversal looks for the next node and pretends that the
23 * node that was rejected was not there.
26 * <p><code>NodeFilters</code> do not need to know how to traverse from node
27 * to node, nor do they need to know anything about the data structure that
29 * only thing they have to know how to do is evaluate a single node. One
40 * Accept the node. Navigation methods defined for
42 * node
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/ |
| UiTextValueNode.java | 22 import org.w3c.dom.Node;
45 public void updateValue(Node xml_attribute_node) {
50 // the parent element, which is actually the first text node of the element.
54 Node xml_node = parent.getXmlNode();
56 for (Node xml_child = xml_node.getFirstChild();
59 if (xml_child.getNodeType() == Node.TEXT_NODE) {
86 // Get (or create) the underlying XML element node that contains the value.
87 Node element = parent.prepareCommit();
94 for (Node xml_child = element.getFirstChild();
97 if (xml_child.getNodeType() == Node.TEXT_NODE)
[all...] |
| /external/jetty/src/java/org/eclipse/jetty/webapp/ |
| IterativeDescriptorProcessor.java | 35 public static final Class<?>[] __signature = new Class[]{WebAppContext.class, Descriptor.class, XmlParser.Node.class};
41 * Register a method to be called back when visiting the node with the given name.
43 * public void method (Descriptor descriptor, XmlParser.Node node)
64 XmlParser.Node root = descriptor.getRoot();
66 XmlParser.Node node = null; local
70 if (!(o instanceof XmlParser.Node)) continue;
71 node = (XmlParser.Node) o
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/composer/ |
| Composer.java | 32 import org.yaml.snakeyaml.nodes.Node;
42 * Creates a node graph from parser events.
51 private final Map<String, Node> anchors;
52 private final Set<Node> recursiveNodes;
57 this.anchors = new HashMap<String, Node>();
58 this.recursiveNodes = new HashSet<Node>();
78 * @return The root node of the document or <code>null</code> if no more
81 public Node getNode() {
82 // Get the root node of the next document.
96 * @return The root node of the document or <code>null</code> if no documen
122 Node node = composeNode(null); local
149 Node node = null; local
173 Node node = new ScalarNode(nodeTag, resolved, ev.getValue(), ev.getStartMark(), local
193 SequenceNode node = new SequenceNode(nodeTag, resolved, children, local
219 MappingNode node = new MappingNode(nodeTag, resolved, children, startEvent.getStartMark(), local
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-graph-visualizer.cc | 10 #include "src/compiler/node.h"
33 Node* start = graph.NewNode(common.Start(0));
35 Node* k = graph.NewNode(common.Int32Constant(0));
36 Node* phi =
52 Node* start = graph.NewNode(common.Start(0));
54 Node* k = graph.NewNode(common.Int32Constant(0));
55 Node* phi =
71 Node* start = graph.NewNode(common.Start(0));
73 Node* k = graph.NewNode(common.Int32Constant(0));
74 Node* phi
[all...] |
| test-machine-operator-reducer.cc | 66 Node* s = graph.NewNode(common.Start(num_parameters));
79 Node* maxuint32;
82 Node* Constant(volatile T value) {
101 void CheckFoldBinop(volatile T expect, Node* a, Node* b) {
103 Node* n = CreateBinopNode(a, b);
112 // the {expect} node.
113 void CheckBinop(Node* expect, Node* a, Node* b)
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| nodeinsertbeforenomodificationallowederr.java | 33 * if the node is readonly.
70 Node genderNode;
71 Node entRef;
72 Node entElement;
73 Node createdNode;
74 Node insertedNode;
75 Node refChild = null;
|
| /external/llvm/lib/Target/MSP430/ |
| MSP430ISelDAGToDAG.cpp | 132 /// MatchWrapper - Try to match MSP430ISD::Wrapper node into an addressing mode.
165 /// MatchAddressBase - Helper for MatchAddress. Add the specified node to the
380 SDNode *MSP430DAGToDAGISel::Select(SDNode *Node) {
381 SDLoc dl(Node);
383 // Dump information about the Node being selected
385 DEBUG(Node->dump(CurDAG));
388 // If we have a custom node, we already have selected!
389 if (Node->isMachineOpcode()) {
391 Node->dump(CurDAG);
393 Node->setNodeId(-1)
[all...] |
| /external/gemmlowp/profiling/ |
| profiler.h | 113 // Each node shows the absolute percentage, among all the samples,
115 // The percentages are *NOT* relative to the parent node. In addition
117 // the remainder of samples under the parent node that didn't fall into
158 struct Node {
159 std::vector<Node*> children;
162 Node() : label(nullptr), weight(0) {}
163 ~Node() {
170 static bool CompareNodes(Node* n1, Node* n2) {
174 Node root_
[all...] |
