/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 163 /// basic block to the 'To' basic block is currently feasible. If 170 /// isBlockExecutable - Return true if there are any known feasible 279 // feasible that wasn't before. Revisit the PHI nodes in the block in markEdgeExecutable() 316 // If undefined, neither is feasible yet. in getFeasibleSuccessors() 335 // Unknown termintor, assume all successors are feasible. in getFeasibleSuccessors() 355 // If undefined, neither is feasible yet. in getFeasibleSuccessors() 392 // Mark all feasible successors executable... in visitTerminator() 432 // If the edge is not yet known to be feasible, it doesn't impact the PHI. in visitPHINode()
|
/freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | Stack.h | 29 /// feasible, to note the approximate address of the bottom of the stack.
|
/freebsd/crypto/openssl/doc/man7/ |
H A D | openssl_user_macros.pod.in | 53 feasible. For example, C<0x60000000L> will work as expected.
|
/freebsd/contrib/libarchive/libarchive/ |
H A D | archive_read_support_filter_all.c | 55 * may not be feasible to keep this here, but we'll try. in archive_read_support_filter_all()
|
/freebsd/sys/contrib/device-tree/Bindings/i2c/ |
H A D | i2c-arb-gpio-challenge.txt | 9 that makes standard multimaster mode not feasible.
|
/freebsd/crypto/openssl/crypto/property/ |
H A D | README.md | 37 be feasible to use a hash table to contain the names (and possibly also
|
/freebsd/contrib/sendmail/libsm/ |
H A D | assert.html | 296 cleanup actions is not feasible in most of the above cases. 318 to perform an orderly shutdown is appropriate and feasible, but there
|
/freebsd/contrib/ntp/html/ |
H A D | discover.html | 50 …lock</tt> associations remain and then only at the minimum feasible rate and minimum feasible time…
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SCCPSolver.cpp | 272 // All edges feasible, nothing to do. in removeNonFeasibleEdges() 276 // SCCP can only determine non-feasible edges for br, switch and indirectbr. in removeNonFeasibleEdges() 295 // Replace with an unconditional branch to the only feasible successor. in removeNonFeasibleEdges() 301 // Don't remove the edge to the only feasible successor the first time in removeNonFeasibleEdges() 351 llvm_unreachable("Must have at least one feasible successor"); in removeNonFeasibleEdges() 1051 // feasible that wasn't before. Revisit the PHI nodes in the block in markEdgeExecutable() 1166 // block to the 'To' basic block is currently feasible. 1269 // Mark all feasible successors executable. in visitTerminator()
|
H A D | SampleProfileInference.cpp | 770 /// blocks. Then it verifies if flow rebalancing is feasible and applies it. 774 // Verify if rebalancing rooted at SrcBlock is feasible in rebalanceUnknownSubgraphs() 784 // Verify if rebalancing of the subgraph is feasible. If the search is in rebalanceUnknownSubgraphs() 858 /// Verify if rebalancing of the subgraph is feasible. If the checks are
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SCCP.cpp | 105 // Remove unreachable blocks and non-feasible edges. in runSCCP()
|
H A D | LoopVersioningLICM.cpp | 494 // Loop versioning is feasible, return true. in isLegalForVersioning() 549 // If versioning found to be feasible and beneficial then proceed in run()
|
/freebsd/share/man/man4/ |
H A D | wg.4 | 83 Diffie-Hellman exchange becomes feasible.
|
H A D | gbde.4 |
|
/freebsd/secure/lib/libcrypto/man/man7/ |
H A D | openssl_user_macros.7 | 187 feasible. For example, \f(CW\*(C`0x60000000L\*(C'\fR will work as expected.
|
/freebsd/crypto/openssl/test/ |
H A D | secmemtest.c | 100 * for test to be feasible/representative. Since we can't assume in test_sec_mem()
|
/freebsd/contrib/bmake/mk/ |
H A D | dirdeps-targets.mk | 33 # This makes it feasible to tweak options like MK_DIRDEPS_CACHE
|
/freebsd/share/mk/ |
H A D | dirdeps-targets.mk | 33 # This makes it feasible to tweak options like MK_DIRDEPS_CACHE
|
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGTargetInfo.h | 48 /// expanded in a place where calls are not feasible (e.g. within the prologue
|
/freebsd/contrib/llvm-project/lld/docs/ |
H A D | ReleaseNotes.rst | 56 (typical for embedded). It also makes full LTO feasible in such cases, since
|
/freebsd/contrib/googletest/googletest/ |
H A D | README.md | 130 with `set(CMAKE_CXX_STANDARD_REQUIRED ON)`. If this is not feasible, for example
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | SCCPSolver.h | 126 // block to the 'To' basic block is currently feasible.
|
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ProgramState.h | 212 // If no new state is feasible, NULL is returned. 219 /// If no new state is feasible, NULL is returned. 244 /// If no new state is feasible, NULL is returned.
|
/freebsd/contrib/file/ |
H A D | README.md | 124 - If this is not feasible, use additional check
|
/freebsd/contrib/llvm-project/clang/include/clang/Rewrite/Core/ |
H A D | Rewriter.h | 54 /// line. When feasible, it's better for the caller to check for a blank
|