Home
last modified time | relevance | path

Searched +full:form +full:- +full:factor (Results 1 – 25 of 551) sorted by relevance

12345678910>>...23

/freebsd/crypto/krb5/src/plugins/preauth/spake/
H A Dspake_kdc.c1 /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 /* plugins/preauth/spake/spake_kdc.c - SPAKE kdcpreauth module */
14 * * Redistributions in binary form must reproduce the above copyright
33 #include "k5-int.h"
34 #include "k5-input.h"
35 #include "k5-spake.h"
46 * concatenated fields (all integer fields are big-endian):
48 * version (16-bit unsigned integer)
49 * stage (16-bit unsigned integer)
50 * group (32-bit signed integer)
[all …]
H A Dspake_client.c1 /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 /* plugins/preauth/spake/spake_client.c - SPAKE clpreauth module */
14 * * Redistributions in binary form must reproduce the above copyright
33 #include "k5-int.h"
34 #include "k5-spake.h"
49 /* Return true if SF-NONE is present in factors. */
56 if (factors[i]->type == SPAKE_SF_NONE) in contains_sf_none()
94 k5_free_pa_spake(context, st->msg); in spake_request_fini()
95 krb5_free_keyblock(context, st->initial_key); in spake_request_fini()
96 krb5_free_data(context, st->support); in spake_request_fini()
[all …]
/freebsd/usr.bin/factor/tests/
H A Dfactor_tests.sh2 # SPDX-License-Identifier: BSD-2-Clause
11 # 2. Redistributions in binary form must reproduce the above copyright
30 atf_set "descr" "Test with a float non-prime number"
34 atf_check -o inline:"1: 1\n" factor 1.44
45 atf_check -o inline:"3: 3\n" factor $pi
55 atf_check -o inline:"8: 2 2 2\n" factor 8
65 atf_check -o inline:"31: 31\n" factor 31
75 atf_check -s not-exit:0 -e inline:"factor: negative numbers aren't permitted.\n" factor -- -4
/freebsd/contrib/netbsd-tests/games/
H A Dt_factor.sh11 # 2. Redistributions in binary form must reproduce the above copyright
30 ncrypt=$( ldd /usr/games/factor | grep -c -- -lcrypt )
31 if [ "X$3" != "X" -a $ncrypt -eq 0 ] ; then
32 atf_skip "crypto needed for huge non-prime factors - PR bin/23663"
34 atf_check -s eq:0 -o file:expout -e empty /usr/games/factor ${1}
40 atf_set "require.progs" "/usr/games/factor"
49 atf_set "require.progs" "/usr/games/factor"
59 atf_set "require.progs" "/usr/games/factor"
69 atf_set "require.progs" "/usr/games/factor"
/freebsd/share/man/man4/
H A Dccd.412 .\" 2. Redistributions in binary form must reproduce the above copyright
75 concatenate the partitions, specify the interleave factor of 0.
76 Note that mirroring may not be used with an interleave factor of 0.
78 There is a run-time utility that is used for configuring
83 .Ss The Interleave Factor
90 The interleave factor is expressed in units of
93 For large writes, the optimum interleave factor
99 on two Fast-Wide SCSI buses, this translates to about 128 for writes
108 An interleave factor must be specified when using a mirroring configuration,
110 no matter what the interleave factor)
[all...]
H A Dcc_newreno.415 .\" 2. Redistributions in binary form must reproduce the above copyright
57 .Bd -literal
63 .Bl -tag -width ".Va CC_NEWRENO_BETA_ECN"
65 Multiplicative window decrease factor, specified as a percentage, applied to
70 Multiplicative window decrease factor, specified as a percentage, applied to
78 When enabling it a value of 1 will enable precise internet-draft (version 4) behavior
96 .Bl -tag -width ".Va beta_ecn"
98 Multiplicative window decrease factor, specified as a percentage, applied to
103 Multiplicative window decrease factor, specified as a percentage, applied to
142 congestion control algorithm first appeared in its modular form in
[all …]
/freebsd/sys/arm/ti/clk/
H A Dti_clk_dpll.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
13 * 2. Redistributions in binary form must reproduce the above copyright
55 uint32_t ti_clksel_offset; /* mult-div1 */
80 ti_clk_factor_get_max(struct ti_clk_factor *factor) in ti_clk_factor_get_max() argument
84 if (factor->flags & TI_CLK_FACTOR_FIXED) in ti_clk_factor_get_max()
85 max = factor->value; in ti_clk_factor_get_max()
87 max = (1 << factor->width); in ti_clk_factor_get_max()
94 ti_clk_factor_get_min(struct ti_clk_factor *factor) in ti_clk_factor_get_min() argument
98 if (factor->flags & TI_CLK_FACTOR_FIXED) in ti_clk_factor_get_min()
[all …]
H A Dti_clk_dpll.h1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
13 * 2. Redistributions in binary form must reproduce the above copyright
66 uint32_t shift; /* Shift bits for the factor */
67 uint32_t mask; /* Mask to get the factor */
68 uint32_t width; /* Number of bits for the factor */
85 uint32_t ti_clksel_offset; /* mult-div1 */
/freebsd/sys/contrib/openzfs/tests/zfs-tests/include/
H A Dmath.shlib1 # SPDX-License-Identifier: CDDL-1.0
34 [ 1 -eq $(echo "$2 > $a" | bc) ] && a=$2 || b=$2
37 [[ $a =~ [1-9] ]] || return 1
41 [ 1 -eq $(echo "scale=2; $p >= $percent" | bc) ]
45 # Return 0 if value is within +/-tolerance of target.
60 typeset diff=$((abs(val - target)))
61 log_note "Checking if $val is within +/-$tol of $target (diff: $diff)"
66 # Return 0 if the human readable string of the form <value>[suffix] can
72 typeset value=$(echo "$size" | grep -o '[0-9]\+')
75 *PB|*pb|*P|*p) factor='1024^5' ;;
[all …]
/freebsd/sys/contrib/device-tree/src/arm64/broadcom/stingray/
H A Dstingray-clock.dtsi4 * Copyright(c) 2016-2017 Broadcom. All rights reserved.
12 * * Redistributions in binary form must reproduce the above copyright
33 #include <dt-bindings/clock/bcm-sr.h>
36 #clock-cells = <0>;
37 compatible = "fixed-clock";
38 clock-frequency = <50000000>;
42 #clock-cells = <0>;
43 compatible = "fixed-factor-clock";
45 clock-div = <2>;
46 clock-mult = <1>;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DVectorUtils.h1 //===- llvm/Analysis/VectorUtils.h - Vector utilities -----------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
39 /// Retrieve the scalar-to-vector mappings associated to the rule of
46 const StringRef ScalarName = CI.getCalledFunction()->getName(); in getVFABIMappings()
49 // The check for the vector-function-abi-variant attribute is done when in getVFABIMappings()
61 if (Shape && (Shape->ScalarName == ScalarName)) { in getVFABIMappings()
62 assert(CI.getModule()->getFunction(Shape->VectorName) && in getVFABIMappings()
77 // Other non-VFABI variants should be retrieved here. in getMappings()
[all …]
/freebsd/usr.bin/primes/
H A Dprimes.c13 * 2. Redistributions in binary form must reproduce the above copyright
34 * primes - generate a table of primes between two values
38 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
41 * primes [-h] [start [stop]]
44 * the value 18446744073709551615 (2^64-1) is assumed. If
69 * odd. If the base of table is 1, table[i] represents 2*i-1. After the
70 * sieve, table[i] == 1 if and only if 2*i-1 is prime.
94 while ((ch = getopt(argc, argv, "h")) != -1) in main()
103 argc -= optind; in main()
107 stop = (uint64_t)(-1); in main()
[all …]
/freebsd/usr.bin/factor/
H A Dfactor.c13 * 2. Redistributions in binary form must reproduce the above copyright
34 * factor - factor a number into primes
38 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
41 * factor [-h] [number] ...
43 * The form of the output is:
121 while ((ch = getopt(argc, argv, "h")) != -1) in main()
130 argc -= optind; in main()
147 /* Factor the arguments. */ in main()
157 * pr_fact - print the factors of a number
160 * A factor will be printed multiple times if it divides the value
[all …]
H A Dfactor.612 .\" 2. Redistributions in binary form must reproduce the above copyright
33 .\" chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
39 .Nm factor , primes
40 .Nd factor a number, generate primes
51 utility will factor positive integers.
56 If a factor divides a value more than once, it will be printed more than once.
68 Leading white-space and empty lines are ignored.
74 Numbers are terminated by a non-digit character (such as a newline).
114 value is terminated by a non-digit character (such as a newline).
116 .Bl -diag
[all …]
/freebsd/crypto/krb5/src/include/
H A Dk5-spake.h1 /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 /* include/k5-spake.h - SPAKE preauth mech declarations */
14 * * Redistributions in binary form must reproduce the above copyright
34 * The SPAKE preauth mechanism allows long-term client keys to be used for
36 * negotiated key can also be used for second-factor authentication. This
44 #include "k5-int.h"
47 * EncryptedData message and contains a second-factor challenge or response. */
61 * selection, public value, and second-factor challenge options. */
69 * value and encrypted second-factor response. */
72 krb5_enc_data factor; member
[all …]
/freebsd/sys/dev/clk/allwinner/
H A Daw_clk.h1 /*-
9 * 2. Redistributions in binary form must reproduce the above copyright
77 uint32_t shift; /* Shift bits for the factor */
78 uint32_t mask; /* Mask to get the factor, will be override by the clk methods */
79 uint32_t width; /* Number of bits for the factor */
101 aw_clk_get_factor(uint32_t val, struct aw_clk_factor *factor) in aw_clk_get_factor() argument
106 if (factor->flags & AW_CLK_FACTOR_HAS_COND) { in aw_clk_get_factor()
107 cond = (val & factor->cond_mask) >> factor->cond_shift; in aw_clk_get_factor()
108 if (cond != factor->cond_value) in aw_clk_get_factor()
112 if (factor->flags & AW_CLK_FACTOR_FIXED) in aw_clk_get_factor()
[all …]
H A Dccu_h6.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
11 * 2. Redistributions in binary form must reproduce the above copyright
47 #include <dt-bindings/clock/sun50i-h6-ccu.h>
48 #include <dt-bindings/reset/sun50i-h6-ccu.h>
50 /* Non-exported clocks */
117 CCU_GATE(CLK_BUS_PSI, "bus-psi", "psi_ahb1_ahb2", 0x79c, 0)
120 CCU_GATE(CLK_BUS_MMC0, "bus-mmc0", "ahb3", 0x84c, 0)
121 CCU_GATE(CLK_BUS_MMC1, "bus-mmc1", "ahb3", 0x84c, 1)
122 CCU_GATE(CLK_BUS_MMC2, "bus-mmc2", "ahb3", 0x84c, 2)
[all …]
H A Dccu_a10.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
11 * 2. Redistributions in binary form must reproduce the above copyright
47 #include <dt-bindings/clock/sun4i-a10-ccu.h>
48 #include <dt-bindings/clock/sun7i-a20-ccu.h>
49 #include <dt-bindings/reset/sun4i-a10-ccu.h>
51 /* Non-exported resets */
52 /* Non-exported clocks */
66 /* Non-exported fixed clocks */
106 CCU_GATE(CLK_AHB_OTG, "ahb-otg", "ahb", 0x60, 0)
[all …]
H A Dccu_a83t.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
11 * 2. Redistributions in binary form must reproduce the above copyright
47 #include <dt-bindings/clock/sun8i-a83t-ccu.h>
48 #include <dt-bindings/reset/sun8i-a83t-ccu.h>
50 /* Non-exported clocks */
76 /* Non-exported fixed clocks */
134 CCU_GATE(CLK_BUS_MIPI_DSI, "bus-mipi-dsi", "ahb1", 0x60, 1)
135 CCU_GATE(CLK_BUS_SS, "bus-ss", "ahb1", 0x60, 5)
136 CCU_GATE(CLK_BUS_DMA, "bus-dma", "ahb1", 0x60, 6)
[all …]
/freebsd/sys/dev/videomode/
H A Dvesagtf.h3 /*-
14 * 2. Redistributions in binary form must reproduce the above copyright
44 * think parts-per-thousand */
51 unsigned K; /* blanking formula scaling factor */
52 unsigned J; /* blanking formula scaling factor */
65 #define VESAGTF_K 128 /* blanking formula scaling factor */
66 #define VESAGTF_J 20 /* blanking formula scaling factor */
70 * GTF parameters, non-interlaced, and no margins.
/freebsd/sys/contrib/ck/include/
H A Dck_brlock.h2 * Copyright 2011-2015 Samy Al Bahra.
10 * 2. Redistributions in binary form must reproduce the above copyright
31 * Big reader spinlocks provide cache-local contention-free read
37 * This implementation is thread-agnostic which comes at the cost
68 br->readers = NULL; in ck_brlock_init()
69 br->writer = false; in ck_brlock_init()
83 while (ck_pr_fas_uint(&br->writer, true) == true) in ck_brlock_write_lock()
89 for (cursor = br->readers; cursor != NULL; cursor = cursor->next) { in ck_brlock_write_lock()
90 while (ck_pr_load_uint(&cursor->n_readers) != 0) in ck_brlock_write_lock()
103 ck_pr_store_uint(&br->writer, false); in ck_brlock_write_unlock()
[all …]
/freebsd/share/doc/usd/05.dc/
H A Ddc3 .\" Copyright (C) Caldera International Inc. 2001-2002.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
35 .EH 'USD:5-%''DC \- An Interactive Desk Calculator'
36 .OH 'DC \- An Interactive Desk Calculator''USD:5-%'
38 .\" ....TM 75-1271-8 39199 39199-11
41 DC \- An Interactive Desk Calculator
42 .AU "MH 2C-524" 3878
52 time-sharing system to do arbitrary-precision
54 It has provision for manipulating scaled fixed-point numbers and
77 time-sharing system
[all …]
/freebsd/sys/contrib/device-tree/Bindings/arm/
H A Dmicrochip,sparx5.yaml1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Lars Povlsen <lars.povlsen@microchip.com>
13 The Microchip Sparx5 SoC is a ARMv8-based used in a family of
14 gigabit TSN-capable gigabit switches.
16 The SparX-5 Ethernet switch family provides a rich set of switching
17 features such as advanced TCAM-based VLAN and QoS processing
19 TCAM-based frame processing using versatile content aware processor
27 - description: The Sparx5 pcb125 board is a modular board,
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedAccessPass.cpp1 //===- InterleavedAccessPass.cpp ------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
14 // DE-interleaving the data on a factor. An interleaved store writes several
15 // vectors to memory with RE-interleaving the data on a factor.
23 // E.g. An interleaved load (Factor = 2):
34 // E.g. An interleaved store (Factor = 3):
45 //===----------------------------------------------------------------------===//
77 #define DEBUG_TYPE "interleaved-access"
80 "lower-interleaved-accesses",
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h1 //===- Reassociate.h - Reassociate binary expressions -----------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 // For example: 4 + (x + 5) -> x + (4 + 5)
20 //===----------------------------------------------------------------------===//
58 /// Utility class representing a base and exponent pair which form one
59 /// factor of some product.
60 struct Factor { struct
64 Factor(Value *Base, unsigned Power) : Base(Base), Power(Power) {} in Factor() argument
98 Instruction::BinaryOpsEnd - Instruction::BinaryOpsBegin;
[all …]

12345678910>>...23