| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| PPosition.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PPosition extends Node
|
| PVariable.java | 3 package com.google.clearsilver.jsilver.syntax.node;
5 public abstract class PVariable extends Node
|
| Switch.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| /external/kmod/libkmod/ |
| libkmod-list.c | 30 static inline struct list_node *list_node_init(struct list_node *node)
32 node->next = node;
33 node->prev = node;
35 return node;
39 struct list_node *node)
42 list_node_init(node);
46 node->prev = list->prev;
47 list->prev->next = node;
191 struct list_node *node; local
209 struct list_node *node; local
[all...] |
| /external/python/cpython2/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/python/cpython3/Lib/lib2to3/fixes/ |
| fix_long.py | 16 def transform(self, node, results):
17 if is_probably_builtin(node):
18 node.value = "int"
19 node.changed()
|
| /external/v8/src/compiler/ |
| tail-call-optimization.cc | 10 #include "src/compiler/node-matchers.h"
11 #include "src/compiler/node-properties.h"
17 Reduction TailCallOptimization::Reduce(Node* node) {
18 if (node->opcode() != IrOpcode::kReturn) return NoChange();
22 Node* const call = NodeProperties::GetValueInput(node, 1);
25 NodeProperties::GetEffectInput(node) == call &&
27 Node* const control = NodeProperties::GetControlInput(node);
[all...] |
| simplified-lowering.cc | 17 #include "src/compiler/node-matchers.h"
18 #include "src/compiler/node-properties.h"
47 // During this phase, the usage information for a node determines the best
162 void ReplaceEffectControlUses(Node* node, Node* effect, Node* control) {
163 for (Edge edge : node->use_edges()) {
175 void ChangeToPureOp(Node* node, const Operator* new_op)
336 Node* node = current.node; local
358 Node* node = queue_.front(); local
565 Node* node = queue_.front(); local
585 Node* node = *i; local
597 Node* node = *i; local
621 Node* node = use_node->InputAt(index); local
2802 Node* node; member in struct:v8::internal::compiler::RepresentationSelector::NodeState
[all...] |
| graph-trimmer.h | 8 #include "src/compiler/node-marker.h"
19 // Trims dead nodes from the node graph.
33 Node* const node = *begin++; local
34 if (!node->IsDead()) MarkAsLive(node);
40 V8_INLINE bool IsLive(Node* const node) { return is_live_.Get(node); }
41 V8_INLINE void MarkAsLive(Node* const node)
[all...] |
| /frameworks/base/libs/hwui/tests/microbench/ |
| RenderNodeBench.cpp | 26 auto node = new RenderNode(); local
27 node->incStrong(0);
28 benchmark::DoNotOptimize(node);
29 node->decStrong(0);
|
| /frameworks/base/tools/incident_report/ |
| generic_message.cpp | 30 Node node; local
31 node.type = TYPE_VALUE32;
32 node.value32 = value;
33 mNodes.insert(pair<int32_t,Node>(fieldId, node));
39 Node node; local
40 node.type = TYPE_VALUE64;
41 node.value64 = value
49 Node node; local
59 Node node; local
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/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()
|
| /prebuilts/gdb/linux-x86/lib/python2.7/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()
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/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()
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/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()
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
[all...] |
| /external/python/cpython2/Lib/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| ast.py | 34 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
52 def _convert(node):
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts)
[all...] |
| /external/toybox/toys/posix/ |
| du.c | 48 struct dirtree *node; member in struct:node_size
53 static void print(long long size, struct dirtree *node)
70 if (node) name = dirtree_path(node, NULL);
72 if (node) free(name);
106 // dirtree callback, compute/display size of node
107 static int do_du(struct dirtree *node)
111 if (!node->parent) TT.st_dev = node->st.st_dev;
112 else if (!dirtree_notdotdot(node)) return 0
[all...] |
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| DOMSource.java | 23 import org.w3c.dom.Node;
41 * <p><code>Node</code> to serve as DOM source.</p>
43 private Node node; field in class:DOMSource
60 * no DOM source is set using {@link #setNode(Node node)} , then the
70 * Create a new input source with a DOM node. The operation
71 * will be applied to the subtree rooted at this node. In XSLT,
74 * from the root node also.
76 * @param n The DOM node that will contain the Source tree
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/ |
| regtrav.c | 35 capture_tree_traverse(OnigCaptureTreeNode* node, int at,
41 if (node == (OnigCaptureTreeNode* )0)
45 r = (*callback_func)(node->group, node->beg, node->end,
50 for (i = 0; i < node->num_childs; i++) {
51 r = capture_tree_traverse(node->childs[i], at,
57 r = (*callback_func)(node->group, node->beg, node->end,
[all...] |
