Home
last modified time | relevance | path

Searched full:feasible (Results 1 – 25 of 100) sorted by relevance

1234

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h163 /// 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 DStack.h29 /// feasible, to note the approximate address of the bottom of the stack.
/freebsd/crypto/openssl/doc/man7/
H A Dopenssl_user_macros.pod.in53 feasible. For example, C<0x60000000L> will work as expected.
/freebsd/contrib/libarchive/libarchive/
H A Darchive_read_support_filter_all.c55 * 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 Di2c-arb-gpio-challenge.txt9 that makes standard multimaster mode not feasible.
/freebsd/crypto/openssl/crypto/property/
H A DREADME.md37 be feasible to use a hash table to contain the names (and possibly also
/freebsd/contrib/sendmail/libsm/
H A Dassert.html296 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 Ddiscover.html50 …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 DSCCPSolver.cpp272 // 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 DSampleProfileInference.cpp770 /// 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 DSCCP.cpp105 // Remove unreachable blocks and non-feasible edges. in runSCCP()
H A DLoopVersioningLICM.cpp494 // 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 Dwg.483 Diffie-Hellman exchange becomes feasible.
H A Dgbde.4
/freebsd/secure/lib/libcrypto/man/man7/
H A Dopenssl_user_macros.7187 feasible. For example, \f(CW\*(C`0x60000000L\*(C'\fR will work as expected.
/freebsd/crypto/openssl/test/
H A Dsecmemtest.c100 * for test to be feasible/representative. Since we can't assume in test_sec_mem()
/freebsd/contrib/bmake/mk/
H A Ddirdeps-targets.mk33 # This makes it feasible to tweak options like MK_DIRDEPS_CACHE
/freebsd/share/mk/
H A Ddirdeps-targets.mk33 # This makes it feasible to tweak options like MK_DIRDEPS_CACHE
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAGTargetInfo.h48 /// expanded in a place where calls are not feasible (e.g. within the prologue
/freebsd/contrib/llvm-project/lld/docs/
H A DReleaseNotes.rst56 (typical for embedded). It also makes full LTO feasible in such cases, since
/freebsd/contrib/googletest/googletest/
H A DREADME.md130 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 DSCCPSolver.h126 // block to the 'To' basic block is currently feasible.
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramState.h212 // 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 DREADME.md124 - If this is not feasible, use additional check
/freebsd/contrib/llvm-project/clang/include/clang/Rewrite/Core/
H A DRewriter.h54 /// line. When feasible, it's better for the caller to check for a blank

1234