/linux/fs/nfs/ |
H A D | symlink.c | 1 // SPDX-License-Identifier: GPL-2.0 9 * Jun 7 1999, cache symlink lookups in the page cache. -DaveM 26 * and straight-forward than readdir caching. 31 struct inode *inode = folio->mapping->host; in nfs_symlink_filler() 34 error = NFS_PROTO(inode)->readlink(inode, &folio->page, 0, PAGE_SIZE); in nfs_symlink_filler() 50 page = find_get_page(inode->i_mapping, 0); in nfs_get_link() 52 return ERR_PTR(-ECHILD); in nfs_get_link() 55 return ERR_PTR(-ECHILD); in nfs_get_link() 58 err = ERR_PTR(nfs_revalidate_mapping(inode, inode->i_mapping)); in nfs_get_link() 61 page = read_cache_page(&inode->i_data, 0, nfs_symlink_filler, in nfs_get_link()
|
/linux/Documentation/arch/x86/x86_64/ |
H A D | 5level-paging.rst | 1 .. SPDX-License-Identifier: GPL-2.0 4 5-level paging 9 Original x86-64 was limited by 4-level paging to 256 TiB of virtual address 14 5-level paging. It is a straight-forward extension of the current page 20 QEMU 2.9 and later support 5-level paging. 22 Virtual memory layout for 5-level paging is described in 26 Enabling 5-level paging 30 Kernel with CONFIG_X86_5LEVEL=y still able to boot on 4-level hardware. 31 In this case additional page table level -- p4d -- will be folded at 34 User-space and large virtual address space [all …]
|
/linux/Documentation/driver-api/pldmfw/ |
H A D | index.rst | 1 .. SPDX-License-Identifier: GPL-2.0-only 9 <https://www.dmtf.org/documents/pmci/pldm-firmware-update-specification-100>. 14 file-format 15 driver-ops 39 The PLDM file format uses packed binary data, with most multi-byte fields 42 Due to this, it is not straight forward to index the record, record 50 unaligned access of multi-byte fields, and to properly convert from Little 71 6. After all components are programmed, perform any final device-specific
|
/linux/Documentation/input/devices/ |
H A D | sentelic.rst | 8 :Copyright: |copy| 2002-2011 Sentelic Corporation. 10 :Last update: Dec-07-2011 15 A) MSID 4: Scrolling wheel mode plus Forward page(4th button) and Backward 28 BYTE |---------------|BYTE |---------------|BYTE|---------------|BYTE|---------------| 30 |---------------| |---------------| |---------------| |---------------| 40 Byte 2: X Movement(9-bit 2's complement integers) 41 Byte 3: Y Movement(9-bit 2's complement integers) 43 valid values, -8 ~ +7 44 Bit4 => 1 = 4th mouse button is pressed, Forward one page. 51 - Set bit 1 in register 0x40 to 1 [all …]
|
/linux/Documentation/devicetree/bindings/iio/adc/ |
H A D | adi,ad7476.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause) 4 --- 6 $schema: http://devicetree.org/meta-schemas/core.yaml# 11 - Michael Hennerich <michael.hennerich@analog.com> 14 A lot of simple SPI ADCs have very straight forward interfaces. 21 - adi,ad7091 22 - adi,ad7091r 23 - adi,ad7273 24 - adi,ad7274 25 - adi,ad7276 [all …]
|
/linux/include/linux/ |
H A D | rcutiny.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */ 3 * Read-Copy Update mechanism for mutual exclusion, the Bloatwatch edition. 9 * For detailed explanation of Read-Copy Update mechanism see - 22 // not-yet-completed RCU grace periods. 32 return rgosp1->rgos_norm == rgosp2->rgos_norm; in same_state_synchronize_rcu_full() 39 rgosp->rgos_norm = get_state_synchronize_rcu(); in get_state_synchronize_rcu_full() 46 rgosp->rgos_norm = start_poll_synchronize_rcu(); in start_poll_synchronize_rcu_full() 53 return poll_state_synchronize_rcu(rgosp->rgos_norm); in poll_state_synchronize_rcu_full() 63 cond_synchronize_rcu(rgosp->rgos_norm); in cond_synchronize_rcu_full() 73 rgosp->rgos_norm = start_poll_synchronize_rcu_expedited(); in start_poll_synchronize_rcu_expedited_full() [all …]
|
/linux/tools/testing/selftests/ftrace/test.d/ftrace/ |
H A D | func_set_ftrace_file.tc | 2 # SPDX-License-Identifier: GPL-2.0 3 # description: ftrace - test reading of set_ftrace_filter 10 # straight forward and has had various bugs in the past. This test is designed 34 if ! echo "$1" | grep -q "^$2\$"; then 37 echo "$1" | grep -v "^$2\$" 43 dd1=`dd if=$FILTER bs=1 | grep -v -e 'records in' -e 'records out' -e 'bytes copied'` 44 dd100=`dd if=$FILTER bs=100 | grep -v -e 'records in' -e 'records out' -e 'bytes copied'` 48 while [ $# -gt 0 ]; do 62 if [ -n "$cat" ]; then 65 if [ -n "$dd1" ]; then [all …]
|
/linux/Documentation/devicetree/bindings/iio/ |
H A D | st,st-sensors.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 3 --- 4 $id: http://devicetree.org/schemas/iio/st,st-sensors.yaml# 5 $schema: http://devicetree.org/meta-schemas/core.yaml# 9 description: The STMicroelectronics sensor devices are pretty straight-forward 16 - Denis Ciocca <denis.ciocca@st.com> 17 - Linus Walleij <linus.walleij@linaro.org> 22 - description: STMicroelectronics Accelerometers 24 - st,h3lis331dl-accel 25 - st,lis2de12 [all …]
|
/linux/Documentation/bpf/ |
H A D | bpf_prog_run.rst | 1 .. SPDX-License-Identifier: GPL-2.0 16 -------- 20 can be used to unit test BPF programs against user-supplied context objects, and 28 - ``BPF_PROG_TYPE_SOCKET_FILTER`` 29 - ``BPF_PROG_TYPE_SCHED_CLS`` 30 - ``BPF_PROG_TYPE_SCHED_ACT`` 31 - ``BPF_PROG_TYPE_XDP`` 32 - ``BPF_PROG_TYPE_SK_LOOKUP`` 33 - ``BPF_PROG_TYPE_CGROUP_SKB`` 34 - ``BPF_PROG_TYPE_LWT_IN`` [all …]
|
/linux/drivers/comedi/drivers/ |
H A D | ssv_dnp.c | 1 // SPDX-License-Identifier: GPL-2.0+ 4 * generic comedi driver for SSV Embedded Systems' DIL/Net-PCs 7 * COMEDI - Linux Control and Measurement Device Interface 13 * Description: SSV Embedded Systems DIL/Net-PC 15 * Devices: [SSV Embedded Systems] DIL/Net-PC 1486 (dnp-1486) 19 /* include files ----------------------------------------------------------- */ 24 /* Some global definitions: the registers of the DNP ----------------------- */ 27 /* pins, where Bit-N = 0 -> input, Bit-N = 1 -> output. Note that bits */ 50 * Ports A and B are straight forward: each bit corresponds to an in dnp_dio_insn_bits() 58 outb(s->state & 0xff, CSCDR); in dnp_dio_insn_bits() [all …]
|
/linux/drivers/uio/ |
H A D | uio_sercos3.c | 1 // SPDX-License-Identifier: GPL-2.0 7 This is a straight-forward UIO driver, where interrupts are disabled 8 by the interrupt handler and re-enabled via a write to the UIO device 9 by the userspace-part. 13 userspace-part could directly modify the Interrupt Enable Register 18 Race conditions exist if the userspace-part directly modifies the 21 this reason, the userspace-part should only directly modify the 23 The userspace-part can safely disable interrupts at any time using 55 void __iomem *ier0 = info->mem[3].internal_addr + IER0_OFFSET; in sercos3_disable_interrupts() 58 priv->ier0_cache |= ioread32(ier0); in sercos3_disable_interrupts() [all …]
|
/linux/Documentation/admin-guide/ |
H A D | bug-bisect.rst | 1 .. SPDX-License-Identifier: (GPL-2.0+ OR CC-BY-4.0) 9 change that broke something -- for example when some functionality stopped 13 kernel, better follow Documentation/admin-guide/verify-bugs-and-bisect-regressions.rst 17 care about the result -- for example, because the problem happens after the 29 a fully reliable and straight-forward way to reproduce the regression, too.* 38 Instead of Git tags like 'v6.0' and 'v6.1' you can specify commit-ids, too. 75 mentioning the culprit's commit-id. 85 git bisect log > ~/bisection-log 86 cp .config ~/bisection-config-culprit 95 to revert the change by specifying its commit-id:: [all …]
|
H A D | reporting-issues.rst | 1 .. SPDX-License-Identifier: (GPL-2.0+ OR CC-BY-4.0) 36 ensure it's vanilla (IOW: not patched and not using add-on modules). Also make 44 to pin-point the culprit with a bisection; if you succeed, include its 45 commit-id and CC everyone in the sign-off-by chain. 51 Step-by-step guide how to report issues to the kernel maintainers 58 step-by-step approach. It still tries to be brief for readability and leaves 59 out a lot of details; those are described below the step-by-step guide in a 89 kernel modules on-the-fly, which solutions like DKMS might be doing locally 169 -------------------------------------------------------------- 204 ------------------------------------------------------------- [all …]
|
/linux/net/ipv4/ |
H A D | tcp_westwood.c | 1 // SPDX-License-Identifier: GPL-2.0-only 3 * TCP Westwood+: end-to-end bandwidth estimation for TCP 10 * - Mascolo S, Casetti, M. Gerla et al. 13 * - A. Grieco, s. Mascolo 17 * - A. Dell'Aera, L. Grieco, S. Mascolo. 18 * "Linux 2.4 Implementation of Westwood+ TCP with Rate-Halving : 21 * Westwood+ employs end-to-end bandwidth measurement to set cwnd and 65 w->bk = 0; in tcp_westwood_init() 66 w->bw_ns_est = 0; in tcp_westwood_init() 67 w->bw_est = 0; in tcp_westwood_init() [all …]
|
/linux/Documentation/process/ |
H A D | handling-regressions.rst | 1 .. SPDX-License-Identifier: (GPL-2.0+ OR CC-BY-4.0) 7 *We don't cause regressions* -- this document describes what this "first rule of 9 Documentation/admin-guide/reporting-regressions.rst, which covers the topic from a 21 loop by immediately sending at least a brief "Reply-all" with the list 24 * Forward or bounce any reports submitted in bug trackers to the list. 30 introduced: v5.13..v5.14-rc1``. If not, send a reply (with the regressions 39 #regzbot introduced: v5.13..v5.14-rc1 45 mandated by Documentation/process/submitting-patches.rst and 61 ----------------------------------- 72 it into the loop by sending at least a brief "Reply-all" with the list CCed; [all …]
|
/linux/fs/ocfs2/cluster/ |
H A D | quorum.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 52 /* this is horribly heavy-handed. It should instead flip the file 60 switch (o2nm_single_cluster->cl_fence_method) { in o2quo_fence_self() 66 WARN_ON(o2nm_single_cluster->cl_fence_method >= in o2quo_fence_self() 96 spin_lock_bh(&qs->qs_lock); in o2quo_make_decision() 98 lowest_hb = find_first_bit(qs->qs_hb_bm, O2NM_MAX_NODES); in o2quo_make_decision() 100 lowest_reachable = test_bit(lowest_hb, qs->qs_conn_bm); in o2quo_make_decision() 103 "lowest: %d (%sreachable)\n", qs->qs_heartbeating, in o2quo_make_decision() 104 qs->qs_connected, lowest_hb, lowest_reachable ? "" : "un"); in o2quo_make_decision() 106 if (!test_bit(o2nm_this_node(), qs->qs_hb_bm) || in o2quo_make_decision() [all …]
|
/linux/arch/powerpc/platforms/powernv/ |
H A D | subcore.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 32 * A core can be in one of three states, unsplit, 2-way split, and 4-way split. 37 * ------------|------------------ 39 * 2-way split | 2 40 * 4-way split | 4 46 * ---------------------------- 48 * ---------------------------- 50 * ---------------------------- 52 * 2-way split: 53 * ------------------------------------- [all …]
|
/linux/Documentation/arch/arm/pxa/ |
H A D | mfp.rst | 7 MFP stands for Multi-Function Pin, which is the pin-mux logic on PXA3xx and 15 mechanism is introduced from PXA3xx to completely move the pin-mux functions 16 out of the GPIO controller. In addition to pin-mux configurations, the MFP 17 also controls the low power state, driving strength, pull-up/down and event 21 +--------+ 22 | |--(GPIO19)--+ 24 | |--(GPIO...) | 25 +--------+ | 26 | +---------+ 27 +--------+ +------>| | [all …]
|
/linux/kernel/sched/ |
H A D | idle.c | 1 // SPDX-License-Identifier: GPL-2.0-only 14 * sched_idle_set_state - Record idle state for the current CPU. 29 cpu_idle_force_poll--; in cpu_idle_poll_ctrl() 104 * default_idle_call - Default CPU idle routine. 132 return -EBUSY; in call_cpuidle_s2idle() 145 dev->last_residency_ns = 0; in call_cpuidle() 147 return -EBUSY; in call_cpuidle() 153 * care of re-enabling the local interrupts in call_cpuidle() 159 * cpuidle_idle_call - the main idle function 175 * case, exit the function after re-enabling the local IRQ. in cpuidle_idle_call() [all …]
|
/linux/drivers/input/touchscreen/ |
H A D | sun4i-ts.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 5 * Copyright (C) 2013 - 2014 Hans de Goede <hdegoede@redhat.com> 12 * The sun4i-ts controller is capable of detecting a second touch, but when a 18 * open / close movement, and then reports emulated multi-touch events around 19 * the last touch coordinate (as the dual-touch coordinates are worthless). 22 * in the kernel). So this driver offers straight forward, reliable single 122 x = readl(ts->base + TP_DATA); in sun4i_ts_irq_handle_input() 123 y = readl(ts->base + TP_DATA); in sun4i_ts_irq_handle_input() 125 if (!ts->ignore_fifo_data) { in sun4i_ts_irq_handle_input() 126 input_report_abs(ts->input, ABS_X, x); in sun4i_ts_irq_handle_input() [all …]
|
/linux/arch/parisc/math-emu/ |
H A D | dfsub.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 3 * Linux/PA-RISC Project (http://www.parisc-linux.org/) 5 * Floating-point emulation code 6 * Copyright (C) 2001 Hewlett-Packard (Paul Bame) <bame@debian.org> 266 diff_exponent = result_exponent - right_exponent; in dbl_fsub() 296 /* A straight forward algorithm would now shift the result in dbl_fsub() 313 /* Must have been "x-x" or "x+(-x)". */ in dbl_fsub() 319 result_exponent--; in dbl_fsub() 355 if((result_exponent -= 8) <= 0 && !underflowtrap) in dbl_fsub() 363 if((result_exponent -= 4) <= 0 && !underflowtrap) in dbl_fsub() [all …]
|
H A D | dfadd.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 3 * Linux/PA-RISC Project (http://www.parisc-linux.org/) 5 * Floating-point emulation code 6 * Copyright (C) 2001 Hewlett-Packard (Paul Bame) <bame@debian.org> 263 diff_exponent = result_exponent - right_exponent; in dbl_fadd() 293 /* A straight forward algorithm would now shift the result in dbl_fadd() 310 /* Must have been "x-x" or "x+(-x)". */ in dbl_fadd() 316 result_exponent--; in dbl_fadd() 352 if((result_exponent -= 8) <= 0 && !underflowtrap) in dbl_fadd() 360 if((result_exponent -= 4) <= 0 && !underflowtrap) in dbl_fadd() [all …]
|
/linux/Documentation/filesystems/ |
H A D | seq_file.rst | 1 .. SPDX-License-Identifier: GPL-2.0 10 https://lwn.net/Articles/driver-porting/ 16 Virtual files can provide human-readable output that is easy to get at 23 string. But life gets trickier if the output is long - anything greater 26 position within the virtual file - that position is, likely as not, in the 68 - entry = create_proc_entry("sequence", 0, NULL); 69 - if (entry) 70 - entry->proc_fops = &ct_file_ops; 79 is able to move to a specific position - like the file they implement, 81 in whatever way is convenient - the iterator need only exist [all …]
|
/linux/Documentation/networking/ |
H A D | packet_mmap.rst | 1 .. SPDX-License-Identifier: GPL-2.0 22 - Ulisses Alonso Camaró <uaca@i.hate.spam.alumni.uv.es> 23 - Johann Baudy 67 [setup] socket() -------> creation of the capture socket 68 setsockopt() ---> allocation of the circular buffer (ring) 70 mmap() ---------> mapping of the allocated buffer to the 73 [capture] poll() ---------> to wait for incoming packets 75 [shutdown] close() --------> destruction of the capture socket and 80 socket creation and destruction is straight forward, and is done 88 supported and a link level pseudo-header is provided [all …]
|
/linux/fs/jbd2/ |
H A D | checkpoint.c | 1 // SPDX-License-Identifier: GPL-2.0+ 7 * Copyright 1999 Red Hat Software --- All Rights Reserved 32 transaction_t *transaction = jh->b_cp_transaction; in __buffer_unlink() 34 jh->b_cpnext->b_cpprev = jh->b_cpprev; in __buffer_unlink() 35 jh->b_cpprev->b_cpnext = jh->b_cpnext; in __buffer_unlink() 36 if (transaction->t_checkpoint_list == jh) { in __buffer_unlink() 37 transaction->t_checkpoint_list = jh->b_cpnext; in __buffer_unlink() 38 if (transaction->t_checkpoint_list == jh) in __buffer_unlink() 39 transaction->t_checkpoint_list = NULL; in __buffer_unlink() 46 * Called under j-state_lock *only*. It will be unlocked if we have to wait [all …]
|