/linux-6.12.1/Documentation/devicetree/bindings/sound/ |
D | atmel,sama5d2-classd.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause) 4 --- 5 $id: http://devicetree.org/schemas/sound/atmel,sama5d2-classd.yaml# 6 $schema: http://devicetree.org/meta-schemas/core.yaml# 11 - Nicolas Ferre <nicolas.ferre@microchip.com> 12 - Alexandre Belloni <alexandre.belloni@bootlin.com> 13 - Claudiu Beznea <claudiu.beznea@microchip.com> 22 - items: 23 - const: atmel,sama5d2-classd 24 - items: [all …]
|
/linux-6.12.1/Documentation/arch/x86/ |
D | resctrl.rst | 1 .. SPDX-License-Identifier: GPL-2.0 9 :Authors: - Fenghua Yu <fenghua.yu@intel.com> 10 - Tony Luck <tony.luck@intel.com> 11 - Vikas Shivappa <vikas.shivappa@intel.com> 38 # mount -t resctrl resctrl [-o cdp[,cdpl2][,mba_MBps][,debug]] /sys/fs/resctrl 57 pseudo-locking is a unique way of using cache control to "pin" or 59 "Cache Pseudo-Locking". 96 own settings for cache use which can over-ride 128 Corresponding region is pseudo-locked. No 131 Indicates if non-contiguous 1s value in CBM is supported. [all …]
|
/linux-6.12.1/tools/testing/selftests/net/ |
D | ip_defrag.c | 1 // SPDX-License-Identifier: GPL-2.0 16 #include <time.h> 63 if (ret == -1 && (errno == ETIMEDOUT || errno == EAGAIN)) in recv_validate_udp() 66 if (ret != -1) in recv_validate_udp() 73 if (ret == -1) in recv_validate_udp() 89 sum -= 0xffff; in raw_checksum() 95 sum -= 0xffff; in raw_checksum() 106 sum = raw_checksum((uint8_t *)&iphdr->ip_src, 2 * sizeof(iphdr->ip_src), in udp_checksum() 122 sum = raw_checksum((uint8_t *)&iphdr->ip6_src, 2 * sizeof(iphdr->ip6_src), in udp6_checksum() 124 sum = raw_checksum((uint8_t *)&udphdr->len, sizeof(udphdr->len), sum); in udp6_checksum() [all …]
|
/linux-6.12.1/drivers/video/ |
D | aperture.c | 1 // SPDX-License-Identifier: MIT 20 * driver can be active at any given time. Many systems load a generic 21 * graphics drivers, such as EFI-GOP or VESA, early during the boot process. 23 * hardware-specific driver. To take over the device, the dedicated driver 25 * ownership of framebuffer memory and hand-over between drivers. 32 * .. code-block:: c 42 * return -ENODEV; 43 * base = mem->start; 61 * The given example reads the platform device's I/O-memory range from the 82 * .. code-block:: c [all …]
|
/linux-6.12.1/drivers/gpu/drm/i915/gt/ |
D | intel_gt_types.h | 1 /* SPDX-License-Identifier: MIT */ 53 * overlap in valid steering targets with 'subslice' style registers, we will 54 * need to explicitly re-steer reads of registers of the other type. 56 * Only the replication types that may need additional non-default steering 69 * will always return a non-terminated value at instance (0, 0). We'll 190 * @total: Total time this engine was busy. 192 * Accumulated time not counting the most recent block in cases 212 * Mask of the non fused CCS slices 250 * Should be taken before uncore->lock in cases where both are desired. 255 * Base of per-tile GTTMMADR where we can derive the MMIO and the GGTT. [all …]
|
/linux-6.12.1/Documentation/admin-guide/cgroup-v1/ |
D | cpusets.rst | 11 - Portions Copyright (c) 2004-2006 Silicon Graphics, Inc. 12 - Modified by Paul Jackson <pj@sgi.com> 13 - Modified by Christoph Lameter <cl@linux.com> 14 - Modified by Paul Menage <menage@google.com> 15 - Modified by Hidetoshi Seto <seto.hidetoshi@jp.fujitsu.com> 41 ---------------------- 45 an on-line node that contains memory. 54 Documentation/admin-guide/cgroup-v1/cgroups.rst. 73 ---------------------------- 77 non-uniform access times (NUMA) presents additional challenges for [all …]
|
/linux-6.12.1/lib/ |
D | memcpy_kunit.c | 1 // SPDX-License-Identifier: GPL-2.0 97 /* Verify argument side-effects aren't repeated. */ in memcpy_test() 104 compare("argument side-effects", dest, three); in memcpy_test() 135 struct some_bytes overlap = { in memmove_test() local 171 /* Verify argument side-effects aren't repeated. */ in memmove_test() 178 compare("argument side-effects", dest, five); in memmove_test() 181 ptr = &overlap.data[2]; in memmove_test() 182 memmove(ptr, overlap.data, 5); in memmove_test() 183 compare("overlapping write", overlap, overlap_expected); in memmove_test() 195 memchr(larger_array + 1, 0xaa, ARRAY_SIZE(larger_array) - 1)); in memmove_test() [all …]
|
/linux-6.12.1/arch/x86/boot/compressed/ |
D | kaslr.c | 1 // SPDX-License-Identifier: GPL-2.0 41 /* Simplified build-specific string for starting entropy. */ 53 hash = (hash << ((sizeof(hash) * 8) - 7)) | (hash >> 7); in rotate_xor() 82 * Store memory limit: MAXMEM on 64-bit and KERNEL_IMAGE_SIZE on 32-bit. 96 MEM_AVOID_MEMMAP_END = MEM_AVOID_MEMMAP_BEGIN + MAX_MEMMAP_REGIONS - 1, 105 if (one->start + one->size <= two->start) in mem_overlaps() 108 if (one->start >= two->start + two->size) in mem_overlaps() 128 return -EINVAL; in parse_memmap() 132 return -EINVAL; in parse_memmap() 137 return -EINVAL; in parse_memmap() [all …]
|
/linux-6.12.1/Documentation/admin-guide/mm/ |
D | numa_memory_policy.rst | 10 supported platforms with Non-Uniform Memory Access architectures since 2.4.?. 16 (``Documentation/admin-guide/cgroup-v1/cpusets.rst``) 19 programming interface that a NUMA-aware application can take advantage of. When 28 ------------------------ 41 not to overload the initial boot node with boot-time 45 this is an optional, per-task policy. When defined for a 61 In a multi-threaded task, task policies apply only to the thread 64 at the time a new task policy is installed retain their current 70 the policy at the time they were allocated. 98 mapping-- i.e., at Copy-On-Write. [all …]
|
/linux-6.12.1/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
D | main.h | 37 /* Maximum wait time for a MAC suspend */ 38 /* uS: 83mS is max packet time (64KB ampdu @ 6Mbps) */ 48 * Usage example, e.g. a three-bit field (bits 4-6): 52 * regval = R_REG(osh, ®s->regfoo); 55 * W_REG(osh, ®s->regfoo, regval); 58 (((unsigned)1 << (width)) - 1) 67 /* max # supported core revisions (0 .. MAXCOREREV - 1) */ 76 #define BRCMS_SHORTSLOT_AUTO -1 /* Driver will manage Shortslot setting */ 91 #define TXFID_QUEUE_MASK 0x0007 /* Bits 0-2 */ 92 #define TXFID_SEQ_MASK 0x7FE0 /* Bits 5-15 */ [all …]
|
/linux-6.12.1/net/netfilter/ |
D | xt_time.c | 6 * This is a module which is used for time matching 23 u_int8_t month; /* (1-12) */ 24 u_int8_t monthday; /* (1-31) */ 25 u_int8_t weekday; /* (1-7) */ 26 u_int8_t hour; /* (0-23) */ 27 u_int8_t minute; /* (0-59) */ 28 u_int8_t second; /* (0-59) */ 43 * Since time progresses forward, it is best to organize this array in reverse, 44 * to minimize lookup time. 51 /* 2039 - 2030 */ [all …]
|
/linux-6.12.1/fs/nilfs2/ |
D | gcinode.c | 1 // SPDX-License-Identifier: GPL-2.0+ 5 * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation. 12 * This file adds the cache of on-disk blocks to be moved in garbage 18 * time after they are copied to a new log. Dirty blocks made on the 19 * current generation and the blocks to be moved by GC never overlap 38 * nilfs_gccache_submit_read_data() - add data buffer and submit read request 39 * @inode - gc inode 40 * @blkoff - dummy offset treated as the key for the page cache 41 * @pbn - physical block number of the block 42 * @vbn - virtual block number of the block, 0 for non-virtual block [all …]
|
/linux-6.12.1/Documentation/userspace-api/media/v4l/ |
D | dev-raw-vbi.rst | 1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later 4 .. _raw-vbi: 12 information is transmitted, allowing some time while the electron beam 64 time to permit Unix tool chains, programming a device and then reading 89 overlap, or when the driver supports multiple opens and another process 106 .. flat-table:: struct v4l2_vbi_format 107 :header-rows: 0 108 :stub-columns: 0 111 * - __u32 112 - ``sampling_rate`` [all …]
|
/linux-6.12.1/drivers/firmware/tegra/ |
D | ivc.c | 1 // SPDX-License-Identifier: GPL-2.0-only 3 * Copyright (c) 2014-2016, NVIDIA CORPORATION. All rights reserved. 47 * This structure is divided into two-cache aligned parts, the first is only 50 * lines, which is critical to performance and necessary in non-cache coherent 79 if (!ivc->peer) in tegra_ivc_invalidate() 82 dma_sync_single_for_cpu(ivc->peer, phys, TEGRA_IVC_ALIGN, in tegra_ivc_invalidate() 88 if (!ivc->peer) in tegra_ivc_flush() 91 dma_sync_single_for_device(ivc->peer, phys, TEGRA_IVC_ALIGN, in tegra_ivc_flush() 106 * Perform an over-full check to prevent denial of service attacks in tegra_ivc_empty() 109 * expected to check for full or over-full conditions. in tegra_ivc_empty() [all …]
|
/linux-6.12.1/include/linux/ |
D | string.h | 1 /* SPDX-License-Identifier: GPL-2.0 */ 22 * memdup_array_user - duplicate array from user space 36 return ERR_PTR(-EOVERFLOW); in memdup_array_user() 42 * vmemdup_array_user - duplicate array from user space 56 return ERR_PTR(-EOVERFLOW); in vmemdup_array_user() 91 * strscpy - Copy a C-string into a sized buffer 98 * buffers overlap. The destination @dst buffer is always NUL terminated, 99 * unless it's zero-sized. 109 * trailing %NUL) or -E2BIG if @size is 0 or the copy from @src was 123 memset(__dst + __wrote + 1, 0, __count - __wrote - 1); \ [all …]
|
/linux-6.12.1/mm/ |
D | numa_memblks.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 26 for (i = 0; i < ARRAY_SIZE(mi->blk); i++) in numa_nodemask_from_meminfo() 27 if (mi->blk[i].start != mi->blk[i].end && in numa_nodemask_from_meminfo() 28 mi->blk[i].nid != NUMA_NO_NODE) in numa_nodemask_from_meminfo() 29 node_set(mi->blk[i].nid, *nodemask); in numa_nodemask_from_meminfo() 33 * numa_reset_distance - Reset NUMA distance table 69 return -ENOMEM; in numa_alloc_distance() 85 * numa_set_distance - Set NUMA distance from one NUMA to another 99 * at the time of table creation or @distance doesn't make sense, the call 142 pr_warn("Warning: invalid memblk node %d [mem %#010Lx-%#010Lx]\n", in numa_add_memblk_to() [all …]
|
/linux-6.12.1/arch/x86/platform/intel-quark/ |
D | imr.c | 1 // SPDX-License-Identifier: GPL-2.0-only 3 * imr.c -- Intel Isolated Memory Region driver 6 * Copyright(c) 2015 Bryan O'Donoghue <pure.logic@nexus-software.ie> 10 * When a device behind a masked port performs an access - snooped or 22 * See quark-x1000-datasheet.pdf for register definitions. 23 * http://www.intel.com/content/dam/www/public/us/en/documents/datasheets/quark-x1000-datasheet.pdf 28 #include <asm-generic/sections.h> 50 * See quark-x1000-datasheet.pdf sections 12.7.4.5 and 12.7.4.6 for 79 * imr_is_enabled - true if an IMR is enabled false otherwise. 84 * other state - for example set to zero but without read/write access [all …]
|
/linux-6.12.1/Documentation/networking/ |
D | nexthop-group-resilient.rst | 1 .. SPDX-License-Identifier: GPL-2.0 4 Resilient Next-hop Groups 7 Resilient groups are a type of next-hop group that is aimed at minimizing 12 the legacy multipath next-hop group, which uses the hash-threshold 15 To select a next hop, hash-threshold algorithm first assigns a range of 22 +-------+-------+-------+-------+-------+ 24 +-------+-+-----+---+---+-----+-+-------+ 26 +---------+---------+---------+---------+ 29 under the hash-threshold algorithm. 32 and 4 in favor of 5. While there will usually be some overlap between the [all …]
|
/linux-6.12.1/arch/sh/lib/ |
D | memcpy-sh4.S | 1 /* SPDX-License-Identifier: GPL-2.0 */ 7 * Modified from memcpy.S and micro-optimised for SH4 16 * It is assumed that there is no overlap between src and dst. 17 * If there is an overlap, then the results are undefined. 21 ! GHIJ KLMN OPQR --> ...G HIJK LMNO PQR. 30 add #-1,r5 ! 79 EX 34 add #-4,r5 ! 50 EX 55 mov.l r3,@-r0 ! 30 LS 72 mov.l r3,@-r0 ! 30 LS 79 add #-6,r2 ! 50 EX [all …]
|
/linux-6.12.1/Documentation/arch/x86/x86_64/ |
D | mm.rst | 1 .. SPDX-License-Identifier: GPL-2.0 7 Complete virtual memory map with 4-level page tables 12 - Negative addresses such as "-23 TB" are absolute addresses in bytes, counted down 13 from the top of the 64-bit address space. It's easier to understand the layout 14 when seen both in absolute addresses and in distance-from-top notation. 16 For example 0xffffe90000000000 == -23 TB, it's 23 TB lower than the top of the 17 64-bit address space (ffffffffffffffff). 22 - "16M TB" might look weird at first sight, but it's an easier way to visualize size 24 It also shows it nicely how incredibly large 64-bit address space is. 32 …0000000000000000 | 0 | 00007fffffffffff | 128 TB | user-space virtual memory, different … [all …]
|
/linux-6.12.1/include/uapi/linux/ |
D | hdreg.h | 1 /* SPDX-License-Identifier: GPL-2.0 WITH Linux-syscall-note */ 17 #define IDE_DRIVE_TASK_INVALID -1 137 * 0x01->0x02 Reserved 141 * 0x04->0x07 Reserved 146 * 0x09->0x0F Reserved 151 * 0x10->0x1F Reserved 153 #define WIN_READ 0x20 /* 28-Bit */ 154 #define WIN_READ_ONCE 0x21 /* 28-Bit without retries */ 155 #define WIN_READ_LONG 0x22 /* 28-Bit */ 156 #define WIN_READ_LONG_ONCE 0x23 /* 28-Bit without retries */ [all …]
|
/linux-6.12.1/Documentation/gpu/amdgpu/display/ |
D | dcn-overview.rst | 10 .. kernel-figure:: dc_pipeline_overview.svg 19 * **Display Pipe and Plane (DPP)**: This block provides pre-blend pixel 24 multiple planes, using global or per-pixel alpha. 29 * **Output Pipe Timing Combiner (OPTC)**: It generates time output to combine 38 * **Multi-Media HUB (MMHUBBUB)**: Memory controller interface for DMCUB and DWB 43 the Display Micro-Controller Unit - version B (DMCUB), which is handled via 84 ---------------------- 100 a one-to-one mapping of the link encoder to PHY, but we can configure the DCN 106 --------- 114 representation and convert them to a DCN specific floating-point format (i.e., [all …]
|
/linux-6.12.1/Documentation/userspace-api/ |
D | seccomp_filter.rst | 25 to time-of-check-time-of-use (TOCTOU) attacks that are common in system 65 call will return -1 and set errno to ``EINVAL``. 73 true, ``-EACCES`` will be returned. This requirement ensures that filter 79 time, but allow for further decreasing the attack surface during 82 The above call returns 0 on success and non-zero on error. 106 task without executing the system call. ``siginfo->si_call_addr`` 108 ``siginfo->si_syscall`` and ``siginfo->si_arch`` will indicate which 111 instruction). The return value register will contain an arch- 112 dependent value -- if resuming execution, set it to something 114 it with ``-ENOSYS`` could overwrite some useful information.) [all …]
|
/linux-6.12.1/arch/powerpc/mm/book3s64/ |
D | hash_tlb.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 7 * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org) 27 #include <asm/pte-walk.h> 51 i = batch->index; in hpte_need_flush() 58 * must still exist (and thus the VMA not reused) at the time in hpte_need_flush() 65 addr &= ~((1UL << mmu_psize_defs[psize].shift) - 1); in hpte_need_flush() 90 vsid = get_user_vsid(&mm->context, addr, ssize); in hpte_need_flush() 103 if (!batch->active) { in hpte_need_flush() 119 if (i != 0 && (mm != batch->mm || batch->psize != psize || in hpte_need_flush() 120 batch->ssize != ssize)) { in hpte_need_flush() [all …]
|
/linux-6.12.1/tools/memory-model/Documentation/ |
D | simple.txt | 2 memory-ordering lives simple, as is necessary for those whose domain 3 is complex. After all, there are bugs other than memory-ordering bugs, 4 and the time spent gaining memory-ordering knowledge is not available 5 for gaining domain knowledge. Furthermore Linux-kernel memory model 15 of MMIO-based device drivers will often need to use mb(), rmb(), and 22 Single-threaded code 25 In single-threaded code, there is no reordering, at least assuming 29 CPUs at the same time. One important exception is a function that makes 38 this lock at a given time, your code will be executed single-threaded. 56 surprisingly hard to correctly code production-quality lock acquisition [all …]
|