150 	uint64_t nlookup;  member
869 	if (!node->nlookup)  in inc_nlookup()
871 	node->nlookup++;  in inc_nlookup()
904 	} else if (lru_enabled(f) && node->nlookup == 1) {  in find_node()
1410 static void forget_node(struct fuse *f, fuse_ino_t nodeid, uint64_t nlookup)  in forget_node()  argument
1422 	while (node->nlookup == nlookup && node->treelock) {  in forget_node()
1432 		} while (node->nlookup == nlookup && node->treelock);  in forget_node()
1438 	assert(node->nlookup >= nlookup);  in forget_node()
1439 	node->nlookup -= nlookup;  in forget_node()
1440 	if (!node->nlookup) {  in forget_node()
1442 	} else if (lru_enabled(f) && node->nlookup == 1) {  in forget_node()
1451 		assert(node->nlookup > 1);  in unlink_node()
1452 		node->nlookup--;  in unlink_node()
2742 static void do_forget(struct fuse *f, fuse_ino_t ino, uint64_t nlookup)  in do_forget()  argument
2746 			(unsigned long long) nlookup);  in do_forget()
2747 	forget_node(f, ino, nlookup);  in do_forget()
2750 static void fuse_lib_forget(fuse_req_t req, fuse_ino_t ino, uint64_t nlookup)  in fuse_lib_forget()  argument
2752 	do_forget(req_fuse(req), ino, nlookup);  in fuse_lib_forget()
2763 		do_forget(f, forgets[i].ino, forgets[i].nlookup);  in fuse_lib_forget_multi()
4439 		assert(node->nlookup == 1);  in fuse_clean_cache()
4445 		node->nlookup = 0;  in fuse_clean_cache()