2 * Copyright © 2009, 2010 Codethink Limited
3 * Copyright © 2011 Collabora Ltd.
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the licence, or (at your option) any later version.
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 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
18 * Author: Ryan Lortie <desrt@desrt.ca>
19 * Stef Walter <stefw@collabora.co.uk>
26 #include <glib/garray.h>
27 #include <glib/gstrfuncs.h>
28 #include <glib/gatomic.h>
29 #include <glib/gslice.h>
30 #include <glib/gtestutils.h>
31 #include <glib/gmem.h>
32 #include <glib/gmessages.h>
39 * A simple refcounted data type representing an immutable sequence of zero or
40 * more bytes from an unspecified origin.
42 * The purpose of a #GBytes is to keep the memory region that it holds
43 * alive for as long as anyone holds a reference to the bytes. When
44 * the last reference count is dropped, the memory is released. Multiple
45 * unrelated callers can use byte data in the #GBytes without coordinating
46 * their activities, resting assured that the byte data will not change or
47 * move while they hold a reference.
49 * A #GBytes can come from many different origins that may have
50 * different procedures for freeing the memory region. Examples are
51 * memory from g_malloc(), from memory slices, from a #GMappedFile or
52 * memory from other allocators.
54 * #GBytes work well as keys in #GHashTable. Use g_bytes_equal() and
55 * g_bytes_hash() as parameters to g_hash_table_new() or g_hash_table_new_full().
56 * #GBytes can also be used as keys in a #GTree by passing the g_bytes_compare()
57 * function to g_tree_new().
59 * The data pointed to by this bytes must not be modified. For a mutable
60 * array of bytes see #GByteArray. Use g_bytes_unref_to_array() to create a
61 * mutable array for a #GBytes sequence. To create an immutable #GBytes from
62 * a mutable #GByteArray, use the g_byte_array_free_to_bytes() function.
69 gconstpointer data
; /* may be NULL iff (size == 0) */
70 gsize size
; /* may be 0 */
72 GDestroyNotify free_func
;
78 * @data: (transfer none) (array length=size) (element-type guint8) (nullable):
79 * the data to be used for the bytes
80 * @size: the size of @data
82 * Creates a new #GBytes from @data.
84 * @data is copied. If @size is 0, @data may be %NULL.
86 * Returns: (transfer full): a new #GBytes
91 g_bytes_new (gconstpointer data
,
94 g_return_val_if_fail (data
!= NULL
|| size
== 0, NULL
);
96 return g_bytes_new_take (g_memdup (data
, size
), size
);
101 * @data: (transfer full) (array length=size) (element-type guint8) (nullable):
102 the data to be used for the bytes
103 * @size: the size of @data
105 * Creates a new #GBytes from @data.
107 * After this call, @data belongs to the bytes and may no longer be
108 * modified by the caller. g_free() will be called on @data when the
109 * bytes is no longer in use. Because of this @data must have been created by
110 * a call to g_malloc(), g_malloc0() or g_realloc() or by one of the many
111 * functions that wrap these calls (such as g_new(), g_strdup(), etc).
113 * For creating #GBytes with memory from other allocators, see
114 * g_bytes_new_with_free_func().
116 * @data may be %NULL if @size is 0.
118 * Returns: (transfer full): a new #GBytes
123 g_bytes_new_take (gpointer data
,
126 return g_bytes_new_with_free_func (data
, size
, g_free
, data
);
131 * g_bytes_new_static: (skip)
132 * @data: (transfer full) (array length=size) (element-type guint8) (nullable):
133 the data to be used for the bytes
134 * @size: the size of @data
136 * Creates a new #GBytes from static data.
138 * @data must be static (ie: never modified or freed). It may be %NULL if @size
141 * Returns: (transfer full): a new #GBytes
146 g_bytes_new_static (gconstpointer data
,
149 return g_bytes_new_with_free_func (data
, size
, NULL
, NULL
);
153 * g_bytes_new_with_free_func: (skip)
154 * @data: (array length=size) (element-type guint8) (nullable):
155 the data to be used for the bytes
156 * @size: the size of @data
157 * @free_func: the function to call to release the data
158 * @user_data: data to pass to @free_func
160 * Creates a #GBytes from @data.
162 * When the last reference is dropped, @free_func will be called with the
163 * @user_data argument.
165 * @data must not be modified after this call is made until @free_func has
166 * been called to indicate that the bytes is no longer in use.
168 * @data may be %NULL if @size is 0.
170 * Returns: (transfer full): a new #GBytes
175 g_bytes_new_with_free_func (gconstpointer data
,
177 GDestroyNotify free_func
,
182 g_return_val_if_fail (data
!= NULL
|| size
== 0, NULL
);
184 bytes
= g_slice_new (GBytes
);
187 bytes
->free_func
= free_func
;
188 bytes
->user_data
= user_data
;
189 bytes
->ref_count
= 1;
191 return (GBytes
*)bytes
;
195 * g_bytes_new_from_bytes:
197 * @offset: offset which subsection starts at
198 * @length: length of subsection
200 * Creates a #GBytes which is a subsection of another #GBytes. The @offset +
201 * @length may not be longer than the size of @bytes.
203 * A reference to @bytes will be held by the newly created #GBytes until
204 * the byte data is no longer needed.
206 * Returns: (transfer full): a new #GBytes
211 g_bytes_new_from_bytes (GBytes
*bytes
,
215 /* Note that length may be 0. */
216 g_return_val_if_fail (bytes
!= NULL
, NULL
);
217 g_return_val_if_fail (offset
<= bytes
->size
, NULL
);
218 g_return_val_if_fail (offset
+ length
<= bytes
->size
, NULL
);
220 return g_bytes_new_with_free_func ((gchar
*)bytes
->data
+ offset
, length
,
221 (GDestroyNotify
)g_bytes_unref
, g_bytes_ref (bytes
));
227 * @size: (out) (optional): location to return size of byte data
229 * Get the byte data in the #GBytes. This data should not be modified.
231 * This function will always return the same pointer for a given #GBytes.
233 * %NULL may be returned if @size is 0. This is not guaranteed, as the #GBytes
234 * may represent an empty string with @data non-%NULL and @size as 0. %NULL will
235 * not be returned if @size is non-zero.
237 * Returns: (transfer none) (array length=size) (element-type guint8) (nullable):
238 * a pointer to the byte data, or %NULL
243 g_bytes_get_data (GBytes
*bytes
,
246 g_return_val_if_fail (bytes
!= NULL
, NULL
);
256 * Get the size of the byte data in the #GBytes.
258 * This function will always return the same value for a given #GBytes.
265 g_bytes_get_size (GBytes
*bytes
)
267 g_return_val_if_fail (bytes
!= NULL
, 0);
276 * Increase the reference count on @bytes.
278 * Returns: the #GBytes
283 g_bytes_ref (GBytes
*bytes
)
285 g_return_val_if_fail (bytes
!= NULL
, NULL
);
287 g_atomic_int_inc (&bytes
->ref_count
);
294 * @bytes: (nullable): a #GBytes
296 * Releases a reference on @bytes. This may result in the bytes being
302 g_bytes_unref (GBytes
*bytes
)
307 if (g_atomic_int_dec_and_test (&bytes
->ref_count
))
309 if (bytes
->free_func
!= NULL
)
310 bytes
->free_func (bytes
->user_data
);
311 g_slice_free (GBytes
, bytes
);
317 * @bytes1: (type GLib.Bytes): a pointer to a #GBytes
318 * @bytes2: (type GLib.Bytes): a pointer to a #GBytes to compare with @bytes1
320 * Compares the two #GBytes values being pointed to and returns
321 * %TRUE if they are equal.
323 * This function can be passed to g_hash_table_new() as the @key_equal_func
324 * parameter, when using non-%NULL #GBytes pointers as keys in a #GHashTable.
326 * Returns: %TRUE if the two keys match.
331 g_bytes_equal (gconstpointer bytes1
,
332 gconstpointer bytes2
)
334 const GBytes
*b1
= bytes1
;
335 const GBytes
*b2
= bytes2
;
337 g_return_val_if_fail (bytes1
!= NULL
, FALSE
);
338 g_return_val_if_fail (bytes2
!= NULL
, FALSE
);
340 return b1
->size
== b2
->size
&&
341 memcmp (b1
->data
, b2
->data
, b1
->size
) == 0;
346 * @bytes: (type GLib.Bytes): a pointer to a #GBytes key
348 * Creates an integer hash code for the byte data in the #GBytes.
350 * This function can be passed to g_hash_table_new() as the @key_hash_func
351 * parameter, when using non-%NULL #GBytes pointers as keys in a #GHashTable.
353 * Returns: a hash value corresponding to the key.
358 g_bytes_hash (gconstpointer bytes
)
360 const GBytes
*a
= bytes
;
361 const signed char *p
, *e
;
364 g_return_val_if_fail (bytes
!= NULL
, 0);
366 for (p
= (signed char *)a
->data
, e
= (signed char *)a
->data
+ a
->size
; p
!= e
; p
++)
367 h
= (h
<< 5) + h
+ *p
;
374 * @bytes1: (type GLib.Bytes): a pointer to a #GBytes
375 * @bytes2: (type GLib.Bytes): a pointer to a #GBytes to compare with @bytes1
377 * Compares the two #GBytes values.
379 * This function can be used to sort GBytes instances in lexographical order.
381 * Returns: a negative value if bytes2 is lesser, a positive value if bytes2 is
382 * greater, and zero if bytes2 is equal to bytes1
387 g_bytes_compare (gconstpointer bytes1
,
388 gconstpointer bytes2
)
390 const GBytes
*b1
= bytes1
;
391 const GBytes
*b2
= bytes2
;
394 g_return_val_if_fail (bytes1
!= NULL
, 0);
395 g_return_val_if_fail (bytes2
!= NULL
, 0);
397 ret
= memcmp (b1
->data
, b2
->data
, MIN (b1
->size
, b2
->size
));
398 if (ret
== 0 && b1
->size
!= b2
->size
)
399 ret
= b1
->size
< b2
->size
? -1 : 1;
404 try_steal_and_unref (GBytes
*bytes
,
405 GDestroyNotify free_func
,
410 if (bytes
->free_func
!= free_func
|| bytes
->data
== NULL
)
413 /* Are we the only reference? */
414 if (g_atomic_int_get (&bytes
->ref_count
) == 1)
417 result
= (gpointer
)bytes
->data
;
418 g_slice_free (GBytes
, bytes
);
427 * g_bytes_unref_to_data:
428 * @bytes: (transfer full): a #GBytes
429 * @size: (out): location to place the length of the returned data
431 * Unreferences the bytes, and returns a pointer the same byte data
434 * As an optimization, the byte data is returned without copying if this was
435 * the last reference to bytes and bytes was created with g_bytes_new(),
436 * g_bytes_new_take() or g_byte_array_free_to_bytes(). In all other cases the
439 * Returns: (transfer full) (array length=size) (element-type guint8)
440 * (not nullable): a pointer to the same byte data, which should be
441 * freed with g_free()
446 g_bytes_unref_to_data (GBytes
*bytes
,
451 g_return_val_if_fail (bytes
!= NULL
, NULL
);
452 g_return_val_if_fail (size
!= NULL
, NULL
);
455 * Optimal path: if this is was the last reference, then we can return
456 * the data from this GBytes without copying.
459 result
= try_steal_and_unref (bytes
, g_free
, size
);
463 * Copy: Non g_malloc (or compatible) allocator, or static memory,
464 * so we have to copy, and then unref.
466 result
= g_memdup (bytes
->data
, bytes
->size
);
468 g_bytes_unref (bytes
);
475 * g_bytes_unref_to_array:
476 * @bytes: (transfer full): a #GBytes
478 * Unreferences the bytes, and returns a new mutable #GByteArray containing
479 * the same byte data.
481 * As an optimization, the byte data is transferred to the array without copying
482 * if this was the last reference to bytes and bytes was created with
483 * g_bytes_new(), g_bytes_new_take() or g_byte_array_free_to_bytes(). In all
484 * other cases the data is copied.
486 * Returns: (transfer full): a new mutable #GByteArray containing the same byte data
491 g_bytes_unref_to_array (GBytes
*bytes
)
496 g_return_val_if_fail (bytes
!= NULL
, NULL
);
498 data
= g_bytes_unref_to_data (bytes
, &size
);
499 return g_byte_array_new_take (data
, size
);