| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/ |
| H A D | build_result.hpp | 36 void build_result_polygons(mapbox::geometry::multi_polygon<T2>& solution, in build_result_polygons() argument
44 solution.emplace_back(); in build_result_polygons()
45 push_ring_to_polygon(solution.back(), r, reverse_output); in build_result_polygons()
51 push_ring_to_polygon(solution.back(), c, reverse_output); in build_result_polygons()
58 build_result_polygons(solution, c->children, reverse_output); in build_result_polygons()
65 void build_result(mapbox::geometry::multi_polygon<T2>& solution, in build_result() argument
68 build_result_polygons(solution, rings.children, reverse_output); in build_result()
|
| /OK3568_Linux_fs/kernel/drivers/gpu/drm/amd/pm/powerplay/hwmgr/ |
| H A D | ppevvmath.h | 117 fInt solution = fPositiveOne; /*Starting off with baseline of 1 */ in fExponential() local
132 solution = fMultiply(solution, GetScaledFraction(expk_array[i], 10000)); in fExponential()
139 solution = fMultiply(solution, error_term); in fExponential()
142 solution = fDivide(fPositiveOne, solution); in fExponential()
144 return solution; in fExponential()
152 fInt solution = ConvertToFraction(0); /*Starting off with baseline of 0 */ in fNaturalLog() local
162 solution = fAdd(solution, GetScaledFraction(logk_array[i], 10000)); in fNaturalLog()
169 return (fAdd(solution, error_term)); in fNaturalLog()
542 fInt solution; in fRoundUpByStepSize() local
544 solution = fDivide(A, fStepSize); in fRoundUpByStepSize()
[all …]
|
| /OK3568_Linux_fs/buildroot/docs/manual/ |
| H A D | configure.txt | 72 Type+ option in the +Toolchain+ menu. Once one solution has been
159 definitely the easiest solution.
171 itself. To do this, select the +Custom toolchain+ solution in the
300 * The first solution is *Static using device table*. This is the old
324 * The second solution is *Dynamic using devtmpfs only*. _devtmpfs_ is
340 * The third solution is *Dynamic using devtmpfs + mdev*. This method
360 * The fourth solution is *Dynamic using devtmpfs + eudev*. This
365 more heavyweight solution than +mdev+, but provides higher
372 using devtmpfs only* solution, until you have the need for userspace
375 good solution.
[all …]
|
| /OK3568_Linux_fs/kernel/arch/mips/lib/ |
| H A D | bitops.c | 17 * set_bit() if it cannot find a faster solution.
38 * it cannot find a faster solution.
59 * if it cannot find a faster solution.
80 * called by test_and_set_bit_lock() if it cannot find a faster solution.
105 * called by test_and_clear_bit() if it cannot find a faster solution.
129 * called by test_and_change_bit() if it cannot find a faster solution.
|
| /OK3568_Linux_fs/kernel/Documentation/hwmon/ |
| H A D | sch5636.rst | 20 their own custom hwmon solution based upon the SCH5636.
23 hwmon solution. The sch5636 driver runs a sanity check on loading to ensure
25 hwmon solution.
32 The Fujitsu Theseus hwmon solution also contains an integrated watchdog.
|
| /OK3568_Linux_fs/kernel/Documentation/process/ |
| H A D | 3.Early-stage.rst | 20 with the proposed solution, and that can lead to difficulties.
24 by excessive latency in the system. The solution they arrived at was a
38 The audio community, however, could not see past the particular solution
53 the right solution to the problem than they were with a specific module.
54 The moral of the story is to focus on the problem - not a specific solution
64 solution address?
87 - There may be elements of the proposed solution which will not be
92 problem; they may have ideas for a better solution, and may be willing
93 to help in the creation of that solution.
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/clip2tri/ |
| H A D | clip2tri.cpp | 78 PolyTree solution; in triangulate() local
79 mergePolysToPolyTree(inputPolygons, solution); in triangulate()
84 triangulateComplex(outputTriangles, bounds, solution); in triangulate()
153 Paths solution; in execute() local
157 clipper.Execute(operation(op), solution, subjFillType, clipFillType); in execute()
163 solution.push_back(n->Contour); in execute()
165 solution.push_back(n->Contour); in execute()
173 return solution; in execute()
233 bool clip2tri::mergePolysToPolyTree(const vector<vector<Point> > &inputPolygons, PolyTree &solution) in mergePolysToPolyTree() argument
250 return clipper.Execute(ctUnion, solution, pftNonZero, pftNonZero); in mergePolysToPolyTree()
|
| /OK3568_Linux_fs/external/xserver/hw/dmx/doc/ |
| H A D | scaled.xml | 58 will be addressed in this paper, the general solution space
60 solution not only for <command>vncviewer</command> but also for
152 provide software scaling. This is not a general solution,
156 A prototype of this solution was implemented and a patch
160 considered and the solution works well mainly for integer
167 and must round correctly. In the prototype solution,
171 A better solution would be to cache all updates to the
199 Extension, so this would not provide an immediate solution
208 solved to make this solution viable:
330 Extension in DMX, one obvious solution would be to
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/mtd/maps/ |
| H A D | solutionengine.c | 2 * Flash and EPROM on Hitachi Solution Engine and similar boards.
23 .name = "Solution Engine EPROM",
29 .name = "Solution Engine FLASH",
62 printk(KERN_NOTICE "Solution Engine: Flash at 0x%pap, EPROM at 0x%pap\n", in init_soleng_maps()
|
| /OK3568_Linux_fs/kernel/Documentation/networking/device_drivers/cable/ |
| H A D | sb1000.rst | 141 Solution
153 Solution
161 Solution
170 Solution
175 Solution
183 Solution
196 Solution
|
| /OK3568_Linux_fs/buildroot/package/python3/ |
| H A D | 0028-Fix-cross-compiling-the-uuid-module.patch | 10 To fix this, use the same solution as the one used by the NIS
15 [Thomas: drop STAGING_DIR based solution, use a solution similar to
|
| /OK3568_Linux_fs/kernel/Documentation/kbuild/ |
| H A D | Kconfig.recursion-issue-01 | 37 # obvious that an easy to solution to this problem should just be the removal
41 # implications of this recursive issue where the solution is perhaps not so
43 # CORE also consist of a solution to this recursive problem.
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/clipper/ |
| H A D | clipper.h | 15 * "A generic solution to polygon clipping" *
184 void MinkowskiSum(const Path& pattern, const Path& path, Paths& solution, bool pathIsClosed);
185 void MinkowskiSum(const Path& pattern, const Paths& paths, Paths& solution, bool pathIsClosed);
186 void MinkowskiDiff(const Path& poly1, const Path& poly2, Paths& solution);
266 Paths &solution,
269 Paths &solution,
365 void Execute(Paths& solution, double delta);
366 void Execute(PolyTree& solution, double delta);
|
| /OK3568_Linux_fs/u-boot/doc/driver-model/ |
| H A D | fdt-fixup.txt | 31 In the Linux kernel, one possible solution to this problem is to employ the
51 tree (at least after the relocation) would greatly simplify the solution of
53 solution is needed to address the problem at least in the medium-term.
55 Hence, we propose a solution to this problem by offering a board-specific
|
| /OK3568_Linux_fs/kernel/Documentation/filesystems/ |
| H A D | locks.rst | 43 1.2.2 The Solution
45 The solution I have chosen, after much experimentation and discussion,
50 race and deadlock conditions that the current solution was the only
|
| H A D | fuse.rst | 232 The solution is not to allow opening device files and ignore
243 The solution to this problem will be presented in point 2) of C).
273 The solution to this as well as B) is not to allow processes
364 The solution for this is to allow the filesystem to be aborted.
397 The solution is basically the same as above.
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/ |
| H A D | tree-ssa-alias.h | 24 /* The points-to solution.
26 The points-to solution is a union of pt_vars and the abstract
38 /* Nonzero if the points-to set includes the local escaped solution by
42 /* Nonzero if the points-to set includes the IPA escaped solution by
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/ |
| H A D | tree-ssa-alias.h | 24 /* The points-to solution.
26 The points-to solution is a union of pt_vars and the abstract
38 /* Nonzero if the points-to set includes the local escaped solution by
42 /* Nonzero if the points-to set includes the IPA escaped solution by
|
| /OK3568_Linux_fs/kernel/net/smc/ |
| H A D | Kconfig | 6 SMC-R provides a "sockets over RDMA" solution making use of
9 The Linux implementation of the SMC-R solution is designed as
|
| /OK3568_Linux_fs/kernel/Documentation/driver-api/usb/ |
| H A D | persist.rst | 69 What is the solution?
117 Is this the best solution?
122 centralized Logical Volume Manager. Such a solution would allow you
130 solution is much quicker and easier -- and it exists now, a giant
|
| /OK3568_Linux_fs/kernel/Documentation/vm/ |
| H A D | balance.rst | 51 Another possible solution is that we balance only when the free memory
62 deciding whether to balance the regular zone. The first solution
65 The appended patch implements the second solution. It also "fixes" two
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/ |
| H A D | regex_executor.h | 216 // To record current solution. in _GLIBCXX_VISIBILITY()
233 // To record current solution. in _GLIBCXX_VISIBILITY()
249 // Do we have a solution so far? in _GLIBCXX_VISIBILITY()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/ |
| H A D | regex_executor.h | 216 // To record current solution. in _GLIBCXX_VISIBILITY()
233 // To record current solution. in _GLIBCXX_VISIBILITY()
249 // Do we have a solution so far? in _GLIBCXX_VISIBILITY()
|
| /OK3568_Linux_fs/yocto/poky/meta/recipes-support/nettle/nettle/ |
| H A D | Add-target-to-only-build-tests-not-run-them.patch | 3 Not sending upstream as this is only a start of a solution to
6 Upstream-Status: Inappropriate [not a complete solution]
|
| /OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/nds32/ |
| H A D | andestech-boards | 21 processors to provide a cost-effective and high performance solution for
24 logics to complete a SoC solution for a specific application. With
|