| /src/sys/external/isc/libsodium/dist/builds/msvc/build/ |
| buildbase.bat | 4 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...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/ |
| ppevvmath.h | 119 fInt solution = fPositiveOne; /*Starting off with baseline of 1 */ local
134 solution = fMultiply(solution, GetScaledFraction(expk_array[i], 10000));
141 solution = fMultiply(solution, error_term);
144 solution = fDivide(fPositiveOne, solution);
146 return solution;
154 fInt solution = ConvertToFraction(0); /*Starting off with baseline of 0 */ local
164 solution = fAdd(solution, GetScaledFraction(logk_array[i], 10000))
544 fInt solution; local
[all...] |
| /src/external/bsd/zstd/dist/lib/dictBuilder/ |
| zdict.c | 181 dictItem solution; local
184 memset(&solution, 0, sizeof(solution));
198 return solution;
222 return solution;
305 if (maxLength < MINMATCHLENGTH) return solution; /* skip : no long-enough solution */
315 solution.pos = (U32)pos;
316 solution.length = (U32)maxLength;
317 solution.savings = savings[maxLength]
526 dictItem solution; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-structalias.cc | 113 1. Each constraint variable x has a solution set associated with it,
133 6. The graph is then walked, and solution sets are
139 appropriate variables to the solution set.
141 8. The process of walking the graph is iterated until no solution
179 An alternative solution is to delay IPA PTA until after all
193 We probably should compute a per-function unit-ESCAPE solution
195 solution can go alongside the non-IPA escaped solution and be
252 /* True if this is a special variable whose solution set should not be
310 the final points-to solution because it reaches its containin
321 bitmap solution; member in struct:variable_info
2759 bitmap solution; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-structalias.cc | 113 1. Each constraint variable x has a solution set associated with it,
133 6. The graph is then walked, and solution sets are
139 appropriate variables to the solution set.
141 8. The process of walking the graph is iterated until no solution
179 An alternative solution is to delay IPA PTA until after all
193 We probably should compute a per-function unit-ESCAPE solution
195 solution can go alongside the non-IPA escaped solution and be
253 /* True if this is a special variable whose solution set should not be
311 the final points-to solution because it reaches its containin
322 bitmap solution; member in struct:variable_info
2789 bitmap solution; local
[all...] |
| /src/external/ibm-public/postfix/dist/mantools/ |
| make_soho_readme | 31 need a solution such as "fetchmail", which is outside the scope of
|
| /src/external/lgpl3/gmp/dist/mpn/pa32/hppa1_1/ |
| udiv.asm | 43 C current solution is to stuff data right into the code, and refer it using
|
| /src/share/mk/ |
| bsd.kmodule.mk | 47 # The real solution to this involves generating trampolines for those
152 # The solution to limited branch space involves generating trampolines for
|
| bsd.lib.mk | 52 # Perhaps a more correct solution is to always generate _pic.a
|
| /src/external/mit/isl/dist/doc/ |
| implementation.tex | 209 This sample value represents a valid solution if each constraint variable
215 greater than any solution, and gradually increments this sample value
216 through pivoting until a valid solution is obtained.
225 the first solution found is guaranteed to be the (lexicographically)
226 minimal solution \cite{Feautrier88parametric}.
231 that the zero vector is no greater than the minimal solution and
260 state of the tableau represents a solution. If one of the terms
270 The solution found by the dual simplex method may have
316 any potential solution. The sign of the constant term of a row
462 Any solution to the new system is also a solutio
[all...] |
| /src/sys/dev/mvme/ |
| mvmebus.c | 53 #error Need a solution for non-68k.
|
| /src/external/bsd/ipf/dist/ |
| HISTORY | 1041 patches for Solaris2 (interface panic solution ?): fix FIONREAD and
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/ |
| package.d | 430 it is not a trivial task to provide a space-efficient solution for
438 $(P The recommended solution (see Unicode Implementation Guidelines)
|
| /src/external/bsd/am-utils/dist/doc/ |
| texinfo.tex | 273 % of a page, or that at the bottom of a page. The solution is
4969 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/bsd/flex/dist/build-aux/ |
| texinfo.tex | 273 % of a page, or that at the bottom of a page. The solution is
4969 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl2/xcvs/dist/build-aux/ |
| texinfo.tex | 293 % of a page, or that at the bottom of a page. The solution is
4698 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl3/autoconf/dist/build-aux/ |
| texinfo.tex | 272 % of a page, or that at the bottom of a page. The solution is
4916 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl3/binutils/dist/texinfo/ |
| texinfo.tex | 293 % of a page, or that at the bottom of a page. The solution is
4694 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl3/binutils.old/dist/texinfo/ |
| texinfo.tex | 293 % of a page, or that at the bottom of a page. The solution is
4694 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl3/gcc.old/dist/gcc/doc/include/ |
| texinfo.tex | 272 % of a page, or that at the bottom of a page. The solution is
4918 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl3/gdb/dist/texinfo/ |
| texinfo.tex | 293 % of a page, or that at the bottom of a page. The solution is
4694 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl3/gdb.old/dist/texinfo/ |
| texinfo.tex | 293 % of a page, or that at the bottom of a page. The solution is
4694 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/lgpl3/gmp/dist/doc/ |
| texinfo.tex | 273 % of a page, or that at the bottom of a page. The solution is
4969 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/lgpl3/mpc/dist/doc/ |
| texinfo.tex | 273 % of a page, or that at the bottom of a page. The solution is
4969 % The right solution is to prevent \entry from swallowing the whole text.
|
| /src/external/gpl2/gmake/dist/config/ |
| texinfo.tex | 3725 % The right solution is to prevent \entry from swallowing the whole text.
|
