Home
last modified time | relevance | path

Searched refs:nodes (Results 726 - 750 of 907) sorted by relevance

1...<<21222324252627282930>>...37

/foundation/graphic/graphic_3d/lume/LumeRender/src/
H A Drenderer.cpp131 // reset always, dependencies are redone with new nodes in InitializeRenderNodeContextData()
136 // with dynamic render node graphs, single nodes can be initialized in InitializeRenderNodeContextData()
409 rngd.nodes.push_back(move(rnd)); in CreateDefaultRenderNodeGraphs()
417 rngd.nodes.push_back(move(rnd)); in CreateDefaultRenderNodeGraphs()
430 rngd.nodes.push_back(move(rnd)); in CreateDefaultRenderNodeGraphs()
676 // render graph process for all render nodes of all render graphs in RenderFrameImpl()
893 // single threaded gpu resource creation with render nodes in ExecuteRenderNodes()
/kernel/linux/linux-5.10/fs/jffs2/
H A Dreadinode.c156 /* We only check the data CRC of unchecked nodes */ in check_tn_node()
206 * This function is used when we read an inode. Data nodes arrive in
207 * arbitrary order -- they may be older or newer than the nodes which
229 Note that such nodes won't be REF_UNCHECKED since there are no data to in jffs2_add_tn_to_tree()
301 /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */ in jffs2_add_tn_to_tree()
313 dbg_readinode("Done killing overlapped nodes\n"); in jffs2_add_tn_to_tree()
445 we add nodes to the real fragtree, as long as they don't overlap. And
446 having thrown away the majority of overlapped nodes as we went, there
447 really shouldn't be many sets of nodes which do overlap. If we start at
448 the end, we can use the overlap markers -- we can just eat nodes whic
[all...]
H A Dnodemgmt.c53 * jffs2_reserve_space - request physical space to write nodes to flash
113 * of nodes. in jffs2_reserve_space()
132 * don't know, if unchecked size contains obsoleted nodes, which could give us some in jffs2_reserve_space()
134 * of nodes. in jffs2_reserve_space()
494 * Should only be used to report nodes for which space has been allocated
512 /* Allow non-obsolete nodes only to be added at the end of c->nextblock, in jffs2_add_physical_node_ref()
513 if c->nextblock is set. Note that wbuf.c will file obsolete nodes in jffs2_add_physical_node_ref()
609 function without actually obliterating any nodes or freeing in jffs2_mark_node_obsolete()
681 obliterate nodes that look obsolete. If they weren't in jffs2_mark_node_obsolete()
797 obsolete dirent nodes t in jffs2_mark_node_obsolete()
[all...]
H A Dnodelist.c220 /* Skip all the nodes which are completed before this one starts */ in jffs2_add_frag_to_fragtree()
383 /* If we now share a page with other nodes, mark either previous in jffs2_add_full_dnode_to_inode()
563 /* Pass 'c' argument to indicate that nodes should be marked obsolete as
627 ref->next_in_ino = ic->nodes; in jffs2_link_node_ref()
628 ic->nodes = ref; in jffs2_link_node_ref()
691 /* Calculate totlen from surrounding nodes or eraseblock */
/kernel/linux/linux-6.6/fs/jffs2/
H A Dreadinode.c156 /* We only check the data CRC of unchecked nodes */ in check_tn_node()
206 * This function is used when we read an inode. Data nodes arrive in
207 * arbitrary order -- they may be older or newer than the nodes which
229 Note that such nodes won't be REF_UNCHECKED since there are no data to in jffs2_add_tn_to_tree()
301 /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */ in jffs2_add_tn_to_tree()
313 dbg_readinode("Done killing overlapped nodes\n"); in jffs2_add_tn_to_tree()
445 we add nodes to the real fragtree, as long as they don't overlap. And
446 having thrown away the majority of overlapped nodes as we went, there
447 really shouldn't be many sets of nodes which do overlap. If we start at
448 the end, we can use the overlap markers -- we can just eat nodes whic
[all...]
H A Dnodemgmt.c53 * jffs2_reserve_space - request physical space to write nodes to flash
113 * of nodes. in jffs2_reserve_space()
132 * don't know, if unchecked size contains obsoleted nodes, which could give us some in jffs2_reserve_space()
134 * of nodes. in jffs2_reserve_space()
494 * Should only be used to report nodes for which space has been allocated
512 /* Allow non-obsolete nodes only to be added at the end of c->nextblock, in jffs2_add_physical_node_ref()
513 if c->nextblock is set. Note that wbuf.c will file obsolete nodes in jffs2_add_physical_node_ref()
609 function without actually obliterating any nodes or freeing in jffs2_mark_node_obsolete()
681 obliterate nodes that look obsolete. If they weren't in jffs2_mark_node_obsolete()
797 obsolete dirent nodes t in jffs2_mark_node_obsolete()
[all...]
H A Dnodelist.c220 /* Skip all the nodes which are completed before this one starts */ in jffs2_add_frag_to_fragtree()
383 /* If we now share a page with other nodes, mark either previous in jffs2_add_full_dnode_to_inode()
563 /* Pass 'c' argument to indicate that nodes should be marked obsolete as
627 ref->next_in_ino = ic->nodes; in jffs2_link_node_ref()
628 ic->nodes = ref; in jffs2_link_node_ref()
691 /* Calculate totlen from surrounding nodes or eraseblock */
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DTranslatorVulkan.cpp773 std::array<TIntermNode *, 8> nodes = { in AddBresenhamEmulationFS() local
775 emulationSequence->insert(emulationSequence->begin(), nodes.begin(), nodes.end()); in AddBresenhamEmulationFS()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/text/
H A Dtext_pattern.cpp2913 // Depth-first iterates through all host's child nodes to collect the SpanNode object, building a text rendering in PreCreateLayoutWrapper()
2915 std::stack<SpanNodeInfo> nodes; in PreCreateLayoutWrapper() local
2917 nodes.push({ .node = *iter }); in PreCreateLayoutWrapper()
2920 InitSpanItem(nodes); in PreCreateLayoutWrapper()
2923 void TextPattern::InitSpanItem(std::stack<SpanNodeInfo> nodes) in InitSpanItem() argument
2931 if (!nodes.empty()) { in InitSpanItem()
2939 CollectSpanNodes(nodes, isSpanHasClick); in InitSpanItem()
3005 void TextPattern::CollectSpanNodes(std::stack<SpanNodeInfo> nodes, bool& isSpanHasClick) in CollectSpanNodes() argument
3007 while (!nodes.empty()) { in CollectSpanNodes()
3008 auto current = nodes in CollectSpanNodes()
[all...]
H A Dtext_pattern.h907 void CollectSpanNodes(std::stack<SpanNodeInfo> nodes, bool& isSpanHasClick);
918 void InitSpanItem(std::stack<SpanNodeInfo> nodes);
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/
H A Dintel_lrc.c200 * engine, sorted by priority. Here we preallocate the nodes we need
206 } nodes[I915_NUM_ENGINES]; member
498 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in need_preempt()
1919 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in need_timeslice()
2107 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_dequeue()
2235 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_dequeue()
4410 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_reset_cancel()
5473 struct rb_node *node = &ve->nodes[sibling->id].rb; in rcu_virtual_context_destroy()
5634 struct ve_node * const node = &ve->nodes[sibling->id]; in virtual_submission_tasklet()
5867 GEM_BUG_ON(RB_EMPTY_NODE(&ve->nodes[siblin in intel_execlists_create_virtual()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dioctl.c1559 leaf = path->nodes[0]; in copy_to_sk()
1854 l = path->nodes[0]; in btrfs_search_path_in_tree()
1939 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
1965 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2024 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2204 btrfs_header_nritems(path->nodes[0])) { in btrfs_ioctl_get_subvol_info()
2214 leaf = path->nodes[0]; in btrfs_ioctl_get_subvol_info()
2287 btrfs_header_nritems(path->nodes[0])) { in btrfs_ioctl_get_subvol_rootref()
2297 leaf = path->nodes[0]; in btrfs_ioctl_get_subvol_rootref()
2965 btrfs_set_dir_item_key(path->nodes[ in btrfs_ioctl_default_subvol()
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_resolve_ast.c566 a1_node = a1->datum.nodes->head->data; in cil_resolve_alias_to_actual()
574 a1_node = a1->datum.nodes->head->data; in cil_resolve_alias_to_actual()
2378 if (current != block->datum.nodes->head->data) { in cil_resolve_blockinherit_copy()
2459 if (block_datum->nodes && block_datum->nodes->head != block_datum->nodes->tail) { in cil_resolve_in()
2860 cil_list_append(((struct cil_symtab_datum*)catset)->nodes, in cil_build_call_args()
2890 cil_list_append(((struct cil_symtab_datum*)level)->nodes, in cil_build_call_args()
2920 cil_list_append(((struct cil_symtab_datum*)range)->nodes, in cil_build_call_args()
2954 cil_list_append(DATUM(ipaddr)->nodes, CIL_LIST_ITE in cil_build_call_args()
[all...]
/foundation/arkui/ace_engine/adapter/ohos/osal/
H A Djs_accessibility_manager.cpp750 std::queue<NG::UINode*>& nodes, RefPtr<NG::FrameNode>& result) in FindFrameNodeByAccessibilityId()
761 nodes.push(Referenced::RawPtr(child)); in FindFrameNodeByAccessibilityId()
772 std::queue<NG::UINode*> nodes; in GetFramenodeByAccessibilityId() local
773 nodes.push(Referenced::RawPtr(root)); in GetFramenodeByAccessibilityId()
776 while (!nodes.empty()) { in GetFramenodeByAccessibilityId()
777 auto current = nodes.front(); in GetFramenodeByAccessibilityId()
778 nodes.pop(); in GetFramenodeByAccessibilityId()
783 if (FindFrameNodeByAccessibilityId(id, children, nodes, frameNodeResult)) { in GetFramenodeByAccessibilityId()
788 if (FindFrameNodeByAccessibilityId(id, children, nodes, frameNodeResult)) { in GetFramenodeByAccessibilityId()
799 if (FindFrameNodeByAccessibilityId(id, children, nodes, frameNodeResul in GetFramenodeByAccessibilityId()
749 FindFrameNodeByAccessibilityId(int64_t id, const std::list<RefPtr<NG::UINode>>& children, std::queue<NG::UINode*>& nodes, RefPtr<NG::FrameNode>& result) FindFrameNodeByAccessibilityId() argument
3963 std::queue<RefPtr<NG::UINode>> nodes; FindNodeFromRootByExtensionId() local
[all...]
/foundation/arkui/ace_engine/test/unittest/core/syntax/
H A Drepeat_node_cache_syntax_test.cpp338 std::list<RefPtr<UINode>> nodes = repeatNode->GetChildren(); in HWTEST_F() local
339 EXPECT_EQ(nodes.size(), 0); in HWTEST_F()
496 * @tc.expected: Because there are no nodes nullptr is returned in HWTEST_F()
/kernel/linux/linux-5.10/fs/ubifs/
H A Dorphan.c37 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
399 * write_orph_nodes - write orphan nodes until there are no more to commit.
403 * This function writes orphan nodes for all the orphans to commit. On success,
645 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
662 * row, the commit number written on orphan nodes will continue in do_kill_orphans()
767 * Orph nodes always start at c->orph_first and are written to each in kill_orphans()
769 * but may contain out of date orphan nodes if the unmap didn't go in kill_orphans()
772 * there are orphan nodes from the next commit (i.e. the commit did not in kill_orphans()
959 list_for_each_entry(snod, &sleb->nodes, list) { in dbg_read_orphans()
1046 dbg_cmt("total number of leaf nodes i in dbg_check_orphans()
[all...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Dorphan.c37 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
399 * write_orph_nodes - write orphan nodes until there are no more to commit.
403 * This function writes orphan nodes for all the orphans to commit. On success,
645 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
662 * row, the commit number written on orphan nodes will continue in do_kill_orphans()
767 * Orph nodes always start at c->orph_first and are written to each in kill_orphans()
769 * but may contain out of date orphan nodes if the unmap didn't go in kill_orphans()
772 * there are orphan nodes from the next commit (i.e. the commit did not in kill_orphans()
959 list_for_each_entry(snod, &sleb->nodes, list) { in dbg_read_orphans()
1046 dbg_cmt("total number of leaf nodes i in dbg_check_orphans()
[all...]
/third_party/mesa3d/src/egl/drivers/dri2/
H A Dplatform_ohos.c1038 /* Handle control nodes using __DRI_DRI2_LOADER extension and GEM names in ohos_load_driver()
1183 dri2_dpy->fd = loader_open_device(device->nodes[node_type]); in ohos_open_device()
1187 __func__, device->nodes[node_type]); in ohos_open_device()
/foundation/ai/neural_network_runtime/frameworks/native/neural_network_runtime/
H A Dlite_graph_to_hdi_model_v2_0.cpp1011 std::vector<OHOS::HDI::Nnrt::V2_0::Node> nodes; in LiteGraph_To_HDIModel() local
1015 // nodes in LiteGraph_To_HDIModel()
1032 nodes.emplace_back(tmp); in LiteGraph_To_HDIModel()
1083 retModel->nodes = nodes; in LiteGraph_To_HDIModel()
H A Dlite_graph_to_hdi_model_v1_0.cpp1010 std::vector<OHOS::HDI::Nnrt::V1_0::Node> nodes; in LiteGraph_To_HDIModel() local
1014 // nodes in LiteGraph_To_HDIModel()
1031 nodes.emplace_back(tmp); in LiteGraph_To_HDIModel()
1082 retModel->nodes = nodes; in LiteGraph_To_HDIModel()
/kernel/linux/linux-5.10/fs/ocfs2/cluster/
H A Dheartbeat.c56 * - o2hb_quorum_region_bitmap tracks live regions that have seen all nodes
404 printk(KERN_NOTICE "o2hb: all nodes hb write hung, maybe region %s (%s) is down.\n", in o2hb_nego_timeout()
863 * live nodes heartbeat on it. In other words, the region has been in o2hb_set_quorum_device()
864 * added to all nodes. in o2hb_set_quorum_device()
973 /* dead nodes only come to life after some number of in o2hb_check_slot()
984 mlog(ML_HEARTBEAT, "o2hb: Add node %d to live nodes " in o2hb_check_slot()
1000 /* We want to be sure that all nodes agree on the in o2hb_check_slot()
1023 /* live nodes only go dead after enough consequtive missed in o2hb_check_slot()
1036 "nodes bitmap\n", slot->ds_node_num); in o2hb_check_slot()
1068 static int o2hb_highest_node(unsigned long *nodes, in argument
1073 o2hb_lowest_node(unsigned long *nodes, int numbits) o2hb_lowest_node() argument
[all...]
/kernel/linux/linux-6.6/fs/ocfs2/cluster/
H A Dheartbeat.c54 * - o2hb_quorum_region_bitmap tracks live regions that have seen all nodes
400 printk(KERN_NOTICE "o2hb: all nodes hb write hung, maybe region %s (%pg) is down.\n", in o2hb_nego_timeout()
856 * live nodes heartbeat on it. In other words, the region has been in o2hb_set_quorum_device()
857 * added to all nodes. in o2hb_set_quorum_device()
966 /* dead nodes only come to life after some number of in o2hb_check_slot()
977 mlog(ML_HEARTBEAT, "o2hb: Add node %d to live nodes " in o2hb_check_slot()
993 /* We want to be sure that all nodes agree on the in o2hb_check_slot()
1016 /* live nodes only go dead after enough consequtive missed in o2hb_check_slot()
1029 "nodes bitmap\n", slot->ds_node_num); in o2hb_check_slot()
1061 static int o2hb_highest_node(unsigned long *nodes, in argument
1066 o2hb_lowest_node(unsigned long *nodes, int numbits) o2hb_lowest_node() argument
[all...]
/third_party/alsa-utils/topology/nhlt/intel/ssp/
H A Dssp-process.c678 node->node_id = aux->sync.nodes[i].node_id; in ssp_calculate_intern_ext()
679 node->sampling_rate = aux->sync.nodes[i].sampling_rate; in ssp_calculate_intern_ext()
1175 ssp->ssp_prm[di].aux_cfg[hwi].sync.nodes[count].node_id = node_id; in ssp_node_set_params()
1176 ssp->ssp_prm[di].aux_cfg[hwi].sync.nodes[count].sampling_rate = sampling_rate; in ssp_node_set_params()
/third_party/mesa3d/src/imagination/vulkan/
H A Dpvr_device.c309 const char *path = drm_render_device->nodes[DRM_NODE_RENDER]; in pvr_physical_device_init()
364 primary_path = drm_primary_device->nodes[DRM_NODE_PRIMARY]; in pvr_physical_device_init()
540 drm_render_device->nodes[DRM_NODE_RENDER]); in pvr_enumerate_devices()
546 drm_primary_device->nodes[DRM_NODE_PRIMARY]); in pvr_enumerate_devices()
/kernel/linux/linux-6.6/drivers/android/
H A Dbinder.c22 * (proc->threads, proc->waiting_threads, proc->nodes)
734 struct rb_node *n = proc->nodes.rb_node; in binder_get_node_ilocked()
775 struct rb_node **p = &proc->nodes.rb_node; in binder_init_node_ilocked()
807 rb_insert_color(&node->rb_node, &proc->nodes); in binder_init_node_ilocked()
947 rb_erase(&node->rb_node, &proc->nodes); in binder_dec_node_nilocked()
1006 * print nodes)
4606 rb_erase(&node->rb_node, &proc->nodes); in binder_thread_read()
5296 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) { in binder_ioctl_get_node_debug_info()
5991 int threads, nodes, incoming_refs, outgoing_refs, active_transactions; in binder_deferred_release() local
6029 nodes in binder_deferred_release()
[all...]

Completed in 63 milliseconds

1...<<21222324252627282930>>...37