1 /* i915_mem.c -- Simple agp/fb memory manager for i915 -*- linux-c -*-
4 * Copyright 2003 Tungsten Graphics, Inc., Cedar Park, Texas.
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the
9 * "Software"), to deal in the Software without restriction, including
10 * without limitation the rights to use, copy, modify, merge, publish,
11 * distribute, sub license, and/or sell copies of the Software, and to
12 * permit persons to whom the Software is furnished to do so, subject to
13 * the following conditions:
15 * The above copyright notice and this permission notice (including the
16 * next paragraph) shall be included in all copies or substantial portions
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
20 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
22 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
23 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
24 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
25 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
34 /* This memory manager is integrated into the global/local lru
35 * mechanisms used by the clients. Specifically, it operates by
36 * setting the 'in_use' fields of the global LRU to indicate whether
37 * this region is privately allocated to a client.
39 * This does require the client to actually respect that field.
41 * Currently no effort is made to allocate 'private' memory in any
42 * clever way - the LRU information isn't used to determine which
43 * block to allocate, and the ring is drained prior to allocations --
44 * in other words allocation is expensive.
46 static void mark_block(struct drm_device * dev, struct mem_block *p, int in_use)
48 struct drm_i915_private *dev_priv = dev->dev_private;
49 struct drm_i915_sarea *sarea_priv = dev_priv->sarea_priv;
50 struct drm_tex_region *list;
57 shift = dev_priv->tex_lru_log_granularity;
58 nr = I915_NR_TEX_REGIONS;
60 start = p->start >> shift;
61 end = (p->start + p->size - 1) >> shift;
63 age = ++sarea_priv->texAge;
64 list = sarea_priv->texList;
66 /* Mark the regions with the new flag and update their age. Move
67 * them to head of list to preserve LRU semantics.
69 for (i = start; i <= end; i++) {
70 list[i].in_use = in_use;
73 /* remove_from_list(i)
75 list[(unsigned)list[i].next].prev = list[i].prev;
76 list[(unsigned)list[i].prev].next = list[i].next;
78 /* insert_at_head(list, i)
81 list[i].next = list[nr].next;
82 list[(unsigned)list[nr].next].prev = i;
87 /* Very simple allocator for agp memory, working on a static range
88 * already mapped into each client's address space.
91 static struct mem_block *split_block(struct mem_block *p, int start, int size,
92 struct drm_file *file_priv)
94 /* Maybe cut off the start of an existing block */
95 if (start > p->start) {
96 struct mem_block *newblock =
97 drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
100 newblock->start = start;
101 newblock->size = p->size - (start - p->start);
102 newblock->file_priv = NULL;
103 newblock->next = p->next;
105 p->next->prev = newblock;
107 p->size -= newblock->size;
111 /* Maybe cut off the end of an existing block */
112 if (size < p->size) {
113 struct mem_block *newblock =
114 drm_alloc(sizeof(*newblock), DRM_MEM_BUFLISTS);
117 newblock->start = start + size;
118 newblock->size = p->size - size;
119 newblock->file_priv = NULL;
120 newblock->next = p->next;
122 p->next->prev = newblock;
128 /* Our block is in the middle */
129 p->file_priv = file_priv;
133 static struct mem_block *alloc_block(struct mem_block *heap, int size,
134 int align2, struct drm_file *file_priv)
137 int mask = (1 << align2) - 1;
139 for (p = heap->next; p != heap; p = p->next) {
140 int start = (p->start + mask) & ~mask;
141 if (p->file_priv == NULL && start + size <= p->start + p->size)
142 return split_block(p, start, size, file_priv);
148 static struct mem_block *find_block(struct mem_block *heap, int start)
152 for (p = heap->next; p != heap; p = p->next)
153 if (p->start == start)
159 static void free_block(struct mem_block *p)
163 /* Assumes a single contiguous range. Needs a special file_priv in
164 * 'heap' to stop it being subsumed.
166 if (p->next->file_priv == NULL) {
167 struct mem_block *q = p->next;
171 drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
174 if (p->prev->file_priv == NULL) {
175 struct mem_block *q = p->prev;
179 drm_free(p, sizeof(*q), DRM_MEM_BUFLISTS);
183 /* Initialize. How to check for an uninitialized heap?
185 static int init_heap(struct mem_block **heap, int start, int size)
187 struct mem_block *blocks = drm_alloc(sizeof(*blocks), DRM_MEM_BUFLISTS);
192 *heap = drm_alloc(sizeof(**heap), DRM_MEM_BUFLISTS);
194 drm_free(blocks, sizeof(*blocks), DRM_MEM_BUFLISTS);
198 blocks->start = start;
200 blocks->file_priv = NULL;
201 blocks->next = blocks->prev = *heap;
203 memset(*heap, 0, sizeof(**heap));
204 (*heap)->file_priv = (struct drm_file *) - 1;
205 (*heap)->next = (*heap)->prev = blocks;
209 /* Free all blocks associated with the releasing file.
211 void i915_mem_release(struct drm_device * dev, struct drm_file *file_priv,
212 struct mem_block *heap)
216 if (!heap || !heap->next)
219 for (p = heap->next; p != heap; p = p->next) {
220 if (p->file_priv == file_priv) {
222 mark_block(dev, p, 0);
226 /* Assumes a single contiguous range. Needs a special file_priv in
227 * 'heap' to stop it being subsumed.
229 for (p = heap->next; p != heap; p = p->next) {
230 while (p->file_priv == NULL && p->next->file_priv == NULL) {
231 struct mem_block *q = p->next;
235 drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
242 void i915_mem_takedown(struct mem_block **heap)
249 for (p = (*heap)->next; p != *heap;) {
250 struct mem_block *q = p;
252 drm_free(q, sizeof(*q), DRM_MEM_BUFLISTS);
255 drm_free(*heap, sizeof(**heap), DRM_MEM_BUFLISTS);
259 static struct mem_block **get_heap(struct drm_i915_private * dev_priv, int region)
262 case I915_MEM_REGION_AGP:
263 return &dev_priv->agp_heap;
271 int i915_mem_alloc(struct drm_device *dev, void *data,
272 struct drm_file *file_priv)
274 struct drm_i915_private *dev_priv = dev->dev_private;
275 struct drm_i915_mem_alloc *alloc = data;
276 struct mem_block *block, **heap;
279 DRM_ERROR("called with no initialization\n");
283 heap = get_heap(dev_priv, alloc->region);
287 /* Make things easier on ourselves: all allocations at least
290 if (alloc->alignment < 12)
291 alloc->alignment = 12;
293 block = alloc_block(*heap, alloc->size, alloc->alignment, file_priv);
298 mark_block(dev, block, 1);
300 if (DRM_COPY_TO_USER(alloc->region_offset, &block->start,
302 DRM_ERROR("copy_to_user\n");
309 int i915_mem_free(struct drm_device *dev, void *data,
310 struct drm_file *file_priv)
312 struct drm_i915_private *dev_priv = dev->dev_private;
313 struct drm_i915_mem_free *memfree = data;
314 struct mem_block *block, **heap;
317 DRM_ERROR("called with no initialization\n");
321 heap = get_heap(dev_priv, memfree->region);
325 block = find_block(*heap, memfree->region_offset);
329 if (block->file_priv != file_priv)
332 mark_block(dev, block, 0);
337 int i915_mem_init_heap(struct drm_device *dev, void *data,
338 struct drm_file *file_priv)
340 struct drm_i915_private *dev_priv = dev->dev_private;
341 struct drm_i915_mem_init_heap *initheap = data;
342 struct mem_block **heap;
345 DRM_ERROR("called with no initialization\n");
349 heap = get_heap(dev_priv, initheap->region);
354 DRM_ERROR("heap already initialized?");
358 return init_heap(heap, initheap->start, initheap->size);
361 int i915_mem_destroy_heap( struct drm_device *dev, void *data,
362 struct drm_file *file_priv )
364 struct drm_i915_private *dev_priv = dev->dev_private;
365 struct drm_i915_mem_destroy_heap *destroyheap = data;
366 struct mem_block **heap;
369 DRM_ERROR( "called with no initialization\n" );
373 heap = get_heap( dev_priv, destroyheap->region );
375 DRM_ERROR("get_heap failed");
380 DRM_ERROR("heap not initialized?");
384 i915_mem_takedown( heap );