forked from luck/tmp_suning_uos_patched
709ea97145
These helper functions can be used to efficiently scan lru list for eviction. Eviction becomes a three stage process: 1. Scanning through the lru list until a suitable hole has been found. 2. Scan backwards to restore drm_mm consistency and find out which objects fall into the hole. 3. Evict the objects that fall into the hole. These helper functions don't allocate any memory (at the price of not allowing any other concurrent operations). Hence this can also be used for ttm (which does lru scanning under a spinlock). Evicting objects in this fashion should be more fair than the current approach by i915 (scan the lru for a object large enough to contain the new object). It's also more efficient than the current approach used by ttm (uncoditionally evict objects from the lru until there's enough free space). Signed-Off-by: Daniel Vetter <daniel.vetter@ffwll.ch> Acked-by: Thomas Hellstrom <thellstrom@vmwgfx.com> Signed-off-by: Chris Wilson <chris@chris-wilson.co.uk> Signed-off-by: Dave Airlie <airlied@redhat.com>
157 lines
5.0 KiB
C
157 lines
5.0 KiB
C
/**************************************************************************
|
|
*
|
|
* Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA.
|
|
* All Rights Reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sub license, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice (including the
|
|
* next paragraph) shall be included in all copies or substantial portions
|
|
* of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
|
|
* THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
|
|
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
* USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
*
|
|
**************************************************************************/
|
|
/*
|
|
* Authors:
|
|
* Thomas Hellstrom <thomas-at-tungstengraphics-dot-com>
|
|
*/
|
|
|
|
#ifndef _DRM_MM_H_
|
|
#define _DRM_MM_H_
|
|
|
|
/*
|
|
* Generic range manager structs
|
|
*/
|
|
#include <linux/list.h>
|
|
#ifdef CONFIG_DEBUG_FS
|
|
#include <linux/seq_file.h>
|
|
#endif
|
|
|
|
struct drm_mm_node {
|
|
struct list_head free_stack;
|
|
struct list_head node_list;
|
|
unsigned free : 1;
|
|
unsigned scanned_block : 1;
|
|
unsigned scanned_prev_free : 1;
|
|
unsigned scanned_next_free : 1;
|
|
unsigned long start;
|
|
unsigned long size;
|
|
struct drm_mm *mm;
|
|
};
|
|
|
|
struct drm_mm {
|
|
/* List of free memory blocks, most recently freed ordered. */
|
|
struct list_head free_stack;
|
|
/* List of all memory nodes, ordered according to the (increasing) start
|
|
* address of the memory node. */
|
|
struct list_head node_list;
|
|
struct list_head unused_nodes;
|
|
int num_unused;
|
|
spinlock_t unused_lock;
|
|
unsigned scan_alignment;
|
|
unsigned long scan_size;
|
|
unsigned long scan_hit_start;
|
|
unsigned scan_hit_size;
|
|
unsigned scanned_blocks;
|
|
};
|
|
|
|
/*
|
|
* Basic range manager support (drm_mm.c)
|
|
*/
|
|
extern struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node,
|
|
unsigned long size,
|
|
unsigned alignment,
|
|
int atomic);
|
|
extern struct drm_mm_node *drm_mm_get_block_range_generic(
|
|
struct drm_mm_node *node,
|
|
unsigned long size,
|
|
unsigned alignment,
|
|
unsigned long start,
|
|
unsigned long end,
|
|
int atomic);
|
|
static inline struct drm_mm_node *drm_mm_get_block(struct drm_mm_node *parent,
|
|
unsigned long size,
|
|
unsigned alignment)
|
|
{
|
|
return drm_mm_get_block_generic(parent, size, alignment, 0);
|
|
}
|
|
static inline struct drm_mm_node *drm_mm_get_block_atomic(struct drm_mm_node *parent,
|
|
unsigned long size,
|
|
unsigned alignment)
|
|
{
|
|
return drm_mm_get_block_generic(parent, size, alignment, 1);
|
|
}
|
|
static inline struct drm_mm_node *drm_mm_get_block_range(
|
|
struct drm_mm_node *parent,
|
|
unsigned long size,
|
|
unsigned alignment,
|
|
unsigned long start,
|
|
unsigned long end)
|
|
{
|
|
return drm_mm_get_block_range_generic(parent, size, alignment,
|
|
start, end, 0);
|
|
}
|
|
static inline struct drm_mm_node *drm_mm_get_block_atomic_range(
|
|
struct drm_mm_node *parent,
|
|
unsigned long size,
|
|
unsigned alignment,
|
|
unsigned long start,
|
|
unsigned long end)
|
|
{
|
|
return drm_mm_get_block_range_generic(parent, size, alignment,
|
|
start, end, 1);
|
|
}
|
|
extern void drm_mm_put_block(struct drm_mm_node *cur);
|
|
extern struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm,
|
|
unsigned long size,
|
|
unsigned alignment,
|
|
int best_match);
|
|
extern struct drm_mm_node *drm_mm_search_free_in_range(
|
|
const struct drm_mm *mm,
|
|
unsigned long size,
|
|
unsigned alignment,
|
|
unsigned long start,
|
|
unsigned long end,
|
|
int best_match);
|
|
extern int drm_mm_init(struct drm_mm *mm, unsigned long start,
|
|
unsigned long size);
|
|
extern void drm_mm_takedown(struct drm_mm *mm);
|
|
extern int drm_mm_clean(struct drm_mm *mm);
|
|
extern unsigned long drm_mm_tail_space(struct drm_mm *mm);
|
|
extern int drm_mm_remove_space_from_tail(struct drm_mm *mm,
|
|
unsigned long size);
|
|
extern int drm_mm_add_space_to_tail(struct drm_mm *mm,
|
|
unsigned long size, int atomic);
|
|
extern int drm_mm_pre_get(struct drm_mm *mm);
|
|
|
|
static inline struct drm_mm *drm_get_mm(struct drm_mm_node *block)
|
|
{
|
|
return block->mm;
|
|
}
|
|
|
|
void drm_mm_init_scan(struct drm_mm *mm, unsigned long size,
|
|
unsigned alignment);
|
|
int drm_mm_scan_add_block(struct drm_mm_node *node);
|
|
int drm_mm_scan_remove_block(struct drm_mm_node *node);
|
|
|
|
extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);
|
|
#ifdef CONFIG_DEBUG_FS
|
|
int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm);
|
|
#endif
|
|
|
|
#endif
|