/
mono-mlist.c
219 lines (203 loc) · 4.5 KB
/
mono-mlist.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
/*
* mono-mlist.c: Managed object list implementation
*
* Author:
* Paolo Molaro (lupus@ximian.com)
*
* Copyright 2006-2009 Novell, Inc (http://www.novell.com)
*/
#include "mono/metadata/mono-mlist.h"
#include "mono/metadata/appdomain.h"
#include "mono/metadata/class-internals.h"
/* matches the System.MonoListItem object*/
struct _MonoMList {
MonoObject object;
MonoMList *next;
MonoObject *data;
};
/*
* note: we only allocate in the root domain: this lists are
* not exposed to managed code
*/
static MonoVTable *monolist_item_vtable = NULL;
/**
* mono_mlist_alloc:
* @data: object to use as data
*
* Allocates a new managed list node with @data as the contents.
* A managed list node also represents a singly-linked list.
* Managed lists are garbage collected, so there is no free routine
* and the user is required to keep references to the managed list
* to prevent it from being garbage collected.
*/
MonoMList*
mono_mlist_alloc (MonoObject *data)
{
MonoMList* res;
if (!monolist_item_vtable) {
MonoClass *klass = mono_class_from_name (mono_defaults.corlib, "System", "MonoListItem");
monolist_item_vtable = mono_class_vtable (mono_get_root_domain (), klass);
g_assert (monolist_item_vtable);
}
res = (MonoMList*)mono_object_new_fast (monolist_item_vtable);
MONO_OBJECT_SETREF (res, data, data);
return res;
}
/**
* mono_mlist_get_data:
* @list: the managed list node
*
* Get the object stored in the list node @list.
*/
MonoObject*
mono_mlist_get_data (MonoMList* list)
{
return list->data;
}
/**
* mono_mlist_set_data:
* @list: the managed list node
*
* Set the object content in the list node @list.
*/
void
mono_mlist_set_data (MonoMList* list, MonoObject *data)
{
MONO_OBJECT_SETREF (list, data, data);
}
/**
* mono_mlist_set_next:
* @list: a managed list node
* @next: list node that will be next for the @list node.
*
* Set next node for @list to @next.
*/
MonoMList *
mono_mlist_set_next (MonoMList* list, MonoMList *next)
{
if (!list)
return next;
MONO_OBJECT_SETREF (list, next, next);
return list;
}
/**
* mono_mlist_length:
* @list: the managed list
*
* Get the number of items in the list @list.
* Since managed lists are singly-linked, this operation takes O(n) time.
*/
int
mono_mlist_length (MonoMList* list)
{
int len = 0;
while (list) {
list = list->next;
++len;
}
return len;
}
/**
* mono_mlist_next:
* @list: the managed list node
*
* Returns the next managed list node starting from @list.
*/
MonoMList*
mono_mlist_next (MonoMList* list)
{
return list->next;
}
/**
* mono_mlist_last:
* @list: the managed list node
*
* Returns the last managed list node in list @list.
* Since managed lists are singly-linked, this operation takes O(n) time.
*/
MonoMList*
mono_mlist_last (MonoMList* list)
{
if (list) {
while (list->next)
list = list->next;
return list;
}
return NULL;
}
/**
* mono_mlist_prepend:
* @list: the managed list
* @data: the object to add to the list
*
* Allocate a new list node with @data as content and prepend it
* to the list @list. @list can be NULL.
*/
MonoMList*
mono_mlist_prepend (MonoMList* list, MonoObject *data)
{
MonoMList* res = mono_mlist_alloc (data);
if (list)
MONO_OBJECT_SETREF (res, next, list);
return res;
}
/**
* mono_mlist_append:
* @list: the managed list
* @data: the object to add to the list
*
* Allocate a new list node with @data as content and append it
* to the list @list. @list can be NULL.
* Since managed lists are singly-linked, this operation takes O(n) time.
*/
MonoMList*
mono_mlist_append (MonoMList* list, MonoObject *data)
{
MonoMList* res = mono_mlist_alloc (data);
if (list) {
MonoMList* last = mono_mlist_last (list);
MONO_OBJECT_SETREF (last, next, res);
return list;
} else {
return res;
}
}
static MonoMList*
find_prev (MonoMList* list, MonoMList *item)
{
MonoMList* prev = NULL;
while (list) {
if (list == item)
break;
prev = list;
list = list->next;
}
return prev;
}
/**
* mono_mlist_remove_item:
* @list: the managed list
* @data: the object to remove from the list
*
* Remove the list node @item from the managed list @list.
* Since managed lists are singly-linked, this operation can take O(n) time.
*/
MonoMList*
mono_mlist_remove_item (MonoMList* list, MonoMList *item)
{
MonoMList* prev;
if (list == item) {
list = item->next;
item->next = NULL;
return list;
}
prev = find_prev (list, item);
if (prev) {
MONO_OBJECT_SETREF (prev, next, item->next);
item->next = NULL;
return list;
} else {
/* not found */
return list;
}
}