Lines Matching refs:cur
418 struct bm_position cur; /* most recently used bit position */ member
590 bm->cur.zone = list_entry(bm->zones.next, struct mem_zone_bm_rtree, in memory_bm_position_reset()
592 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in memory_bm_position_reset()
594 bm->cur.node_pfn = 0; in memory_bm_position_reset()
595 bm->cur.cur_pfn = BM_END_OF_MAP; in memory_bm_position_reset()
596 bm->cur.node_bit = 0; in memory_bm_position_reset()
636 struct mem_extent *ext, *cur, *aux; in create_mem_extents() local
667 cur = ext; in create_mem_extents()
668 list_for_each_entry_safe_continue(cur, aux, list, hook) { in create_mem_extents()
669 if (zone_end < cur->start) in create_mem_extents()
671 if (zone_end < cur->end) in create_mem_extents()
672 ext->end = cur->end; in create_mem_extents()
673 list_del(&cur->hook); in create_mem_extents()
674 kfree(cur); in create_mem_extents()
755 zone = bm->cur.zone; in memory_bm_find_bit()
784 node = bm->cur.node; in memory_bm_find_bit()
785 if (zone == bm->cur.zone && in memory_bm_find_bit()
786 ((pfn - zone->start_pfn) & ~BM_BLOCK_MASK) == bm->cur.node_pfn) in memory_bm_find_bit()
803 bm->cur.zone = zone; in memory_bm_find_bit()
804 bm->cur.node = node; in memory_bm_find_bit()
805 bm->cur.node_pfn = (pfn - zone->start_pfn) & ~BM_BLOCK_MASK; in memory_bm_find_bit()
806 bm->cur.cur_pfn = pfn; in memory_bm_find_bit()
854 bit = max(bm->cur.node_bit - 1, 0); in memory_bm_clear_current()
855 clear_bit(bit, bm->cur.node->data); in memory_bm_clear_current()
860 return bm->cur.cur_pfn; in memory_bm_get_current()
894 if (!list_is_last(&bm->cur.node->list, &bm->cur.zone->leaves)) { in rtree_next_node()
895 bm->cur.node = list_entry(bm->cur.node->list.next, in rtree_next_node()
897 bm->cur.node_pfn += BM_BITS_PER_BLOCK; in rtree_next_node()
898 bm->cur.node_bit = 0; in rtree_next_node()
904 if (!list_is_last(&bm->cur.zone->list, &bm->zones)) { in rtree_next_node()
905 bm->cur.zone = list_entry(bm->cur.zone->list.next, in rtree_next_node()
907 bm->cur.node = list_entry(bm->cur.zone->leaves.next, in rtree_next_node()
909 bm->cur.node_pfn = 0; in rtree_next_node()
910 bm->cur.node_bit = 0; in rtree_next_node()
935 pages = bm->cur.zone->end_pfn - bm->cur.zone->start_pfn; in memory_bm_next_pfn()
936 bits = min(pages - bm->cur.node_pfn, BM_BITS_PER_BLOCK); in memory_bm_next_pfn()
937 bit = find_next_bit(bm->cur.node->data, bits, in memory_bm_next_pfn()
938 bm->cur.node_bit); in memory_bm_next_pfn()
940 pfn = bm->cur.zone->start_pfn + bm->cur.node_pfn + bit; in memory_bm_next_pfn()
941 bm->cur.node_bit = bit + 1; in memory_bm_next_pfn()
942 bm->cur.cur_pfn = pfn; in memory_bm_next_pfn()
947 bm->cur.cur_pfn = BM_END_OF_MAP; in memory_bm_next_pfn()
2238 if (handle->cur > nr_meta_pages + nr_copy_pages) in snapshot_read_next()
2247 if (!handle->cur) { in snapshot_read_next()
2256 } else if (handle->cur <= nr_meta_pages) { in snapshot_read_next()
2279 handle->cur++; in snapshot_read_next()
2777 if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages + nr_zero_pages) in snapshot_write_next()
2780 if (!handle->cur) { in snapshot_write_next()
2789 } else if (handle->cur == 1) { in snapshot_write_next()
2807 } else if (handle->cur <= nr_meta_pages + 1) { in snapshot_write_next()
2812 if (handle->cur == nr_meta_pages + 1) { in snapshot_write_next()
2835 handle->cur++; in snapshot_write_next()
2838 if (handle->cur > nr_meta_pages + 1 && in snapshot_write_next()
2862 if (handle->cur > 1 && handle->cur > nr_meta_pages + nr_copy_pages + nr_zero_pages) { in snapshot_write_finalize()
2872 handle->cur <= nr_meta_pages + nr_copy_pages + nr_zero_pages); in snapshot_image_loaded()