Home
last modified time | relevance | path

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

/linux/net/ipv6/
H A 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/drivers/net/ethernet/natsemi/
H A 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/fs/afs/
H A Ddir_edit.c466 if (!iter.prev_entry) { in afs_edit_dir_remove()
472 iter.bucket, iter.prev_entry, prev_next, entry, in afs_edit_dir_remove()
478 unsigned int pb = iter.prev_entry / AFS_DIR_SLOTS_PER_BLOCK; in afs_edit_dir_remove()
479 unsigned int ps = iter.prev_entry % AFS_DIR_SLOTS_PER_BLOCK; in afs_edit_dir_remove()
491 iter.bucket, iter.prev_entry, prev_next, entry, in afs_edit_dir_remove()
H A Ddir_search.c50 iter->prev_entry = 0; /* Hash head is previous */ in afs_dir_reset_iter()
166 iter->prev_entry = entry; in afs_dir_search_bucket()
H A Dinternal.h992 unsigned int prev_entry; member
/linux/fs/btrfs/
H A Dextent_map.c146 struct extent_map *prev_entry = NULL; in tree_search() local
153 prev_entry = entry; in tree_search()
164 while (prev && offset >= btrfs_extent_map_end(prev_entry)) { in tree_search()
166 prev_entry = rb_entry(prev, struct extent_map, rb_node); in tree_search()
179 prev_entry = rb_entry(prev, struct extent_map, rb_node); in tree_search()
180 while (prev && offset < prev_entry->start) { in tree_search()
182 prev_entry = rb_entry(prev, struct extent_map, rb_node); in tree_search()
/linux/fs/f2fs/
H A Dextent_cache.c219 struct extent_node **prev_entry, in __lookup_extent_node_ret() argument
231 *prev_entry = NULL; in __lookup_extent_node_ret()
268 *prev_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
275 *prev_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
H A Dsegment.c1047 struct discard_cmd **prev_entry, in __lookup_discard_cmd_ret() argument
1058 *prev_entry = NULL; in __lookup_discard_cmd_ret()
1088 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1094 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
/linux/drivers/net/ethernet/3com/
H A 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/tools/net/ynl/pyynl/
H A Dynl_gen_c.py1079 def new_entry(self, entry, prev_entry, value_start): argument
1080 return EnumEntry(self, entry, prev_entry, value_start)