Home
last modified time | relevance | path

Searched full:c1 (Results 1 – 25 of 988) sorted by relevance

12345678910>>...40

/freebsd/crypto/openssl/crypto/bn/asm/
H A Dx86_64-gcc.c113 BN_ULONG c1 = 0; in bn_mul_add_words() local
116 return c1; in bn_mul_add_words()
119 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
120 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
121 mul_add(rp[2], ap[2], w, c1); in bn_mul_add_words()
122 mul_add(rp[3], ap[3], w, c1); in bn_mul_add_words()
128 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
130 return c1; in bn_mul_add_words()
131 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
133 return c1; in bn_mul_add_words()
[all …]
H A Ds390x.S364 #define c1 %r1 macro
368 #define mul_add_c(ai,bi,c1,c2,c3) \ argument
371 algr c1,%r7; \
382 lghi c1,0
387 mul_add_c(0,0,c1,c2,c3);
388 stg c1,0*8(%r2)
389 lghi c1,0
391 mul_add_c(0,1,c2,c3,c1);
392 mul_add_c(1,0,c2,c3,c1);
396 mul_add_c(2,0,c3,c1,c2);
[all …]
H A Dsparcv8.S568 umul a_0,b_0,c_1 !=!mul_add_c(a[0],b[0],c1,c2,c3);
571 st c_1,rp(0) !r[0]=c1;
573 umul a_0,b_1,t_1 !=!mul_add_c(a[0],b[1],c2,c3,c1);
580 umul a_1,b_0,t_1 !mul_add_c(a[1],b[0],c2,c3,c1);
587 umul a_2,b_0,t_1 !mul_add_c(a[2],b[0],c3,c1,c2);
593 umul a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2);
599 umul a_0,b_2,t_1 !mul_add_c(a[0],b[2],c3,c1,c2);
606 umul a_0,b_3,t_1 !mul_add_c(a[0],b[3],c1,c2,c3);
611 umul a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3);
617 umul a_2,b_1,t_1 !mul_add_c(a[2],b[1],c1,c2,c3);
[all …]
H A Dsparcv8plus.S678 mulx a_0,b_0,t_1 !mul_add_c(a[0],b[0],c1,c2,c3);
680 stuw t_1,rp(0) !=!r[0]=c1;
683 mulx a_0,b_1,t_1 !mul_add_c(a[0],b[1],c2,c3,c1);
689 mulx a_1,b_0,t_1 !=!mul_add_c(a[1],b[0],c2,c3,c1);
697 mulx a_2,b_0,t_1 !mul_add_c(a[2],b[0],c3,c1,c2);
703 mulx a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2);
708 mulx a_0,b_2,t_1 !mul_add_c(a[0],b[2],c3,c1,c2);
716 mulx a_0,b_3,t_1 !mul_add_c(a[0],b[3],c1,c2,c3);
721 mulx a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3);
726 mulx a_2,b_1,t_1 !mul_add_c(a[2],b[1],c1,c2,c3);
[all …]
H A Dppc.pl287 # r9,r10, r11 are the equivalents of c1,c2, c3.
294 #sqr_add_c(a,0,c1,c2,c3)
298 #to add since c1=c2=c3=0.
302 $ST r9,`0*$BNSZ`(r3) # r[0]=c1;
303 # sqr_add_c2(a,1,0,c2,c3,c1);
318 #sqr_add_c(a,1,c3,c1,c2)
324 #sqr_add_c2(a,2,0,c3,c1,c2)
337 #sqr_add_c2(a,3,0,c1,c2,c3);
348 #sqr_add_c2(a,2,1,c1,c2,c3);
360 $ST r9,`3*$BNSZ`(r3) #r[3]=c1
[all …]
H A Dmips.pl1097 $MULTU ($a_0,$b_0) # mul_add_c(a[0],b[0],c1,c2,c3);
1107 $MULTU ($a_0,$b_1) # mul_add_c(a[0],b[1],c2,c3,c1);
1116 $MULTU ($a_1,$b_0) # mul_add_c(a[1],b[0],c2,c3,c1);
1120 $ST $c_1,0($a0) # r[0]=c1;
1125 $MULTU ($a_2,$b_0) # mul_add_c(a[2],b[0],c3,c1,c2);
1135 $MULTU ($a_1,$b_1) # mul_add_c(a[1],b[1],c3,c1,c2);
1142 $MULTU ($a_0,$b_2) # mul_add_c(a[0],b[2],c3,c1,c2);
1150 $MULTU ($a_0,$b_3) # mul_add_c(a[0],b[3],c1,c2,c3);
1161 $MULTU ($a_1,$b_2) # mul_add_c(a[1],b[2],c1,c2,c3);
1169 $MULTU ($a_2,$b_1) # mul_add_c(a[2],b[1],c1,c2,c3);
[all …]
/freebsd/crypto/openssl/crypto/bn/
H A Dbn_asm.c20 BN_ULONG c1 = 0; in bn_mul_add_words() local
24 return c1; in bn_mul_add_words()
28 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
29 mul_add(rp[1], ap[1], w, c1); in bn_mul_add_words()
30 mul_add(rp[2], ap[2], w, c1); in bn_mul_add_words()
31 mul_add(rp[3], ap[3], w, c1); in bn_mul_add_words()
38 mul_add(rp[0], ap[0], w, c1); in bn_mul_add_words()
44 return c1; in bn_mul_add_words()
49 BN_ULONG c1 = 0; in bn_mul_words() local
53 return c1; in bn_mul_words()
[all …]
/freebsd/tools/test/sort/bigtest/
H A Dkcmd103 for c1 in 1 2 3 4 5 10 15 20 25 30
105 echo ${LANG} ${KEYS} ${f1} ${c1}
107 ${BSDSORT} ${KEYS} +${f1}.${c1} ${INPUT_FILE} -o siks/sik1
110 echo ${LANG} ${KEYS} +${f1}.${c1} crash +- >> test.log
113 ${GNUSORT} ${KEYS} +${f1}.${c1} ${INPUT_FILE} -o siks/sik2
114 if ! ${FILECMP} siks/sik1 siks/sik2 >siks/res.${f1}.${c1} 2>&1 ; then
115 echo ${LANG} ${KEYS} +${f1}.${c1} error +- >> test.log
117 ${BSDSORT} -c ${KEYS} +${f1}.${c1} siks/sik1
120 echo ${LANG} ${KEYS} +${f1}.${c1} -c error +- >> test.log
122 rm siks/res.${f1}.${c1}
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_pwhash/argon2/
H A Dblamka-round-avx2.h12 #define G1_AVX2(A0, A1, B0, B1, C0, C1, D0, D1) \ argument
33 ml = _mm256_mul_epu32(C1, D1); \
35 C1 = _mm256_add_epi64(C1, _mm256_add_epi64(D1, ml)); \
37 B1 = _mm256_xor_si256(B1, C1); \
41 #define G2_AVX2(A0, A1, B0, B1, C0, C1, D0, D1) \ argument
61 ml = _mm256_mul_epu32(C1, D1); \
63 C1 = _mm256_add_epi64(C1, _mm256_add_epi64(D1, ml)); \
64 B1 = _mm256_xor_si256(B1, C1); \
68 #define DIAGONALIZE_1(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
75 C1 = _mm256_permute4x64_epi64(C1, _MM_SHUFFLE(1, 0, 3, 2)); \
[all …]
H A Dblamka-round-avx512f.h17 #define G1_AVX512F(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
29 C1 = muladd(C1, D1); \
32 B1 = _mm512_xor_si512(B1, C1); \
38 #define G2_AVX512F(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
50 C1 = muladd(C1, D1); \
53 B1 = _mm512_xor_si512(B1, C1); \
59 #define DIAGONALIZE(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
65 C1 = _mm512_permutex_epi64(C1, _MM_SHUFFLE(1, 0, 3, 2)); \
71 #define UNDIAGONALIZE(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
77 C1 = _mm512_permutex_epi64(C1, _MM_SHUFFLE(1, 0, 3, 2)); \
[all …]
H A Dblamka-round-ssse3.h31 #define G1(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
43 C1 = fBlaMka(C1, D1); \
46 B1 = _mm_xor_si128(B1, C1); \
52 #define G2(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
64 C1 = fBlaMka(C1, D1); \
67 B1 = _mm_xor_si128(B1, C1); \
73 #define DIAGONALIZE(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
81 C0 = C1; \
82 C1 = t0; \
90 #define UNDIAGONALIZE(A0, B0, C0, D0, A1, B1, C1, D1) \ argument
[all …]
/freebsd/bin/sh/tests/expansion/
H A Dtrim8.06 c1=e
14 s=$c1$c2$c3$c4
35 testcase 'set -- "${s#$c1}"' "1|$c2$c3$c4"
36 testcase 'set -- "${s#$c1$c2}"' "1|$c3$c4"
37 testcase 'set -- "${s#$c1$c2$c3}"' "1|$c4"
38 testcase 'set -- "${s#$c1$c2$c3$c4}"' "1|"
44 testcase 'set -- "${s%$c4}"' "1|$c1$c2$c3"
45 testcase 'set -- "${s%$c3$c4}"' "1|$c1$c2"
46 testcase 'set -- "${s%$c2$c3$c4}"' "1|$c1"
47 testcase 'set -- "${s%$c1$c2$c3$c4}"' "1|"
[all …]
/freebsd/contrib/libdivsufsort/lib/
H A Ddivsufsort.c47 saint_t c0, c1; in sort_typeBstar() local
62 do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1)); in sort_typeBstar()
65 ++BUCKET_BSTAR(c0, c1); in sort_typeBstar()
68 for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { in sort_typeBstar()
69 ++BUCKET_B(c0, c1); in sort_typeBstar()
85 for(c1 = c0 + 1; c1 < ALPHABET_SIZE; ++c1) { in sort_typeBstar()
86 j += BUCKET_BSTAR(c0, c1); in sort_typeBstar()
87 BUCKET_BSTAR(c0, c1) = j; /* end point */ in sort_typeBstar()
88 i += BUCKET_B(c0, c1); in sort_typeBstar()
96 t = PAb[i], c0 = T[t], c1 = T[t + 1]; in sort_typeBstar()
[all …]
/freebsd/usr.sbin/sa/
H A Dmain.c389 struct cmdinfo c1, c2; in cmp_usrsys() local
392 memcpy(&c1, d1->data, sizeof(c1)); in cmp_usrsys()
395 t1 = c1.ci_utime + c1.ci_stime; in cmp_usrsys()
401 return (cmp_comm(c1.ci_comm, c2.ci_comm)); in cmp_usrsys()
410 struct cmdinfo c1, c2; in cmp_avgusrsys() local
413 memcpy(&c1, d1->data, sizeof(c1)); in cmp_avgusrsys()
416 t1 = c1.ci_utime + c1.ci_stime; in cmp_avgusrsys()
417 t1 /= (double) (c1.ci_calls ? c1.ci_calls : 1); in cmp_avgusrsys()
425 return (cmp_comm(c1.ci_comm, c2.ci_comm)); in cmp_avgusrsys()
434 struct cmdinfo c1, c2; in cmp_dkio() local
[all …]
/freebsd/bin/sh/tests/builtins/
H A Dcase5.06 c1=e
15 case $c1$c2$c3$c4 in
23 case $c1$c2$c3$c4 in
24 $c1$c2$c3$c4) ;;
28 case $c1$c2$c3$c4 in
29 "$c1$c2$c3$c4") ;;
33 case $c1$c2$c3$c4 in
38 case $c1.$c2.$c3.$c4 in
43 case $c1$c2$c3$c4 in
48 case $c1$c2$c3$c4 in
[all …]
H A Dcase6.06 c1=e
15 case $c1$c2$c3$c4 in
23 case $c1$c2$c3$c4 in
24 $c1$c2$c3$c4) ;;
28 case $c1$c2$c3$c4 in
29 "$c1$c2$c3$c4") ;;
33 case $c1$c2$c3$c4 in
38 case $c1$c2$c3$c4 in
43 case $c1$c2$c3$c4 in
44 [$c1][$c2][$c3][$c4]) ;;
[all …]
/freebsd/contrib/mtree/
H A Dspecspec.c196 NODE *c1, *c2, *n1, *n2; in walk_in_the_forest() local
202 c1 = t1->child; in walk_in_the_forest()
204 c1 = NULL; in walk_in_the_forest()
209 while (c1 != NULL || c2 != NULL) { in walk_in_the_forest()
211 if (c1 != NULL) in walk_in_the_forest()
212 n1 = c1->next; in walk_in_the_forest()
215 if (c1 != NULL && c2 != NULL) { in walk_in_the_forest()
216 if (c1->type != F_DIR && c2->type == F_DIR) { in walk_in_the_forest()
219 } else if (c1->type == F_DIR && c2->type != F_DIR) { in walk_in_the_forest()
220 n1 = c1; in walk_in_the_forest()
[all …]
/freebsd/sys/arm/include/
H A Dsysreg.h44 #define CP14_DBGDSCRext_V6(rr) p14, 0, rr, c0, c1, 0 /* Debug Status and Ctrl Register v6 */
47 #define CP14_DBGOSLAR(rr) p14, 0, rr, c1, c0, 4 /* OS Lock Access Register */
48 #define CP14_DBGOSLSR(rr) p14, 0, rr, c1, c1, 4 /* OS Lock Status Register */
49 #define CP14_DBGOSDLR(rr) p14, 0, rr, c1, c3, 4 /* OS Double Lock Register */
50 #define CP14_DBGPRSR(rr) p14, 0, rr, c1, c5, 4 /* Device Powerdown and Reset Status */
64 #define CP15_ID_PFR0(rr) p15, 0, rr, c0, c1, 0 /* Processor Feature Register 0 */
65 #define CP15_ID_PFR1(rr) p15, 0, rr, c0, c1, 1 /* Processor Feature Register 1 */
66 #define CP15_ID_DFR0(rr) p15, 0, rr, c0, c1, 2 /* Debug Feature Register 0 */
67 #define CP15_ID_AFR0(rr) p15, 0, rr, c0, c1, 3 /* Auxiliary Feature Register 0 */
68 #define CP15_ID_MMFR0(rr) p15, 0, rr, c0, c1, 4 /* Memory Model Feature Register 0 */
[all …]
/freebsd/sys/libkern/
H A Diconv_xlat16.c121 uint16_t c1, c2, ctmp; in iconv_xlat16_conv() local
134 c1 = ir > 1 ? *(src+1) & 0xff : 0; in iconv_xlat16_conv()
138 c1 = c2 & 0x80 ? c1 | 0x100 : c1; in iconv_xlat16_conv()
141 if (ir > 1 && dp->d_table[c1] && dp->d_table[c1][c2]) { in iconv_xlat16_conv()
155 c1 = C2I1(ctmp); in iconv_xlat16_conv()
161 c1 &= 0xff00; in iconv_xlat16_conv()
162 if (!dp->d_table[c1]) { in iconv_xlat16_conv()
172 code = dp->d_table[c1][c2]; in iconv_xlat16_conv()
186 c1 = C2I1(ctmp << 8); in iconv_xlat16_conv()
191 code = dp->d_table[c1][c2]; in iconv_xlat16_conv()
[all …]
/freebsd/contrib/bzip2/
H A Dblocksort.c355 UChar c1, c2; in mainGtU() local
360 c1 = block[i1]; c2 = block[i2]; in mainGtU()
361 if (c1 != c2) return (c1 > c2); in mainGtU()
364 c1 = block[i1]; c2 = block[i2]; in mainGtU()
365 if (c1 != c2) return (c1 > c2); in mainGtU()
368 c1 = block[i1]; c2 = block[i2]; in mainGtU()
369 if (c1 != c2) return (c1 > c2); in mainGtU()
372 c1 = block[i1]; c2 = block[i2]; in mainGtU()
373 if (c1 != c2) return (c1 > c2); in mainGtU()
376 c1 = block[i1]; c2 = block[i2]; in mainGtU()
[all …]
/freebsd/lib/libc/iconv/
H A Dcitrus_bcs.c45 int c1, c2; in _citrus_bcs_strcasecmp() local
47 c1 = c2 = 1; in _citrus_bcs_strcasecmp()
49 while (c1 && c2 && c1 == c2) { in _citrus_bcs_strcasecmp()
50 c1 = _bcs_toupper(*str1++); in _citrus_bcs_strcasecmp()
54 return ((c1 == c2) ? 0 : ((c1 > c2) ? 1 : -1)); in _citrus_bcs_strcasecmp()
64 int c1, c2; in _citrus_bcs_strncasecmp() local
66 c1 = c2 = 1; in _citrus_bcs_strncasecmp()
68 while (c1 && c2 && c1 == c2 && sz != 0) { in _citrus_bcs_strncasecmp()
69 c1 = _bcs_toupper(*str1++); in _citrus_bcs_strncasecmp()
74 return ((c1 == c2) ? 0 : ((c1 > c2) ? 1 : -1)); in _citrus_bcs_strncasecmp()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DConstantFold.cpp609 Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode, Constant *C1, in ConstantFoldBinaryInstruction() argument
616 Opcode, C1->getType(), /*AllowRHSIdentity*/ false)) { in ConstantFoldBinaryInstruction()
617 if (C1 == Identity) in ConstantFoldBinaryInstruction()
620 return C1; in ConstantFoldBinaryInstruction()
622 Opcode, C1->getType(), /*AllowRHSIdentity*/ true)) { in ConstantFoldBinaryInstruction()
624 return C1; in ConstantFoldBinaryInstruction()
628 if (isa<PoisonValue>(C1) || isa<PoisonValue>(C2)) in ConstantFoldBinaryInstruction()
629 return PoisonValue::get(C1->getType()); in ConstantFoldBinaryInstruction()
633 bool IsScalableVector = isa<ScalableVectorType>(C1->getType()); in ConstantFoldBinaryInstruction()
635 (!C1->getType()->isVectorTy() || IsScalableVector) && in ConstantFoldBinaryInstruction()
[all …]
/freebsd/tests/sys/netpfil/pf/
H A Dmbuf.sh55 atf_check -s exit:0 -o ignore ping -c1 192.0.2.2
61 atf_check -s not-exit:0 -o ignore ping -c1 -t1 192.0.2.2
67 atf_check -s exit:0 -o ignore ping -c1 192.0.2.2
73 atf_check -s exit:0 -o ignore ping -c1 192.0.2.2
79 atf_check -s exit:0 -o ignore ping -c1 192.0.2.2
86 atf_check -s exit:0 -o ignore ping -c1 192.0.2.2
113 atf_check -s exit:0 -o ignore ping -c1 2001:db8::2
120 atf_check -s not-exit:0 -o ignore ping -c1 -t1 2001:db8::2
132 atf_check -s exit:0 -o ignore ping -c1 2001:db8::2
138 atf_check -s exit:0 -o ignore ping -c1 2001:db8::2
[all …]
/freebsd/usr.bin/sort/
H A Dvsort.c115 cmp_chars(wchar_t c1, wchar_t c2) in cmp_chars() argument
118 if (c1 == c2) in cmp_chars()
121 if (c1 == L'~') in cmp_chars()
126 if (isdigit_clocale(c1) || !c1) in cmp_chars()
132 if (isalpha_clocale(c1)) in cmp_chars()
133 return ((isalpha_clocale(c2)) ? ((int) c1 - (int) c2) : -1); in cmp_chars()
138 return ((int) c1 - (int) c2); in cmp_chars()
153 wchar_t c1, c2; in cmpversions() local
155 c1 = (si1 < se1) ? bws_get_iter_value(si1) : 0; in cmpversions()
158 cmp = cmp_chars(c1, c2); in cmpversions()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineShifts.cpp359 Constant *C0, *C1; in foldShiftOfShiftedBinOp() local
360 if (!match(I.getOperand(1), m_Constant(C1))) in foldShiftOfShiftedBinOp()
380 match(ConstantExpr::getAdd(C0, C1), in foldShiftOfShiftedBinOp()
396 // shift (binop (shift X, C0), Y), C1 -> binop (shift X, C0+C1), (shift Y, C1) in foldShiftOfShiftedBinOp()
397 Constant *ShiftSumC = ConstantExpr::getAdd(C0, C1); in foldShiftOfShiftedBinOp()
399 Value *NewShift2 = Builder.CreateBinOp(ShiftOpcode, Y, C1); in foldShiftOfShiftedBinOp()
439 // C shift (A add nuw C1) --> (C shift C1) shift A in commonShiftTransforms()
441 Constant *C, *C1; in commonShiftTransforms() local
443 match(Op1, m_NUWAddLike(m_Value(A), m_Constant(C1)))) { in commonShiftTransforms()
444 Value *NewC = Builder.CreateBinOp(I.getOpcode(), C, C1); in commonShiftTransforms()
[all …]

12345678910>>...40