Home
last modified time | relevance | path

Searched +full:left +full:- +full:shifted (Results 1 – 25 of 177) sorted by relevance

12345678

/Linux-v6.1/fs/reiserfs/
Dfix_node.c15 * will shift to left/right neighbor, or to a new node, where new item
23 * have to have if we do not any shiftings, if we shift to left/right
39 "vs-8005: for INSERT mode and item number of inserted item"); in old_item_num()
41 return new_num - 1; in old_item_num()
45 "vs-8010: old_item_num: mode must be M_DELETE (mode = \'%c\'", in old_item_num()
54 struct virtual_node *vn = tb->tb_vn; in create_virtual_node()
56 struct buffer_head *Sh; /* this comes from tb->S[h] */ in create_virtual_node()
58 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
61 vn->vn_size = in create_virtual_node()
62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
[all …]
/Linux-v6.1/Documentation/devicetree/bindings/i3c/
Di3c.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Alexandre Belloni <alexandre.belloni@bootlin.com>
11 - Miquel Raynal <miquel.raynal@bootlin.com>
20 pattern: "^i3c-master@[0-9a-f]+$"
22 "#address-cells":
39 "#size-cells":
42 i3c-scl-hz:
49 i2c-scl-hz:
[all …]
/Linux-v6.1/include/media/
Ddvb_math.h2 * dvb-math provides some complex fixed-point math
24 * intlog2 - computes log2 of a value; the result is shifted left by 24 bits
30 * intlog2(value) = intlog2(value * 2^x) - x * 2^24
38 * intlog2(1.5) = intlog2(3) - 2^24 = 0.584... * 2^24
46 * intlog10 - computes log10 of a value; the result is shifted left by 24 bits
52 * intlog10(value) = intlog10(value * 10^x) - x * 2^24
/Linux-v6.1/include/linux/
Dtimekeeper_internal.h1 /* SPDX-License-Identifier: GPL-2.0 */
15 * struct tk_read_base - base structure for timekeeping readout
21 * @xtime_nsec: Shifted (fractional) nano seconds offset for readout
46 * struct timekeeper - Structure holding internal timekeeping values.
52 * @offs_real: Offset clock monotonic -> clock realtime
53 * @offs_boot: Offset clock monotonic -> clock boottime
54 * @offs_tai: Offset clock monotonic -> clock tai
58 * @next_leap_ktime: CLOCK_MONOTONIC time value of a pending leap-second
62 * @xtime_interval: Number of clock shifted nano seconds in one NTP
64 * @xtime_remainder: Shifted nano seconds left over when rounding
[all …]
Doverflow.h1 /* SPDX-License-Identifier: GPL-2.0 OR MIT */
14 * #define type_min(T) (T)(is_signed_type(T) ? (T)1 << (8*sizeof(T)-1) : 0)
15 * #define type_max(T) (T)(is_signed_type(T) ? ((T)1 << (8*sizeof(T)-1)) - 1 : ~(T)0)
19 * the type_max expression (but not if -fsanitize=undefined is in
25 * a-feature-not-a-bug, since people shouldn't be doing arithmetic on
30 * https://mail-index.netbsd.org/tech-misc/2007/02/05/0000.html -
33 #define __type_half_max(type) ((type)1 << (8*sizeof(type) - 1 - is_signed_type(type)))
34 #define type_max(T) ((T)((__type_half_max(T) - 1) + __type_half_max(T)))
35 #define type_min(T) ((T)((T)-type_max(T)-(T)1))
38 * Avoids triggering -Wtype-limits compilation warning,
[all …]
/Linux-v6.1/include/uapi/linux/
Dinet_diag.h1 /* SPDX-License-Identifier: GPL-2.0 WITH Linux-syscall-note */
72 #define INET_DIAG_REQ_MAX (__INET_DIAG_REQ_MAX - 1)
167 #define INET_DIAG_MAX (__INET_DIAG_MAX - 1)
176 #define INET_ULP_INFO_MAX (__INET_ULP_INFO_MAX - 1)
226 /* u64 bw: max-filtered BW (app throughput) estimate in Byte per sec: */
229 __u32 bbr_min_rtt; /* min-filtered RTT in uSec */
230 __u32 bbr_pacing_gain; /* pacing gain shifted left 8 bits */
231 __u32 bbr_cwnd_gain; /* cwnd gain shifted left 8 bits */
/Linux-v6.1/arch/alpha/lib/
Dstxncpy.S1 /* SPDX-License-Identifier: GPL-2.0 */
6 * Copy no more than COUNT bytes of the null-terminated string from
27 * a2 = the number of full words left in COUNT
29 * Furthermore, v0, a3-a5, t11, and $at are untouched.
55 lda t2, -1 # e1 : build a mask against false zero
79 the end-of-count bit is set in t8 iff it applies.
107 /* Add the end-of-count bit to the eos detection bitmask. */
121 /* Are source and destination co-aligned? */
128 srl a2, 3, a2 # e0 : a2 = loop counter = (count - 1)/8
133 /* We are co-aligned; take care of a partial first word. */
[all …]
Dev6-stxncpy.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 * arch/alpha/lib/ev6-stxncpy.S
4 * 21264 version contributed by Rick Gorton <rick.gorton@api-networks.com>
6 * Copy no more than COUNT bytes of the null-terminated string from
27 * a2 = the number of full words left in COUNT
29 * Furthermore, v0, a3-a5, t11, and $at are untouched.
34 * ftp.digital.com/pub/Digital/info/semiconductor/literature/dsc-library.html
36 * E - either cluster
37 * U - upper subcluster; U0 - subcluster U0; U1 - subcluster U1
38 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
[all …]
/Linux-v6.1/arch/parisc/math-emu/
Dsfsub.c1 // 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>
42 register unsigned int left, right, result, extent; in sgl_fsub() local
50 left = *leftptr; in sgl_fsub()
55 Sgl_xortointp1(left,right,/*to*/save); in sgl_fsub()
60 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) in sgl_fsub()
62 if (Sgl_iszero_mantissa(left)) in sgl_fsub()
80 *dstptr = left; in sgl_fsub()
[all …]
Dsfadd.c1 // 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>
42 register unsigned int left, right, result, extent; in sgl_fadd() local
52 left = *leftptr; in sgl_fadd()
57 Sgl_xortointp1(left,right,/*to*/save); in sgl_fadd()
62 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) in sgl_fadd()
64 if (Sgl_iszero_mantissa(left)) in sgl_fadd()
82 *dstptr = left; in sgl_fadd()
[all …]
Ddfadd.c1 // 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>
117 } /* End left NaN or Infinity processing */ in dbl_fadd()
156 /* Set the left operand to the larger one by XOR swap * in dbl_fadd()
163 /* Invariant: left is not smaller than right. */ in dbl_fadd()
185 /* Left is not a zero and must be the result. Trapped in dbl_fadd()
186 * underflows are signaled if left is denormalized. Result in dbl_fadd()
263 diff_exponent = result_exponent - right_exponent; in dbl_fadd()
[all …]
Ddfsub.c1 // 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>
117 } /* End left NaN or Infinity processing */ in dbl_fsub()
157 /* Set the left operand to the larger one by XOR swap * in dbl_fsub()
165 /* Invariant: left is not smaller than right. */ in dbl_fsub()
188 /* Left is not a zero and must be the result. Trapped in dbl_fsub()
189 * underflows are signaled if left is denormalized. Result in dbl_fsub()
266 diff_exponent = result_exponent - right_exponent; in dbl_fsub()
[all …]
Dfmpyfadd.c1 // 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>
15 * Double Floating-point Multiply Fused Add
16 * Double Floating-point Multiply Negate Fused Add
17 * Single Floating-point Multiply Fused Add
18 * Single Floating-point Multiply Negate Fused Add
41 * Double Floating-point Multiply Fused Add
77 mpy_exponent = Dbl_exponent(opnd1p1) + Dbl_exponent(opnd2p1) - DBL_BIAS; in dbl_fmpyfadd()
[all …]
/Linux-v6.1/arch/x86/kernel/
Dcrash_dump_32.c1 // SPDX-License-Identifier: GPL-2.0
19 * non-PAE kdump kernel executed from a PAE one will crop high pte in is_crashed_pfn_valid()
22 * test checks high 12 bits for being zero (pfn will be shifted left in is_crashed_pfn_valid()
40 return -EFAULT; in copy_oldmem_page()
/Linux-v6.1/drivers/net/wireless/broadcom/brcm80211/brcmsmac/phy/
Dphy_qmath.c1 // SPDX-License-Identifier: ISC
11 * shifted by 16 bits.
21 * result is right shifted by 15 bits. Right shifting 15 bits instead of 16 bits
81 s32 temp = (s32) op1 - (s32) op2; in qm_sub16()
93 * Description: This function make a 32 bit saturated left shift when the
95 * the specified shift is -ve. This function return the result after shifting
105 else if (shift < -31) in qm_shl32()
106 shift = -31; in qm_shl32()
111 result = result >> (-shift); in qm_shl32()
118 * Description: This function make a 16 bit saturated left shift when the
[all …]
/Linux-v6.1/arch/arm/mm/
Dcache-v7.S1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * linux/arch/arm/mm/cache-v7.S
15 #include <asm/hardware/cache-b15-rac.h>
17 #include "proc-macros.S"
49 mov r3, r3, lsl r1 @ NumWays-1 shifted into bits [31:...]
50 movs r1, r2, lsl r1 @ #1 shifted left by same amount
62 subs r0, r0, #1 @ Set--
64 subs r3, r3, r1 @ Way--
66 mrc p15, 1, r0, c0, c0, 0 @ re-read cache geometry from CCSIDR
76 * Flush the whole I-cache.
[all …]
/Linux-v6.1/lib/mpi/
Dgeneric_mpih-lshift.c1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* mpihelp-lshift.c - MPI helper functions
16 #include "mpi-internal.h"
18 /* Shift U (pointed to by UP and USIZE digits long) CNT bits to the left
20 * Return the bits shifted out from the most significant digit.
37 sh_2 = BITS_PER_MPI_LIMB - sh_1; in mpihelp_lshift()
38 i = usize - 1; in mpihelp_lshift()
42 while (--i >= 0) { in mpihelp_lshift()
Dmpi-div.c1 /* mpi-div.c - MPI functions
14 #include "mpi-internal.h"
22 int divisor_sign = divisor->sign; in mpi_fdiv_r()
36 if (((divisor_sign?1:0) ^ (dividend->sign?1:0)) && rem->nlimbs) in mpi_fdiv_r()
52 int divisor_sign = divisor->sign; in mpi_fdiv_qr()
62 if ((divisor_sign ^ dividend->sign) && rem->nlimbs) { in mpi_fdiv_qr()
87 mpi_size_t nsize = num->nlimbs; in mpi_tdiv_qr()
88 mpi_size_t dsize = den->nlimbs; in mpi_tdiv_qr()
90 mpi_size_t sign_remainder = num->sign; in mpi_tdiv_qr()
91 mpi_size_t sign_quotient = num->sign ^ den->sign; in mpi_tdiv_qr()
[all …]
/Linux-v6.1/drivers/media/i2c/
Dtda7432.c1 // SPDX-License-Identifier: GPL-2.0
3 * For the STS-Thompson TDA7432 audio processor chip
18 * debug - set to 1 if you'd like to see debug messages
21 * loudness - set between 0 and 15 for varying degrees of loudness effect
23 * maxvol - set maximum volume to +20db (1), default is 0db(0)
37 #include <media/v4l2-device.h>
38 #include <media/v4l2-ioctl.h>
39 #include <media/v4l2-ctrls.h>
84 return &container_of(ctrl->handler, struct tda7432, hdl)->sd; in to_sd()
87 /* The TDA7432 is made by STS-Thompson
[all …]
/Linux-v6.1/arch/arm/nwfpe/
Dsoftfloat-macros5 This C source fragment is part of the SoftFloat IEC/IEEE Floating-point
11 National Science Foundation under grant MIP-9311980. The original version
12 of this code was written as part of a project to build a fixed-point vector
16 http://www.jhauser.us/arithmetic/SoftFloat-2b/SoftFloat-source.txt
33 -------------------------------------------------------------------------------
35 bits are shifted off, they are ``jammed'' into the least significant bit of
40 -------------------------------------------------------------------------------
49 z = ( a>>count ) | ( ( a<<( ( - count ) & 31 ) ) != 0 );
58 -------------------------------------------------------------------------------
60 bits are shifted off, they are ``jammed'' into the least significant bit of
[all …]
/Linux-v6.1/arch/mips/include/asm/sibyte/
Dsb1250_defs.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
24 * 'long long' (64-bit integer) support.
122 ((SIBYTE_HDR_FMASK(chip, pass) - 1) & SIBYTE_HDR_FMASK_ALLREVS(chip))
127 | (SIBYTE_HDR_FMASK(chip, pass) - 1)) & SIBYTE_HDR_FMASK_ALLREVS(chip))
159 * For multi-bit fields, all bits in the field will
162 * K_xxx "Code" constant (value for data in a multi-bit
167 * shifted to the correct position in the register.
170 * a field value (code) needs to be shifted
171 * (towards the left) to put the value in the right
182 * G_xxx(X) GET value. This macro obtains a multi-bit field
[all …]
/Linux-v6.1/arch/m68k/fpsp040/
Dbinstr.S5 | Description: Converts a 64-bit binary integer to bcd.
7 | Input: 64-bit binary integer in d2:d3, desired length (LEN) in
12 | Output: LEN bcd digits representing the 64-bit integer.
15 | The 64-bit binary is assumed to have a decimal point before
17 | shift and a mul by 8 shift. The bits shifted out of the
28 | A3. Multiply the fraction in d2:d3 by 8 using bit-field
35 | A5. Add using the carry the 64-bit quantities in d2:d3 and d4:d5
38 | A6. Test d7. If zero, the digit formed is the ms digit. If non-
51 | d2: upper 32-bits of fraction for mul by 8
52 | d3: lower 32-bits of fraction for mul by 8
[all …]
/Linux-v6.1/arch/x86/math-emu/
Dreg_u_sub.S1 /* SPDX-License-Identifier: GPL-2.0 */
3 /*---------------------------------------------------------------------------+
10 | E-mail billm@suburbia.net |
15 | Return value is the tag of the answer, or-ed with FPU_Exception if |
16 | one was raised, or -1 on internal error. |
18 +---------------------------------------------------------------------------*/
47 subl PARAM7,%ecx /* exp1 - exp2 */
60 /*--------------------------------------+
63 +--------------------------------------*/
73 /*--------------------------------------+
[all …]
/Linux-v6.1/arch/parisc/include/asm/
Dhash.h1 /* SPDX-License-Identifier: GPL-2.0 */
6 * HP-PA only implements integer multiply in the FPU. However, for
7 * integer multiplies by constant, it has a number of shift-and-add
8 * (but no shift-and-subtract, sigh!) instructions that a compiler
20 * PA7100 pairing rules. This is an in-order 2-way superscalar processor.
22 * but other than that, simple ALU ops (including shift-and-add by up
25 * PA8xxx processors also dual-issue ALU instructions, although with
28 * This 6-step sequence was found by Yevgen Voronenko's implementation
43 /* Phase 2: Return (b<<11) + (c<<6) + (a<<3) - c */ in __hash_32()
45 a += c << 3; b -= c; in __hash_32()
[all …]
/Linux-v6.1/arch/x86/crypto/
Dcrct10dif-pcl-asm_64.S2 # Implement fast CRC-T10DIF computation with SSE and PCLMULQDQ instructions
50 # /white-papers/fast-crc-computation-generic-polynomials-pclmulqdq-paper.pdf
137 # While >= 128 data bytes remain (not counting xmm0-7), fold the 128
138 # bytes xmm0-7 into them, storing the result back into xmm0-7.
148 # Now fold the 112 bytes in xmm0-xmm6 into the 16 bytes in xmm7.
168 add $128-16, len
201 movdqu -16(buf, len), %xmm1
204 # xmm2 = high order part of second chunk: xmm7 left-shifted by 'len' bytes.
210 # xmm7 = first chunk: xmm7 right-shifted by '16-len' bytes.
214 # xmm1 = second chunk: 'len' bytes from xmm1 (low-order bytes),
[all …]

12345678