| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 190 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
199 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
222 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
224 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
225 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
233 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
234 costs[i + 1][j + 1] = sameParityMax + 1.0; in addIntraChainConstraint()
[all …]
|
| /third_party/skia/third_party/externals/libwebp/src/dsp/ |
| D | cost_mips_dsp_r2.c | 24 CostArrayPtr const costs = res->costs; in GetResidualCost_MIPSdspR2() local
25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_MIPSdspR2()
34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost_MIPSdspR2()
|
| D | cost.c | 326 CostArrayPtr const costs = res->costs; in GetResidualCost_C() local
327 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_C()
340 t = costs[n + 1][ctx]; in GetResidualCost_C()
|
| D | cost_mips32.c | 24 CostArrayPtr const costs = res->costs; in GetResidualCost_MIPS32() local
25 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_MIPS32()
34 const uint16_t** p_costs = &costs[n][0]; in GetResidualCost_MIPS32()
|
| D | cost_sse2.c | 51 CostArrayPtr const costs = res->costs; in GetResidualCost_SSE2() local
52 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_SSE2()
87 t = costs[n + 1][ctx]; in GetResidualCost_SSE2()
|
| D | cost_neon.c | 57 CostArrayPtr const costs = res->costs; in GetResidualCost_NEON() local
58 const uint16_t* t = costs[n][ctx0]; in GetResidualCost_NEON()
90 t = costs[n + 1][ctx]; in GetResidualCost_NEON()
|
| /third_party/icu/docs/userguide/icu/ |
| D | index.md | 44 or incur high costs to build them.
59 risk, maintenance costs and training costs. It also enhances organizational
|
| /third_party/skia/third_party/externals/libwebp/src/enc/ |
| D | cost_enc.h | 36 CostArrayPtr costs; member
|
| D | quant_enc.c | 567 const uint16_t* costs; // shortcut to cost tables member
594 CostArrayPtr const costs = in TrellisQuantizeBlock() local
632 ss_cur[m].costs = costs[first][ctx0]; in TrellisQuantizeBlock()
668 ss_cur[m].costs = costs[n + 1][ctx]; in TrellisQuantizeBlock()
688 const score_t cost = VP8LevelCost(ss_prev[p].costs, level); in TrellisQuantizeBlock()
|
| D | cost_enc.c | 211 res->costs = enc->proba_.remapped_costs_[coeff_type]; in VP8InitResidual()
|
| /third_party/rust/crates/memchr/bench/data/opensubtitles/ |
| D | zh-small.txt | 27 日常開支近2倍 overhead costs are nearly double.
|
| /third_party/skia/third_party/externals/libpng/ |
| D | TODO | 15 (e.g., counting huffman bits/precompression; filter inertia; filter costs).
|
| /third_party/skia/third_party/externals/dawn/docs/ |
| D | testing.md | 65 layout incurs additional state tracking costs in Dawn.
66 - With/Without render bundles: All of the above can have lower validation costs if
|
| /third_party/libsnd/docs/ |
| D | donate.md | 11 maintaining this library for Windows costs me significant amounts of time above
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/appendices/ |
| D | VK_EXT_depth_clip_control.txt | 24 different depth value, costs ALU and consumes shader output components that
|
| /third_party/mesa3d/src/gtest/src/ |
| D | gtest.cc | 1037 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1043 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1044 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1048 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1049 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1057 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1062 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1063 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1064 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1066 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
|
| /third_party/googletest/googletest/src/ |
| D | gtest.cc | 1293 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1299 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1300 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1304 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1305 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1313 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1318 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1319 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1320 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1322 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
|
| /third_party/node/deps/googletest/src/ |
| D | gtest.cc | 1301 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1307 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1308 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1312 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1313 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1321 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1326 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1327 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1328 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1330 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/IBM/ |
| D | IBM_static_data.txt | 33 result in ineffective amortization of fixed costs. Neither copying nor
|
| /third_party/rust/crates/memchr/bench/data/pathological/ |
| D | README.md | 3 is to make the costs of those heuristics clearer. In particular, the main idea
|
| /third_party/openGLES/extensions/IBM/ |
| D | IBM_static_data.txt | 33 result in ineffective amortization of fixed costs. Neither copying nor
|
| /third_party/skia/site/docs/dev/design/conical/ |
| D | _index.md | 189 $b = -2 \cdot (x + (r1 - r0) \cdot r0)$ costs 2 multiplications and 1 addition.
190 Number $c = x^2 + y^2 - r_0^2$ costs 3 multiplications and 2 additions. And the
191 final $t$ costs 5 more multiplications, 1 more sqrt, and 2 more additions.
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/ARB/ |
| D | ARB_transpose_matrix.txt | 73 It costs some performance. It is believed that most OpenGL
|
| /third_party/rust/crates/rustc-hash/ |
| D | CODE_OF_CONDUCT.md | 12 …at every design or implementation choice carries a trade-off and numerous costs. There is seldom a…
|
| /third_party/skia/third_party/externals/dng_sdk/ |
| D | LICENSE.source_code | 62 against any losses, damages and costs arising from the claims, lawsuits or other
|