linux/mm/numa_memblks.c

26 	for (i = 0; i < ARRAY_SIZE(mi->blk); i++)
27 		if (mi->blk[i].start != mi->blk[i].end &&
28 		    mi->blk[i].nid != NUMA_NO_NODE)
29 			node_set(mi->blk[i].nid, *nodemask);
152 	mi->blk[mi->nr_blks].start = start;
153 	mi->blk[mi->nr_blks].end = end;
154 	mi->blk[mi->nr_blks].nid = nid;
164  * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
170 	memmove(&mi->blk[idx], &mi->blk[idx + 1],
171 		(mi->nr_blks - idx) * sizeof(mi->blk[0]));
183 	dst->blk[dst->nr_blks++] = src->blk[idx];
243 		struct numa_memblk *bi = &mi->blk[i];
269 		struct numa_memblk *bi = &mi->blk[i];
272 			struct numa_memblk *bj = &mi->blk[j];
302 				struct numa_memblk *bk = &mi->blk[k];
321 	for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {
322 		mi->blk[i].start = mi->blk[i].end = 0;
323 		mi->blk[i].nid = NUMA_NO_NODE;
354 		struct numa_memblk *mb = numa_meminfo.blk + i;
387 		struct numa_memblk *mb = numa_meminfo.blk + i;
407 		struct numa_memblk *mb = &mi->blk[i];
509 	struct numa_memblk **blk = &numa_memblk_list[0];
520 		struct numa_memblk *bi = &mi->blk[i];
524 			blk[count] = &mi->blk[i];
532 	sort(&blk[0], count, sizeof(blk[0]), cmp_memblk, NULL);
535 	blk[0]->start = min(blk[0]->start, start);
536 	blk[count - 1]->end = max(blk[count - 1]->end, end);
542 	prev_end = blk[0]->end;
544 		struct numa_memblk *curr = blk[i];
563 		if (mi->blk[i].start <= start && mi->blk[i].end > start)
564 			return mi->blk[i].nid;
588 		nid = numa_meminfo.blk[0].nid;