[PATCH 2/9] drm: use list_for_each_entry in drm_mm.c

2010-05-19 Thread Daniel Vetter 
Signed-off-by: Daniel Vetter 
---
 drivers/gpu/drm/drm_mm.c |8 ++--
 1 files changed, 2 insertions(+), 6 deletions(-)

diff --git a/drivers/gpu/drm/drm_mm.c b/drivers/gpu/drm/drm_mm.c
index 2ac074c..b75eb55 100644
--- a/drivers/gpu/drm/drm_mm.c
+++ b/drivers/gpu/drm/drm_mm.c
@@ -332,7 +332,6 @@ struct drm_mm_node *drm_mm_search_free(const struct drm_mm 
*mm,
   unsigned long size,
   unsigned alignment, int best_match)
 {
-   struct list_head *list;
const struct list_head *free_stack = >fl_entry;
struct drm_mm_node *entry;
struct drm_mm_node *best;
@@ -342,8 +341,7 @@ struct drm_mm_node *drm_mm_search_free(const struct drm_mm 
*mm,
best = NULL;
best_size = ~0UL;

-   list_for_each(list, free_stack) {
-   entry = list_entry(list, struct drm_mm_node, fl_entry);
+   list_for_each_entry(entry, free_stack, fl_entry) {
wasted = 0;

if (entry->size < size)
@@ -376,7 +374,6 @@ struct drm_mm_node *drm_mm_search_free_in_range(const 
struct drm_mm *mm,
unsigned long end,
int best_match)
 {
-   struct list_head *list;
const struct list_head *free_stack = >fl_entry;
struct drm_mm_node *entry;
struct drm_mm_node *best;
@@ -386,8 +383,7 @@ struct drm_mm_node *drm_mm_search_free_in_range(const 
struct drm_mm *mm,
best = NULL;
best_size = ~0UL;

-   list_for_each(list, free_stack) {
-   entry = list_entry(list, struct drm_mm_node, fl_entry);
+   list_for_each_entry(entry, free_stack, fl_entry) {
wasted = 0;

if (entry->size < size)
-- 
1.7.1

[PATCH 2/9] drm: use list_for_each_entry in drm_mm.c

2010-05-18 Thread Daniel Vetter 
Signed-off-by: Daniel Vetter daniel.vet...@ffwll.ch
---
 drivers/gpu/drm/drm_mm.c |8 ++--
 1 files changed, 2 insertions(+), 6 deletions(-)

diff --git a/drivers/gpu/drm/drm_mm.c b/drivers/gpu/drm/drm_mm.c
index 2ac074c..b75eb55 100644
--- a/drivers/gpu/drm/drm_mm.c
+++ b/drivers/gpu/drm/drm_mm.c
@@ -332,7 +332,6 @@ struct drm_mm_node *drm_mm_search_free(const struct drm_mm 
*mm,
   unsigned long size,
   unsigned alignment, int best_match)
 {
-   struct list_head *list;
const struct list_head *free_stack = mm-fl_entry;
struct drm_mm_node *entry;
struct drm_mm_node *best;
@@ -342,8 +341,7 @@ struct drm_mm_node *drm_mm_search_free(const struct drm_mm 
*mm,
best = NULL;
best_size = ~0UL;
 
-   list_for_each(list, free_stack) {
-   entry = list_entry(list, struct drm_mm_node, fl_entry);
+   list_for_each_entry(entry, free_stack, fl_entry) {
wasted = 0;
 
if (entry-size  size)
@@ -376,7 +374,6 @@ struct drm_mm_node *drm_mm_search_free_in_range(const 
struct drm_mm *mm,
unsigned long end,
int best_match)
 {
-   struct list_head *list;
const struct list_head *free_stack = mm-fl_entry;
struct drm_mm_node *entry;
struct drm_mm_node *best;
@@ -386,8 +383,7 @@ struct drm_mm_node *drm_mm_search_free_in_range(const 
struct drm_mm *mm,
best = NULL;
best_size = ~0UL;
 
-   list_for_each(list, free_stack) {
-   entry = list_entry(list, struct drm_mm_node, fl_entry);
+   list_for_each_entry(entry, free_stack, fl_entry) {
wasted = 0;
 
if (entry-size  size)
-- 
1.7.1

___
dri-devel mailing list
dri-devel@lists.freedesktop.org
http://lists.freedesktop.org/mailman/listinfo/dri-devel