19  * Set nodes, which have memory in @mi, in *@nodemask.
22 					      const struct numa_meminfo *mi)  in numa_nodemask_from_meminfo()  argument
26 	for (i = 0; i < ARRAY_SIZE(mi->blk); i++)  in numa_nodemask_from_meminfo()
27 		if (mi->blk[i].start != mi->blk[i].end &&  in numa_nodemask_from_meminfo()
28 		    mi->blk[i].nid != NUMA_NO_NODE)  in numa_nodemask_from_meminfo()
29 			node_set(mi->blk[i].nid, *nodemask);  in numa_nodemask_from_meminfo()
134 				     struct numa_meminfo *mi)  in numa_add_memblk_to()  argument
147 	if (mi->nr_blks >= NR_NODE_MEMBLKS) {  in numa_add_memblk_to()
152 	mi->blk[mi->nr_blks].start = start;  in numa_add_memblk_to()
153 	mi->blk[mi->nr_blks].end = end;  in numa_add_memblk_to()
154 	mi->blk[mi->nr_blks].nid = nid;  in numa_add_memblk_to()
155 	mi->nr_blks++;  in numa_add_memblk_to()
162  * @mi: numa_meminfo to remove memblk from
164  * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
165  * decrementing @mi->nr_blks.
167 void __init numa_remove_memblk_from(int idx, struct numa_meminfo *mi)  in numa_remove_memblk_from()  argument
169 	mi->nr_blks--;  in numa_remove_memblk_from()
170 	memmove(&mi->blk[idx], &mi->blk[idx + 1],  in numa_remove_memblk_from()
171 		(mi->nr_blks - idx) * sizeof(mi->blk[0]));  in numa_remove_memblk_from()
205  * @mi: numa_meminfo to clean up
207  * Sanitize @mi by merging and removing unnecessary memblks.  Also check for
213 int __init numa_cleanup_meminfo(struct numa_meminfo *mi)  in numa_cleanup_meminfo()  argument
220 	for (i = 0; i < mi->nr_blks; i++) {  in numa_cleanup_meminfo()
221 		struct numa_memblk *bi = &mi->blk[i];  in numa_cleanup_meminfo()
226 			numa_move_tail_memblk(&numa_reserved_meminfo, i--, mi);  in numa_cleanup_meminfo()
242 			numa_remove_memblk_from(i--, mi);  in numa_cleanup_meminfo()
246 	for (i = 0; i < mi->nr_blks; i++) {  in numa_cleanup_meminfo()
247 		struct numa_memblk *bi = &mi->blk[i];  in numa_cleanup_meminfo()
249 		for (j = i + 1; j < mi->nr_blks; j++) {  in numa_cleanup_meminfo()
250 			struct numa_memblk *bj = &mi->blk[j];  in numa_cleanup_meminfo()
279 			for (k = 0; k < mi->nr_blks; k++) {  in numa_cleanup_meminfo()
280 				struct numa_memblk *bk = &mi->blk[k];  in numa_cleanup_meminfo()
287 			if (k < mi->nr_blks)  in numa_cleanup_meminfo()
294 			numa_remove_memblk_from(j--, mi);  in numa_cleanup_meminfo()
299 	for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {  in numa_cleanup_meminfo()
300 		mi->blk[i].start = mi->blk[i].end = 0;  in numa_cleanup_meminfo()
301 		mi->blk[i].nid = NUMA_NO_NODE;  in numa_cleanup_meminfo()
374 static int __init numa_register_meminfo(struct numa_meminfo *mi)  in numa_register_meminfo()  argument
380 	numa_nodemask_from_meminfo(&node_possible_map, mi);  in numa_register_meminfo()
384 	for (i = 0; i < mi->nr_blks; i++) {  in numa_register_meminfo()
385 		struct numa_memblk *mb = &mi->blk[i];  in numa_register_meminfo()
488 	struct numa_meminfo *mi = &numa_meminfo;  in numa_fill_memblks()  local
497 	for (int i = 0; i < mi->nr_blks; i++) {  in numa_fill_memblks()
498 		struct numa_memblk *bi = &mi->blk[i];  in numa_fill_memblks()
502 			blk[count] = &mi->blk[i];  in numa_fill_memblks()
536 static int meminfo_to_nid(struct numa_meminfo *mi, u64 start)  in meminfo_to_nid()  argument
540 	for (i = 0; i < mi->nr_blks; i++)  in meminfo_to_nid()
541 		if (mi->blk[i].start <= start && mi->blk[i].end > start)  in meminfo_to_nid()
542 			return mi->blk[i].nid;  in meminfo_to_nid()