// File: /workspace/github_cpp_makefile_star2_O1/jliesch[P]ofxget/pugixml/pugixml.cpp
// Function: pugi::impl::(anonymous namespace)::xpath_node_set_raw pugi::impl::(anonymous namespace)::xpath_ast_node::step_do<pugi::impl::(anonymous namespace)::axis_to_type<(pugi::impl::(anonymous namespace)::axis_t)0>>(pugi::impl::(anonymous namespace)::xpath_context const&, pugi::impl::(anonymous namespace)::xpath_stack const&, pugi::impl::(anonymous namespace)::nodeset_eval_t, pugi::impl::(anonymous namespace)::axis_to_type<(pugi::impl::(anonymous namespace)::axis_t)0>)
xpath_node_set_raw step_do(const xpath_context& c, const xpath_stack& stack, nodeset_eval_t eval, T v)
		{
			const axis_t axis = T::axis;
			const bool axis_reverse = (axis == axis_ancestor || axis == axis_ancestor_or_self || axis == axis_preceding || axis == axis_preceding_sibling);
			const xpath_node_set::type_t axis_type = axis_reverse ? xpath_node_set::type_sorted_reverse : xpath_node_set::type_sorted;

			bool once =
				(axis == axis_attribute && _test == nodetest_name) ||
				(!_right && eval_once(axis_type, eval)) ||
				(_right && !_right->_next && _right->_test == predicate_constant_one);

			xpath_node_set_raw ns;
			ns.set_type(axis_type);

			if (_left)
			{
				xpath_node_set_raw s = _left->eval_node_set(c, stack, nodeset_eval_all);

				// self axis preserves the original order
				if (axis == axis_self) ns.set_type(s.type());

				for (const xpath_node* it = s.begin(); it != s.end(); ++it)
				{
					size_t size = ns.size();

					// in general, all axes generate elements in a particular order, but there is no order guarantee if axis is applied to two nodes
					if (axis != axis_self && size != 0) ns.set_type(xpath_node_set::type_unsorted);

					step_fill(ns, *it, stack.result, once, v);
					if (_right) apply_predicates(ns, size, stack, eval);
				}
			}
			else
			{
				step_fill(ns, c.n, stack.result, once, v);
				if (_right) apply_predicates(ns, 0, stack, eval);
			}

			// child, attribute and self axes always generate unique set of nodes
			// for other axis, if the set stayed sorted, it stayed unique because the traversal algorithms do not visit the same node twice
			if (axis != axis_child && axis != axis_attribute && axis != axis_self && ns.type() == xpath_node_set::type_unsorted)
				ns.remove_duplicates();

			return ns;
		}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rcx, %r14
movq %rsi, %r15
movq %rdi, %rbx
movq 0x10(%rsi), %rax
testq %rax, %rax
sete %cl
movl %r8d, 0x4(%rsp)
cmpl $0x1, %r8d
sete %bpl
testq %rax, %rax
je 0x2e3f8
cmpq $0x0, 0x18(%rax)
je 0x2e3fd
xorl %ebp, %ebp
jmp 0x2e405
andb %cl, %bpl
jmp 0x2e405
cmpb $0x3, 0x3(%rax)
sete %bpl
xorps %xmm0, %xmm0
movups %xmm0, 0x8(%rbx)
movq $0x0, 0x18(%rbx)
movl $0x2, (%rbx)
movq 0x8(%r15), %rsi
testq %rsi, %rsi
je 0x2e49d
leaq 0x8(%rsp), %r13
movq %r13, %rdi
movq %r14, %rcx
xorl %r8d, %r8d
callq 0x27cf4
movq 0x8(%r13), %r12
cmpq 0x10(%r13), %r12
je 0x2e4cb
movzbl %bpl, %r13d
movq 0x10(%rbx), %rbp
movq 0x8(%rbx), %rax
subq %rax, %rbp
je 0x2e45b
movl $0x0, (%rbx)
movq (%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
movq %r12, %rdx
movl %r13d, %r8d
callq 0x2f3f2
cmpq $0x0, 0x10(%r15)
je 0x2e490
sarq $0x4, %rbp
movq %r15, %rdi
movq %rbx, %rsi
movq %rbp, %rdx
movq %r14, %rcx
movl 0x4(%rsp), %r8d
callq 0x2f480
addq $0x10, %r12
cmpq 0x18(%rsp), %r12
jne 0x2e448
jmp 0x2e4cb
movq (%r14), %rcx
movzbl %bpl, %r8d
movq %r15, %rdi
movq %rbx, %rsi
callq 0x2f3f2
cmpq $0x0, 0x10(%r15)
je 0x2e4cb
movq %r15, %rdi
movq %rbx, %rsi
xorl %edx, %edx
movq %r14, %rcx
movl 0x4(%rsp), %r8d
callq 0x2f480
cmpl $0x0, (%rbx)
jne 0x2e4d8
movq %rbx, %rdi
callq 0x2dfc4
movq %rbx, %rax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq