Searched refs:cost (Results 1 - 173 of 173) sorted by relevance

/linux-4.4.14/include/uapi/linux/netfilter_bridge/
H A Debt_limit.h21 __u32 credit_cap, cost; member in struct:ebt_limit_info
/linux-4.4.14/net/bridge/netfilter/
H A Debt_limit.c45 if (info->credit >= info->cost) { ebt_limit_mt()
47 info->credit -= info->cost; ebt_limit_mt()
84 info->cost = user2credits(info->avg); ebt_limit_mt_check()
97 compat_uint_t credit, credit_cap, cost; member in struct:ebt_compat_limit_info
/linux-4.4.14/include/uapi/linux/netfilter/
H A Dxt_limit.h20 __u32 credit_cap, cost; member in struct:xt_rateinfo
/linux-4.4.14/net/netfilter/
H A Dxt_limit.c40 `credit_cap'. The `peak rate' becomes the cost of passing the
41 test, `cost'.
45 discarded. Every time the match passes, you lose `cost' credits;
80 if (priv->credit >= r->cost) { limit_mt()
82 priv->credit -= r->cost; limit_mt()
125 if (r->cost == 0) { limit_mt_check()
127 r->cost = user2credits(r->avg); limit_mt_check()
146 u_int32_t credit_cap, cost; member in struct:compat_xt_rateinfo
162 .cost = cm->cost, limit_mt_compat_from_user()
176 .cost = m->cost, limit_mt_compat_to_user()
H A Dnft_limit.c31 static inline bool nft_limit_eval(struct nft_limit *limit, u64 cost) nft_limit_eval() argument
43 delta = tokens - cost; nft_limit_eval()
105 u64 cost; member in struct:nft_limit_pkts
114 if (nft_limit_eval(&priv->limit, priv->cost)) nft_limit_pkts_eval()
136 priv->cost = div_u64(priv->limit.nsecs, priv->limit.rate); nft_limit_pkts_init()
161 u64 cost = div_u64(priv->nsecs * pkt->skb->len, priv->rate); nft_limit_pkt_bytes_eval() local
163 if (nft_limit_eval(priv, cost)) nft_limit_pkt_bytes_eval()
H A Dxt_hashlimit.c90 u_int32_t credit_cap, cost; member in struct:dsthash_ent::__anon15022
386 `credit_cap'. The `peak rate' becomes the cost of passing the
387 test, `cost'.
391 discarded. Every time the match passes, you lose `cost' credits;
477 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); rateinfo_init()
482 dh->rateinfo.cost = user2credits(hinfo->cfg.avg); rateinfo_init()
593 tmp = tmp * dh->rateinfo.cost; hashlimit_byte_cost()
614 u32 cost; hashlimit_mt() local
641 cost = hashlimit_byte_cost(skb->len, dh); hashlimit_mt()
643 cost = dh->rateinfo.cost; hashlimit_mt()
645 if (dh->rateinfo.credit >= cost) { hashlimit_mt()
647 dh->rateinfo.credit -= cost; hashlimit_mt()
807 ent->rateinfo.cost); dl_seq_real_show()
818 ent->rateinfo.cost); dl_seq_real_show()
/linux-4.4.14/tools/perf/util/
H A Dlevenshtein.c13 * are kept in memory (if swaps had the same or higher cost as one deletion
26 * All the big loop does is determine the partial minimum-cost paths.
H A Dhist.c524 u64 cost; iter_add_single_mem_entry() local
532 cost = iter->sample->weight; iter_add_single_mem_entry()
533 if (!cost) iter_add_single_mem_entry()
534 cost = 1; iter_add_single_mem_entry()
544 cost, cost, 0, true); iter_add_single_mem_entry()
/linux-4.4.14/arch/arm/mach-hisi/
H A Dhisilicon.c27 * Without this table, system could also work. The cost is some virtual address
/linux-4.4.14/net/netfilter/ipvs/
H A Dip_vs_sed.c32 * job in the cost function (the increment of 1). SED may outperform
51 * We only use the active connection number in the cost ip_vs_sed_dest_overhead()
H A Dip_vs_nq.c47 * We only use the active connection number in the cost ip_vs_nq_dest_overhead()
/linux-4.4.14/arch/alpha/include/asm/
H A Dspinlock.h11 * We make no fairness assumptions. They have a cost.
/linux-4.4.14/arch/arc/lib/
H A Dstrcpy-700.S17 would also be likey to cost an unaligned mispredict at the next call. */
/linux-4.4.14/arch/mips/include/asm/sgi/
H A Dgio.h55 * 0x01 XPI low cost FDDI
/linux-4.4.14/arch/sh/lib64/
H A Dcopy_page.S64 /* Minimal code size. The extra branches inside the loop don't cost much
H A Dcopy_user_memcpy.S32 ! however, this would cost a few extra cyles on average.
H A Dmemcpy.S34 ! however, this would cost a few extra cyles on average.
/linux-4.4.14/arch/ia64/lib/
H A Dclear_user.S75 // M slot for 2 stores/iteration but the cost the initialization
143 // extra cycle cost (use a nop slot anyway). It also simplifies the
159 // The addition of len2/len3 does not cost anything more compared to
/linux-4.4.14/arch/sh/drivers/pci/
H A Dops-dreamcast.c35 * something to take into consideration. However, due to the cost of the BBA,
/linux-4.4.14/arch/sh/include/asm/
H A Dspinlock.h35 * We make no fairness assumptions. They have a cost.
/linux-4.4.14/arch/mn10300/include/asm/
H A Dspinlock.h22 * We make no fairness assumptions. They have a cost.
/linux-4.4.14/include/linux/input/
H A Dmt.h43 * @red: reduced cost matrix for in-kernel tracking
/linux-4.4.14/arch/arm/nwfpe/
H A Dentry.S52 so that the emulator startup cost can be avoided for tasks that don't
72 instructions to allow the emulator to spread the cost of the trap over
/linux-4.4.14/fs/f2fs/
H A Dgc.c284 unsigned long cost; get_victim_by_default() local
309 cost = get_gc_cost(sbi, segno, &p); get_victim_by_default()
311 if (p.min_cost > cost) { get_victim_by_default()
313 p.min_cost = cost; get_victim_by_default()
314 } else if (unlikely(cost == max_cost)) { get_victim_by_default()
H A Dsegment.h129 * GC_CB is based on cost-benefit algorithm.
156 unsigned int min_cost; /* minimum cost */
157 unsigned int min_segno; /* segment # having min. cost */
213 /* for cost-benefit algorithm in cleaning procedure */
H A Dsegment.c2255 * Update min, max modified time for cost-benefit GC algorithm
/linux-4.4.14/drivers/scsi/sym53c8xx_2/
H A Dsym53c8xx.h175 * Anyway, the cost of accepting up to 64 logical unit is low in
/linux-4.4.14/drivers/staging/android/
H A Dlowmemorykiller.c200 module_param_named(cost, lowmem_shrinker.seeks, int, S_IRUGO | S_IWUSR);
/linux-4.4.14/arch/tile/include/asm/
H A Dcacheflush.h151 * On SMP systems, when the scheduler does migration-cost autodetection,
/linux-4.4.14/arch/x86/xen/
H A Dmulticalls.c5 * multicall interface. This allows the cost of trapping into the
/linux-4.4.14/arch/alpha/lib/
H A Dev6-csum_ipv6_magic.S51 * The cost is 16 instructions (~8 cycles), including two extra loads which
/linux-4.4.14/include/asm-generic/
H A Dgpio.h16 * at a small performance cost for non-inlined operations and some
/linux-4.4.14/include/linux/platform_data/
H A Demif_plat.h73 * performance is desired at the cost of power (typically
/linux-4.4.14/arch/s390/include/asm/
H A Dspinlock.h28 * We make no fairness assumptions. They have a cost.
/linux-4.4.14/arch/arm64/lib/
H A Dmemmove.S79 * those extra instructions' cost is acceptable. It also make the
H A Dstrlen.S71 * slightly higher start-up cost, but we should win quite quickly,
H A Dstrnlen.S79 * slightly higher start-up cost, but we should win quite quickly,
/linux-4.4.14/arch/sh/mm/
H A Dcache-sh5.c322 * but that involves ASID switching cost + probably a TLBMISS + refill
444 * - potential cost of setting up/tearing down page mapping for
446 * * cost partly independent of range size
/linux-4.4.14/drivers/staging/rtl8188eu/include/
H A Dsta_info.h192 * It will cost memory * STA support num. */
/linux-4.4.14/drivers/staging/rtl8723au/include/
H A Dsta_info.h207 /* Please be care, dont declare too much structure here. It will cost memory * STA support num. */
/linux-4.4.14/drivers/gpu/drm/tegra/
H A Drgb.c193 * But this comes at a cost: pll_p is the parent of several other tegra_rgb_encoder_atomic_check()
/linux-4.4.14/arch/tile/kernel/
H A Dptrace.c59 * some cost in performance, e.g. we need a full pt_regs copy for
H A Dsetup.c931 * involved, O(n^2) seem OK for a one-time cost.
/linux-4.4.14/include/linux/
H A Dtimex.h73 * single interrupt, it must have a very low cost/overhead.
H A Dseqlock.h295 * cost of storage; we have to maintain two copies of the entire data
H A Dworkqueue.h305 * leads to noticeable power saving at the cost of small
H A Dmmzone.h464 * truly available, a la thundering herd. The cost of a
H A Dskbuff.h2151 * unaligned. On some architectures the cost of an unaligned DMA is high
2152 * and this cost outweighs the gains made by aligning the IP header.
/linux-4.4.14/arch/m32r/include/asm/
H A Dspinlock.h25 * We make no fairness assumptions. They have a cost.
/linux-4.4.14/arch/avr32/mach-at32ap/
H A Dclock.c247 /* cost of this scan is small, but not linear... */ dump_clock()
/linux-4.4.14/arch/arm/mach-omap2/
H A Dcpuidle34xx.c54 * mode, so wakeup latency is greatly reduced, at the cost of additional
/linux-4.4.14/net/ipv4/
H A Dtcp_yeah.c142 * of delayed ACKs, at the cost of noticing congestion tcp_yeah_cong_avoid()
H A Dtcp_vegas.c208 * of delayed ACKs, at the cost of noticing congestion tcp_vegas_cong_avoid()
H A Dtcp_input.c4245 * to reduce overall memory use and queue lengths, if cost is small.
5246 * extra cost of the net_bh soft interrupt processing... tcp_rcv_established()
H A Dtcp_output.c3176 * private TCP options. The cost is reduced data space in SYN :( tcp_send_syn_data()
/linux-4.4.14/tools/perf/
H A Dbuiltin-mem.c172 * there is no weight (cost) associated with stores, so don't print report_events()
/linux-4.4.14/drivers/infiniband/hw/mlx5/
H A Dodp.c80 * estimate the cost of another UMR vs. the cost of bigger mlx5_ib_invalidate_range()
/linux-4.4.14/drivers/cpuidle/governors/
H A Dmenu.c53 * C state entry and exit have an energy cost, and a certain amount of time in
54 * the C state is required to actually break even on this cost. CPUIDLE
/linux-4.4.14/sound/drivers/opl3/
H A Dopl3_midi.c155 /* This is our "allocation cost" table */ opl3_get_voice()
212 /* raise kill cost to EXPENSIVE for all channels */ opl3_get_voice()
/linux-4.4.14/arch/x86/include/asm/fpu/
H A Dtypes.h338 * memory buffer to the hardware registers - at the cost of
/linux-4.4.14/arch/c6x/platforms/
H A Dpll.c402 /* cost is now small, but not linear... */ dump_clock()
/linux-4.4.14/include/uapi/linux/
H A Dif_link.h285 IFLA_BRPORT_COST, /* " cost */
H A Dfd.h281 * incurring the expensive cost of repositioning all heads.
H A Dnl80211.h2553 * @NL80211_MPATH_INFO_METRIC: metric (cost) of this mesh path
/linux-4.4.14/arch/parisc/lib/
H A Dio.c50 ** Minimize total number of transfers at cost of CPU cycles.
/linux-4.4.14/arch/arm/probes/kprobes/
H A Dopt-arm.c44 * to the stack cost of the instruction.
/linux-4.4.14/drivers/misc/sgi-gru/
H A Dgrutlbpurge.c106 * cost of (possibly) a large number of future TLBmisses.
/linux-4.4.14/drivers/media/pci/zoran/
H A Dzr36016.c115 * writing it all time cost not much and is safer... */
/linux-4.4.14/drivers/infiniband/hw/qib/
H A Dqib_twsi.c64 * to the chip. Since we are delaying anyway, the cost doesn't
H A Dqib_file_ops.c1328 * reduce cost of expected send setup per message segment setup_ctxt()
H A Dqib_iba6120.c1114 * the overflow, but given the cost of that and the chip reads handle_6120_errors()
H A Dqib_iba7220.c1214 * the overflow, but given the cost of that and the chip reads handle_7220_errors()
H A Dqib_iba7322.c1733 * the overflow, but given the cost of that and the chip reads handle_7322_errors()
/linux-4.4.14/drivers/iommu/
H A Ddma-iommu.c471 * at the cost of potentially over-allocating a little. for_each_sg()
/linux-4.4.14/drivers/bcma/
H A Ddriver_chipcommon_pmu.c393 /* Low cost bonding: Fixed reference clock 25MHz and m = 4 */ bcma_pmu_pll_clock_bcm4706()
/linux-4.4.14/mm/
H A Dswap_state.c457 * because it doesn't cost us any seek time. We also make sure to queue
H A Dtruncate.c207 * The first pass will remove most pages, so the search cost of the second pass
H A Dmemcontrol.c655 * reading cost and precision of value. Then, we may have a chance to implement
2153 * reclaim, the cost of mismatch is negligible. try_charge()
H A Dvmscan.c402 * cost to recreate an object relative to that of an LRU page.
2061 * This scanning priority is essentially the inverse of IO cost. get_scan_count()
H A Dfilemap.c735 * at a cost of "thundering herd" phenomena during rare hash
H A Dmempolicy.c1988 * node and don't fall back to other nodes, as the cost of alloc_pages_vma()
H A Dpage_alloc.c131 * freeing from pcplists in most cases, at the cost of possibly becoming stale.
5176 * zone, each populated memory region may cost us one or two extra calc_memmap_size()
/linux-4.4.14/net/bridge/
H A Dbr_if.c32 * Determine initial path cost based on speed.
/linux-4.4.14/include/acpi/
H A Dacoutput.h298 * performance at a relatively small code cost. Implementation involves the
/linux-4.4.14/arch/powerpc/include/asm/
H A Dpage.h191 * To make the cost of __va() / __pa() more light weight, we introduce
/linux-4.4.14/arch/mips/cavium-octeon/executive/
H A Dcvmx-pko.c596 /* No cost per word since we are limited by packets/sec, not bits/sec */ cvmx_pko_rate_limit_packets()
/linux-4.4.14/arch/hexagon/include/asm/
H A Dpgtable.h456 * all zeros for swap entries, which speeds up the miss handler at the cost of
/linux-4.4.14/arch/arm/mach-davinci/
H A Dclock.c677 /* cost is now small, but not linear... */ dump_clock()
/linux-4.4.14/drivers/md/bcache/
H A Dbcache.h127 * each sorted set. But we do merge written sets together lazily, so the cost of
524 * code, and it doesn't cost us much memory as the memory usage is
/linux-4.4.14/drivers/md/
H A Ddm-cache-policy-mq.c757 * If the origin block has been discarded then there's no cost to copy it
760 * We bias towards reads, since they can be demoted at no cost if they
/linux-4.4.14/drivers/i2c/busses/
H A Di2c-imx.c746 * the first read operation, otherwise the first read cost i2c_imx_dma_read()
869 * the first read operation, otherwise the first read cost i2c_imx_read()
/linux-4.4.14/fs/ext4/
H A Dextents_status.c50 * tree will make status tree cost too much memory. written/unwritten/-
118 * Fragmented extent tree will make extent status tree cost too much
H A Dext4.h443 * EXT4_INODE_XXX. If all is well, the macros will be dropped, so, it won't cost
/linux-4.4.14/net/mac80211/
H A Dkey.c858 * the cost of synchronize_net() (which can be slow). Avoid this ieee80211_delayed_tailroom_dec()
863 * The cost is that if the AP switching was from an AP with keys ieee80211_delayed_tailroom_dec()
H A Dieee80211_i.h56 * by changing this define, at the cost of slower frame reassembly and
/linux-4.4.14/drivers/tty/vt/
H A Dconsolemap.c389 * "paged table" instead. Simulation has shown the memory cost of
/linux-4.4.14/drivers/staging/rdma/hfi1/
H A Dtwsi.c82 * to the chip. Since we are delaying anyway, the cost doesn't
/linux-4.4.14/drivers/net/wireless/iwlwifi/mvm/
H A Drx.c112 * to save the cost of doing it later. That still doesn't pull in iwl_mvm_pass_packet_to_mac80211()
/linux-4.4.14/drivers/nvdimm/
H A Dregion_devs.c581 * this implementation assumes the cost of maintaining an allocator for
/linux-4.4.14/arch/x86/include/asm/
H A Dprocessor.h348 * that is not aligned to cache line boundary at all cost."
/linux-4.4.14/kernel/locking/
H A Drwsem-xadd.c403 * values at the cost of a few extra spins. rwsem_optimistic_spin()
H A Dmutex.c378 * values at the cost of a few extra spins. mutex_optimistic_spin()
/linux-4.4.14/kernel/time/
H A Dtime.c601 * At the cost of one additional multiplication by a constant, just
/linux-4.4.14/include/linux/bcma/
H A Dbcma_driver_chipcommon.h101 #define BCMA_CC_CHIPST_4706_PKG_OPTION BIT(0) /* 0: full-featured package 1: low-cost package */
/linux-4.4.14/sound/usb/usx2y/
H A Dusx2yhwdeppcm.c37 cost of easier triggered i.e. aeolus xruns (128 or 256frames,
/linux-4.4.14/drivers/net/ethernet/packetengines/
H A Dyellowfin.c168 frames. For small frames the copying cost is negligible (esp. considering
170 information). For large frames the copying cost is non-trivial, and the
/linux-4.4.14/drivers/net/ethernet/dlink/
H A Dsundance.c156 copying packets. When copying is done, the cost is usually mitigated by using
1256 /* Yup, this is a documentation bug. It cost me *hours*. */ intr_handler()
/linux-4.4.14/fs/reiserfs/
H A Ddo_balan.c1787 * at the cost of more memory copies and more balancing as a result of
1791 * utilization, with consequent less balancing at the cost of lower
H A Dreiserfs.h1197 * cost to access 4 blocks is not much more than the cost to access 1
1200 * time cost for a 4 block file and saves an amount of space that is
/linux-4.4.14/drivers/staging/rdma/ipath/
H A Dipath_eeprom.c209 * to the chip. Since we are delaying anyway, the cost doesn't
H A Dipath_verbs.c1101 * HW support is more than just paying the cost of delaying some packets
H A Dipath_file_ops.c1591 * at open, not per call. Reduces cost of expected send try_alloc_port()
/linux-4.4.14/drivers/isdn/hardware/eicon/
H A Dcardtype.h143 /* DIVA low cost cards, 1st name DIVA 3.0, 2nd DIVA 2.01, 3rd ??? */
/linux-4.4.14/drivers/lightnvm/
H A Drrpc.c1345 /* round robin, page-based FTL, and cost-based GC */
/linux-4.4.14/drivers/mtd/
H A Dmtdchar.c138 * or if memory is highly fragmented at the cost of reducing the
H A Dmtdswap.c56 * Wear level cost amortization. We want to do wear leveling on the background
/linux-4.4.14/drivers/gpu/vga/
H A Dvga_switcheroo.c58 * all muxed. Newer laptops moved to a muxless architecture for cost reasons.
/linux-4.4.14/drivers/mfd/
H A Dtwl-core.c922 /* maybe add LDOs that are omitted on cost-reduced parts */ add_children()
/linux-4.4.14/drivers/net/hyperv/
H A Dhyperv_net.h424 * dynamic reconfigurations when the cost of GPA-direct buffers
/linux-4.4.14/drivers/net/wireless/ath/carl9170/
H A Drx.c641 * In order to keep the processing cost down, I opted for a carl9170_ampdu_check()
/linux-4.4.14/drivers/net/ethernet/realtek/
H A Datp.c59 ethernet adapter. This is a common low-cost OEM pocket ethernet
/linux-4.4.14/drivers/net/ethernet/cadence/
H A Dmacb.h447 * to avoid the cost of the conditional.
/linux-4.4.14/drivers/gpu/drm/i915/
H A Di915_gem_userptr.c811 * incur the cost of a snoop (unless you have an LLC architecture).
H A Di915_drv.h1999 * associated cost with migrating pages between the backing storage
H A Dintel_display.c2400 * a fence as the cost is not that onerous. intel_pin_and_fence_fb_obj()
/linux-4.4.14/arch/tile/mm/
H A Dinit.c342 /* Pay TLB cost but get no cache benefit: cache small pages locally */ setup_ktext()
/linux-4.4.14/lib/zlib_deflate/
H A Ddeflate.c28 * time, but has a larger average cost, uses more memory and is patented.
/linux-4.4.14/arch/metag/lib/
H A Dusercopy.c24 * combiner so should have virtually no cost.
/linux-4.4.14/arch/m68k/fpsp040/
H A Dsetox.S169 | raised, to simulate that exception cost to much than the
/linux-4.4.14/drivers/usb/class/
H A Dcdc-acm.c1627 * do the write path at all cost acm_resume()
/linux-4.4.14/drivers/mtd/nand/gpmi-nand/
H A Dgpmi-lib.c435 * reduce the cost of this conversion by using bit shifts instead of gpmi_nfc_compute_hardware_timing()
/linux-4.4.14/drivers/net/ethernet/3com/
H A D3c515.c144 the queue layer for all frames vs. the copying cost of copying a frame to a
H A D3c59x.c59 /* Allow aggregation of Tx interrupts. Saves CPU load at the cost
186 copying cost of copying a frame to a correctly-sized skbuff.
/linux-4.4.14/drivers/media/usb/au0828/
H A Dau0828-video.c1047 incur the cost of a firmware load */ au0828_init_tuner()
/linux-4.4.14/drivers/net/wan/
H A Dz85230.c323 * by them as short as possible in all circumstances - clocks cost
/linux-4.4.14/drivers/net/ethernet/smsc/
H A Depic100.c1025 * region at the cost of occasionally grabbing the lock more times. epic_tx()
/linux-4.4.14/drivers/net/ethernet/ibm/
H A Dibmveth.c1077 * cost of a TCE insert and remove. ibmveth_start_xmit()
/linux-4.4.14/sound/soc/codecs/
H A Darizona.c1998 /* Round down to 16bit range with cost of accuracy lost. arizona_calc_fll()
/linux-4.4.14/drivers/scsi/aic7xxx/
H A Daic7xxx_pci.c1383 * Some low-cost chips have SEEPROM and auto-term control built check_extport()
/linux-4.4.14/drivers/net/wireless/ath/ath10k/
H A Dhtt_rx.c178 * This probably comes at a cost of lower maximum throughput but ath10k_htt_rx_msdu_buff_replenish()
/linux-4.4.14/arch/x86/mm/
H A Dpageattr.c289 * at no extra cost. static_protections()
/linux-4.4.14/drivers/char/
H A Drandom.c1798 * value is not cryptographically secure but for several uses the cost of
/linux-4.4.14/kernel/sched/
H A Ddeadline.c1037 * and double the fastpath cost. yield_task_dl()
H A Dfair.c4484 * Rough decay (wiping) for cost saving, don't worry record_wakee()
5370 * and double the fastpath cost. yield_task_fair()
/linux-4.4.14/fs/xfs/
H A Dxfs_file.c352 * Hence, amortize the cost of the lock against a full file xfs_file_read_iter()
/linux-4.4.14/arch/powerpc/perf/
H A Dcore-book3s.c503 * This could be a per-PMU callback, but we'd rather avoid the cost. We is_ebb_event()
/linux-4.4.14/drivers/mmc/core/
H A Dcore.c63 * performance cost, and for other reasons may not always be desired.
/linux-4.4.14/drivers/gpu/drm/radeon/
H A Dradeon.h2590 * the cost of call+ret is almost negligible. MMIO and locking
/linux-4.4.14/drivers/net/wireless/realtek/rtlwifi/btcoexist/
H A Dhalbtc8723b1ant.c1346 * here softap mode screen off will cost 70-80mA for phone halbtc8723b1ant_ps_tdma()
/linux-4.4.14/drivers/net/ethernet/via/
H A Dvia-rhine.c184 copying packets. When copying is done, the cost is usually mitigated by using
/linux-4.4.14/drivers/net/ethernet/chelsio/cxgb4/
H A Dsge.c82 * the amortized cost reasonable. Must be >= 2 * TXQ_STOP_THRES.
/linux-4.4.14/drivers/net/ethernet/chelsio/cxgb4vf/
H A Dsge.c73 * eventually catch up and keep the amortized cost reasonable.
/linux-4.4.14/drivers/base/regmap/
H A Dregmap.c2322 * cost as we expect to hit the cache. regmap_raw_read()
/linux-4.4.14/arch/tile/include/gxio/
H A Dmpipe.h1080 * capability can be used to amortize the cost of reserving slots
/linux-4.4.14/arch/x86/kernel/cpu/
H A Dperf_event_intel.c2333 * the cost of freeing later on intel_get_excl_constraints()
/linux-4.4.14/fs/jbd2/
H A Dtransaction.c1670 * arrive. It doesn't cost much - we're about to run a commit jbd2_journal_stop()
/linux-4.4.14/net/xfrm/
H A Dxfrm_policy.c656 /* Generate new index... KAME seems to generate them ordered by cost
/linux-4.4.14/drivers/gpio/
H A Dgpiolib.c29 * GPIOs can sometimes cost only an instruction or two per bit.
/linux-4.4.14/sound/pci/
H A Dazt3328.c90 * - single chip low cost solution (128 pin QFP)
/linux-4.4.14/net/sctp/
H A Dsocket.c2868 * introduced, at the cost of more packets in the network. Expects an
5162 * introduced, at the cost of more packets in the network. Expects an
/linux-4.4.14/drivers/net/ethernet/natsemi/
H A Dnatsemi.c194 copying packets. When copying is done, the cost is usually mitigated by using
/linux-4.4.14/arch/x86/kvm/
H A Dmmu.c1634 * This has some overhead, but not as much as the cost of swapping kvm_age_hva()
/linux-4.4.14/block/
H A Dcfq-iosched.c1107 * short backward seeks which are biased as twice the cost of a cfq_choose_req()
/linux-4.4.14/net/core/
H A Dskbuff.c2744 * this limitation is the cost for zerocopy sequential
/linux-4.4.14/fs/
H A Dbuffer.c1249 * Per-cpu buffer LRU implementation. To reduce the cost of __find_get_block().
/linux-4.4.14/drivers/usb/host/
H A Dfotg210-hcd.c3393 fotg210_dbg(fotg210, "ignoring FSTN cost ...\n"); periodic_usecs()
/linux-4.4.14/drivers/scsi/
H A Dosst.c2868 /* assumes that the filemark is already read by the drive, so this is low cost */ cross_eof()
/linux-4.4.14/kernel/rcu/
H A Dtree.c2568 * prematurely. That said, invoking it after the fact will cost you
/linux-4.4.14/include/net/
H A Dcfg80211.h1177 * @metric: metric (cost) of this mesh path
/linux-4.4.14/arch/powerpc/xmon/
H A Dppc-opc.c35 logic, at the cost of increasing the table size. The table is
/linux-4.4.14/drivers/net/ethernet/broadcom/bnx2x/
H A Dbnx2x_reg.h3971 /* [RW 16] The byte credit cost for each task. This value is for both ports */
4247 /* [RW 8] The credit cost per every task in the QM. A value per each VOQ */
/linux-4.4.14/arch/m68k/ifpsp060/src/
H A Dfplsp.S6829 # cost to much than the flag is worth in practical uses. #
H A Dfpsp.S6935 # cost to much than the flag is worth in practical uses. #

Completed in 8250 milliseconds