1 /*
2 * Copyright 2011 Tom Stellard <tstellar@gmail.com>
3 *
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining
7 * a 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, sublicense, 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:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial
16 * portions of the Software.
17 *
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
19 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
21 * IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
22 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
23 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
24 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 */
27
28 #include "radeon_list.h"
29
30 #include <stdlib.h>
31 #include <stdio.h>
32
33 #include "memory_pool.h"
34
rc_list(struct memory_pool * pool,void * item)35 struct rc_list * rc_list(struct memory_pool * pool, void * item)
36 {
37 struct rc_list * new = memory_pool_malloc(pool, sizeof(struct rc_list));
38 new->Item = item;
39 new->Next = NULL;
40 new->Prev = NULL;
41
42 return new;
43 }
44
rc_list_add(struct rc_list ** list,struct rc_list * new_value)45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value)
46 {
47 struct rc_list * temp;
48
49 if (*list == NULL) {
50 *list = new_value;
51 return;
52 }
53
54 for (temp = *list; temp->Next; temp = temp->Next);
55
56 temp->Next = new_value;
57 new_value->Prev = temp;
58 }
59
rc_list_remove(struct rc_list ** list,struct rc_list * rm_value)60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value)
61 {
62 if (*list == rm_value) {
63 *list = rm_value->Next;
64 return;
65 }
66
67 rm_value->Prev->Next = rm_value->Next;
68 if (rm_value->Next) {
69 rm_value->Next->Prev = rm_value->Prev;
70 }
71 }
72
rc_list_count(struct rc_list * list)73 unsigned int rc_list_count(struct rc_list * list)
74 {
75 unsigned int count = 0;
76 while (list) {
77 count++;
78 list = list->Next;
79 }
80 return count;
81 }
82
rc_list_print(struct rc_list * list)83 void rc_list_print(struct rc_list * list)
84 {
85 while(list) {
86 fprintf(stderr, "%p->", list->Item);
87 list = list->Next;
88 }
89 fprintf(stderr, "\n");
90 }
91