| /prebuilts/ndk/current/platforms/android-9/arch-x86/usr/include/linux/ |
| nodemask.h | 22 #define node_set(node, dst) __node_set((node), &(dst))
23 #define node_clear(node, dst) __node_clear((node), &(dst))
26 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits)
27 #define node_test_and_set(node, nodemask) __node_test_and_set((node), &(nodemask))
43 #define nodemask_of_node(node) ({ typeof(_unused_nodemask_arg_) m; if (sizeof(m) == sizeof(unsigned long)) { m.bits[0] = 1UL<<(node); } else { nodes_clear(m); node_set((node), m); } m; }
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| future.py | 25 def visitModule(self, node):
26 stmt = node.node
50 def visitFrom(self, node):
51 if hasattr(node, 'valid_future'):
53 if node.modname != "__future__":
55 raise SyntaxError, "invalid future statement " + repr(node)
57 def find_futures(node):
60 walk(node, p1)
61 walk(node, p2
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| future.py | 25 def visitModule(self, node):
26 stmt = node.node
50 def visitFrom(self, node):
51 if hasattr(node, 'valid_future'):
53 if node.modname != "__future__":
55 raise SyntaxError, "invalid future statement " + repr(node)
57 def find_futures(node):
60 walk(node, p1)
61 walk(node, p2
[all...] |
| /external/v8/src/compiler/ |
| load-elimination.cc | 8 #include "src/compiler/node-properties.h"
18 Reduction LoadElimination::Reduce(Node* node) {
19 switch (node->opcode()) {
21 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...] |
| instruction-selector-impl.h | 40 InstructionOperand DefineAsRegister(Node* node) {
41 return Define(node,
43 GetVReg(node)));
46 InstructionOperand DefineSameAsFirst(Node* node) {
47 return Define(node,
49 GetVReg(node)));
52 InstructionOperand DefineAsFixed(Node* node, Register reg)
[all...] |
| /external/v8/src/parsing/ |
| rewriter.cc | 69 // When visiting a node, we "return" a replacement for that node in
70 // [replacement_]. In many cases this will just be the original node.
83 // Node visitors.
84 #define DEF_VISIT(type) void Visit##type(type* node) override;
116 void Processor::VisitBlock(Block* node) {
125 if (!node->ignore_completion_value()) Process(node->statements());
126 replacement_ = node;
130 void Processor::VisitExpressionStatement(ExpressionStatement* node) {
[all...] |
| /external/v8/src/compiler/ia32/ |
| instruction-selector-ia32.cc | 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
20 InstructionOperand UseByteRegister(Node* node) {
22 return UseFixed(node, edx);
25 InstructionOperand DefineAsByteRegister(Node* node) {
27 return DefineAsRegister(node);
30 bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input
1392 Node* const node = value->InputAt(0); local
[all...] |
| /external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/imagepacker/ |
| ImagePacker.java | 66 static final class Node {
67 public Node leftChild;
68 public Node rightChild;
72 public Node (int x, int y, int width, int height, Node leftChild, Node rightChild, String leaveName) {
79 public Node () {
87 Node root;
104 this.root = new Node(0, 0, width, height, null, null, null);
122 Node node = insert(root, rect); local
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| LayoutRenderer.java | 94 ViewNode node = (ViewNode) selection.iterator().next(); local
97 ViewNode p = node.parent;
102 if (showExtras && node.image != null) {
103 s.drawImage(node.image, node.left, node.top, null);
105 s.drawRect(node.left, node.top, node.width - 1, node.height - 1)
[all...] |
| /development/ndk/platforms/android-3/include/linux/ |
| rbtree.h | 42 #define RB_EMPTY_NODE(node) (rb_parent(node) != node)
43 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
|
| /external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/ |
| test_import_from_init.py | 90 node = self.mf.findNode('pkg')
91 self.assertIsInstance(node, modulegraph.Package)
92 self.assertEqual(node.identifier, 'pkg')
96 node = self.mf.findNode('pkg.subpkg')
97 self.assertIsInstance(node, modulegraph.Package)
98 self.assertEqual(node.identifier, 'pkg.subpkg')
100 node = self.mf.findNode('pkg.subpkg.compat')
101 self.assertIsInstance(node, modulegraph.SourceModule)
102 self.assertEqual(node.identifier, 'pkg.subpkg.compat')
104 node = self.mf.findNode('pkg.subpkg._collections'
[all...] |
| /external/e2fsprogs/lib/uuid/ |
| unparse.c | 59 uuid.node[0], uuid.node[1], uuid.node[2],
60 uuid.node[3], uuid.node[4], uuid.node[5]);
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| SourceFileItem.java | 26 private final ICoverageNode node; field in class:SourceFileItem
28 SourceFileItem(final ISourceFileCoverage node) {
29 this.node = node;
33 return node.getName();
45 return node;
|
| /external/v8/src/interpreter/ |
| bytecode-dead-code-optimizer.cc | 24 void BytecodeDeadCodeOptimizer::Write(BytecodeNode* node) {
28 switch (node->bytecode()) {
38 next_stage_->Write(node);
42 void BytecodeDeadCodeOptimizer::WriteJump(BytecodeNode* node,
49 switch (node->bytecode()) {
58 next_stage_->WriteJump(node, label);
|
| /prebuilts/gdb/darwin-x86/include/python2.7/ |
| node.h | 2 /* Parse tree node interface */
17 } node; typedef in typeref:struct:_node
19 PyAPI_FUNC(node *) PyNode_New(int type);
20 PyAPI_FUNC(int) PyNode_AddChild(node *n, int type,
22 PyAPI_FUNC(void) PyNode_Free(node *n);
24 PyAPI_FUNC(Py_ssize_t) _PyNode_SizeOf(node *n);
27 /* Node access functions */
35 /* Assert that the type of a node is what we expect */
38 PyAPI_FUNC(void) PyNode_ListTree(node *);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| pycodegen.py | 150 def visitDict(self, node):
153 def visitGlobal(self, node):
154 for name in node.names:
157 def visitFunction(self, node):
158 self.names.add(node.name)
160 def visitLambda(self, node):
163 def visitImport(self, node):
164 for name, alias in node.names:
167 def visitFrom(self, node):
168 for name, alias in node.names
[all...] |
| syntax.py | 32 def error(self, node, msg):
35 print "%s:%s: %s" % (node.filename, node.lineno, msg)
37 raise SyntaxError, "%s (%s:%s)" % (msg, node.filename, node.lineno)
39 def visitAssign(self, node):
42 ## for target in node.nodes:
45 ## target.lineno = node.lineno
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_numliterals.py | 17 def match(self, node):
19 return (node.value.startswith(u"0") or node.value[-1] in u"Ll")
21 def transform(self, node, results):
22 val = node.value
28 return Number(val, prefix=node.prefix)
|
| /prebuilts/gdb/linux-x86/include/python2.7/ |
| node.h | 2 /* Parse tree node interface */
17 } node; typedef in typeref:struct:_node
19 PyAPI_FUNC(node *) PyNode_New(int type);
20 PyAPI_FUNC(int) PyNode_AddChild(node *n, int type,
22 PyAPI_FUNC(void) PyNode_Free(node *n);
24 PyAPI_FUNC(Py_ssize_t) _PyNode_SizeOf(node *n);
27 /* Node access functions */
35 /* Assert that the type of a node is what we expect */
38 PyAPI_FUNC(void) PyNode_ListTree(node *);
|
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| pycodegen.py | 150 def visitDict(self, node):
153 def visitGlobal(self, node):
154 for name in node.names:
157 def visitFunction(self, node):
158 self.names.add(node.name)
160 def visitLambda(self, node):
163 def visitImport(self, node):
164 for name, alias in node.names:
167 def visitFrom(self, node):
168 for name, alias in node.names
[all...] |
| syntax.py | 32 def error(self, node, msg):
35 print "%s:%s: %s" % (node.filename, node.lineno, msg)
37 raise SyntaxError, "%s (%s:%s)" % (msg, node.filename, node.lineno)
39 def visitAssign(self, node):
42 ## for target in node.nodes:
45 ## target.lineno = node.lineno
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_numliterals.py | 17 def match(self, node):
19 return (node.value.startswith(u"0") or node.value[-1] in u"Ll")
21 def transform(self, node, results):
22 val = node.value
28 return Number(val, prefix=node.prefix)
|
| /prebuilts/ndk/current/platforms/android-12/arch-arm/usr/include/linux/ |
| rbtree.h | 42 #define RB_EMPTY_NODE(node) (rb_parent(node) != node)
43 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
|
| /prebuilts/ndk/current/platforms/android-12/arch-mips/usr/include/linux/ |
| rbtree.h | 42 #define RB_EMPTY_NODE(node) (rb_parent(node) != node)
43 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
|
| /prebuilts/ndk/current/platforms/android-12/arch-x86/usr/include/linux/ |
| rbtree.h | 42 #define RB_EMPTY_NODE(node) (rb_parent(node) != node)
43 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
|
