Home
last modified time | relevance | path

Searched refs:costs (Results 1 – 24 of 24) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp185 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
192 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
194 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
197 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
217 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
219 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
220 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
228 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
229 costs[i + 1][j + 1] = sameParityMax + 1.0; in addIntraChainConstraint()
[all …]
H A DAArch64Features.td363 "Prefer fixed width loop vectorization over scalable if the cost-model assigns equal costs">;
/freebsd/contrib/googletest/googletest/src/
H A Dgtest.cc1336 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local
1342 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits()
1343 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits()
1347 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) { in CalculateOptimalEdits()
1348 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits()
1356 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits()
1361 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits()
1362 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits()
1363 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits()
1365 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits()
[all …]
/freebsd/contrib/libxo/doc/
H A Dformatting.rst19 data, which can reduce maintenance costs and increase feature velocity.
/freebsd/sys/contrib/openzfs/
H A DLICENSE351 for costs, including, without limitation, court costs and
/freebsd/sys/cddl/contrib/opensolaris/
H A DOPENSOLARIS.LICENSE351 for costs, including, without limitation, court costs and
/freebsd/cddl/contrib/opensolaris/
H A DOPENSOLARIS.LICENSE351 for costs, including, without limitation, court costs and
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86.td739 : SubtargetFeature<"use-slm-arith-costs", "UseSLMArithCosts", "true",
740 "Use Silvermont specific arithmetic costs">;
743 : SubtargetFeature<"use-glm-div-sqrt-costs", "UseGLMDivSqrtCosts", "true",
744 "Use Goldmont specific floating point div/sqrt costs">;
/freebsd/usr.sbin/bsnmpd/modules/snmp_bridge/
H A DBRIDGE-MIB.txt672 If the port path costs exceeds the maximum value of this
1274 path costs."
1441 costs. In particular, this includes devices supporting
/freebsd/sys/dev/isp/
H A DHardware.txt14 I'll put a rough range of costs in US$ that I know about. No doubt
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/
H A DTargetSchedule.td484 // renamed at the cost of a single physical register. Note that register costs
/freebsd/contrib/sendmail/cf/cf/
H A Dsubmit.cf425 # shall I avoid calling initgroups(3) because of high NIS costs?
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.in1564 …me using comparable fixed sample size methods is calculated. The computer costs of fixed sample si…
9955 annote = "Simple evaluation of record fetch costs using various accessing sequences.",
11292 …logy, a model and a programmed system to estimate primarily total storage costs and average access…
13247 …keywords = "compilation costs; compiler design; computational complexity; computer programming…
15731 …hm are given; the dependency relationships are derived; the computational costs are developed; and…
15737 …keywords = "application; computational costs; computing; covar; dependency relationships; elem…
16337 …resents an appropriate automatic algorithm which includes many significant details of both costs.",
18049 …es of the versions and by computational comparison of computation and times and processing costs.",
18379 …offs is used to analyze the effect of design parameters on overall system costs. A specific design…
19395 …costs, and reorganization costs. This paper considers the optimum points at which to reorganize da…
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVInstrInfoV.td133 // For these classes, we assume that they are with the worst case costs and
/freebsd/contrib/llvm-project/llvm/lib/Target/Sparc/
H A DSparcInstrInfo.td39 // costs for V8 instructions that are more expensive than their V9 ones.
/freebsd/contrib/ntp/
H A Dconfigure.ac1428 [- include processing time debugging code (costs performance)]
/freebsd/sys/dev/aic7xxx/
H A Daic79xx.seq2095 * the FIFO anyway since it costs us only one extra
/freebsd/contrib/sendmail/cf/m4/
H A Dproto.m4575 # shall I avoid calling initgroups(3) because of high NIS costs?
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DAttrDocs.td5868 but dynamically it behaves more like a C function. This lowers some of the costs
5898 In order to minimize code-size costs, the implementation will not emit a reference
/freebsd/crypto/openssh/
H A DChangeLog735 valgrind, where startup costs are magnified.
/freebsd/contrib/tzdata/
H A Dnorthamerica1889 # could be fined up to $25 and costs". There seems to be no record of
/freebsd/contrib/ncurses/
H A DNEWS12681 insert_padding in insert mode after each char. This adds new costs
14921 + modify lib_doupdate.c to use effective costs to tradeoff between
14924 + compute effective costs for screen update operations (e.g., clr_eos,
/freebsd/contrib/unbound/doc/
H A DChangelog10684 in DoS conditions, and costs very little in normal conditions.
/freebsd/share/dict/
H A Dweb2a39722 pauper costs