// File: /workspace/github_cpp_makefile_star2_O1/chhylp123[P]hifiasm/Overlaps.cpp
// Function: get_no_coverage_reads_chain_simple(ma_hit_t*, ma_hit_t_alloc*, ma_hit_t_alloc*, ma_sub_t*, R_to_U*, ma_ug_t*, asg_t*, int, int, unsigned int, unsigned int, kvec_t_u32_warp*, kvec_asg_arc_t_warp*, unsigned int*, unsigned int*, unsigned int*, unsigned int)
int get_no_coverage_reads_chain_simple(ma_hit_t *h, ma_hit_t_alloc* sources, 
ma_hit_t_alloc* reverse_sources, ma_sub_t *coverage_cut, R_to_U* ruIndex, ma_ug_t *ug, 
asg_t *r_g, int max_hang, int min_ovlp, uint32_t endRid, uint32_t uId, 
kvec_t_u32_warp* chain_buffer, kvec_asg_arc_t_warp* chain_edges, uint32_t* return_ava_cur, 
uint32_t* return_ava_ol, uint32_t* return_chainLen, uint32_t thresLen)
{
    (*return_chainLen) = (*return_ava_cur) = (*return_ava_ol) = (uint32_t)-1;
    uint32_t init_contain_uId = (uint32_t)-1, contain_uId, is_Unitig;
    uint32_t chainLen = 0, ava_cur, test_oLen;
    int ql, tl;
    int32_t r;
    ma_sub_t *sq = NULL;
    ma_sub_t *st = NULL;
    asg_arc_t t;
    asg_t* nsg = ug->g;
    chain_buffer->a.n = 0;
    kv_push(uint32_t, chain_buffer->a, uId);
    if(chain_edges) chain_edges->a.n = 0;

    if(!h) return 0;
    sq = &(coverage_cut[Get_qn(*h)]);
    st = &(coverage_cut[Get_tn(*h)]);
    ///sq and st cannot be deleted
    ///for h, deleted or not does not matter
    if(sq->del || st->del) return 0;
    if(r_g->seq[Get_qn(*h)].del || r_g->seq[Get_tn(*h)].del) return 0;
    get_R_to_U(ruIndex, Get_tn(*h), &contain_uId, &is_Unitig);
    if(contain_uId == (uint32_t)-1 || is_Unitig != 1) return 0;
    if(nsg->seq[contain_uId].del) return 0;
    ql = sq->e - sq->s; tl = st->e - st->s;
    r = ma_hit2arc(h, ql, tl, max_hang, asm_opt.max_hang_rate, min_ovlp, &t);
    if(r < 0) return 0;
    if((t.ul>>32) != endRid) return 0;
    if(chain_edges) kv_push(asg_arc_t, chain_edges->a, t);
    chainLen++;
    kv_push(uint32_t, chain_buffer->a, contain_uId);
    ava_cur = get_num_edges2existing_nodes_advance(ug, r_g, reverse_sources, coverage_cut, 
            ruIndex, max_hang, min_ovlp, t.v, &test_oLen, chain_buffer->a.a, chain_buffer->a.n, 1);
    //means find an aim
    if(ava_cur > 0)
    {
        (*return_ava_cur) = ava_cur;
        (*return_ava_ol) = test_oLen;
        (*return_chainLen) = chainLen;
        h = NULL;
        return 1;
    }
    else
    {
        return 0;
    }
    

    ///continue
    ///need to update h, endRid, chainLen, chain_buffer and chain_edges
    while (h)
    {
        sq = &(coverage_cut[Get_qn(*h)]);
        st = &(coverage_cut[Get_tn(*h)]);

        ///sq, st, and h cannot be deleted
        if(sq->del || st->del || h->del) break;
        if(r_g->seq[Get_qn(*h)].del || r_g->seq[Get_tn(*h)].del) break;

        get_R_to_U(ruIndex, Get_tn(*h), &contain_uId, &is_Unitig);
        if(contain_uId == (uint32_t)-1 || is_Unitig != 1) break;
        if(nsg->seq[contain_uId].del) break;
        ///contain_uId must be a unitig

        if(init_contain_uId != (uint32_t)-1)
        {
            init_contain_uId = contain_uId;
        }
        else
        {
            if(init_contain_uId != contain_uId) break;
        }
         

        ql = sq->e - sq->s; tl = st->e - st->s;
        r = ma_hit2arc(h, ql, tl, max_hang, asm_opt.max_hang_rate, min_ovlp, &t);

        ///if st is contained in sq, or vice verse, skip
        if(r < 0) break;

        ///if sq and v are not in the same direction, skip
        ///endRid is (t.ul>>32), and t.v is a contained read
        if((t.ul>>32) != endRid) break;

        if(chain_edges) kv_push(asg_arc_t, chain_edges->a, t);
        chainLen++;
        kv_push(uint32_t, chain_buffer->a, contain_uId);
        ///endRid is (t.ul>>32), and t.v is a contained read
        ///find edges from t.v to existing unitigs
        ava_cur = get_num_edges2existing_nodes_advance(ug, r_g, reverse_sources, coverage_cut, 
            ruIndex, max_hang, min_ovlp, t.v, &test_oLen, chain_buffer->a.a, chain_buffer->a.n, 1);
        //means find an aim
        if(ava_cur > 0)
        {
            /**
            //do nothing if the chainLen == 1
            if(chainLen > 1)
            {
                asg_arc_t t_max;
                ma_hit_t_alloc* x = &(sources[(endRid>>1)]);
                uint32_t ava_ol_max = 0, ava_max = 0, k;
                for (k = 0; k < x->length; k++)
                {
                    h = &(x->buffer[k]);
                    sq = &(coverage_cut[Get_qn(*h)]);
                    st = &(coverage_cut[Get_tn(*h)]);
                    trio_flag = R_INF.trio_flag[Get_qn(*h)];

                    ///don't want to edges between different haps
                    non_trio_flag = (uint32_t)-1;
                    if(trio_flag == FATHER) non_trio_flag = MOTHER;
                    if(trio_flag == MOTHER) non_trio_flag = FATHER;
                    if(R_INF.trio_flag[Get_tn(*h)] == non_trio_flag) continue;
                    
                    ///just need deleted edges
                    ///sq might be deleted or not
                    if(!st->del) continue;
                    if(!h->del) continue;

                    ///tn must be contained in another existing read
                    get_R_to_U(ruIndex, Get_tn(*h), &contain_rId, &is_Unitig);
                    if(contain_rId == (uint32_t)-1 || is_Unitig == 1) continue;
                    if(r_g->seq[contain_rId].del) continue;

                    get_R_to_U(ruIndex, contain_rId, &contain_uId, &is_Unitig);
                    if(contain_uId == (uint32_t)-1 || is_Unitig != 1) continue;
                    if(nsg->seq[contain_uId].del) continue;
                    ///contain_uId must be a unitig

                    ql = sq->e - sq->s; tl = st->e - st->s;
                    r = ma_hit2arc(h, ql, tl, max_hang, asm_opt.max_hang_rate, min_ovlp, &t);

                    ///if st is contained in sq, or vice verse, skip
                    if(r < 0) continue;

                    ///if sq and v are not in the same direction, skip
                    if((t.ul>>32) != endRid) continue;

                    ///pop the last contain_uId
                    chain_buffer->a.n--;
                    kv_push(uint32_t, chain_buffer->a, contain_uId);

                    ///note: t.v is a contained read
                    ///we need to find existing reads linked with w
                    ava_cur = get_num_edges2existing_nodes_advance(ug, r_g, sources, coverage_cut, ruIndex, 
                    max_hang, min_ovlp, t.v, &test_oLen, chain_buffer->a.a, chain_buffer->a.n, 1);

                    if((ava_cur > ava_max) || (ava_cur == ava_max && test_oLen > ava_ol_max))
                    {
                        ava_max = ava_cur;
                        ava_ol_max = test_oLen;
                        t_max = t;
                    }
                }

                if(ava_max > 0)
                {
                    ava_cur = ava_max;
                    test_oLen = ava_ol_max;
                    if(chain_edges)
                    {
                        //pop the last edge
                        chain_edges->a.n--;
                        kv_push(asg_arc_t, chain_edges->a, t_max);
                    } 
                }
                else
                {
                    break;
                }
            }
            **/

            (*return_ava_cur) = ava_cur;
            (*return_ava_ol) = test_oLen;
            (*return_chainLen) = chainLen;
            h = NULL;
            return 1;
        }

        if(chainLen >= thresLen) break;

        ///endRid is (t.ul>>32), and t.v is a contained read
        ///haven't found a existing unitig from t.v
        ///check if t.v can link to a new contained read
        endRid = t.v; 
        h = get_best_no_coverage_read(ug, r_g, reverse_sources, coverage_cut, ruIndex, 
            max_hang, min_ovlp, endRid, init_contain_uId);
    }

    return 0;    
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %r9, %r12
movq %rcx, %r15
movq %rdi, %rbp
movq 0xb8(%rsp), %rcx
movq 0xb0(%rsp), %rdi
movq 0xa8(%rsp), %rsi
movq 0xa0(%rsp), %r14
movq 0x98(%rsp), %r13
movl 0x90(%rsp), %r10d
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
movl %eax, (%rdi)
movl %eax, (%rsi)
movl %eax, (%rcx)
movq 0x18(%r9), %r9
movq $0x0, (%r13)
cmpq $0x0, 0x8(%r13)
jne 0xfca5b
movq $0x2, 0x8(%r13)
movq 0x10(%r13), %rdi
movl $0x8, %esi
movq %r15, %r14
movq %r12, %r15
movq %r8, %r12
movq %rdx, %r13
movq %r9, %rbx
callq 0x2370
movl 0x90(%rsp), %r10d
movq %rbx, %r9
movq %r13, %rdx
movq 0x98(%rsp), %r13
movq %r12, %r8
movq %r15, %r12
movq %r14, %r15
movq 0xa0(%rsp), %r14
movq %rax, 0x10(%r13)
movq (%r13), %rax
movq 0x10(%r13), %rcx
leaq 0x1(%rax), %rsi
movq %rsi, (%r13)
movl %r10d, (%rcx,%rax,4)
testq %r14, %r14
je 0xfca7b
movq $0x0, (%r14)
xorl %ecx, %ecx
testq %rbp, %rbp
je 0xfccb5
movq (%rbp), %rsi
shrq $0x20, %rsi
leaq (%rsi,%rsi,2), %rbx
movl (%r15,%rbx,4), %eax
testl %eax, %eax
js 0xfccb5
movl 0xc(%rbp), %r10d
leaq (%r10,%r10,2), %rdi
leaq (%r15,%rdi,4), %r11
movl (%r11), %edi
testl %edi, %edi
js 0xfccb5
movq %r9, 0x8(%rsp)
movq 0x70(%rsp), %r9
movq 0x20(%r9), %r9
cmpl $0x0, (%r9,%rsi,8)
js 0xfccb5
cmpl $0x0, (%r9,%r10,8)
js 0xfccb5
movb $0x1, %sil
cmpq %r10, (%r8)
jbe 0xfcb08
movq 0x8(%r8), %r9
movl (%r9,%r10,4), %r9d
cmpl $-0x1, %r9d
movl $0xffffffff, %r10d      # imm = 0xFFFFFFFF
je 0xfcb0e
movl %r9d, %r10d
andl $0x7fffffff, %r10d      # imm = 0x7FFFFFFF
testl %r9d, %r9d
setns %sil
jmp 0xfcb0e
movl $0xffffffff, %r10d      # imm = 0xFFFFFFFF
cmpl $-0x1, %r10d
sete %r9b
orb %sil, %r9b
jne 0xfccb5
movq 0x8(%rsp), %rsi
movq 0x20(%rsi), %rsi
movl %r10d, %r9d
cmpl $0x0, (%rsi,%r9,8)
js 0xfccb5
movl %r10d, 0x10(%rsp)
movq %rdx, 0x18(%rsp)
movq %r8, 0x8(%rsp)
movl 0x80(%rsp), %r8d
movl 0x78(%rsp), %ecx
leaq (%r15,%rbx,4), %rdx
movl 0x4(%rdx), %esi
subl %eax, %esi
movl 0x4(%r11), %edx
subl %edi, %edx
leaq 0x18dbf1(%rip), %rax    # 0x28a758
movss 0x158(%rax), %xmm0
leaq 0x20(%rsp), %r9
movq %rbp, %rdi
callq 0xa159b
testl %eax, %eax
js 0xfccb3
movl 0x88(%rsp), %eax
cmpl %eax, 0x24(%rsp)
movl $0x0, %ecx
jne 0xfccb5
testq %r14, %r14
je 0xfcbf6
movq 0x8(%r14), %rax
cmpq %rax, (%r14)
jne 0xfcbd1
leaq (%rax,%rax), %rcx
testq %rax, %rax
movl $0x2, %eax
cmovneq %rcx, %rax
movq %rax, 0x8(%r14)
movq 0x10(%r14), %rdi
shlq $0x3, %rax
leaq (%rax,%rax,2), %rsi
callq 0x2370
movq %rax, 0x10(%r14)
movq (%r14), %rax
movq 0x10(%r14), %rcx
leaq 0x1(%rax), %rdx
movq %rdx, (%r14)
leaq (%rax,%rax,2), %rax
movq 0x30(%rsp), %rdx
movq %rdx, 0x10(%rcx,%rax,8)
movups 0x20(%rsp), %xmm0
movups %xmm0, (%rcx,%rax,8)
movq %r12, %rbp
movq 0x8(%r13), %rax
cmpq %rax, (%r13)
jne 0xfcc28
leaq (%rax,%rax), %rcx
testq %rax, %rax
movl $0x2, %esi
cmovneq %rcx, %rsi
movq %rsi, 0x8(%r13)
movq 0x10(%r13), %rdi
shlq $0x2, %rsi
callq 0x2370
movq %rax, 0x10(%r13)
movq (%r13), %rax
movq 0x10(%r13), %r10
leaq 0x1(%rax), %r11
movq %r11, (%r13)
movl 0x10(%rsp), %ecx
movl %ecx, (%r10,%rax,4)
movl 0x28(%rsp), %eax
leaq 0x14(%rsp), %r12
movq %rbp, %rdi
movq 0x70(%rsp), %rsi
movq 0x18(%rsp), %rdx
movq %r15, %rcx
movq 0x8(%rsp), %r8
movl 0x78(%rsp), %r9d
pushq $0x1
pushq %r11
pushq %r10
pushq %r12
pushq %rax
movl 0xa8(%rsp), %eax
pushq %rax
callq 0x102777
addq $0x30, %rsp
testl %eax, %eax
movl $0x0, %ecx
je 0xfccb5
movq 0xa8(%rsp), %rcx
movl %eax, (%rcx)
movl 0x14(%rsp), %eax
movq 0xb0(%rsp), %rcx
movl %eax, (%rcx)
movq 0xb8(%rsp), %rax
movl $0x1, (%rax)
movl $0x1, %ecx
jmp 0xfccb5
xorl %ecx, %ecx
movl %ecx, %eax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq