Home
last modified time | relevance | path

Searched +full:v +full:- +full:bit (Results 1 – 25 of 1103) sorted by relevance

12345678910>>...45

/freebsd-src/sys/opencrypto/
H A Dgfmult.h1 /*-
4 * This software was developed by John-Mark Gurney under
51 * are bit reversed to make accesses quicker.
54 uint32_t a[16] __aligned(REQ_ALIGN); /* bits 0 - 31 */
55 uint32_t b[16] __aligned(REQ_ALIGN); /* bits 63 - 32 */
56 uint32_t c[16] __aligned(REQ_ALIGN); /* bits 95 - 64 */
57 uint32_t d[16] __aligned(REQ_ALIGN); /* bits 127 - 96 */
68 * GCM per spec is bit reversed in memory. So byte 0 is really bit reversed
69 * and contains bits 0-7. We can deal w/ this by using right shifts and
70 * related math instead of having to bit reverse everything. This means that
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/ARM/MCTargetDesc/
H A DARMAddressingModes.h1 //===-- ARMAddressingModes.h - ARM Addressing Modes -------
166 isSOImmTwoPartVal(unsigned V) isSOImmTwoPartVal() argument
179 getSOImmTwoPartFirst(unsigned V) getSOImmTwoPartFirst() argument
185 getSOImmTwoPartSecond(unsigned V) getSOImmTwoPartSecond() argument
198 isSOImmTwoPartValNeg(unsigned V) isSOImmTwoPartValNeg() argument
221 isThumbImmShiftedVal(unsigned V) isThumbImmShiftedVal() argument
240 isThumbImm16ShiftedVal(unsigned V) isThumbImm16ShiftedVal() argument
248 getThumbImmNonShiftedVal(unsigned V) getThumbImmNonShiftedVal() argument
262 getT2SOImmValSplatVal(unsigned V) getT2SOImmValSplatVal() argument
290 getT2SOImmValRotateVal(unsigned V) getT2SOImmValRotateVal() argument
321 getT2SOImmValRotate(unsigned V) getT2SOImmValRotate() argument
329 unsigned V = Imm; isT2SOImmTwoPartVal() local
359 unsigned V = llvm::rotr<uint32_t>(~255, getT2SOImmValRotate(Imm)) & Imm; getT2SOImmTwoPartFirst() local
[all...]
/freebsd-src/sys/compat/linuxkpi/common/include/linux/
H A Dieee80211.h1 /*-
2 * Copyright (c) 2020-2024 The FreeBSD Foundation
49 /* 9.4.2.55 Management MIC element (CMAC-256, GMAC-128, and GMAC-256). */
70 #define IEEE80211_INVAL_HW_QUEUE ((uint8_t)-1)
79 #define IEEE80211_MAX_MPDU_LEN_HT_BA 4095 /* 9.3.2.1 Format of Data frames; non-VHT non-DMG STA */
90 /* Wi-Fi Peer-t
707 __le16 v; ieee80211_is_ctl() local
719 __le16 v; ieee80211_is_data() local
731 __le16 v; ieee80211_is_data_qos() local
743 __le16 v; ieee80211_is_mgmt() local
795 __le16 v; ieee80211_is_trigger() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DBitTracker.h1 //===- BitTracker.h ---------------------------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
125 // Abstraction of a reference to bit at position Pos from a register Reg.
150 // Value that a single bit can take. This is outside of the context of
151 // any register, it is more of an abstraction of the two-element set of
152 // possible bit values. One extension here is the "Ref" type, which
153 // indicates that this bit takes the same value as the bit described by
157 Top, // Bit not yet defined.
158 Zero, // Bit = 0.
[all …]
/freebsd-src/sys/compat/linuxkpi/common/include/net/
H A Dmac80211.h1 /*-
2 * Copyright (c) 2020-2024 The FreeBSD Foundation
3 * Copyright (c) 2020-2022 Bjoern A. Zeeb
55 /* hw->conf.flags */
57 IEEE80211_CONF_IDLE = BIT(0),
58 IEEE80211_CONF_PS = BIT(1),
59 IEEE80211_CONF_MONITOR = BIT(2),
60 IEEE80211_CONF_OFFCHANNEL = BIT(3),
63 /* (*ops->config()) */
65 IEEE80211_CONF_CHANGE_CHANNEL = BIT(
1266 __le16 v; ieee80211_is_action() local
1277 __le16 v; ieee80211_is_probe_resp() local
1288 __le16 v; ieee80211_is_auth() local
1299 __le16 v; ieee80211_is_assoc_req() local
1310 __le16 v; ieee80211_is_assoc_resp() local
1321 __le16 v; ieee80211_is_reassoc_req() local
1332 __le16 v; ieee80211_is_reassoc_resp() local
1343 __le16 v; ieee80211_is_disassoc() local
1354 __le16 v; ieee80211_is_data_present() local
1366 __le16 v; ieee80211_is_deauth() local
1377 __le16 v; ieee80211_is_beacon() local
1394 __le16 v; ieee80211_is_probe_req() local
1412 __le16 v; ieee80211_is_back_req() local
1449 __le16 v; ieee80211_is_nullfunc() local
1460 __le16 v; ieee80211_is_qos_nullfunc() local
1478 __le16 v; ieee80211_is_pspoll() local
1538 __le16 v; ieee80211_has_a4() local
[all...]
/freebsd-src/sys/contrib/dpdk_rte_lpm/
H A Drte_common.h1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2010-2019 Intel Corporation
11 * Generic, commonly-used macro and inline function definitions
107 * Check format string and its arguments at compile-time.
109 * GCC on Windows assumes MS-specific format string by default,
110 * even if the underlying stdio implementation is ANSI-compliant,
207 * add a byte-value offset to a pointer
212 * subtract a byte-value offset from a pointer
214 #define RTE_PTR_SUB(ptr, x) ((void*)((uintptr_t)ptr - (x)))
221 #define RTE_PTR_DIFF(ptr1, ptr2) ((uintptr_t)(ptr1) - (uintptr_t)(ptr2))
[all …]
/freebsd-src/sys/dev/sound/pcm/
H A Dfeeder_rate.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2005-2009 Ariff Abdullah <ariff@FreeBSD.org>
36 * - http://ccrma.stanford.edu/~jos/resample/
39 * + all out fixed point integer operations, no soft-float or anything like
48 * - The z, z_, and Z_ . Due to mental block (or maybe just 0x7a69), I
114 #define Z_FACTOR_SAFE(v) (!(( argument
322 Z_DIV(uint64_t v,uint32_t d) Z_DIV() argument
345 _Z_GY2GX(i,a,v) global() argument
349 _Z_GX2GY(i,a,v) global() argument
355 z_gy2gx(i,v) global() argument
356 z_gx2gy(i,v) global() argument
378 z_align(i,v) global() argument
379 z_next(i,o,v) global() argument
380 z_prev(i,o,v) global() argument
412 z_roundpow2(int32_t v) z_roundpow2() argument
462 Z_DECLARE_LINEAR(SIGN,BIT,ENDIAN) global() argument
498 Z_CLIP_CHECK(v,BIT) global() argument
511 Z_CLAMP(v,BIT) global() argument
521 _Z_SINC_ACCUMULATE(SIGN,BIT,ENDIAN,adv) global() argument
546 Z_DECLARE_SINC(SIGN,BIT,ENDIAN) global() argument
587 Z_DECLARE_SINC_POLYPHASE(SIGN,BIT,ENDIAN) global() argument
626 Z_DECLARE(SIGN,BIT,ENDIAN) global() argument
663 Z_RESAMPLER_ENTRY(SIGN,BIT,ENDIAN) global() argument
[all...]
H A Dfeeder_volume.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2005-2009 Ariff Abdullah <ariff@FreeBSD.org>
45 #define FEEDVOLUME_CALC8(s, v) (SND_VOL_CALC_SAMPLE((intpcm_t) \ argument
46 (s) << 8, v) >> 8)
47 #define FEEDVOLUME_CALC16(s, v) SND_VOL_CALC_SAMPLE((intpcm_t)(s), v) argument
48 #define FEEDVOLUME_CALC24(s, v) SND_VOL_CALC_SAMPLE((intpcm64_t)(s), v) argument
49 #define FEEDVOLUME_CALC32(s, v) SND_VOL_CALC_SAMPLE((intpcm64_t)(s), v) argument
51 #define FEEDVOLUME_DECLARE(SIGN, BIT, ENDIAN) \ argument
53 feed_volume_##SIGN##BIT##ENDIAN(int *vol, int *matrix, \
[all …]
H A Dfeeder_eq.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2008-2009 Ariff Abdullah <ariff@FreeBSD.org>
34 * by Robert Bristow-Johnson <rbj@audioimagination.com>
35 * - http://www.musicdsp.org/files/Audio-EQ-Cookboo
56 FEEDEQ_L2GAIN(v) global() argument
86 FEEDEQ_PREAMP2IDX(v) global() argument
129 FEEDEQ_ERR_CLIP_CHECK(t,v) global() argument
138 FEEDEQ_CLAMP(v) global() argument
142 FEEDEQ_DECLARE(SIGN,BIT,ENDIAN) global() argument
235 FEEDEQ_ENTRY(SIGN,BIT,ENDIAN) global() argument
[all...]
/freebsd-src/contrib/bearssl/src/int/
H A Di31_montmul.c34 * d <- (d + xu*y + f*m) / 2^31 in br_i31_montymul()
35 * We have xu <= 2^31-1 and f <= 2^31-1. in br_i31_montymul()
36 * Thus, if d <= 2*m-1 on input, then: in br_i31_montymul()
37 * 2*m-1 + 2*(2^31-1)*m <= (2^32)*m-1 in br_i31_montymul()
40 * We represent d over 31-bit words, with an extra word 'dh' in br_i31_montymul()
43 size_t len, len4, u, v; in br_i31_montymul() local
53 * d[v+1] <= 2^31-1 in br_i31_montymul()
54 * xu*y[v+1] <= (2^31-1)*(2^31-1) in br_i31_montymul()
55 * f*m[v+1] <= (2^31-1)*(2^31-1) in br_i31_montymul()
56 * r <= 2^32-1 in br_i31_montymul()
[all …]
H A Di62_modpow2.c32 * Compute x*y+v1+v2. Operands are 64-bit, and result is 128-bit, with
44 * Compute x1*y1+x2*y2+v1+v2. Operands are 64-bit, and result is 128-bit,
128 ctl32 = -ctl32; in i62_sub()
135 dw = aw - bw - cc; in i62_sub()
144 * Montgomery multiplication, over arrays of 62-bit values. The
146 * (x, y and m). All arrays are in little-endian format (least
156 num4 = 1 + ((num - 1) & ~(size_t)3); in montymul()
160 size_t v; in montymul() local
171 for (v = 1; v < num4; v += 4) { in montymul()
172 FMA2(hi, lo, xu, y[v + 0], in montymul()
[all …]
H A Di31_mulacc.c38 * We want to add the two bit lengths, but these are encoded, in br_i31_mulacc()
43 d[0] = (dh << 5) + dl + (~(uint32_t)(dl - 31) >> 31); in br_i31_mulacc()
47 size_t v; in br_i31_mulacc() local
51 * 32-bit register on 32-bit architectures (on a 64-bit in br_i31_mulacc()
53 * clearing the high bits, which is not free; on a 32-bit in br_i31_mulacc()
65 for (v = 0; v < alen; v ++) { in br_i31_mulacc()
68 z = (uint64_t)d[1 + u + v] + MUL31(f, a[1 + v]) + cc; in br_i31_mulacc()
70 d[1 + u + v] = (uint32_t)z & 0x7FFFFFFF; in br_i31_mulacc()
/freebsd-src/sys/dev/altera/jtag_uart/
H A Daltera_jtag_uart_cons.c
/freebsd-src/contrib/llvm-project/clang/include/clang/Basic/
H A DBuiltinsRISCV.def
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DLegacyLegalizerInfo.h1 //===- llvm/CodeGen/GlobalISel/LegacyLegalizerInfo.h ---------
210 unsupportedForDifferentSizes(const SizeAndActionsVec & v) unsupportedForDifferentSizes() argument
221 widenToLargerTypesAndNarrowToLargest(const SizeAndActionsVec & v) widenToLargerTypesAndNarrowToLargest() argument
231 widenToLargerTypesUnsupportedOtherwise(const SizeAndActionsVec & v) widenToLargerTypesUnsupportedOtherwise() argument
238 narrowToSmallerAndUnsupportedIfTooSmall(const SizeAndActionsVec & v) narrowToSmallerAndUnsupportedIfTooSmall() argument
263 moreToWiderTypesAndLessToWidest(const SizeAndActionsVec & v) moreToWiderTypesAndLessToWidest() argument
360 checkPartialSizeAndActionsVector(const SizeAndActionsVec & v) checkPartialSizeAndActionsVector() argument
408 checkFullSizeAndActionsVector(const SizeAndActionsVec & v) checkFullSizeAndActionsVector() argument
[all...]
/freebsd-src/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Ddivmod.m49 * dividend -- the thing being divided
10 * divisor -- how many ways to divide it
12 * N -- how many bits per iteration we try to get
14 * WORDSIZE -- how many bits altogether we're talking about:
17 * TOPBITS -- how many bits are in the top "decade" of a number:
18 * define(TOPBITS, eval( WORDSIZE - N*((WORDSIZE-1)/N) ) )
20 * Q -- the partial quotient under development -- initially 0
21 * R -- the remainder so far -- initially == the dividend
22 * ITER -- number of iterations of the main division loop which will
25 * V -- the current comparand -- initially divisor*2ˆ(ITER*N-1)
[all …]
/freebsd-src/contrib/bearssl/src/symcipher/
H A Dpoly1305_ctmul32.c34 * Implementation notes: we split the 130-bit values into ten in poly1305_inner()
35 * 13-bit words. This gives us some space for carries and allows in poly1305_inner()
36 * using only 32x32->32 multiplications, which are way faster than in poly1305_inner()
37 * 32x32->64 multiplications on the ARM Cortex-M0/M0+, and also in poly1305_inner()
38 * help in making constant-time code on the Cortex-M3. in poly1305_inner()
40 * Since we compute modulo 2^130-5, the "upper words" become in poly1305_inner()
45 * In each loop iteration, a[] and r[] words are 13-bit each, in poly1305_inner()
54 unsigned u, v; in poly1305_inner() local
58 * If there is a partial block, right-pad it with zeros. in poly1305_inner()
68 * Decode next block and apply the "high bit"; that value in poly1305_inner()
[all …]
/freebsd-src/sys/dev/bwi/
H A Dbitops.h1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
33 * $DragonFly: src/sys/dev/netif/bwi/bitops.h,v 1.1 2007/09/08 06:15:54 sephe Exp $
40 * __BIT(n): Return a bitmask with bit m set, where the least
41 * significant bit is bit 0.
45 * least significant bit is bit 0.
51 * __SHIFTIN(v, mask): Left-shift bits `v' into the bitfield
53 * side-effects.
55 * __SHIFTOUT(v, mask): Extract and return the bitfield selected
56 * by `mask' from `v', right-shifting the
[all …]
/freebsd-src/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_atomic_clang_x86.h
/freebsd-src/contrib/libucl/src/
H A Dmum.h25 input data by 64x64-bit multiplication and mixing hi- and low-parts
28 with the equal probability of their bit values for the
38 strings (at least up to 512-bit) on Haswell and Power7. The MUM bulk
59 /* Macro saying to use 128-bit integers implemented by GCC for some
90 probability of their bit values. They are used to randomize input
107 /* Multiply 64-bit V and P and return sum of high and low parts of the
110 _mum (uint64_t v, uint64_t p) { in _mum() argument
114 /* AARCH64 needs 2 insns to calculate 128-bit result of the in _mum()
116 function doing 128x128->128 bit multiplication. The function is in _mum()
118 lo = v * p, hi; in _mum()
[all …]
/freebsd-src/sys/arm/include/
H A Datomic.h1 /* $NetBSD: atomic.h,v 1.1 2002/10/19 12:22:34 bsh Exp $ */
3 /*-
4 * SPDX-License-Identifier: BSD-4-Clause
6 * Copyright (C) 2003-2004 Olivier Houchard
7 * Copyright (C) 1994-1997 Mark Brinicombe
56 atomic_##NAME##_acq_long(__volatile u_long *p, u_long v) \
58 atomic_##NAME##_long(p, v); \
619 uint32_t v; atomic_load_acq_32() local
658 u_long v; atomic_load_acq_long() local
836 atomic_store_rel_32(volatile uint32_t * p,uint32_t v) atomic_store_rel_32() argument
852 atomic_store_rel_long(volatile u_long * p,u_long v) atomic_store_rel_long() argument
860 atomic_testandclear_32(volatile uint32_t * ptr,u_int bit) atomic_testandclear_32() argument
889 atomic_testandclear_int(volatile u_int * p,u_int v) atomic_testandclear_int() argument
896 atomic_testandclear_long(volatile u_long * p,u_int v) atomic_testandclear_long() argument
905 atomic_testandclear_64(volatile uint64_t * p,u_int v) atomic_testandclear_64() argument
920 atomic_testandset_32(volatile uint32_t * ptr,u_int bit) atomic_testandset_32() argument
949 atomic_testandset_int(volatile u_int * p,u_int v) atomic_testandset_int() argument
956 atomic_testandset_long(volatile u_long * p,u_int v) atomic_testandset_long() argument
964 atomic_testandset_64(volatile uint64_t * p,u_int v) atomic_testandset_64() argument
979 atomic_swap_32(volatile uint32_t * p,uint32_t v) atomic_swap_32() argument
998 atomic_swap_long(volatile u_long * p,u_long v) atomic_swap_long() argument
1005 atomic_swap_64(volatile uint64_t * p,uint64_t v) atomic_swap_64() argument
[all...]
/freebsd-src/contrib/libcxxrt/
H A Ddwarf_eh.h2 * Copyright 2010-2011 PathScale, Inc. All rights reserved.
27 * dwarf_eh.h - Defines some helper functions for parsing DWARF exception
31 * language-specific code. It can be used in any personality function for the
62 /// Unsigned, little-endian, base 128-encoded (variable length).
64 /// Unsigned 16-bit integer.
66 /// Unsigned 32-bit integer.
68 /// Unsigned 64-bit integer.
70 /// Signed, little-endian, base 128-encoded (variable length)
72 /// Signed 16-bit integer.
74 /// Signed 32-bit integer.
[all …]
/freebsd-src/share/man/man9/
H A Datomic.91 .\" Copyright (c) 2000-2001 John H. Baldwin <jhb@FreeBSD.org>
43 .Fn atomic_add_[acq_|rel_]<type> "volatile <type> *p" "<type> v"
45 .Fn atomic_clear_[acq_|rel_]<type> "volatile <type> *p" "<type> v"
59 .Fn atomic_fetchadd_<type> "volatile <type> *p" "<type> v"
67 .Fn atomic_set_[acq_|rel_]<type> "volatile <type> *p" "<type> v"
69 .Fn atomic_subtract_[acq_|rel_]<type> "volatile <type> *p" "<type> v"
71 .Fn atomic_store_[rel_]<type> "volatile <type> *p" "<type> v"
73 .Fn atomic_swap_<type> "volatile <type> *p" "<type> v"
75 .Fn atomic_testandclear_<type> "volatile <type> *p" "u_int v"
77 .Fn atomic_testandset_<type> "volatile <type> *p" "u_int v"
[all...]
/freebsd-src/sys/tools/sound/
H A Dfeeder_rate_mkfilter.awk1 #!/usr/bin/awk -f
3 # SPDX-License-Identifier: BSD-2-Clause
5 # Copyright (c) 2007-2009 Ariff Abdullah <ariff@FreeBSD.org>
46 # - http://ccrma.stanford.edu/~jos/resample/
54 return (((x < 0) ? -x : x) + 0);
59 return (((x < 0.0) ? -x : x) + 0.0);
74 r--;
90 y--;
99 y--;
104 function fx_floor(v, o, r)
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dbit.h1 //===-- llvm/ADT/bit.h - C++20 <bit> ----------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 /// This file implements the C++20 <bit> header.
12 //===----------------------------------------------------------------------===//
58 // expensive, and bit.h is popular via MathExtras.h.
81 // - It isn't constexpr because that requires compiler support.
82 // - It requires trivially-constructible To, to avoid UB in the implementation.
99 /// Reverses the bytes in the given integer value V.
101 [[nodiscard]] constexpr T byteswap(T V) noexcept { in byteswap() argument
[all …]

12345678910>>...45