Home
last modified time | relevance | path

Searched +full:two +full:- +full:point (Results 1 – 25 of 1394) sorted by relevance

12345678910>>...56

/linux/Documentation/userspace-api/media/mediactl/
H A Dmedia-controller-model.rst1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
3 .. _media-controller-model:
14 - An **entity** is a basic media hardware or software building block.
17 hardware devices (a building block in a System-on-Chip image
20 - An **interface** is a graph representation of a Linux Kernel
24 - A **pad** is a data connection endpoint through which an entity can
30 - A **data link** is a point-to-point oriented connection between two
34 - An **interface link** is a point-to-point bidirectional control
37 - An **ancillary link** is a point-to-point connection denoting that two
/linux/Documentation/maintainer/
H A Dmessy-diffstat.rst1 .. SPDX-License-Identifier: GPL-2.0
4 Handling messy pull-request diffstats
7 Subsystem maintainers routinely use ``git request-pull`` as part of the
17 .. _Linus1: https://lore.kernel.org/lkml/CAHk-=wg3wXH2JNxkQi+eLZkpuxqV+wPiHhw_Jf7ViH33Sw7PHA@mail.g…
18 .. _Linus2: https://lore.kernel.org/lkml/CAHk-=wgXbSa8yq8Dht8at+gxb_idnJ7X5qWZQWRBN4_CUPr=eQ@mail.g…
23 ... vM --- vN-rc1 --- vN-rc2 --- vN-rc3 --- ... --- vN-rc7 --- vN
25 If one wants to see what has changed between two points, a command like
28 $ git diff --stat --summary vN-rc2..vN-rc3
30 Here, there are two clear points in the history; Git will essentially
31 "subtract" the beginning point from the end point and display the resulting
[all …]
/linux/drivers/thermal/
H A Dgov_power_allocator.c1 // SPDX-License-Identifier: GPL-2.0
24 * mul_frac() - multiply two fixed-point numbers
28 * Return: the result of multiplying two fixed-point numbers. The
29 * result is also a fixed-point number.
37 * div_frac() - divide two fixed-point numbers
41 * Return: the result of dividing two fixed-point numbers. The
42 * result is also a fixed-point number.
50 * struct power_actor - internal power information for power actor
66 * struct power_allocator_params - parameters for the power allocator governor
75 * @trip_switch_on: first passive trip point of the thermal zone. The
[all …]
H A DKconfig1 # SPDX-License-Identifier: GPL-2.0-only
26 trip point crossed, cooling device update or governor
47 Say Y to add a debugfs-based thermal core testing facility.
53 int "Emergency poweroff delay in milli-seconds"
61 poweroff kicks in. Similarly to the critical trip point,
121 The Userspace governor allows to get trip point crossed
140 point hysteresis.
145 bool "Fair-share thermal governor"
147 Enable this to manage platform thermals using fair-share governor.
161 Say 'Y' here if you want to use two point temperature regulation
[all …]
/linux/net/l2tp/
H A DKconfig1 # SPDX-License-Identifier: GPL-2.0-only
3 # Layer Two Tunneling Protocol (L2TP)
7 tristate "Layer Two Tunneling Protocol (L2TP)"
12 Layer Two Tunneling Protocol
18 possible to both end-users and applications.
54 Layer Two Tunneling Protocol Version 3
58 The Layer Two Tunneling Protocol (L2TP) provides a dynamic
60 packet-oriented data network (e.g., over IP). L2TP, as
62 tunneling Point-to-Point Protocol (PPP) [RFC1661] sessions.
75 Support for L2TP-over-IP socket family.
[all …]
/linux/Documentation/driver-api/thermal/
H A Dpower_allocator.rst6 -----------
8 The governor works optimally with the following two passive trip points:
10 1. "switch on" trip point: temperature above which the governor
12 point of the thermal zone.
14 2. "desired temperature" trip point: it should be higher than the
15 "switch on" trip point. This the target temperature the governor
16 is controlling for. This is the last passive trip point of the
20 --------------
23 Proportional-Integral-Derivative controller (PID controller) with
29 - e = desired_temperature - current_temperature
[all …]
/linux/arch/m68k/fpsp040/
H A Dslog2.S4 | The entry point slog10 computes the base-10
8 | sLog2 and sLog2d are the base-2 analogues.
10 | INPUT: Double-extended value in memory location pointed to
13 | OUTPUT: log_10(X) or log_2(X) returned in floating-point
22 | SPEED: Two timings are measured, both in the copy-back mode.
34 | Notes: Default means round-to-nearest mode, no floating-point
49 | Notes: Default means round-to-nearest mode, no floating-point
63 | Notes: Default means round-to-nearest mode, no floating-point
78 | Notes: Default means round-to-nearest mode, no floating-point
81 | Step 1. If X is not an integer power of two, i.e., X != 2^k,
[all …]
/linux/Documentation/devicetree/bindings/phy/
H A Dapm,xgene-phy.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
4 $id: http://devicetree.org/schemas/phy/apm,xgene-phy.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
7 title: APM X-Gene 15Gbps Multi-purpose PHY
10 - Khuong Dinh <khuong@os.amperecomputing.com>
13 PHY nodes are defined to describe on-chip 15Gbps Multi-purpose PHY. Each
19 - const: apm,xgene-phy
24 '#phy-cells':
32 apm,tx-eye-tuning:
[all …]
/linux/arch/xtensa/lib/
H A Dstrnlen_user.S50 addi a4, a2, -4 # because we overincrement at the end;
56 bbsi.l a2, 0, .L1mod2 # if only 8-bit aligned
57 bbsi.l a2, 1, .L2mod4 # if only 16-bit aligned
60 * String is word-aligned.
86 # check two more bytes (bytes 0, 1 of word)
101 # NOTE that in several places below, we point to the byte just after
105 addi a4, a4, 3 # point to zero byte
107 addi a4, a4, 1 # point just beyond zero byte
111 addi a4, a4, 1+1 # point just beyond zero byte
115 addi a4, a4, 2+1 # point just beyond zero byte
[all …]
/linux/arch/m68k/ifpsp060/
H A Diskeleton.S3 |M68000 Hi-Performance Microprocessor Division
5 |Production Release P1.00 -- October 10, 1994
32 | (1) example "Call-out"s
34 | (3) example "Call-out" table
39 #include <asm/asm-offsets.h>
43 | (1) EXAMPLE CALL-OUTS #
58 | This is and example main exit point for the Unimplemented Integer
61 | can do any clean-up desired. The stack frame is the
84 | This is an alternate exit point for the Unimplemented Integer
119 | This is an alternate exit point for the Unimplemented Integer
[all …]
/linux/tools/perf/pmu-events/arch/powerpc/power10/
H A Dfloating_point.json5 …"BriefDescription": "Floating Point Operations Completed. Includes any type. It counts once for ea…
10 …"BriefDescription": "One floating point instruction completed (fadd, fmul, fsub, fcmp, fsel, fabs,…
15 …"BriefDescription": "Four floating point instruction completed (fadd, fmul, fsub, fcmp, fsel, fabs…
20 …"BriefDescription": "Two floating point instruction completed (FMA class of instructions: fmadd, f…
25 "BriefDescription": "Scalar floating point instruction completed."
30 "BriefDescription": "Single Precision floating point instruction completed."
35 "BriefDescription": "Math floating point instruction completed."
55 "BriefDescription": "Vector floating point instruction completed."
65 "BriefDescription": "Double-Precision or Quad-Precision instruction completed."
/linux/Documentation/virt/kvm/x86/
H A Dmmu.rst1 .. SPDX-License-Identifier: GPL-2.0
13 - correctness:
18 - security:
21 - performance:
23 - scaling:
25 - hardware:
27 - integration:
31 - dirty tracking:
33 and framebuffer-based displays
34 - footprint:
[all …]
/linux/fs/xfs/
H A Dxfs_extfree_item.h1 // SPDX-License-Identifier: GPL-2.0
27 * an EFI is born with two references:
37 * the EFD reference under all circumstances to this point. The caller has no
39 * Therefore, an EFD is required after this point, even in the event of
42 * Once an EFD is allocated and dirtied in a transaction, reference two
46 * AIL, so at this point both the EFI and EFD are freed.
/linux/drivers/md/dm-vdo/
H A Dencodings.h1 /* SPDX-License-Identifier: GPL-2.0-only */
20 * An in-memory representation of a version number for versioned structures on disk.
22 * A version number consists of two portions, a major version and a minor version. Any format
34 * A packed, machine-independent, on-disk representation of a version_number. Both fields are
35 * stored in little-endian byte order.
57 /* A packed, machine-independent, on-disk representation of a component header. */
127 * in both the on-disk and in-memory layouts. It consists of the 36 low-order bits of a
128 * physical_block_number_t (addressing 256 terabytes with a 4KB block size) and a 4-bit encoding of
131 * Of the 8 high bits of the 5-byte structure:
133 * Bits 7..4: The four highest bits of the 36-bit physical block number
[all …]
/linux/include/linux/
H A Dfixp-arith.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
9 * Simplistic fixed-point arithmetics.
18 * e-mail - mail your message to <johann.deneux@gmail.com>
47 * The returned value ranges from -0x7fffffff to +0x7fffffff.
56 degrees -= 180; in __fixp_sin32()
59 degrees = 180 - degrees; in __fixp_sin32()
63 return negative ? -ret : ret; in __fixp_sin32()
71 * The returned value ranges from -0x7fffffff to +0x7fffffff.
86 * The returned value ranges from -0x7fff to 0x7fff
93 * fixp_sin32_rad() - calculates the sin of an angle in radians
[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 …]
H A Dppp_generic.rst1 .. SPDX-License-Identifier: GPL-2.0
12 The generic PPP driver in linux-2.4 provides an implementation of the
43 ---------------
49 Each channel has to provide two functions to the generic PPP layer,
54 flow-control reasons. In this case, start_xmit() should return 0
60 * ioctl() provides an interface which can be used by a user-space
62 procedure will be called when a user-space program does an ioctl
90 (e.g. an ioctl) to transmit this back to user-space, as user-space
94 interface to which this channel is connected, or -1 if the channel
99 expected to have some way for a user-level process to control it
[all …]
H A Dplip.rst1 .. SPDX-License-Identifier: GPL-2.0
10 At some point T. Thorn will probably contribute text,
14 -----------------
17 This device interface allows a point-to-point connection between two
25 printer port. PLIP is a non-standard, but [can use] uses the standard
26 LapLink null-printer cable [can also work in turbo mode, with a PLIP
35 The PLIP cable is all that's needed to connect two Linux boxes, and it
38 Connecting two Linux boxes takes only a second's decision and a few
62 -------------------
77 On these machines, the PLIP driver can be used in IRQ-less mode, where
[all …]
/linux/Documentation/core-api/
H A Dpadata.rst1 .. SPDX-License-Identifier: GPL-2.0
23 ------------
43 ------------------
45 The CPUs used to run jobs can be changed in two ways, programmatically with
58 live in /sys/kernel/pcrypt/<instance-name>. Within an instance's directory
59 there are two files, parallel_cpumask and serial_cpumask, and either cpumask
64 Reading one of these files shows the user-supplied cpumask, which may be
67 Padata maintains two pairs of cpumasks internally, the user-supplied cpumasks
69 cpumask.) The user-supplied cpumasks default to all possible CPUs on instance
71 subset of the user-supplied cpumasks and contain only the online CPUs in the
[all …]
/linux/Documentation/driver-api/media/
H A Dmc-core.rst1 .. SPDX-License-Identifier: GPL-2.0
4 ------------------------
11 on the kernel-side implementation of the media framework.
24 in a System-on-Chip image processing pipeline), DMA channels or physical
32 A link is a point-to-point oriented connection between two pads, either
40 instance, defined in ``include/media/media-device.h``.
42 embedding the :c:type:`media_device` instance in a larger driver-specific
60 instance, defined in ``include/media/media-entity.h``. The structure is usually
61 embedded into a higher-level structure, such as
78 ``include/media/media-entity.h``. Currently, only one type of interface is
[all …]
/linux/include/drm/
H A Ddrm_rect.h2 * Copyright (C) 2011-2013 Intel Corporation
37 * struct drm_rect - two dimensional rectangle
51 * DRM_RECT_INIT - initialize a rectangle from x/y/w/h
67 * DRM_RECT_FMT - printf string for &struct drm_rect
71 * DRM_RECT_ARG - printf arguments for &struct drm_rect
74 #define DRM_RECT_ARG(r) drm_rect_width(r), drm_rect_height(r), (r)->x1, (r)->y1
77 * DRM_RECT_FP_FMT - printf string for &struct drm_rect in 16.16 fixed point
81 * DRM_RECT_FP_ARG - printf arguments for &struct drm_rect in 16.16 fixed point
85 * fixed point.
90 (r)->x1 >> 16, (((r)->x1 & 0xffff) * 15625) >> 10, \
[all …]
/linux/include/net/
H A Dred.h1 /* SPDX-License-Identifier: GPL-2.0 */
22 ------------------
26 avg = (1-W)*avg + W*current_queue_len,
28 W is the filter time constant (chosen as 2^(-Wlog)), it controls
32 if (avg > th_max) -> packet marked (dropped).
33 if (avg < th_min) -> packet passes.
36 Pb = max_P * (avg - th_min)/(th_max-th_min)
42 max_P is chosen as a number, so that max_P/(th_max-th_min)
43 is a negative power of two in order arithmetic to contain
48 -----------------------------
[all …]
/linux/tools/include/linux/
H A Dlist.h1 /* SPDX-License-Identifier: GPL-2.0 */
17 * using the generic single-entry routines.
27 list->next = list; in INIT_LIST_HEAD()
28 list->prev = list; in INIT_LIST_HEAD()
32 * Insert a new entry between two known consecutive entries.
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
44 new->prev = prev; in __list_add()
45 prev->next = new; in __list_add()
54 * list_add - add a new entry
[all …]
/linux/net/x25/
H A DKconfig1 # SPDX-License-Identifier: GPL-2.0-only
11 entry point can carry several logical point-to-point connections
15 countries have public X.25 networks. X.25 consists of two
22 <file:Documentation/networking/x25-iface.rst>.
/linux/Documentation/scheduler/
H A Dsched-util-clamp.rst1 .. SPDX-License-Identifier: GPL-2.0
22 point; hence the name. That is, by clamping utilization we are making the
23 system run at a certain performance point.
26 performance constraints. It consists of two tunables:
31 These two bounds will ensure a task will operate within this performance range
36 performance point to operate at to deliver the desired user experience. Or one
38 much resources and should not go above a specific performance point. Viewing
40 abstraction from user space point of view.
44 performance point required by its display pipeline to ensure no frame is
57 foreground, top-app, etc. Util clamp can be used to constrain how much
[all …]

12345678910>>...56