Linux server1.dn-server.com 4.18.0-553.89.1.lve.el8.x86_64 #1 SMP Wed Dec 10 13:58:50 UTC 2025 x86_64
LiteSpeed
Server IP : 195.201.204.189 & Your IP : 216.73.217.103
Domains :
Cant Read [ /etc/named.conf ]
User : beriska1
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
glib-2.0 /
glib /
Delete
Unzip
Name
Size
Permission
Date
Action
deprecated
[ DIR ]
drwxr-xr-x
2026-05-12 22:42
galloca.h
3.82
KB
-rw-r--r--
2018-08-15 20:52
garray.h
9.3
KB
-rw-r--r--
2018-12-18 18:33
gasyncqueue.h
5.53
KB
-rw-r--r--
2018-08-15 20:52
gatomic.h
14.75
KB
-rw-r--r--
2018-12-18 18:33
gbacktrace.h
2.51
KB
-rw-r--r--
2018-12-18 18:33
gbase64.h
2.27
KB
-rw-r--r--
2018-08-15 20:52
gbitlock.h
2.83
KB
-rw-r--r--
2018-08-15 20:52
gbookmarkfile.h
9.37
KB
-rw-r--r--
2018-11-27 17:12
gbytes.h
3.26
KB
-rw-r--r--
2018-08-15 20:52
gcharset.h
1.3
KB
-rw-r--r--
2018-12-18 18:33
gchecksum.h
3.77
KB
-rw-r--r--
2018-08-15 20:52
gconvert.h
5.78
KB
-rw-r--r--
2018-12-18 18:33
gdataset.h
6.1
KB
-rw-r--r--
2018-08-15 20:52
gdate.h
11.47
KB
-rw-r--r--
2018-08-15 20:52
gdatetime.h
11.96
KB
-rw-r--r--
2018-12-18 18:33
gdir.h
1.6
KB
-rw-r--r--
2018-08-15 20:52
genviron.h
2.31
KB
-rw-r--r--
2018-08-15 20:52
gerror.h
3.85
KB
-rw-r--r--
2018-08-15 20:52
gfileutils.h
5.51
KB
-rw-r--r--
2018-12-18 18:33
ggettext.h
2.37
KB
-rw-r--r--
2018-08-15 20:52
ghash.h
7.37
KB
-rw-r--r--
2018-12-18 18:33
ghmac.h
3.39
KB
-rw-r--r--
2018-08-15 20:52
ghook.h
6.21
KB
-rw-r--r--
2018-08-15 20:52
ghostutils.h
1.42
KB
-rw-r--r--
2018-08-15 20:52
gi18n-lib.h
1.34
KB
-rw-r--r--
2018-08-15 20:52
gi18n.h
1.14
KB
-rw-r--r--
2018-08-15 20:52
giochannel.h
13.63
KB
-rw-r--r--
2018-08-15 20:52
gkeyfile.h
14.56
KB
-rw-r--r--
2018-11-27 17:12
glib-autocleanups.h
4.04
KB
-rw-r--r--
2018-12-18 18:33
glist.h
5.69
KB
-rw-r--r--
2018-08-15 20:52
gmacros.h
18.21
KB
-rw-r--r--
2018-12-18 18:33
gmain.h
23.55
KB
-rw-r--r--
2018-12-18 18:33
gmappedfile.h
1.94
KB
-rw-r--r--
2018-11-27 17:12
gmarkup.h
10.62
KB
-rw-r--r--
2018-08-15 20:52
gmem.h
13.01
KB
-rw-r--r--
2018-12-18 18:33
gmessages.h
24.81
KB
-rw-r--r--
2018-12-18 15:42
gnode.h
8.91
KB
-rw-r--r--
2018-08-15 20:52
goption.h
15.65
KB
-rw-r--r--
2018-08-15 20:52
gpattern.h
1.74
KB
-rw-r--r--
2018-08-15 20:52
gpoll.h
4.03
KB
-rw-r--r--
2018-08-15 20:52
gprimes.h
1.65
KB
-rw-r--r--
2018-08-15 20:52
gprintf.h
1.94
KB
-rw-r--r--
2018-08-15 20:52
gqsort.h
1.46
KB
-rw-r--r--
2018-08-15 20:52
gquark.h
2.63
KB
-rw-r--r--
2018-08-15 20:52
gqueue.h
6.97
KB
-rw-r--r--
2018-08-15 20:52
grand.h
3.11
KB
-rw-r--r--
2018-08-15 20:52
grefcount.h
3.91
KB
-rw-r--r--
2026-05-11 17:50
gregex.h
27.44
KB
-rw-r--r--
2018-08-15 20:52
gscanner.h
8.47
KB
-rw-r--r--
2018-08-15 20:52
gsequence.h
8.6
KB
-rw-r--r--
2018-08-15 20:52
gshell.h
1.71
KB
-rw-r--r--
2018-08-15 20:52
gslice.h
3.8
KB
-rw-r--r--
2018-11-27 17:12
gslist.h
5.46
KB
-rw-r--r--
2018-08-15 20:52
gspawn.h
10.77
KB
-rw-r--r--
2018-12-18 18:33
gstdio.h
4.73
KB
-rw-r--r--
2018-12-18 18:33
gstrfuncs.h
12.76
KB
-rw-r--r--
2018-12-18 15:42
gstring.h
7.79
KB
-rw-r--r--
2018-08-15 20:52
gstringchunk.h
2.08
KB
-rw-r--r--
2018-08-15 20:52
gtestutils.h
23.64
KB
-rw-r--r--
2018-12-18 18:33
gthread.h
11.34
KB
-rw-r--r--
2018-12-18 14:38
gthreadpool.h
3.73
KB
-rw-r--r--
2018-08-15 20:52
gtimer.h
2.31
KB
-rw-r--r--
2018-08-15 20:52
gtimezone.h
3.41
KB
-rw-r--r--
2018-12-18 18:33
gtrashstack.h
1.74
KB
-rw-r--r--
2018-08-15 20:52
gtree.h
4.1
KB
-rw-r--r--
2018-08-15 20:52
gtypes.h
19.06
KB
-rw-r--r--
2018-12-18 18:33
gunicode.h
38.2
KB
-rw-r--r--
2018-12-18 18:33
gurifuncs.h
2.65
KB
-rw-r--r--
2018-08-15 20:52
gutils.h
11.01
KB
-rw-r--r--
2018-12-18 18:33
guuid.h
1.26
KB
-rw-r--r--
2018-08-15 20:52
gvariant.h
28.83
KB
-rw-r--r--
2018-12-18 18:33
gvarianttype.h
12.93
KB
-rw-r--r--
2018-12-18 18:33
gversion.h
1.93
KB
-rw-r--r--
2018-08-15 20:52
gversionmacros.h
16.33
KB
-rw-r--r--
2018-12-18 18:33
gwin32.h
4.56
KB
-rw-r--r--
2018-08-15 20:52
Save
Rename
/* GLIB - Library of useful routines for C programming * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, see <http://www.gnu.org/licenses/>. */ /* * Modified by the GLib Team and others 1997-2000. See the AUTHORS * file for a list of people on the GLib Team. See the ChangeLog * files for a list of changes. These files are distributed with * GLib at ftp://ftp.gtk.org/pub/gtk/. */ #ifndef __G_NODE_H__ #define __G_NODE_H__ #if !defined (__GLIB_H_INSIDE__) && !defined (GLIB_COMPILATION) #error "Only <glib.h> can be included directly." #endif #include <glib/gmem.h> G_BEGIN_DECLS typedef struct _GNode GNode; /* Tree traverse flags */ typedef enum { G_TRAVERSE_LEAVES = 1 << 0, G_TRAVERSE_NON_LEAVES = 1 << 1, G_TRAVERSE_ALL = G_TRAVERSE_LEAVES | G_TRAVERSE_NON_LEAVES, G_TRAVERSE_MASK = 0x03, G_TRAVERSE_LEAFS = G_TRAVERSE_LEAVES, G_TRAVERSE_NON_LEAFS = G_TRAVERSE_NON_LEAVES } GTraverseFlags; /* Tree traverse orders */ typedef enum { G_IN_ORDER, G_PRE_ORDER, G_POST_ORDER, G_LEVEL_ORDER } GTraverseType; typedef gboolean (*GNodeTraverseFunc) (GNode *node, gpointer data); typedef void (*GNodeForeachFunc) (GNode *node, gpointer data); /** * GCopyFunc: * @src: (not nullable): A pointer to the data which should be copied * @data: Additional data * * A function of this signature is used to copy the node data * when doing a deep-copy of a tree. * * Returns: (not nullable): A pointer to the copy * * Since: 2.4 */ typedef gpointer (*GCopyFunc) (gconstpointer src, gpointer data); /* N-way tree implementation */ struct _GNode { gpointer data; GNode *next; GNode *prev; GNode *parent; GNode *children; }; /** * G_NODE_IS_ROOT: * @node: a #GNode * * Returns %TRUE if a #GNode is the root of a tree. * * Returns: %TRUE if the #GNode is the root of a tree * (i.e. it has no parent or siblings) */ #define G_NODE_IS_ROOT(node) (((GNode*) (node))->parent == NULL && \ ((GNode*) (node))->prev == NULL && \ ((GNode*) (node))->next == NULL) /** * G_NODE_IS_LEAF: * @node: a #GNode * * Returns %TRUE if a #GNode is a leaf node. * * Returns: %TRUE if the #GNode is a leaf node * (i.e. it has no children) */ #define G_NODE_IS_LEAF(node) (((GNode*) (node))->children == NULL) GLIB_AVAILABLE_IN_ALL GNode* g_node_new (gpointer data); GLIB_AVAILABLE_IN_ALL void g_node_destroy (GNode *root); GLIB_AVAILABLE_IN_ALL void g_node_unlink (GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_copy_deep (GNode *node, GCopyFunc copy_func, gpointer data); GLIB_AVAILABLE_IN_ALL GNode* g_node_copy (GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_insert (GNode *parent, gint position, GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_insert_before (GNode *parent, GNode *sibling, GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_insert_after (GNode *parent, GNode *sibling, GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_prepend (GNode *parent, GNode *node); GLIB_AVAILABLE_IN_ALL guint g_node_n_nodes (GNode *root, GTraverseFlags flags); GLIB_AVAILABLE_IN_ALL GNode* g_node_get_root (GNode *node); GLIB_AVAILABLE_IN_ALL gboolean g_node_is_ancestor (GNode *node, GNode *descendant); GLIB_AVAILABLE_IN_ALL guint g_node_depth (GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_find (GNode *root, GTraverseType order, GTraverseFlags flags, gpointer data); /* convenience macros */ /** * g_node_append: * @parent: the #GNode to place the new #GNode under * @node: the #GNode to insert * * Inserts a #GNode as the last child of the given parent. * * Returns: the inserted #GNode */ #define g_node_append(parent, node) \ g_node_insert_before ((parent), NULL, (node)) /** * g_node_insert_data: * @parent: the #GNode to place the new #GNode under * @position: the position to place the new #GNode at. If position is -1, * the new #GNode is inserted as the last child of @parent * @data: the data for the new #GNode * * Inserts a new #GNode at the given position. * * Returns: the new #GNode */ #define g_node_insert_data(parent, position, data) \ g_node_insert ((parent), (position), g_node_new (data)) /** * g_node_insert_data_after: * @parent: the #GNode to place the new #GNode under * @sibling: the sibling #GNode to place the new #GNode after * @data: the data for the new #GNode * * Inserts a new #GNode after the given sibling. * * Returns: the new #GNode */ #define g_node_insert_data_after(parent, sibling, data) \ g_node_insert_after ((parent), (sibling), g_node_new (data)) /** * g_node_insert_data_before: * @parent: the #GNode to place the new #GNode under * @sibling: the sibling #GNode to place the new #GNode before * @data: the data for the new #GNode * * Inserts a new #GNode before the given sibling. * * Returns: the new #GNode */ #define g_node_insert_data_before(parent, sibling, data) \ g_node_insert_before ((parent), (sibling), g_node_new (data)) /** * g_node_prepend_data: * @parent: the #GNode to place the new #GNode under * @data: the data for the new #GNode * * Inserts a new #GNode as the first child of the given parent. * * Returns: the new #GNode */ #define g_node_prepend_data(parent, data) \ g_node_prepend ((parent), g_node_new (data)) /** * g_node_append_data: * @parent: the #GNode to place the new #GNode under * @data: the data for the new #GNode * * Inserts a new #GNode as the last child of the given parent. * * Returns: the new #GNode */ #define g_node_append_data(parent, data) \ g_node_insert_before ((parent), NULL, g_node_new (data)) /* traversal function, assumes that 'node' is root * (only traverses 'node' and its subtree). * this function is just a high level interface to * low level traversal functions, optimized for speed. */ GLIB_AVAILABLE_IN_ALL void g_node_traverse (GNode *root, GTraverseType order, GTraverseFlags flags, gint max_depth, GNodeTraverseFunc func, gpointer data); /* return the maximum tree height starting with 'node', this is an expensive * operation, since we need to visit all nodes. this could be shortened by * adding 'guint height' to struct _GNode, but then again, this is not very * often needed, and would make g_node_insert() more time consuming. */ GLIB_AVAILABLE_IN_ALL guint g_node_max_height (GNode *root); GLIB_AVAILABLE_IN_ALL void g_node_children_foreach (GNode *node, GTraverseFlags flags, GNodeForeachFunc func, gpointer data); GLIB_AVAILABLE_IN_ALL void g_node_reverse_children (GNode *node); GLIB_AVAILABLE_IN_ALL guint g_node_n_children (GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_nth_child (GNode *node, guint n); GLIB_AVAILABLE_IN_ALL GNode* g_node_last_child (GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_find_child (GNode *node, GTraverseFlags flags, gpointer data); GLIB_AVAILABLE_IN_ALL gint g_node_child_position (GNode *node, GNode *child); GLIB_AVAILABLE_IN_ALL gint g_node_child_index (GNode *node, gpointer data); GLIB_AVAILABLE_IN_ALL GNode* g_node_first_sibling (GNode *node); GLIB_AVAILABLE_IN_ALL GNode* g_node_last_sibling (GNode *node); /** * g_node_prev_sibling: * @node: a #GNode * * Gets the previous sibling of a #GNode. * * Returns: the previous sibling of @node, or %NULL if @node is the first * node or %NULL */ #define g_node_prev_sibling(node) ((node) ? \ ((GNode*) (node))->prev : NULL) /** * g_node_next_sibling: * @node: a #GNode * * Gets the next sibling of a #GNode. * * Returns: the next sibling of @node, or %NULL if @node is the last node * or %NULL */ #define g_node_next_sibling(node) ((node) ? \ ((GNode*) (node))->next : NULL) /** * g_node_first_child: * @node: a #GNode * * Gets the first child of a #GNode. * * Returns: the first child of @node, or %NULL if @node is %NULL * or has no children */ #define g_node_first_child(node) ((node) ? \ ((GNode*) (node))->children : NULL) G_END_DECLS #endif /* __G_NODE_H__ */