54     QSLIST_HEAD(, StackObject) stack;
87     QSLIST_FOREACH(so , &qiv->stack, node) {  in full_name_nth()
127     if (QSLIST_EMPTY(&qiv->stack)) {  in qobject_input_try_get_object()
134     tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_try_get_object()
236     QSLIST_INSERT_HEAD(&qiv->stack, tos, node);  in qobject_input_push()
244     StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_check_struct()
271     StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_pop()
274     QSLIST_REMOVE_HEAD(&qiv->stack, node);  in qobject_input_pop()
307     StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_end_struct()
345     StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_next_list()
359     StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_check_list()
374     StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_end_list()
679     while (!QSLIST_EMPTY(&qiv->stack)) {  in qobject_input_free()
680         StackObject *tos = QSLIST_FIRST(&qiv->stack);  in qobject_input_free()
682         QSLIST_REMOVE_HEAD(&qiv->stack, node);  in qobject_input_free()