Lines Matching refs:blk
146 mi->blk[mi->nr_blks].start = start;
147 mi->blk[mi->nr_blks].end = end;
148 mi->blk[mi->nr_blks].nid = nid;
158 * Remove @idx'th numa_memblk from @mi by shifting @mi->blk[] and
164 memmove(&mi->blk[idx], &mi->blk[idx + 1],
165 (mi->nr_blks - idx) * sizeof(mi->blk[0]));
177 dst->blk[dst->nr_blks++] = src->blk[idx];
248 struct numa_memblk *bi = &mi->blk[i];
274 struct numa_memblk *bi = &mi->blk[i];
277 struct numa_memblk *bj = &mi->blk[j];
307 struct numa_memblk *bk = &mi->blk[k];
326 for (i = mi->nr_blks; i < ARRAY_SIZE(mi->blk); i++) {
327 mi->blk[i].start = mi->blk[i].end = 0;
328 mi->blk[i].nid = NUMA_NO_NODE;
342 for (i = 0; i < ARRAY_SIZE(mi->blk); i++)
343 if (mi->blk[i].start != mi->blk[i].end &&
344 mi->blk[i].nid != NUMA_NO_NODE)
345 node_set(mi->blk[i].nid, *nodemask);
477 struct numa_memblk *mb = numa_meminfo.blk + i;
509 struct numa_memblk *mb = numa_meminfo.blk + i;
529 struct numa_memblk *mb = &mi->blk[i];
567 if (nid != mi->blk[i].nid)
569 start = min(mi->blk[i].start, start);
570 end = max(mi->blk[i].end, end);
902 if (mi->blk[i].start <= start && mi->blk[i].end > start)
903 return mi->blk[i].nid;
927 nid = numa_meminfo.blk[0].nid;
957 struct numa_memblk **blk = &numa_memblk_list[0];
968 struct numa_memblk *bi = &mi->blk[i];
972 blk[count] = &mi->blk[i];
980 sort(&blk[0], count, sizeof(blk[0]), cmp_memblk, NULL);
983 blk[0]->start = min(blk[0]->start, start);
984 blk[count - 1]->end = max(blk[count - 1]->end, end);
990 prev_end = blk[0]->end;
992 struct numa_memblk *curr = blk[i];