| /freebsd/sys/contrib/edk2/Include/Library/ |
| H A D | BaseLib.h | 3 functions, file path functions, and CPU architecture-specific functions.
5 Copyright (c) 2006 - 2019, Intel Corporation. All rights reserved.<BR>
6 Portions copyright (c) 2008 - 2009, Apple Inc. All rights reserved.<BR>
10 SPDX-License-Identifier: BSD-2-Clause-Patent
18 // Definitions for architecture-specific types
22 /// The IA-32 architecture context buffer used by SetJump() and LongJump().
40 /// The x64 architecture context buffer used by SetJump() and LongJump().
54 UINT8 XmmBuffer[160]; ///< XMM6-XMM15.
132 /// The RISC-V architecture context buffer used by SetJump() and LongJump().
161 Returns the length of a Null-terminated Unicode string.
[all …]
|
| /freebsd/contrib/bearssl/src/ |
| H A D | config.h | 29 * This file contains compile-time flags that can override the
32 * non-zero integer (normally 1). If the macro is not defined, then
37 * When BR_64 is enabled, 64-bit integer types are assumed to be
38 * efficient (i.e. the architecture has 64-bit registers and can
39 * do 64-bit operations as fast as 32-bit operations).
41 #define BR_64 1
45 * When BR_LOMUL is enabled, then multiplications of 32-bit values whose
47 * substantially more efficient than 32-bit multiplications that yield
48 * 64-bit results. This is typically the case on low-end ARM Cortex M
51 #define BR_LOMUL 1
[all …]
|
| /freebsd/crypto/libecc/src/examples/sig/sdsa/ |
| H A D | sdsa.c | 2 * Copyright (C) 2021 - This file is part of libecc project
27 * one corresponding to SDSA as described in the ISO14888-3 standard.
43 * time and blinding WHEN activated with BLINDING=1), please consider this
46 * All-in-all, this piece of code can be useful in some contexts, or risky to
47 * use in other sensitive ones where advanced side-channels or fault attacks
93 /* alpha is the bit length of p, beta is the bit length of q */ in sdsa_sign()
103 /* This is a bit too much for stack space, but we need it for in sdsa_sign()
122 p = &(priv->p); in sdsa_sign()
123 q = &(priv->q); in sdsa_sign()
124 g = &(priv->g); in sdsa_sign()
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/src/include/ryu/ |
| H A D | d2s_intrinsics.h | 1 //===----------
[all...] |
| /freebsd/crypto/libecc/include/libecc/curves/known/ |
| H A D | ec_params_brainpoolp512t1.h | 27 #if (WORD_BYTES == 8) /* 64-bit words */
33 0x82, 0xb2, 0x64, 0xff, 0x64, 0x39, 0x97, 0xbd,
42 0x3c, 0x4c, 0x9d, 0x05, 0xa9, 0xff, 0x64, 0x50,
85 #elif (WORD_BYTES == 4) /* 32-bit words */
91 0x82, 0xb2, 0x64, 0xff, 0x64, 0x39, 0x97, 0xbd,
100 0x3c, 0x4c, 0x9d, 0x05, 0xa9, 0xff, 0x64, 0x50,
143 #elif (WORD_BYTES == 2) /* 16-bit words */
149 0x82, 0xb2, 0x64, 0xff, 0x64, 0x39, 0x97, 0xbd,
158 0x3c, 0x4c, 0x9d, 0x05, 0xa9, 0xff, 0x64, 0x50,
246 0x64, 0x0e, 0xce, 0x5c, 0x12, 0x78, 0x87, 0x17,
[all …]
|
| H A D | ec_params_gost_R3410_2001_CryptoPro_XchB_ParamSet.h | 23 #if (WORD_BYTES == 8) /* 64-bit words */
25 0x64, 0x60, 0x9f, 0xa0, 0xa5, 0x7a, 0x7e, 0xf8,
69 #elif (WORD_BYTES == 4) /* 32-bit words */
71 0x64, 0x60, 0x9f, 0xa0, 0xa5, 0x7a, 0x7e, 0xf8,
115 #elif (WORD_BYTES == 2) /* 16-bit words */
117 0x64, 0x60, 0x9f, 0xa0, 0xa5, 0x7a, 0x7e, 0xf8,
205 0x4d, 0x4d, 0xc4, 0x40, 0xd4, 0x64, 0x1a, 0x8f,
260 static const u8 gost_R3410_2001_CryptoPro_XchB_ParamSet_oid[] = "1.2.643.2.2.36.1";
289 * Compute max bit length of all curves for p and q
|
| H A D | ec_params_brainpoolp512r1.h | 2 * Copyright (C) 2017 - This file is part of libecc project
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
46 0x82, 0xb2, 0x64, 0xff, 0x64, 0x39, 0x97, 0xbd,
55 0x3c, 0x4c, 0x9d, 0x05, 0xa9, 0xff, 0x64, 0x50,
68 * mpinv is -p^-1 mod 2^(bitsizeof(hword_t)), this means it depends
83 #if (WORD_BYTES == 8) /* 64-bit words */
87 #elif (WORD_BYTES == 4) /* 32-bit words */
91 #elif (WORD_BYTES == 2) /* 16-bit words */
141 0x81, 0xAE, 0xE4, 0xBD, 0xD8, 0x2E, 0xD9, 0x64,
251 * Compute max bit length of all curves for p and q
|
| H A D | ec_params_brainpoolp224t1.h | 23 #if (WORD_BYTES == 8) /* 64-bit words */
69 #elif (WORD_BYTES == 4) /* 32-bit words */
83 0x64, 0xdc, 0xd0, 0x4f,
115 #elif (WORD_BYTES == 2) /* 16-bit words */
129 0x64, 0xdc, 0xd0, 0x4f,
177 0x0d, 0xa1, 0x4c, 0x08, 0xb3, 0xbb, 0x64, 0xf1,
289 * Compute max bit length of all curves for p and q
322 #if (MAX_CURVE_OID_LEN < 1)
324 #define MAX_CURVE_OID_LEN 1
|
| /freebsd/sys/contrib/device-tree/Bindings/display/bridge/ |
| H A D | analogix,anx7625.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause)
4 ---
6 $schema: http://devicetree.org/meta-schemas/core.yaml#
11 - Xin Ji <xji@analogixsemi.com>
14 The ANX7625 is an ultra-low power 4K Mobile HD Transmitter
22 maxItems: 1
26 maxItems: 1
28 enable-gpios:
30 maxItems: 1
32 reset-gpios:
[all …]
|
| /freebsd/contrib/libucl/src/ |
| H A D | mum.h | 25 input data by 64x64-bit multiplication and mixing hi- and low-parts
28 with the equal probability of their bit values for the
36 Applications (version 2.2.1) with 1000 bitstreams each containing
37 1M bits. MUM hashing is also faster Spooky64 and City64 on small
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
66 #define _MUM_USE_INT128 1
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
114 /* AARCH64 needs 2 insns to calculate 128-bit result of the in _mum()
[all …]
|
| /freebsd/stand/i386/pxeldr/ |
| H A D | pxeldr.S | 7 * 1. Redistributions of source code must retain the above copyright
33 * separate PXE-aware client just to load the loader.
51 .set MEM_BIOS_KEYBOARD,0x496 # BDA byte with keyboard bit
66 .set SEL_SCODE,0x18 # PM-32 code
67 .set SEL_SCODE16,0x20 # PM-16 code
73 * Bit in MEM_BIOS_KEYBOARD that is set if an enhanced keyboard is present
98 movw $welcome_msg, %si # %ds:(%si) -> welcome message
103 movw $bootinfo_msg, %si # %ds:(%si) -> boot args message
105 movw $MEM_ARG, %bx # %ds:(%bx) -> boot args
106 movw %bx, %di # %es:(%di) -> boot args
[all …]
|
| /freebsd/usr.sbin/ppp/ |
| H A D | chap_ms.c | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
5 * 1997 - 2001 Brian Somers <brian@Awfulhak.org>
13 * 1. Redistributions of source code must retain the above copyright
54 * MS-CHAP (CHAP80) rfc2433
55 * MS-CHAP-V2 (CHAP81) rfc2759
56 * MPPE key management draft-ietf-pppext-mppe-keys-02.txt
76 u_char UseNT; /* If 1, ignore the LANMan response field */
85 word |= (unsigned)input[startBit / 8 + 1]; in Get7Bits()
87 word >>= 15 - (startBit % 8 + 7); in Get7Bits()
[all …]
|
| /freebsd/sys/dev/etherswitch/ar40xx/ |
| H A D | ar40xx_reg.h | 20 * Register manipulation macros that expect bit field defines
27 #define BITS(_s, _n) (((1UL << (_n)) - 1) << _s)
28 #define BIT(_n) (1UL << (_n)) macro
30 #define AR40XX_PORT_LINK_UP 1
32 #define AR40XX_QM_NOT_EMPTY 1
35 #define AR40XX_LAN_VLAN 1
51 #define AR40XX_PSGMII_ATHR_CSCO_MODE_25M BIT(0)
83 #define AR40XX_STATS_TX64BYTE 0x64
101 #define AR40XX_MODULE_EN_MIB BIT(0)
104 #define AR40XX_MIB_BUSY BIT(17)
[all …]
|
| /freebsd/contrib/bearssl/inc/ |
| H A D | bearssl_rsa.h | 50 * such integers are represented with big-endian unsigned notation:
52 * there is no dedicated "sign bit"). Public and private key structures
55 * relevant bytes. As a general rule, minimal-length encoding is not
60 * - the modulus (`n`);
61 * - the public exponent (`e`).
64 * [PKCS#1](https://tools.ietf.org/html/rfc3447), contain eight integers:
66 * - the modulus (`n`);
67 * - the public exponent (`e`);
68 * - the private exponent (`d`);
69 * - the first prime factor (`p`);
[all …]
|
| H A D | bearssl_ec.h | 50 * [IANA](http://www.iana.org/assignments/tls-parameters/tls-parameters.xhtml#tls-parameters-8).
53 * range, it is convenient to encode support of some curves in a 32-bit
54 * word, such that bit x corresponds to curve of identifier x.
59 * - `supported_curves`
61 * A 32-bit word that documents the identifiers of the curves supported
64 * - `generator()`
69 * - `order()`
72 * that curve. That value uses unsigned big-endian encoding.
74 * - `xoff()`
79 * - `mul()`
[all …]
|
| /freebsd/contrib/file/magic/Magdir/ |
| H A D | images | 2 #------------------------------------------------------------------------------
4 # images: file(1) magic for image formats (see also "iff", and "c-lang" for
9 # merging several one- and two-line files into here.
13 # Targa - matches `povray', `ppmtotga' and `xv' outputs
19 # Note: called by DROID "Truevision TGA Bitmap" version 1.0 via PUID x-fmt/367
20 # at 2, byte ImgType must be 1, 2, 3, 9, 10 or 11
22 # at 1, byte CoMapType must be 1 if ImgType is 1 or 9, 0 otherwise
23 # or theoretically 2-128 reserved for use by Truevision or 128-255 may be used for developer applic…
28 # test of Color Map Type 0~no 1~color map
29 # and Image Type 1 2 3 9 10 11 32 33
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/phy/ |
| H A D | ti-phy.txt | 6 - compatible: Should be one of
7 "ti,control-phy-otghs" - if it has otghs_control mailbox register as on OMAP4.
8 "ti,control-phy-usb2" - if it has Power down bit in control_dev_conf register
10 "ti,control-phy-pipe
[all...] |
| /freebsd/contrib/wpa/src/crypto/ |
| H A D | dh_groups.c | 2 * Diffie-Hellman groups
19 /* RFC 4306, B.1. Group 1 - 768 Bit MODP
21 * Prime: 2^768 - 2 ^704 - 1 + 2^64 * { [2^638 pi] + 149686 }
23 static const u8 dh_group1_generator[1] = { 0x02 };
53 /* RFC 4306, B.2. Group 2 - 1024 Bit MODP
55 * Prime: 2^1024 - 2^960 - 1 + 2^64 * { [2^894 pi] + 129093 }
57 static const u8 dh_group2_generator[1] = { 0x02 };
97 /* RFC 3526, 2. Group 5 - 1536 Bit MODP
99 * Prime: 2^1536 - 2^1472 - 1 + 2^64 * { [2^1406 pi] + 741804 }
101 static const u8 dh_group5_generator[1] = { 0x02 };
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | xxhash.cpp | 2 * xxHash - Extremely Fast Hash algorithm
3 * Copyright (C) 2012-2023, Yann Collet
5 * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
31 * - xxHash homepage: http://www.xxhash.com
32 * - xxHash source repository : https://github.com/Cyan4973/xxHash
53 #define LLVM_XXH_USE_NEON 1
67 return (X << R) | (X >> (64 - R)); in rotl64()
111 const unsigned char *const Limit = BEnd - 32; in xxHash64()
115 uint64_t V4 = Seed - PRIME64_1; in xxHash64()
128 H64 = rotl64(V1, 1) + rotl64(V2, 7) + rotl64(V3, 12) + rotl64(V4, 18); in xxHash64()
[all …]
|
| /freebsd/cddl/contrib/opensolaris/lib/libctf/common/ |
| H A D | ctf_lib.c | 80 _PAGEMASK = ~(_PAGESIZE - 1); in _libctf_init()
97 if (access(_libctf_zlib, R_OK) == -1) in ctf_zopen()
116 zlib.z_dlp = (void *) (uintptr_t) 1; in ctf_zopen()
139 * Convert a 32-bit ELF file header into GElf.
144 bcopy(src->e_ident, dst->e_ident, EI_NIDENT); in ehdr_to_gelf()
145 dst->e_type = src->e_type; in ehdr_to_gelf()
146 dst->e_machine = src->e_machine; in ehdr_to_gelf()
147 dst->e_version = src->e_version; in ehdr_to_gelf()
148 dst->e_entry = (Elf64_Addr)src->e_entry; in ehdr_to_gelf()
149 dst->e_phoff = (Elf64_Off)src->e_phoff; in ehdr_to_gelf()
[all …]
|
| /freebsd/sys/amd64/vmm/amd/ |
| H A D | vmcb.h | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
10 * 1. Redistributions of source code must retain the above copyright
32 #define BIT(n) (1ULL << n) macro
39 /* vmcb_ctrl->intercept[] array indices */
41 #define VMCB_DR_INTCPT 1
47 #define VMCB_INTCPT_INTR BIT(0)
48 #define VMCB_INTCPT_NMI BIT(1)
49 #define VMCB_INTCPT_SMI BIT(2)
50 #define VMCB_INTCPT_INIT BIT(3)
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/src/ryu/ |
| H A D | d2s.cpp | 1 //===----------
[all...] |
| /freebsd/contrib/llvm-project/lld/docs/ |
| H A D | windows_support.rst | 4 .none { background-color: #FFCCCC }
5 .partial { background-color: #FFFF99 }
6 .good { background-color: #CCFF99 }
17 LLD supports Windows operating system. When invoked as ``lld-link.exe`` or with
18 ``-flavor link``, the driver for Windows operating system is used to parse
24 real-world binaries such as Firefox and Chromium.
35 export-by-name and export-by-ordina
[all...] |
| /freebsd/contrib/wireguard-tools/ |
| H A D | curve25519-fiat32.h | 1 // SPDX-License-Identifier: GPL-2.0 OR MIT
3 * Copyright (C) 2015-2016 The fiat-crypto Authors.
4 * Copyright (C) 2018-2020 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
6 * This is a machine-generated formally verified implementation of Curve25519
7 * ECDH from: <https://github.com/mit-plv/fiat-crypto>. Though originally
9 * It is optimized for 32-bit machines and machines that cannot work efficiently
10 * with 128-bit integer types.
13 /* fe means field element. Here the field is \Z/(2^255-19). An element t,
14 * entries t[0]...t[9], represents the integer t[0]+2^26 t[1]+2^51 t[2]+2^77
28 /* Ignores top bit of s. */ in fe_frombytes_impl()
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/media/ |
| H A D | renesas,drif.yaml | 1 # SPDX-License-Identifier: GPL-2.0-only OR BSD-2-Clause
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
7 title: Renesas R-Car Gen3 Digital Radio Interface Controller (DRIF)
10 - Ramesh Shanmugasundaram <rashanmu@gmail.com>
11 - Fabrizio Castro <fabrizio.castro.jz@renesas.com>
14 R-Car Gen3 DRIF is a SPI like receive only slave device. A general
17 +---------------------+ +---------------------+
18 | |-----SCK------->|CLK |
19 | Master |-----SS-------->|SYNC DRIFn (slave) |
[all …]
|