Home
last modified time | relevance | path

Searched refs:nodes (Results 1 - 17 of 17) sorted by relevance

/base/msdp/device_status/tools/vdev/src/
H A Dvirtual_device.cpp47 std::map<std::string, std::string> nodes; in FindDeviceNode() local
48 GetInputDeviceNodes(nodes); in FindDeviceNode()
49 FI_HILOGD("There are %{public}zu device nodes", nodes.size()); in FindDeviceNode()
51 std::map<std::string, std::string>::const_iterator cItr = nodes.find(name); in FindDeviceNode()
52 if (cItr == nodes.cend()) { in FindDeviceNode()
81 void VirtualDevice::GetInputDeviceNodes(std::map<std::string, std::string> &nodes) in GetInputDeviceNodes() argument
107 std::map<std::string, std::string>::const_iterator cItr = nodes.find(name); in GetInputDeviceNodes()
108 if (cItr != nodes.end()) { in GetInputDeviceNodes()
109 nodes in GetInputDeviceNodes()
[all...]
/base/security/device_security_level/baselib/utils/src/
H A Dutils_state_machine.c40 static const StateNode *GetScheduleStateNode(const StateNode *nodes, uint32_t nodeCnt, uint32_t state, uint32_t event) in GetScheduleStateNode() argument
43 const StateNode *node = nodes + i; in GetScheduleStateNode()
76 void ScheduleMachine(const StateNode *nodes, uint32_t nodeCnt, StateMachine *machine, uint32_t event, const void *para) in ScheduleMachine() argument
79 if ((nodes == NULL) || (nodeCnt == 0) || (machine == NULL)) { in ScheduleMachine()
80 SECURITY_LOG_ERROR("invlid params, nodes or context is null"); in ScheduleMachine()
92 const StateNode *node = GetScheduleStateNode(nodes, nodeCnt, state, event); in ScheduleMachine()
109 return ScheduleMachine(nodes, nodeCnt, machine, nextEvent, nextPara); in ScheduleMachine()
/base/hiviewdfx/hicollie/frameworks/native/thread_sampler/
H A Dsample_stack_printer.cpp168 std::vector<SampleStackItem*> nodes; in Print() local
169 nodes.push_back(root_); in Print()
171 while (!nodes.empty()) { in Print()
172 SampleStackItem* back = nodes.back(); in Print()
176 nodes.pop_back(); in Print()
180 nodes.push_back(sibling); in Print()
184 nodes.push_back(child); in Print()
/base/msdp/device_status/services/interaction/drag/src/
H A Ddrag_drawing.cpp190 if (g_drawingInfo.nodes.size() <= DRAG_STYLE_INDEX) { in CheckNodesValid()
191 FI_HILOGE("The index is out of bounds, node size is %{public}zu", g_drawingInfo.nodes.size()); in CheckNodesValid()
193 } else if (g_drawingInfo.nodes.empty() || g_drawingInfo.nodes[DRAG_STYLE_INDEX] == nullptr) { in CheckNodesValid()
198 (g_drawingInfo.nodes.size() < MOUSE_NODE_MIN_COUNT)) { in CheckNodesValid()
199 FI_HILOGE("Nodes size invalid when mouse type, node size:%{public}zu", g_drawingInfo.nodes.size()); in CheckNodesValid()
203 (g_drawingInfo.nodes.size() < TOUCH_NODE_MIN_COUNT)) { in CheckNodesValid()
204 FI_HILOGE("Nodes size invalid when touchscreen type, node size:%{public}zu", g_drawingInfo.nodes.size()); in CheckNodesValid()
272 FI_HILOGE("Init drag animation data or check nodes valid failed"); in Init()
275 if (g_drawingInfo.nodes in Init()
[all...]
/base/useriam/user_auth_framework/services/core/src/
H A Dschedule_node_helper.cpp28 std::shared_ptr<ScheduleNodeCallback> callback, std::vector<std::shared_ptr<ScheduleNode>> &nodes) in BuildFromHdi()
31 return BuildFromHdi(infos, callback, nodes, para); in BuildFromHdi()
35 std::shared_ptr<ScheduleNodeCallback> callback, std::vector<std::shared_ptr<ScheduleNode>> &nodes, in BuildFromHdi()
49 nodes.swap(outputs); in BuildFromHdi()
27 BuildFromHdi(const std::vector<HdiScheduleInfo> &infos, std::shared_ptr<ScheduleNodeCallback> callback, std::vector<std::shared_ptr<ScheduleNode>> &nodes) BuildFromHdi() argument
34 BuildFromHdi(const std::vector<HdiScheduleInfo> &infos, std::shared_ptr<ScheduleNodeCallback> callback, std::vector<std::shared_ptr<ScheduleNode>> &nodes, const NodeOptionalPara &para) BuildFromHdi() argument
/base/useriam/user_auth_framework/services/core/inc/
H A Dschedule_node_helper.h43 std::vector<std::shared_ptr<ScheduleNode>> &nodes);
45 std::vector<std::shared_ptr<ScheduleNode>> &nodes, const NodeOptionalPara &para);
/base/security/device_security_level/baselib/utils/include/
H A Dutils_state_machine.h51 void ScheduleMachine(const StateNode *nodes, uint32_t nodeCnt, StateMachine *machine, uint32_t event, const void *para);
/device/soc/rockchip/common/sdk_linux/kernel/power/
H A Dsnapshot.c342 * two linked lists for the nodes of the tree, one for the inner nodes and
343 * one for the leave nodes. The linked leave nodes are used for fast linear
356 * struct rtree_node is a wrapper struct to link the nodes
371 struct list_head nodes; /* Radix Tree inner nodes */ member
410 * This function is used to allocate inner nodes as well as the
411 * leave nodes of the radix tree. It also adds the node to the
437 * The leave nodes nee
1200 unsigned int rtree, nodes; snapshot_additional_pages() local
[all...]
/base/hiviewdfx/faultloggerd/interfaces/innerkits/async_stack/include/
H A Dunique_stack_table.h63 std::vector<UniStackNode> nodes; member
/base/msdp/device_status/tools/vdev/include/
H A Dvirtual_device.h65 static void GetInputDeviceNodes(std::map<std::string, std::string> &nodes);
/device/soc/rockchip/common/sdk_linux/fs/ubifs/
H A Drecovery.c470 * no_more_nodes - determine if there are no more nodes in a buffer.
520 if (!list_empty(&sleb->nodes)) { in fix_unclean_leb()
523 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in fix_unclean_leb()
577 * drop_last_group - drop the last group of nodes.
579 * @offs: offset of dropped nodes is returned here
582 * group of nodes of the scanned LEB.
586 while (!list_empty(&sleb->nodes)) { in drop_last_group()
590 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in drop_last_group()
607 * @offs: offset of dropped nodes is returned here
616 if (!list_empty(&sleb->nodes)) { in drop_last_node()
[all...]
/device/soc/rockchip/common/kernel/drivers/net/wireless/rockchip_wlan/rkwifi/bcmdhd_wifi6/
H A Ddhd_wlfc.c412 entry = &ctx->destination_entries.nodes[entry_idx]; in _dhd_wlfc_enque_afq()
445 entry = &ctx->destination_entries.nodes[hslot]; in _dhd_wlfc_deque_afq()
634 wlfc_mac_descriptor_t* table = ctx->destination_entries.nodes; in _dhd_wlfc_find_table_entry()
1147 hslot = (uint)(entry - &ctx->destination_entries.nodes[0]); in _dhd_wlfc_pretx_pktprocess()
1309 /* search all entries, include nodes as well as interfaces */ in _dhd_wlfc_deque_delayedq()
1762 /* flush psq, search all entries, include nodes as well as interfaces */ in _dhd_wlfc_cleanup()
1868 (int)(entry - &ctx->destination_entries.nodes[0]))); in _dhd_wlfc_mac_entry_update()
2110 ((athost_wl_status_info_t*)dhdp->wlfc_state)->destination_entries.nodes; in _dhd_wlfc_find_mac_desc_id_from_mac()
2149 entry = &ctx->destination_entries.nodes[hslot]; in dhd_wlfc_suppressed_acked_update()
2659 table = wlfc->destination_entries.nodes; in _dhd_wlfc_mac_table_update()
[all...]
H A Ddhd_wlfc.h533 /** table for individual nodes */
534 wlfc_mac_descriptor_t nodes[WLFC_MAC_DESC_TABLE_SIZE]; member
/device/soc/hisilicon/hi3516dv300/sdk_linux/drv/interdrv/common/cipher/src/drv/cipher_v1.0/drivers/crypto/
H A Dcryp_symc.c59 /* Multi nodes added status, finished or finished */
363 /* if the total length don't aligned with block size, split joint the follow nodes. */ in symc_add_next_node()
367 /* The next node large than tail size, just split it to 2 nodes. */ in symc_add_next_node()
390 /* The next node less than tail size, add it to nodes list. */ in symc_add_next_node()
413 hi_u32 i, nodes, cur, total_len; in symc_add_buf_list() local
426 * select the minimum numbers of nodes to calculate. in symc_add_buf_list()
428 nodes = crypto_min(SYMC_INT_LEVEL, hisi_ctx->total_nodes - hisi_ctx->cur_nodes); in symc_add_buf_list()
431 for (i = 0; i < nodes; i++) { in symc_add_buf_list()
446 /* For each compute, the total length of valid nodes list in symc_add_buf_list()
457 /* gcm add nodes finishe in symc_add_buf_list()
[all...]
/base/msdp/device_status/services/interaction/drag/include/
H A Ddrag_drawing.h216 std::vector<std::shared_ptr<Rosen::RSCanvasNode>> nodes; member
/base/telephony/core_service/services/sim/src/
H A Desim_file.cpp2359 std::list<std::shared_ptr<Asn1Node>> nodes; in RetrieveNotificatioParseTagCtxComp0() local
2366 if (compNode->Asn1GetChildren(TAG_ESIM_SEQUENCE, nodes) != 0) { in RetrieveNotificatioParseTagCtxComp0()
2369 if (nodes.empty()) { in RetrieveNotificatioParseTagCtxComp0()
2374 std::shared_ptr<Asn1Node> firstNode = nodes.front(); in RetrieveNotificatioParseTagCtxComp0()
/device/soc/rockchip/common/sdk_linux/kernel/sched/
H A Dfair.c1355 * between these nodes are slowed down, to allow things to settle down.
1364 /* Handle placement on systems where not all nodes are directly connected. */
1371 * All nodes are directly connected, and the same distance in score_nearby_nodes()
1380 * which should be ok given the number of nodes rarely exceeds 8. in score_nearby_nodes()
1387 * The furthest away nodes in the system are not interesting in score_nearby_nodes()
1396 * of nodes, and move tasks towards the group with the most in score_nearby_nodes()
1397 * memory accesses. When comparing two nodes at distance in score_nearby_nodes()
1398 * "hoplimit", only nodes closer by than "hoplimit" are part in score_nearby_nodes()
1399 * of each group. Skip other nodes. in score_nearby_nodes()
1405 /* Add up the faults from nearby nodes in score_nearby_nodes()
2360 nodemask_t nodes; preferred_group_nid() local
[all...]

Completed in 29 milliseconds