| /hardware/qcom/camera/QCamera2/stack/mm-camera-test/src/ |
| mm_qcamera_queue.c | 85 camera_q_node *node = local
87 if (NULL == node) {
92 memset(node, 0, sizeof(camera_q_node));
93 node->data = data;
96 cam_list_add_tail_node(&node->list, &queue->m_head.list);
109 camera_q_node* node = NULL; local
122 node = member_of(pos, camera_q_node, list);
123 cam_list_del_node(&node->list);
128 if (NULL != node) {
129 data = node->data
138 camera_q_node* node = NULL; local
[all...] |
| /hardware/qcom/camera/msmcobalt/QCamera2/stack/mm-camera-test/src/ |
| mm_qcamera_queue.c | 85 camera_q_node *node = local
87 if (NULL == node) {
92 memset(node, 0, sizeof(camera_q_node));
93 node->data = data;
96 cam_list_add_tail_node(&node->list, &queue->m_head.list);
109 camera_q_node* node = NULL; local
122 node = member_of(pos, camera_q_node, list);
123 cam_list_del_node(&node->list);
128 if (NULL != node) {
129 data = node->data
138 camera_q_node* node = NULL; local
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_next.py | 46 def transform(self, node, results):
59 node.replace(Call(Name(u"next", prefix=node.prefix), base))
67 if is_assign_target(node):
70 self.warning(node, bind_warning)
74 self.warning(node, bind_warning)
78 ### The following functions help test if node is part of an assignment
81 def is_assign_target(node):
82 assign = find_assign(node)
89 elif is_subtree(child, node)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_next.py | 46 def transform(self, node, results):
59 node.replace(Call(Name(u"next", prefix=node.prefix), base))
67 if is_assign_target(node):
70 self.warning(node, bind_warning)
74 self.warning(node, bind_warning)
78 ### The following functions help test if node is part of an assignment
81 def is_assign_target(node):
82 assign = find_assign(node)
89 elif is_subtree(child, node)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_next.py | 46 def transform(self, node, results):
59 node.replace(Call(Name(u"next", prefix=node.prefix), base))
67 if is_assign_target(node):
70 self.warning(node, bind_warning)
74 self.warning(node, bind_warning)
78 ### The following functions help test if node is part of an assignment
81 def is_assign_target(node):
82 assign = find_assign(node)
89 elif is_subtree(child, node)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_next.py | 46 def transform(self, node, results):
59 node.replace(Call(Name(u"next", prefix=node.prefix), base))
67 if is_assign_target(node):
70 self.warning(node, bind_warning)
74 self.warning(node, bind_warning)
78 ### The following functions help test if node is part of an assignment
81 def is_assign_target(node):
82 assign = find_assign(node)
89 elif is_subtree(child, node)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| transformer.py | 74 # get a terminal node
82 def Node(*args):
91 raise WalkerError, "Can't find appropriate Node type: %s" % str(args)
92 #return apply(ast.Node, args)
145 def compile_node(self, node):
146 ### emit a line-number node?
147 n = node[0]
150 self.encoding = node[2]
151 node = node[1
[all...] |
| 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/gdb/linux-x86/lib/python2.7/compiler/ |
| transformer.py | 74 # get a terminal node
82 def Node(*args):
91 raise WalkerError, "Can't find appropriate Node type: %s" % str(args)
92 #return apply(ast.Node, args)
145 def compile_node(self, node):
146 ### emit a line-number node?
147 n = node[0]
150 self.encoding = node[2]
151 node = node[1
[all...] |
| 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/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 74 # get a terminal node
82 def Node(*args):
91 raise WalkerError, "Can't find appropriate Node type: %s" % str(args)
92 #return apply(ast.Node, args)
145 def compile_node(self, node):
146 ### emit a line-number node?
147 n = node[0]
150 self.encoding = node[2]
151 node = node[1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 74 # get a terminal node
82 def Node(*args):
91 raise WalkerError, "Can't find appropriate Node type: %s" % str(args)
92 #return apply(ast.Node, args)
145 def compile_node(self, node):
146 ### emit a line-number node?
147 n = node[0]
150 self.encoding = node[2]
151 node = node[1
[all...] |
| /development/ndk/platforms/android-3/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...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMAxisIterNodeList.java | 27 import org.w3c.dom.Node;
100 * @return The node at the <code>index</code>th position in the
104 public Node item(int index) {
106 int node; local
110 node = m_cachedNodes.elementAt(index);
111 return m_dtm.getNode(node);
113 while (((node = m_iter.next()) != DTMAxisIterator.END)
115 m_cachedNodes.addElement(node);
118 if (node == DTMAxisIterator.END) {
121 return m_dtm.getNode(node);
134 int node; local
[all...] |
| /external/icu/tools/srcgen/currysrc/src/main/java/com/google/currysrc/processors/ |
| BaseJavadocTagClasses.java | 48 public boolean visit(TypeDeclaration node) {
49 return visitAbstract(node);
53 public boolean visit(EnumDeclaration node) {
54 return visitAbstract(node);
57 private boolean visitAbstract(AbstractTypeDeclaration node) {
58 if (mustTag(node)) {
59 toHide.add(node);
65 for (AbstractTypeDeclaration node : Lists.reverse(toHide)) {
66 JavadocUtils.addJavadocTag(rewrite, node, tagText);
70 protected abstract boolean mustTag(AbstractTypeDeclaration node);
[all...] |
| /external/libchrome/base/debug/ |
| leak_tracker.h | 89 for (LinkNode<LeakTracker<T> >* node = instances()->head();
90 node != instances()->end();
91 node = node->next()) {
92 StackTrace& allocation_stack = node->value()->allocation_stack_;
99 LOG_STREAM(ERROR) << "Leaked " << node << " which was allocated by:";
117 for (LinkNode<LeakTracker<T> >* node = instances()->head();
118 node != instances()->end();
119 node = node->next())
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/composer/ |
| ComposerImplTest.java | 24 import org.yaml.snakeyaml.nodes.Node;
32 Node node = yaml.compose(new StringReader(data)); local
33 assertNotNull(node);
34 assertTrue(node instanceof MappingNode);
36 Node node2 = yaml.compose(new StringReader(data2));
38 assertFalse(node.equals(node2));
44 Node node = yaml.compose(new StringReader(data)); local
45 assertNotNull(node);
[all...] |
| /external/v8/src/compiler/ |
| common-operator-reducer.h | 29 Reduction Reduce(Node* node) final;
32 Reduction ReduceBranch(Node* node);
33 Reduction ReduceDeoptimizeConditional(Node* node);
34 Reduction ReduceMerge(Node* node);
35 Reduction ReduceEffectPhi(Node* node);
[all...] |
| escape-analysis-reducer.h | 24 Reduction Reduce(Node* node) final;
31 Reduction ReduceLoad(Node* node);
32 Reduction ReduceStore(Node* node);
33 Reduction ReduceAllocate(Node* node);
34 Reduction ReduceFinishRegion(Node* node);
[all...] |
| node-marker.h | 8 #include "src/compiler/node.h"
23 V8_INLINE Mark Get(Node* node) {
24 Mark mark = node->mark();
27 node->set_mark(mark_min_);
32 V8_INLINE void Set(Node* node, Mark mark) {
34 DCHECK_LT(node->mark(), mark_max_);
35 node->set_mark(mark + mark_min_);
45 // A NodeMarker assigns a local "state" to every node of a graph in constan
[all...] |
| /prebuilts/ndk/current/platforms/android-12/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-12/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-12/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-13/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-13/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...] |
