| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint() 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() 237 G.updateEdgeCosts(edge, std::move(costs)); in addIntraChainConstraint() 289 PBQP::Matrix costs(G.getEdgeCosts(edge)); in addInterChainConstraint() local 299 if (costs[i + 1][j + 1] != in addInterChainConstraint() 302 sameParityMax = costs[i + 1][j + 1]; in addInterChainConstraint() [all …]
|
| /freebsd-14.2/contrib/cortex-strings/scripts/ |
| H A D | libplot.py | 56 costs = {} 59 costs[(record.bytes, record.loops)] = record.elapsed 68 cost = costs.get((record.bytes, record.loops), None)
|
| /freebsd-14.2/contrib/googletest/googletest/src/ |
| H A D | gtest.cc | 1310 std::vector<std::vector<double> > costs( in CalculateOptimalEdits() local 1316 for (size_t l_i = 0; l_i < costs.size(); ++l_i) { in CalculateOptimalEdits() 1317 costs[l_i][0] = static_cast<double>(l_i); in CalculateOptimalEdits() 1322 costs[0][r_i] = static_cast<double>(r_i); in CalculateOptimalEdits() 1330 costs[l_i + 1][r_i + 1] = costs[l_i][r_i]; in CalculateOptimalEdits() 1335 const double add = costs[l_i + 1][r_i]; in CalculateOptimalEdits() 1336 const double remove = costs[l_i][r_i + 1]; in CalculateOptimalEdits() 1337 const double replace = costs[l_i][r_i]; in CalculateOptimalEdits() 1339 costs[l_i + 1][r_i + 1] = add + 1; in CalculateOptimalEdits() 1342 costs[l_i + 1][r_i + 1] = remove + 1; in CalculateOptimalEdits() [all …]
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/arm/ |
| H A D | idle-states.yaml | 153 and denotes the energy costs incurred while entering and leaving the idle 194 costs, it is clear that if the idle state residency time (i.e. time till next 198 This is mainly down to the fact that IDLE1 entry/exit energy costs are lower
|
| /freebsd-14.2/sys/contrib/dev/ice/ |
| H A D | README | 179 Your costs and results may vary.
|
| /freebsd-14.2/sys/contrib/device-tree/Bindings/cpu/ |
| H A D | idle-states.yaml | 173 and denotes the energy costs incurred while entering and leaving the idle 214 costs, it is clear that if the idle state residency time (i.e. time till next 218 This is mainly down to the fact that IDLE1 entry/exit energy costs are lower
|
| /freebsd-14.2/contrib/libxo/doc/ |
| H A D | formatting.rst | 19 data, which can reduce maintenance costs and increase feature velocity.
|
| /freebsd-14.2/cddl/contrib/opensolaris/ |
| H A D | OPENSOLARIS.LICENSE | 351 for costs, including, without limitation, court costs and
|
| /freebsd-14.2/sys/contrib/openzfs/ |
| H A D | LICENSE | 351 for costs, including, without limitation, court costs and
|
| /freebsd-14.2/sys/cddl/contrib/opensolaris/ |
| H A D | OPENSOLARIS.LICENSE | 351 for costs, including, without limitation, court costs and
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86.td | 737 : SubtargetFeature<"use-slm-arith-costs", "UseSLMArithCosts", "true", 738 "Use Silvermont specific arithmetic costs">; 741 : SubtargetFeature<"use-glm-div-sqrt-costs", "UseGLMDivSqrtCosts", "true", 742 "Use Goldmont specific floating point div/sqrt costs">;
|
| H A D | X86RegisterInfo.td | 90 // D133902 stopped assigning register costs for R8-R15, which brought gain
|
| /freebsd-14.2/usr.sbin/bsnmpd/modules/snmp_bridge/ |
| H A D | BRIDGE-MIB.txt | 672 If the port path costs exceeds the maximum value of this 1274 path costs." 1441 costs. In particular, this includes devices supporting
|
| /freebsd-14.2/sys/dev/isp/ |
| H A D | Hardware.txt | 14 I'll put a rough range of costs in US$ that I know about. No doubt
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Target/ |
| H A D | TargetSchedule.td | 487 // renamed at the cost of a single physical register. Note that register costs
|
| /freebsd-14.2/contrib/sendmail/cf/cf/ |
| H A D | submit.cf | 425 # shall I avoid calling initgroups(3) because of high NIS costs?
|
| /freebsd-14.2/contrib/one-true-awk/testdir/ |
| H A D | funstack.in | 9955 annote = "Simple evaluation of record fetch costs using various accessing sequences.", 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… 18049 …es of the versions and by computational comparison of computation and times and processing costs.", 19395 …costs, and reorganization costs. This paper considers the optimum points at which to reorganize da… 20146 …keywords = "compressed; costs; data processing --- Data Handling; data storage, digital; desig… 23872 …costs do not exceed their retrieval costs. The GWS is a model for the entire class of demand-fetch… 23878 …ent set inclusion; retention costs; retrieval costs; segment reference strings; storage; storage m… 24202 …keywords = "computer systems programming; costs; data handling; open addressing; optimal packi… [all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVInstrInfoV.td | 133 // For these classes, we assume that they are with the worst case costs and
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Sparc/ |
| H A D | SparcInstrInfo.td | 39 // costs for V8 instructions that are more expensive than their V9 ones.
|
| /freebsd-14.2/sys/dev/aic7xxx/ |
| H A D | aic79xx.seq | 2095 * the FIFO anyway since it costs us only one extra
|
| /freebsd-14.2/contrib/ntp/ |
| H A D | configure.ac | 1428 [- include processing time debugging code (costs performance)]
|
| /freebsd-14.2/contrib/sendmail/cf/m4/ |
| H A D | proto.m4 | 575 # shall I avoid calling initgroups(3) because of high NIS costs?
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | AttrDocs.td | 5675 but dynamically it behaves more like a C function. This lowers some of the costs 5705 In order to minimize code-size costs, the implementation will not emit a reference
|
| /freebsd-14.2/contrib/tzdata/ |
| H A D | northamerica | 1889 # could be fined up to $25 and costs". There seems to be no record of
|
| /freebsd-14.2/contrib/ncurses/ |
| H A D | NEWS | 12681 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,
|