2 * sgen-pointer-queue.c: A pointer queue that can be sorted.
4 * Copyright (C) 2014 Xamarin Inc
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Library General Public
8 * License 2.0 as published by the Free Software Foundation;
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Library General Public License for more details.
15 * You should have received a copy of the GNU Library General Public
16 * License 2.0 along with this library; if not, write to the Free
17 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 #include "utils/mono-compiler.h"
21 #include "metadata/sgen-gc.h"
22 #include "metadata/sgen-pointer-queue.h"
27 sgen_pointer_queue_clear (SgenPointerQueue *queue)
33 sgen_pointer_queue_init (SgenPointerQueue *queue, int mem_type)
38 queue->mem_type = mem_type;
42 realloc_queue (SgenPointerQueue *queue)
44 size_t new_size = queue->size ? queue->size + queue->size/2 : 1024;
45 void **new_data = sgen_alloc_internal_dynamic (sizeof (void*) * new_size, queue->mem_type, TRUE);
47 memcpy (new_data, queue->data, sizeof (void*) * queue->next_slot);
48 sgen_free_internal_dynamic (queue->data, sizeof (void*) * queue->size, queue->mem_type);
49 queue->data = new_data;
50 queue->size = new_size;
51 SGEN_LOG (4, "Reallocated pointer queue to size: %lu", new_size);
55 sgen_pointer_queue_will_grow (SgenPointerQueue *queue)
57 return queue->next_slot >= queue->size;
61 sgen_pointer_queue_add (SgenPointerQueue *queue, void *ptr)
63 if (sgen_pointer_queue_will_grow (queue))
64 realloc_queue (queue);
66 queue->data [queue->next_slot++] = ptr;
70 sgen_pointer_queue_pop (SgenPointerQueue *queue)
72 g_assert (queue->next_slot);
74 return queue->data [--queue->next_slot];
78 sgen_pointer_queue_search (SgenPointerQueue *queue, void *addr)
80 size_t first = 0, last = queue->next_slot;
81 while (first < last) {
82 size_t middle = first + ((last - first) >> 1);
83 if (addr <= queue->data [middle])
88 g_assert (first == last);
93 * Removes all NULL pointers from the queue.
96 sgen_pointer_queue_remove_nulls (SgenPointerQueue *queue)
98 void **start, **cur, **end;
99 start = cur = queue->data;
100 end = queue->data + queue->next_slot;
107 queue->next_slot = start - queue->data;
111 * Sorts the pointers in the queue, then removes duplicates.
114 sgen_pointer_queue_sort_uniq (SgenPointerQueue *queue)
116 void **start, **cur, **end;
117 /* sort and uniq pin_queue: we just sort and we let the rest discard multiple values */
118 /* it may be better to keep ranges of pinned memory instead of individually pinning objects */
119 SGEN_LOG (5, "Sorting pointer queue, size: %lu", queue->next_slot);
120 if (queue->next_slot > 1)
121 sgen_sort_addresses (queue->data, queue->next_slot);
122 start = cur = queue->data;
123 end = queue->data + queue->next_slot;
126 while (cur < end && *start == *cur)
130 queue->next_slot = start - queue->data;
131 SGEN_LOG (5, "Pointer queue reduced to size: %lu", queue->next_slot);
135 * Does a linear search through the pointer queue to find `ptr`. Returns the index if
136 * found, otherwise (size_t)-1.
139 sgen_pointer_queue_find (SgenPointerQueue *queue, void *ptr)
142 for (i = 0; i < queue->next_slot; ++i)
143 if (queue->data [i] == ptr)
149 sgen_pointer_queue_is_empty (SgenPointerQueue *queue)
151 return !queue->next_slot;
155 sgen_pointer_queue_free (SgenPointerQueue *queue)
157 sgen_free_internal_dynamic (queue->data, sizeof (void*) * queue->size, queue->mem_type);