| /linux/drivers/media/dvb-core/ |
| H A D | dvb_ringbuffer.c | 136 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 D | devlink_port_split.py | 12 # 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 D | mediatek,split.yaml | 4 $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
59 - description: SPLIT Clock
72 const: mediatek,mt8195-mdp3-split
[all …]
|
| /linux/lib/ |
| H A D | sg_split.c | 81 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()
98 out_sg[-1].length = split->length_last_sg; in sg_split_phys()
107 struct sg_splitter *split; in sg_split_mapped() local
109 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_mapped()
[all …]
|
| /linux/Documentation/mm/ |
| H A D | split_page_table_lock.rst | 2 Split page table lock
8 scalability, split page table lock was introduced.
10 With split page table lock we have separate per-table lock to serialize
11 access to the table. At the moment we use split lock for PTE and PMD
36 Split page table lock for PTE tables is enabled compile-time if
38 If split lock is disabled, all tables are guarded by mm->page_table_lock.
40 Split page table lock for PMD tables is enabled, if it's enabled for PTE
43 Hugetlb and split page table lock
46 Hugetlb can support several page sizes. We use split lock only for PMD
52 takes pmd split lock for PMD_SIZE page, mm->page_table_lock
[all …]
|
| /linux/fs/jfs/ |
| H A D | jfs_xtree.c | 96 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 D | jfs_dtree.c | 32 * 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 */
140 struct dtsplit * split, struct btstack * btstack);
142 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split,
146 struct dtsplit * split, struct btstack * btstack);
149 struct dtsplit * split, struct metapage ** rmpp);
602 /* init level count for max pages to split */ in dtSearch()
[all …]
|
| /linux/arch/powerpc/platforms/powernv/ |
| H A D | subcore.c | 30 * 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/verification/dot2/ |
| H A D | automata.py | 54 line = dot_lines[cursor].split()
64 while self.__dot_lines[cursor].split()[0] != "{node":
70 while self.__dot_lines[cursor].split()[0] != "{node":
72 while self.__dot_lines[cursor].split()[0] == "{node":
87 while self.__dot_lines[cursor].split()[0] == "{node":
88 line = self.__dot_lines[cursor].split()
127 if self.__dot_lines[cursor].split()[1] == "->":
128 line = self.__dot_lines[cursor].split()
133 # so split them.
136 for i in event.split():
[all …]
|
| /linux/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
| H A D | cake.json | 17 …+ 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 D | extent-buffer-tests.c | 76 * 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/fs/btrfs/ |
| H A D | extent_map.c | 794 * are split.
801 struct extent_map *split; in btrfs_drop_extent_map_range() local
825 * because we need to split those two extent maps at the boundaries. in btrfs_drop_extent_map_range()
827 split = alloc_extent_map(); in btrfs_drop_extent_map_range()
858 * In case we split the extent map, we want to preserve the in btrfs_drop_extent_map_range()
867 * split it, we can remove it directly. in btrfs_drop_extent_map_range()
875 if (!split) { in btrfs_drop_extent_map_range()
876 split = split2; in btrfs_drop_extent_map_range()
878 if (!split) in btrfs_drop_extent_map_range()
881 split->start = em->start; in btrfs_drop_extent_map_range()
[all …]
|
| /linux/drivers/virtio/ |
| H A D | virtio_ring.c | 189 * for split ring, it just contains last used index
200 /* Available for split ring */
201 struct vring_virtqueue_split split; member
440 * Split ring specific functions - *_split().
463 struct vring_desc_extra *extra = vq->split.desc_extra; in vring_unmap_one_split()
524 struct vring_desc_extra *extra = vring->split.desc_extra; in virtqueue_add_desc_split()
580 WARN_ON_ONCE(total_sg > vq->split.vring.num && !vq->indirect); in virtqueue_add_split()
591 desc = vq->split.vring.desc; in virtqueue_add_split()
647 vq->split.desc_extra[prev & (vq->split.vring.num - 1)].flags &= in virtqueue_add_split()
662 virtqueue_add_desc_split(_vq, vq->split.vring.desc, in virtqueue_add_split()
[all …]
|
| /linux/tools/testing/selftests/vDSO/ |
| H A D | vdso_test_chacha.c | 99 for (unsigned int split = 0; split < BLOCKS; ++split) {
102 if (split)
103 __arch_chacha20_blocks_nostack(output2, key, counter2, split);
104 __arch_chacha20_blocks_nostack(output2 + split * BLOCK_SIZE, key, counter2, BLOCKS - split);
31 for (unsigned int split = 0; split < BLOCKS; ++split) { main() local
|
| /linux/security/apparmor/ |
| H A D | lib.c | 49 * aa_split_fqname - split a fqname into a profile and namespace name
55 * Split a namespace name from a profile name (see policy.c for naming
68 char *split = strchr(&name[1], ':'); in aa_split_fqname() local
70 if (split) { in aa_split_fqname()
72 *split++ = 0; in aa_split_fqname()
73 if (strncmp(split, "//", 2) == 0) in aa_split_fqname()
74 split += 2; in aa_split_fqname()
75 name = skip_spaces(split); in aa_split_fqname()
117 char *split = strnchr(&name[1], end - &name[1], ':'); in aa_splitn_fqname() local
121 if (split) { in aa_splitn_fqname()
[all …]
|
| /linux/drivers/net/ethernet/intel/ice/devlink/ |
| H A D | devlink_port.c | 44 * ice_devlink_port_options_print - Print available port split options
45 * @pf: the PF to print split port options
47 * Prints a table with available port split options and max port speeds
80 dev_dbg(dev, "Available port split options and max port speeds (Gbps):\n"); in ice_devlink_port_options_print()
81 dev_dbg(dev, "Status Split Quad 0 Quad 1\n"); in ice_devlink_port_options_print()
116 * @pf: the PF to print split port options
134 NL_SET_ERR_MSG_MOD(extack, "Port split request failed"); in ice_devlink_aq_set_port_option()
150 NL_SET_ERR_MSG_MOD(extack, "Port split request failed to save data"); in ice_devlink_aq_set_port_option()
157 NL_SET_ERR_MSG_MOD(extack, "Reboot required to finish port split"); in ice_devlink_aq_set_port_option()
165 * @count: number of ports to split to
[all …]
|
| /linux/Documentation/arch/x86/ |
| H A D | buslock.rst | 16 A split lock is any atomic operation whose operand crosses two cache lines.
20 A bus lock is acquired through either split locked access to writeback (WB)
29 mechanisms to detect split locks and bus locks.
31 #AC exception for split lock detection
34 Beginning with the Tremont Atom CPU split lock operations may raise an
35 Alignment Check (#AC) exception when a split lock operation is attempted.
51 |split_lock_detect=|#AC for split lock |#DB for bus lock |
60 | |split lock in parallel. | |
89 generating split lock and bus lock to block the hard real time code to
102 Disable checking for split lock and bus lock. This option can be useful if
|
| /linux/arch/x86/kernel/cpu/ |
| H A D | cacheinfo.c | 152 } split; member
161 } split; member
168 } split; member
300 eax->split.is_self_initializing = 1; in amd_cpuid4()
301 eax->split.type = types[leaf]; in amd_cpuid4()
302 eax->split.level = levels[leaf]; in amd_cpuid4()
303 eax->split.num_threads_sharing = 0; in amd_cpuid4()
304 eax->split.num_cores_on_die = topology_num_cores_per_package(); in amd_cpuid4()
308 eax->split.is_fully_associative = 1; in amd_cpuid4()
309 ebx->split.coherency_line_size = line_size - 1; in amd_cpuid4()
[all …]
|
| /linux/tools/testing/selftests/mm/ |
| H A D | split_huge_page_test.c | 118 printf("No RssAnon is allocated before split\n"); in split_pmd_thp()
122 /* split all THPs */ in split_pte_mapped_thp()
133 printf("Still AnonHugePages not split\n"); in split_pte_mapped_thp()
153 printf("Split zero filled huge pages successful\n"); in split_pte_mapped_thp()
175 /* split all THPs */ in split_pte_mapped_thp()
185 ksft_exit_fail_msg("Still AnonHugePages not split\n"); in split_pte_mapped_thp()
187 ksft_test_result_pass("Split huge pages successful\n"); in split_pte_mapped_thp()
250 /* split all remapped THPs */ in split_file_backed_thp()
266 ksft_exit_fail_msg("Still %ld THPs not split\n", thp_size); in split_file_backed_thp()
268 ksft_test_result_pass("Split PT in split_file_backed_thp()
[all...] |
| /linux/lib/zstd/compress/ |
| H A D | zstd_ldm.c | 89 * Registers in the splits array all the split points found in the first
291 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_fillHashTable() local
292 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_fillHashTable()
296 entry.offset = (U32)(split - base); in ZSTD_ldm_fillHashTable()
369 BYTE const* const split = ip + splits[n] - minMatchLength; in ZSTD_ldm_generateSequences_internal() local
370 U64 const xxhash = xxh64(split, minMatchLength, 0); in ZSTD_ldm_generateSequences_internal()
373 candidates[n].split = split; in ZSTD_ldm_generateSequences_internal()
384 BYTE const* const split = candidates[n].split; in ZSTD_ldm_generateSequences_internal() local
392 newEntry.offset = (U32)(split - base); in ZSTD_ldm_generateSequences_internal()
395 /* If a split point would generate a sequence overlapping with in ZSTD_ldm_generateSequences_internal()
[all …]
|
| /linux/block/ |
| H A D | blk-merge.c | 117 struct bio *split; in bio_submit_split() local
119 split = bio_split(bio, split_sectors, GFP_NOIO, in bio_submit_split()
121 split->bi_opf |= REQ_NOMERGE; in bio_submit_split()
122 blkcg_bio_issue_init(split); in bio_submit_split()
123 bio_chain(split, bio); in bio_submit_split()
124 trace_block_split(split, bio->bi_iter.bi_sector); in bio_submit_split()
127 return split; in bio_submit_split()
254 * bvec_split_segs - verify whether or not a bvec should be split in the middle
255 * @lim: [in] queue limits to split based on
267 * big to fit in a single segment and hence that it has to be split in the
[all …]
|
| /linux/arch/x86/events/amd/ |
| H A D | lbr.c | 46 } split; member
57 } split; member
179 if ((!entry.to.split.valid && !entry.to.split.spec) || in amd_pmu_lbr_read()
180 entry.to.split.reserved) in amd_pmu_lbr_read()
185 br[out].from = sign_ext_branch_ip(entry.from.split.ip); in amd_pmu_lbr_read()
186 br[out].to = sign_ext_branch_ip(entry.to.split.ip); in amd_pmu_lbr_read()
187 br[out].mispred = entry.from.split.mispredict; in amd_pmu_lbr_read()
206 idx = (entry.to.split.valid << 1) | entry.to.split.spec; in amd_pmu_lbr_read()
429 x86_pmu.lbr_nr = ebx.split.lbr_v2_stack_sz; in amd_pmu_lbr_init()
|
| H A D | uncore.c | 69 } split; member
398 return info->split.cid; in amd_uncore_ctx_cid()
405 return info->split.gid; in amd_uncore_ctx_gid()
412 return info->split.num_pmcs; in amd_uncore_ctx_num_pmcs()
643 info.split.aux_data = 0; in amd_uncore_df_ctx_scan()
644 info.split.num_pmcs = NUM_COUNTERS_NB; in amd_uncore_df_ctx_scan()
645 info.split.gid = 0; in amd_uncore_df_ctx_scan()
646 info.split.cid = topology_logical_package_id(cpu); in amd_uncore_df_ctx_scan()
650 info.split.num_pmcs = ebx.split.num_df_pmc; in amd_uncore_df_ctx_scan()
779 info.split.aux_data = 0; in amd_uncore_l3_ctx_scan()
[all …]
|
| /linux/tools/perf/pmu-events/arch/x86/goldmont/ |
| H A D | memory.json | 12 "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 D | memory.json | 12 "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…
|