kvm/mmu/mmu.c

936 	struct pte_list_desc *desc;
942 		desc = kvm_mmu_memory_cache_alloc(cache);
943 		desc->sptes[0] = (u64 *)rmap_head->val;
944 		desc->sptes[1] = spte;
945 		desc->spte_count = 2;
946 		desc->tail_count = 0;
947 		rmap_head->val = (unsigned long)desc | 1;
950 		desc = (struct pte_list_desc *)(rmap_head->val & ~1ul);
951 		count = desc->tail_count + desc->spte_count;
957 		if (desc->spte_count == PTE_LIST_EXT) {
958 			desc = kvm_mmu_memory_cache_alloc(cache);
959 			desc->more = (struct pte_list_desc *)(rmap_head->val & ~1ul);
960 			desc->spte_count = 0;
961 			desc->tail_count = count;
962 			rmap_head->val = (unsigned long)desc | 1;
964 		desc->sptes[desc->spte_count++] = spte;
971 				       struct pte_list_desc *desc, int i)
988 	desc->sptes[i] = head_desc->sptes[j];
1009 	struct pte_list_desc *desc;
1021 		desc = (struct pte_list_desc *)(rmap_head->val & ~1ul);
1022 		while (desc) {
1023 			for (i = 0; i < desc->spte_count; ++i) {
1024 				if (desc->sptes[i] == spte) {
1026 								   desc, i);
1030 			desc = desc->more;
1048 	struct pte_list_desc *desc, *next;
1059 	desc = (struct pte_list_desc *)(rmap_head->val & ~1ul);
1061 	for (; desc; desc = next) {
1062 		for (i = 0; i < desc->spte_count; i++)
1063 			mmu_spte_clear_track_bits(kvm, desc->sptes[i]);
1064 		next = desc->more;
1065 		mmu_free_pte_list_desc(desc);
1075 	struct pte_list_desc *desc;
1082 	desc = (struct pte_list_desc *)(rmap_head->val & ~1ul);
1083 	return desc->tail_count + desc->spte_count;
1125 	struct pte_list_desc *desc;	/* holds the sptep if not NULL */
1145 		iter->desc = NULL;
1150 	iter->desc = (struct pte_list_desc *)(rmap_head->val & ~1ul);
1152 	sptep = iter->desc->sptes[iter->pos];
1167 	if (iter->desc) {
1170 			sptep = iter->desc->sptes[iter->pos];
1175 		iter->desc = iter->desc->more;
1177 		if (iter->desc) {
1179 			/* desc->sptes[0] cannot be NULL */
1180 			sptep = iter->desc->sptes[iter->pos];