/prebuilts/ndk/current/platforms/android-17/arch-mips/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/ndk/current/platforms/android-17/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/ndk/current/platforms/android-18/arch-arm/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/ndk/current/platforms/android-18/arch-mips/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/ndk/current/platforms/android-18/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/ndk/current/platforms/android-19/arch-arm/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/ndk/current/platforms/android-19/arch-mips/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/ndk/current/platforms/android-19/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/ndk/current/platforms/android-3/arch-arm/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/ndk/current/platforms/android-4/arch-arm/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/ndk/current/platforms/android-5/arch-arm/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/ndk/current/platforms/android-8/arch-arm/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/ndk/current/platforms/android-9/arch-arm/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/ndk/current/platforms/android-9/arch-mips/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/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/parsing/ |
rewriter.cc | 68 // When visiting a node, we "return" a replacement for that node in 69 // [replacement_]. In many cases this will just be the original node. 82 // Node visitors. 83 #define DEF_VISIT(type) void Visit##type(type* node) override; 115 void Processor::VisitBlock(Block* node) { 124 if (!node->ignore_completion_value()) Process(node->statements()); 125 replacement_ = node; 129 void Processor::VisitExpressionStatement(ExpressionStatement* node) { [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...] |
/external/v8/src/compiler/ |
verifier.cc | 17 #include "src/compiler/node.h" 18 #include "src/compiler/node-properties.h" 32 static bool IsDefUseChainLinkPresent(Node* def, Node* use) { 38 static bool IsUseDefChainLinkPresent(Node* def, Node* use) { 48 void Check(Node* node); 54 void CheckNotTyped(Node* node) { 956 Node* node = proj->InputAt(0); local 1199 Node* node = block->NodeAt(i); local [all...] |
escape-analysis.cc | 15 #include "src/compiler/node.h" 16 #include "src/compiler/node-matchers.h" 17 #include "src/compiler/node-properties.h" 60 Node* GetField(size_t offset) { 74 bool SetField(size_t offset, Node* node, bool created_phi = false) { 75 bool changed = fields_[offset] != node || phi_[offset] != created_phi; 76 fields_[offset] = node; 78 if (changed && FLAG_trace_turbo_escape && node) { 79 PrintF("Setting field %zu of #%d to #%d (%s)\n", offset, id(), node->id() 478 Node* node = queue_.front(); local 746 Node* node = stack.back(); local 801 Node* node = stack.back(); local 1141 Node* node = nullptr; local [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;
|