132 				     struct numa_meminfo *mi)  in numa_add_memblk_to()  argument
145 	if (mi->nr_blks >= NR_NODE_MEMBLKS) {  in numa_add_memblk_to()
150 	mi->blk[mi->nr_blks].start = start;  in numa_add_memblk_to()
151 	mi->blk[mi->nr_blks].end = end;  in numa_add_memblk_to()
152 	mi->blk[mi->nr_blks].nid = nid;  in numa_add_memblk_to()
153 	mi->nr_blks++;  in numa_add_memblk_to()
165 void __init numa_remove_memblk_from(int idx, struct numa_meminfo *mi)  in numa_remove_memblk_from()  argument
167 	mi->nr_blks--;  in numa_remove_memblk_from()
168 	memmove(&mi->blk[idx], &mi->blk[idx + 1],  in numa_remove_memblk_from()
169 		(mi->nr_blks - idx) * sizeof(mi->blk[0]));  in numa_remove_memblk_from()
235 int __init numa_cleanup_meminfo(struct numa_meminfo *mi)  in numa_cleanup_meminfo()  argument
242 	for (i = 0; i < mi->nr_blks; i++) {  in numa_cleanup_meminfo()
243 		struct numa_memblk *bi = &mi->blk[i];  in numa_cleanup_meminfo()
251 			numa_remove_memblk_from(i--, mi);  in numa_cleanup_meminfo()
255 	for (i = 0; i < mi->nr_blks; i++) {  in numa_cleanup_meminfo()
256 		struct numa_memblk *bi = &mi->blk[i];  in numa_cleanup_meminfo()
258 		for (j = i + 1; j < mi->nr_blks; j++) {  in numa_cleanup_meminfo()
259 			struct numa_memblk *bj = &mi->blk[j];  in numa_cleanup_meminfo()
288 			for (k = 0; k < mi->nr_blks; k++) {  in numa_cleanup_meminfo()
289 				struct numa_memblk *bk = &mi->blk[k];  in numa_cleanup_meminfo()
296 			if (k < mi->nr_blks)  in numa_cleanup_meminfo()
303 			numa_remove_memblk_from(j--, mi);  in numa_cleanup_meminfo()
308 	for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {  in numa_cleanup_meminfo()
309 		mi->blk[i].start = mi->blk[i].end = 0;  in numa_cleanup_meminfo()
310 		mi->blk[i].nid = NUMA_NO_NODE;  in numa_cleanup_meminfo()
320 					      const struct numa_meminfo *mi)  in numa_nodemask_from_meminfo()  argument
324 	for (i = 0; i < ARRAY_SIZE(mi->blk); i++)  in numa_nodemask_from_meminfo()
325 		if (mi->blk[i].start != mi->blk[i].end &&  in numa_nodemask_from_meminfo()
326 		    mi->blk[i].nid != NUMA_NO_NODE)  in numa_nodemask_from_meminfo()
327 			node_set(mi->blk[i].nid, *nodemask);  in numa_nodemask_from_meminfo()
439 static bool __init numa_meminfo_cover_memory(const struct numa_meminfo *mi)  in numa_meminfo_cover_memory()  argument
445 	for (i = 0; i < mi->nr_blks; i++) {  in numa_meminfo_cover_memory()
446 		u64 s = mi->blk[i].start >> PAGE_SHIFT;  in numa_meminfo_cover_memory()
447 		u64 e = mi->blk[i].end >> PAGE_SHIFT;  in numa_meminfo_cover_memory()
449 		numaram -= __absent_pages_in_range(mi->blk[i].nid, s, e);  in numa_meminfo_cover_memory()
509 static int __init numa_register_memblks(struct numa_meminfo *mi)  in numa_register_memblks()  argument
516 	numa_nodemask_from_meminfo(&node_possible_map, mi);  in numa_register_memblks()
520 	for (i = 0; i < mi->nr_blks; i++) {  in numa_register_memblks()
521 		struct numa_memblk *mb = &mi->blk[i];  in numa_register_memblks()
548 	if (!numa_meminfo_cover_memory(mi))  in numa_register_memblks()
556 		for (i = 0; i < mi->nr_blks; i++) {  in numa_register_memblks()
557 			if (nid != mi->blk[i].nid)  in numa_register_memblks()
559 			start = min(mi->blk[i].start, start);  in numa_register_memblks()
560 			end = max(mi->blk[i].end, end);  in numa_register_memblks()
872 	struct numa_meminfo *mi = &numa_meminfo;  in memory_add_physaddr_to_nid()  local
873 	int nid = mi->blk[0].nid;  in memory_add_physaddr_to_nid()
876 	for (i = 0; i < mi->nr_blks; i++)  in memory_add_physaddr_to_nid()
877 		if (mi->blk[i].start <= start && mi->blk[i].end > start)  in memory_add_physaddr_to_nid()
878 			nid = mi->blk[i].nid;  in memory_add_physaddr_to_nid()