Home
last modified time | relevance | path

Searched refs:S (Results 1 – 25 of 2736) sorted by relevance

12345678910>>...110

/freebsd/contrib/llvm-project/clang/lib/AST/
H A DStmtProfile.cpp41 void VisitStmt(const Stmt *S);
43 void VisitStmtNoChildren(const Stmt *S) { in VisitStmtNoChildren() argument
44 HandleStmtClass(S->getStmtClass()); in VisitStmtNoChildren()
49 #define STMT(Node, Base) void Visit##Node(const Node *S);
238 void StmtProfiler::VisitStmt(const Stmt *S) { in VisitStmt() argument
239 assert(S && "Requires non-null Stmt pointer"); in VisitStmt()
241 VisitStmtNoChildren(S); in VisitStmt()
243 for (const Stmt *SubStmt : S->children()) { in VisitStmt()
251 void StmtProfiler::VisitDeclStmt(const DeclStmt *S) { in VisitDeclStmt() argument
252 VisitStmt(S); in VisitDeclStmt()
[all …]
H A DParentMap.cpp29 static void BuildParentMap(MapTy& M, Stmt* S, in BuildParentMap() argument
31 if (!S) in BuildParentMap()
34 switch (S->getStmtClass()) { in BuildParentMap()
36 PseudoObjectExpr *POE = cast<PseudoObjectExpr>(S); in BuildParentMap()
43 for (Stmt *SubStmt : S->children()) in BuildParentMap()
46 M[POE->getSyntacticForm()] = S; in BuildParentMap()
52 M[*I] = S; in BuildParentMap()
59 BinaryConditionalOperator *BCO = cast<BinaryConditionalOperator>(S); in BuildParentMap()
61 M[BCO->getCommon()] = S; in BuildParentMap()
64 M[BCO->getCond()] = S; in BuildParentMap()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/
H A Dinterval_set_test.cpp20 IntervalSet<unsigned, IntervalCoalescing::Enabled> S; in TEST() local
22 EXPECT_TRUE(S.empty()); in TEST()
23 EXPECT_TRUE(S.begin() == S.end()); in TEST()
24 EXPECT_TRUE(S.find(0) == S.end()); in TEST()
29 IntervalSet<unsigned, IntervalCoalescing::Enabled> S; in TEST() local
31 S.insert(7, 8); in TEST()
33 EXPECT_FALSE(S.empty()); in TEST()
34 EXPECT_EQ(std::next(S.begin()), S.end()); in TEST()
35 EXPECT_EQ(S.find(7), S.begin()); in TEST()
36 EXPECT_EQ(S.find(8), S.end()); in TEST()
[all …]
/freebsd/lib/msun/i387/
H A DMakefile.inc1 ARCH_SRCS = e_exp.S e_fmod.S e_log.S e_log10.S \
2 e_remainder.S e_sqrt.S s_ceil.S s_copysign.S \
3 s_finite.S s_floor.S s_llrint.S s_logb.S s_lrint.S \
4 s_remquo.S s_rint.S s_scalbn.S s_significand.S \
5 s_trunc.S
8 ARCH_SRCS+= e_fmodf.S e_log10f.S e_logf.S e_remainderf.S \
9 e_sqrtf.S s_ceilf.S s_copysignf.S s_floorf.S \
10 s_llrintf.S s_logbf.S s_lrintf.S \
11 s_remquof.S s_rintf.S s_scalbnf.S s_significandf.S s_truncf.S
14 ARCH_SRCS+= e_fmodl.S \
[all …]
/freebsd/contrib/lua/src/
H A Dlundump.c40 static l_noret error (LoadState *S, const char *why) { in error() argument
41 luaO_pushfstring(S->L, "%s: bad binary format (%s)", S->name, why); in error()
42 luaD_throw(S->L, LUA_ERRSYNTAX); in error()
50 #define loadVector(S,b,n) loadBlock(S,b,(n)*sizeof((b)[0])) argument
52 static void loadBlock (LoadState *S, void *b, size_t size) { in loadBlock() argument
53 if (luaZ_read(S->Z, b, size) != 0) in loadBlock()
54 error(S, "truncated chunk"); in loadBlock()
58 #define loadVar(S,x) loadVector(S,&x,1) argument
61 static lu_byte loadByte (LoadState *S) { in loadByte() argument
62 int b = zgetc(S->Z); in loadByte()
[all …]
/freebsd/sys/modules/ossl/
H A DMakefile19 aes-armv4.S \
20 bsaes-armv7.S \
21 chacha-armv4.S \
22 ghash-armv4.S \
23 poly1305-armv4.S \
24 sha1-armv4-large.S \
25 sha256-armv4.S \
26 sha512-armv4.S \
31 chacha-armv8.S \
32 poly1305-armv8.S \
[all …]
/freebsd/contrib/llvm-project/clang/lib/AST/Interp/
H A DInterp.h43 bool ReturnValue(const InterpState &S, const T &V, APValue &R) { in ReturnValue() argument
44 R = V.toAPValue(S.getCtx()); in ReturnValue()
49 bool CheckExtern(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
52 bool CheckArray(InterpState &S, CodePtr OpPC, const Pointer &Ptr);
55 bool CheckLive(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
59 bool CheckDummy(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
63 bool CheckNull(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
67 bool CheckRange(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
71 bool CheckRange(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
75 bool CheckSubobject(InterpState &S, CodePtr OpPC, const Pointer &Ptr,
[all …]
H A DInterp.cpp34 static bool RetValue(InterpState &S, CodePtr &Pt, APValue &Result) { in RetValue() argument
42 static bool Jmp(InterpState &S, CodePtr &PC, int32_t Offset) { in Jmp() argument
47 static bool Jt(InterpState &S, CodePtr &PC, int32_t Offset) { in Jt() argument
48 if (S.Stk.pop<bool>()) { in Jt()
54 static bool Jf(InterpState &S, CodePtr &PC, int32_t Offset) { in Jf() argument
55 if (!S.Stk.pop<bool>()) { in Jf()
61 static void diagnoseMissingInitializer(InterpState &S, CodePtr OpPC, in diagnoseMissingInitializer() argument
63 const SourceInfo &E = S.Current->getSource(OpPC); in diagnoseMissingInitializer()
64 S.FFDiag(E, diag::note_constexpr_var_init_unknown, 1) << VD; in diagnoseMissingInitializer()
65 S.Note(VD->getLocation(), diag::note_declared_at) << VD->getSourceRange(); in diagnoseMissingInitializer()
[all …]
H A DInterpBuiltin.cpp21 static unsigned callArgSize(const InterpState &S, const CallExpr *C) { in callArgSize() argument
25 O += align(primSize(*S.getContext().classify(E))); in callArgSize()
38 PrimType getIntPrimType(const InterpState &S) { in getIntPrimType() argument
39 const TargetInfo &TI = S.getCtx().getTargetInfo(); in getIntPrimType()
49 PrimType getLongPrimType(const InterpState &S) { in getLongPrimType() argument
50 const TargetInfo &TI = S.getCtx().getTargetInfo(); in getLongPrimType()
74 static void pushInteger(InterpState &S, const APSInt &Val, QualType QT) { in pushInteger() argument
77 std::optional<PrimType> T = S.getContext().classify(QT); in pushInteger()
82 INT_TYPE_SWITCH(*T, { S.Stk.push<T>(T::from(V)); }); in pushInteger()
86 INT_TYPE_SWITCH(*T, { S.Stk.push<T>(T::from(V)); }); in pushInteger()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DGlobPattern.cpp21 static Expected<BitVector> expand(StringRef S, StringRef Original) { in hasWildcard()
26 if (S.size() < 3) in expand() argument
29 uint8_t Start = S[0]; in expand()
30 uint8_t End = S[2]; in expand()
34 if (S[1] != '-') { in expand()
36 S = S.substr(1); in expand()
48 S = S.substr(3); in expand()
51 for (char C : S) in expand()
20 hasWildcard(StringRef S) hasWildcard() argument
66 scan(StringRef & S,StringRef Original) scan() argument
107 create(StringRef S) create() argument
[all...]
/freebsd/crypto/openssl/crypto/camellia/asm/
H A Dcmll-x86_64.pl61 @S=("%r8d","%r9d","%r10d","%r11d");
84 my ($s0,$s1,$s2,$s3)=(@S[($j)%4],@S[($j+1)%4],@S[($j+2)%4],@S[($j+3)%4]);
165 mov 0(%rsi),@S[0] # load plaintext
166 mov 4(%rsi),@S[1]
167 mov 8(%rsi),@S[2]
168 bswap @S[0]
169 mov 12(%rsi),@S[3]
170 bswap @S[1]
171 bswap @S[2]
172 bswap @S[3]
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DTransfer.cpp42 const Environment *StmtToEnvMap::getEnvironment(const Stmt &S) const { in getEnvironment()
43 auto BlockIt = ACFG.getStmtToBlock().find(&ignoreCFGOmittedNodes(S)); in getEnvironment()
143 void VisitBinaryOperator(const BinaryOperator *S) { in VisitBinaryOperator() argument
144 const Expr *LHS = S->getLHS(); in VisitBinaryOperator()
147 const Expr *RHS = S->getRHS(); in VisitBinaryOperator()
154 if (S->isCompoundAssignmentOp()) in VisitBinaryOperator()
155 propagateStorageLocation(*S->getLHS(), *S, Env); in VisitBinaryOperator()
157 switch (S->getOpcode()) { in VisitBinaryOperator()
171 Env.setStorageLocation(*S, *LHSLoc); in VisitBinaryOperator()
179 if (S->getOpcode() == BO_LAnd) in VisitBinaryOperator()
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_generichash/blake2b/ref/
H A Dblake2b-ref.c38 blake2b_set_lastnode(blake2b_state *S) in blake2b_set_lastnode() argument
40 S->f[1] = -1; in blake2b_set_lastnode()
46 blake2b_is_lastblock(const blake2b_state *S) in blake2b_is_lastblock() argument
48 return S->f[0] != 0; in blake2b_is_lastblock()
52 blake2b_set_lastblock(blake2b_state *S) in blake2b_set_lastblock() argument
54 if (S->last_node) { in blake2b_set_lastblock()
55 blake2b_set_lastnode(S); in blake2b_set_lastblock()
57 S->f[0] = -1; in blake2b_set_lastblock()
62 blake2b_increment_counter(blake2b_state *S, const uint64_t inc) in blake2b_increment_counter() argument
65 uint128_t t = ((uint128_t) S->t[1] << 64) | S->t[0]; in blake2b_increment_counter()
[all …]
/freebsd/sys/contrib/libb2/
H A Dblake2b.c81 static inline int blake2b_set_lastnode( blake2b_state *S ) in blake2b_set_lastnode() argument
83 S->f[1] = ~0ULL; in blake2b_set_lastnode()
87 static inline int blake2b_clear_lastnode( blake2b_state *S ) in blake2b_clear_lastnode() argument
89 S->f[1] = 0ULL; in blake2b_clear_lastnode()
93 static inline int blake2b_set_lastblock( blake2b_state *S ) in blake2b_set_lastblock() argument
95 if( S->last_node ) blake2b_set_lastnode( S ); in blake2b_set_lastblock()
97 S->f[0] = ~0ULL; in blake2b_set_lastblock()
101 static inline int blake2b_clear_lastblock( blake2b_state *S ) in blake2b_clear_lastblock() argument
103 if( S->last_node ) blake2b_clear_lastnode( S ); in blake2b_clear_lastblock()
105 S->f[0] = 0ULL; in blake2b_clear_lastblock()
[all …]
H A Dblake2b-ref.c46 static inline int blake2b_set_lastnode( blake2b_state *S ) in blake2b_set_lastnode() argument
48 S->f[1] = ~0ULL; in blake2b_set_lastnode()
52 static inline int blake2b_clear_lastnode( blake2b_state *S ) in blake2b_clear_lastnode() argument
54 S->f[1] = 0ULL; in blake2b_clear_lastnode()
59 static inline int blake2b_set_lastblock( blake2b_state *S ) in blake2b_set_lastblock() argument
61 if( S->last_node ) blake2b_set_lastnode( S ); in blake2b_set_lastblock()
63 S->f[0] = ~0ULL; in blake2b_set_lastblock()
67 static inline int blake2b_clear_lastblock( blake2b_state *S ) in blake2b_clear_lastblock() argument
69 if( S->last_node ) blake2b_clear_lastnode( S ); in blake2b_clear_lastblock()
71 S->f[0] = 0ULL; in blake2b_clear_lastblock()
[all …]
H A Dblake2s-ref.c41 static inline int blake2s_set_lastnode( blake2s_state *S ) in blake2s_set_lastnode() argument
43 S->f[1] = ~0U; in blake2s_set_lastnode()
47 static inline int blake2s_clear_lastnode( blake2s_state *S ) in blake2s_clear_lastnode() argument
49 S->f[1] = 0U; in blake2s_clear_lastnode()
54 static inline int blake2s_set_lastblock( blake2s_state *S ) in blake2s_set_lastblock() argument
56 if( S->last_node ) blake2s_set_lastnode( S ); in blake2s_set_lastblock()
58 S->f[0] = ~0U; in blake2s_set_lastblock()
62 static inline int blake2s_clear_lastblock( blake2s_state *S ) in blake2s_clear_lastblock() argument
64 if( S->last_node ) blake2s_clear_lastnode( S ); in blake2s_clear_lastblock()
66 S->f[0] = 0U; in blake2s_clear_lastblock()
[all …]
H A Dblake2s.c76 static inline int blake2s_set_lastnode( blake2s_state *S ) in blake2s_set_lastnode() argument
78 S->f[1] = ~0U; in blake2s_set_lastnode()
82 static inline int blake2s_clear_lastnode( blake2s_state *S ) in blake2s_clear_lastnode() argument
84 S->f[1] = 0U; in blake2s_clear_lastnode()
88 static inline int blake2s_set_lastblock( blake2s_state *S ) in blake2s_set_lastblock() argument
90 if( S->last_node ) blake2s_set_lastnode( S ); in blake2s_set_lastblock()
92 S->f[0] = ~0U; in blake2s_set_lastblock()
96 static inline int blake2s_clear_lastblock( blake2s_state *S ) in blake2s_clear_lastblock() argument
98 if( S->last_node ) blake2s_clear_lastnode( S ); in blake2s_clear_lastblock()
100 S->f[0] = 0U; in blake2s_clear_lastblock()
[all …]
H A Dblake2-dispatch.c158 int blake2b_init_ref( blake2b_state *S, size_t outlen );
159 int blake2b_init_key_ref( blake2b_state *S, size_t outlen, const void *key, size_t keylen );
160 int blake2b_init_param_ref( blake2b_state *S, const blake2b_param *P );
161 int blake2b_update_ref( blake2b_state *S, const uint8_t *in, size_t inlen );
162 int blake2b_final_ref( blake2b_state *S, uint8_t *out, size_t outlen );
167 int blake2b_init_sse2( blake2b_state *S, size_t outlen );
168 int blake2b_init_key_sse2( blake2b_state *S, size_t outlen, const void *key, size_t keylen );
169 int blake2b_init_param_sse2( blake2b_state *S, const blake2b_param *P );
170 int blake2b_update_sse2( blake2b_state *S, const uint8_t *in, size_t inlen );
171 int blake2b_final_sse2( blake2b_state *S, uint8_t *out, size_t outlen );
[all …]
/freebsd/crypto/openssl/crypto/whrlpool/
H A Dwp_block.c506 } S, K, *H = (void *)ctx->H.q; in whirlpool_block() local
517 S.c[i] = (K.c[i] = H->c[i]) ^ p[i]; in whirlpool_block()
528 L[i] ^= C0(S, i) ^ C1(S, (i - 1) & 7) ^ in whirlpool_block()
529 C2(S, (i - 2) & 7) ^ C3(S, (i - 3) & 7) ^ in whirlpool_block()
530 C4(S, (i - 4) & 7) ^ C5(S, (i - 5) & 7) ^ in whirlpool_block()
531 C6(S, (i - 6) & 7) ^ C7(S, (i - 7) & 7); in whirlpool_block()
533 memcpy(S.q, L, 64); in whirlpool_block()
536 H->c[i] ^= S.c[i] ^ p[i]; in whirlpool_block()
542 memcpy(S.c, p, 64); in whirlpool_block()
543 S.q[0] ^= (K.q[0] = H->q[0]); in whirlpool_block()
[all …]
/freebsd/sys/crypto/sha2/
H A Dsha512c_arm64.c41 uint64x2_t S[4]; in SHA512_Transform_arm64_impl() local
61 S[0] = vld1q_u64(&state[0]); in SHA512_Transform_arm64_impl()
62 S[1] = vld1q_u64(&state[2]); in SHA512_Transform_arm64_impl()
63 S[2] = vld1q_u64(&state[4]); in SHA512_Transform_arm64_impl()
64 S[3] = vld1q_u64(&state[6]); in SHA512_Transform_arm64_impl()
66 S_start[0] = S[0]; in SHA512_Transform_arm64_impl()
67 S_start[1] = S[1]; in SHA512_Transform_arm64_impl()
68 S_start[2] = S[2]; in SHA512_Transform_arm64_impl()
69 S_start[3] = S[3]; in SHA512_Transform_arm64_impl()
93 #define A64_RNDr(S, W, i, ii) \ in SHA512_Transform_arm64_impl() argument
[all …]
/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-subst.mk14 .if ${WORDS:S,,,} != ${WORDS}
19 .if ${WORDS:S,e,*,1} != "s*quences of letters"
25 .if ${WORDS:S,f,*,1} != "sequences o* letters"
30 .if ${WORDS:S,e,*,} != "s*quences of l*tters"
35 .if ${WORDS:S,e,*,g} != "s*qu*nc*s of l*tt*rs"
41 .if ${WORDS:S,^sequ,occurr,} != "occurrences of letters"
47 .if ${WORDS:S,^of,with,} != "sequences with letters"
52 .if ${WORDS:S,^office,does not match,} != ${WORDS}
58 .if ${WORDS:S,f$,r,} != "sequences or letters"
63 .if ${WORDS:S,s$,,} != "sequence of letter"
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaDeclAttr.cpp96 static bool checkPositiveIntArgument(Sema &S, const AttrInfo &AI, const Expr *Expr, in checkPositiveIntArgument() argument
99 if (!S.checkUInt32Argument(AI, Expr, UVal, Idx)) in checkPositiveIntArgument()
105 S.Diag(Expr->getExprLoc(), diag::err_ice_too_large) in checkPositiveIntArgument()
171 static bool threadSafetyCheckIsSmartPointer(Sema &S, const RecordType* RT) { in threadSafetyCheckIsSmartPointer() argument
172 auto IsOverloadedOperatorPresent = [&S](const RecordDecl *Record, in threadSafetyCheckIsSmartPointer()
175 Record->lookup(S.Context.DeclarationNames.getCXXOperatorName(Op)); in threadSafetyCheckIsSmartPointer()
207 static bool threadSafetyCheckIsPointer(Sema &S, const Decl *D, in threadSafetyCheckIsPointer() argument
221 if (threadSafetyCheckIsSmartPointer(S, RT)) in threadSafetyCheckIsPointer()
225 S.Diag(AL.getLoc(), diag::warn_thread_attribute_decl_not_pointer) << AL << QT; in threadSafetyCheckIsPointer()
258 static bool checkRecordTypeForCapability(Sema &S, QualType Ty) { in checkRecordTypeForCapability() argument
[all …]
/freebsd/contrib/libarchive/libarchive/
H A Darchive_blake2sp_ref.c38 static int blake2sp_init_leaf_param( blake2s_state *S, const blake2s_param *P ) in blake2sp_init_leaf_param() argument
40 int err = blake2s_init_param(S, P); in blake2sp_init_leaf_param()
41 S->outlen = P->inner_length; in blake2sp_init_leaf_param()
45 static int blake2sp_init_leaf( blake2s_state *S, size_t outlen, size_t keylen, uint32_t offset ) in blake2sp_init_leaf() argument
59 return blake2sp_init_leaf_param( S, P ); in blake2sp_init_leaf()
62 static int blake2sp_init_root( blake2s_state *S, size_t outlen, size_t keylen ) in blake2sp_init_root() argument
76 return blake2s_init_param( S, P ); in blake2sp_init_root()
80 int blake2sp_init( blake2sp_state *S, size_t outlen ) in blake2sp_init() argument
86 memset( S->buf, 0, sizeof( S->buf ) ); in blake2sp_init()
87 S->buflen = 0; in blake2sp_init()
[all …]
H A Darchive_blake2s_ref.c45 static void blake2s_set_lastnode( blake2s_state *S ) in blake2s_set_lastnode() argument
47 S->f[1] = (uint32_t)-1; in blake2s_set_lastnode()
51 static int blake2s_is_lastblock( const blake2s_state *S ) in blake2s_is_lastblock() argument
53 return S->f[0] != 0; in blake2s_is_lastblock()
56 static void blake2s_set_lastblock( blake2s_state *S ) in blake2s_set_lastblock() argument
58 if( S->last_node ) blake2s_set_lastnode( S ); in blake2s_set_lastblock()
60 S->f[0] = (uint32_t)-1; in blake2s_set_lastblock()
63 static void blake2s_increment_counter( blake2s_state *S, const uint32_t inc ) in blake2s_increment_counter() argument
65 S->t[0] += inc; in blake2s_increment_counter()
66 S->t[1] += ( S->t[0] < inc ); in blake2s_increment_counter()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/
H A Dstring_pool.h38 PooledStringPtr intern(std::string S);
62 PooledStringPtr(const PooledStringPtr &Other) : S(Other.S) {
63 if (S)
64 ++S->second;
68 if (S) {
69 assert(S->second && "Releasing PooledStringPtr with zero ref count");
70 --S->second;
72 S = Other.S;
73 if (S)
74 ++S->second;
[all …]

12345678910>>...110