Home
last modified time | relevance | path

Searched refs:nodes (Results 351 - 375 of 925) sorted by relevance

1...<<11121314151617181920>>...37

/kernel/linux/linux-6.6/drivers/interconnect/
H A Dcore.c55 list_for_each_entry(n, &provider->nodes, node_list) { in icc_summary_show()
117 /* draw nodes */ in icc_graph_show()
118 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
122 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
133 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
157 list_for_each_entry(n, &provider->nodes, node_list) { in node_find_by_name()
342 * multiple interconnect nodes. A single cell is used as an index into
343 * an array of icc nodes specified in the icc_onecell_data struct when
357 return icc_data->nodes[idx]; in of_icc_xlate_onecell()
880 * icc_link_create() - create a link between two nodes
[all...]
/foundation/window/window_manager/wmserver/test/unittest/
H A Dwindow_display_zoom_controller_test.cpp100 std::vector<sptr<WindowNode>> nodes; in HWTEST_F() local
101 displayController_->ClearZoomTransform(nodes); in HWTEST_F()
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dmm.h21 struct list_head nodes; member
48 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_heap_size()
/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dmm.h21 struct list_head nodes; member
48 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_heap_size()
/third_party/node/deps/brotli/c/enc/
H A Dbackward_references_hq.h74 On return, the nodes[0..num_bytes] array will have the following
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
77 (1) nodes[i].copy_length() >= 2
78 (2) nodes[i].command_length() <= i and
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
87 const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbackward_references_hq.h74 On return, the nodes[0..num_bytes] array will have the following
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
77 (1) nodes[i].copy_length() >= 2
78 (2) nodes[i].command_length() <= i and
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
87 const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
/third_party/selinux/libsepol/cil/src/
H A Dcil_symtab.h39 struct cil_list *nodes; member
46 #define NODE(n) ((struct cil_tree_node *)(DATUM(n)->nodes->head->data))
/foundation/graphic/graphic_3d/lume/Lume_3D/src/util/
H A Drender_util.cpp101 for (auto& rnRef : desc.nodes) { in FillCameraDescsData()
125 for (auto& rnRef : desc.nodes) { in FillCameraPostProcessDescsData()
290 if (!desc.nodes.empty()) { in GetRenderNodeGraphDescs()
313 if (!ppDesc.nodes.empty()) { in GetRenderNodeGraphDescs()
345 for (auto& rnRef : desc.nodes) { in GetRenderNodeGraphDesc()
369 for (auto& rnRef : desc.nodes) { in GetRenderNodeGraphDesc()
/kernel/linux/linux-6.6/include/trace/events/
H A Dbcache.h298 TP_PROTO(unsigned nodes),
299 TP_ARGS(nodes),
302 __field(unsigned, nodes )
306 __entry->nodes = nodes;
309 TP_printk("coalesced %u nodes", __entry->nodes)
/third_party/mesa3d/src/imgui/
H A Dimstb_rectpack.h128 STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
131 // using temporary storage provided by the array 'nodes', which is 'num_nodes' long
135 // There is no "shutdown" function. The 'nodes' memory must stay valid for
189 stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2'
250 // so that num_nodes is always enough nodes. in stbrp_setup_allow_out_of_mem()
260 STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
268 nodes[i].next = &nodes[i+1]; in stbrp_init_target()
269 nodes[i].next = NULL; in stbrp_init_target()
272 context->free_head = &nodes[ in stbrp_init_target()
[all...]
/third_party/skia/third_party/externals/imgui/
H A Dimstb_rectpack.h130 STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
133 // using temporary storage provided by the array 'nodes', which is 'num_nodes' long
137 // There is no "shutdown" function. The 'nodes' memory must stay valid for
191 stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2'
252 // so that num_nodes is always enough nodes. in stbrp_setup_allow_out_of_mem()
262 STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
270 nodes[i].next = &nodes[i+1]; in stbrp_init_target()
271 nodes[i].next = NULL; in stbrp_init_target()
274 context->free_head = &nodes[ in stbrp_init_target()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.c1348 if (mirror_top_info->nodes[j].node_id != src_node_id) in psp_xgmi_reflect_topology_info()
1351 mirror_top_info->nodes[j].num_hops = dst_num_hops; in psp_xgmi_reflect_topology_info()
1358 mirror_top_info->nodes[j].num_links = dst_num_links; in psp_xgmi_reflect_topology_info()
1393 topology_info_input->nodes[i].node_id = topology->nodes[i].node_id; in psp_xgmi_get_topology_info()
1394 topology_info_input->nodes[i].num_hops = topology->nodes[i].num_hops; in psp_xgmi_get_topology_info()
1395 topology_info_input->nodes[i].is_sharing_enabled = topology->nodes[i].is_sharing_enabled; in psp_xgmi_get_topology_info()
1396 topology_info_input->nodes[ in psp_xgmi_get_topology_info()
[all...]
/third_party/jinja2/
H A Denvironment.py16 from . import nodes namespace
43 from .nodes import EvalContext
599 ) -> nodes.Template:
601 tree of nodes is used by the compiler to convert the template into
615 ) -> nodes.Template:
679 source: nodes.Template,
709 source: t.Union[str, nodes.Template],
720 source: t.Union[str, nodes.Template],
731 source: t.Union[str, nodes.Template],
811 body = [nodes
[all...]
/foundation/arkui/ace_engine/frameworks/core/common/recorder/
H A Dnode_data_cache.cpp174 void NodeDataCache::GetNodeData(const std::string& pageUrl, std::unordered_map<std::string, std::string>& nodes) in GetNodeData() argument
184 for (auto nodeIter = nodes.begin(); nodeIter != nodes.end(); nodeIter++) { in GetNodeData()
187 nodes[it->first] = it->second; in GetNodeData()
/foundation/arkui/ace_engine/frameworks/core/components_ng/syntax/
H A Dfor_each_node.cpp23 void MakeNodeMapById(const std::list<RefPtr<UINode>>& nodes, const std::list<std::string>& ids, in MakeNodeMapById() argument
26 ACE_DCHECK(ids.size() == nodes.size()); in MakeNodeMapById()
28 auto nodeIter = nodes.begin(); in MakeNodeMapById()
29 while (idsIter != ids.end() && nodeIter != nodes.end()) { in MakeNodeMapById()
209 // Collect IDs of removed nodes starting from 'oldNode' (incl.) in FinishRepeatRender()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Daudit-report.js131 // which also have the affected nodes, and also create entries
147 // need to search for nodes we already would have added.
166 if (vuln.nodes.has(node)) {
171 vuln.nodes.add(node)
197 if (this.get(name).nodes.size === 0) {
203 // the nodes it references, then remove it from the advisory list.
206 const relevant = [...vuln.nodes]
252 // We don't provide fixes for top nodes other than root, but we
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_opt_push_ubo.c223 * Create an undirected graph where nodes are 32-bit uniform indices and edges
224 * represent that two nodes are used in the same instruction.
232 unsigned nodes[BI_MAX_SRCS] = {}; in bi_create_fau_interference_graph() local
235 /* Set nodes[] to 32-bit uniforms accessed */ in bi_create_fau_interference_graph()
241 nodes[node_count++] = word; in bi_create_fau_interference_graph()
245 /* Create clique connecting nodes[] */ in bi_create_fau_interference_graph()
251 unsigned x = nodes[i], y = nodes[j]; in bi_create_fau_interference_graph()
254 /* Add undirected edge between the nodes */ in bi_create_fau_interference_graph()
314 /* Push unpaired nodes a in bi_opt_reorder_push()
[all...]
/third_party/skia/buildtools/checkdeps/
H A Dgraphdeps.py33 Also can highlight fanins and/or fanouts of certain nodes matching the
69 incl: Include only nodes matching this regexp; such nodes' fanin/fanout
71 excl: Exclude nodes matching this regexp; such nodes' fanin/fanout is
73 hilite_fanins: Highlight fanins of nodes matching this regexp with a
75 hilite_fanouts: Highlight fanouts of nodes matching this regexp with a
140 """Computes nodes' and edges' properties for the dependency graph |deps| and
187 # Edges and nodes are emphasized with color and line/border weight depending
235 nodes
[all...]
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v2_0/hdi_cpu_service/src/
H A Dnnrt_device_service.cpp71 size_t nodeSize = model.nodes.size(); in GetSupportedOperation()
72 auto nodes = model.nodes; in GetSupportedOperation() local
76 ops[i] = regInstance.IsNodeTypeExist(nodes[i].nodeType); in GetSupportedOperation()
287 if (model.nodes.empty()) { in ValidateModel()
288 HDF_LOGE("Model has no nodes."); in ValidateModel()
343 for (auto& node : model.nodes) { in TransModelToGraph()
349 metaGraph->nodes.emplace_back(std::move(transNode)); in TransModelToGraph()
/kernel/linux/linux-5.10/drivers/base/
H A Dswnode.c3 * Software nodes for the firmware node framework.
695 * software_node_register_nodes - Register an array of software nodes
696 * @nodes: Zero terminated array of software nodes to be registered
698 * Register multiple software nodes at once.
700 int software_node_register_nodes(const struct software_node *nodes) in software_node_register_nodes() argument
705 for (i = 0; nodes[i].name; i++) { in software_node_register_nodes()
706 ret = software_node_register(&nodes[i]); in software_node_register_nodes()
708 software_node_unregister_nodes(nodes); in software_node_register_nodes()
718 * software_node_unregister_nodes - Unregister an array of software nodes
728 software_node_unregister_nodes(const struct software_node *nodes) software_node_unregister_nodes() argument
[all...]
/third_party/ninja/src/
H A Dgraph.cc55 std::deque<Node*> nodes(1, initial_node); in RecomputeDirty()
57 // RecomputeNodeDirty might return new validation nodes that need to be in RecomputeDirty()
58 // checked for dirty state, keep a queue of nodes to visit. in RecomputeDirty()
59 while (!nodes.empty()) { in RecomputeDirty()
60 Node* node = nodes.front(); in RecomputeDirty()
61 nodes.pop_front(); in RecomputeDirty()
68 nodes.insert(nodes.end(), new_validation_nodes.begin(), in RecomputeDirty()
159 // Store any validation nodes from the edge for adding to the initial in RecomputeNodeDirty()
160 // nodes in RecomputeNodeDirty()
[all...]
/third_party/ltp/testcases/kernel/mem/lib/
H A Dmem.c172 int num_nodes, *nodes; in set_global_mempolicy() local
176 ret = get_allowed_nodes_arr(NH_MEMS|NH_CPUS, &num_nodes, &nodes); in set_global_mempolicy()
181 free(nodes); in set_global_mempolicy()
187 set_node(nmask, nodes[1]); in set_global_mempolicy()
193 "more than 2 numa nodes"); in set_global_mempolicy()
194 free(nodes); in set_global_mempolicy()
198 set_node(nmask, nodes[1]); in set_global_mempolicy()
199 set_node(nmask, nodes[2]); in set_global_mempolicy()
/kernel/linux/linux-5.10/fs/ubifs/
H A Dgc.c14 * nodes) or not. For non-index LEBs, garbage collection finds a LEB which
15 * contains a lot of dirty space (obsolete nodes), and copies the non-obsolete
16 * nodes to the journal, at which point the garbage-collected LEB is free to be
17 * reused. For index LEBs, garbage collection marks the non-obsolete index nodes
19 * to be reused. Garbage collection will cause the number of dirty index nodes
33 * the UBIFS nodes GC deals with. Large nodes make GC waste more space. Indeed,
34 * if GC move data from LEB A to LEB B and nodes in LEB A are large, GC would
35 * have to waste large pieces of free space at the end of LEB B, because nodes
36 * from LEB A would not fit. And the worst situation is when all nodes ar
[all...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Dgc.c14 * nodes) or not. For non-index LEBs, garbage collection finds a LEB which
15 * contains a lot of dirty space (obsolete nodes), and copies the non-obsolete
16 * nodes to the journal, at which point the garbage-collected LEB is free to be
17 * reused. For index LEBs, garbage collection marks the non-obsolete index nodes
19 * to be reused. Garbage collection will cause the number of dirty index nodes
33 * the UBIFS nodes GC deals with. Large nodes make GC waste more space. Indeed,
34 * if GC move data from LEB A to LEB B and nodes in LEB A are large, GC would
35 * have to waste large pieces of free space at the end of LEB B, because nodes
36 * from LEB A would not fit. And the worst situation is when all nodes ar
[all...]
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbtree.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
367 * flush, and writes appending to leaf nodes aren't blocking anything so in do_btree_node_write()
668 * It's _really_ critical that we don't free too many btree nodes - we in bch_mca_scan()
883 * We can only have one thread cannibalizing other cached btree nodes at a time,
911 * the list. Check if there's any freed nodes there: in mca_alloc()
1210 * ptr_invalid() can't return true for the keys that mark btree nodes as in __bch_btree_mark_key()
1289 gc->nodes++; in btree_gc_mark_node()
1338 unsigned int i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1352 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes] in btree_gc_coalesce()
[all...]

Completed in 20 milliseconds

1...<<11121314151617181920>>...37