drm/nouveau: ratelimit IRQ messages
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / include / drm / drm_mm.h
blobbf01531193d530640bbdedb69c86d49d14c81ea0
1 /**************************************************************************
3 * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA.
4 * All Rights Reserved.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * of the Software.
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
21 * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
22 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
23 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
24 * USE OR OTHER DEALINGS IN THE SOFTWARE.
27 **************************************************************************/
29 * Authors:
30 * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com>
33 #ifndef _DRM_MM_H_
34 #define _DRM_MM_H_
37 * Generic range manager structs
39 #include <linux/list.h>
40 #ifdef CONFIG_DEBUG_FS
41 #include <linux/seq_file.h>
42 #endif
44 struct drm_mm_node {
45 struct list_head free_stack;
46 struct list_head node_list;
47 unsigned free : 1;
48 unsigned scanned_block : 1;
49 unsigned scanned_prev_free : 1;
50 unsigned scanned_next_free : 1;
51 unsigned long start;
52 unsigned long size;
53 struct drm_mm *mm;
56 struct drm_mm {
57 /* List of free memory blocks, most recently freed ordered. */
58 struct list_head free_stack;
59 /* List of all memory nodes, ordered according to the (increasing) start
60 * address of the memory node. */
61 struct list_head node_list;
62 struct list_head unused_nodes;
63 int num_unused;
64 spinlock_t unused_lock;
65 unsigned scan_alignment;
66 unsigned long scan_size;
67 unsigned long scan_hit_start;
68 unsigned scan_hit_size;
69 unsigned scanned_blocks;
73 * Basic range manager support (drm_mm.c)
75 extern struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node,
76 unsigned long size,
77 unsigned alignment,
78 int atomic);
79 extern struct drm_mm_node *drm_mm_get_block_range_generic(
80 struct drm_mm_node *node,
81 unsigned long size,
82 unsigned alignment,
83 unsigned long start,
84 unsigned long end,
85 int atomic);
86 static inline struct drm_mm_node *drm_mm_get_block(struct drm_mm_node *parent,
87 unsigned long size,
88 unsigned alignment)
90 return drm_mm_get_block_generic(parent, size, alignment, 0);
92 static inline struct drm_mm_node *drm_mm_get_block_atomic(struct drm_mm_node *parent,
93 unsigned long size,
94 unsigned alignment)
96 return drm_mm_get_block_generic(parent, size, alignment, 1);
98 static inline struct drm_mm_node *drm_mm_get_block_range(
99 struct drm_mm_node *parent,
100 unsigned long size,
101 unsigned alignment,
102 unsigned long start,
103 unsigned long end)
105 return drm_mm_get_block_range_generic(parent, size, alignment,
106 start, end, 0);
108 static inline struct drm_mm_node *drm_mm_get_block_atomic_range(
109 struct drm_mm_node *parent,
110 unsigned long size,
111 unsigned alignment,
112 unsigned long start,
113 unsigned long end)
115 return drm_mm_get_block_range_generic(parent, size, alignment,
116 start, end, 1);
118 extern void drm_mm_put_block(struct drm_mm_node *cur);
119 extern struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm,
120 unsigned long size,
121 unsigned alignment,
122 int best_match);
123 extern struct drm_mm_node *drm_mm_search_free_in_range(
124 const struct drm_mm *mm,
125 unsigned long size,
126 unsigned alignment,
127 unsigned long start,
128 unsigned long end,
129 int best_match);
130 extern int drm_mm_init(struct drm_mm *mm, unsigned long start,
131 unsigned long size);
132 extern void drm_mm_takedown(struct drm_mm *mm);
133 extern int drm_mm_clean(struct drm_mm *mm);
134 extern unsigned long drm_mm_tail_space(struct drm_mm *mm);
135 extern int drm_mm_remove_space_from_tail(struct drm_mm *mm,
136 unsigned long size);
137 extern int drm_mm_add_space_to_tail(struct drm_mm *mm,
138 unsigned long size, int atomic);
139 extern int drm_mm_pre_get(struct drm_mm *mm);
141 static inline struct drm_mm *drm_get_mm(struct drm_mm_node *block)
143 return block->mm;
146 void drm_mm_init_scan(struct drm_mm *mm, unsigned long size,
147 unsigned alignment);
148 int drm_mm_scan_add_block(struct drm_mm_node *node);
149 int drm_mm_scan_remove_block(struct drm_mm_node *node);
151 extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix);
152 #ifdef CONFIG_DEBUG_FS
153 int drm_mm_dump_table(struct seq_file *m, struct drm_mm *mm);
154 #endif
156 #endif