Lines Matching refs:size
9 * This allocator returns small blocks of a given size which are DMA-able by
11 * new pages, then splits them up into blocks of the required size.
17 * least 'size' bytes. Free blocks are tracked in an unsorted singly-linked
45 size_t size;
68 unsigned size;
74 size = PAGE_SIZE;
76 temp = scnprintf(next, size, "poolinfo - 0.1\n");
77 size -= temp;
93 temp = scnprintf(next, size, "%-16s %4u %4zu %4zu %2u\n",
95 pages * (pool->allocation / pool->size),
96 pool->size, pages);
97 size -= temp;
102 return PAGE_SIZE - size;
111 * @size: size of the blocks in this pool.
119 * cache flushing primitives. The actual size of blocks allocated may be
123 * cross that size boundary. This is useful for devices which have
131 size_t size, size_t align, size_t boundary)
142 if (size == 0)
144 else if (size < 4)
145 size = 4;
147 size = ALIGN(size, align);
148 allocation = max_t(size_t, size, PAGE_SIZE);
152 else if ((boundary < size) || (boundary & (boundary - 1)))
165 retval->size = size;
209 unsigned int next = offset + pool->size;
210 if (unlikely((next + pool->size) >= next_boundary)) {
351 for (i = sizeof(page->offset); i < pool->size; i++) {
366 data, pool->size, 1);
371 memset(retval, POOL_POISON_ALLOCATED, pool->size);
376 memset(retval, 0, pool->size);
425 memset(vaddr, 0, pool->size);
454 memset(vaddr, POOL_POISON_FREED, pool->size);
488 * @size: size of the blocks in this pool.
499 size_t size, size_t align, size_t allocation)
507 pool = *ptr = dma_pool_create(name, dev, size, align, allocation);