mono/metadata/mono-ptr-array.h

   1 /*
   2  * mono-ptr-array.h: GC aware equivalente of g_ptr_array
   3  *
   4  * Author:
   5  *      Rodrigo Kumpera  <rkumpera@novell.com>
   6  *
   7  * (C) 2010 Novell, Inc
   8  */
   9
  10 #ifndef __MONO_PTR_ARRAY_H__
  11 #define __MONO_PTR_ARRAY_H__
  12
  13
  14 #include <glib.h>
  15
  16 #include "mono/metadata/gc-internals.h"
  17
  18 /* This is an implementation of a growable pointer array that avoids doing memory allocations for small sizes.
  19  * It works by allocating an initial small array on stack and only going to gc tracked memory if needed.
  20  * The array elements are assumed to be object references.
  21  */
  22 typedef struct {
  23         void **data;
  24         int size;
  25         int capacity;
  26         MonoGCRootSource source;
  27         const char *msg;
  28 } MonoPtrArray;
  29
  30 #define MONO_PTR_ARRAY_MAX_ON_STACK (16)
  31
  32 #define mono_ptr_array_init(ARRAY, INITIAL_SIZE, SOURCE, MSG) do {\
  33         (ARRAY).size = 0; \
  34         (ARRAY).capacity = MAX (INITIAL_SIZE, MONO_PTR_ARRAY_MAX_ON_STACK); \
  35         (ARRAY).source = SOURCE; \
  36         (ARRAY).msg = MSG; \
  37         (ARRAY).data = INITIAL_SIZE > MONO_PTR_ARRAY_MAX_ON_STACK \
  38                 ? (void **)mono_gc_alloc_fixed (sizeof (void*) * INITIAL_SIZE, mono_gc_make_root_descr_all_refs (INITIAL_SIZE), SOURCE, MSG) \
  39                 : g_newa (void*, MONO_PTR_ARRAY_MAX_ON_STACK); \
  40 } while (0)
  41
  42 #define mono_ptr_array_destroy(ARRAY) do {\
  43         if ((ARRAY).capacity > MONO_PTR_ARRAY_MAX_ON_STACK) \
  44                 mono_gc_free_fixed ((ARRAY).data); \
  45 } while (0)
  46
  47 #define mono_ptr_array_append(ARRAY, VALUE) do { \
  48         if ((ARRAY).size >= (ARRAY).capacity) {\
  49         void **__tmp = (void **)mono_gc_alloc_fixed (sizeof (void*) * (ARRAY).capacity * 2, mono_gc_make_root_descr_all_refs ((ARRAY).capacity * 2), (ARRAY).source, (ARRAY).msg); \
  50                 mono_gc_memmove_aligned ((void *)__tmp, (ARRAY).data, (ARRAY).capacity * sizeof (void*)); \
  51                 if ((ARRAY).capacity > MONO_PTR_ARRAY_MAX_ON_STACK)     \
  52                         mono_gc_free_fixed ((ARRAY).data);      \
  53                 (ARRAY).data = __tmp;   \
  54                 (ARRAY).capacity *= 2;\
  55         }\
  56         ((ARRAY).data [(ARRAY).size++] = VALUE); \
  57 } while (0)
  58
  59 #define mono_ptr_array_sort(ARRAY, COMPARE_FUNC) do { \
  60         qsort ((ARRAY).data, (ARRAY).size, sizeof (gpointer), (COMPARE_FUNC)); \
  61 } while (0)
  62
  63 #define mono_ptr_array_set(ARRAY, IDX, VALUE) do { \
  64         ((ARRAY).data [(IDX)] = VALUE); \
  65 } while (0)
  66
  67 #define mono_ptr_array_get(ARRAY, IDX) ((ARRAY).data [(IDX)])
  68
  69 #define mono_ptr_array_size(ARRAY) ((ARRAY).size)
  70
  71 #define mono_ptr_array_reset(ARRAY) do { \
  72         (ARRAY).size = 0; \
  73 } while (0)
  74
  75 #define mono_ptr_array_clear(ARRAY) do { \
  76         (ARRAY).size = 0; \
  77         mono_gc_bzero_aligned ((ARRAY).data, (ARRAY).capacity * sizeof (void*)); \
  78 } while (0)
  79
  80 #endif