| /external/mesa3d/src/panfrost/util/ |
| D | lcra.c | 59 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
61 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count); in lcra_alloc_equations()
80 free(l->solutions); in lcra_free()
138 lcra_test_linear(struct lcra_state *l, unsigned *solutions, unsigned i) in lcra_test_linear() argument
141 signed constant = solutions[i]; in lcra_test_linear()
144 if (solutions[j] == ~0) continue; in lcra_test_linear()
146 signed lhs = solutions[j] - constant; in lcra_test_linear()
162 if (l->solutions[step] != ~0) continue; in lcra_solve()
181 l->solutions[step] = ((m * P + n) << shift) + class_start; in lcra_solve()
182 succ = lcra_test_linear(l, l->solutions, step); in lcra_solve()
|
| D | lcra.h | 69 unsigned *solutions; member
|
| /external/fonttools/Lib/fontTools/pens/ |
| D | pointInsidePen.py | 121 solutions = sorted(solveCubic(ay, by, cy, dy - y))
122 solutions = [t for t in solutions if -0. <= t <= 1.]
123 if not solutions:
133 for t in solutions:
177 solutions = sorted(solveQuadratic(a, b, c - y))
178 solutions = [t for t in solutions if ZERO_MINUS_EPSILON <= t <= ONE_PLUS_EPSILON]
179 if not solutions:
|
| /external/libconfig/debian/ |
| D | changelog | 7 -- Jose Luis Tallon <jltallon@adv-solutions.net> Thu, 31 Dec 2015 17:01:20 +0100
126 -- Jose Luis Tallon <jltallon@adv-solutions.net> Sun, 13 Sep 2009 04:25:14 +0200
134 -- Jose Luis Tallon <jltallon@adv-solutions.net> Tue, 07 Apr 2009 21:13:16 +0200
152 -- Jose Luis Tallon <jltallon@adv-solutions.net> Fri, 31 Oct 2008 22:13:47 +0100
161 -- Jose Luis Tallon <jltallon@adv-solutions.net> Mon, 20 Jul 2008 19:55:23 +0200
167 -- Jose Luis Tallon <jltallon@adv-solutions.net> Mon, 2 Jul 2007 02:01:40 +0200
173 -- Jose Luis Tallon <jltallon@adv-solutions.net> Tue, 10 Oct 2006 01:42:09 +0200
|
| D | copyright | 1 This package was debianized by Jose Luis Tallon <jltallon@adv-solutions.net> on
35 copyright 2006-2009, Jose Luis Tallon <jltallon@adv-solutions.net>,
|
| /external/mesa3d/src/panfrost/midgard/ |
| D | midgard_ra.c | 94 .reg = l->solutions[reg] / 16, in index_to_reg()
95 .offset = l->solutions[reg] & 0xF, in index_to_reg()
566 l->solutions[ins->src[0]] = 0; in allocate_registers()
569 l->solutions[ins->src[2]] = (16 * 1) + COMPONENT_X * 4; in allocate_registers()
572 l->solutions[ins->src[3]] = (16 * 1) + COMPONENT_Y * 4; in allocate_registers()
575 l->solutions[ins->src[1]] = (16 * 1) + COMPONENT_Z * 4; in allocate_registers()
578 l->solutions[ins->dest] = (16 * 1) + COMPONENT_W * 4; in allocate_registers()
594 l->solutions[node_r1] = (16 * 1); in allocate_registers()
634 l->solutions[ctx->blend_input] = 0; in allocate_registers()
642 l->solutions[ctx->blend_src1] = (16 * 2); in allocate_registers()
|
| /external/eigen/doc/ |
| D | WrongStackAlignment.dox | 22 …nalignedArrayAssert "assertion on unaligned arrays". So far we found the three following solutions.
35 …as to be done for every such function, so you may prefer one of the following two global solutions.
38 \section sec_sol2 Global solutions
52 These global solutions are easy to use, but note that they may slowdown your program because they l…
|
| /external/fonttools/Lib/fontTools/misc/ |
| D | bezierTools.py | 458 solutions = solveQuadratic(
461 solutions = sorted(t for t in solutions if 0 <= t < 1)
462 if not solutions:
464 return _splitQuadraticAtT(a, b, c, *solutions)
495 solutions = solveCubic(
498 solutions = sorted(t for t in solutions if 0 <= t < 1)
499 if not solutions:
501 return _splitCubicAtT(a, b, c, d, *solutions)
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2009-03-12-CPAlignBug.ll | 10 define void @SolveCubic_bb1(i32* %solutions, double* %x, x86_fp80 %.reload, x86_fp80 %.reload5, x86…
18 store i32 1, i32* %solutions, align 4
|
| /external/pigweed/docs/templates/docs/ |
| D | docs.rst | 32 existing solutions to highlight why their approaches were not suitable, but
54 the expense of additional CPU time, where other solutions might make a
79 makes this module stand out from alternative solutions that try to address
|
| /external/vulkan-validation-layers/build-gn/ |
| D | update_deps.sh | 26 solutions = [
|
| /external/exoplayer/ |
| D | OWNERS | 2 # go/android-fwk-media-solutions for info on areas of ownership.
|
| /external/catch2/docs/ |
| D | slow-compiles.md | 8 [Other possible solutions](#other-possible-solutions)<br>
67 ## Other possible solutions
|
| /external/skia/site/docs/dev/design/conical/ |
| D | _index.md | 42 _positive_). If there are multiple (at most 2) solutions of $t$, choose the
64 that with multiple solutions of $t_s$, we shall choose the smaller one (so $t$
76 we're only interested in positive solutions for $x_t$. Again, if there are
77 multiple $x_t$ solutions, we may want to find the bigger one if $1 - f > 0$, and
96 $(x_t - x)^2 + y^2 = (x_t r_1)^2$ and eliminating negative $x_t$ solutions gets
224 **Corollary 1.** By lemma 1. and 2., we conclude that the number of solutions
237 - when $r_1 < 1$, there may be $0, 1$, or $2$ solutions; this was also
244 **Lemma 3.** When solutions exists, one such solution is
343 2. otherwise, the solutions are
|
| /external/skia/platform_tools/android/ |
| D | gclient.config | 4 solutions = [
|
| /external/cronet/build/win/ |
| D | gn_meta_sln.py | 55 solutions = glob.glob(os.path.join("out", out_dir, "*.sln")) variable
56 for solution in solutions:
|
| /external/angle/build/win/ |
| D | gn_meta_sln.py | 55 solutions = glob.glob(os.path.join("out", out_dir, "*.sln")) variable
56 for solution in solutions:
|
| /external/AFLplusplus/docs/ |
| D | tutorials.md | 7 …hub.com/research/fuzzing-challenges-solutions-1](https://securitylab.github.com/research/fuzzing-c…
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_IsotonicRegression.pbtxt | 13 A (batch_size, dim)-tensor holding the per-batch element solutions.
|
| /external/python/pyfakefs/.github/ISSUE_TEMPLATE/ |
| D | feature_request.md | 17 A description of any alternative solutions or features you've considered.
|
| /external/openthread/.github/ISSUE_TEMPLATE/ |
| D | feature_request.md | 10 … you've considered** A clear and concise description of any alternative solutions or features you'…
|
| /external/ot-br-posix/.github/ISSUE_TEMPLATE/ |
| D | feature_request.md | 10 … you've considered** A clear and concise description of any alternative solutions or features you'…
|
| /external/rust/crates/grpcio/.github/ISSUE_TEMPLATE/ |
| D | feature_request.md | 13 A clear and concise description of any alternative solutions or features you've considered.
|
| /external/AFLplusplus/.github/ISSUE_TEMPLATE/ |
| D | feature_request.md | 17 A clear and concise description of any alternative solutions or features you've considered.
|
| /external/zstd/.github/ISSUE_TEMPLATE/ |
| D | feature_request.md | 17 A clear and concise description of any alternative solutions or features you've considered.
|