| /external/v8/src/compiler/ |
| select-lowering.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
23 Reduction SelectLowering::Reduce(Node* node) {
24 if (node->opcode() != IrOpcode::kSelect) return NoChange();
25 SelectParameters const p = SelectParametersOf(node->op());
27 Node* cond = node->InputAt(0);
28 Node* vthen = node->InputAt(1)
[all...] |
| graph-reducer.h | 9 #include "src/compiler/node-marker.h"
19 class Node;
23 // out-of-line data associated with each node.
27 // Represents the result of trying to reduce a node in the graph.
30 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {}
32 Node* replacement() const { return replacement_; }
36 Node* replacement_;
40 // A reducer can reduce or simplify a given node based on its operator and
49 // Try to reduce a node if possible.
50 virtual Reduction Reduce(Node* node) = 0
142 Node* node; member in class:v8::internal::compiler::GraphReducer::State
[all...] |
| node-properties.cc | 5 #include "src/compiler/node-properties.h"
10 #include "src/compiler/node-matchers.h"
22 int NodeProperties::PastValueIndex(Node* node) {
23 return FirstValueIndex(node) + node->op()->ValueInputCount();
28 int NodeProperties::PastContextIndex(Node* node) {
29 return FirstContextIndex(node) +
30 OperatorProperties::GetContextInputCount(node->op())
90 Node* const node = edge.from(); local
98 Node* const node = edge.from(); local
106 Node* const node = edge.from(); local
114 Node* const node = edge.from(); local
122 Node* const node = edge.from(); local
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| move_to_front.h | 49 // node: handle used internally to access node data.
50 // size: size of the subtree of a node (including the node).
51 // height: distance from a node to the farthest leaf.
58 // Create NIL node.
59 nodes_.emplace_back(Node());
106 // with DeprecateValue(). But handles are recycled when a node is repositioned.
108 // Internal tree data structure node.
109 struct Node {
136 Node& node = nodes_.back(); local
486 uint32_t node = target; local
566 uint32_t node = root_; local
[all...] |
| /external/libmojo/third_party/jinja2/ |
| optimizer.py | 23 def optimize(node, environment):
27 return optimizer.visit(node)
35 def visit_If(self, node):
39 if node.find(nodes.Block) is not None:
40 return self.generic_visit(node)
42 val = self.visit(node.test).as_const()
44 return self.generic_visit(node)
46 body = node.body
48 body = node.else_
50 for node in body
[all...] |
| /frameworks/support/jetifier/jetifier/processor/src/main/kotlin/com/android/tools/build/jetifier/processor/transform/pom/ |
| PomDependencyExtensions.kt | 24 * Transforms the current data into XML '<dependency>' node.
27 val node = Element("dependency")
28 node.namespace = document.rootElement.namespace
30 XmlUtils.addStringNodeToNode(node, "groupId", groupId)
31 XmlUtils.addStringNodeToNode(node, "artifactId", artifactId)
32 XmlUtils.addStringNodeToNode(node, "version", version)
33 XmlUtils.addStringNodeToNode(node, "classifier", classifier)
34 XmlUtils.addStringNodeToNode(node, "type", type)
35 XmlUtils.addStringNodeToNode(node, "scope", scope)
36 XmlUtils.addStringNodeToNode(node, "systemPath", systemPath
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| ALoopIncCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
67 public void setPosition(PPosition node)
74 if(node != null)
76 if(node.parent() != null)
78 node.parent().removeChild(node);
81 node.parent(this);
84 this._position_ = node;
92 public void setVariable(PVariable node)
99 if(node != null
[all...] |
| AEachCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node)
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setVariable(PVariable node)
89 if(node != null
[all...] |
| AIfCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node)
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setExpression(PExpression node)
89 if(node != null
[all...] |
| ALoopToCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node)
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setVariable(PVariable node)
89 if(node != null
[all...] |
| AWithCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
57 public void setPosition(PPosition node)
64 if(node != null)
66 if(node.parent() != null)
68 node.parent().removeChild(node);
71 node.parent(this);
74 this._position_ = node;
82 public void setVariable(PVariable node)
89 if(node != null
[all...] |
| PCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PCommand extends Node
|
| PExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PExpression extends Node
|
| /external/freetype/src/cache/ |
| ftcmru.c | 30 FTC_MruNode node )
47 if ( cnode == node )
58 first->prev = node;
59 last->next = node;
60 node->next = first;
61 node->prev = last;
65 node->next = node;
66 node->prev = node;
207 FTC_MruNode first, node; local
241 FTC_MruNode node = NULL; local
295 FTC_MruNode node; local
331 FTC_MruNode first, node, next; local
[all...] |
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/scripts/mako/ |
| _ast_util.py | 83 """Parse an expression into an AST node."""
87 def to_source(node, indent_with=' ' * 4):
89 This function can convert a node tree back into python sourcecode. This
103 generator.visit(node)
107 def dump(node):
109 A very verbose representation of the node passed. This is useful for
112 def _format(node):
113 if isinstance(node, AST):
114 return '%s(%s)' % (node.__class__.__name__,
116 for a, b in iter_fields(node)))
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = ext2fs_rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 ext2fs_rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 ext2fs_rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
50 struct rb_node *left = node->rb_left
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| AutoEscaper.java | 23 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
24 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand;
25 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
26 import com.google.clearsilver.jsilver.syntax.node.AContentTypeCommand;
27 import com.google.clearsilver.jsilver.syntax.node.ACsOpenPosition;
28 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
29 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
30 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand;
31 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
32 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand
134 PCommand node = start.getPCommand(); local
[all...] |
| /external/v8/src/ast/ |
| ast-numbering.cc | 32 bool Renumber(FunctionLiteral* node);
35 // AST node visitor interface.
36 #define DEFINE_VISIT(type) void Visit##type(type* node);
40 void VisitVariableProxy(VariableProxy* node, TypeofMode typeof_mode);
41 void VisitVariableProxyReference(VariableProxy* node);
42 void VisitPropertyReference(Property* node);
45 void VisitStatementsAndDeclarations(Block* node);
70 template <typename Node>
71 void ReserveFeedbackSlots(Node* node) {
[all...] |
| /external/libmojo/third_party/catapult/devil/devil/utils/ |
| usb_hubs.py | 20 id_func: [USBNode -> bool] is a function that can be run on a node
21 to determine if the node represents this type of hub.
35 def IsType(self, node):
36 """Determines if the given Node is a hub of this type.
39 node: [USBNode] Node to check.
41 return self._id_func(node)
43 def GetPhysicalPortToNodeTuples(self, node):
47 node: [USBNode] Node representing a hub of this type
[all...] |
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| DOMResult.java | 23 import org.w3c.dom.Node;
28 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation,
45 * <p><code>node</code>,
57 * <p>Use a DOM node to create a new output target.</p>
59 * <p>In practice, the node should be
60 * a {@link org.w3c.dom.Document} node,
61 * a {@link org.w3c.dom.DocumentFragment} node, or
62 * a {@link org.w3c.dom.Element} node.
63 * In other words, a node that accepts children.</p>
69 * @param node The DOM node that will contain the result tree
337 private Node node = null; field in class:DOMResult
[all...] |
| /external/oj-libjdwp/src/share/back/ |
| commonRef.c | 89 RefNode *node; local
94 node = (RefNode*)jvmtiAllocate((int)sizeof(RefNode));
95 if (node == NULL) {
102 jvmtiDeallocate(node);
108 (gdata->jvmti, weakRef, ptr_to_jlong(node));
111 jvmtiDeallocate(node);
116 node->ref = weakRef;
117 node->isStrong = JNI_FALSE;
118 node->count = 1;
119 node->seqNum = newSeqNum()
207 RefNode *node; local
220 RefNode *node; local
267 RefNode *node; local
317 RefNode *node; local
379 RefNode *node; local
416 RefNode *node; local
445 RefNode *node; local
491 RefNode *node; local
522 RefNode *node; local
560 RefNode *node; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/ |
| fix_long.py | 16 def transform(self, node, results):
17 if is_probably_builtin(node):
18 node.value = u"int"
19 node.changed()
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/ |
| TreeVisitor.java | 24 import com.github.javaparser.ast.Node;
31 * Iterate over all the nodes in (a part of) the AST. In contrast to the visit methods in Node, these methods are
37 public void visitLeavesFirst(Node node) {
38 for (Node child : node.getChildNodes()) {
41 process(node);
45 * Performs a pre-order node traversal starting with a given node. When each node is visited, {@link #process(Node)
[all...] |
| /external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/ |
| JavaParserFactory.java | 20 import com.github.javaparser.ast.Node;
48 public static Context getContext(Node node, TypeSolver typeSolver) {
49 if (node == null) {
50 throw new NullPointerException("Node should not be null");
51 } else if (node instanceof CompilationUnit) {
52 return new CompilationUnitContext((CompilationUnit) node, typeSolver);
53 } else if (node instanceof ForeachStmt) {
54 return new ForechStatementContext((ForeachStmt) node, typeSolver);
55 } else if (node instanceof ForStmt)
[all...] |
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/ |
| TreeVisitor.java | 24 import com.github.javaparser.ast.Node;
34 * @param node the start node, and the first one that is passed to process(node).
36 public void visitDepthFirst(Node node) {
37 process(node);
38 for (Node child : node.getChildrenNodes()) {
43 public abstract void process(Node node)
[all...] |
