adg/adg-primitive.c

   1 /* ADG - Automatic Drawing Generation
   2  * Copyright (C) 2007,2008,2009 Nicola Fontana <ntd at entidi.it>
   3  *
   4  * This library is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU Lesser General Public
   6  * License as published by the Free Software Foundation; either
   7  * version 2 of the License, or (at your option) any later version.
   8  *
   9  * This library is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * Lesser General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU Lesser General Public
  15  * License along with this library; if not, write to the
  16  * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  17  * Boston, MA  02110-1301, USA.
  18  */
  19
  20
  21 /**
  22  * SECTION:adg-primitive
  23  * @Section_Id:AdgPrimitive
  24  * @title: AdgPrimitive
  25  * @short_description: A wrapper for #CpmlPrimitive
  26  *
  27  * AdgPrimitive is a wrapper in #GType syntax of the #CpmlPrimitive struct.
  28  **/
  29
  30 /**
  31  * AdgPrimitive:
  32  *
  33  * Another name for #CpmlPrimitive: check its documentation for the
  34  * fields description and visibility details.
  35  **/
  36
  37
  38 #include "adg-primitive.h"
  39
  40 #include <string.h>
  41
  42
  43 GType
  44 adg_primitive_get_type(void)
  45 {
  46     static int primitive_type = 0;
  47
  48     if (G_UNLIKELY(primitive_type == 0))
  49         primitive_type = g_boxed_type_register_static("AdgPrimitive",
  50                                                       (GBoxedCopyFunc) adg_primitive_dup,
  51                                                       g_free);
  52
  53     return primitive_type;
  54 }
  55
  56 /**
  57  * adg_primitive_dup:
  58  * @primitive: an #AdgPrimitive structure
  59  *
  60  * Duplicates @primitive. This function makes a shallow duplication of
  61  * @primitives, that is the internal pointers of the resulting primitive
  62  * struct refer to the same memory as the original @primitive. Check
  63  * out adg_primitive_deep_dup() if it is required also the content
  64  * duplication.
  65  *
  66  * Returns: a shallow duplicate of @primitive: must be freed
  67  *          with g_free() when no longer needed.
  68  **/
  69 AdgPrimitive *
  70 adg_primitive_dup(const AdgPrimitive *primitive)
  71 {
  72     return g_memdup(primitive, sizeof(AdgPrimitive));
  73 }
  74
  75 /**
  76  * adg_primitive_deep_dup:
  77  * @primitive: an #AdgPrimitive structure
  78  *
  79  * Duplicates @primitive. This function makes a deep duplication of
  80  * @primitive, that is it duplicates also the definition data (both
  81  * <structfield>org</structfield> and <structfield>data</structfield>).
  82  *
  83  * Furthermore, the new <structfield>segment</structfield> field will
  84  * point to a fake duplicated segment with only its first primitive
  85  * set (the first primitive of a segment should be a %CAIRO_PATH_MOVE_TO).
  86  * This is needed in order to let a %CAIRO_PATH_CLOSE_PATH work as
  87  * expected.
  88  *
  89  * All the data is allocated in the same chunk of memory so freeing
  90  * the returned pointer releases all the occupied memory.
  91  *
  92  * Returns: a deep duplicate of @primitive: must be freed
  93  *          with g_free() when no longer needed.
  94  **/
  95 AdgPrimitive *
  96 adg_primitive_deep_dup(const AdgPrimitive *primitive)
  97 {
  98     const AdgPrimitive *src;
  99     AdgPrimitive *dst;
 100     gsize primitive_size, org_size, data_size, segment_size;
 101     gchar *ptr;
 102
 103     src = primitive;
 104     primitive_size = sizeof(AdgPrimitive);
 105
 106     if (src->org != NULL)
 107         org_size = sizeof(cairo_path_data_t);
 108     else
 109         org_size = 0;
 110
 111     if (src->data != NULL)
 112         data_size = sizeof(cairo_path_data_t) * src->data->header.length;
 113     else
 114         data_size = 0;
 115
 116     if (src->segment != NULL && src->segment->data != NULL)
 117         segment_size = sizeof(CpmlSegment) +
 118             sizeof(cairo_path_data_t) * src->segment->data[0].header.length;
 119     else
 120         segment_size = 0;
 121
 122     dst = g_malloc(primitive_size + org_size + data_size + segment_size);
 123     ptr = (gchar *) dst + primitive_size;
 124
 125     if (org_size > 0) {
 126         dst->org = memcpy(ptr, src->org, org_size);
 127         ptr += org_size;
 128     } else {
 129         dst->org = NULL;
 130     }
 131
 132     if (data_size > 0) {
 133         dst->data = memcpy(ptr, src->data, data_size);
 134         ptr += data_size;
 135     } else {
 136         dst->data = NULL;
 137     }
 138
 139     if (segment_size > 0) {
 140         dst->segment = memcpy(ptr, src->segment, sizeof(CpmlSegment));
 141         ptr += sizeof(CpmlSegment);
 142         dst->segment->data = memcpy(ptr, src->segment->data,
 143                                     sizeof(cairo_path_data_t) *
 144                                     src->segment->data[0].header.length);
 145     } else {
 146         dst->segment = NULL;
 147     }
 148
 149     return dst;
 150 }