/freebsd-current/sys/kern/ |
H A D | subr_vmem.c | 214 #define ORDER2SIZE(order) ((order) < VMEM_OPTVALUE ? ((order) + 1) : \ 215 (vmem_size_t)1 << ((order) - (VMEM_OPTVALUE - VMEM_OPTORDER - 1)))
|
/freebsd-current/crypto/heimdal/lib/gssapi/krb5/ |
H A D | init_sec_context.c | 132 ctx->order = NULL; 296 &ctx->order,
|
H A D | cfx.c | 800 ret = _gssapi_msg_order_check(ctx->order, seq_number_lo); 1442 ret = _gssapi_msg_order_check(ctx->order, seq_number_lo); 1716 ret = _gssapi_msg_order_check(ctx->order, seq_number_lo);
|
/freebsd-current/contrib/bmake/unit-tests/ |
H A D | varname-makeflags.mk | 138 # Demonstrates in which exact order the MAKEFLAGS are built from the parent
|
/freebsd-current/crypto/openssl/include/openssl/ |
H A D | ec.h | 210 /** Sets the generator and its order/cofactor of a EC_GROUP object. 213 * \param order the order of the group generated by the generator. 219 const BIGNUM *order, const BIGNUM *cofactor); 227 /** Returns the montgomery data for order(Generator) 233 /** Gets the order of a EC_GROUP 235 * \param order BIGNUM to which the order is copied 239 int EC_GROUP_get_order(const EC_GROUP *group, BIGNUM *order, BN_CTX *ctx); 241 /** Gets the order o [all...] |
/freebsd-current/share/mk/ |
H A D | bsd.obj.mk | 98 # The following directories are tried in order for ${.OBJDIR}:
|
H A D | bsd.libnames.mk | 177 # enforce -lpthread, -lc, and -lsys to always be the last in that exact order
|
/freebsd-current/sys/dev/mpt/ |
H A D | mpt.h | 60 * Support from Chris Ellsworth in order to make SAS adapters work 206 #define DECLARE_MPT_PERSONALITY(name, order) \ 210 DECLARE_MODULE(name, name##_mod, SI_SUB_DRIVERS, order); \ 830 * Must be less than 16384 in order for target mode to work
|
/freebsd-current/sys/dev/superio/ |
H A D | superio.c | 753 superio_add_child(device_t dev, u_int order, const char *name, int unit) argument 758 child = device_add_child_ordered(dev, order, name, unit);
|
/freebsd-current/sys/dev/hid/ |
H A D | hidbus.c | 192 hidbus_add_child(device_t dev, u_int order, const char *name, int unit) argument 198 child = device_add_child_ordered(dev, order, name, unit);
|
/freebsd-current/sys/dev/bhnd/siba/ |
H A D | siba.c | 1238 siba_add_child(device_t dev, u_int order, const char *name, int unit) argument 1243 child = device_add_child_ordered(dev, order, name, unit);
|
/freebsd-current/sys/dev/gpio/ |
H A D | gpiobus.c | 685 gpiobus_add_child(device_t dev, u_int order, const char *name, int unit) argument 690 child = device_add_child_ordered(dev, order, name, unit);
|
/freebsd-current/sys/dev/bhnd/cores/chipc/ |
H A D | chipc.c | 409 * We check for hardware presence in order of precedence. For example, 596 chipc_add_child(device_t dev, u_int order, const char *name, int unit) argument 601 child = device_add_child_ordered(dev, order, name, unit);
|
/freebsd-current/crypto/openssh/contrib/suse/ |
H A D | openssh.spec | 98 key..." if we need to actually do this, in order to eliminate a confusing
|
/freebsd-current/contrib/llvm-project/lldb/source/Utility/ |
H A D | Scalar.cpp | 44 static const llvm::fltSemantics *const order[] = { member in class:llvm 47 for (const auto &entry : llvm::enumerate(order)) { 792 dst_byte_order); // dst byte order
|
/freebsd-current/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_cc.c | 75 * in order for each clause as part of a loop that executes over the clauses. 1425 uint64_t oarg, order, v; local 1506 for (i = 0, order = 1; i <= args[2].value + 1; i++) { 1507 if (order * args[0].value > order) { 1508 order *= args[0].value; 2050 * compilation order. 2289 * dt_lib_path. Once sorted, compile each one in topological order to cache its 2366 * list is specified in the precedence order the user requested. Process
|
/freebsd-current/contrib/llvm-project/lld/COFF/ |
H A D | Writer.cpp | 113 // lowest 4 bytes usually being the timestamp in little-endian order). 802 // For /order. 807 return ctx.config.order.lookup(sec->sym->getName()); 840 // symbol, and one trailer object. In order for the .idata tables/lists to 847 // Make sure all .idata$* section chunks are mapped as RDATA in order to 865 // if SC1, order them ascending. If SC2 or both null, 896 // The loader assumes a specific order of data. 897 // Add each type in the correct order. 951 DenseMap<const SectionChunk *, int> order = local 953 for (auto it : order) { [all...] |
/freebsd-current/sys/contrib/dev/rtw89/ |
H A D | rtw8852b_rfk.c | 1688 u8 order; local 1691 order = rtw89_phy_read32_mask(rtwdev, R_LDL_NORM, B_LDL_NORM_OP); 1692 val = 0x3 >> order; 1694 rtw89_debug(rtwdev, RTW89_DBG_RFK, "[DPK] convert MDPD order to 0x%x\n", val); 2336 static void _dpk_set_mdpd_para(struct rtw89_dev *rtwdev, u8 order) argument 2338 switch (order) { 2340 rtw89_phy_write32_mask(rtwdev, R_LDL_NORM, B_LDL_NORM_OP, order); 2345 rtw89_phy_write32_mask(rtwdev, R_LDL_NORM, B_LDL_NORM_OP, order); 2350 rtw89_phy_write32_mask(rtwdev, R_LDL_NORM, B_LDL_NORM_OP, order); 2356 "[DPK] Wrong MDPD order!!( [all...] |
H A D | rtw8851b_rfk.c | 2272 static void _dpk_set_mdpd_para(struct rtw89_dev *rtwdev, u8 order) argument 2274 switch (order) { 2301 "[DPK] Wrong MDPD order!!(0x%x)\n", order); 2306 order == 0x0 ? "(5,3,1)" : 2307 order == 0x1 ? "(5,3,0)" : 2308 order == 0x2 ? "(5,0,0)" : "(7,3,1)"); 2331 u32 order; local 2334 order = rtw89_phy_read32_mask(rtwdev, R_LDL_NORM, B_LDL_NORM_OP); 2336 switch (order) { [all...] |
/freebsd-current/crypto/openssl/crypto/ec/ |
H A D | ecp_smpl.c | 254 BIGNUM *a, *b, *order, *tmp_1, *tmp_2; local 270 order = BN_CTX_get(ctx); 271 if (order == NULL) 1648 * - Y1==0 implies p has order 2, so either r or s are infinity and handled by
|
/freebsd-current/contrib/wpa/src/crypto/ |
H A D | crypto_libtomcrypt.c | 727 const u8 *order, size_t order_len, 726 crypto_dh_derive_secret(u8 generator, const u8 *prime, size_t prime_len, const u8 *order, size_t order_len, const u8 *privkey, size_t privkey_len, const u8 *pubkey, size_t pubkey_len, u8 *secret, size_t *len) argument
|
/freebsd-current/contrib/ntp/include/ |
H A D | ntp_request.h | 334 * without saying that everything returned is in network byte order. 406 u_char order[NTP_SHIFT]; /* order of peers from last filter */ member in struct:info_peer 450 u_char candidate; /* select order */
|
/freebsd-current/contrib/wpa/src/utils/ |
H A D | common.h | 204 #error Could not determine CPU byte order
|
/freebsd-current/contrib/bearssl/src/ec/ |
H A D | ec_prime_i15.c | 205 * If y = 0 (P has order 2) then this yields infinity (z' = 0), as it 207 * prime order, and thus do not contain any point of order 2. 305 * on line Y = 0 since that would be a point of order 2). If the two 716 return cd->order; 790 * curve order, then we know that P and Q are non-infinity. This
|
H A D | ec_prime_i31.c | 204 * If y = 0 (P has order 2) then this yields infinity (z' = 0), as it 206 * prime order, and thus do not contain any point of order 2. 304 * on line Y = 0 since that would be a point of order 2). If the two 718 return cd->order; 792 * curve order, then we know that P and Q are non-infinity. This
|