Searched refs:node (Results 51 - 75 of 84) sorted by relevance

1234

/system/bt/stack/btm/
H A Dbtm_ble_addr.cc346 for (list_node_t* node = list_begin(btm_cb.sec_dev_rec); node != end;
347 node = list_next(node)) {
349 static_cast<tBTM_SEC_DEV_REC*>(list_node(node));
H A Dbtm_ble_bgconn.cc574 for (const list_node_t* node = list_begin(list); node != list_end(list);
575 node = list_next(node)) {
576 tBTM_BLE_CONN_REQ* p_req = (tBTM_BLE_CONN_REQ*)list_node(node);
/system/core/adb/
H A Dfdevent.cpp175 PollNode& node = it->second; local
177 node.pollfd.events |= POLLIN;
179 node.pollfd.events &= ~POLLIN;
183 node.pollfd.events |= POLLOUT;
185 node.pollfd.events &= ~POLLOUT;
H A Dtransport.cpp318 device_tracker* node = *pnode; local
321 while (node) {
322 if (node == tracker) {
323 *pnode = node->next;
326 pnode = &node->next;
327 node = *pnode;
/system/core/libmemunreachable/
H A DTarjan.h46 for (auto& node: references_out) {
47 f(node->ptr);
/system/tools/aidl/
H A Dast_cpp_unittest.cpp95 void CompareGeneratedCode(const AstNode& node, argument
99 node.Write(writer.get());
/system/libufdt/
H A Dufdt_overlay.c42 * certain operations (e.g., merge 2 subtrees, search for a node by path) in
79 * Tries to increase the phandle value of a node
82 static void ufdt_node_try_increase_phandle(struct ufdt_node *node, argument
85 char *prop_data = ufdt_node_get_fdt_prop_data_by_name(node, "phandle", &len);
89 prop_data = ufdt_node_get_fdt_prop_data_by_name(node, "linux,phandle", &len);
104 struct ufdt_node *target_node = sorted_table.data[i].node;
123 * /path/to/node:property:offset.
127 * "property"=<1, 2, &ref, 4>, we can use /path/to/node:property:8 to get ref,
174 dto_error("Property '%s' not found in '%s' node\n", prop_ptr, path);
194 * Process one entry in __fixups__ { } node
[all...]
/system/media/camera/docs/
H A Dhtml.mako115 # Convert node name "x.y.z" of kind w to an HTML anchor of form
117 def html_anchor(node):
118 return '<a href="#%s_%s">%s</a>' % (node.kind, node.name, node.name)
160 <%def name="insert_toc_body(node)">
161 % for nested in node.namespaces:
164 % for entry in node.merged_entries:
235 <%def name="insert_body(node)">
236 % for nested in node
[all...]
H A Dmetadata_helpers_test.py137 def filter_test(node):
H A Dmetadata_template.mako54 <%def name="insert_body(node)">
55 % for nested in node.namespaces:
59 % for entry in node.entries:
/system/core/liblog/
H A Dlogd_writer.c52 .node = { &logdLoggerWrite.node, &logdLoggerWrite.node },
H A Dpmsg_writer.c44 .node = { &pmsgLoggerWrite.node, &pmsgLoggerWrite.node },
H A Dstderr_write.c59 .node = { &stderrLoggerWrite.node, &stderrLoggerWrite.node },
H A Dlogd_reader.c76 .node = { &logdLoggerRead.node, &logdLoggerRead.node },
/system/bt/stack/gatt/
H A Dgatt_utils.cc164 for (const list_node_t* node = list_begin(list); node != list_end(list);
165 node = list_next(node)) {
168 tGATTS_SRV_CHG* p_buf = (tGATTS_SRV_CHG*)list_node(node);
326 for (const list_node_t* node = list_begin(list); node != list_end(list);
327 node = list_next(node)) {
328 tGATT_VALUE* p_buf = (tGATT_VALUE*)list_node(node);
[all...]
H A Dgatt_sr.cc150 const list_node_t* node = NULL; local
158 node = list_begin(list);
160 node = list_next(node);
161 if (node != list_end(list)) p_rsp = (tGATTS_RSP*)list_node(node);
/system/extras/perfprofd/quipper/
H A Dperf_reader.cc1353 PerfNodeTopologyMetadata node; local
1354 if (!ReadDataFromBuffer(data, sizeof(node.id), "node id",
1355 &offset, &node.id) ||
1356 !ReadDataFromBuffer(data, sizeof(node.total_memory),
1357 "node total memory", &offset,
1358 &node.total_memory) ||
1359 !ReadDataFromBuffer(data, sizeof(node.free_memory),
1360 "node free memory", &offset, &node
1624 const PerfNodeTopologyMetadata& node = numa_topology_[i]; local
[all...]
/system/netd/tests/
H A Dnetd_test.cpp87 AddrInfo(const char* node, const char* service, const addrinfo& hints) : ai_(nullptr) { argument
88 init(node, service, hints);
91 AddrInfo(const char* node, const char* service) : ai_(nullptr) { argument
92 init(node, service);
97 int init(const char* node, const char* service, const addrinfo& hints) { argument
99 error_ = getaddrinfo(node, service, &hints, &ai_);
103 int init(const char* node, const char* service) { argument
105 error_ = getaddrinfo(node, service, nullptr, &ai_);
/system/bt/stack/l2cap/
H A Dl2c_api.cc2184 for (const list_node_t* node = list_begin(p_lcb->link_xmit_data_q);
2185 (num_to_flush > 0) && node != list_end(p_lcb->link_xmit_data_q);) {
2186 BT_HDR* p_buf = (BT_HDR*)list_node(node);
2187 node = list_next(node);
2212 for (const list_node_t* node = list_begin(p_lcb->link_xmit_data_q);
2213 node != list_end(p_lcb->link_xmit_data_q); node = list_next(node)) {
2214 BT_HDR* p_buf = (BT_HDR*)list_node(node);
[all...]
H A Dl2c_main.cc736 for (const list_node_t* node = list_begin(l2cb.rcv_pending_q);
737 node != list_end(l2cb.rcv_pending_q);) {
738 BT_HDR* p_buf = static_cast<BT_HDR*>(list_node(node));
739 node = list_next(node);
/system/update_engine/payload_generator/
H A Dcycle_breaker_unittest.cc135 Graph graph(kGroups * kNodesPerGroup + 1); // + 1 for the root node
151 const Vertex::Index node = counter++; local
152 graph[last_hub].out_edges.insert(EdgeWithWeight(node, weight));
153 graph[node].out_edges.insert(EdgeWithWeight(next_hub, weight));
H A Dinplace_generator.cc166 // a real file node to a temp copy node:
170 // make node depend on the copy operation
184 // make the dest node read from the scratch space
216 // Don't have a node depend on itself
255 Vertex::Index node = op_indexes[i]; local
256 if (table.size() < (node + 1)) {
257 table.resize(node + 1);
259 table[node] = i;
393 // See if this node ha
[all...]
/system/bt/btif/src/
H A Dbtif_hl.cc4120 for (const list_node_t* node = list_begin(soc_queue);
4121 node != list_end(soc_queue); node = list_next(node)) {
4122 btif_hl_soc_cb_t* p_scb = (btif_hl_soc_cb_t*)list_node(node);
4271 for (const list_node_t* node = list_begin(soc_queue);
4272 node != list_end(soc_queue); node = list_next(node)) {
4273 btif_hl_soc_cb_t* p_scb = (btif_hl_soc_cb_t*)list_node(node);
[all...]
/system/extras/ioshark/
H A Dioshark_bench_subr.c151 files_db_update_fd(void *node, int fd) argument
153 struct files_db_s *db_node = (struct files_db_s *)node;
159 files_db_close_fd(void *node) argument
161 struct files_db_s *db_node = (struct files_db_s *)node;
/system/libvintf/
H A Dparse_xml.cpp175 inline bool operator()(Object *o, NodeType *node) const {
176 return deserialize(o, node);
339 inline bool parseText(NodeType *node, std::string *s) const { argument
340 *s = getText(node);
345 inline bool parseText(NodeType *node, T *s) const { argument
346 std::string text = getText(node);

Completed in 1067 milliseconds

1234