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 "metadata/sgen-gc.h"
21 #include "metadata/sgen-pointer-queue.h"
26 sgen_pointer_queue_clear (SgenPointerQueue *queue)
32 realloc_queue (SgenPointerQueue *queue)
34 size_t new_size = queue->size ? queue->size + queue->size/2 : 1024;
35 void **new_data = sgen_alloc_internal_dynamic (sizeof (void*) * new_size, INTERNAL_MEM_PIN_QUEUE, TRUE);
36 memcpy (new_data, queue->data, sizeof (void*) * queue->next_slot);
37 sgen_free_internal_dynamic (queue->data, sizeof (void*) * queue->size, INTERNAL_MEM_PIN_QUEUE);
38 queue->data = new_data;
39 queue->size = new_size;
40 SGEN_LOG (4, "Reallocated pointer queue to size: %lu", new_size);
44 sgen_pointer_queue_add (SgenPointerQueue *queue, void *ptr)
46 if (queue->next_slot >= queue->size)
47 realloc_queue (queue);
49 queue->data [queue->next_slot++] = ptr;
53 sgen_pointer_queue_search (SgenPointerQueue *queue, void *addr)
55 size_t first = 0, last = queue->next_slot;
56 while (first < last) {
57 size_t middle = first + ((last - first) >> 1);
58 if (addr <= queue->data [middle])
63 g_assert (first == last);
68 * Removes all NULL pointers from the queue.
71 sgen_pointer_queue_remove_nulls (SgenPointerQueue *queue)
73 void **start, **cur, **end;
74 start = cur = queue->data;
75 end = queue->data + queue->next_slot;
82 queue->next_slot = start - queue->data;
86 * Sorts the pointers in the queue, then removes duplicates.
89 sgen_pointer_queue_sort_uniq (SgenPointerQueue *queue)
91 void **start, **cur, **end;
92 /* sort and uniq pin_queue: we just sort and we let the rest discard multiple values */
93 /* it may be better to keep ranges of pinned memory instead of individually pinning objects */
94 SGEN_LOG (5, "Sorting pointer queue, size: %lu", queue->next_slot);
95 if (queue->next_slot > 1)
96 sgen_sort_addresses (queue->data, queue->next_slot);
97 start = cur = queue->data;
98 end = queue->data + queue->next_slot;
101 while (cur < end && *start == *cur)
105 queue->next_slot = start - queue->data;
106 SGEN_LOG (5, "Pointer queue reduced to size: %lu", queue->next_slot);
110 * Does a linear search through the pointer queue to find `ptr`. Returns the index if
111 * found, otherwise (size_t)-1.
114 sgen_pointer_queue_find (SgenPointerQueue *queue, void *ptr)
117 for (i = 0; i < queue->next_slot; ++i)
118 if (queue->data [i] == ptr)