2 * Copyright © 2007, 2008 Ryan Lortie
3 * Copyright © 2010 Codethink Limited
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 License, 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, write to the
17 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 * Boston, MA 02111-1307, USA.
23 #include <glib/gvariant-core.h>
25 #include <glib/gvariant-serialiser.h>
26 #include <glib/gtestutils.h>
27 #include <glib/gbitlock.h>
28 #include <glib/gatomic.h>
29 #include <glib/gbytes.h>
30 #include <glib/gslice.h>
31 #include <glib/gmem.h>
36 * This file includes the structure definition for GVariant and a small
37 * set of functions that are allowed to access the structure directly.
39 * This minimises the amount of code that can possibly touch a GVariant
40 * structure directly to a few simple fundamental operations. These few
41 * operations are written to be completely threadsafe with respect to
42 * all possible outside access. This means that we only need to be
43 * concerned about thread safety issues in this one small file.
45 * Most GVariant API functions are in gvariant.c.
51 * #GVariant is an opaque data structure and can only be accessed
52 * using the following functions.
57 /* see below for field member documentation */
59 GVariantTypeInfo *type_info;
83 * There are two primary forms of GVariant instances: "serialised form"
86 * "serialised form": A serialised GVariant instance stores its value in
87 * the GVariant serialisation format. All
88 * basic-typed instances (ie: non-containers) are in
89 * serialised format, as are some containers.
91 * "tree form": Some containers are in "tree form". In this case,
92 * instead of containing the serialised data for the
93 * container, the instance contains an array of pointers to
94 * the child values of the container (thus forming a tree).
96 * It is possible for an instance to transition from tree form to
97 * serialised form. This happens, implicitly, if the serialised data is
98 * requested (eg: via g_variant_get_data()). Serialised form instances
99 * never transition into tree form.
102 * The fields of the structure are documented here:
104 * type_info: this is a reference to a GVariantTypeInfo describing the
105 * type of the instance. When the instance is freed, this
106 * reference must be released with g_variant_type_info_unref().
108 * The type_info field never changes during the life of the
109 * instance, so it can be accessed without a lock.
111 * size: this is the size of the serialised form for the instance, if it
112 * is known. If the instance is in serialised form then it is, by
113 * definition, known. If the instance is in tree form then it may
114 * be unknown (in which case it is -1). It is possible for the
115 * size to be known when in tree form if, for example, the user
116 * has called g_variant_get_size() without calling
117 * g_variant_get_data(). Additionally, even when the user calls
118 * g_variant_get_data() the size of the data must first be
119 * determined so that a large enough buffer can be allocated for
122 * Once the size is known, it can never become unknown again.
123 * g_variant_ensure_size() is used to ensure that the size is in
124 * the known state -- it calculates the size if needed. After
125 * that, the size field can be accessed without a lock.
127 * contents: a union containing either the information associated with
128 * holding a value in serialised form or holding a value in
131 * .serialised: Only valid when the instance is in serialised form.
133 * Since an instance can never transition away from
134 * serialised form, once these fields are set, they will
135 * never be changed. It is therefore valid to access
136 * them without holding a lock.
138 * .bytes: the #GBytes that contains the memory pointed to by
139 * .data, or %NULL if .data is %NULL. In the event that
140 * the instance was deserialised from another instance,
141 * then the bytes will be shared by both of them. When
142 * the instance is freed, this reference must be released
143 * with g_bytes_unref().
145 * .data: the serialised data (of size 'size') of the instance.
146 * This pointer should not be freed or modified in any way.
147 * #GBytes is responsible for memory management.
149 * This pointer may be %NULL in two cases:
151 * - if the serialised size of the instance is 0
153 * - if the instance is of a fixed-sized type and was
154 * deserialised out of a corrupted container such that
155 * the container contains too few bytes to point to the
156 * entire proper fixed-size of this instance. In this
157 * case, 'size' will still be equal to the proper fixed
158 * size, but this pointer will be %NULL. This is exactly
159 * the reason that g_variant_get_data() sometimes returns
160 * %NULL. For all other calls, the effect should be as
161 * if .data pointed to the appropriate number of nul
164 * .tree: Only valid when the instance is in tree form.
166 * Note that accesses from other threads could result in
167 * conversion of the instance from tree form to serialised form
168 * at any time. For this reason, the instance lock must always
169 * be held while performing any operations on 'contents.tree'.
171 * .children: the array of the child instances of this instance.
172 * When the instance is freed (or converted to serialised
173 * form) then each child must have g_variant_unref()
174 * called on it and the array must be freed using
177 * .n_children: the number of items in the .children array.
179 * state: a bitfield describing the state of the instance. It is a
180 * bitwise-or of the following STATE_* constants:
182 * STATE_LOCKED: the instance lock is held. This is the bit used by
185 * STATE_SERIALISED: the instance is in serialised form. If this
186 * flag is not set then the instance is in tree
189 * STATE_TRUSTED: for serialised form instances, this means that the
190 * serialised data is known to be in normal form (ie:
193 * For tree form instances, this means that all of the
194 * child instances in the contents.tree.children array
195 * are trusted. This means that if the container is
196 * serialised then the resulting data will be in
199 * If this flag is unset it does not imply that the
200 * data is corrupted. It merely means that we're not
201 * sure that it's valid. See g_variant_is_trusted().
203 * STATE_FLOATING: if this flag is set then the object has a floating
204 * reference. See g_variant_ref_sink().
206 * ref_count: the reference count of the instance
208 #define STATE_LOCKED 1
209 #define STATE_SERIALISED 2
210 #define STATE_TRUSTED 4
211 #define STATE_FLOATING 8
216 * @value: a #GVariant
218 * Locks @value for performing sensitive operations.
221 g_variant_lock (GVariant *value)
223 g_bit_lock (&value->state, 0);
228 * @value: a #GVariant
230 * Unlocks @value after performing sensitive operations.
233 g_variant_unlock (GVariant *value)
235 g_bit_unlock (&value->state, 0);
239 * g_variant_release_children:
240 * @value: a #GVariant
242 * Releases the reference held on each child in the 'children' array of
243 * @value and frees the array itself. @value must be in tree form.
245 * This is done when freeing a tree-form instance or converting it to
248 * The current thread must hold the lock on @value.
251 g_variant_release_children (GVariant *value)
255 g_assert (value->state & STATE_LOCKED);
256 g_assert (~value->state & STATE_SERIALISED);
258 for (i = 0; i < value->contents.tree.n_children; i++)
259 g_variant_unref (value->contents.tree.children[i]);
261 g_free (value->contents.tree.children);
264 /* This begins the main body of the recursive serialiser.
266 * There are 3 functions here that work as a team with the serialiser to
267 * get things done. g_variant_store() has a trivial role, but as a
268 * public API function, it has its definition elsewhere.
270 * Note that "serialisation" of an instance does not mean that the
271 * instance is converted to serialised form -- it means that the
272 * serialised form of an instance is written to an external buffer.
273 * g_variant_ensure_serialised() (which is not part of this set of
274 * functions) is the function that is responsible for converting an
275 * instance to serialised form.
277 * We are only concerned here with container types since non-container
278 * instances are always in serialised form. For these instances,
279 * storing their serialised form merely involves a memcpy().
281 * Serialisation is a two-step process. First, the size of the
282 * serialised data must be calculated so that an appropriately-sized
283 * buffer can be allocated. Second, the data is written into the
286 * Determining the size:
287 * The process of determining the size is triggered by a call to
288 * g_variant_ensure_size() on a container. This invokes the
289 * serialiser code to determine the size. The serialiser is passed
290 * g_variant_fill_gvs() as a callback.
292 * g_variant_fill_gvs() is called by the serialiser on each child of
293 * the container which, in turn, calls g_variant_ensure_size() on
294 * itself and fills in the result of its own size calculation.
296 * The serialiser uses the size information from the children to
297 * calculate the size needed for the entire container.
300 * After the buffer has been allocated, g_variant_serialise() is
301 * called on the container. This invokes the serialiser code to write
302 * the bytes to the container. The serialiser is, again, passed
303 * g_variant_fill_gvs() as a callback.
305 * This time, when g_variant_fill_gvs() is called for each child, the
306 * child is given a pointer to a sub-region of the allocated buffer
307 * where it should write its data. This is done by calling
308 * g_variant_store(). In the event that the instance is in serialised
309 * form this means a memcpy() of the serialised data into the
310 * allocated buffer. In the event that the instance is in tree form
311 * this means a recursive call back into g_variant_serialise().
314 * The forward declaration here allows corecursion via callback:
316 static void g_variant_fill_gvs (GVariantSerialised *, gpointer);
319 * g_variant_ensure_size:
320 * @value: a #GVariant
322 * Ensures that the ->size field of @value is filled in properly. This
323 * must be done as a precursor to any serialisation of the value in
324 * order to know how large of a buffer is needed to store the data.
326 * The current thread must hold the lock on @value.
329 g_variant_ensure_size (GVariant *value)
331 g_assert (value->state & STATE_LOCKED);
333 if (value->size == (gssize) -1)
338 children = (gpointer *) value->contents.tree.children;
339 n_children = value->contents.tree.n_children;
340 value->size = g_variant_serialiser_needed_size (value->type_info,
342 children, n_children);
347 * g_variant_serialise:
348 * @value: a #GVariant
349 * @data: an appropriately-sized buffer
351 * Serialises @value into @data. @value must be in tree form.
353 * No change is made to @value.
355 * The current thread must hold the lock on @value.
358 g_variant_serialise (GVariant *value,
361 GVariantSerialised serialised = { 0, };
365 g_assert (~value->state & STATE_SERIALISED);
366 g_assert (value->state & STATE_LOCKED);
368 serialised.type_info = value->type_info;
369 serialised.size = value->size;
370 serialised.data = data;
372 children = (gpointer *) value->contents.tree.children;
373 n_children = value->contents.tree.n_children;
375 g_variant_serialiser_serialise (serialised, g_variant_fill_gvs,
376 children, n_children);
380 * g_variant_fill_gvs:
381 * @serialised: a pointer to a #GVariantSerialised
382 * @data: a #GVariant instance
384 * This is the callback that is passed by a tree-form container instance
385 * to the serialiser. This callback gets called on each child of the
386 * container. Each child is responsible for performing the following
389 * - reporting its type
391 * - reporting its serialised size (requires knowing the size first)
393 * - possibly storing its serialised form into the provided buffer
396 g_variant_fill_gvs (GVariantSerialised *serialised,
399 GVariant *value = data;
401 g_variant_lock (value);
402 g_variant_ensure_size (value);
403 g_variant_unlock (value);
405 if (serialised->type_info == NULL)
406 serialised->type_info = value->type_info;
407 g_assert (serialised->type_info == value->type_info);
409 if (serialised->size == 0)
410 serialised->size = value->size;
411 g_assert (serialised->size == value->size);
413 if (serialised->data)
414 /* g_variant_store() is a public API, so it
415 * it will reacquire the lock if it needs to.
417 g_variant_store (value, serialised->data);
420 /* this ends the main body of the recursive serialiser */
423 * g_variant_ensure_serialised:
424 * @value: a #GVariant
426 * Ensures that @value is in serialised form.
428 * If @value is in tree form then this function ensures that the
429 * serialised size is known and then allocates a buffer of that size and
430 * serialises the instance into the buffer. The 'children' array is
431 * then released and the instance is set to serialised form based on the
432 * contents of the buffer.
434 * The current thread must hold the lock on @value.
437 g_variant_ensure_serialised (GVariant *value)
439 g_assert (value->state & STATE_LOCKED);
441 if (~value->state & STATE_SERIALISED)
446 g_variant_ensure_size (value);
447 data = g_malloc (value->size);
448 g_variant_serialise (value, data);
450 g_variant_release_children (value);
452 bytes = g_bytes_new_take (data, value->size);
453 value->contents.serialised.data = g_bytes_get_data (bytes, NULL);
454 value->contents.serialised.bytes = bytes;
455 value->state |= STATE_SERIALISED;
461 * @type: the type of the new instance
462 * @serialised: if the instance will be in serialised form
463 * @trusted: if the instance will be trusted
465 * Allocates a #GVariant instance and does some common work (such as
466 * looking up and filling in the type info), setting the state field,
467 * and setting the ref_count to 1.
469 * Returns: a new #GVariant with a floating reference
472 g_variant_alloc (const GVariantType *type,
478 value = g_slice_new (GVariant);
479 value->type_info = g_variant_type_info_get (type);
480 value->state = (serialised ? STATE_SERIALISED : 0) |
481 (trusted ? STATE_TRUSTED : 0) |
483 value->size = (gssize) -1;
484 value->ref_count = 1;
490 * g_variant_new_from_bytes:
491 * @type: a #GVariantType
493 * @trusted: if the contents of @bytes are trusted
495 * Constructs a new serialised-mode #GVariant instance. This is the
496 * inner interface for creation of new serialised values that gets
497 * called from various functions in gvariant.c.
499 * A reference is taken on @bytes.
501 * Returns: (transfer none): a new #GVariant with a floating reference
506 g_variant_new_from_bytes (const GVariantType *type,
514 value = g_variant_alloc (type, TRUE, trusted);
516 value->contents.serialised.bytes = g_bytes_ref (bytes);
518 g_variant_type_info_query (value->type_info,
521 if (size && g_bytes_get_size (bytes) != size)
523 /* Creating a fixed-sized GVariant with a bytes of the wrong
526 * We should do the equivalent of pulling a fixed-sized child out
527 * of a brozen container (ie: data is NULL size is equal to the correct
530 value->contents.serialised.data = NULL;
535 value->contents.serialised.data = g_bytes_get_data (bytes, &value->size);
544 * g_variant_new_from_children:
545 * @type: a #GVariantType
546 * @children: an array of #GVariant pointers. Consumed.
547 * @n_children: the length of @children
548 * @trusted: %TRUE if every child in @children in trusted
550 * Constructs a new tree-mode #GVariant instance. This is the inner
551 * interface for creation of new serialised values that gets called from
552 * various functions in gvariant.c.
554 * @children is consumed by this function. g_free() will be called on
555 * it some time later.
557 * Returns: a new #GVariant with a floating reference
560 g_variant_new_from_children (const GVariantType *type,
567 value = g_variant_alloc (type, FALSE, trusted);
568 value->contents.tree.children = children;
569 value->contents.tree.n_children = n_children;
575 * g_variant_get_type_info:
576 * @value: a #GVariant
578 * Returns the #GVariantTypeInfo corresponding to the type of @value. A
579 * reference is not added, so the return value is only good for the
580 * duration of the life of @value.
582 * Returns: the #GVariantTypeInfo for @value
585 g_variant_get_type_info (GVariant *value)
587 return value->type_info;
591 * g_variant_is_trusted:
592 * @value: a #GVariant
594 * Determines if @value is trusted by #GVariant to contain only
595 * fully-valid data. All values constructed solely via #GVariant APIs
596 * are trusted, but values containing data read in from other sources
597 * are usually not trusted.
599 * The main advantage of trusted data is that certain checks can be
600 * skipped. For example, we don't need to check that a string is
601 * properly nul-terminated or that an object path is actually a
602 * properly-formatted object path.
604 * Returns: if @value is trusted
607 g_variant_is_trusted (GVariant *value)
609 return (value->state & STATE_TRUSTED) != 0;
616 * @value: a #GVariant
618 * Decreases the reference count of @value. When its reference count
619 * drops to 0, the memory used by the variant is freed.
624 g_variant_unref (GVariant *value)
626 g_return_if_fail (value != NULL);
627 g_return_if_fail (value->ref_count > 0);
629 if (g_atomic_int_dec_and_test (&value->ref_count))
631 if G_UNLIKELY (value->state & STATE_LOCKED)
632 g_critical ("attempting to free a locked GVariant instance. "
633 "This should never happen.");
635 value->state |= STATE_LOCKED;
637 g_variant_type_info_unref (value->type_info);
639 if (value->state & STATE_SERIALISED)
640 g_bytes_unref (value->contents.serialised.bytes);
642 g_variant_release_children (value);
644 memset (value, 0, sizeof (GVariant));
645 g_slice_free (GVariant, value);
651 * @value: a #GVariant
653 * Increases the reference count of @value.
655 * Returns: the same @value
660 g_variant_ref (GVariant *value)
662 g_return_val_if_fail (value != NULL, NULL);
663 g_return_val_if_fail (value->ref_count > 0, NULL);
665 g_atomic_int_inc (&value->ref_count);
671 * g_variant_ref_sink:
672 * @value: a #GVariant
674 * #GVariant uses a floating reference count system. All functions with
675 * names starting with <literal>g_variant_new_</literal> return floating
678 * Calling g_variant_ref_sink() on a #GVariant with a floating reference
679 * will convert the floating reference into a full reference. Calling
680 * g_variant_ref_sink() on a non-floating #GVariant results in an
681 * additional normal reference being added.
683 * In other words, if the @value is floating, then this call "assumes
684 * ownership" of the floating reference, converting it to a normal
685 * reference. If the @value is not floating, then this call adds a
686 * new normal reference increasing the reference count by one.
688 * All calls that result in a #GVariant instance being inserted into a
689 * container will call g_variant_ref_sink() on the instance. This means
690 * that if the value was just created (and has only its floating
691 * reference) then the container will assume sole ownership of the value
692 * at that point and the caller will not need to unreference it. This
693 * makes certain common styles of programming much easier while still
694 * maintaining normal refcounting semantics in situations where values
697 * Returns: the same @value
702 g_variant_ref_sink (GVariant *value)
704 g_return_val_if_fail (value != NULL, NULL);
705 g_return_val_if_fail (value->ref_count > 0, NULL);
707 g_variant_lock (value);
709 if (~value->state & STATE_FLOATING)
710 g_variant_ref (value);
712 value->state &= ~STATE_FLOATING;
714 g_variant_unlock (value);
720 * g_variant_take_ref:
721 * @value: a #GVariant
723 * If @value is floating, sink it. Otherwise, do nothing.
725 * Typically you want to use g_variant_ref_sink() in order to
726 * automatically do the correct thing with respect to floating or
727 * non-floating references, but there is one specific scenario where
728 * this function is helpful.
730 * The situation where this function is helpful is when creating an API
731 * that allows the user to provide a callback function that returns a
732 * #GVariant. We certainly want to allow the user the flexibility to
733 * return a non-floating reference from this callback (for the case
734 * where the value that is being returned already exists).
736 * At the same time, the style of the #GVariant API makes it likely that
737 * for newly-created #GVariant instances, the user can be saved some
738 * typing if they are allowed to return a #GVariant with a floating
741 * Using this function on the return value of the user's callback allows
742 * the user to do whichever is more convenient for them. The caller
743 * will alway receives exactly one full reference to the value: either
744 * the one that was returned in the first place, or a floating reference
745 * that has been converted to a full reference.
747 * This function has an odd interaction when combined with
748 * g_variant_ref_sink() running at the same time in another thread on
749 * the same #GVariant instance. If g_variant_ref_sink() runs first then
750 * the result will be that the floating reference is converted to a hard
751 * reference. If g_variant_take_ref() runs first then the result will
752 * be that the floating reference is converted to a hard reference and
753 * an additional reference on top of that one is added. It is best to
754 * avoid this situation.
756 * Returns: the same @value
759 g_variant_take_ref (GVariant *value)
761 g_return_val_if_fail (value != NULL, NULL);
762 g_return_val_if_fail (value->ref_count > 0, NULL);
764 g_atomic_int_and (&value->state, ~STATE_FLOATING);
770 * g_variant_is_floating:
771 * @value: a #GVariant
773 * Checks whether @value has a floating reference count.
775 * This function should only ever be used to assert that a given variant
776 * is or is not floating, or for debug purposes. To acquire a reference
777 * to a variant that might be floating, always use g_variant_ref_sink()
778 * or g_variant_take_ref().
780 * See g_variant_ref_sink() for more information about floating reference
783 * Returns: whether @value is floating
788 g_variant_is_floating (GVariant *value)
790 g_return_val_if_fail (value != NULL, FALSE);
792 return (value->state & STATE_FLOATING) != 0;
796 * g_variant_get_size:
797 * @value: a #GVariant instance
799 * Determines the number of bytes that would be required to store @value
800 * with g_variant_store().
802 * If @value has a fixed-sized type then this function always returned
805 * In the case that @value is already in serialised form or the size has
806 * already been calculated (ie: this function has been called before)
807 * then this function is O(1). Otherwise, the size is calculated, an
808 * operation which is approximately O(n) in the number of values
811 * Returns: the serialised size of @value
816 g_variant_get_size (GVariant *value)
818 g_variant_lock (value);
819 g_variant_ensure_size (value);
820 g_variant_unlock (value);
826 * g_variant_get_data:
827 * @value: a #GVariant instance
829 * Returns a pointer to the serialised form of a #GVariant instance.
830 * The returned data may not be in fully-normalised form if read from an
831 * untrusted source. The returned data must not be freed; it remains
832 * valid for as long as @value exists.
834 * If @value is a fixed-sized value that was deserialised from a
835 * corrupted serialised container then %NULL may be returned. In this
836 * case, the proper thing to do is typically to use the appropriate
837 * number of nul bytes in place of @value. If @value is not fixed-sized
838 * then %NULL is never returned.
840 * In the case that @value is already in serialised form, this function
841 * is O(1). If the value is not already in serialised form,
842 * serialisation occurs implicitly and is approximately O(n) in the size
845 * To deserialise the data returned by this function, in addition to the
846 * serialised data, you must know the type of the #GVariant, and (if the
847 * machine might be different) the endianness of the machine that stored
848 * it. As a result, file formats or network messages that incorporate
849 * serialised #GVariant<!---->s must include this information either
850 * implicitly (for instance "the file always contains a
851 * %G_VARIANT_TYPE_VARIANT and it is always in little-endian order") or
852 * explicitly (by storing the type and/or endianness in addition to the
855 * Returns: (transfer none): the serialised form of @value, or %NULL
860 g_variant_get_data (GVariant *value)
862 g_variant_lock (value);
863 g_variant_ensure_serialised (value);
864 g_variant_unlock (value);
866 return value->contents.serialised.data;
870 * g_variant_get_data_as_bytes:
871 * @value: a #GVariant
873 * Returns a pointer to the serialised form of a #GVariant instance.
874 * The semantics of this function are exactly the same as
875 * g_variant_get_data(), except that the returned #GBytes holds
876 * a reference to the variant data.
878 * Returns: (transfer full): A new #GBytes representing the variant data
883 g_variant_get_data_as_bytes (GVariant *value)
885 const gchar *bytes_data;
890 g_variant_lock (value);
891 g_variant_ensure_serialised (value);
892 g_variant_unlock (value);
894 bytes_data = g_bytes_get_data (value->contents.serialised.bytes, &bytes_size);
895 data = value->contents.serialised.data;
898 if (data == bytes_data && size == bytes_size)
899 return g_bytes_ref (value->contents.serialised.bytes);
901 return g_bytes_new_from_bytes (value->contents.serialised.bytes,
902 data - bytes_data, size);
907 * g_variant_n_children:
908 * @value: a container #GVariant
910 * Determines the number of children in a container #GVariant instance.
911 * This includes variants, maybes, arrays, tuples and dictionary
912 * entries. It is an error to call this function on any other type of
915 * For variants, the return value is always 1. For values with maybe
916 * types, it is always zero or one. For arrays, it is the length of the
917 * array. For tuples it is the number of tuple items (which depends
918 * only on the type). For dictionary entries, it is always 2
920 * This function is O(1).
922 * Returns: the number of children in the container
927 g_variant_n_children (GVariant *value)
931 g_variant_lock (value);
933 if (value->state & STATE_SERIALISED)
935 GVariantSerialised serialised = {
937 (gpointer) value->contents.serialised.data,
941 n_children = g_variant_serialised_n_children (serialised);
944 n_children = value->contents.tree.n_children;
946 g_variant_unlock (value);
952 * g_variant_get_child_value:
953 * @value: a container #GVariant
954 * @index_: the index of the child to fetch
956 * Reads a child item out of a container #GVariant instance. This
957 * includes variants, maybes, arrays, tuples and dictionary
958 * entries. It is an error to call this function on any other type of
961 * It is an error if @index_ is greater than the number of child items
962 * in the container. See g_variant_n_children().
964 * The returned value is never floating. You should free it with
965 * g_variant_unref() when you're done with it.
967 * This function is O(1).
969 * Returns: (transfer full): the child at the specified index
974 g_variant_get_child_value (GVariant *value,
977 g_return_val_if_fail (index_ < g_variant_n_children (value), NULL);
979 if (~g_atomic_int_get (&value->state) & STATE_SERIALISED)
981 g_variant_lock (value);
983 if (~value->state & STATE_SERIALISED)
987 child = g_variant_ref (value->contents.tree.children[index_]);
988 g_variant_unlock (value);
993 g_variant_unlock (value);
997 GVariantSerialised serialised = {
999 (gpointer) value->contents.serialised.data,
1002 GVariantSerialised s_child;
1005 /* get the serialiser to extract the serialised data for the child
1006 * from the serialised data for the container
1008 s_child = g_variant_serialised_get_child (serialised, index_);
1010 /* create a new serialised instance out of it */
1011 child = g_slice_new (GVariant);
1012 child->type_info = s_child.type_info;
1013 child->state = (value->state & STATE_TRUSTED) |
1015 child->size = s_child.size;
1016 child->ref_count = 1;
1017 child->contents.serialised.bytes =
1018 g_bytes_ref (value->contents.serialised.bytes);
1019 child->contents.serialised.data = s_child.data;
1027 * @value: the #GVariant to store
1028 * @data: the location to store the serialised data at
1030 * Stores the serialised form of @value at @data. @data should be
1031 * large enough. See g_variant_get_size().
1033 * The stored data is in machine native byte order but may not be in
1034 * fully-normalised form if read from an untrusted source. See
1035 * g_variant_get_normal_form() for a solution.
1037 * As with g_variant_get_data(), to be able to deserialise the
1038 * serialised variant successfully, its type and (if the destination
1039 * machine might be different) its endianness must also be available.
1041 * This function is approximately O(n) in the size of @data.
1046 g_variant_store (GVariant *value,
1049 g_variant_lock (value);
1051 if (value->state & STATE_SERIALISED)
1053 if (value->contents.serialised.data != NULL)
1054 memcpy (data, value->contents.serialised.data, value->size);
1056 memset (data, 0, value->size);
1059 g_variant_serialise (value, data);
1061 g_variant_unlock (value);
1065 * g_variant_is_normal_form:
1066 * @value: a #GVariant instance
1068 * Checks if @value is in normal form.
1070 * The main reason to do this is to detect if a given chunk of
1071 * serialised data is in normal form: load the data into a #GVariant
1072 * using g_variant_new_from_data() and then use this function to
1075 * If @value is found to be in normal form then it will be marked as
1076 * being trusted. If the value was already marked as being trusted then
1077 * this function will immediately return %TRUE.
1079 * Returns: %TRUE if @value is in normal form
1084 g_variant_is_normal_form (GVariant *value)
1086 if (value->state & STATE_TRUSTED)
1089 g_variant_lock (value);
1091 if (value->state & STATE_SERIALISED)
1093 GVariantSerialised serialised = {
1095 (gpointer) value->contents.serialised.data,
1099 if (g_variant_serialised_is_normal (serialised))
1100 value->state |= STATE_TRUSTED;
1104 gboolean normal = TRUE;
1107 for (i = 0; i < value->contents.tree.n_children; i++)
1108 normal &= g_variant_is_normal_form (value->contents.tree.children[i]);
1111 value->state |= STATE_TRUSTED;
1114 g_variant_unlock (value);
1116 return (value->state & STATE_TRUSTED) != 0;