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
80 * @unbuddied: array of lists tracking zbud pages that only contain one buddy;
96 struct list_head unbuddied[NCHUNKS];
110 * @buddy: links the zbud page into the unbuddied/buddied lists in the pool
317 INIT_LIST_HEAD(&pool->unbuddied[i]);
344 * satisfy the allocation request. A search of the unbuddied lists is
370 /* First, try to find an unbuddied zbud page. */
372 if (!list_empty(&pool->unbuddied[i])) {
373 zhdr = list_first_entry(&pool->unbuddied[i],
384 /* Couldn't find unbuddied zbud page, create new one */
401 /* Add to unbuddied list */
403 list_add(&zhdr->buddy, &pool->unbuddied[freechunks]);
459 /* Add to unbuddied list */
461 list_add(&zhdr->buddy, &pool->unbuddied[freechunks]);
557 /* add to unbuddied list */
559 list_add(&zhdr->buddy, &pool->unbuddied[freechunks]);