Home
last modified time | relevance | path

Searched refs:prev_entry (Results 1 – 13 of 13) sorted by relevance

/linux-6.6.21/net/ipv6/
Dcalipso.c205 struct calipso_map_cache_entry *prev_entry = NULL; in calipso_cache_check() local
223 if (!prev_entry) { in calipso_cache_check()
228 if (prev_entry->activity > 0) in calipso_cache_check()
229 prev_entry->activity -= 1; in calipso_cache_check()
230 if (entry->activity > prev_entry->activity && in calipso_cache_check()
231 entry->activity - prev_entry->activity > in calipso_cache_check()
235 prev_entry->list.prev, in calipso_cache_check()
236 &prev_entry->list); in calipso_cache_check()
242 prev_entry = entry; in calipso_cache_check()
/linux-6.6.21/tools/net/ynl/lib/
Dnlspec.py118 prev_entry = None
123 e = self.new_entry(entry, prev_entry, value_start)
126 prev_entry = e
128 def new_entry(self, entry, prev_entry, value_start): argument
129 return SpecEnumEntry(self, entry, prev_entry, value_start)
/linux-6.6.21/fs/btrfs/
Dordered-data.c71 struct btrfs_ordered_extent *prev_entry = NULL; in __tree_search() local
76 prev_entry = entry; in __tree_search()
88 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
92 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
94 if (file_offset < entry_end(prev_entry)) in __tree_search()
100 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
102 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
106 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
Dextent_map.c142 struct extent_map *prev_entry = NULL; in __tree_search() local
149 prev_entry = entry; in __tree_search()
160 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
162 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
175 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
176 while (prev && offset < prev_entry->start) { in __tree_search()
178 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
/linux-6.6.21/drivers/net/ethernet/natsemi/
Dsonic.c559 int prev_entry = lp->eol_rx; in sonic_rx() local
615 prev_entry = entry; in sonic_rx()
621 if (prev_entry != lp->eol_rx) { in sonic_rx()
623 sonic_rda_put(dev, prev_entry, SONIC_RD_LINK, SONIC_EOL | in sonic_rx()
624 sonic_rda_get(dev, prev_entry, SONIC_RD_LINK)); in sonic_rx()
627 lp->eol_rx = prev_entry; in sonic_rx()
/linux-6.6.21/net/ipv4/
Dcipso_ipv4.c239 struct cipso_v4_map_cache_entry *prev_entry = NULL; in cipso_v4_cache_check() local
257 if (!prev_entry) { in cipso_v4_cache_check()
262 if (prev_entry->activity > 0) in cipso_v4_cache_check()
263 prev_entry->activity -= 1; in cipso_v4_cache_check()
264 if (entry->activity > prev_entry->activity && in cipso_v4_cache_check()
265 entry->activity - prev_entry->activity > in cipso_v4_cache_check()
269 prev_entry->list.prev, in cipso_v4_cache_check()
270 &prev_entry->list); in cipso_v4_cache_check()
276 prev_entry = entry; in cipso_v4_cache_check()
/linux-6.6.21/fs/nilfs2/
Dalloc.h89 struct nilfs_bh_assoc prev_entry; member
Dalloc.c322 &cache->prev_entry, &cache->lock); in nilfs_palloc_get_entry_block()
336 &cache->prev_entry, &cache->lock); in nilfs_palloc_delete_entry_block()
852 brelse(cache->prev_entry.bh); in nilfs_palloc_clear_cache()
855 cache->prev_entry.bh = NULL; in nilfs_palloc_clear_cache()
/linux-6.6.21/drivers/net/ethernet/3com/
D3c515.c1004 struct boom_tx_desc *prev_entry; in corkscrew_start_xmit() local
1011 prev_entry = &vp->tx_ring[(vp->cur_tx - 1) % TX_RING_SIZE]; in corkscrew_start_xmit()
1013 prev_entry = NULL; in corkscrew_start_xmit()
1030 if (prev_entry) in corkscrew_start_xmit()
1031 prev_entry->next = isa_virt_to_bus(&vp->tx_ring[entry]); in corkscrew_start_xmit()
1044 if (prev_entry) in corkscrew_start_xmit()
1045 prev_entry->status &= ~0x80000000; in corkscrew_start_xmit()
D3c59x.c2118 struct boom_tx_desc *prev_entry = &vp->tx_ring[(vp->cur_tx-1) % TX_RING_SIZE]; in boomerang_start_xmit() local
2216 prev_entry->next = cpu_to_le32(vp->tx_ring_dma + entry * sizeof(struct boom_tx_desc)); in boomerang_start_xmit()
2232 prev_entry->status &= cpu_to_le32(~TxIntrUploaded); in boomerang_start_xmit()
/linux-6.6.21/fs/f2fs/
Dextent_cache.c197 struct extent_node **prev_entry, in __lookup_extent_node_ret() argument
209 *prev_entry = NULL; in __lookup_extent_node_ret()
246 *prev_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
253 *prev_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
Dsegment.c1013 struct discard_cmd **prev_entry, in __lookup_discard_cmd_ret() argument
1024 *prev_entry = NULL; in __lookup_discard_cmd_ret()
1054 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1060 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
/linux-6.6.21/tools/net/ynl/
Dynl-gen-c.py684 def new_entry(self, entry, prev_entry, value_start): argument
685 return EnumEntry(self, entry, prev_entry, value_start)