avail_lists       278 include/linux/swap.h 	struct plist_node avail_lists[0]; /*
avail_lists       663 mm/swapfile.c  		plist_del(&p->avail_lists[nid], &swap_avail_heads[nid]);
avail_lists       696 mm/swapfile.c  		WARN_ON(!plist_node_empty(&p->avail_lists[nid]));
avail_lists       697 mm/swapfile.c  		plist_add(&p->avail_lists[nid], &swap_avail_heads[nid]);
avail_lists      1019 mm/swapfile.c  	plist_for_each_entry_safe(si, next, &swap_avail_heads[node], avail_lists[node]) {
avail_lists      1021 mm/swapfile.c  		plist_requeue(&si->avail_lists[node], &swap_avail_heads[node]);
avail_lists      1026 mm/swapfile.c  			if (plist_node_empty(&si->avail_lists[node])) {
avail_lists      1065 mm/swapfile.c  		if (plist_node_empty(&next->avail_lists[node]))
avail_lists      2438 mm/swapfile.c  			p->avail_lists[i].prio = -p->prio;
avail_lists      2441 mm/swapfile.c  				p->avail_lists[i].prio = 1;
avail_lists      2443 mm/swapfile.c  				p->avail_lists[i].prio = -p->prio;
avail_lists      2574 mm/swapfile.c  				if (si->avail_lists[nid].prio != 1)
avail_lists      2575 mm/swapfile.c  					si->avail_lists[nid].prio--;
avail_lists      2830 mm/swapfile.c  	p = kvzalloc(struct_size(p, avail_lists, nr_node_ids), GFP_KERNEL);
avail_lists      2865 mm/swapfile.c  		plist_node_init(&p->avail_lists[i], 0);
avail_lists      3759 mm/swapfile.c  				  avail_lists[node]) {