Home
last modified time | relevance | path

Searched full:split (Results 1 – 25 of 1621) sorted by relevance

12345678910>>...65

/linux/drivers/media/dvb-core/
H A Ddvb_ringbuffer.c136 size_t split; in dvb_ringbuffer_read_user() local
138 split = (rbuf->pread + len > rbuf->size) ? rbuf->size - rbuf->pread : 0; in dvb_ringbuffer_read_user()
139 if (split > 0) { in dvb_ringbuffer_read_user()
140 if (copy_to_user(buf, rbuf->data+rbuf->pread, split)) in dvb_ringbuffer_read_user()
142 buf += split; in dvb_ringbuffer_read_user()
143 todo -= split; in dvb_ringbuffer_read_user()
162 size_t split; in dvb_ringbuffer_read() local
164 split = (rbuf->pread + len > rbuf->size) ? rbuf->size - rbuf->pread : 0; in dvb_ringbuffer_read()
165 if (split > 0) { in dvb_ringbuffer_read()
166 memcpy(buf, rbuf->data+rbuf->pread, split); in dvb_ringbuffer_read()
[all …]
/linux/tools/testing/selftests/drivers/net/hw/
H A Ddevlink_port_split.py12 # Test port split configuration using devlink-port lanes attribute.
15 # First, check that all the ports with 1 lane fail to split.
16 # Second, check that all the ports with more than 1 lane can be split
17 # to all valid configurations (e.g., split to 2, split to 4 etc.)
95 Get the $port split ability.
96 Return: split ability, true or false.
107 def split(k, port, should_fail=False): function
109 Split $port into $k ports.
110 If should_fail == True, the split should fail. Otherwise, should pass.
112 If the $port wasn't split, the array will be empty.
[all …]
/linux/Documentation/devicetree/bindings/display/mediatek/
H A Dmediatek,split.yaml4 $id: http://devicetree.org/schemas/display/mediatek/mediatek,split.yaml#
7 title: Mediatek display split
14 Mediatek display split, namely SPLIT, is used to split stream to two
16 SPLIT device node must be siblings to the central MMSYS_CONFIG node.
25 - mediatek,mt8173-disp-split
26 - mediatek,mt8195-mdp3-split
28 - const: mediatek,mt6795-disp-split
29 - const: mediatek,mt8173-disp-split
60 - description: SPLIT Clock
76 const: mediatek,mt8195-mdp3-split
[all …]
/linux/lib/
H A Dsg_split.c81 struct sg_splitter *split; in sg_split_phys() local
83 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_phys()
84 in_sg = split->in_sg0; in sg_split_phys()
85 out_sg = split->out_sg; in sg_split_phys()
86 for (j = 0; j < split->nents; j++, out_sg++) { in sg_split_phys()
89 out_sg->offset += split->skip_sg0; in sg_split_phys()
90 out_sg->length -= split->skip_sg0; in sg_split_phys()
96 out_sg[-1].length = split->length_last_sg; in sg_split_phys()
105 struct sg_splitter *split; in sg_split_mapped() local
107 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_mapped()
[all …]
/linux/tools/testing/selftests/drivers/net/
H A Dhds.py18 if 'tcp-data-split' not in rings:
19 raise KsftSkipEx('tcp-data-split not supported by device')
20 return rings['tcp-data-split']
67 if cur.get('tcp-data-split') != rings.get('tcp-data-split'):
70 arg['tcp-data-split'] = "unknown"
73 if cur['tcp-data-split'] == rings['tcp-data-split']:
74 del arg['tcp-data-split']
77 arg['tcp-data-split']
[all...]
/linux/arch/powerpc/platforms/powernv/
H A Dsubcore.c30 * Split/unsplit procedure:
32 * A core can be in one of three states, unsplit, 2-way split, and 4-way split.
39 * 2-way split | 2
40 * 4-way split | 4
42 * The core is split along thread boundaries, the mapping between subcores and
52 * 2-way split:
59 * 4-way split:
70 * It is not possible to transition between either of the split states, the
74 * | | <----> | 2-way split |
78 * | | <----> | 4-way split |
[all …]
/linux/tools/testing/selftests/tc-testing/tc-tests/qdiscs/
H A Dcake.json17 …+ bandwidth unlimited diffserv3 triple-isolate nonat nowash no-ack-filter split-gso rtt 100ms raw …
38 …0-9]+ bandwidth 1Kbit diffserv3 triple-isolate nonat nowash no-ack-filter split-gso rtt 100ms raw …
59 …ited autorate-ingress diffserv3 triple-isolate nonat nowash no-ack-filter split-gso rtt 100ms raw …
80 …+ bandwidth unlimited diffserv3 triple-isolate nonat nowash no-ack-filter split-gso rtt 200us raw …
101 … bandwidth unlimited besteffort triple-isolate nonat nowash no-ack-filter split-gso rtt 100ms raw …
122 …+ bandwidth unlimited diffserv8 triple-isolate nonat nowash no-ack-filter split-gso rtt 100ms raw …
143 …+ bandwidth unlimited diffserv4 triple-isolate nonat nowash no-ack-filter split-gso rtt 100ms raw …
164 …[0-9]+ bandwidth unlimited diffserv3 flowblind nonat nowash no-ack-filter split-gso rtt 100ms raw …
185 …cnt [0-9]+ bandwidth unlimited diffserv3 dsthost nat nowash no-ack-filter split-gso rtt 100ms raw …
206 …efcnt [0-9]+ bandwidth unlimited diffserv3 hosts nonat wash no-ack-filter split-gso rtt 100ms raw …
[all …]
/linux/arch/x86/kernel/cpu/
H A Dcacheinfo.c53 } split; member
62 } split; member
69 } split; member
207 eax->split.is_self_initializing = 1; in legacy_amd_cpuid4()
208 eax->split.type = types[index]; in legacy_amd_cpuid4()
209 eax->split.level = levels[index]; in legacy_amd_cpuid4()
210 eax->split.num_threads_sharing = 0; in legacy_amd_cpuid4()
211 eax->split.num_cores_on_die = topology_num_cores_per_package(); in legacy_amd_cpuid4()
214 eax->split.is_fully_associative = 1; in legacy_amd_cpuid4()
216 ebx->split.coherency_line_size = line_size - 1; in legacy_amd_cpuid4()
[all …]
/linux/fs/btrfs/tests/
H A Dextent-buffer-tests.c76 * space in this leaf to split the item without having to split the in test_btrfs_split_item()
81 test_err("split item failed %d", ret); in test_btrfs_split_item()
98 test_err("invalid len in the first split"); in test_btrfs_split_item()
107 "data in the buffer doesn't match what it should in the first split have='%.*s' want '%s'", in test_btrfs_split_item()
122 test_err("invalid len in the second split"); in test_btrfs_split_item()
131 "data in the buffer doesn't match what it should in the second split"); in test_btrfs_split_item()
140 test_err("second split item failed %d", ret); in test_btrfs_split_item()
153 test_err("invalid len in the first split"); in test_btrfs_split_item()
162 "data in the buffer doesn't match what it should in the third split"); in test_btrfs_split_item()
176 test_err("invalid len in the second split"); in test_btrfs_split_item()
[all …]
/linux/tools/verification/rvgen/rvgen/
H A Dautomata.py55 line = dot_lines[cursor].split()
65 while self.__dot_lines[cursor].split()[0] != "{node":
71 while self.__dot_lines[cursor].split()[0] != "{node":
73 while self.__dot_lines[cursor].split()[0] == "{node":
88 while self.__dot_lines[cursor].split()[0] == "{node":
89 line = self.__dot_lines[cursor].split()
128 if self.__dot_lines[cursor].split()[1] == "->":
129 line = self.__dot_lines[cursor].split()
134 # so split them.
137 for i in event.split():
[all …]
/linux/fs/btrfs/
H A Dextent_map.c795 * are split.
802 struct extent_map *split; in btrfs_drop_extent_map_range() local
826 * because we need to split those two extent maps at the boundaries. in btrfs_drop_extent_map_range()
828 split = btrfs_alloc_extent_map(); in btrfs_drop_extent_map_range()
859 * In case we split the extent map, we want to preserve the in btrfs_drop_extent_map_range()
868 * split it, we can remove it directly. in btrfs_drop_extent_map_range()
876 if (!split) { in btrfs_drop_extent_map_range()
877 split = split2; in btrfs_drop_extent_map_range()
879 if (!split) in btrfs_drop_extent_map_range()
882 split->start = em->start; in btrfs_drop_extent_map_range()
[all …]
/linux/tools/testing/selftests/vDSO/
H A Dvdso_test_chacha.c99 for (unsigned int split = 0; split < BLOCKS; ++split) { in main() local
102 if (split) in main()
103 __arch_chacha20_blocks_nostack(output2, key, counter2, split); in main()
104 __arch_chacha20_blocks_nostack(output2 + split * BLOCK_SIZE, key, counter2, BLOCKS - split); in main()
106 ksft_exit_fail_msg("Main loop outputs do not match on trial %u, split %u\n", trial, split); in main()
108 ksft_exit_fail_msg("Main loop counters do not match on trial %u, split %u\n", trial, split); in main()
/linux/tools/testing/selftests/mm/
H A Dsplit_huge_page_test.c138 * NOTE: the function is used to check folio orders after a split is performed,
139 * so it assumes [vaddr_start, len) fully maps to after-split folios within that
318 ksft_exit_fail_msg("No RssAnon is allocated before split\n"); in verify_rss_anon_split_huge_page_all_zeroes()
320 /* split all THPs */ in verify_rss_anon_split_huge_page_all_zeroes()
329 ksft_exit_fail_msg("Still AnonHugePages not split\n"); in verify_rss_anon_split_huge_page_all_zeroes()
345 ksft_test_result_pass("Split zero filled huge pages successful\n"); in split_pmd_zero_pages()
367 /* split all THPs */ in split_pmd_thp_to_order()
381 ksft_exit_fail_msg("Unexpected THP split\n"); in split_pmd_thp_to_order()
384 ksft_exit_fail_msg("Still AnonHugePages not split\n"); in split_pmd_thp_to_order()
386 ksft_test_result_pass("Split huge pages to order %d successful\n", order); in split_pmd_thp_to_order()
[all …]
/linux/drivers/net/ethernet/intel/ice/devlink/
H A Dport.c46 * ice_devlink_port_options_print - Print available port split options
47 * @pf: the PF to print split port options
49 * Prints a table with available port split options and max port speeds
82 dev_dbg(dev, "Available port split options and max port speeds (Gbps):\n"); in ice_devlink_port_options_print()
83 dev_dbg(dev, "Status Split Quad 0 Quad 1\n"); in ice_devlink_port_options_print()
118 * @pf: the PF to print split port options
136 NL_SET_ERR_MSG_MOD(extack, "Port split request failed"); in ice_devlink_aq_set_port_option()
152 NL_SET_ERR_MSG_MOD(extack, "Port split request failed to save data"); in ice_devlink_aq_set_port_option()
159 NL_SET_ERR_MSG_MOD(extack, "Reboot required to finish port split"); in ice_devlink_aq_set_port_option()
167 * @count: number of ports to split to
[all …]
/linux/fs/jfs/
H A Djfs_dtree.c32 * it is extended rather than split (its size is doubled),
33 * until its length becoms 4 KBytes, from then the extent is split
63 * (e.g., if split occurs <abc> and <aBd>, <ABD> trather than <aB>
64 * should be made the router key for the split)
101 /* dtree split parameter */
141 struct dtsplit * split, struct btstack * btstack);
143 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split,
147 struct dtsplit * split, struct btstack * btstack);
150 struct dtsplit * split, struct metapage ** rmpp);
603 /* init level count for max pages to split */ in dtSearch()
[all …]
/linux/mm/
H A Dhuge_memory.c634 DEFINE_MTHP_STAT_ATTR(split, MTHP_STAT_SPLIT);
1734 * under splitting since we don't split the page itself, only pmd to in copy_huge_pmd()
1753 /* Page maybe pinned: split and retry the fault on PTEs. */ in copy_huge_pmd()
1814 * folio_try_dup_anon_rmap_*() and split if duplicating fails. in copy_huge_pud()
2132 * If user want to discard part-pages of THP, split it so MADV_FREE in madvise_free_huge_pmd()
2255 * With split pmd lock we also need to move preallocated in pmd_move_must_withdraw()
2911 * the whole access to the hugepage during the split (which in __split_huge_pmd_locked()
2927 * remain set at all times on the pmd until the split is in __split_huge_pmd_locked()
2948 * Without "freeze", we'll simply split the PMD, propagating the in __split_huge_pmd_locked()
2957 * In case we cannot clear PageAnonExclusive(), split the PMD in __split_huge_pmd_locked()
[all …]
/linux/lib/zstd/compress/
H A Dzstd_ldm.c90 * Registers in the splits array all the split points found in the first
311 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_fillHashTable() local
312 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_fillHashTable()
316 entry.offset = (U32)(split - base); in ZSTD_ldm_fillHashTable()
391 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_generateSequences_internal() local
392 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_generateSequences_internal()
395 candidates[n].split = split; in ZSTD_ldm_generateSequences_internal()
406 BYTE const* const split = candidates[n].split; in ZSTD_ldm_generateSequences_internal() local
414 newEntry.offset = (U32)(split - base); in ZSTD_ldm_generateSequences_internal()
417 /* If a split point would generate a sequence overlapping with in ZSTD_ldm_generateSequences_internal()
[all …]
/linux/drivers/gpu/drm/arm/display/komeda/
H A Dkomeda_format_caps.c69 /* SPLIT + SPARSE + YTR RGB only */
70 /* split mode is only allowed for sparse mode */
76 /* TILED + SC + (SPLIT+SPARSE | SPARSE) + (YTR) */
84 /* SPLIT + SPARSE + (YTR) */
85 /* split mode is only allowed for sparse mode */
87 /* TILED + SC + (SPLIT+SPARSE | SPARSE) + YTR */
/linux/tools/perf/pmu-events/arch/x86/goldmont/
H A Dmemory.json12 "BriefDescription": "Load uops that split a page (Precise event capable)",
17 …"PublicDescription": "Counts when a memory load of a uop spans a page boundary (a split) is retire…
22 "BriefDescription": "Store uops that split a page (Precise event capable)",
27 …"PublicDescription": "Counts when a memory store of a uop spans a page boundary (a split) is retir…
/linux/tools/perf/pmu-events/arch/x86/goldmontplus/
H A Dmemory.json12 "BriefDescription": "Load uops that split a page (Precise event capable)",
17 …"PublicDescription": "Counts when a memory load of a uop spans a page boundary (a split) is retire…
22 "BriefDescription": "Store uops that split a page (Precise event capable)",
27 …"PublicDescription": "Counts when a memory store of a uop spans a page boundary (a split) is retir…
/linux/drivers/crypto/caam/
H A Dkey_gen.h10 * split_key_len - Compute MDHA split key length for a given algorithm
14 * Return: MDHA split key length
28 * split_key_pad_len - Compute MDHA split key pad length for a given algorithm
32 * Return: MDHA split key pad length
/linux/tools/testing/selftests/bpf/prog_tests/
H A Dbtf_distill.c8 /* Fabricate base, split BTF with references to base types needed; then create
9 * split BTF with distilled base BTF and ensure expectations are met:
10 * - only referenced base types from split BTF are present
12 * are represented in full in split BTF
189 /* split BTF; these types should match split BTF above from 17-28, with in test_distilled_base()
206 /* split BTF types added from original base BTF below */ in test_distilled_base()
272 * process to split BTF. in test_distilled_base()
497 /* create split reference BTF from vmlinux + split BTF with a few type references;
498 * ensure the resultant split reference BTF is as expected, containing only types
499 * needed to disambiguate references from split BTF.
[all …]
/linux/drivers/media/v4l2-core/
H A Dv4l2-vp9.c132 { 158, 97, 94 }, /* a/l both not split */
133 { 93, 24, 99 }, /* a split, l not split */
134 { 85, 119, 44 }, /* l split, a not split */
135 { 62, 59, 67 }, /* a/l both split */
137 { 149, 53, 53 }, /* a/l both not split */
138 { 94, 20, 48 }, /* a split, l not split */
139 { 83, 53, 24 }, /* l split, a not split */
140 { 52, 18, 18 }, /* a/l both split */
142 { 150, 40, 39 }, /* a/l both not split */
143 { 78, 12, 26 }, /* a split, l not split */
[all …]
/linux/Documentation/networking/devlink/
H A Dice.rst249 Port split
253 a predefined set of available port split options for the whole device.
255 A system reboot is required for port split to be applied.
257 The following command will select the port split option with 4 ports:
261 $ devlink port split pci/0000:16:00.0/0 count 4
264 each ``split`` and ``unsplit`` command. The first option is the default.
268 ice 0000:16:00.0: Available port split options and max port speeds (Gbps):
269 ice 0000:16:00.0: Status Split Quad 0 Quad 1
278 There could be multiple FW port options with the same port split count. When
279 the same port split count request is issued again, the next FW port option with
[all …]
/linux/include/linux/
H A Dhuge_mm.h83 * file is never split and the MAX_PAGECACHE_ORDER limit does not apply to
379 * try_folio_split - try to split a @folio at @page using non uniform split.
380 * @folio: folio to be split
381 * @page: split to order-0 at the given page
382 * @list: store the after-split folios
384 * Try to split a @folio at @page using non uniform split to order-0, if
385 * non uniform split is not supported, fall back to uniform split.
387 * Return: 0: split is successful, otherwise split failed.
412 * expects the same page that has been split to be locked when in split_huge_page()
415 * page to be split. in split_huge_page()

12345678910>>...65