Home
last modified time | relevance | path

Searched refs:Q (Results 1 – 25 of 892) sorted by relevance

12345678910>>...36

/freebsd/bin/sh/tests/expansion/
H A Dtrim9.024 testcase 'shift $#; set -- "${*#Q}"' '1|'
25 testcase 'shift $#; set -- "${*##Q}"' '1|'
26 testcase 'shift $#; set -- "${*%Q}"' '1|'
27 testcase 'shift $#; set -- "${*%%Q}"' '1|'
28 testcase 'set -- Q R; set -- "${*#Q}"' '1| R'
29 testcase 'set -- Q R; set -- "${*##Q}"' '1| R'
30 testcase 'set -- Q R; set -- "${*%R}"' '1|Q '
31 testcase 'set -- Q R; set -- "${*%%R}"' '1|Q '
32 testcase 'set -- Q R; set -- "${*#S}"' '1|Q R'
33 testcase 'set -- Q R; set -- "${*##S}"' '1|Q R'
[all …]
/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-edge.mk138 INP= ${:U\\:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:S,\\,x,g}
139 PAT= ${:U\\:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:Q:S,\\,*,g}
158 MOD= ${INP:%.c=%.o:Q}
159 EXP= file.o:Q file.cc
H A Ddollar.mk40 $T '1 dollar default' ''${:U$:Q}
41 $T '2 dollar default' ''${:U$$:Q}
42 $T '4 dollar default' ''${:U$$$$:Q}
45 $T '1 dollar variable' ''${DOLLAR1:Q}
46 $T '2 dollar variable' ''${DOLLAR2:Q}
47 $T '4 dollar variable' ''${DOLLAR4:Q}
50 $T '1 dollar var-default' ''${:U${DOLLAR1}:Q}
51 $T '2 dollar var-default' ''${:U${DOLLAR2}:Q}
52 $T '4 dollar var-default' ''${:U${DOLLAR4}:Q}
56 $T 'S,$$,word,' ''${DOLLAR_XY:S,$,word,:Q}
[all …]
H A Dvarfind.mk18 @echo $@: long ${.ALLSRC:Q}
19 @echo $@: abbr ${>:Q}
20 @echo $@: long ${.ARCHIVE:Q}
21 @echo $@: abbr ${!:Q}
22 @echo $@: long ${.IMPSRC:Q}
23 @echo $@: abbr ${<:Q}
24 @echo $@: long ${.MEMBER:Q}
25 @echo $@: abbr ${%:Q}
26 @echo $@: long ${.OODATE:Q}
27 @echo $@: abbr ${?:Q}
[all …]
H A Dvarmod-subst-regex.mk138 @echo $@: ${:Uword1 word2:C,****,____,g:C,word,____,:Q}.
143 @echo $@:11-missing:${:U1 23 456:C,..,\1\1,:Q}
145 @echo $@:11-ok:${:U1 23 456:C,(.).,\1\1,:Q}
147 @echo $@:22-missing:${:U1 23 456:C,..,\2\2,:Q}
149 @echo $@:22-missing:${:U1 23 456:C,(.).,\2\2,:Q}
151 @echo $@:22-ok:${:U1 23 456:C,(.)(.),\2\2,:Q}
201 @echo $@.1: ${:U 1:C,1(.*)|2(.*),(\1)(\2),:Q} # missing \2
202 @echo $@.1: ${:U 1:C,1(.*)|2(.*),(\1)(\2),:Q} # missing \2
203 @echo $@.2: ${:U 2:C,1(.*)|2(.*),(\1)(\2),:Q} # missing \1
204 @echo $@.3: ${:U 3:C,1(.*)|2(.*),(\1)(\2),:Q}
[all …]
H A Dvarname-makeflags.mk51 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
59 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
66 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
103 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
128 @echo '$@: dollars=<'${DOLLARS:Q}'>'
129 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
134 @echo '$@: dollars=<'${DOLLARS:Uundefined:Q}'>'
135 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
142 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
146 @echo '$@: MAKEFLAGS=<'${MAKEFLAGS:Q}'>'
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h62 const SimplifyQuery &Q);
66 const SimplifyQuery &Q);
70 const SimplifyQuery &Q);
74 const SimplifyQuery &Q);
78 const SimplifyQuery &Q);
81 Value *simplifySRemInst(Value *LHS, Value *RHS, const SimplifyQuery &Q);
84 Value *simplifyURemInst(Value *LHS, Value *RHS, const SimplifyQuery &Q);
87 Value *simplifyFNegInst(Value *Op, FastMathFlags FMF, const SimplifyQuery &Q);
93 const SimplifyQuery &Q,
100 const SimplifyQuery &Q,
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DInstructionSimplify.cpp68 const SimplifyQuery &Q, unsigned MaxRecurse);
154 const SimplifyQuery &Q, unsigned MaxRecurse, in simplifyCmpSelCase() argument
156 Value *SimplifiedCmp = simplifyCmpInst(Pred, LHS, RHS, Q, MaxRecurse); in simplifyCmpSelCase()
171 const SimplifyQuery &Q, in simplifyCmpSelTrueCase() argument
173 return simplifyCmpSelCase(Pred, LHS, RHS, Cond, Q, MaxRecurse, in simplifyCmpSelTrueCase()
180 const SimplifyQuery &Q, in simplifyCmpSelFalseCase() argument
182 return simplifyCmpSelCase(Pred, LHS, RHS, Cond, Q, MaxRecurse, in simplifyCmpSelFalseCase()
190 const SimplifyQuery &Q, in handleOtherCmpSelSimplifications() argument
199 if (Value *V = simplifyAndInst(Cond, TCmp, Q, MaxRecurse)) in handleOtherCmpSelSimplifications()
204 if (Value *V = simplifyOrInst(Cond, FCmp, Q, MaxRecurse)) in handleOtherCmpSelSimplifications()
[all …]
H A DValueTracking.cpp152 const SimplifyQuery &Q);
155 const SimplifyQuery &Q) { in computeKnownBits() argument
162 ::computeKnownBits(V, DemandedElts, Known, Depth, Q); in computeKnownBits()
270 const SimplifyQuery &Q);
282 const SimplifyQuery &Q, unsigned Depth);
308 const SimplifyQuery &Q);
332 unsigned Depth, const SimplifyQuery &Q);
335 const SimplifyQuery &Q) { in ComputeNumSignBits() argument
339 return ComputeNumSignBits(V, DemandedElts, Depth, Q); in ComputeNumSignBits()
362 unsigned Depth, const SimplifyQuery &Q) { in computeKnownBitsAddSub() argument
[all …]
H A DScalarEvolutionDivision.cpp85 const SCEV *Q, *R; in divide() local
88 divide(SE, *Quotient, Op, &Q, &R); in divide()
89 *Quotient = Q; in divide()
155 const SCEV *Q, *R; in visitAddExpr() local
156 divide(SE, Op, Denominator, &Q, &R); in visitAddExpr()
159 if (Ty != Q->getType() || Ty != R->getType()) in visitAddExpr()
162 Qs.push_back(Q); in visitAddExpr()
192 const SCEV *Q, *R; in visitMulExpr() local
193 divide(SE, Op, Denominator, &Q, &R); in visitMulExpr()
200 if (Ty != Q->getType()) in visitMulExpr()
[all …]
/freebsd/sys/dev/ath/ath_rate/sample/
H A Dtx_schedules.h220 #ifdef Q
221 #undef Q
223 #define Q(_r) \ macro
228 { 3,Q( 1.5),3,Q(1.5), 0,Q(1.5), 0,Q(1.5) }, /* 1.5Mb/s */
229 { 4,Q(2.25),3,Q(1.5), 4,Q(1.5), 0,Q(1.5) }, /*2.25Mb/s */
230 { 4,Q( 3),3,Q(1.5), 4,Q(1.5), 0,Q(1.5) }, /* 3Mb/s */
231 { 4,Q( 4.5),3,Q( 3), 4,Q(1.5), 2,Q(1.5) }, /* 4.5Mb/s */
232 { 4,Q( 6),3,Q(4.5), 4,Q( 3), 2,Q(1.5) }, /* 6Mb/s */
233 { 4,Q( 9),3,Q( 6), 4,Q(4.5), 2,Q(1.5) }, /* 9Mb/s */
234 { 4,Q( 12),3,Q( 9), 4,Q( 6), 2,Q( 3) }, /* 12Mb/s */
[all …]
/freebsd/contrib/bearssl/src/ec/
H A Dec_p256_m31.c745 p256_double(p256_jacobian *Q) in p256_double() argument
767 square_f256(t1, Q->z); in p256_double()
772 add_f256(t2, Q->x, t1); in p256_double()
773 sub_f256(t1, Q->x, t1); in p256_double()
785 square_f256(t3, Q->y); in p256_double()
787 mul_f256(t2, Q->x, t3); in p256_double()
793 square_f256(Q->x, t1); in p256_double()
794 sub_f256(Q->x, Q->x, t2); in p256_double()
795 sub_f256(Q->x, Q->x, t2); in p256_double()
800 mul_f256(t4, Q->y, Q->z); in p256_double()
[all …]
H A Dec_prime_i15.c570 jacobian P2, P3, Q, T, U; in point_mul() local
577 point_zero(&Q, cc); in point_mul()
586 point_double(&Q, cc); in point_mul()
587 point_double(&Q, cc); in point_mul()
589 memcpy(&U, &Q, sizeof U); in point_mul()
595 CCOPY(bnz & qz, &Q, &T, sizeof Q); in point_mul()
596 CCOPY(bnz & ~qz, &Q, &U, sizeof Q); in point_mul()
601 memcpy(P, &Q, sizeof Q); in point_mul()
632 jacobian Q; in point_decode() local
656 memcpy(Q.c[0], cc->R2, zlen); in point_decode()
[all …]
H A Dec_prime_i31.c569 jacobian P2, P3, Q, T, U; in point_mul() local
576 point_zero(&Q, cc); in point_mul()
585 point_double(&Q, cc); in point_mul()
586 point_double(&Q, cc); in point_mul()
588 memcpy(&U, &Q, sizeof U); in point_mul()
594 CCOPY(bnz & qz, &Q, &T, sizeof Q); in point_mul()
595 CCOPY(bnz & ~qz, &Q, &U, sizeof Q); in point_mul()
600 memcpy(P, &Q, sizeof Q); in point_mul()
631 jacobian Q; in point_decode() local
655 memcpy(Q.c[0], cc->R2, zlen); in point_decode()
[all …]
/freebsd/crypto/libecc/src/ecdh/
H A Decccdh.c171 prj_pt_t Q; in ecccdh_derive_secret() local
185 Q = &(peer_pub_key.y); in ecccdh_derive_secret()
194 ret = _prj_pt_unprotected_mult(Q, cofactor, Q); EG(ret, err); in ecccdh_derive_secret()
202 ret = prj_pt_iszero(Q, &iszero); EG(ret, err); in ecccdh_derive_secret()
207 ret = prj_pt_mul_blind(Q, &(our_priv_key->x), Q); EG(ret, err); in ecccdh_derive_secret()
209 ret = prj_pt_mul(Q, &(our_priv_key->x), Q); EG(ret, err); in ecccdh_derive_secret()
216 ret = prj_pt_iszero(Q, &iszero); EG(ret, err); in ecccdh_derive_secret()
220 ret = prj_pt_unique(Q, Q); EG(ret, err); in ecccdh_derive_secret()
224 ret = fp_export_to_buf(shared_secret, shared_secret_len, &(Q->X)); in ecccdh_derive_secret()
227 PTR_NULLIFY(Q); in ecccdh_derive_secret()
/freebsd/crypto/libecc/src/examples/basic/
H A Dcurve_ecdh.c86 prj_pt Q; in ECDH_helper() local
105 Q.magic = WORD(0); in ECDH_helper()
154 ret = prj_pt_init(&Q, &(curve_params.ec_curve)); EG(ret, err); in ECDH_helper()
172 ret = prj_pt_mul(&Q, d, &(curve_params.ec_gen)); EG(ret, err); in ECDH_helper()
179 ret = prj_pt_export_to_aff_buf(&Q, our_public_buffer, in ECDH_helper()
199 ret = prj_pt_import_from_aff_buf(&Q, other_public_buffer, in ECDH_helper()
203 ret = prj_pt_mul(&Q, d, &Q); EG(ret, err); in ECDH_helper()
208 ret = prj_pt_unique(&Q, &Q); EG(ret, err); in ECDH_helper()
212 ret = fp_copy(x, &(Q.X)); EG(ret, err); in ECDH_helper()
218 prj_pt_uninit(&Q); in ECDH_helper()
/freebsd/crypto/openssl/test/
H A Dectest.c42 EC_POINT *P = NULL, *Q = NULL, *R = NULL, *S = NULL; in group_order_tests() local
53 || !TEST_ptr(Q = EC_POINT_new(group)) in group_order_tests()
59 || !TEST_true(EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) in group_order_tests()
60 || !TEST_true(EC_POINT_is_at_infinity(group, Q)) in group_order_tests()
64 || !TEST_true(EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) in group_order_tests()
65 || !TEST_true(EC_POINT_is_at_infinity(group, Q)) in group_order_tests()
68 || !TEST_true(EC_POINT_mul(group, Q, n1, NULL, NULL, ctx)) in group_order_tests()
69 || !TEST_int_eq(0, EC_POINT_cmp(group, Q, P, ctx)) in group_order_tests()
71 || !TEST_true(EC_POINT_mul(group, Q, n1, NULL, NULL, ctx)) in group_order_tests()
72 || !TEST_true(EC_POINT_invert(group, Q, ctx)) in group_order_tests()
[all …]
/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Dcert-onecolumn.pem12 Q
15 Q
43 Q
180 Q
264 Q
301 Q
339 Q
340 Q
423 Q
424 Q
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DVLIWMachineScheduler.cpp511 const ReadyQueue &Q, SUnit *SU, in traceCandidate() argument
513 dbgs() << Label << " " << Q.getName() << " "; in traceCandidate()
526 ReadyQueue &Q) { in readyQueueVerboseDump() argument
529 dbgs() << ">>> " << Q.getName() << "\n"; in readyQueueVerboseDump()
530 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) { in readyQueueVerboseDump()
538 SchedulingCost(Q, *I, Candidate, RPDelta, true); in readyQueueVerboseDump()
596 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU, in SchedulingCost() argument
608 << ((Q.getID() == TopQID) ? "(top|" : "(bot|")); in SchedulingCost()
617 if (Q.getID() == TopQID) { in SchedulingCost()
660 if (Q.getID() == TopQID) { in SchedulingCost()
[all …]
/freebsd/contrib/llvm-project/clang/lib/DirectoryWatcher/windows/
H A DDirectoryWatcher-windows.cpp47 std::queue<DirectoryWatcher::Event> Q; member in __anon3d5a8a810111::DirectoryWatcherWindows::EventQueue
54 Q.emplace(Kind, Path); in emplace()
62 if (!Q.empty()) { in pop_front()
63 DirectoryWatcher::Event E = Q.front(); in pop_front()
64 Q.pop(); in pop_front()
67 CV.wait(L, [this]() { return !Q.empty(); }); in pop_front()
70 } Q; member in __anon3d5a8a810111::DirectoryWatcherWindows
157 Q.emplace(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, in WatcherThreadProc()
172 Q.emplace(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated, in WatcherThreadProc()
184 Q.emplace(DirectoryWatcher::Event::EventKind::WatchedDirRemoved, in WatcherThreadProc()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A Darm_neon.td288 def SPLATQ : WInst<"splat_laneq", ".(!Q)I",
294 def SPLATQ_BF : WInst<"splat_laneq", ".(!Q)I", "bQb"> {
307 def VADDL : SOpInst<"vaddl", "(>Q)..", "csiUcUsUi", OP_ADDL>;
308 def VADDW : SOpInst<"vaddw", "(>Q)(>Q).", "csiUcUsUi", OP_ADDW>;
320 def VMLAL : SOpInst<"vmlal", "(>Q)(>Q)..", "csiUcUsUi", OP_MLAL>;
322 def VMLSL : SOpInst<"vmlsl", "(>Q)(>Q)..", "csiUcUsUi", OP_MLSL>;
331 def VQDMLAL : SInst<"vqdmlal", "(>Q)(>Q)..", "si">;
332 def VQDMLSL : SInst<"vqdmlsl", "(>Q)(>Q)..", "si">;
333 def VMULL : SInst<"vmull", "(>Q)..", "csiUcUsUiPc">;
334 def VQDMULL : SInst<"vqdmull", "(>Q)..", "si">;
[all …]
/freebsd/sys/contrib/zstd/
H A DMakefile12 Q = $(if $(filter 1,$(V) $(VERBOSE)),,@) macro
53 $(Q)$(MAKE) -C $(PRGDIR) all
54 $(Q)$(MAKE) -C $(TESTDIR) all
63 $(Q)$(MAKE) -C $(ZSTDDIR) $@
67 $(Q)$(MAKE) -C $(PRGDIR) $@
68 $(Q)ln -sf $(PRGDIR)/zstd$(EXT) zstd$(EXT)
72 $(Q)$(MAKE) -C $(PRGDIR) $@
73 $(Q)$(CP) $(PRGDIR)/zstd$(EXT) ./zstdmt$(EXT)
91 $(Q)$(MAKE) -C $(TESTDIR) $@
135 $(Q)$(MAKE) -C $(ZSTDDIR) $@ > $(VOID)
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Ddivmod.m420 * Q -- the partial quotient under development -- initially 0
37 define(Q, `%o2') macro
53 * Q -- current quotient
57 * R', Q', V', cc'
70 add Q, ($2*2+1), Q
78 add Q, ($2*2-1), Q
134 mov 0,Q
187 mov 1,Q
191 sll Q,1,Q
197 inc Q
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp92 const SimplifyQuery &Q) { in SimplifyDemandedBits() argument
96 llvm::computeKnownBits(V, Known, Depth, Q); in SimplifyDemandedBits()
112 llvm::computeKnownBits(V, Known, Depth, Q); in SimplifyDemandedBits()
119 NewVal = SimplifyDemandedUseBits(VInst, DemandedMask, Known, Depth, Q); in SimplifyDemandedBits()
124 SimplifyMultipleUseDemandedBits(VInst, DemandedMask, Known, Depth, Q); in SimplifyDemandedBits()
161 const SimplifyQuery &Q) { in SimplifyDemandedUseBits() argument
195 SimplifyDemandedBits(I, 0, DemandedFromOps, LHSKnown, Depth + 1, Q) || in SimplifyDemandedUseBits()
197 SimplifyDemandedBits(I, 1, DemandedFromOps, RHSKnown, Depth + 1, Q)) { in SimplifyDemandedUseBits()
206 llvm::computeKnownBits(I, Known, Depth, Q); in SimplifyDemandedUseBits()
210 if (SimplifyDemandedBits(I, 1, DemandedMask, RHSKnown, Depth + 1, Q) || in SimplifyDemandedUseBits()
[all …]
/freebsd/contrib/wpa/src/
H A Dbuild.rules65 Q=@
68 Q=
72 Q=@
76 ifeq ($(Q),@)
86 $(Q)$(CC) -c -o $@ $(CFLAGS) $<
89 $(Q)$(CC) -c -o $@ $(CFLAGS) $<
93 $(Q)$(CC) -c -o $@ $(CFLAGS) $<
103 $(Q)$(MAKE) -C $(ROOTDIR)$(dir $(@:$(BUILDDIR)/$(PROJ)/%=%)) OUT=$(abspath $(dir $@))/
109 $(Q)rm -rf $(ALL) $(BUILDDIR)/$(PROJ)

12345678910>>...36