| /linux-5.10/drivers/media/dvb-core/ |
| 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-5.10/tools/testing/selftests/net/ |
| 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.)
91 Get the $port split ability.
92 Return: split ability, true or false.
103 def split(k, port, should_fail=False): function
105 Split $port into $k ports.
106 If should_fail == True, the split should fail. Otherwise, should pass.
108 If the $port wasn't split, the array will be empty.
[all …]
|
| /linux-5.10/Documentation/vm/ |
| D | split_page_table_lock.rst | 4 Split page table lock
10 scalability, split page table lock was introduced.
12 With split page table lock we have separate per-table lock to serialize
13 access to the table. At the moment we use split lock for PTE and PMD
33 Split page table lock for PTE tables is enabled compile-time if
35 If split lock is disabled, all tables guaded by mm->page_table_lock.
37 Split page table lock for PMD tables is enabled, if it's enabled for PTE
40 Hugetlb and split page table lock
43 Hugetlb can support several page sizes. We use split lock only for PMD
49 takes pmd split lock for PMD_SIZE page, mm->page_table_lock
[all …]
|
| D | transhuge.rst | 16 if necessary, split a transparent hugepage. Therefore these components
48 prevent the page from being split by anyone.
58 follow_page, so that it will split the hugepages before returning
74 that you can't handle natively in your code, you can split it by
144 For anonymous pages, we set PG_double_map when a PMD of the page is split
156 requests to split pinned huge pages: it expects page count to be equal to
172 clear where references should go after split: it will stay on the head page.
175 pmd can be split at any point and never fails.
|
| /linux-5.10/lib/ |
| 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-5.10/fs/jfs/ |
| 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);
238 int nsplit = 0; /* number of pages to split */ in xtSearch()
335 /* compute number of pages to split */ in xtSearch()
382 /* compute number of pages to split */ in xtSearch()
440 /* compute number of pages to split */ in xtSearch()
482 /* update number of pages to split */ in xtSearch()
535 struct xtsplit split; /* split information */ in xtInsert() local
[all …]
|
| 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-5.10/arch/powerpc/platforms/powernv/ |
| D | subcore.c | 28 * Split/unsplit procedure:
30 * A core can be in one of three states, unsplit, 2-way split, and 4-way split.
37 * 2-way split | 2
38 * 4-way split | 4
40 * The core is split along thread boundaries, the mapping between subcores and
50 * 2-way split:
57 * 4-way split:
68 * It is not possible to transition between either of the split states, the
72 * | | <----> | 2-way split |
76 * | | <----> | 4-way split |
[all …]
|
| /linux-5.10/drivers/virtio/ |
| D | virtio_ring.c | 117 /* Available for split ring */
137 } split; member
364 * Split ring specific functions - *_split().
451 WARN_ON_ONCE(total_sg > vq->split.vring.num && !vq->indirect); in virtqueue_add_split()
462 desc = vq->split.vring.desc; in virtqueue_add_split()
518 vq->split.vring.desc[head].flags = cpu_to_virtio16(_vq->vdev, in virtqueue_add_split()
520 vq->split.vring.desc[head].addr = cpu_to_virtio64(_vq->vdev, in virtqueue_add_split()
523 vq->split.vring.desc[head].len = cpu_to_virtio32(_vq->vdev, in virtqueue_add_split()
533 vq->split.vring.desc[head].next); in virtqueue_add_split()
538 vq->split.desc_state[head].data = data; in virtqueue_add_split()
[all …]
|
| /linux-5.10/fs/btrfs/tests/ |
| D | extent-buffer-tests.c | 72 * space in this leaf to split the item without having to split the in test_btrfs_split_item()
77 test_err("split item failed %d", ret); in test_btrfs_split_item()
95 test_err("invalid len in the first split"); in test_btrfs_split_item()
104 "data in the buffer doesn't match what it should in the first split have='%.*s' want '%s'", in test_btrfs_split_item()
120 test_err("invalid len in the second split"); in test_btrfs_split_item()
129 "data in the buffer doesn't match what it should in the second split"); in test_btrfs_split_item()
138 test_err("second split item failed %d", ret); in test_btrfs_split_item()
152 test_err("invalid len in the first split"); in test_btrfs_split_item()
161 "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-5.10/security/apparmor/ |
| D | lib.c | 29 * aa_split_fqname - split a fqname into a profile and namespace name
35 * Split a namespace name from a profile name (see policy.c for naming
48 char *split = strchr(&name[1], ':'); in aa_split_fqname() local
50 if (split) { in aa_split_fqname()
52 *split++ = 0; in aa_split_fqname()
53 if (strncmp(split, "//", 2) == 0) in aa_split_fqname()
54 split += 2; in aa_split_fqname()
55 name = skip_spaces(split); in aa_split_fqname()
96 char *split = strnchr(&name[1], end - &name[1], ':'); in aa_splitn_fqname() local
100 if (split) { in aa_splitn_fqname()
[all …]
|
| /linux-5.10/arch/x86/kernel/cpu/ |
| D | cacheinfo.c | 137 } split; member
146 } split; member
153 } split; member
285 eax->split.is_self_initializing = 1; in amd_cpuid4()
286 eax->split.type = types[leaf]; in amd_cpuid4()
287 eax->split.level = levels[leaf]; in amd_cpuid4()
288 eax->split.num_threads_sharing = 0; in amd_cpuid4()
289 eax->split.num_cores_on_die = __this_cpu_read(cpu_info.x86_max_cores) - 1; in amd_cpuid4()
293 eax->split.is_fully_associative = 1; in amd_cpuid4()
294 ebx->split.coherency_line_size = line_size - 1; in amd_cpuid4()
[all …]
|
| /linux-5.10/block/ |
| D | blk-merge.c | 178 * bvec_split_segs - verify whether or not a bvec should be split in the middle
191 * big to fit in a single segment and hence that it has to be split in the
222 /* tell the caller to split the bvec if it is too big to fit */ in bvec_split_segs()
227 * blk_bio_segment_split - split a bio in two bios
229 * @bio: [in] bio to be split
243 * split bio has finished.
262 goto split; in blk_bio_segment_split()
271 goto split; in blk_bio_segment_split()
280 split: in blk_bio_segment_split()
286 * __blk_queue_split - split a bio and submit the second half
[all …]
|
| /linux-5.10/arch/nds32/ |
| D | Kconfig.cpu | 168 Depending on the selected kernel/user memory split, minimum
191 prompt "Memory split"
195 Select the desired split between kernel and user memory.
201 bool "3G/1G user/kernel split"
203 bool "3G/1G user/kernel split (for full 1G low memory)"
205 bool "2G/2G user/kernel split"
207 bool "1G/3G user/kernel split"
|
| /linux-5.10/tools/perf/pmu-events/arch/x86/goldmont/ |
| D | memory.json | 5 …"PublicDescription": "Counts when a memory load of a uop spans a page boundary (a split) is retire…
11 "BriefDescription": "Load uops that split a page (Precise event capable)"
16 …"PublicDescription": "Counts when a memory store of a uop spans a page boundary (a split) is retir…
22 "BriefDescription": "Store uops that split a page (Precise event capable)"
|
| /linux-5.10/tools/perf/pmu-events/arch/x86/goldmontplus/ |
| D | memory.json | 5 …"PublicDescription": "Counts when a memory load of a uop spans a page boundary (a split) is retire…
12 "BriefDescription": "Load uops that split a page (Precise event capable)"
17 …"PublicDescription": "Counts when a memory store of a uop spans a page boundary (a split) is retir…
24 "BriefDescription": "Store uops that split a page (Precise event capable)"
|
| /linux-5.10/arch/x86/oprofile/ |
| D | op_model_ppro.c | 86 if (!(eax.split.version_id == 0 && in ppro_setup_ctrs()
90 if (counter_width < eax.split.bit_width) in ppro_setup_ctrs()
91 counter_width = eax.split.bit_width; in ppro_setup_ctrs()
215 if (eax.split.version_id == 0 && boot_cpu_data.x86 == 6 && in arch_perfmon_setup_counters()
217 eax.split.version_id = 2; in arch_perfmon_setup_counters()
218 eax.split.num_counters = 2; in arch_perfmon_setup_counters()
219 eax.split.bit_width = 40; in arch_perfmon_setup_counters()
222 num_counters = min((int)eax.split.num_counters, OP_MAX_COUNTER); in arch_perfmon_setup_counters()
|
| /linux-5.10/drivers/gpu/drm/arm/display/komeda/ |
| D | komeda_format_caps.c | 69 /* 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 */
|
| D | komeda_pipeline_state.c | 578 DRM_DEBUG_ATOMIC("split in_w:%d is out of the acceptable range.\n", in komeda_splitter_validate()
584 DRM_DEBUG_ATOMIC("split in_h: %d exceeds the acceptable range.\n", in komeda_splitter_validate()
865 /* try to enable split if scaling exceed the scaler's acceptable in komeda_complete_data_flow_cfg()
904 /* if split, check if can put the data flow into merger */ in komeda_build_layer_data_flow()
914 * Split is introduced for workaround scaler's input/output size limitation.
916 * So split splits the big source image to two half parts (left/right) and do
918 * But split also imports an edge problem in the middle of the image when
919 * scaling, to avoid it, split isn't a simple half-and-half, but add an extra
920 * pixels (overlap) to both side, after split the left/right will be:
930 * The diagram for how to do the split
[all …]
|
| /linux-5.10/drivers/crypto/caam/ |
| D | key_gen.h | 10 * 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
|
| D | key_gen.c | 31 get a split ipad/opad key
33 Split key generation-----------------------------------------------
59 dev_dbg(jrdev, "split keylen %d split keylen padded %d\n", in gen_split_key()
97 * FIFO_STORE with the explicit split-key content store in gen_split_key()
|
| /linux-5.10/fs/btrfs/ |
| D | file.c | 515 * [start, end]. Existing extents are split as required.
521 struct extent_map *split = NULL; in btrfs_drop_extent_cache() local
541 if (!split) in btrfs_drop_extent_cache()
542 split = alloc_extent_map(); in btrfs_drop_extent_cache()
545 if (!split || !split2) in btrfs_drop_extent_cache()
577 split->start = em->start; in btrfs_drop_extent_cache()
578 split->len = start - em->start; in btrfs_drop_extent_cache()
581 split->orig_start = em->orig_start; in btrfs_drop_extent_cache()
582 split->block_start = em->block_start; in btrfs_drop_extent_cache()
585 split->block_len = em->block_len; in btrfs_drop_extent_cache()
[all …]
|
| /linux-5.10/net/sched/ |
| D | sch_cbq.c | 95 struct cbq_class *split; /* Ptr to split node */ member
199 * so that it resolves to split nodes. Then packets are classified
201 * to the split node.
914 struct cbq_class *split = cl->split; in cbq_sync_defmap() local
918 if (split == NULL) in cbq_sync_defmap()
922 if (split->defaults[i] == cl && !(cl->defmap & (1<<i))) in cbq_sync_defmap()
923 split->defaults[i] = NULL; in cbq_sync_defmap()
927 int level = split->level; in cbq_sync_defmap()
929 if (split->defaults[i]) in cbq_sync_defmap()
937 if (c->split == split && c->level < level && in cbq_sync_defmap()
[all …]
|
| /linux-5.10/drivers/usb/dwc2/ |
| D | hcd_queue.c | 601 * same transaction (AKA we have a split) we always do low speed first. in dwc2_ls_pmap_schedule()
696 * dwc2_uframe_schedule_split - Schedule a QH for a periodic split xfer.
776 * issue a start split in uframe 6, which spec says is not OK. in dwc2_uframe_schedule_split()
779 * See 11.18.4 Host Split Transaction Scheduling Requirements in dwc2_uframe_schedule_split()
794 * - start split (frame -1) in dwc2_uframe_schedule_split()
795 * - complete split w/ data (frame +1) in dwc2_uframe_schedule_split()
796 * - complete split w/ data (frame +2) in dwc2_uframe_schedule_split()
798 * - complete split w/ data (frame +num_data_packets) in dwc2_uframe_schedule_split()
799 * - complete split w/ data (frame +num_data_packets+1) in dwc2_uframe_schedule_split()
800 * - complete split w/ data (frame +num_data_packets+2, max 8) in dwc2_uframe_schedule_split()
[all …]
|
| /linux-5.10/drivers/net/arcnet/ |
| D | rfc1201.c | 165 if (!soft->split_flag) { /* not split */ in rx()
166 arc_printk(D_RX, dev, "incoming is not split (splitflag=%d)\n", in rx()
236 } else { /* split packet */ in rx()
255 arc_printk(D_RX, dev, "packet is split (splitflag=%d, seq=%d)\n", in rx()
268 if (soft->split_flag & 1) { /* first packet in split */ in rx()
294 arc_printk(D_NORMAL, dev, "(split) memory squeeze, dropping packet.\n"); in rx()
306 soft->split_flag = 0; /* end result won't be split */ in rx()
315 …arc_printk(D_EXTRA, dev, "can't continue split without starting first! (splitflag=%d, seq=%d, abor… in rx()
365 arc_printk(D_SKB_SIZE, dev, "skb: received %d bytes from %02X (split)\n", in rx()
424 soft->split_flag = 0; /* split packets are done elsewhere */ in build_header()
[all …]
|