| /device/moto/shamu/camera/QCamera2/stack/mm-camera-test/src/ |
| mm_qcamera_queue.c | 84 camera_q_node *node = local
86 if (NULL == node) {
91 memset(node, 0, sizeof(camera_q_node));
92 node->data = data;
95 cam_list_add_tail_node(&node->list, &queue->m_head.list);
108 camera_q_node* node = NULL; local
121 node = member_of(pos, camera_q_node, list);
122 cam_list_del_node(&node->list);
127 if (NULL != node) {
128 data = node->data
137 camera_q_node* node = NULL; local
[all...] |
| /device/moto/shamu/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_queue.c | 44 mm_jpeg_q_node_t* node = local
46 if (NULL == node) {
51 memset(node, 0, sizeof(mm_jpeg_q_node_t));
52 node->data = data;
55 cam_list_add_tail_node(&node->list, &queue->head.list);
67 mm_jpeg_q_node_t* node = local
69 if (NULL == node) {
74 memset(node, 0, sizeof(mm_jpeg_q_node_t));
75 node->data = data;
81 cam_list_insert_before_node(&node->list, pos)
90 mm_jpeg_q_node_t* node = NULL; local
134 mm_jpeg_q_node_t* node = NULL; local
163 mm_jpeg_q_node_t* node = NULL; local
[all...] |
| /device/moto/shamu/camera/QCamera2/util/ |
| QCameraCmdThread.cpp | 133 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local
134 if (NULL == node) {
138 memset(node, 0, sizeof(camera_cmd_t));
139 node->cmd = cmd;
142 cmd_queue.enqueueWithPriority((void *)node);
144 cmd_queue.enqueue((void *)node);
167 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local
168 if (NULL == node) {
172 cmd = node->cmd;
173 free(node);
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3treeparser.c | 94 /* Install the tree node stream
209 pANTLR3_BASE_TREE node; local
220 // Create a new empty node, by stealing the current one, or the previous one if the current one is EOF
235 node = current->dupNode(current);
239 token = node->getToken(node);
248 // Finally return the pointer to our new node
250 return node;
|
| /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/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncNormalizeSpace.java | 72 int node = getArg0AsNode(xctxt); local
73 if(DTM.NULL != node)
75 DTM dtm = xctxt.getDTM(node);
76 dtm.dispatchCharactersEvents(node, handler, true);
|
| /external/boringssl/src/crypto/x509v3/ |
| pcy_node.c | 98 X509_POLICY_NODE *node; local
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
103 if (node->parent == parent)
105 if (!OBJ_cmp(node->data->valid_policy, id))
106 return node;
117 X509_POLICY_NODE *node; local
118 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
119 if (!node)
121 node->data = data;
122 node->parent = parent
[all...] |
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 28 template <typename T> class Node {
31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined.
32 ~Node() {}
36 template<typename T> class BinomialNode : Node<BinomialNode<T>*> {
44 BinomialNode<int> *node = new BinomialNode<int>(1); local
45 delete node;
|
| /external/clang/test/Misc/ |
| reduced-diags-macros.cpp | 33 struct node { struct
36 node ff;
39 // CHECK: {{.*}}:38:15: error: invalid operands to binary expression ('node' and 'int')
|
| /external/curl/src/ |
| tool_operhlp.c | 40 struct getout *node = config->url_list; local
42 while(node) {
43 next = node->next;
44 Curl_safefree(node->url);
45 Curl_safefree(node->outfile);
46 Curl_safefree(node->infile);
47 Curl_safefree(node);
48 node = next;
|
| /external/curl/tests/unit/ |
| unit1309.c | 39 struct Curl_tree *node; local
55 for(count=0, node = t->same; node; node = node->same, count++)
|
| /external/dbus/test/ |
| shell-test.c | 20 DBusList *list = NULL, *node; local
38 for (i = 0, node = _dbus_list_get_first_link (&list); i < original_argc && node;
39 i++, node = _dbus_list_get_next_link (&list, node))
41 original_argv[i] = node->data;
|
| /external/droiddriver/src/io/appium/droiddriver/validators/ |
| DefaultAccessibilityValidator.java | 66 AccessibilityNodeInfo node = ((UiAutomationElement) element).getRawElement(); local
67 return (node.getActions() & AccessibilityNodeInfo.ACTION_FOCUS) == AccessibilityNodeInfo.ACTION_FOCUS;
|
| /external/e2fsprogs/lib/e2p/ |
| uuid.c | 21 __u8 node[6]; member in struct:uuid
59 memcpy(uu->node, ptr, 6);
71 uuid.node[0], uuid.node[1], uuid.node[2],
72 uuid.node[3], uuid.node[4], uuid.node[5]);
|
| /external/icu/icu4c/source/common/ |
| bytestrie.cpp | 72 int32_t node; local
73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
74 valueResult(node) : USTRINGTRIE_NO_VALUE;
102 int32_t node=*pos; local
103 U_ASSERT(node>=kMinValueLead);
104 if(node&kValueIsFinal) {
110 // int32_t delta=readValue(pos, node>>1);
111 node>>=1;
113 if(node<kMinTwoByteValueLead) {
114 delta=node-kMinOneByteValueLead
140 int32_t node=*pos; local
151 int32_t node=*pos++; local
395 int32_t node=*pos++; local
[all...] |
| bytestrieiterator.cpp | 65 // Pending linear-match node, append remaining bytes to str_.
110 // the branch node.
127 // We only get here if we started in a pending linear-match node
132 int32_t node=*pos++; local
133 if(node>=kMinValueLead) {
135 UBool isFinal=(UBool)(node&kValueIsFinal);
136 value_=readValue(pos, node>>1);
140 pos_=skipValue(pos, node);
148 if(node<kMinLinearMatch) {
149 if(node==0)
193 int32_t node=*pos++; local
[all...] |
| ucharstrieiterator.cpp | 64 // Pending linear-match node, append remaining UChars to str_.
109 // the branch node.
126 // We only get here if we started in a pending linear-match node
131 int32_t node=*pos++; local
132 if(node>=kMinValueLead) {
134 pos=skipNodeValue(pos, node);
135 node&=kNodeTypeMask;
139 UBool isFinal=(UBool)(node>>15);
141 value_=readValue(pos, node&0x7fff);
143 value_=readNodeValue(pos, node);
197 int32_t node=*pos++; local
[all...] |
| /external/iproute2/lib/ |
| dnet_pton.c | 43 u_int16_t node = 0; local
49 pos = dnet_num(src + pos + 1, &node);
50 if ((pos == 0) || (node > 1023))
53 addr = dn_htons((area << 10) | node);
|
| /external/iproute2/tipc/ |
| socket.c | 81 uint32_t node; local
85 node = mnl_attr_get_u32(con[TIPC_NLA_CON_NODE]);
87 printf(" connected to <%u.%u.%u:%u>", tipc_zone(node),
88 tipc_cluster(node), tipc_node(node),
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| MethodItem.java | 27 private final IMethodCoverage node; field in class:MethodItem
33 MethodItem(final IMethodCoverage node, final String label,
35 this.node = node;
53 final int first = node.getFirstLine();
58 return node;
|
| NodePage.java | 22 * Report page that represents a coverage node.
25 * type of the node represented by this page
30 private final NodeType node; field in class:NodePage
33 * Creates a new node page.
35 * @param node
36 * corresponding node
44 protected NodePage(final NodeType node, final ReportPage parent,
47 this.node = node;
56 return Resources.getElementStyle(node.getElementType())
[all...] |
| 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/jacoco/org.jacoco.report.test/src/org/jacoco/report/csv/ |
| ClassRowWriterTest.java | 76 IClassCoverage node = new ClassCoverageImpl("test/package/Foo", 123, local
87 writer.writeRow("group", "test/package", node);
|
| /external/jemalloc/src/ |
| rtree.c | 63 rtree_delete_subtree(rtree_t *rtree, rtree_node_elm_t *node, unsigned level)
71 rtree_node_elm_t *child = node[i].child;
76 rtree->dalloc(node);
94 rtree_node_elm_t *node; local
103 node = atomic_read_p((void **)elmp);
104 } while (node == RTREE_NODE_INITIALIZING);
106 node = rtree->alloc(ZU(1) << rtree->levels[level].bits);
107 if (node == NULL)
109 atomic_write_p((void **)elmp, node);
112 return (node);
[all...] |
| /external/jemalloc/test/unit/ |
| rtree.c | 11 node_dalloc(rtree_node_elm_t *node)
14 free(node);
64 extent_node_t node; local
71 assert_false(rtree_set(&rtree, keys[j], &node),
75 &node, "rtree_get() should return " local
104 extent_node_t node; local
113 assert_false(rtree_set(&rtree, keys[j], &node),
115 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node, local
119 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node, local
|
