/freebsd/contrib/llvm-project/clang/lib/AST/ |
H A D | Linkage.h | 110 LVComputationKind computation); 113 LVComputationKind computation); 117 LVComputationKind computation); 121 LVComputationKind computation); 125 LVComputationKind computation); 128 LVComputationKind computation, 132 LVComputationKind computation, 136 LVComputationKind computation); 139 LVComputationKind computation); 141 LinkageInfo getLVForType(const Type &T, LVComputationKind computation); [all …]
|
H A D | Decl.cpp | 160 static bool hasExplicitVisibilityAlready(LVComputationKind computation) { in hasExplicitVisibilityAlready() argument 161 return computation.IgnoreExplicitVisibility; in hasExplicitVisibilityAlready() 241 LVComputationKind computation) { in getLVForType() argument 242 if (computation.IgnoreAllVisibility) in getLVForType() 251 const TemplateParameterList *Params, LVComputationKind computation) { in getLVForTemplateParameterList() argument 267 LV.merge(getLVForType(*NTTP->getType(), computation)); in getLVForTemplateParameterList() 288 computation)); in getLVForTemplateParameterList() 296 TTP->getExpansionTemplateParameters(i), computation)); in getLVForTemplateParameterList() 321 LVComputationKind computation) { in getLVForTemplateArgumentList() argument 332 LV.merge(getLVForType(*Arg.getAsType(), computation)); in getLVForTemplateArgumentList() [all …]
|
H A D | APValue.cpp | 1117 LVComputationKind computation) { in getLVForValue() argument 1125 return MergeLV(getLVForValue(V, computation)); in getLVForValue() 1173 if (VD && MergeLV(getLVForDecl(VD, computation))) in getLVForValue() 1176 if (MergeLV(getLVForType(*TI.getType(), computation))) in getLVForValue() 1188 if (MergeLV(getLVForDecl(MTE->getExtendingDecl(), computation))) in getLVForValue() 1202 MergeLV(getLVForDecl(D, computation)); in getLVForValue()
|
/freebsd/crypto/openssl/doc/man7/ |
H A D | EVP_KDF-SCRYPT.pod | 15 computation. The intention of this is to render brute forcing of passwords on 23 greater than zero. The amount of RAM that scrypt requires for its computation 28 computation time of less than 5 seconds on a 2.5 GHz Intel Core 2 Duo are N = 30 this computation is roughly 1 GiB. On a more recent CPU (Intel i7-5930K at 3.5 31 GHz), this computation takes about 3 seconds. When N, r or p are not specified,
|
H A D | provider-mac.pod | 115 OSSL_FUNC_mac_update() is called to supply data for MAC computation of a previously 121 OSSL_FUNC_mac_final() completes the MAC computation started through previous
|
/freebsd/crypto/openssl/doc/man3/ |
H A D | EVP_MAC.pod | 74 for actual computation. HMAC uses a digest, and CMAC uses a cipher. 76 the MAC algorithm itself and one for the underlying computation 81 "underlying context", or "computation context", which is to denote the 82 context for the underlying computation algorithm if there is one. 89 as well as a reference to a computation context, for those MACs that 90 rely on an underlying computation algorithm. 135 but only if I<outsize> is sufficient (otherwise no computation is made). 156 EVP_MAC_final() does the final computation and stores the result in 159 If I<out> is NULL or I<outsize> is too small, then no computation 166 EVP_MAC_finalXOF() does the final computation for an XOF based MAC and stores [all …]
|
H A D | CMS_final.pod | 16 operations necessary on B<cms> (digest computation for example) and set the
|
H A D | DSA_sign.pod | 39 (pre-)computation.
|
H A D | SSL_CTX_set_mode.pod | 110 Older versions of OpenSSL had a bug in the computation of the label length
|
H A D | ECDSA_sign.pod | 73 during signature computation. Most applications will never need to call these
|
/freebsd/contrib/llvm-project/compiler-rt/lib/nsan/ |
H A D | nsan_flags.inc | 21 "If true, we resume resume the computation from the original " 26 "If true, a suppression will also resume the computation from the FT"
|
/freebsd/contrib/ntp/clockstuff/ |
H A D | README | 15 this for WWV/H and CHU. Don't use it for WWVB (the computation
|
/freebsd/contrib/arm-optimized-routines/math/tools/ |
H A D | log_abs.sollya | 28 // relative error computation fails if f(0)==0
|
H A D | log2_abs.sollya | 34 //// relative error computation fails if f(0)==0
|
H A D | tanf.sollya | 27 // Setup precisions (display and computation)
|
/freebsd/contrib/ntp/sntp/libevent/test/ |
H A D | regress_main.c | 215 policy.computation = (uint32_t)(5 * clock2abs); // 5 ms of work in move_pthread_to_realtime_scheduling_class()
|
/freebsd/contrib/libevent/test/ |
H A D | regress_main.c | 215 policy.computation = (uint32_t)(5 * clock2abs); // 5 ms of work in move_pthread_to_realtime_scheduling_class()
|
/freebsd/contrib/gdtoa/ |
H A D | changes | 224 computation of the shortest decimal string that rounds to the 297 computation (and sometimes slower conversions in dtoa and strtod, 411 gdtoa.tgz: many files: add automatic computation of gd_qnan.h for 453 preceding computation of j. 663 omit the quick computation that would use ordinary arithmetic to 667 (and thus retain the quick computation when it is appropriate).
|
/freebsd/sys/netinet/libalias/ |
H A D | HISTORY | 36 - Switched to differential checksum computation
|
/freebsd/contrib/arm-optimized-routines/math/ |
H A D | README.contributors | 38 computation can be slow and inaccurate but has to be correct for conformance
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/ |
H A D | TargetInstrPredicate.td | 380 // computation. For example, STIPredicateFunction `isDependencyBreaking()` 381 // delegates to `isZeroIdiom()` part of its computation.
|
/freebsd/usr.sbin/bsnmpd/bsnmpd/ |
H A D | snmpd.config | 326 # the automatic computation is wrong (which may be the case if an interface
|
/freebsd/sys/contrib/device-tree/Bindings/mtd/ |
H A D | atmel-nand.txt | 143 - atmel,pmecc-sector-size : sector size for ECC computation. Supported values
|
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMFeatures.td | 209 // Fast computation of non-negative address offsets. 210 // True if processor does positive address offset computation faster. 212 "Enable fast computation of "
|
H A D | ARMPredicates.td | 203 // But only select them if more precision in FP computation is allowed, and when
|