tag	line	file	source code
order	176	drivers/block/floppy.c	int order;
order	180	drivers/block/floppy.c	: "=r" (order)
order	183	drivers/block/floppy.c	for (order = 0; order < NR_MEM_LISTS; ++order)
order	184	drivers/block/floppy.c	if (size <= (PAGE_SIZE << order))
order	185	drivers/block/floppy.c	return order;
order	192	drivers/block/floppy.c	int order = __get_order(size);
order	194	drivers/block/floppy.c	if (order >= NR_MEM_LISTS)
order	196	drivers/block/floppy.c	return __get_dma_pages(GFP_KERNEL,order);
order	302	drivers/pci/pci.c	long order;
order	304	drivers/pci/pci.c	order = dev_info[i].vendor - (long) vendor;
order	305	drivers/pci/pci.c	if (!order)
order	306	drivers/pci/pci.c	order = dev_info[i].device - (long) dev;
order	308	drivers/pci/pci.c	if (order < 0)
order	316	drivers/pci/pci.c	if (order > 0)
order	2249	drivers/scsi/scsi.c	int order, a_size;
order	2250	drivers/scsi/scsi.c	for (order = 0, a_size = PAGE_SIZE;
order	2251	drivers/scsi/scsi.c	a_size < size; order++, a_size <<= 1)
order	2254	drivers/scsi/scsi.c	order);
order	2272	drivers/scsi/scsi.c	int order, a_size;
order	2274	drivers/scsi/scsi.c	for (order = 0, a_size = PAGE_SIZE;
order	2275	drivers/scsi/scsi.c	a_size < size; order++, a_size <<= 1)
order	2277	drivers/scsi/scsi.c	free_pages((unsigned long)ptr, order);
order	282	include/asm-mips/dma.h	#define __get_dma_pages(priority, order) __get_free_pages((priority),(order), \
order	162	include/linux/mm.h	#define __get_dma_pages(priority, order) __get_free_pages((priority),(order),MAX_DMA_ADDRESS)
order	178	include/linux/mm.h	extern void free_pages(unsigned long addr, unsigned long order);
order	64	mm/kmalloc.c	int order;
order	133	mm/kmalloc.c	#define NBLOCKS(order)          (sizes[order].nblocks)
order	134	mm/kmalloc.c	#define BLOCKSIZE(order)        (sizes[order].size)
order	135	mm/kmalloc.c	#define AREASIZE(order)    (PAGE_SIZE<<(sizes[order].gfporder))
order	140	mm/kmalloc.c	int order;
order	146	mm/kmalloc.c	for (order = 0; BLOCKSIZE(order); order++) {
order	147	mm/kmalloc.c	if ((NBLOCKS(order) * BLOCKSIZE(order) + sizeof(struct page_descriptor)) >
order	148	mm/kmalloc.c	AREASIZE(order)) {
order	150	mm/kmalloc.c	(int) (NBLOCKS(order) * BLOCKSIZE(order) +
order	152	mm/kmalloc.c	(int) AREASIZE(order),
order	153	mm/kmalloc.c	BLOCKSIZE(order));
order	164	mm/kmalloc.c	int order;
order	168	mm/kmalloc.c	for (order = 0; BLOCKSIZE(order); order++)
order	169	mm/kmalloc.c	if (size <= BLOCKSIZE(order))
order	170	mm/kmalloc.c	return order;
order	178	mm/kmalloc.c	int order, i, sz;
order	182	mm/kmalloc.c	order = get_order(size);
order	183	mm/kmalloc.c	if (order < 0) {
order	190	mm/kmalloc.c	pg = &sizes[order].firstfree;
order	194	mm/kmalloc.c	pg = &sizes[order].dmafree;
order	227	mm/kmalloc.c	sz = BLOCKSIZE(order);
order	230	mm/kmalloc.c	sizes[order].gfporder, max_addr);
order	240	mm/kmalloc.c	sizes[order].npages++;
order	243	mm/kmalloc.c	for (i = NBLOCKS(order), p = BH(page + 1); i > 1; i--, p = p->bh_next) {
order	251	mm/kmalloc.c	page->order = order;
order	252	mm/kmalloc.c	page->nfree = NBLOCKS(order);
order	269	mm/kmalloc.c	sizes[order].nmallocs++;
order	270	mm/kmalloc.c	sizes[order].nbytesmalloced += size;
order	280	mm/kmalloc.c	int order;
order	288	mm/kmalloc.c	order = page->order;
order	289	mm/kmalloc.c	pg = &sizes[order].firstfree;
order	292	mm/kmalloc.c	pg = &sizes[order].dmafree;
order	295	mm/kmalloc.c	if ((order < 0) ||
order	296	mm/kmalloc.c	(order >= sizeof(sizes) / sizeof(sizes[0])) ||
order	300	mm/kmalloc.c	p, page->next, page->order);
order	317	mm/kmalloc.c	if (page->nfree == NBLOCKS(order)) {
order	330	mm/kmalloc.c	sizes[order].npages--;
order	331	mm/kmalloc.c	free_pages((long) page, sizes[order].gfporder);
order	333	mm/kmalloc.c	sizes[order].nfrees++;
order	334	mm/kmalloc.c	sizes[order].nbytesmalloced -= size;
order	58	mm/page_alloc.c	static inline void free_pages_ok(unsigned long addr, unsigned long order)
order	60	mm/page_alloc.c	unsigned long index = MAP_NR(addr) >> (1 + order);
order	61	mm/page_alloc.c	unsigned long mask = PAGE_MASK << order;
order	64	mm/page_alloc.c	nr_free_pages += 1 << order;
order	65	mm/page_alloc.c	while (order < NR_MEM_LISTS-1) {
order	66	mm/page_alloc.c	if (!change_bit(index, free_area_map[order]))
order	68	mm/page_alloc.c	remove_mem_queue(free_area_list+order, (struct mem_list *) (addr ^ (1+~mask)));
order	69	mm/page_alloc.c	order++;
order	74	mm/page_alloc.c	add_mem_queue(free_area_list+order, (struct mem_list *) addr);
order	93	mm/page_alloc.c	void free_pages(unsigned long addr, unsigned long order)
order	104	mm/page_alloc.c	free_pages_ok(addr, order);
order	121	mm/page_alloc.c	#define RMQUEUE(order, limit) \
order	122	mm/page_alloc.c	do { struct mem_list * queue = free_area_list+order; \
order	123	mm/page_alloc.c	unsigned long new_order = order; \
order	129	mm/page_alloc.c	nr_free_pages -= 1 << order; \
order	131	mm/page_alloc.c	EXPAND(ret, order, new_order); \
order	140	mm/page_alloc.c	static inline int mark_used(unsigned long addr, unsigned long order)
order	142	mm/page_alloc.c	return change_bit(MAP_NR(addr) >> (1+order), free_area_map[order]);
order	157	mm/page_alloc.c	unsigned long __get_free_pages(int priority, unsigned long order, unsigned long limit)
order	162	mm/page_alloc.c	if (order >= NR_MEM_LISTS)
order	179	mm/page_alloc.c	RMQUEUE(order, limit);
order	196	mm/page_alloc.c	unsigned long order, flags;
order	202	mm/page_alloc.c	for (order=0 ; order < NR_MEM_LISTS; order++) {
order	205	mm/page_alloc.c	for (tmp = free_area_list[order].next ; tmp != free_area_list + order ; tmp = tmp->next) {
order	208	mm/page_alloc.c	total += nr * ((PAGE_SIZE>>10) << order);
order	209	mm/page_alloc.c	printk("%lu*%lukB ", nr, (PAGE_SIZE>>10) << order);