Home
last modified time | relevance | path

Searched +full:non +full:- +full:overlapping (Results 1 – 25 of 166) sorted by relevance

1234567

/linux/Documentation/devicetree/bindings/sound/
H A Datmel,sama5d2-classd.yaml1 # 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/Documentation/admin-guide/cgroup-v1/
H A Dcpusets.rst11 - Portions Copyright (c) 2004-2006 Silicon Graphics, Inc.
12 - Modified by Paul Jackson <pj@sgi.com>
13 - Modified by Christoph Lameter <cl@gentwo.org>
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/tools/perf/util/
H A Dblock-range.h1 /* SPDX-License-Identifier: GPL-2.0 */
12 * struct block_range - non-overlapping parts of basic blocks
40 struct rb_node *n = rb_next(&br->node); in block_range__next()
53 return iter->start; in block_range_iter()
58 if (iter->start == iter->end) in block_range_iter__next()
61 iter->start = block_range__next(iter->start); in block_range_iter__next()
67 if (!iter->start || !iter->end) in block_range_iter__valid()
H A Dblock-range.c1 // SPDX-License-Identifier: GPL-2.0
2 #include "block-range.h"
21 assert(old < entry->start); in block_range__debug()
22 assert(entry->start <= entry->end); /* single instruction block; jump to a jump */ in block_range__debug()
24 old = entry->end; in block_range__debug()
39 if (addr < entry->start) in block_range__find()
40 p = &parent->rb_left; in block_range__find()
41 else if (addr > entry->end) in block_range__find()
42 p = &parent->rb_right; in block_range__find()
52 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
[all …]
/linux/security/landlock/
H A Druleset.h1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * Landlock LSM - Ruleset management
5 * Copyright © 2016-2020 Mickaël Salaün <mic@digikod.net>
6 * Copyright © 2018-2020 ANSSI
26 * struct landlock_layer - Access rights for a given layer
41 * union landlock_key - Key of a ruleset's red-blac
[all...]
/linux/fs/xfs/libxfs/
H A Dxfs_btree.h1 /* SPDX-License-Identifier: GPL-2.0 */
3 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
28 * The in-core btree key. Overlapping btrees actually store two keys
52 * This nonsense is to make -wlint happy.
74 #define XFS_BB_ALL_BITS ((1u << XFS_BB_NUM_BITS) - 1)
76 #define XFS_BB_ALL_BITS_CRC ((1u << XFS_BB_NUM_BITS_CRC) - 1)
82 XFS_STATS_INC_OFF((cur)->bc_mp, \
83 (cur)->bc_ops->statoff + __XBTS_ ## stat)
85 XFS_STATS_ADD_OFF((cur)->bc_mp, \
86 (cur)->bc_ops->statoff + __XBTS_ ## stat, val)
[all …]
H A Dxfs_rmap.c1 // SPDX-License-Identifier: GPL-2.0
50 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_le()
51 cur->bc_rec.r.rm_blockcount = 0; in xfs_rmap_lookup_le()
52 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_le()
53 cur->bc_rec.r.rm_offset = offset; in xfs_rmap_lookup_le()
54 cur->bc_rec.r.rm_flags = flags; in xfs_rmap_lookup_le()
65 return -EFSCORRUPTED; in xfs_rmap_lookup_le()
85 cur->bc_rec.r.rm_startblock = bno; in xfs_rmap_lookup_eq()
86 cur->bc_rec.r.rm_blockcount = len; in xfs_rmap_lookup_eq()
87 cur->bc_rec.r.rm_owner = owner; in xfs_rmap_lookup_eq()
[all …]
/linux/drivers/staging/rtl8723bs/include/
H A Drtw_mlme.h1 /* SPDX-License-Identifier: GPL-2.0 */
4 * Copyright(c) 2007 - 2011 Realtek Corporation. All rights reserved.
77 like ISR/Call-Back functions, the OID handlers, and even timer functions.
167 /* Number of non-HT AP/stations */
188 /* Number of associated Non-ERP stations (i.e., stations using 802.11b
198 int olbc; /* Overlapping Legacy BSS Condition */
203 /* Number of associated non-HT stations */
209 /* Overlapping BSS information */
283 { /* if sta_mode:pmlmepriv->cur_network.network.mac_address => bssid */ in get_bssid()
284 /* if adhoc_mode:pmlmepriv->cur_network.network.mac_address => ibss mac address */ in get_bssid()
[all …]
/linux/arch/arm/crypto/
H A Daes-ce-core.S1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * aes-ce-core.S - AES in CBC/CTR/XTS mode using ARMv8 Crypto Extensions
12 .arch armv8-a
13 .fpu crypto-neon-fp-armv8
102 vld1.32 {q10-q11}, [ip]!
104 vld1.32 {q12-q13}, [ip]!
106 vld1.32 {q10-q11}, [ip]!
108 vld1.32 {q12-q13}, [ip]!
110 blo 0f @ AES-128: 10 rounds
111 vld1.32 {q10-q11}, [ip]!
[all …]
/linux/arch/arc/mm/
H A Dhighmem.c1 // SPDX-License-Identifier: GPL-2.0-only
19 * for book-keeping
23 * fixmaps (compile time addr etc). Their book-keeping is done per cpu.
25 * Both these facts combined (preemption disabled and per-cpu allocation)
32 * - the kernel vaddr space from 0x7z to 0x8z (currently used by vmalloc/module)
33 * is now shared between vmalloc and kmap (non overlapping though)
35 * - Both fixmap/pkmap use a dedicated page table each, hooked up to swapper PGD
39 * - The fixed KMAP slots for kmap_local/atomic() require KM_MAX_IDX slots per
42 * - pkmap being preemptible, in theory could do with more than 256 concurrent
/linux/lib/
H A DKconfig1 # SPDX-License-Identifier: GPL-2.0-only
31 converting bitfields between a CPU-usable representation and a
33 - Is little endian (bytes are reversed within a 32-bit group)
34 - The least-significant 32-bit word comes first (within a 64-bit
36 - The most significant bit of a byte is at its right (bit 0 of a
51 please refer to the KUnit documentation in Documentation/dev-tools/kunit/.
62 This option enables the use of hardware bit-reversal instructions on
102 bool "Access I/O in non-MMIO mode"
108 mechanism, the host-local I/O resource can be mapped into system
110 system can access the I/O devices with the mapped-logic PIO through
[all …]
/linux/fs/xfs/
H A Dxfs_extent_busy.c1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
38 struct xfs_extent_busy_tree *eb = xg->xg_busy_extents; in xfs_extent_busy_insert_list()
46 new->group = xfs_group_hold(xg); in xfs_extent_busy_insert_list()
47 new->bno = bno; in xfs_extent_busy_insert_list()
48 new->length = len; in xfs_extent_busy_insert_list()
49 INIT_LIST_HEAD(&new->list); in xfs_extent_busy_insert_list()
50 new->flags = flags; in xfs_extent_busy_insert_list()
55 spin_lock(&eb->eb_lock); in xfs_extent_busy_insert_list()
56 rbp = &eb->eb_tree.rb_node; in xfs_extent_busy_insert_list()
[all …]
/linux/fs/btrfs/tests/
H A Dfree-space-tests.c1 // SPDX-License-Identifier: GPL-2.0
7 #include "btrfs-tests.h"
9 #include "../disk-io.h"
10 #include "../free-space-cache.h"
11 #include "../block-group.h"
41 return -1; in test_extents()
71 return -1; in test_extents()
76 return -1; in test_extents()
81 return -1; in test_extents()
111 return -1; in test_bitmaps()
[all …]
/linux/Documentation/arch/arm64/
H A Dperf.rst1 .. SPDX-License-Identifier: GPL-2.0
13 :Date: 2019-03-06
16 ------------
24 --------------
39 ----------
46 For a non-VHE host this attribute will exclude EL2 as we consider the
55 ----------------------------
59 The KVM host may run at EL0 (userspace), EL1 (non-VHE kernel) and EL2 (VHE
60 kernel or non-VHE hypervisor).
64 Due to the overlapping exception levels between host and guests we cannot
[all …]
/linux/kernel/irq/
H A Dautoprobe.c1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 1992, 1998-2004 Linus Torvalds, Ingo Molnar
24 * probe_irq_on - begin an interrupt autodetect
46 guard(raw_spinlock_irq)(&desc->lock); in probe_irq_on()
47 if (!desc->action && irq_settings_can_probe(desc)) { in probe_irq_on()
52 if (desc->irq_data.chip->irq_set_type) in probe_irq_on()
53 desc->irq_data.chip->irq_set_type(&desc->irq_data, IRQ_TYPE_PROBE); in probe_irq_on()
67 guard(raw_spinlock_irq)(&desc->lock); in probe_irq_on()
68 if (!desc->action && irq_settings_can_probe(desc)) { in probe_irq_on()
69 desc->istate |= IRQS_AUTODETECT | IRQS_WAITING; in probe_irq_on()
[all …]
/linux/Documentation/networking/
H A Dgtp.rst1 .. SPDX-License-Identifier: GPL-2.0
11 In 'drivers/net/gtp.c' you are finding a kernel-level implementation
18 tunneling User-IP payload between a mobile station (phone, modem)
29 technology-dependent protocol stack for transmitting the user IP
35 is translated into GTP *without breaking the end-to-end tunnel*. So
38 At some point the GTP packet ends up on the so-called GGSN (GSM/UMTS)
39 or P-GW (LTE), which terminates the tunnel, decapsulates the packet
42 theoretically some non-IP network like X.25).
58 It *only* implements the so-called 'user plane', carrying the User-IP
59 payload, called GTP-U. It does not implement the 'control plane',
[all …]
/linux/tools/testing/selftests/kvm/
H A Dset_memory_region_test.c1 // SPDX-License-Identifier: GPL-2.0
55 struct kvm_run *run = vcpu->run; in vcpu_worker()
60 * Loop until the guest is done. Re-enter the guest on all MMIO exits, in vcpu_worker()
67 if (run->exit_reason == KVM_EXIT_IO) { in vcpu_worker()
76 if (run->exit_reason != KVM_EXIT_MMIO) in vcpu_worker()
79 TEST_ASSERT(!run->mmio.is_write, "Unexpected exit mmio write"); in vcpu_worker()
80 TEST_ASSERT(run->mmio.len == 8, in vcpu_worker()
81 "Unexpected exit mmio size = %u", run->mmio.len); in vcpu_worker()
83 TEST_ASSERT(run->mmio.phys_addr == MEM_REGION_GPA, in vcpu_worker()
85 run->mmio.phys_addr); in vcpu_worker()
[all …]
/linux/mm/
H A Dpage_isolation.c1 // SPDX-License-Identifier: GPL-2.0
7 #include <linux/page-isolation.h>
8 #include <linux/pageblock-flags.h>
25 * check without lock_page also may miss some movable non-lru pages at
41 pageblock_start_pfn(end_pfn - 1)); in has_unmovable_pages()
99 skip_pages = folio_nr_pages(folio) - folio_page_idx(folio, page); in has_unmovable_pages()
100 pfn += skip_pages - 1; in has_unmovable_pages()
108 * because their page->_refcount is zero at all time. in has_unmovable_pages()
112 pfn += (1 << buddy_order(page)) - 1; in has_unmovable_pages()
165 spin_lock_irqsave(&zone->lock, flags); in set_migratetype_isolate()
[all …]
H A Dnuma_memblks.c1 // 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
142 pr_warn("Warning: invalid memblk node %d [mem %#010Lx-%#010Lx]\n", in numa_add_memblk_to()
143 nid, start, end - 1); in numa_add_memblk_to()
[all …]
/linux/arch/x86/kernel/
H A De820.c1 // SPDX-License-Identifier: GPL-2.0-only
16 #include <linux/firmware-map.h>
26 * - 'e820_table_firmware': the original firmware version passed to us by the
27 * bootloader - not modified by the kernel. It is composed of two parts:
31 * - the hibernation code uses it to generate a kernel-independent CRC32
34 * - 'e820_table_kexec': a slightly modified (by the kernel) firmware version
35 * passed to us by the bootloader - the major difference between
40 * - kexec, which is a bootloader in disguise, uses the original E820
41 * layout to pass to the kexec-ed kernel. This way the original kernel
42 * can have a restricted E820 map while the kexec()-ed kexec-kernel
[all …]
/linux/Documentation/fb/
H A Dapi.rst9 ---------------
12 with frame buffer devices. In-kernel APIs between device drivers and the frame
22 ---------------
36 - FB_CAP_FOURCC
44 --------------------
46 Pixels are stored in memory in hardware-dependent formats. Applications need
58 - FB_TYPE_PACKED_PIXELS
67 - FB_TYPE_PLANES
75 - FB_TYPE_INTERLEAVED_PLANES
86 - FB_TYPE_FOURCC
[all …]
/linux/Documentation/arch/arm/
H A Dvlocks.rst2 vlocks for Bare-Metal Mutual Exclusion
5 Voting Locks, or "vlocks" provide a simple low-level mutual exclusion
10 which are otherwise non-coherent, in situations where the hardware
28 ---------
30 The easiest way to explain the vlocks algorithm is with some pseudo-code::
34 int last_vote = -1; /* no votes yet */
40 if (last_vote != -1) {
64 last_vote = -1;
74 priority rule to act as a tie-breaker, or any counters which could
83 ------------------------
[all …]
/linux/Documentation/arch/s390/
H A Dcds.rst9 - Ingo Adlung
10 - Cornelia Huck
12 Copyright, IBM Corp. 1999-2002
21 processing, shared versus non-shared interrupt processing, DMA versus port
30 Operation manual (IBM Form. No. SA22-7201).
42 described in Documentation/arch/s390/driver-model.rst.
49 * All drivers must define a ccw_driver (see driver-model.txt) and the associated
96 -------------------
110 ----------------------------------
145 imply specific I/O commands (channel command words - CCWs) in order to operate
[all …]
/linux/arch/arm/mm/
H A Dcontext.c1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 2002-2003 Deep Blue Solutions Ltd, all rights reserved.
20 #include <asm/proc-fns.h>
26 * +-------------------------+-----------+
28 * +-------------------------+-----------+
30 * +-------------------------------------+
37 * by non-64-bit operations.
59 context_id = mm->context.id.counter; in a15_erratum_get_cpumask()
158 /* Queue a TLB invalidate and flush the I-cache if necessary. */ in flush_context()
192 u64 asid = atomic64_read(&mm->context.id); in new_context()
[all …]
/linux/Documentation/
H A Dmemory-barriers.txt19 documentation at tools/memory-model/. Nevertheless, even this memory
37 Note also that it is possible that a barrier may be a no-op for an
48 - Device operations.
49 - Guarantees.
53 - Varieties of memory barrier.
54 - What may not be assumed about memory barriers?
55 - Address-dependency barriers (historical).
56 - Control dependencies.
57 - SMP barrier pairing.
58 - Examples of memory barrier sequences.
[all …]

1234567