| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/analysis/ |
| DepthFirstAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
10 public void inStart(Start node)
12 defaultIn(node);
15 public void outStart(Start node)
17 defaultOut(node);
20 public void defaultIn(@SuppressWarnings("unused") Node node)
25 public void defaultOut(@SuppressWarnings("unused") Node node)
31 public void caseStart(Start node)
[all...] |
| ReversedDepthFirstAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
10 public void inStart(Start node)
12 defaultIn(node);
15 public void outStart(Start node)
17 defaultOut(node);
20 public void defaultIn(@SuppressWarnings("unused") Node node)
25 public void defaultOut(@SuppressWarnings("unused") Node node)
31 public void caseStart(Start node)
[all...] |
| AnalysisAdapter.java | 6 import com.google.clearsilver.jsilver.syntax.node.*;
10 private Hashtable<Node,Object> in;
11 private Hashtable<Node,Object> out;
13 public Object getIn(Node node)
20 return this.in.get(node);
23 public void setIn(Node node, Object o)
27 this.in = new Hashtable<Node,Object>(1);
32 this.in.put(node, o)
[all...] |
| Analysis.java | 5 import com.google.clearsilver.jsilver.syntax.node.*;
9 Object getIn(Node node);
10 void setIn(Node node, Object o);
11 Object getOut(Node node);
12 void setOut(Node node, Object o);
14 void caseStart(Start node);
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/glslang/glslang/MachineIndependent/ |
| RemoveTree.cpp | 48 virtual void visitSymbol(TIntermSymbol* node)
50 delete node;
53 virtual bool visitBinary(TVisit /* visit*/ , TIntermBinary* node)
55 delete node;
60 virtual bool visitUnary(TVisit /* visit */, TIntermUnary* node)
62 delete node;
67 virtual bool visitAggregate(TVisit /* visit*/ , TIntermAggregate* node)
69 delete node;
74 virtual bool visitSelection(TVisit /* visit*/ , TIntermSelection* node)
76 delete node;
[all...] |
| /external/tensorflow/tensorflow/core/grappler/ |
| op_types.cc | 28 bool IsAdd(const NodeDef& node) {
29 if (node.op() == "AddV2" || node.op() == "Add") {
30 DataType type = node.attr().at("T").type();
36 bool IsAddN(const NodeDef& node) { return node.op() == "AddN"; }
38 bool IsAll(const NodeDef& node) { return node.op() == "All"; }
40 bool IsAngle(const NodeDef& node) { return node.op() == "Angle";
[all...] |
| op_types.h | 25 bool IsAdd(const NodeDef& node);
26 bool IsAddN(const NodeDef& node);
27 bool IsAll(const NodeDef& node);
28 bool IsAngle(const NodeDef& node);
29 bool IsAny(const NodeDef& node);
30 bool IsAnyDiv(const NodeDef& node);
31 bool IsApproximateEqual(const NodeDef& node);
32 bool IsAvgPoolGrad(const NodeDef& node);
33 bool IsAssert(const NodeDef& node);
34 bool IsAtan2(const NodeDef& node);
[all...] |
| /hardware/libhardware/tests/input/evdev/ |
| InputMocks.cpp | 30 auto node = new MockInputDeviceNode(); local
31 node->setPath("/dev/input/event0");
32 node->setName("elan-touchscreen");
35 node->setBusType(0);
36 node->setVendorId(0);
37 node->setProductId(0);
38 node->setVersion(0);
42 node->addAbsAxis(ABS_MT_SLOT, nullptr);
43 node->addAbsAxis(ABS_MT_TOUCH_MAJOR, nullptr);
44 node->addAbsAxis(ABS_MT_POSITION_X, nullptr)
55 auto node = new MockInputDeviceNode(); local
74 auto node = new MockInputDeviceNode(); local
93 auto node = new MockInputDeviceNode(); local
117 auto node = new MockInputDeviceNode(); local
135 auto node = new MockInputDeviceNode(); local
157 auto node = new MockInputDeviceNode(); local
175 auto node = new MockInputDeviceNode(); local
193 auto node = new MockInputDeviceNode(); local
212 auto node = new MockInputDeviceNode(); local
[all...] |
| /external/javassist/src/main/javassist/bytecode/annotation/ |
| MemberValueVisitor.java | 25 public void visitAnnotationMemberValue(AnnotationMemberValue node);
26 public void visitArrayMemberValue(ArrayMemberValue node);
27 public void visitBooleanMemberValue(BooleanMemberValue node);
28 public void visitByteMemberValue(ByteMemberValue node);
29 public void visitCharMemberValue(CharMemberValue node);
30 public void visitDoubleMemberValue(DoubleMemberValue node);
31 public void visitEnumMemberValue(EnumMemberValue node);
32 public void visitFloatMemberValue(FloatMemberValue node);
33 public void visitIntegerMemberValue(IntegerMemberValue node);
34 public void visitLongMemberValue(LongMemberValue node);
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| CaptureRenderer.java | 25 private ViewNode node; field in class:CaptureRenderer
28 CaptureRenderer(ImageIcon icon, ViewNode node) {
30 this.node = node;
38 if (node.hasMargins) {
39 d.width += node.marginLeft + node.marginRight;
40 d.height += node.marginTop + node.marginBottom;
65 if ((node.paddingBottom | node.paddingLeft
[all...] |
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/ |
| TreeVisitor.java | 26 public void visitDepthFirst(Node node){
27 process(node);
28 for (Node child : node.getChildrenNodes()){
33 public abstract void process(Node node);
|
| /hardware/libhardware/modules/input/evdev/ |
| InputDeviceManager.cpp | 28 void InputDeviceManager::onInputEvent(const std::shared_ptr<InputDeviceNode>& node, InputEvent& event,
30 if (mDevices[node] == nullptr) {
31 ALOGE("got input event for unknown node %s", node->getPath().c_str());
34 mDevices[node]->processInput(event, event_time);
37 void InputDeviceManager::onDeviceAdded(const std::shared_ptr<InputDeviceNode>& node) {
38 mDevices[node] = std::make_shared<EvdevDevice>(mHost, node);
41 void InputDeviceManager::onDeviceRemoved(const std::shared_ptr<InputDeviceNode>& node) {
42 if (mDevices[node] == nullptr)
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| rotatingtree.c | 28 /* Insert a new node into the tree.
31 RotatingTree_Add(rotating_node_t **root, rotating_node_t *node)
34 if (KEY_LOWER_THAN(node->key, (*root)->key))
39 node->left = NULL;
40 node->right = NULL;
41 *root = node;
44 /* Locate the node with the given key. This is the most complicated
46 resulting node closer to the root. */
52 rotating_node_t *node = *root;
local
53 while (node != NULL) {
65 rotating_node_t *node = *pnode; local
111 rotating_node_t *node; local
[all...] |
| /external/python/cpython2/Modules/ |
| rotatingtree.c | 28 /* Insert a new node into the tree.
31 RotatingTree_Add(rotating_node_t **root, rotating_node_t *node)
34 if (KEY_LOWER_THAN(node->key, (*root)->key))
39 node->left = NULL;
40 node->right = NULL;
41 *root = node;
44 /* Locate the node with the given key. This is the most complicated
46 resulting node closer to the root. */
52 rotating_node_t *node = *root; local
53 while (node != NULL)
65 rotating_node_t *node = *pnode; local
111 rotating_node_t *node; local
[all...] |
| /external/python/cpython3/Modules/ |
| rotatingtree.c | 28 /* Insert a new node into the tree.
31 RotatingTree_Add(rotating_node_t **root, rotating_node_t *node)
34 if (KEY_LOWER_THAN(node->key, (*root)->key))
39 node->left = NULL;
40 node->right = NULL;
41 *root = node;
44 /* Locate the node with the given key. This is the most complicated
46 resulting node closer to the root. */
52 rotating_node_t *node = *root; local
53 while (node != NULL)
65 rotating_node_t *node = *pnode; local
111 rotating_node_t *node; local
[all...] |
| /external/v8/src/ast/ |
| ast-expression-rewriter.cc | 17 #define REWRITE_THIS(node) \
19 if (!RewriteExpression(node)) return; \
54 VariableDeclaration* node) {
61 FunctionDeclaration* node) {
63 AST_REWRITE_PROPERTY(FunctionLiteral, node, fun);
67 void AstExpressionRewriter::VisitBlock(Block* node) {
68 VisitStatements(node->statements());
73 ExpressionStatement* node) {
74 AST_REWRITE_PROPERTY(Expression, node, expression);
78 void AstExpressionRewriter::VisitEmptyStatement(EmptyStatement* node) {
[all...] |
| /external/v8/src/compiler/ |
| node-properties.h | 8 #include "src/compiler/node.h"
21 // A facade that simplifies access to the different kinds of inputs to a node.
27 // 0 [ values, context, frame state, effects, control ] node->InputCount()
29 static int FirstValueIndex(Node* node) { return 0; }
30 static int FirstContextIndex(Node* node) { return PastValueIndex(node); }
31 static int FirstFrameStateIndex(Node* node) { return PastContextIndex(node);
[all...] |
| escape-analysis.h | 31 Node* GetReplacement(Node* node);
32 Node* ResolveReplacement(Node* node);
33 bool IsVirtual(Node* node);
34 bool IsEscaped(Node* node);
[all...] |
| /external/tensorflow/tensorflow/contrib/py2tf/pyct/static_analysis/ |
| live_values.py | 40 def visit_ClassDef(self, node):
41 self.generic_visit(node)
42 anno.setanno(node, 'live_val', self.context.namespace[node.name])
43 return node
45 def visit_Name(self, node):
46 self.generic_visit(node)
47 if isinstance(node.ctx, gast.Load):
48 assert anno.hasanno(node, NodeAnno.IS_LOCAL), node
[all...] |
| /external/tensorflow/tensorflow/contrib/py2tf/converters/ |
| logical_expressions.py | 41 def visit_Compare(self, node):
42 node = self.generic_visit(node)
43 if len(node.ops) > 1:
45 cmp_type = type(node.ops[0])
49 func=tf_function, args=[node.left, node.comparators[0]], keywords=[])
50 return node
52 def visit_UnaryOp(self, node):
53 node = self.generic_visit(node
[all...] |
| /external/tensorflow/tensorflow/contrib/lite/toco/tensorflow_graph_matching/ |
| cluster.cc | 21 for (const tensorflow::NodeDef& node : graph_def_->node()) {
22 if (StrContains(node.name(), name_)) {
23 nodes_.push_back(&node);
29 // For every node N in the graph:
34 for (const tensorflow::NodeDef& node : graph_def_->node()) {
35 if (StrContains(node.name(), name_)) {
36 for (int i = 0; i < node.input_size(); i++) {
37 if (!StrContains(node.input(i), name_))
[all...] |
| /external/libnl/lib/ |
| hashtable.c | 61 nl_hash_node_t *node = ht->nodes[i]; local
64 while (node) {
65 saved_node = node;
66 node = node->next;
89 nl_hash_node_t *node; local
93 node = ht->nodes[key_hash];
95 while (node) {
96 if (nl_object_identical(node->obj, obj))
97 return node->obj
119 nl_hash_node_t *node; local
163 nl_hash_node_t *node, *prev; local
[all...] |
| /system/libufdt/include/ |
| ufdt_types.h | 23 #define for_each(it, node) \
24 if ((node) != NULL) \
25 for ((it) = (node)->nodes; (it) != (node)->nodes + (node)->mem_size; ++(it)) \
28 #define for_each_child(it, node) \
29 if (ufdt_node_tag(node) == FDT_BEGIN_NODE) \
30 for ((it) = &(((struct ufdt_node_fdt_node *)(node))->child); *(it); \
33 #define for_each_prop(it, node) \
34 for_each_child(it, node) if (ufdt_node_tag(*(it)) == FDT_PROP
71 struct ufdt_node *node; member in struct:ufdt_phandle_table_entry
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/interpreter/ |
| ExpressionEvaluator.java | 23 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
24 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
25 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
26 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
27 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
28 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
30 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
31 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
32 import com.google.clearsilver.jsilver.syntax.node.AGteExpression
[all...] |
| /external/tensorflow/tensorflow/python/profiler/internal/ |
| flops_registry.py | 46 def _zero_flops(graph, node):
48 del graph, node # graph and node are unused
64 def _unary_op_flops(graph, node, ops_per_element=1):
66 in_shape = graph_util.tensor_shape_from_node_def_name(graph, node.input[0])
72 def _reciprocal_flops(graph, node):
74 return _unary_op_flops(graph, node)
78 def _square_flops(graph, node):
80 return _unary_op_flops(graph, node)
84 def _rsqrt_flops(graph, node)
[all...] |
