/linux-master/drivers/net/ethernet/intel/iavf/ |
H A D | iavf_txrx.c | 2173 const skb_frag_t *frag, *stale; local 2203 * then removing stale fragments from the sum. 2205 for (stale = &skb_shinfo(skb)->frags[0];; stale++) { 2206 int stale_size = skb_frag_size(stale); 2210 /* The stale fragment may present us with a smaller 2217 int align_pad = -(skb_frag_off(stale)) &
|
/linux-master/drivers/gpu/drm/msm/disp/mdp4/ |
H A D | mdp4_crtc.c | 30 bool stale; member in struct:mdp4_crtc::__anon742 364 if (mdp4_crtc->cursor.stale) { 393 mdp4_crtc->cursor.stale = false; 443 mdp4_crtc->cursor.stale = true;
|
/linux-master/drivers/gpu/drm/i915/gem/selftests/ |
H A D | mock_context.c | 31 spin_lock_init(&ctx->stale.lock); 32 INIT_LIST_HEAD(&ctx->stale.engines);
|
/linux-master/drivers/gpu/drm/i915/gem/ |
H A D | i915_gem_context.c | 1073 spin_lock_irqsave(&ctx->stale.lock, flags); 1075 spin_unlock_irqrestore(&ctx->stale.lock, flags); 1424 spin_lock_irq(&ctx->stale.lock); 1426 list_for_each_entry_safe(pos, next, &ctx->stale.engines, link) { 1432 spin_unlock_irq(&ctx->stale.lock); 1437 spin_lock_irq(&ctx->stale.lock); 1444 spin_unlock_irq(&ctx->stale.lock); 1474 spin_lock_irq(&ctx->stale.lock); 1476 list_add_tail(&engines->link, &ctx->stale.engines); 1477 spin_unlock_irq(&ctx->stale [all...] |
/linux-master/mm/ |
H A D | ksm.c | 276 /* Delay in pruning stale stable_node_dups in the stable_node_chains */ 904 * remove the stale node from the stable tree and return NULL. 931 goto stale; 938 * The __remove_mapping() case is easy, again the node is now stale; 953 goto stale; 959 goto stale; 974 goto stale; 979 stale: 982 * suggests that the node is stale; but it might be under migration. 1129 * The stable node did not yet appear stale t [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_dir2_priv.h | 20 uint16_t stale; member in struct:xfs_dir3_icleaf_hdr
|
/linux-master/drivers/md/bcache/ |
H A D | btree.c | 15 * counter. Garbage collection is used to remove stale pointers. 1231 uint8_t stale = 0; local 1241 return stale; 1253 stale = max(stale, ptr_stale(c, k, i)); 1277 return stale; 1309 uint8_t stale = 0; local 1318 stale = max(stale, btree_mark_key(b, k)); 1340 if (stale > 1 [all...] |
H A D | extents.c | 15 * counter. Garbage collection is used to remove stale pointers. 85 return "stale"; 540 unsigned int i, stale; local 552 stale = ptr_stale(b->c, k, i); 554 if (stale && KEY_DIRTY(k)) { 556 pr_info("stale dirty pointer, stale %u, key: %s\n", 557 stale, buf); 560 btree_bug_on(stale > BUCKET_GC_GEN_MAX, b, 561 "key too stale [all...] |
/linux-master/security/apparmor/ |
H A D | label.c | 388 /* TODO: if compound label and not stale add to reclaim cache */ 658 * @replace: whether insertion should replace existing entry that is not stale 1049 * setting labels stale. 1061 bool stale = false; local 1079 stale = true; 1095 } else if (!stale) { 2049 * Note: worst case is the stale @label does not get updated and has 2082 /* updated stale label by being removed/renamed from labelset */ 2118 * Any label that has a stale component is marked stale an [all...] |
/linux-master/net/sctp/ |
H A D | sm_make_chunk.c | 1823 /* Check to see if the cookie is stale. If there is already 2553 u32 stale; local 2584 stale = ntohl(param.life->lifespan_increment); 2589 asoc->cookie_life = ktime_add_ms(asoc->cookie_life, stale);
|
H A D | sm_statefuns.c | 946 * counter in stale cookie situations when a transition back 2440 * Only handle the error type of stale COOKIE Error, the other errors will 2529 u32 stale; local 2555 stale = ntohl(*(__be32 *)((u8 *)err + sizeof(*err))); 2556 stale = (stale * 2) / 1000; 2560 bht.lifespan_increment = htonl(stale); 3943 * accidentally use a stale transport that's been removed. 3948 * it must be either a stale packet or from an attacker. 5047 * parameter can be used to avoid efforts to transmit stale [all...] |
/linux-master/drivers/net/wireless/ath/ath9k/ |
H A D | ath9k.h | 215 bool stale; member in struct:ath_buf_state
|
/linux-master/drivers/net/ethernet/agere/ |
H A D | et131x.c | 352 u32 stale; /* Used to spot stuck/lost packets */ member in struct:tcb 2515 tcb->stale = 0; 3394 if (++tcb->stale > 1)
|
/linux-master/drivers/net/ethernet/8390/ |
H A D | pcnet_cs.c | 206 int stale, fast_poll; member in struct:pcnet_dev 1014 info->stale = 0; 1031 if (info->stale++ && (inb_p(nic_base + EN0_ISR) & ENISR_ALL)) {
|
H A D | axnet_cs.c | 114 int stale, fast_poll; member in struct:axnet_dev 547 PRIV(dev)->stale = 0; 563 if (info->stale++ && (inb_p(nic_base + EN0_ISR) & ENISR_ALL)) {
|
/linux-master/drivers/gpu/drm/i915/gt/ |
H A D | intel_gt_buffer_pool.c | 39 struct intel_gt_buffer_pool_node *node, *stale = NULL; local 67 node->free = stale; 68 stale = node; 79 while ((node = stale)) { 80 stale = stale->free;
|
/linux-master/drivers/md/ |
H A D | dm-ps-historical-service-time.c | 9 * Marks paths stale if they have not finished within hst * 10 * num_paths. If a path is stale and unused, we will send a single 14 * multipath device is unused. If a path is stale and in use, limit the 346 u64 *out, u64 *stale) 353 *stale = pi->stale_after; 392 * If an unloaded path is stale, choose it. If both paths are unloaded, 393 * choose path that is the most stale. 419 /* In the case that the 'winner' is stale, limit to equal usage. */ 345 hst_fill_compare(struct path_info *pi, u64 *hst, u64 *out, u64 *stale) argument
|
/linux-master/fs/iomap/ |
H A D | iter.c | 19 * (processed = 0) meaning we are done and (processed = 0 && stale) meaning we 24 bool stale = iter->iomap.flags & IOMAP_F_STALE; local 30 if (!iter->processed && !stale)
|