| /f-stack/freebsd/contrib/zstd/lib/compress/ |
| H A D | zstd_compress_sequences.c | 86 unsigned cost = 0; in ZSTD_entropyCost() local
93 cost += count[s] * kInverseProbabilityLog256[norm]; in ZSTD_entropyCost()
95 return cost >> 8; in ZSTD_entropyCost()
108 size_t cost = 0; in ZSTD_fseBitCost() local
127 cost += (size_t)count[s] * bitCost; in ZSTD_fseBitCost()
129 return cost >> kAccuracyLog; in ZSTD_fseBitCost()
141 size_t cost = 0; in ZSTD_crossEntropyCost() local
149 cost += count[s] * kInverseProbabilityLog256[norm256]; in ZSTD_crossEntropyCost()
151 return cost >> 8; in ZSTD_crossEntropyCost()
|
| /f-stack/tools/libxo/tests/core/saved/ |
| H A D | test_10.X.out | 1 …="value4">bolt</item><item test4="value4">water</item></data><cost>425</cost><cost>455</cost></top>
|
| H A D | test_10.XP.out | 98 <cost>425</cost>
99 <cost>455</cost>
|
| H A D | test_10.JP.out | 110 "cost": 425,
111 "cost": 455
|
| H A D | test_10.J.out | 1 …5,"on-order":1}]}, "data": {"item": ["gum","rope","ladder","bolt","water"]},"cost":425,"cost":455}}
|
| H A D | test_01.XP.out | 155 <cost>425</cost>
156 <cost>455</cost>
|
| H A D | test_01.X.out | 1 …><on-order>2</on-order><in-stock>14</in-stock></item></data><cost>425</cost><cost>455</cost><mode>…
|
| H A D | test_01.J.out | 1 …":"water","sold":17,"extra":"special","on-order":2,"in-stock":14}]},"cost":425,"cost":455,"mode":"…
|
| H A D | test_01.JP.out | 166 "cost": 425,
167 "cost": 455,
|
| H A D | test_10.E.out | 122 op content: [cost] [425] [0]
123 op content: [cost] [455] [0]
|
| H A D | test_01.E.out | 185 op content: [cost] [425] [0]
186 op content: [cost] [455] [0]
|
| H A D | test_10.HIPx.out | 306 <div class="data" data-tag="cost" data-xpath="/top/cost">425</div>
315 <div class="data" data-tag="cost" data-xpath="/top/cost">455</div>
|
| /f-stack/tools/libxo/doc/ |
| H A D | field-roles.rst | 80 xo_emit("{C:/fg-%s,bg-%s}{Lwc:Cost}{:cost/%u}{C:reset}\n",
81 fg_color, bg_color, cost);
181 xo_emit("{Lwc:Cost}{:cost/%u}\n", cost);
191 xo_emit("{:cost/%u} {N:per year}\n", cost);
205 xo_emit("{P: }{Lwc:Cost}{:cost/%u}\n", cost);
206 xo_emit("{P:/%30s}{Lwc:Cost}{:cost/%u}\n", "", cost);
|
| H A D | xolint.rst | 8 xo_emit("cost: %d", cost);
14 xo_emit("{L:cost}: {:cost/%d}", cost);
330 xo_emit("{:cost-in-$$/%u}", 15);
336 xo_emit("{:cost-in-dollars/%u}", 15);
|
| H A D | index.rst | 24 library aims to minimize the cost of migrating code to libxo.
|
| H A D | faq.rst | 18 results were mixed. The cost of maintaining this code, updating it,
32 that have no incremental cost or feature delay.
|
| /f-stack/app/micro_thread/ |
| H A D | mt_action.h | 121 void SetCost(int cost) { in SetCost() argument
122 _time_cost = cost; in SetCost()
|
| /f-stack/dpdk/doc/guides/faq/ |
| H A D | faq.rst | 80 Similarly, the application can be tuned to have, on average, a low end-to-end latency at the cost o…
82 To achieve higher throughput, the DPDK attempts to aggregate the cost of processing each packet ind…
87 This behavior is desirable when tuning for high throughput because the cost of tail pointer updates…
88 can be spread across 32 packets, effectively hiding the relatively slow MMIO cost of writing to the…
96 …et to be processed at a time, providing lower latency, but with the added cost of lower throughput.
155 Unfortunately, the protection comes with an extremely high performance cost for high speed NICs.
|
| /f-stack/freebsd/contrib/device-tree/Bindings/arm/omap/ |
| H A D | omap.txt | 119 - OMAP3 BeagleBoard : Low cost community board
128 - OMAP4 PandaBoard : Low cost community board
146 - AM335X Bone : Low cost community board
149 - AM3359 ICEv2 : Low cost Industrial Communication Engine EVM.
|
| /f-stack/dpdk/doc/guides/prog_guide/ |
| H A D | writing_efficient_code.rst | 140 a low end-to-end latency, at the cost of lower throughput.
143 the DPDK attempts to aggregate the cost of processing each packet individually by processing packet…
153 the cost of tail pointer updates to both the RX and TX queues can be spread across 16 packets,
154 effectively hiding the relatively slow MMIO cost of writing to the PCIe* device.
165 but with the added cost of lower throughput.
243 This avoids the cost of a call instruction (and the associated context saving).
|
| /f-stack/tools/ifconfig/ |
| H A D | ifbridge.c | 626 setbridge_ifpathcost(const char *ifn, const char *cost, int s, in setbridge_ifpathcost() argument
634 if (get_val(cost, &val) < 0) in setbridge_ifpathcost()
635 errx(1, "invalid value: %s", cost); in setbridge_ifpathcost()
641 err(1, "BRDGSIFCOST %s", cost); in setbridge_ifpathcost()
|
| /f-stack/freebsd/contrib/device-tree/Bindings/nds32/ |
| H A D | andestech-boards | 21 processors to provide a cost-effective and high performance solution for
|
| /f-stack/app/redis-5.0.5/deps/lua/ |
| H A D | COPYRIGHT | 6 and commercial purposes at absolutely no cost.
|
| /f-stack/app/redis-5.0.5/deps/jemalloc/ |
| H A D | TUNING.md | 36 small memory cost.
44 to reduces memory usage (usually at the cost of more CPU cycles spent on
|
| /f-stack/dpdk/doc/guides/tools/ |
| H A D | cryptoperf.rst | 20 cost. The cycle-count only represents the offload cost when the hardware
26 cost measurement. Using "pmd-cyclecount" mode will give a better idea of
|