Lines Matching refs:unbuddied
33 * into chunks allows organizing unbuddied zbud pages into a manageable number
34 * of unbuddied lists according to the number of free chunks available in the
81 * @unbuddied: array of lists tracking zbud pages that only contain one buddy;
95 * Reuse unbuddied[0] as buddied on the ground that
96 * unbuddied[0] is unused.
99 struct list_head unbuddied[NCHUNKS];
107 * @buddy: links the zbud page into the unbuddied/buddied lists in the pool
210 INIT_LIST_HEAD(&pool->unbuddied[i]);
235 * satisfy the allocation request. A search of the unbuddied lists is
261 /* First, try to find an unbuddied zbud page. */
263 if (!list_empty(&pool->unbuddied[i])) {
264 zhdr = list_first_entry(&pool->unbuddied[i],
275 /* Couldn't find unbuddied zbud page, create new one */
292 /* Add to unbuddied list */
294 list_add(&zhdr->buddy, &pool->unbuddied[freechunks]);
333 /* Add to unbuddied list */
335 list_add(&zhdr->buddy, &pool->unbuddied[freechunks]);