Home
last modified time | relevance | path

Searched full:steps (Results 1 – 25 of 1046) sorted by relevance

12345678910>>...42

/freebsd/sys/contrib/device-tree/Bindings/input/
H A Drotary-encoder.txt9 - rotary-encoder,steps: Number of steps in a full turnaround of the
14 device, hence no steps need to be passed.
16 greater than the specified steps or smaller than 0. For absolute axis only.
17 - rotary-encoder,steps-per-period: Number of steps (stable states) per period.
23 - rotary-encoder,encoding: String, the method used to encode steps.
28 This property is deprecated. Instead, a 'steps-per-period ' value should
29 be used, such as "rotary-encoder,steps-per-period = <2>".
47 rotary-encoder,steps = <24>;
H A Drotary-encoder.yaml28 rotary-encoder,steps:
32 Number of steps in a full turnaround of the
41 device, hence no steps need to be passed.
47 greater than the specified steps or smaller than 0. For absolute axis only.
49 rotary-encoder,steps-per-period:
54 Number of steps (stable states) per period.
64 description: the method used to encode steps.
72 This property is deprecated. Instead, a 'steps-per-period ' value should
73 be used, such as "rotary-encoder,steps-per-period = <2>".
/freebsd/contrib/libcbor/.circleci/
H A Dconfig.yml5 steps:
12 steps:
29 steps:
39 steps:
46 steps:
60 steps:
89 steps:
111 steps:
120 steps:
147 steps:
[all …]
/freebsd/lib/libc/stdlib/
H A Dtsearch_path.h44 uintptr_t steps[2]; member
63 p->steps[p->nsteps / STEPS_BIT] |= in path_taking_left()
73 p->steps[p->nsteps / STEPS_BIT] &= in path_taking_right()
87 result = p->steps[0] & 0x1; in path_took_left()
88 p->steps[0] = (p->steps[0] >> 1) | (p->steps[1] << (STEPS_BIT - 1)); in path_took_left()
89 p->steps[1] >>= 1; in path_took_left()
/freebsd/sys/contrib/openzfs/cmd/zstream/
H A Dzstream_chain.c40 * available to all chain steps.
131 * Validate chain and calculate number of steps, max packet size, and number
162 * adjacent steps. in validate_chain()
166 warnx("adjacent chain steps %d and %d declare " in validate_chain()
180 * Execute a chain of processing steps, some parallel and some serial.
191 * steps plus the parallel steps on either side of that block (if any).
192 * Adjacent parallel steps also receive a worker. This isn't a special case,
193 * it's just the same rule with the serial block consisting of zero steps.
195 * Parallel steps are double-covered, which is the intended behavior. If a
283 * It is not necessary to remove parallel steps from the input chain. They
H A Dzstream_chain.h31 * A chain is a linear series of steps that process packets of data. It's
76 * chain. (Steps that run in parallel must also identify a cost function; see
93 * **CHAIN ATTRIBUTES** - A global set of flags available to all steps. The
190 * It is not necessary to remove parallel steps from the input chain. They
/freebsd/sys/contrib/device-tree/Bindings/leds/backlight/
H A Dpwm-backlight.yaml45 num-interpolated-steps:
47 Number of interpolated steps between each value of brightness-levels
54 num-interpolated-steps: [brightness-levels]
78 // Example using num-interpolation-steps:
84 num-interpolated-steps = <2048>;
H A Dpwm-backlight.txt25 - num-interpolated-steps: Number of interpolated steps between each value
49 Example using num-interpolation-steps:
56 num-interpolated-steps = <2048>;
H A Dmediatek,mt6370-backlight.yaml16 capability with 2048 current steps (11 bits, only for MT6370/MT6371) or
17 16384 current steps (14 bits, only for MT6372) in exponential or linear
49 mediatek,bled-pwm-hys-input-th-steps:
55 resolution needs more than 64 steps.
H A Darc,arc2c0608.yaml46 steps)
71 01 = LOW 01 = 2 STEPS
72 10 - MEDIUM 10 = 4 STEPS
73 11 = HIGH 11 = 8 STEPS
/freebsd/sys/contrib/openzfs/.github/workflows/
H A Dlabels.yml14 steps:
24 steps:
34 steps:
44 steps:
H A Dcheckstyle.yaml14 steps:
53 if: failure() && steps.CheckABI.outcome == 'failure'
57 if: failure() && steps.CheckABI.outcome == 'failure'
61 if: failure() && steps.CheckABI.outcome == 'failure'
H A Dzfs-qemu.yml29 test_os: ${{ steps.os.outputs.os }}
30 ci_type: ${{ steps.os.outputs.ci_type }}
31 steps:
114 steps:
161 …run: .github/workflows/scripts/qemu-8-summary.sh '${{ steps.artifact-upload.outputs.artifact-url }…
172 steps:
/freebsd/sys/contrib/ck/include/
H A Dck_brlock.h111 unsigned int steps = 0; in ck_brlock_write_trylock() local
114 if (++steps >= factor) in ck_brlock_write_trylock()
128 if (++steps >= factor) { in ck_brlock_write_trylock()
224 unsigned int steps = 0; in ck_brlock_read_trylock() local
233 if (++steps >= factor) in ck_brlock_read_trylock()
262 if (++steps >= factor) in ck_brlock_read_trylock()
/freebsd/crypto/krb5/.github/workflows/
H A Dcifuzz.yml12 steps:
28 if: failure() && steps.build.outcome == 'success'
33 if: always() && steps.build.outcome == 'success'
/freebsd/contrib/sendmail/libmilter/docs/
H A Dxxfi_negotiate.html52 <TD>the protocol steps offered by the MTA.
64 <TD>the protocol steps requested by the milter.
83 If a milter just wants to inspect the available protocol steps
86 and the MTA will make all protocol steps and actions available
119 and the protocol steps (f1) were implicitly derived by checking whether
132 The protocol steps are defined in
139 Protocol steps
260 set the desired actions and protocol steps
/freebsd/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/
H A DLibCxxMap.cpp116 size_t steps = 0; in advance() local
119 count--, steps++; in advance()
120 if (m_error || m_entry.null() || (steps > m_max_depth)) in advance()
137 size_t steps = 0; in next() local
144 steps++; in next()
145 if (steps > m_max_depth) { in next()
158 size_t steps = 0; in tree_min() local
166 steps++; in tree_min()
167 if (steps > m_max_depth) in tree_min()
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/llquantize/
H A Dtst.steps.d44 printf("20 steps:\n");
47 printf("100 steps:\n");
50 printf("1000 steps:\n");
/freebsd/contrib/googletest/.github/ISSUE_TEMPLATE/
H A D00-bug_report.yml13 id: steps
15 label: Steps to reproduce the problem
16 …e problem that you are experiencing. Please provide all code and relevant steps to reproduce the p…
/freebsd/contrib/libsamplerate/
H A Dsrc_sinc.c388 { int steps = -data_index ; in calc_output_single() local
390 assert (steps <= int_div_ceil (filter_index, increment)) ; in calc_output_single()
391 filter_index -= increment * steps ; in calc_output_single()
392 data_index += steps ; in calc_output_single()
541 { int steps = int_div_ceil (-data_index, 2) ; in calc_output_stereo() local
543 assert (steps <= int_div_ceil (filter_index, increment)) ; in calc_output_stereo()
544 filter_index -= increment * steps ; in calc_output_stereo()
545 data_index += steps * 2; in calc_output_stereo()
696 { int steps = int_div_ceil (-data_index, 4) ; in calc_output_quad() local
698 assert (steps <= int_div_ceil (filter_index, increment)) ; in calc_output_quad()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DLogger.cpp52 unsigned Blocks = 0, Steps = 0; in endAnalysis() local
55 Steps += E.second; in endAnalysis()
58 << Steps << " total steps ===\n"; in endAnalysis()
/freebsd/crypto/openssh/.github/workflows/
H A Dvm.yml25 steps:
88 steps:
170 steps:
245 steps:
302 steps:
350 steps:
379 if: steps.cache-sysupgrade.outputs.cache-hit == 'true'
388 if: steps.cache-sysupgrade.outputs.cache-hit != 'true'
393 if: steps.cache-sysupgrade.outputs.cache-hit != 'true'
451 steps:
/freebsd/crypto/openssl/crypto/slh_dsa/
H A Dslh_wots.c48 * This is effectively a cutdown version of Algorithm 7: steps 3 to 6
76 * Iterates using a hash function on the input |steps| times starting at index
83 * @param steps The number of iterations starting from |start_index|
84 * Note |start_index| + |steps| < w
93 uint8_t start_index, uint8_t steps, in slh_wots_chain() argument
106 if (steps == 0) in slh_wots_chain()
116 end_index = start_index + steps; in slh_wots_chain()
/freebsd/contrib/ntp/scripts/
H A Dsummary-opts36 'skip-time-steps' => '3600',
43 'peer-dist-limit=f', 'skip-time-steps=f', 'start-date=i',
54 --skip-time-steps=float Ignore time offsets larger that this
/freebsd/sys/contrib/zstd/lib/
H A Dzdict.h192 * Redirect towards ZDICT_optimizeTrainFromBuffer_fastCover() single-threaded, with d=8, steps=4,
316 …unsigned steps; /* Number of steps : Only used for optimization : 0 means default (40… member
328 …unsigned steps; /* Number of steps : Only used for optimization : 0 means default (40… member
363 * All of the parameters d, k, steps are optional.
365 * if steps is zero it defaults to its default value.
366 …* If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [5…
405 * All of the parameters d, k, steps, f, and accel are optional.
407 * if steps is zero it defaults to its default value.
408 …* If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [5…

12345678910>>...42