47 	/* One freelist for each possible block size, up to NLISTS */
51 /* Descriptors for each possible area */
115 	/* update the block size for each page in the block */  in split()
116 	for (i = 0; i < BIT(order); i++) {  in split()
158 	/* search all free lists for some memory */  in page_memalign_order()
159 	for ( ; order <= a->max_order; order++) {  in page_memalign_order()
178 	for (; order > sz; order--)  in page_memalign_order()
199 	for (i = 0; i < MAX_AREAS; i++)  in get_area()
241 	for (i = 0; i < (2ull << order); i++) {  in coalesce()
288 	/* ensure that the block is aligned properly for its size */  in _free_pages()
293 	for (i = 0; i < BIT(order); i++) {  in _free_pages()
367 	for (i = 0; i < n; i++)  in reserve_pages()
371 		for (n = 0 ; n < i; n++)  in reserve_pages()
387 	for (i = 0; i < n; i++)  in unreserve_pages()
400 	for (i = 0; !res && (i < MAX_AREAS); i++)  in page_memalign_order_flags()
460  * - there is at least one more slot free for memory areas
494 	for (i = 0; i < MAX_AREAS; i++) {  in _page_alloc_init_area()
502 	/* initialize all freelists for the new area */  in _page_alloc_init_area()
503 	for (i = 0; i < NLISTS; i++)  in _page_alloc_init_area()
506 	/* initialize the metadata for the available memory */  in _page_alloc_init_area()
507 	for (i = a->base; i < a->top; i += 1ull << order) {  in _page_alloc_init_area()
514 		 * we need both loops, one for the start and the other for  in _page_alloc_init_area()