问GLib堆栈数据类型？

EN

GSList *stack = NULL;
// push:
stack = g_slist_prepend(stack, element);
// stack non-empty?
if (stack) { ... }
// peek head without popping:
element = stack->data;
// pop:
stack = g_slist_delete_link(stack, stack);

void *stack_pop(GSList **stackp) {
    if (!*stackp)
        return;
    void *ret = (*stackp)->data;
    *stackp = g_slist_delete_link(*stackp, *stackp);
    return ret;
}
// ...
element = stack_pop(&stack); // returns NULL if stack is empty

// An example stack in glib using a Queue. As this example uses
// integers, we make use of the glib GPOINTER_TO_UINT macros.
//
// Compile by:
//    cc `pkg-config --cflags --libs glib-2.0` -o test-stack test-stack.c

#include <glib.h>
#include <stdio.h>
#include <stdint.h>

void pintqueue(GQueue *q)
{
    int i;
    printf("[%d] ", q->length);

    GList *h = q->head;

    for (i=0; i<q->length; i++) {
        printf("%d ", (int)GPOINTER_TO_UINT(h->data));
        h=h->next;
    }
    printf("\n");
}

void qintpush(GQueue *q, gint val)
{
    g_queue_push_tail(q, GUINT_TO_POINTER((guint)val));
}

gint qintpop(GQueue *q)
{
    if (q->length==0) {
        // "Error handling"
        g_message("Ooops! Trying to pop from an empty stack!");
        return INT_MAX;
    }
    return (gint)(GPOINTER_TO_UINT(g_queue_pop_tail(q)));
}

gint main(int argc, char **argv)
{
    GQueue q = G_QUEUE_INIT;

    qintpush(&q, 34);
    qintpush(&q, 42);
    qintpush(&q, -1);

    pintqueue(&q);

    printf("Popped: %d\n", qintpop(&q));
    pintqueue(&q);

    for (int i=0; i<5; i++)
        printf("Popped: %d\n", qintpop(&q));

    exit(0);
}