Lines Matching defs:stack
854 PyObject *stack[2];
891 stack[0] = object;
892 stack[1] = memo;
893 return _PyObject_FastCall(st->deepcopy_obj, stack, 2);
2054 * next, a stack of parents is maintained. This is a standard stack-based
2056 * The stack is managed using a continuous array.
2057 * Each stack item contains the saved parent to which we should return after
2105 /* Helper function for elementiter_next. Add a new parent to the parent stack.
2148 * the parent stack is empty. If root_element is NULL and we're here, the
2162 * yes, visit the next child. If not, pop the stack and try again.
2325 PyObject *stack; /* element stack */
2326 Py_ssize_t index; /* current stack size (0 means empty) */
2366 t->stack = PyList_New(20);
2367 if (!t->stack) {
2455 Py_VISIT(self->stack);
2472 Py_CLEAR(self->stack);
2710 if (self->index < PyList_GET_SIZE(self->stack)) {
2711 if (PyList_SetItem(self->stack, self->index, this) < 0)
2715 if (PyList_Append(self->stack, this) < 0)
2784 "pop from empty stack"
2794 self->this = PyList_GET_ITEM(self->stack, self->index);
2849 PyObject* stack[2] = {target, text};
2856 pi = _PyObject_FastCall(self->pi_factory, stack, 2);
2990 /* FIXME: check stack size? */
3372 PyObject* stack[2];
3410 stack[0] = prefix;
3411 stack[1] = uri;
3412 res = _PyObject_FastCall(self->handle_start_ns, stack, 2);
3550 PyObject* stack[2];
3579 stack[0] = pi_target;
3580 stack[1] = data;
3581 res = _PyObject_FastCall(self->handle_pi, stack, 2);