| /freebsd/sys/contrib/device-tree/Bindings/soc/ti/ |
| H A D | keystone-navigator-qmss.txt | 55 - accumulator : pool of queues on PDSP accumulator channel
64 -- accumulator : Accumulator channel specification. Any of the PDSPs in
65 QMSS can be loaded with the accumulator firmware. The
66 accumulator firmware’s job is to poll a select number of
71 accumulator triggers an interrupt to the host to read
75 queues. Accumulator channel property is specified as:
77 pdsp-id : QMSS PDSP running accumulator firmware
80 channel : Accumulator channel number
81 entries : Size of the accumulator descriptor list
188 accumulator {
[all …]
|
| /freebsd/contrib/arm-optimized-routines/networking/arm/ |
| H A D | chksum_simd.c | 43 /* Set accumulator */ in __chksum_arm_simd()
96 /* Add to accumulator */ in __chksum_arm_simd()
104 /* Add to accumulator */ in __chksum_arm_simd()
124 /* Add to accumulator */ in __chksum_arm_simd()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCRegisterInfoMMA.td | 27 // differentiate a primed accumulator from an unprimed accumulator.
34 // SPE Accumulator for multiply-accumulate SPE operations. Never directly
89 // ones, to reduce interference with accumulator registers (lower 32 VSRs).
|
| /freebsd/contrib/bearssl/src/symcipher/ |
| H A D | poly1305_i15.c | 93 * Add the accumulator to the decoded block (modular in poly1305_inner()
101 * Multiply by r, result is the new accumulator value. in poly1305_inner()
182 * Accumulator is 0. in br_poly1305_i15_run()
203 * Add the value 's' to the accumulator. That addition is done in br_poly1305_i15_run()
|
| H A D | poly1305_ctmul.c | 28 * Perform the inner processing of blocks for Poly1305. The accumulator
32 * On output, all accumulator words fit on 26 bits, except acc[1], which
89 * is added to the accumulator. in poly1305_inner()
190 * Accumulator is 0. in br_poly1305_ctmul_run()
241 * Convert back the accumulator to 32-bit words, and add the in br_poly1305_ctmul_run()
|
| H A D | poly1305_ctmulq.c | 52 * The "accumulator" word is nominally a 130-bit value. We split it into
55 * If the current accumulator is a = a0 + a1*W + a2*W^2 (where W = 2^44)
85 * the accumulator are then:
374 * Accumulator is 0. in br_poly1305_ctmulq_run()
|
| H A D | poly1305_ctmul32.c | 69 * is added to the accumulator. in poly1305_inner()
224 * Accumulator is 0. in br_poly1305_ctmul32_run()
270 * Convert back the accumulator to 32-bit words, and add the in br_poly1305_ctmul32_run()
|
| /freebsd/sys/x86/include/ |
| H A D | fpu.h | 53 /* Contents of each x87 floating point accumulator. */
61 struct fpacc87 sv_ac[8]; /* accumulator contents, 0-7 */
66 /* Contents of each SSE extended accumulator. */
71 /* Contents of the upper 16 bytes of each AVX extended accumulator. */
|
| /freebsd/share/man/man4/ |
| H A D | bpf.4 | 827 which consists of an accumulator, index register, scratch memory store,
868 We use the convention that A is the accumulator, X is the index register,
890 These instructions copy a value into the accumulator.
930 the addressing modes are more restrictive than those of the accumulator loads,
941 This instruction stores the accumulator into the scratch memory.
953 The alu instructions perform operations between the accumulator and
954 index register or constant, and store the result back in the accumulator.
985 compare the accumulator against a constant
1015 or the accumulator
1026 that copy the index register to the accumulator or vice versa.
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | TailRecursionElimination.cpp | 19 // accumulator variable, thus compiling the typical naive factorial or
423 // The below are shared state needed when performing accumulator recursion.
425 // find an elimination that requires an accumulator.
565 // Start by inserting a new PHI node for the accumulator. in insertAccumulator()
568 "accumulator.tr"); in insertAccumulator()
574 // (due to other tail recursions eliminated) the accumulator is not modified. in insertAccumulator()
654 // using accumulator recursion elimination. Check to see if this is the in eliminateCall()
659 // Yes, this is accumulator recursion. Remember which instruction in eliminateCall()
703 // Rewrite the accumulator recursion instruction so that it does not use in eliminateCall()
769 // We need to insert a copy of our accumulator instruction before any in cleanupAndFinalize()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.h | 19 /// Add the accumulator chaining constraint to a PBQP graph
29 // Add the accumulator chaining constraint, inside the chain, i.e. so that
|
| /freebsd/contrib/llvm-project/clang/lib/Headers/ |
| H A D | amxintrin.h | 137 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
156 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
175 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
194 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
352 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
375 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
398 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
421 /// Compute dot-product of bytes in tiles with a source/destination accumulator.
|
| /freebsd/sys/powerpc/fpu/ |
| H A D | fpu_mul.c | 59 * Each step consists of shifting the accumulator right one bit
61 * adding the multiplicand (x) to the accumulator. Then, in any case,
72 * The resultant accumulator (A) is the product's mantissa. It may
77 * accumulator as four separate words, just like any other mantissa.
|
| /freebsd/sys/contrib/device-tree/Bindings/iio/adc/ |
| H A D | microchip,pac1934.yaml | 7 title: Microchip PAC1934 Power Monitors with Accumulator
14 Accumulator.
|
| /freebsd/sys/contrib/device-tree/Bindings/hwmon/ |
| H A D | adi,ltc2947.yaml | 33 adi,accumulator-ctl-pol:
98 adi,accumulator-ctl-pol = <0 1>;
|
| /freebsd/sys/dev/sound/pci/ |
| H A D | es137x.h | 166 #define ES1371_DIS_R1 (1<<19) /* record channel accumulator update disable */
167 #define ES1371_DIS_P2 (1<<20) /* playback channel 2 accumulator update disable */
168 #define ES1371_DIS_P1 (1<<21) /* playback channel 1 accumulator update disable */
|
| /freebsd/sys/dev/aic7xxx/aicasm/ |
| H A D | aicasm_gram.y | 72 static symbol_ref_t accumulator; variable
351 | accumulator
519 accumulator:
522 if (accumulator.symbol != NULL) {
523 stop("Only one accumulator definition allowed",
527 accumulator.symbol = cur_symbol;
888 if (accumulator.symbol == NULL) {
889 stop("No accumulator has been defined", EX_DATAERR);
892 $$.symbol = accumulator.symbol;
916 "references the accumulator.\n "
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseUtil.h | 73 /// that record are added to this accumulator. Coverage is later computed
77 /// Note that this accumulator tracks samples used from a single function
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ComplexDeinterleavingPass.cpp | 335 /// and \p ImagAddens. If \p Accumulator is not null, add the result to it.
341 NodePtr Accumulator);
348 /// \p RealMuls and \p ImagMuls. If \p Accumulator is not null, add the result
352 NodePtr Accumulator);
1081 // accumulator in identifyReassocNodes()
1156 NodePtr Accumulator = nullptr) { in identifyMultiplications() argument
1197 NodePtr Result = Accumulator; in identifyMultiplications()
1313 std::optional<FastMathFlags> Flags, NodePtr Accumulator = nullptr) { in identifyAdditions() argument
1318 // If we have accumulator use it as first addend in identifyAdditions()
1319 if (Accumulator) in identifyAdditions()
[all …]
|
| /freebsd/crypto/openssl/crypto/bn/asm/ |
| H A D | bn-c64xplus.asm | 57 [B0] ZERO A19 ; high part of accumulator
87 [B0] ZERO A19 ; high part of accumulator
234 || ZERO B19 ; high part of accumulator
274 || ZERO.S B19 ; high part of accumulator
300 || ZERO B19 ; high part of accumulator
|
| /freebsd/libexec/bootpd/ |
| H A D | hash.c | 139 * accumulator and then adds the byte into the accumulator. The contents of
140 * the accumulator is returned after the entire string has been processed.
|
| /freebsd/sys/contrib/zlib/ |
| H A D | infback.c | 141 /* Clear the input bit accumulator */
162 /* Get a byte of input into the bit accumulator, or return from inflateBack()
172 /* Assure that there are at least n bits in the bit accumulator. If there is
181 /* Return the low n bits of the bit accumulator (n < 16) */
185 /* Remove n bits from the bit accumulator */
|
| H A D | inflate.h | 101 /* bit accumulator */
102 unsigned long hold; /* input bit accumulator */
|
| /freebsd/crypto/openssh/ |
| H A D | sandbox-seccomp-filter.c | 116 /* reload syscall number; all rules expect it in accumulator */ \
134 /* reload syscall number; all rules expect it in accumulator */ \
152 /* reload syscall number; all rules expect it in accumulator */ \
178 /* reload syscall number; all rules expect it in accumulator */ \
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMParallelDSP.cpp | 132 /// Add the incoming accumulator value, returns true if a value had not
134 /// reduction already has a value to initialise the accumulator.
429 // If we find a non-instruction, try to use it as the initial accumulator in Search()
443 // Could be the accumulator value. in Search()
448 // accumulator value at which point we should stop searching. in Search()
458 // Ensure we don't add the root as the incoming accumulator. in Search()
|