Home
last modified time | relevance | path

Searched refs:node (Results 2101 - 2125 of 11422) sorted by relevance

1...<<81828384858687888990>>...457

/kernel/linux/linux-5.10/drivers/irqchip/
H A Dirq-loongson-eiointc.c40 u32 node; member
51 return eiointc_priv[id]->node; in eiointc_get_node()
72 int i, node, cpu_node, route_node; in eiointc_set_irq_route() local
82 /* Calculate node and coremap of target irq */ in eiointc_set_irq_route()
87 node = cpu_to_eio_node(i); in eiointc_set_irq_route()
88 if (!node_isset(node, *node_map)) in eiointc_set_irq_route()
91 /* EIO node 0 is in charge of inter-node interrupt dispatch */ in eiointc_set_irq_route()
92 route_node = (node == mnode) ? cpu_node : node; in eiointc_set_irq_route()
177 eiointc_index(int node) eiointc_index() argument
192 int node = cpu_to_eio_node(cpu); eiointc_router_init() local
[all...]
/kernel/linux/linux-5.10/drivers/soc/qcom/
H A Dsmp2p.c78 * @node: list entry to keep track of allocated entries
91 struct list_head node; member
202 list_for_each_entry(entry, &smp2p->inbound, node) { in qcom_smp2p_intr()
213 list_for_each_entry(entry, &smp2p->inbound, node) { in qcom_smp2p_intr()
307 struct device_node *node) in qcom_smp2p_inbound_entry()
309 entry->domain = irq_domain_add_linear(node, 32, &smp2p_irq_ops, entry); in qcom_smp2p_inbound_entry()
344 struct device_node *node) in qcom_smp2p_outbound_entry()
358 entry->state = qcom_smem_state_register(node, &smp2p_state_ops, entry); in qcom_smp2p_outbound_entry()
418 dev_err(dev, "no qcom,ipc node\n"); in smp2p_parse_ipc()
446 struct device_node *node; in qcom_smp2p_probe() local
305 qcom_smp2p_inbound_entry(struct qcom_smp2p *smp2p, struct smp2p_entry *entry, struct device_node *node) qcom_smp2p_inbound_entry() argument
342 qcom_smp2p_outbound_entry(struct qcom_smp2p *smp2p, struct smp2p_entry *entry, struct device_node *node) qcom_smp2p_outbound_entry() argument
[all...]
/kernel/linux/linux-5.10/fs/ubifs/
H A Dauth.c23 * ubifs_node_calc_hash - calculate the hash of a UBIFS node
25 * @node: the node to calculate a hash for
30 int __ubifs_node_calc_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_calc_hash() argument
33 const struct ubifs_ch *ch = node; in __ubifs_node_calc_hash()
35 return crypto_shash_tfm_digest(c->hash_tfm, node, le32_to_cpu(ch->len), in __ubifs_node_calc_hash()
42 * @hash: the node to calculate a HMAC for
54 * ubifs_prepare_auth_node - Prepare an authentication node
56 * @node: the node t
64 ubifs_prepare_auth_node(struct ubifs_info *c, void *node, struct shash_desc *inhash) ubifs_prepare_auth_node() argument
138 ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, int lnum, int offs) ubifs_bad_hash() argument
164 __ubifs_node_check_hash(const struct ubifs_info *c, const void *node, const u8 *expected) __ubifs_node_check_hash() argument
389 ubifs_node_calc_hmac(const struct ubifs_info *c, const void *node, int len, int ofs_hmac, void *hmac) ubifs_node_calc_hmac() argument
433 __ubifs_node_insert_hmac(const struct ubifs_info *c, void *node, int len, int ofs_hmac) __ubifs_node_insert_hmac() argument
449 __ubifs_node_verify_hmac(const struct ubifs_info *c, const void *node, int len, int ofs_hmac) __ubifs_node_verify_hmac() argument
[all...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Dauth.c22 * ubifs_node_calc_hash - calculate the hash of a UBIFS node
24 * @node: the node to calculate a hash for
29 int __ubifs_node_calc_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_calc_hash() argument
32 const struct ubifs_ch *ch = node; in __ubifs_node_calc_hash()
34 return crypto_shash_tfm_digest(c->hash_tfm, node, le32_to_cpu(ch->len), in __ubifs_node_calc_hash()
41 * @hash: the node to calculate a HMAC for
53 * ubifs_prepare_auth_node - Prepare an authentication node
55 * @node: the node t
63 ubifs_prepare_auth_node(struct ubifs_info *c, void *node, struct shash_desc *inhash) ubifs_prepare_auth_node() argument
137 ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, int lnum, int offs) ubifs_bad_hash() argument
163 __ubifs_node_check_hash(const struct ubifs_info *c, const void *node, const u8 *expected) __ubifs_node_check_hash() argument
388 ubifs_node_calc_hmac(const struct ubifs_info *c, const void *node, int len, int ofs_hmac, void *hmac) ubifs_node_calc_hmac() argument
432 __ubifs_node_insert_hmac(const struct ubifs_info *c, void *node, int len, int ofs_hmac) __ubifs_node_insert_hmac() argument
448 __ubifs_node_verify_hmac(const struct ubifs_info *c, const void *node, int len, int ofs_hmac) __ubifs_node_verify_hmac() argument
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_smi_events.c253 void kfd_smi_event_page_fault_start(struct kfd_node *node, pid_t pid, in kfd_smi_event_page_fault_start() argument
257 kfd_smi_event_add(pid, node, KFD_SMI_EVENT_PAGE_FAULT_START, in kfd_smi_event_page_fault_start()
259 address, node->id, write_fault ? 'W' : 'R'); in kfd_smi_event_page_fault_start()
262 void kfd_smi_event_page_fault_end(struct kfd_node *node, pid_t pid, in kfd_smi_event_page_fault_end() argument
265 kfd_smi_event_add(pid, node, KFD_SMI_EVENT_PAGE_FAULT_END, in kfd_smi_event_page_fault_end()
267 pid, address, node->id, migration ? 'M' : 'U'); in kfd_smi_event_page_fault_end()
270 void kfd_smi_event_migration_start(struct kfd_node *node, pid_t pid, in kfd_smi_event_migration_start() argument
276 kfd_smi_event_add(pid, node, KFD_SMI_EVENT_MIGRATE_START, in kfd_smi_event_migration_start()
282 void kfd_smi_event_migration_end(struct kfd_node *node, pid_t pid, in kfd_smi_event_migration_end() argument
286 kfd_smi_event_add(pid, node, KFD_SMI_EVENT_MIGRATE_EN in kfd_smi_event_migration_end()
292 kfd_smi_event_queue_eviction(struct kfd_node *node, pid_t pid, uint32_t trigger) kfd_smi_event_queue_eviction() argument
300 kfd_smi_event_queue_restore(struct kfd_node *node, pid_t pid) kfd_smi_event_queue_restore() argument
327 kfd_smi_event_unmap_from_gpu(struct kfd_node *node, pid_t pid, unsigned long address, unsigned long last, uint32_t trigger) kfd_smi_event_unmap_from_gpu() argument
[all...]
/kernel/linux/linux-6.6/mm/
H A Dworkingset.c23 * Per node, two clock lists are maintained for file pages: the
171 * For each node's LRU lists, a counter for inactive evictions and
172 * activations is maintained (node->nonresident_age).
175 * identify the node) is stored in the now empty page cache
533 * evicted folio in the context of the node and the memcg whose memory
665 void workingset_update_node(struct xa_node *node) in workingset_update_node() argument
675 * as node->private_list is protected by the i_pages lock. in workingset_update_node()
677 mapping = container_of(node->array, struct address_space, i_pages); in workingset_update_node()
680 if (node->count && node in workingset_update_node()
758 struct xa_node *node = container_of(item, struct xa_node, private_list); __must_hold() local
[all...]
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/localedistance/
H A DDistanceTable.java129 // If a script node *only* contains region data with the default in pruneDefaultDistances()
135 "missing default region node for script: %s", scriptNode); in pruneDefaultDistances()
144 // If a language node *only* contains script data with the default in pruneDefaultDistances()
150 "missing default script node for language: %s", langNode); in pruneDefaultDistances()
152 // If the default script node has no region data, remove it. in pruneDefaultDistances()
207 /** Returns the subtable node for the top-level mapping of a key. */
212 /** Returns the subtable node for the {@code <ANY,ANY>} mapping. */
233 for (Node node : subtables.values()) { in addWildcardMappings()
234 node.addWildcardMappings(key.getSuffix()); in addWildcardMappings()
238 Node node in addWildcardMappings()
[all...]
/third_party/lame/ACM/tinyxml/
H A Dtinyxmlparser.cpp276 // We now have something we presume to be a node of in StreamIn()
277 // some sort. Identify it, and call the node to in StreamIn()
279 TiXmlNode* node = Identify( tag->c_str() + tagIndex ); in StreamIn() local
281 if ( node ) in StreamIn()
283 node->StreamIn( in, tag ); in StreamIn()
284 bool isElement = node->ToElement() != 0; in StreamIn()
285 delete node; in StreamIn()
286 node = 0; in StreamIn()
325 TiXmlNode* node = Identify( p ); in Parse() local
326 if ( node ) in Parse()
505 TiXmlNode* node = Identify( tagloc ); StreamIn() local
651 TiXmlNode* node = Identify( p ); ReadValue() local
[all...]
/third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_test/
H A Dcpuset_memory_testset.sh61 read node < "$MEMORY_RESULT"
75 if [ "$node" != "0" ]; then
76 tst_resm TFAIL "allocate memory on the Node#$node(Expect: Node#0)."
92 if [ "$node" != "0" ]; then
93 tst_resm TFAIL "allocate memory on the Node#$node(Expect: Node#0)."
109 if [ "$node" != "0" ]; then
110 tst_resm TFAIL "allocate memory on the Node#$node(Expect: Node#0)."
126 if [ "$node" != "0" ]; then
127 tst_resm TFAIL "allocate memory on the Node#$node(Expect: Node#0)."
143 if [ "$node" !
[all...]
/third_party/node/deps/npm/node_modules/iconv-lite/encodings/
H A Ddbcs-codec.js40 // <= NODE_START -> index of the next node in our trie to process next byte.
43 this.decodeTables[0] = UNASSIGNED_NODE.slice(0); // Create root node.
150 var node = this.decodeTables[0];
152 var val = node[bytes[i]];
154 if (val == UNASSIGNED) { // Create new node.
155 node[bytes[i]] = NODE_START - this.decodeTables.length;
156 this.decodeTables.push(node = UNASSIGNED_NODE.slice(0));
158 else if (val <= NODE_START) { // Existing node.
159 node = this.decodeTables[NODE_START - val];
164 return node;
[all...]
/kernel/linux/linux-5.10/io_uring/
H A Dio-wq.c88 * Per-node worker thread pool
94 int node; member
471 struct io_wq_work_node *node, *prev; variable
476 wq_list_for_each(node, prev, &acct->work_list) {
479 work = container_of(node, struct io_wq_work, list);
483 wq_list_del(&acct->work_list, node, prev);
500 node = &tail->list;
764 tsk = create_io_thread(io_wqe_worker, worker, wqe->node); in create_worker_cont()
812 worker = kzalloc_node(sizeof(*worker), GFP_KERNEL, wqe->node); in create_io_worker()
831 tsk = create_io_thread(io_wqe_worker, worker, wqe->node); in create_io_worker()
1026 struct io_wq_work_node *node, *prev; global() variable
1078 int node; io_wq_cancel_cb() local
1135 int ret, node, i; io_wq_create() local
1241 int node; io_wq_exit_workers() local
1269 int node; io_wq_destroy() local
1326 io_wq_cpu_online(unsigned int cpu, struct hlist_node *node) io_wq_cpu_online() argument
1333 io_wq_cpu_offline(unsigned int cpu, struct hlist_node *node) io_wq_cpu_offline() argument
1365 int i, node; io_wq_max_workers() local
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/marvell/octeontx2/nic/
H A Dotx2_tc.c289 struct otx2_tc_flow *node) in otx2_tc_act_set_hw_police()
295 rc = cn10k_alloc_leaf_profile(nic, &node->leaf_profile); in otx2_tc_act_set_hw_police()
301 rc = cn10k_set_ipolicer_rate(nic, node->leaf_profile, in otx2_tc_act_set_hw_police()
302 node->burst, node->rate, node->is_pps); in otx2_tc_act_set_hw_police()
306 rc = cn10k_map_unmap_rq_policer(nic, node->rq, node->leaf_profile, true); in otx2_tc_act_set_hw_police()
315 if (cn10k_free_leaf_profile(nic, node->leaf_profile)) in otx2_tc_act_set_hw_police()
318 node in otx2_tc_act_set_hw_police()
288 otx2_tc_act_set_hw_police(struct otx2_nic *nic, struct otx2_tc_flow *node) otx2_tc_act_set_hw_police() argument
323 otx2_tc_act_set_police(struct otx2_nic *nic, struct otx2_tc_flow *node, struct flow_cls_offload *f, u64 rate, u32 burst, u32 mark, struct npc_install_flow_req *req, bool pps) otx2_tc_act_set_police() argument
356 otx2_tc_parse_actions(struct otx2_nic *nic, struct flow_action *flow_action, struct npc_install_flow_req *req, struct flow_cls_offload *f, struct otx2_tc_flow *node) otx2_tc_parse_actions() argument
517 otx2_tc_prepare_flow(struct otx2_nic *nic, struct otx2_tc_flow *node, struct flow_cls_offload *f, struct npc_install_flow_req *req) otx2_tc_prepare_flow() argument
806 otx2_tc_del_from_flow_list(struct otx2_flow_config *flow_cfg, struct otx2_tc_flow *node) otx2_tc_del_from_flow_list() argument
821 otx2_tc_add_to_flow_list(struct otx2_flow_config *flow_cfg, struct otx2_tc_flow *node) otx2_tc_add_to_flow_list() argument
912 otx2_tc_update_mcam_table_del_req(struct otx2_nic *nic, struct otx2_flow_config *flow_cfg, struct otx2_tc_flow *node) otx2_tc_update_mcam_table_del_req() argument
951 otx2_tc_update_mcam_table_add_req(struct otx2_nic *nic, struct otx2_flow_config *flow_cfg, struct otx2_tc_flow *node) otx2_tc_update_mcam_table_add_req() argument
982 otx2_tc_update_mcam_table(struct otx2_nic *nic, struct otx2_flow_config *flow_cfg, struct otx2_tc_flow *node, bool add_req) otx2_tc_update_mcam_table() argument
1416 otx2_tc_config_ingress_rule(struct otx2_nic *nic, struct otx2_tc_flow *node) otx2_tc_config_ingress_rule() argument
1442 struct otx2_tc_flow *node; otx2_tc_apply_ingress_police_rules() local
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_ir.h52 class node;
442 typedef std::list< node * > uselist;
486 node *def, *adef;
509 node* any_def() { in any_def()
582 void add_use(node *n);
583 void remove_use(const node *n);
767 class node { class
770 node(node_type nt, node_subtype nst, node_flags flags = NF_EMPTY) in node() function in r600_sb::node
775 virtual ~node() {}; in ~node()
778 node *pre
[all...]
/foundation/arkui/ace_engine/frameworks/core/animation/
H A Dsimple_spring_adapter.h30 void AddNode(RefPtr<SpringNode> node);
32 RefPtr<SpringNode> GetNext(const RefPtr<SpringNode>& node) override;
58 auto node = GetNode(index); in SetDeltaValue() local
59 if (node) { in SetDeltaValue()
60 node->SetDeltaValue(delta); in SetDeltaValue()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/recycle_view/
H A Drecycle_dummy_node.cpp23 auto node = MakeRefPtr<RecycleDummyNode>(nodeId); in CreateRecycleDummyNode() local
24 return node; in CreateRecycleDummyNode()
29 auto node = CreateRecycleDummyNode(nodeId); in WrapRecycleDummyNode() local
31 node->AddChild(uiNode); in WrapRecycleDummyNode()
32 return node; in WrapRecycleDummyNode()
/foundation/arkui/ui_lite/frameworks/core/
H A Dtask_manager.cpp72 ListNode<Task*>* node = list_.Begin(); in TaskHandler() local
74 while (node != list_.End()) { in TaskHandler()
75 Task* currentTask = node->data_; in TaskHandler()
78 node = node->next_; in TaskHandler()
/foundation/graphic/graphic_2d/rosen/modules/graphic_2d_configure/include/
H A Dgraphic_2d_xml_parser.h47 static int32_t GetG2cXmlNodeAsInt(xmlNode &node);
48 bool ParseInternal(xmlNode &node);
49 int32_t ParseParams(xmlNode &node);
50 int32_t ParseSimplex(xmlNode &node, std::unordered_map<std::string, std::string> &config,
53 std::string ExtractPropertyValue(const std::string &propName, xmlNode &node);
/foundation/graphic/graphic_2d/rosen/test/render/render/unittest/pipeline/
H A Drs_pointer_window_manager_unit_test.cpp55 auto node = RSTestUtil::CreateSurfaceNode(); in HWTEST_F() local
56 node->nodeType_ = RSSurfaceNodeType::SELF_DRAWING_WINDOW_NODE; in HWTEST_F()
57 node->name_ = "pointer window"; in HWTEST_F()
58 node->GetDirtyManager()->SetCurrentFrameDirtyRect(RectI{1, 1, 1, 1}); in HWTEST_F()
60 rsPointerWindowManager->UpdatePointerDirtyToGlobalDirty(node, displayNode); in HWTEST_F()
/foundation/graphic/graphic_2d/rosen/test/render_service/render_service/unittest/pipeline/
H A Drs_pointer_window_manager_test.cpp55 auto node = RSTestUtil::CreateSurfaceNode(); in HWTEST_F() local
56 node->nodeType_ = RSSurfaceNodeType::SELF_DRAWING_WINDOW_NODE; in HWTEST_F()
57 node->name_ = "pointer window"; in HWTEST_F()
58 node->GetDirtyManager()->SetCurrentFrameDirtyRect(RectI{1, 1, 1, 1}); in HWTEST_F()
60 rsPointerWindowManager->UpdatePointerDirtyToGlobalDirty(node, displayNode); in HWTEST_F()
/foundation/communication/bluetooth_service/services/bluetooth/stack/src/hci/
H A Dhci_failure.c70 ListNode *node = ListGetFirstNode(g_hciFailureCallbackList); in HciOnCmdTimeout() local
71 while (node != NULL) { in HciOnCmdTimeout()
72 callbacks = ListGetNodeData(node); in HciOnCmdTimeout()
78 node = ListGetNextNode(node); in HciOnCmdTimeout()
/kernel/linux/linux-5.10/sound/soc/meson/
H A Dmeson-card.h21 struct device_node *node,
31 unsigned int meson_card_parse_daifmt(struct device_node *node,
41 struct device_node *node,
46 struct device_node *node);
49 struct device_node *node,
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/
H A DAddDefaultReturnStatements.cpp23 bool NeedsReturnStatement(TIntermFunctionDefinition *node, TType *returnType) in NeedsReturnStatement() argument
25 *returnType = node->getFunctionPrototype()->getType(); in NeedsReturnStatement()
31 TIntermBlock *bodyNode = node->getBody(); in NeedsReturnStatement()
46 for (TIntermNode *node : *root->getSequence()) in AddDefaultReturnStatements()
48 TIntermFunctionDefinition *definition = node->getAsFunctionDefinition(); in AddDefaultReturnStatements()
/third_party/skia/third_party/externals/freetype/include/freetype/
H A Dftlist.h83 * Find the list node for a given listed object.
92 * List node. `NULL` if it wasn't found.
110 * node ::
111 * The node to append.
115 FT_ListNode node );
129 * node ::
130 * The node to insert.
134 FT_ListNode node );
143 * Remove a node from a list. This function doesn't check whether the
144 * node i
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/selftests/
H A Di915_gem_gtt.c316 mock_vma->node.size = BIT_ULL(size); in lowlevel_hole()
317 mock_vma->node.start = addr; in lowlevel_hole()
430 if (!drm_mm_node_allocated(&vma->node) || in fill_hole()
432 pr_err("%s(%s) (forward) insert failed: vma.node=%llx + %llx [allocated? %d], expected offset %llx\n", in fill_hole()
433 __func__, p->name, vma->node.start, vma->node.size, drm_mm_node_allocated(&vma->node), in fill_hole()
460 if (!drm_mm_node_allocated(&vma->node) || in fill_hole()
462 pr_err("%s(%s) (forward) moved vma.node=%llx + %llx, expected offset %llx\n", in fill_hole()
463 __func__, p->name, vma->node in fill_hole()
1097 struct drm_mm_node *node; exercise_ggtt() local
[all...]
/kernel/liteos_a/kernel/extended/liteipc/
H A Dhm_liteipc.c94 STATIC UINT32 HandleSpecialObjects(UINT32 dstTid, IpcListNode *node, BOOL isRollback);
294 IpcUsedNode *node = NULL; in LiteIpcPoolDelete() local
300 node = LOS_DL_LIST_ENTRY(ipcInfo->ipcUsedNodelist.pstNext, IpcUsedNode, list); in LiteIpcPoolDelete()
301 LOS_ListDelete(&node->list); in LiteIpcPoolDelete()
302 free(node); in LiteIpcPoolDelete()
342 /* Only when kernenl no longer access ipc node content, can user free the ipc node */
347 IpcUsedNode *node = (IpcUsedNode *)malloc(sizeof(IpcUsedNode)); in EnableIpcNodeFreeByUser() local
348 if (node != NULL) { in EnableIpcNodeFreeByUser()
349 node in EnableIpcNodeFreeByUser()
373 IpcUsedNode *node = NULL; IsIpcNode() local
403 CheckUsedBuffer(const VOID *node, IpcListNode **outPtr) CheckUsedBuffer() argument
595 IpcListNode *node = NULL; LiteIpcRemoveServiceHandle() local
834 HandleSpecialObjects(UINT32 dstTid, IpcListNode *node, BOOL isRollback) HandleSpecialObjects() argument
908 CopyDataFromUser(IpcListNode *node, UINT32 bufSz, const IpcMsg *msg) CopyDataFromUser() argument
955 IpcListNode *node = (IpcListNode *)GetIpcKernelAddr(curr, (INTPTR)(content->buffToFree)); IsValidReply() local
1101 CheckReceivedMsg(IpcListNode *node, IpcContent *content, LosTaskCB *tcb) CheckReceivedMsg() argument
1143 (VOID)HandleSpecialObjects(LOS_CurTaskIDGet(), node, TRUE); CheckReceivedMsg() local
1157 IpcListNode *node = NULL; LiteIpcRead() local
[all...]

Completed in 17 milliseconds

1...<<81828384858687888990>>...457