| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | extent_map.c | 153 struct extent_map *prev_entry = NULL; in __tree_search() local
158 prev_entry = entry; in __tree_search()
170 while (prev && offset >= extent_map_end(prev_entry)) { in __tree_search()
172 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()
|
| H A D | ordered-data.c | 67 struct btrfs_ordered_extent *prev_entry = NULL; in __tree_search() local
72 prev_entry = entry; in __tree_search()
84 while (prev && file_offset >= entry_end(prev_entry)) { in __tree_search()
88 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
90 if (file_offset < entry_end(prev_entry)) in __tree_search()
96 prev_entry = rb_entry(prev, struct btrfs_ordered_extent, in __tree_search()
98 while (prev && file_offset < entry_end(prev_entry)) { in __tree_search()
102 prev_entry = rb_entry(test, struct btrfs_ordered_extent, in __tree_search()
|
| H A D | extent_io.c | 420 struct tree_entry *prev_entry = NULL; in __etree_search() local
425 prev_entry = entry; in __etree_search()
442 while (prev && offset > prev_entry->end) { in __etree_search()
444 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
451 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
452 while (prev && offset < prev_entry->start) { in __etree_search()
454 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
|
| /kernel/linux/linux-5.10/net/ipv6/ |
| H A D | calipso.c | 205 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()
|
| /kernel/linux/linux-6.6/net/ipv6/ |
| H A D | calipso.c | 205 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()
|
| /kernel/linux/linux-6.6/tools/net/ynl/lib/ |
| H A D | nlspec.py | 118 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):
129 return SpecEnumEntry(self, entry, prev_entry, value_start)
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | extent_map.c | 142 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()
|
| H A D | ordered-data.c | 71 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()
|
| /kernel/linux/linux-5.10/net/ipv4/ |
| H A D | cipso_ipv4.c | 240 struct cipso_v4_map_cache_entry *prev_entry = NULL; in cipso_v4_cache_check() local
258 if (!prev_entry) { in cipso_v4_cache_check()
263 if (prev_entry->activity > 0) in cipso_v4_cache_check()
264 prev_entry->activity -= 1; in cipso_v4_cache_check()
265 if (entry->activity > prev_entry->activity && in cipso_v4_cache_check()
266 entry->activity - prev_entry->activity > in cipso_v4_cache_check()
270 prev_entry->list.prev, in cipso_v4_cache_check()
271 &prev_entry->list); in cipso_v4_cache_check()
277 prev_entry = entry; in cipso_v4_cache_check()
|
| /kernel/linux/linux-6.6/net/ipv4/ |
| H A D | cipso_ipv4.c | 239 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()
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/natsemi/ |
| H A D | sonic.c | 559 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()
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/natsemi/ |
| H A D | sonic.c | 559 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()
|
| /kernel/linux/linux-5.10/fs/nilfs2/ |
| H A D | alloc.h | 83 * @prev_entry: translation entries cache
89 struct nilfs_bh_assoc prev_entry; member
|
| H A D | alloc.c | 322 &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()
|
| /kernel/linux/linux-6.6/fs/nilfs2/ |
| H A D | alloc.h | 83 * @prev_entry: translation entries cache
89 struct nilfs_bh_assoc prev_entry; member
|
| H A D | alloc.c | 322 &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()
|
| /kernel/linux/linux-5.10/fs/f2fs/ |
| H A D | extent_cache.c | 121 struct rb_entry **prev_entry, in f2fs_lookup_rb_tree_ret()
133 *prev_entry = NULL; in f2fs_lookup_rb_tree_ret()
174 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ret()
181 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); in f2fs_lookup_rb_tree_ret()
118 f2fs_lookup_rb_tree_ret(struct rb_root_cached *root, struct rb_entry *cached_re, unsigned int ofs, struct rb_entry **prev_entry, struct rb_entry **next_entry, struct rb_node ***insert_p, struct rb_node **insert_parent, bool force, bool *leftmost) f2fs_lookup_rb_tree_ret() argument
|
| H A D | f2fs.h | 3864 struct rb_entry **prev_entry, struct rb_entry **next_entry,
|
| /kernel/linux/linux-5.10/drivers/net/ethernet/3com/ |
| H A D | 3c515.c | 1000 struct boom_tx_desc *prev_entry; in corkscrew_start_xmit() local
1007 prev_entry = &vp->tx_ring[(vp->cur_tx - 1) % TX_RING_SIZE]; in corkscrew_start_xmit()
1009 prev_entry = NULL; in corkscrew_start_xmit()
1026 if (prev_entry) in corkscrew_start_xmit()
1027 prev_entry->next = isa_virt_to_bus(&vp->tx_ring[entry]); in corkscrew_start_xmit()
1040 if (prev_entry) in corkscrew_start_xmit()
1041 prev_entry->status &= ~0x80000000; in corkscrew_start_xmit()
|
| H A D | 3c59x.c | 2116 struct boom_tx_desc *prev_entry = &vp->tx_ring[(vp->cur_tx-1) % TX_RING_SIZE]; in boomerang_start_xmit() local
2214 prev_entry->next = cpu_to_le32(vp->tx_ring_dma + entry * sizeof(struct boom_tx_desc)); in boomerang_start_xmit()
2230 prev_entry->status &= cpu_to_le32(~TxIntrUploaded); in boomerang_start_xmit()
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/3com/ |
| H A D | 3c515.c | 1004 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()
|
| H A D | 3c59x.c | 2118 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()
|
| /kernel/linux/linux-6.6/fs/f2fs/ |
| H A D | extent_cache.c | 197 struct extent_node **prev_entry, in __lookup_extent_node_ret()
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()
194 __lookup_extent_node_ret(struct rb_root_cached *root, struct extent_node *cached_en, unsigned int fofs, struct extent_node **prev_entry, struct extent_node **next_entry, struct rb_node ***insert_p, struct rb_node **insert_parent, bool *leftmost) __lookup_extent_node_ret() argument
|
| H A D | segment.c | 1013 struct discard_cmd **prev_entry, in __lookup_discard_cmd_ret()
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()
1011 __lookup_discard_cmd_ret(struct rb_root_cached *root, block_t blkaddr, struct discard_cmd **prev_entry, struct discard_cmd **next_entry, struct rb_node ***insert_p, struct rb_node **insert_parent) __lookup_discard_cmd_ret() argument
|
| /kernel/linux/linux-6.6/tools/net/ynl/ |
| H A D | ynl-gen-c.py | 684 def new_entry(self, entry, prev_entry, value_start):
685 return EnumEntry(self, entry, prev_entry, value_start)
|