Home
last modified time | relevance | path

Searched refs:nodes (Results 701 - 725 of 924) sorted by relevance

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

/third_party/googletest/googlemock/test/
H A Dgmock-matchers-misc_test.cc489 // The single int param is the # of nodes on each of the left and right sides.
494 size_t nodes = GetParam(); in TEST_P() local
495 MatchMatrix graph(nodes, nodes); in TEST_P()
570 int nodes = GetParam().first; in TEST_P() local
572 MatchMatrix graph(static_cast<size_t>(nodes), static_cast<size_t>(nodes)); in TEST_P()
591 // Test argument is a std::pair<int, int> representing (nodes, iters).
/third_party/node/deps/brotli/c/enc/
H A Dencode.c1278 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, block_size + 1); in BrotliCompressBufferQuality10() local
1281 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) goto oom; in BrotliCompressBufferQuality10()
1282 BrotliInitZopfliNodes(nodes, block_size + 1); in BrotliCompressBufferQuality10()
1287 nodes); in BrotliCompressBufferQuality10()
1309 BrotliZopfliCreateCommands(block_size, block_start, &nodes[0], dist_cache, in BrotliCompressBufferQuality10()
1314 BROTLI_FREE(m, nodes); in BrotliCompressBufferQuality10()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dencode.c1278 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, block_size + 1); in BrotliCompressBufferQuality10() local
1281 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) goto oom; in BrotliCompressBufferQuality10()
1282 BrotliInitZopfliNodes(nodes, block_size + 1); in BrotliCompressBufferQuality10()
1287 nodes); in BrotliCompressBufferQuality10()
1309 BrotliZopfliCreateCommands(block_size, block_start, &nodes[0], dist_cache, in BrotliCompressBufferQuality10()
1314 BROTLI_FREE(m, nodes); in BrotliCompressBufferQuality10()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dvolumes.c1615 l = path->nodes[0]; in find_free_dev_extent_start()
1743 leaf = path->nodes[0]; in btrfs_free_dev_extent()
1753 leaf = path->nodes[0]; in btrfs_free_dev_extent()
1801 leaf = path->nodes[0]; in btrfs_alloc_dev_extent()
1869 btrfs_item_key_to_cpu(path->nodes[0], &found_key, in find_next_devid()
1906 leaf = path->nodes[0]; in btrfs_add_dev_item()
2534 leaf = path->nodes[0]; in btrfs_finish_sprout()
2542 leaf = path->nodes[0]; in btrfs_finish_sprout()
2838 leaf = path->nodes[0]; in btrfs_update_device()
3192 leaf = path->nodes[ in btrfs_relocate_sys_chunks()
[all...]
H A Dblock-group.c548 leaf = path->nodes[0]; in load_extent_tree_free()
582 leaf = path->nodes[0]; in load_extent_tree_free()
1559 leaf = path->nodes[0]; in read_bg_from_eb()
1614 leaf = path->nodes[0]; in find_first_block_group()
1892 struct extent_buffer *leaf = path->nodes[0]; in read_block_group_item()
2037 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in btrfs_read_block_groups()
2366 leaf = path->nodes[0]; in update_block_group_item()
2766 * allocate new block groups as a result of COWing nodes of the root in btrfs_write_dirty_block_groups()
3209 * reserve to make sure we can COW nodes/leafs in the chunk tree or in btrfs_chunk_alloc()
3210 * add new nodes/leaf in btrfs_chunk_alloc()
[all...]
H A Dfile.c721 leaf = path->nodes[0]; in __btrfs_drop_extents()
730 leaf = path->nodes[0]; in __btrfs_drop_extents()
741 leaf = path->nodes[0]; in __btrfs_drop_extents()
826 leaf = path->nodes[0]; in __btrfs_drop_extents()
980 leaf = path->nodes[0]; in __btrfs_drop_extents()
1109 leaf = path->nodes[0]; in btrfs_mark_extent_written()
1207 leaf = path->nodes[0]; in btrfs_mark_extent_written()
2374 leaf = path->nodes[0]; in fill_holes()
2546 leaf = path->nodes[0]; in btrfs_insert_replace_extent()
H A Dioctl.c1129 leaf = path->nodes[0]; in find_new_extents()
2135 leaf = path->nodes[0]; in copy_to_sk()
2439 l = path->nodes[0]; in btrfs_search_path_in_tree()
2530 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2557 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2615 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2800 btrfs_header_nritems(path->nodes[0])) { in btrfs_ioctl_get_subvol_info()
2810 leaf = path->nodes[0]; in btrfs_ioctl_get_subvol_info()
2886 btrfs_header_nritems(path->nodes[0])) { in btrfs_ioctl_get_subvol_rootref()
2896 leaf = path->nodes[ in btrfs_ioctl_get_subvol_rootref()
[all...]
H A Dbackref.h112 return iter->path->nodes[0]; in btrfs_backref_get_eb()
215 * Represent an edge connecting upper and lower backref nodes.
224 * linking list[UPPER] to its upper level nodes.
228 /* Two related nodes */
233 /* Red black tree of all backref nodes in the cache */
235 /* For passing backref nodes to btrfs_reloc_cow_block */
242 /* List of backref nodes with no child node */
257 /* List of useless backref nodes during backref cache build */
/kernel/linux/linux-6.6/fs/btrfs/
H A Dvolumes.c1635 l = path->nodes[0]; in find_free_dev_extent()
1756 leaf = path->nodes[0]; in btrfs_free_dev_extent()
1766 leaf = path->nodes[0]; in btrfs_free_dev_extent()
1835 btrfs_item_key_to_cpu(path->nodes[0], &found_key, in find_next_devid()
1874 leaf = path->nodes[0]; in btrfs_add_dev_item()
2566 leaf = path->nodes[0]; in btrfs_finish_sprout()
2574 leaf = path->nodes[0]; in btrfs_finish_sprout()
2886 leaf = path->nodes[0]; in btrfs_update_device()
3366 leaf = path->nodes[0]; in btrfs_relocate_sys_chunks()
3473 leaf = path->nodes[ in insert_balance_item()
[all...]
H A Dbackref.h287 return iter->path->nodes[0]; in btrfs_backref_get_eb()
390 * Represent an edge connecting upper and lower backref nodes.
399 * linking list[UPPER] to its upper level nodes.
403 /* Two related nodes */
408 /* Red black tree of all backref nodes in the cache */
410 /* For passing backref nodes to btrfs_reloc_cow_block */
417 /* List of backref nodes with no child node */
432 /* List of useless backref nodes during backref cache build */
/third_party/node/deps/v8/src/regexp/
H A Dregexp-ast.h210 explicit RegExpAlternative(ZoneList<RegExpTree*>* nodes);
219 ZoneList<RegExpTree*>* nodes() const { return nodes_; } in nodes() function in v8::internal::final
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dnir.c124 return block->comp->vector_ssa[i].nodes[channel]; in gpir_node_find()
244 block->comp->vector_ssa[index].nodes[i] = node; in gpir_create_vector_load()
/third_party/node/deps/v8/src/wasm/
H A Dgraph-builder-interface.cc834 NodeVector nodes(inputs.size()); in SimdLaneOp()
835 GetNodes(nodes.begin(), inputs); in SimdLaneOp()
836 result->node = builder_->SimdLaneOp(opcode, imm.lane, nodes.begin()); in SimdLaneOp()
920 // and IfFailure nodes. in Delegate()
1344 // LoopExitEffect, and LoopExit nodes whenever a control resp. effect resp.
1347 // - At some nodes which connect to the graph's end. We do not always need to
1348 // emit loop exits for such nodes, since the wasm loop analysis algorithm
1350 // However, we need to emit them anyway for nodes that may be rewired to
1351 // different nodes during inlining. These are Return and TailCall nodes
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/gt/
H A Dintel_execlists_submission.c188 * engine, sorted by priority. Here we preallocate the nodes we need
194 } nodes[I915_NUM_ENGINES]; member
1032 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in first_virtual_engine()
1448 rb = &ve->nodes[engine->id].rb; in execlists_dequeue()
3205 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_reset_cancel()
3640 struct rb_node *node = &ve->nodes[sibling->id].rb; in rcu_virtual_context_destroy()
3830 struct ve_node * const node = &ve->nodes[sibling->id]; in virtual_submission_tasklet()
4026 GEM_BUG_ON(RB_EMPTY_NODE(&ve->nodes[sibling->id].rb)); in execlists_create_virtual()
4027 RB_CLEAR_NODE(&ve->nodes[sibling->id].rb); in execlists_create_virtual()
4142 rb_entry(rb, typeof(*ve), nodes[engin in intel_execlists_show_requests()
[all...]
/foundation/graphic/graphic_3d/lume/Lume_3D/src/gltf/
H A Dgltf2_importer.cpp1802 // Look up node index nodes array. in RecursivelyCreateEntities()
1803 if (size_t const nodeIndex = FindIndex(data.nodes, &node); nodeIndex != GLTF2::GLTF_INVALID_INDEX) { in RecursivelyCreateEntities()
1831 if (const size_t parentIndex = FindIndex(data.nodes, node.parent); parentIndex != GLTF2::GLTF_INVALID_INDEX) { in CreateNode()
1943 size_t const nodeIndex = FindIndex(data.nodes, &node); in RecursivelyCreateComponents()
2009 size_t const jointNodeIndex = FindIndex(data.nodes, jointNode); in AddSkinJointsComponents()
2021 for (auto const& node : data.nodes) { in CreateSkinComponents()
2028 size_t const nodeIndex = FindIndex(data.nodes, node.get()); in CreateSkinComponents()
2037 size_t const skeletonIndex = FindIndex(data.nodes, node->skin->skeleton); in CreateSkinComponents()
2049 size_t const jointNodeIndex = FindIndex(data.nodes, jointNode); in CreateSkinComponents()
2061 for (auto const& node : data.nodes) { in CreateMorphComponents()
[all...]
/third_party/mesa3d/src/imgui/
H A Dimstb_truetype.h689 void *nodes; member
3757 static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes)
3764 STBTT__NOTUSED(nodes);
3801 stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context);
3803 if (context == NULL || nodes == NULL) {
3805 if (nodes != NULL) STBTT_free(nodes , alloc_context);
3814 spc->nodes = nodes;
[all...]
/third_party/skia/third_party/externals/imgui/
H A Dimstb_truetype.h689 void *nodes; member
3757 static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes)
3764 STBTT__NOTUSED(nodes);
3801 stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context);
3803 if (context == NULL || nodes == NULL) {
3805 if (nodes != NULL) STBTT_free(nodes , alloc_context);
3814 spc->nodes = nodes;
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.h120 struct psp_xgmi_node_info nodes[AMDGPU_XGMI_MAX_CONNECTED_NODES]; member
/kernel/linux/linux-5.10/drivers/interconnect/qcom/
H A Dbcm-voter.c78 node = bcm->nodes[i]; in bcm_aggregate()
226 * qcom_icc_bcm_voter_add - queues up the bcm nodes that require updates
253 * through multiple commit requests and bcm nodes are removed only when the
/kernel/linux/linux-5.10/fs/jffs2/
H A Dbuild.c95 - Scan physical nodes. Build map of inodes/dirents. Allocate inocaches as we go
109 lists of physical nodes */ in jffs2_build_filesystem()
251 raw = ic->nodes; in jffs2_build_remove_unlinked_inode()
307 The erase code will do that, when all the nodes are completely gone. in jffs2_build_remove_unlinked_inode()
322 of the medium to be available, for overhead caused by nodes being in jffs2_calc_trigger_levels()
335 /* When do we allow garbage collection to merge nodes to make in jffs2_calc_trigger_levels()
345 can't mark nodes obsolete on the medium, the old dirty nodes cause in jffs2_calc_trigger_levels()
/kernel/linux/linux-6.6/drivers/memory/tegra/
H A Dtegra186-emc.c245 list_for_each_entry(node, &provider->nodes, node_list) { in tegra_emc_of_icc_xlate()
/kernel/linux/linux-6.6/fs/jffs2/
H A Dbuild.c95 - Scan physical nodes. Build map of inodes/dirents. Allocate inocaches as we go
109 lists of physical nodes */ in jffs2_build_filesystem()
251 raw = ic->nodes; in jffs2_build_remove_unlinked_inode()
307 The erase code will do that, when all the nodes are completely gone. in jffs2_build_remove_unlinked_inode()
322 of the medium to be available, for overhead caused by nodes being in jffs2_calc_trigger_levels()
335 /* When do we allow garbage collection to merge nodes to make in jffs2_calc_trigger_levels()
345 can't mark nodes obsolete on the medium, the old dirty nodes cause in jffs2_calc_trigger_levels()
/third_party/alsa-utils/topology/nhlt/intel/ssp/
H A Dssp-internal.h56 struct ssp_aux_config_node nodes[SSP_MAX_DAIS]; member
/third_party/icu/icu4c/source/i18n/
H A Dcollationbuilder.h64 * node=nodes[index].
91 * Skips over nodes of weaker strength to maintain collation order
108 * Skips weaker nodes and tailored nodes if the current node is stronger
156 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
158 * The nodes array can then be used only as a source of tailored CEs.
162 * Counts the tailored nodes of the given strength up to the next node
226 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
229 * Node bit 6 is set on a primary node if there are nodes
234 * Node bit 5 is set on a primary or secondary node if there are nodes
405 UVector64 nodes; global() member in CollationBuilder
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h176 * registerNode() and registerFinalValue() take ownership of their input nodes,
177 * and only return owned nodes.
190 // Hash set of nodes, maps from nodes to integer 1.
192 UHashtable *nodes; member in StringTrieBuilder
213 * Branch nodes in this trie data structure are not symmetric.
214 * Most branch edges "jump" to other nodes but the rightmost branch edges
222 * offset field which gets positive values when nodes are written.
229 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
232 * @param edgeNumber The first edge number for this node and its sub-nodes
[all...]

Completed in 61 milliseconds

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