Searched refs:dupentry (Results 1 - 2 of 2) sorted by relevance
| /kernel/linux/linux-6.6/mm/ |
| H A D | zswap.c | 336 * the existing entry is stored in dupentry and the function returns -EEXIST
339 struct zswap_entry **dupentry) in zswap_rb_insert()
354 *dupentry = myentry; in zswap_rb_insert()
1200 struct zswap_entry *entry, *dupentry; in zswap_store() local
1229 dupentry = zswap_rb_search(&tree->rbroot, offset); in zswap_store()
1230 if (dupentry) { in zswap_store()
1232 zswap_invalidate_entry(tree, dupentry); in zswap_store()
1360 while (zswap_rb_insert(&tree->rbroot, entry, &dupentry) == -EEXIST) { in zswap_store()
1363 zswap_invalidate_entry(tree, dupentry); in zswap_store()
338 zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, struct zswap_entry **dupentry) zswap_rb_insert() argument
|
| /kernel/linux/linux-5.10/mm/ |
| H A D | zswap.c | 303 * the existing entry is stored in dupentry and the function returns -EEXIST
306 struct zswap_entry **dupentry) in zswap_rb_insert()
319 *dupentry = myentry; in zswap_rb_insert()
1023 struct zswap_entry *entry, *dupentry; in zswap_frontswap_store() local
1134 ret = zswap_rb_insert(&tree->rbroot, entry, &dupentry); in zswap_frontswap_store()
1138 zswap_rb_erase(&tree->rbroot, dupentry); in zswap_frontswap_store()
1139 zswap_entry_put(tree, dupentry); in zswap_frontswap_store()
305 zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, struct zswap_entry **dupentry) zswap_rb_insert() argument
|
Completed in 5 milliseconds