Home
last modified time | relevance | path

Searched full:solution (Results 1 – 25 of 639) sorted by relevance

12345678910>>...26

/freebsd/sys/contrib/libsodium/builds/msvc/build/
H A Dbuildbase.bat4 SET solution=%1
13 ECHO Building: %solution%
19 msbuild /m /v:n /p:Configuration=DynDebug /p:Platform=Win32 %solution% >> %log%
22 msbuild /m /v:n /p:Configuration=DynRelease /p:Platform=Win32 %solution% >> %log%
25 msbuild /m /v:n /p:Configuration=LtcgDebug /p:Platform=Win32 %solution% >> %log%
28 msbuild /m /v:n /p:Configuration=LtcgRelease /p:Platform=Win32 %solution% >> %log%
31 msbuild /m /v:n /p:Configuration=StaticDebug /p:Platform=Win32 %solution% >> %log%
34 msbuild /m /v:n /p:Configuration=StaticRelease /p:Platform=Win32 %solution% >> %log%
41 msbuild /m /v:n /p:Configuration=DynDebug /p:Platform=x64 %solution% >> %log%
44 msbuild /m /v:n /p:Configuration=DynRelease /p:Platform=x64 %solution% >> %log%
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DSolution.h1 //===- Solution.h - PBQP Solution -------------------------------*- C++ -*-===//
9 // PBQP Solution class.
23 /// Represents a solution to a PBQP problem.
26 class Solution {
32 /// Initialise an empty solution.
33 Solution() = default;
H A DReductionRules.h18 #include "Solution.h"
168 // Find a solution to a fully reduced graph by backpropagation.
171 // order and greedily compute a minimum solution based on the node costs, and
180 Solution backpropagate(GraphT& G, StackT stack) { in backpropagate()
185 Solution s; in backpropagate()
195 // spilling it may provide a lower cost solution. Assert here that spilling in backpropagate()
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/
H A DSolver.h49 /// satisfiable. The result will hold a solution found by the solver.
50 static Result Satisfiable(llvm::DenseMap<Atom, Assignment> Solution) { in Satisfiable()
51 return Result(Status::Satisfiable, std::move(Solution)); in Satisfiable()
69 return Solution; in getSolution()
74 std::optional<llvm::DenseMap<Atom, Assignment>> Solution) in Result()
75 : SATCheckStatus(SATCheckStatus), Solution(std::move(Solution)) {} in Result()
78 std::optional<llvm::DenseMap<Atom, Assignment>> Solution; member
/freebsd/contrib/pkgconf/doc/
H A Dlibpkgconf-queue.rst38 Removes references to package nodes contained in a solution.
52 :returns: true if the dependency resolver found a solution, otherwise false.
58 feed the solution to a callback function if a complete dependency graph is found.
64 …:param pkgconf_queue_apply_func_t func: The callback function to call if a solution is found by th…
67 :returns: true if the dependency resolver found a solution, otherwise false.
77 :returns: true if the dependency resolver found a solution, otherwise false.
/freebsd/crypto/openssl/doc/designs/
H A Dhandling-some-max-defines.md23 #### Proposed solution:
50 #### Proposed solution:
75 #### Proposed solution:
98 #### Proposed solution:
121 #### Proposed solution:
143 #### Proposed solution:
H A Dxof.md75 #### Proposal 2 (Proposed Solution)
200 ### Solution 1
219 ### Solution 2
237 ### Solution 3
249 - More of a hack than a real solution.
251 ### Solution 4 (Proposed Solution)
253 An alternative approach to solution 2 is to modify the SHA3_squeeze() slightly
/freebsd/contrib/pkgconf/libpkgconf/
H A Dqueue.c270 /* free the initial solution */ in pkgconf_queue_verify()
281 * Removes references to package nodes contained in a solution.
310 * :returns: true if the dependency resolver found a solution, otherwise false.
335 * feed the solution to a callback function if a complete dependency graph is found.
341 …* :param pkgconf_queue_apply_func_t func: The callback function to call if a solution is found …
344 * :returns: true if the dependency resolver found a solution, otherwise false.
385 * :returns: true if the dependency resolver found a solution, otherwise false.
/freebsd/sys/contrib/zstd/lib/dictBuilder/
H A Dzdict.c181 dictItem solution; in ZDICT_analyzePos() local
184 memset(&solution, 0, sizeof(solution)); in ZDICT_analyzePos()
198 return solution; in ZDICT_analyzePos()
222 return solution; in ZDICT_analyzePos()
305 if (maxLength < MINMATCHLENGTH) return solution; /* skip : no long-enough solution */ in ZDICT_analyzePos()
315 solution.pos = (U32)pos; in ZDICT_analyzePos()
316 solution.length = (U32)maxLength; in ZDICT_analyzePos()
317 solution.savings = savings[maxLength]; in ZDICT_analyzePos()
325 length = solution.length; in ZDICT_analyzePos()
328 if (length > solution.length) length = solution.length; in ZDICT_analyzePos()
[all …]
/freebsd/contrib/ntp/libntp/
H A Dclocktime.c41 * On return '*ts_ui' will always the best matching solution, and
83 /* -- get time stamp of potential solution */ in clocktime()
108 /* -- get year start of potential solution */ in clocktime()
110 /* -- get time stamp of potential solution */ in clocktime()
/freebsd/crypto/openssl/doc/designs/quic-design/
H A Drecord-layer.md69 This section outlines two different solution approaches that were considered for
79 In this solution we would seek to implement a different METHOD for each of the
96 * Could be used as the basis for the final public solution
97 * Could also be used as the basis for a fetchable solution in a subsequent
99 * If this option is later converted to a fetchable solution then much of the
107 * If this option is implemented and later converted to a fetchable solution then
127 * Consistent with the extensibility solution used in 3.0
136 ### Selected solution
139 subsequent releases will convert it to a full provider based solution accessible
142 Solution Description: The METHOD based approach
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DDebugSupport.cpp66 if (auto Solution = R.getSolution()) { in operator <<() local
68 Solution->begin(), Solution->end()}; in operator <<()
/freebsd/crypto/heimdal/doc/doxyout/krb5/man/man3/
H A Dkrb5_ccache_intro.319 API A credential cache server based solution for Mac OS X
21 KCM A credential cache server based solution for all platforms
/freebsd/contrib/llvm-project/lld/docs/
H A Dmissingkeyfunction.rst51 The solution in this case is to implement the missing function.
73 The solution in this case is to add the missing ``= 0`` to the declaration of
83 The solution in this case is to check your dependencies to make sure that
/freebsd/contrib/file/magic/Magdir/
H A Dpuzzle16 >0x1e leshort 0x0000 plain text solution
17 >0x1e leshort !0x0000 scrambled solution
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp12 // solving this using a PBQP solver, and mapping the solution back to a
56 #include "llvm/CodeGen/PBQP/Solution.h"
169 /// Given a solved PBQP problem maps this solution back to a register
172 const PBQP::Solution &Solution,
714 const PBQP::Solution &Solution, in mapPBQPToRegAlloc() argument
728 // Iterate over the nodes mapping the PBQP solution to a register in mapPBQPToRegAlloc()
732 unsigned AllocOpt = Solution.getSelection(NId); in mapPBQPToRegAlloc()
821 // * Map the solution back to a register allocation in runOnMachineFunction()
871 PBQP::Solution Solution = PBQP::RegAlloc::solve(G); in runOnMachineFunction() local
872 PBQPAllocComplete = mapPBQPToRegAlloc(G, Solution, VRM, *VRegSpiller); in runOnMachineFunction()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__type_traits/
H A Dis_specialization.h17 // like to see a solution to this problem, but it requires language evolution
20 // Since it is expected a real solution will be provided in the future only the
/freebsd/contrib/pkgconf/man/
H A Dpkgconf.1122 .Fl -solution ,
196 Dump the dependency resolver's solution as a graphviz
348 dependencies of modules added to the resolver's solution.
397 of a solution.
507 .It Fl -solution
522 module as part of its solution.
/freebsd/crypto/openssl/crypto/thread/arch/
H A Dthread_win.c225 * auto-reset events and manual-reset events. A solution based on semaphores
228 * PROBLEM. Designing a solution based on semaphores is non-trivial because,
243 * GENERATION COUNTERS. One naive solution to this is to use a generation
257 * SOLUTION. A solution is chosen as follows. In its initial state, a
271 * structure, this solution uses two Win32 semaphores.
/freebsd/sys/contrib/device-tree/Bindings/nds32/
H A Dandestech-boards21 processors to provide a cost-effective and high performance solution for
24 logics to complete a SoC solution for a specific application. With
/freebsd/contrib/llvm-project/libcxx/include/__type_traits/
H A Dis_specialization.h17 // like to see a solution to this problem, but it requires language evolution
20 // Since it is expected a real solution will be provided in the future only the
/freebsd/contrib/ntp/ntpd/
H A Djupiter.h37 #define JUPITER_I_VALID 1217 /* solution validity criteria */
83 u_short navtype; /* navigation solution type */
84 u_short nmeas; /* # of measurements used in solution */
176 u_short solflags; /* solution validity criteria */
/freebsd/sys/contrib/device-tree/Bindings/regulator/
H A Drenesas,raa215300.yaml17 battery charger provide a highly integrated, small footprint power solution
19 provides an ease-of-use solution for noise-sensitive audio or RF applications.
H A Dpwm-regulator.txt20 more fine grained solution when compared with
21 voltage-table mode above. This solution does make an
/freebsd/include/rpcsvc/
H A Dcrypt.x48 * One solution for this problem is to do the DES encryption as a system
54 * So we have this second solution: we provide a server that does the

12345678910>>...26