zzh
/
minimap2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed a stupid bug

This commit is contained in:
Heng Li 2017-06-06 15:45:42 -04:00
parent a2958a4836
commit e6adb673f9
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
chain.c
View File

@ -21,7 +21,7 @@ static inline int ilog2_32(uint32_t v)
int mm_chain_dp(int max_dist, int bw, int max_skip, int min_sc, int n, mm128_t *a, uint64_t **_u, void *km)
{
int32_t st = 0, i, j, k, *p, *f, *t, *v, n_u, n_v;
int32_t st = 0, i, j, k, *f, *p, *t, *v, n_u, n_v;
uint64_t *u;
mm128_t *b;
@ -71,7 +71,7 @@ int mm_chain_dp(int max_dist, int bw, int max_skip, int min_sc, int n, mm128_t *
radix_sort_64(u, u + n_u);
for (i = 0; i < n_u>>1; ++i) { // reverse, s.t. the highest scoring chain is the first
uint64_t t = u[i];
u[i] = u[n_u - 1], u[n_u - 1] = t;
u[i] = u[n_u - i - 1], u[n_u - i - 1] = t;
}
// backtrack
@ -105,6 +105,6 @@ int mm_chain_dp(int max_dist, int bw, int max_skip, int min_sc, int n, mm128_t *
for (j = 0; j < (int32_t)u[i]; ++j)
b[k] = a[v[k]], ++k;
memcpy(a, b, n_v * sizeof(mm128_t));
kfree(km, b);
kfree(km, v); kfree(km, b);
return n_u;
}

2
map.c
View File

@ -231,7 +231,7 @@ void mm_map_frag(const mm_mapopt_t *opt, const mm_idx_t *mi, mm_tbuf_t *b, uint3
printf("%s\t%d", qname, n_u);
for (i = j = 0; i < n_u; ++i) {
int n = (uint32_t)u[i];
printf("\t%d@%s:%d-%d", (uint32_t)(u[i]>>32), mi->seq[a[j].x<<1>>33].name, (uint32_t)a[j].x, (uint32_t)a[j+n-1].x);
printf("\t%d/%d@%s:%d-%d", (uint32_t)(u[i]>>32), n, mi->seq[a[j].x<<1>>33].name, (uint32_t)a[j].x, (uint32_t)a[j+n-1].x);
j += n;
}
printf("\n");