Home
last modified time | relevance | path

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

12345678910>>...64

/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/fs/jfs/
H A Djfs_xtree.c96 uint split; member
109 struct xtsplit * split, struct btstack * btstack);
111 static int xtSplitPage(tid_t tid, struct inode *ip, struct xtsplit * split,
115 struct xtsplit * split, struct metapage ** rmpp);
227 int nsplit = 0; /* number of pages to split */ in xtSearch()
324 /* compute number of pages to split */ in xtSearch()
371 /* compute number of pages to split */ in xtSearch()
429 /* compute number of pages to split */ in xtSearch()
471 /* update number of pages to split */ in xtSearch()
524 struct xtsplit split; /* split information */ in xtInsert() local
[all …]
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/tools/testing/selftests/drivers/net/
H A Dhds.py17 if 'tcp-data-split' not in rings:
18 raise KsftSkipEx('tcp-data-split not supported by device')
19 return rings['tcp-data-split']
63 netnl.rings_set({'header': {'dev-index': cfg.ifindex}, 'tcp-data-split': 'enabled'})
73 if 'tcp-data-split' not in rings:
74 raise KsftSkipEx('tcp-data-split not supported by device')
76 ksft_eq('enabled', rings['tcp-data-split'])
80 netnl.rings_set({'header': {'dev-index': cfg.ifindex}, 'tcp-data-split': 'disabled'})
90 if 'tcp-data-split' not in rings:
91 raise KsftSkipEx('tcp-data-split not supported by device')
[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/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/dot2/
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.c796 * are split.
803 struct extent_map *split; in btrfs_drop_extent_map_range() local
827 * because we need to split those two extent maps at the boundaries. in btrfs_drop_extent_map_range()
829 split = alloc_extent_map(); in btrfs_drop_extent_map_range()
860 * In case we split the extent map, we want to preserve the in btrfs_drop_extent_map_range()
869 * split it, we can remove it directly. in btrfs_drop_extent_map_range()
877 if (!split) { in btrfs_drop_extent_map_range()
878 split = split2; in btrfs_drop_extent_map_range()
880 if (!split) in btrfs_drop_extent_map_range()
883 split->start = em->start; in btrfs_drop_extent_map_range()
[all …]
/linux/drivers/virtio/
H A Dvirtio_ring.c189 * for split ring, it just contains last used index
200 /* Available for split ring */
201 struct vring_virtqueue_split split; member
441 * Split ring specific functions - *_split().
567 WARN_ON_ONCE(total_sg > vq->split.vring.num && !vq->indirect); in virtqueue_add_split()
579 desc = vq->split.vring.desc; in virtqueue_add_split()
580 extra = vq->split.desc_extra; in virtqueue_add_split()
637 vq->split.desc_extra[prev & (vq->split.vring.num - 1)].flags &= in virtqueue_add_split()
648 virtqueue_add_desc_split(_vq, vq->split.vring.desc, in virtqueue_add_split()
649 vq->split.desc_extra, in virtqueue_add_split()
[all …]
/linux/tools/testing/selftests/vDSO/
H A Dvdso_test_chacha.c98 for (unsigned int split = 0; split < BLOCKS; ++split) { in main() local
101 if (split) in main()
102 __arch_chacha20_blocks_nostack(output2, key, counter2, split); in main()
103 __arch_chacha20_blocks_nostack(output2 + split * BLOCK_SIZE, key, counter2, BLOCKS - split); in main()
105 ksft_exit_fail_msg("Main loop outputs do not match on trial %u, split %u\n", trial, split); in main()
107 ksft_exit_fail_msg("Main loop counters do not match on trial %u, split %u\n", trial, split); in main()
/linux/fs/iomap/
H A Dioend.c148 * Split up to the first @max_len bytes from @ioend if the ioend covers more
151 * If @is_append is set, the split will be based on the hardware limits for
166 struct bio *split; in iomap_split_ioend() local
185 /* ensure the split ioend is still block size aligned */ in iomap_split_ioend()
189 split = bio_split(bio, sector_offset, GFP_NOFS, &iomap_ioend_bioset); in iomap_split_ioend()
190 if (IS_ERR(split)) in iomap_split_ioend()
191 return ERR_CAST(split); in iomap_split_ioend()
192 split->bi_private = bio->bi_private; in iomap_split_ioend()
193 split->bi_end_io = bio->bi_end_io; in iomap_split_ioend()
195 split_ioend = iomap_init_ioend(ioend->io_inode, split, ioend->io_offset, in iomap_split_ioend()
/linux/arch/x86/kernel/cpu/
H A Dcacheinfo.c145 } split; member
154 } split; member
161 } split; member
291 eax->split.is_self_initializing = 1; in amd_cpuid4()
292 eax->split.type = types[leaf]; in amd_cpuid4()
293 eax->split.level = levels[leaf]; in amd_cpuid4()
294 eax->split.num_threads_sharing = 0; in amd_cpuid4()
295 eax->split.num_cores_on_die = topology_num_cores_per_package(); in amd_cpuid4()
299 eax->split.is_fully_associative = 1; in amd_cpuid4()
300 ebx->split.coherency_line_size = line_size - 1; in amd_cpuid4()
[all …]
/linux/block/
H A Dblk-merge.c114 struct bio *split; in bio_submit_split() local
116 split = bio_split(bio, split_sectors, GFP_NOIO, in bio_submit_split()
118 if (IS_ERR(split)) { in bio_submit_split()
119 split_sectors = PTR_ERR(split); in bio_submit_split()
122 split->bi_opf |= REQ_NOMERGE; in bio_submit_split()
123 blkcg_bio_issue_init(split); in bio_submit_split()
124 bio_chain(split, bio); in bio_submit_split()
125 trace_block_split(split, bio->bi_iter.bi_sector); in bio_submit_split()
128 return split; in bio_submit_split()
250 * bvec_split_segs - verify whether or not a bvec should be split in the middle
[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/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/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/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/Documentation/admin-guide/mm/
H A Dtranshuge.rst206 and will therefore be split under memory presure if they are considered
522 is incremented every time a huge page is split into base
528 is incremented if kernel fails to split huge
532 is incremented when a huge page is put onto split
534 splitting it would free up some memory. Pages on split queue are
535 going to be split under memory pressure.
538 is incremented when a huge page on the split queue was split
544 is incremented every time a PMD split into table of PTEs.
546 munmap() on part of huge page. It doesn't split huge page, only
563 is incremented if a huge page has to be split before swapout.
[all …]
/linux/Documentation/networking/
H A Ddevmem.rst42 normally. The NIC must support header split to achieve this.
79 Header split, flow steering, & RSS are required features for devmem TCP.
81 Header split is used to split incoming packets into a header buffer in host
87 Enable header split & flow steering::
89 # enable header split
90 ethtool -G eth1 tcp-data-split on
206 This typically happens when the NIC is unable to split the packet at the

12345678910>>...64