Home
last modified time | relevance | path

Searched refs:nodes (Results 401 - 425 of 958) sorted by relevance

1...<<11121314151617181920>>...39

/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dloop_dependence.cpp71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
91 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
93 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
99 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
103 return nodes; in GetAllTopLevelRecurrences()
109 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
111 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
117 nodes.insert(nodes in GetAllTopLevelConstants()
124 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dloop_dependence.cpp69 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
89 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
91 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
97 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
101 return nodes; in GetAllTopLevelRecurrences()
107 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
109 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
115 nodes.insert(nodes in GetAllTopLevelConstants()
122 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.c866 topology_info_input->nodes[i].node_id = topology->nodes[i].node_id; in psp_xgmi_get_topology_info()
867 topology_info_input->nodes[i].num_hops = topology->nodes[i].num_hops; in psp_xgmi_get_topology_info()
868 topology_info_input->nodes[i].is_sharing_enabled = topology->nodes[i].is_sharing_enabled; in psp_xgmi_get_topology_info()
869 topology_info_input->nodes[i].sdma_engine = topology->nodes[i].sdma_engine; in psp_xgmi_get_topology_info()
881 topology->nodes[i].node_id = topology_info_output->nodes[ in psp_xgmi_get_topology_info()
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A Dkernel_feat.py40 from docutils import nodes, statemachine namespace
117 node = nodes.section()
H A Dkernel_abi.py42 from docutils import nodes, statemachine namespace
97 node = nodes.section()
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-internal.h67 struct dm_block *nodes[2]; member
80 struct dm_block *nodes[2]; member
/kernel/linux/linux-5.10/fs/btrfs/
H A Ddelayed-inode.h27 * Used for delayed nodes which is waiting to be dealt with by the
34 int nodes; /* for delayed nodes */ member
49 * Used to add the node into the prepare list, the nodes in this list
81 delayed_root->nodes = 0; in btrfs_init_delayed_root()
/kernel/linux/linux-5.10/include/linux/
H A Dinterconnect-provider.h31 * @num_nodes: number of nodes in this device
32 * @nodes: array of pointers to the nodes in this device
36 struct icc_node *nodes[]; member
47 * @nodes: internal list of the interconnect provider nodes
53 * @xlate: provider-specific callback for mapping nodes from phandle arguments
62 struct list_head nodes; member
82 * @num_links: number of links to other interconnect nodes
84 * @node_list: the list entry in the parent provider's "nodes" lis
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Ddelayed-inode.h28 * Used for delayed nodes which is waiting to be dealt with by the
35 int nodes; /* for delayed nodes */ member
50 * Used to add the node into the prepare list, the nodes in this list
106 delayed_root->nodes = 0; in btrfs_init_delayed_root()
/kernel/linux/linux-6.6/include/linux/
H A Dinterconnect-provider.h31 * @num_nodes: number of nodes in this device
32 * @nodes: array of pointers to the nodes in this device
36 struct icc_node *nodes[] __counted_by(num_nodes);
47 * @nodes: internal list of the interconnect provider nodes
53 * @xlate: provider-specific callback for mapping nodes from phandle arguments
62 struct list_head nodes; member
82 * @num_links: number of links to other interconnect nodes
84 * @node_list: the list entry in the parent provider's "nodes" lis
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-internal.h68 struct dm_block *nodes[2]; member
81 struct dm_block *nodes[2]; member
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.h43 /* NGTCP2_KSL_MAX_NBLK is the maximum number of nodes which a single
46 /* NGTCP2_KSL_MIN_NBLK is the minimum number of nodes which a single
90 /* n is the number of nodes this object contains in nodes. */
92 /* leaf is nonzero if this block contains leaf nodes. */
96 /* nodes is a buffer to contain NGTCP2_KSL_MAX_NBLK
101 uint8_t nodes[1]; member
123 * ngtcp2_ksl_it is a forward iterator to iterate nodes.
228 * ngtcp2_ksl_update_key replaces the key of nodes which has |old_key|
264 ((ngtcp2_ksl_node *)(void *)((BLK)->nodes
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.h44 /* NGHTTP3_KSL_MAX_NBLK is the maximum number of nodes which a single
47 /* NGHTTP3_KSL_MIN_NBLK is the minimum number of nodes which a single
92 /* n is the number of nodes this object contains in nodes. */
94 /* leaf is nonzero if this block contains leaf nodes. */
98 /* nodes is a buffer to contain NGHTTP3_KSL_MAX_NBLK
103 uint8_t nodes[1]; member
125 * nghttp3_ksl_it is a forward iterator to iterate nodes.
230 * nghttp3_ksl_update_key replaces the key of nodes which has |old_key|
266 ((nghttp3_ksl_node *)(void *)((BLK)->nodes
[all...]
/third_party/mesa3d/src/tool/pps/
H A Dpps_device.cc78 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR); in create_all()
104 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR); in create()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaBuilder.java62 /** Adds a new path between the given source and target (all intermediate nodes are new). */
74 * Adds a new path between the given source and target nodes, along with an epsilon edge from the
83 checkArgument(graph.nodes().contains(s), "missing source node"); in addEpsilon()
84 checkArgument(graph.nodes().contains(s), "missing target node"); in addEpsilon()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_graph_coloring.cpp96 // inputs' nodes of that instruction in BuildIG()
111 // Walk nodes and propagate properties in PrecolorIG()
122 // Walk nodes and propagate properties in PrecolorIG()
151 auto &nodes = ig->GetNodes(); in BuildBias() local
154 // nodes of same component) in BuildBias()
158 auto &node = nodes[index]; in BuildBias()
170 WalkNodes(std::make_pair(walked, biased), nodes, node, ig, affinityNodes); in BuildBias() local
174 void RegAllocGraphColoring::WalkNodes(IndexVectorPair &&vectors, NodeVector &nodes, ColorNode node, in WalkNodes() argument
187 // Walk N affine nodes in WalkNodes()
189 auto &tryNode = nodes[tryInde in WalkNodes()
[all...]
/arkcompiler/runtime_core/static_core/tests/tests-u-runner/runner/plugins/astchecker/
H A Dutil_astchecker.py236 nodes = []
239 nodes.append(root)
243 nodes.extend(self.find_nodes_by_start_location(child, line, col))
246 nodes.extend(self.find_nodes_by_start_location(item, line, col))
248 return nodes
/kernel/linux/linux-5.10/drivers/base/regmap/
H A Dregcache-rbtree.c140 int nodes = 0; in rbtree_show() local
159 nodes++; in rbtree_show()
163 if (nodes) in rbtree_show()
164 average = registers / nodes; in rbtree_show()
168 seq_printf(s, "%d nodes, %d registers, average %d registers, used %zu bytes\n", in rbtree_show()
169 nodes, registers, average, mem_size); in rbtree_show()
/kernel/linux/linux-6.6/drivers/base/regmap/
H A Dregcache-rbtree.c140 int nodes = 0; in rbtree_show() local
159 nodes++; in rbtree_show()
163 if (nodes) in rbtree_show()
164 average = registers / nodes; in rbtree_show()
168 seq_printf(s, "%d nodes, %d registers, average %d registers, used %zu bytes\n", in rbtree_show()
169 nodes, registers, average, mem_size); in rbtree_show()
/kernel/linux/linux-6.6/mm/
H A Dworkingset.c658 * create excessive amounts of shadow nodes. To keep a lid on this,
659 * track shadow nodes and reclaim them when they grow way past the
670 * Track non-empty nodes that contain only shadow entries; in workingset_update_node()
673 * Avoid acquiring the list_lru lock when the nodes are in workingset_update_node()
697 unsigned long nodes; in count_shadow_nodes() local
700 nodes = list_lru_shrink_count(&shadow_nodes, sc); in count_shadow_nodes()
701 if (!nodes) in count_shadow_nodes()
705 * Approximate a reasonable limit for the nodes in count_shadow_nodes()
748 if (nodes <= max_nodes) in count_shadow_nodes()
750 return nodes in count_shadow_nodes()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dagm.c921 static void get_tree_codes(uint32_t *codes, Node *nodes, int idx, uint32_t pfx, int bitpos) in get_tree_codes() argument
926 get_tree_codes(codes, nodes, nodes[idx].child[0], pfx + (0 << bitpos), bitpos + 1); in get_tree_codes()
927 get_tree_codes(codes, nodes, nodes[idx].child[1], pfx + (1U << bitpos), bitpos + 1); in get_tree_codes()
936 Node nodes[512]; in make_new_tree() local
950 nodes[i].child[0] = -1; in make_new_tree()
951 nodes[i].child[1] = -1; in make_new_tree()
974 if (nodes[p].child[0] == -1) { in make_new_tree()
975 nodes[ in make_new_tree()
[all...]
H A Dqdm2.c1091 QDM2SubPNode *nodes[4]; in process_synthesis_subpackets() local
1093 nodes[0] = qdm2_search_subpacket_type_in_list(list, 9); in process_synthesis_subpackets()
1094 if (nodes[0]) in process_synthesis_subpackets()
1095 process_subpacket_9(q, nodes[0]); in process_synthesis_subpackets()
1097 nodes[1] = qdm2_search_subpacket_type_in_list(list, 10); in process_synthesis_subpackets()
1098 if (nodes[1]) in process_synthesis_subpackets()
1099 process_subpacket_10(q, nodes[1]); in process_synthesis_subpackets()
1103 nodes[2] = qdm2_search_subpacket_type_in_list(list, 11); in process_synthesis_subpackets()
1104 if (nodes[0] && nodes[ in process_synthesis_subpackets()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_xgmi.c256 * created which contains the hive ID and the list of nodes.
338 sprintf(buf + 3 * i, "%02x ", top->nodes[i].num_hops); in amdgpu_xgmi_show_num_hops()
353 sprintf(buf + 3 * i, "%02x ", top->nodes[i].num_links); in amdgpu_xgmi_show_num_links()
672 if (top->nodes[i].node_id == peer_adev->gmc.xgmi.node_id) in amdgpu_xgmi_get_hops_count()
673 return top->nodes[i].num_hops & num_hops_mask; in amdgpu_xgmi_get_hops_count()
684 if (top->nodes[i].node_id == peer_adev->gmc.xgmi.node_id) in amdgpu_xgmi_get_num_links()
685 return top->nodes[i].num_links; in amdgpu_xgmi_get_num_links()
768 top_info->nodes[count++].node_id = entry->node_id; in amdgpu_xgmi_add_device()
780 top_info->nodes[count - 1].node_id = in amdgpu_xgmi_add_device()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_from_ssa.c112 * nodes in a given set interfere. Merging two sets or checking for
114 * two lists of nodes.
125 struct exec_list nodes; member
138 foreach_list_typed(merge_node, node, node, &set->nodes) {
161 exec_list_make_empty(&set->nodes); in get_merge_node()
169 exec_list_push_head(&set->nodes, &node->node); in get_merge_node()
197 struct exec_node *an = exec_list_get_head(&a->nodes); in merge_merge_sets()
198 struct exec_node *bn = exec_list_get_head(&b->nodes); in merge_merge_sets()
231 /* List of all the nodes which dominate the current node, in dominance in merge_sets_interfere()
237 struct exec_node *an = exec_list_get_head(&a->nodes); in merge_sets_interfere()
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.cpp67 TIntermRebuild::BaseResult::BaseResult(std::vector<TIntermNode *> &&nodes) in BaseResult() argument
71 mMulti(std::move(nodes)) in BaseResult()
82 TIntermRebuild::BaseResult TIntermRebuild::BaseResult::Multi(std::vector<TIntermNode *> &&nodes) in Multi() argument
84 auto it = std::remove(nodes.begin(), nodes.end(), nullptr); in Multi()
85 nodes.erase(it, nodes.end()); in Multi()
86 return std::move(nodes); in Multi()

Completed in 22 milliseconds

1...<<11121314151617181920>>...39