Home
last modified time | relevance | path

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

12345678910>>...16

/freebsd-src/contrib/openpam/lib/libpam/
H A Dopenpam_ctype.h1 /*-
2 * Copyright (c) 2012-2014 Dag-Erling Smørgrav
34 * Evaluates to non-zero if the argument is a digit.
40 * Evaluates to non-zero if the argument is a hex digit.
48 * Evaluates to non-zero if the argument is an uppercase letter.
54 * Evaluates to non-zero if the argument is a lowercase letter.
60 * Evaluates to non-zero if the argument is a letter.
66 * Evaluates to non-zero if the argument is a linear whitespace character.
67 * For the purposes of this macro, the definition of linear whitespace is
74 * Evaluates to non-zero if the argument is a whitespace character.
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/WebAssembly/Utils/
H A DWasmAddressSpaces.h1 //===--- llvm/CodeGen/WasmAddressSpaces.h -----------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
21 // Default address space, for pointers to linear memory (stack, heap, data).
23 // A non-integral address space for pointers to named objects outside of
24 // linear memory: WebAssembly globals or WebAssembly locals. Loads and stores
28 // A non-integral address space for externref values
30 // A non-integral address space for funcref values
/freebsd-src/sys/contrib/device-tree/Bindings/hwmon/
H A Dntc-thermistor.yaml1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause)
2 ---
3 $id: http://devicetree.org/schemas/hwmon/ntc-thermistor.yaml#
4 $schema: http://devicetree.org/meta-schemas/core.yaml#
9 - Linus Walleij <linus.walleij@linaro.org>
13 vary in resistance in an often non-linear way in relation to temperature.
16 temperature is non-linear, software drivers most often need to use a look
20 pull-up resistor or/and a pull-down resistor and a fixed voltage like this:
22 + e.g. 5V = pull-up voltage (puv)
24 +-+
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/spi/
H A Dbrcm,spi-bcm-qspi.txt9 io with 3-byte and 4-byte addressing support.
13 of a MSPI master without the BSPI to use with non flash slave devices that
18 - #address-cells:
21 - #size-cells:
24 - compatible:
26 "brcm,spi-brcmstb-qspi", "brcm,spi-bcm-qspi" : MSPI+BSPI on BRCMSTB SoCs
27 "brcm,spi-brcmstb-mspi", "brcm,spi-bcm-qspi" : Second Instance of MSPI
29 "brcm,spi-bcm7425-qspi", "brcm,spi-bcm-qspi", "brcm,spi-brcmstb-mspi" : Second Instance of MSPI
31 "brcm,spi-bcm7429-qspi", "brcm,spi-bcm-qspi", "brcm,spi-brcmstb-mspi" : Second Instance of MSPI
33 "brcm,spi-bcm7435-qspi", "brcm,spi-bcm-qspi", "brcm,spi-brcmstb-mspi" : Second Instance of MSPI
[all …]
/freebsd-src/share/man/man9/
H A Dpmap_qenter.944 function accepts a linear array of
51 The pages are mapped non-executable, if possible.
52 (For example, non-PAE i386 has no capability to map pages non-executable.)
/freebsd-src/contrib/llvm-project/lld/docs/
H A DWebAssembly.rst11 ----------
[all...]
/freebsd-src/sys/contrib/xen/arch-x86/
H A Dxen.h2 * arch-x86/xen.h
24 * Copyright (c) 2004-2006, K A Fraser
64 #include "xen-x86_32.h"
72 #include "xen-x86_64.h"
95 * start of the GDT because some stupid OSes export hard-coded selector values
96 * in their ABI. These hard-coded values are always near the start of the GDT,
116 /* Maximum number of virtual CPUs in legacy multi-processor guests. */
153 #define TI_GET_DPL(_ti) ((_ti)->flags & 3)
154 #define TI_GET_IF(_ti) ((_ti)->flags & 4)
155 #define TI_SET_DPL(_ti,_dpl) ((_ti)->flags |= (_dpl))
[all …]
/freebsd-src/sys/amd64/include/
H A Dvmm_instruction_emul.h1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
88 * Translate the guest linear address 'gla' to a guest physical address.
112 * 'gla' is the guest linear address provided by the hardware assist
121 #define VIE_INVALID_GLA (1UL << 63) /* a non-canonical address */
/freebsd-src/contrib/bc/manuals/
H A Dalgorithms.md7 This `bc` uses brute force addition, which is linear (`O(n)`) in the number of
12 This `bc` uses brute force subtraction, which is linear (`O(n)`) in the number
64 Newton-Raphson Method, or the [Babylonian Method][5]) to perform the square root
75 x - x^3/3! + x^5/5! - x^7/7! + ...
124 (where `a` is equal to `(x - 1)/(x + 1)`) to calculate `ln(x)` when `x` is small
144 x - x^3/3 + x^5/5 - x^7/7 + ...
150 atan(x) = atan(c) + atan((x - c)/(1 + x * c))
164 x^n/(2^n * n!) * (1 - x^2 * 2 * 1! * (n + 1)) + x^4/(2^4 * 2! * (n + 1) * (n + 2)) - ...
172 j(-n,x) = (-1)^n * j(n,x)
183 This `dc` uses the [Memory-efficient method][8] to compute modular
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Support/
H A DStringMap.cpp1 //===--- StringMap.cpp - String Hash table map implementation ------
[all...]
/freebsd-src/lib/libc/stdlib/
H A Dlsearch.315 .Nd linear search and append
57 zero if they are matching, and non-zero otherwise.
83 .Bd -literal
94 return (left - right);
133 .St -p1003.1-2001 .
144 .St -p1003.1-2001 .
H A Drandom.337 .Nd non-cryptographic pseudorandom number generator; routines for changing generators
53 .Bf -symbolic
63 uses a non-linear additive feedback random number generator employing a
64 default table of size 31 long integers to return successive pseudo-random
74 uses the poor-quality 32-bit Park-Miller LCG.
99 Park-Miller LCG algorithm applied to a fixed seed.
112 the underlying object must be a naturally aligned array of 32-bit values.)
H A Dradixsort.355 is denoted by the user-specified value
62 .Pf non- Dv NULL ,
68 The end-of-string byte must have a sort weight of 0 or 255
76 for A-Z as for a-z will result in a case-insensitive sort.
100 These functions are variants of most-significant-byte radix sorting; in
105 They take linear time relative to the number of bytes in the strings.
107 .Rv -std radixsort
109 .Bl -tag -width Er
135 .%P pp. 170-178
151 .%P pp. 5-27
/freebsd-src/sys/contrib/openzfs/module/zfs/
H A Dabd.c9 * or https://opensource.org/licenses/CDDL-1.0.
32 * (a) Linear buffer. In this case, all the data in the ABD is stored in one
35 * +--------
[all...]
/freebsd-src/contrib/bearssl/src/symcipher/
H A Daes_ct.c32 * This S-box implementation is a straightforward translation of in br_aes_ct_bitslice_Sbox()
66 * Top linear transformation. in br_aes_ct_bitslice_Sbox()
93 * Non-linear section. in br_aes_ct_bitslice_Sbox()
161 * Bottom linear transformation. in br_aes_ct_bitslice_Sbox()
293 tmp ^= skey[(i - nk) << 1]; in br_aes_ct_keysched()
H A Daes_ct64.c32 * This S-box implementation is a straightforward translation of in br_aes_ct64_bitslice_Sbox()
66 * Top linear transformation. in br_aes_ct64_bitslice_Sbox()
93 * Non-linear section. in br_aes_ct64_bitslice_Sbox()
161 * Bottom linear transformation. in br_aes_ct64_bitslice_Sbox()
333 tmp = skey[(key_len >> 2) - 1]; in br_aes_ct64_keysched()
341 tmp ^= skey[i - nk]; in br_aes_ct64_keysched()
393 skey[v + 0] = (x0 << 4) - x0; in br_aes_ct64_skey_expand()
394 skey[v + 1] = (x1 << 4) - x1; in br_aes_ct64_skey_expand()
395 skey[v + 2] = (x2 << 4) - x2; in br_aes_ct64_skey_expand()
396 skey[v + 3] = (x3 << 4) - x3; in br_aes_ct64_skey_expand()
/freebsd-src/sys/ofed/include/rdma/
H A Drdmavt_mr.h4 /*-
5 * SPDX-License-Identifier: BSD-2-Clause OR GPL-2.0
29 * - Redistributions of source code must retain the above copyright
31 * - Redistributions in binary form must reproduce the above copyright
35 * - Neither the name of Intel Corporation nor the names of its
58 * A segment is a linear region of low physical memory.
83 u8 page_shift; /* 0 - non unform/non powerof2 sizes */
110 u16 m; /* current index: mr->map[m] */
111 u16 n; /* current index: mr->map[m]->segs[n] */
123 if (unlikely(atomic_dec_and_test(&mr->refcount))) in rvt_put_mr()
[all …]
/freebsd-src/lib/libsys/x86/
H A Dpkru.333 .Nd provide fast user-managed key-based access control for pages
57 to control access to user-mode addresses.
62 are user-controllable.
64 If supported by hardware, each mapped user linear address
65 has an associated 4-bit protection key.
66 A new per-thread PKRU hardware register determines, for each protection
67 key, whether user-mode addresses with that protection key may be
82 Protection keys require that the system uses 4-level paging
85 Both 64-bi
[all...]
/freebsd-src/libexec/bootpd/
H A Dhash.c27 * Provides multiple, dynamically-allocated, variable-sized hash tables on
77 + sizeof(hash_member *) * (tablesize - 1); in hash_Init()
81 hashtblptr->size = tablesize; /* Success! */ in hash_Init()
82 hashtblptr->bucketnum = 0; in hash_Init()
83 hashtblptr->member = (hashtblptr->table)[0]; in hash_Init()
86 hashtblptr = NULL; /* Disallow zero-length tables */ in hash_Init()
103 nextbucket = bucketptr->next; in hashi_FreeMembers()
104 (*free_data) (bucketptr->data); in hashi_FreeMembers()
114 * This routine re-initializes the hash table. It frees all the allocated
124 bucketptr = hashtable->table; in hash_Reset()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DAnalysis.h1 //===- CodeGen/Analysis.h - CodeGen LLVM IR Analysis Utilities --*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.
[all...]
/freebsd-src/usr.bin/clang/lli/
H A Dlli.14 .nr rst2man-indent-level 0
7 \\$1 \\n[an-margin]
8 level \\n[rst2man-indent-level]
9 level margin: \\n[rst2man-indent\\n[rst2man-indent-level]]
10 -
11 \\n[rst2man-indent0]
12 \\n[rst2man-indent1]
13 \\n[rst2man-indent2]
18 . nr rst2man-indent\\n[rst2man-indent-level] \\n[an-margin]
19 . nr rst2man-indent-level +1
[all …]
/freebsd-src/contrib/file/magic/Magdir/
H A Dimages2 #----------
[all...]
H A Dvorbis2 #------------------------------------------------------------------------------
23 # --- Ogg Framing ---
30 # non-Vorbis content: FLAC (Free Lossless Audio Codec, http://flac.sourceforge.net)
32 # non-Vorbis content: Theora
36 # non-Vorbis content: Kate
47 # non-Vorbis content: Skeleton
52 # non-Vorbis content: Speex
55 # non-Vorbis content: OGM
62 # --- First vorbis packet - general header ---
75 >>>>>52 lelong !-1
[all …]
/freebsd-src/sys/netinet6/
H A Dip6_id.c1 /*-
2 * SPDX-License-Identifier: (BSD-3-Clause AND BSD-2-Clause)
34 /*-
39 * such a mathematical system to generate more random (yet non-repeating)
68 * seed = random (bits - 1) bit
70 * j = random so that gcd(j,n-1) == 1
74 * X[n] = a*X[n-1]+b mod m is a Linear Congruential Generator
77 * m = constant and a maximal period of m-1.
82 * Effectively the id is restricted to the lower (bits - 1) bits, thus
110 const u_int32_t ru_n; /* ru_n: prime, ru_n - 1: product of pfacts[] */
[all …]
/freebsd-src/usr.bin/clang/llc/
H A Dllc.14 .nr rst2man-indent-level 0
7 \\$1 \\n[an-margin]
8 level \\n[rst2man-indent-level]
9 level margin: \\n[rst2man-indent\\n[rst2man-indent-level]]
10 -
11 \\n[rst2man-indent0]
12 \\n[rst2man-indent1]
13 \\n[rst2man-indent2]
18 . nr rst2man-indent\\n[rst2man-indent-level] \\n[an-margin]
19 . nr rst2man-indent-level +1
[all …]

12345678910>>...16